Co-occurring keywords · papers mentioning both
Papers
Faster proximal algorithms for matrix optimization using Jacobi-based eigenvalue methods
NeurIPS 2021
Fast margin maximization via dual acceleration
ICML 2021
Fast Stochastic Bregman Gradient Methods: Sharp Analysis and Variance Reduction
ICML 2021
Fenchel-Young Losses with Skewed Entropies for Class-posterior Probability Estimation
AISTATS 2021
From Low Probability to High Confidence in Stochastic Convex Optimization
JMLR 2021
GemBag: Group Estimation of Multiple Bayesian Graphical Models
JMLR 2021
Global Optimality Beyond Two Layers: Training Deep ReLU Networks via Convex Programs
ICML 2021
Greedy and Random Quasi-Newton Methods with Faster Explicit Superlinear Convergence
NeurIPS 2021
Heavy Ball Momentum for Conditional Gradient
NeurIPS 2021
Hilbert Sinkhorn Divergence for Optimal Transport
CVPR 2021
How Data Augmentation affects Optimization for Linear Regression
NeurIPS 2021
Implicit Convex Regularizers of CNN Architectures: Convex Optimization of Two- and Three-Layer Networks in Polynomial Time
ICLR 2021
Improved Analysis for Dynamic Regret of Strongly Convex and Smooth Functions
L4DC 2021
Improved Regret for Zeroth-Order Stochastic Convex Bandits
COLT 2021
Inductive Mutual Information Estimation: A Convex Maximum-Entropy Copula Approach
AISTATS 2021
Infinite-Dimensional Fisher Markets: Equilibrium, Duality and Optimization
AAAI 2021
Information-constrained optimization: can adaptive processing of gradients help?
NeurIPS 2021
Input Convex Neural Networks for Building MPC
L4DC 2021
Iterative regularization for convex regularizers
AISTATS 2021
Kernel Distributionally Robust Optimization: Generalized Duality Theorem and Stochastic Approximation
AISTATS 2021
Learner-Private Convex Optimization
ICML 2021
Learning Maximum Margin Markov Networks from examples with missing labels
ACML 2021
Learning to Learn Graph Topologies
NeurIPS 2021
Learning with semi-definite programming: statistical bounds based on fixed point analysis and excess risk curvature
JMLR 2021
Linear Bandits on Uniformly Convex Sets
JMLR 2021