paper-with-me

홈 › Papers

From Learning to Meta-Learning: Reduced Training Overhead and Complexity for Communication Systems

2020-01-05 · Osvaldo Simeone, Sangwoo Park, Joonhyuk Kang

Machine learning methods adapt the parameters of a model, constrained to lie in a given model class, by using a fixed learning procedure based on data or active observations. Adaptation is done on a per-task basis, and retraining is needed when the system configuration changes. The resulting inefficiency in terms of data and training time requirements can be mitigated, if domain knowledge is available, by selecting a suitable model class and learning procedure, collectively known as inductive bias. However, it is generally difficult to encode prior knowledge into an inductive bias, particularly with black-box model classes such as neural networks. Meta-learning provides a way to automatize the selection of an inductive bias. Meta-learning leverages data or active observations from tasks that are expected to be related to future, and a priori unknown, tasks of interest. With a meta-trained inductive bias, training of a machine learning model can be potentially carried out with reduced training data and/or time complexity. This paper provides a high-level introduction to meta-learning with applications to communication systems.

📄 PDF Abstract BibTeX arXiv:2001.01227

Code (1)

kclip/meta-autoencoder 공식 구현 pytorch

Tasks

BIG-bench Machine LearningInductive BiasMeta-Learning

Similar Papers 제목 키워드 기반

On the Semi-Blind Mutually Referenced Equalizers for MIMO Systems

2023-11-01 · Do Hai Son, Karim Abed-Meraim, Tran Trong Duy, Nguyen Linh Trung 외

Minimizing training overhead in channel estimation is a crucial challenge in wireless communication systems. This paper presents an extension of the traditional blind algorithm, called "Mutually referenced equalizers" (M…

On the Linear Speedup Analysis of Communication Efficient Momentum SGD for Distributed Non-Convex Optimization

2019-05-09 · Hao Yu, Rong Jin, Sen yang

Recent developments on large-scale distributed machine learning applications, e.g., deep neural networks, benefit enormously from the advances in distributed non-convex optimization techniques, e.g., distributed Stochast…

BIG-bench Machine Learning

Communication and Computation Reduction for Split Learning using Asynchronous Training

2021-07-20 · Xing Chen, Jingtao Li, Chaitali Chakrabarti

Split learning is a promising privacy-preserving distributed learning scheme that has low computation requirement at the edge device but has the disadvantage of high communication overhead between edge device and server.…

Privacy Preserving

Federated mmWave Beam Selection Utilizing LIDAR Data

2021-02-04 · Mahdi Boloursaz Mashhadi, Mikolaj Jankowski, Tze-Yang Tung, Szymon Kobus 외

Efficient link configuration in millimeter wave (mmWave) communication systems is a crucial yet challenging task due to the overhead imposed by beam selection. For vehicle-to-infrastructure (V2I) networks, side informati…

Local AdaAlter: Communication-Efficient Stochastic Gradient Descent with Adaptive Learning Rates

2019-11-20 · Cong Xie, Oluwasanmi Koyejo, Indranil Gupta, Haibin Lin

When scaling distributed training, the communication overhead is often the bottleneck. In this paper, we propose a novel SGD variant with reduced communication and adaptive learning rates. We prove the convergence of the…