Co-occurring keywords · papers mentioning both
Papers
Clustering above Exponential Families with Tempered Exponential Measures
AISTATS 2023
Convergent Bregman Plug-and-Play Image Restoration for Poisson Inverse Problems
NeurIPS 2023
Efficient Document Embeddings via Self-Contrastive Bregman Divergence Learning
ACL 2023
Exact recovery and Bregman hard clustering of node-attributed Stochastic Block Model
NeurIPS 2023
Mediated Uncoupled Learning and Validation with Bregman Divergences: Loss Family with Maximal Generality
AISTATS 2023
Monge, Bregman and Occam: Interpretable Optimal Transport in High-Dimensions with Feature-Sparse Maps
ICML 2023
Neural Bregman Divergences for Distance Learning
ICLR 2023
PRIOR: Personalized Prior for Reactivating the Information Overlooked in Federated Learning.
NeurIPS 2023
Semi-Dual Unbalanced Quadratic Optimal Transport: fast statistical rates and convergent algorithm.
ICML 2023
Stochastic Methods for AUC Optimization subject to AUC-based Fairness Constraints
AISTATS 2023
A Dimensionality Reduction Method for Finding Least Favorable Priors with a Focus on Bregman Divergence
AISTATS 2022
Bregman Gradient Policy Optimization
ICLR 2022
Bregman Power k-Means for Clustering Exponential Family Data
ICML 2022
Bregman Proximal Langevin Monte Carlo via Bregman-Moreau Envelopes
ICML 2022
Faster Algorithms for Learning Convex Functions
ICML 2022
Gradient Based Clustering
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
Adaptive First-Order Methods Revisited: Convex Minimization without Lipschitz Requirements
NeurIPS 2021
Explicit Regularization of Stochastic Gradient Methods through Duality
AISTATS 2021
Non-Negative Bregman Divergence Minimization for Deep Direct Density Ratio Estimation
ICML 2021
Parameter-Free Multi-Armed Bandit Algorithms with Hybrid Data-Dependent Regret Bounds
COLT 2021
Structure learning in polynomial time: Greedy algorithms, Bregman information, and exponential families
NeurIPS 2021
The Last-Iterate Convergence Rate of Optimistic Mirror Descent in Stochastic Variational Inequalities
COLT 2021