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

167335502669 · Jun 202019922001200920172026
48 results for refinement functions

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.

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.

This is a short version of math.DG/0505537. For an acyclic representation of the fundamental group of a compact oriented odd-dimensional manifold, which is close enough to a unitary representation, we define a refinement of the Ray-Singer torsion associated to this representation. This new invariant can be viewed as an…

2005-09-24abs ↗pdf ↗

New vanishing theorems for harmonic and pluriharmonic functions on Kähler and quaternionic Kähler manifolds.

problem Vanishing theorems for harmonic and pluriharmonic functions on Kähler and quaternionic Kähler manifolds.
method Utilized refined Kato type inequalities and Böchner technique to generalize results to LpL^p-integrable pluriharmonic functions and harmonic 1-forms.
result Proved vanishing property of pluriharmonic functions with finite LpL^p energy on complete Kähler manifolds.

For an acyclic representation of the fundamental group of a compact oriented odd-dimensional manifold, which is close enough to a unitary representation, we define a refinement of the Ray-Singer torsion associated to this representation. This new invariant can be viewed as an analytic counterpart of the refined combina…

2005-05-25abs ↗pdf ↗

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 consider the problem of adaptive stratified sampling for Monte Carlo integration of a noisy function, given a finite budget n of noisy evaluations to the function. We tackle in this paper the problem of adapting to the function at the same time the number of samples into each stratum and the partition itself. More p…

2013-03-12abs ↗pdf ↗

Establishes refined singularity estimate for nonnegative n-superharmonic functions in locally conformally flat manifolds.

problem Analyzing volume growth and verifying Cohn-Vossen inequality in locally conformally flat manifolds.
method Refined singularity estimate and characterization of volume growth.
result Analytically characterizes volume growth and verifies Cohn-Vossen inequality.

We conjecture a formula for the refined SU(3)\mathrm{SU}(3) Vafa-Witten invariants of any smooth surface SS satisfying H1(S,Z)=0H_1(S,\mathbb{Z}) = 0 and pg(S)>0p_g(S)>0. The unrefined formula corrects a proposal by Labastida-Lozano and involves unexpected algebraic expressions in modular functions. We prove that our formula satisfi…

2018-08-09abs ↗pdf ↗

Study of 5D SYM theory on toric surfaces yields refined Vafa-Witten invariants.

problem Computing partition functions in 5D SYM theory on toric surfaces.
method Supersymmetric localization, Nekrasov partition functions, moduli space of sheaves.
result Found correspondence between poles and torus-fixed points in moduli space, leading to refined Vafa-Witten invariants.

We give a closed formula for the Conway function of a splice in terms of the Conway function of its splice components. As corollaries, we refine and generalize results of Seifert, Torres, and Sumners-Woods.

2004-07-08abs ↗pdf ↗

A heuristic method refines search space for Bayesian optimization with low budget.

problem Efficiently optimize objective function with limited evaluation budget.
method Divide search space into promising regions to refine Bayesian optimization.
result Bayesian optimization with proposed method outperforms standard Bayesian optimization.

Given a simplicial complex KK, we consider several notions of geometric complexity of embeddings of KK in a Euclidean space Rd{\mathbb R}^d: thickness, distortion, and refinement complexity (the minimal number of simplices needed for a PL embedding). We show that any nn-complex with NN simplices which topologically…

2013-11-12abs ↗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 ↗

The generalized volume conjecture relates asymptotic behavior of the colored Jones polynomials to objects naturally defined on an algebraic curve, the zero locus of the A-polynomial A(x,y)A(x,y). Another "family version" of the volume conjecture depends on a quantization parameter, usually denoted qq or \hbar; this quan…

2012-03-09abs ↗pdf ↗

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 introduce a multimodal visual-textual search refinement method for fashion garments. Existing search engines do not enable intuitive, interactive, refinement of retrieved results based on the properties of a particular product. We propose a method to retrieve similar items, based on a query item image and textual re…

2019-06-15abs ↗pdf ↗

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 ↗

The multivariable Conway function is generalized to oriented framed trivalent graphs equipped with additional structure (coloring). This is done via refinements of Reshetikhin-Turaev functors based on irreducible representations of quantized gl(1|1) and sl(2). The corresponding face state sum models for the generalized…

2002-04-24abs ↗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 ↗

Improved lower bound for first Dirichlet eigenvalue using variance refinement.

problem Finding a more precise lower bound for the first Dirichlet eigenvalue.
method Refined Jensen-Hölder averaging using variance term.
result Explicit closed-form in-diameter bound strictly stronger than previous estimates.

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 ↗

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.

MGDL refines deep neural networks by training grades sequentially, improving stability.

problem Training deep neural networks is challenging due to nonconvex optimization landscapes.
method MGDL trains deep networks grade by grade, freezing previously learned grades and training new ones to fit residuals.
result MGDL guarantees vanishing error in a fixed-width multigrade ReLU architecture.

In this note we revisit the subject of anomaly cancelation in string theory and M-theory on manifolds with String structure and give three observations. First, that on String manifolds there is no E8 x E8 global anomaly in heterotic string theory. Second, that the description of the anomaly in the phase of the M-theory…

2008-07-30abs ↗pdf ↗

The paper improves confidence regions for band-limited functions using tighter norm bounds and majority voting.

problem Constructing reliable confidence regions for band-limited functions from noisy data.
method Improved norm bounds using Hoeffding's inequality and empirical Bernstein bound, majority voting to aggregate intervals.
result Confidence intervals retain their simultaneous coverage guarantee even when aggregated from random subsamples.

Paper refines cross-lingual word embeddings using Manhattan norm.

problem Sensitivity of 2\ell_{2} norm loss function to outliers in CLWEs.
method Post-processing step using 1\ell_{1} norm to improve CLWEs.
result The 1\ell_{1} refinement substantially outperforms state-of-the-art baselines.

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.

For an eigenfunction of the Laplacian on a hyperbolic Riemann surface, the coefficients of the Fourier expansion are described as intertwining functionals. All intertwiners are classified. A refined growth estimate for the coefficients is given and a summation formula is proved.

2006-07-11abs ↗pdf ↗

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 ↗

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 ↗