Table of Contents

• Graph compression: The effect of clustersEmmanuel Abbe. 1-8 [doi]
• ForewordMinh Do, Naira Hovakimyan. 1 [doi]
• Recovering asymmetric communities in the stochastic block modelFrancesco Caltagirone, Marc Lelarge, Léo Miolane. 9-16 [doi]
• Amplitude samplingPablo Martinez Nuevo, Hsin-Yu Lai, Alan V. Oppenheim. 17-22 [doi]
• Modeling the P300-based brain-computer interface as a channel with memoryVaishakhi Mayya, Boyla Mainsah, Galen Reeves. 23-30 [doi]
• Predicting popularity dynamics of online contents using data filtering methodsCédric Richier, Rachid El Azouzi, Tania Jiménez, Eitan Altman, Georges Linarès. 31-38 [doi]
• Extracting sparse data via histogram queriesI-Hsiang Wang, Shao-Lun Huang, Kuan-Yun Lee. 39-45 [doi]
• Typical sumsets of linear codesJingge Zhu, Michael Gastpar. 46-53 [doi]
• Symmetry reduction of information inequalitiesKai Zhang, Chao Tian. 54-61 [doi]
• Rate distortion regions of Heegard-Berger problems with successive refinement and scalable codingMeryem Benammar, Abdellatif Zaidi. 62-69 [doi]
• Successive refinement with cribbing and side informationMinh Thanh Vu, Tobias J. Oechtering, Moritz Wiese, Mikael Skoglund. 70-77 [doi]
• On channel resolvability in presence of FeedbackMani Bastani Parizi, Emre Telatar. 78-85 [doi]
• Node isolation of secure wireless sensor networks under a heterogeneous channel modelRashad Eletreby, Osman Yagan. 86-92 [doi]
• Cache-aided content delivery in MIMO channelsKhac-Hoang Ngo, Sheng Yang, Mari Kobayashi. 93-100 [doi]
• On the outage performance of an IEEE 802.11 broadcast scheme in vehicular Ad Hoc NetworksSahand Golnarian, J. Nicholas Laneman, Michael D. Lemmon. 101-106 [doi]
• Scheduling in Massive MIMO: User clustering and pilot assignmentSalah Eddine Hajri, Mohamad Assaad, Giuseppe Caire. 107-114 [doi]
• Multiple stopping time POMDPs: Structural resultsVikram Krishnamurthy, Anup Aprem, Sujay Bhatt. 115-120 [doi]
• Quickest search for local structures in line networksJavad Heydari, Ali Tajer. 121-127 [doi]
• Sequential low-rank change detectionYao Xie 0002, Lee M. Seversky. 128-133 [doi]
• On the existence of near-optimal fixed time control of traffic intersection signalsYi Ouyang, Rahul Jain 0002, Pravin Varaiya. 134-141 [doi]
• Duality between feature selection and data clusteringChung Chan, Ali Al-Bashabsheh, Qiaoqiao Zhou, Tie Liu. 142-147 [doi]
• Cover's open problem: "The Capacity of the Relay Channel"Xiugang Wu, Leighton Pate Barnes, Ayfer Özgür. 148-155 [doi]
• Network inference using directed information: The deterministic limitArman Rahimzamani, Sreeram Kannan. 156-163 [doi]
• Coded Distributed Computing: Straggling Servers and Multistage DataflowsSongze Li, Mohammad Ali Maddah-Ali, Amir Salman Avestimehr. 164-171 [doi]
• Robustness of interdependent random geometric networksJianan Zhang, Edmund Yeh, Eytan Modiano. 172-179 [doi]
• Initial spreaders in online social networksJun Zhao. 180-186 [doi]
• Symbolic models of networked control systems: A feedback refinement relation approachMahmoud Khaled, Matthias Rungger, Majid Zamani. 187-193 [doi]
• The stability transition graph under cascade dynamics for social network subscription servicesSteven Weber. 194-201 [doi]
• Edge conductance estimation using MCMCAshish Bora, Vivek S. Borkar, Dinesh Garg, Rajesh Sundaresan. 202-208 [doi]
• Accelerated Distributed Nesterov Gradient Descent for smooth and strongly convex functionsGuannan Qu, Na Li. 209-216 [doi]
• Equilibrium analysis for a leader-follower game with noisy observations: A pace forward in Witsenhausen's counterexample conjectureAmir Ajorlou, Ali Jadbabaie. 217-218 [doi]
• Input/output analysis of primal-dual gradient algorithmsJohn W. Simpson-Porco. 219-224 [doi]
• Projected gradient descent on Riemannian manifolds with applications to online power system optimizationAdrian Hauswirth, Saverio Bolognani, Gabriela Hug, Florian Dörfler. 225-232 [doi]
• Information design for strategic coordination of autonomous devices with non-aligned utilitiesMaël Le Treust, Tristan Tomala. 233-242 [doi]
• Robust supply function bidding in electricity markets with renewablesYuanzhang Xiao, Chaithanya Bandi, Ermin Wei. 243-247 [doi]
• Prospect theory for enhanced smart grid resilience using distributed energy storageGeorges El Rahi, Anibal Sanjab, Walid Saad, Narayan B. Mandayam, H. Vincent Poor. 248-255 [doi]
• Structured perfect Bayesian equilibrium in infinite horizon dynamic games with asymmetric informationAbhinav Sinha, Achilleas Anastasopoulos. 256-263 [doi]
• Decentralized Bayesian learning in dynamic gamesDeepanshu Vasal, Achilleas Anastasopoulos. 264-273 [doi]
• A framework for decentralized opacity in linear systemsBhaskar Ramasubramanian, Rance Cleaveland, Steven I. Marcus. 274-280 [doi]
• A note on information-theoretic bounds on matrix completion under union of subspaces modelVaneet Aggarwal, Shuchin Aeron. 281-283 [doi]
• Online sparse and orthogonal subspace estimation from partial informationPengyu Xiao, Laura Balzano. 284-291 [doi]
• Sparse reconstruction under sensing constraints: A controlled approachDavood Mardani, George K. Atia, Ayman F. Abouraddy. 292-298 [doi]
• On Compressive orthonormal SensingYi Zhou, Huishuai Zhang, Yingbin Liang. 299-305 [doi]
• On failing sets of the interval-passing algorithm for compressed sensingYauhen Yakimenka, Eirik Rosnes. 306-311 [doi]
• Analyzing distributed Join-Idle-Queue: A fluid limit approachMichael Mitzenmacher. 312-318 [doi]
• A greedy randomized algorithm achieving sublinear optimality gap in a dynamic packing modelAlexander L. Stolyar, Yuan Zhong. 319-326 [doi]
• Interpretable machine learning via convex cardinal shape compositionKush R. Varshney. 327-330 [doi]
• Geometrical properties and accelerated gradient solvers of non-convex phase retrievalYi Zhou, Huishuai Zhang, Yingbin Liang. 331-335 [doi]
• On unsupervised clustering under the union of tensor subspacesMohammadhossein Chaghazardi, Shuchin Aeron. 336-340 [doi]
• Learning to decode linear codes using deep learningEliya Nachmani, Yair Be'ery, David Burshtein. 341-346 [doi]
• The structure of polarized channels via explicit parametersNaveen Goela. 347-354 [doi]
• Dense Gray codes, or easy ways to generate cyclic and non-cyclic Gray codes for the first n whole numbersThomas H. Cormen, Jessica C. Fan. 355-362 [doi]
• On the capacity of the binary adversarial wiretap channelCarol Wang. 363-369 [doi]
• Sufficient conditions for the equality of exact and Wyner common informationBadri N. Vellambi, Jörg Kliewer. 370-377 [doi]
• Synthesis of Gaussian trees with correlation sign ambiguity: An information theoretic approachAli Moharrer, Shuangqing Wei, George T. Amariucai, Jing Deng. 378-384 [doi]
• Total correlation of Gaussian vector sources on the Gray-Wyner networkGiel J. Op 't Veld, Michael C. Gastpar. 385-392 [doi]
• Distributed lossy interactive function computationSolmaz Torabi, John MacLaren Walsh. 393-400 [doi]
• Nearly optimal sparse group testingVenkata Gandikota, Elena Grigorescu, Sidharth Jaggi, Samson Zhou. 401-408 [doi]
• Algorithms for item categorization based on ordinal ranking dataJosh Girson, Shuchin Aeron. 409-416 [doi]
• Linear regression with an unknown permutation: Statistical and computational limitsAshwin Pananjady, Martin J. Wainwright, Thomas A. Courtade. 417-424 [doi]
• Efficient Bayesian Learning in Social Networks with Gaussian EstimatorsElchanan Mossel, Noah Olsman, Omer Tamuz. 425-432 [doi]
• Estimation error of the constrained lassoNissim Zerbib, Yen-Huan Li, Ya-Ping Hsieh, Volkan Cevher. 433-438 [doi]
• Finding low-rank solutions to smooth convex problems via the Burer-Monteiro approachDohyung Park, Anastasios Kyrillidis, Constantine Caramanis, Sujay Sanghavi. 439-446 [doi]
• In pursuit of novelty: A decentralized approach to subspace clusteringMostafa Rahmani, George K. Atia. 447-451 [doi]
• Distributed algorithms for convex network optimization under non-sparse equality constraintsAshish Cherukuri, Jorge Cortés. 452-459 [doi]
• Rigid formation control with nonlinear passive actuationBradley W. Lan, Soura Dasgupta. 460-466 [doi]
• Optimal ranking of test items using the Rasch modelDivyanshu Vats, Andrew S. Lan, Christoph Studer, Richard G. Baraniuk. 467-473 [doi]
• A simpler approach to low-rank tensor canonical polyadic decompositionDaniel L. Pimentel-Alarcón. 474-481 [doi]
• Subgradient methods with perturbations in network problemsVíctor Valls, Douglas J. Leith. 482-487 [doi]
• On the interplay of network structure and gradient convergence in deep learningVamsi K. Ithapu, Sathya N. Ravi, Vikas Singh. 488-495 [doi]
• Towards a theoretical analysis of PCA for heteroscedastic dataDavid Hong, Laura Balzano, Jeffrey A. Fessler. 496-503 [doi]
• The role of strong convexity-concavity in the convergence and robustness of the saddle-point dynamicsAshish Cherukuri, Enrique Mallada, Steven H. Low, Jorge Cortés. 504-510 [doi]
• Partial strong converse for the non-degraded wiretap channelYi-Peng Wei, Sennur Ulukus. 511-515 [doi]
• Universal covertness for Discrete Memoryless SourcesRemi A. Chou, Matthieu R. Bloch, Aylin Yener. 516-523 [doi]
• New results on the secure capacity of symmetric two-user interference channelsJinyuan Chen. 524-531 [doi]
• On the fine asymptotics of information theoretic privacyKousha Kalantari, Oliver Kosut, Lalitha Sankar. 532-539 [doi]
• Source-channel secrecy for Shannon cipher systemLei Yu 0003, Houqiang Li, Weiping Li. 540-547 [doi]
• Covert communications on renewal packet channelsRamin Soltani, Dennis Goeckel, Don Towsley, Amir Houmansadr. 548-555 [doi]
• Design and implementation of an autonomous robot for steel bridge inspectionNhan H. Pham, Hung M. La. 556-562 [doi]
• Distributed flocking control of mobile robots by bounded feedbackThang Nguyen, Thanh-Trung Han, Hung Manh La. 563-568 [doi]
• A bisimulation-like algorithm for abstracting control systemsAndrew J. Wagenmaker, Necmiye Ozay. 569-576 [doi]
• On incremental stability of time-delayed stochastic control systemsPushpak Jagtap, Majid Zamani. 577-581 [doi]
• Theoretical guarantees for the design of near globally optimal static distributed controllersSalar Fattahi, Javad Lavaei. 582-589 [doi]
• Gradient-free distributed resource allocation via simultaneous perturbationEduardo Ramírez-Llanos, Sonia Martínez. 590-595 [doi]
• Approximate cross-validation formula for Bayesian linear regressionYoshiyuki Kabashima, Tomoyuki Obuchi, Makoto Uemura. 596-600 [doi]
• Phase transitions and optimal algorithms in high-dimensional Gaussian mixture clusteringThibault Lesieur, Caterina De Bacco, Jess Banks, Florent Krzakala, Cristopher Moore, Lenka Zdeborová. 601-608 [doi]
• Robust channel coding strategies for machine learning dataKayvon Mazooji, Frederic Sala, Guy Van den Broeck, Lara Dolecek. 609-616 [doi]
• Centralized multi-node repair in distributed storageMarwen Zorgui, Zhiying Wang. 617-624 [doi]
• The mutual information in random linear estimationJean Barbier, Mohamad Dia, Nicolas Macris, Florent Krzakala. 625-632 [doi]
• Polynomial spectral decomposition of conditional expectation operatorsAnuran Makur, Lizhong Zheng. 633-640 [doi]
• Atypicality for the class of exponential familyElyas Sabeti, Anders Høst-Madsen. 641-648 [doi]
• Hypothesis testing in the high privacy limitJiachun Liao, Lalitha Sankar, Vincent Y. F. Tan, Flávio du Pin Calmon. 649-656 [doi]
• Community recovery in hypergraphsKwangjun Ahn, Kangwook Lee, Changho Suh. 657-663 [doi]
• Energy efficiency of wireless cooperationAman Jain, Sanjeev R. Kulkarni, Sergio Verdú. 664-671 [doi]
• When is the zero-error capacity positive in the relay, multiple-access, broadcast and interference channels?Natasha Devroye. 672-678 [doi]
• The Gaussian interference channel in the presence of a malicious jammerFatemeh Hosseinigoki, Oliver Kosut. 679-686 [doi]
• Distortion bounds for transmitting correlated sources with common part over MACLei Yu 0003, Houqiang Li, Chang Wen Chen. 687-694 [doi]
• A two-round interactive receiver cooperation scheme for multicast channelsVictor Exposito, Sheng Yang, Nicolas Gresset. 695-702 [doi]
• An optimal treatment assignment strategy to evaluate demand response effectPan Li, Baosen Zhang. 703-710 [doi]
• Dynamic pricing and proactive caching with unknown demand profileFaisal Alotaibi, Atilla Eryilmaz, Hesham El Gamal. 711-716 [doi]
• Cycle basis distributed ADMM solution for optimal network flow problem over biconnected graphsReza Asadi, Solmaz S. Kia, Amelia Regan. 717-724 [doi]
• Mobility-aware centralized D2D caching networksSameh Hosny, Atilla Eryilmaz, Alhussein A. Abouzeid, Hesham El Gamal. 725-732 [doi]
• Deadline scheduling as restless banditsZhe Yu, Yunjian Xu, Lang Tong. 733-737 [doi]
• Clustering with an oracleArya Mazumdar, Barna Saha. 738-739 [doi]
• Descending price algorithm for determining market clearing prices in matching marketsShih-Tang Su, Vijay Subramanian. 740-742 [doi]
• Observer placement for source localization: The effect of budgets and transmission varianceBrunella Spinelli, L. Elisa Celis, Patrick Thiran. 743-751 [doi]
• State estimation in stochastic hybrid systems with quadratic guard conditionsWenji Zhang, Balasubramaniam Natarajan. 752-757 [doi]
• Compressed sensing using sparse-graph codes for the continuous-alphabet settingDong Yin, Ramtin Pedarsani, Xiao Li, Kannan Ramchandran. 758-765 [doi]
• Towards the design of prospect-theory based human decision rules for hypothesis testingV. Sriram Siddhardh Nadendla, Swastik Brahma, Pramod K. Varshney. 766-773 [doi]
• Online seismic event picking via sequential change-point detectionShuang Li, Yang Cao, Christina Leamon, Yao Xie 0002, Lei Shi, Wen-Zhan Song. 774-779 [doi]
• On a notion of estimation entropy for stochastic hybrid systemsAsad Ullah Awan, Majid Zamani. 780-785 [doi]
• On the observability properties of systems with rolling shutterJan Maximilian Montenbruck, Shen Zeng, Frank Allgöwer. 786-791 [doi]
• Competitive online algorithm for leasing wireless channels in 3-Tier Sharing FrameworkGourav Saha, Alhussein A. Abouzeid, Marja Matinmikko. 792-799 [doi]
• Unifying notions of generalized weights for universal security on wire-tap networksUmberto Martínez-Peñas, Ryutaroh Matsumoto. 800-807 [doi]
• Network sensing for security against link disruption attacksMathieu Dahan, Lina Sela Perelman, Saurabh Amin. 808-815 [doi]
• Game theoretic defense approach to wireless networks against stealthy decoy attacksAhmed H. Anwar, George K. Atia, Mina Guirguis. 816-821 [doi]
• Quasi-Quadratic Residue Codes and their weight distributionsNigel Boston, Jing Hao. 822-829 [doi]
• Second order asymptotics for degraded wiretap channels: How good are existing codes?Mehrdad Tahmasbi, Matthieu R. Bloch. 830-837 [doi]
• Strategic measures approach to decentralized stochastic controlSerdar Yüksel, Naci Saldi. 838-843 [doi]
• Minimizing the Age of Information in broadcast wireless networksIgor Kadota, Elif Uysal-Biyikoglu, Rahul Singh, Eytan Modiano. 844-851 [doi]
• Towards fast algorithms for estimating Personalized PageRank using commonly generated random walksDaniel Vial, Vijay Subramanian. 852-855 [doi]
• Sublinear estimation of a single element in sparse linear systemsNitin Shyamkumar, Siddhartha Banerjee, Peter Lofgren. 856-860 [doi]
• Efficient sampling for better OSN data provisioningNick G. Duffield, Balachander Krishnamurthy. 861-868 [doi]
• Data-dependent bounds on network gradient descentAvleen Singh Bijral, Anand D. Sarwate, Nathan Srebro. 869-874 [doi]
• Active top-K ranking from noisy comparisonsSoheil Mohajer, Changho Suh. 875-882 [doi]
• Assembling a network out of ambiguous patchesLyudmila Yartseva, Jefferson Elbert Simães, Matthias Grossglauser. 883-890 [doi]
• Motif-driven graph analysisCharalampos E. Tsourakakis. 891-893 [doi]
• MIMO one hop networks with no eve CSITPritam Mukherjee, Sennur Ulukus. 894-901 [doi]
• On the capacity of the AWGN channel with additive radar interferenceSara Shahi, Daniela Tuninetti, Natasha Devroye. 902-907 [doi]
• Finite block length coding for low-latency high-reliability wireless communicationLeah Dickstein, Vasuki Narasimha Swamy, Gireeja Ranade, Anant Sahai. 908-915 [doi]
• Spatial birth-death wireless networksAbishek Sankararaman, François Baccelli. 916-923 [doi]
• Fundamental limits of cache-aided wireless BC: Interplay of coded-caching and CSIT feedbackJingjing Zhang, Petros Elia. 924-932 [doi]
• Resource allocation for data-parallel computing in networks with data localityWeina Wang, Lei Ying. 933-939 [doi]
• Fault-tolerant distributed logistic regression using unreliable componentsYaoqing Yang, Pulkit Grover, Soummya Kar. 940-947 [doi]
• Error correction for approximate computingHang Zhang, Afshin Abdi, Faramarz Fekri, Hadi Esmaeilzadeh. 948-953 [doi]
• Anytime coding for distributed computationNuwan S. Ferdinand, Stark C. Draper. 954-960 [doi]
• On the worst-case communication overhead for distributed data shufflingMohamed Adel Attia, Ravi Tandon. 961-968 [doi]
• Low-redundancy bit interleavingAlon Klein-Orbach, Yuval Kochman. 969-973 [doi]
• Minimization of a particular singular valueAlborz Alavian, Michael Rotkowitz. 974-981 [doi]
• When is Shannon's lower bound tight at finite blocklength?Victoria Kostina. 982-989 [doi]
• Diophantine approximation for network information theory: A survey of old and new resultsBobak Nazer, Or Ordentlich. 990-996 [doi]
• Asynchrony begets momentum, with an application to deep learningIoannis Mitliagkas, Ce Zhang, Stefan Hadjis, Christopher Ré. 997-1004 [doi]
• Cooperative data exchange: A coalition game perspectiveAnoosheh Heidarzadeh, Alex Sprintson. 1005-1011 [doi]
• Multi-library coded cachingSaeid Sahraei, Michael Gastpar. 1012-1017 [doi]
• Replicated convolutional codes: A design framework for repair-efficient distributed storage codesBing Zhu, Xin Li, Hui Li, Kenneth W. Shum. 1018-1024 [doi]
• Local erasure correction codes with unequal locality profileGeonu Kim, Jungwoo Lee. 1025-1032 [doi]
• Rank-metric codes with local recoverabilitySwanand Kadhe, Salim Y. El Rouayheb, Iwan Duursma, Alex Sprintson. 1033-1040 [doi]
• Bounds on the rate of linear locally repairable codes over small alphabetsAbhishek Agarwal, Arya Mazumdar. 1041-1045 [doi]
• Factor-graph representations of stabilizer quantum codesJuly X. Li, Pascal O. Vontobel. 1046-1053 [doi]
• Polynomial optimization methods for determining lower bounds on decentralized assignabilityAlborz Alavian, Michael Rotkowitz. 1054-1059 [doi]
• Periodic time-triggered sparse Linear Quadratic Controller designMirSaleh Bahavarnia, Nader Motee. 1060-1067 [doi]
• Nonnegative Matrix Factorization by optimization on the Stiefel manifold with SVD initializationAli Koochakzadeh, Sina Miran, Pouya Samangouei, Michael C. Rotkowitz. 1068-1073 [doi]
• New methods for handling binary constraintsAbhay Kumar Yadav, Rajeev Ranjan, Upal Mahbub, Michael C. Rotkowitz. 1074-1080 [doi]
• Adaptive social networks: Strong attractors and emergence and downfall of leadersAugusto Santos, Soummya Kar, Ramayya Krishnan, José M. F. Moura. 1081-1087 [doi]
• An approach for distributed state estimation of LTI systemsAritra Mitra, Shreyas Sundaram. 1088-1093 [doi]
• Open multi-agent systems: Gossiping with deterministic arrivals and departuresJulien M. Hendrickx, Samuel Martin. 1094-1101 [doi]
• On distributed computation of optimal control of traffic flow over networksQin Ba, Ketan Savla. 1102-1109 [doi]
• Synchronization bound for networks of nonlinear oscillatorsElizabeth N. Davison, Biswadip Dey, Naomi Ehrich Leonard. 1110-1115 [doi]
• Distributed computing over encrypted dataNikolaos M. Freris, Panagiotis Patrinos. 1116-1122 [doi]
• Recursive reachable set computation for on-line safety assessment of the Cyber-Physical System against stealthy cyber attacksCheolhyeon Kwon, Inseok Hwang. 1123-1128 [doi]
• Optimal network topologies for mitigating security and epidemic risksAshish R. Hota, Shreyas Sundaram. 1129-1136 [doi]
• Secure system identificationMehrdad Showkatbakhsh, Paulo Tabuada, Suhas N. Diggavi. 1137-1141 [doi]
• Secure clock synchronization under collusion attacksXiaoming Duan, Nikolaos M. Freris, Peng Cheng. 1142-1148 [doi]
• A moving target approach for identifying malicious sensors in control systemsSean Weerakkody, Bruno Sinopoli. 1149-1156 [doi]
• Rate-cost tradeoffs in controlVictoria Kostina, Babak Hassibi. 1157-1164 [doi]
• The value of timing information in event-triggered control: The scalar caseMohammad Javad Khojasteh, Pavankumar Tallapragada, Jorge Cortés, Massimo Franceschetti. 1165-1172 [doi]
• Event-triggered stabilization of scalar linear systems under packet dropsPavankumar Tallapragada, Massimo Franceschetti, Jorge Cortés. 1173-1180 [doi]
• Minimum number of sensors to ensure observability of physiological systems: A case studyYuankun Xue, Sergio Pequito, Joana R. Coelho, Paul Bogdan, George J. Pappas. 1181-1188 [doi]
• Rate-limited control of systems with uncertain gainVictoria Kostina, Yuval Peres, Miklós Z. Rácz, Gireeja Ranade. 1189-1196 [doi]
• Load balancing and speed scaling interaction in processor-sharing systems with exponential power functionsGuohui Ding, Lijun Chen. 1197-1203 [doi]
• Online Contextual Influence Maximization in social networksOmer Saritac, Altug Karakurt, Cem Tekin. 1204-1211 [doi]
• A Bayesian perspective on Residential Demand Response using smart meter dataDatong Zhou, Maximilian Balandat, Claire Tomlin. 1212-1219 [doi]
• From behavior to sparse graphical games: Efficient recovery of equilibriaAsish Ghoshal, Jean Honorio. 1220-1227 [doi]
• Collaborative learning of stochastic bandits over a social networkRavi Kumar Kolla, Krishna Jagannathan, Aditya Gopalan. 1228-1235 [doi]
• Gambler's Ruin Bandit ProblemNima Akbarzadeh, Cem Tekin. 1236-1243 [doi]
• Stochastic Frank-Wolfe methods for nonconvex optimizationSashank J. Reddi, Suvrit Sra, Barnabás Póczos, Alexander J. Smola. 1244-1251 [doi]
• The goodness of covariance selection problem from AUC boundsNavid Tafaghodi Khajavi, Anthony Kuh. 1252-1258 [doi]
• Queue-based broadcast gossip algorithm for consensusSoummya Kar, Rohit Negi, Majid Mahzoon, Anit Kumar Sahu. 1259-1266 [doi]
• A comprehensive guideline for choosing parameters in the Eschenauer-Gligor key predistributionJun Zhao. 1267-1273 [doi]
• Distributed Bayesian quickest change detection in sensor networks via large deviation analysisDi Li, Soummya Kar, Shuguang Cui. 1274-1281 [doi]
• New square-root and diagonalized Kalman smoothersFederico Wadehn, Lukas Bruderer, Vijay Sahdeva, Hans-Andrea Loeliger. 1282-1290 [doi]
• Asymptotic performance analysis of majority sentiment detection in Online Social NetworksTian Tong, Rohit Negi. 1291-1297 [doi]
• Modeling and tracking Transmission Line Dynamic Behavior in Smart Grids using structured sparsityMohammad Babakmehr, Ravel Ammerman, Marcelo Godoy Simões. 1298-1305 [doi]
• Minimizing heat loss in DC networks using batteriesAlessandro Zocca, Bert Zwart. 1306-1313 [doi]
• Distributed estimation and learning over heterogeneous networksM. Amin Rahimian, Ali Jadbabaie. 1314-1321 [doi]
• On sparse approximations for time-series networksChristopher J. Quinn. 1322-1326 [doi]
• Dynamic metric learning from pairwise comparisonsKristjan H. Greenewald, Stephen Kelley, Alfred O. Hero III. 1327-1334 [doi]
• Necessary and sufficient conditions for sketched subspace clusteringDaniel L. Pimentel-Alarcón, Laura Balzano, Robert D. Nowak. 1335-1343 [doi]