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

109218327436 · Jun 202019922001200920172026
48 results for incomplete information

A new criterion HBIC improves model selection for factor analysis with missing data.

problem Model selection for factor analysis with incomplete data.
method Proposes a novel criterion HBIC that uses actual observed information in the penalty term.
result HBIC is more accurate than BIC when missing data rates are high.

The paper analyzes trading strategies in a competitive market with incomplete information.

problem Strategic trading under uncertainty when firms lack full knowledge of competitors' strategies.
method Bayesian games framework to incorporate uncertainty and derive optimal trading strategies.
result Uncertainty significantly impacts trading strategies compared to complete information scenarios.

We derive asset pricing formula for markets with incomplete information and subjective views.

problem Asset pricing in markets with informational imperfections and subjective investor beliefs.
method Closed-form market equilibrium formula based on Merton's model, non-linear system of equations, conditional posterior distribution.
result Derivation of market reference model for excess returns under random shadow-costs.

Paper improves ML estimation from incomplete data with robust M-estimator.

problem Estimating parameters from incomplete data with improved accuracy.
method Developed a robust M-estimator and a sandwich estimator for standard errors.
result Improved estimation accuracy with smaller standard errors than ML estimates.

A new method for state estimation in state-space models using incomplete data.

problem State estimation in nonlinear state-space models with incomplete observations.
method Statistical analysis of incomplete observations, score function, observed information matrices, EM-gradient-particle filtering.
result Maximum likelihood estimation of state-vector with explicit form of observed information matrix.

LLMs generate answers under incomplete context, and their uncertainty should scale with missing information.

problem Evaluating the quality of LLM answers under incomplete context.
method A controlled framework with varying context availability, and two uncertainty measures (sampling-based confidence and response entropy) evaluated on SQuAD.
result Response entropy increases with context removal and explains more variance in accuracy than confidence, suggesting it is a more responsive uncertainty measure.

Develops a novel ML smoothing method for incomplete data in state-space models.

problem Estimating states in stochastic systems with incomplete information.
method Introduces score function and conditional observed information matrices for incomplete data, and uses them to derive the ML smoother.
result The ML smoother provides more accurate state estimates with lower standard errors compared to the standard ML state estimator.

Relational data are usually highly incomplete in practice, which inspires us to leverage side information to improve the performance of community detection and link prediction. This paper presents a Bayesian probabilistic approach that incorporates various kinds of node attributes encoded in binary form in relational m…

2017-06-14abs ↗pdf ↗

MUSIC learns coupled systems with sparse data and incomplete physics.

problem Learning coupled systems with incomplete physical constraints and missing data.
method Sparsity induced multitask neural network framework integrating partial physical constraints with data-driven learning.
result MUSIC accurately learns solutions to complex coupled systems under data-scarce and noisy conditions.

This paper extends the recently proposed and theoretically justified iterative thresholding and KK residual means algorithm ITKrM to learning dicionaries from incomplete/masked training data (ITKrMM). It further adapts the algorithm to the presence of a low rank component in the data and provides a strategy for recove…

2017-01-13abs ↗pdf ↗

DaringFed incentivizes clients in OFL with dynamic rewards under TII.

problem Designing incentives for OFL clients under dynamic, incomplete information.
method Formulated as a dynamic signaling and pricing allocation problem in a Bayesian persuasion game.
result Optimal design of DaringFed improves accuracy and convergence speed by 16.99%.

Study on hedging and valuation of basis risk in incomplete markets with partial information.

problem Hedging and valuation of European and American claims in an incomplete market with correlated assets and partial information.
method Stochastic control and partial information scenario, forward indifference valuation, dual representation, PDE approach.
result Derivation of optimal hedging strategy and forward indifference price representation for claims.

Bayesian method optimizes rescheduling for multipurpose batch processes with incomplete look-ahead information.

problem Optimizing rescheduling for multipurpose batch processes under incomplete look-ahead information.
method Proposes a Bayesian dynamic scheduling method that learns from disturbances and updates schedules online.
result Achieves statistically better long-term costs and system nervousness compared to existing periodic rescheduling strategies.

This essay quantifies convexities in incomplete markets using entropy, adjusting prices for risk and incompleteness.

problem Quantifying convexities in incomplete markets and adjusting prices for risk and incompleteness.
method Using entropy, the essay quantifies convexities and adjusts prices for risk and incompleteness in incomplete markets.
result A new price principle derived from a log-martingale condition is introduced, matching risk aversion and adjusting for market incompleteness and default risk.

Bayesian approach for handling incomplete clinical data.

problem Challenges in machine learning with multimodal, incomplete clinical data.
method Generative and discriminative learning, semi-supervised strategy, imputation of missing views.
result Automatic imputation of missing views and robust inference across different data sources.

Paper addresses unsupervised learning from incomplete measurements in inverse problems.

problem Learning from incomplete measurements is challenging in inverse problems.
method Use multiple measurement operators to overcome nullspace issues; propose a novel unsupervised learning loss.
result Presented necessary and sufficient conditions for successful unsupervised learning.

Study optimal liquidation with incomplete trend information and multiplicative price impact.

problem Optimal liquidation of assets with incomplete trend information and multiplicative price impact.
method Singular stochastic control problem with finite-fuel constraint and partial observation. Equivalent three-dimensional degenerate problem under full information. Two-dimensional optimal stopping problem with belief-dependent free boundary.
result Optimal execution rule and value function expressed in terms of a nonlinear integral equation, solved through Monte-Carlo method.

In many application settings, the data have missing entries which make analysis challenging. An abundant literature addresses missing values in an inferential framework: estimating parameters and their variance from incomplete tables. Here, we consider supervised-learning settings: predicting a target when missing valu…

2019-02-19abs ↗pdf ↗

Unified physics-informed learning method improves generalization performance.

problem Lack of theoretical analysis for hybrid settings with incomplete physical constraints.
method Unified residual form unifying collocation and variational methods, establishing generalization performance governed by affine variety dimension.
result Generalization performance is determined by affine variety dimension, not just the number of parameters.

Nowadays, multi-view clustering has attracted more and more attention. To date, almost all the previous studies assume that views are complete. However, in reality, it is often the case that each view may contain some missing instances. Such incompleteness makes it impossible to directly use traditional multi-view clus…

2019-03-07abs ↗pdf ↗

Optimal B-robust estimate is constructed for multidimensional parameter in drift coefficient of diffusion type process with small noise. Optimal mean-variance robust (optimal V -robust) trading strategy is find to hedge in mean-variance sense the contingent claim in incomplete financial market with arbitrary informatio…

2008-05-01abs ↗pdf ↗

New model handles missing data effectively in autoregressive models.

problem Handling missing data in autoregressive models.
method Reinterpret existing models through missing data lens, introduce principled framework for incomplete datasets, active information acquisition.
result MO-ARM consistently outperforms imputation baselines across real-world benchmarks.

In nonlinear state-space models, sequential learning about the hidden state can proceed by particle filtering when the density of the observation conditional on the state is available analytically (e.g. Gordon et al., 1993). This condition need not hold in complex environments, such as the incomplete-information equili…

2011-05-23abs ↗pdf ↗

In this paper, we study a continuous time structural asset value model for two correlated firms using a two-dimensional Brownian motion. We consider the situation of incomplete information, where the information set available to the market participants includes the default time of each firm and the periodic asset value…

2014-09-04abs ↗pdf ↗

In this paper the theory of semi-bounded rationality is proposed as an extension of the theory of bounded rationality. In particular, it is proposed that a decision making process involves two components and these are the correlation machine, which estimates missing values, and the causal machine, which relates the cau…

2013-05-26abs ↗pdf ↗

Paper studies how incomplete data affects machine learning, proposing 'Certain Predictions' for NN classifiers.

problem Impact of incomplete and inconsistent data on machine learning applications.
method Extends Certain Answers concept to machine learning, introduces 'Certain Predictions' for NN classifiers.
result Developed efficient solutions for CP queries in NN classifiers, improving classification accuracy.

We consider the problem of recovering an expert's reward function with inverse reinforcement learning (IRL) when there are missing/incomplete state-action pairs or observations in the demonstrated trajectories. This issue of missing trajectory data or information occurs in many situations, e.g., GPS signals from vehicl…

2019-11-16abs ↗pdf ↗

Imitation learning targets deriving a mapping from states to actions, a.k.a. policy, from expert demonstrations. Existing methods for imitation learning typically require any actions in the demonstrations to be fully available, which is hard to ensure in real applications. Though algorithms for learning with unobservab…

2019-05-29abs ↗pdf ↗

Mutual information maximization has emerged as a powerful learning objective for unsupervised representation learning obtaining state-of-the-art performance in applications such as object recognition, speech recognition, and reinforcement learning. However, such approaches are fundamentally limited since a tight lower …

2019-03-28abs ↗pdf ↗

In practice, one must recognize the inevitable incompleteness of information while making decisions. In this paper, we consider the optimal redeeming problem of stock loans under a state of incomplete information presented by the uncertainty in the (bull or bear) trends of the underlying stock. This is called drift unc…

2019-01-20abs ↗pdf ↗

Framework for generating multiple clusterings from multi-view data.

problem Challenges in finding optimal clustering criteria and handling incomplete multi-view data.
method DiMVMC framework that optimizes multiple decoder deep networks to complete data views and generate shared representations.
result DiMVMC outperforms state-of-the-art competitors in generating multiple clusterings with high diversity and quality.

Researchers tackle insider trading in incomplete markets using a discrete-time jump process approach.

problem Tackles insider trading in incomplete markets under the trinomial model.
method Uses a marked binomial process and stochastic analysis with Malliavin calculus.
result Identifies insider expected additional utility with Shannon entropy of extra information.

New method clusters strong and weak views effectively, improving performance by up to 40%.

problem Clustering incomplete multi-view data with unbalanced incompleteness.
method View evolution scheme and weighted multi-view subspace clustering.
result Improves clustering performance by up to 40% on three metrics.