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

199398596795 · Jun 202019922001200920172026
48 results for absorbing sets

Identifies conditions for multiple invariant probabilities in Markov kernels.

problem Global irreducibility and recurrence do not guarantee uniqueness of invariant probabilities.
method Uses Jordan decomposition of the difference of two invariant probabilities.
result A Markov kernel has more than one invariant probability if and only if it admits a visible absorbing decomposition.

The family of Wilder continua in cubes of dimension > 2 and its two subfamilies-of continuum-wise Wilder continua and of hereditarily arcwise connected continua-are recognized as coanalytic absorbers in the hyperspace of subcontinua of the cubes. In particular, each of them is homeomorphic to the set of all nonempty co…

2015-12-17abs ↗pdf ↗

Deep neural networks near edge of chaos show universal scaling laws.

problem Understanding the behavior of deep neural networks near critical points.
method Analogy to absorbing phase transitions in statistical mechanics, deterministic propagation dynamics, mean-field and directed percolation universality classes.
result Deep neural networks exhibit universal scaling laws near the edge of chaos.

Researchers use information geometry to analyze and improve DRWs for node classification.

problem Lack of theoretical foundations for Discriminative Random Walks (DRWs).
method Revisit DRWs through information geometry, treating hitting-time laws as a statistical manifold. Derived closed-form expressions and introduced sensitivity scores.
result Introduced a sensitivity score that bounds maximal first-order change in DRW betweenness under unit Fisher perturbations.

New approach measures systemic risk by absorbing shocks before financial systems deteriorate.

problem Systemic risk evaluation without considering initial shocks.
method Linearized DebtRank and spectral graph theory for localized and uniform shocks; Monte Carlo simulations for heterogeneous shocks.
result Explicit computation and clear visualization of financial distress onset.

Fitting a simplifying model with several parameters to real data of complex objects is a highly nontrivial task, but enables the possibility to get insights into the objects physics. Here, we present a method to infer the parameters of the model, the model error as well as the statistics of the model error. This method…

2018-12-19abs ↗pdf ↗

This study optimizes offline reinforcement learning methods for various tasks without rewards.

problem Optimizing offline reinforcement learning for multiple tasks without rewards.
method Designing a new model-based approach with singleton absorbing MDPs to achieve optimal convergence rates.
result Achieved optimal convergence rates for offline reinforcement learning in various settings.

In this paper we consider the problem of graph-based transductive classification, and we are particularly interested in the directed graph scenario which is a natural form for many real world applications. Different from existing research efforts that either only deal with undirected graphs or circumvent directionality…

2014-02-19abs ↗pdf ↗

We develop a frame and dyad gauge-independent formalism for the calculus of variations of functionals involving spinorial objects. As part of this formalism we define a modified variation operator which absorbs frame and spin dyad gauge terms. This formalism is applicable to both the standard spacetime (i.e. SL(2,C)) 2…

2015-05-14abs ↗pdf ↗

This work studies the parameter identification problem for the Markov chain choice model of Blanchet, Gallego, and Goyal used in assortment planning. In this model, the product selected by a customer is determined by a Markov chain over the products, where the products in the offered assortment are absorbing states. Th…

2017-06-02abs ↗pdf ↗

This paper applies reactor theory to supply chain management.

problem Maintaining optimal item delivery and collection ratios in supply chains.
method Translating neutron transport and diffusion theory to supply chain management, introducing analogy factors and interactors.
result A deterministic model for supply chain optimization.

We study a continuous-time version of the intermediation model of Grossman and Miller (1988). To wit, we solve for the competitive equilibrium prices at which liquidity takers' demands are absorbed by dealers with quadratic inventory costs, who can in turn gradually transfer these positions to an exogenous open market …

2018-07-22abs ↗pdf ↗

We investigate the average frequency of positive slope να+ν_α^{+}, crossing for the returns of market prices. The method is based on stochastic processes which no scaling feature is explicitly required. Using this method we define new quantity to quantify stage of development and activity of stocks exchange. We compare …

2006-01-26abs ↗pdf ↗

We characterise the value function of the optimal dividend problem with a finite time horizon as the unique classical solution of a suitable Hamilton-Jacobi-Bellman equation. The optimal dividend strategy is realised by a Skorokhod reflection of the fund's value at a time-dependent optimal boundary. Our results are obt…

2016-09-06abs ↗pdf ↗

Proves minimax sample complexity for turn-based stochastic games.

problem Proving theoretical guarantees for reinforcement learning in turn-based stochastic games.
method Developing absorbing TBSG and reward perturbation techniques to handle statistical dependence.
result Empirical Nash equilibrium strategy approximates true Nash equilibrium in turn-based stochastic games.

Asset prices contain information about the probability distribution of future states and the stochastic discounting of those states as used by investors. To better understand the challenge in distinguishing investors' beliefs from risk-adjusted discounting, we use Perron-Frobenius Theory to isolate a positive martingal…

2014-11-28abs ↗pdf ↗

The paper studies an oligopolistic equilibrium model of financial agents who aim to share their random endowments. The risk-sharing securities and their prices are endogenously determined as the outcome of a strategic game played among all the participating agents. In the complete-market setting, each agent's set of st…

2012-06-02abs ↗pdf ↗

We consider here a Fokker--Planck equation with variable coefficient of diffusion which appears in the modeling of the wealth distribution in a multi-agent society. At difference with previous studies, to describe a society in which agents can have debts, we allow the wealth variable to be negative. It is shown that, e…

2017-09-28abs ↗pdf ↗

Study optimizes HTL-free PSCs with MWCNTs, improving efficiency and stability.

problem Optimizing efficiency and degradation in HTL-free perovskite solar cells.
method Machine learning-driven framework integrating experimental validation and numerical simulations.
result Achieved RMSEs of 0.0179 and 0.0117 for efficiency and degradation, respectively.

This paper uses probability tensors for efficient path planning in complex scenarios.

problem Efficient path planning in complex environments with obstacles and multiple goals.
method Probability tensors are used to model agent motion and decision-making, incorporating past and future information.
result The model finds solutions in complex scenarios, demonstrating realistic emergent behaviors.

In this paper, we consider domain-invariant deep learning by explicitly modeling domain shifts with only a small amount of domain-specific parameters in a Convolutional Neural Network (CNN). By exploiting the observation that a convolutional filter can be well approximated as a linear combination of a small set of dict…

2019-09-25abs ↗pdf ↗

Analyzes how uncertainty in financial networks affects stability.

problem Understanding how uncertainty in financial networks impacts stability.
method Introduced a minimal stochastic dynamical model of the interbank network with linear interactions. Derived the interaction correction to the stress expectation and studied it on the short-medium timescale.
result Interactions increase the stress expectation on average, highlighting the importance of disclosure.

New method finds graphene nanocrystals with reduced DFT calculations.

problem Efficiently discovering materials with desired properties in high-dimensional chemical space.
method Bayesian optimization with neural network kernel to minimize DFT calculations.
result Reduced computational cost by 20% for discovering materials with target properties.

Non-spanning identification of scheduled event risk in option pricing.

problem Separating continuous surface from scheduled jump in option pricing.
method Modeling FOMC decisions, CPI releases, and NFP reports as deterministic-time jumps in risk-neutral option pricing.
result Improves held-out event-spanning pricing with Gaussian and two-component mixture jumps.

In this paper, we introduce the Fairness GAN, an approach for generating a dataset that is plausibly similar to a given multimedia dataset, but is more fair with respect to protected attributes in allocative decision making. We propose a novel auxiliary classifier GAN that strives for demographic parity or equality of …

2018-05-24abs ↗pdf ↗

In a typical online learning scenario, a learner is required to process a large data stream using a small memory buffer. Such a requirement is usually in conflict with a learner's primary pursuit of prediction accuracy. To address this dilemma, we introduce a novel Bayesian online classi cation algorithm, called the Vi…

2012-05-09abs ↗pdf ↗

GOAT improves attention mechanisms by learning better priors.

problem Standard attention mechanisms use a naive uniform prior, limiting flexibility and generalization.
method GOAT introduces a trainable, continuous prior that replaces the uniform assumption, maintaining compatibility with optimized kernels.
result GOAT avoids representational trade-offs and learns an extrapolatable prior that combines positional flexibility with length generalization.

A nonparametric Bayesian sparse graph linear dynamical system (SGLDS) is proposed to model sequentially observed multivariate data. SGLDS uses the Bernoulli-Poisson link together with a gamma process to generate an infinite dimensional sparse random graph to model state transitions. Depending on the sparsity pattern of…

2018-02-21abs ↗pdf ↗

Study controlled contagion with state-dependent killing, proving a comparison principle.

problem Analyzing controlled McKean--Vlasov contagion with state-dependent killing.
method Proof of a comparison principle using Wasserstein smooth-gauge comparison and killing-jump absorption estimates.
result Established a comparison principle for the two-population killed-particle HJB.

The (abelian bosonic) heterotic string effective action, equations of motion and Bianchi identity at order alpha prime in ten dimensions, are shown to be equivalent to a higher dimensional action, its derived equations of motion and Bianchi identity. The two actions are the same up to the gauge fields: the latter are a…

2011-02-07abs ↗pdf ↗

SOCP uses SOM to find groups and local calibration buffers for better regional coverage.

problem Heterogeneous regional coverage gaps in conformal prediction.
method Self-Organizing Map (SOM) for group discovery; local calibration buffers at BMU or fixed grid.
result Reduces regional coverage gaps on 7/8 benchmarks by 7.1%.