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

144288431575 · Jun 202019922001200920172026
48 results for Mode Differences

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 ↗

U-Net trained to recover acoustic interference striations from distorted data.

problem Recovering acoustic interference striations from distorted signals.
method Training a U-Net using a random mode-coupling matrix model to generate training data.
result U-Net successfully recovers AISs under various conditions.

Multimodal clustering is an unsupervised technique for mining interesting patterns in nn-adic binary relations or nn-mode networks. Among different types of such generalized patterns one can find biclusters and formal concepts (maximal bicliques) for 2-mode case, triclusters and triconcepts for 3-mode case, closed $n…

2017-02-27abs ↗pdf ↗

In this paper, we present an online adaptive PCA algorithm that is able to compute the full dimensional eigenspace per new time-step of sequential data. The algorithm is based on a one-step update rule that considers all second order correlations between previous samples and the new time-step. Our algorithm has O(n) co…

2017-09-07abs ↗pdf ↗

Empirical mode modeling improves state-space analysis of noisy data.

problem Analyzing nonlinear systems with noisy data.
method Combining empirical mode decomposition with empirical dynamic modeling.
result Empirical mode modeling enhances state-space representations in noisy data.

Study identifies transitions between traffic modes on Cologne motorways.

problem Understanding transitions between different traffic modes.
method Constructed state transition network, identified dominant states using PageRank algorithm.
result Identified seasonal dependence in traffic modes.

HHT feature generation enhances financial time series forecasting.

problem Forecasting nonstationary financial time series.
method CEEMD and HHT for decomposition, machine learning integration.
result HHT-enhanced models outperform traditional models in forecasting.

An image pattern can be represented by a probability distribution whose density is concentrated on different low-dimensional subspaces in the high-dimensional image space. Such probability densities have an astronomical number of local modes corresponding to typical pattern appearances. Related groups of modes can join…

2018-03-02abs ↗pdf ↗

Proposes using mode connectivity to improve adversarial robustness of neural networks.

problem Improving adversarial robustness of deep neural networks.
method Employing mode connectivity in loss landscapes to study adversarial robustness and propose methods for improvement.
result Path connection learned using limited bonafide data can effectively mitigate adversarial effects while maintaining original accuracy.

Proves wave equation solutions in Kerr-de Sitter spacetime have specific asymptotic expansions.

problem Analyzing solutions to wave equations in Kerr-de Sitter spacetime.
method Developed a Fredholm setup for quasinormal modes and analyzed trapping of lightlike geodesics.
result Proves asymptotic expansions of wave equation solutions up to a decay order.

Study cryptocurrency price dynamics using adaptive EMD and spectral analysis.

problem Analyze the time-varying volatility of cryptocurrency prices.
method Adaptive complementary ensemble empirical mode decomposition (ACE-EMD) and Hilbert spectral analysis.
result Reveal the properties of various timescales in cryptocurrency price dynamics.

We study two procedures (reverse-mode and forward-mode) for computing the gradient of the validation error with respect to the hyperparameters of any iterative learning algorithm such as stochastic gradient descent. These procedures mirror two methods of computing gradients for recurrent neural networks and have differ…

2017-03-06abs ↗pdf ↗

The posteriors over neural network weights are high dimensional and multimodal. Each mode typically characterizes a meaningfully different representation of the data. We develop Cyclical Stochastic Gradient MCMC (SG-MCMC) to automatically explore such distributions. In particular, we propose a cyclical stepsize schedul…

2019-02-11abs ↗pdf ↗

This research improves asset life prediction by integrating deep learning with mixture distributions.

problem Predicting residual useful life for assets with multiple failure modes.
method Integrates mixture (log)-location-scale distribution with deep learning.
result Proposed models outperform existing methods in predicting residual useful life.

Modified PCA algorithm with continual learning preserves features of previous modes for multimode process monitoring.

problem Catastrophic forgetting of previous modes in monitoring models for successive modes.
method Modified PCA algorithm with elastic weight consolidation (EWC) to preserve features of previous modes.
result PCA-EWC algorithm effectively monitors multimode processes without performance decrease.

The paper explores when to prioritize easy or hard samples in learning tasks.

problem Determining the optimal order of learning easy or hard samples.
method Theoretical analyses and experiments were conducted to propose and validate four priority modes.
result Four priority modes (easy-first, hard-first, medium-first, two-ends-first) can be flexibly applied.

A two-layer classifier improves smartphone transportation mode recognition.

problem Improving accuracy of transportation mode classification.
method Two-layer hierarchical classifier combining time and frequency domain features.
result Maximum classification accuracy of 97.02%.

We propose MAD-GAN, an intuitive generalization to the Generative Adversarial Networks (GANs) and its conditional variants to address the well known problem of mode collapse. First, MAD-GAN is a multi-agent GAN architecture incorporating multiple generators and one discriminator. Second, to enforce that different gener…

2017-04-10abs ↗pdf ↗

New methods improve tool-to-tool matching in semiconductor manufacturing.

problem Challenges in obtaining static configuration data and extending methods to heterogeneous equipment.
method Novel TTTM analysis pipelines hypothesizing higher variance and modes for mismatched equipment.
result Best univariate method achieves correlation coefficients >0.95 and >0.5 with variance and modes, respectively.

Paper tackles offline RL from mixed datasets with adaptive KL regularizer.

problem Challenges in optimizing RL and BC signals with varying action coverage and multiple action modes.
method Adaptively weighted reverse KL divergence regularizer based on TD3 algorithm.
result Empirically outperforms existing offline RL algorithms in MuJoCo locomotion tasks.

The Dynamic Mode Decomposition (DMD) extracted dynamic modes are the non-orthogonal eigenvectors of the matrix that best approximates the one-step temporal evolution of the multivariate samples. In the context of dynamical system analysis, the extracted dynamic modes are a generalization of global stability modes. We a…

2019-03-04abs ↗pdf ↗

Learning an optimal policy from a multi-modal reward function is a challenging problem in reinforcement learning (RL). Hierarchical RL (HRL) tackles this problem by learning a hierarchical policy, where multiple option policies are in charge of different strategies corresponding to modes of a reward function and a gati…

2017-11-28abs ↗pdf ↗

Standard adversarial training involves two agents, namely a generator and a discriminator, playing a mini-max game. However, even if the players converge to an equilibrium, the generator may only recover a part of the target data distribution, in a situation commonly referred to as mode collapse. In this work, we prese…

2019-02-21abs ↗pdf ↗

Unsupervised domain transfer is the task of transferring or translating samples from a source distribution to a different target distribution. Current solutions unsupervised domain transfer often operate on data on which the modes of the distribution are well-matched, for instance have the same frequencies of classes b…

2019-05-29abs ↗pdf ↗

Generative Adversarial Networks have surprising ability for generating sharp and realistic images, though they are known to suffer from the so-called mode collapse problem. In this paper, we propose a new GAN variant called Mixture Density GAN that while being capable of generating high-quality images, overcomes this p…

2018-10-31abs ↗pdf ↗

This work proposes a new feature for transportation mode classification using GPS trajectories.

problem Classifying transportation modes from GPS trajectories to optimize urban mobility.
method The Ordinal Pattern Transition Graph and its self-transition probability are used for classification.
result The proposed feature outperforms existing methods in transportation mode classification.

Framework analyzes neural network dynamics for better understanding and optimization.

problem Understanding the fundamental mechanisms of deep neural networks.
method Dynamical systems theory, transformation units, attraction basins.
result Different transformation modes lead to distinct learning phases and network performance.

We consider the problem of adaptively PAC-learning a probability distribution P\mathcal{P}'s mode by querying an oracle for information about a sequence of i.i.d. samples X1,X2,X_1, X_2, \ldots generated from P\mathcal{P}. We consider two different query models: (a) each query is an index ii for which the oracle reveals…

2019-11-19abs ↗pdf ↗

The problem of optimal switching between nonlinear autonomous subsystems is investigated in this study where the objective is not only bringing the states to close to the desired point, but also adjusting the switching pattern, in the sense of penalizing switching occurrences and assigning different preferences to util…

2014-11-17abs ↗pdf ↗

New method decomposes KL error using refined information and mode interactions.

problem Learning probability distributions over discrete variables with higher-order interactions.
method Using information geometry, refined mode interactions, and a novel Monte-Carlo sampling technique.
result Complete decomposition of KL error and efficient data use.

Improved KSD test for better detection of differences in distributions.

problem Low power of KSD test when distributions have same modes but different mixing proportions.
method Perturb the observed sample using Markov transition kernels to improve KSD test power.
result Perturbed KSD test can lead to substantially higher power than the original KSD test.

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 ↗