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

170339509678 · Jun 202019922001200920172026
48 results for architectural complexity

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 modern neural networks have finite sample complexity in o-minimal structures.

problem Understanding the learnability of modern neural networks in a broad context.
method Analyzing feedforward neural networks definable in o-minimal structures.
result Modern neural networks, including MLPs, CNNs, GNNs, and transformers, have finite sample complexity in the agnostic PAC setting.

Neural Architecture Search methods are effective but often use complex algorithms to come up with the best architecture. We propose an approach with three basic steps that is conceptually much simpler. First we train N random architectures to generate N (architecture, validation accuracy) pairs and use them to train a …

2019-12-02abs ↗pdf ↗

In neural architecture search (NAS), the space of neural network architectures is automatically explored to maximize predictive accuracy for a given task. Despite the success of recent approaches, most existing methods cannot be directly applied to large scale problems because of their prohibitive computational complex…

2019-02-13abs ↗pdf ↗

DNArch learns CNN architectures by backpropagation.

problem Discovering optimal CNN architectures.
method Differentiable Neural Architectures (DNArch) learns CNN architectures by backpropagation, controlling kernel sizes, channels, downsampling positions, and depth.
result DNArch finds performant CNN architectures across various tasks.

A graph VAE framework optimizes neural architectures in a continuous space.

problem Discovering efficient neural architectures in a discrete space.
method Graph VAE framework with VAE and GNN components, joint learning of predictors and decoders.
result The framework discovers powerful neural architectures with both excellent performance and high computational efficiency.

Residual neural networks don't help overcome sampling complexity issues.

problem Learning invertible residual neural networks from samples is hard due to the curse of dimensionality.
method Investigated invertible residual neural networks and their sampling complexity.
result Invertible residual neural networks still suffer from the curse of dimensionality in sampling complexity.

Neural Architecture Search has shown potential to automate the design of neural networks. Deep Reinforcement Learning based agents can learn complex architectural patterns, as well as explore a vast and compositional search space. On the other hand, evolutionary algorithms offer higher sample efficiency, which is criti…

2018-11-24abs ↗pdf ↗

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.

Introduces a framework using information theory for understanding machine learning.

problem Understanding the effectiveness and design of modern machine learning architectures.
method An information-theoretic approach to learning, focusing on model complexity and architecture.
result Successful architectures have a broad complexity range, enabling learning in over-parameterized model classes.

This work explores how neural architecture search can improve adversarial robustness without adversarial training.

problem Improving adversarial robustness of neural networks without adversarial training.
method Experimented with hand-crafted and NAS-based architectures to compare robustness to PGD attacks.
result NAS-based architectures are more robust for small-scale attacks, but hand-crafted architectures are more robust for larger datasets and tasks.

Deep feedforward and recurrent networks have achieved impressive results in many perception and language processing applications. This success is partially attributed to architectural innovations such as convolutional and long short-term memory networks. The main motivation for these architectural innovations is that t…

2015-11-21abs ↗pdf ↗

Optimal transport kernels improve neural architecture search efficiency.

problem Comparing complex neural architectures similarity using Euclidean metric fails.
method Developed a novel discrepancy using tree-Wasserstein (TW) for neural architectures.
result TW-based approaches outperform other methods in sequential and parallel NAS.

Different neural network (NN) architectures have different advantages. Convolutional neural networks (CNNs) achieved enormous success in computer vision, while recurrent neural networks (RNNs) gained popularity in speech recognition. It is not known which type of NN architecture is the best fit for classification of co…

2019-07-15abs ↗pdf ↗

To solve the big topic modeling problem, we need to reduce both time and space complexities of batch latent Dirichlet allocation (LDA) algorithms. Although parallel LDA algorithms on the multi-processor architecture have low time and space complexities, their communication costs among processors often scale linearly wi…

2013-11-17abs ↗pdf ↗

With a view to bridging the gap between deep learning and symbolic AI, we present a novel end-to-end neural network architecture that learns to form propositional representations with an explicitly relational structure from raw pixel data. In order to evaluate and analyse the architecture, we introduce a family of simp…

2019-05-24abs ↗pdf ↗

New framework combines simple machines into complex ones for better neural network performance.

problem Improving neural network performance with limited training data.
method Developed a framework using topology and functional analysis to combine simple machines into complex ones, and used kernel methods to find optimal architectures.
result Kernel-inspired networks can outperform classical neural networks when training data is small.

Tree-based LSTM improves sequential regression with missing data.

problem Regression for variable-length sequential data with missing samples.
method Tree architecture of LSTM networks, selecting LSTM networks based on presence-pattern of previous inputs.
result Significant performance improvements on financial and real-life datasets.

Superior performance and ease of implementation have fostered the adoption of Convolutional Neural Networks (CNNs) for a wide array of inference and reconstruction tasks. CNNs implement three basic blocks: convolution, pooling and pointwise nonlinearity. Since the two first operations are well-defined only on regular-s…

2018-03-06abs ↗pdf ↗

When using reinforcement learning (RL) algorithms to evaluate a policy it is common, given a large state space, to introduce some form of approximation architecture for the value function (VF). The exact form of this architecture can have a significant effect on the accuracy of the VF estimate, however, and determining…

2017-03-03abs ↗pdf ↗

The paper extends the functional geometry of the visual cortex to more complex architectures using contactization and symplectization.

problem Understanding the functional architecture of the visual cortex.
method Contactization and symplectization processes to extend the dimension of the space.
result Extension of the functional geometry of the visual cortex to more complex architectures.

TabNAS improves neural architecture search for tabular datasets by rejecting suboptimal architectures.

problem Finding optimal neural architectures for tabular datasets with resource constraints.
method Develops a reinforcement learning controller motivated by rejection sampling to handle resource constraints.
result TabNAS finds better models that obey resource constraints compared to previous methods.

We explore efficient neural architecture search methods and show that a simple yet powerful evolutionary algorithm can discover new architectures with excellent performance. Our approach combines a novel hierarchical genetic representation scheme that imitates the modularized design pattern commonly adopted by human ex…

2017-11-01abs ↗pdf ↗

Improves stability in hyperbolic neural networks for complex data generation.

problem Numerical instability in hyperbolic neural networks hinders complex architecture development.
method Proposes a novel hyperbolic AE-GAN architecture with stable layers.
result Demonstrates state-of-the-art performance in generating complex data.

When using reinforcement learning (RL) algorithms it is common, given a large state space, to introduce some form of approximation architecture for the value function (VF). The exact form of this architecture can have a significant effect on an agent's performance, however, and determining a suitable approximation arch…

2017-03-23abs ↗pdf ↗

Unified transformer-based LT-TTD improves ranking efficiency and quality.

problem Decoupled L1 and L2 models in recommendation and search systems cause irreversible error propagation and suboptimal ranking.
method LT-TTD combines two-tower models with transformer expressivity in a unified listwise learning framework, providing theoretical guarantees and UPQE evaluation.
result LT-TTD reduces irretrievable relevant items and achieves better global optimization than disjoint training.

New findings on how convolutional architectures approximate time series data.

problem Understanding the approximation properties of convolutional architectures in time series modeling.
method Mathematical analysis of convolutional architectures applied to time series modeling.
result A new definition of spectrum-based regularity for measuring temporal relationships under convolutional approximation.

End-to-end learning refers to training a possibly complex learning system by applying gradient-based learning to the system as a whole. End-to-end learning system is specifically designed so that all modules are differentiable. In effect, not only a central learning machine, but also all "peripheral" modules like repre…

2017-04-26abs ↗pdf ↗

Neural networks have proven to be extremely powerful tools for modern artificial intelligence applications, but computational and storage complexity remain limiting factors. This paper presents two compatible contributions towards reducing the time, energy, computational, and storage complexities associated with multil…

2018-12-04abs ↗pdf ↗