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

Trend · papers per month

67133200266 · May 202619922001200920172026
48 results for Collective Regime

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.

Generative model identifies temporal count data components with regime-dependent contributions.

problem Modeling temporal count data with regime-dependent dynamics.
method Generative framework combining regime-adaptive dynamics with Poisson log-normal emissions.
result Established identifiability of the model and revealed co-variation patterns and regime shifts.

The paper analyzes Nordic stock markets' correlation structures and regime shifts.

problem Understanding and exploiting regime shifts in Nordic stock markets.
method Examined two decades of daily data for OMXS30, OMXC20, and OMXH25 universes; proposed an adaptive portfolio allocation framework.
result Documented pronounced regime dependence in rolling correlation matrices; proposed an adaptive portfolio allocation framework.

In this article we discuss some of the consequences of the mixed membership perspective on time series analysis. In its most abstract form, a mixed membership model aims to associate an individual entity with some set of attributes based on a collection of observed data. Although much of the literature on mixed members…

2013-09-13abs ↗pdf ↗

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 ↗

The collection and analysis of user data drives improvements in the app and web ecosystems, but comes with risks to privacy. This paper examines discrete distribution estimation under local privacy, a setting wherein service providers can learn the distribution of a categorical statistic of interest without collecting …

2016-02-24abs ↗pdf ↗

The vision for precision medicine is to use individual patient characteristics to inform a personalized treatment plan that leads to the best healthcare possible for each patient. Mobile technologies have an important role to play in this vision as they offer a means to monitor a patient's health status in real-time an…

2016-11-10abs ↗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.

Identifying the instances of jumps in a discrete-time-series sample of a jump diffusion model is a challenging task. We have developed a novel statistical technique for jump detection and volatility estimation in a return time series data using a threshold method. The consistency of the volatility estimator has been ob…

2019-10-23abs ↗pdf ↗

Sparse connectivity improves generalization in neural networks below the Edge of Stability.

problem Generalization guarantees for fully-connected networks fail at the Edge of Stability.
method Analyzed sparse connectivity's impact on generalization in two-layer ReLU networks.
result Sparse connectivity changes the effective constraint, leading to non-vacuous generalization bounds.

This paper studies the problem of nonparametric estimation of a smooth function with data distributed across multiple machines. We assume an independent sample from a white noise model is collected at each machine, and an estimator of the underlying true function needs to be constructed at a central machine. We place l…

2018-03-04abs ↗pdf ↗

Many applications, including natural language processing, sensor networks, collaborative filtering, and federated learning, call for estimating discrete distributions from data collected in batches, some of which may be untrustworthy, erroneous, faulty, or even adversarial. Previous estimators for this setting ran in e…

2019-11-19abs ↗pdf ↗

Study on cryptocurrency market dynamics and correlations over time.

problem Understanding the dynamics and correlations of cryptocurrency market over time.
method Evolutionary correlation analysis, turning point algorithm, inverse relationship between market size and collective dynamics, time-varying consistency of relationships, examination of volatility structure.
result Increased uniformity in volatility during market crashes, termed 'volatility dispersion'.

A large number of online services provide automated recommendations to help users to navigate through a large collection of items. New items (products, videos, songs, advertisements) are suggested on the basis of the user's past history and --when available-- her demographic profile. Recommendations have to satisfy the…

2013-01-08abs ↗pdf ↗

A network of agents attempt to learn some unknown state of the world drawn by nature from a finite set. Agents observe private signals conditioned on the true state, and form beliefs about the unknown state accordingly. Each agent may face an identification problem in the sense that she cannot distinguish the truth in …

2015-03-11abs ↗pdf ↗

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 ↗

New algorithms improve privacy in bandit problems with partial information.

problem Privacy constraints in multi-armed bandit problems with partial reward information.
method Proposed a generic framework for designing εε-global DP extensions of UCB and KL-UCB algorithms.
result AdaP-KLUCB algorithm achieves optimal regret bound under εε-global DP constraints.

A deterministic system of coupled maps is proposed as a model for economic activity among interacting agents. The values of the maps represent the wealth of the agents. The dynamics of the system is controlled by two parameters. One parameter expresses the growth capacity of the agents and the other describes the local…

2007-01-09abs ↗pdf ↗

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 ↗

Improved off-policy selection and learning in contextual bandits with better guarantees.

problem Selecting or training a reward-maximizing policy using data from a fixed behavior policy.
method A betting-based confidence bound applied to an inverse propensity weight sequence for off-policy selection, and a freezing condition for off-policy learning.
result The proposed methods achieve significantly improved guarantees over prior work, especially in small-data regimes.

We propose a straightforward extension of our previously proposed log-periodic power law model of the ``anti-bubble'' regime of the USA market since the summer of 2000, in terms of the renormalization group framework to model critical points. Using a previous work by Gluzman and Sornette (2002) on the classification of…

2003-01-13abs ↗pdf ↗

This paper considers the problem of inferring image labels from images when only a few annotated examples are available at training time. This setup is often referred to as low-shot learning, where a standard approach is to re-train the last few layers of a convolutional neural network learned on separate classes for w…

2017-06-07abs ↗pdf ↗

Action chunking and data exploration improve behavior cloning in robotics.

problem Exponential errors in learning from demonstrations for continuous control tasks.
method Action chunking and exploratory data collection.
result Control-theoretic stability is key to improving imitation learning.

The Minority Game framework was recently generalized to account for the possibility that agents adapt not only through strategy selection but also by diversifying their response according to the kind of dynamical regime, or the risk, they perceive. Here we study the effects of this mechanism in different information st…

2005-03-31abs ↗pdf ↗

A new algorithm learns optimal personalized treatment plans online with low regret.

problem Learning optimal dynamic treatment regimes in an online setting.
method Developed a novel algorithm balancing exploration and exploitation for rate-optimal regret.
result Guaranteed rate-optimal regret for linear transition and reward models.

Episodes of market crashes have fascinated economists for centuries. Although many academics, practitioners and policy makers have studied questions related to collapsing asset price bubbles, there is little consensus yet about their causes and effects. This review and essay evaluates some of the hypotheses offered to …

2008-12-12abs ↗pdf ↗

The paper analyzes Kernel Density Estimation in high dimensions with varying data and dimensionality.

problem High-dimensional Kernel Density Estimation with growing data and dimensionality.
method Examines the behavior of Kernel Density Estimators in the regime where both data points and dimensionality grow with a fixed ratio.
result Three distinct statistical regimes are identified for Kernel-based density estimates, each with different statistical properties.

Reducing volatility proxy improves apparent market correlation dynamics.

problem Attributing apparent slow collective market dynamics to intrinsic or driver inheritance.
method Coupled Ornstein-Uhlenbeck model with VIX proxy, decomposing and controlling for autocorrelation.
result VIX-coupled model reduces effective relaxation time from 298 to 61 trading days, improving fit over bare mean reversion.

We present a simple agent-based model to study the development of a bubble and the consequential crash and investigate how their proximate triggering factor might relate to their fundamental mechanism, and vice versa. Our agents invest according to their opinion on future price movements, which is based on three source…

2008-06-18abs ↗pdf ↗

New bounds for SGD in high dimensions improve inference efficiency.

problem Quantifying uncertainty in high-dimensional SGD.
method Established non-asymptotic Berry--Esseen bounds for online least-squares SGD.
result Gaussian Central Limit Theorem holds for td1+δt \gtrsim d^{1+δ}, extending dimensional scaling.

We introduce a minimal agent-based model to qualitatively conceptualize the allocation of limited wealth among more abundant opportunities. We study the interplay of power, satisfaction and frustration in distribution, concentration, and inequality of wealth. Our framework allows us to compare subjective measures of fr…

2015-10-02abs ↗pdf ↗

Work shows hallucination detection by LLMs is impossible without expert feedback.

problem Detecting hallucinations in LLMs is theoretically impossible without expert-labeled feedback.
method Investigated hallucination detection using a theoretical framework inspired by language identification.
result Automated hallucination detection is impossible for most language collections without expert-labeled feedback.