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

88177265353 · May 202619922001200920172026
48 results for refined derivatives

In the previous article "Refined Analytic Torsion on Manifolds with Boundary" we have presented a construction of refined analytic torsion in the spirit of Braverman and Kappeler, which does apply to compact manifolds with and without boundary. We now derive a gluing formula for our construction, which can be viewed as…

2008-08-04abs ↗pdf ↗

The holonomic approximation lemma of Eliashberg and Mishachev is a powerful tool in the philosophy of the hh-principle. By carefully keeping track of the quantitative geometry behind the holonomic approximation process, we establish several refinements of this lemma. Gromov's idea from convex integration of working on…

2016-05-24abs ↗pdf ↗

The paper compares inserting and stretching points for grid refinement near critical points.

problem Decreased accuracy of finite difference methods near discontinuities.
method Comparison of inserting and stretching points for grid refinement near critical points.
result Proposes a new fast and simple stretching function.

Unified approach to time-inconsistent problems with distribution-dependent rewards.

problem Time-inconsistent problems with distribution-dependent rewards in behavioral finance and economics.
method Equilibrium master equation on Wasserstein space, refined derivatives, Itô's formula.
result Unified approach to find equilibrium solutions for time-inconsistent problems.

This article studies the achievable guarantees on the error rates of certain learning algorithms, with particular focus on refining logarithmic factors. Many of the results are based on a general technique for obtaining bounds on the error rates of sample-consistent classifiers with monotonic error regions, in the real…

2015-12-22abs ↗pdf ↗

We develop a generalization to non-Witt spaces of the intersection homology theory of Goresky-MacPherson. The second author has described the self-dual sheaves compatible with intersection homology, and the other authors have described a generalization of Cheeger's L2 de Rham cohomology. In this paper we extend both of…

2013-08-16abs ↗pdf ↗

Probabilistic modeling is iterative. A scientist posits a simple model, fits it to her data, refines it according to her analysis, and repeats. However, fitting complex models to large data is a bottleneck in this process. Deriving algorithms for new models can be both mathematically and computationally challenging, wh…

2016-03-02abs ↗pdf ↗

In this paper, we consider unregularized online learning algorithms in a Reproducing Kernel Hilbert Spaces (RKHS). Firstly, we derive explicit convergence rates of the unregularized online learning algorithms for classification associated with a general gamma-activating loss (see Definition 1 in the paper). Our results…

2015-03-02abs ↗pdf ↗

Paper studies community detection in censored hypergraphs using information theory.

problem Community detection in censored hypergraphs with missing values.
method Information-theoretic approach, polynomial-time algorithm, spectral algorithm with refinement.
result Derives information-theoretic threshold for exact recovery of community structure.

Let P,QP, Q be Heegaard surfaces of a closed orientable 3-manifold. In this paper, we introduce a method for giving an upper bound of Hempel distance of PP by using the Reeb graph derived from a certain horizontal arc in the ambient space [0,1]×[0,1][0,1]\times[0,1] of the Rubinstein-Scharlemann graphic derived from PP and QQ

2010-02-16abs ↗pdf ↗

We show that solutions of the Seiberg-Witten equations lead to non-trivial lower bounds for the L2-norm of the Weyl curvature of a compact Riemannian 4-manifold. These estimates are then used to derive new obstructions to the existence of Einstein metrics. These results considerably refine those previously obtained usi…

1998-03-20abs ↗pdf ↗

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 ↗

It is known that Heston's stochastic volatility model exhibits moment explosion, and that the critical moment s+s_+ can be obtained by solving (numerically) a simple equation. This yields a leading order expansion for the implied volatility at large strikes: σBS(k,T)2TΨ(s+1)×kσ_{BS}( k,T)^{2}T\sim Ψ(s_+-1) \times k (Roger Lee's moment…

2010-01-18abs ↗pdf ↗

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.

The paper refines and extends batched kernelized bandits, improving regret bounds and introducing a robust setting.

problem Optimizing black-box functions with noisy batches in Reproducing Kernel Hilbert Space.
method Refined and extended existing regret bounds, including adaptive batch sizes and robust optimization.
result Improved regret bounds for batched kernelized bandits, showing optimal number of batches and adaptive batch sizes.

We introduce a new wavelet transform suitable for analyzing functions on point clouds and graphs. Our construction is based on a generalization of the average interpolating refinement scheme of Donoho. The most important ingredient of the original scheme that needs to be altered is the choice of the interpolant. Here, …

2011-10-10abs ↗pdf ↗

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 ↗

For each sequence of polynomials, P=(p_1(t),p_2(t),...), we define a characteristic series of groups, called the derived series localized at P. Given a knot K in S^3, such a sequence of polynomials arises naturally as the orders of certain submodules of the sequence of higher-order Alexander modules of K. These group s…

2009-06-07abs ↗pdf ↗

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 ↗

ALAMO is a computational methodology for leaning algebraic functions from data. Given a data set, the approach begins by building a low-complexity, linear model composed of explicit non-linear transformations of the independent variables. Linear combinations of these non-linear transformations allow a linear model to b…

2017-05-31abs ↗pdf ↗

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.