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

Trend · papers per month

74148221295 · Jun 202019922001200920172026
48 results for composable architecture

Differentiable Algorithm Networks (DAN) enable composable robot learning.

problem Training robots to learn from limited data and imperfect models.
method Composable architecture of neural network modules, each encoding a differentiable robot algorithm and model, trained end-to-end from data.
result DAN modules adapt to one another and compensate for imperfect models and algorithms, achieving best overall system performance.

A new language for neural architecture search decouples search spaces and algorithms.

problem Current neural architecture search methods are limited to specific use-cases and lack general-purpose constructs.
method Proposes a formal language for encoding search spaces over general computational graphs, allowing modular, composable, and reusable encodings.
result The language enables easy experimentation with different search spaces and algorithms without reinventing the wheel.

Research has shown that widely used deep neural networks are vulnerable to carefully crafted adversarial perturbations. Moreover, these adversarial perturbations often transfer across models. We hypothesize that adversarial weakness is composed of three sources of bias: architecture, dataset, and random initialization.…

2018-12-04abs ↗pdf ↗

A framework for designing and evaluating new GCN variants.

problem Designing and evaluating new graph convolutional network (GCN) variants.
method Propose a framework to compose networks using building blocks of GCN.
result Several newly composed variants are useful alternatives and competitive with original GCNs.

Choosing appropriate architectures and regularization strategies for deep networks is crucial to good predictive performance. To shed light on this problem, we analyze the analogous problem of constructing useful priors on compositions of functions. Specifically, we study the deep Gaussian process, a type of infinitely…

2014-02-24abs ↗pdf ↗

Efficient neural networks compute various differential operators cheaply.

problem Efficient computation of higher time complexity differential operators.
method Restricted neural network architectures with diagonal and hollow Jacobian matrices, allowing efficient extraction of dimension-wise derivatives.
result Demonstrated efficient computation of differential operators for various applications.

Transformer architecture struggles with complex tasks due to limitations in function composition.

problem Transformer architecture's limitations in handling complex tasks.
method Used Communication Complexity to prove limitations in composing functions.
result Transformer layer is incapable of handling large domain functions, even when domains are small.

HMCNAS generates competitive neural architectures without human-defined parameters.

problem Lack of human-defined parameters in Neural Architecture Search.
method Combines Hidden Markov Chains and Bayesian Optimization for autonomous search space generation and competitive model generation.
result HMCNAS generates competitive models in a short time without human-defined parameters.

Artificial neural networks typically have a fixed, non-linear activation function at each neuron. We have designed a novel form of piecewise linear activation function that is learned independently for each neuron using gradient descent. With this adaptive activation function, we are able to improve upon deep neural ne…

2014-12-21abs ↗pdf ↗

Study reduces NAS search cost by generating multiple complex architectures in one shot.

problem Finding multiple neural architectures with varying complexities efficiently.
method Uses importance sampling to generate and update multiple distributions of architectures.
result Reduces search cost by finding multiple architectures with different complexities in a single search.

New findings show disentangled latent representations are not enough for robust compositional generalization.

problem Deep learning models struggle with compositional generalization, especially in out-of-distribution samples.
method Investigated a 2D Gaussian generation task with fully disentangled inputs, then forced disentangled latent representations into full-dimensional output space.
result Forcing disentangled latent representations into full-dimensional output space enables robust compositional generalization.

A new complexity measure for neural networks improves upon classical methods.

problem Lack of a refined complexity measure for comparing different neural network architectures, especially permutation-invariant ones.
method Introduced an equivalence relation among linear functions and counted them relative to this relation.
result The new complexity measure clearly distinguishes between different models and increases exponentially with depth.

Recurrent neural networks (RNNs) are powerful architectures to model sequential data, due to their capability to learn short and long-term dependencies between the basic elements of a sequence. Nonetheless, popular tasks such as speech or images recognition, involve multi-dimensional input features that are characteriz…

2018-06-12abs ↗pdf ↗

Mathematical reasoning---a core ability within human intelligence---presents some unique challenges as a domain: we do not come to understand and solve mathematical problems primarily on the back of experience and evidence, but on the basis of inferring, learning, and exploiting laws, axioms, and symbol manipulation ru…

2019-04-02abs ↗pdf ↗

Recurrent neural networks (RNNs) are notoriously difficult to train. When the eigenvalues of the hidden to hidden weight matrix deviate from absolute value 1, optimization becomes difficult due to the well studied issue of vanishing and exploding gradients, especially when trying to learn long-term dependencies. To cir…

2015-11-20abs ↗pdf ↗

New approach learns causally disentangled latent structures in generative models.

problem Fundamental tension between expressivity and structure in latent structure learning.
method Added a context module to an arbitrarily complex model to learn causally disentangled concepts.
result Causally disentangled representations can be composed for out-of-distribution generation.

Sentinel improves time series forecasting by modeling both temporal and channel dependencies.

problem Limited effectiveness of existing transformer-based architectures in multivariate time-series forecasting.
method Proposes Sentinel, a full transformer-based architecture with multi-patch attention mechanism.
result Sentinel achieves better or comparable performance compared to state-of-the-art approaches.

Improved code translation by preserving structure with composed fine-tuning.

problem Improving code translation accuracy with unlabeled code outputs.
method Pre-trained denoiser to capture output structure, composed fine-tuning to fine-tune predictor.
result Composed fine-tuning significantly improves generalization over standard fine-tuning.

FinRL-X unifies trading components for AI and rule-based strategies.

problem Inconsistent between research and live deployment in trading platforms.
method Modular architecture integrating data processing, strategy construction, backtesting, and execution.
result Unified protocol supports AI and rule-based trading components without altering execution.

Method transfers knowledge without label overlap, source data, or target architecture consistency.

problem Difficulties in transfer learning due to label mismatch, restricted source data, and specialized target architectures.
method Uses deep generative models in two stages: pseudo pre-training and pseudo semi-supervised learning.
result Outperforms scratch training and knowledge distillation methods.

In this paper, we explicitly construct the Calabi composition of multiple affine hyperspheres possibly including some points viewing as 0-dimensional hypersheres. Then we compute all the basic affine invariants of the composed affine hyperspheres, proving that the composed affine hypersphere is symmetric one if and onl…

2013-10-18abs ↗pdf ↗

NAS improves gliomas segmentation on MRI scans.

problem Designing optimal deep learning architectures for brain tumor segmentation.
method Neural architecture search with probabilistic parameter learning for MRI brain tumor segmentation.
result Two optimal neural architectures for brain tumor segmentation were discovered.

We present a new model, Predictive State Recurrent Neural Networks (PSRNNs), for filtering and prediction in dynamical systems. PSRNNs draw on insights from both Recurrent Neural Networks (RNNs) and Predictive State Representations (PSRs), and inherit advantages from both types of models. Like many successful RNN archi…

2017-05-25abs ↗pdf ↗

The use of distributions and high-level features from deep architecture has become commonplace in modern computer vision. Both of these methodologies have separately achieved a great deal of success in many computer vision tasks. However, there has been little work attempting to leverage the power of these to methodolo…

2015-11-13abs ↗pdf ↗

This work proposes a method to compose visual relations more faithfully.

problem Composing relations between objects in images is challenging due to their entanglement.
method Represent each relation as an unnormalized density (energy-based model) to compose relations factorizedly.
result The proposed method generates and edits scenes with multiple sets of relations more faithfully.

NAS-Navigator automates neural network architecture search with visual steering.

problem Difficulty in configuring large neural networks efficiently.
method Formulates architecture optimization as graph space exploration, trains all candidate architectures in one-shot.
result Allows analysts to effectively select and guide the search for optimal neural network architectures.

A simple CNN architecture outperforms complex ones in P300 detection.

problem Efficiently detecting P300 component from EEG signals.
method Used a simple CNN architecture with a single depthwise separable 1D convolutional layer followed by a fully connected Sigmoid neuron.
result A single depthwise separable 1D convolutional layer with four filters achieved competitive performance.

New CNN architecture improves pediatric image segmentation by homogenizing pose and size.

problem Challenges in segmenting pediatric images due to pose and size heterogeneity.
method Spatial Transformer Network (STN) for pose and scale invariance, combined with UNet for segmentation.
result Improved pediatric segmentation, especially renal tumor delineation, with accelerated processing.

While convolutional neural networks (CNNs) have recently made great strides in supervised classification of data structured on a grid (e.g. images composed of pixel grids), in several interesting datasets, the relations between features can be better represented as a general graph instead of a regular grid. Although re…

2018-10-31abs ↗pdf ↗