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

255176101 · Jun 202019922001200920172026
48 results for mutual influence

This study analyzes mutual influence on investment strategies of financial market agents.

problem Mutual influence among agents in financial markets and its impact on investment strategies.
method Formulated optimal investment differential game problem, derived analytical solutions, proposed fast algorithm, and theoretically analyzed mutual influence.
result Agents' optimal strategies converge to the asymptotic strategy when mutual influence is strong and approaches infinity.

This paper considers mutual obligations in the interconnected bank system and analyzes their influence on joint and marginal survival probabilities as well as CDS and FTD prices for the individual banks. To make the role of mutual obligations more transparent, a simple structural default model with banks' assets driven…

2015-05-08abs ↗pdf ↗

We find the maximum mutual information for neural networks and its key determinants.

problem Understanding the maximum mutual information in neural architectures.
method Derived closed-form expression for maximum mutual information across neural network families.
result Maximum mutual information stems from a generalized formula and is influenced by network width and statistical invariances.

Exploration is a difficult challenge in reinforcement learning and is of prime importance in sparse reward environments. However, many of the state of the art deep reinforcement learning algorithms, that rely on epsilon-greedy, fail on these environments. In such cases, empowerment can serve as an intrinsic reward sign…

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

Paper reviews neurolinguistics and language technologies, emphasizing mutual enrichment.

problem Understanding brain activity during language processing.
method Brain imaging studies and natural language representations.
result Development of brain-aware natural language representations.

Many networks are complex dynamical systems, where both attributes of nodes and topology of the network (link structure) can change with time. We propose a model of co-evolving networks where both node at- tributes and network structure evolve under mutual influence. Specifically, we consider a mixed membership stochas…

2011-06-14abs ↗pdf ↗

Intrinsically motivated reinforcement learning aims to address the exploration challenge for sparse-reward tasks. However, the study of exploration methods in transition-dependent multi-agent settings is largely absent from the literature. We aim to take a step towards solving this problem. We present two exploration m…

2019-10-12abs ↗pdf ↗

In the field of machine learning, it is still a critical issue to identify and supervise the learned representation without manually intervening or intuition assistance to extract useful knowledge or serve for the downstream tasks. In this work, we focus on supervising the influential factors extracted by the variation…

2018-09-06abs ↗pdf ↗

Collective behaviours taking place in financial markets reveal strongly correlated states especially during a crisis period. A natural hypothesis is that trend reversals are also driven by mutual influences between the different stock exchanges. Using a maximum entropy approach, we find coordinated behaviour during tre…

2013-10-30abs ↗pdf ↗

FR-Train improves fair and robust AI training by detecting and reducing poisoned data.

problem Training AI models that are fair and robust in the presence of data bias and poisoning.
method Mutual information-based adversarial training with an additional discriminator.
result FR-Train maintains fairness and accuracy even in the presence of poisoned data.

Is the large influence that mutual funds assert on the U.S. financial system spread across many funds, or is it is concentrated in only a few? We argue that the dominant economic factor that determines this is market efficiency, which dictates that fund performance is size independent and fund growth is essentially ran…

2008-07-24abs ↗pdf ↗

Paper introduces a neural network-based non-stationary influence kernel for complex event data.

problem Modeling complex, non-stationary, and dependent discrete event data.
method Neural Spectral Marked Point Processes (NSMPP) with a versatile non-stationary influence kernel.
result NSMPP outperforms state-of-the-art models on synthetic and real data.

We propose an approach to self-supervised representation learning based on maximizing mutual information between features extracted from multiple views of a shared context. For example, one could produce multiple views of a local spatio-temporal context by observing it from different locations (e.g., camera positions w…

2019-06-03abs ↗pdf ↗

The influence of additional information on the decision making of agents, who are interacting members of a society, is analyzed within the mathematical framework based on the use of quantum probabilities. The introduction of social interactions, which influence the decisions of individual agents, leads to a generalizat…

2012-02-21abs ↗pdf ↗

We introduce a framework to infer lead-lag networks between the states of elements of complex systems, determined at different timescales. As such networks encode the causal structure of a system, infering lead-lag networks for many pairs of timescales provides a global picture of the mutual influence between timescale…

2019-01-03abs ↗pdf ↗

We analyze an optimal stopping problem with random maturity under a nonlinear expectation with respect to a weakly compact set of mutually singular probabilities P\mathcal{P}. The maturity is specified as the hitting time to level 00 of some continuous index process at which the payoff process is even allowed to have…

2015-05-28abs ↗pdf ↗

Proposes a new framework for resource-limited recommendation.

problem Resource constraints affect user choices in recommendation tasks.
method Interest-behavior multiplicative network with MRRNNs and resource-limited branch.
result Framework effectively predicts user interactions considering resource limitations.

New method calculates empowerment from visual data, solving complex reinforcement learning problems.

problem Calculating empowerment in unknown dynamics from visual observation is challenging.
method Developed a novel approach using stochastic dynamic models in latent space and the Water-Filling algorithm.
result Efficiently computed empowerment in unknown dynamics from visual observation only.

A deep reinforcement learning approach for slate re-ranking in e-commerce.

problem Improving user satisfaction in e-commerce by optimizing the ranking of items in a slate.
method Generator and Critic approach, using reinforcement learning and a Full Slate Critic model.
result The Generator and Critic approach significantly outperforms existing methods in slate evaluation and efficiency.

Proposes Infomax and Domain-Independent Representations for robust causal inference.

problem Handling treatment selection bias and domain imbalance in causal inference with real-world data.
method Utilizes mutual information to learn domain-invariant representations that maximize predictive common information.
result Achieves state-of-the-art performance on causal effect inference across various data distributions.

New method tightens bounds on causation probabilities using independent datasets.

problem Challenging point identification of causation probabilities without strong assumptions.
method Imposes counterfactual consistency between SCMs constructed from independent datasets and uses conditional mutual information.
result Significantly tighter bounds on causation probabilities are established.

Price without transaction makes no sense. Trading volume authenticates its corresponding price, so there exist mutual information and correlation between price and trading volume. We are curious about fractal features of this correlation and need to know how structures in different scales translate information. To expl…

2019-03-05abs ↗pdf ↗

Paper describes profiles of multivariate normal distributions and novel estimators for mutual information.

problem Estimating mutual information for complex distributions.
method Analytical description of profiles, introduction of Bend and Mix Models, Monte Carlo estimation.
result Bend and Mix Models accurately estimate mutual information profiles and provide Bayesian estimates.

Paper benchmarks mutual info estimators on diverse distributions.

problem Evaluating mutual information estimators on complex, real-world distributions.
method Constructs a diverse family of known-ground truth distributions, proposes a benchmark platform.
result Highlights differences in classical and neural estimators' performance across various conditions.

Improved bounds on learning algorithms' performance using conditional mutual information.

problem Bounding the generalization error of learning algorithms.
method Introducing conditional mutual information and disintegrated mutual information to tighten bounds.
result New bounds are tighter than previous ones, especially for noisy, iterative algorithms.

We design a new nonparametric method that allows one to estimate the matrix of integrated kernels of a multivariate Hawkes process. This matrix not only encodes the mutual influences of each nodes of the process, but also disentangles the causality relationships between them. Our approach is the first that leads to an …

2016-07-21abs ↗pdf ↗

The paper argues that normalized mutual information is biased in clustering and community detection.

problem Bias in normalized mutual information for clustering and community detection.
method Introducing a modified version of mutual information to correct for information content and spurious dependence.
result The modified mutual information leads to different conclusions about which algorithms are best for community detection.

Measuring mutual information from finite data is difficult. Recent work has considered variational methods maximizing a lower bound. In this paper, we prove that serious statistical limitations are inherent to any method of measuring mutual information. More specifically, we show that any distribution-free high-confide…

2018-11-10abs ↗pdf ↗

TCMI assesses mutual dependence of continuous variables without parametric assumptions.

problem Estimating mutual information from continuous distributions.
method TCMI extends mutual information to continuous variables using cumulative distributions.
result TCMI facilitates feature selection and ranking of variable sets.