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

0.8%1.6%2.4%3.2% · Jan 202619922001200920172026
48 results for Softmax Interpolation

SoftKI combines SKI and variational methods for scalable GP regression.

problem Scalable Gaussian Process regression on high-dimensional datasets.
method SoftKI approximates kernel via softmax interpolation from a smaller number of learned points.
result SoftKI is competitive with other approximated GP methods for modest data dimensions.

We replace the output layer of deep neural nets, typically the softmax function, by a novel interpolating function. And we propose end-to-end training and testing algorithms for this new architecture. Compared to classical neural nets with softmax function as output activation, the surrogate with interpolating function…

2018-02-01abs ↗pdf ↗

Interpolates between SPG and NeuRD with Capped Implicit Exploration.

problem Combining SPG and NeuRD for better performance in non-stationary environments.
method Introduces Capped Implicit Exploration (CIX) to interpolate between SPG and NeuRD.
result NeuRD-CIX performs well more consistently than NeuRD while retaining NeuRD's advantages.

Softmax attention approximates complex functions and subsumes many known universal approximators.

problem Universal approximation of continuous sequence-to-sequence functions.
method Interpolation-based analysis of attention's internal mechanism, showing its ability to approximate ReLU functions.
result Softmax attention is a universal approximator for continuous sequence-to-sequence functions.

Entropy regularization improves policy optimization in reinforcement learning.

problem Improving policy optimization in reinforcement learning.
method Entropy regularization is introduced to soften the greedy policy towards a more diverse softmax policy, leading to a continuously parameterized algorithm that interpolates between policy gradient and Q-learning.
result An intermediate algorithm can improve performance in reinforcement learning.

DSoftKI scales GP regression with full derivative observations.

problem Efficiently fitting and predicting full derivative observations in Gaussian Processes.
method Extends SoftKI by using local temperature vectors for interpolation, enabling encoding of local directional sensitivity.
result DSoftKI achieves accurate predictions and scales to larger datasets with full derivative observations.

New conformal prediction methods for long-tailed classification problems.

problem Rare classes are systematically omitted in existing conformal prediction methods.
method Introduced a new conformal score function and a new interpolation procedure.
result Smoothly trade off set size and class-conditional coverage.

Transformers can interpolate finite input sequences exactly.

problem Interpolating finite input sequences of arbitrary lengths.
method Constructing a transformer with alternating feed-forward and self-attention layers, and low-rank parameter matrices.
result Exact interpolation of datasets of finite input sequences in R^d with corresponding output sequences of smaller or equal length.

Softmax is an output activation function for modeling categorical probability distributions in many applications of deep learning. However, a recent study revealed that softmax can be a bottleneck of representational capacity of neural networks in language modeling (the softmax bottleneck). In this paper, we propose an…

2018-05-28abs ↗pdf ↗

The computational cost of training with softmax cross entropy loss grows linearly with the number of classes. For the settings where a large number of classes are involved, a common method to speed up training is to sample a subset of classes and utilize an estimate of the loss gradient based on these classes, known as…

2019-07-24abs ↗pdf ↗

Revises logistic-softmax likelihood for Bayesian meta-learning in few-shot classification.

problem Inherent uncertainty in logistic-softmax leads to suboptimal performance in meta-learning.
method Redesigns logistic-softmax likelihood with a temperature parameter for better control of prior confidence.
result Achieves well-calibrated uncertainty estimates and comparable/superior performance on benchmark datasets.

Paper introduces Balanced Meta-Softmax for better long-tailed visual recognition.

problem Long-tailed distribution mismatch between training and testing data.
method Balanced Meta-Softmax, an unbiased extension of Softmax, using a Meta Sampler.
result Balanced Meta-Softmax outperforms state-of-the-art solutions on visual recognition and instance segmentation.

Binary testing for softmax models requires many samples, similar to leverage score models.

problem Binary hypothesis testing for softmax models and leverage score models.
method Analyzing sample complexity and drawing analogies between models.
result Sample complexity is asymptotically \(O(ε^{-2})\), where \(ε\) is the distance between model parameters.

The paper investigates polynomial alternatives to softmax in transformer models.

problem The effectiveness of softmax attention in transformers is questioned.
method The authors explore polynomial activations as alternatives to softmax, focusing on their ability to regularize the attention matrix.
result Certain polynomials can serve as effective substitutes for softmax in transformer applications, achieving strong performance.

Softmax temperature influences model representation rank and performance.

problem Understanding and optimizing softmax function's impact on model representations.
method Investigated softmax function's role in deep neural networks, introduced rank deficit bias.
result Softmax temperature affects model representation rank and can improve performance.

Cross-entropy loss together with softmax is arguably one of the most common used supervision components in convolutional neural networks (CNNs). Despite its simplicity, popularity and excellent performance, the component does not explicitly encourage discriminative learning of features. In this paper, we propose a gene…

2016-12-07abs ↗pdf ↗

Recent neural network and language models rely on softmax distributions with an extremely large number of categories. Since calculating the softmax normalizing constant in this context is prohibitively expensive, there is a growing literature of efficiently computable but biased estimates of the softmax. In this paper …

2018-03-22abs ↗pdf ↗

Solves challenges in estimating parameters of softmax gating Gaussian mixture models.

problem Identifiability issues and complex interactions in Gaussian mixture of experts.
method Proposes novel Voronoi loss functions and establishes convergence rates of MLE.
result Connects convergence rate of MLE to a solvability problem of polynomial equations.

A softmax operator applied to a set of values acts somewhat like the maximization function and somewhat like an average. In sequential decision making, softmax is often used in settings where it is necessary to maximize utility but also to hedge against problems that arise from putting all of one's weight behind a sing…

2016-12-16abs ↗pdf ↗

Speaker Recognition is a challenging task with essential applications such as authentication, automation, and security. The SincNet is a new deep learning based model which has produced promising results to tackle the mentioned task. To train deep learning systems, the loss function is essential to the network performa…

2019-01-28abs ↗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.

Unified interpretation of softmax cross-entropy and negative sampling for knowledge graph embedding.

problem Lack of theoretical relationship between softmax cross-entropy and negative sampling loss functions in knowledge graph embedding.
method Used Bregman divergence to provide a unified interpretation of the two loss functions.
result Theoretical findings for fair comparison of softmax cross-entropy and negative sampling are derived.

Value function estimation is an important task in reinforcement learning, i.e., prediction. The Boltzmann softmax operator is a natural value estimator and can provide several benefits. However, it does not satisfy the non-expansion property, and its direct use may fail to converge even in value iteration. In this pape…

2019-03-14abs ↗pdf ↗

Softmax PG methods can take extremely long to converge, even with exact gradients.

problem Softmax policy gradient methods can take an impractically long time to converge in reinforcement learning.
method Softmax policy gradient methods with exact gradient computation.
result Softmax PG methods can take exponential number of iterations to converge, even with optimal initialization.

In recent years, the softmax model and its fast approximations have become the de-facto loss functions for deep neural networks when dealing with multi-class prediction. This loss has been extended to language modeling and recommendation, two fields that fall into the framework of learning from Positive and Unlabeled d…

2019-09-17abs ↗pdf ↗

WEINCE improves contrastive learning by correcting softmax biases.

problem Softmax in InfoNCE can lead to misaligned statistical assumptions in contrastive learning.
method WEINCE uses anchor-wise online batch statistics to blend softmax logits with an endpoint shortfall correction.
result WEINCE yields consistent improvements in frozen-feature evaluation across five vision benchmarks.

Density-Softmax improves uncertainty estimation and robustness without sampling, reducing model size and latency.

problem Sampling-based uncertainty estimation methods suffer from large model size and high latency.
method Combines a Lipschitz-constrained feature extractor with the softmax layer to create a sampling-free deterministic framework.
result Density-Softmax reduces over-confidence under distribution shifts and achieves competitive results in uncertainty and robustness.

ZeroS improves Transformers by adding negative weights, matching or beating softmax attention.

problem Limited performance of linear attention methods, especially in long context sequences.
method Proposes Zero-Sum Linear Attention (ZeroS) that removes the zero-order term and reweights zero-sum softmax residuals.
result ZeroS matches or exceeds standard softmax attention across various benchmarks, theoretically expanding representable functions.

New insights into the top-K sparse softmax gating function for deep learning.

problem Understanding the theoretical effects of the top-K sparse softmax gating function on density and parameter estimations.
method Using a Gaussian mixture of experts, novel loss functions, and theoretical analysis.
result The convergence rates of density and parameter estimations are parametric under certain conditions, but slow under over-specified models.

A new method speeds up SoftMax normalization for embedding learning.

problem Efficiently learning distributed representations with SoftMax normalization.
method Proposes a linear-time heuristic approximation for mSoftMax(XYT){ m SoftMax}(XY^T), optimizing cross entropy.
result Achieves higher or comparable accuracy to existing methods with lower computational time.