Polynomial neural networks explore thresholds for maximum expressiveness.
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.
Trend · papers per month
New method infers co-expression networks robustly from multiple studies.
Paper studies the expressivity of Convolutional Neural Networks (CNNs).
This article is devoted to the maximisation of HARA utilities of L{é}vy switching process on finite time interval via dual method. We give the description of all f-divergence minimal martingale measures in initially enlarged filtration, the expression of their Radon-Nikodym densities involving Hellinger and Kulback-Lei…
Training deep generative models with maximum likelihood remains a challenge. The typical workaround is to use variational inference (VI) and maximize a lower bound to the log marginal likelihood of the data. Variational auto-encoders (VAEs) adopt this approach. They further amortize the cost of inference by using a rec…
Paper estimates optimal ROC curve arc length and AUC, improving classification performance.
The study calculates the Smith-Thom deficiency of Hilbert squares and provides conditions for maximality.
We show that there is no algorithm deciding whether the maximal residually free quotient of a given finitely presented group is finitely presentable or not. Given a finitely generated subgroup G of a finite product of limit groups, we discuss the possibility of finding an explicit set of defining equations (i.e. of exp…
Recently, Hodgson and Kerckhoff found a small bound on Dehn surgered 3-manifolds from hyperbolic knots not admitting hyperbolic structures using deformations of hyperbolic cone-manifolds. They asked whether the area normalized meridian length squared of maximal tubular neighborhoods of the singular locus of the cone-ma…
New method estimates latent gene expression factors without overlap with known confounders.
Let be a connected, linear, real reductive Lie group with compact centre. Let be compact. Under a condition on , which holds in particular if is maximal compact, we give a geometric expression for the multiplicities of the -types of any tempered representation (in fact, any standard representation) …
We derive a new Bayesian Information Criterion (BIC) by formulating the problem of estimating the number of clusters in an observed data set as maximization of the posterior probability of the candidate models. Given that some mild assumptions are satisfied, we provide a general BIC expression for a broad class of data…
Optimal wealth strategy derived for jump-diffusion models with liabilities.
In this paper, we consider the classical problem of utility maximization in a financial market allowing jumps. Assuming that the constraint set is a compact set, rather than a convex one, we use a dynamic method from which we derive a specific BSDE. We then aim at showing existence and uniqueness results for the introd…
This paper provides an explicit formula for complex structures in embeddings of manifolds.
Stokes' theorem's boundary maximizes entropy.
Iterative Proportional Fitting (IPF), combined with EM, is commonly used as an algorithm for likelihood maximization in undirected graphical models. In this paper, we present two iterative algorithms that generalize upon IPF. The first one is for likelihood maximization in discrete chain factor graphs, which we define …
Maximal correlation framework improves fairness in machine learning algorithms.
The success of deep networks has been attributed in part to their expressivity: per parameter, deep networks can approximate a richer class of functions than shallow networks. In ReLU networks, the number of activation patterns is one measure of expressivity; and the maximum number of patterns grows exponentially with …
Biclustering techniques have been widely used to identify homogeneous subgroups within large data matrices, such as subsets of genes similarly expressed across subsets of patients. Mining a max-sum sub-matrix is a related but distinct problem for which one looks for a (non-necessarily contiguous) rectangular sub-matrix…
Investor maximizes utility from an unknown claim using robust optimization.
A new method for faster bandwidth selection in Gaussian kernel ridge regression.
Learning data representations that are transferable and are fair with respect to certain protected attributes is crucial to reducing unfair decisions while preserving the utility of the data. We propose an information-theoretically motivated objective for learning maximally expressive representations subject to fairnes…
Complex classification performance metrics such as the F-measure and Jaccard index are often used, in order to handle class-imbalanced cases such as information retrieval and image segmentation. These performance metrics are not decomposable, that is, they cannot be expressed in a per-example manner, which hinder…
Estimate relaxation times in nonextensive systems using gradient flow for Tsallis entropy maximization.
Geometric GNNs improve graph discrimination through GWL.
We study the canonical complexifications of non-compact Riemannian symmetric spaces G/K by the Grauert tube construction. We determine the maximal such complexification, a domain already constructed in another context by Akhiezer and Gindikin (Math. Ann., 1990), and show that this domain is Stein. We show there is an a…
How does one find dimensions in multivariate data that are reliably expressed across repetitions? For example, in a brain imaging study one may want to identify combinations of neural signals that are reliably expressed across multiple trials or subjects. For a behavioral assessment with multiple ratings, one may want …
Optimizes portfolios using CPT utility via convex optimization.
GFlowNet-EM learns complex latent variable models with discrete structures.
Study feature representations induced by dependence between variables.
Improved bounds on neural network expressivity.
We generalise the Atiyah-Segal-Singer fixed point theorem to noncompact manifolds. Using -theory, we extend the equivariant index to the noncompact setting, and obtain a fixed point formula for it. The fixed point formula is the explicit cohomological expression from Atiyah-Segal-Singer's result. In the noncompact …
Study on pseudo-Einstein 3-manifolds, calculating determinant changes under conformal transformations.
This note presents an analytic construction of the optimal unit-norm direction hat(x) = x/|x| that maximizes or minimizes the objective linear expression, B . hat(x), subject to a system of linear constraints of the form [A] . x = 0, where x is an unknown n-dimensional real vector to be determined up to an overall norm…
We present explicit classes of probability distributions that can be learned by Restricted Boltzmann Machines (RBMs) depending on the number of units that they contain, and which are representative for the expressive power of the model. We use this to show that the maximal Kullback-Leibler divergence to the RBM model w…
In this work a new way to calculate the multivariate joint entropy is presented. This measure is the basis for a fast information-theoretic based evaluation of gene relevance in a Microarray Gene Expression data context. Its low complexity is based on the reuse of previous computations to calculate current feature rele…
Paper introduces MTCM to measure multivariate tail dependence.
MarkerMap selects key genes for cell type analysis in single-cell RNA-seq.
This paper considers the problem of optimal liquidation of a position in a risky security in a financial market, where price evolution are risky and trades have an impact on price as well as uncertainty in the filling orders. The problem is formulated as a continuous time stochastic optimal control problem aiming at ma…
Optimal portfolios are found for a wide range of utility functions under hyperbolic returns.
New tiling algorithm for hyperbolic 3-manifolds, characterizing cusp areas.
The Lie group SO_0(n, 1) has the left-invariant metric coming from the Killing-Cartan form. The maximal compact subgroup SO(n) of the isometry group acts from the left. The geometry of the quotient space of the homogeneous submersion SO_0(n, 1) -> SO(n)\SO_0(n, 1) is investigated. The space is expressed as a warped pro…
Sparse linear (or generalized linear) models combine a standard likelihood function with a sparse prior on the unknown coefficients. These priors can conveniently be expressed as a maximization over zero-mean Gaussians with different variance hyperparameters. Standard MAP estimation (Type I) involves maximizing over bo…
Localized curvature bounds ensure harmonic maps are constant.
In this paper we assume the insurance wealth process is driven by the compound Poisson process. The discounting factor is modelled as a geometric Brownian motion at first and then as an exponential function of an integrated Ornstein-Uhlenbeck process. The objective is to maximize the cumulated value of expected discoun…
We bound two global invariants of cusped hyperbolic manifolds: the length of the shortest closed geodesic (the systole), and the radius of the biggest embedded ball (the inradius). We give an upper bound for the systole, expressed in terms of the dimension and simplicial volume. We find a positive lower bound on the in…
Data-driven method for option pricing using historical asset prices.