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

146292437583 · Jun 202019922001200920172026
48 results for Web-scale Datasets

Paper combines scalable BMF algorithms for web-scale datasets.

problem High computational cost of Bayesian Matrix Factorization.
method Combines Posterior Propagation and asynchronous distributed implementation.
result Substantial improvements in scalability on web-scale datasets.

DCN-V2 improves deep & cross network for web-scale learning to rank systems.

problem Efficiently learning feature interactions in large-scale recommender systems.
method Proposes DCN-V2, an improved framework for deep & cross network learning.
result DCN-V2 outperforms state-of-the-art algorithms on benchmark datasets.

Study on continual learning with Twitter data, developing ConGraD algorithm.

problem Personalized online language learning on a massive scale.
method Developed POLL problem setting, collected Firehose datasets, and introduced ConGraD algorithm.
result ConGraD algorithm outperforms prior continual learning methods on Firehose datasets.

Efficiently selects nearest neighbors for labeling to speed up active learning.

problem Intractable active learning and search for large-scale unlabeled data.
method Restricts candidate pool to nearest neighbors of labeled set.
result Achieved similar performance to global approach but reduced computational cost by up to 3 orders of magnitude.

Efficiently projects points onto polytopes, especially useful in web-scale applications.

problem Efficiently projecting points onto polytopes in large-scale applications.
method Developed a vertex-oriented incremental algorithm for polytope projection, tailored for simplex and unit-box cut polytopes.
result Majority of projections lie on vertices of polytopes, leading to significant performance improvements.

HGT models heterogeneous graphs with dedicated node and edge representations.

problem Infeasibility of existing GNNs for heterogeneous graphs.
method Node- and edge-type dependent parameters, relative temporal encoding, heterogeneous mini-batch graph sampling.
result HGT outperforms state-of-the-art GNNs by 9%--21% on various downstream tasks.

BanditLP optimizes personalized recommendations for large-scale systems.

problem Optimizing personalized recommendations for large-scale systems with constraints.
method Unified neural Thompson Sampling for learning and large-scale linear programming for action selection.
result Consistent gains over strong baselines in experiments and business win in LinkedIn's email marketing system.

Recent advancements in deep neural networks for graph-structured data have led to state-of-the-art performance on recommender system benchmarks. However, making these methods practical and scalable to web-scale recommendation tasks with billions of items and hundreds of millions of users remains a challenge. Here we de…

2018-06-06abs ↗pdf ↗

The paper provides convergence guarantees for multicalibration gradient boosting.

problem Understanding the convergence properties of multicalibration gradient boosting.
method Computational guarantees for multicalibration gradient boosting algorithms, including adaptive variants.
result The magnitude of successive prediction updates decays at O(1/T)O(1/\sqrt{T}), leading to convergence in empirical multicalibration error.

Learning from multiple-relational data which contains noise, ambiguities, or duplicate entities is essential to a wide range of applications such as statistical inference based on Web Linked Data, recommender systems, computational biology, and natural language processing. These tasks usually require working with very …

2016-04-03abs ↗pdf ↗

Unsupervised near-duplicate detection has many practical applications ranging from social media analysis and web-scale retrieval, to digital image forensics. It entails running a threshold-limited query on a set of descriptors extracted from the images, with the goal of identifying all possible near-duplicates, while l…

2019-07-03abs ↗pdf ↗

Since time immemorial, people have been looking for ways to organize scientific knowledge into some systems to facilitate search and discovery of new ideas. The problem was partially solved in the pre-Internet era using library classifications, but nowadays it is nearly impossible to classify all scientific and popular…

2018-11-15abs ↗pdf ↗

The paper shows how curated synthetic data can optimize human preferences in generative models.

problem Contamination of web-scale datasets by synthetic data affects future model training.
method Theoretical study of iterated retraining of generative models with curated synthetic data.
result Data curation can be seen as an implicit preference optimization mechanism, maximizing expected reward.

This paper improves prediction uncertainty estimation by inferring variation from neuron activation strength.

problem Estimating prediction uncertainty from ensemble methods is expensive and inaccurate.
method Introduced randomness into model training and inferred prediction variation from neuron activation strength.
result Average R squared on MovieLens is 0.56 and on Criteo is 0.81, with strong performance in variation detection.

Proposes SSL framework for improving item recommendations in large-scale systems.

problem Sparse feedback data for long-tail items in recommender systems.
method Multi-task self-supervised learning framework with data augmentation.
result Significant improvements in model performance, especially on slices lacking supervision.

When building large-scale machine learning (ML) programs, such as big topic models or deep neural nets, one usually assumes such tasks can only be attempted with industrial-sized clusters with thousands of nodes, which are out of reach for most practitioners or academic researchers. We consider this challenge in the co…

2014-12-04abs ↗pdf ↗

New data accumulation prevents model collapse in generative models.

problem Model collapse in generative models trained on their own outputs.
method Empirical study of language models, diffusion models, and variational autoencoders; analytically tractable framework for linear models.
result Accumulating synthetic data alongside real data avoids model collapse, preventing performance degradation.

MusPy is a toolkit for symbolic music generation, providing tools for dataset management and analysis.

problem Facilitating the creation and analysis of symbolic music datasets.
method Development of an open-source Python library (MusPy) with features for dataset management, data I/O, preprocessing, and model evaluation. Demonstrated through statistical analysis and cross-dataset generalizability experiments.
result MusPy's dataset analysis reveals varying degrees of cross-genre representation across different music datasets.

In this paper, we propose a data collaboration analysis method for distributed datasets. The proposed method is a centralized machine learning while training datasets and models remain distributed over some institutions. Recently, data became large and distributed with decreasing costs of data collection. If we can cen…

2019-02-20abs ↗pdf ↗

StyleDiff compares unlabeled datasets using disentangled image spaces.

problem Mismatches between development and real-world datasets lead to inaccurate predictions.
method Uses disentangled image spaces and focuses on attributes to compare datasets.
result Accurately detects and presents differences between datasets.

In this paper, we propose a novel method for generating a synthetic dataset obeying Gaussian distribution. Compared to the commonly used benchmark datasets with unknown distribution, the synthetic dataset has an explicit distribution, i.e., Gaussian distribution. Meanwhile, it has the same characteristics as the benchm…

2019-06-01abs ↗pdf ↗

New framework assesses graph-learning datasets for better evaluation.

problem Insufficient evaluation of graph-learning datasets and methods.
method Introduces Rings framework for dataset ablations and proposes performance separability and mode complementarity measures.
result Demonstrates utility of Rings framework for graph-learning dataset evaluation.

In this paper, we introduce the Fairness GAN, an approach for generating a dataset that is plausibly similar to a given multimedia dataset, but is more fair with respect to protected attributes in allocative decision making. We propose a novel auxiliary classifier GAN that strives for demographic parity or equality of …

2018-05-24abs ↗pdf ↗

MTL method uses unlabeled data with pseudo labels to improve classification with disjoint datasets.

problem Improving classification performance with disjoint labeled datasets using unlabeled data.
method Proposes MTL-SA method to select and augment unlabeled data with confident pseudo labels and close distribution to labeled data.
result Extensive experiments show the effectiveness of MTL-SA method in improving classification performance.

The study examines dataset usage patterns in machine learning research.

problem Lack of attention to dataset dynamics in machine learning research.
method Analysis of dataset usage patterns across machine learning subcommunities and time periods (2015-2020).
result Increasing concentration on fewer and fewer datasets, significant adoption from other tasks, and concentration across the field on datasets introduced by elite institutions.

Method embeds numeric tabular datasets into a shared vector space for similarity and retrieval.

problem Lack of meaningful representation for numeric tabular datasets in large language models.
method Structured exploratory data analysis descriptors, sentence transformer embedding, CCA for cross-dataset alignment.
result Total P@1 score of 0.9 across 15 datasets, robust nearest-neighbor retrieval and cluster structure.

This paper presents the recently published Cerema AWP (Adverse Weather Pedestrian) dataset for various machine learning tasks and its exports in machine learning friendly format. We explain why this dataset can be interesting (mainly because it is a greatly controlled and fully annotated image dataset) and present base…

2018-06-11abs ↗pdf ↗

Dataset distillation is a method for reducing dataset sizes by learning a small number of synthetic samples containing all the information of a large dataset. This has several benefits like speeding up model training, reducing energy consumption, and reducing required storage space. Currently, each synthetic sample is …

2019-10-06abs ↗pdf ↗

New framework transforms labeled datasets for various machine learning tasks.

problem Lack of principled methods to transform labeled datasets.
method Wasserstein gradient flows in probability space for optimization of data-generating distributions.
result Framework can impose constraints, adapt for transfer learning, or re-purpose models.

Elastic co-clustering improves clustering of single-cell genomic data.

problem Improving clustering performance of single-cell genomic datasets.
method Elastic coupled co-clustering in an unsupervised transfer learning framework.
result Our algorithm significantly improves clustering performance over traditional methods.

Combines datasets to improve model fitting with small sample sizes.

problem Improving model performance with limited samples from at least one dataset.
method Proposes a novel framework called Combine datasets based on Imputation (ComImp) and PCA-ComImp for combining datasets with missing data.
result Significant improvement in model accuracy, especially with small datasets and when combined with transfer learning.

An efficient learner is one who reuses what they already know to tackle a new problem. For a machine learner, this means understanding the similarities amongst datasets. In order to do this, one must take seriously the idea of working with datasets, rather than datapoints, as the key objects to model. Towards this goal…

2016-06-07abs ↗pdf ↗