We construct geometric shrinkage priors for Kählerian signal filters. Based on the characteristics of Kähler manifolds, an efficient and robust algorithm for finding superharmonic priors which outperform the Jeffreys prior is introduced. Several ansätze for the Bayesian predictive priors are also suggested. In particul…
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
48 results for “geometric priors”
Study explores geometric structure and prior for beta-logistic distribution.
problem Understanding the geometric structure and prior distributions of the beta-logistic distribution.
method Exploring dual geometric structure and uncovering -parallel prior.
result The beta-logistic distribution admits an -parallel prior for any real number .
Understanding and Improving UMAP with Geometric and Topological Priors: The JORC-UMAP Algorithmcs.LG
JORC-UMAP improves UMAP by incorporating geometric and topological priors.
problem UMAP's local Euclidean distance assumption fails to capture intrinsic manifold geometry, leading to topological tearing and structural collapse.
method JORC-UMAP introduces Ollivier-Ricci curvature as a geometric prior and Jaccard similarity as a topological prior to reinforce edges and reduce redundant links.
result JORC-UMAP reduces tearing and collapse more effectively than standard UMAP and other DR methods, as measured by SVM accuracy and triplet preservation scores.
LatFormer improves geometric reasoning by incorporating lattice symmetry priors in attention mechanisms.
problem State-of-the-art models struggle with geometric reasoning tasks in the ARC and LARC datasets.
method Introduced LatFormer, a model that uses lattice symmetry priors in attention masks.
result LatFormer requires 2 orders of magnitude fewer data than standard attention mechanisms.
GIBLy adds geometric priors to 3D segmentation models, improving performance with minimal overhead.
problem Lack of explicit geometric information in 3D semantic segmentation models.
method Introduces GIBLy, a lightweight geometric inductive bias layer that integrates learnable geometric priors into existing 3D segmentation pipelines.
result Consistent performance gains across multiple benchmarks, including up to +11.5% mIoU on TS40K with PTV3.
New method learns disentangled representations using Gromov-Monge maps.
problem Learning disentangled representations from unlabelled data.
method Introduces a novel approach based on Gromov-Monge maps to preserve geometric features while aligning data distributions.
result Demonstrates effectiveness on four benchmarks, outperforming other methods.
High-dimensional ConvNets detect patterns in 32+ dimensions for geometric registration.
problem Detecting geometric patterns in high-dimensional spaces.
method High-dimensional convolutional networks applied to geometric registration problems.
result High-dimensional ConvNets outperform global pooling approaches in 3D registration and image correspondence.
New method samples Jeffreys prior for objective Bayesian inference.
problem Sampling from Jeffreys prior is challenging.
method Metropolis-Adjusted Langevin Algorithm
result Samples can be directly used in Bayesian methods.
Extends diffusion models to non-Euclidean spaces with geometric priors.
problem Difficulties in natural sciences with symmetries and non-Euclidean data.
method Constructs a noising process and neural network equivariant to symmetry group, approximates score function.
result Model can generate complex scalar and vector fields on synthetic and real-world data.
Soft geometric bias improves physical dynamics predictions.
problem Learning physical dynamics with exact group equivariance can degrade performance.
method Object-centric world models using geometric algebra neural networks.
result Soft geometric inductive bias leads to better physical fidelity predictions.
A novel circuit motif uses sister cells for inference with correlated priors.
problem Structured priors in neural systems pose architectural challenges.
method Proposes a novel circuit motif using sister cells to implement correlated priors without direct interactions.
result Demonstrates the efficacy of correlated priors for inference in noisy environments.
A new Weyl prior is proposed for Bayesian statistics, offering a more canonical choice for parameter α.
problem Choosing a prior distribution for Bayesian inference.
method Proposed a new Weyl prior based on the Weyl structure on a statistical manifold.
result The Weyl prior is a special case of the α-parallel prior with α = -n, where n is the dimension of the statistical manifold.
Proposes Gaussian process priors on graph sets with geometric structure.
problem Defining Gaussian process priors on sets of graphs with geometric structure.
method Defines priors respecting graph geometric structure, analogous to Euclidean isotropic processes.
result Efficient computational technique for evaluating priors' kernels, making them usable in toolboxes.
A new prior for VAEs improves model capacity by allowing a more flexible latent space.
problem Standard Gaussian priors in VAEs limit model capacity and performance.
method Proposed a Riemannian Brownian motion prior over a Riemannian structure of the latent space.
result The new prior significantly increases model capacity with only one additional scalar parameter.
The problem of identifying geometric structure in heterogeneous, high-dimensional data is a cornerstone of representation learning. While there exists a large body of literature on the embeddability of canonical graphs, such as lattices or trees, the heterogeneity of the relational data typically encountered in practic…
LIMP learns latent shapes with metric preservation, improving generative models.
problem Insufficient training data for high-fidelity latent representations.
method Metric preservation as a prior, geometric distortion criterion, geodesic loss.
result Synthetic samples of higher quality achieved through metric preservation.
We review the information geometry of linear systems and its application to Bayesian inference, and the simplification available in the Kähler manifold case. We find conditions for the information geometry of linear systems to be Kähler, and the relation of the Kähler potential to information geometric quantities such …
A parametrization of hypergraphs based on the geometry of points in is developed. Informative prior distributions on hypergraphs are induced through this parametrization by priors on point configurations via spatial processes. This prior specification is used to infer conditional independence models or M…
Bayesian framework for sphere regression using Gaussian fields.
problem Nonparametric regression on the sphere with Gaussian priors.
method Isotropic Gaussian field priors, harmonic structure, exact posterior distributions, optimal spectral truncation, posterior contraction rates.
result Sharp posterior contraction rates for Gaussian priors with polynomially decaying angular power spectra.
Open problem: Establishing bounds for Cayley-table completion to discover discrete algorithmic axioms.
problem Discovering discrete algorithmic axioms missing in deep learning.
method Cayley-table completion as a testbed for algorithmic complexity minimization.
result Formal exact recovery bounds for Cayley-table completion.
Improved Bayesian inference using power priors with historical data.
problem Improving Bayesian inference with historical data.
method Generalized power priors that adapt to the parameter of Amari's -divergence.
result Improved performance through appropriate choices of the parameter.
In a discrete time and multiple-priors setting, we propose a new characterisation of the condition of quasi-sure no-arbitrage which has become a standard assumption. This characterisation shows that it is indeed a well-chosen condition being equivalent to several previously used alternative notions of no-arbitrage and …
Estimates class prior for unlabeled data using kernel embedding.
problem Estimating class prior in PU learning scenario where only positive and full population samples are available.
method Direct estimator based on distribution matching and kernel embedding in Reproducing Kernel Hilbert Space.
result Asymptotic consistency and explicit deviation bound for the estimator.
Proposes a new SPVM model for RVM with more flexible priors.
problem Improper priors on multiple penalty parameters in RVM lead to improper posteriors.
method Introduces a single penalty approach (SPRVM) and a semi-Bayesian fitting method.
result SPRVM allows for more flexible priors and has proven conditions for posterior propriety.
Only Bayes should learn a manifold (on the estimation of differential geometric structure from data)stat.ML
We investigate learning of the differential geometric structure of a data manifold embedded in a high-dimensional Euclidean space. We first analyze kernel-based algorithms and show that under the usual regularizations, non-probabilistic methods cannot recover the differential geometric structure, but instead find mostl…
GABI learns geometry from diverse systems to improve Bayesian inference.
problem Bayesian inversion of physical systems with varying geometries.
method Geometric Autoencoders for Bayesian Inversion (GABI) learns geometry-aware priors from large datasets.
result GABI yields comparable predictive accuracy to deterministic methods and well-calibrated uncertainty quantification.
We develop a coreset for robust geometric median, reducing size dependency on outliers.
problem Robust geometric median problem in Euclidean space with outliers.
method Construction of a compact coreset with size dependency on eliminated.
result Elimination of dependency in coreset size, achieving size.
Unified geometric principles unify neural network architectures.
problem High-dimensional learning tasks with underlying low-dimensionality and structure.
method Unified geometric principles applied to neural network architectures.
result Unified mathematical framework for neural network architectures.
This paper provides an introduction to the basics of Heegaard Floer homology with some emphasis on the hat theory and to the contact geometric invariants in the theory. The exposition is designed to be comprehensible to people without any prior knowledge of the subject.
Generalizes Sobolev IPM for graph-based measures using Orlicz geometric structure.
problem Limitation of Le et al. (2025) framework to geometry.
method Generalizes Sobolev IPM through Orlicz geometric structure, employing convex functions to capture nuanced geometric relationships.
result GSI-M reduces to a simple univariate optimization problem, achieving remarkable computational efficiency.
We present a geometric formulation of the Multiple Kernel Learning (MKL) problem. To do so, we reinterpret the problem of learning kernel weights as searching for a kernel that maximizes the minimum (kernel) distance between two convex polytopes. This interpretation combined with novel structural insights from our geom…
New method uses quotient predictor space for better PAC-Bayes bounds, reducing KL divergence and improving model performance.
problem Overparameterized models with continuous symmetries can lead to biased predictions.
method Perform PAC-Bayesian analysis on quotient predictor space, constructing a canonical prior that reflects model's implicit bias.
result The new prior reduces KL divergence and improves model performance in experiments.
Develops VAEs for learning complex physical systems from data.
problem Learning low-dimensional representations of nonlinear physical systems.
method Variational Autoencoders with manifold latent spaces.
result Effective in learning nonlinear Burgers equation and constrained mechanical systems.
Researchers use LLMs to judge other LLMs, but this study provides a new geometric perspective to understand when it works.
problem The challenge of evaluating LLMs using other LLMs as judges, considering both aleatoric and epistemic uncertainties.
method A geometric perspective on ranking LLM candidates using probability simplices, analyzing conditions for identifiable rankings and designing Bayesian priors.
result Geometric analysis reveals that rankings based on LLM judges are robust in many but not all datasets, emphasizing the importance of modeling epistemic uncertainty.
Study foliations on Riemannian manifolds with specific vector fields, focusing on geometric properties.
problem Investigate foliations transverse to closed conformal vector fields on Riemannian manifolds.
method Analyze conditions for totally geodesic leaves and geometric constraints on foliations.
result Characterize totally geodesic foliations and classify minimal and constant mean curvature foliations.
Bayesian methods estimate regression functions on submanifolds using graph Laplacian eigenbasis.
problem Estimating regression functions on unknown smooth submanifolds.
method Random geometric graph structure, Bayesian priors based on random basis expansion in graph Laplacian eigenbasis.
result Posterior contraction rates are minimax optimal for any positive smoothness index.
Model approximates market prices and returns without prior market dynamics.
problem Simultaneously approximate market prices and log returns.
method GDN model of Kratsios and Papon (2022) for generalized Ornstein-Uhlenbeck process.
result Universal approximation guarantees for conditional distributions and contingent claims.
VolNP learns IVS from sparse quotes via meta-learning and SABR priors.
problem Reconstructing implied volatility surfaces from sparse option quotes.
method Meta-learning Neural Process with SABR-induced priors.
result VolNP outperforms SABR, SSVI, and Gaussian process on SPX options.
Improves latent space structure for better data representation.
problem Limited ability of conventional priors to encode data manifold structure.
method Introduces an Encoded Prior Sliced Wasserstein AutoEncoder with iterative training and geodesic interpolation.
result Learned manifold encoding preserves topological and geometric properties of data.
Elliptical slice sampling converges geometrically, providing reliable sampling for Bayesian learning.
problem Sampling from posterior distributions in Bayesian learning.
method Elliptical slice sampling, geometric ergodicity.
result Elliptical slice sampling yields geometric convergence guarantees under weak regularity assumptions.
C-VAE improves class representation in long-tailed generative models.
problem Latent geometric bias in VAEs under class imbalance.
method Per-class Student's t-distribution priors, closed-form objective, equal-weight latent mixture.
result Consistently lower FID scores and better class-balanced generation for severely imbalanced datasets.
Improves label propagation for weakly supervised learning.
problem Reducing the need for labeled data in machine learning.
method Label Propagation with Weak Supervision (LPA) analysis.
result Demonstrated improvements over existing methods on weakly supervised classification tasks.
A new GNN module learns geometric scattering features for better graph classification and feature exploration.
problem Learning long-range graph relations and extracting meaningful features from graphs.
method Proposes a learnable geometric scattering (LEGS) module in graph neural networks (GNNs), incorporating wavelet filters.
result LEGS-based GNNs outperform existing methods in graph classification and feature extraction tasks.
Bayesian deep learning with heavy-tailed weights achieves near-optimal performance.
problem Deep neural networks with heavy-tailed weights achieve near-optimal performance in various contexts.
method Introduced a Bayesian deep learning prior based on heavy-tailed weights and ReLU activation, showing near-optimal minimax contraction rates.
result Posterior distribution achieves near-optimal minimax contraction rates, adaptive to smoothness and intrinsic dimension.
Enhances quantum circuit synthesis using deep learning and geometric methods.
problem Optimizing quantum circuits for time efficiency.
method Combining deep learning with geometric control techniques.
result Improved time-optimal control in quantum circuit synthesis.
We focus in this paper on high-dimensional regression problems where each regressor can be associated to a location in a physical space, or more generally a generic geometric space. Such problems often employ sparse priors, which promote models using a small subset of regressors. To increase statistical power, the so-c…
Flows with surgery revisitedmath.AP
New method for geometric flows with surgery without smooth estimates.
problem Existence of geometric flows with surgery.
method Hybrid compactness theorem for weak limits.
result Existence of geometric flows with surgery in mean-convex surfaces.
A new geometric perceptron model improves 3D shape classification.
problem Challenges in geometric tasks involving point clouds using machine learning.
method Introduces multilayer geometric perceptron (MLGP) with geometric neurons.
result MLGP outperforms vanilla MLP in 3D shape classification and noise resistance.