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

Trend · papers per month

2615227831,044 · Jun 202019922001200920172026
48 results for single network

DNPUs improve neural network performance with high-capacity nanoelectronic nodes.

problem Limited performance of single DNPUs in solving complex classification problems.
method Developed DNPUs as high-capacity neurons and implemented multi-DNPU networks.
result Feed-forward DNPU networks improve single DNPU performance from 77% to 94% test accuracy.

Despite their ability to memorize large datasets, deep neural networks often achieve good generalization performance. However, the differences between the learned solutions of networks which generalize and those which do not remain unclear. Additionally, the tuning properties of single directions (defined as the activa…

2018-03-19abs ↗pdf ↗

New method learns cell trajectories and network interactions from single-cell data.

problem Network inference in systems biology from steady-state data.
method Min-entropy estimation for stochastic dynamics, leveraging both temporal and perturbational data.
result Jointly learns cellular trajectories and network interactions.

In this paper, we introduce transformations of deep rectifier networks, enabling the conversion of deep rectifier networks into shallow rectifier networks. We subsequently prove that any rectifier net of any depth can be represented by a maximum of a number of functions that can be realized by a shallow network with a …

2017-03-30abs ↗pdf ↗

Single gradient step finds adversarial examples in random neural networks.

problem Finding adversarial examples in neural networks with random architectures.
method Gradient descent approach applied to random undercomplete and overcomplete two-layers neural networks.
result A single gradient step is sufficient to find adversarial examples in random neural networks.

The state of the art lung nodule detection studies rely on computationally expensive multi-stage frameworks to detect nodules from CT scans. To address this computational challenge and provide better performance, in this paper we propose S4ND, a new deep learning based method for lung nodule detection. Our approach use…

2018-05-06abs ↗pdf ↗

Single neural networks can match deep ensembles' benefits without the complexity.

problem The effectiveness and necessity of deep ensembles in neural network models.
method Demonstrated limitations of ensemble diversity and OOD performance in deep ensembles compared to a single larger model.
result A single neural network can replicate deep ensembles' benefits in uncertainty quantification and robustness.

A new network controls task execution in a single vision system.

problem Executing multiple tasks accurately and efficiently in a single network.
method A top-down control network modifies main recognition network activations based on selected task, image content, and spatial location.
result Significantly better results on four datasets compared to state-of-the-art approaches.

Single deep model detects out-of-distribution data with single forward pass.

problem Detecting out-of-distribution data points in neural networks.
method Deterministic uncertainty quantification (DUQ) using gradient penalty for reliable detection.
result Single model outperforms or matches ensemble methods in out-of-distribution detection.

Single wide layer followed by a pyramidal structure ensures global convergence in deep networks.

problem Ensuring global convergence in deep neural networks with limited width constraints.
method Proves that a single wide layer followed by a pyramidal structure guarantees global convergence for over-parameterized networks.
result Single wide layer of width NN suffices for global convergence in deep networks with constant-width remaining layers.

Study SGD dynamics in sequence models, revealing training phases and influence of sequence length.

problem Understanding SGD in sequence models like attention networks.
method Derived closed-form population loss and analyzed SGD dynamics for SSI models.
result Two distinct training phases: escape from uninformative initialization and alignment with target subspace.

Despite the superior performance of deep learning in many applications, challenges remain in the area of regression on function spaces. In particular, neural networks are unable to encode function inputs compactly as each node encodes just a real value. We propose a novel idea to address this shortcoming: to encode an …

2018-04-13abs ↗pdf ↗

Overparameterized ensembles don't offer generalization benefits over single large models.

problem Theoretical limitations of ensembles in overparameterized settings.
method Using ensembles of random feature (RF) regressors, the paper clarifies how modern ensembles differ from underparameterized counterparts.
result Infinite ensembles of overparameterized RF regressors become pointwise equivalent to single infinite-width RF regressors, and finite width ensembles converge to single models with the same parameter budget.

A neural network, IHT-Net, improves DOA estimation with sparse arrays.

problem Single-snapshot DOA estimation with sparse arrays in dynamic settings.
method IHT-inspired neural network with recurrent neural network and autoencoders.
result IHT-Net achieves faster convergence and higher accuracy in DOA estimation.

Adding linear layers to ReLU networks favors functions with low mixed variation.

problem Understanding function space bias in overparameterized neural networks.
method Examined a family of networks with varying depths and same capacity but different representation costs, focusing on the effect of adding linear layers to the input side.
result Adding linear layers to shallow ReLU networks results in a bias towards functions with low mixed variation, which can be well approximated by single- or multi-index models.

AuxiLearn combines auxiliary tasks into a single loss function.

problem Improving neural network performance on a main task using auxiliary tasks.
method Implicit differentiation to learn a network that combines auxiliary tasks into a single coherent objective function.
result AuxiLearn consistently outperforms competing methods in various tasks and domains.

TNDE quantifies dynamic gene drivers from single-cell snapshots.

problem Reconstructing time-resolved regulatory effects in biological processes.
method Time-varying Network Driver Estimation (TNDE) using shared graph attention encoder and partial optimal transport.
result TNDE identifies stage-specific driver genes in mouse erythropoiesis.

The instance segmentation problem intends to precisely detect and delineate objects in images. Most of the current solutions rely on deep convolutional neural networks but despite this fact proposed solutions are very diverse. Some solutions approach the problem as a network problem, where they use several networks or …

2019-02-01abs ↗pdf ↗

StrokeCoder uses Transformers to generate images from single examples.

problem Creating diverse images from a single example.
method Transformer Neural Network learns from a single path-based example to generate a set of images.
result The model can generate a large set of deviated images that still represent the original image's style and concept.

SNGP improves single-model deep uncertainty by enhancing distance-awareness.

problem Improving uncertainty estimation in deep learning models, especially for real-time applications.
method SNGP improves distance-awareness of DNNs through spectral normalization and Gaussian process layers.
result SNGP outperforms other single-model approaches in prediction, calibration, and out-of-domain detection.

Lookahead pruning extends single-layer optimization to multi-layer, outperforming magnitude-based pruning.

problem Pruning neural networks to reduce computational cost and memory usage.
method Developed a multi-layer optimization approach extending the single-layer optimization of magnitude-based pruning.
result Consistently outperforms magnitude-based pruning on various networks, especially in high sparsity.

A new method infers graph structure and parameters using a single generative flow network.

problem Bayesian Network structure and parameter inference from data.
method Single GFlowNet with two-phase sampling: DAG generation followed by parameter assignment.
result Accurate approximation of joint posterior distribution over graph structure and parameters.

Neural networks can achieve optimal sample complexity for learning single-index models.

problem Achieving optimal computational-statistical tradeoff in learning Gaussian single-index models.
method Unified gradient-based algorithm for training a two-layer neural network, adaptable to various loss and activation functions.
result Sample complexity of ds/2dd^{s^\star/2} \lor d matches the SQ lower bound up to a polylogarithmic factor.

Study combines speaker verification and voice trigger detection in a single network.

problem Separate training for speaker verification and voice trigger detection.
method Multi-task learning with a single network trained on both tasks.
result Single network achieves comparable accuracy to independent models for each task.

Single neural network learns multiple tasks from combined data.

problem Can a single neural network learn multiple unrelated tasks?
method Investigates how task representations affect joint learning; uses various task encoding methods.
result Single neural network can learn multiple tasks from combined data, even when tasks are unrelated and different.

Single neural network predicts ImageNet model parameters for faster training.

problem Training diverse ImageNet models requires significant resources and time.
method Trained a neural network to predict ImageNet model parameters and used them for initialization.
result Models initialized with predicted parameters converge faster and achieve competitive performance.