{"list":"other","total":71,"rows":[{"id":"1512.03385","title":"Deep Residual Learning for Image Recognition","created":"2015-12-10","cited_by_count":52096},{"id":"1703.03400","title":"Model-Agnostic Meta-Learning for Fast Adaptation of Deep Networks","created":"2017-03-09","cited_by_count":4897},{"id":"1612.00796","title":"Overcoming catastrophic forgetting in neural networks","created":"2016-12-02","cited_by_count":4787},{"id":"1506.02142","title":"Dropout as a Bayesian Approximation: Representing Model Uncertainty in Deep Learning","created":"2015-06-06","cited_by_count":4448},{"id":"1606.09282","title":"Learning without Forgetting","created":"2016-06-29","cited_by_count":2496},{"id":"1611.07725","title":"iCaRL: Incremental Classifier and Representation Learning","created":"2016-11-23","cited_by_count":2333},{"id":"1706.08840","title":"Gradient Episodic Memory for Continual Learning","created":"2017-06-26","cited_by_count":1898},{"id":"1812.00420","title":"Efficient Lifelong Learning with A-GEM","created":"2018-12-02","cited_by_count":1058},{"id":"2004.07211","title":"Dark Experience for General Continual Learning: a Strong, Simple Baseline","created":"2020-04-15","cited_by_count":911},{"id":"1801.10112","title":"Riemannian Walk for Incremental Learning: Understanding Forgetting and Intransigence","created":"2018-01-30","cited_by_count":742},{"id":"1312.6211","title":"An Empirical Investigation of Catastrophic Forgetting in Gradient-Based Neural Networks","created":"2013-12-21","cited_by_count":722},{"id":"1909.04630","title":"Meta-Learning with Implicit Gradients","created":"2019-09-10","cited_by_count":525},{"id":"1810.11910","title":"Learning to Learn without Forgetting by Maximizing Transfer and Minimizing Interference","created":"2018-10-29","cited_by_count":521},{"id":"1712.00559","title":"Progressive Neural Architecture Search","created":"2017-12-02","cited_by_count":487},{"id":"1502.03492","title":"Gradient-based Hyperparameter Optimization through Reversible Learning","created":"2015-02-11","cited_by_count":360},{"id":"1710.10628","title":"Variational Continual Learning","created":"2017-10-29","cited_by_count":339},{"id":"2007.06823","title":"Hands-on Bayesian Neural Networks -- a Tutorial for Deep Learning Users","created":"2020-07-14","cited_by_count":338},{"id":"1902.10486","title":"On Tiny Episodic Memories in Continual Learning","created":"2019-02-27","cited_by_count":307},{"id":"1911.02590","title":"Optimizing Millions of Hyperparameters by Implicit Differentiation","created":"2019-11-06","cited_by_count":304},{"id":"1802.02246","title":"Approximation Methods for Bilevel Programming","created":"2018-02-06","cited_by_count":236},{"id":"2206.07137","title":"Prioritized Training on Points that are Learnable, Worth Learning, and Not Yet Learnt","created":"2022-06-14","cited_by_count":236},{"id":"1703.01785","title":"Forward and Reverse Gradient-Based Hyperparameter Optimization","created":"2017-03-06","cited_by_count":234},{"id":"1602.02355","title":"Hyperparameter optimization with approximate gradient","created":"2016-02-07","cited_by_count":233},{"id":"2204.04662","title":"FOSTER: Feature Boosting and Compression for Class-Incremental Learning","created":"2022-04-10","cited_by_count":229},{"id":"2010.07962","title":"Bilevel Optimization: Convergence Analysis and Enhanced Design","created":"2020-10-15","cited_by_count":222},{"id":"1812.03596","title":"Task-Free Continual Learning","created":"2018-12-10","cited_by_count":221},{"id":"1805.07810","title":"Online Structured Laplace Approximations For Overcoming Catastrophic Forgetting","created":"2018-05-20","cited_by_count":201},{"id":"1312.2139","title":"Optimal rates for zero-order convex optimization: the power of two function evaluations","created":"2013-12-07","cited_by_count":198},{"id":"2006.03875","title":"Coresets via Bilevel Optimization for Continual Learning and Streaming","created":"2020-06-06","cited_by_count":192},{"id":"1810.10667","title":"Truncated Back-propagation for Bilevel Optimization","created":"2018-10-25","cited_by_count":190},{"id":"2006.16218","title":"On the Iteration Complexity of Hypergradient Computation","created":"2020-06-29","cited_by_count":155},{"id":"2007.05170","title":"A Two-Timescale Framework for Bilevel Optimization: Complexity Analysis and Application to Actor-Critic","created":"2020-07-10","cited_by_count":144},{"id":"2302.14545","title":"Modern Bayesian Experimental Design","created":"2023-02-28","cited_by_count":125},{"id":"2106.01085","title":"Online Coreset Selection for Rehearsal-based Continual Learning","created":"2021-06-02","cited_by_count":117},{"id":"1607.05447","title":"On Differentiating Parameterized Argmin and Argmax Problems with Application to Bi-level Optimization","created":"2016-07-19","cited_by_count":112},{"id":"1507.08752","title":"An Optimal Algorithm for Bandit and Zero-Order Convex Optimization with Two-Point Feedback","created":"2015-07-31","cited_by_count":111},{"id":"2209.08709","title":"BOME! Bilevel Optimization Made Easy: A Simple First-Order Approach","created":"2022-09-19","cited_by_count":105},{"id":"2401.17197","title":"Data-efficient Fine-tuning for LLM-based Recommendation","created":"2024-01-30","cited_by_count":104},{"id":"1805.08289","title":"Measuring and regularizing networks in function space","created":"2018-05-21","cited_by_count":99},{"id":"2106.07760","title":"RETRIEVE: Coreset Selection for Efficient and Robust Semi-Supervised Learning","created":"2021-06-14","cited_by_count":74},{"id":"1803.07246","title":"Variance Reduction for Policy Gradient with Action-Dependent Factorized Baselines","created":"2018-03-20","cited_by_count":68},{"id":"2111.07736","title":"Continual Learning via Local Module Composition","created":"2021-11-15","cited_by_count":63},{"id":"2003.12238","title":"MiLeNAS: Efficient Neural Architecture Search via Mixed-Level Reformulation","created":"2020-03-27","cited_by_count":57},{"id":"1612.00804","title":"Restricted Strong Convexity Implies Weak Submodularity","created":"2016-12-02","cited_by_count":52},{"id":"2301.01716","title":"First-order penalty methods for bilevel optimization","created":"2023-01-04","cited_by_count":41},{"id":"2308.00788","title":"An Introduction to Bi-level Optimization: Foundations and Applications in Signal Processing and Machine Learning","created":"2023-08-01","cited_by_count":41},{"id":"2312.08531","title":"Revisiting the Last-Iterate Convergence of Stochastic Gradient Methods","created":"2023-12-13","cited_by_count":38},{"id":"2110.07004","title":"On the Convergence Theory for Hessian-Free Bilevel Algorithms","created":"2021-10-13","cited_by_count":35},{"id":"2305.15027","title":"A Rigorous Link between Deep Ensembles and (Variational) Bayesian Methods","created":"2023-05-24","cited_by_count":32},{"id":"1712.06199","title":"Structured Optimal Transport","created":"2017-12-17","cited_by_count":31},{"id":"2407.15235","title":"TAGCOS: Task-agnostic Gradient Clustered Coreset Selection for Instruction Tuning Data","created":"2024-07-21","cited_by_count":30},{"id":"2202.10203","title":"Learning Bayesian Sparse Networks with Full Experience Replay for Continual Learning","created":"2022-02-21","cited_by_count":29},{"id":"2301.09880","title":"Probabilistic Bilevel Coreset Selection","created":"2023-01-24","cited_by_count":27},{"id":"2203.04940","title":"Data-Efficient Structured Pruning via Submodular Optimization","created":"2022-03-09","cited_by_count":23},{"id":"1906.03543","title":"apricot: Submodular selection for data summarization in Python","created":"2019-06-08","cited_by_count":22},{"id":"2208.10483","title":"Prioritizing Samples in Reinforcement Learning with Reducible Loss","created":"2022-08-22","cited_by_count":22},{"id":"2306.14853","title":"Near-Optimal Nonconvex-Strongly-Convex Bilevel Optimization with Fully First-Order Oracles","created":"2023-06-26","cited_by_count":17},{"id":"1707.04347","title":"Weakly Submodular Maximization Beyond Cardinality Constraints: Does Randomization Help Greedy?","created":"2017-07-13","cited_by_count":13},{"id":"2507.11274","title":"Fast Last-Iterate Convergence of SGD in the Smooth Interpolation Regime","created":"2025-07-15","cited_by_count":12},{"id":"1905.09919","title":"Submodular Observation Selection and Information Gathering for Quadratic Models","created":"2019-05-23","cited_by_count":9},{"id":"1811.07533","title":"Variational Bayesian Dropout with a Hierarchical Prior","created":"2018-11-19","cited_by_count":8},{"id":"2109.12534","title":"Data Summarization via Bilevel Optimization","created":"2021-09-26","cited_by_count":8},{"id":"2405.08424","title":"Tackling Prevalent Conditions in Unsupervised Combinatorial Optimization: Cardinality, Minimum, Covering, and More","created":"2024-05-14","cited_by_count":7},{"id":"2601.23155","title":"SPICE: Submodular Penalized Information-Conflict Selection for Efficient Large Language Model Training","created":"2026-01-30","cited_by_count":7},{"id":"2406.04914","title":"Submodular Framework for Structured-Sparse Optimal Transport","created":"2024-06-07","cited_by_count":5},{"id":"2504.20644","title":"Combatting Dimensional Collapse in LLM Pre-Training Data via Diversified File Selection","created":"2025-04-29","cited_by_count":5},{"id":"2512.24265","title":"Joint Selection for Large-Scale Pre-Training Data via Policy Gradient-based Mask Learning","created":"2025-12-30","cited_by_count":5},{"id":"2402.02552","title":"Neur2BiLO: Neural Bilevel Optimization","created":"2024-02-04","cited_by_count":4},{"id":"2407.16914","title":"Learning to Solve Bilevel Programs with Binary Tender","created":"2024-07-24","cited_by_count":3},{"id":"2102.09644","title":"Two-Sided Weak Submodularity for Matroid Constrained Optimization and Regression","created":"2021-02-18","cited_by_count":2},{"id":"2204.13832","title":"Efficient Algorithms for Monotone Non-Submodular Maximization with Partition Matroid Constraint","created":"2022-04-29","cited_by_count":1}],"next_cursor":null}