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

3026059071,209 · Jun 202019922001200920172026
48 results for interactive data collection

New RL method tackles sim-to-real gap using interactive data collection.

problem Sim-to-real gap in reinforcement learning.
method Distributionally robust reinforcement learning with interactive data collection.
result Proves sample-efficient learning is impossible without additional assumptions.

Learning by integrating multiple heterogeneous data sources is a common requirement in many tasks. Collective Matrix Factorization (CMF) is a technique to learn shared latent representations from arbitrary collections of matrices. It can be used to simultaneously complete one or more matrices, for predicting the unknow…

2018-11-28abs ↗pdf ↗

We present a simple model of firm rating evolution. We consider two sources of defaults: individual dynamics of economic development and Potts-like interactions between firms. We show that such a defined model leads to phase transition, which results in collective defaults. The existence of the collective phase depends…

2009-04-28abs ↗pdf ↗

The paper proposes an iterative approach to batch reinforcement learning for safer and more informative data collection.

problem Learning policies that are too rigid and do not adapt to new data.
method Safe diversified model-based policy search in an iterative batch reinforcement learning framework.
result Improved learned policies through continuous data collection and adaptation.

Ensembles of neural networks learn better by sharing information.

problem Improving performance of neural networks through collective learning.
method Modeling neural networks as socially interacting agents aiming to maximize their own performance and functional relations to others.
result Optimal collective performance emerges from local interactions between networks, leading to specialization and higher confidence.

The paper learns particle swarming models from data using Gaussian processes.

problem Understanding the link between individual interaction rules and swarming behavior.
method Proposes a learning approach using Gaussian processes to model latent radial interaction functions and scalar parameters in non-collective friction forces.
result Establishes that a coercivity condition is sufficient for recoverability and provides a finite-sample analysis showing optimal convergence rates.

Study human-machine interaction with private info using offline RL.

problem Confounding bias and distributional mismatch in offline RL for human-guided interaction.
method Developed a novel identification result and OPE method to address confounding bias, and used pessimism to tackle distributional mismatch.
result Policy pair converges to optimal one at satisfactory rate under mild assumptions.

Particle- and agent-based systems are a ubiquitous modeling tool in many disciplines. We consider the fundamental problem of inferring interaction kernels from observations of agent-based dynamical systems given observations of trajectories, in particular for collective dynamical systems exhibiting emergent behaviors w…

2019-12-23abs ↗pdf ↗

New method learns particle system potentials from unlabeled data.

problem Learning potentials of interacting particle systems from unlabeled data with trajectory information missing.
method Introduces a self-test loss function based on stochastic evolution equation.
result Method outperforms baseline methods in robust estimation of large, high-dimensional systems.

We derive a class of macroscopic differential equations that describe collective adaptation, starting from a discrete-time stochastic microscopic model. The behavior of each agent is a dynamic balance between adaptation that locally achieves the best action and memory loss that leads to randomized behavior. We show tha…

2004-08-20abs ↗pdf ↗

Method detects interactions for better CTR prediction.

problem Predicting click-through rate with high-dimensional categorical features and time-varying interactions.
method Online Random Intersection Chains (ORIC) for detecting informative interactions.
result ORIC detects high-interpretability interactions that improve CTR prediction.

Sparse Bayesian learning algorithm for estimating interaction kernels in Motsch-Tadmor model.

problem Data-driven identification of asymmetric interaction kernels in the Motsch-Tadmor model.
method Variational framework reformulating kernel identification as a subspace identification problem; sparse Bayesian learning algorithm with informative priors.
result Accurate, robust, and interpretable estimation of interaction kernels across various noise levels and data regimes.

Collective motion is an intriguing phenomenon, especially considering that it arises from a set of simple rules governing local interactions between individuals. In theoretical models, these rules are normally \emph{assumed} to take a particular form, possibly constrained by heuristic arguments. We propose a new class …

2017-12-04abs ↗pdf ↗

Collective classification models attempt to improve classification performance by taking into account the class labels of related instances. However, they tend not to learn patterns of interactions between classes and/or make the assumption that instances of the same class link to each other (assortativity assumption).…

2012-09-25abs ↗pdf ↗

Optimal contracts help principals delegate data collection in decentralized ML.

problem Dealing with information asymmetries in decentralized ML.
method Design of optimal and near-optimal contracts addressing uncertainty in model quality and performance.
result Simple linear contracts achieve 1-1/e fraction of optimal utility.

Study shows small groups can influence machine learning algorithms.

problem How small groups can influence machine learning algorithms deployed on digital platforms.
method Proposed a theoretical model and conducted experiments on a large-scale language model.
result Small groups can exert significant control over machine learning algorithms.

In order to use the advanced inference techniques available for Ising models, we transform complex data (real vectors) into binary strings, by local averaging and thresholding. This transformation introduces parameters, which must be varied to characterize the behaviour of the system. The approach is illustrated on fin…

2013-11-15abs ↗pdf ↗

Framework for systemic risk modeling using jointly exchangeable arrays.

problem Systemic risk in insurance portfolios with interactions.
method Jointly exchangeable arrays, central limit theorems, simulation-based validation.
result Asymptotic approximations for total portfolio losses in large portfolios over long time horizons.

In a complex system, the interactions between individual agents often lead to emergent collective behavior like spontaneous synchronization, swarming, and pattern formation. The topology of the network of interactions can have a dramatic influence over those dynamics. In many studies, researchers start with a specific …

2019-05-04abs ↗pdf ↗

The paper optimizes exceptions in a statistical production system using machine learning.

problem Lack of curated and labeled training data for machine learning in data quality assurance.
method Explainable supervised machine learning to identify and prioritize exceptions.
result Improvement in the quality and efficiency of exceptions generated and authenticated by users.

Interactive machine learning improves learning efficiency with user input.

problem Expensive, time-consuming, or risky acquisition of labeled data and decision-making.
method Develops new algorithms for active learning, sequential decision making, and model selection under partial feedback.
result First efficient algorithms achieving exponential label savings and independent of action space size.

Observations consisting of measurements on relationships for pairs of objects arise in many settings, such as protein interaction and gene regulatory networks, collections of author-recipient email, and social networks. Analyzing such data with probabilisic models can be delicate because the simple exchangeability assu…

2007-05-30abs ↗pdf ↗

The study combines social interaction data into a single network, identifying stable groups of chimpanzees.

problem Identifying stable groups of chimpanzees based on social interactions over time.
method Network representation, weighted proximity weights, principled loss function, statistical tests.
result The approach detects stable groups of chimpanzees that stay related for a significant length of time.

Calibrated models can lead to miscalibrated aggregations in strategic interactions.

problem Miscalibration in aggregated predictions from multiple calibrated models.
method Analysis of strategic interactions between calibrated predictors, proving conditions for miscalibration and comparing VCG and Brier-score aggregation methods.
result VCG aggregation method outperforms Brier-score in strategic settings, providing robustness and comparable accuracy.

A new machine learning framework called machine collaboration improves prediction accuracy.

problem Improving prediction accuracy in machine learning.
method Machine Collaboration (MaC) framework, which uses a circular and interactive learning approach.
result Machine Collaboration framework significantly outperforms other state-of-the-art methods in most cases.

The paper proposes a GP-based method for discovering second-order particle dynamics models.

problem Discovering a general second-order particle-based model for agent interactions.
method Gaussian Process-based approach integrating two independent GP priors on latent interaction kernels.
result The method learns effective nonlinear dynamics representations from small data sets.

Quriosity analyzes curiosity-driven questions from diverse sources.

problem Understanding and analyzing human curiosity-driven questions.
method Collection of 13.5K questions from various sources, development of an iterative prompt improvement framework.
result 42% of questions are causal, revealing unique linguistic properties.

Study on consensus formation in manifolds with curvature constraints.

problem Long-time behavior of solutions to nonlocal PDEs on Riemannian manifolds.
method Analytical and numerical methods applied to self-collective models.
result Sufficient conditions for consensus formation and convergence rates quantified.

The rise in online social networking has brought about a revolution in social relations. However, its effects on offline interactions and its implications for collective well-being are still not clear and are under-investigated. We study the ecology of online and offline interaction in an evolutionary game framework wh…

2016-01-28abs ↗pdf ↗

Bayesian optimization agent learns user preferences from pairwise comparisons.

problem Learning user preferences from unknown and infinite choices.
method Sequential Bayesian optimization with pairwise comparisons.
result Optimal agent strategy minimizes remaining system uncertainty.