{"total":39,"rows":[{"id":"2103.16378","title":"End-to-End Constrained Optimization Learning: A Survey","created":"2021-03-30","cited_by_count":157,"area":null},{"id":"2107.07467","title":"Only Train Once: A One-Shot Neural Network Training And Pruning Framework","created":"2021-07-15","cited_by_count":70,"area":null},{"id":"2206.13424","title":"Benchopt: Reproducible, efficient and collaborative optimization benchmarks","created":"2022-06-27","cited_by_count":27,"area":null},{"id":"2204.07826","title":"Beyond L1: Faster and Better Sparse Models with skglm","created":"2022-04-16","cited_by_count":16,"area":null},{"id":"2106.01429","title":"Smooth Bilevel Programming for Sparse Regularization","created":"2021-06-02","cited_by_count":14,"area":null},{"id":"2208.06058","title":"An Accelerated Doubly Stochastic Gradient Method with Faster Explicit Model Identification","created":"2022-08-11","cited_by_count":14,"area":null},{"id":"2205.01385","title":"Smooth over-parameterized solvers for non-smooth structured optimization","created":"2022-05-03","cited_by_count":11,"area":null},{"id":"2102.10846","title":"Expanding boundaries of Gap Safe screening","created":"2021-02-22","cited_by_count":7,"area":null},{"id":"2110.11784","title":"Safe rules for the identification of zeros in the solutions of the SLOPE problem","created":"2021-10-22","cited_by_count":6,"area":null},{"id":"2202.00467","title":"Safe Screening for Logistic Regression with $\\ell_0$-$\\ell_2$ Regularization","created":"2022-02-01","cited_by_count":6,"area":null},{"id":"2102.04108","title":"Dynamic Sasvi: Strong Safe Screening for Norm-Regularized Least Squares","created":"2021-02-08","cited_by_count":4,"area":null},{"id":"2204.11640","title":"Hybrid ISTA: Unfolding ISTA With Convergence Guarantees Using Free-Form Deep Neural Networks","created":"2022-04-25","cited_by_count":4,"area":null},{"id":"2104.13026","title":"The Hessian Screening Rule","created":"2021-04-27","cited_by_count":3,"area":null},{"id":"2105.05648","title":"Look-Ahead Screening Rules for the Lasso","created":"2021-05-12","cited_by_count":3,"area":null},{"id":"2112.05104","title":"Continuation Path with Linear Convergence Rate","created":"2021-12-09","cited_by_count":3,"area":null},{"id":"2101.06982","title":"Screening for Sparse Online Learning","created":"2021-01-18","cited_by_count":2,"area":null},{"id":"2203.00987","title":"Beyond GAP screening for Lasso by exploiting new dual cutting half-spaces with supplementary material","created":"2022-03-02","cited_by_count":2,"area":null},{"id":"2306.13561","title":"Efficient Model Selection for Predictive Pattern Mining Model by Safe Pattern Pruning","created":"2023-06-23","cited_by_count":2,"area":null},{"id":"2312.00640","title":"One to beat them all: \"RYU\" -- a unifying framework for the construction of safe balls","created":"2023-12-01","cited_by_count":2,"area":null},{"id":"2405.15357","title":"Strong Screening Rules for Group-based SLOPE Models","created":"2024-05-24","cited_by_count":2,"area":null},{"id":"2408.10862","title":"Feature Selection from Differentially Private Correlations","created":"2024-08-20","cited_by_count":2,"area":null},{"id":"2204.10981","title":"Distributed Dynamic Safe Screening Algorithms for Sparse Regularization","created":"2022-04-23","cited_by_count":1,"area":null},{"id":"2309.01781","title":"Self-concordant smoothing in proximal quasi-Newton algorithms for large-scale convex composite optimization","created":"2023-09-04","cited_by_count":1,"area":null},{"id":"2504.03152","title":"Safe Screening Rules for Group OWL Models","created":"2025-04-04","cited_by_count":1,"area":null},{"id":"2603.16062","title":"Safe Distributionally Robust Feature Selection under Covariate Shift","created":"2026-03-17","cited_by_count":1,"area":null},{"id":"2202.07258","title":"Accelerating Non-Negative and Bounded-Variable Linear Regression Algorithms with Safe Screening","created":"2022-02-15","cited_by_count":0,"area":null},{"id":"2207.02058","title":"Best Subset Selection with Efficient Primal-Dual Algorithm","created":"2022-07-05","cited_by_count":0,"area":null},{"id":"2208.02161","title":"A Screening Strategy for Structured Optimization Involving Nonconvex $\\ell_{q,p}$ Regularization","created":"2022-08-02","cited_by_count":0,"area":null},{"id":"2304.01432","title":"Reducing Discretization Error in the Frank-Wolfe Method","created":"2023-04-04","cited_by_count":0,"area":null},{"id":"2307.00247","title":"Safe Screening for Unbalanced Optimal Transport","created":"2023-07-01","cited_by_count":0,"area":null},{"id":"2310.08939","title":"Fast Screening Rules for Optimal Design via Quadratic Lasso Reformulation","created":"2023-10-13","cited_by_count":0,"area":null},{"id":"2402.02322","title":"Dynamic Incremental Optimization for Best Subset Selection","created":"2024-02-04","cited_by_count":0,"area":null},{"id":"2405.17094","title":"Dual Feature Reduction for the Sparse-group Lasso and its Adaptive Variant","created":"2024-05-27","cited_by_count":0,"area":null},{"id":"2502.12607","title":"Generalized Kernel Inducing Points by Duality Gap for Dataset Distillation","created":"2025-02-18","cited_by_count":0,"area":null},{"id":"2603.25221","title":"Gap Safe Screening Rules for Fast Training of Robust Support Vector Machines under Feature Noise","created":"2026-03-26","cited_by_count":0,"area":null},{"id":"2607.14545","title":"CASP: Learning-Augmented Offline Approximation with Verifiable Certificates and Bounded-Loss PAC Guarantees","created":"2026-07-16","cited_by_count":0,"area":null},{"id":"2609.16952","title":"Learning Choice Model Trees for Feature-Based Multi-Product Pricing: Exact Optimization and Field Evidence","created":"2026-09-15","cited_by_count":0,"area":null},{"id":"2609.23995","title":"Simpler Methods Work Better for L1 Penalized Logistic Models and Large Datasets","created":"2026-09-21","cited_by_count":0,"area":null},{"id":"2610.15829","title":"Guarded Block Transfers for Polytope Distance: Linear Convergence with Explicit Constants and Gap-Certified Screening for SVM Training","created":"2026-10-11","cited_by_count":0,"area":null}],"next_cursor":null}