{"total":31,"rows":[{"id":"2202.00622","title":"Datamodels: Predicting Predictions from Training Data","created":"2022-02-01","cited_by_count":189,"area":null},{"id":"2111.02790","title":"LassoBench: A High-Dimensional Hyperparameter Optimization Benchmark Suite for Lasso","created":"2021-11-04","cited_by_count":41,"area":null},{"id":"2106.04145","title":"Unbalanced Optimal Transport through Non-negative Penalized Linear Regression","created":"2021-06-08","cited_by_count":31,"area":null},{"id":"2206.13424","title":"Benchopt: Reproducible, efficient and collaborative optimization benchmarks","created":"2022-06-27","cited_by_count":27,"area":null},{"id":"2105.01637","title":"Implicit differentiation for fast hyperparameter selection in non-smooth convex learning","created":"2021-05-04","cited_by_count":22,"area":null},{"id":"2110.09697","title":"abess: A Fast Best Subset Selection Library in Python and R","created":"2021-10-19","cited_by_count":16,"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":"2205.01385","title":"Smooth over-parameterized solvers for non-smooth structured optimization","created":"2022-05-03","cited_by_count":11,"area":null},{"id":"2110.11688","title":"Differentially Private Coordinate Descent for Composite Empirical Risk Minimization","created":"2021-10-22","cited_by_count":10,"area":null},{"id":"2307.12897","title":"Anytime Model Selection in Linear Bandits","created":"2023-07-24","cited_by_count":6,"area":null},{"id":"2202.00602","title":"Meta-Learning Hypothesis Spaces for Sequential Decision-making","created":"2022-02-01","cited_by_count":5,"area":null},{"id":"2503.15699","title":"Representational Similarity via Interpretable Visual Concepts","created":"2025-03-19","cited_by_count":5,"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":"2210.15513","title":"Lifelong Bandit Optimization: No Prior and No Regret","created":"2022-10-27","cited_by_count":4,"area":null},{"id":"2504.01743","title":"High Dimensional Bayesian Optimization using Lasso Variable Selection","created":"2025-04-02","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":"2112.05104","title":"Continuation Path with Linear Convergence Rate","created":"2021-12-09","cited_by_count":3,"area":null},{"id":"2403.18517","title":"Efficient Algorithms for Regularized Nonnegative Scale-invariant Low-rank Approximation Models","created":"2024-03-27","cited_by_count":2,"area":null},{"id":"2510.19999","title":"Enhanced Cyclic Coordinate Descent Methods for Elastic Net Penalized Linear Models","created":"2025-10-22","cited_by_count":2,"area":null},{"id":"2111.13785","title":"OmiTrans: generative adversarial networks based omics-to-omics translation framework","created":"2021-11-27","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":"2302.10692","title":"On Inductive Biases for Machine Learning in Data Constrained Settings","created":"2023-02-21","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":"2402.02322","title":"Dynamic Incremental Optimization for Best Subset Selection","created":"2024-02-04","cited_by_count":0,"area":null},{"id":"2406.15713","title":"Efficient Low-rank Identification via Accelerated Iteratively Reweighted Nuclear Norm Minimization","created":"2024-06-22","cited_by_count":0,"area":null},{"id":"2511.02430","title":"Efficient Solvers for SLOPE in R, Python, Julia, and C++","created":"2025-11-04","cited_by_count":0,"area":null},{"id":"2602.11107","title":"Renet: Principled and Efficient Relaxation for the Elastic Net via Dynamic Objective Selection","created":"2026-02-11","cited_by_count":0,"area":null},{"id":"2602.15306","title":"Sparse Additive Model Pruning for Order-Based Causal Structure Learning","created":"2026-02-17","cited_by_count":0,"area":null},{"id":"2602.17922","title":"Data-driven configuration tuning of glmnet for balancing accuracy and computational efficiency","created":"2026-02-20","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}],"next_cursor":null}