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

244488732976 · Jun 202019922001200920172026
48 results for large scale datasets

Paper introduces scalable clustering for large datasets with outliers.

problem Lack of scalable algorithms for large datasets with outliers.
method Provable robust clustering algorithm based on loss minimization for Gaussian mixture models.
result Algorithm provides high accuracy with theoretical guarantees and outperforms existing methods.

This work aims to create a large-scale model for critical care time series data.

problem Lack of large-scale datasets and distribution shifts in critical care time series data.
method Harmonized dataset creation and transfer learning research.
result Established a foundation for large-scale multi-variate time series models in critical care.

New method speeds up Gaussian process training and inference for large datasets.

problem Training and inference in Gaussian processes are computationally expensive for large datasets.
method Iterative alternating projection method that accesses subblocks of the kernel matrix, reducing time and space complexity.
result Empirically, the method accelerates GP training and inference by up to 72x compared to conjugate gradients.

This paper compresses large datasets for efficient machine learning.

problem Efficiently processing large datasets for machine learning.
method Constructing a sketch of the dataset using random features and averaging, then learning from the sketch.
result The approach can perform machine learning tasks without full dataset access, preserving both information and privacy.

The paper proposes an efficient method to scale Bayesian inference for mixed multinomial logit models to very large datasets.

problem Efficiency in Bayesian inference for mixed multinomial logit models on large datasets.
method Amortized Variational Inference with stochastic backpropagation, automatic differentiation, and GPU acceleration.
result The proposed method achieves significant computational speedups over traditional methods for large datasets.

Paper proposes data quality measures for large-scale high-dimensional data.

problem Lack of practical data quality measures for large-scale high-dimensional data.
method Proposes two data quality measures: class separability and in-class variability. Efficient algorithms based on random projections and bootstrapping are provided.
result Efficient algorithms for computing data quality measures on large-scale high-dimensional data.

This work improves Gaussian process model selection for large datasets.

problem Prohibitively high computational cost in Gaussian process model selection.
method Linear-time scaling and computational uncertainty tradeoff.
result Computation-aware Gaussian processes can be trained on large datasets efficiently.

Gradient-free deep learning for large datasets.

problem Training deep neural networks on large-scale datasets is resource-intensive and requires specialized techniques.
method Recursive Local Representation Alignment (RLRA) for gradient-free training.
result RLRA achieves comparable performance to backprop while converging faster and being parallelizable.

ParK efficiently solves kernel ridge regression for large datasets.

problem Large-scale kernel ridge regression efficiency and accuracy.
method Partitioning feature space with random projections and iterative optimization.
result Provably maintains statistical accuracy with reduced space and time complexity.

Quantum machine learning tackles large datasets with randomized measurements.

problem Efficiently process large, high-dimensional datasets on quantum computers.
method Randomized measurements to scale linearly with dataset size and quadratic for post-processing.
result Substantial speed-up for noisy quantum computers, enabling image classification.

The sample inefficiency of standard deep reinforcement learning methods precludes their application to many real-world problems. Methods which leverage human demonstrations require fewer samples but have been researched less. As demonstrated in the computer vision and natural language processing communities, large-scal…

2019-07-29abs ↗pdf ↗

FibeRed reduces complex data dimensions while preserving topology.

problem Hard embedding of topologically complex datasets in low-dimensional Euclidean space.
method Modeling datasets with vector bundles, reducing fibers while preserving topology.
result FibeRed learns topologically faithful embeddings in lower dimensions than existing methods.

Efficiently applies NTK to large-scale datasets using random features.

problem Computational limitations of kernel methods for large-scale datasets.
method Proposes a sketching-based algorithm combining random features of arc-cosine kernels to construct an efficient feature map of the NTK.
result Achieves comparable error bounds to exact kernel methods but with significantly reduced feature dimensionality.

Feature selection is an important challenge in machine learning. It plays a crucial role in the explainability of machine-driven decisions that are rapidly permeating throughout modern society. Unfortunately, the explosion in the size and dimensionality of real-world datasets poses a severe challenge to standard featur…

2018-06-12abs ↗pdf ↗

A new large-scale tabular benchmark for Learning from Label Proportions.

problem Lack of a large-scale open benchmark for tabular Learning from Label Proportions.
method Proposed LLP-Bench, a suite of 70 datasets (62 feature bag and 8 random bag) from real-world tabular data.
result Demonstrated the effectiveness of 9 SOTA and popular tabular LLP techniques on 62 feature bag datasets.

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.

Deep Neural Networks (DNNs) often rely on very large datasets for training. Given the large size of such datasets, it is conceivable that they contain certain samples that either do not contribute or negatively impact the DNN's optimization. Modifying the training distribution in a way that excludes such samples could …

2019-05-29abs ↗pdf ↗

Optimal scaling found to depend on operator norm across large models and datasets.

problem Lack of unifying principle for optimal hyperparameter scaling across models and datasets.
method Discovered that optimal scaling is conditioned on the operator norm of the output layer.
result The optimal learning rate/batch size pair (η,B)(η^{\ast}, B^{\ast}) consistently has the same operator norm value.

We propose a new method for input variable selection in nonlinear regression. The method is embedded into a kernel regression machine that can model general nonlinear functions, not being a priori limited to additive models. This is the first kernel-based variable selection method applicable to large datasets. It sides…

2018-04-19abs ↗pdf ↗

Deep neural networks (DNNs) trained on large-scale datasets have exhibited significant performance in image classification. Many large-scale datasets are collected from websites, however they tend to contain inaccurate labels that are termed as noisy labels. Training on such noisy labeled datasets causes performance de…

2018-03-30abs ↗pdf ↗

Researchers parallelize neural kernels for large-scale data, achieving state-of-the-art accuracy.

problem Limited scalability of neural kernels on large datasets.
method Massively parallel computation across many GPUs, combined with a distributed, preconditioned conjugate gradients algorithm.
result Achieved state-of-the-art accuracy of 91.2% on CIFAR-5m dataset using neural kernels.

Paper presents an efficient algorithm for learning minimax risk classifiers with large-scale data.

problem Efficient learning of minimax risk classifiers for large-scale data with multiple classes.
method Combination of constraint and column generation for efficient learning.
result 10x speedup for general large-scale data and 100x speedup with many classes.

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.

The paper shows how to efficiently generate large Gaussian process samples with reliability guarantees.

problem Generating large-scale Gaussian process samples efficiently and with reliability.
method Demonstrates scaling data generation to large \(n\) while providing high probability guarantees.
result Efficiently generates large Gaussian process samples with reliability guarantees.

Many real-world regression problems demand a measure of the uncertainty associated with each prediction. Standard decision forests deliver efficient state-of-the-art predictive performance, but high-quality uncertainty estimates are lacking. Gaussian processes (GPs) deliver uncertainty estimates, but scaling GPs to lar…

2015-06-11abs ↗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.

Supervised learning algorithms are nowadays successfully scaling up to datasets that are very large in volume, leveraging the potential of in-memory cluster-computing Big Data frameworks. Still, massive datasets with a number of large-domain categorical features are a difficult challenge for any classifier. Most off-th…

2018-05-10abs ↗pdf ↗

Scalable kernel methods for large datasets using Fourier representations and NUFFT.

problem Cubic complexity in kernel methods limits their use on large-scale datasets.
method Fourier representation of kernels combined with NUFFT for O(n log n) complexity.
result Achieves minimax convergence rates and processes up to tens of billions of samples.

CHILI datasets tackle inorganic nanomaterials, advancing graph machine learning.

problem Challenges in modelling inorganic crystalline materials and nanomaterials with graph ML.
method Presented two large-scale datasets of inorganic nanomaterials, defined property and structure prediction tasks.
result Benchmarked performance of graph ML methods on inorganic nanomaterials, highlighting areas for future work.

Annotating the right data for training deep neural networks is an important challenge. Active learning using uncertainty estimates from Bayesian Neural Networks (BNNs) could provide an effective solution to this. Despite being theoretically principled, BNNs require approximations to be applied to large-scale problems, …

2018-11-08abs ↗pdf ↗