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

25.0%50.0%75.0%100.0% · Sep 199219922001200920172026
48 results for structured refinement

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.

Modular categories are a well-known source of quantum 3-manifold invariants. In this paper we study structures on modular categories which allow to define refinements of quantum 3-manifold invariants involving cohomology classes or generalized spin and complex spin structures. A crucial role in our construction is play…

2014-11-16abs ↗pdf ↗

Bayesian network structures are usually built using only the data and starting from an empty network or from a naive Bayes structure. Very often, in some domains, like medicine, a prior structure knowledge is already known. This structure can be automatically or manually refined in search for better performance models.…

2014-06-10abs ↗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.

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.

Let a AA be the 1-skeleton of a triangulated topological annulus. We establish bounds on the combinatorial modulus of a refinement AA', formed by attaching new vertices and edges to AA, that depend only on the refinement and not on the structure of AA itself. This immediately applies to showing that a disk triangul…

2006-08-25abs ↗pdf ↗

Dual-Channel Tensor Neural Network (DC-TNN) decomposes tensor data into low-rank and sparse components for better estimation and inference.

problem Tensor-valued data with multilinear dependencies are challenging to process due to loss of multiway geometry under vectorization.
method DC-TNN decomposes tensors into a low-rank core and a sparse refinement, processing them through coupled neural channels.
result Established non-asymptotic risk bounds and developed structure-aware conformal ROC and AUC confidence bands.

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.

Analyzes complex structure deformations using cohomology contraction methods.

problem Deforming complex structures and identifying obstructions.
method Refined power series method for (p,q)(p,q)-forms and complex structures, using Frölicher spectral sequence.
result All obstruction classes lie in the kernel of contraction maps under natural vanishing conditions.

Graph neural networks refine speaker embeddings for better session-level diarization.

problem Local speaker distinction in meeting sessions using deep embeddings.
method Graph Neural Networks (GNNs) refine speaker embeddings using session-level structural information.
result Spectral clustering on refined embeddings outperforms original embeddings significantly.

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.

We construct a stable homotopy refinement of quantum annular homology, a link homology theory introduced by Beliakova, Putyra and Wehrli. For each r2r\geq 2 we associate to an annular link LL a naive Z/rZ\mathbb{Z}/r\mathbb{Z}-equivariant spectrum whose cohomology is isomorphic to the quantum annular homology of LL as …

2019-12-31abs ↗pdf ↗

PG-EVIKAL refines molecular property predictions using neighbor fusion and evidential neural networks.

problem Improving molecular property predictions using test-time neighbor fusion.
method Adapting evidential neural networks to refine predictions by re-ranking structurally similar neighbors.
result PG-EVIKAL reduces RMSE on 14 out of 16 molecular datasets, improving calibration and sequential refinement.

The report evaluates heuristics for learning timescale graphical event models.

problem Lack of heuristics for determining hyper-parameters in timescale graphical event models.
method Proposed and evaluated different heuristics for hyper-parameter determination and refined an existing distance measure.
result Conclusions about the applicability of different heuristics on synthetic data.

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 ↗

This work refines Cover's theory for binary classification on low-dimensional data.

problem The challenge of analyzing how low-dimensional data structures affect classification models.
method Refines Cover's function-counting theory to account for low-dimensional data structure.
result Derives dichotomy counts and analyzes the impact of data structure on classification models.

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}.

SLHF uses sequential game theory to optimize preferences from human feedback.

problem Optimizing preferences from human feedback in sequential settings.
method SLHF frames the problem as a sequential-move game between Leader and Follower, decomposing the optimization into refinement and adversarial optimization.
result SLHF achieves strong alignment across diverse preference datasets and scales to large models.

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 ↗

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.

We propose a black-box variational inference method to approximate intractable distributions with an increasingly rich approximating class. Our method, termed variational boosting, iteratively refines an existing variational approximation by solving a sequence of optimization problems, allowing the practitioner to trad…

2016-11-20abs ↗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 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 ↗

Generates infinite-depth hierarchical clusters from few examples.

problem Inadequate finite-sample clustering methods for fine-scale hierarchical structures.
method Classification fields generated by a local refinement rule, approximated by predictors.
result Learned predictors can approximate infinite-depth hierarchical structures.

CAGNN learns graph embeddings without labels by clustering and refining graph topology.

problem Learning graph embeddings without labeled data.
method Cluster-aware graph neural network (CAGNN) with self-supervised learning and topology refinement.
result CAGNN achieves significant improvements in node clustering accuracy.

Clarifies boundary criterion for non-one-ended subgroups in cubulation theory.

problem Boundary criterion for relative cubulation in non-one-ended subgroups.
method Showed that if boundary criterion is satisfied for a relatively hyperbolic group, the group admits a relatively geometric action on a CAT(0) cube complex.
result The refinement of the boundary criterion is useful for constructing new relative cubulations.

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.

We prove that the moduli space of holonomy G_2-metrics on a closed 7-manifold is in general disconnected by presenting a number of explicit examples. We detect different connected components of the G_2-moduli space by defining an integer-valued analytic refinement of the nu-invariant, a Z/48-valued defect invariant of …

2015-05-11abs ↗pdf ↗

Overlays were introduced by R. H. Fox [6] as a subclass of covering maps. We offer a different view of overlays: it resembles the definition of paracompact spaces via star refinements of open covers. One introduces covering structures for covering maps and p:XYp:X\to Y is an overlay if it has a covering structure that ha…

2013-01-03abs ↗pdf ↗

We show that every closed Lorentzian surface contains at least two closed geodesics. Explicit examples show the optimality of this claim. Refining this result we relate the least number of closed geodesics to the causal structure of the surface and the homotopy type of the Lorentzian metric.

2010-11-22abs ↗pdf ↗

Half-flat SU(3)-structures are the natural initial values for Hitchin's evolution equations whose solutions define parallel G_2-structures. Together with the results of arXiv:0912.3486v1, the results of this article completely solve the existence problem of left-invariant half-flat SU(3)-structures on decomposable Lie …

2010-12-16abs ↗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 ↗