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

Trend · papers per month

8.3%16.7%25.0%33.3% · Jan 199319922001200920172026
48 results for partial information

We consider a financial market model with a single risky asset whose price process evolves according to a general jump-diffusion with locally bounded coefficients and where market participants have only access to a partial information flow. For any utility function, we prove that the partial information financial marke…

2013-02-18abs ↗pdf ↗

Study on pricing rules for income streams with partial insider information.

problem Determining the value of partial information in pricing rules for income streams.
method Analyzes three types of agents with varying levels of jump information and derives explicit state price densities.
result Explicit formulas for pricing rules with different levels of jump information are provided.

CONCERT improves transfer learning by borrowing partial information from auxiliary datasets.

problem Inefficiency of global similarity measures in transfer learning for high-dimensional data.
method Conditional spike-and-slab prior with covariate-specific priors for robust partial information transfer.
result CONCERT achieves variable selection and information transfer simultaneously, improving performance on the target.

The question addressed in this paper is the performance of the optimal strategy, and the impact of partial information. The setting we consider is that of a stochastic asset price model where the trend follows an unobservable Ornstein-Uhlenbeck process. We focus on the optimal strategy with a logarithmic utility functi…

2015-10-13abs ↗pdf ↗

Study market efficiency under partial information using SDEs and optimization.

problem Market efficiency under partial information constraints.
method McKean-Vlasov-type SDEs, Wasserstein barycenters, KL divergence, convex optimization, optimal control, nonlinear filtering.
result Convergence of reduced-information market price processes to true price process under increasing information flow.

The paper analyzes worst-case distortion risk metrics and weighted entropy under partial information.

problem Analyzing worst-case distortion risk metrics and weighted entropy with limited information.
method General distributions, partial information (mean and variance), various entropies and risk measures.
result Provides worst-case results for distortion risk metrics and weighted entropy.

Enhances reinforcement learning with partial state information.

problem Improving learning under partial observability with limited privileged signals.
method Introduced informed asymmetric actor-critic framework that uses arbitrary state-dependent privileged signals.
result Unbiased policy gradient estimates with arbitrary privileged signals.

New method quantifies redundant information using information bottleneck.

problem Quantifying redundant information among multiple sources.
method Formulated as an information bottleneck problem, termed redundancy bottleneck.
result Extracts information that best predicts the target without revealing source identity.

Study proves value of non-Markovian games with partial, asymmetric info.

problem Value of non-Markovian Dynkin games with partial and asymmetric information.
method Probabilistic and functional analytic approach based on Sion's min-max theorem.
result Existence of optimal strategies for both players in randomised stopping times.

Inference for normal and Monte Carlo distributions using minimum relative entropy.

problem Inference from partial information on expectations and covariances.
method Minimum relative entropy sub-manifolds, analytical formulas, Monte Carlo simulations.
result Improved numerical implementation for inference from partial information.

This paper concerns the recursive utility maximization problem under partial information. We first transform our problem under partial information into the one under full information. When the generator of the recursive utility is concave, we adopt the variational formulation of the recursive utility which leads to a s…

2016-05-19abs ↗pdf ↗

The paper extends utility maximization by integrating partial information and robust VaR constraints.

problem Optimal investment under partial information and robust VaR-type constraints.
method Combines partial information and robust regulatory constraints (VaR) to solve the utility maximization problem.
result Optimal wealth is a decreasing function of state price density, and depends on the overall evolution of the estimated market price of risk.

The paper analyzes how investors' wealth can decline collectively under partial information.

problem Investors' wealth can decline collectively under partial information.
method The paper derives a Nash equilibrium for mean-variance portfolio selection under relative performance criteria, considering both full and partial information.
result Relative performance criteria can lead to downward self-reinforcement of investors' wealth, which is more pronounced under partial information.

The paper analyzes extreme risk measures with limited distributional information.

problem Investigating risk measures under partial knowledge of distribution moments and shape.
method Employing probability inequalities and modified Schwarz inequality to derive bounds on distortion risk measures.
result Unified framework for calculating best- and worst-case scenarios of distortion risk measures.

New BED method handles online inference for partially observed dynamical systems.

problem Optimizing data collection for partially observable, partially online dynamical systems.
method Derived estimators of expected information gain and its gradient for SSMs, using nested particle filters.
result Successfully handles both partial observability and online inference in realistic models.

Optimizes fund manager's wealth with partial information on market risk.

problem Maximizing wealth with incomplete information about market risk.
method Formulated as optimization under partial information, solved via martingale method and concavification.
result Shows how learning about market risk affects optimal investment strategy.

Proposes a new GAN architecture for generating data conditioned on partial information.

problem Generating data conditioned on partial ancillary information.
method Introduces a new Adversarial Network architecture and training strategy.
result The proposed method outperforms standard Conditional GANs in generating data under partial conditioning.

Modeling market dynamics with informed and uninformed traders and fads.

problem Optimizing market making in a market with fads, informed, and uninformed traders.
method Characterizing the optimal liquidity provision problem in a market with fads, informed, and uninformed traders, considering both complete and partial information.
result The price of liquidity is a function of the proportion of informed traders, and strategies ignoring fads underperform.

RID framework quantifies and regularizes task-relevant knowledge in distillation.

problem Distilling irrelevant information can hinder student model performance.
method Partial Information Decomposition to quantify and regularize task-relevant knowledge.
result RID framework leads to more resilient distillation under nuisance teachers.

The econophysics approach to socio-economic systems is based on the assumption of their complexity. Such assumption inevitably lead to another assumption, namely that underlying interconnections within socio-economic systems, particularly financial markets, are nonlinear, which is shown to be true even in mainstream ec…

2014-03-09abs ↗pdf ↗

Study portfolio optimization with partial info and drawdown constraints using deep learning.

problem Optimizing portfolios with partial information and maximum drawdown constraints.
method Bayesian framework, dynamic programming, semi-explicit solutions, deep learning for stochastic control.
result Numerical solutions and performance analysis with deep learning, convergence to Merton problem.

In this paper we study the Föllmer-Schweizer decomposition of a square integrable random variable ξξ with respect to a given semimartingale SS under restricted information. Thanks to the relationship between this decomposition and that of the projection of ξξ with respect to the given information flow, we characteri…

2015-11-17abs ↗pdf ↗

Abstract: Determines thermoelastic coefficients from boundary data.

problem Determining coefficients of thermoelastic system from boundary information.
method Explicit expression for thermoelastic Dirichlet-to-Neumann map with variable coefficients.
result Thermoelastic Dirichlet-to-Neumann map uniquely determines coefficients on the manifold.

In this paper we prove that, in the category of chain complexes, partial algebras can be functorially replaced by quasi-isomorphic algebras. In particular, partial algebras contain all of the important homological and homotopical information that genuine algebras do. Applying this result to McClure's partial algebra in…

2004-10-18abs ↗pdf ↗

We provide a simple and efficient algorithm for adversarial kk-action dd-outcome non-degenerate locally observable partial monitoring game for which the nn-round minimax regret is bounded by 6(d+1)k3/2nlog(k)6(d+1) k^{3/2} \sqrt{n \log(k)}, matching the best known information-theoretic upper bound. The same algorithm also achieves…

2019-07-12abs ↗pdf ↗

The paper explores the tradeoffs between fairness measures in machine learning.

problem The challenge of achieving all three fairness notions simultaneously in machine learning models.
method The approach uses partial information decomposition (PID) to analyze the relationships between fairness measures.
result Identifies the regions where fairness measures overlap and disagree, revealing potential tradeoffs.

A measure of neural complexity quantifies how hard it is to access information across neurons.

problem Understanding how mutual information is distributed among neurons in neural networks.
method Partial Information Decomposition (PID) to disentangle contributions of single neurons, multiple neurons, and synergistic effects.
result Representational Complexity measures the difficulty of accessing information across multiple neurons.

New algorithms for efficient learning with partial information, reducing regret.

problem Online learning with partial observability and semi-bandit feedback.
method Implicit exploration strategy for near-optimal regret guarantees.
result First algorithms with near-optimal regret guarantees without knowing the observation system.

The paper calculates bounds for risk metrics and entropies under partial information constraints.

problem Analyzing risk metrics and entropies for unimodal, symmetric distributions with limited information.
method Develops lower and upper bounds for worst-case distortion riskmetrics and weighted entropy for unimodal, symmetric distributions with known mean and variance.
result Sharp upper bounds for distortion riskmetrics and weighted entropy for symmetric distributions.

Proposes SPCA to incorporate structural constraints in model identification.

problem Model identification with partial structural knowledge.
method Structural Principal Component Analysis (SPCA) that leverages structural information.
result Demonstrates improved model estimates using synthetic and industrial data.

The goal of subspace learning is to find a kk-dimensional subspace of Rd\mathbb{R}^d, such that the expected squared distance between instance vectors and the subspace is as small as possible. In this paper we study subspace learning in a partial information setting, in which the learner can only observe rdr \le d att…

2014-02-19abs ↗pdf ↗