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.

169,181 papers · 148 categories

Trend · papers per month

4589134178 · Jun 202019922001200920182026
48 results for partial evidence

Aggregator learns optimal forecast aggregation in partial evidence environments.

problem Forecast aggregation in repeated binary event settings with expert forecasts.
method Bayesian experts with partial evidence, aggregator learns optimal aggregation.
result Optimal aggregation can be learned in polynomial time for a wide range of partial evidence environments.

We perform a comparative analysis of the Chinese stock market around the occurrence of the 2008 crisis based on the random matrix analysis of high-frequency stock returns of 1228 stocks listed on the Shanghai and Shenzhen stock exchanges. Both raw correlation matrix and partial correlation matrix with respect to the ma…

2016-01-30abs ↗pdf ↗

Bayesian neural networks can be partially stochastic without losing predictive power.

problem The necessity of fully stochastic parameters in Bayesian neural networks.
method Theoretical and empirical investigation of partially stochastic networks compared to fully stochastic ones.
result Expressive predictive distributions require only small amounts of stochasticity, and partially stochastic networks can match or outperform fully stochastic networks.

Characterizes causal structure dominance for latent variables.

problem Determining dominance relations between causal structures with latent variables.
method Complete characterization for three visible variables, partial for four; uses nontrivial inequality constraints.
result Equivalence classes with nontrivial inequality constraints become ubiquitous as the number of visible variables increases.

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.

DVRL learns a generative model for partially observable environments.

problem Learning in partially observable environments with unknown models.
method Introduces a deep variational approach to learn a generative model and perform inference.
result DVRL outperforms previous methods in partially observable environments.

We have analyzed the Indices of Industrial Production (Seasonal Adjustment Index) for a long period of 240 months (January 1988 to December 2007) to develop a deeper understanding of the economic shocks. The angular frequencies estimated using the Hilbert transformation, are almost identical for the 16 industrial secto…

2013-05-10abs ↗pdf ↗

A methodology is developed to identify, as units of study, each decrease in the value of a stock from a given maximum price level. A critical level in the amount of price declines is found to separate a segment operating under a random walk from a segment operating under a power law. This level is interpreted as a poin…

2016-04-13abs ↗pdf ↗

This paper improves RL for PDE control with function-valued actions.

problem Control of PDEs with high-dimensional, spatially related actions.
method Action descriptors and deep deterministic policy gradient.
result Action descriptor approach is more sample efficient.

We investigate Riemannian (non-Kahler) Ricci flow solutions that develop finite-time Type-I singularities and present evidence in favor of a conjecture that parabolic rescalings at the singularities converge to singularity models that are shrinking Kahler-Ricci solitons. Specifically, the singularity model for these so…

2017-03-08abs ↗pdf ↗

New method improves generative model performance by fully conditioning variational posteriors.

problem Inaccurate inference due to partial conditioning of variational posteriors in sequential LVMs.
method Introduces fully-conditioned approximate posteriors to improve generative model performance.
result Improves generative modelling and multi-step prediction performance.

Develops a PIDE framework for option pricing with stochastic volatility and jumps.

problem Option pricing under stochastic volatility and jumps.
method PIDE framework derived from Lévy-type process, implemented via finite-difference discretization with FFT for nonlocal jump operator, calibrated using GMM.
result Stochastic volatility accounts for most pricing improvement, reducing implied-volatility RMSE by 39% compared to Black-Scholes.

Theoretical analysis of MCR for improving imputation quality in partially observed data.

problem Improving model generalization in partially observed settings.
method Theoretical analysis of Measure Consistency Regularization (MCR) for neural network distance.
result MCR's generalization advantage is not always guaranteed and can be monitored through a duality gap.

Tighter ELBOs can harm learning, new algorithms improve performance.

problem Theoretical and empirical evidence shows that tighter ELBOs can reduce the signal-to-noise ratio of gradient estimators, hindering learning.
method Introduce three new algorithms: PIWAE, MIWAE, CIWAE, which improve over the standard IWAE.
result New algorithms can deliver improvements over IWAE, even when measured by IWAE's performance.

Study reveals latent state computation in stochastic volatility models.

problem Understanding latent stochastic dynamics in noisy, partially observed observations.
method Multivariate stochastic volatility setting, controlled experiments on various architectures.
result Evidence of a two-stage computation: latent state encoding and output head mapping.

SigGPDE scales sparse Gaussian processes for sequential data.

problem Predicting and quantifying uncertainty in sequential data.
method Sparse variational inference framework for Gaussian Processes, leveraging GP signature kernel gradients as PDE solutions.
result Significant computational gains and state-of-the-art performance on large sequential datasets.

Study community detection in multi-view data with various types of information.

problem Community detection in multi-view data with different types of information.
method Unified theoretical framework, mutual information analysis, sharp thresholds, iterative algorithms.
result Sharp thresholds for community recovery in various multi-view settings.

Active inference implemented for high-dimensional tasks shows efficient exploration and improved sample efficiency.

problem Achieving efficient exploration and learning in complex, uncertain environments.
method Active inference framework applied to high-dimensional tasks, with Bayesian evidence maximization.
result Order of magnitude increase in sample efficiency over model-free baselines.

This study uses quantile regression to analyze U.S. firms' capital structure across different leverage levels.

problem Empirical determinants of capital structure adjustment in various macroeconomic states.
method Quantile regression method to investigate firm-specific and macroeconomic characteristics.
result Long-term and short-term debt ratios adjust at different speeds, with short-term debt increasing and long-term debt decreasing over time.

Coordinate descent methods employ random partial updates of decision variables in order to solve huge-scale convex optimization problems. In this work, we introduce new adaptive rules for the random selection of their updates. By adaptive, we mean that our selection rules are based on the dual residual or the primal-du…

2017-03-07abs ↗pdf ↗

We introduce a stochastic price model where, together with a random component, a moving average of logarithmic prices contributes to the price formation. Our model is tested against financial datasets, showing an extremely good agreement with them. It suggests how to construct trading strategies which imply a capital g…

2000-11-20abs ↗pdf ↗

This paper improves system identification by reducing sample complexity for high-dimensional linear dynamical systems.

problem High sample complexity for learning partially observed linear dynamical systems in high dimensions.
method Introduces an 1\ell_1-regularized estimation method that reduces sample complexity from linear to logarithmic with system dimension.
result Markov parameters can be learned with logarithmic number of samples relative to system dimension, improving sample complexity.

The paper explores how to handle uncertain evidence in probabilistic models.

problem Handling uncertain evidence in probabilistic models and stochastic simulators.
method The paper considers distributional evidence, Jeffrey's rule, and virtual evidence as methods for interpreting uncertain evidence.
result The paper provides guidelines on how to account for uncertain evidence and highlights the importance of careful consideration.

GEAR uses graphs to integrate and reason over multiple evidence for fact verification.

problem Fact verification requires integrating and reasoning over multiple pieces of evidence.
method GEAR employs a graph-based framework to transfer information among evidence and uses BERT for improved performance.
result GEAR achieves a promising test FEVER score of 67.10% on a large-scale benchmark dataset.

Evidence acquisition costs influence disclosure behavior and preference.

problem How evidence acquisition costs affect disclosure behavior and preference.
method Analyzes sender-receiver interactions with covert and overt evidence acquisition, varying certification costs.
result Equilibria converge to the Pareto-worst free-learning equilibrium as costs vanish, and receivers prefer covert to overt acquisition.

New method identifies flawed internal models of the world in animals.

problem How animals make decisions with partial sensory information.
method Generalizes Inverse Rational Control to continuous nonlinear dynamics and noise.
result Identifies the best internal model explaining an agent's actions.

Enhances clustering by using external categorical data.

problem Improving clustering outcomes using external categorical evidence.
method Evidence transfer method that manipulates autoencoder latent representations based on external categorical data.
result Our method effectively manipulates latent representations with real evidence and remains robust with low quality evidence.

This paper evaluates a method to improve representations using incomplete external evidence across tasks.

problem Increasing labelled data quality and quantity is challenging due to manual labelling errors and noise.
method Evidence Transfer method using incomplete categorical external evidence.
result Evidence Transfer proves effective and robust against different levels of incompleteness.

This article introduces a framework to estimate the value of evidence-based decision making.

problem Lack of empirical tools to assess the value of evidence-based decision making and optimize statistical precision.
method Empirical framework using parametric and nonparametric empirical Bayes methods.
result The value of statistical evidence depends on how organizations translate it into policy decisions.