paper-with-me

Papers

GRAFT: Gradient-Aware Fast MaxVol Technique for Dynamic Data Sampling

2025-08-19 · Ashish Jha, Anh huy Phan, Razan Dibo, Valentin Leplat arxiv

Training modern neural networks on large datasets is computationally and environmentally costly. We introduce GRAFT, a scalable in-training subset selection method that (i) extracts a low-rank feature representation for each batch, (ii) applies a Fast MaxVol sampler to select a small, diverse subset that spans the batch's dominant subspace, and (iii) dynamically adjusts the subset size using a gradient-approximation criterion. By operating in low-rank subspaces and training on carefully chosen examples instead of full batches, GRAFT preserves the training trajectory while reducing wall-clock time, energy consumption, and $\mathrm{CO}_2$ emissions. Across multiple benchmarks, GRAFT matches or exceeds recent selection baselines in both accuracy and efficiency, providing a favorable trade-off between accuracy, efficiency, and emissions.

📄 PDF Abstract BibTeX arXiv:2508.13653

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Maximum-Volume Nonnegative Matrix Factorization

2026-02-04 · Olivier Vu Thanh, Nicolas Gillis arxiv

Nonnegative matrix factorization (NMF) is a popular data embedding technique. Given a nonnegative data matrix $X$, it aims at finding two lower dimensional matrices, $W$ and $H$, such that $X\approx WH$, where the factor…

GRAFT: Geometric Refinement and Fitting Transformer for Human Scene Reconstruction

2026-04-21 · Pradyumna YM, Yuxuan Xue, Yue Chen, Nikita Kister 외 arxiv

Reconstructing physically plausible 3D human-scene interactions (HSI) from a single image currently presents a trade-off: optimization based methods offer accurate contact but are slow (~20s), while feed-forward approach…

Efficient Rectangular Maximal-Volume Algorithm for Rating Elicitation in Collaborative Filtering

2016-10-16 · Alexander Fonarev, Alexander Mikhalev, Pavel Serdyukov, Gleb Gusev 외

Cold start problem in Collaborative Filtering can be solved by asking new users to rate a small seed set of representative items or by asking representative users to rate a new item. The question is how to build a seed s…

Collaborative Filtering

Black-Box Approximation and Optimization with Hierarchical Tucker Decomposition

2024-02-05 · Gleb Ryzhakov, Andrei Chertkov, Artem Basharin, Ivan Oseledets

We develop a new method HTBB for the multidimensional black-box approximation and gradient-free optimization, which is based on the low-rank hierarchical Tucker decomposition with the use of the MaxVol indices selection …

Hierarchical Stacking Optimization Using Dirichlet's Process (SoDip): Towards Accelerated Design for Graft Polymerization

2025-12-25 · Amgad Ahmed Ali Ibrahim, Hein Htet, Ryoji Asahi arxiv

Radiation-induced grafting (RIG) enables precise functionalization of polymer films for ion-exchange membranes, CO2-separation membranes, and battery electrolytes by generating radicals on robust substrates to graft desi…