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

Trend · papers per month

3875113150 · Jun 202019922001200920172026
48 results for Pure interactions

We model a closed economic system with interactions that generates the features of empirical wealth distribution across all wealth brackets, namely a Gibbsian trend in the lower and middle wealth range and a Pareto trend in the higher range, by simply limiting the an agents' interaction to only agents with nearly the s…

2007-10-04abs ↗pdf ↗

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 ↗

We develop a formalism to study linearized perturbations around the equilibria of a pure exchange economy. With the use of mean field theory techniques, we derive equations for the flow of products in an economy driven by heterogeneous preferences and probabilistic interaction between agents. We are able to show that i…

2009-04-08abs ↗pdf ↗

Interacting systems are prevalent in nature, from dynamical systems in physics to complex societal dynamics. The interplay of components can give rise to complex behavior, which can often be explained using a simple model of the system's constituent parts. In this work, we introduce the neural relational inference (NRI…

2018-02-13abs ↗pdf ↗

In many healthcare settings, intuitive decision rules for risk stratification can help effective hospital resource allocation. This paper introduces a novel variant of decision tree algorithms that produces a chain of decisions, not a general tree. Our algorithm, αα-Carving Decision Chain (ACDC), sequentially carves o…

2016-06-16abs ↗pdf ↗

We present chemlambda (or the chemical concrete machine), an artificial chemistry with the following properties: (a) is Turing complete, (b) has a model of decentralized, distributed computing associated to it, (c) works at the level of individual (artificial) molecules, subject of reversible, but otherwise determinist…

2014-03-31abs ↗pdf ↗

SDAMI enhances interpretable high-dimensional regression with sparse deep learning and footprint principle.

problem Personalized models for small samples and high-dimensional features with interpretability.
method Sparse Deep Additive Model with Interactions (SDAMI) combining sparsity-driven feature selection and deep subnetworks.
result SDAMI successfully identifies pure interactions with near-zero false positive rates.

Expander graphs have been, during the last five decades, the subject of a most fruitful interaction between pure mathematics and computer science, with influence and applications going both ways (cf. [Lub94], [HLW06], [Lub12] and the references therein). In the last decade, a theory of "high dimensional expanders" has …

2017-12-07abs ↗pdf ↗

This is a survey concerning the relationship between Lie Groupoids (and their morphisms) and singular foliations in the sense of Sussmann-Stefan (considered from a purely geometrical point of view). We focus on the interaction between the algebraic and differentiable structures underlying Lie groupoids, and between gro…

2007-11-15abs ↗pdf ↗

This work finds mixed equilibria in zero-sum games using interacting particle dynamics.

problem Finding mixed equilibrium points in continuous minmax games.
method A method based on entropic regularisation of two-layer zero-sum games with interacting particle dynamics.
result The sequence of empirical measures of the particle system satisfies a large deviation principle as the number of particles grows to infinity, implying convergence of the empirical measure and the Nikaidô-Isoda error.

Purely data driven approaches for machine learning present difficulties when data is scarce relative to the complexity of the model or when the model is forced to extrapolate. On the other hand, purely mechanistic approaches need to identify and specify all the interactions in the problem at hand (which may not be feas…

2011-07-13abs ↗pdf ↗

The collective phenomena of a liquid market is characterized in terms of a particle system scenario. This physical analogy enables us to disentangle intrinsic features from purely stochastic ones. The latter are the result of environmental changes due to a `heat bath' acting on the many-asset system, quantitatively des…

2001-09-03abs ↗pdf ↗

We consider few-body bound state systems and provide precise definitions of Borromean and Brunnian systems. The initial concepts are more than a hundred years old and originated in mathematical knot-theory as purely geometric considerations. About thirty years ago they were generalized and applied to the binding of sys…

2012-05-03abs ↗pdf ↗

KG-A2C agent learns natural language IF games by reasoning and constraining action spaces.

problem Challenges of natural language understanding, partial observability, and combinatorially large action spaces in IF games.
method Builds a dynamic knowledge graph while exploring, constraining actions using templates.
result Outperforms current IF agents across various games with larger action spaces.

The paper analyzes how to combine self-protection and self-insurance for risk reduction.

problem Combining self-protection and self-insurance for risk reduction when market insurance is absent.
method The approach uses Value-at-Risk and Tail Value-at-Risk to evaluate residual risk and solves the problem using isoquant geometry based on marginal-balance curves.
result The analysis identifies the conditions under which self-protection and self-insurance behave as substitutes or complements.

Algorithm balances online and offline data for linear bandits.

problem Online learning with an offline dataset in linear bandits.
method Proposes a linear bandit algorithm that uses offline data early and increasingly favors exploration as the horizon grows.
result Establishes regret bounds showing competitive performance with both purely online and offline solutions.

Proposes a new method to better understand complex system interactions.

problem Current methods like Granger causality and transfer entropy fail to capture higher-order interactions.
method Introduces a generalized approach to capture multivariate causal interactions.
result The method can distinguish causal roles in synergetic interactions.

Study of dynamic competition between old and new technologies using a nonlinear map.

problem Dynamic competition between old and new technologies in market share.
method Simulations with three key parameters: scientific-technological, purely technological, and economic.
result Different outcomes in terms of technology prevalence based on interaction of key parameters.

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 ↗

Paper proposes a hybrid RL algorithm that combines offline and online data without needing reward info.

problem How to efficiently use online data to improve RL policies using only offline data.
method A three-stage hybrid RL algorithm that uses reward-agnostic exploration and model-based offline RL.
result The hybrid RL algorithm outperforms both pure offline and pure online RL in sample complexity.

A novel double-space tensor-product RKHS framework for hybrid uncertainty sensitivity analysis.

problem Quantifying the influence of hybrid aleatory and epistemic uncertainties on high-dimensional system responses.
method A novel double-space tensor-product RKHS framework for sensitivity analysis under hybrid uncertainty.
result Concurrent double Möbius inversion orthogonally decomposes global dependence measure into pure aleatory effects, pure epistemic effects, and their interaction contributions.

The ability of modeling the other agents, such as understanding their intentions and skills, is essential to an agent's interactions with other agents. Conventional agent modeling relies on passive observation from demonstrations. In this work, we propose an interactive agent modeling scheme enabled by encouraging an a…

2018-10-01abs ↗pdf ↗

Study optimal liquidation strategies in lit and dark pools with and without regulation.

problem Optimal liquidation strategies in dark and lit pools with execution uncertainty.
method Design optimal make-take fee policies, solve HJB-Fokker-Planck systems, use BSDEs.
result Explicit solutions for optimal strategies in both competitive and regulated markets.

Complex environments and tasks pose a difficult problem for holistic end-to-end learning approaches. Decomposition of an environment into interacting controllable and non-controllable objects allows supervised learning for non-controllable objects and universal value function approximator learning for controllable obje…

2019-01-27abs ↗pdf ↗

NOHD optimizes multi-agent systems by decomposing dynamics into irrotational and solenoidal components.

problem Non-stationarity and conflicting interests in multi-agent learning problems.
method NOHD (Newton Optimization on Helmholtz Decomposition) decomposes system dynamics into irrotational and solenoidal components.
result NOHD ensures quadratic convergence in purely irrotational and solenoidal systems and attracts to stable fixed points in general multi-agent systems.

CIB compresses variables causally, preserving key causal interactions.

problem Constructing causal variable abstractions in complex systems.
method Causal Information Bottleneck (CIB) method, extending IB to include causal structures.
result CIB produces causally interpretable abstractions that accurately capture causal relations.

Enhances disease progression modeling using LLMs for complex brain connectivity.

problem Inaccurate predictions of disease spread due to oversimplified brain connectivity models.
method Uses LLMs to synthesize multi-modal relationships and learn disease trajectories from longitudinal data.
result Superior prediction accuracy and interpretability compared to traditional methods.

In several realistic situations, an interactive learning agent can practice and refine its strategy before going on to be evaluated. For instance, consider a student preparing for a series of tests. She would typically take a few practice tests to know which areas she needs to improve upon. Based of the scores she obta…

2017-06-07abs ↗pdf ↗

The paper characterizes metallic pseudo-Riemannian manifolds using conjugate connections and tensor structures.

problem Characterizing metallic pseudo-Riemannian manifolds.
method Using conjugate connections and tensor structures, the paper derives new characterizations and conditions for these manifolds.
result A necessary and sufficient condition for a non-integrable metallic pseudo-Riemannian manifold to be a quasi metallic pseudo-Riemannian manifold is derived.