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

4579141,3701,827 · Jun 202019922001200920172026
48 results for Efficient Parameter Learning

FiT combines transfer and meta-learning for efficient few-shot image classification.

problem Few-shot image classification in personalized and federated learning settings.
method Combines transfer learning and meta-learning with fixed pretrained backbones and fine-tuned FiLM adapter layers.
result Achieves state-of-the-art accuracy on VTAB-1k benchmark with fewer than 1% of updateable parameters.

KM method reduces ConvNet parameters to 9% higher accuracy with minimal additional memory.

problem Expensive memory usage for training ConvNets on embedded devices.
method Kernel Modulation (KM) method that adapts all network parameters for each task.
result KM delivers up to 9% higher accuracy than other parameter-efficient methods.

CAM-GAN improves GANs for continual learning with efficient feature map transformations.

problem Efficient continual learning for GANs with reduced parameter growth.
method Designing and leveraging parameter-efficient feature map transformations, including global and task-specific parameters, residual bias, and Fisher information matrix.
result Significantly improved model performance and high-quality samples with fewer parameters.

Adaptive multi-domain learning reduces parameter count for efficient deep learning.

problem Different domains have varying complexity, leading to inefficient model training.
method Proposes adaptive parameterization to reduce model complexity without sacrificing performance.
result Efficient multi-domain learning solutions with far fewer parameters.

Efficiently learns deep factor graphs using Gaussian belief propagation.

problem Learning in deep factor graphs with efficient inference.
method Treats all relevant quantities as random variables, uses belief propagation for inference.
result Efficiently solves training and prediction problems in deep factor graphs with belief propagation.

Efficiently models learning curves using Gaussian processes with latent Kronecker structure.

problem Joint modeling of machine learning model performance across hyper-parameters and training progress.
method Imposes latent Kronecker structure to leverage efficient product kernels and handle missing values.
result Matches the performance of a Transformer on a learning curve prediction task.

We propose reinforcement learning on simple networks consisting of random connections of spiking neurons (both recurrent and feed-forward) that can learn complex tasks with very little trainable parameters. Such sparse and randomly interconnected recurrent spiking networks exhibit highly non-linear dynamics that transf…

2019-06-04abs ↗pdf ↗

To keep up with increasing dataset sizes and model complexity, distributed training has become a necessity for large machine learning tasks. Parameter servers ease the implementation of distributed parameter management---a key concern in distributed training---, but can induce severe communication overhead. To reduce c…

2020-02-03abs ↗pdf ↗

A new FL algorithm reduces communication overhead by selectively updating model parameters.

problem Data heterogeneity and communication overhead in federated learning.
method Uses age of information metric to selectively update model parameters and group clients with similar data.
result Our method can expedite training and surpass other communication-efficient strategies in efficiency.

Proposes efficient model for continual learning that grows model over task-specific parameters.

problem Limited transfer learning ability and forgetting of earlier knowledge in existing methods.
method Filter and channel expansion method that grows model over previous task parameters.
result Better knowledge transfer and improved performance in task incremental learning.

We introduce a new embarrassingly parallel parameter learning algorithm for Markov random fields with untied parameters which is efficient for a large class of practical models. Our algorithm parallelizes naturally over cliques and, for graphs of bounded degree, its complexity is linear in the number of cliques. Unlike…

2013-08-29abs ↗pdf ↗

Efficiently estimate Boolean product distribution parameters from truncated samples.

problem Estimating parameters of Boolean product distributions from truncated samples.
method Introducing fatness of truncation set, using membership queries, and adapting Stochastic Gradient Descent.
result Efficiently learn Boolean product distributions from truncated samples with small sample complexity.

Investigates optimal parameter allocation in Transformers for efficiency and expressivity.

problem Balancing expressivity and efficiency in Transformer model parameters.
method Mathematical analysis and theoretical characterization of attention heads and head dimensions.
result Later layers can operate more efficiently with reduced parameters due to saturation of softmax activations.

Efficiently learns exponential family distributions with i.i.d. samples.

problem Learning natural parameters of truncated exponential families efficiently.
method Proposes a novel loss function and computationally efficient estimator.
result Achieves optimal sample complexity and asymptotic normality.

Unified Bayesian Optimization framework for model selection balancing effectiveness and training efficiency.

problem Balancing model effectiveness and training efficiency in machine learning model selection.
method Proposes a unified Bayesian Optimization framework to jointly optimize model effectiveness and training efficiency.
result Models selected using the proposed framework significantly improve training efficiency while maintaining strong effectiveness.

Efficient estimators for smooth Hilbert-valued parameters with theoretical guarantees.

problem Estimating smooth Hilbert-valued parameters with theoretical guarantees.
method Pathwise differentiable Hilbert-valued parameters, efficient influence functions, regularized one-step estimators.
result Theoretical guarantees for efficient estimators even when nuisance functions are arbitrary.

Generalizes conformal prediction to multiple learnable parameters for efficient prediction sets.

problem Learning valid and efficient prediction sets with low-capacity function classes.
method Constrained empirical risk minimization (ERM) with gradient-based optimization of differentiable surrogate losses and Lagrangians.
result Achieves approximate valid population coverage and near-optimal efficiency within class.

Transformer learns to estimate negative binomial parameters efficiently.

problem Parameter estimation for over-dispersed count data in large screens.
method Pre-trained transformer trained on synthetic data generation to invert parameter to count transformation.
result Method of moments provides faster, more efficient, and better-calibrated estimates.

Meta-learning adjusts TD learning's eligibility trace parameter for more efficient reinforcement learning.

problem Efficiently tuning the eligibility trace parameter for temporal difference learning.
method Meta-learning method to adjust eligibility trace parameter state-dependently.
result Improves overall quality of update targets, minimizing target error.

This work improves communication efficiency in federated learning over wireless networks by optimizing energy consumption.

problem Optimizing energy consumption in federated learning over wireless networks.
method Adopting SignSGD for gradient sign exchange, considering channel capacity with outage, and proposing a stochastic sign-based algorithm for uneven data distribution.
result Proposed methods achieve a balance between learning performance and energy consumption.

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.

Soft modularization improves sample efficiency and performance in reinforcement learning.

problem Challenges in training multiple tasks jointly in reinforcement learning.
method Explicit modularization technique on policy representation, soft modularization method.
result Improves sample efficiency and performance over strong baselines in robotics manipulation tasks.

Fine-tuning large language models requires minimal data, making them efficient.

problem Achieving state-of-the-art performance with large language models.
method Using BERT as an example, fine-tuning only the most critical layers of the pre-trained model.
result Fine-tuned models are close in parameter space to the pre-trained model, with many good solutions found in sparsified versions.

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.

PAC-Bayes theory improves ICP efficiency and coverage.

problem Inefficient and unreliable uncertainty estimates in deep learning models.
method PAC-Bayes theory to optimize model and score function parameters for efficient and reliable prediction sets.
result Generalization bounds on coverage and efficiency of optimized prediction sets.

Topological data analysis and its main method, persistent homology, provide a toolkit for computing topological information of high-dimensional and noisy data sets. Kernels for one-parameter persistent homology have been established to connect persistent homology with machine learning techniques. We contribute a kernel…

2018-09-26abs ↗pdf ↗

Machine learning identifies boundaries of real solutions in polynomial systems.

problem Locating boundaries in parameter space for real solutions of polynomial systems.
method Supervised machine learning approach using nearest neighbor and deep learning approximations.
result Efficiently approximates the real discriminant locus for multidimensional parameter spaces.

New method uses low-fidelity simulations to efficiently infer parameters of high-fidelity models.

problem Challenges in inferring parameters of computationally expensive high-fidelity models.
method Multifidelity simulation-based inference using transfer learning and adaptive selection of high-fidelity parameters.
result Significant reduction in the number of high-fidelity simulations required for inference.