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.

169,051 papers · 148 categories

Trend · papers per month

4.2%8.3%12.5%16.7% · Apr 199519922001200920182026
48 results for Coherence Constraints

This paper improves facial expression recognition using CNNs and coherence constraints.

problem Facial expression recognition from static images and video sequences is challenging.
method Investigates the use of Convolutional Neural Networks (CNNs) with coherence constraints in a semi-supervised setting.
result Coherence constraints improve facial expression recognition quality, especially in the presence of occlusions.

Ineffective risk measures fail to control risky investor behavior in markets with arbitrage opportunities.

problem Ineffectiveness of coherent risk measures in managing risky investor behavior in markets with arbitrage opportunities.
method Analytical determination of ρρ-arbitrage portfolios and consideration of realistic numerical examples of incomplete markets.
result Expected shortfall constraints can be ineffective in realistic markets, but reasonable expected utility constraints are effective.

C-HMCNN(h) improves HMC classification by leveraging class hierarchy.

problem Hierarchical multi-label classification with class hierarchy constraints.
method Exploits class hierarchy to produce coherent predictions for multi-label classification.
result C-HMCNN(h) outperforms state-of-the-art models in HMC classification.

The paper analyzes portfolio optimization with two risk measures.

problem Optimizing a portfolio with two coherent risk measures.
method Analytical results for a static portfolio optimization problem with two risk measures.
result Characterization of optimal portfolios and explicit formulas for Gaussian returns.

Proposes a new algorithm for efficient probabilistic reconciliation of forecasts.

problem Ensuring coherence in forecasts for hierarchical time series.
method Bottom-Up Importance Sampling algorithm for any type of forecast distribution.
result Significant improvement over base probabilistic forecasts in experiments.

A machine learning framework predicts self-induced stochastic resonance in neurons.

problem Predicting coherent oscillations in slow-fast excitable systems driven by noise.
method Physics-informed machine learning with a Noise-Augmented State Predictor architecture and Kramers' escape theory constraints.
result Trained PINN accurately predicts spike-train coherence on noise intensity, excitability, and timescale separation.

This paper deals with applications of coherent risk measures to pricing in incomplete markets. Namely, we study the No Good Deals pricing technique based on coherent risk. Two forms of this technique are presented: one defines a good deal as a trade with negative risk; the other one defines a good deal as a trade with …

2006-05-02abs ↗pdf ↗

Proposes a method to improve hierarchical clustering using set-level structural priors.

problem Lack of supervision for non-leaf structure in hierarchical clustering.
method Introduces set-level structural priors for semi-supervised hyperbolic hierarchical clustering.
result Improves label consistency and similarity-based tree quality over baselines.

Enhanced neural network framework improves constraint satisfaction with topological conditioning.

problem Maintaining semantic coherence while satisfying physical and logical constraints in neuro-symbolic reasoning.
method Integrates topological conditioning with gradient stabilization mechanisms using Forman-Ricci curvature, Deep Delta Learning, and Covariance Matrix Adaptation Evolution Strategy.
result Achieves mean energy reduction to 1.15 compared to baseline values of 11.68, with 95 percent success rate.

New algorithm extracts shared latent space for cortico-muscular interactions.

problem Challenges of high dimensionality and limited sample sizes in multivariate cortico-muscular analysis.
method Structured and sparse partial least squares coherence (ssPLSC) algorithm.
result ssPLSC achieves competitive or better performance in scenarios with limited sample sizes and high noise levels.

Risk-averse model uncertainty framework for safe reinforcement learning.

problem Safe decision making in uncertain environments.
method Risk-averse perspective towards model uncertainty using coherent distortion risk measures; equivalent to distributionally robust safe reinforcement learning problems; efficient, model-free implementation.
result Demonstrates robust performance and safety across perturbed test environments.

Coherent Multiplex analyzes real-time wavelet coherence among multiple signals.

problem Identifying and visualizing coherence among multiple time series.
method Fast spectral similarity based on cosine similarity metrics of Fourier-transformed signals and sparse time-frequency wavelet coherence.
result Scalable real-time system for low-latency inference and monitoring of inter-signal relationships.

Storytelling algorithms aim to 'connect the dots' between disparate documents by linking starting and ending documents through a series of intermediate documents. Existing storytelling algorithms are based on notions of coherence and connectivity, and thus the primary way by which users can steer the story construction…

2016-02-21abs ↗pdf ↗

The transition amplitudes between coherent states on a coherent state manifold are expressed in terms of the embedding of the coherent state manifold into a projective Hilbert space. Consequences for the dimension of projective Hilbert space and a simple geometric interpretation of Calabi's diastasis follows.

1997-07-31abs ↗pdf ↗

A new video prediction model treats videos as continuous processes, reducing sampling steps and improving efficiency.

problem Efficiency and temporal coherence in video prediction models.
method Treats videos as a continuous multi-dimensional process, reducing sampling steps.
result Reduction of 75% sampling steps, state-of-the-art performance on benchmark datasets.

New method finds linear relationships across multiple data blocks using proximal gradient descent with 1\ell_1 constraint.

problem Finding leading generalized eigenvectors for multi-block CCA.
method Proximal gradient descent with 1\ell_1 constraint.
result Rate-optimal solution under suitable assumptions.

Researchers explore non-coherent banding in site-specific recombination.

problem Understanding non-coherent banding in site-specific recombination.
method Survey of recent developments in non-coherent banding on knots.
result Recent advances in non-coherent banding model for site-specific recombination.

The paper introduces logic constraints to improve AI model interpretability.

problem The black box nature of AI models limits their trustworthiness in high-stakes fields.
method The paper extends AI models with logic constraints to make feature importance more interpretable.
result Promising experimental results have been achieved for the Adult dataset.

Sparse coding in learned dictionaries has been established as a successful approach for signal denoising, source separation and solving inverse problems in general. A dictionary learning method adapts an initial dictionary to a particular signal class by iteratively computing an approximate factorization of a training …

2012-05-28abs ↗pdf ↗

New metric mm-coherence measures gradient alignment during training, revealing surprising memorization patterns.

problem Measuring and understanding the alignment of per-example gradients during training.
method Introducing mm-coherence as a metric to study gradient alignment, showing its advantages over existing metrics.
result Training with random labels leads to high mm-coherence, indicating common patterns even when generalization is not possible.

Develops equivariant Chern characters for coherent sheaves with group actions.

problem Computing Chern characters for coherent sheaves on manifolds with group actions.
method Introduces equivariant Chern characters and proves Riemann-Roch-Grothendieck theorem in Bott-Chern cohomology.
result Establishes a Riemann-Roch-Grothendieck theorem for coherent sheaves with finite group actions.

We introduce a machine learning approach for extracting fine-grained representations of protein evolution from molecular dynamics datasets. Metastable switching linear dynamical systems extend standard switching models with a physically-inspired stability constraint. This constraint enables the learning of nuanced repr…

2016-10-05abs ↗pdf ↗

Generates coherent storybooks from plain text using diffusion models.

problem Ensuring coherency in a sequence of images for storytelling applications.
method Combines pre-trained LLM and text-guided Latent Diffusion Model for zero-shot generation.
result Outperforms state-of-the-art image editing baselines in generating coherent storybooks.

Low-rank matrix approximations are often used to help scale standard machine learning algorithms to large-scale problems. Recently, matrix coherence has been used to characterize the ability to extract global information from a subset of matrix entries in the context of these low-rank approximations and other sampling-…

2010-09-04abs ↗pdf ↗

Morse theory extended to noncompact manifolds with complex geometric data.

problem Extending Morse theory to noncompact manifolds with intricate geometric and homotopy data.
method Defining Morse homology for pairs of manifolds and related geometric/homotopy data, constructing a homotopy coherent diagram of linear maps, and showing it computes Morse homology.
result Morse homology can be computed using a chain complex derived from a homotopy coherent diagram.

Develops non-standard analysis for coherent risk estimation.

problem Estimating coherent risk measures in financial contexts.
method Non-standard analysis, hyperfinite representations, discrete Kusuoka formulae, plug-in asymptotics.
result Uniform almost sure consistency and asymptotic normality of spectral plug-in estimators.

We propose a pricing technique based on coherent risk measures, which enables one to get finer price intervals than in the No Good Deals pricing. The main idea consists in splitting a liability into several parts and selling these parts to different agents. The technique is closely connected with the convolution of coh…

2006-05-02abs ↗pdf ↗