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

25.0%50.0%75.0%100.0% · Jun 199319922001200920172026
48 results for partial data result

Unique continuation for X-ray transforms of one-forms with partial data.

problem Proving unique continuation for X-ray transforms of one-forms with limited data.
method Proved unique continuation for the normal operator of X-ray transforms of one-forms, leading to partial data results.
result Unique continuation for X-ray transforms of one-forms with partial data.

This work characterizes reward function partial identifiability and its impact on policy optimization.

problem Reward function partial identifiability in complex tasks.
method Formal characterisation of partial identifiability using various reward learning data sources.
result Unified framework for comparing data sources and downstream tasks by their invariances.

In this paper we consider the lens rigidity problem with partial data for conformal metrics in the presence of a magnetic field on a compact manifold of dimension 3\geq 3 with boundary. We show that one can uniquely determine the conformal factor and the magnetic field near a strictly convex (with respect to the magne…

2016-05-20abs ↗pdf ↗

Partial dependence curves (FPD) introduced by Friedman, are an important model interpretation tool, but are often not accessible to business analysts and scientists who typically lack the skills to choose, tune, and assess machine learning models. It is also common for the same partial dependence algorithm on the same …

2019-07-15abs ↗pdf ↗

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.

Ranked data appear in many different applications, including voting and consumer surveys. There often exhibits a situation in which data are partially ranked. Partially ranked data is thought of as missing data. This paper addresses parameter estimation for partially ranked data under a (possibly) non-ignorable missing…

2019-02-28abs ↗pdf ↗

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.

We prove uniqueness results for a Calderon type inverse problem for the Hodge Laplacian acting on graded forms on certain manifolds in three dimensions. In particular, we show that partial measurements of the relative-to-absolute or absolute-to-relative boundary value maps uniquely determine a zeroth order potential. T…

2013-10-17abs ↗pdf ↗

A new deep metric learning method for defect classification in threaded pipe connections.

problem Defect classification in threaded pipe connections with limited and imbalanced multichannel functional data.
method COMPILED approach based on deep metric learning for imbalanced, multichannel, and partially observed functional data.
result Superior accuracy compared to existing benchmarks in a real-world case study.

The article recovers tensor fields from partial data using weighted divergent ray transforms.

problem Recovering tensor fields from partial data.
method Weighted divergent ray transforms, unique continuation property of fractional Laplacian, explicit reconstruction formulas.
result Recovery of symmetric mm-tensor fields and unique continuation for vector fields and symmetric 2-tensor fields.

Improved algorithm for partial recovery of tree-structured graphs with noisy data.

problem Learning Ising tree models with noisy observations.
method Symmetrized Geometric Averaging (SGA) algorithm with improved sample complexity.
result Significantly better sample complexity for partial tree recovery.

Proposes a topological model for partial equivariance in neural networks.

problem Capturing partial equivariance in neural networks for data analysis.
method Introduces P-GENEOs and studies spaces of measurements and P-GENEOs between them.
result Spaces of measurements and P-GENEOs have convenient approximation and convexity properties.

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.

Proposes new methods for Markov chain choice models with panel data.

problem Dependence among transactions for the same customer in historical data.
method Expectation-maximization (EM) algorithms incorporating partial-ordering preference information.
result EM algorithms outperform traditional methods on synthetic and real datasets.

Develops a regression model for partially observed dynamic tensor data.

problem Characterizing the relationship between dynamic tensor data and external covariates when data is only partially observed.
method Introduces low-rank, sparsity, and fusion structures on the regression coefficient tensor, and uses a loss function projected over observed entries. Developed an efficient non-convex alternating updating algorithm.
result Derived finite-sample error bounds for the estimator.

Deep learning within the context of point clouds has gained much research interest in recent years mostly due to the promising results that have been achieved on a number of challenging benchmarks, such as 3D shape recognition and scene semantic segmentation. In many realistic settings however, snapshots of the environ…

2018-11-30abs ↗pdf ↗

EnSF uses image inpainting to handle partial observations in data assimilation.

problem Data assimilation challenges with partial observations.
method EnSF integrates image inpainting with diffusion models to predict unobserved states.
result EnSF successfully tracks SQG dynamics with partial observations.

In this paper, we prove that there exists a dimensional constant δ>0δ> 0 such that given any background Kähler metric ωω, the Calabi flow with initial data u0u_0 satisfying \begin{equation*} \partial \bar \partial u_0 \in L^\infty (M) \text{ and } (1- δ)ω< ω_{u_0} < (1+δ)ω, \end{equation*} admits a unique short time so…

2017-01-24abs ↗pdf ↗

FedAMD framework improves federated learning with partial client participation.

problem Data heterogeneity and inactive client updates in partial client participation.
method Anchor sampling divides clients into anchor and miner groups, using large and small batches respectively.
result FedAMD achieves faster convergence and improved model performance compared to state-of-the-art methods.

Automates discovering PDEs from data in dynamical systems.

problem Identifying PDEs from data in dynamical systems is challenging.
method ARGOS-RAL framework using sparse regression with recurrent adaptive lasso.
result ARGOS-RAL effectively identifies PDEs from noisy and non-uniformly distributed data.

We prove that the flat product metric on Dn×S1D^n\times S^1 is scattering rigid where DnD^n is the unit ball in Rn\R^n and n2n\geq 2. The scattering data (loosely speaking) of a Riemannian manifold with boundary is map S:U+MUMS:U^+\partial M\to U^-\partial M from unit vectors VV at the boundary that point inward to unit vecto…

2011-03-28abs ↗pdf ↗

This paper demostrates a method for analysing almost CR geometries (H,J)(H,J), by uniquley defining a partially integrable structure (H,K)(H,K) from the same data. Thus two almost CR geometries (H,J)(H,J) and (H,J)(H',J') are equivalent if and and only if they generate isomorphic induced partially integrable CR geometries (H,K)(H,K)

2008-07-08abs ↗pdf ↗

The paper explores partial identifiability in nonnegative matrix factorization under specific conditions.

problem Identifying specific columns of the matrices in nonnegative matrix factorization.
method Mathematical rigor and geometric interpretation to analyze partial identifiability of columns in nonnegative matrix factorization.
result The partial uniqueness of a single column of CC or SS can be guaranteed under certain sparsity and algebraic conditions.

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.

Let B1B_1 be the unit open disk in $\Real^2$ and MM be a closed Riemannian manifold. In this note, we first prove the uniqueness for weak solutions of the harmonic map heat flow in H1([0,T]×B1,M)H^1([0,T]\times B_1,M) whose energy is non-increasing in time, given initial data u0H1(B1,M)u_0\in H^1(B_1,M) and boundary data $γ=u_0|_{\partia…

2010-10-16abs ↗pdf ↗

This work studies the problem of batch off-policy evaluation for Reinforcement Learning in partially observable environments. Off-policy evaluation under partial observability is inherently prone to bias, with risk of arbitrarily large errors. We define the problem of off-policy evaluation for Partially Observable Mark…

2019-09-09abs ↗pdf ↗

Optimizes ranking of top-k players from partial comparison data.

problem Identifying the top-k players from incomplete pairwise comparisons.
method Maximum Likelihood Estimator (MLE) and Spectral Method.
result MLE achieves optimal partial and exact recovery, while Spectral Method is sub-optimal.

The paper studies maps from pseudo-Hermitian to Kähler manifolds, proving harmonic map properties.

problem Analyzing maps between pseudo-Hermitian and Kähler manifolds.
method Investigates partial energy functionals and critical maps, proving foliated results for b\overline{\partial}_{b}- and b\partial_{b}-harmonic maps.
result Generalizes Siu's holomorphicity result to b\overline{\partial}_{b}- and b\partial_{b}-harmonic maps.

We present a simple, flexible, and general framework titled Partial Registration Network (PRNet), for partial-to-partial point cloud registration. Inspired by recently-proposed learning-based methods for registration, we use deep networks to tackle non-convexity of the alignment and partial correspondence problems. Whi…

2019-10-27abs ↗pdf ↗

New bounds for PDA using partial optimal transport improve domain alignment.

problem Scarcity of labeled target data with abundant source data.
method Derive theoretical bounds based on partial optimal transport.
result Theoretical bounds support partial Wasserstein distance for domain alignment.

Annotating temporal relations (TempRel) between events described in natural language is known to be labor intensive, partly because the total number of TempRels is quadratic in the number of events. As a result, only a small number of documents are typically annotated, limiting the coverage of various lexical/semantic …

2018-04-18abs ↗pdf ↗

CPPO learns policies from partial offline data in MDPs with structural assumptions.

problem Offline Reinforcement Learning with partial coverage assumption.
method Constrained Pessimistic Policy Optimization (CPPO) using a function class and model class constraint.
result CPPO achieves PAC guarantee with partial coverage, learning competitive policies.

Paper tackles group robustness with partially labeled data.

problem Learning invariant representations from datasets with spurious correlations.
method Constructs a constraint set and derives a high probability bound for group assignment. Proposes an optimization algorithm for worst-off group assignments.
result Improvements in minority group's performance while preserving overall accuracy.

New method identifies causal variables from partially observed data.

problem Learning from unpaired observations with instance-dependent partial observability.
method Proposes two methods enforcing sparsity in the inferred representation.
result Establishes two identifiability results for linear and piecewise linear mixing functions.

Develops GNNs for incomplete graphs, improving learning from missing node attributes.

problem Learning from incomplete graphs with missing node attributes.
method Introduces PaGNNs with novel partial aggregation functions for incomplete graph data.
result Demonstrates effectiveness and efficiency of PaGNNs on various datasets.

We propose a method to model multi-agent behaviors with limited observation and mechanical constraints.

problem Modeling real-world multi-agent behaviors with limited observation and mechanical constraints.
method Decentralized generative models with partial observation and mechanical constraints based on hierarchical variational recurrent neural networks.
result Our method effectively models and predicts biologically plausible behaviors with minimal constraint violations.