conftrace_
← Mathematics & Optimization
Mathematics & Optimization ›

Optimization

12,959 papers (55 classified directly here)

Subtopics

Continuous Optimization (3,907) Stochastic Methods (2,788) Combinatorial Optimization (2,409) Online Algorithms (2,192) Optimization (1,207) Game Theory (944) Discrete Optimization (705) Convex Optimization (591) Optimal Transport (369) Sparse Optimization (347) Optimal Control (225) Global Optimization (190) Distributed Learning (157) Multi-Objective Optimization (125) Approximation Algorithms (110) Bayesian Optimization (100) Distributed Optimization (99) Theory (98) Non-Convex Optimization (76) Kernel Methods (73) Compressed Sensing (72) Robust Optimization (70) Evolutionary Algorithm (58) Linear Programming (43) Algorithms (10) Algorithm (10) Integer Programming (9) Submodular Optimization (9) Matrix Completion (8) Bilevel Optimization (8) Tensor Decomposition (6) Regularization (5)

Papers per year

1
15
119
411
1322
644
'00
'05
'10
'15
'20
'25

Papers (including subtopics)

Exploring Algorithmic Fairness in Robust Graph Covering Problems NIPS 2019
Reducing the variance in online optimization by transporting past gradients NIPS 2019
Batched Multi-armed Bandits Problem NIPS 2019
Efficient Smooth Non-Convex Stochastic Compositional Optimization via Stochastic Recursive Gradient Descent NIPS 2019
Multi-Criteria Dimensionality Reduction with Applications to Fairness NIPS 2019
Turbo Autoencoder: Deep learning based channel codes for point-to-point communication channels NIPS 2019
Escaping from saddle points on Riemannian manifolds NIPS 2019
Weighted Linear Bandits for Non-Stationary Environments NIPS 2019
Stochastic Variance Reduced Primal Dual Algorithms for Empirical Composition Optimization NIPS 2019
Teaching Multiple Concepts to a Forgetful Learner NIPS 2019
Combinatorial Bayesian Optimization using the Graph Cartesian Product NIPS 2019
Sample Adaptive MCMC NIPS 2019
Tree-Sliced Variants of Wasserstein Distances NIPS 2019
Online sampling from log-concave distributions NIPS 2019
Practical Two-Step Lookahead Bayesian Optimization NIPS 2019
Regret Bounds for Thompson Sampling in Episodic Restless Bandit Problems NIPS 2019
Adaptive Sequence Submodularity NIPS 2019
The Step Decay Schedule: A Near Optimal, Geometrically Decaying Learning Rate Procedure For Least Squares NIPS 2019
Learning to Screen NIPS 2019
iSplit LBI: Individualized Partial Ranking with Ties via Split LBI NIPS 2019
Optimal Pricing in Repeated Posted-Price Auctions with Different Patience of the Seller and the Buyer NIPS 2019
Fast and Furious Learning in Zero-Sum Games: Vanishing Regret with Non-Vanishing Step Sizes NIPS 2019
An Algorithmic Framework For Differentially Private Data Analysis on Trusted Processors NIPS 2019
Singleshot : a scalable Tucker tensor decomposition NIPS 2019
Secretary Ranking with Minimal Inversions NIPS 2019