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

103205308410 · Jun 202019922001200920172026
48 results for Fewer Parameters

Capsule networks improve performance on image classification tasks with fewer parameters.

problem Improving performance of capsule networks with fewer parameters.
method Inverted dot-product attention routing, Layer Normalization, concurrent iterative routing.
result Improves performance on benchmark datasets CIFAR-10 and CIFAR-100, and performs at-par with ResNet-18.

DP-SGD can update fewer coordinates while maintaining privacy.

problem How to update fewer coordinates in DP-SGD without losing optimization signal.
method TP-TopK (Two-Phase TopK DP-SGD), a two-phase method for coordinate-sparse private training.
result Private training can update fewer coordinates without losing optimization signal, scaling noise with active dimension \(k\) instead of full dimension \(d\).

Improved NLP performance with fewer parameters and less data using conditional multi-task learning.

problem Challenges in transferring knowledge across different NLP tasks, including overfitting, forgetting, and negative transfer.
method Proposes a novel Transformer architecture with conditional attention and task-conditioned modules for efficient parameter sharing and mitigating forgetting.
result Achieves state-of-the-art performance on 26 NLP tasks with 66% less data and 50% fewer parameters compared to existing methods.

We describe a simple neural language model that relies only on character-level inputs. Predictions are still made at the word-level. Our model employs a convolutional neural network (CNN) and a highway network over characters, whose output is given to a long short-term memory (LSTM) recurrent neural network language mo…

2015-08-26abs ↗pdf ↗

RDL-Net improves speech enhancement with fewer parameters and better performance.

problem Improving speech enhancement with fewer parameters and better performance.
method Proposes RDL-Net, a CNN combining residual and dense aggregations without over-allocating parameters.
result RDL-Net achieves higher speech enhancement performance with fewer parameters and lower computational requirements.

Bonsai-Net efficiently discovers state-of-the-art models with fewer parameters.

problem Efficiently discovering state-of-the-art neural architectures with minimal computational expense.
method Bonsai-Net uses a modified differential pruner to explore a relaxed search space.
result Bonsai-Net consistently discovers better architectures than random search with fewer parameters.

Neural networks fit fewer samples than their parameters suggest in practice.

problem Understanding the practical limitations of neural network flexibility.
method Examination of neural network optimization, parameter efficiency, and loss surfaces.
result Neural networks can only fit training sets with significantly fewer samples than their parameters suggest.

Pixel-space diffusion models outperform latent models on high-resolution image synthesis.

problem Efficiency and quality trade-off in high-resolution image synthesis.
method Sigmoid loss-weighting, simplified architecture, and resolution scaling.
result Achieved 1.5 FID on ImageNet512, new SOTA results on other datasets.

Recently, deep neural networks (DNNs) have been regarded as the state-of-the-art classification methods in a wide range of applications, especially in image classification. Despite the success, the huge number of parameters blocks its deployment to situations with light computing resources. Researchers resort to the re…

2017-12-15abs ↗pdf ↗

Study shows DNNs can recover functions with fewer samples than model parameters at overparameterization.

problem Determining reliable function recovery in overparameterized deep neural networks.
method Introducing 'local linear recovery' (LLR) and proving upper bounds on sample sizes for recovery.
result Upper bounds on optimistic sample sizes for function recovery in overparameterized DNNs are achieved.

3D convolutional neural networks are difficult to train because they are parameter-expensive and data-hungry. To solve these problems we propose a simple technique for learning 3D convolutional kernels efficiently requiring less training data. We achieve this by factorizing the 3D kernel along the temporal dimension, r…

2019-12-09abs ↗pdf ↗

BayesSum improves Bayesian quadrature for discrete domains, requiring fewer samples.

problem Estimating intractable expectations over discrete domains.
method BayesSum is a Bayesian quadrature extension for discrete domains, leveraging prior information through Gaussian processes.
result BayesSum requires fewer samples than Monte Carlo, achieving faster convergence rates.

Study improves fractional posterior for 1-bit matrix completion.

problem Estimating a binary matrix from observed entries.
method Fractional posterior approach with low-rank factorization and spectral scaled Student priors.
result Concentration results for fractional posterior, demonstrating effectiveness in matrix recovery.

BaM improves BBVI by optimizing a score-based divergence, leading to faster convergence.

problem Slow convergence of black-box variational inference methods.
method Batch and match (BaM) approach based on a score-based divergence.
result BaM converges exponentially quickly to the target mean and covariance.

New method finds smaller networks with similar performance to large models in fewer epochs.

problem Training large neural networks is computationally expensive and energy-intensive.
method Use PCA to identify a basis of hidden layer activations and reduce network parameters.
result Principal Component Networks (PCNs) can train faster and use less energy than overparameterized models without accuracy loss.

Quaternion Conformer GAN (QC-GAN) is a parameter-efficient speech enhancement framework that combines a Quaternion Conformer generator with MetricGAN-based training.

problem Speech Enhancement
method Quaternion Conformer GAN
result Achieved a PESQ score of 3.48 with 0.89M parameters, comparable to state-of-the-art models at less than half their size.

Over the last few years, graph autoencoders (AE) and variational autoencoders (VAE) emerged as powerful node embedding methods, with promising performances on challenging tasks such as link prediction and node clustering. Graph AE, VAE and most of their extensions rely on multi-layer graph convolutional networks (GCN) …

2020-01-21abs ↗pdf ↗

Kernelised flows improve density estimation and generation with fewer parameters.

problem Limited expressiveness of flow-based models due to invertibility constraints.
method Integrates kernels into normalising flows to enhance expressiveness and efficiency.
result Kernelised flows outperform neural network-based flows in parameter efficiency and low-data scenarios.

Fewer data weight updates lead to faster convergence in machine learning models.

problem Improving robustness of machine learning models through data mixing.
method Analyzing convergence behavior of data mixing with a finite number of inner steps.
result The optimal number of inner steps scales with the budget and type of gradients used.

We show how the success of deep learning could depend not only on mathematics but also on physics: although well-known mathematical theorems guarantee that neural networks can approximate arbitrary functions well, the class of functions of practical interest can frequently be approximated through "cheap learning" with …

2016-08-29abs ↗pdf ↗

Proposes a neural network for efficient imbalance electricity price forecasting.

problem Accurate and efficient imbalance electricity price forecasting in industrial energy trading systems.
method Market-rule-informed neural network framework.
result The proposed model achieves competitive forecasting performance with fewer parameters and shorter training time.

Adjoined Networks trains both base and compressed networks together for efficient model compression.

problem Efficiently compressing deep neural networks while maintaining accuracy.
method Adjoined Networks (AN) trains both a base network and a smaller compressed network simultaneously, sharing parameters.
result AN achieves 71.8% top-1 accuracy with 1.8M parameters and 1.6 GFLOPs on ImageNet.

Investigates ways to train larger models with fewer resources, finding that test loss depends only on the actual number of trainable parameters.

problem Training larger models for cheaper under hardware constraints.
method Emulates an increase in effective parameters using frozen random parameters or fast structured transforms.
result Scaling laws cannot be deceived by spurious parameters; test loss depends only on the actual number of trainable parameters.

Transformers can efficiently approximate nonparametric regression with minimal parameters and sequences.

problem Efficiently approximating nonparametric regression functions with transformers.
method Kernel-weighted polynomial basis and gradient descent.
result Achieves minimax optimal rate of convergence with fewer parameters and sequences.

This paper addresses parameter estimation for wave equations with Markovian switching.

problem Parameter estimation for wave equations with abrupt changes.
method Bayesian statistical framework using discrete sparse Bayesian learning.
result Strong performance in parameter estimation for variable coefficient PDEs.

New method improves image denoising with fewer parameters and less data.

problem Image denoising requires large datasets and supervised settings, limiting practical applications.
method Self-supervised framework using Tucker low-rank tensor approximation.
result Improves model generalizability and reduces data acquisition costs.

Active learning method reduces labeling cost for regression models with aggregated data.

problem Reducing labeling cost for training regression models with aggregated data.
method Sequentially selects sets to be labeled using mutual information quantifying model parameter uncertainty.
result Achieves better predictive performance with fewer labeled sets.

Probabilistic modeling enables combining domain knowledge with learning from data, thereby supporting learning from fewer training instances than purely data-driven methods. However, learning probabilistic models is difficult and has not achieved the level of performance of methods such as deep neural networks on many …

2017-05-15abs ↗pdf ↗

Neural models for NLP typically use large numbers of parameters to reach state-of-the-art performance, which can lead to excessive memory usage and increased runtime. We present a structure learning method for learning sparse, parameter-efficient NLP models. Our method applies group lasso to rational RNNs (Peng et al.,…

2019-09-06abs ↗pdf ↗

There exist various types of network block models such as the Stochastic Block Model (SBM), the Degree Corrected Block Model (DCBM), and the Popularity Adjusted Block Model (PABM). While this leads to a variety of choices, the block models do not have a nested structure. In addition, there is a substantial jump in the …

2020-02-07abs ↗pdf ↗