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

76152227303 · Jun 202019922001200920172026
48 results for collective strategy

Active data collection improves convergence rates in operator learning.

problem Improving convergence rates in operator learning with linear target and stochastic input.
method Active data collection strategies with mean-zero stochastic process and continuous covariance kernels.
result Achieves arbitrarily fast error convergence rates with eigenvalue decay of covariance kernels.

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.

This research improves debt collection strategies using advanced machine learning.

problem Accurate estimation of propensity to pay and cashflow for optimal debt collection.
method Developed a machine learning framework with pre-processing and model selection.
result The proposed model outperforms current industry strategies.

Paper proposes efficient sample collection strategy for RL.

problem Balancing exploration and exploitation in reinforcement learning.
method Decoupled approach with objective-specific and objective-agnostic strategies.
result Improved or novel sample complexity guarantees for various RL settings.

Approach collects missing outcomes to improve fairness in classification.

problem Lack of true outcomes for incorrectly classified samples leads to biased classifiers.
method Exploration-based data collection to ensure all subpopulations are represented and fairness properties are encoded.
result Trained classifier converges to a fair classifier with bounded false positives.

Study on collaboration vs. independent data collection in sensor networks.

problem Impact of sensor correlation on data collection strategies.
method Analysis of Fisher information and Cramer-Rao bound.
result Optimal strategy involves transferring non-immediate information for improved estimation.

Optimizes investment strategies for retirees with longevity risk.

problem Maximizing retirement savings under longevity risk for a group of investors.
method Analytic and numerical solutions for investment strategies in both discrete and continuous time models.
result Analytic formulae for optimal investment strategies in both discrete and continuous time models.

We document a mechanism operating in complex adaptive systems leading to dynamical pockets of predictability (``prediction days''), in which agents collectively take predetermined courses of action, transiently decoupled from past history. We demonstrate and test it out-of-sample on synthetic minority and majority game…

2004-10-29abs ↗pdf ↗

Post-ADC inference corrects bias in statistical inference after active data collection.

problem Bias in inference after active data collection.
method Post-ADC inference framework that corrects bias from both ADC process and data-driven target construction.
result Valid inference for data collected by SMBO methods like GP-UCB and TPE.

Generative model learns conditional distributions on collective variable levels.

problem Modeling conditional probability distributions on collective variable levels.
method General and efficient learning approach, data enrichment strategy.
result Effective generative models on different level-sets of collective variables.

Study uses RNN for real-time crypto price prediction and trading optimization.

problem High volatility in cryptocurrency markets makes traditional forecasting models unreliable.
method Data collection, preprocessing, model refinement, and backtesting.
result Improved accuracy in real-time crypto price prediction and optimized trading strategies.

Presents SPEED, an algorithm for optimal policy evaluation in linear bandits with heteroscedastic noise.

problem Optimal data collection for policy evaluation in linear bandits with heteroscedastic reward noise.
method Formulated an optimal design for weighted least squares estimates, derived the optimal sample allocation, introduced SPEED algorithm, and derived regret bounds.
result SPEED leads to policy evaluation with MSE comparable to oracle strategy and significantly lower than random policy execution.

Paper proposes a new framework for combining investment strategies without market-specific assumptions.

problem Lack of a distribution-free and consistent preference framework for decision-making in combining investment strategies.
method Introduces a novel framework for decision-making in combining strategies, free from market conditions and statistical assumptions.
result Proposed strategies outperform individual component strategies in long-term wealth accumulation, with small tradeoffs in Sharpe ratios.

Study experiment planning with function approximation in contextual bandit problems.

problem Designing effective data collection strategies in settings with limited rewards.
method Proposes two experiment planning strategies compatible with function approximation.
result Eluder planning and sampling procedure achieves optimality guarantees.

Unions of subspaces provide a powerful generalization to linear subspace models for collections of high-dimensional data. To learn a union of subspaces from a collection of data, sets of signals in the collection that belong to the same subspace must be identified in order to obtain accurate estimates of the subspace s…

2013-03-19abs ↗pdf ↗

Evolution Strategies (ES) emerged as a scalable alternative to popular Reinforcement Learning (RL) techniques, providing an almost perfect speedup when distributed across hundreds of CPU cores thanks to a reduced communication overhead. Despite providing large improvements in wall-clock time, ES is data inefficient whe…

2018-11-12abs ↗pdf ↗

Study mutual insurance market dynamics using mean field games.

problem Understanding strategic interactions and wealth distribution in mutual insurance companies.
method Extended mean field game framework, mean field forward-backward stochastic differential equations (MF-FBSDE), deep BSDE algorithm.
result Established global-in-time existence and uniqueness of Nash equilibrium strategy.

Generalization of the minority game to more than one market is considered. At each time step every agent chooses one of its strategies and acts on the market related to this strategy. If the payoff function allows for strong fluctuation of utility then market occupancies become inhomogeneous with preference given to th…

2008-09-23abs ↗pdf ↗

The paper analyzes cryptocurrency and equity markets using advanced statistical methods.

problem Comparing dynamics and strategies between cryptocurrency and equity markets.
method Random matrix theory, PCA, spectral dynamics, structural break analysis, portfolio simulation.
result Cryptocurrency and equity markets exhibit distinct evolutionary dynamics and time-varying sector behaviors.

Model shows how heterogeneity in strategies and risk tolerance affects financial market stability.

problem Understanding how heterogeneity impacts financial market dynamics.
method Agent-based model incorporating heterogeneous investment strategies and risk tolerance.
result Heterogeneity in strategies and risk tolerance suppresses price fluctuations.

New method improves active statistical inference by reducing noise.

problem Inaccurate uncertainty estimates in active sampling lead to noisy results.
method Robust sampling strategies that interpolate between uniform and active sampling based on uncertainty scores.
result The robust sampling ensures that the estimator is never worse than uniform sampling and usually outperforms active inference.

Paper proposes a deep RL method for hedging variable annuities, outperforming misspecified models.

problem Model miscalibration in variable annuity contracts with GMMB and GMDB riders.
method Two-phase deep reinforcement learning approach: training phase in a controlled environment, online learning phase in real market.
result Trained reinforcement learning agent hedges equally well as correct Delta in training phase and outperforms misspecified Deltas.

In open set recognition (OSR), almost all existing methods are designed specially for recognizing individual instances, even these instances are collectively coming in batch. Recognizers in decision either reject or categorize them to some known class using empirically-set threshold. Thus the decision threshold plays a…

2018-06-29abs ↗pdf ↗

Embedded ensembles improve neural network performance efficiently.

problem Improving neural network performance with fewer resources.
method Analyzing the wide network limit of gradient descent dynamics using Neural-Tangent-Kernel.
result Embedded ensembles exhibit two regimes: independent and collective, affecting performance.

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.

Continuous collection of physiological data from wearable sensors enables temporal characterization of individual behaviors. Understanding the relation between an individual's behavioral patterns and psychological states can help identify strategies to improve quality of life. One challenge in analyzing physiological d…

2019-11-16abs ↗pdf ↗

We consider the problem of distributed dictionary learning, where a set of nodes is required to collectively learn a common dictionary from noisy measurements. This approach may be useful in several contexts including sensor networks. Diffusion cooperation schemes have been proposed to solve the distributed linear regr…

2013-04-12abs ↗pdf ↗

Study optimizes data collection from biased, costly sources to minimize risk.

problem Estimating population means and group-conditional means from multiple sources with varying costs and biases.
method Develops a sampling plan that maximizes effective sample size, paired with a post-stratification estimator.
result Achieves budgeted minimax optimal risk for estimating population means and group-conditional means.

A decentralized approach for agents to learn and optimize collectively.

problem Challenges in coordinating non-cooperative agents to solve complex sequential decision problems.
method Designing a learning environment where agents learn by trading and optimizing local objectives, leading to a Nash equilibrium.
result Decentralized reinforcement learning algorithms that can handle various decision-making scenarios.

This paper proposes a geometry-aware active learning framework for spatiotemporal dynamic systems.

problem Challenges in modeling complex dynamic systems with 3D geometries and time evolution.
method Geometry-aware spatiotemporal Gaussian Process (G-ST-GP) and adaptive active learning strategy.
result The proposed framework outperforms traditional methods in predicting high-dimensional dynamic behaviors.

Study compares federated learning and coreset approaches for privacy in distributed machine learning.

problem Measuring privacy in distributed machine learning approaches.
method Comparison of federated learning and coreset approaches using membership inference attack.
result Federated learning offers better privacy than coreset, but with higher communication cost.

This paper presents Natural Evolution Strategies (NES), a recent family of algorithms that constitute a more principled approach to black-box optimization than established evolutionary algorithms. NES maintains a parameterized distribution on the set of solution candidates, and the natural gradient is used to update th…

2011-06-22abs ↗pdf ↗

A reinforcement learning approach prepares quantum squeezed states in open spin systems.

problem Generating non-classical states in open quantum systems with dissipation and dephasing.
method Reinforcement learning to determine optimal control pulses for spin-squeezing.
result Optimal control sequences enhance collective spin squeezing and entanglement.