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

2.3%4.5%6.8%9.1% · Dec 199419922001200920172026
48 results for pose refinement

This work generates synthetic 3D thermal facial data using 2D facial data and deep learning.

problem Creating large datasets for deep learning in computer vision.
method 3D facial modelling techniques and deep learning methodologies.
result Synthetic 3D thermal facial data created for deep learning applications.

Study on smoothness of solutions to nonlinear equations on Riemannian manifolds.

problem Smoothness of solutions to nonlinear equations with Neumann boundary conditions on Riemannian manifolds.
method Integral refinement of Bochner's identity.
result Semilinear Calderón-Zygmund type results on Sobolev regularity.

Refining a discrete model of Cheuk and Vorst we obtain a closed formula for the price of a European lookback option at any time between emission and maturity. We derive an asymptotic expansion of the price as the number of periods tends to infinity, thereby solving a problem posed by Lin and Palmer. We prove, in partic…

2015-02-10abs ↗pdf ↗

We introduce a scalable approach for object pose estimation trained on simulated RGB views of multiple 3D models together. We learn an encoding of object views that does not only describe an implicit orientation of all objects seen during training, but can also relate views of untrained objects. Our single-encoder-mult…

2019-08-01abs ↗pdf ↗

Structured prediction tasks pose a fundamental trade-off between the need for model complexity to increase predictive power and the limited computational resources for inference in the exponentially-sized output spaces such models require. We formulate and develop the Structured Prediction Cascade architecture: a seque…

2012-08-06abs ↗pdf ↗

Graphs are a fundamental abstraction for modeling relational data. However, graphs are discrete and combinatorial in nature, and learning representations suitable for machine learning tasks poses statistical and computational challenges. In this work, we propose Graphite, an algorithmic framework for unsupervised learn…

2018-03-28abs ↗pdf ↗

We introduce the bilinear bandit problem with low-rank structure in which an action takes the form of a pair of arms from two different entity types, and the reward is a bilinear function of the known feature vectors of the arms. The unknown in the problem is a d1d_1 by d2d_2 matrix Θ\mathbfΘ^* that defines the reward…

2019-01-08abs ↗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.

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 ↗

Counterexamples show Salter's question on Burau image is negative for n=4.

problem Conditions for a matrix to be in the Burau image of B4B_4.
method Analyzing the central quotient and using counterexamples.
result The central quotient of the Burau image group does not coincide with the central quotient of a specific subgroup of the unitary group for n=4n=4.

We consider the problem of online prediction in a marginally stable linear dynamical system subject to bounded adversarial or (non-isotropic) stochastic perturbations. This poses two challenges. Firstly, the system is in general unidentifiable, so recent and classical results on parameter recovery do not apply. Secondl…

2020-02-06abs ↗pdf ↗

Cryptocurrency forecasting model considers macro, sentiment, and technical indicators.

problem High price volatility in cryptocurrency markets.
method Dual-prediction mechanism incorporating macroeconomic fluctuations, technical indicators, and individual cryptocurrency price changes.
result The proposed model outperforms ten comparison methods in short-term cryptocurrency forecasting.

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.

The paper learns pose variations within shape populations using constrained mixtures of factor analyzers.

problem Learning pose variations within a shape population with articulated parts and relative rotations.
method Formulated as mixtures of factor analyzers, segmentation by component posterior probabilities, and constraints on factor loading matrices for rotation matrices.
result Automatic learning of pose variations from shape populations, resulting in smooth and realistic animations.

Active localization is the problem of generating robot actions that allow it to maximally disambiguate its pose within a reference map. Traditional approaches to this use an information-theoretic criterion for action selection and hand-crafted perceptual models. In this work we propose an end-to-end differentiable meth…

2019-03-05abs ↗pdf ↗

In 1974, Gehring posed the problem of minimizing the length of two linked curves separated by unit distance. This constraint can be viewed as a measure of thickness for links, and the ratio of length over thickness as the ropelength. In this paper we refine Gehring's problem to deal with links in a fixed link-homotopy …

2004-02-13abs ↗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 ↗

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 ↗

The paper analyzes the observability of relative pose estimation using dual quaternions.

problem Estimating relative pose in robotics applications.
method Lie algebraic nonlinear observability analysis on a dual quaternion system.
result Dual quaternion representation yields an observability matrix with a simple block triangular structure and full rank.

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.

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.