conftrace_

Optimization & Theory

36,874 papers (3 classified directly here)

Subtopics

Optimization (14,983) Bayesian Inference (5,566) Learning Theory (5,334) Theory (4,955) Statistical Learning (4,117) Neural Network Optimization (3,649) Stochastic Processes (2,667) Loss Functions (1,162) Distributed Learning (1,135) Stochastic Methods (1,118) Online Algorithms (806) Statistics (684) Information Theory (318) Generalization (220) Sparse Optimization (158) Sample Complexity (99) Game Theory (30) Robust Optimization (17) Optimal Transport (14) Approximation Algorithms (10) Distributed Optimization (8) Convex Optimization (8)

Papers per year

1
52
337
806
3400
3289
'00
'05
'10
'15
'20
'25

Papers (including subtopics)

Recovery Guarantees For Quadratic Tensors With Sparse Observations AISTATS 2019
Sample Efficient Graph-Based Optimization with Noisy Observations AISTATS 2019
Robustness Guarantees for Density Clustering AISTATS 2019
Fixing Mini-batch Sequences with Hierarchical Robust Partitioning AISTATS 2019
Efficient Bayes Risk Estimation for Cost-Sensitive Classification AISTATS 2019
Interpreting Black Box Predictions using Fisher Kernels AISTATS 2019
ABCD-Strategy: Budgeted Experimental Design for Targeted Causal Structure Discovery AISTATS 2019
Batched Stochastic Bayesian Optimization via Combinatorial Constraints Design AISTATS 2019
Convergence of Gradient Descent on Separable Data AISTATS 2019
Adaptive Minimax Regret against Smooth Logarithmic Losses over High-Dimensional l1-Balls via Envelope Complexity AISTATS 2019
Evaluating model calibration in classification AISTATS 2019
On Learning Graphs with Edge-Detecting Queries ALT 2019
An Exponential Efron-Stein Inequality for $L_q$ Stable Learning Rules ALT 2019
Improved Generalization Bounds for Robust Learning ALT 2019
A simple parameter-free and adaptive approach to optimization under a minimal local smoothness assumption ALT 2019
Adaptive Exact Learning of Decision Trees from Membership Queries ALT 2019
Dynamic Pricing with Finitely Many Unknown Valuations ALT 2019
Online Non-Additive Path Learning under Full and Partial Information ALT 2019
Two-Player Games for Efficient Non-Convex Constrained Optimization ALT 2019
Hardness of Improper One-Sided Learning of Conjunctions For All Uniformly Falsifiable CSPs ALT 2019
Limit Learning Equivalence Structures ALT 2019
Uniform regret bounds over $\mathbb{R}^d$ for the sequential linear regression problem with the square loss ALT 2019
A tight excess risk bound via a unified PAC-Bayesian–Rademacher–Shtarkov–MDL complexity ALT 2019
Sample Compression for Real-Valued Learners ALT 2019
A Sharp Lower Bound for Agnostic Learning with Sample Compression Schemes ALT 2019