The paper introduces reservoir computing models for complex systems.
problem Modeling complex engineering systems using nonlinear autoregression.
method Introduces reservoir computing with output feedback as stationary and ergodic infinite-order nonlinear autoregressive models.
result Demonstrates versatility of classical and quantum reservoir computers in modeling synthetic and real data.
AdaKoop efficiently models nonlinear dynamics from nonstationary data streams.
problem Capturing nonlinear dynamics in nonstationary data streams with computational efficiency.
method Koopman operator theory and probabilistic framework for streaming data.
result AdaKoop outperforms state-of-the-art methods in real-time forecasting accuracy and efficiency.
Optical ESNs enable flexible, efficient machine learning with reduced energy.
problem Implementing universal computational capabilities in machine learning.
method Optical implementation of ESNs leveraging stimulated Brillouin scattering.
result Efficient, scalable, and memory-capable optical reservoir computing.
New method improves nonlinear filtering accuracy with reduced computation.
problem Complex nonlinear filtering with small system noise.
method Asymptotic expansion with ordinary differential equations and Edgeworth-type correction.
result Significantly lower computational cost with improved accuracy.
Proposes random Euler filters for efficient complex-valued nonlinear signal processing.
problem Efficiently processing complex-valued nonlinear signals with reduced computational cost.
method Introduces linear and widely-linear random Euler complex-valued filters with fixed network structures.
result Analytical minimum mean square error and optimum step-size derived for transient and steady-state performances.
Parallelizes feedforward computation using nonlinear equation solving.
problem Sequential nature of feedforward computation limits parallelization.
method Frame feedforward computation as solving nonlinear equations; use Jacobi or Gauss-Seidel methods for parallel updates.
result Accelerates feedforward computation with reduced parallelizable iterations.
A new method for efficient nonlinear process monitoring using random Bernoulli features.
problem High computational demands and real-time responsiveness in online monitoring systems.
method Random Bernoulli principal component analysis to capture nonlinear patterns efficiently.
result The proposed methods offer excellent scalability and reduced computational complexity.
This paper tackles quantum machine learning by embedding nonlinear functions in topographic representations.
problem Challenges of nonlinear processes in quantum machine learning.
method Topographic representation of information for quantum machine learning.
result Nonlinear functions can be embedded in unitary processes.
Proposes a new derivative concept for nonlinear DRO problems.
problem Optimizing nonlinear functions in probability space with distributionally robust optimization.
method Introduces Gateaux derivative for smoothness and proposes a Frank-Wolfe algorithm.
result Validates theoretical results on portfolio selection problems with numerical validation.
The purpose of this paper is to construct the early exercise boundary for a class of nonlinear Black--Scholes equations with a nonlinear volatility depending on the option price. We review a method how to transform the problem into a solution of a time depending nonlinear parabolic equation defined on a fixed domain. R…
Paper uses Koopman operator and Nyström method for efficient nonlinear control.
problem Control of nonlinear dynamical systems.
method Combines Koopman operator framework with Nyström approximation for kernel methods.
result Theoretical guarantees on the convergence rates of the approximated Riccati operator and regulator objective.
Can we effectively learn a nonlinear representation in time comparable to linear learning? We describe a new algorithm that explicitly and adaptively expands higher-order interaction features over base linear representations. The algorithm is designed for extreme computational efficiency, and an extensive experimental …
New adaptive algorithms improve learning rate and reduce complexity.
problem Nonlinear system identification and prediction with large parameters.
method Data-selective adaptive kernel normalized least-mean square (KNLMS) algorithms.
result Proposed algorithms outperform existing methods in nonlinear system identification and prediction.
New insights into nonlinear multiview analysis for better data interpretation.
problem Identify shared latent components across different data views.
method Post-nonlinear model and multiview mixture learning.
result Identifies shared latent components under certain conditions.
Fundamental solutions found for PDEs in Finsler geometry.
problem Solving nonlinear PDEs in Finsler geometry.
method Introduced a non-isotropic Minkowski gauge and computed fundamental solutions.
result Explicit fundamental solutions computed for the PDEs.
SuperSpike learns spiking neural networks to perform complex computations.
problem Training spiking neural networks to perform nonlinear computations.
method Derive SuperSpike, a learning rule for multi-layer spiking neural networks.
result SuperSpike enables training of multi-layer spiking neural networks to solve complex tasks.
We introduce a data-based approach to estimating key quantities which arise in the study of nonlinear control systems and random nonlinear dynamical systems. Our approach hinges on the observation that much of the existing linear theory may be readily extended to nonlinear systems - with a reasonable expectation of suc…
Quantum reservoir computing tackles noisy quantum computers for temporal tasks.
problem Efficiently process input sequences on noisy quantum computers.
method Quantum reservoir computing using dissipative quantum dynamics.
result Small and noisy quantum reservoirs can handle high-order nonlinear temporal tasks.
Extends importance sampling to nonlinear models using adjoint operators.
problem Lack of tools for identifying important data points in nonlinear models.
method Introduces adjoint operator for nonlinear maps, generalizes norm and leverage scores.
result Generalized scores provide approximation guarantees for nonlinear mappings.
Novel algorithm identifies nonlinear Granger causal relationships using kernel ridge regression.
problem Identification of nonlinear Granger causal relationships.
method Flexible plug-in architecture with kernel ridge regression using radial basis function.
result Kernel ridge regression in mlcausality achieves competitive AUC scores and more finely calibrated p-values.
DeepRSCN models nonlinear systems using stochastic configurations.
problem Modeling nonlinear dynamic systems efficiently.
method Incrementally constructed deep reservoir computing framework with random parameters and online weight updates.
result DeepRSCN outperforms single-layer networks in efficiency, learning, and generalization.
WICA improves ICA results with a new method.
problem Finding independent components in nonlinear data.
method New nonlinear ICA model (WICA) with efficient correlation coefficient verification.
result WICA yields better and more stable results than other algorithms.
We propose a new cognitive framework for option price modelling, using quantum neural computation formalism. Briefly, when we apply a classical nonlinear neural-network learning to a linear quantum Schrödinger equation, as a result we get a nonlinear Schrödinger equation (NLS), performing as a quantum stochastic filter…
Machine learning optimizes fiber communication rates without channel knowledge.
problem Achieving information rates in nonlinear fiber communication.
method Jointly optimizes input and auxiliary channel distributions using end-to-end autoencoder learning.
result Computes achievable information rates without explicit channel knowledge.
Analyzes explaining nonlinear model predictions.
problem Understanding the contribution of inputs to outputs in nonlinear models.
method Merges integrated gradient and deep Taylor decomposition methods.
result Provides a natural reference point for model at use.
The paper introduces a fast algorithm for learning and forecasting nonlinear dynamics from noisy time series data.
problem Challenges in capturing nonlinear dynamics from noisy time series data.
method A projected nonlinear state-space model with kernel functions applied to projected lines.
result The model effectively learns and forecasts complex nonlinear dynamics with computational efficiency.
Neural networks simplify uncertainty quantification of locally nonlinear systems.
problem Estimating statistics of responses in large-scale locally nonlinear dynamical systems.
method Decomposes response into nominal linear system and a neural network-estimated pseudoforce.
result Neural networks can efficiently estimate pseudoforce containing nonlinear and uncertain information.
This paper develops a fast algorithm for solving nonlinear PDEs using sparse Cholesky factorization.
problem Efficiently solving nonlinear PDEs with Gaussian processes and kernel methods.
method Sparse Cholesky factorization for near-linear complexity.
result Near-linear complexity algorithm for working with kernel matrices of nonlinear PDEs.
Abstract: Nonlinear random walk with distributionally robust transition probabilities.
problem Modeling nonlinear random walks with robust transition probabilities.
method Scaling limit and nonlinear semigroup approach.
result Explicit computation of the generator and corresponding PDE.
Kernel method approximates Koopman operator eigenfunctions.
problem Complexity of computing Koopman operator spectra.
method Kernel-based approach to construct principal eigenfunctions.
result Principal eigenfunctions match linearization eigenvalues.
Paper uses neural networks to speed up simulations of complex systems.
problem Rapid simulations of advection-dominated problems in engineering and geophysics.
method Recurrent neural network for approximating nonlinear component of ROM.
result The proposed framework accurately recovers transient dynamics without full nonlinear computations.
This paper addresses credit valuation adjustment with a new closeout convention.
problem Accurate estimation of financial claim value considering counterparty credit risk.
method Theoretical and computational analysis of a nonlinear valuation system using neural networks.
result A neural network-based algorithm effectively solves the high-dimensional nonlinear valuation system.
MC-MCL improves MCL for nonlinear clustering.
problem Nonlinear clustering in data science.
method MC-MCL combines MCL with Minimum Curvilinearity for nonlinear distances.
result MC-MCL outperforms classical MCL and baseline clustering algorithms in nonlinear datasets.
FLEX optimizes exploration for nonlinear systems with minimal data.
problem Efficient exploration of unknown nonlinear systems with limited data.
method FLEX uses optimal experimental design to maximize information gain.
result FLEX outperforms other methods in nonlinear environments and control tasks.
Checks difference flatness via involutive distributions.
problem Nonlinear discrete-time system flatness testing.
method Computing a sequence of involutive distributions.
result Efficient implementation in computer algebra.
Graph theory criterion for Hodge theory to match linearly.
problem Matching nonlinear Hodge theory to linear on graphs.
method Minimizing edge potentials and solving nonlinear coclosed equations.
result Nonlinear selector agrees with Hodge projector on cactus graphs.
It has been recently shown that a large class of balanced graph cuts allows for an exact relaxation into a nonlinear eigenproblem. We review briefly some of these results and propose a family of algorithms to compute nonlinear eigenvectors which encompasses previous work as special cases. We provide a detailed analysis…
The paper introduces a new method for risk measurement using weak optimal transport.
problem Risk measurement in insurance and financial contexts.
method Convex risk measures with weak optimal transport penalties, explicit representation via nonlinear transform, computational aspects, and approximations using neural networks.
result Explicit representation and computational methods for risk measures.
On the basis of loop group decompositions (Birkhoff decompositions), we give a discrete version of the nonlinear d'Alembert formula, a method of separation of variables of difference equations, for discrete constant negative Gauss curvature (pseudospherical) surfaces in Euclidean three space. We also compute two exampl…
Stochastic VB improves nonlinear model inference speed and accuracy.
problem Bayesian inference of nonlinear models from noisy data.
method Stochastic Variational Bayesian (VB) inference for nonlinear models.
result Stochastic VB achieves comparable parameter recovery to analytical solution but is faster.
Novel methods for splitting Gaussian mixtures improve uncertainty propagation in nonlinear systems.
problem Improving accuracy and efficiency in nonlinear uncertainty propagation.
method Preserving mean and covariance, novel heuristics for selecting splitting direction informed by initial uncertainty and nonlinear function properties.
result Improved accuracy and efficiency in uncertainty propagation compared to existing techniques.
Spectral methods predict long-term signals from linear and nonlinear systems.
problem Forecasting temporal signals from linear and nonlinear systems with arbitrary sampling.
method Introduces a spectral algorithm for linear signals and extends it to nonlinear systems using Koopman theory.
result The spectral methods achieve high accuracy in forecasting and uncertainty quantification.
Sparse DNNs improve adversarial robustness by reducing computation and memory usage.
problem Adversarial attacks on DNNs increase computation and memory requirements.
method Pruning dense DNNs to create sparse models, analyzing their robustness.
result Higher sparsity in nonlinear DNNs correlates with better adversarial robustness.
The paper analyzes parameter estimation from nonlinear observations.
problem Recovering a structured but unknown parameter from nonlinear observations.
method Develops a framework for characterizing time-data tradeoffs for various parameter estimation algorithms.
result Projected gradient descent schemes converge at a linear rate with near minimal number of samples.
Proposes a partially linear structure to capture nonlinear relationships in mixture of experts models.
problem Suboptimal estimates due to linearity assumption in mixture of experts models.
method Introduces a partially linear structure that incorporates unspecified functions to capture nonlinear relationships.
result Establishes the identifiability of the proposed model under mild conditions and introduces a practical estimation algorithm.
The purpose of this paper is to analyze and compute the early exercise boundary for a class of nonlinear Black--Scholes equations with a nonlinear volatility which can be a function of the second derivative of the option price itself. A motivation for studying the nonlinear Black--Scholes equation with a nonlinear vola…
JULIA combines multi-linear and nonlinear models for tensor completion.
problem Complex patterns in real-world tensors require a unified model.
method JULIA unifies multi-linear and nonlinear models with flexible component assignment and efficient alternating optimization.
result JULIA outperforms existing methods in large-scale tensor completion.
Properties of the Cauchy-Riemann-Fueter equation for maps between quaternionic manifolds are studied. Spaces of solutions in case of maps from a K3-surface to the cotangent bundle of a complex projective space are computed. A relationship between harmonic spinors of a generalized nonlinear Dirac operator and solutions …