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,742 papers · 148 categories

Trend · papers per month

15.8%31.6%47.4%63.1% · Jun 202019922001200920172026
48 results for Broad Learning System

The paper tackles long-context linear system identification with improved sample complexity bounds.

problem Identifying dynamical systems with long dependencies over fixed context windows.
method Established sample complexity bounds for systems with linear dependencies over a context window of length p.
result The learning process is not hindered by slow mixing properties in extended context windows.

Research explores how interconnected systems synchronize and how to control their behavior.

problem Understanding and controlling the behavior of interconnected dynamical systems.
method Mean field games approach applied to controlled coupled oscillators.
result Developed methods to predict and influence emergent phenomena in interconnected systems.

We introduce a unified probabilistic framework for solving sequential decision making problems ranging from Bayesian optimisation to contextual bandits and reinforcement learning. This is accomplished by a probabilistic model-based approach that explains observed data while capturing predictive uncertainty during the d…

2019-03-28abs ↗pdf ↗

BNAS improves neural architecture search with a scalable, fast, and efficient approach.

problem Efficiently searching for optimal neural architectures with high performance and low training time.
method Designing a broad scalable architecture (BCNN) with reinforcement learning and parameter sharing, and developing two variants.
result Significantly reduces training time and achieves state-of-the-art performance on CIFAR-10 and ImageNet.

Graph neural networks improve AMG convergence for sparse systems.

problem Efficiently constructing algebraic multigrid prolongation operators for sparse linear systems.
method Train a graph neural network to learn prolongation operators from matrix classes, using an unsupervised loss function.
result Improved convergence rates compared to classical AMG methods.

We solve a broad class of sequential decision-making problems with partially observed states.

problem Sequential decision-making under uncertainty with partially observed states.
method Modeling as a partially observed Markov decision process (POMDP) and separating state and modulation process.
result The approach allows for specialized approximate solution procedures.

This research simplifies verification of machine learning systems using reparameterization.

problem Reduce or eliminate serious bugs in machine learning systems.
method Use proof assistants to construct machine-checked proofs of correctness, leveraging reparameterization to handle probabilistic claims.
result Demonstrates broad applicability of reparameterization to verify different types of machine learning systems.

Develops a machine learning framework for computing most probable paths in stochastic systems.

problem Computing the most probable paths in stochastic dynamical systems.
method Reformulates the boundary value problem of Hamiltonian systems and uses a neural network to solve the Euler-Lagrange equation for the Onsager-Machlup action functional.
result Demonstrates the efficacy and accuracy of the machine learning approach in computing most probable paths for stochastic systems with various types of noise.

A new method uses counterfactual learning to improve recommendation system evaluation.

problem Inconsistent results in recommender systems due to exposure mechanisms.
method Proposes a minimax empirical risk formulation with an adversarial game to account for exposure.
result Shows improved learning bounds and effectiveness over various recommendation settings.

MLDemon monitors ML systems post-deployment, improving reliability with real-time performance estimates and expert labels.

problem Ensuring reliability of machine learning systems post-deployment, especially when user inputs differ from training data.
method Integrates unlabeled and on-demand labeled data to monitor ML model performance in real-time, deciding when to acquire expert labels.
result Outperforms existing approaches in temporal datasets with diverse distribution drifts, providing theoretical optimality for distribution drifts.

Paper introduces models to discover complex structures in large hypergraphs.

problem Understanding dependency structures in complex systems represented as hypergraphs.
method Probabilistic models treating classes of similar units as nodes in a latent hypergraph, using low-rank representations.
result Improves link prediction and discovers interpretable structures in diverse real-world systems.

Bayesian framework integrates prior and data knowledge for nonlinear dynamical systems.

problem Fusing diverse prior knowledge with data for accurate model learning.
method General-purpose Bayesian inference and learning framework combining explicit and implicit prior knowledge.
result Efficient parameter marginalization and closed-form densities for online and offline inference.

New method solves optimization problems on manifolds using symplectic integrators.

problem Optimization tasks on manifolds with nonlinear constraints.
method Dissipative extension of Dirac's theory of constrained Hamiltonian systems and geometric/symplectic numerical integrators.
result Developed algorithms achieve optimal convergence rates locally.

Novel method estimates complex nonlinear systems with stochastic differential equations.

problem Handling complex nonlinear dynamical systems with strong learning guarantees.
method Estimates drift and diffusion coefficients of continuous, multidimensional, nonlinear controlled stochastic differential equations.
result Strong theoretical guarantees including finite-sample bounds for various metrics.

MPP trains a transformer to predict multiple physical systems, improving accuracy across various tasks.

problem Training models for specific physical systems is inefficient and requires fine-tuning.
method MPP trains a shared transformer on multiple heterogeneous physical systems, projecting fields into a shared embedding space.
result A single MPP-pretrained transformer outperforms task-specific models on all pretraining sub-tasks and downstream tasks.

The paper uses geometry to understand how neural networks learn.

problem Understanding the learning capability of neural networks.
method Statistical and differential geometric analysis of neural networks performing simple regression.
result Neural networks with higher generalization capability have a slower convergence rate.

While the Machine Learning (ML) landscape is evolving rapidly, there has been a relative lag in the development of the "learning systems" needed to enable broad adoption. Furthermore, few such systems are designed to support the specialized requirements of scientific ML. Here we present the Data and Learning Hub for sc…

2018-11-27abs ↗pdf ↗

A semi-parametric, non-linear regression model in the presence of latent variables is introduced. These latent variables can correspond to unmodeled phenomena or unmeasured agents in a complex networked system. This new formulation allows joint estimation of certain non-linearities in the system, the direct interaction…

2017-05-09abs ↗pdf ↗

Due to recent advances - compute, data, models - the role of learning in autonomous systems has expanded significantly, rendering new applications possible for the first time. While some of the most significant benefits are obtained in the perception modules of the software stack, other aspects continue to rely on know…

2018-06-15abs ↗pdf ↗

Paper studies rigidity phenomena for elliptic systems on Riemannian manifolds.

problem Local radial rigidity of elliptic systems on Riemannian manifolds.
method Reduction to singular ordinary differential equations of Euler type.
result Local uniqueness and existence results for solutions with prescribed initial jets.

New nonlinear saliency maps improve deep neural network interpretability.

problem Lack of understanding why and how deep neural networks make decisions.
method Developed novel nonlinear saliency maps to better interpret deep neural networks.
result Nonlinear saliency maps provide more specific drivers of classification on complex examples.

Deep learning has emerged as a strong and efficient framework that can be applied to a broad spectrum of complex learning problems which were difficult to solve using the traditional machine learning techniques in the past. In the last few years, deep learning has advanced radically in such a way that it can surpass hu…

2018-09-28abs ↗pdf ↗

Unified approach to learn interpretable concepts from data.

problem Building interpretable machine learning models and highly-performing foundation models.
method Relating causal representation learning and foundation models, defining concepts and proving their recoverability.
result Provable recovery of human-interpretable concepts from diverse data.

New method disentangles perceptual uncertainty and behavioral costs in partially observable systems.

problem Tackles inverse optimal control for non-linear partially observable systems.
method Probabilistic approach using maximum causal entropy formulations and local linearization.
result Disentangles perceptual factors and behavioral costs in sequential decision-making.

MLPerf, an emerging machine learning benchmark suite strives to cover a broad range of applications of machine learning. We present a study on its characteristics and how the MLPerf benchmarks differ from some of the previous deep learning benchmarks like DAWNBench and DeepBench. We find that application benchmarks suc…

2019-08-24abs ↗pdf ↗

Study uses ML techniques to reveal quantum-like features in classical systems.

problem Understanding the intuition behind unsupervised ML in physical systems.
method Three ML techniques applied to adjacency matrices of 2D particulate systems.
result ML techniques reveal quantum-like features in classical systems.

Dynamic models learn from sparse, interacting sub-systems.

problem Learning robust models for systems with local views and spatial locations.
method Abstracting the system as a collection of sparsely interacting sub-systems, each with a learned topology informed by spatial structure.
result Models are more robust to the number of available views and generalize better to novel tasks.

In this paper we study deep learning-based music source separation, and explore using an alternative loss to the standard spectrogram pixel-level L2 loss for model training. Our main contribution is in demonstrating that adding a high-level feature loss term, extracted from the spectrograms using a VGG net, can improve…

2019-01-15abs ↗pdf ↗

Establishes interior regularity results for a broad class of two-dimensional nonlinear elliptic systems using a unified abstract framework.

problem Interior regularity results for two-dimensional nonlinear elliptic systems
method A unified abstract framework built around a Campanato-type discrete iteration scheme coupled with a Caccioppoli-type estimate
result Local Hölder continuity of the map u\boldsymbol{u} is established, with an explicit Hölder exponent that optimally attains the classical Morrey--Campanato threshold dictated by the Lebesgue integrability of the source term f\boldsymbol{f}

LMM predicts healthcare costs and risks with improved accuracy.

problem Wasteful healthcare spending and inefficiencies in risk prediction.
method Generative pre-trained transformer trained on patient event sequences.
result Improves cost prediction by 14.1% and chronic conditions prediction by 1.9%.

Economies and societal structures in general are complex stochastic systems which may not lend themselves well to algebraic analysis. An addition of subjective value criteria to the mechanics of interacting agents will further complicate analysis. The purpose of this short study is to demonstrate capabilities of agent-…

2018-11-07abs ↗pdf ↗