conftrace_
← Optimization & Theory
Machine Learning › Optimization & Theory ›

Theory

4,955 papers

Papers per year

1
4
37
72
447
426
'00
'05
'10
'15
'20
'25

Papers

Conformalized Unconditional Quantile Regression AISTATS 2023
Performative Prediction with Neural Networks AISTATS 2023
Approximate Regions of Attraction in Learning with Decision-Dependent Distributions AISTATS 2023
Breaking a Classical Barrier for Classifying Arbitrary Test Examples in the Quantum Model AISTATS 2023
Reconstructing Ultrametric Trees from Noisy Experiments ALT 2023
SQ Lower Bounds for Random Sparse Planted Vector Problem ALT 2023
On The Computational Complexity of Self-Attention ALT 2023
Convergence of score-based generative modeling for general data distributions ALT 2023
Algorithmic Stability of Heavy-Tailed Stochastic Gradient Descent on Least Squares ALT 2023
Implicit Regularization Towards Rank Minimization in ReLU Networks ALT 2023
An Algorithm and Complexity Results for Causal Unit Selection CLEAR 2023
On the Interventional Kullback-Leibler Divergence CLEAR 2023
Evaluating Temporal Observation-Based Causal Discovery Techniques Applied to Road Driver Behaviour CLEAR 2023
Non-parametric identifiability and sensitivity analysis of synthetic control models CLEAR 2023
Find a witness or shatter: the landscape of computable PAC learning. COLT 2023
Optimal Prediction Using Expert Advice and Randomized Littlestone Dimension COLT 2023
Weak Recovery Threshold for the Hypergraph Stochastic Block Model COLT 2023
Exponential Hardness of Reinforcement Learning with Linear Function Approximation COLT 2023
Quantum Channel Certification with Incoherent Measurements COLT 2023
Hardness of Agnostically Learning Halfspaces from Worst-Case Lattice Problems COLT 2023
Intrinsic dimensionality and generalization properties of the R-norm inductive bias COLT 2023
Tight Guarantees for Interactive Decision Making with the Decision-Estimation Coefficient COLT 2023
Precise Asymptotic Analysis of Deep Random Feature Models COLT 2023
Sharp analysis of EM for learning mixtures of pairwise differences COLT 2023
Quadratic Memory is Necessary for Optimal Query Complexity in Convex Optimization: Center-of-Mass is Pareto-Optimal COLT 2023