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

1223 · Jun 201219922001200920172026
48 results for bump hunting

The paper introduces a new method to find meaningful data subsets in multivariate probability density functions.

problem Finding meaningful data subsets in multivariate probability density functions.
method The paper defines an abstract bump construct based on curvature functionals of the probability density and proposes a multivariate implementation of Good and Gaskins' original concave bumps.
result The method provides theoretical results for asymptotic consistency of bump boundaries and confidence regions.

New supervised and unsupervised NFLTs for elliptical distributions.

problem Understanding unsupervised No Free Lunch Theorems for elliptical distributions.
method Proved two equally optimal strategies for elliptical distributions, inspired PRIM-based bump-hunting algorithms.
result Optimal strategies for selecting principal components based on variance or volume.

Principal Components Analysis is a widely used technique for dimension reduction and characterization of variability in multivariate populations. Our interest lies in studying when and why the rotation to principal components can be used effectively within a response-predictor set relationship in the context of mode hu…

2014-09-30abs ↗pdf ↗

We leverage recent breakthroughs in neural density estimation to propose a new unsupervised anomaly detection technique (ANODE). By estimating the probability density of the data in a signal region and in sidebands, and interpolating the latter into the signal region, a likelihood ratio of data vs. background can be co…

2020-01-14abs ↗pdf ↗

We consider the multi-bump solutions of the following fractional Nirenberg problem \begin{equation}\label{01} (-Δ)^s u=K(x)u^{\frac{n+2s}{n-2s}}, \;\;\;\;u>0\;\;\text{ in }\mathbb{R}^n, \end{equation} where s(0,1)s\in (0,1) and n>2+2sn>2+2s. If KK is a periodic function in some kk variables with 1k<n2s21\leq k<\frac{n-2s}2, we pr…

2016-12-13abs ↗pdf ↗

We show here that the Nielsen core of the bumping set of the domain of discontinuity of a Kleinian group ΓΓ is the boundary of the characteristic submanifold of the associated 3-manifold with boundary. Some examples of interesting characteristic submanifolds are given. We also give a construction of the characteristic…

2012-08-08abs ↗pdf ↗

Inspired by the unsupervised learning or self-organization in the machine learning context, here we attempt to draw `learning curve' for the collective behavior of job-seeking `zero-intelligence' labors in successive job-hunting processes. Our labor market is supposed to be opened especially for university graduates in…

2013-09-19abs ↗pdf ↗

The level curves of an analytic function germ almost always have bumps at unexpected points near the singularity. This profound discovery of N. A'Campo is fully explored in this paper for $f(z,w)\in \C\{z,w\}$, using the Newton-Puiseux infinitesimals and the notion of gradient canyon. Equally unexpected is the Dirac ph…

2012-06-04abs ↗pdf ↗

Finite-precision learning of anh anh networks is limited by the Monte Carlo rate.

problem Learning anh anh neural networks under finite precision
method Using iterated anh anh activations to construct localized bump functions
result No adaptive randomized algorithm can achieve higher convergence rate than Monte Carlo rate in finite precision

PHBench predicts Series A funding from Product Hunt launch signals with 7.8% accuracy.

problem Predicting startup Series A funding from launch signals on Product Hunt.
method Constructed PHBench from 67,292 Product Hunt posts, linked to funding records, and used a three-component ensemble model.
result Best-performing model achieved F0.5 = 0.097 and AP = 0.037, with a statistically significant advantage over logistic regression.

Splat Regression Models use mixtures of bump functions to approximate complex data.

problem Approximating complex data with high interpretability and accuracy.
method Model outputs are mixtures of heterogeneous and anisotropic bump functions (splats) weighted by output vectors. Fitting splat models reduces to optimization over mixing measures using Wasserstein-Fisher-Rao gradient flows.
result Unified theoretical framework for Gaussian Splatting and flexible approach for diverse problems.

The study classifies geometrically finite polynomials on the boundary of Blaschke products.

problem Understanding the boundaries of hyperbolic components of Blaschke products.
method Combinatorial classification and construction of self-bumps.
result The closure of the main hyperbolic component is not a topological manifold with boundary for d4d\geq 4.

Bayesian predictive inference analyzes a dataset to make predictions about new observations. When a model does not match the data, predictive accuracy suffers. We develop population empirical Bayes (POP-EB), a hierarchical framework that explicitly models the empirical population distribution as part of Bayesian analys…

2014-11-02abs ↗pdf ↗

The concept of subdifferentiability is studied in the context of C1C^1 Finsler manifolds (modeled on a Banach space with a Lipschitz C1C^1 bump function). A class of Hamilton-Jacobi equations defined on C1C^1 Finsler manifolds is studied and several results related to the existence and uniqueness of viscosity solutions…

2014-07-10abs ↗pdf ↗

Let NN be a hyperbolic 3-manifold and BB a component of the interior of AH(π1(N))AH(π_1(N)), the space of marked hyperbolic 3-manifolds homotopy equivalent to NN. We will give topological conditions on NN sufficient to give ρBˉρ\in \bar{B} such that for every small neighborhood VV of ρρ, VBV \cap B is disconnected. This …

2000-09-15abs ↗pdf ↗

In this paper we give a necessary and sufficient condition in which a sequence of Kleinian punctured torus groups converges. This result tells us that every exotically convergent sequence of Kleinian punctured torus groups is obtained by the method due to Anderson and Canary. Thus we obtain a complete description of th…

2007-01-12abs ↗pdf ↗

New study shows acceleration in hyperbolic spaces is impossible for strongly geodesically convex functions.

problem Acceleration in hyperbolic spaces for strongly geodesically convex functions is impossible.
method Perturbing hard functions with sums of bump functions chosen by a resisting oracle.
result Acceleration is unachievable for any deterministic algorithm in hyperbolic spaces for strongly geodesically convex functions.

Given a Finsler space, we introduce a system of partial differential equations, called the Landsberg equation. Based on a careful analysis of the Landsberg equation and the observation that the solution space is invariant under the linear isometries of the tangent Minkowski spaces, we prove that an (α1,α2)(α_1, α_2)-metric …

2014-04-14abs ↗pdf ↗

This text is intended to become in the long run Chapter 3 of our long saga dedicated to Riemann, Ahlfors and Rohlin. Yet, as its contents evolved as mostly independent (due to our inaptitude to interconnect both trends as strongly as we wished), it seemed preferable to publish it separately. More factually, our account…

2013-10-07abs ↗pdf ↗

We present a method for finding high density, low-dimensional structures in noisy point clouds. These structures are sets with zero Lebesgue measure with respect to the DD-dimensional ambient space and belong to a d<Dd<D dimensional space. We call them "singular features." Hunting for singular features corresponds to f…

2016-06-01abs ↗pdf ↗

Spectral embedding uses eigenfunctions of the discrete Laplacian on a weighted graph to obtain coordinates for an embedding of an abstract data set into Euclidean space. We propose a new pre-processing step of first using the eigenfunctions to simulate a low-frequency wave moving over the data and using both position a…

2016-07-15abs ↗pdf ↗

This is supplementary material for the main Geodesics article by the authors. In Appendix A, we present some general results on the construction of Gaussian random fields. In Appendix B, we restate our Shape Theorem, specialized to the setting of this article. In Appendix C, we state some straightforward consequences o…

2012-06-21abs ↗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 ↗

A machine learning model may exhibit discrimination when used to make decisions involving people. One potential cause for such outcomes is that the model uses a statistical proxy for a protected demographic attribute. In this paper we formulate a definition of proxy use for the setting of linear regression and present …

2018-10-16abs ↗pdf ↗

The failure of landing a job for college students could cause serious social consequences such as drunkenness and suicide. In addition to academic performance, unconscious biases can become one key obstacle for hunting jobs for graduating students. Thus, it is necessary to understand these unconscious biases so that we…

2019-12-27abs ↗pdf ↗

Study on optimal ReLU networks with weight decay for interpolation.

problem Interpolating data with radially symmetric distributions using shallow ReLU networks.
method Weight decay regularization in infinite neuron, infinite data limit; analysis of growth rates.
result Existence and growth rates of unique radially symmetric minimizers with weight decay.

Study invariant minimizers in convex functions under amenable groups.

problem Finding invariant minimizers in convex functions invariant under amenable groups.
method Analyze smallest closed invariant convex subsets and apply to invariant optimality problem.
result Clarifies relations between equivariant neural networks and statistical theorems.