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

16324763 · May 202619922001200920172026
48 results for residual-based refinement

RSmote improves PINNs accuracy with less memory usage.

problem Imbalanced learning in Physics-Informed Neural Networks (PINNs).
method Residual-based Smote (RSmote) for local adaptive sampling.
result RSmote achieves or exceeds accuracy of state-of-the-art methods while reducing memory usage.

Proposes a neural network method to correct residual distortions in coordinate transformations.

problem Nonlinear and spatially dependent distortions in coordinate transformation models.
method Residual-based neural network approach focusing on systematic distortions.
result The method improves accuracy and stability in challenging conditions.

In this paper, we consider a framework adapting the notion of cointegration when two asset prices are generated by a driftless Itô-semimartingale featuring jumps with infinite activity, observed regularly and synchronously at high frequency. We develop a regression based estimation of the cointegrated relations method …

2019-05-17abs ↗pdf ↗

Federated learning has a variety of applications in multiple domains by utilizing private training data stored on different devices. However, the aggregation process in federated learning is highly vulnerable to adversarial attacks so that the global model may behave abnormally under attacks. To tackle this challenge, …

2019-12-24abs ↗pdf ↗

New method for Sharpe ratio analysis in high dimensions using residual-based nodewise regression.

problem Consistency of Sharpe ratio estimators in high-dimensional portfolios.
method Residual-based nodewise regression for estimating precision matrix of errors and returns.
result Consistent Sharpe ratio estimators in various portfolio settings.

DeepSVM learns SVMs without PDE solving, achieving high pricing accuracy.

problem Computational bottleneck in real-time calibration of stochastic volatility models.
method Physics-informed Deep Operator Network (PI-DeepONet) that enforces terminal payoffs and no-arbitrage conditions.
result DeepSVM achieves high pricing accuracy across various market dynamics.

We revisit residual algorithms in both model-free and model-based reinforcement learning settings. We propose the bidirectional target network technique to stabilize residual algorithms, yielding a residual version of DDPG that significantly outperforms vanilla DDPG in the DeepMind Control Suite benchmark. Moreover, we…

2019-05-03abs ↗pdf ↗

Deep learning has achieved remarkable success in diverse applications; however, its use in solving partial differential equations (PDEs) has emerged only recently. Here, we present an overview of physics-informed neural networks (PINNs), which embed a PDE into the loss of the neural network using automatic differentiat…

2019-07-10abs ↗pdf ↗

Two methods are proposed to filter correlations in DCC-GARCH residuals for foreign exchange rates.

problem Filtering correlations in DCC-GARCH residuals for accurate foreign exchange rate prediction.
method Two approaches: estimating correlation matrix as a parameter and using eigenvalue decomposition.
result The DCC-GARCH residual can be almost independent using these methods.

Flexible framework integrates machine learning and DRO for uncertain parameter prediction.

problem Limited joint observations of uncertain parameters and covariates.
method Wasserstein, sample robust optimization, and phi-divergence-based ambiguity sets.
result Validation of theoretical and practical benefits in limited data scenarios.

ResGCN detects anomalies in attributed networks by capturing sparsity and nonlinearity.

problem Detecting anomalous nodes in attributed networks.
method Attention-based deep residual modeling using Graph Convolutional Networks.
result ResGCN effectively detects anomalies in attributed networks.

New inequality for refined knot invariants in a specific space.

problem General adjunction inequality for refined ss-invariants does not hold.
method Introduced an adjunction inequality for a specific spatial refinement in kCP2k\overline{\mathbb{CP}^2}.
result An adjunction inequality holds for the ss-version of the Sq1Sq^1-refinement in kCP2k\overline{\mathbb{CP}^2}.

We study refined topological string theory in the presence of orientifolds by counting second-quantized BPS states in M-theory. This leads us to propose a new integrality condition for both refined and unrefined topological strings when orientifolds are present. We define the SO(2N) refined Chern-Simons theory which co…

2012-02-20abs ↗pdf ↗

A new method boosts exploration in bandit algorithms, reducing regret.

problem Improving exploration in bandit algorithms with bounded or unbounded rewards.
method Residual Bootstrap Exploration (ReBoot) method that injects data-driven randomness.
result Proves logarithmic regret in Gaussian multi-armed bandits with appropriate variance inflation.

Refines neural network predictions using background knowledge for improved accuracy.

problem Compensate for lack of labeled data in neural networks.
method Introduces differentiable refinement functions and Iterative Local Refinement (ILR) algorithm to refine predictions efficiently and accurately.
result ILR finds competitive results in MNIST addition task and refines predictions on complex SAT formulas.

New research shows label refinement and weak training have limitations for aligning LLMs.

problem Limitations of refinement methods for aligning large language models.
method Analyzed probabilistic assumptions and alternative approaches to label refinement and weak training.
result Label refinement and weak training suffer from irreducible error, leaving a performance gap.

We refine Khovanov homology in the presence of an involution on the link. This refinement takes the form of a triply-graded theory, arising from a pair of filtrations. We focus primarily on strongly invertible knots and show, for instance, that this refinement is able to detect mutation.

2019-07-31abs ↗pdf ↗

In a previous paper we constructed a spectrum-level refinement of Khovanov homology. This refinement induces stable cohomology operations on Khovanov homology. In this paper we show that these cohomology operations commute with cobordism maps on Khovanov homology. As a consequence we obtain a refinement of Rasmussen's …

2012-06-15abs ↗pdf ↗

Birg{é} and Massart proposed in 2001 the slope heuristics as a way to choose optimally from data an unknown multiplicative constant in front of a penalty. It is built upon the notion of minimal penalty, and it has been generalized since to some "minimal-penalty algorithms". This paper reviews the theoretical results ob…

2019-01-22abs ↗pdf ↗

Paper improves confidence intervals and variance estimation for deep learning models.

problem Improving confidence intervals and variance estimation in deep learning models.
method Residual-based framework for conditional variance estimation; robust bootstrap procedure for confidence intervals.
result First non-asymptotic bounds for variance estimation using ReLU networks.

Refines deep generative models to improve data density precision.

problem Achieving precise representation of data probability density in deep models.
method Iterated generative modeling to refine latent space, addressing topological obstructions.
result Latent Space Refinement (LaSeR) protocol improves generative model precision.

Braverman and Kappeler introduced a refinement of the Ray-Singer analytic torsion associated to a flat vector bundle over a closed odd-dimensional manifold. We study this notion and improve the Braverman-Kappeler theorem comparing the refined analytic torsion with Farber-Turaev refinement of the combinatorial torsion. …

2006-02-10abs ↗pdf ↗

We note that our stable homotopy refinements of Khovanov's arc algebras and tangle invariants induce refinements of Chen-Khovanov and Stroppel's platform algebras and tangle invariants, and discuss the topological Hochschild homology of these refinements.

2019-09-28abs ↗pdf ↗

Estimates variance function using aggregation methods in regression models.

problem Estimating variance function in regression models.
method Two-step procedure involving model selection or convex aggregation, using two independent samples.
result Consistency of the proposed method in L2 error for MS and C aggregations.

EGR refines and assesses protein complex structures.

problem Improving the accuracy of protein complex 3D structures for drug discovery.
method E(3)-equivariant graph neural network (GNN) for multi-task refinement and assessment.
result EGR achieves state-of-the-art performance in refining and assessing protein complexes.

A novel framework refines diffusion models iteratively for better downstream reward optimization.

problem Optimizing reward functions during inference of diffusion models.
method Iterative refinement process with noising and reward-guided denoising steps.
result Superior empirical performance in protein and DNA design.

We formulate large NN duality of U(N)\mathrm{U}(N) refined Chern-Simons theory with a torus knot/link in S3S^3. By studying refined BPS states in M-theory, we provide the explicit form of low-energy effective actions of Type IIA string theory with D4-branes on the ΩΩ-background. This form enables us to relate refined C…

2017-03-15abs ↗pdf ↗

Study uses AI to refine loan assessments, improving credit default predictions.

problem Improving credit default prediction accuracy using AI-refined text.
method Comparative analysis of human-written and AI-refined loan assessments using deep learning techniques.
result AI-refined texts significantly enhance credit default predictions, especially when combined with structured data.

Let EE be a flat complex vector bundle over a closed oriented odd dimensional manifold MM endowed with a flat connection \nabla. The refined analytic torsion for (M,E)(M,E) was defined and studied by Braverman and Kappeler. Recently Mathai and Wu defined and studied the analytic torsion for the twisted de Rham complex…

2010-01-05abs ↗pdf ↗

The refined analytic torsion, defined by M. Braverman and T. Kappeler on closed manifolds, can be viewed as a refinement of the Ray-Singer torsion, since it is a canonical choice of an element with Ray-Singer norm one, in case of unitary representations. The complex phase of the refinement is given by the rho-invariant…

2008-08-04abs ↗pdf ↗

Refined BN-S model improves crude oil hedging with machine learning.

problem Finding optimal hedging strategy for commodity markets.
method Implemented a refined Barndorff-Nielsen and Shephard model with machine learning algorithms.
result The refined model performs better than the classical BN-S model.

Simple models are preferred over complex models, but over-simplistic models could lead to erroneous interpretations. The classical approach is to start with a simple model, whose shortcomings are assessed in residual-based model diagnostics. Eventually, one increases the complexity of this initial overly simple model a…

2017-06-26abs ↗pdf ↗

We construct a canonical element, called the refined analytic torsion, of the determinant line of the cohomology of a closed oriented odd-dimensional manifold M with coefficients in a flat complex vector bundle E. We compute the Ray-Singer norm of the refined analytic torsion. In particular, if there exists a flat Herm…

2005-10-25abs ↗pdf ↗

Refined invariants for 4D 2-handlebodies, linking quantum groups and cohomology.

problem Constructing and studying new invariants for 4D 2-handlebodies.
method Defining invariants for pairs (W,ω)(W,ω), using unimodular ribbon Hopf coalgebras.
result Decomposition formulas for original invariants in terms of refined ones.