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

3876113151 · Jun 202019922001200920172026
48 results for sinusoidal activations

A new KAN variant uses sinusoidal activations to approximate functions.

problem Approximating multivariable functions using neural networks.
method Replacing inner and outer functions in Kolmogorov-Arnold representation with weighted sinusoidal functions.
result The new KAN variant outperforms fixed-frequency Fourier transform and achieves comparable performance to MLPs.

Periodic activation functions improve neural network reliability and interpretability.

problem Neural networks reinforce hidden biases, making them unreliable and hard to interpret.
method Introduce periodic activation functions in Bayesian neural networks to establish a connection with stationary Gaussian process priors.
result Periodic activation functions, including sinusoidal, triangular, and ReLU, improve model performance and sensitivity to perturbations.

Algorithm finds frequencies, amplitudes, and phases of sinusoids in noisy data.

problem Finding frequencies, amplitudes, and phases of sinusoids in noisy data.
method Maximum likelihood approach to estimate tone parameters from contaminated observations. Successively estimates frequencies and jointly optimizes amplitudes and phases.
result Near-linear computational complexity (O(N)) for estimating MM number of sinusoidal sources.

New algorithm trains deep neural networks without global optimization.

problem Training deep neural networks efficiently and without global optimization.
method Uses random complex exponential activation functions and Markov Chain Monte Carlo sampling.
result Consistently attains theoretical approximation rate for residual networks.

Paper proposes robust LAD estimators for 2D sinusoidal model, proving consistency and normality.

problem Estimation of parameters in 2D sinusoidal models with outliers or heavy-tailed noise.
method Least absolute deviation (LAD) estimators for robust parameter estimation.
result Strong consistency and asymptotic normality of LAD estimators for 2D sinusoidal model parameters.

WaveQ uses sinusoidal regularization to optimize deep quantization for neural networks, improving both efficiency and accuracy.

problem Deep quantization reduces bitwidth but can lead to significant accuracy loss due to inter-layer dependencies.
method WaveQ employs sinusoidal regularization to learn multiple quantization parameters during gradient-based training, balancing compute efficiency and accuracy.
result WaveQ achieves accuracy preservation and efficiency gains across various deep networks, outperforming state-of-the-art techniques.

Sine activation functions enable two-layer neural networks to learn modular addition more efficiently.

problem Learning modular addition with two-layer neural networks.
method Introduced and analyzed sine activation functions, providing theoretical and empirical evidence.
result Sine activation functions allow for constant-width network realizations of modular addition, whereas ReLU networks require linear width scaling.

Random sinusoidal features are a popular approach for speeding up kernel-based inference in large datasets. Prior to the inference stage, the approach suggests performing dimensionality reduction by first multiplying each data vector by a random Gaussian matrix, and then computing an element-wise sinusoid. Theoretical …

2017-01-23abs ↗pdf ↗

Autoencoder estimates parameters of noisy, multi-component damped signals.

problem Parameter estimation of damped sinusoidal signals under rapid decay and noise.
method Autoencoder-based approach using latent space for frequency, phase, decay, and amplitude estimation.
result High accuracy in parameter estimation, robustness to subdominant components and phase differences.

A new method uses sinusoidal functions to represent timestamps as dense vectors for improving irregularly sampled time series learning.

problem Challenges in supervised learning with irregularly sampled time series due to irregular time intervals.
method Proposes a novel method to represent timestamps as dense vectors using sinusoidal functions, called Time Embeddings.
result Improves LSTM-based and classical machine learning models, especially with very irregular data.

Learning to infer Bayesian posterior from a few-shot dataset is an important step towards robust meta-learning due to the model uncertainty inherent in the problem. In this paper, we propose a novel Bayesian model-agnostic meta-learning method. The proposed method combines scalable gradient-based meta-learning with non…

2018-06-11abs ↗pdf ↗

Estimation of functions of d d variables is considered using ridge combinations of the form k=1mc1,kφ(j=1dc0,j,kxjbk) \textstyle\sum_{k=1}^m c_{1,k} φ(\textstyle\sum_{j=1}^d c_{0,j,k}x_j-b_k) where the activation function φ φ is a function with bounded value and derivative. These include single-hidden layer neural networks, polynomials, …

2017-02-09abs ↗pdf ↗

It is well-known that the robustness of artificial neural networks (ANNs) is important for their wide ranges of applications. In this paper, we focus on the robustness of the classification ability of a spiking neural network which receives perturbed inputs. Actually, the perturbation is allowed to be arbitrary styles.…

2018-01-30abs ↗pdf ↗

Paper studies Transformer learning theory for Euclidean and Riemannian domains.

problem Understanding and optimizing Transformer networks for regression tasks.
method Constructive approximation framework using softmax partition of unity and attention mechanism.
result Transformer can achieve uniform ε-approximation error with minimal parameters.

The study proposes a new interest rate model that captures long-term periodicity in U.S. Treasury yields.

problem The conventional Hull-White model fails to adequately capture long-term economic cycles in interest rates.
method The study introduces a sinusoidal Hull-White model with a time-varying mean reversion speed.
result The proposed model improves bond pricing and interest rate derivative valuation, especially for longer maturities.

New model for pricing volatility derivatives considering rough volatility and jumps.

problem Modeling instantaneous volatility with rough volatility and jumps.
method Generalized fractional Ornstein-Uhlenbeck process with Lévy subordinator and sinusoidal-composite Lévy process.
result Pricing-hedging formulae for power-type derivatives on average forward variance are derived.

Numerical simulations show stability of Type-II singularities in noncompact hypersurfaces.

problem Stability of Type-II singularities in noncompact hypersurfaces with rotationally-symmetric perturbations.
method Adaptation of the overlap method to include angular dependence.
result MCF of noncompact hypersurfaces with angular dependence behaves similarly to rotationally-symmetric perturbations, developing Type-II or Type-I singularities.

BEKAN uses RBFs and evolutionary methods to solve PDEs with boundary conditions.

problem Enforcing boundary conditions in neural networks for PDE solutions.
method Boundary condition-guaranteed evolutionary Kolmogorov-Arnold Network (BEKAN) with radial basis functions (RBFs). Incorporates Dirichlet, periodic, and Neumann conditions.
result BEKAN outperforms MLP and B-splines KAN in solving PDEs with boundary conditions.

We show that finite-width deep ReLU neural networks yield rate-distortion optimal approximation (Bölcskei et al., 2018) of polynomials, windowed sinusoidal functions, one-dimensional oscillatory textures, and the Weierstrass function, a fractal function which is continuous but nowhere differentiable. Together with thei…

2018-06-05abs ↗pdf ↗

A neural network for online NP classification with reduced complexity.

problem Online nonlinear Neyman-Pearson classification.
method Single hidden layer feedforward neural network (SLFN) initialized with random Fourier features (RFFs). Uses stochastic gradient descent for sequential learning.
result Expedited online adaptation and powerful nonlinear Neyman-Pearson modeling.

Frequency estimation is a fundamental problem in signal processing, with applications in radar imaging, underwater acoustics, seismic imaging, and spectroscopy. The goal is to estimate the frequency of each component in a multisinusoidal signal from a finite number of noisy samples. A recent machine-learning approach u…

2019-06-03abs ↗pdf ↗

Gradient-EM Bayesian meta-learning accelerates adaptation with reduced computation and improved robustness.

problem Efficient and robust adaptation to new tasks with uncertainty assessment.
method Extends Bayesian meta-learning with gradient-EM algorithm, decoupling inner-update from meta-update.
result Improves accuracy with less computation cost and enhanced robustness to uncertainty.

Exploiting the fact that most arrival processes exhibit cyclic behaviour, we propose a simple procedure for estimating the intensity of a nonhomogeneous Poisson process. The estimator is the super-resolution analogue to Shao 2010 and Shao & Lii 2011, which is a sum of pp sinusoids where pp and the frequency, amplitud…

2016-10-30abs ↗pdf ↗

Time-aware deep learning methods improve spatial downscaling of atmospheric pollutants.

problem Transform coarse satellite data of atmospheric pollutants into high-resolution fields.
method Super-resolution deep residual networks and UNet architectures are extended with a temporal module encoding observation time.
result Temporal modules significantly improve downscaling performance and convergence speed.

EmDT generates synthetic fraud data to improve detection accuracy.

problem Imbalanced datasets in fraud detection lead to poor performance on rare fraudulent transactions.
method EmDT uses UMAP clustering to identify fraudulent patterns and a Transformer denoising network to generate synthetic data.
result EmDT significantly improves classification performance compared to existing methods.

The gauge theory of arbitrage was introduced by Ilinski in [arXiv:hep-th/9710148] and applied to fast money flows in [arXiv:cond-mat/9902044]. The theory of fast money flow dynamics attempts to model the evolution of currency exchange rates and stock prices on short, e.g.\ intra-day, time scales. It has been used to ex…

2010-06-14abs ↗pdf ↗

This paper develops fundamental limits of deep neural network learning by characterizing what is possible if no constraints are imposed on the learning algorithm and on the amount of training data. Concretely, we consider Kolmogorov-optimal approximation through deep neural networks with the guiding theme being a relat…

2019-01-08abs ↗pdf ↗

The paper studies the problem of recovering a spectrally sparse object from a small number of time domain samples. Specifically, the object of interest with ambient dimension nn is assumed to be a mixture of rr complex multi-dimensional sinusoids, while the underlying frequencies can assume any value in the unit disk…

2013-04-16abs ↗pdf ↗

This paper won 1st place in forecasting and investment challenges, improving on meta-learning and parametric models.

problem Forecasting and investment challenges in time-series data.
method Hypernetworks and adversarial portfolios to design time-series models.
result Outperformed state-of-the-art meta-learning methods and conventional parametric models.

Many activation functions have been proposed in the past, but selecting an adequate one requires trial and error. We propose a new methodology of designing activation functions within a neural network at each layer. We call this technique an "activation ensemble" because it allows the use of multiple activation functio…

2017-02-24abs ↗pdf ↗

This paper studies activation sparsity in large language models, finding key trends and implications.

problem Activation sparsity in large language models (LLMs) can be improved for efficiency and interpretability.
method Proposes PPL-p%p\% sparsity, analyzes trends with training data, width-depth ratio, and parameter scale.
result ReLU is more efficient for sparsity than SiLU, and deeper architectures can improve sparsity.