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

11.3%22.6%34.0%45.3% · Jun 202019922001200920172026
48 results for Partial data

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.

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 ↗

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 ↗

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.

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.

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.

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.

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.

New method learns from non-uniform data and partial physical knowledge.

problem Identifying dynamical systems from non-uniformly sampled data.
method Physics-informed neural networks integrating numerical integration methods.
result Learning unknown kinetic rates and estimating parameters from non-uniform data.

Study expands multiclass classification models with new rates and partial concept classes.

problem Multiclass classification with a bounded number of labels under various conditions.
method Extends traditional PAC model to distribution-dependent and data-dependent learning rates, characterizes optimal rates for universal and partial concept classes.
result Characterizes three types of learning rates (exponential, linear, arbitrarily slow) for fixed distributions and complexity measures for partial concept classes.

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 ↗

Proposes MGPLL for PL learning with non-random noise.

problem Partial label learning with non-random label noise.
method Bi-directional mapping framework, conditional noise label generation, multi-class predictor, adversarial learning.
result Demonstrates state-of-the-art performance in partial label learning.

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.

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.

Meta-learners estimate CATE from multiple environments with partial identification.

problem Estimating CATE from observational data across multiple environments with violations of causal assumptions.
method Adapt IV literature for partial identification, propose model-agnostic meta-learners.
result Meta-learners effectively estimate CATE bounds across various experiments.

A new screening method for high-dimensional data reduces computational cost.

problem Challenges in variable selection for ultrahigh-dimensional linear regression.
method Ordering absolute sample ridge partial correlations to screen variables.
result The method provides sure screening property without strong assumptions.

Method estimates sparse inverse covariance and partial correlation matrices efficiently.

problem Sparse high-dimensional inverse covariance and partial correlation matrix estimation.
method Two-stage estimation method using partial regression with positive semi-definiteness.
result Efficient estimation of inverse covariance and partial correlation matrices with derived non-asymptotic rates.

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.

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.

Unified approach for predicting missing segments in partially observed functions.

problem Predicting missing segments in partially observed functions with complex dependence and irregular noise.
method Unified registration and prediction approach under the conformal prediction framework, integrating amplitude and phase components.
result Effective prediction bands with finite-sample marginal coverage guarantees under weak assumptions.

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.

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.

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.

For a Riemannian manifold (M,g)(M,g) with strictly convex boundary M\partial M, the lens data consists in the set of lengths of geodesics γγ with endpoints on M\partial M, together with their endpoints (x,x+)M×M(x_-,x_+)\in \partial M\times \partial M and tangent exit vectors (v,v+)TxM×Tx+M(v_-,v_+)\in T_{x_-} M\times T_{x_+} M. We show …

2014-12-04abs ↗pdf ↗

Study methods to recover unknown processes in PDEs from data.

problem Identifying unknown processes in time-dependent PDEs using observational data.
method Theoretical analysis and numerical approaches including Galerkin and collocation algorithms.
result The Galerkin algorithm is more suitable for practical situations with noisy data.

Partially performative prediction studies how predictive models influence future data.

problem Distribution shift in predictive models due to endogenous and exogenous factors.
method Generalizing performative prediction to capture both endogenous and exogenous sources of distribution shift.
result Developed online analogues of performative stability and optimality for partially performative environments.

AUCRSS detects change points in partially observed multivariate autocorrelated data.

problem Detecting change points in multivariate autocorrelated data with limited sensing resources.
method Adaptive Upper Confidence Region (AUCRSS) with state space model (SSM), adaptive sampling policy, and generalized likelihood ratio test.
result The method outperforms existing approaches in detecting change points efficiently.

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 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.