convex program

Distributionally Robust Regret Optimal Control Under Moment-Based Ambiguity Sets L4DC 2026 On the Convergence of Tâtonnement for Linear Fisher Markets AAAI 2025 Delegating Data Collection in Decentralized Machine Learning AISTATS 2024 Distill n’ Explain: explaining graph neural networks using simple surrogates AISTATS 2023 Fast and Interpretable Dynamics for Fisher Markets via Block-Coordinate Updates AAAI 2023 Graph Reinforcement Learning for Network Control via Bi-Level Optimization ICML 2023 Optimal Sets and Solution Paths of ReLU Networks ICML 2023 Maximum Entropy Distributions: Bit Complexity and Stability COLT 2019 Solving Non-smooth Constrained Programs with Lower Complexity than O(1/ε): A Primal-Dual Homotopy Smoothing Approach NeurIPS 2018 Wasserstein Distributionally Robust Kalman Filtering NeurIPS 2018 Agnostic Estimation for Misspecified Phase Retrieval Models NeurIPS 2016 Dense Monocular Depth Estimation in Complex Dynamic Scenes CVPR 2016 Efficient Compressive Phase Retrieval with Constrained Sensing Vectors NeurIPS 2015 Robust PCA with compressed data NeurIPS 2015 Learning with Invariance via Linear Functionals on Reproducing Kernel Hilbert Space NeurIPS 2013 Linearized Alternating Direction Method with Parallel Splitting and Adaptive Penalty for Separable Convex Programs in Machine Learning ACML 2013 Exact and Stable Recovery of Sequences of Signals with Sparse Increments via Differential _1-Minimization NeurIPS 2012 A Constraint Generation Approach to Learning Stable Linear Dynamical Systems NeurIPS 2007