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,878 papers · 148 categories

Trend · papers per month

0.6%1.2%1.8%2.4% · Apr 199819922001200920172026
48 results for justification

Theoretical justification for asymmetric actor-critic algorithms in reinforcement learning.

problem Lack of precise theoretical justification for asymmetric actor-critic algorithms in reinforcement learning.
method Adapting a finite-time convergence analysis to the asymmetric actor-critic setting with linear function approximators.
result A finite-time bound reveals that the asymmetric critic eliminates aliasing errors in the agent state.

Theoretical justification for image inpainting using diffusion models.

problem Improving sample recovery in image inpainting without retraining.
method Analysis of RePaint algorithm and proposing RePaint+^+ to correct misalignment.
result RePaint+^+ algorithm provably recovers the true sample with linear convergence.

The paper gives a simple algebraic description, and background justification, for the Bowley Ratio, the relative returns to labour and capital, in a simple economy.

2011-05-11abs ↗pdf ↗

Deep neural networks justify medical diagnoses with textual explanations.

problem Improving machine learning in medical diagnosis justification.
method Mapping X-Ray images to textual representations, generating explanations, and multi-task training.
result The method significantly outperforms existing justification methods and achieves high accuracy.

POWSS simplifies Q-value estimation in POMDPs with continuous observations.

problem Lack of theoretical justification for online sampling-based algorithms in POMDPs with continuous observation spaces.
method Developed POWSS, a simplified algorithm that estimates Q-values accurately with high probability and can approach optimality with increased computational power.
result POWSS provides formal theoretical guarantees for Q-value estimation in POMDPs with continuous observations.

Proposes a Bayesian approach to explain, justify, and quantify uncertainty in DNNs.

problem Lack of transparency and confidence in DNNs for critical applications.
method Bayesian approach to extract explanations, justifications, and uncertainty estimates from black box DNNs.
result Improves interpretability and reliability of DNNs, validated on CIFAR-10.

This note justifies approximations of arithmetic forwards using weighted averages of overnight forwards.

problem Theoretical justification for approximations of arithmetic forwards.
method Presentation of a central equation and computationally cheaper methods to approximate FaF_a.
result Theoretical bounds and closed-form expressions for arithmetic factors in Gaussian HJM models.

Post-hoc calibration of neural networks using g-Layers proves theoretical justification.

problem Ensuring the confidence of neural network decisions in real-world applications.
method Proves theoretical justification for post-hoc calibration methods by adding g-Layers and minimizing NLL.
result Proves that adding g-Layers and minimizing NLL can lead to a calibrated network.

The paper provides a theoretical justification for using stable SSM blocks in deep sequential models.

problem Developing generalization bounds for deep sequential models with varying sequence lengths.
method Using Rademacher contraction and stability constraints, the paper derives a PAC bound that is independent of sequence length.
result The derived PAC bound decreases as the stability of SSM blocks increases, providing theoretical justification for their use.

New approach links machine learning reliability to epistemic uncertainty.

problem Characterize and quantify reliability of machine learning predictions.
method Extend JTB theory to neural networks, linking prediction reliability to support characteristics.
result Demonstrates reliability for individual predictions and identifies regions of uncertainty.

This paper contains the motivation for the study of critical surfaces. In previous work the only justification given for the definition of this new class of surfaces is the strength of the results. However, when viewed as the topological analogue to index 2 minimal surfaces, critical surfaces become quite natural.

2002-03-27abs ↗pdf ↗

We refine the analysis of hedging strategies for options under the SABR model carried out in [2]. In particular, we provide a theoretical justification of the empirical observation made in [2] that the modified delta ("Bartlett's delta") introduced there provides a more accurate and robust hedging strategy than the con…

2017-04-11abs ↗pdf ↗

Recent advances in Reinforcement Learning, grounded on combining classical theoretical results with Deep Learning paradigm, led to breakthroughs in many artificial intelligence tasks and gave birth to Deep Reinforcement Learning (DRL) as a field of research. In this work latest DRL algorithms are reviewed with a focus …

2019-06-24abs ↗pdf ↗

Paper justifies ST estimator using pWGF and proposes an improved variant.

problem Theoretical justification for ST estimator for discrete variables.
method Interpreted ST as pWGF simulation and proposed an improved estimator.
result Established theoretical foundation for ST estimator and improved variant.

Data-driven decision-making often overestimates benefits due to the winner's curse.

problem Accurate policy evaluation in data-driven decision-making.
method Model-based policy evaluation using estimated models from data.
result Model-based methods can produce large, spurious reported benefits even when true effects are zero.

We describe a method for removing the effect of confounders in order to reconstruct a latent quantity of interest. The method, referred to as half-sibling regression, is inspired by recent work in causal inference using additive noise models. We provide a theoretical justification and illustrate the potential of the me…

2015-05-12abs ↗pdf ↗

Classically time is kept fixed for infinitesimal variations in problems in mechanics. Apparently, there appears to be no mathematical justification in the literature for this standard procedure. This can be explained canonically by unveiling the intrinsic mathematical structure of time in Lagrangian mechanics. Moreover…

2008-01-27abs ↗pdf ↗

In lexicon-based classification, documents are assigned labels by comparing the number of words that appear from two opposed lexicons, such as positive and negative sentiment. Creating such words lists is often easier than labeling instances, and they can be debugged by non-experts if classification performance is unsa…

2016-11-21abs ↗pdf ↗

Characterizes Coxeter groups with specific boundary shapes.

problem Identifying Coxeter groups with Sierpiński or Menger curve boundaries.
method Combining results from the literature on Gromov boundaries and Coxeter groups.
result Complete characterizations of hyperbolic Coxeter groups with Sierpiński or Menger curve boundaries.

This paper develops a theory for group Lasso using a concept called strong group sparsity. Our result shows that group Lasso is superior to standard Lasso for strongly group-sparse signals. This provides a convincing theoretical justification for using group sparse regularization when the underlying group structure is …

2009-01-20abs ↗pdf ↗

The Riemannian center of mass was constructed in [GrKa] (1973). In [GKR1, GKR2, Gr, Ka, BuKa] (1974-1981) it was successfully applied with more refined estimates. Probably in 1990 someone renamed it without justification into karcher mean and references to the older papers were omitted by those using the new name. As a…

2014-07-03abs ↗pdf ↗

Using geodesic currents, we provide a theoretical justification for some of the experimental results regarding the behavior of Whitehead's algorithm on non-minimal inputs, that were obtained by Haralick, Miasnikov and Myasnikov via pattern recognition methods. In particular we prove that the images of "random" elements…

2005-11-19abs ↗pdf ↗

Extends neural network approximations to guarantee continuity of real-world learning tasks.

problem Guaranteeing continuity of real-world learning tasks given by conditional expectations.
method Establishing conditions on learning tasks that guarantee their continuity under a factorization of the data-generating process.
result Conditions guaranteeing the continuity of practically any derived learning task.

Theoretical justification for deep networks' performance with regularization techniques.

problem Understanding the performance of deep networks trained with the square loss.
method Analysis of gradient flow and theoretical justification of regularization techniques.
result Convergence to solutions with smaller Frobenius norms leads to better classification error bounds.

Study on random matrices in deep neural networks using Gaussian data.

problem Distribution of singular values in product of random matrices in deep learning.
method Free probability theory combined with standard techniques of random matrix theory.
result Justification for applying free probability theory to non-independent random data matrices.

Paper compares neural network approaches to Optimal Transport.

problem Learning Optimal Maps between probability distributions.
method Two categories of approaches: heuristic and math-justified. Novel approach involves dynamic flows and supervised learning.
result Novel approach involving dynamic flows and reductions of Optimal Transport to supervised learning.

We introduce a framework for analyzing transductive combination of Gaussian process (GP) experts, where independently trained GP experts are combined in a way that depends on test point location, in order to scale GPs to big data. The framework provides some theoretical justification for the generalized product of GP e…

2015-11-24abs ↗pdf ↗

Unified framework for aligning LLMs from human feedback.

problem Lack of strong theoretical justification for RLHF and inability to compare methods.
method Reframed alignment as distribution learning from pairwise preferences, proposing three principled objectives.
result Proposed objectives achieve strong non-asymptotic convergence to target LM.

Efficient Reinforcement Learning usually takes advantage of demonstration or good exploration strategy. By applying posterior sampling in model-free RL under the hypothesis of GP, we propose Gaussian Process Posterior Sampling Reinforcement Learning(GPPSTD) algorithm in continuous state space, giving theoretical justif…

2018-12-11abs ↗pdf ↗

We derive a novel norm that corresponds to the tightest convex relaxation of sparsity combined with an 2\ell_2 penalty. We show that this new {\em kk-support norm} provides a tighter relaxation than the elastic net and is thus a good replacement for the Lasso or the elastic net in sparse prediction problems. Through …

2012-04-23abs ↗pdf ↗

ADD embeds a 48-bit message into images, achieving high accuracy and speed.

problem Embedding high-fidelity messages into images to detect authenticity and source.
method Two-stage process: linear combination and addition of watermark to image, followed by decoding.
result ADD achieves 100% decoding accuracy for 48-bit watermarking, with minimal performance drop under various distortions.

This paper considers the problem of subspace clustering under noise. Specifically, we study the behavior of Sparse Subspace Clustering (SSC) when either adversarial or random noise is added to the unlabelled input data points, which are assumed to be in a union of low-dimensional subspaces. We show that a modified vers…

2013-09-05abs ↗pdf ↗

Physicists believe, with some justification, that there should be a correspondence between familiar properties of Newtonian gravity and properties of solutions of the Einstein equations. The Positive Mass Theorem (PMT), first proved over twenty years ago \cite{SchoenYau79b,Witten81}, is a remarkable testament to this f…

2003-04-18abs ↗pdf ↗

The paper provides theoretical guarantees for transformation-based models in variational inference.

problem Theoretical justification for transformation-based models in variational inference.
method Theoretical analysis of non-linear latent variable models and Gaussian process priors.
result Theoretical guarantees for implicit variational inference, achieving optimal risk bounds and approximating the true posterior.

The article defines and analyzes Clairaut anti-invariant maps between Riemannian and trans-Sasakian manifolds.

problem Characterizing Clairaut anti-invariant Riemannian maps between specific types of manifolds.
method Deriving conditions for Clairaut maps, discussing integrability, and establishing harmonicity.
result Necessary and sufficient conditions for Clairaut anti-invariant maps are derived.

This paper is devoted to the development and applications of some (new) basic concepts in Lie theory, both from `computational" and "observability" viewpoint. We specify set of all "G-equivariant" maps from a given Lie group G to the underlying manifold M, namely GG-set, and also we introduce "conjugacy" in Lie group …

2012-01-18abs ↗pdf ↗

Observational studies are rising in importance due to the widespread accumulation of data in fields such as healthcare, education, employment and ecology. We consider the task of answering counterfactual questions such as, "Would this patient have lower blood sugar had she received a different medication?". We propose …

2016-05-12abs ↗pdf ↗

The article addresses a long-standing open problem on the justification of using variational Bayes methods for parameter estimation. We provide general conditions for obtaining optimal risk bounds for point estimates acquired from mean-field variational Bayesian inference. The conditions pertain to the existence of cer…

2017-12-25abs ↗pdf ↗

Pattern recognition in neuroimaging distinguishes between two types of models: encoding- and decoding models. This distinction is based on the insight that brain state features, that are found to be relevant in an experimental paradigm, carry a different meaning in encoding- than in decoding models. In this paper, we a…

2015-12-15abs ↗pdf ↗