{"total":25,"rows":[{"id":"2406.02742","title":"Tolerant Algorithms for Learning with Arbitrary Covariate Shift","created":"2024-06-04","cited_by_count":15,"area":null},{"id":"2404.02364","title":"Learning Intersections of Halfspaces with Distribution Shift: Improved Algorithms and SQ Lower Bounds","created":"2024-04-02","cited_by_count":13,"area":null},{"id":"2406.09373","title":"Efficient Discrepancy Testing for Learning with Distribution Shift","created":"2024-06-13","cited_by_count":9,"area":null},{"id":"2505.20177","title":"The Power of Iterative Filtering for Supervised Learning with (Heavy) Contamination","created":"2025-05-26","cited_by_count":7,"area":null},{"id":"2403.11963","title":"Transfer Learning Beyond Bounded Density Ratios","created":"2024-03-18","cited_by_count":6,"area":null},{"id":"2411.03570","title":"Learning Constant-Depth Circuits in Malicious Noise Models","created":"2024-11-06","cited_by_count":5,"area":null},{"id":"2509.24510","title":"Specialization after Generalization: Towards Understanding Test-Time Training in Foundation Models","created":"2025-09-29","cited_by_count":5,"area":null},{"id":"2408.16189","title":"Help Me Help You: The Aggregate Value of Source and Target Data in Transfer Learning","created":"2024-08-29","cited_by_count":4,"area":null},{"id":"2411.12700","title":"Learning multivariate Gaussians with imperfect advice","created":"2024-11-19","cited_by_count":4,"area":null},{"id":"2501.09189","title":"Testing Noise Assumptions of Learning Algorithms","created":"2025-01-15","cited_by_count":4,"area":null},{"id":"2502.16021","title":"Learning Neural Networks with Distribution Shift: Efficiently Certifiable Guarantees","created":"2025-02-22","cited_by_count":4,"area":null},{"id":"2602.20111","title":"Reliable Abstention under Adversarial Injections: Tight Lower Bounds and New Upper Bounds","created":"2026-02-23","cited_by_count":3,"area":null},{"id":"2602.24178","title":"Sandwiching Polynomials for Geometric Concepts with Low Intrinsic Dimension","created":"2026-02-27","cited_by_count":3,"area":null},{"id":"2412.00974","title":"Optimal Algorithms for Augmented Testing of Discrete Distributions","created":"2024-12-01","cited_by_count":2,"area":null},{"id":"2512.02279","title":"Limitations of Membership Queries in Testable Learning","created":"2025-12-01","cited_by_count":2,"area":null},{"id":"2605.07005","title":"Equivalence of Coarse and Fine-Grained Models for Learning with Distribution Shift","created":"2026-05-07","cited_by_count":1,"area":null},{"id":"2605.17251","title":"Iterative Chow Filtering for Learning with Distribution Shift","created":"2026-05-17","cited_by_count":1,"area":null},{"id":"2608.13514","title":"Bagging Robustly Learns VC Classes with Linear Sample Complexity","created":"2026-08-13","cited_by_count":1,"area":null},{"id":"2510.21345","title":"$\\alpha$-LoRA: Effective Fine-Tuning via Base Model Rescaling","created":"2025-10-24","cited_by_count":0,"area":null},{"id":"2602.22300","title":"Testable Learning of General Halfspaces under Massart Noise","created":"2026-02-25","cited_by_count":0,"area":null},{"id":"2603.01346","title":"Relatively Smart: A New Approach for Instance-Optimal Learning","created":"2026-03-02","cited_by_count":0,"area":null},{"id":"2605.08072","title":"A Note on Non-Negative $L_1$-Approximating Polynomials","created":"2026-05-08","cited_by_count":0,"area":null},{"id":"2607.18088","title":"The Label Complexity of Useful Class-Conditional Prediction Sets under Distribution Shift","created":"2026-07-20","cited_by_count":0,"area":null},{"id":"2609.10886","title":"Relatively Smart II: Tractable or Semi-Supervised Instance-Optimal Learning","created":"2026-09-09","cited_by_count":0,"area":null},{"id":"2609.32267","title":"When Can Old Evaluations Certify a New Model? Label-Efficient Release Decisions under Evaluator Drift","created":"2026-09-26","cited_by_count":0,"area":null}],"next_cursor":null}