On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

169,291 papers · 148 categories

Trend · papers per month

count % of corpus

3 results for “memory-mapped”

The biglasso Package: A Memory- and Computation-Efficient Solver for Lasso Model Fitting with Big Data in Rstat.CO

biglasso solves memory and computation issues for lasso models on large data.

problem Memory and computational limitations in fitting lasso models to large datasets.

method Memory-mapped files, out-of-core computation, efficient feature screening rules.

result biglasso efficiently handles ultrahigh-dimensional, multi-gigabyte data sets.

lasso memory-mapped out-of-core big data R package

2017-01-20abs ↗pdf ↗

Solving FDR-Controlled Sparse Regression Problems with Five Million Variables on a Laptopeess.SP

Big T-Rex solves FDR-controlled sparse regression on laptops with millions of variables.

problem Scalable FDR-controlled variable selection for high-dimensional data.

method Early terminated random experiments with memory-mapping and permutation-based dummy generation.

result Solves FDR-controlled Lasso problems with 5 million variables on a laptop in 30 minutes.

FDR control sparse regression high-dimensional data T-Rex Big T-Rex

2024-09-27abs ↗pdf ↗

Temporal Information Processing on Noisy Quantum Computersquant-ph

Quantum reservoir computing tackles noisy quantum computers for temporal tasks.

problem Efficiently process input sequences on noisy quantum computers.

method Quantum reservoir computing using dissipative quantum dynamics.

result Small and noisy quantum reservoirs can handle high-order nonlinear temporal tasks.

quantum computing reservoir computing temporal processing noisy quantum computers machine learning

2020-01-26abs ↗pdf ↗