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

Trend · papers per month

51102153204 · Jun 202019922001200920172026
48 results for differentiable CEM

CEM-GD combines CEM and gradient descent for efficient model-based RL.

problem Efficient planning in continuous control settings with large prediction horizons.
method Combines CEM for exploration and gradient descent for exploitation.
result Achieves better performance with fewer samples and less computation time.

This work enhances collaborative inference privacy by minimizing conditional entropy and boosting robustness against model inversion attacks.

problem Privacy leakage in collaborative inference systems via model inversion attacks.
method Theoretical proof and derivation of a differentiable measure for bounding conditional entropy, followed by a CEM algorithm to maximize it.
result Theoretical proof and experimental validation show that CEM consistently boosts inversion robustness without compromising feature utility or efficiency.

Hybridizes CEM and gradient descent for efficient model-predictive control.

problem Efficiently planning optimal action sequences in high-dimensional spaces.
method Interleaves Cross-Entropy Method (CEM) and gradient descent steps.
result Faster convergence and avoidance of local optima compared to CEM.

This paper shows CEM is a special case of TTM, leading to new proofs and improved sample complexity bounds.

problem Improving sample complexity for reinforcement learning algorithms.
method Viewing CEM as an application of TTM, deriving new proofs and bounds.
result Improved sample complexity bounds for CEM under various conditions.

Introduces Causal Energy Minimization to understand Transformer layers.

problem Empirical parameterization of Transformer blocks remains largely unexplored.
method Causal Energy Minimization framework that recasts Transformer layers as optimization steps on conditional energy functions.
result Identifies design space for Transformer layers including weight sharing and energy-based interpretations.

TeLeS improves ASR confidence estimation by considering temporal alignment and lexical errors.

problem Inaccurate confidence scores from E2E ASR models, especially for overconfident predictions.
method Proposes TeLeS, a novel confidence score that considers temporal alignment and lexical errors, and uses shrinkage loss to handle data imbalance.
result TeLeS generalizes well across different languages and ASR models, leading to significant WER reduction.

GACEM optimizes complex multi-modal problems using neural networks.

problem Black-box optimization and constraint satisfaction in multi-modal environments.
method Modified Cross-Entropy Method with masked auto-regressive neural network.
result GACEM outperforms traditional CEM in diverse solutions, mode discovery, and sample efficiency.

New estimator improves off-policy evaluation for large action spaces.

problem Conventional importance-weighting approaches suffer from excessive variance in off-policy evaluation for large discrete action spaces.
method Proposes OffCEM estimator based on conjunct effect model (CEM), applying importance weighting only to action clusters and using model-based reward estimation for residual effects.
result Proposed estimator is unbiased under local correctness condition, providing substantial improvements in OPE especially with many actions.

A new sampler and temperature estimation method enable efficient learning of Boltzmann Machines.

problem Efficient learning of Boltzmann Machines (BMs) is challenging due to high training costs and difficulty in parallelization.
method Proposed a new Boltzmann sampler (Langevin SB, LSB) and an efficient method (Conditional Expectation Matching, CEM) for estimating inverse temperature.
result Established an efficient learning framework (Sampler-Adaptive Learning, SAL) for BMs with greater expressive power than Restricted Boltzmann Machines (RBMs).

ACFS optimizes spectral risk under decision-dependent uncertainty using adaptive forest sampling.

problem Minimizing spectral risk with decision-dependent uncertainty.
method ACFS integrates Generalised Random Forests, CEM-guided exploration, rank-weighted augmentation, and multi-start refinement.
result ACFS achieves lowest median oracle spectral risk on both benchmarks.

The closure conditions of the inexact exterior differential form and dual form (an equality to zero of differentials of these forms) can be treated as a definition of some differential-geometrical structure. Such a connection discloses the properties and specific features of the differential-geometrical structures. The…

2004-04-12abs ↗pdf ↗

In this paper we give explicit formulas of differential characteristic classes of principal GG-bundles with connections and prove their expected properties. In particular, we obtain explicit formulas for differential Chern classes, differential Pontryagin classes and differential Euler class. Furthermore, we show that…

2013-11-15abs ↗pdf ↗

We generalize stochastic smoothing for gradient estimation of non-differentiable functions.

problem Gradient estimation for non-differentiable functions.
method Developed a general framework for relaxation and gradient estimation of non-differentiable black-box functions using stochastic smoothing with reduced assumptions.
result Empirically validated the effectiveness of variance reduction strategies for various non-differentiable tasks.

The paper proves Gorenstein contractions for multiscale differentials on nodal curves.

problem Proving Gorenstein contractions for multiscale differentials on nodal curves.
method Addressing the conjecture by Ranganathan and Wise, showing contractions level by level.
result Multiscale differentials can be contracted to Gorenstein singularities, level by level, from the top down.

Classifies components of strata of k-differentials on Riemann surfaces.

problem Classifying connected components of strata of k-differentials.
method Developed new techniques to study connected components of strata of k-differentials for general k.
result Complete classification of connected components of the strata of quadratic differentials with arbitrary poles.

Given a unital associatve graded algebra we construct the graded q-differential algebra by means of a graded q-commutator, where q is a primitive N-th root of unity. The N-th power (N>1) of the differential of this graded q-differential algebra is equal to zero. We use our approach to construct the graded q-differentia…

2005-09-21abs ↗pdf ↗

Paper defines quasi-Strebel structures for meromorphic k-differentials and proves their existence.

problem Existence of quasi-Strebel structures for meromorphic k-differentials.
method Introduced quasi-Strebel structures and proved their existence for meromorphic k-differentials.
result Every differential of even order k > 2 satisfying certain conditions admits a quasi-Strebel structure.

Finite intersection numbers between horizontal foliations of quadratic differentials.

problem Intersection properties of horizontal foliations in quadratic differentials.
method Joint continuity of intersection number in L1L^1-norm.
result Intersection number is finite and jointly continuous.

We consider differentiable maps in the setting of Abstract Differential Geometry and we study the conditions that ensure the uniqueness of differentials in this setting. In particular, we prove that smooth maps between smooth manifolds admit a unique differential, coinciding with the usual one. Thus smooth manifolds fo…

2013-11-25abs ↗pdf ↗

We study two notions of relative differential cohomology, using the model of differential characters. The two notions arise from the two options to construct relative homology, either by cycles of a quotient complex or of a mapping cone complex. We discuss the relation of the two notions of relative differential cohomo…

2013-10-10abs ↗pdf ↗

Studies projective geometry and partial differential equations prolongation.

problem Understanding the prolongation of overdetermined geometric partial differential equations.
method Introduction to differential geometry and tractor calculus, study of prolongation of equations.
result Recovery of projective tractor and cotractor connections via partial differential equations prolongation.

Develops differential K-theory for noncommutative algebras.

problem Creating a differential extension of algebraic K-theory for noncommutative algebras.
method Introduces secondary transgression forms and a differential refinement of the smooth Serre--Swan correspondence.
result Subsumes differential K-theory for smooth manifolds and fits into a noncommutative differential cohomology hexagon diagram.

Extends differential geometry concepts to manifolds with super tangent bundles.

problem No specific problem stated; extending differential geometry to super tangent bundles.
method Introduces super tangent bundle and extends differential geometry concepts.
result Basic notions of differential geometry extended to manifolds with super tangent bundles.

Generalized differential cohomology theories, in particular differential K-theory (often called "smooth K-theory"), are becoming an important tool in differential geometry and in mathematical physics. In this survey, we describe the developments of the recent decades in this area. In particular, we discuss axiomatic ch…

2010-11-30abs ↗pdf ↗

Differentiable pipeline replaces non-differentiable CAE components for shape optimization.

problem Gradient-based optimization is limited by non-differentiable components in CAE workflows.
method Surrogate models replace non-differentiable pipeline components, enabling gradient-based optimization.
result Gradient-based shape optimization possible without differentiable solvers.

Differentiable programming aids in solving differential equations and their sensitivities.

problem Computing gradients of numerical solutions of differential equations.
method Review of existing techniques and mathematical foundations.
result Established a coherent framework for combining differential equations with data-driven approaches.

Efficient neural networks compute various differential operators cheaply.

problem Efficient computation of higher time complexity differential operators.
method Restricted neural network architectures with diagonal and hollow Jacobian matrices, allowing efficient extraction of dimension-wise derivatives.
result Demonstrated efficient computation of differential operators for various applications.