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,742 papers · 148 categories

Trend · papers per month

count % of corpus

9 results for “negentropy”

Establishing Linear Surrogate Regret Bounds for Convex Smooth Losses via Convolutional Fenchel-Young Lossescs.LG

We establish linear regret bounds for convex smooth losses using Fenchel-Young losses.

problem Establishing linear regret bounds for convex smooth losses.

method Constructing a convex smooth surrogate loss using Fenchel-Young losses generated by the convolutional negentropy.

result We derive a smooth loss with a linear surrogate regret bound.

surrogate regret bounds convex smooth losses Fenchel-Young losses convolutional negentropy linear regret bound

2025-05-14abs ↗pdf ↗

Projection pursuit based on Gaussian mixtures and evolutionary algorithmsstat.ML

A novel PP algorithm using GMMs and GAs for detecting informative structures.

problem Detecting informative structures in multivariate datasets.

method Gaussian mixture models (GMMs) and Genetic Algorithms (GAs) for optimal projection.

result The approach effectively detects informative structures in multivariate datasets.

Projection pursuit Gaussian mixtures Genetic Algorithms Multivariate datasets Informative structures

2019-12-27abs ↗pdf ↗

Linear Independent Component Analysis via Optimal Transportcs.LG

OT-ICA uses optimal transport to find independent components, outperforming traditional methods.

problem Finding independent components from linear mixtures of signals.

method OT-ICA uses the squared Wasserstein distance to maximize non-Gaussianity, optimizing projections via gradient descent.

result OT-ICA outperforms traditional proxy-based methods in various applications.

ICA Optimal Transport Wasserstein Distance Non-Gaussianity Gradient Descent

2026-07-15abs ↗pdf ↗

MGD: Moment Guided Diffusion for Maximum Entropy Generationstat.ML

MGD combines maximum entropy and diffusion methods for efficient sampling.

problem Generating samples from limited information in high dimensions.

method Moment Guided Diffusion (MGD) using stochastic differential equations.

result MGD efficiently samples maximum entropy distributions in finite time.

maximum entropy diffusion moment constraints stochastic differential equations negentropy

2026-02-19abs ↗pdf ↗

Loss Functions and Operators Generated by f-Divergencescs.LG

New loss functions based on f-divergences improve language model performance.

problem Improving multiclass classification and language modeling performance.

method Constructing new convex loss functions using f-divergences and deriving an operator for computation.

result The

α

-divergence loss function with

α=1.5

performs well across various tasks.

f-divergences loss functions language modeling multiclass classification Tsallis α-negentropy

2025-01-30abs ↗pdf ↗

Sparse Continuous Distributions and Fenchel-Young Lossescs.LG

This paper develops sparse alternatives to continuous distributions, including new types of Gaussians and attention mechanisms.

problem Creating flexible continuous distributions with varying support for machine learning applications.

method Defining

Ω

-regularized prediction maps and Fenchel-Young losses for arbitrary domains, and deriving new types of Gaussians and attention mechanisms.

result Sparse alternatives to continuous distributions, including deformed exponential families and

β

-Gaussians, are introduced.

sparse distributions continuous domains Fenchel-Young losses Tsallis negentropy attention mechanisms

2021-08-04abs ↗pdf ↗

Second-order Approximation of Minimum Discrimination Information in Independent Component Analysisstat.ML

A new method improves ICA performance by approximating MDI.

problem Improving F astICA's performance with nonlinear functions.

method Second-order approximation of MDI for joint maximization.

result Efficiency validated through experiments compared to other ICA algorithms.

ICA Independent Component Analysis FastICA MDI Second-order approximation

2021-11-30abs ↗pdf ↗

Incremental Cluster Validity Indices for Hard Partitions: Extensions and Comparative Studycs.LG

Validation is one of the most important aspects of clustering, but most approaches have been batch methods. Recently, interest has grown in providing incremental alternatives. This paper extends the incremental cluster validity index (iCVI) family to include incremental versions of Calinski-Harabasz (iCH), I index and …

2019-02-18abs ↗pdf ↗

iCVI-ARTMAP: Accelerating and improving clustering using adaptive resonance theory predictive mapping and incremental cluster validity indicescs.LG

iCVI-ARTMAP accelerates clustering with adaptive resonance theory and validity indices.

problem Improving clustering efficiency and accuracy using adaptive resonance theory.

method Integrates adaptive resonance theory (ARTMAP) with incremental cluster validity indices (iCVIs) for clustering.

result Significantly reduces clustering time and outperforms other methods on synthetic and real-world data.

clustering adaptive resonance theory incremental validity indices unsupervised learning image clustering

2020-08-22abs ↗pdf ↗