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

192385577769 · Jun 202019922001200920172026
48 results for Distributed Architecture

NADS improves OoD detection accuracy by 57%.

problem Uncertainty in machine learning models when encountering out-of-distribution data.
method NADS searches for a distribution of architectures that perform well on a given task, optimizing a stochastic OoD detection objective.
result NADS achieves up to 57% improvement in accuracy over state-of-the-art methods.

This work maps Boltzmann distributions to ARNNs for better physics-based model approximations.

problem Approximating Boltzmann distributions of binary systems.
method Exact mapping of Boltzmann distribution to autoregressive neural network architecture.
result New ARNN architectures derived from physical models show superior performance.

The paper proposes a neural network architecture inspired by Langevin Monte Carlo for sampling from target distributions.

problem Sampling from complex target distributions efficiently.
method A neural network architecture inspired by Langevin Monte Carlo is proposed to map samples from a simple reference distribution to samples from the target.
result The proposed neural network architecture achieves approximation rates in the Wasserstein-2 distance for smooth, log-concave target distributions.

This work proposes searching for optimal operation distribution in neural architecture search.

problem Finding optimal neural architecture with specific operations and connections.
method Search for the optimal operation distribution, providing a stochastic and approximate solution.
result Operation distribution holds enough discriminating power to reliably identify a solution and is easier to optimise than traditional encodings.

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.

This study evaluates different normalizing flow architectures for MCMC.

problem Lack of systematic comparison of normalizing flow architectures in MCMC.
method Extensive evaluation of various normalizing flow architectures on different MCMC methods and target distributions.
result Contractive residual flows are the best general-purpose models for MCMC.

DrNAS improves neural architecture search with Dirichlet distribution and progressive learning.

problem Efficiently search for neural architectures with improved generalization and exploration.
method Formulates architecture search as a distribution learning problem using Dirichlet distribution and gradient-based optimization. Introduces a progressive learning scheme to handle large-scale tasks.
result Achieves state-of-the-art results on CIFAR-10 and ImageNet, demonstrating improved generalization and exploration.

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 ↗

This paper describes a reference architecture for self-maintaining systems that can learn continually, as data arrives. In environments where data evolves, we need architectures that manage Machine Learning (ML) models in production, adapt to shifting data distributions, cope with outliers, retrain when necessary, and …

2019-03-12abs ↗pdf ↗

Conventional Neural Architecture Search (NAS) aims at finding a single architecture that achieves the best performance, which usually optimizes task related learning objectives such as accuracy. However, a single architecture may not be representative enough for the whole dataset with high diversity and variety. Intuit…

2018-11-26abs ↗pdf ↗

Wide and Deep GNN learns from distributed graphs and retrain online.

problem Decentralized graph support changes over time, causing mismatch between training and testing graphs.
method Wide and Deep GNN architecture with distributed online learning.
result Convergence guarantees for online retraining of the wide part of the GNN.

The emergence of neural architecture search (NAS) has greatly advanced the research on network design. Recent proposals such as gradient-based methods or one-shot approaches significantly boost the efficiency of NAS. In this paper, we formulate the NAS problem from a Bayesian perspective. We propose explicitly estimati…

2019-06-23abs ↗pdf ↗

Sparse transformer architecture improves accuracy and speed in generative modeling and inverse problems.

problem Improving accuracy and speed in generative modeling and inverse problems.
method Proposes a sparse transformer architecture using regularized Wasserstein proximal operator with L1L_1 prior.
result Sparse transformer achieves higher accuracy and faster convergence than classical methods.

We propose Stochastic Neural Architecture Search (SNAS), an economical end-to-end solution to Neural Architecture Search (NAS) that trains neural operation parameters and architecture distribution parameters in same round of back-propagation, while maintaining the completeness and differentiability of the NAS pipeline.…

2018-12-24abs ↗pdf ↗

Study reveals how neural network architectures bias their learning based on feature directions.

problem Understanding how neural network architectures bias their learning based on feature directions.
method Defined neural anisotropy directions (NADs) to encapsulate the directional inductive bias of architectures and provided an efficient method to identify them.
result NADs characterize the features used by CNNs to discriminate between different classes for the CIFAR-10 dataset.

Study shows LLMs can extrapolate rules from out-of-distribution prompts.

problem Understanding LLMs' ability to generalize from unexpected inputs.
method Formal languages and rule-based scenarios to evaluate LLMs' OOD behavior.
result LLMs can extrapolate rules from out-of-distribution prompts, even in complex scenarios.

Researchers analyze neural process architectures and their representational capacities.

problem Understanding what functions can be represented by different neural process architectures.
method Analyzing four types of neural process architectures: CNPs, ANPs, TNPs, and their latent variants.
result Prove these architectures form a strict hierarchy and characterize their representational capabilities.

This paper distills Bayesian posterior expectations for deep neural networks.

problem Improving deep neural network performance and uncertainty quantification.
method Develops a framework for distilling expectations from Bayesian posterior distributions using Monte Carlo samples.
result The framework successfully distills posterior predictive distribution and expected entropy.

New neural network models extreme value distributions with preserved shape constraints.

problem Modeling multivariate extreme value distributions with preserved shape constraints.
method d-max-decreasing neural network architecture for non-parametric calibration and generation of MEVs.
result The proposed architecture approximates the dependence structure of MEVs at parametric rate and preserves essential shape constraints.

Theoretical study on how model architecture affects contrastive learning performance.

problem Understanding the role of model architecture in self-supervised learning.
method Theoretical analysis of contrastive learning, focusing on model capacity and clustering structures.
result Contrastive representations have lower dimensionality than the number of clusters in the data distribution.

FedNAS automates federated learning by searching for better architectures.

problem Non-I.I.D. data makes predefined model architectures suboptimal.
method Federated Neural Architecture Search (FedNAS) for collaborative architecture optimization.
result FedNAS searches for better architectures that outperform predefined models.

This study analyzes NAS benchmarks and finds that only a subset of operations is crucial for generating high-performing architectures.

problem NAS benchmarks lack generability and provide skewed performance distributions, leading to unreliable comparisons.
method Empirical analysis of widely used NAS benchmarks (101, 201, TransNAS-Bench-101) focusing on operation importance and generability.
result Only a subset of operations is necessary to generate architectures close to the upper-bound performance range, and convolution layers have the highest impact.

This research proves guarantees on sequence models' generalization to longer and novel sequences.

problem Generalization to longer sequences and novel token combinations in sequence models.
method Provable guarantees on length and compositional generalization for various sequence models.
result Limited capacity models achieve both length and compositional generalization with diverse training distributions.

In this paper we propose a Bayesian method for estimating architectural parameters of neural networks, namely layer size and network depth. We do this by learning concrete distributions over these parameters. Our results show that regular networks with a learnt structure can generalise better on small datasets, while f…

2019-01-14abs ↗pdf ↗

Not all neural network architectures are created equal, some perform much better than others for certain tasks. But how important are the weight parameters of a neural network compared to its architecture? In this work, we question to what extent neural network architectures alone, without learning any weight parameter…

2019-06-11abs ↗pdf ↗

FiGS searches over a larger space of architectures for efficient mobile models.

problem Designing small, efficient deep networks for mobile devices.
method Differentiable search method using sparse regularization and Logistic-Sigmoid distribution.
result FiGS produces state-of-the-art parameter-efficient models on ImageNet and improves object detection performance.

In-network learning outperforms Federated and Split learning in wireless networks.

problem Efficiently using distributed features for inference in wireless networks.
method Proposes 'in-network learning' architecture, uses neural networks for optimization, compares with Federated and Split learning.
result In-network learning offers better accuracy and bandwidth savings.

LeJEPA provides a scalable, theory-driven approach to self-supervised learning.

problem Lack of practical guidance and theory in JEPAs.
method Identified optimal Gaussian distribution and introduced SIGReg objective.
result LeJEPA achieves state-of-the-art performance with minimal hyperparameters and heuristics.

Can we use deep learning to predict when deep learning works? Our results suggest the affirmative. We created a dataset by training 13,500 neural networks with different architectures, on different variations of spiral datasets, and using different optimization parameters. We used this dataset to train task-independent…

2019-06-04abs ↗pdf ↗

Evidential Softmax preserves multimodality in sparse probability distributions for generative models.

problem Sparse probability distributions in deep generative models make exact marginalization computationally intractable.
method Introduce ev-softmax, a sparse normalization function that preserves multimodality and can be trained with probabilistic loss functions.
result ev-softmax outperforms existing techniques in distributional accuracy and dimensionality reduction.

We study the problem of learning conditional generators from noisy labeled samples, where the labels are corrupted by random noise. A standard training of conditional GANs will not only produce samples with wrong labels, but also generate poor quality samples. We consider two scenarios, depending on whether the noise m…

2018-11-08abs ↗pdf ↗

The effective application of neural networks in the real-world relies on proficiently detecting out-of-distribution examples. Contemporary methods seek to model the distribution of feature activations in the training data for adequately distinguishing abnormalities, and the state-of-the-art method uses Gaussian distrib…

2020-01-15abs ↗pdf ↗

This paper develops a new neural network architecture for modeling spatial distributions (i.e., distributions on R^d) which is computationally efficient and specifically designed to take advantage of the spatial structure of limit order books. The new architecture yields a low-dimensional model of price movements deep …

2016-01-08abs ↗pdf ↗

Transformers show better in-context learning resilience under distribution shifts than simple MLPs.

problem Understanding in-context learning under varying distribution shifts.
method Comparing transformers and set-based MLPs on linear regression tasks.
result Transformers better emulate OLS performance and exhibit better resilience to mild distribution shifts.

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 ↗