Research
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,657 papers · 148 categories

Trend · papers per month

62125187249 · Jun 202019922001200920172026
48 results for maximal expressiveness

Polynomial neural networks explore thresholds for maximum expressiveness.

problem Understanding the limits of polynomial neural networks' expressiveness.
method Introducing activation degree threshold to measure network expressiveness and proving its existence and upper bounds.
result Polynomial neural networks with equi-width architectures achieve the maximum expressiveness.

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…

2018-07-24abs ↗pdf ↗

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…

2019-06-13abs ↗pdf ↗

Paper estimates optimal ROC curve arc length and AUC, improving classification performance.

problem Estimating optimal ROC curve arc length and AUC in imbalanced binary classification.
method Expresses arc length and AUC as variational objectives, estimating using positive and negative samples.
result Proposed classification procedure maximizes an approximate lower bound of maximal AUC.

The study calculates the Smith-Thom deficiency of Hilbert squares and provides conditions for maximality.

problem Calculating the Smith-Thom deficiency of Hilbert squares and conditions for maximality.
method Using Mayer-Vietoris mapping and rank calculations.
result Established necessary and sufficient conditions for maximality of Hilbert squares in projective complete intersections.

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…

2009-02-12abs ↗pdf ↗

New method estimates latent gene expression factors without overlap with known confounders.

problem Estimating latent variance components in gene expression data with known confounders.
method Restricted maximum-likelihood method maximizing likelihood on orthogonal subspace.
result Method reduces runtime and attains greater likelihood values than gradient-based optimizers.

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…

2017-10-22abs ↗pdf ↗

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…

2006-12-07abs ↗pdf ↗

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 …

2012-12-12abs ↗pdf ↗

Maximal correlation framework improves fairness in machine learning algorithms.

problem Ensuring fairness in machine learning algorithms.
method Introducing maximal correlation framework for fairness constraints and deriving regularizers.
result The approach provides smooth performance-fairness tradeoff curves and competitive performance.

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 …

2019-06-03abs ↗pdf ↗

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…

2017-09-25abs ↗pdf ↗

A new method for faster bandwidth selection in Gaussian kernel ridge regression.

problem Efficiently selecting the bandwidth in Gaussian kernel ridge regression.
method Formulated an approximate Jacobian expression for bandwidth selection, proposing a closed-form heuristic.
result Our method is as accurate as cross-validation and marginal likelihood maximization but up to six orders of magnitude faster.

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…

2018-12-11abs ↗pdf ↗

Estimate relaxation times in nonextensive systems using gradient flow for Tsallis entropy maximization.

problem Estimating relaxation times in financial market dynamics.
method Developing a method using EGF for maximizing Tsallis entropy.
result Longer relaxation times for nonextensive systems compared to Shannon entropy.

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…

2001-09-24abs ↗pdf ↗

GFlowNet-EM learns complex latent variable models with discrete structures.

problem Challenges in modeling posteriors over discrete compositional latents with expectation-maximization.
method Uses GFlowNets to learn stochastic policies for sampling from complex posterior distributions.
result GFlowNet-EM enables training expressive LVMs with discrete compositional latents.

Study feature representations induced by dependence between variables.

problem Learning feature representations from dependent random variables.
method Characterized sufficient and necessary conditions for dependence-induced representations, and provided a family of loss functions.
result Features learned from the family of loss functions can be expressed as the composition of a loss-dependent function and the maximal correlation function.

We generalise the Atiyah-Segal-Singer fixed point theorem to noncompact manifolds. Using KKKK-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 …

2015-12-24abs ↗pdf ↗

Study on pseudo-Einstein 3-manifolds, calculating determinant changes under conformal transformations.

problem Prescribing the Q'-curvature on pseudo-Einstein 3-manifolds.
method Established an expression for the difference of determinants of Paneitz type operators under conformal changes.
result Generalized the expression of functional determinant from four to three dimensions.

MarkerMap selects key genes for cell type analysis in single-cell RNA-seq.

problem Selecting informative genes from large single-cell RNA-seq datasets is challenging and computationally intensive.
method MarkerMap is a generative model that identifies minimal gene sets explaining cell type variability.
result MarkerMap outperforms existing methods in both supervised and unsupervised marker selection.

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…

2019-01-03abs ↗pdf ↗

Optimal portfolios are found for a wide range of utility functions under hyperbolic returns.

problem Portfolio optimization under expected utility criterion for large portfolios.
method Analytical expressions for optimal portfolios under hyperbolic return distributions and various utility functions.
result The two-fund separation holds true for a broad class of utility functions.

New tiling algorithm for hyperbolic 3-manifolds, characterizing cusp areas.

problem Characterizing and computing maximal cusp areas in hyperbolic 3-manifolds.
method Developed a new tiling algorithm and provided simpler expressions for distances.
result Completely characterized the space of cusp neighborhoods and found the Epstein-Penner decomposition.

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…

2010-12-02abs ↗pdf ↗

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…

2012-07-10abs ↗pdf ↗

Localized curvature bounds ensure harmonic maps are constant.

problem Ensuring harmonic maps are constant under localized curvature constraints.
method Localized Bochner-type rigidity theorem for harmonic maps with image-dependent curvature bounds.
result Harmonic maps are constant if minimal Ricci curvature dominates image-dependent curvature bounds.

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…

2011-07-28abs ↗pdf ↗

Data-driven method for option pricing using historical asset prices.

problem Tackling the gap between historical asset prices and risk-neutral option pricing.
method Identifying a pricing kernel process, solving utility maximization and functional optimization problems using deep learning.
result Demonstrated the efficiency of the data-driven option pricing methodology.