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

4997146194 · Jun 202019922001200920172026
48 results for partial correctness

Paper tackles graph matching with partially correct seeds, improving performance guarantees.

problem Graph matching with partially correct seeds.
method Proposes algorithms for matching vertices based on 1-hop and 2-hop neighborhoods, analyzing their performance guarantees.
result New 2-hop algorithm requires fewer correct seeds than the 1-hop algorithm, especially for sparse graphs.

The paper corrects a proof and extends a theorem about linking pairings in 4-manifolds.

problem Linking pairings in 4-manifolds and their properties.
method Analyzes the embedding of multiple copies of a 4-manifold in a compact 4-manifold and examines the resulting linking pairings.
result The linking pairing on the boundary of a 4-manifold is split metabolic, generalizing Hantzsche's theorem.

In reinforcement learning, we can learn a model of future observations and rewards, and use it to plan the agent's next actions. However, jointly modeling future observations can be computationally expensive or even intractable if the observations are high-dimensional (e.g. images). For this reason, previous works have…

2020-02-07abs ↗pdf ↗

SCaSML improves PDE solvers by correcting errors efficiently.

problem Reliable and error-free high-dimensional PDE solutions.
method Defect correction method to derive a Structural-preserving Law of Defect.
result SCaSML achieves faster convergence and reduced errors in high-dimensional PDEs.

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.

Partial soft-matching distance improves neural representation comparison by allowing some neurons to remain unmatched.

problem Neural representations are noisy and contain outliers, making traditional matching methods unreliable.
method Extends soft-matching distance to a partial optimal transport setting, allowing some neurons to remain unmatched.
result Partial soft-matching provides robust correspondences that are more reliable under noise and outliers.

Corrected Monti's blow-up analysis for H-minimizing sets in Heisenberg group.

problem Blow-up analysis of H-minimizing sets in Heisenberg group with corrected partial differential equation.
method Revised Monti's results on blow-ups of H-perimeter minimizing sets in Hn\mathbb{H}^n and corrected the partial differential equation for the limit function.
result Corrected the partial differential equation for the limit function of blow-ups in Heisenberg group.

Čech cohomology Hn(X)H^n(X) of a separable metrizable space XX is defined in terms of cohomology of its nerves (or ANR neighborhoods) PβP_β whereas Steenrod-Sitnikov homology Hn(X)H_n(X) is defined in terms of homology of compact subsets KαXK_α\subset X. We show that one can also go vice versa: in a sense, Hn(X)H^n(X) can be re…

2018-08-30abs ↗pdf ↗

Partial Label Learning (PLL) aims to learn from the data where each training example is associated with a set of candidate labels, among which only one is correct. The key to deal with such problem is to disambiguate the candidate label sets and obtain the correct assignments between instances and their candidate label…

2019-01-10abs ↗pdf ↗

A lightweight framework improves convergence and stability of PINNs for complex PDEs.

problem Training instability and reduced accuracy in PINNs for complex PDEs.
method Adaptive curvature correction using secant information to optimize first-order optimizers.
result Consistent improvements in convergence speed, stability, and accuracy over standard optimizers.

This paper is concerned with the following Markovian stochastic differential equation of mean-reversion type \[ dR_t= (θ+σα(R_t, t))R_t dt +σR_t dB_t \] with an initial value R0=r0RR_0=r_0\in\mathbb{R}, where θRθ\in\mathbb{R} and σ>0σ>0 are constants, and the mean correction function $α:\mathbb{R}\times[0,\infty)\to α(x,t)\…

2013-05-08abs ↗pdf ↗

Partial recovery of node mappings between correlated graphs is possible under specific conditions.

problem Recovering a one-to-one mapping between nodes of two correlated graphs with a fraction of correct matches.
method Analyzing the graph isomorphism problem as a noisy version, considering Erdős-Rényi graphs, and providing conditions for partial recovery.
result Necessary and sufficient conditions for partial recovery of node mappings in correlated graphs are given.

Partial label learning (PLL) aims to solve the problem where each training instance is associated with a set of candidate labels, one of which is the correct label. Most PLL algorithms try to disambiguate the candidate label set, by either simply treating each candidate label equally or iteratively identifying the true…

2018-04-20abs ↗pdf ↗

We consider the mean-variance hedging problem under partial Information. The underlying asset price process follows a continuous semimartingale and strategies have to be constructed when only part of the information in the market is available. We show that the initial mean variance hedging problem is equivalent to a ne…

2007-03-14abs ↗pdf ↗

Partial label learning deals with the problem where each training instance is assigned a set of candidate labels, only one of which is correct. This paper provides the first attempt to leverage the idea of self-training for dealing with partially labeled examples. Specifically, we propose a unified formulation with pro…

2019-02-08abs ↗pdf ↗

LLMs struggle with zero-shot annotation tasks due to model-internalized priors.

problem Impact of model-internalized priors on LLM performance in zero-shot annotation tasks.
method Investigated three dimensions: familiarity, decision stickiness, and susceptibility to misaligned task definitions.
result Nearly two-thirds of zero-shot errors are resistant to correction, with a rescue rate of 34.8%. Definition-Specific Familiarity (DSF) shows a positive association with model performance.

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.

Community detection was a hot topic on network analysis, where the main aim is to perform unsupervised learning or clustering in networks. Recently, semi-supervised learning has received increasing attention among researchers. In this paper, we propose a new algorithm, called weighted inverse Laplacian (WIL), for predi…

2019-01-07abs ↗pdf ↗

Algorithm identifies optimal stable matching in uncertain two-sided markets.

problem Sequential learning in two-sided markets with unknown preferences.
method Pure exploration approach with elimination-based algorithms exploiting partial preference information.
result Identification of pervasive stable matching for optimal stable matching identification.

Neural operators correct PDE residuals to improve BIP solutions.

problem Reducing error in infinite-dimensional Bayesian inverse problems with neural operators.
method Error correction using PDE residuals to improve neural operator approximation.
result Trained neural operators with error correction achieve a quadratic reduction in approximation error.

Improved latent dynamics identification framework reduces training time and improves accuracy.

problem Accurate numerical solutions of partial differential equations require computationally expensive solvers.
method Sequential decoder training (mLaSDI) to correct residual errors from previous stages.
result mLaSDI consistently outperforms standard LaSDI, achieving lower prediction errors and reduced training time.

FedSGM tackles constrained federated learning with unified framework.

problem Functional constraints, communication bottlenecks, local updates, and partial client participation in federated learning.
method Unified framework based on switching gradient method, incorporating bi-directional error feedback, and soft switching for stability.
result Achieves O(1/T)\boldsymbol{\mathcal{O}}(1/\sqrt{T}) convergence rate with high-probability bounds decoupling from sampling noise.

In this paper, we present NESTA, a specialized Neural engine that significantly accelerates the computation of convolution layers in a deep convolutional neural network, while reducing the computational energy. NESTA reformats Convolutions into 3×33 \times 3 batches and uses a hierarchy of Hamming Weight Compressors to …

2019-10-01abs ↗pdf ↗

Calibrated PRMs improve inference efficiency for LLMs by dynamically adjusting compute budgets.

problem Poor calibration of PRMs leads to overestimation of success probabilities in partial reasoning steps.
method Quantile regression for calibration, instance-adaptive scaling (IAS) framework.
result Calibrated PRMs reduce inference costs while maintaining accuracy, especially on confident problems.

DC3 uses deep learning to solve hard-constrained optimization problems efficiently.

problem Hard constraints in optimization problems make classical solvers slow and infeasible.
method DC3 employs a differentiable procedure to enforce feasibility and unrolls corrections for inequality constraints.
result DC3 achieves near-optimal solutions while maintaining feasibility in both synthetic and real-world tasks.

Polyhedra collapse to subpolyhedra if they can be continuously shrunk onto them.

problem Characterizing when a polyhedron can be continuously shrunk onto a subpolyhedron.
method Piecewise-linear free deformation retraction and metric considerations.
result A polyhedron collapses to a subpolyhedron if and only if it admits a free deformation retraction onto that subpolyhedron.

Researchers formalize PD and PFI to relate them to data generating process.

problem Lack of theory linking PD and PFI to data generating process.
method Formalize PD and PFI as estimators of ground truth estimands, account for model variance with learner-PD and learner-PFI.
result PD and PFI estimates deviate from ground truth due to statistical biases, model variance, and Monte Carlo approximation errors.

We propose the use of Bayesian networks, which provide both a mean value and an uncertainty estimate as output, to enhance the safety of learned control policies under circumstances in which a test-time input differs significantly from the training set. Our algorithm combines reinforcement learning and end-to-end imita…

2018-03-27abs ↗pdf ↗