Computing one-bit compressive sensing via double-sparsity constrained optimization

One-bit compressive sensing is popular in signal processing and communications due to the advantage of its low storage costs and hardware complexity. However, it has been a challenging task all along since only the one-bit (the sign) information is available to recover the signal. In this paper, we appropriately formulate the one-bit compressed sensing by a double-sparsity constrained optimization problem. The first-order optimality conditions via the newly introduced τ-stationarity for this nonconvex and discontinuous problem are established, based on which, a gradient projection subspace pursuit (GPSP) approach with global convergence and fast convergence rate is proposed. Numerical experiments against other leading solvers illustrate the high efficiency of our proposed algorithm in terms of the computation time and the quality of the signal recovery as well

Global and quadratic convergence of Newton hard-thresholding pursuit

Algorithms based on the hard thresholding principle have been well studied with sounding theoretical guarantees in the compressed sensing and more general sparsity-constrained optimization. It is widely observed in existing empirical studies that when a restricted Newton step was used (as the debiasing step), the hard-thresholding algorithms tend to meet halting conditions in a significantly low number of iterations and are very efficient. Hence, the thus obtained Newton hard-thresholding algorithms call for stronger theoretical guarantees than for their simple hard-thresholding counterparts. This paper provides a theoretical justification for the use of the restricted Newton step. We build our theory and algorithm, Newton Hard-Thresholding Pursuit (NHTP), for the sparsity-constrained optimization. Our main result shows that NHTP is quadratically convergent under the standard assumption of restricted strong convexity and smoothness. We also establish its global convergence to a stationary point under a weaker assumption. In the special case of the compressive sensing, NHTP effectively reduces to some of the existing hard-thresholding algorithms with a Newton step. Consequently, our fast convergence result justifies why those algorithms perform better than without the Newton step. The efficiency of NHTP was demonstrated on both synthetic and real data in compressed sensing and sparse logistic regression

Quadratic convergence of Smoothing Newton's method for 0/1 loss optimization

It has been widely recognized that the 0/1 loss function is one of the most natural choices for modeling classification errors, and it has a wide range of applications including support vector machines and 1-bit compressed sensing. Due to the combinatorial nature of the 0/1 loss function, methods based on convex relaxations or smoothing approximations have dominated the existing research and are often able to provide approximate solutions of good quality. However, those methods are not optimizing the 0/1 loss function directly and hence no optimality has been established for the original problem. This paper aims to study the optimality conditions of the 0/1 function minimization, and for the first time to develop Newton's method that directly optimizes the 0/1 function with a local quadratic convergence under reasonable conditions. Extensive numerical experiments demonstrate its superior performance as one would expect from Newton-type methods. Extensive numerical experiments demonstrate its superior performance as one would expect from Newton-type methods

Quadratic convergence of smoothing Newton's method for 0/1 loss optimization

It has been widely recognized that the 0/1-loss function is one of the most natural choices for modelling classification errors, and it has a wide range of applications including support vector machines and 1-bit compressed sensing. Due to the combinatorial nature of the 0/1 loss function, methods based on convex relaxations or smoothing approximations have dominated the existing research and are often able to provide approximate solutions of good quality. However, those methods are not optimizing the 0/1 loss function directly and hence no optimality has been established for the original problem. This paper aims to study the optimality conditions of the 0/1 function minimization and for the first time to develop Newton's method that directly optimizes the 0/1 function with a local quadratic convergence under reasonable conditions. Extensive numerical experiments demonstrate its superior performance as one would expect from Newton-type methods

Support vector machine classifier via L0/1 soft-margin loss

Support vector machines (SVM) have drawn wide attention for the last two decades due to its extensive applications, so a vast body of work has developed optimization algorithms to solve SVM with various soft-margin losses. To distinguish all, in this paper, we aim at solving an ideal soft-margin loss SVM: L0/1 soft-margin loss SVM (dubbed as L0/1 -SVM). Many of the existing (non)convex soft-margin losses can be viewed as one of the surrogates of the L0/1 soft-margin loss. Despite its discrete nature, we manage to establish the optimality theory for the L0/1 -SVM including the existence of the optimal solutions, the relationship between them and P-stationary points. These not only enable us to deliver a rigorous definition of L0/1 support vectors but also allow us to define a working set. Integrating such a working set, a fast alternating direction method of multipliers is then proposed with its limit point being a locally optimal solution to the L0/1 -SVM. Finally, numerical experiments demonstrate that our proposed method outperforms some leading classification solvers from SVM communities, in terms of faster computational speed and a fewer number of support vectors. The bigger the data size is, the more evident its advantage appears

Building Fuzzy Elevation Maps from a Ground-based 3D Laser Scan for Outdoor Mobile Robots

Mandow, A; Cantador, T.J.; Reina, A.J.; Martínez, J.L.; Morales, J.; García-Cerezo, A. "Building Fuzzy Elevation Maps from a Ground-based 3D Laser Scan for Outdoor Mobile Robots," Robot2015: Second Iberian Robotics Conference, Advances in Robotics, (2016) Advances in Intelligent Systems and Computing, vol. 418. This is a self-archiving copy of the author’s accepted manuscript. The final publication is available at Springer via http://link.springer.com/book/10.1007/978-3-319-27149-1.The paper addresses terrain modeling for mobile robots with fuzzy elevation maps by improving computational speed and performance over previous work on fuzzy terrain identification from a three-dimensional (3D) scan. To this end, spherical sub-sampling of the raw scan is proposed to select training data that does not filter out salient obstacles. Besides, rule structure is systematically defined by considering triangular sets with an unevenly distributed standard fuzzy partition and zero order Sugeno-type consequents. This structure, which favors a faster training time and reduces the number of rule parameters, also serves to compute a fuzzy reliability mask for the continuous fuzzy surface. The paper offers a case study using a Hokuyo-based 3D rangefinder to model terrain with and without outstanding obstacles. Performance regarding error and model size is compared favorably with respect to a solution that uses quadric-based surface simplification (QSlim).This work was partially supported by the Spanish CICYT project DPI 2011-22443, the Andalusian project PE-2010 TEP-6101, and Universidad de Málaga-Andalucía Tech

Uncertainty quantification for kinetic models in socio-economic and life sciences

Kinetic equations play a major rule in modeling large systems of interacting particles. Recently the legacy of classical kinetic theory found novel applications in socio-economic and life sciences, where processes characterized by large groups of agents exhibit spontaneous emergence of social structures. Well-known examples are the formation of clusters in opinion dynamics, the appearance of inequalities in wealth distributions, flocking and milling behaviors in swarming models, synchronization phenomena in biological systems and lane formation in pedestrian traffic. The construction of kinetic models describing the above processes, however, has to face the difficulty of the lack of fundamental principles since physical forces are replaced by empirical social forces. These empirical forces are typically constructed with the aim to reproduce qualitatively the observed system behaviors, like the emergence of social structures, and are at best known in terms of statistical information of the modeling parameters. For this reason the presence of random inputs characterizing the parameters uncertainty should be considered as an essential feature in the modeling process. In this survey we introduce several examples of such kinetic models, that are mathematically described by nonlinear Vlasov and Fokker--Planck equations, and present different numerical approaches for uncertainty quantification which preserve the main features of the kinetic solution.Comment: To appear in "Uncertainty Quantification for Hyperbolic and Kinetic Equations

Signal Transduction Pathways in the Pentameric Ligand-Gated Ion Channels

The mechanisms of allosteric action within pentameric ligand-gated ion channels (pLGICs) remain to be determined. Using crystallography, site-directed mutagenesis, and two-electrode voltage clamp measurements, we identified two functionally relevant sites in the extracellular (EC) domain of the bacterial pLGIC from Gloeobacter violaceus (GLIC). One site is at the C-loop region, where the NQN mutation (D91N, E177Q, and D178N) eliminated inter-subunit salt bridges in the open-channel GLIC structure and thereby shifted the channel activation to a higher agonist concentration. The other site is below the C-loop, where binding of the anesthetic ketamine inhibited GLIC currents in a concentration dependent manner. To understand how a perturbation signal in the EC domain, either resulting from the NQN mutation or ketamine binding, is transduced to the channel gate, we have used the Perturbation-based Markovian Transmission (PMT) model to determine dynamic responses of the GLIC channel and signaling pathways upon initial perturbations in the EC domain of GLIC. Despite the existence of many possible routes for the initial perturbation signal to reach the channel gate, the PMT model in combination with Yen's algorithm revealed that perturbation signals with the highest probability flow travel either via the β1-β2 loop or through pre-TM1. The β1-β2 loop occurs in either intra- or inter-subunit pathways, while pre-TM1 occurs exclusively in inter-subunit pathways. Residues involved in both types of pathways are well supported by previous experimental data on nAChR. The direct coupling between pre-TM1 and TM2 of the adjacent subunit adds new insight into the allosteric signaling mechanism in pLGICs. © 2013 Mowrey et al

Separability and entanglement in 2x3xN composite quantum systems

The separability and entanglement of quantum mixed states in \Cb^2 \otimes \Cb^3 \otimes \Cb^N composite quantum systems are investigated. It is shown that all quantum states $\rho$ with positive partial transposes and rank $r(\rho)\leq N$ are separable.Comment: Latex, 15 page

Coherent magnetic semiconductor nanodot arrays

In searching appropriate candidates of magnetic semiconductors compatible with mainstream Si technology for future spintronic devices, extensive attention has been focused on Mn-doped Ge magnetic semiconductors. Up to now, lack of reliable methods to obtain high-quality MnGe nanostructures with a desired shape and a good controllability has been a barrier to make these materials practically applicable for spintronic devices. Here, we report, for the first time, an innovative growth approach to produce self-assembled and coherent magnetic MnGe nanodot arrays with an excellent reproducibility. Magnetotransport experiments reveal that the nanodot arrays possess giant magneto-resistance associated with geometrical effects. The discovery of the MnGe nanodot arrays paves the way towards next-generation high-density magnetic memories and spintronic devices with low-power dissipation