Search
Results
-
Dealbreaker: A Nonlinear Latent Variable Model for Educational Data
(2016)Proceedings of Machine Learning Research ~ Proceedings of the International Conference on Machine Learning, 20-22 June 2016, New York, New York, USAStatistical models of student responses on assessment questions, such as those in homeworks and exams, enable educators and computer-based personalized learning systems to gain insights into students' knowledge using machine learning. Popular student-response models, including the Rasch model and item response theory models, represent the probability of a student answering a question correctly using an affine function of latent factors. ...Conference Paper -
Nonlinear 1-Bit Precoding for Massive MU-MIMO with Higher-Order Modulation
(2016)2016 50th Asilomar Conference on Signals, Systems and ComputersMassive multi-user (MU) multiple-input multiple-output (MIMO) is widely believed to be a core technology for the upcoming fifth-generation (5G) wireless communication standards. The use of low-precision digital-to-analog converters (DACs) in MU-MIMO base stations is of interest because it reduces the power consumption, system costs, and raw baseband data rates. In this paper, we develop novel algorithms for downlink precoding in massive ...Conference Paper -
Decentralized Data Detection for Massive MU-MIMO on a Xeon Phi Cluster
(2016)2016 50th Asilomar Conference on Signals, Systems and ComputersConventional centralized data detection algorithms for massive multi-user multiple-input multiple-output (MU-MIMO) systems, such as minimum mean square error (MMSE) equalization, result in excessively high raw baseband data rates and computing complexity at the centralized processing unit. Hence, practical base-station (BS) designs for massive MU-MIMO that rely on state-of-the-art hardware processors and I/O interconnect standards must ...Conference Paper -
FPGA design of approximate semidefinite relaxation for data detection in large MIMO wireless systems
(2016)2016 IEEE International Symposium on Circuits and Systems (ISCAS)We propose a novel, near-optimal data detection algorithm and a corresponding FPGA design for large multiple-input multiple-output (MIMO) wireless systems. Our algorithm, referred to as TASER (short for triangular approximate semidefinite relaxation), relaxes the maximum-likelihood (ML) detection problem to a semidefinite program and solves a non-convex approximation using a preconditioned forward-backward splitting procedure. We show ...Conference Paper -
Biconvex Relaxation for Semidefinite Programming in Computer Vision
(2016)Lecture Notes in Computer Science ~ Computer Vision – ECCV 2016 14th European Conference, Amsterdam, The Netherlands, October 11-14, 2016, Proceedings, Part VISemidefinite programming (SDP) is an indispensable tool in computer vision, but general-purpose solvers for SDPs are often too slow and memory intensive for large-scale problems. Our framework, referred to as biconvex relaxation (BCR), transforms an SDP consisting of PSD constraint matrices into a specific biconvex optimization problem, which can then be approximately solved in the original, low-dimensional variable space at low complexity. ...Conference Paper -
Decentralized beamforming for massive MU-MIMO on a GPU cluster
(2016)2016 IEEE Global Conference on Signal and Information Processing (GlobalSIP)In the massive multi-user multiple-input multiple-output (MU-MIMO) downlink, traditional centralized beamforming (or precoding), such as zero-forcing (ZF), entails excessive complexity for the computing hardware, and generates raw baseband data rates that cannot be supported with current interconnect technology and chip I/O interfaces. In this paper, we present a novel decentralized beamforming approach that partitions the base-station ...Conference Paper -
Estimating Sparse Signals with Smooth Support via Convex Programming and Block Sparsity
(2016)Proceedings of the 29th IEEE Conference on Computer Vision and Pattern Recognition (CVPR 2016)Conventional algorithms for sparse signal recovery and sparse representation rely on l1-norm regularized variational methods. However, when applied to the reconstruction of sparse images, i.e., images where only a few pixels are non-zero, simple l1-norm-based methods ignore potential correlations in the support between adjacent pixels. In a number of applications, one is interested in images that are not only sparse, but also have a support ...Conference Paper