Improved speech separation and enhancement using neural beamforming.
problem Challenging speech separation and enhancement in reverberant environments.
method Sequential neural beamforming combining spectral and spatial separation methods.
result Average improvement of 2.75 dB in scale-invariant signal-to-noise ratio and 14.2% absolute reduction in speech recognition metric.
A switchable deep beamformer enables versatile image processing.
problem Training and storing separate beamformers for each application.
method Switchable deep beamformer using Adaptive Instance Normalization (AdaIN) layers.
result Single network can produce various image processing outputs.
In ultrasound (US) imaging, individual channel RF measurements are back-propagated and accumulated to form an image after applying specific delays. While this time reversal is usually implemented using a hardware- or software-based delay-and-sum (DAS) beamformer, the performance of DAS decreases rapidly in situations w…
Adaptive beamforming collapses in highly non-stationary environments, but the Universal Switching Beamformer resolves this by dynamically adjusting memory length.
problem Adaptive beamforming performance degrades in highly non-stationary environments.
method Integrating sequential prediction into the beamforming architecture.
result The USB achieves agility and precision in tracking highly non-stationary scenes.
This paper describes multichannel speech enhancement for improving automatic speech recognition (ASR) in noisy environments. Recently, the minimum variance distortionless response (MVDR) beamforming has widely been used because it works well if the steering vector of speech and the spatial covariance matrix (SCM) of no…
A neural network improves DOA estimation from a single snapshot.
problem Estimating DOAs from a single snapshot with limited aperture.
method Deep learning architecture trained to generate high-resolution spatial spectrum.
result Our (SP) 2 ^2 2 -Net outperforms classical methods. Ultrasound (US) imaging is based on the time-reversal principle, in which individual channel RF measurements are back-propagated and accumulated to form an image after applying specific delays. While this time reversal is usually implemented as a delay-and-sum (DAS) beamformer, the image quality quickly degrades as the…
New learning-based methods improve spectral efficiency in mmWave full-duplex systems.
problem Residual self-interference and high pathloss in mmWave full-duplex systems.
method Proposed two learning schemes (ELM-HBF and CNN-HBF) using ADMM and MM algorithms for SI cancellation and joint HBF optimization.
result Learning-based schemes achieve at least 22.1% higher spectral efficiency and faster online prediction and training times.
We present an unsupervised training approach for a neural network-based mask estimator in an acoustic beamforming application. The network is trained to maximize a likelihood criterion derived from a spatial mixture model of the observations. It is trained from scratch without requiring any parallel data consisting of …
A learning algorithm optimizes beamforming for holographic transceivers in far-field communication.
problem Optimal phase-shifts for beamforming in holographic transceivers are challenging due to unknown receiver locations and large phase-shifts.
method Developed a learning algorithm using a fixed-budget multi-armed bandit framework to learn optimal phase-shifts.
result The algorithm, HoloBeam, outperforms state-of-the-art methods in beamforming optimization.
Classifiers and beamforming algorithms improved audio surveillance detection accuracy.
problem Detecting surveillance sound events with high accuracy and efficiency.
method Evaluated seven classifiers and two beamforming algorithms; used data augmentation and tested with varying SNR levels.
result SVM and Delay-and-Sum (DaS) combination achieved the highest accuracy (86.0%), but had high computational cost.
Novel beamforming method reduces errors in wireless networks.
problem Mitigating channel errors in wireless networks with relays.
method Low-rank and cross-correlation techniques for robust distributed beamforming.
result The proposed LRCC-RDB technique significantly improves SINR performance.
Millimeter wave (mmWave) communication with large antenna arrays is a promising technique to enable extremely high data rates due to the large available bandwidth in mmWave frequency bands. In addition, given the knowledge of an optimal directional beamforming vector, large antenna arrays have been shown to overcome bo…
With millimeter wave wireless communications, the resulting radiation reflects on most visible objects, creating rich multipath environments, namely in urban scenarios. The radiation captured by a listening device is thus shaped by the obstacles encountered, which carry latent information regarding their relative posit…
Massive MIMO is a variant of multiuser MIMO where the number of base-station antennas M M M is very large (typically 100), and generally much larger than the number of spatially multiplexed data streams (typically 10). Unfortunately, the front-end A/D conversion necessary to drive hundreds of antennas, with a signal band…
This paper improves multichannel speech enhancement using complex ratio masking and channel-attention.
problem Limited performance of deep learning methods in multichannel speech enhancement.
method Introduces complex ratio masking and channel-attention mechanism inside a U-Net architecture.
result Demonstrates superior performance on the CHiME-3 dataset.
Study introduces statistical mechanics for min-max problems.
problem Understanding the properties of min-max problems in high dimensions.
method Statistical mechanical formalism for analyzing min-max problems.
result Derives the relationship between training data and generalization error.
RoyalFlush system improves multi-speaker ASR in M2MeT challenge.
problem Improving multi-speaker automatic speech recognition in noisy environments.
method Front-end processing with WPE and beamforming, data augmentation, and fusion of two ASR models.
result 12.22% absolute CER reduction on validation set and 12.11% on test set compared to baseline.
Survey of advances in non-convex min-max optimization for applications.
problem Finding optimal solutions in non-convex, non-concave min-max problems.
method Selective review of theoretical and algorithmic advances.
result Exciting recent advances in solving non-convex min-max problems.
This paper proposes a method to train multiple neural networks with shared parameters using a reconstruction loss.
problem Training multiple neural networks for correlated tasks separately is inefficient.
method Introduces a novel approach with a reconstruction loss to encourage shared features across multiple tasks.
result The proposed method achieves efficient transfer learning with competitive performance.
Two novel search strategies reduce complexity for target localization with size-dependent noise.
problem Target localization with varying measurement noise based on query region size.
method Proposes d y a P M dyaPM d y a P M and h i e P M hiePM hi e P M strategies with low complexity and connected query geometry. result Unified analysis shows d y a P M dyaPM d y a P M asymptotically optimal in search time, h i e P M hiePM hi e P M near-optimal in rate. Derives key CCM manifold equations for optimization.
problem Lack of rigorous derivation for CCM manifold equations.
method Systematic and rigorous proof of CCM properties.
result Unified reference for CCM Manifold Optimization.
New algorithm optimizes beam and rate allocation in mmWave systems for multiple users.
problem Optimizing beam and rate allocation in mmWave systems for multiple users with limited feedback.
method Introducing SAT-CTS, a combinatorial semi-bandit policy with satisficing objective.
result SAT-CTS achieves finite-time regret bounds and reduces satisficing regret in mmWave systems.
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.
Dynamic cell-free networks reduce complexity in serving many devices with distributed APs and DRL.
problem Designing efficient cell-free networks with many devices and APs.
method Dynamic architecture, SIC, DAS, DRL for optimization.
result DRL significantly improves performance in dynamic cell-free networks.
In portable, three dimensional, and ultra-fast ultrasound imaging systems, there is an increasing demand for the reconstruction of high quality images from a limited number of radio-frequency (RF) measurements due to receiver (Rx) or transmit (Xmit) event sub-sampling. However, due to the presence of side lobe artifact…
We consider a distributed learning problem over multiple access channel (MAC) using a large wireless network. The computation is made by the network edge and is based on received data from a large number of distributed nodes which transmit over a noisy fading MAC. The objective function is a sum of the nodes' local los…
This paper optimizes UAV and FeICIC locations in a three-tier LTE-Advanced network.
problem Optimizing UAV and FeICIC locations in a three-tier LTE-Advanced network.
method Integrates UAVs as both UE and BS in LTE-Advanced HetNet, uses CRE, ICIC, 3D beamforming, and genetic algorithms for optimization.
result Heuristic algorithms outperform brute-force techniques in achieving better 5pSE and coverage probability.
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…
Machine learning speeds up RIS design for efficient RF components.
problem Designing reconfigurable intelligent surfaces (RIS) for efficient RF components is time-consuming and resource-intensive.
method Machine/deep learning techniques are used to reduce the computational cost and time of RIS inverse design.
result Machine learning techniques significantly reduce the time and computational cost of RIS design.
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.
Graphs of neural networks are represented to preserve symmetry, improving performance across various tasks.
problem Lack of equivariance in neural network representations of other neural networks.
method Represent neural networks as computational graphs and use graph neural networks to preserve permutation symmetry.
result Single model encodes diverse neural architectures, outperforming state-of-the-art methods.
Convolutional Neural Processes improve data efficiency in neural processes.
problem Improving data efficiency in neural processes for small datasets.
method Convolutional Neural Processes (ConvNPs) improve data efficiency by leveraging translation equivariance and convolutional neural networks.
result ConvNPs enhance the performance of neural processes in small-data problems.
Neural Ordinary Differential Equation (Neural ODE) has been proposed as a continuous approximation to the ResNet architecture. Some commonly used regularization mechanisms in discrete neural networks (e.g. dropout, Gaussian noise) are missing in current Neural ODE networks. In this paper, we propose a new continuous ne…
Neural circuits integrate continuous dynamics efficiently.
problem Efficiently integrating continuous neural dynamics for simulation and learning.
method Compact neural circuits for Runge-Kutta and Adams-Bashforth-Moulton methods.
result Equivalence of neural and numerical integration for polynomial systems.
Investigates how neural network graph structure impacts predictive performance.
problem Lack of understanding between neural network graph structure and predictive performance.
method Developed relational graph representation to analyze neural networks, identifying a 'sweet spot' for improved performance.
result Identified a 'sweet spot' in relational graph structure that significantly improves neural network predictive performance.
Neural Tangents simplifies infinite-width neural networks for research.
problem Training and studying infinite-width neural networks.
method High-level API for specifying complex architectures, analytical or gradient-based training, and automatic distribution.
result Analytical training of infinite-width networks and automatic parallelization.
Novel framework explains generalization in deep neural networks.
problem Understanding and improving generalization in deep neural networks.
method Topological Quantum Neural Networks as the semi-classical limit of Deep Neural Networks.
result Demonstrates that the perceptron, viewed as the semi-classical limit, achieves similar results to standard neural networks without training.
This paper shows overparameterized deep neural networks are convex and learn useful features.
problem Analyzing fully trained overparameterized deep neural networks.
method Generalized neural feature repopulation technique.
result Overparameterized deep neural networks are inherently convex and learn useful features.
Neural networks can approximate functions uniformly across various measures.
problem Universal approximation of functions across different probability measures.
method Proving neural networks are dense in Orlicz spaces, extending classical theorems.
result Neural networks uniformly approximate functions for weakly compact families of measures.
Investigates neural codes and their embeddings, proving conjectures and introducing new code types.
problem Analyzing neural codes and their embedding dimensions.
method Combinatorial, topological, and algebraic analysis; proving conjectures; introducing new neural code types.
result Proves conjectures about neural codes and their embeddings, introduces new code types.
Quadratic models explain neural network behavior during training.
problem Understanding neural network dynamics during training with large learning rates.
method Developed and tested Neural Quadratic Models.
result Neural Quadratic Models exhibit the 'catapult phase' similar to neural networks.
Graph Metanetworks process diverse neural architectures efficiently.
problem Processing diverse neural architectures efficiently.
method Builds metanetworks using graph neural networks to process graphs representing input neural networks.
result Proves GMNs are expressive and equivariant to parameter permutation symmetries.
Optimal rates for shallow ReLU networks in nonparametric regression.
problem Approximating smooth and non-smooth functions with shallow ReLU networks.
method Analysis of shallow ReLU k ^k k neural networks, using variation norms and deep learning theory. result Optimal approximation rates for shallow ReLU networks in nonparametric regression.
New metric compares noisy neural trajectories using optimal transport.
problem Existing metrics fail to capture differences in noisy, dynamic neural responses.
method Proposed an optimal transport distance metric for Gaussian processes.
result Metric effectively compares neural dynamics in different systems.
Paper analyzes Q-learning with neural networks, proving a fast convergence rate.
problem Analyzing the convergence rate of neural Q-learning.
method Finite-time analysis of neural Q-learning with a deep ReLU network.
result Neural Q-learning converges to optimal policy with O ( 1 / T ) O(1/\sqrt{T}) O ( 1/ T ) rate. The neural tangent kernel equivalence theorem fails in practice.
problem Does the neural tangent kernel (NTK) equivalence theorem hold in practical neural network training?
method Rigorously derived NTK and conducted numerical experiments to evaluate the equivalence theorem.
result Adding a layer to a neural network and the corresponding updated NTK do not yield matching changes in predictor error.
Equivariant neural networks use symmetry to interpret complex data.
problem Interpreting and understanding the behavior of equivariant neural networks.
method Decompose layers into simple representations and analyze nonlinear activation functions.
result Equivariant neural networks can be interpreted using a filtration generalizing Fourier series.