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

17345067 · May 202619922001200920172026
48 results for mode drop

Study on stability of 3D sessile drops, identifying degenerate kernel.

problem Linear stability of three-dimensional sessile drops with a free contact line.
method Derived constrained second variation, formulated Jacobi problem, combined geometric and Fourier analysis.
result Kernel of the constrained Jacobi operator is exactly the space of horizontal translations under pressure-volume nondegeneracy.

This paper introduces a new method to train normalizing flows using precision-recall divergences.

problem Training generative models with mode dropping and low-quality samples.
method Introduces PR-divergences and proposes a novel generative model to minimize precision-recall trade-offs.
result Normalizing flows can be trained to achieve specific precision-recall trade-offs using PR-divergences.

Despite excellent progress in recent years, mode collapse remains a major unsolved problem in generative adversarial networks (GANs).In this paper, we present spectral regularization for GANs (SR-GANs), a new and robust method for combating the mode collapse problem in GANs. Theoretical analysis shows that the optimal …

2019-08-29abs ↗pdf ↗

We propose to incorporate adversarial dropout in generative multi-adversarial networks, by omitting or dropping out, the feedback of each discriminator in the framework with some probability at the end of each batch. Our approach forces the single generator not to constrain its output to satisfy a single discriminator,…

2018-07-30abs ↗pdf ↗

MsIGN tackles high-dimensional Bayesian inference using multiscale structure.

problem High-dimensional Bayesian inference challenges due to the curse of dimensionality.
method MsIGN generates samples from coarse to fine scale, minimizing Jeffreys divergence.
result MsIGN outperforms previous approaches in posterior approximation and mode capture.

New method trains generative models without discriminators, improving stability and accuracy.

problem Training implicit generative models with adversarial discriminators leads to instability and mode-dropping.
method Invariant statistical loss function, avoiding discriminators.
result Successfully trains generative models for various complex distributions without mode-dropping.

Generative adversarial networks (GANs) are pow- erful generative models based on providing feed- back to a generative network via a discriminator network. However, the discriminator usually as- sesses individual samples. This prevents the dis- criminator from accessing global distributional statistics of generated samp…

2018-06-19abs ↗pdf ↗

VINNAS uses variational inference to avoid mode collapse in neural architecture search.

problem Mode collapse in gradient-based NAS methods, leading to suboptimal architectures.
method Differentiable variational inference with variational dropout and automatic relevance determination.
result State-of-the-art accuracy with up to twice fewer non-zero parameters.

Unified ML and adversarial learning via α-divergence.

problem Combining strengths of ML and adversarial learning for better generative models.
method Proposes an α-Bridge to unify ML and adversarial learning using α-divergence.
result Generalizations of the α-Bridge are related to recent adversarial learning regularization approaches.

While Generative Adversarial Networks (GANs) have empirically produced impressive results on learning complex real-world distributions, recent works have shown that they suffer from lack of diversity or mode collapse. The theoretical work of Arora et al. suggests a dilemma about GANs' statistical properties: powerful d…

2018-06-27abs ↗pdf ↗

AGF explains feature learning in neural networks through alternating steps.

problem Understanding what features neural networks learn and how they learn them.
method AGF is an algorithmic framework that approximates the dynamics of feature learning in two-layer networks.
result AGF provides a unified framework to understand feature learning in neural networks, matching experimental results across various architectures.

Training generative adversarial networks requires balancing of delicate adversarial dynamics. Even with careful tuning, training may diverge or end up in a bad equilibrium with dropped modes. In this work, we improve CS-GAN with natural gradient-based latent optimisation and show that it improves adversarial dynamics b…

2019-12-02abs ↗pdf ↗

Method diagnoses model performance under distribution shifts.

problem Understanding and improving model performance under distribution shifts.
method DIstribution Shift DEcomposition (DISDE) method to attribute performance drop to distribution shifts.
result Shows how model performance can be improved across different distribution shifts.

The 2006 sudden and immense downturn in U.S. House Prices sparked the 2007 global financial crisis and revived the interest about forecasting such imminent threats for economic stability. In this paper we propose a novel hybrid forecasting methodology that combines the Ensemble Empirical Mode Decomposition (EEMD) from …

2017-07-16abs ↗pdf ↗

This paper analyzes the configurations of shapes that shows a spacelike liquid drop in Minkowski space deposited over a spacelike plane ΠΠ. We assume the presence of a uniform gravity field directed toward ΠΠ and that the volume of the drop is prescribed. Our interest are the liquid drops that are critical points of …

2005-01-12abs ↗pdf ↗

We improve generative models for heavy-tailed multivariate data using an invariant statistical loss.

problem Traditional generative models struggle with heavy-tailed and multivariate data, leading to unstable training and mode dropping.
method We extend the invariant statistical loss method to handle heavy-tailed and multivariate data using a Pareto-ISL generator trained with input noise from a generalised Pareto distribution.
result Pareto-ISL accurately models the tails of heavy-tailed distributions while capturing central characteristics.

Improves DPGMM sampler by better initializing subclusters for more effective clustering.

problem Poor initialization of subclusters leads to ineffective sampling and clustering.
method Proposed heuristic and deep learning-based methods to improve subcluster initialization.
result Better splits lead to improved performance, results, and stability.

Deep neural networks have dramatically achieved great success on a variety of challenging tasks. However, most successful DNNs have an extremely complex structure, leading to extensive research on model compression.As a significant area of progress in model compression, traditional gradual pruning approaches involve an…

2018-12-05abs ↗pdf ↗

Deep neural networks (DNNs) have been proven to have many redundancies. Hence, many efforts have been made to compress DNNs. However, the existing model compression methods treat all the input samples equally while ignoring the fact that the difficulties of various input samples being correctly classified are different…

2018-07-04abs ↗pdf ↗

TinyML models detect RF and cyber threats in spacecraft with low latency.

problem Detecting cyber-RF threats in autonomous spacecraft with low latency.
method Analysis of classical models (RF, LR, SVM, MLP) for latency-accuracy trade-offs.
result Logistic Regression achieves microsecond-level inference with minimal accuracy loss.

Natural images may lie on a union of disjoint manifolds rather than one globally connected manifold, and this can cause several difficulties for the training of common Generative Adversarial Networks (GANs). In this work, we first show that single generator GANs are unable to correctly model a distribution supported on…

2018-06-03abs ↗pdf ↗

Recent work by Brock et al. (2018) suggests that Generative Adversarial Networks (GANs) benefit disproportionately from large mini-batch sizes. Unfortunately, using large batches is slow and expensive on conventional hardware. Thus, it would be nice if we could generate batches that were effectively large though actual…

2019-10-29abs ↗pdf ↗

Recent advances in generative modeling have led to an increased interest in the study of statistical divergences as means of model comparison. Commonly used evaluation methods, such as the Frechet Inception Distance (FID), correlate well with the perceived quality of samples and are sensitive to mode dropping. However,…

2018-05-31abs ↗pdf ↗

Motivated by advantages of current-mode design, this brief contribution explores the implementation of weight matrices in neuromemristive systems via current-mode memristor crossbar circuits. After deriving theoretical results for the range and distribution of weights in the current-mode design, it is shown that any we…

2017-07-17abs ↗pdf ↗

Study on how reparametrization affects neural nets' parameter spaces from a geometric perspective.

problem Inconsistencies in flatness measures, optimization, and probability densities under reparametrization.
method Riemannian geometry to study invariance of neural nets under reparametrization.
result Invariance of neural nets is an inherent property if the metric is explicitly represented and transformation rules are correct.

The Frank-Wolfe (FW) algorithm has been widely used in solving nuclear norm constrained problems, since it does not require projections. However, FW often yields high rank intermediate iterates, which can be very expensive in time and space costs for large problems. To address this issue, we propose a rank-drop method …

2017-04-13abs ↗pdf ↗

For dynamical systems that can be modelled as asymptotically stable linear systems forced by Gaussian noise, this paper develops methods to infer or estimate their modes from observations in real time. The modes can be real or complex. For a real mode, we wish to infer its damping rate and mode shape. For a complex mod…

2019-09-23abs ↗pdf ↗