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

23477093 · Jun 202019922001200920172026
48 results for Product Hunt

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.

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 ↗

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 ↗

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.

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 ↗

We consider the action of symplectic monodromy on chain-level enhancements of quantum cohomology. First, we construct a family version of AA_\infty-structure on quantum cohomology (this should morally correspond to Hochschild cohomology of a "family of Fukaya categories over the circle"). Following Kaledin, we look at…

2017-11-30abs ↗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 ↗

KFAtt improves CTR prediction by modeling user behavior with Kalman filtering attention.

problem Improving CTR prediction in personalized e-commerce search engines.
method KFAtt combines Kalman filtering with attention mechanisms to model user behavior.
result KFAtt outperforms existing methods in CTR prediction, achieving better performance in both offline and online settings.

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 ↗

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 ↗

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.

Machine learning predicts S&P 500 additions and removals with high accuracy.

problem Forecasting S&P 500 membership changes to inform investment decisions.
method Used Random Forest model on quarterly data from 2013 onwards, incorporating various features.
result Achieved a test F1 score of 0.85, outperforming other models.

A new method simulates large, diverse populations of learning agents evolving in games.

problem Limited scalability and efficiency of Multi-Agent Reinforcement Learning.
method Parallelizable implementation of Policy Gradient and Opponent-Learning Awareness for evolutionary simulations.
result Simulated large, diverse populations of learning agents evolve under various strategies.

Fictitious play with reinforcement learning is a general and effective framework for zero-sum games. However, using the current deep neural network models, the implementation of fictitious play faces crucial challenges. Neural network model training employs gradient descent approaches to update all connection weights, …

2019-11-27abs ↗pdf ↗

Statistical learning is the process of estimating an unknown probabilistic input-output relationship of a system using a limited number of observations. A statistical learning machine (SLM) is the algorithm, function, model, or rule, that learns such a process; and machine learning (ML) is the conventional name of this…

2019-06-24abs ↗pdf ↗

This study explores how choosing noninformative priors affects Thompson Sampling in multiparameter bandit models.

problem The optimality of Thompson Sampling (TS) in multiparameter bandit models depends on the choice of priors, especially when models are complex.
method The study extends regret analysis to uniform distributions and proposes a modified TS policy, TS-T, to achieve asymptotic optimality.
result Changing noninformative priors can significantly affect the expected regret in multiparameter bandit models.

The paper studies a new type of submanifolds in product spaces.

problem Characterizing and understanding warped product pointwise bi-slant submanifolds.
method Introduced and studied warped product pointwise bi-slant submanifolds of locally product Riemannian manifolds.
result Characterization results and non-trivial examples of these submanifolds.

The paper extends affine connection results to singular warped and twisted products.

problem Generalizing affine connections to singular warped and twisted products.
method Study of singular multiply warped products and singular twisted products with semi-symmetric metric and non-metric connections, discussing Koszul forms and curvature.
result Theoretical results on curvature and Koszul forms for singular multiply warped and twisted products.

Productivity and credit limits affect aggregate production in non-monotonic ways.

problem Understanding how aggregate production is influenced by individual characteristics and financial constraints.
method Analytical proof of non-monotonic effects of productivity and credit limits on aggregate production in a general equilibrium model.
result Equilibrium aggregate production can be non-monotonic in both individual productivity and credit limit.

We refine the intersection product in homology to an equivariant setting, which unifies several known constructions. As an application, we give a common generalisation of the Chas-Sullivan string product on a manifold and the Chataur-Menichi string product on the classifying space by defining a string product on the Bo…

2015-06-01abs ↗pdf ↗

The paper examines Einstein doubly warped product manifolds with a semi-symmetric metric connection.

problem Characterizing Einstein doubly warped product manifolds with a semi-symmetric metric connection.
method Deriving curvature formulas and proving necessary and sufficient conditions for a manifold to be a warped product.
result Obtained results for Einstein doubly warped product manifolds and Einstein-like doubly warped product manifolds.

In this article we obtain classification results on the quasi-product production functions in terms of the geometry of their associated graph hypersurfaces, generalizing in a new setting some recent results concerning basic production models. In particular, we obtain several results on the geometry of Spillman-Mitscher…

2015-12-16abs ↗pdf ↗

The paper explores geometric properties of Riemannian warped product maps and their curvature.

problem Investigating the geometric properties of Riemannian warped product maps.
method The approach involves establishing conditions for geodesics, deriving curvature tensors, and examining various types of maps.
result Derivation of integral formula for scalar curvature of conformal Riemannian warped product maps.