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

Trend · papers per month

96193289385 · May 202619922001200920182026
48 results for Herglotz condition

Rigidity of spectral data for spherical manifolds with boundary.

problem Determining the length spectrum of spherically symmetric manifolds with boundary.
method Proving a trace formula and using it to show spectral rigidity.
result The Neumann spectrum uniquely determines the length spectrum for spherically symmetric manifolds with boundary.

Paper derives invariantised Euler-Lagrange equations for Herglotz problems.

problem Nonconservative Herglotz variational problems.
method Invariant calculus of variations and moving frames.
result Derivation of generalised Euler-Lagrange equations and conserved quantities.

Injectivity of geodesic ray transform on specific Finsler manifolds proven.

problem Injectivity of geodesic ray transform on spherically symmetric reversible Finsler manifolds.
method Reduction to invertibility of generalized Abel transforms using angular Fourier series and Taylor expansions of geodesics.
result Injectivity of geodesic ray transform proven on specified Finsler manifolds.

The paper integrates dissipative and curl forces using geometric methods.

problem Incorporating dissipative forces into curl forces for non-conservative systems.
method Geometric metriplectic approach, Herglotz principle, generalized Euler-Lagrange equation, Galley's method.
result Natural formulations for Lagrangian and Hamiltonian dynamics of non-conservative systems.

Variational reduction simplifies Lagrangian systems with scaling symmetries.

problem Simplifying Lagrangian systems with scaling symmetries.
method Defining a variational reduction procedure for homogenous Lagrangian systems.
result Reconstructing trajectories from critical points of reduced variational principle.

Research decouples Lie algebroids using bicocycle double cross product theory.

problem Understanding decoupling and coupling phenomena in Lie algebroids.
method Bicocycle double cross product realization method.
result Unified product, double cross product, semi-direct product, and cocycle extension frameworks are instances of the general method.

Suppose M_t is a smooth family of compact connected two dimensional submanifolds of Euclidean space E^3 without boundary varying isometrically in their induced Riemannian metrics. Then we show that the mean curvature integrals over M_t are constant. It is unknown whether there are nontrivial such bendings. The estimate…

1998-10-21abs ↗pdf ↗

This paper extends the evolution operator to contact mechanics, linking Lagrangian and Hamiltonian formulations.

problem Translating the evolution operator to contact mechanics for mechanical systems with dissipation.
method Using the evolution operator K to connect Lagrangian and Hamiltonian formalisms in contact mechanics.
result The evolution operator provides a geometric description of evolution equations and relates constraints.

In this paper we analyze the local and global boundary rigidity problem for general Riemannian manifolds with boundary (M,g)(M,g). We show that the boundary distance function, i.e., dgM×Md_g|_{\partial M\times\partial M}, known near a point pMp\in \partial M at which M\partial M is strictly convex, determines gg in a suita…

2017-02-13abs ↗pdf ↗

The paper develops a new approach to conditional risk measures using modular convex analysis.

problem Developing a new method for conditional risk measures.
method Random modular approach to conditional certainty equivalents and niveloids in the conditional LL^{\infty}-space.
result Retrieves a conditional variational formula for optimized certainty equivalents and applies it to the conditional entropic risk measure.

We extend probabilistic programming to handle conditioning on marginal distributions.

problem Conditioning probabilistic programs on marginal distributions of observable variables.
method We define and implement stochastic conditioning, allowing inference in probabilistic programs conditioned on marginal distributions.
result We demonstrate the effectiveness of stochastic conditioning in various real-life scenarios.

Paper constructs solutions to Bogomolny equations with specific boundary and asymptotic conditions.

problem Constructing solutions to Bogomolny equations with given boundary and asymptotic conditions.
method Using generalized Nahm pole boundary condition and real symmetry breaking condition.
result Solutions analogous to instanton solutions, satisfying different asymptotic conditions.

Paper finds necessary condition for logarithmic Minkowski problem in higher dimensions.

problem Logarithmic Minkowski problem in higher dimensions.
method Established a necessary condition through generalization and refinement of previous work.
result Generalizes and refines necessary condition for logarithmic Minkowski problem.

Identifies conditional parity as a general notion of non-discrimination in machine learning.

problem Addressing non-discrimination in machine learning models.
method Identifies conditional parity as a general notion of non-discrimination and studies randomization and a kernel-based test to analyze it.
result Conditional parity is a general notion of non-discrimination and several recent notions of non-discrimination are instances of conditional parity.

This paper introduces a neural operator for probabilistic conditioning.

problem Probabilistic conditioning of random variables XX given YY.
method Develops a single operator that maps any joint density to its conditional, approximated by neural operators.
result Neural operators can approximate the conditioning operator to arbitrary accuracy.

CSI method learns conditional distributions by estimating flow equations.

problem Learning conditional distributions in generative models.
method Estimates probability flow equations to transport reference to target distribution.
result Derives explicit expressions for conditional drift and score functions.

New conditional risk measures called conditional generalized quantiles defined and characterized.

problem Developing new risk measures for dynamic risk assessment.
method Propose and characterize conditional generalized quantiles using expected utility model and equivalent conditions.
result Characterized conditional generalized quantiles as well-defined and equivalent to a conditional first order condition.

A new method for learning conditional distributions using ODEs and neural networks.

problem Learning conditional distributions efficiently and accurately.
method Conditional Föllmer Flow, discretized with Euler's method, using nonparametric velocity estimation.
result Effective approximation of target conditional distributions, with convergence results for Wasserstein-2 distance.

Sharp statistical theory for conditional diffusion models.

problem Lack of theoretical foundation for conditional diffusion models.
method Sharp statistical theory with approximation of conditional score function.
result Sample complexity bound that adapts to data distribution smoothness.

An analysis is made of reality conditions within the context of noncommutative geometry. We show that if a covariant derivative satisfies a given left Leibniz rule then a right Leibniz rule is equivalent to the reality condition. We show also that the matrix which determines the reality condition must satisfy the Yang-…

1998-06-12abs ↗pdf ↗

The Bakry-Émery condition is satisfied for glued spaces of Riemannian manifolds.

problem Conditions for metric measure spaces to satisfy the Bakry-Émery condition.
method Sufficient and necessary conditions for the Bakry-Émery condition on glued spaces of Riemannian manifolds.
result The Bakry-Émery condition is strictly weaker than the RCD condition and the local dimension is not constant.

Kernel conditional exponential family generalizes conditional distributions.

problem Modeling conditional distributions with flexibility and consistency.
method Introduces a nonparametric family using RKHS and functional parameters, with an algorithm for learning the natural parameter.
result Consistency of the estimator in well-specified cases, and superior performance in experiments.

We consider families of strongly consistent multivariate conditional risk measures. We show that under strong consistency these families admit a decomposition into a conditional aggregation function and a univariate conditional risk measure as introduced Hoffmann et al. (2016). Further, in analogy to the univariate cas…

2016-09-26abs ↗pdf ↗

Proposes a new method for interpreting feature importance and effects in dependent feature models.

problem Challenges in interpreting feature importance when features are dependent and interactions are present.
method Conditional Subgroup Approach
result Conditional PFI and PDP estimates based on this approach often outperform existing methods.

This paper investigates how policy conditioning affects reinforcement learning stability.

problem Improving stability and generalization of reinforcement learning agents.
method The authors study Jacobian conditioning behavior during policy optimization and propose a conditioning regularization algorithm.
result The proposed conditioning regularization algorithm enhances reinforcement learning agent generalization.

New boundary conditions solve Cauchy problem for Dirac operators on spacetimes.

problem Understanding non-local boundary conditions for Dirac operators on spacetimes.
method Define and analyze a class of Lorentzian boundary conditions that are local in time and non-local in spatial directions.
result Well-posed Cauchy problem for the Dirac operator is established under these conditions.

A method for estimating conditional mode using multiple quantile regressions.

problem Estimation of conditional mode with high-dimensional conditioning variables.
method Estimate conditional density by solving multiple quantile regressions, then find the maximum of the estimated density.
result The proposed method is computationally stable and statistically efficient with a fast convergence rate.

We extend CS divergence to conditional distributions and show its advantages in time series data and sequential decision making.

problem Quantifying the closeness between conditional distributions.
method Developed and estimated a conditional Cauchy-Schwarz divergence using kernel density estimation.
result Conditional CS divergence outperforms previous methods in time series clustering and sequential decision making.

Paper addresses Heston model under violated Feller condition, deriving new change of measure conditions.

problem Investigates Heston model under Feller condition violation.
method Derives sufficient conditions for equivalent martingale measure and true martingale stock price process.
result New conditions for change of measure and martingale properties in Heston model are established.

We describe a Groebner basis of relations among conditional probabilities in a discrete probability space, with any set of conditioned-upon events. They may be specialized to the partially-observed random variable case, the purely conditional case, and other special cases. We also investigate the connection to generali…

2008-08-08abs ↗pdf ↗

A new method tests conditional independence by transforming it into an unconditional problem using transport maps.

problem Testing conditional independence between two random vectors given a third.
method Constructing transport maps to transform conditional independence into unconditional independence, estimating these maps from data using conditional continuous normalizing flow models.
result The proposed method is validated through simulations and real-data analysis, demonstrating practical effectiveness.

Formula for conditional covariance matrices simplified for elliptical distributions.

problem Analytical formula for conditional covariance matrices in elliptical distributions.
method Analytical formula for conditional covariance matrices of elliptically distributed random vectors based on linear combinations of marginal variables.
result Simplified formula for conditional covariance matrices, introducing univariate invariant.

DG algorithms often fail to generalize well in limited domains, highlighting necessary vs. sufficient conditions.

problem DG algorithms fail to consistently outperform ERM in limited domains.
method Examined necessary and sufficient conditions for DG, proposing a subspace alignment method.
result DG methods focus on sufficient conditions, often neglecting necessary conditions, leading to generalization failures.