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

163326489652 · Jun 202019922001200920172026
48 results for structured inputs

Model predicts composite structures assembly quality with input uncertainty.

problem Accurate prediction of dimensional deviations and residual stress in composite structures assembly.
method Neural Network Gaussian Process considering input uncertainty.
result NNGPIU model outperforms other methods for nonsmooth, nonlinear responses.

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.

Graph-to-Tree Neural Networks improve structured input-output translation in tasks like semantic parsing and math word problems.

problem Improving performance on tasks like semantic parsing and math word problem solving.
method Graph-to-Tree Neural Networks, consisting of a graph encoder and a hierarchical tree decoder.
result Graph2Tree model outperforms or matches state-of-the-art models on neural semantic parsing and math word problem tasks.

Study of deep neural networks using finite-time Lyapunov exponents.

problem Understanding the geometric structures in input space formed by deep neural networks.
method Analogy with dynamical systems, computing finite-time Lyapunov exponents.
result Ridges of large positive exponents divide input space into regions associated with different classes.

Deep learning models converge to Gaussian dynamics with mixed structured inputs.

problem Understanding neural network dynamics with complex input distributions.
method Extended hidden manifold model to Gaussian mixtures, analyzed via SGD.
result Learning dynamics with mixed inputs converge to Gaussian behavior.

A neural network finds causal relationships among latent variables.

problem Learning causal structure among latent variables in high-dimensional data.
method Redundant Input Neural Network (RINN) with modified architecture and regularized objective function.
result The RINN method successfully recovers latent causal structure between input and output variables.

Constraint-based learning reduces the burden of collecting labels by having users specify general properties of structured outputs, such as constraints imposed by physical laws. We propose a novel framework for simultaneously learning these constraints and using them for supervision, bypassing the difficulty of using d…

2018-05-27abs ↗pdf ↗

MIMONets speed up neural network inference by processing multiple inputs in parallel.

problem Reducing computational cost in neural network inference for large datasets.
method Proposes MIMONets, which augment neural network architectures with variable binding mechanisms to handle multiple inputs in superposition.
result Achieves significant speedups (2-4x) with minimal accuracy loss, demonstrating adaptability across different architectures.

LOL-BO improves latent space Bayesian optimization over structured inputs.

problem Optimizing complex functions over high-dimensional, structured search spaces.
method Adapting trust regions from high-dimensional to structured settings, using a DAE to map inputs into a latent space.
result Achieves up to 20x improvement over state-of-the-art methods.

The current understanding of deep neural networks can only partially explain how input structure, network parameters and optimization algorithms jointly contribute to achieve the strong generalization power that is typically observed in many real-world applications. In order to improve the comprehension and interpretab…

2020-02-17abs ↗pdf ↗

Extremely accurate prediction of dynamical system bifurcations using control inputs.

problem Predicting complex bifurcation structures in dynamical systems.
method Extending extreme learning machines with control inputs to model system dynamics.
result The model can nearly reproduce the entire structure of bifurcations using only a few parameter values.

JacNet learns Jacobians to enforce structure on derivatives for invertibility and Lipschitz functions.

problem Enforcing structure on derivatives of neural network mappings.
method Proposes using a neural network to directly learn the Jacobian of the input-output function, allowing control over derivative structure.
result Demonstrates learning invertible approximations to simple and 1-Lipschitz functions.

Recurrent neural networks (RNNs) can model natural language by sequentially 'reading' input tokens and outputting a distributed representation of each token. Due to the sequential nature of RNNs, inference time is linearly dependent on the input length, and all inputs are read regardless of their importance. Efforts to…

2019-03-20abs ↗pdf ↗

Model captures system input variations in latent space for actionable dynamics.

problem Learning dynamical systems from data without prescribing a mathematical model.
method Structured latent ODE model with stochastic factors of variation for each input.
result Improves generation of time-series data and inference of system inputs over baselines.

In this paper, we present a structurally flat triangular form which is based on the extended chained form. We provide necessary and sufficient conditions for an affine input system with two inputs to be static feedback equivalent to the proposed triangular form, and thus a sufficient condition for an affine input syste…

2020-02-04abs ↗pdf ↗

Many machine learning algorithms represent input data with vector embeddings or discrete codes. When inputs exhibit compositional structure (e.g. objects built from parts or procedures from subroutines), it is natural to ask whether this compositional structure is reflected in the the inputs' learned representations. W…

2019-02-19abs ↗pdf ↗

VAIOM models financial returns using continuous input and categorical output.

problem Modeling continuous, noisy, and heterogeneous financial data.
method VAIOM is a decoder-only Transformer that separates input representation from output likelihood.
result VAIOM models outperform fixed single-bar LightGBM baseline in both Test halves.

Deep Graph Neural Networks (GNNs) are useful models for graph classification and graph-based regression tasks. In these tasks, graph pooling is a critical ingredient by which GNNs adapt to input graphs of varying size and structure. We propose a new graph pooling operation based on compressive Haar transforms -- HaarPo…

2019-09-25abs ↗pdf ↗

New research shows input-gradients can be manipulated without changing model's core function, challenging their use for model interpretation.

problem Current methods for model interpretability using input-gradients are flawed due to their arbitrary manipulability.
method Investigated by reinterpreting logits as unnormalized log-densities, proposing novel approximations for score-matching.
result Improving alignment between implicit density model and data distribution enhances gradient structure and explanatory power.

We propose PLLay, a novel topological layer for general deep learning models based on persistence landscapes, in which we can efficiently exploit the underlying topological features of the input data structure. In this work, we show differentiability with respect to layer inputs, for a general persistent homology with …

2020-02-07abs ↗pdf ↗

New method for robustly interpreting ML models using quantile constraints and Wasserstein projections.

problem Assessing robustness of black-box models to input misspecification.
method Quantile-constrained Wasserstein projections for robust interpretability.
result Analytical solution for perturbation problem and smooth perturbations.

To compare entities of differing types and structural components, the artificial neural network paradigm was used to cross-compare structural components between heterogeneous documents. Trainable weighted structural components were input into machine-learned activation functions of the neurons. The model was used for m…

2018-01-09abs ↗pdf ↗

We outline a detection method for adversarial inputs to deep neural networks. By viewing neural network computations as graphs upon which information flows from input space to out- put distribution, we compare the differences in graphs induced by different inputs. Specifically, by applying persistent homology to these …

2017-11-28abs ↗pdf ↗

This paper analyzes the interpolation error of nonlinear Attention compared to linear regression.

problem Understanding the interpolation error of nonlinear Attention in high-dimensional settings.
method Derives explicit expressions for mean-squared interpolation error using signal-plus-noise model and random matrix theory.
result Nonlinear Attention generally incurs a larger interpolation error than linear regression, but this gap can be reversed with structured signals.

New framework analyzes regret in guided diffusion for optimizing structured inputs.

problem Understanding regret behavior in guided-diffusion black-box optimization for structured design problems.
method Developed a certificate-based expected simple-regret framework that avoids assumptions breaking down in modern diffusion BO pipelines.
result Explains how exponential and polynomial convergence can arise from mass lift in near-optimal designs.

We give a new algorithm for learning a two-layer neural network under a general class of input distributions. Assuming there is a ground-truth two-layer network y=Aσ(Wx)+ξ, y = A σ(Wx) + ξ, where A,WA,W are weight matrices, ξξ represents noise, and the number of neurons in the hidden layer is no larger than the input or outp…

2018-10-16abs ↗pdf ↗

In adversarial attacks to machine-learning classifiers, small perturbations are added to input that is correctly classified. The perturbations yield adversarial examples, which are virtually indistinguishable from the unperturbed input, and yet are misclassified. In standard neural networks used for deep learning, atta…

2018-09-25abs ↗pdf ↗

PenduMAV is a 6-input omnidirectional MAV without internal forces.

problem Designing a MAV without internal forces and structural costs.
method Multibody dynamics derivation, SE(3) control, Lyapunov analysis, Gazebo simulations.
result Asymptotic stabilization of the closed-loop system under parametric uncertainty and actuator noise.

New method shows fully-connected networks can learn convolutional structures from data.

problem How to learn convolutional structures from translation-invariant data.
method Data-driven emergence of convolutional structure in neural networks.
result Initially fully-connected networks can learn convolutional structures from their inputs.

The paper constructs minimizers for deep learning networks and analyzes their geometric structure.

problem Underparametrized deep learning networks and their minimizers.
method Direct construction of minimizers without gradient descent, considering specific settings.
result Explicit family of minimizers for the global minimum and a set of degenerate local minima.

Multimodal learning with deep Boltzmann machines (DBMs) is an generative approach to fuse multimodal inputs, and can learn the shared representation via Contrastive Divergence (CD) for classification and information retrieval tasks. However, it is a 2-fan DBM model, and cannot effectively handle multiple prediction tas…

2015-03-26abs ↗pdf ↗

TOQ-Nets learn to recognize complex temporal events with varying objects and sequences.

problem Recognizing complex relational-temporal events with varying numbers of objects and sequence lengths.
method Neuro-symbolic networks with reasoning layers for finite-domain quantification over objects and time.
result TOQ-Nets can generalize to scenarios with more objects than training data and temporal warpings.

Study on the structure of classifier boundaries in DNA sequencing.

problem Understanding the structure of boundaries in a Bayes classifier for DNA sequencing.
method Examined the structure of the boundary in a Bayes classifier applied to DNA sequencing data. Introduced a new measure of uncertainty, Neighbor Similarity.
result The boundary is large and complex, and Neighbor Similarity effectively measures classifier uncertainty.

Although deep reinforcement learning has advanced significantly over the past several years, sample efficiency remains a major challenge. Careful choice of input representations can help improve efficiency depending on the structure present in the problem. In this work, we present an attention-based method to project i…

2019-05-07abs ↗pdf ↗