Statistical learning theory provides bounds of the generalization gap, using in particular the Vapnik-Chervonenkis dimension and the Rademacher complexity. An alternative approach, mainly studied in the statistical physics literature, is the study of generalization in simple synthetic-data models. Here we discuss the c…
New theory for partial disentanglement from sparse graphs.
problem Disentangling latent factors from sparse causal graphs.
method Generalization of disentanglement theory to any graph, using consistency equivalence.
result Partial disentanglement captures expected factor entanglement based on graph structure.
New algorithm nearly achieves ground state free energy of SK model.
problem Determining the ground state free energy of the SK model.
method Controlled Loosening-up (CLuP) algorithm applied to SK models.
result Achieves ground state free energy of ~0.76 for n in the thousands.
In this thesis, we study extensions of the theory of Riemannian submanifolds in two directions. First, we will show how Riemannian geometry and submanifold theory in particular, can be generalized using the notion of 'Rinehart spaces', and it will be demonstrated how the developed framework unifies some existing and ne…
Developing an AI economist agent using RAG, knowledge graphs, and LLMs for economic scenario analysis.
problem Economic scenario analysis using large language models and knowledge graphs.
method Proposing an RAG-based AI economist framework that utilizes knowledge graphs and LLMs.
result Improves economic coherence and traceability in generated reports.
Ensemble unsupervised anomaly detection using IRT for hidden ground truth.
problem Challenges in constructing an ensemble from unsupervised anomaly detection methods.
method Use Item Response Theory to compute latent traits and construct an ensemble that downplays noisy methods.
result Demonstrated effectiveness of IRT ensemble on extensive data repository.
In this note we make an attempt to compare a cohomological theory of Hilbert spaces of ground states in the N=(2,2) 2d Landau-Ginzburg theory in models describing link embeddings in R3 to Khovanov and Khovanov-Rozansky homologies. To confirm the equivalence we exploit the invariance of Hilbert sp…
CLuP achieves near optimal ground state energies for positive and negative Hopfield models.
problem Finding near optimal ground state energies for positive and negative Hopfield models.
method Controlled Loosening-up (CLuP) algorithm with fully lifted random duality theory (fl RDT).
result Achieves ground state free energies of 1.77 and 0.33 for positive and negative Hopfield models respectively. Study heat profiles and eigenfunctions using Brownian motion.
problem Investigate heat profiles and eigenfunctions of Laplace equations.
method Probabilistic tools based on Brownian motion and Feynman-Kac formulae.
result Supremum norm bounds for ground state Dirichlet eigenfunctions and comparison of maximum temperatures.
Study of unoriented SL(4) foams in 3-manifolds.
problem Understanding unoriented SL(4) foams in 3-manifolds.
method Combinatorial evaluation and state space study of unoriented SL(4) foams.
result State space of any web is free of rank given by the number of its 4-colorings over a localized ground ring.
Study robustness of conformal prediction to label noise in regression and classification.
problem Robustness of conformal prediction to label noise in regression and classification.
method Characterized robustness of conformal prediction for both regression and classification problems, extending theory to control general loss functions.
result Conformal prediction and risk-controlling techniques can achieve conservative risk over clean ground truth labels with noisy labels.
Regularizing the optimal transport (OT) problem has proven crucial for OT theory to impact the field of machine learning. For instance, it is known that regularizing OT problems with entropy leads to faster computations and better differentiation using the Sinkhorn algorithm, as well as better sample complexity bounds …
Study Berry connections for 2d GLSMs, linking to cohomology theories.
problem Quantise ground states of 2d (2,2) GLSMs on a circle. method Relate periodic monopole solutions to difference modules and vector bundles with filtrations.
result Derive novel difference equations for brane amplitudes and vortex partition functions.
Generative Adversial Networks (GANs) have made a major impact in computer vision and machine learning as generative models. Wasserstein GANs (WGANs) brought Optimal Transport (OT) theory into GANs, by minimizing the 1-Wasserstein distance between model and data distributions as their objective function. Since then, W…
A new method assesses algorithmic fairness using game theory.
problem Evaluating algorithmic fairness without proprietary data.
method Cohort Shapley value, a game-theoretic approach.
result Identifies individual impact of protected attributes.
New framework for AI to learn causal models through experience.
problem Lack of guidance for variable choice and interventions in causal models for AI.
method Defines actions as state space transformations, introduces causal variables, and identifies interventions.
result Clarifies the concept of interventions and makes causal representation learning clearer.
Paper introduces untangling number to quantify 3-periodic tangle complexity.
problem Quantifying the complexity of 3-periodic tangles in biological, chemical, and physical systems.
method Introduces untangling number, a measure of minimum distance to ground state through diagrammatic operations.
result For infinite open curves, generic ground states are crystallographic rod packings.
Paper defines untangling number to measure entanglement complexity in 3-periodic networks.
problem Measuring the complexity of entanglement in 3-periodic networks.
method Defining ground states through knot-theoretic crossing diagrams and measuring untangling number.
result Introduced untangling number as a measure of entanglement complexity.
Develops a goodness-of-fit test for self-exciting processes.
problem Quantifying how well generative models capture self-exciting point processes.
method Connects to Quasi-maximum-likelihood estimator (QMLE) theory and develops a non-parametric self-normalizing statistic, the Generalized Score (GS) statistics.
result Validates the proposed GS test's good performance through numerical simulation and real-data experiments.
Proper holomorphic isometries between Bergman domains are biholomorphisms.
problem Characterizing isometries between Bergman domains.
method New method from Information Geometry.
result Proper holomorphic local isometries are biholomorphisms.
Artificial perception is traditionally handled by hand-designing task specific algorithms. However, a truly autonomous robot should develop perceptive abilities on its own, by interacting with its environment, and adapting to new situations. The sensorimotor contingencies theory proposes to ground the development of th…
This paper analyzes the difficulty of unsupervised domain adaptation using information theory.
problem The challenge of unsupervised domain adaptation under covariate shift.
method Formulates the problem using a distribution π in the ground-truth triples (p, q, f), defines optimal learner performance, and introduces PTLU for quantifying difficulty.
result Characterizes the optimal learner and introduces PTLU as a measure of UDA difficulty.
This work uses statistical mechanics to explain AI learning.
problem Understanding the statistical principles behind AI learning.
method Starting from sample concentration behaviors, the study applies statistical mechanics principles to AI and machine learning.
result Exponential families and statistical quantities are key in AI and machine learning.
Existence of a complex structure on the 6 dimensional sphere is proved in this paper. The proof is based on re-interpreting a hypothetical complex structure as a classical ground state of a Yang--Mills--Higgs-like theory on S6. This classical vacuum solution is then constructed by Fourier expansion (dimensional re…
Researchers formalize PD and PFI to relate them to data generating process.
problem Lack of theory linking PD and PFI to data generating process.
method Formalize PD and PFI as estimators of ground truth estimands, account for model variance with learner-PD and learner-PFI.
result PD and PFI estimates deviate from ground truth due to statistical biases, model variance, and Monte Carlo approximation errors.
We present the theory of tensors with Young tableau symmetry as an efficient computational tool in dealing with the polynomial first integrals of a natural system in classical mechanics. We relate a special kind of such first integrals, already studied by Lundmark, to Beltrami's theorem about projectively flat Riemanni…
The study categorizes reward errors in reinforcement learning, finding some can be beneficial.
problem Training language models with imperfect proxy rewards.
method Theoretical analysis of policy gradient optimization and categorization of reward errors.
result Reward errors can be benign or even beneficial, preventing policy from stalling.
Protocol assesses better model among two opaque models with minimal interaction.
problem Learning from two provers, one honest, the other potentially deceptive.
method Formulated and implemented a protocol for assessing better models among two opaque models.
result Protocol achieves near-optimal performance with minimal interaction and query access.
VB-Score evaluates AI systems without ground truth, revealing robustness.
problem Evaluating AI systems without ground truth labels, especially for entity-centric tasks.
method VB-Score uses variance-bounded evaluation, constraint relaxation, and Monte Carlo sampling.
result VB-Score reveals robustness differences not seen by conventional frameworks.
Introduces quadratic linking degree in algebraic geometry.
problem No specific problem stated; focuses on new concept.
method Motivic homotopy theory and Witt group.
result Explicit computation of quadratic linking degree.
We propose a novel method for clustering data which is grounded in information-theoretic principles and requires no parametric assumptions. Previous attempts to use information theory to define clusters in an assumption-free way are based on maximizing mutual information between data and cluster labels. We demonstrate …
Study on ground states of semilinear elliptic equations with various potential wells.
problem Characterizing ground states of semilinear elliptic equations with arbitrary potential wells.
method Analyzing solutions in convex domains and manifolds with non-negative Ricci curvature, using Morse theory and min-max methods.
result Ground states are mountain-pass type with Morse index 1 in convex domains and manifolds with non-negative Ricci curvature.
Unsupervised learning models can be indistinguishable without identifiability, leading to unreliable representations.
problem Unsupervised learning models may be indistinguishable without identifiability, making it impossible to recover a ground truth generative model.
method Construction based on nonlinear independent component analysis theory to illustrate potential failure cases.
result Counterexamples show that identifiability is crucial for reliable unsupervised representation learning.
Ground-A-Video edits videos without training, preserving intended changes.
problem Complex multi-attribute video editing with omitted or wrong changes.
method Grounding-guided video-to-video translation with Cross-Frame Gated Attention.
result Zero-shot multi-attribute video editing with improved accuracy and frame consistency.
Consider a sample of n points taken i.i.d from a submanifold Σ of Euclidean space. We show that there is a way to estimate the Ricci curvature of Σ with respect to the induced metric from the sample. Our method is grounded in the notions of Carré du Champ for diffusion semi-groups, the theory of Empirical process…
We construct a solution of the master equation by means of standard tools from homological perturbation theory under just the hypothesis that the ground field be of characteristic zero, thereby avoiding the formality assumption of the relevant Lie algebra. To this end we endow the homology H(g) of any differential grad…
In this paper we clarify an issue in the knot surgery construction of Fintushel and Stern. Using knot surgery, they construct an infinite number of smooth structures on 4-manifolds satisfying certain conditions, but they do not explicitly work out the circumstances under which two manifolds that arise from their constr…
The paper identifies magnetic ground states and their role in determining the conformal class of a surface.
problem Understanding the magnetic ground states and their relation to the conformal class of a surface.
method Analyzing the magnetic Laplacian and its eigenvalues on a Riemannian surface.
result The ground state spectrum uniquely determines the volume and conformal class of the metric.
Constructs new topological theories in 2D not fitting standard axioms.
problem Developing new topological theories in 2D that don't conform to traditional axioms.
method Universal construction by Blanchet et al., Kronecker's characterization, field extension, Hankel matrices, Schur polynomials, and foam evaluation.
result Introduction of non-multiplicative theories and classification over finite-dimensional state spaces.
A new method learns meaningful distances between samples using optimal transport.
problem Learning meaningful distances between samples in datasets without labeled data.
method Computes OT distances between samples and features using singular vectors of a function mapping ground metrics to OT distances.
result Wasserstein Singular Vectors provide a scalable solution for unsupervised ground metric learning.
This research detects and identifies human-made objects in 3D point clouds using novel methods.
problem Detect and identify human-made objects in 3D point clouds.
method Ground filtering, local information extraction, clustering using Marked Point Fields (MPFs) and Hessian matrix.
result The proposed method outperforms previous techniques in detecting human-made objects.
Study small perturbations on low energy Laplace eigenfunctions.
problem Understanding small changes in low energy Laplace eigenfunctions.
method Investigates nodal geometry and topology, focusing on low frequency regimes and small perturbations.
result Highlight interesting aspects of spectral theory and nodal phenomena tied to ground state/low energy eigenfunctions.
Parts of Texas, Oklahoma, and Kansas have experienced increased rates of seismicity in recent years, providing new datasets of earthquake recordings to develop ground motion prediction models for this particular region of the Central and Eastern North America (CENA). This paper outlines a framework for using Artificial…
New method improves efficiency of non-convex matrix reconstruction.
problem Reconstructing a low-rank matrix from few linear measurements.
method Factorized gradient descent with spectral initialization.
result Non-convex approaches can match the sample complexity of convex methods.
Classification of ground state solutions to critical Dirac equation on spheres.
problem Classifying ground state solutions of the critical Dirac equation.
method Exploiting conformal covariance and relating to the Yamabe equation.
result Ground state solutions are given by Killing spinors up to conformal diffeomorphisms.
It is known that the Standard Model describing all of the currently known elementary particles is based on the U(1)×SU(2)×SU(3) symmetry. In order to implement this symmetry on the ground of a non-flat space-time manifold one should introduce three special bundles. Some aspects of the mathematical theory …
The theorems we proved describe the structure of economic equilibrium in the exchange economy model. We have studied the structure of property vectors under given structure of demand vectors at which given price vector is equilibrium one. On this ground, we describe the general structure of the equilibrium state and gi…
A new learning method for prosthetic arms without explicit rewards.
problem Learning a prosthetic arm to interact with users without explicit reward signals.
method Interaction-Grounded Learning, observing multidimensional context and feedback vectors, discovering latent reward signal.
result The algorithm can discover a latent reward signal and ground its policies for successful interaction.