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

3907791,1691,558 · Jun 202019922001200920172026
48 results for non-linear learning

Study on dynamics of non-linear autoencoders learning principal components.

problem Technical difficulty in studying non-linear autoencoders due to non-trivial correlations.
method Derive asymptotically exact equations for SGD training of shallow, non-linear autoencoders.
result Autoencoders learn principal components sequentially and tie weights are ineffective.

Machine learning improves joint default assessment by capturing non-linear dependencies.

problem Capturing non-linear dependencies among covariates for accurate joint default assessment.
method Application of machine learning techniques to credit card dataset, comparing with logistic regression.
result Machine learning outperforms logistic regression in assessing portfolio riskiness.

SAFLe solves federated learning's trade-off between non-linearity and scalability.

problem Federated Learning's high communication overhead and performance collapse on non-IID data.
method SAFLe introduces a structured head of bucketed features and sparse, grouped embeddings, mathematically equivalent to a high-dimensional linear regression.
result SAFLe achieves a new state-of-the-art in analytic FL, outperforming linear AFL and multi-round DeepAFL.

Gradient descent with growing learning rate enables learning non-linear features in neural networks.

problem Learning non-linear features in two-layer neural networks.
method Using gradient descent with a learning rate that grows with the sample size.
result Multiple rank-one components emerge, each corresponding to a specific polynomial feature.

New classifier combines locally linear kernels for fast and accurate non-linear classification.

problem Developing a fast and accurate non-linear classifier.
method Combines locally linear classifiers using a 1\ell_1 Multiple Kernel Learning (MKL) problem with scalable MKL training for streaming kernels.
result The resulting classifier achieves high accuracy with fast inference time.

ENIAC method optimizes and explores complex RL problems with non-linear policies.

problem Theoretical understanding of non-linear policies in RL with strategic exploration.
method ENIAC, an actor-critic method for non-linear function approximation.
result ENIAC finds near-optimal policies in polynomial exploration rounds under bounded eluder dimension.

DPLS improves asset pricing by capturing non-linear risk factor structures.

problem Estimating asset pricing models with non-linear risk factor structures.
method Deep Partial Least Squares (DPLS) for dynamic and flexible factor modeling.
result DPLS models outperform linear models in asset pricing, capturing non-linear risk factor interactions.

New models learn stable latent clusters without side info.

problem Stability of non-linear ICA representations without side information.
method Deep generative models with latent clusterings, compared to standard VAEs and auxiliary labeled models.
result Deep generative models with latent clusterings are as stable as models with side information.

We develop algorithms to learn non-linear dynamical systems without mixing assumptions.

problem Learning non-linear dynamical systems from dependent data.
method We introduce an offline algorithm and a one-pass streaming method with SGD-RER.
result Our methods achieve optimal or near-optimal performance for learning non-linear systems.

Unified framework for non-linear attention using modern Hopfield networks.

problem Improving transformer model's understanding of complex relationships and efficiency.
method Proposes an energy functional based on Modern Hopfield Networks (MNH) to unify linear and non-linear attention mechanisms.
result Context wells encapsulate contextual relationships among tokens, offering a richer representation of non-linear data.

Agents learn state ambiguity from non-linear sensor data using Gaussian approximations.

problem Learning state representation from non-linear sensor data.
method Second-order Taylor approximation of Gaussian distribution for non-linear measurement functions.
result Induces a preference for states based on inferability from observations.

Enhances Cox model for survival analysis with symbolic non-linear log-risk functions.

problem Limited interpretability and non-linearity in traditional Cox models.
method Introduces GCPH model using Kolmogorov-Arnold Networks for symbolic non-linear log-risk functions.
result GCPH achieves competitive performance and superior interpretability.

This paper proposes a new method to learn integration schemes for complex ODEs.

problem Learning efficient integration schemes for non-linear ODEs and their identification.
method A novel framework to learn integration schemes that minimize an integration-related cost function.
result The proposed learning-based approach provides integration schemes close to analytical solutions.

This research evaluates learning models for bionic robots, focusing on transfer function identification.

problem Developers need guidance on selecting and constructing transfer functions for bionic robots.
method Comprehensive evaluation strategy including data collection, learning model selection, comparative analysis, and transfer function identification.
result A framework for effectively dealing with multi-input multi-output robotic data.

This paper conditions non-linear infinite-dimensional diffusion processes.

problem Conditioning non-linear and infinite-dimensional diffusion processes.
method Infinite-dimensional Girsanov's theorem to condition function-valued stochastic processes.
result Conditioning of non-linear infinite-dimensional diffusion processes is achieved.

Develops inverse EKF for non-linear systems with stability guarantees and learning unknown dynamics.

problem Estimating adversary's Kalman-filtered estimates in highly non-linear systems.
method Proposes inverse extended Kalman filter (I-EKF) for second-order, Gaussian sum, and dithered forward models. Uses reproducing kernel Hilbert space for learning unknown dynamics.
result Derives theoretical stability guarantees for inverse second-order EKF.

Paper introduces non-linearity signature to measure deep neural network performance.

problem Difficulty in explaining performance differences among similar DNN architectures.
method Affine Optimal Transport mappings to measure non-linearity.
result Signature provides better understanding of DNN inner workings.

Study reward-free RL in non-linear settings, improving efficiency and removing assumptions.

problem Improving sample efficiency in reward-free reinforcement learning for non-linear function approximation.
method Proposed RFOLIVE algorithm for minimal structural assumptions, analyzed hardness results for reward-free and reward-aware exploration.
result Statistical efficiency and hardness results under various structural assumptions, no need for reachability or explorability assumptions.

Simplifies deep learning scaling analysis without sacrificing accuracy.

problem Interpreting feature learning mechanisms and determining network implicit bias in high-dimensional settings.
method Developed a heuristic approach for predicting data and width scales of feature learning patterns.
result Predictions align with known results and extend to complex architectures.

Papers learn from data to make decisions without interacting, improving on previous methods.

problem Achieving optimal decision-making from offline data with non-linear function approximation.
method Pessimistic Nonlinear Least-Square Value Iteration (PNLSVI) with three innovative components.
result Achieves minimax optimal instance-dependent regret for non-linear function approximation.

Complex problems may require sophisticated, non-linear learning methods such as kernel machines or deep neural networks to achieve state of the art prediction accuracies. However, high prediction accuracies are not the only objective to consider when solving problems using machine learning. Instead, particular scientif…

2016-11-22abs ↗pdf ↗

Learning weights in a spiking neural network with hidden neurons, using local, stable and online rules, to control non-linear body dynamics is an open problem. Here, we employ a supervised scheme, Feedback-based Online Local Learning Of Weights (FOLLOW), to train a network of heterogeneous spiking neurons with hidden l…

2017-12-29abs ↗pdf ↗

Deep networks prioritize easier examples over harder ones, leading to faster training.

problem Understanding how deep networks prioritize examples of varying difficulty.
method Investigated the effect of linear vs non-linear learning modes on example difficulty.
result Non-linear dynamics tend to sequentialize the learning of examples of increasing difficulty.

A semi-parametric, non-linear regression model in the presence of latent variables is applied towards learning network graph structure. These latent variables can correspond to unmodeled phenomena or unmeasured agents in a complex system of interacting entities. This formulation jointly estimates non-linearities in the…

2018-06-28abs ↗pdf ↗

New Shapley values reveal non-linear feature dependencies.

problem Understanding non-linear dependencies in machine learning models.
method Model-independent Shapley values using non-parametric measures of dependence.
result Model-independent Shapley values can uncover non-linear dependencies.

Improved regret bound for multinomial logistic bandits with non-linearity.

problem Maximizing rewards in multinomial logistic bandits with non-linear feedback.
method Extended the definition of κκ_* to multinomial setting and proposed an efficient algorithm.
result Minimax-optimal regret bound of O~(RdKT/κ) \smash{\widetilde{\mathcal{O}}( R d \sqrt{ {KT}/{κ_*}} ) } , improving over existing guarantees.

We present a multi-task learning formulation for Deep Gaussian processes (DGPs), through non-linear mixtures of latent processes. The latent space is composed of private processes that capture within-task information and shared processes that capture across-task dependencies. We propose two different methods for segmen…

2019-05-29abs ↗pdf ↗

We present a general framework for solving a large class of learning problems with non-linear functions of classification rates. This includes problems where one wishes to optimize a non-decomposable performance metric such as the F-measure or G-mean, and constrained training problems where the classifier needs to sati…

2019-09-06abs ↗pdf ↗

Neural networks with at least two hidden layers are called deep networks. Recent developments in AI and computer programming in general has led to development of tools such as Tensorflow, Keras, NumPy etc. making it easier to model and draw conclusions from data. In this work we re-approach non-linear regression with d…

2020-02-22abs ↗pdf ↗

Analyzes generalization error in generalized linear models, explaining double descent phenomenon.

problem Understanding generalization of machine learning models in high dimensions.
method Develops a framework to characterize asymptotic generalization error for generalized linear models.
result Rigorously explains the double descent phenomenon in generalized linear models.

A new method learns state and proposal dynamics in state-space models using neural networks.

problem Inference in non-linear state-space models.
method StateMixNN method using neural networks for proposal and transition distributions.
result Significantly improved recovery of hidden state, especially in highly non-linear scenarios.

Modeling dynamical systems is important in many disciplines, e.g., control, robotics, or neurotechnology. Commonly the state of these systems is not directly observed, but only available through noisy and potentially high-dimensional observations. In these cases, system identification, i.e., finding the measurement map…

2014-10-28abs ↗pdf ↗

A basic problem in machine learning is to find a mapping ff from a low dimensional latent space Y\mathcal{Y} to a high dimensional observation space X\mathcal{X}. Modern tools such as deep neural networks are capable to represent general non-linear mappings. A learner can easily find a mapping which perfectly fits a…

2018-11-05abs ↗pdf ↗

Develops a Riemannian archetypal analysis for interpretable non-linear data.

problem Limited performance of classical archetypal analysis on non-linear data.
method Riemannian geometry for data-driven pullback, geodesic convex combinations, convex relaxation followed by non-convex refinement.
result Combines interpretability of classical archetypal analysis with expressive power of modern non-linear models.