{"total":15,"rows":[{"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":"2102.04108","title":"Dynamic Sasvi: Strong Safe Screening for Norm-Regularized Least Squares","created":"2021-02-08","cited_by_count":4,"area":null},{"id":"2306.12670","title":"Generalized Low-Rank Update: Model Parameter Bounds for Low-Rank Training Data Modifications","created":"2023-06-22","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":"2408.10862","title":"Feature Selection from Differentially Private Correlations","created":"2024-08-20","cited_by_count":2,"area":null},{"id":"2406.06960","title":"Low Rank Multi-Dictionary Selection at Scale","created":"2024-06-11","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":"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":"2506.09451","title":"Safe Screening Rules for Group SLOPE","created":"2025-06-11","cited_by_count":0,"area":null},{"id":"2609.30088","title":"AT-SKM-Net: An Accelerated Trainable Sampling Kaczmarz-Motzkin Framework for Linear Hard-Constraint Feasibility on Dynamic Graphs","created":"2026-09-24","cited_by_count":0,"area":null}],"next_cursor":null}