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

5099149198 · May 202619922001200920172026
48 results for asymptotic exchangeability

The exchange algorithm is studied for its convergence and asymptotic variance.

problem Theoretical limitations of the exchange algorithm in sampling from doubly-intractable distributions.
method Theoretical analysis of the exchange algorithm's convergence speed and asymptotic variance.
result The exchange algorithm converges at a geometric rate and satisfies a Central Limit Theorem.

New classifiers converge under large data, simplifying complex models.

problem Complex predictive models under large datasets.
method Convergence of simultaneous and marginal classifiers under partition exchangeability.
result Asymptotic convergence of classifiers with large data reduces computational complexity.

New method constructs synthetic treatment groups without mean exchangeability assumption.

problem Violations of mean exchangeability assumption in randomized controlled trials.
method Weighted mixture of treatment groups from source populations, minimizing conditional maximum mean discrepancy.
result Asymptotic normality of synthetic treatment group estimator established.

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.

This paper presents a novel study on gas-like models for economic systems. The interacting agents and the amount of exchanged money at each trade are selected with different levels of randomness, from a purely random way to a more chaotic one. Depending on the interaction rules, these statistical models can present dif…

2009-01-08abs ↗pdf ↗

The paper gives bounds for how long it takes for gossip protocols to spread information in networks.

problem Understanding the diffusion time in asynchronous gossip protocols.
method Provides non-asymptotic bounds for the number of messages needed for consensus in asynchronous gossip protocols.
result Explicit formula and approximation for the number of messages needed for consensus in different types of graphs.

We unify subsampling methods for network embeddings and prove their asymptotic distribution.

problem Understanding and improving the performance of network embeddings learned via subsampling.
method Unified framework for node2vec-like methods, proving asymptotic distribution under exchangeable graph assumption.
result Asymptotic distribution of learned embedding vectors decouples and provides rates of convergence.

Neural ARFIMA model improves exchange rate forecasting for BRIC economies.

problem Forecasting exchange rates for emerging markets with long-term memory and nonlinear dynamics.
method Integrates ARFIMA for long-memory with neural networks for nonlinear approximation.
result NARFIMA model outperforms benchmarks in BRIC exchange rate forecasting.

Asynchronous computation and gradient compression have emerged as two key techniques for achieving scalability in distributed optimization for large-scale machine learning. This paper presents a unified analysis framework for distributed gradient methods operating with staled and compressed gradients. Non-asymptotic bo…

2018-06-18abs ↗pdf ↗

New algorithm learns nonlinear phenomena from noisy local measurements without data exchange.

problem Learning nonlinear phenomena from noisy local measurements in a decentralized network.
method Non-parametric learning algorithm that spreads information only between neighboring nodes.
result Non-asymptotic estimation error bounds for the proposed method.

New model allocates features sublinearly, improving model fit and performance.

problem Linear growth of shared features limits model flexibility and performance.
method Developed non-exchangeable feature allocation models with sublinear feature sharing.
result Sublinear feature sharing leads to better model fit and predictive performance.

In this article, we consider the limit of quasi-local conserved quantities [31,9] at the infinity of an asymptotically hyperbolic initial data set in general relativity. These give notions of total energy-momentum, angular momentum, and center of mass. Our assumption on the asymptotics is less stringent than any previo…

2014-09-05abs ↗pdf ↗

A generalized continuous economic model is proposed for random markets. In this model, agents interact by pairs and exchange their money in a random way. A parameter controls the effectiveness of the transactions between the agents. We show in a rigorous way that this type of markets reach their asymptotic equilibrium …

2011-04-12abs ↗pdf ↗

We present an optimal investment theorem for a currency exchange model with random and possibly discontinuous proportional transaction costs. The investor's preferences are represented by a multivariate utility function, allowing for simultaneous consumption of any prescribed selection of the currencies at a given term…

2008-11-24abs ↗pdf ↗

This article establishes the performance of stochastic blockmodels in addressing the co-clustering problem of partitioning a binary array into subsets, assuming only that the data are generated by a nonparametric process satisfying the condition of separate exchangeability. We provide oracle inequalities with rate of c…

2012-12-17abs ↗pdf ↗

Improved reSGLD accelerates convergence in non-convex learning problems.

problem Inefficient swaps due to noisy energy estimators in reSGLD.
method Variance reduction for noisy energy estimators, theoretical analysis, and numerical experiments.
result Exponential acceleration in convergence for non-convex learning problems.

Validates conformal prediction for network data under non-uniform sampling.

problem Validity of conformal prediction for network data under non-representative sampling.
method Interprets sampling mechanisms as selection rules, studies validity conditional on selection events, uses permutation invariance and joint exchangeability.
result Finite-sample validity of conformal prediction for certain selection events and asymptotic validity for random walk sampling.

Analytical results bound the approach to oligarchy in a modified asset exchange model.

problem Analyzing economic inequality in a modified asset exchange model.
method Analytical results using Gini coefficient and differential inequalities.
result The Gini coefficient is bounded by a first-order differential inequality.

We study the constant mean curvature (CMC) hypersurfaces in hyperbolic space whose asymptotic boundaries are closed codimension-1 submanifolds in sphere at infinity. We consider CMC hypersurfaces as generalizations of minimal hypersurfaces. We naturally generalize some notions of minimal hypersurfaces like being area m…

2005-08-17abs ↗pdf ↗

Many popular random partition models, such as the Chinese restaurant process and its two-parameter extension, fall in the class of exchangeable random partitions, and have found wide applicability in model-based clustering, population genetics, ecology or network analysis. While the exchangeability assumption is sensib…

2017-11-20abs ↗pdf ↗

Develop conformal prediction for dyadic regression under complex missingness.

problem Conformal prediction for dyadic regression under complex missingness mechanisms.
method Developing general technical tools and conformal prediction procedures for dyadic regression under complex missingness.
result Establishing asymptotic validity of weighted conformal prediction under a nonparametric graphon model for missingness mechanism.

New algorithm for precise changepoint localization without assumptions.

problem Offline changepoint localization in arbitrary distributions.
method Distribution-free algorithm CONformal CHangepoint localization (CONCH) using exchangeability arguments.
result Derives principled score functions for informative and small confidence sets with normalized length shrinking to zero.

Unified framework for FDR control in knockoffs, validating Gaussian knockoffs.

problem Asymptotic FDR control in knockoffs with user-specified distributions.
method Unified theoretical framework, three conditions on approximate knockoff statistics, Gaussian knockoffs generator based on moments matching.
result Gaussian knockoffs generator achieves asymptotic FDR control.

A new method for time-series data provides guaranteed coverage and adapts to non-exchangeable data.

problem Guaranteed coverage for time-series data prediction intervals.
method Sequential Conformalized Density Regions (SCDR) using quantile random forest.
result SCDR achieves guaranteed asymptotic coverage and outperforms existing methods in simulations.

The paper proves ADL mechanisms face a trilemma and optimizes them for fairness, revenue, and exchange solvency.

problem The impossibility of a perpetual futures exchange achieving solvency, revenue, and fairness.
method Formal model of ADL, proving trilemma, and analyzing three ADL mechanisms.
result Optimized ADL mechanisms can reduce trader losses while maintaining exchange solvency.

In this paper, we consider a simple kinetic model of economy involving both exchanges between agents and speculative trading. We show that the kinetic model admits non trivial quasi-stationary states with power law tails of Pareto type. In order to do this we consider a suitable asymptotic limit of the model yielding a…

2004-12-21abs ↗pdf ↗