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.

169,181 papers · 148 categories

Trend · papers per month

136272408544 · Jun 202019922001200920182026
48 results for classification outputs

Prototype networks on hyperspheres improve classification and regression.

problem Improving classification and regression performance.
method Using hyperspherical prototypes for classification and regression, optimizing prototypes through data-independent margin separation.
result Hyperspherical prototype networks outperform other methods in classification, regression, and their combination.

EPFGNN models graph connections for better node classification.

problem Graph node classification issues due to feature aggregation.
method EPFGNN models graph as a Markov Random Field with explicit pairwise factors and a GNN backbone.
result EPFGNN improves semi-supervised node classification performance.

Gradient boosting adapted for multi-label and multi-output tasks.

problem Joint prediction of multiple classification or regression outputs.
method Gradient tree boosting with random output projections.
result Random projection improves adaptation to different output correlation patterns.

Study shows MSE with sigmoid can match SCE in classification tasks, especially with noisy data.

problem Inconsistent errors in neural network classification tasks.
method Introduced Output Reset algorithm to use MSE with sigmoid activation.
result MSE with sigmoid activation achieves comparable accuracy and convergence rates to Softmax Cross-Entropy, especially in noisy data scenarios.

Efficiently approximates uncertainty in classification models using Dirichlet distributions.

problem Inefficient computation of uncertainty estimates in Bayesian deep learning.
method Revised Laplace Bridge method to construct a Dirichlet approximation of softmax output distributions.
result The Dirichlet approximation leads to more efficient computation and better uncertainty estimates.

Extreme classification problems are multiclass and multilabel classification problems where the number of outputs is so large that straightforward strategies are neither statistically nor computationally viable. One strategy for dealing with the computational burden is via a tree decomposition of the output space. Whil…

2015-11-10abs ↗pdf ↗

The paper proves neural networks with ReLU and softmax can approximate any function.

problem Approximating functions and class labels in neural networks.
method Extended universal approximator theory to neural networks with ReLU and softmax.
result Neural networks with ReLU and softmax can approximate any function and class labels.

This paper analyzes output activation functions for adversarial losses.

problem Understanding which output activation functions form a well-behaved adversarial loss.
method Variational divergence minimization and a comparative framework for adversarial losses.
result There is no single winning combination of output activation functions and regularization approaches across all settings.

A new method uses RBMs to handle incomplete multi-output data.

problem Handling incomplete multi-output data with dependencies between features and labels.
method Adapted RBM algorithm based on mean-field equations for joint imputation and classification.
result Efficiently solves problems with missing features and labels.

A CAE improves DNN's outlier and adversary defense.

problem Improving DNN's robustness against outliers and adversaries.
method Proposes a classification-autoencoder (CAE) that compresses samples into disjoint spaces and uses a decoder to classify and defend against adversaries.
result The CAE achieves state-of-the-art outlier recognition and near-lossless classification of adversaries.

Optimistic bounds for multi-output learning using self-bounding Lipschitz condition.

problem Learning vector-valued functions from supervised data.
method Introducing self-bounding Lipschitz condition and proving optimistic bounds using local Rademacher complexity and Srebro's inequality.
result Minimax optimal generalization bounds for multi-output learning, up to logarithmic factors.

The paper analyzes deep neural networks using information theory to improve classification accuracy.

problem Improving classification accuracy in deep neural networks.
method Modeling the output of convolutional filters as a random variable conditioned on class and network structure, computing conditional entropy as a compact code.
result The conditional entropy feature analysis leads to higher classification accuracy than the original CNN.

Enhances fairness in multi-output models using optimal transport.

problem Improving fairness in multi-output models like multi-task/multi-class classification and representation learning.
method Post-processing method using optimal transport mappings to move model outputs towards empirical Wasserstein barycenter.
result Demonstrates effectiveness of the proposed approach on multi-task/multi-class classification and representation learning tasks.

LLMs produce volatile sentence-level sentiment classifications that affect financial decision-making.

problem Volatile outputs from LLMs impact financial text understanding tasks.
method Case study on US equity market investing via news sentiment analysis.
result Volatile LLM outputs lead to significant variations in portfolio construction and returns.

New bounds enable training of probabilistic models for deep networks.

problem Training scalable latent variable models for deep networks.
method Introducing new variational bounds for specific output layers of neural networks.
result Analytical bounds for certain output layers allow training without re-parameterization or Monte Carlo approximations.

Aggregates diverse zero-shot LLM outputs for better corporate disclosure classification.

problem Combining varied zero-shot LLM predictions for improved stock return prediction.
method Multi-prompt framework with three fixed zero-shot LLM classifiers, logistic meta-classifier aggregation.
result Aggregated model outperforms single classifiers and baseline models, increasing balanced accuracy from 0.566 to 0.606.

Paper proposes a SIMO DNN for indoor localization using Wi-Fi fingerprints.

problem Indoor localization with high accuracy and efficiency.
method Single-input and multi-output deep neural network architecture.
result SIMO-DNN scheme outperforms existing methods in floor detection and location accuracy.

The study shows removing fully connected output layers improves efficiency without sacrificing performance.

problem Large number of parameters in fully connected layers for high-category datasets.
method Examined architectures replacing fully connected output layers with fixed layers and compared performance.
result Fixed classifiers offer no additional benefit over removing the output layer and its parameters.

Optimal transport improves multivariate prediction uncertainty quantification.

problem Uncertainty quantification in multivariate learning tasks, especially in regression and classification.
method Introducing a novel Conformal Prediction procedure using optimal transport to handle multivariate score functions and construct flexible prediction regions.
result Ensures finite-sample, distribution-free coverage guarantees for multivariate prediction sets.

Paper introduces conformal prediction for reliable uncertainty quantification in landmark localization.

problem Systematic underestimation of total predictive uncertainty in landmark localization.
method Conformal prediction framework for multi-output regression, generating flexible prediction regions.
result Methods outperform existing approaches in validity and efficiency across 2D and 3D datasets.

Reduced-rank method improves least-squares regression under output regularity.

problem Least-squares regression with infinite dimensional outputs.
method Reduced-rank method for solving least-squares problems with output regularity assumptions.
result Learning bounds and improved statistical performance compared to full-rank method.

Proposes a new method to approximate Gaussian inference in classification tasks.

problem Uncertainty quantification in classification tasks using softmax functions.
method Develops a new formalism to approximate Gaussian distributions over logit space and proposes using element-wise normCDF or sigmoid instead of softmax.
result Improves uncertainty quantification compared to softmax Monte Carlo sampling.

A method for learning discontinuous functions using clustering, classification, and regression.

problem Supervised learning with highly nonlinear and discontinuous outputs.
method Three stages: clustering, classification, and separate regression for each class.
result Combining clustering, classification, and regression provides a robust and powerful approach.

Factorization machines and polynomial networks are supervised polynomial models based on an efficient low-rank decomposition. We extend these models to the multi-output setting, i.e., for learning vector-valued functions, with application to multi-class or multi-task problems. We cast this as the problem of learning a …

2017-05-22abs ↗pdf ↗

A tensor-based method improves classification accuracy on spatiotemporal data in echo state networks.

problem Loss of spatial and temporal correlations when using standard linear algebra techniques on multidimensional hidden layer states.
method Orthogonal Tucker decompositions of tensors to preserve and exploit the multidimensional nature of hidden layer states.
result The tensor-based approach outperforms the standard linear output weight approach in classification accuracy.

The paper analyzes and corrects disparate impact in machine learning models using information theory.

problem Systematic discrimination in machine learning models based on sensitive attributes.
method Information-theoretic framework to quantify and correct disparate impact.
result Closed-form expressions for efficient correction of input distributions to achieve statistically indistinguishable output distributions.