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

217435652869 · Jun 202019922001200920172026
48 results for refinement approach

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.

A bicategory approach to differential cohomology is presented. Based on the axioms of Bunke-Schick, a symmetric monoidal groupoid is associated to differential refinements of cohomology theories. It is proven that such differential refinements are unique up to equivalence of the corresponding symmetric monoidal groupoi…

2012-11-29abs ↗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.

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.

Improved graph embedding through refined linear transformation and community recovery.

problem Identifying meaningful latent communities in graph data.
method Refined graph encoder embedding via linear transformation, self-training, and latent community recovery.
result Improved vertex embedding and better decision boundaries for vertex classification.

Improved anti-cancer drug sensitivity prediction using REFINED CNN ensemble learning.

problem Challenges in predicting anti-cancer drug sensitivity for individual cell lines.
method Using REFINED CNN, which represents high-dimensional vectors as compact 2D images with spatial correlations, and building ensembles of these models.
result Ensemble approaches significantly improve drug sensitivity prediction performance compared to single models.

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 ↗

Process mining is a research field focused on the analysis of event data with the aim of extracting insights in processes. Applying process mining techniques on data from smart home environments has the potential to provide valuable insights in (un)healthy habits and to contribute to ambient assisted living solutions. …

2016-09-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 ↗

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.

Eisermann and Lamm introduced a notion of symmetric equivalence among symmetric union diagrams and studied it using a refined form of the Jones polynomial. We introduced invariants of symmetric equivalence via refined versions of topological spin models and provided a partial answer to a question left open by Eisermann…

2019-01-29abs ↗pdf ↗

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 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 ↗

GENESIS-V2 infers unordered object representations without iterative refinement.

problem Unsupervised learning of unordered object representations for complex images.
method Stochastic stick-breaking process for clustering pixel embeddings.
result GENESIS-V2 outperforms recent baselines in unsupervised image segmentation and scene generation.

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 ↗

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 the three-page index for links, proving a new bound and characterizing specific links.

problem Investigating the three-page index invariant for links and proving bounds.
method Constructing three-page presentations from reduced link diagrams via binding circles and contractible subcomplexes.
result Proves a new bound for the three-page index and characterizes links achieving equality.

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.

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 ↗

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.

Applying machine learning in the health care domain has shown promising results in recent years. Interpretable outputs from learning algorithms are desirable for decision making by health care personnel. In this work, we explore the possibility of utilizing causal relationships to refine diagnostic prediction. We focus…

2017-11-29abs ↗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.

As algorithmic prediction systems have become widespread, fears that these systems may inadvertently discriminate against members of underrepresented populations have grown. With the goal of understanding fundamental principles that underpin the growing number of approaches to mitigating algorithmic discrimination, we …

2019-04-22abs ↗pdf ↗

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 ↗