In this paper, we consider a general sparse recovery and blind demodulation model. Different from the ones in the literature, in our general model, each dictionary atom undergoes a distinct modulation process; we refer to this as non-stationary modulation. We also assume that the modulation matrices live in a known subspace. Through the lifting technique, the sparse recovery and blind demodulation problem can be reformulated as a column-wise sparse matrix recovery problem, and we are able to recover both the sparse source signal and a cluster of modulation matrices via atomic norm and the induced ` 2,1 norm minimizations. Moreover, we show that the sampling complexity for exact recovery is proportional to the number of degrees of freedom up to log factors in the noiseless case. We also bound the recovery error in terms of the norm of the noise when the observation is noisy. Numerical simulations are conducted to illustrate our results.
more »
« less
Robustness of Recovery in Locating Array-based Screening Experiments
Locating arrays (LAs) are experimental designs for screening interactions in engineered systems. LAs are often highly unbalanced, requiring advanced techniques to recover the terms that significantly influence system performance. While perfect recovery is achieved in the absence of noise, real systems are noisy.
Therefore, in this paper, we study the robustness of recovery in the presence of noise. Using known models to generate synthetic data, we investigate recovery accuracy as a function of noise. Separation is introduced into LAs to allow more coverage for each t-way interaction; when separation is higher, recovery in noisy
scenarios should improve. We find that locating arrays are able to recover the influential terms even with high levels of noise and that separation appears to improve recovery. Under the pessimistic assumption that noise depends on the range of responses, it is no surprise that terms with small coefficients become
indistinguishable from noise.
more »
« less
- Award ID(s):
- 1813729
- NSF-PAR ID:
- 10118966
- Date Published:
- Journal Name:
- Spring Simulation Multiconference
- ISSN:
- 2330-5622
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
We consider the problem of estimating the discrete clustering structures under the sub-Gaussian mixture model. Our main results establish a hidden integrality property of a semidefinite programming (SDP) relaxation for this problem: while the optimal solution to the SDP is not integer-valued in general, its estimation error can be upper bounded by that of an idealized integer program. The error of the integer program, and hence that of the SDP, are further shown to decay exponentially in the signal-to-noise ratio. In addition, we show that the SDP relaxation is robust under the semirandom setting in which an adversary can modify the data generated from the mixture model. In particular, we generalize the hidden integrality property to the semirandom model and thereby show that SDP achieves the optimal error bound in this setting. These results together highlight the “global-to-local” mechanism that drives the performance of the SDP relaxation. To the best of our knowledge, our result is the first exponentially decaying error bound for convex relaxations of mixture models. A corollary of our results shows that in certain regimes, the SDP solutions are in fact integral and exact. More generally, our results establish sufficient conditions for the SDP to correctly recover the cluster memberships of [Formula: see text] fraction of the points for any [Formula: see text]. As a special case, we show that under the [Formula: see text]-dimensional stochastic ball model, SDP achieves nontrivial (sometimes exact) recovery when the center separation is as small as [Formula: see text], which improves upon previous exact recovery results that require constant separation.more » « less
-
The amount of electronic waste (e-waste) globally has doubled in just five years, from approximately 20 million tons to 40 million tons of e-waste generated per year. In 2016, the global amount of e-waste reached an all-time high of 44.7 million tons. E-waste is an invaluable unconventional resource due to its high metal content, as nearly 40% of e-waste is comprised of metals. Unfortunately, the rapid growth of e-waste is alarming due to severe environmental impacts and challenges associated with complex resource recovery that has led to the use of toxic chemicals. Furthermore, there is a very unfortunate ethical issue related to the flow of e-wastes from developed countries to developing countries. At this time, e-waste is often open pit burned and toxic chemicals are used without adequate regulations to recover metals such as copper. The recovered metals are eventually exported back to the developed countries. Thus, the current global circular economy of e-waste is not sustainable in terms of environmental impact as well as creation of ethical dilemmas. Although traditional metallurgical processes can be extended to e-waste treatment technologies, that is not enough. The complexity of e-waste requires the development of a new generation of metallurgical processes that can separate and extract metals from unconventional components such as polymers and a wide range of metals. This review focuses on the science and engineering of both conventional and innovative separation and recovery technologies for e-wastes with special attention being given to the overall sustainability. Physical separation processes, including disassembly, density separation, and magnetic separation, as well as thermal treatment of the polymeric component, such as pyrolysis, are discussed for the separation of metals and non-metals from e-wastes. The subsequent metal recovery processes through pyrometallurgy, hydrometallurgy, and biometallurgy are also discussed in depth. Finally, insights on future research towards sustainable treatment and recovery of e-waste are presented including the use of supercritical CO 2 .more » « less
-
null (Ed.)Human-annotated labels are often prone to noise, and the presence of such noise will degrade the performance of the resulting deep neural network (DNN) models. Much of the literature (with several recent exceptions) of learning with noisy labels focuses on the case when the label noise is independent of features. Practically, annotations errors tend to be instance-dependent and often depend on the difficulty levels of recognizing a certain task. Applying existing results from instance-independent settings would require a significant amount of estimation of noise rates. Therefore, providing theoretically rigorous solutions for learning with instance-dependent label noise remains a challenge. In this paper, we propose CORES (COnfidence REgularized Sample Sieve), which progressively sieves out corrupted examples. The implementation of CORES does not require specifying noise rates and yet we are able to provide theoretical guarantees of CORES in filtering out the corrupted examples. This high-quality sample sieve allows us to treat clean examples and the corrupted ones separately in training a DNN solution, and such a separation is shown to be advantageous in the instance-dependent noise setting. We demonstrate the performance of CORES^2 on CIFAR10 and CIFAR100 datasets with synthetic instance-dependent label noise and Clothing1M with real-world human noise. As of independent interests, our sample sieve provides a generic machinery for anatomizing noisy datasets and provides a flexible interface for various robust training techniques to further improve the performance. Code is available at https://github.com/UCSC-REAL/cores.more » « less
-
null (Ed.)Vehicle accidents are one of the greatest cause of death and injury in urban areas for pedestrians, workers, and police alike. In this work, we present CSafe, a low power audio-wearable platform that detects, localizes, and provides alerts about oncoming vehicles to improve construction worker safety. Construction worker safety is a much more challenging problem than general urban or pedestrian safety in that the sound of construction tools can be up to orders of magnitude greater than that of vehicles, making vehicle detection and localization exceptionally difficult. To overcome these challenges, we develop a novel sound source separation algorithm, called Probabilistic Template Matching (PTM), as well as a novel noise filtering architecture to remove loud construction noises from our observed signals. We show that our architecture can improve vehicle detection by up to 12% over other state-of-art source separation algorithms. We integrate PTM and our noise filtering architecture into CSafe and show through a series of real-world experiments that CSafe can achieve up to an 82% vehicle detection rate and a 6.90° mean localization error in acoustically noisy construction site scenarios, which is 16% higher and almost 30° lower than the state-of-art audio wearable safety works.more » « less
- Free Publicly Accessible Full Text
-
Accepted Manuscript1.0
- Conference Paper:
- The DOI is not currently available.
