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,657 papers · 148 categories

Trend · papers per month

145289434578 · Jun 202019922001200920172026
48 results for web-scale applications

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.

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.

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.

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 ↗

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.

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.

Recent years have witnessed the emerging success of graph neural networks (GNNs) for modeling structured data. However, most GNNs are designed for homogeneous graphs, in which all nodes and edges belong to the same types, making them infeasible to represent heterogeneous structures. In this paper, we present the Hetero…

2020-03-03abs ↗pdf ↗

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.

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 ↗

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

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 ↗

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 ↗

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.

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.

Interactive applications incorporating high-data rate sensing and computer vision are becoming possible due to novel runtime systems and the use of parallel computation resources. To allow interactive use, such applications require careful tuning of multiple application parameters to meet required fidelity and latency …

2012-03-15abs ↗pdf ↗

An overview of some of the recent developments in the theory of valuations on convex sets and its generalizations to manifolds is given. The exposition is focused towards applications to integral geometry; several of such applications are discussed.

2010-08-02abs ↗pdf ↗

The aim of this paper is to discuss some applications of general topology in computer algorithms including modeling and simulation, and also in computer graphics and image processing. While the progress in these areas heavily depends on advances in computing hardware, the major intellectual achievements are the algorit…

2012-01-19abs ↗pdf ↗

Survey of deep RL in intelligent transportation systems.

problem Optimizing traffic signals and autonomous driving using deep RL.
method Comprehensive review of deep RL applications in traffic control and autonomous driving.
result Summarizes existing works in deep RL-based transportation applications.

TUV Austria proposes certification for ML applications to ensure reliability.

problem Ensuring trust in AI applications to meet societal reliance requirements.
method Holistic approach analyzing security, functionality, data quality, ethics, and criticality levels.
result Certification process for low-risk ML applications in supervised learning.

MetaDVFS uses device and application metadata to improve DVFS efficiency.

problem Improving energy efficiency in mobile platforms with diverse applications and hardware.
method Formulates DVFS as a multi-task reinforcement learning problem and introduces MetaDVFS, leveraging metadata for knowledge transfer.
result MetaDVFS achieves up to 26% improvement in Quality of Experience and up to 17% improvement in Performance-Power Ratio.

Multitask learning and transfer learning have proven to be useful in the field of machine learning when additional knowledge is available to help a prediction task. We aim at deriving methods following these paradigms for use in autotuning, where the goal is to find the optimal performance parameters of an application …

2019-08-15abs ↗pdf ↗

Survey of LLMs in finance tasks, highlighting progress and challenges.

problem Transforming financial practices with advanced LLMs.
method Exploration of various financial tasks, categorization, and analysis of methodologies.
result Unlocking novel opportunities for financial applications with LLMs.

We survey the different versions of Floer homology that can be associated to three-manifolds. We also discuss their applications, particularly to questions about surgery, homology cobordism, and four-manifolds with boundary. We then describe Floer stable homotopy types, the related Pin(2)-equivariant Seiberg-Witten Flo…

2015-08-03abs ↗pdf ↗

Novel GLMMNet model tackles high-cardinality categorical features in actuarial applications.

problem Inadequate encoding methods for high-cardinality categorical features in actuarial data.
method Generalised Linear Mixed Model Neural Network (GLMMNet) integrating a generalised linear mixed model in a deep learning framework.
result GLMMNet often outperforms or performs comparably with entity embedded neural networks, providing transparency.