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 inference

Differentiable relaxation for inferring partial orders from noisy linear data.

problem Inference of partial orders from linear data with noisy observations.
method Introducing a differentiable relaxation to model noisy linear extensions, replacing discontinuous precedence and feasibility with smooth surrogates.
result Smooth posterior that preserves partial-order semantics, supports gradient-based inference, and converges to hard likelihood.

The paper tackles partial inference in structured prediction using a convex optimization approach.

problem Maximizing a score function with unary and pairwise potentials in graph label spaces.
method Generative model approach with two-stage convex optimization for label recovery.
result Conditions for recovering a majority of labels with provable guarantees.

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.

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.

New algorithm infers trajectories from partial observations using optimal transport.

problem Inferring trajectories from partial observations of coupled systems.
method Extends MFL algorithm to latent SDEs using observable state space models and partial observations.
result Experiments show significant outperformance over latent-free baseline.

Study uses deep neural networks for inference in partially linear models with dependent data.

problem Inference in partially linear models with dependent data.
method First stage deep neural network (DNN) estimation followed by n\sqrt{n}-consistent and asymptotically normal estimator.
result The DNN-estimated finite dimensional parameter achieves n\sqrt{n}-consistency and asymptotic normality.

A new approach uses partial likelihood to improve tree-based density estimation and inference.

problem Inference on tree-based models suffers from overfitting and reduced efficiency due to data-independent partitioning.
method Proposes a partial likelihood approach to data-dependent partitioning of tree-based models.
result Significant gains in estimation accuracy and computational efficiency from adopting partial likelihood.

ParKCa combines multiple causal inference methods to infer new causes from known and unknown factors.

problem Causal inference from observational data when randomized experiments are not feasible.
method ParKCa uses a stacking approach to combine results from multiple causal inference methods.
result ParKCa infers more causes than existing methods in real-world and simulated datasets.

PPI uses predictions and weighting to infer from partially labeled data.

problem Valid inference with partially labeled data.
method Combines model-based predictions with bias correction from labeled data, using Horvitz-Thompson and Hájek corrections.
result IPW-adjusted PPI with estimated propensities performs similarly to known-probability case.

Efficiently learns from partial labels using variational inference.

problem Learning from noisy and ambiguous partial labels in crowdsourcing.
method Amortized variational inference for probabilistic posterior approximation.
result Achieves state-of-the-art performance in accuracy and efficiency.

Transformer learns to infer partial MDPs for efficient in-context adaptation and exploration.

problem Efficiently adapt and explore in-context without gradient-based updates.
method Uses a transformer to learn inference from training tasks, considering hypothesis space of partial models.
result Adaptation speed and exploration-exploitation balance approach those of an exact posterior sampling oracle.

Improved Bayesian neural network inference by selectively removing redundant modes.

problem Redundant modes in Bayesian neural network posteriors complicate approximate inference.
method Structured partial stochasticity and deterministic subset selection of weights.
result Improved performance of approximate inference schemes with simplified posterior distribution.

Unified method for inference on partially identified causal effects using covariates.

problem Partial identification of causal effects due to unobserved joint potential outcomes.
method Model-agnostic approach using duality theory for optimal transport problems.
result Uniformly valid inference for a wide class of estimands, even with inaccurate nuisance parameter estimates.

This paper provides estimation and inference methods for an identified set's boundary (i.e., support function) where the selection among a very large number of covariates is based on modern regularized tools. I characterize the boundary using a semiparametric moment equation. Combining Neyman-orthogonality and sample s…

2017-12-28abs ↗pdf ↗

The paper tackles skeptical binary inferences in multi-label problems with sets of probabilities.

problem Making distributionally robust, skeptical inferences for multi-label problems.
method Study of distributionally robust, skeptical inferences for multi-label problems using Hamming loss.
result Skeptical inferences provide partial predictions for a sufficiently big set of probability distributions.

Paper develops efficient Bayesian inference for enzymatic SRNs with LNA metamodel.

problem Bayesian inference for nonlinear SDE-based mechanistic models with partial observations and measurement errors.
method Interpretable Bayesian updating LNA metamodel and efficient posterior sampling.
result Proposed approach demonstrates promising performance in empirical studies.

Algorithm improves reinforcement learning in MDPs with partial order policies.

problem Improving reinforcement learning in MDPs with partial order policies.
method Epoch-based reinforcement learning algorithm leveraging a partial order over policy class.
result Achieves an O(wlog(Θ)T)O(\sqrt{w \log(|Θ|) T}) regret bound, independent of state and action space sizes.

Functional PLS improves prediction and inference for scalar responses from functional predictors.

problem Estimating scalar responses from functional predictors in an ill-posed inverse problem.
method Functional partial least squares (PLS) estimator with adaptive early stopping and new tests.
result PLS attains nearly minimax-optimal convergence rates and detects local alternatives.

Study efficient inference for network quantile causal effects with partial interference.

problem Estimating network causal effects on outcome quantiles with partial interference.
method Developed a nonparametric efficiency theory and a nonparametrically efficient estimator using a three-way cross-fitting procedure.
result Proposed estimator is consistent, asymptotically normal, and allows flexible estimation of nuisance functions.

Paper tackles causal inference with partially labeled data, introducing robust methods.

problem Challenges in causal inference due to partially labeled datasets and potential bias.
method Decaying missing-at-random framework and BRSS estimator for doubly robust causal inference.
result Established asymptotic normality of BRSS estimator under decaying labeling propensity scores.

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.

Paper proposes learning system dynamics from irregularly-sampled partial observations.

problem Capturing dynamics of multi-agent systems with irregular and partial observations.
method LG-ODE, a latent ordinary differential equation model using graph neural networks and neuralODE.
result Demonstrates effectiveness on motion capture, spring system, and charged particle datasets.

The paper tackles individualized decision-making under unmeasured confounding, providing a novel minimax solution and a paradox.

problem Unmeasured confounding in causal inference leads to biased estimates and affects individualized decision-making.
method The authors establish a formal link between individualized decision-making under partial identification and classical decision theory, providing a minimax solution and a paradox.
result A novel minimax solution for individualized decision-making/policy assignment is provided, and an interesting paradox is drawn.

We introduce a Bayesian Gaussian process latent variable model that explicitly captures spatial correlations in data using a parameterized spatial kernel and leveraging structure-exploiting algebra on the model covariance matrices for computational tractability. Inference is made tractable through a collapsed variation…

2018-05-22abs ↗pdf ↗

Deep learning scheme identifies and reconstructs chaotic and stochastic systems from noisy data.

problem Challenging identification of governing equations from noisy and partial observations.
method Jointly learns inference model and governing laws using variational deep learning.
result Framework generalizes state-of-the-art methods and accounts for stochastic variabilities.

WNVI solves inverse problems without forward models using neural networks.

problem Solving high-dimensional Bayesian inverse problems based on PDEs.
method WNVI uses weighted residuals and SVI with neural networks to infer state variables and unknowns.
result WNVI is more accurate and efficient than traditional methods and handles ill-posed problems.

This paper studies when particle filtering is efficient for planning in partially observed systems.

problem The efficiency of particle filtering for planning in partially observed linear dynamical systems.
method Coupling of ideal and approximate sequences to bound particle complexity.
result Polynomially many particles suffice for stable systems to approximate optimal planning.

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.

The paper presents a framework for estimating treatment effects using partial network data.

problem Estimating treatment effects when interference exists and complete network data is unavailable.
method Structural causal models and various network sampling strategies.
result Validated approach using simulated experiments and real-world applications.

Flexible DNN for survival data, avoiding proportional hazards assumption.

problem Survival analysis with complex interactions and non-proportional hazards.
method Partially linear DNN model with a flexible nonparametric component.
result FLEXI-Haz achieves optimal convergence rates and asymptotic efficiency.

We consider the problem of providing nonparametric confidence guarantees for undirected graphs under weak assumptions. In particular, we do not assume sparsity, incoherence or Normality. We allow the dimension DD to increase with the sample size nn. First, we prove lower bounds that show that if we want accurate infe…

2013-09-26abs ↗pdf ↗

This work frames active inference through control as inference, offering robust control algorithms.

problem Active inference framework lacks practical sensorimotor control algorithms.
method Frame active inference through control as inference, presenting trajectory optimization as inference.
result AI may be framed as partially-observed CaI when the cost function is defined in observation states.

PRL improves off-policy evaluation in partially observed MDPs.

problem Confounding and bias in offline reinforcement learning with unobserved state factors.
method Extends proximal causal inference to POMDPs, identifying and estimating target policy value.
result Semiparametrically efficient estimators for PRL in partially observed MDPs.