{"total":41,"rows":[{"id":"2505.22825","title":"PGLearn -- An Open-Source Learning Toolkit for Optimal Power Flow","created":"2025-05-28","cited_by_count":11,"area":null},{"id":"2406.11118","title":"Incentivizing Quality Text Generation via Statistical Contracts","created":"2024-06-17","cited_by_count":10,"area":null},{"id":"2410.06324","title":"Differentiation Through Black-Box Quadratic Programming Solvers","created":"2024-10-08","cited_by_count":10,"area":null},{"id":"2505.01353","title":"Differentiable Nonlinear Model Predictive Control","created":"2025-05-02","cited_by_count":6,"area":null},{"id":"2505.23081","title":"Gradient Methods with Online Scaling Part I. Theoretical Foundations","created":"2025-05-29","cited_by_count":3,"area":null},{"id":"2512.10445","title":"Maximum Risk Minimization with Random Forests","created":"2025-12-11","cited_by_count":3,"area":null},{"id":"2407.16800","title":"Wasserstein Distributionally Robust Shallow Convex Neural Networks","created":"2024-07-23","cited_by_count":2,"area":null},{"id":"2505.17965","title":"Bias-Optimal Bounds for SGD: A Computer-Aided Lyapunov Analysis","created":"2025-05-23","cited_by_count":2,"area":null},{"id":"2510.11227","title":"Enforcing convex constraints in Graph Neural Networks","created":"2025-10-13","cited_by_count":2,"area":null},{"id":"2511.01813","title":"Disciplined Biconvex Programming","created":"2025-11-03","cited_by_count":2,"area":null},{"id":"2603.12850","title":"On Linear Separability of the MNIST Handwritten Digits Dataset","created":"2026-03-13","cited_by_count":2,"area":null},{"id":"2606.13825","title":"Scalable Deep Unfolding of Conic Optimizers","created":"2026-06-11","cited_by_count":2,"area":null},{"id":"2408.05393","title":"fastkqr: A Fast Algorithm for Kernel Quantile Regression","created":"2024-08-10","cited_by_count":1,"area":null},{"id":"2409.09781","title":"RandALO: Out-of-sample risk estimation in no time flat","created":"2024-09-15","cited_by_count":1,"area":null},{"id":"2410.02145","title":"Active Learning of Deep Neural Networks via Gradient-Free Cutting Planes","created":"2024-10-03","cited_by_count":1,"area":null},{"id":"2501.12113","title":"Dual NUP Representations and Min-Maximization in Factor Graphs","created":"2025-01-21","cited_by_count":1,"area":null},{"id":"2502.06067","title":"Smooth Sailing: Lipschitz-Driven Uncertainty Quantification for Spatial Association","created":"2025-02-09","cited_by_count":1,"area":null},{"id":"2502.09502","title":"Scalable First-order Method for Certifying Optimal k-Sparse GLMs","created":"2025-02-13","cited_by_count":1,"area":null},{"id":"2505.22578","title":"Favorability of Loss Landscape with Weight Decay Requires Both Large Overparametrization and Initialization","created":"2025-05-28","cited_by_count":1,"area":null},{"id":"2508.08476","title":"Sparse Partial Optimal Transport via Quadratic Regularization","created":"2025-08-11","cited_by_count":1,"area":null},{"id":"2604.05640","title":"Parametric Nonconvex Optimization via Convex Surrogates","created":"2026-04-07","cited_by_count":1,"area":null},{"id":"2605.24803","title":"Active Learning for Stochastic Contextual Linear Bandits","created":"2026-05-24","cited_by_count":1,"area":null},{"id":"2606.08993","title":"LEAF: A Learning-Enabled ADMM Framework for Accelerated Convex Optimization","created":"2026-06-08","cited_by_count":1,"area":null},{"id":"2610.07796","title":"The Geometry of Empowerment","created":"2026-10-06","cited_by_count":1,"area":null},{"id":"2504.04609","title":"Scalable Approximate Algorithms for Optimal Transport Linear Models","created":"2025-04-06","cited_by_count":0,"area":null},{"id":"2505.03955","title":"Hierarchical Forecast Reconciliation on Networks: A Network Flow Optimization Formulation","created":"2025-05-06","cited_by_count":0,"area":null},{"id":"2507.04176","title":"skfolio: Portfolio Optimization in Python","created":"2025-07-05","cited_by_count":0,"area":null},{"id":"2507.10383","title":"Dynamical stability for dense patterns in attractor neural networks","created":"2025-07-14","cited_by_count":0,"area":null},{"id":"2509.02894","title":"A proximal augmented Lagrangian method for nonconvex optimization with equality and inequality constraints","created":"2025-09-02","cited_by_count":0,"area":null},{"id":"2511.15615","title":"Near-optimal Delta-convex Estimation of Lipschitz Functions","created":"2025-11-19","cited_by_count":0,"area":null},{"id":"2512.08371","title":"A Multivariate Bernoulli-Based Sampling Method for Multi-Label Data with Application to Meta-Research","created":"2025-12-09","cited_by_count":0,"area":null},{"id":"2512.20682","title":"Fast and Exact Least Absolute Deviations Line Fitting via Piecewise Affine Lower-Bounding","created":"2025-12-22","cited_by_count":0,"area":null},{"id":"2604.13179","title":"HUANet: Hard-Constrained Unrolled ADMM for Constrained Convex Optimization","created":"2026-04-14","cited_by_count":0,"area":null},{"id":"2605.01446","title":"Sequential Minimal Optimization for $\\varepsilon$-SVR with MAPE Loss and Sample-Dependent Box Constraints","created":"2026-05-02","cited_by_count":0,"area":null},{"id":"2607.17282","title":"An Iterative Geometric Approach to Optimizing Separating Hyperplanes","created":"2026-07-19","cited_by_count":0,"area":null},{"id":"2609.00644","title":"Disciplined Bilevel Programming","created":"2026-09-01","cited_by_count":0,"area":null},{"id":"2609.08136","title":"GPU-Enabled Large-Scale Optimization Using Randomized Linear Algebra","created":"2026-09-08","cited_by_count":0,"area":null},{"id":"2609.13875","title":"Generation of Custom Solvers in Rust for Convex Optimization","created":"2026-09-12","cited_by_count":0,"area":null},{"id":"2609.32018","title":"Representation Learning for Exact Preimages","created":"2026-09-25","cited_by_count":0,"area":null},{"id":"2610.07846","title":"Scen-Opt: A Scenario Optimization Toolbox for Data-Driven Convex Programming","created":"2026-10-06","cited_by_count":0,"area":null},{"id":"2610.15816","title":"ML-CLAPPS: A Probabilistic Framework for Imbalanced Multilabel Learning under Class Prioritization","created":"2026-10-11","cited_by_count":0,"area":null}],"next_cursor":null}