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

51102152203 · Jun 202019922001200920172026
48 results for Activation Divergence

This paper improves active learning by using robust divergences for committee disagreement.

problem Active learning with high measurement costs.
method Query by committee with Bregman divergence (including Kullback-Leibler divergence as a special case).
result The proposed method is more robust and performs as well as or better than conventional methods.

FedMAX tackles activation divergence in FL, improving accuracy and efficiency.

problem Activation divergence in Federated Learning due to non-IID data.
method Introduced a prior based on maximum entropy to minimize information about per-device activation vectors and make similar classes more alike.
result Significantly more similar activation vectors across multiple devices, leading to better accuracy and efficiency.

We propose a Laplace approximation that creates a stochastic unit from any smooth monotonic activation function, using only Gaussian noise. This paper investigates the application of this stochastic approximation in training a family of Restricted Boltzmann Machines (RBM) that are closely linked to Bregman divergences.…

2016-01-01abs ↗pdf ↗

Proposes an active RBI framework using Rényi information measures for more informed decision-making.

problem Optimal latent variable estimates in real-time settings with streaming noisy observations.
method Unified inference and query selection steps through Rényi entropy and α-divergence; new objective called Momentum for exploration.
result Analytically demonstrates superior performance compared to conventional methods like mutual information.

New method learns SIMs with arbitrary monotone activations without strong distributional assumptions.

problem Learning Single-Index Models with arbitrary monotone activations.
method Based on omniprediction with calibrated multiaccuracy and Bregman divergences.
result First agnostic learning result for SIMs with arbitrary monotone activations.

Recent years have seen adversarial losses been applied to many fields. Their applications extend beyond the originally proposed generative modeling to conditional generative and discriminative settings. While prior work has proposed various output activation functions and regularization approaches, some open questions …

2019-01-25abs ↗pdf ↗

Study on critical points in random neural networks, revealing three regimes based on activation function.

problem Investigating the expected number of critical points in random neural networks.
method Deriving asymptotic formulas for critical points under infinite-width limit and suitable regularity conditions.
result Three distinct regimes of critical points behavior depending on activation function.

The paper introduces a new divergence for portfolio management to outperform a benchmark.

problem Maximizing expected utility of outperformance over a benchmark with constraints.
method Uses αα-Bregman-Wasserstein divergence to penalize underperformance more than overperformance.
result Proves existence and uniqueness of optimal portfolio strategy and conditions for constraints binding.

Study shows how activation functions impact the storage capacity of treelike neural networks.

problem Understanding the role of activation functions in neural network expressive power.
method Analysis of treelike two-layer networks with various activation functions in the infinite-width limit.
result Activation functions affect storage capacity and robustness, with nonlinearity increasing capacity and decreasing robustness.

Model financial markets using information theory with a single parameter.

problem Capture the complexity of financial markets with a simple model.
method Derive an idealized model based on four information-theoretic assumptions, minimizing surprisal and divergence.
result The model uses squared radial Ornstein-Uhlenbeck processes for state variables and their sums.

Gradient flows of neural networks converge to optimal values or diverge, with thresholds and asymptotic behaviors.

problem Understanding the convergence and divergence of gradient flows in neural networks.
method Analysis of gradient flows on loss landscapes of neural networks using o-minimal structures.
result Gradient flows either converge to optimal values or diverge to infinity, with thresholds and asymptotic behaviors.

Robustness to outliers is a central issue in real-world machine learning applications. While replacing a model to a heavy-tailed one (e.g., from Gaussian to Student-t) is a standard approach for robustification, it can only be applied to simple models. In this paper, based on Zellner's optimization and variational form…

2017-10-18abs ↗pdf ↗

Gradient descent dynamics in quadratic regression models are analyzed, revealing five phases: monotonic, catapult, periodic, chaotic, and divergent.

problem Analyzing the dynamics of gradient descent in quadratic regression models.
method Fine-grained bifurcation analysis of gradient descent dynamics using a cubic map parameterized by the step-size.
result Gradient descent dynamics in quadratic regression models exhibit five distinct phases: monotonic, catapult, periodic, chaotic, and divergent.

Recent research has shown that although Reinforcement Learning (RL) can benefit from expert demonstration, it usually takes considerable efforts to obtain enough demonstration. The efforts prevent training decent RL agents with expert demonstration in practice. In this work, we propose Active Reinforcement Learning wit…

2018-12-06abs ↗pdf ↗

Nowozin \textit{et al} showed last year how to extend the GAN \textit{principle} to all ff-divergences. The approach is elegant but falls short of a full description of the supervised game, and says little about the key player, the generator: for example, what does the generator actually converge to if solving the GAN…

2017-07-14abs ↗pdf ↗

We describe Information Forests, an approach to classification that generalizes Random Forests by replacing the splitting criterion of non-leaf nodes from a discriminative one -- based on the entropy of the label distribution -- to a generative one -- based on maximizing the information divergence between the class-con…

2012-02-07abs ↗pdf ↗

Active inference selects actions to maximize information gain, aiding structure learning.

problem Learning the structure of underlying world models.
method Active inference selects actions based on expected free energy, which includes information gain and value.
result Actions that maximize information gain help disambiguate among alternative models.

Crowdsourcing and active learning reduce manual annotation in social media event classification.

problem Manual annotation is time-consuming and resource-intensive in social media event classification.
method Crowdsourcing pipeline combined with active learning strategies.
result Active learning strategies help reduce the number of tweets needed for classification.

Batch normalization (BN) is a technique to normalize activations in intermediate layers of deep neural networks. Its tendency to improve accuracy and speed up training have established BN as a favorite technique in deep learning. Yet, despite its enormous success, there remains little consensus on the exact reason and …

2018-06-01abs ↗pdf ↗

Sparse Transformers degrade semantic information first, with early layers encoding more.

problem Understanding how sparse Transformers affect learned representations and semantic information.
method Probed Transformers with progressively pruned weights to observe changes in semantic information and model behavior.
result Complex semantic information is first to degrade in sparse Transformers, with early layers encoding more.

New robust learning framework for regression NNs using β-divergences.

problem Outliers and data contamination in regression NNs training.
method Proposes rRNet based on β-divergence for robust learning of regression NNs.
result rRNet achieves optimal 50% asymptotic breakdown point for all β ∈ (0, 1].

Early stopping in meta-learning improved by analyzing neural activation patterns.

problem Early stopping in few-shot learning is challenging due to distributional shifts between meta-validation and meta-test sets.
method Activation-Based Early-stopping (ABE) analyzes hidden layer activations from unlabelled support examples to detect when target generalization diverges from source data.
result Simple activation statistics can effectively estimate target generalization, improving few-shot transfer learning across various algorithms and datasets.

Active learning selects high-quality examples for text-to-SQL systems.

problem Efficiently annotate large language models for text-to-SQL systems.
method Formalizes example selection as a constrained experimental design problem over semantic query embeddings, proposing a stratified greedy algorithm that maximizes heteroscedastic mutual information.
result Proposed method significantly reduces labeling effort while maintaining high text-to-SQL retrieval accuracy.

Although stochastic approximation learning methods have been widely used in the machine learning literature for over 50 years, formal theoretical analyses of specific machine learning algorithms are less common because stochastic approximation theorems typically possess assumptions which are difficult to communicate an…

2014-12-18abs ↗pdf ↗

Bounds on chemical reaction network relaxation rates using convex analysis.

problem Understanding relaxation dynamics in chemical reaction networks.
method Convex analysis, generalized gradient flows, singular values of stoichiometric matrix.
result Bounds on Kullback-Leibler divergence to equilibrium for CRNs.

EXoN creates an explainable latent space for semi-supervised learning.

problem Creating an explainable latent space for semi-supervised learning.
method EXoN combines VAE with SCI (Soft-label Consistency Interpolation) to create an explainable latent space.
result EXoN reduces the cost of investigating representation patterns on the latent space.

SPEQ improves quantized neural networks by stochastic precision sharing and cosine similarity loss.

problem Improving quantized deep neural networks for edge devices.
method SPEQ combines stochastic precision sharing and cosine similarity loss for knowledge distillation.
result SPEQ outperforms existing methods in various tasks.

A new method for distributed PCA using matrix β-mean.

problem Efficiently aggregating PCA results across multiple machines with reduced computational overhead.
method Proposes a novel DPCA method that incorporates eigenvalue information using the matrix β-mean.
result The matrix β-mean method improves robustness and stability of eigenvector ordering.

Study predicts price predictability in ultra-high frequency financial data using entropy tests.

problem Tackles predictability of ultra-high frequency financial data.
method Develops statistical tests based on Shannon entropy and Kullback-Leibler divergence to analyze predictability.
result Degree of randomness increases with aggregation level in transaction time.

Factor analysis has proven to be a relevant tool for extracting tissue time-activity curves (TACs) in dynamic PET images, since it allows for an unsupervised analysis of the data. Reliable and interpretable results are possible only if considered with respect to suitable noise statistics. However, the noise in reconstr…

2018-07-30abs ↗pdf ↗

The paper connects neural network ensembles to Bayesian inference using variational methods.

problem Explaining the behavior of ensemble methods in neural networks.
method Deriving conditions for ensemble optimization to reduce divergence to the posterior distribution.
result Ensemble methods can be a valid alternative to approximate Bayesian inference.

Study of deep linear neural networks with proportional width and depth.

problem Lack of descriptive power in Gaussian limit of deep linear neural networks.
method Proportional infinite-width infinite-depth limit for deep linear neural networks.
result Characterization of limiting distribution as a nontrivial mixture of Gaussians.

Public debates are a common platform for presenting and juxtaposing diverging views on important issues. In this work we propose a methodology for tracking how ideas flow between participants throughout a debate. We use this approach in a case study of Oxford-style debates---a competitive format where the winner is det…

2016-04-11abs ↗pdf ↗

The study reveals distinct patterns in retail investors' holding periods affecting stock returns.

problem Understanding the impact of retail investors' investment horizons on stock returns.
method Using self-reported holding periods from StockTwits, the study categorizes retail investors into long-horizon and short-horizon groups and analyzes their return patterns.
result Long-horizon retail investors exhibit underreaction to earnings announcements, while short-horizon investors show overreaction.

We develop a variant of multiclass logistic regression that is significantly more robust to noise. The algorithm has one weight vector per class and the surrogate loss is a function of the linear activations (one per class). The surrogate loss of an example with linear activation vector a\mathbf{a} and class cc has t…

2017-05-19abs ↗pdf ↗

Active learning (AL) on attributed graphs has received increasing attention with the prevalence of graph-structured data. Although AL has been widely studied for alleviating label sparsity issues with the conventional non-related data, how to make it effective over attributed graphs remains an open research question. E…

2019-08-22abs ↗pdf ↗

Divergence functions play a key role as to measure the discrepancy between two points in the field of machine learning, statistics and signal processing. Well-known divergences are the Bregman divergences, the Jensen divergences and the f-divergences. In this paper, we show that the symmetric Bregman divergence can be …

2018-10-03abs ↗pdf ↗

Detects change points in time series focusing on specific components.

problem Identifying moments when specific components of multivariate time series change distributions.
method Two-stage non-parametric algorithm: causal structure learning followed by change point detection.
result Validated the approach on synthetic and real-world datasets.