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

Trend · papers per month

25.0%50.0%75.0%100.0% · Feb 199419922001200920172026
48 results for feature histograms

EHBOS enhances HBOS by capturing feature interactions, improving anomaly detection.

problem Limited ability of HBOS to detect anomalies in datasets with feature interactions.
method Incorporates two-dimensional histograms to capture feature pair dependencies.
result EHBOS outperforms HBOS on datasets with critical feature interactions, achieving notable improvements in ROC AUC.

A novel text-independent speaker identification (SI) method is proposed. This method uses the Mel-frequency Cepstral coefficients (MFCCs) and the dynamic information among adjacent frames as feature sets to capture speaker's characteristics. In order to utilize dynamic information, we design super-MFCCs features by cas…

2018-08-02abs ↗pdf ↗

In this paper, we present a novel massively parallel algorithm for accelerating the decision tree building procedure on GPUs (Graphics Processing Units), which is a crucial step in Gradient Boosted Decision Tree (GBDT) and random forests training. Previous GPU based tree building algorithms are based on parallel multi-…

2017-06-26abs ↗pdf ↗

A JAX toolbox solves optimal transport problems for point clouds and histograms.

problem Optimal transport problems between point clouds and histograms.
method Automatic and custom reverse mode differentiation, vectorization, just-in-time compilation, and accelerators support.
result Solves a wide range of optimal transport problems including regularized OT, barycenters, Gromov-Wasserstein, and low-rank solvers.

Databases in domains such as healthcare are routinely released to the public in aggregated form. Unfortunately, naive modeling with aggregated data may significantly diminish the accuracy of inferences at the individual level. This paper addresses the scenario where features are provided at the individual level, but th…

2016-05-14abs ↗pdf ↗

The paper uses geometric methods to classify medical data histograms.

problem Classifying medical data histograms for disease diagnosis.
method Information geometry of beta distributions for comparing and classifying histograms.
result Geometric tools, particularly negatively curved Fisher information, enable unique mean calculation and K-means classification.

Transportation distances have been used for more than a decade now in machine learning to compare histograms of features. They have one parameter: the ground metric, which can be any metric between the features themselves. As is the case for all parameterized distances, transportation distances can only prove useful in…

2011-10-11abs ↗pdf ↗

Due to the success of the bag-of-word modeling paradigm, clustering histograms has become an important ingredient of modern information processing. Clustering histograms can be performed using the celebrated kk-means centroid-based algorithm. From the viewpoint of applications, it is usually required to deal with symm…

2013-03-29abs ↗pdf ↗

Histogram binning method proven with guarantees without splitting data.

problem Proving theoretical guarantees for histogram binning without sample splitting.
method Using Markov property of order statistics to prove calibration guarantees for original method.
result Proves histogram binning has strong calibration guarantees without sample splitting.

This paper examines the Histogram Loss for regression, revealing its effectiveness without needing complex tuning.

problem Improving regression models by learning the entire distribution.
method Investigates Histogram Loss, a method that minimizes cross-entropy between a target distribution and a histogram prediction.
result The performance gain in regression models using Histogram Loss comes from optimization improvements, not extra modeling.

Improved bounds on neural network regions using activation histograms.

problem Bounding the number of affine regions in ReLU networks.
method Analysis of algebraic topology problem, extension of framework to subnetwork composition.
result Slightly tighter bounds and insights into parameter initialization.

Bayesian histograms achieve optimal distribution estimation with minimal memory usage.

problem Efficiently estimating distributions with minimal memory footprint.
method Bayesian histograms for distribution estimation under Wasserstein distance.
result Bayesian histograms require fewer bins to achieve minimax optimality, reducing memory usage by a polynomial factor.

Introduces CHL, a new loss function for continuous similarity learning.

problem Binary similarity learning limitations.
method CHL is a novel loss function that generalizes histogram loss to continuous similarities.
result CHL solves a wider range of tasks including similarity learning, representation learning, and data visualization.

In order to study the application of artificial intelligence (AI) to dental imaging, we applied AI technology to classify a set of panoramic radiographs using (a) a convolutional neural network (CNN) which is a form of an artificial neural network (ANN), (b) representative image cognition algorithms that implement scal…

2016-11-30abs ↗pdf ↗

Efficient logistic regression for aggregated data reduces computation time.

problem Inference for logistic regression models is computationally expensive for large datasets.
method Adapted symbolic data analysis to summarise predictor variables into histograms and use composite likelihoods.
result The method achieves comparable classification rates to full data analysis but at lower computational cost.

The paper improves prediction intervals for non-parametric regression using histograms.

problem Computing accurate prediction intervals for non-parametric regression models.
method Uses conditional histograms to estimate conditional distributions and compute shortest prediction intervals.
result The method provides prediction intervals with provable marginal coverage and asymptotic conditional coverage.

Paper finds how many neurons are needed to approximate histogram distributions.

problem How many neurons are needed to approximate a target probability distribution?
method Examined for uniform input distribution and histogram target distributions, using efficient neural net construction.
result Obtained a new upper bound on the number of required neurons, strictly better than previous bounds.

Paper introduces a new histogram estimator for nonparametric density estimation that improves performance.

problem Smoothness-based nonparametric density estimators are not optimal for all types of data.
method Incorporates a multi-view latent variable model into histogram-style estimators.
result A new histogram estimator converges faster to multi-view models in L1L^1 error.

Covariance and histogram image descriptors provide an effective way to capture information about images. Both excel when used in combination with special purpose distance metrics. For covariance descriptors these metrics measure the distance along the non-Euclidean Riemannian manifold of symmetric positive definite mat…

2014-12-04abs ↗pdf ↗

Histogram transform ensembles improve density estimation accuracy.

problem Improving density estimation accuracy for various distributions.
method Histogram transform ensembles (HTE) with theoretical analysis and experimental validation.
result HTE outperforms single histogram transforms and offers almost optimal convergence rates in Hölder space C0,αC^{0,α}.

A new algorithm HTE for large-scale regression improves accuracy compared to single estimators.

problem Improving accuracy in large-scale regression problems.
method Histogram transform ensembles (HTE) with random transformations and kernel histogram transforms (KHT).
result Ensemble HTE outperforms single estimators in accuracy for various Hölder spaces.

We analyze the constituents stocks of the Dow Jones Industrial Average (DJIA30) and the Standard & Poor's 100 index (S&P100) of the NYSE stock exchange market. Surprisingly, we discover the data collapse of the histograms of the DJIA30 price fluctuations and of the S&P100 price fluctuations to the universal non-paramet…

2008-10-14abs ↗pdf ↗

This work optimizes statistical inference with neural networks for high-energy physics data.

problem Optimal dimensionality reduction with minimal loss of information in the presence of systematic uncertainties.
method Neural network optimization based on binned Poisson likelihoods with nuisance parameters.
result Estimates of parameters of interest close to optimal.

Detecting PE malware files is now commonly approached using statistical and machine learning models. While these models commonly use features extracted from the structure of PE files, we propose that icons from these files can also help better predict malware. We propose an innovative machine learning approach to extra…

2017-12-10abs ↗pdf ↗

The paper improves density estimation in high dimensions using tensor decompositions.

problem Density estimation struggles in high-dimensional data due to the curse of dimensionality.
method The paper uses nonnegative tensor decompositions to simplify dependence assumptions and estimate marginal distributions.
result Theoretical results show that restricting estimation to low-rank nonnegative PARAFAC or Tucker decompositions removes the dimensionality exponent on bin width rates.

A very simple heuristic approach to the unfolding problem will be described. An iterative algorithm starts with an empty histogram and every iteration aims to add one entry to this histogram. The entry to be added is selected according to a criteria which includes a χ2χ^2 test and a regularization. After a relatively s…

2014-10-17abs ↗pdf ↗

A faster Wasserstein k-means algorithm for histogram data reduces computation and maintains clustering quality.

problem Efficiently clustering histogram data with reduced computation time.
method Sparse simplex projection to reduce data samples, centroids, and ground cost matrix, dynamically removing lower-valued samples.
result Significant reduction in computational complexity without compromising clustering quality.

Recent research has repeatedly shown that machine learning techniques can be applied to either whole files or file fragments to classify them for analysis. We build upon these techniques to show that for samples of un-labeled compiled computer object code, one can apply the same type of analysis to classify important a…

2018-05-06abs ↗pdf ↗

A new probabilistic framework for optimal transport using collective graphical models.

problem Measuring similarity between probability distributions and histograms.
method Probabilistic Optimal Transport based on Collective Graphical Models.
result OT with entropic regularization is equivalent to maximizing a posterior probability of a CGM.

Recently, product images have gained increasing attention in clothing recommendation since the visual appearance of clothing products has a significant impact on consumers' decision. Most existing methods rely on conventional features to represent an image, such as the visual features extracted by convolutional neural …

2018-09-16abs ↗pdf ↗