{"total":44,"rows":[{"id":"2402.01868","title":"Challenges in Training PINNs: A Loss Landscape Perspective","created":"2024-02-02","cited_by_count":113,"area":null},{"id":"2210.12067","title":"Efficient Dataset Distillation Using Random Feature Approximation","created":"2022-10-21","cited_by_count":111,"area":null},{"id":"2307.15967","title":"Graph Condensation for Inductive Node Representation Learning","created":"2023-07-29","cited_by_count":31,"area":null},{"id":"2410.01917","title":"Provably Accurate Shapley Value Estimation via Leverage Score Sampling","created":"2024-10-02","cited_by_count":23,"area":null},{"id":"2312.01537","title":"Unlocking the Potential of Federated Learning: The Symphony of Dataset Distillation via Deep Generative Latents","created":"2023-12-03","cited_by_count":16,"area":null},{"id":"2210.14664","title":"Coresets for Vertical Federated Learning: Regularized Linear Regression and $K$-Means Clustering","created":"2022-10-26","cited_by_count":14,"area":null},{"id":"2303.05151","title":"Provable Data Subset Selection For Efficient Neural Network Training","created":"2023-03-09","cited_by_count":14,"area":null},{"id":"2102.04152","title":"EigenGame Unloaded: When playing games is better than optimizing","created":"2021-02-08","cited_by_count":13,"area":null},{"id":"2106.14952","title":"Adversarial Robustness of Streaming Algorithms through Importance Sampling","created":"2021-06-28","cited_by_count":13,"area":null},{"id":"2210.13601","title":"Active Learning for Single Neuron Models with Lipschitz Non-Linearities","created":"2022-10-24","cited_by_count":12,"area":null},{"id":"2312.08893","title":"Solving Dense Linear Systems Faster Than via Preconditioning","created":"2023-12-14","cited_by_count":12,"area":null},{"id":"2103.00564","title":"An Introduction to Johnson-Lindenstrauss Transforms","created":"2021-02-28","cited_by_count":11,"area":null},{"id":"2105.08005","title":"Learning a Latent Simplex in Input-Sparsity Time","created":"2021-05-17","cited_by_count":11,"area":null},{"id":"2311.10680","title":"Optimal Embedding Dimension for Sparse Subspace Embeddings","created":"2023-11-17","cited_by_count":11,"area":null},{"id":"2405.05818","title":"Fine-grained Analysis and Faster Algorithms for Iteratively Solving Linear Systems","created":"2024-05-09","cited_by_count":7,"area":null},{"id":"2202.03474","title":"Random Gegenbauer Features for Scalable Kernel Methods","created":"2022-02-07","cited_by_count":6,"area":null},{"id":"2209.04876","title":"Subquadratic Kronecker Regression with Applications to Tensor Decomposition","created":"2022-09-11","cited_by_count":6,"area":null},{"id":"2504.16277","title":"DataS^3: Dataset Subset Selection for Specialization","created":"2025-04-22","cited_by_count":6,"area":null},{"id":"2107.10654","title":"Fast Low-Rank Tensor Decomposition by Ridge Leverage Score Sampling","created":"2021-07-22","cited_by_count":5,"area":null},{"id":"2407.06120","title":"Sketchy Moment Matching: Toward Fast and Provable Data Selection for Finetuning","created":"2024-07-08","cited_by_count":5,"area":null},{"id":"2107.08090","title":"Near-Optimal Algorithms for Linear Algebra in the Current Matrix Multiplication Time","created":"2021-07-16","cited_by_count":4,"area":null},{"id":"2108.05767","title":"Probabilistic methods for approximate archetypal analysis","created":"2021-08-12","cited_by_count":4,"area":null},{"id":"2405.05865","title":"Faster Linear Systems and Matrix Norm Approximation via Multi-level Sketched Preconditioning","created":"2024-05-09","cited_by_count":4,"area":null},{"id":"2506.09105","title":"MetaTT: A Global Tensor-Train Adapter for Parameter-Efficient Fine-Tuning","created":"2025-06-10","cited_by_count":4,"area":null},{"id":"2104.14101","title":"Fast Convex Quadratic Optimization Solvers with Adaptive Sketching-based Preconditioners","created":"2021-04-29","cited_by_count":3,"area":null},{"id":"2405.05343","title":"Distributed Least Squares in Small Space via Sketching and Bias Reduction","created":"2024-05-08","cited_by_count":3,"area":null},{"id":"2105.11004","title":"Estimating leverage scores via rank revealing methods and randomization","created":"2021-05-23","cited_by_count":2,"area":null},{"id":"2306.07163","title":"A Batch-to-Online Transformation under Random-Order Model","created":"2023-06-12","cited_by_count":2,"area":null},{"id":"2407.03262","title":"Ridge Leverage Score Sampling for $\\ell_p$ Subspace Approximation","created":"2024-07-03","cited_by_count":2,"area":null},{"id":"2412.06063","title":"On Socially Fair Low-Rank Approximation and Column Subset Selection","created":"2024-12-08","cited_by_count":2,"area":null},{"id":"2502.13583","title":"Fundamental Bias in Inverting Random Sampling Matrices with Application to Sub-sampled Newton","created":"2025-02-19","cited_by_count":2,"area":null},{"id":"2604.20078","title":"Improved large-scale graph learning through ridge spectral sparsification","created":"2026-04-22","cited_by_count":2,"area":null},{"id":"2109.01691","title":"ALLWAS: Active Learning on Language models in WASserstein space","created":"2021-09-03","cited_by_count":1,"area":null},{"id":"2204.12073","title":"One-pass additive-error subset selection for $\\ell_{p}$ subspace approximation","created":"2022-04-26","cited_by_count":1,"area":null},{"id":"2401.00122","title":"SALSA: Sequential Approximate Leverage-Score Algorithm with Application in Analyzing Big Time Series Data","created":"2023-12-30","cited_by_count":1,"area":null},{"id":"2106.08544","title":"Non-PSD Matrix Sketching with Applications to Regression and Optimization","created":"2021-06-16","cited_by_count":0,"area":null},{"id":"2306.06611","title":"Learning the Positions in CountSketch","created":"2023-06-11","cited_by_count":0,"area":null},{"id":"2306.15848","title":"Ordering for Non-Replacement SGD","created":"2023-06-28","cited_by_count":0,"area":null},{"id":"2307.07405","title":"Performance of $\\ell_1$ Regularization for Sparse Convex Optimization","created":"2023-07-14","cited_by_count":0,"area":null},{"id":"2403.18142","title":"HERTA: A High-Efficiency and Rigorous Training Algorithm for Unfolded Graph Neural Networks","created":"2024-03-26","cited_by_count":0,"area":null},{"id":"2505.12353","title":"Importance Sampling for Nonlinear Models","created":"2025-05-18","cited_by_count":0,"area":null},{"id":"2602.09457","title":"From Average Sensitivity to Small-Loss Regret Bounds under Random-Order Model","created":"2026-02-10","cited_by_count":0,"area":null},{"id":"2606.20082","title":"Beyond Averaging in John Ellipsoid Approximation: High-Accuracy Algorithms in the Leverage-Score Model","created":"2026-06-18","cited_by_count":0,"area":null},{"id":"2609.38565","title":"The Advantages of Fresh Sketching for Ridge Regression","created":"2026-09-29","cited_by_count":0,"area":null}],"next_cursor":null}