Skip to content
conftrace_

Optimization

1,521 papers

1
8
46
122
149
'5
'10
'15
'20
'25

Papers

Correspondence-Free Material Reconstruction using Sparse Surface Constraints CVPR 2020 Costly Zero Order Oracles COLT 2020 Counterfactual Programming for Optimal Control L4DC 2020 Data-driven distributionally robust LQR with multiplicative noise L4DC 2020 Deep Neural Network Approximated Dynamic Programming for Combinatorial Optimization AAAI 2020 Deep Statistical Solvers NeurIPS 2020 Defending with Shared Resources on a Network AAAI 2020 Direct Data-Driven Control with Embedded Anti-Windup Compensation L4DC 2020 Distributionally Ambiguous Optimization for Batch Bayesian Optimization JMLR 2020 Efficient Algorithms for Learning Revenue-Maximizing Two-Part Tariffs IJCAI 2020 Efficiently Solving MDPs with Stochastic Mirror Descent ICML 2020 Efficient Proximal Mapping of the 1-path-norm of Shallow Networks ICML 2020 Efficient Rollout Strategies for Bayesian Optimization UAI 2020 Envelope-Based Approaches to Real-Time Heuristic Search AAAI 2020 Error Estimation for Sketched SVD via the Bootstrap ICML 2020 Estimating Reachable Sets with Scenario Optimization L4DC 2020 Explicit Gradient Learning for Black-Box Optimization ICML 2020 Exploiting Model Sparsity in Adaptive MPC: A Compressed Sensing Viewpoint L4DC 2020 Explore Aggressively, Update Conservatively: Stochastic Extragradient Methods with Variable Stepsize Scaling NeurIPS 2020 Faster saddle-point optimization for solving large-scale Markov decision processes L4DC 2020 First-Order Methods for Large-Scale Market Equilibrium Computation NeurIPS 2020 Fitting a Linear Control Policy to Demonstrations with a Kalman Constraint L4DC 2020 FourierSAT: A Fourier Expansion-Based Algebraic Framework for Solving Hybrid Boolean Constraints AAAI 2020 From Sets to Multisets: Provable Variational Inference for Probabilistic Integer Submodular Models ICML 2020 Gain with no Pain: Efficiency of Kernel-PCA by Nyström Sampling AISTATS 2020