Skip to content
conftrace_

Mathematics & Optimization

19,283 papers (0 classified directly here)

1
24
182
599
1,739
1,785
2000
'5
'10
'15
'20
'25

Papers (including subtopics)

Adaptive Risk Sensitive Model Predictive Control with Stochastic Search L4DC 2021 Adaptive Sampling for Estimating Distributions: A Bayesian Upper Confidence Bound Approach L4DC 2021 Adaptive Sampling for Fast Constrained Maximization of Submodular Functions AISTATS 2021 Adaptivity in Adaptive Submodularity COLT 2021 A Data Driven, Convex Optimization Approach to Learning Koopman Operators L4DC 2021 Additive Error Guarantees for Weighted Low Rank Approximation ICML 2021 A Deflation Based Fast and Robust Preconditioner for Bundle Adjustment WACV 2021 A Deterministic Streaming Sketch for Ridge Regression AISTATS 2021 A Dimension-free Computational Upper-bound for Smooth Optimal Transport Estimation COLT 2021 A Distributed Method for Fitting Laplacian Regularized Stratified Models JMLR 2021 ADOM: Accelerated Decentralized Optimization Method for Time-Varying Networks ICML 2021 A Domain-Shrinking based Bayesian Optimization Algorithm with Order-Optimal Regret Performance NeurIPS 2021 Adversarial Combinatorial Bandits with General Non-linear Reward Functions ICML 2021 Adversarial Dueling Bandits ICML 2021 Adversarial Linear Contextual Bandits with Graph-Structured Side Observations AAAI 2021 Adversarially robust learning for security-constrained optimal power flow NeurIPS 2021 Adversarial Online Learning with Changing Action Sets: Efficient Algorithms with Approximate Regret Bounds ALT 2021 Adversarial Regularization as Stackelberg Game: An Unrolled Optimization Approach EMNLP 2021 Adversarial Robustness of Streaming Algorithms through Importance Sampling NeurIPS 2021 Adversarial Training Reduces Information and Improves Transferability AAAI 2021 A Faster Decentralized Algorithm for Nonconvex Minimax Problems NeurIPS 2021 A Faster Maximum Cardinality Matching Algorithm with Applications in Machine Learning NeurIPS 2021 A Fast Exact Algorithm for the Resource Constrained Shortest Path Problem AAAI 2021 A Fast Globally Linearly Convergent Algorithm for the Computation of Wasserstein Barycenters JMLR 2021 A Few Queries Go a Long Way: Information-Distortion Tradeoffs in Matching AAAI 2021