Formal framework verifies fairness, uniformity, and rationality in financial market trades.
problem Ensuring fairness, uniformity, and rationality in financial market trades.
method Formal definition and proof of properties in a theorem prover (Coq).
result Formal verification of double-sided auctions in financial markets.
Explores local structure of morphisms and formal submanifolds in formal manifolds theory.
problem Understanding the local structure of morphisms and formal submanifolds in formal manifolds.
method Study of formal manifolds, including local structure of constant rank morphisms and formal submanifolds.
result Developed the local structure of constant rank morphisms and formal submanifolds.
Deform quantization recovers scalar curvature in complex structures.
problem Recovering scalar curvature in complex structures.
method Formal moment map construction on almost complex structures.
result Formal moment map deforms scalar curvature moment map in integrable cases.
Formally verifies fairness and uniformity in financial market trades.
problem Ensuring fairness and uniformity in automated trading systems.
method Formal definition and verification in Coq proof assistant.
result Properties of double-sided auction mechanisms verified.
Paper formalizes multi-dimensional FSD using geometric methods.
problem Complex measure theory and calculus barriers to formalization in proof assistants.
method Geometric framework for first-order stochastic dominance in N dimensions.
result Geometric approach bypasses complex integration theory for direct comparison of survival probabilities.
Defines formal vertex laws related to Lie conformal algebras.
problem No specific problem stated; focuses on definitions and proofs.
method Definitions and proofs of vertex/conformal versions of classical Lie theory results.
result Proves vertex/conformal versions of important Lie theory results.
This paper formalizes Q-learning and linear TD convergence using Lean 4.
problem Formalizing convergence properties of Q-learning and linear TD learning. method Formal verification using Lean 4 theorem prover and Mathlib library.
result Formalized almost sure convergence of Q-learning and linear TD learning. This paper formalizes representation learning and shows its benefits.
problem Understanding and formalizing the benefits of representation learning techniques.
method Introducing a formal framework to study representation learning and its utility.
result Representation learning can be performed provably and efficiently under plausible assumptions.
Paper applies Newman-Penrose formalism to ACM manifolds.
problem Classifying compact ACM manifolds with η-Einstein metrics. method Newman-Penrose formalism applied to ACM manifolds.
result Classification of compact ACM manifolds with η-Einstein metrics. These lectures are an introduction to formal semiclassical quantization of classical field theory. First we develop the Hamiltonian formalism for classical field theories on space time with boundary. It does not have to be a cylinder as in the usual Hamiltonian framework. Then we outline formal semiclassical quantizati…
The Rusk-Skinner formalism was developed in order to give a geometrical unified formalism for describing mechanical systems. It incorporates all the characteristics of Lagrangian and Hamiltonian descriptions of these systems (including dynamical equations and solutions, constraints, Legendre map, evolution operators, e…
Paper defines XAI concepts using category theory.
problem Lack of precise mathematical definitions for XAI.
method Uses Category theory to define XAI concepts rigorously.
result Establishes a theoretical foundation for XAI.
CausalForge automates causal inference research with formal proofs and self-improvement.
problem Unreliable evaluation of automated research results by large language models.
method Formal proof assistant (Lean) and self-improving agentic pipeline.
result Automated research produces reliable formal proofs and artifacts.
New geometric framework for non-conservative field theories with time-dependent terms.
problem Describing non-conservative field theories with explicit space-time dependence.
method Combining k-cosymplectic and k-contact formulations to develop Hamiltonian and Lagrangian formalisms.
result Illustrated with the nonlinear damped wave equation, demonstrating the new formalism's applicability.
Introduces a new geometric framework for non-perturbative BV-theory.
problem Non-perturbative generalization of BV-theory in infinite-dimensional spaces.
method Derived differential geometry and homotopical algebraic geometry.
result Concrete model of derived smooth stacks for encoding non-perturbative BV-theory.
We develop an algebraic framework for the description and analysis of financial behaviours, that is, behaviours that consist of transferring certain amounts of money at planned times. To a large extent, analysis of financial products amounts to analysis of such behaviours. We formalize the cumulative interest compliant…
NEMO framework quantizes DNNs for efficient deployment.
problem Efficient deployment of quantized DNNs.
method Formal framework for quantizing DNN layers, focusing on IntegerDeployable representation.
result Quantized DNNs can be deployed using only integers.
New method assesses neural network robustness with statistical estimates.
problem Assessing neural network robustness under input models.
method Statistical approach based on estimating the proportion of inputs violating a property.
result Provides an informative notion of network robustness, scaling to larger networks.
Develops thermodynamic formalism for quasimorphisms on negatively curved spaces.
problem Analyzing quasimorphisms on negatively curved spaces.
method Thermodynamic formalism framework, Banach isomorphism, weak Livšic cohomology.
result Establishes Central Limit Theorem and invariance principle for unbounded quasimorphisms.
A quantum field theory for Spin(7)-instantons derived from moduli spaces.
problem Constructing a topological quantum field theory for Spin(7)-instantons.
method Using Mathai-Quillen formalism and AKSZ formalism, we derive the action and Batalin-Vilkovisky action.
result The Batalin-Vilkovisky action matches the Mathai-Quillen construction and provides a framework for classical observables.
Develops calculus on Wasserstein spaces for Riemannian manifolds.
problem Characterizing and understanding the geometry of Wasserstein spaces.
method Intrinsic formalism for topology, smooth structure, and Riemannian geometry of Wasserstein spaces.
result Wasserstein spaces of closed manifolds are geodesically convex.
ViTaX provides formal guarantees for targeted explanations in safety-critical systems.
problem Need trustworthy explanations for safety-critical deep neural networks.
method Formal reachability analysis for targeted, semifactual explanations.
result First method to provide formally guaranteed explanations of model resilience.
A new framework describes dissipation using a metriplectic 4-bracket.
problem Describing dissipation in a way that preserves energy and entropy.
method Using a metriplectic 4-bracket, a quantity like the Poisson bracket with symmetries motivated by Riemannian curvature.
result The metriplectic 4-bracket dynamics includes all known previous binary bracket theories for dissipation.
Formalizes learning algorithm invariances using category theory.
problem Understanding and characterizing invariances in learning algorithms.
method Using category theory to define and formalize invariances of learning algorithms.
result Illustrated and contrasted the invariances of linear regression and ridge regression.
A geometric multisymplectic formulation of the classical BRST symmetry of constrained first-order classical field theories is described. To effect this we introduce graded analogues of the bundles and manifolds of the multisymplectic formulation of first-order field theories. The Lagrange-d'Alembert formalism is also d…
New framework for detecting data drift in continuous time.
problem Drift in data distribution over time.
method Probability theoretical framework for continuous time drift.
result New efficient drift detection method and decomposition of data.
Unified tensor network formalism for combining neural and symbolic AI.
problem Combining neural and symbolic AI approaches remains a challenge.
method Introduces a tensor network formalism capturing sparsity principles.
result Unified treatment identifies tensor network contractions as a fundamental inference class.
Paper formalizes Simon's satisficing through FFSD, proving its equivalence to expected utility theory.
problem Formalizing Herbert Simon's bounded rationality concept in economic decision-making.
method Developed FFSD framework using Lean 4 theorem prover, proving equivalence to expected utility theory.
result Equivalence theorem linking FFSD to expected utility maximization for approximate indicator functions.
We formalize and verify double auctions for multiple-quantity trades.
problem Matching multiple-quantity trade requests in double auctions.
method Formalized algorithms, correctness proofs, Coq proof assistant, verified OCaml and Haskell programs.
result Automatic detection of violations in exchange systems.
Introduces topological deep learning for neural network classification problems.
problem Classifying neural networks using minimal topological structures.
method Formalizes classification problems in a topological setting.
result Demonstrates conditions for the feasibility of classification problems in neural networks.
Framework uses optimal transport for neural architecture search.
problem Optimizing neural architectures in deep learning.
method Semi-discrete optimization using optimal transport.
result Gradient flow and minimizing movement scheme converge to reaction-diffusion equations.
In this paper, we consider a generalization of variational calculus which allows us to consider in the same framework different cases of mechanical systems, for instance, Lagrangian mechanics, Hamiltonian mechanics, systems subjected to constraints, optimal control theory and so on. This generalized variational calculu…
Unified explainability for ML models using entropy projections.
problem Understanding how input variables impact machine learning model predictions.
method Information theory framework quantifying input variable influence.
result Unified, model-agnostic approach with low complexity.
New formalization of curved spaces using pointwise affine spaces.
problem Traditional curved space formalizations like manifolds are complex.
method Introduces pointwise affine spaces and new geometric definitions.
result Simplified and clearer geometric concepts and results.
Paper proposes MBP framework to price ML model instances directly, not data.
problem Reducing data acquisition cost without losing revenue or efficiency.
method Formal properties, noise injection approach, algorithmic solutions.
result MBP framework maximizes seller revenue and buyer affordability.
Develops a framework for consistent loss functions with variable transformations.
problem Lack of theoretical understanding of variable transformations in consistent loss functions.
method Formal characterizations of consistency for transformed loss functions in two cases: realization and prediction variables.
result Establishes new identifiable and elicitable functionals for complex predictive tasks.
Develops Palatini formalism for pseudo-Finsler metrics, recovering classical results.
problem Developing a formalism for pseudo-Finsler metrics of any signature.
method Substituting scalar curvature with Finslerian Ricci scalar in Einstein-Hilbert-Palatini functional.
result Recovery of classical results in Lorentzian signature with vanishing mean Landsberg tensor.
Study of 3D trans-Sasakian manifolds using Newman--Penrose formalism.
problem Characterizing and understanding the geometry of 3D trans-Sasakian manifolds.
method Using Newman--Penrose formalism to encode the geometry of the structure vector field.
result Derivation of curvature and Laplacian identities for trans-Sasakian manifolds and their subclasses, including rigidity results.
Paper develops a weighted linearization approach for vector fields.
problem Linearizability of vector fields under weighted conditions.
method Formal Moser trick applied to power series, addressing weighted non-resonance condition.
result Formal Moser trick works over any field of characteristic zero.
New biclustering algorithms for microarray data using Formal Concept Analysis.
problem Uncovering patterns in gene expression data matrices.
method Formal Concept Analysis and Association Rules.
result Promising results from proposed biclustering algorithms.
In this paper we study symmetries, Newtonoid vector fields, conservation laws, Noether's Theorem and its converse, in the framework of the k-symplectic formalism, using the Frölicher-Nijenhuis formalism on the space of k1-velocities of the configuration manifold. For the case k=1, it is well known that Cartan sy…
A general theory of quantum spinor structures on quantum spaces is presented, within the conceptual framework of the formalism of quantum principal bundles. Quantum analogs of all basic objects of the classical theory are constructed and analyzed. This includes Laplace and Dirac operators, quantum versions of Clifford …
Paper formalizes continual learning, proposing a feature extraction approach.
problem Learning from multiple environments without forgetting previous ones.
method Feature extraction framework and gradient-based algorithm DPGD.
result Efficient algorithm DPGD avoids catastrophic forgetting.
New graph distances derived from optimal transport framework using path flows.
problem Develop new graph distances for clustering and classification.
method Bag-of-paths framework with Gibbs-Boltzmann distribution and optimal transport relaxation.
result Interpolates between shortest-path and resistance distances, improving performance.
Develops Palatini formalism in generalized geometry for string theory.
problem Formulating Palatini variation in generalized geometry.
method Palatini formalism within generalized Riemannian geometry of Courant algebroids.
result Natural emergence of generalized Levi-Civita connection and string effective actions.
We sketch out a new geometric framework to construct Hamiltonian operators for generic, non-evolutionary partial differential equations. Examples on how the formalism works are provided for the KdV equation, Camassa-Holm equation, and Kupershmidt's deformation of a bi-Hamiltonian system.
We present in this paper the formalism for the splitting of a four-dimensional Lorentzian manifold by a set of time-like integral curves. Introducing the geometrical tensors characterizing the local spatial frames induced by the congruence (namely, the spatial metric tensor, the extrinsic curvature tensor and the Riema…
LPF provides formal guarantees for aggregating multi-evidence in probabilistic tasks.
problem Lack of formal guarantees for multi-evidence reasoning in AI.
method LPF uses variational autoencoders and Sum-Product Networks to aggregate evidence items.
result Proves multiple formal guarantees including calibration preservation and error decay.