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

Trend · papers per month

6481,2971,9452,593 · Jun 202019922001200920172026
48 results for maxima of random processes

New AI-block models for clustering high-dimensional variables based on maxima of random processes.

problem Clustering high-dimensional variables with weakly dependent maxima of random processes.
method Asymptotic Independent block (AI-block) models and an algorithm for variable clustering.
result The proposed AI-block models and algorithm can effectively identify clusters in high-dimensional data.

In this paper we consider the problem of finding stable maxima of expensive (to evaluate) functions. We are motivated by the optimisation of physical and industrial processes where, for some input ranges, small and unavoidable variations in inputs lead to unacceptably large variation in outputs. Our approach uses multi…

2019-02-21abs ↗pdf ↗

Develops a machine learning method for parameter estimation in branching processes models.

problem Parameter evaluation for unevenly distributed sparse and dense regions in stochastic datasets.
method Approximate Bayesian computation based on Isolation Kernel mapping and maxima weighted kernel.
result Effective parameter estimation for cancer cell evolution models using personal data.

Develops FSC for maxima nominated samples, improving classification in rare-event data.

problem Combining labeled and unlabeled data in rare-event scenarios.
method Introduces a latent representation to account for maxima nomination sampling.
result Improves classification performance in rare-event contamination mixtures.

A large number of problems in optimization, machine learning, signal processing can be effectively addressed by suitable semidefinite programming (SDP) relaxations. Unfortunately, generic SDP solvers hardly scale beyond instances with a few hundreds variables (in the underlying combinatorial problem). On the other hand…

2016-03-13abs ↗pdf ↗

We construct infinite families of closed hyperbolic surfaces that are local maxima for the systole function on their respective moduli spaces. The systole takes values along a linearly divergent sequence (Ln)n1(L_n)_{n\geq 1} at these local maxima. The only surface corresponding to L13.057L_1\approx 3.057 is the Bolza surface i…

2018-07-22abs ↗pdf ↗

The study finds multiple maxima for eigenfunctions on positively curved spheres.

problem Finding multiple non-degenerate maxima for eigenfunctions on positively curved surfaces.
method Proving the existence of a smooth closed Riemannian surface with positive Gaussian curvature and specific eigenfunction properties.
result There exist surfaces with at least m distinct non-degenerate local maxima for the first nonzero eigenfunction.

Random utility theory models an agent's preferences on alternatives by drawing a real-valued score on each alternative (typically independently) from a parameterized distribution, and then ranking the alternatives according to scores. A special case that has received significant attention is the Plackett-Luce model, fo…

2012-11-11abs ↗pdf ↗

Non-convex optimization with local search heuristics has been widely used in machine learning, achieving many state-of-art results. It becomes increasingly important to understand why they can work for these NP-hard problems on typical data. The landscape of many objective functions in learning has been conjectured to …

2017-06-18abs ↗pdf ↗

We study optimal investment in an asset subject to risk of default for investors that rely on different levels of information. The price dynamics can include noises both from a Wiener process and a Poisson random measure with infinite activity. The default events are modelled via a counting process in line with large p…

2013-12-20abs ↗pdf ↗

In this note, we show that some F-harmonic maps into spheres are global maxima of the variations of their energy functional on the conformal group of the sphere. Our result extends partially those obtained in [15] and [17] for harmonic and p-harmonic maps.

2012-10-05abs ↗pdf ↗

We consider the signed density of the extremal points of (two-dimensional) scalar fields with a Gaussian distribution. We assign a positive unit charge to the maxima and minima of the function and a negative one to its saddles. At first, we compute the average density for a field in half-space with Dirichlet boundary c…

2003-01-29abs ↗pdf ↗

For a translation surface, we define the systole to be the length of the shortest saddle connection. We give a characterization of the maxima of the systole function on a stratum, and give a family of examples providing local but nonglobal maxima on each stratum of genus at least three. We further study the relation be…

2017-07-17abs ↗pdf ↗

This paper describes a new form of unsupervised learning, whose input is a set of unlabeled points that are assumed to be local maxima of an unknown value function v in an unknown subset of the vector space. Two functions are learned: (i) a set indicator c, which is a binary classifier, and (ii) a comparator function h…

2020-01-14abs ↗pdf ↗

In this paper, we investigate the geometry of a general class of gradient flows with multiple local maxima. we decompose the underlying space into disjoint regions of attraction and establish the adjacency criterion. The criterion states a necessary and sufficient condition for two regions of attraction of stable equil…

2014-12-21abs ↗pdf ↗

This paper optimizes Bayesian acquisition functions in Gaussian Processes for better optimization.

problem Improving the efficiency of Bayesian optimization methods.
method Analysis of different acquisition functions and optimizers for optimizing Bayesian acquisition functions.
result Optimization of acquisition functions leads to faster and more accurate sampling points.

Posterior collapse in Variational Autoencoders (VAEs) arises when the variational posterior distribution closely matches the prior for a subset of latent variables. This paper presents a simple and intuitive explanation for posterior collapse through the analysis of linear VAEs and their direct correspondence with Prob…

2019-11-06abs ↗pdf ↗

Researchers solve the realization of Jordan-Kronecker invariants in Lie algebras.

problem Identifying which Jordan-Kronecker invariants can be realized by Lie algebras.
method Analyzing the Kronecker and Jordan cases, proving impossibility for certain invariants, and describing realizability for others.
result Complete solution for Jordan and Kronecker cases, partial answers for others.

Study on complexity of random polynomials with deterministic spikes, identifying phase transitions.

problem Complexity of random Gaussian polynomials with deterministic spikes on a sphere.
method Variational formulas, Kac-Rice formula, determinant asymptotics of finite-rank perturbation of Gaussian Wigner matrices.
result Identification of a topological phase transition in the complexity function.

We present a first procedure that can estimate -- with statistical consistency guarantees -- any local-maxima of a density, under benign distributional conditions. The procedure estimates all such local maxima, or modal-sets\textit{modal-sets}, of any bounded shape or dimension, including usual point-modes. In practice, modal-…

2016-06-13abs ↗pdf ↗

Two new invariants that are closely related to Milnor's curvature-torsion invariant are introduced. The first, the spiral index of a knot, captures the minimum number of maxima among all knot projections that are free of inflection points. This invariant is closely related to both the bridge and braid index of the knot…

2009-03-03abs ↗pdf ↗

We present an efficient block-diagonal ap- proximation to the Gauss-Newton matrix for feedforward neural networks. Our result- ing algorithm is competitive against state- of-the-art first order optimisation methods, with sometimes significant improvement in optimisation performance. Unlike first-order methods, for whic…

2017-06-12abs ↗pdf ↗

Study improves traffic prediction intervals for minor roads.

problem Uncertainty in traffic data for underrepresented minor roads.
method Quantile Random Forest with PCA for interval prediction.
result Achieved 88.22% interval coverage and Winkler Score of 7,468.47.

We consider the problem of estimating a large rank-one tensor uk(Rn)k{\boldsymbol u}^{\otimes k}\in({\mathbb R}^{n})^{\otimes k}, k3k\ge 3 in Gaussian noise. Earlier work characterized a critical signal-to-noise ratio λBayes=O(1)λ_{Bayes}= O(1) above which an ideal estimator achieves strictly positive correlation with the unknown ve…

2017-11-15abs ↗pdf ↗

In the modal approach to clustering, clusters are defined as the local maxima of the underlying probability density function, where the latter can be estimated either non-parametrically or using finite mixture models. Thus, clusters are closely related to certain regions around the density modes, and every cluster corr…

2020-02-10abs ↗pdf ↗

Gibbs sampling, as a model learning method, is known to produce the most accurate results available in a variety of domains, and is a de facto standard in these domains. Yet, it is also well known that Gibbs random walks usually have bottlenecks, sometimes termed "local maxima", and thus samplers often return suboptima…

2018-04-11abs ↗pdf ↗

It is natural to ask whether solvsolitons are global maxima for the Ricci pinching functional F:=scal^2/|Ric|^2 on the set of all left-invariant metrics on a given solvable Lie group S, as it is to ask whether they are the only global maxima. A positive answer to both questions was given in a recent paper by the same a…

2019-07-18abs ↗pdf ↗

This paper concerns thin presentations of knots K in closed 3-manifolds M^3 which produce S^3 by Dehn surgery, for some slope gamma. If M does not have a lens space as a connected summand, we first prove that all such thin presentations, with respect to any spine of M have only local maxima. If M is a lens space and K …

2004-02-27abs ↗pdf ↗

Gaussian processes (GPs) are Bayesian nonparametric generative models that provide interpretability of hyperparameters, admit closed-form expressions for training and inference, and are able to accurately represent uncertainty. To model general non-Gaussian data with complex correlation structure, GPs can be paired wit…

2018-03-19abs ↗pdf ↗

Deep neural networks can solve optimal stopping problems without dimensionality issues.

problem Optimal stopping problems in high-dimensional state spaces.
method Established a general framework for deep ReLU neural networks to approximate value functions and continuation values.
result Deep neural networks can approximate value functions and continuation values with error at most ε of size κd^q ε^(-r).

Long-range correlation and fluctuation in the gold market time series of world's two leading gold consuming countries, namely China and India, are studied. For both the market series during the period 1985-2013 we observe a long-range persistence of memory in the sequences of maxima (minima) of returns in successive ti…

2015-05-17abs ↗pdf ↗

Study non-orientable link cobordisms using Floer homologies to prove inequalities.

problem Prove inequalities involving Euler characteristic and local maxima in non-orientable cobordisms.
method Use unoriented instanton and knot Floer homology to introduce unoriented versions of band unknotting number and refined cobordism distance.
result Show that the difference between unoriented refined cobordism distance of a knot from the unknot and non-orientable slice genus can be arbitrarily large.

Drawdowns measuring the decline in value from the historical running maxima over a given period of time, are considered as extremal events from the standpoint of risk management. To date, research on the topic has mainly focus on the side of severity by studying the first drawdown over certain pre-specified size. In th…

2014-03-05abs ↗pdf ↗

Frequency estimation is a fundamental problem in signal processing, with applications in radar imaging, underwater acoustics, seismic imaging, and spectroscopy. The goal is to estimate the frequency of each component in a multisinusoidal signal from a finite number of noisy samples. A recent machine-learning approach u…

2019-06-03abs ↗pdf ↗

Software finds ideal polyhedra with rational dihedral angles and volume maxima.

problem Finding ideal convex polyhedra with maximal volume in hyperbolic 3-space.
method Rivin's variational characterization and combinatorial optimization algorithms.
result Maximal volume ideal polyhedra have dihedral angles that are rational multiples of π.