conftrace_

bregman divergence

81 papers

Explore in graph

Co-occurring keywords

exponential family (124) mirror descent (148) convex optimization (1321) clustering algorithm (206) convergence rate (607) k-means clustering (235) loss function (462) cross-entropy loss (151) density ratio estimation (48) proper scoring rule (24)

Papers

Bregman Power k-Means for Clustering Exponential Family Data ICML 2022
Interval-censored Hawkes processes JMLR 2022
LocoProp: Enhancing BackProp via Local Loss Optimization AISTATS 2022
Reconstructing Test Labels from Noisy Loss Functions AISTATS 2022
Non-Negative Bregman Divergence Minimization for Deep Direct Density Ratio Estimation ICML 2021
The Last-Iterate Convergence Rate of Optimistic Mirror Descent in Stochastic Variational Inequalities COLT 2021
Unified Interpretation of Softmax Cross-Entropy and Negative Sampling: With Case Study for Knowledge Graph Embedding ACL 2021
Unified Interpretation of Softmax Cross-Entropy and Negative Sampling: With Case Study for Knowledge Graph Embedding IJCNLP 2021
Adaptive First-Order Methods Revisited: Convex Minimization without Lipschitz Requirements NIPS 2021
Explicit Regularization of Stochastic Gradient Methods through Duality AISTATS 2021
Structure learning in polynomial time: Greedy algorithms, Bregman information, and exponential families NIPS 2021
Learning to Approximate a Bregman Divergence NIPS 2020
Deep Divergence Learning ICML 2020
Measuring the Discrepancy between Conditional Distributions: Methods, Properties and Applications IJCAI 2020
Supervised learning: no loss no cry ICML 2020
Linear Convergence of Randomized Primal-Dual Coordinate Method for Large-scale Linear Constrained Convex Programming ICML 2020
A Unified Statistically Efficient Estimation Framework for Unnormalized Models AISTATS 2020
Memoryless Sequences for General Losses JMLR 2020
Federated Patient Hashing AAAI 2020
Dual-Free Stochastic Decentralized Optimization with Variance Reduction NIPS 2020
On the consistency of top-k surrogate losses ICML 2020
Beyond Online Balanced Descent: An Optimal Algorithm for Smoothed Online Optimization NIPS 2019
An adaptive Mirror-Prox method for variational inequalities with singular operators NIPS 2019
Robust Bi-Tempered Logistic Loss Based on Bregman Divergences NIPS 2019
Divergence-Augmented Policy Optimization NIPS 2019