Over-the-Air Computation for 6G: Foundations, Technologies, and Applications
The rapid advancement of artificial intelligence technologies has given rise to diversified
intelligent services, which place unprecedented demands on massive connectivity and …
intelligent services, which place unprecedented demands on massive connectivity and …
Recent advances in DC programming and DCA
T Pham Dinh, HA Le Thi - Transactions on computational intelligence XIII, 2014 - Springer
Difference of Convex functions (DC) Programming and DC Algorithm (DCA) constitute the
backbone of Nonconvex Programming and Global Optimization. The paper is devoted to the …
backbone of Nonconvex Programming and Global Optimization. The paper is devoted to the …
Federated learning via over-the-air computation
The stringent requirements for low-latency and privacy of the emerging high-stake
applications with intelligent devices such as drones and smart vehicles make the cloud …
applications with intelligent devices such as drones and smart vehicles make the cloud …
Federated learning via intelligent reflecting surface
Over-the-air computation (AirComp) based federated learning (FL) is capable of achieving
fast model aggregation by exploiting the waveform superposition property of multiple-access …
fast model aggregation by exploiting the waveform superposition property of multiple-access …
Infrared Small Target Detection via Non-Convex Rank Approximation Minimization Joint l2,1 Norm
To improve the detection ability of infrared small targets in complex backgrounds, a novel
method based on non-convex rank approximation minimization joint l 2, 1 norm (NRAM) was …
method based on non-convex rank approximation minimization joint l 2, 1 norm (NRAM) was …
DC programming and DCA: thirty years of developments
HA Le Thi, T Pham Dinh - Mathematical Programming, 2018 - Springer
The year 2015 marks the 30th birthday of DC (Difference of Convex functions) programming
and DCA (DC Algorithms) which constitute the backbone of nonconvex programming and …
and DCA (DC Algorithms) which constitute the backbone of nonconvex programming and …
Variations and extension of the convex–concave procedure
T Lipp, S Boyd - Optimization and Engineering, 2016 - Springer
We investigate the convex–concave procedure, a local heuristic that utilizes the tools of
convex optimization to find local optima of difference of convex (DC) programming problems …
convex optimization to find local optima of difference of convex (DC) programming problems …
Kernel methods in system identification, machine learning and function estimation: A survey
Most of the currently used techniques for linear system identification are based on classical
estimation paradigms coming from mathematical statistics. In particular, maximum likelihood …
estimation paradigms coming from mathematical statistics. In particular, maximum likelihood …
Algorithms and theory for multiple-source adaptation
We present a number of novel contributions to the multiple-source adaptation problem. We
derive new normalized solutions with strong theoretical guarantees for the cross-entropy …
derive new normalized solutions with strong theoretical guarantees for the cross-entropy …
Intelligent reflecting surface for downlink non-orthogonal multiple access networks
Intelligent reflecting surface (IRS) has recently been recognized as a promising technology
to enhance the energy and spectrum efficiency of wireless networks by controlling the …
to enhance the energy and spectrum efficiency of wireless networks by controlling the …