Skip to content
conftrace_

Optimization & Theory

43,292 papers (3 classified directly here)

Subtopics · a paper can sit in several, so these overlap

Optimization (17,731) Learning Theory (6,809) Bayesian Inference (6,267) Theory (5,579) Statistical Learning (4,564) Neural Network Optimization (4,155) Stochastic Processes (2,948) Stochastic Methods (1,283) Loss Functions (1,220) Distributed Learning (1,202) Online Algorithms (1,013) Statistics (822) Generalization (376) Information Theory (370) Sample Complexity (282) Sparse Optimization (241) Game Theory (151) Convex Optimization (132) Optimal Transport (104) Robust Optimization (84) Distributed Optimization (73) Approximation Algorithms (33)

Papers per year

1
52
352
828
3,646
5,854
2000
'5
'10
'15
'20
'25

Papers (including subtopics)

Fairness in Matching under Uncertainty ICML 2023 Fair, Polylog-Approximate Low-Cost Hierarchical Clustering NeurIPS 2023 Fair Survival Time Prediction via Mutual Information Minimization MLHC 2023 Faith and Fate: Limits of Transformers on Compositionality NeurIPS 2023 Faithful Heteroscedastic Regression with Neural Networks AISTATS 2023 Faithful Model Evaluation for Model-Based Metrics EMNLP 2023 Faithfulness-Aware Decoding Strategies for Abstractive Summarization EACL 2023 Faithfulness Tests for Natural Language Explanations ACL 2023 False Discovery Proportion control for aggregated Knockoffs NeurIPS 2023 Falsification of Internal and External Validity in Observational Studies via Conditional Moment Restrictions AISTATS 2023 FAMO: Fast Adaptive Multitask Optimization NeurIPS 2023 Fantastic Robustness Measures: The Secrets of Robust Generalization NeurIPS 2023 Fantastic Style Channels and Where To Find Them: A Submodular Framework for Discovering Diverse Directions in GANs WACV 2023 Farewell to Aimless Large-scale Pretraining: Influential Subset Selection for Language Model ACL 2023 Farsighted Probabilistic Sampling: A General Strategy for Boosting Local Search MaxSAT Solvers AAAI 2023 Fascinating Supervisory Signals and Where to Find Them: Deep Anomaly Detection with Scale Learning ICML 2023 Fast (1+ε)-Approximation Algorithms for Binary Matrix Factorization ICML 2023 Fast Adversarial Training with Smooth Convergence ICCV 2023 Fast Algorithms for a New Relaxation of Optimal Transport COLT 2023 Fast Algorithms for Distributed k-Clustering with Outliers ICML 2023 FastAMI – a Monte Carlo Approach to the Adjustment for Chance in Clustering Comparison Metrics AAAI 2023 Fast and Accurate Transferability Measurement by Evaluating Intra-class Feature Variance ICCV 2023 Fast and Robust Early-Exiting Framework for Autoregressive Language Models with Synchronized Parallel Decoding EMNLP 2023 Fast and scalable score-based kernel calibration tests UAI 2023 Fast, Approximate Vector Queries on Very Large Unstructured Datasets NSDI 2023