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.
Paper formalizes multi-dimensional FSD using geometric methods.
FCA2VEC embeds formal concept analysis data for large datasets.
Study on geometrically formal metrics on complex manifolds.
ViTaX provides formal guarantees for targeted explanations in safety-critical systems.
Paper applies Newman-Penrose formalism to ACM manifolds.
The technique of Formal Concept Analysis is applied to a dataset describing the traits of rodents, with the goal of identifying zoonotic disease carriers,or those species carrying infections that can spillover to cause human disease. The concepts identified among these species together provide rules-of-thumb about the …
In this tutorial, I will discuss the details about how Probabilistic Latent Semantic Analysis (PLSA) is formalized and how different learning algorithms are proposed to learn the model.
We present a novel method that can learn a graph representation from multivariate data. In our representation, each node represents a cluster of data points and each edge represents the subset-superset relationship between clusters, which can be mutually overlapped. The key to our method is to use formal concept analys…
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…
We present a formal proof in Lean of probably approximately correct (PAC) learnability of the concept class of decision stumps. This classic result in machine learning theory derives a bound on error probabilities for a simple type of classifier. Though such a proof appears simple on paper, analytic and measure-theoret…
This paper is a tutorial on Formal Concept Analysis (FCA) and its applications. FCA is an applied branch of Lattice Theory, a mathematical discipline which enables formalisation of concepts as basic units of human thinking and analysing data in the object-attribute form. Originated in early 80s, during the last three d…
VerifAI toolkit improves neural network-based aircraft taxiing system safety.
We study the Hamiltonian formalisms of the second order degenerate Clèment and Sarıoğlu-Tekin Lagrangians. The Dirac-Bergmann constraint algorithm is employed while arriving at the total Hamiltonian functions and the Hamilton's equations on the associated momemtum phase spaces whereas the Gotay-Nester-Hinds algorithm i…
Sensitivity analysis for individualized effects in OTRs with binary risk factors.
Our aim is to prove that two formal power series of importance to quantum topology are Gevrey. These series are the Kashaev invariant of a knot (reformulated by Huynh and the second author) and the Gromov norm of the LMO of an integral homology 3-sphere. It follows that the power series associated to a simple Lie algeb…
An autonomous variational inference algorithm for arbitrary graphical models requires the ability to optimize variational approximations over the space of model parameters as well as over the choice of tractable families used for the variational approximation. In this paper, we present a novel combination of graph part…
The goal of this paper is to show that there exists a simple, yet universal statistical logic of spectral graph analysis by recasting it into a nonparametric function estimation problem. The prescribed viewpoint appears to be good enough to accommodate most of the existing spectral graph techniques as a consequence of …
This paper formalizes Uniswap v3 using PTA and FST for rigorous analysis.
In this paper, we describe a canopolis (i.e. categorified planar algebra) formalism for Khovanov and Rozansky's link homology theory. We show how this allows us to organize simplifications in the matrix factorizations appearing in their theory. In particular, it will put the equivalence of the original definition of Kh…
We show that the Hochschild cohomology of the algebra obtained by formal deformation quantization on a symplectic manifold is isomorphic to the formal series with coefficients in the de Rham cohomology of the manifold. The cohomology class obtained by differentiating the star-product with respect to the deformation par…
We propose a formally completely integrable extension of heat hierarchy based on the space of symmetries isomorphic to the Weyl algebra . The extended heat hierarchy will be the basic model for the analysis of the extension of KP hierarchy, and other integrable equations.
Develops a new model to optimize trading in markets.
With increasing concerns about security, the need for highly secure physical biometrics-based authentication systems utilizing \emph{cancelable biometric} technologies is on the rise. Because the problem of cancelable template generation deals with the trade-off between template security and matching performance, many …
The paper formalizes and analyzes multi-agent Q-learning with value factorization.
Develops geometric Weyl calculus for curved spacetimes.
Unified recurrent networks reveal differences in complexity levels of grammars.
Biclustering is an unsupervised data mining technique that aims to unveil patterns (biclusters) from gene expression data matrices. In the framework of this thesis, we propose new biclustering algorithms for microarray data. The latter is done using data mining techniques. The objective is to identify positively and ne…
We explore the graded and filtered formality properties of finitely generated groups by studying the various Lie algebras over a field of characteristic 0 attached to such groups, including the Malcev Lie algebra, the associated graded Lie algebra, the holonomy Lie algebra, and the Chen Lie algebra. We explain how thes…
DP-SGD analysis shows many datapoints leak less privacy than previously thought.
This paper describes some applications of an incremental implementation of the principal component analysis (PCA). The algorithm updates the transformation coefficients matrix on-line for each new sample, without the need to keep all the samples in memory. The algorithm is formally equivalent to the usual batch version…
Establishes Poincaré's lemma for formal manifolds.
In this review paper we give a geometrical formulation of the field equations in the Lagrangian and Hamiltonian formalisms of classical field theories (of first order) in terms of multivector fields. This formulation enables us to discuss the existence and non-uniqueness of solutions, as well as their integrability.
This paper introduces a new classification tool named Silas, which is built to provide a more transparent and dependable data analytics service. A focus of Silas is on providing a formal foundation of decision trees in order to support logical analysis and verification of learned prediction models. This paper describes…
A new framework for robustness analysis of deep neural networks using PAC-model learning.
Study introduces statistical mechanics for min-max problems.
In the problem of domain generalization (DG), there are labeled training data sets from several related prediction problems, and the goal is to make accurate predictions on future unlabeled data sets that are not known to the learner. This problem arises in several applications where data distributions fluctuate becaus…
Although stochastic approximation learning methods have been widely used in the machine learning literature for over 50 years, formal theoretical analyses of specific machine learning algorithms are less common because stochastic approximation theorems typically possess assumptions which are difficult to communicate an…
Multivariate analysis of fMRI data has benefited substantially from advances in machine learning. Most recently, a range of probabilistic latent variable models applied to fMRI data have been successful in a variety of tasks, including identifying similarity patterns in neural data (Representational Similarity Analysis…
Foundations laid for formal manifolds in differential geometry.
Explores local structure of morphisms and formal submanifolds in formal manifolds theory.
Study non-formal pseudo-differential operators over formal ones.
Research covers geometry, analysis, and integration on infinite-dimensional spaces.
Solves differentiation for Lie ∞-groups using formal groupoids.
The paper explores methods to explain decisions of deep learning models by faithfully reproducing their training data views.
The isotropy action on certain symmetric spaces is shown to be equivariantly formal.
Interpretable ML methods for better decision-making with explanations.
This paper is devoted to the study of the max K-armed bandit problem, which consists in sequentially allocating resources in order to detect extreme values. Our contribution is twofold. We first significantly refine the analysis of the ExtremeHunter algorithm carried out in Carpentier and Valko (2014), and next propose…
Persistence diagrams are two-dimensional plots that summarize the topological features of functions and are an important part of topological data analysis. A problem that has received much attention is how deal with sets of persistence diagrams. How do we summarize them, average them or cluster them? One approach -- th…