Optimizing over-the-air convex optimization, analog schemes are nearly optimal at low SNR.
problem Optimizing over-the-air convex optimization with coded gradients.
method Analyzes coded gradients over an additive Gaussian noise channel, considers analog coding schemes.
result Analog coding schemes nearly match the optimal convergence rate at low SNR, but a slowdown is inevitable.
New framework aligns latent representations over-the-air using intelligent metasurfaces.
problem Heterogeneous transmitter-receiver models produce misaligned latent representations in semantic communication.
method Intelligent metasurfaces (SIM) emulate supervised and zero-shot semantic aligners directly in the wave domain.
result SIMs achieve up to 90% task accuracy in high SNR regimes, robust to low SNR.
Over-the-air computation (AirComp) shows great promise to support fast data fusion in Internet-of-Things (IoT) networks. AirComp typically computes desired functions of distributed sensing data by exploiting superposed data transmission in multiple access channels. To overcome its reliance on channel station informatio…
DSGD with OAC-MAC scheme achieves better convergence in noisy wireless networks.
problem Performance of decentralized SGD in noisy wireless environments.
method Proposed OAC-MAC scheme for over-the-air computation in DSGD.
result OAC-MAC scheme converges faster with fewer communication rounds.
Paper tackles federated linear bandit learning with AirComp for noisy channels.
problem Minimize cumulative regret in federated linear bandit learning.
method Proposes a federated linear bandits scheme using over-the-air computation (AirComp) over noisy fading channels.
result Determines the regret bound of the proposed scheme.
Improved federated learning over-the-air reduces noise impact.
problem Noise in OTA FL degrades model accuracy.
method Developed COTAF algorithm with precoding and scaling.
result COTAF achieves similar convergence rate to error-free channels.
Proposes HOTA-FedGradNorm for faster and robust PFL in noisy channels.
problem Statistical heterogeneity across clients in federated learning.
method Dynamic weighting, OTA aggregation, hierarchical federated learning.
result Training speed improvement and robustness against channel effects.
End-to-end learning of communications systems is a fascinating novel concept that has so far only been validated by simulations for block-based transmissions. It allows learning of transmitter and receiver implementations as deep neural networks (NNs) that are optimized for an arbitrary differentiable end-to-end perfor…
Paper introduces REED for noncoherent OTA-FL, reducing latency without phase alignment.
problem Noncoherent OTA-FL requires signed model updates without phase alignment.
method Introduces REED for continuous signed aggregation using resource-element energy difference.
result Exact variance laws for REED and chip-diverse extension in Rayleigh fading.
Adversarial examples are inputs to machine learning models designed by an adversary to cause an incorrect output. So far, adversarial examples have been studied most extensively in the image domain. In this domain, adversarial examples can be constructed by imperceptibly modifying images to cause misclassification, and…
Deep neural networks for video classification, just like image classification networks, may be subjected to adversarial manipulation. The main difference between image classifiers and video classifiers is that the latter usually use temporal information contained within the video. In this work we present a manipulation…
Edge devices learn a global model collaboratively over wireless channels.
problem Learning a global model from edge devices with imperfect channel state information.
method Proposed analog aggregation scheme, receive beamforming at PS, and convergence analysis.
result Performance improvement with more PS antennas, even with imperfect CSI.
New adaptive SGD algorithms for federated learning over physical channels.
problem Reducing communication cost in federated learning over physical channels.
method Proposed adaptive federated SGD algorithms considering channel noise and hardware constraints.
result Demonstrated convergence rates adaptive to stochastic gradient noise level.
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 computing inapplicable in these scenarios. Instead, edge machine learning becomes increasingly attractive for performing training and inference directl…
Federated edge learning improves with CSIT-free model aggregation using RIS.
problem Lack of CSIT in federated edge learning systems.
method Use RIS to align channel coefficients for model aggregation without CSIT, optimize RIS and receiver jointly.
result Achieves similar learning accuracy as CSIT-based methods without CSIT.
This paper shows how differential privacy can be achieved naturally in federated learning over fading channels without artificial noise.
problem Achieving differential privacy in federated learning over fading channels without artificial noise.
method Study of AirFL over multiple-access fading channels with a multi-antenna base station, deriving novel bounds on differential privacy.
result DP can be achieved naturally in federated learning over fading channels without artificial noise, revealing convergence-privacy trade-offs.
Paper defends deep learning classifiers against channel-aware adversarial attacks.
problem Deep learning classifiers are vulnerable to adversarial attacks.
method Channel-aware adversarial attacks are presented and defended against.
result Certified defense based on randomized smoothing makes classifiers robust.
We consider a wireless communication system that consists of a transmitter, a receiver, and an adversary. The transmitter transmits signals with different modulation types, while the receiver classifies its received signals to modulation types using a deep learning-based classifier. In the meantime, the adversary makes…
Enhances OTA FL algorithms by defining inverse feasibility for linear models.
problem Improving security and privacy in over-the-air federated learning.
method Defines inverse feasibility as an upper bound on condition number, analyzes existing model, proposes new model.
result Proposes a new OTA FL model with enhanced characteristics.
Adversarial examples in machine learning for images are widely publicized and explored. Illustrations of misclassifications caused by slightly perturbed inputs are abundant and commonly known (e.g., a picture of panda imperceptibly perturbed to fool the classifier into incorrectly labeling it as a gibbon). Similar atta…
A-FADMM improves FL scalability and privacy via wireless channel perturbations and interference.
problem Challenges in model training due to wireless channel randomness and interference.
method Formulated a novel constrained optimization problem and proposed A-FADMM framework.
result Proves convergence and privacy guarantees for A-FADMM under time-varying channels.
FLORAS uses orthogonal sequences for SISO FL, offering both DP and convergence guarantees.
problem Privacy-preserving wireless federated learning in SISO systems.
method Leverages orthogonal sequences to eliminate CSIT requirement and provide DP guarantees.
result FLORAS achieves a smooth tradeoff between convergence rate and DP levels.
Adversarial attacks reduce deep learning beam selection performance in mmWave 5G.
problem Adversarial attacks degrade deep learning-based beam selection in mmWave 5G.
method Generates adversarial perturbations to RSS inputs to manipulate DNN predictions.
result Significant reduction in IA performance due to adversarial perturbations.
Orthogonal frequency division multiplexing (OFDM) has been widely applied in current communication systems. The artificial intelligence (AI)-aided OFDM receivers are currently brought to the forefront to replace and improve the traditional OFDM receivers. In this study, we first compare two AI-aided OFDM receivers, nam…
Study on statistical estimation over Gaussian MAC, comparing analog and digital schemes.
problem Distributed minimax statistical estimation over a Gaussian MAC.
method Developed analog joint estimation-communication schemes and derived information-theoretic lower bounds.
result Achieved risk within a logarithmic factor of information-theoretic lower bounds.
Recent advancements in radio frequency machine learning (RFML) have demonstrated the use of raw in-phase and quadrature (IQ) samples for multiple spectrum sensing tasks. Yet, deep learning techniques have been shown, in other applications, to be vulnerable to adversarial machine learning (ML) techniques, which seek to …
On-device machine learning (ML) has brought about the accessibility to a tremendous amount of data from the users while keeping their local data private instead of storing it in a central entity. However, for privacy guarantee, it is inevitable at each device to compensate for the quality of data or learning performanc…
Random orthogonalization improves FL in massive MIMO systems without CSI.
problem Efficient model aggregation in FL with minimal channel estimation overhead.
method Combining FL with massive MIMO's channel hardening and favorable propagation, random orthogonalization reduces channel estimation overhead.
result Achieves model aggregation without CSI, significantly reducing channel estimation overhead.
Adversarial machine learning hides 5G communications from eavesdroppers.
problem Hiding 5G communications from eavesdroppers using DL classifiers.
method Craft adversarial perturbations to fool DL classifiers.
result Adversarial perturbations can hide 5G communications with high probability.
While research on adversarial examples in machine learning for images has been prolific, similar attacks on deep learning (DL) for radio frequency (RF) signals and their mitigation strategies are scarcely addressed in the published work, with only one recent publication in the RF domain [1]. RF adversarial examples (Ad…
Paper proposes SCALLION and SCAFCOM for compressed FL with reduced communication.
problem Reducing communication overhead in Federated Learning with data heterogeneity and partial participation.
method Revisit and simplify stochastic controlled averaging, proposing SCALLION and SCAFCOM for unbiased and biased compression.
result SCALLION and SCAFCOM outperform existing methods in communication and computation complexities.
Bayesian optimization reduces computational effort in aircraft design optimization.
problem High computational cost in industrial aircraft design optimization.
method Constrained Bayesian optimization (Super Efficient Global Optimization with Mixture of Experts)
result Significant computational efficiency improvements over existing Isight optimizers.
Bayesian optimization method tackles combinatorial spaces, scalable for large data.
problem Optimization over combinatorial categorical spaces in natural sciences.
method Combines variational optimization and continuous relaxations for gradient-based optimization.
result Method performs comparably to state-of-the-art methods while scaling well.
New algorithm solves complex stopping problems with robust optimization.
problem Solving complex stochastic optimal stopping problems.
method Simulation-based robust optimization with exact reformulation as a zero-one bilinear program.
result Developed polynomial-time heuristics and algorithms for practical solution.
L2O uses ML to optimize traditional optimization techniques.
problem Real-world optimization problems with shared structures.
method Exploiting shared structures to enhance optimization techniques.
result Better or faster solutions through machine learning integration.
When hyperparameter optimization of a machine learning algorithm is repeated for multiple datasets it is possible to transfer knowledge to an optimization run on a new dataset. We develop a new hyperparameter-free ensemble model for Bayesian optimization that is a generalization of two existing transfer learning extens…
Meta algorithm solves multivariate optimization using univariate optimizers.
problem Multivariate global optimization problems.
method Meta algorithm combining univariate global optimizers.
result Meta algorithm provides robust regret guarantees.
A novel neural network approach for optimization problems.
problem Constrained optimization problems.
method Neural Optimization Machine (NOM) using a specially designed NN architecture and training procedure.
result Solves optimization problems efficiently, especially in high-dimensional spaces.
New algorithms ensure reproducibility and optimal convergence in convex optimization.
problem Trade-off between reproducibility and convergence rate in convex optimization.
method Regularization-based algorithms for smooth convex minimization and minimax optimization.
result Achieves optimal reproducibility and near-optimal gradient complexity for various oracle settings.
New algorithm selects robust martingale for optimal stopping problems.
problem Optimal stopping problems in stochastic processes.
method Randomized dual martingale minimization algorithm.
result Efficiently selects Doob martingale as close as possible.
Numerical optimization is an important tool in the field of computational physics in general and in nano-optics in specific. It has attracted attention with the increase in complexity of structures that can be realized with nowadays nano-fabrication technologies for which a rational design is no longer feasible. Also, …
This paper shows how to combine optimal tests into log-optimal processes.
problem How to combine optimal sequential tests into log-optimal processes.
method Using a new class of WAIT e-processes, the paper aggregates asymptotically optimal sequential tests into asymptotically log-optimal processes.
result It is possible to aggregate asymptotically optimal sequential tests into asymptotically log-optimal e-processes.
Learning optimal feedback control laws capable of executing optimal trajectories is essential for many robotic applications. Such policies can be learned using reinforcement learning or planned using optimal control. While reinforcement learning is sample inefficient, optimal control only plans an optimal trajectory fr…
Paper studies optimal control for a specific geometric problem.
problem Optimal control problem associated with the Paneitz obstacle problem.
method Existence and regularity results for optimal controls.
result Existence of optimal controls and their properties.
New algorithm AG-OG optimizes separable convex-concave problems efficiently.
problem Efficiently solving separable convex-concave minimax optimization problems.
method Leverages Nesterov acceleration and optimistic gradient on component and coupling parts of the problem.
result Achieves optimal convergence rate for various settings including bilinearly coupled problems.
Adapts Bayesian optimization for mixed constraints in aircraft design.
problem Optimizing expensive black box functions with mixed constraints.
method Super efficient global optimization with upper trust bound for constraints, Gaussian process uncertainty, refinement procedure.
result Superior performance on aircraft design problem compared to state-of-the-art solvers.
Adam optimizer converges to zeros of a new vector field, not just gradient zeros.
problem Prove convergence rates for Adam optimizer in simple quadratic optimization problems.
method Introduced Adam vector field to analyze Adam optimizer's convergence.
result Established optimal convergence rates for Adam optimizer.
Optimal crypto asset routing with CFMMs, including fixed costs.
problem Optimizing order execution on a network of CFMMs with fixed costs.
method Convex optimization for no fixed costs, mixed-integer convex for fixed costs, heuristics for approximate solutions.
result Approximate solutions to optimal routing and arbitrage certification problems.