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

59118176235 · Jun 202019922001200920172026
48 results for small entropy

Researchers calculate entropy of heat kernel on manifolds for very small times.

problem Estimating entropy of heat kernel on compact Riemannian manifolds for small times.
method Asymptotic expansion, polynomial expressions in curvature tensor components.
result First three coefficients of entropy expansion computed and expressed as polynomials.

The entropy of geodesic currents on hyperbolic surfaces is bounded by their self-intersection number.

problem Bounding the entropy of geodesic currents on hyperbolic surfaces.
method Established a quantitative upper bound on entropy in terms of self-intersection number and systole.
result Small self-intersection number forces small entropy.

Self-attention networks localize when eigenspectrum variance is small.

problem Self-attention mechanisms can lead to rank and entropy collapses, reducing model expressivity and trainability.
method Characterized attention localization using query-key eigenspectrum variance.
result Small eigenspectrum variance prevents both rank and entropy collapses, improving model performance.

The paper explores convergence and structure of spaces with scalar curvature and entropy bounds, introducing new dpd_p convergence.

problem Understanding convergence and structure of spaces with scalar curvature and entropy bounds.
method Introduces dpd_p convergence for rectifiable Riemannian spaces and proves compactness and regularity theorems.
result Spaces with small scalar and entropy bounds dpd_p converge to rectifiable Riemannian spaces.

We show that all closed 22-dimensional singularities for higher codimension mean curvature flow that cannot be perturbed away have uniform entropy bounds and lie in a linear subspace of small dimension. The entropy and dimension of the subspace are both C(1+γ)\leq C\,(1+γ) for some universal constant CC and genus γγ. Th…

2019-06-18abs ↗pdf ↗

We study volume growth, entropy and stability for translating solitons of mean curvature flow. First, we prove that every complete properly immersed translator has at least linear volume growth. Then, by using Huisken's monotonicity formula, we compute the entropy of the grim reaper and the bowl solitons. We also give …

2016-12-15abs ↗pdf ↗

We use a weak mean curvature flow together with a surgery procedure to show that all closed hypersurfaces in R4\mathbb{R}^4 with entropy less than or equal to that of S2×R\mathbb{S}^2\times \mathbb{R}, the round cylinder in R4\mathbb{R}^4, are diffeomorphic to S3\mathbb{S}^3.

2015-11-02abs ↗pdf ↗

State entropy regularization improves robustness in reinforcement learning, especially under structured perturbations.

problem Structured and spatially correlated perturbations in reinforcement learning.
method State entropy regularization, compared to policy entropy.
result State entropy regularization provides better robustness to structured and spatially correlated perturbations.

Two things seem to be indisputable in the contemporary deep learning discourse: 1. The categorical cross-entropy loss after softmax activation is the method of choice for classification. 2. Training a CNN classifier from scratch on small datasets does not work well. In contrast to this, we show that the cosine loss fun…

2019-01-25abs ↗pdf ↗

ALIEN improves uncertainty estimation of language models by refining entropy-based methods.

problem Overconfidence in uncertainty estimation for language models, especially for difficult inputs.
method ALIEN refines entropy-based uncertainty by aligning it with prediction reliability, using a lightweight uncertainty head.
result ALIEN consistently outperforms strong baselines in detecting incorrect predictions and achieving the lowest calibration error.

We consider a hyperbolic surface bundle over the circle with the smallest known volume among hyperbolic manifolds having 3 cusps, so called "the magic manifold". We compute the entropy function on the fiber face of the unit ball with respect to the Thurston norm, determine homology classes whose representatives are gen…

2008-12-25abs ↗pdf ↗

We introduce on any smooth oriented minimal surface in Euclidean 33-space a meromorphic quadratic differential, PP, which we call the entropy differential. This differential arises naturally in a number of different contexts. Of particular interest is the realization of its real part as a conservation law for a natur…

2013-01-08abs ↗pdf ↗

We study the problem of discovering the simplest latent variable that can make two observed discrete variables conditionally independent. The minimum entropy required for such a latent is known as common entropy in information theory. We extend this notion to Renyi common entropy by minimizing the Renyi entropy of the …

2018-07-26abs ↗pdf ↗

Let bb be a pseudo-Anosov braid whose permutation has a fixed point and let MbM_b be the mapping torus by the pseudo-Anosov homeomorphism defined on the genus 00 fiber FbF_b associated with bb. This paper describes a structure of the fibered cone C\mathcal{C} of FF for MbM_b. We prove that there is a 22-dimension…

2018-07-03abs ↗pdf ↗

In many applications the process of generating label information is expensive and time consuming. We present a new method that combines active and semi-supervised deep learning to achieve high generalization performance from a deep convolutional neural network with as few known labels as possible. In a setting where a …

2018-03-03abs ↗pdf ↗

We define a (mean curvature flow) entropy for Radon measures in Rn\mathbb{R}^n or in a compact manifold. Moreover, we prove a monotonicity formula of the entropy of the measures associated with the parabolic Allen-Cahn equations. If the ambient manifold is a compact manifold with non-negative sectional curvature and pa…

2018-12-20abs ↗pdf ↗

We present a new statistical learning paradigm for Boltzmann machines based on a new inference principle we have proposed: the latent maximum entropy principle (LME). LME is different both from Jaynes maximum entropy principle and from standard maximum likelihood estimation.We demonstrate the LME principle BY deriving …

2012-10-19abs ↗pdf ↗

Thanks to a recent result by Jean-Marc Schlenker, we establish an explicit linear inequality between the normalized entropies of pseudo-Anosov automorphisms and the hyperbolic volumes of their mapping tori. As its corollaries, we give an improved lower bound for values of entropies of pseudo-Anosovs on a surface with f…

2014-11-24abs ↗pdf ↗

Constructs flows on manifolds with small curvature, proving Euclidean topology.

problem Geometric structure of manifolds with unbounded curvature.
method Distance like functions with integral hessian bound, Ricci flows.
result Manifolds with Ricci lower bound, non-negative scalar curvature, bounded entropy, Ahlfors nn-regular and small curvature concentration are topologically Euclidean.

New method speeds up lead-lag detection between asynchronous time series.

problem Slow inference of lead-lag networks between long time series.
method Derive asymptotic distribution of Transfer Entropy and introduce time-shifted time series.
result Statistically validated lead-lag networks between time series.

Empirical evidence suggests that even the most competitive markets are not strictly efficient. Price histories can be used to predict near future returns with a probability better than random chance. Many markets can be considered as {\it favorable games}, in the sense that there is a small probabilistic edge that smar…

1999-01-22abs ↗pdf ↗

Contextual policy search allows adapting robotic movement primitives to different situations. For instance, a locomotion primitive might be adapted to different terrain inclinations or desired walking speeds. Such an adaptation is often achievable by modifying a small number of hyperparameters. However, learning, when …

2015-11-13abs ↗pdf ↗

Paper proposes AXE loss for non-autoregressive machine translation, improving performance.

problem Challenges in training non-autoregressive models due to lack of autoregressive factors and cross entropy loss penalties.
method Proposes aligned cross entropy (AXE) loss function using a differentiable dynamic program for better word order alignment.
result AXE-based training improves performance on major WMT benchmarks and sets a new state of the art for non-autoregressive models.

Proposes SOVR loss to improve adversarial robustness by increasing logit margins.

problem Adversarial training's difficulty in robustness against sophisticated attacks.
method Introduces SOVR loss function that switches from cross-entropy to one-vs-the-rest loss for important samples.
result SOVR loss increases logit margins of important samples, improving robustness against Auto-Attack.

New RL method nearly optimally learns policies with generative models.

problem Finding optimal policies in reinforcement learning with generative models.
method Mirror descent value iteration with KL divergence and entropy regularization.
result The method is nearly minimax-optimal for small ε\varepsilon-optimal policies.

A regularization procedure developed in [1] for the integral curvature invariants on manifolds with conical singularities is generalized to the case of squashed cones. In general, the squashed conical singularities do not have rotational O(2) symmetry in a subspace orthogonal to a singular surface ΣΣ so that the surfa…

2013-06-17abs ↗pdf ↗

EntProp increases entropy of clean samples to generate out-of-distribution data for better DNN performance.

problem Improving deep neural networks' accuracy and robustness to out-of-distribution data.
method High entropy propagation using data augmentation and free adversarial training.
result EntProp achieves higher standard accuracy and robustness with lower training cost.