Introduces Lie group actions in smoothing processes for currents and spaces with curvature.
problem Regularization of currents and metrics on manifolds and spaces with curvature.
method Actions of compact Lie groups in De Rham approximation and smoothing of Riemannian metrics.
result Effective smoothing processes for currents and metrics on manifolds and spaces with curvature.
We analyze disentangled representations under a causal generative process, proposing new metrics and datasets.
problem Addressing fairness and interpretability through disentangled representations with a causal perspective.
method Work under a causal generative process, proposing new metrics and datasets to study disentanglement.
result Proposed metrics capture the desiderata of disentangled causal process.
New metrics using Laplace approximation improve Gaussian process model selection.
problem Finding a balance between model accuracy, interpretability, and simplicity.
method Introducing multiple metrics based on the Laplace approximation to evaluate Gaussian process models.
result Our metrics provide comparable performance to dynamic nested sampling but are significantly faster.
The paper calculates how random changes affect paths on a complex geometric space.
problem Computing the evolution of paths on a manifold of Riemannian metrics.
method Using diffusion processes and stochastic kinetic energy functional.
result Computed the evolution equation for the Lagrangian.
Invites probabilistic approach to Kähler-Einstein metrics via random point processes.
problem Constructing Kähler-Einstein metrics on complex projective algebraic manifolds.
method Large N-limit from random point processes defined by algebro-geometric data; variational approach for positive Ricci curvature.
result Convergence of metrics to Kähler-Einstein metrics under specific conditions.
New Fourier metrics equivalent to Wasserstein distances in image processing.
problem Equivalence of Fourier-based and Wasserstein metrics in imaging problems.
method Extensions of Fourier-based metrics to handle different centers of mass and discrete measures, showing equivalence to Wasserstein distances.
result New Fourier metrics are equivalent to Wasserstein distances with explicit constants, improving runtime in image processing.
Development of metrics for structural data-generating mechanisms is fundamental in machine learning and the related fields. In this paper, we give a general framework to construct metrics on random nonlinear dynamical systems, defined with the Perron-Frobenius operators in vector-valued reproducing kernel Hilbert space…
Study of lengths of cycles in large genus random maps converging to Poisson process.
problem Understanding the distribution of cycle lengths in large genus random maps.
method Teichmüller theory approach for uniformly random metric maps (ribbon graphs).
result The length spectrum converges to a Poisson point process with an explicit intensity as genus tends to infinity.
Metrics assess uncertainty structure and distribution for regression models.
problem Quantifying uncertainty in high-dimensional and nonlinear regression tasks.
method Two bounded comparison metrics for uncertainty structure and distribution.
result DNNs and DNOs provide encouraging uncertainty metric values in high dimensions.
We investigate the geometrical structure of probabilistic generative dimensionality reduction models using the tools of Riemannian geometry. We explicitly define a distribution over the natural metric given by the models. We provide the necessary algorithms to compute expected metric tensors where the distribution over…
The study improves volatility model pricing accuracy with new statistical expansions.
problem Improving option pricing accuracy in volatility models.
method Developed Edgeworth expansions for various volatility models.
result Enhanced statistical expansions for volatility models.
Study reveals attention mechanism's similarity computation parallels traditional machine learning.
problem Understanding the essence and principles of attention mechanism in deep learning.
method Examined classic metrics and vector space properties in manifold learning, clustering, and supervised learning to identify key characteristics of similarity computation and information propagation.
result Self-attention mechanism in deep learning adheres to the same principles but operates more flexibly and adaptively.
A new metric space model for point process excitations uncovers hidden interactions.
problem Estimating pairwise interactions in multivariate Hawkes processes is often infeasible.
method Developed a Hidden Hawkes Geometry (HHG) model to embed event types in a metric space.
result Learning the embedding reveals salient interactions in various applications.
The sequence of moments of a vector-valued random variable can characterize its law. We study the analogous problem for path-valued random variables, that is stochastic processes, by using so-called robust signature moments. This allows us to derive a metric of maximum mean discrepancy type for laws of stochastic proce…
A novel GPUM constructs Gaussian Processes for unknown manifolds with probabilistic metrics.
problem High-dimensional data on unknown manifolds with non-Euclidean geometry.
method Bayesian Gaussian Processes latent variable models (BGPLVM), Riemannian geometry, probabilistic metric tensor, Brownian Motion.
result GPUM provides more accurate predictions on unknown manifolds compared to traditional methods.
A new geometry for comparing signals, overcoming traditional limitations.
problem Comparing and interpolating discontinuous and signed signals.
method Investigation of Riemannian geometry on signal space, introducing a metric that measures both horizontal and vertical deformations.
result Characterization of metric properties and establishment of geodesic regularity and stability.
Develops a fair post-processing method for student success predictions.
problem Ensuring fairness in predictive student models for educational applications.
method Uses the MADD metric to improve model fairness while maintaining accuracy.
result Successfully improved fairness of predictive models for student success.
We introduce a novel encoder-decoder architecture to embed functional processes into latent vector spaces. This embedding can then be decoded to sample the encoded functions over any arbitrary domain. This autoencoder generalizes the recently introduced Conditional Neural Process (CNP) model of random processes. Our ar…
Bayesian optimization on networks using Gaussian process models.
problem Optimizing expensive black-box functions on network structures.
method Developed Bayesian optimization algorithms with Gaussian process surrogates tailored to network geometry.
result Established regret bounds for smooth objective functions and analyzed practical cases.
Proves generalization bounds for SGD using Feller processes and Hausdorff dimension.
problem Characterizing generalization properties of SGD in deep learning.
method Proves generalization bounds for SGD under Feller process approximation, linking generalization error to the Hausdorff dimension of trajectories.
result Generalization error controlled by the Hausdorff dimension of trajectories, which is linked to the tail behavior of the driving process.
New metrics predict human sentence comprehension across languages.
problem Predicting human sentence comprehension using computational models.
method Developed sentence-level metrics using multilingual large language models.
result Achieved high accuracy in predicting human sentence reading speeds.
Bayesian neural networks approximate Student-t processes in the infinite-width limit.
problem Modeling uncertainty in neural networks with greater flexibility.
method Extending asymptotic properties of Gaussian processes to Student-t processes in the infinite-width limit of BNNs.
result Posterior BNNs converge to Student-t processes in the infinite-width limit.
Continuous process closes cusps in complex algebraic surfaces.
problem Developing cusps in Kähler-Einstein metrics on algebraic surfaces.
method Continuous cusp closing process via gluing construction.
result Cusps form in Kähler-Einstein metrics near isolated singularities.
Navigation in Lorentz Finsler geometry induces isoparametric hypersurfaces.
problem Defining and analyzing isoparametric hypersurfaces in Lorentz Finsler geometry.
method Using a navigation process with a Finsler metric and a tangent vector field, isoparametric functions and hypersurfaces are defined and analyzed.
result Local correspondences between isoparametric functions and hypersurfaces are established.
Statistical analysis of Diffusion Tensor Imaging (DTI) data requires a computational framework that is both numerically tractable (to account for the high dimensional nature of the data) and geometric (to account for the nonlinear nature of diffusion tensors). Building upon earlier studies that have shown that a Rieman…
Study asymptotics of Selberg zeta function on spin moduli space.
problem Asymptotic behavior of Selberg zeta function for degenerating metrics.
method Analyzes logarithmic derivative of Selberg zeta function for spin Dirac operator on compact surfaces.
result Proves asymptotic expansion up to order t4logt. Unified theory for adaptive image convolutions using metric perspectives.
problem Fixed kernels in convolutions limit adaptability in image processing.
method Metric perspective on images as 2D manifolds with local distances, proposing metric convolutions.
result Metric convolutions provide better generalisation and competitive performance.
A new deep metric learning method for defect classification in threaded pipe connections.
problem Defect classification in threaded pipe connections with limited and imbalanced multichannel functional data.
method COMPILED approach based on deep metric learning for imbalanced, multichannel, and partially observed functional data.
result Superior accuracy compared to existing benchmarks in a real-world case study.
Paper reinterprets majorizing measure theorem in terms of coding theory.
problem Understanding boundedness of random processes.
method Information-theoretic perspective using variable-length codes.
result Boundedness of random processes linked to efficient coding.
This research tackles group fairness in predictive process monitoring by ensuring predictions are independent of sensitive group membership.
problem Predictive models using biased historical data can perpetuate unfair behavior in new cases.
method Investigates independence through metrics like ΔDP and a composite loss function balancing predictive performance and fairness.
result Proposes and validates a composite loss function for training models that balance fairness and performance.
Novel framework for learning infinitesimal generator of stochastic processes.
problem Challenges in learning infinitesimal generator due to unbounded nature and state space dimensionality.
method Introduces a novel framework based on energy functional, integrates physical priors, and uses reduced-rank estimator in RKHS.
result Learning bounds independent of state space dimension and non-spurious spectral estimation.
CAI automates extraction and validation of corporate GHG emission metrics.
problem Manual extraction of corporate GHG emission metrics is labor-intensive and error-prone.
method CAI uses LLMs to automate extraction and validation of metrics from corporate disclosures.
result CAI improves data collection efficiency and accuracy by automating the process.
We study the problem of non-explosion of diffusion processes on a manifold with time-dependent Riemannian metric. In particular we obtain that Brownian motion cannot explode in finite time if the metric evolves under backwards Ricci flow. Our result makes it possible to remove the assumption of non-explosion in the pat…
We present new algorithms for computing and approximating bisimulation metrics in Markov Decision Processes (MDPs). Bisimulation metrics are an elegant formalism that capture behavioral equivalence between states and provide strong theoretical guarantees on differences in optimal behaviour. Unfortunately, their computa…
We find a compactification of the SL(3,R)-Hitchin component by studying the degeneration of the Blaschke metrics on the associated equivariant affine spheres. In the process, we establish the closure in the space of projectivized geodesic currents of the space of flat metrics induced by holomorphic …
In the present paper and the companion paper [8] a probabilistic (statistical mechanical) approach to the study of canonical metrics and measures on a complex algebraic variety X is introduced. On any such variety with positive Kodaira dimension a canonical (birationally invariant) random point processes is defined and…
We address the issue of knots selection for Gaussian predictive process methodology. Predictive process approximation provides an effective solution to the cubic order computational complexity of Gaussian process models. This approximation crucially depends on a set of points, called knots, at which the original proces…
A large amount of data accommodated in knowledge graphs (KG) is actually metric. For example, the Wikidata KG contains a plenitude of metric facts about geographic entities like cities, chemical compounds or celestial objects. In this paper, we propose a novel approach that transfers orometric (topographic) measures to…
A new model for point processes without intensity function trade-offs.
problem Inefficiency and trade-offs in existing point process models.
method Point Set Diffusion, a diffusion-based latent variable model.
result Achieves state-of-the-art performance in point process generation.
This paper formalizes state similarity metrics for reinforcement learning.
problem Leveraging state similarity for reinforcement learning in continuous-state systems.
method Introducing a unified formalism for defining topologies through metrics.
result Established a hierarchy of metrics and demonstrated their theoretical implications.
In the present paper and the companion paper [9] a probabilistic (statistical-mechanical) approach to the construction of canonical metrics on a complex algebraic varieties X is introduced, by sampling "temperature deformed" determinantal point processes. The main new ingredient is a large deviation principle for Gibbs…
Quantum RNG improves financial risk metrics estimation.
problem Estimating financial risk metrics with high precision.
method Quantum-Enhanced Monte Carlo using QRNG.
result Improved accuracy in VaR and CVaR estimation.
Reciprocal processes are acausal generalizations of Markov processes introduced by Bernstein in 1932. In the literature, a significant amount of attention has been focused on developing dynamical models for reciprocal processes. In this paper, we provide a probabilistic graphical model for reciprocal processes. This le…
We show the existence of strictly almost-Kahler anti-self-dual metrics on certain 4-manifolds by deforming scalar-flat Kahler metrics. On the other hand, we prove the non-existence of such metrics on certain other 4-manifolds by means of Seiberg-Witten theory. In the process, we provide a simple new proof of the fact t…
Polynomial networks converge to Gaussian processes at a rate of O(n^(-1/2)).
problem Understanding the convergence rate of polynomial networks to Gaussian processes.
method Examined one-hidden-layer neural networks with random weights, focusing on polynomial activations and their convergence rate in the 2-Wasserstein metric.
result The rate of convergence for polynomial networks to Gaussian processes is $O(n^{- rac{1}{2}})$.
This work improves Gaussian process regression for large, non-stationary data.
problem Scalability issues and performance degradation for non-stationary data.
method Combines variational free energy approximations with online expectation propagation and local splitting steps.
result Incremental adaptation to locality, heterogeneity, and non-stationarity in training data.
Geodesic walks converge to Brownian motion on Finsler manifolds.
problem Understanding random walks on Finsler manifolds.
method Analyzing convergence of geodesic random walks to diffusion processes.
result The Brownian motion on a Riemannian metric is a key result.
Neural models price financial options without assuming underlying price forms.
problem Pricing financial options under flexible price processes.
method Apply neural SDEs as universal approximators, use Wasserstein distance for training.
result Error in option prices bounded by Wasserstein distance used for training.