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

Trend · papers per month

196393589785 · Jun 202019922001200920172026
48 results for state input

Framework verifies global correctness of neural networks for perception tasks.

problem Verifying robustness of neural networks is insufficient; global correctness needs to be ensured.
method Specified a state space and observation process to define the target input space. Tiled the spaces and compared ground truth and network output bounds to deliver error bounds.
result Framework can verify error bounds globally over the target input space and detect illegal inputs.

A novel method uses GPLFMs for joint input-state estimation in linear structural systems.

problem Combined state and input estimation of linear structural systems.
method Gaussian process latent force models (GPLFMs) combined with Kalman filters.
result GPLFMs outperform conventional Kalman filters in state and input estimation.

New method for QPT without needing to know or prepare specific input states.

problem Quantum process characterization with unknown input states.
method Blind Quantum Process Tomography (BQPT) with single-preparation methods.
result Ability to characterize quantum processes using arbitrary unknown input states.

State-space systems generate probabilistic dependencies between inputs and outputs.

problem Understanding probabilistic dependencies in state-space systems.
method Introducing a probabilistic framework and proving sufficient conditions for output existence and uniqueness.
result State-space systems can generate probabilistic dependencies, even without functional relations.

Paper shows how to linearize flat systems with two inputs.

problem Linearizing flat nonlinear control systems with two inputs.
method Using prolongations of a control, the system can be made static feedback linearizable.
result A tracking control can be designed without requiring measurements of a generalized Brunovsky state.

Improved RL for grasping in cluttered scenes using state representation learning.

problem Poor performance of RL methods in grasping diverse objects from raw images.
method Employed state representation learning (SRL) with disentanglement of raw input images.
result Deep RL can learn grasping skills from varied visual inputs.

Generalizes memory and forecasting capacities for nonlinear recurrent networks with dependent inputs.

problem Understanding memory and forecasting capabilities in networks with dependent inputs.
method Formulated bounds for memory and forecasting capacities in terms of network size and input properties.
result Proved that memory capacity for linear recurrent networks with independent inputs is given by the rank of the controllability matrix.

Robust method estimates state, input, and parameters of linear systems online.

problem Joint estimation of state, input, and parameters in noisy or outlier-prone measurements.
method Combines recursive, alternating, and iteratively-reweighted least squares into a single algorithm.
result Good performance in presence of outliers and compared to state-of-the-art methods.

Study stability of selective SSMs with discontinuous gating.

problem Challenges in stability analysis of selective SSMs with discontinuous gating.
method Passivity and Input-to-State Stability (ISS) analysis of continuous-time selective SSMs.
result Derivation of sufficient conditions for global ISS with respect to the port input.

Entangled bisimulation improves policy learning from visual input.

problem Learning generalizeable policies from visual input in the presence of visual distractions.
method Proposes entangled bisimulation, a bisimulation metric for continuous state and action spaces.
result Entangled bisimulation improves policy learning on the Distracting Control Suite (DCS).

New method uses explicit human demonstrations to teach missing features in reward learning.

problem Reward learning methods rely on handcrafted features, limiting their ability to adapt to new or unexplained corrections.
method Introduces human input guiding the robot from states with missing features to states without, teaching the feature explicitly and integrating it into the reward function.
result Decreases sample complexity and improves generalization of the learned reward over deep IRL baseline.

Increasing input dimensionality improves deep RL performance and sample efficiency.

problem Real-world reinforcement learning applications often lack sufficient training data.
method Proposed an online feature extractor network (OFENet) to improve deep RL performance and sample efficiency.
result RL agents learn more efficiently with high-dimensional input representations than with lower-dimensional state observations.

New definitions of ESP for quantum reservoir computing handle non-stationary systems.

problem Traditional ESP does not apply to non-stationary systems.
method Introduce two new categories of ESP: non-stationary ESP and subset/subspace ESP.
result Demonstrates correspondence between non-stationary ESP and QRC with NARMA tasks.

ContextBench benchmarks methods for generating linguistically fluent inputs that activate specific latent features in language models.

problem Identifying inputs that trigger specific behaviours or latent features in language models.
method Context modification and benchmarking methods like Evolutionary Prompt Optimisation (EPO) with LLM-assistance and diffusion model inpainting.
result Enhanced methods achieve state-of-the-art performance in balancing elicitation effectiveness and fluency.

New approach detects out-of-distribution inputs without needing OOD samples.

problem Detecting incorrect classification of out-of-distribution inputs in deep neural networks.
method A one-class classifier trained on an early layer's output of the original classifier.
result Substantially better results compared to state-of-the-art approaches.

SGM combines deep learning and planning for robust long-horizon tasks.

problem Combining deep learning and planning for robust long-horizon tasks.
method Sparse Graphical Memory (SGM) that stores states and feasible transitions in a sparse memory, aggregating states according to a two-way consistency objective.
result SGM significantly outperforms current state of the art methods on long horizon, sparse-reward visual navigation tasks.

Simple GBRT model improved by window-based input transformation outperforms state-of-the-art deep learning models.

problem Improving performance of traditional forecasting models for time series data.
method Transformed GBRT model input structure to include target values and external features, forming one input instance per training window.
result Simple GBRT model with window-based input transformation outperformed state-of-the-art deep learning models on nine datasets.

Recurrent neural networks trained on regular languages exhibit stable states that can recover from noise.

problem Stability of internal states in recurrent neural networks trained on regular languages.
method Empirical study with analysis of network activation and transitions between states.
result Recurrent neural networks trained on regular languages can recover from random perturbations and maintain stable states.

Study robust control for systems with continuous states using adversarial perturbations.

problem Fragile policies in Markov control models under internal or external perturbations.
method Distributionally robust stochastic control with adaptive adversarial perturbations.
result Optimal robust policies for continuous state systems with uniform learning guarantees.

SpinSVAR estimates SVAR models with sparse input, improving accuracy and scalability.

problem Estimating SVAR models with sparse input assumptions.
method SpinSVAR models input as independent Laplacian variables, enforcing sparsity and using least absolute error regression.
result SpinSVAR outperforms state-of-the-art methods in accuracy and runtime, identifying significant structural shocks.

Reservoir Computing (RC) provides an efficient way for designing dynamical recurrent neural models. While training is restricted to a simple output component, the recurrent connections are left untrained after initialization, subject to stability constraints specified by the Echo State Property (ESP). Literature condit…

2018-11-27abs ↗pdf ↗

Study learns linear system dynamics from noisy bilinear data.

problem Learning linear dynamics from bilinear observations with process and measurement noise.
method Regression with Kronecker product design, data-dependent and independent error bounds.
result Upper bounds on statistical error rates and sample complexity for learning dynamics matrices.

Paper proposes method for optimal control of unknown systems with latent states.

problem Jointly estimating dynamics and latent states in systems with unmeasurable states.
method Combination of particle Markov chain Monte Carlo methods and scenario theory.
result Probabilistic performance guarantees for optimal input trajectories.

We present a new method for design problems wherein the goal is to maximize or specify the value of one or more properties of interest. For example, in protein design, one may wish to find the protein sequence that maximizes fluorescence. We assume access to one or more, potentially black box, stochastic "oracle" predi…

2019-01-29abs ↗pdf ↗

ScieNet improves deep learning resilience to input perturbations.

problem Deep learning's poor resilience to input perturbations in real-world scenarios.
method Hybrid architecture combining SNN for contextual info extraction and DNN for classification.
result Significant improvement in accuracy on noisy and rainy images without prior training.