Research
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.

168,695 papers · 148 categories

Trend · papers per month

25.0%50.0%75.0%100.0% · Jun 199319922001200920172026
48 results for Large Scale Analysis

Method analyzes large-scale network data to detect communication pattern shifts.

problem Analyzing large-scale time-series network data is challenging.
method Temporal encoder embedding method using ground-truth or estimated vertex labels.
result Detects communication pattern shifts across all levels of network structure.

In recent years, ideas from statistics and scientific computing have begun to interact in increasingly sophisticated and fruitful ways with ideas from computer science and the theory of algorithms to aid in the development of improved worst-case algorithms that are useful for large-scale scientific and Internet data an…

2010-10-08abs ↗pdf ↗

This paper analyzes convergence of large-scale Transformers with weight decay.

problem Understanding optimization guarantees in large-scale Transformer training.
method Construct mean-field limit, show gradient flow convergence to PDE, demonstrate global minimum consistency.
result Gradient flow reaches global minimum in large-scale Transformers with small weight decay.

Training deep neural networks using a large batch size has shown promising results and benefits many real-world applications. However, the optimizer converges slowly at early epochs and there is a gap between large-batch deep learning optimization heuristics and theoretical underpinnings. In this paper, we propose a no…

2020-02-04abs ↗pdf ↗

Study analyzes price response and spread impact in foreign exchange markets.

problem Understanding deviations from Markovian behavior in foreign exchange markets.
method Detailed large-scale data analysis of price response functions for different years and time scales, using pip bid-ask spread definition.
result Large pip spreads significantly impact price response in foreign exchange markets.

Kernel methods provide a principled way to perform non linear, nonparametric learning. They rely on solid functional analytic foundations and enjoy optimal statistical properties. However, at least in their basic form, they have limited applicability in large scale scenarios because of stringent computational requireme…

2017-05-31abs ↗pdf ↗

Many modern big data applications feature large scale in both numbers of responses and predictors. Better statistical efficiency and scientific insights can be enabled by understanding the large-scale response-predictor association network structures via layers of sparse latent factors ranked by importance. Yet sparsit…

2017-04-26abs ↗pdf ↗

This paper proposes a new method for learning covers of geometric datasets to improve topological inference and visualization.

problem Improving topological inference and visualization of large-scale geometric datasets.
method Proposes a method for learning topologically-faithful covers of geometric datasets using optimization.
result Simplicial complexes obtained from learned covers outperform standard methods in terms of size and representation of large-scale topology.

PePR scores assess DL model performance per resource unit, promoting smaller, more efficient models.

problem Limited access to large-scale resources hinders medical image analysis research.
method Introduced PePR score to measure DL model performance per resource unit.
result Small-scale, specialized models outperform large-scale models in resource-constrained settings.

We analyze the Hessian spectra of large models up to 100B parameters.

problem Accurate Hessian spectra of large foundation models are difficult to obtain.
method We use shard-local finite-difference Hessian vector products and stochastic Lanczos quadrature.
result We produce the first large-scale spectral density estimates of foundation models.

The scaling properties of the time series of asset prices and trading volumes of stock markets are analysed. It is shown that similarly to the asset prices, the trading volume data obey multi-scaling length-distribution of low-variability periods. In the case of asset prices, such scaling behaviour can be used for risk…

2005-01-13abs ↗pdf ↗

The paper analyzes Indian stock sectors using multifractal analysis for long and short-term investment.

problem Investment risk and stability in Indian stock sectors.
method Sector-wise multifractal analysis of Bombay Stock Exchange, India, over short and long time scales.
result Long-term investment in stable sectors is more profitable, while sectors with large fluctuations may lead to downturns.

Based on the new type of random walk process called the Potentials of Unbalanced Complex Kinetics (PUCK) model, we theoretically show that the price diffusion in large scales is amplified 2/(2 + b) times, where b is the coefficient of quadratic term of the potential. In short time scales the price diffusion depends on …

2006-08-10abs ↗pdf ↗

Paper presents a fast, private MH algorithm for large-scale Bayesian inference.

problem Privacy-preserving Bayesian inference for large-scale data.
method Developed a novel DP-MH algorithm using minibatches.
result First exact and fast DP MH algorithm with privacy, scalability, and efficiency trade-offs.

This paper tackles hyperparameter tuning for large-scale kernel ridge regression.

problem Hyperparameter tuning is crucial but often left to users, hindering efficiency and usability.
method Proposes a complexity regularization criterion based on a data-dependent penalty for efficient optimization.
result Demonstrates the benefit of the proposed approach through extensive empirical evaluation.

Large learning rates work surprisingly well in standard parameterization, contrary to theory.

problem Theoretical limits of large learning rates do not match practical network behavior.
method Fine-grained analysis of learning rates and network behavior under cross-entropy loss.
result There are two distinct sub-regimes of unstable learning rates, with a controlled divergence regime where features continue to evolve.

The scale of functional magnetic resonance image data is rapidly increasing as large multi-subject datasets are becoming widely available and high-resolution scanners are adopted. The inherent low-dimensionality of the information in this data has led neuroscientists to consider factor analysis methods to extract and a…

2016-08-16abs ↗pdf ↗

New method combines FMEA and Bayesian Network for root cause analysis in lithium-ion battery production.

problem Complex cause-effect relationships in lithium-ion battery production.
method Combining FMEA with Bayesian Network to detect and resolve inconsistencies.
result Holistic method builds large-scale cross-process Bayesian Failure Network for root cause analysis.

Constructing an efficient parameterization of a large, noisy data set of points lying close to a smooth manifold in high dimension remains a fundamental problem. One approach consists in recovering a local parameterization using the local tangent plane. Principal component analysis (PCA) is often the tool of choice, as…

2011-11-20abs ↗pdf ↗

We investigate the large-volatility dynamics in financial markets, based on the minute-to-minute and daily data of the Chinese Indices and German DAX. The dynamic relaxation both before and after large volatilities is characterized by a power law, and the exponents p±p_\pm usually vary with the strength of the large vo…

2010-02-19abs ↗pdf ↗

This work extends the scaling law to multiple and kernel regression, challenging traditional machine learning principles.

problem Challenging traditional machine learning wisdom with scaling law in large practical models.
method Demonstrates the scaling law in multiple and kernel regression settings.
result The scaling law extends to multiple and kernel regression, providing deeper insights into LLMs.

Adaptive regularization prevents overfitting in large-scale sparse feature models.

problem Overfitting in models with large-scale sparse categorical features.
method Adaptive regularization of embedding layers' norm budget.
result Improves model performance within a single epoch and prevents multi-epoch performance degradation.

We determine the critical batch size for large language models and find it scales with data size, not model size.

problem Determining the optimal batch size for large-scale model training.
method We propose a measure of critical batch size, pre-trained models, and systematic hyper-parameter sweeps.
result The critical batch size scales primarily with data size, not model size.

Novel LRMC tackles missing data and outliers in large-scale low-rank data recovery.

problem Missing data and extreme outliers in low-rank data analysis.
method Learned Robust Matrix Completion (LRMC) using deep unfolding and flexible neural network framework.
result LRMC achieves optimum performance with low computational complexity and linear convergence.

We investigate the large-fluctuation dynamics in financial markets, based on the minute-to-minute and daily data of the Chinese Indices and German DAX. The dynamic relaxation both before and after the large fluctuations is characterized by a power law, and the exponents p±p_\pm usually vary with the strength of the lar…

2013-08-03abs ↗pdf ↗

Tensor decomposition is a well-known tool for multiway data analysis. This work proposes using stochastic gradients for efficient generalized canonical polyadic (GCP) tensor decomposition of large-scale tensors. GCP tensor decomposition is a recently proposed version of tensor decomposition that allows for a variety of…

2019-06-04abs ↗pdf ↗

This paper enhances privacy-preserving randomized power method for large datasets.

problem Privacy issues in applying randomized power method to large datasets containing personal information.
method Proposes enhanced privacy-preserving variants of the randomized power method, including a variant with reduced noise and a decentralized framework.
result Tighter convergence bounds and empirical comparisons with previous work in real recommendation datasets.

This study analyzes quantization in deep learning models using statistical physics methods.

problem The computational resource requirements for large-scale data analysis models.
method Typical case analysis from statistical physics, specifically the replica method.
result Optimal quantization width minimizes error and delays overfitting.

Gradient boosting decision tree (GBDT) is a widely-used machine learning algorithm in both data analytic competitions and real-world industrial applications. Further, driven by the rapid increase in data volume, efforts have been made to train GBDT in a distributed setting to support large-scale workloads. However, we …

2019-07-03abs ↗pdf ↗

Unified CCA methods for large-scale data with fast SGD algorithms.

problem Computational infeasibility of classical CCA methods for large-scale data.
method Unconstrained objective, stochastic gradient descent (SGD) algorithms.
result Significantly faster convergence and higher correlations than previous methods.

This study examines cores within superclusters, highlighting their transitional nature and dynamical state.

problem Understanding the morphology and dynamical properties of cores within superclusters.
method Projected and radial velocity distributions of galaxies, morphological analysis, entropy and mass estimates.
result Cores are transitional structures that evolve towards virialisation but remain gravitationally bound.

SEMASIA provides a large dataset of latent representations for model comparison.

problem Difficulty in comparing semantic structures across different neural network models.
method Collection of latent representations from 1700 pretrained models across various benchmarks.
result Consistent semantic organization across models and datasets.

This work analyzes actor-critic methods for faster convergence.

problem Finite-time analysis and sample complexity of two-time-scale actor-critic methods.
method Non-asymptotic analysis under non-i.i.d. setting, proving convergence to first-order stationary point.
result Actor-critic method finds a first-order stationary point with ildeO(ε2.5)\mathcal{ ilde{O}}(ε^{-2.5}) sample complexity.

New method speeds up learning of complex dynamical systems.

problem Efficiently learning large-scale dynamical systems from finite data.
method Random projections (sketching) to boost kernel-based Koopman operator estimators.
result The proposed estimators maintain accuracy while significantly reducing computation time.

Theoretical analysis of data quality and synergies in LLMs.

problem Understanding why different training methods require different amounts of data.
method Theoretical analysis of transformers trained on a weight prediction task for linear regression.
result SFT excels on smaller datasets challenging for the pretrained model, while RL benefits from large, not overly difficult data.