- talks - lists.cs.princeton.edu

Perspectives from a Young Alumni Founder Patrick Wendell'11- Keller Center Event
by Nicole E. Wagenblast 07 Oct '15

07 Oct '15

Perspectives from a Young Alumni Founder, Patrick Wendell'11 Keller Center Event Thursday, October 8, 5:30pm Hub 34 Chambers Street Event Room RSVP Required This talk will feature Patrick Wendell, class of 2011. Two years after graduating from Princeton in Computer Science, Patrick co-founded Databricks, a company commercializing the Apache Spark software platform for large scale data processing. Databricks helps companies extract value from large amounts of data. Over the last two and a half years, Databricks has raised more than $40 million inventure funding from lead investors Andreessen Horowitz and NEA Ventures. The company employs more than 70 people at its San Francisco headquarters. In this talk, which will be followed by a "meet-and-greet" session, Patrick will revisit the founding of the company and reflect on lessons learned along the path from Princeton, to Berkeley, and finally to the start-up world. Topics will include fundraising, product strategy, building successful teams, transferring technical innovation into usable products, and perspectives on how the undergraduate life differs from the life of an entrepreneur. He will also discuss different avenues to an entrepreneurial career for Princeton students. The session will be highly interactive and allow for questions from the audience. Patrick Wendell is a co-founder of Databricks as well as a founding Committer and PMC member of the Apache Spark software project. In the Spark project, Patrick has acted as release manager for several Spark releases, in addition to maintaining several subsystems of Spark's core engine. At Databricks, Patrick directs the company's maintenance and development of Spark.Patrick holds an M.S. in Computer Science at UC Berkeley, where his research focused on low latency scheduling for large scale analytics workloads. He holds a B.S.E in Computer Science from Princeton University. RSVP for this event to bjarvie(a)princeton.edu

1 1

Colloquium Speaker Jeffrey Siskind Thurs Oct 15, 12:30pm
by Nicole E. Wagenblast 07 Oct '15

07 Oct '15

Colloquium Speaker Jeffrey Siskind, from Purdue University Thursday, October 15, 12:30pm Computer Science 105 Seeing, Saying, Doing, and Learning: Integrating Computer Vision, Natural Language Processing, Robotics, and Machine Learning Through Multidirectional Inference The semantics of natural language can be grounded in perception and motor control with a unified cost function that supports multidirectional inference. I will present several instances of this approach. The first is a cost function relating sentences, video, and a lexicon. Performing inference from video and a lexicon to sentences allows it to generate sentential descriptions of video. Performing inference from sentences and a lexicon to video allows it to search a video database for clips that match a sentential query. Performing inference from sentences and video to a lexicon allows it to learn a lexicon. The second is the functional inverse of video captioning. Instead of mapping video and object detections to sentences, one can map video and sentences to object detections. This allows one to use sentential constraint on a video object codetection process to find objects without pretrained object detectors. The third is a cost function relating sentences, robotic navigation paths, and a lexicon. Performing inference from sentences and navigation paths to a lexicon allows it to learn a lexicon. Performing inference from navigation paths and a learned lexicon to sentences allows it to generate sentential descriptions of paths driven by a mobile robot. Performing inference from sentences and a learned lexicon to navigation paths allows it to plan and drive navigation paths that satisfy a sentential navigation request. Finally, one can perform object codetection on the video stream from a robot-mounted camera during navigation to satisfy sentential requests and use the collection of constraints from vision, language, and robotics to detect, localize, and label objects in the environment without any pretrained object detectors. Joint work with Andrei Barbu, Daniel Paul Barrett, Scott Alan Bronikowski, N. Siddharth, and Haonan Yu. Jeffrey M. Siskind received the B.A. degree in computer science from the Technion, Israel Institute of Technology, Haifa, in 1979, the S.M. degree in computer science from the Massachusetts Institute of Technology (M.I.T.), Cambridge, in 1989, and the Ph.D. degree in computer science from M.I.T. in 1992. He did a postdoctoral fellowship at the University of Pennsylvania Institute for Research in Cognitive Science from 1992 to 1993. He was an assistant professor at the University of Toronto Department of Computer Science from 1993 to 1995, a senior lecturer at the Technion Department of Electrical Engineering in 1996, a visiting assistant professor at the University of Vermont Department of Computer Science and Electrical Engineering from 1996 to 1997, and a research scientist at NEC Research Institute, Inc. from 1997 to 2001. He joined the Purdue University School of Electrical and Computer Engineering in 2002 where he is currently an associate professor. His research interests include computer vision, robotics, artificial intelligence, neuroscience, cognitive science, computational linguistics, child language acquisition, automatic differentiation, and programming languages and compilers.

1 0

Colloquium Speaker: Shie Mannor, Mon, Oct 12- 12:30pm
by Nicole E. Wagenblast 06 Oct '15

06 Oct '15

Colloquium Speaker Shie Mannor, Technion, Israel Institute of Technology Monday, October 12, 12:30pm Computer Science 105 Co-hosted by the Computer Science Department and the Center for Statistics and Machine Learning Actionable big data: from data to decisions and back In many sequential decision problems all that we have is a record of historical trajectories. Building dynamic models from these trajectories and ultimately sequential decision policies may result in much uncertainty and bias. In this talk we consider the question of how to create control policies from existing historical data and how to better sample trajectories so that future control policies would be better. This question has been central in reinforcement learning in the last decade if not more, and involves methods from statistics, machine learning, optimization, and control theory. I will start my talk with demonstrating why planning with parameter uncertainty is an important issue. I will then describe several approaches: Bayesian uncertainty model over the unknown parameters, a robust approach that takes a worst case view, and a frequentist approach. I will then discuss the challenges that are posed when the model itself rather than just the parameters may not be fully known. I will then describe two challenging real-world domains that have been studied in my research group in collaboration with experts from industry and academia: diabetes care management in healthcare and asset management in high-voltage transmission grids. For each domain I will describe our efforts to reduce the problem to its bare essentials as a reinforcement learning problem, the algorithms for learning the control policies, and some of the lessons we learned. I graduated from the Technion with a BSc in Electrical Engineering and BA in mathematics (both summa cum laude) in 1996. After that I spent almost four years as an intelligence officer with the Israeli Defense Forces. I was subsequently involved in a few ventures in the high-tech industry. I earned my PhD in Electrical Engineering from the Technion at 2002, under the supervision of Nahum Shimkin. I was then a Fulbright postdoctoral associate with LIDS (MIT) working with John Tsitsiklis for two years. I was at the Department of Electrical and Computer Engineering in McGill University from July 2004 until August 2010, where I held a Canada Research Chair in Machine Learning from 2005 to 2009. I have been with the Department of Electrical Engineering at the Technion since 2008 where I am a professor. I am married to Tally and father to Liam, Oliver and Dylan.

1 0

Colloquium Speaker- Percy Liang Thurs Oct 1, 4:30pm
by Nicole E. Wagenblast 01 Oct '15

01 Oct '15

Colloquium Speaker Percy Liang, Stanford University Thursday, October 1st- 4:30pm Computer Science 105 Learning Hidden Computational Processes We are interested in prediction problems in which evaluating the learned function requires multiple intermediate steps of computation. One motivation is building a system that can answer complex questions: here the function would need to map "How many countries have held the Summer Olympics more than once?" to "3" by applying a sequence of aggregation and filtering operations on a database. In this talk, we examine two key machine learning problems that arise in this setting. First, how do we model the computational process? We argue that the classic paradigm of decoupling modeling from inference is inadequate, and we propose techniques that directly model the inference procedure. Second, learning is very difficult: in our example, the supervision "3" constrains the hidden computational process in a very indirect way. We propose methods that relax the output supervision in a parameterized way, and learn both the relaxation and model parameters jointly subject to an explicit computational constraint. Finally, we show some empirical progress on a new challenging question answering task. Percy Liang is an Assistant Professor of Computer Science at Stanford University (B.S. from MIT, 2004; Ph.D. from UC Berkeley, 2011). His research interests include (i) modeling natural language semantics, (ii) developing machine learning methods that infer rich latent structures from limited supervision, (iii) and studying the tradeoff between statistical and computational efficiency. He is a 2015 Sloan Research Fellow, 2014 Microsoft Research Faculty Fellow, a 2010 Siebel Scholar, and won the best student paper at the International Conference on Machine Learning in 2008.

1 4

Colloquium Speaker- Ming Zhang Tues Sept 29, 4:30pm
by Nicole E. Wagenblast 29 Sep '15

29 Sep '15

Colloquium Speaker Ming Zhang, Microsoft Research Tuesday, September 29, 4:30pm Computer Science 105 Software-Defined Datacenter Networks Today ’s cloud-scale services (e.g., search, social networking and cloud computing) operate on large datacenter networks (DCNs). Keeping these networks running smoothly is difficult, due to the sheer number of physical devices, the complexity of network software stack, and the dynamic nature of the environment. At any given moment, multiple devices experience component failures, are brought down for planned maintenance, are upgraded with new firmware, or are reconfigured to adapt to prevailing traffic demand. In this talk, I will go through some of the automated systems that are developed for managing the routing, configuration, and firmware and power of network devices in Microsoft Azure. I will first describe how NetPilot achieves fast, safe mitigation of common network failures by automatically deactivating or restarting offending links or devices. I will then describe how SWAN boosts the utilization of inter-datacenter networks by centrally controlling when and how much traffic each service sends and frequently reconfiguring the network’s data plane to match current traffic demand. Finally, I will present Network State Service (NSS) that manages the entire network state for Azure datacenter and wide-area networks. It serves as the foundation of multiple network management applications (including NetPilot and SWAN), allowing these applications to operate independently, while maintaining network-wide safety. Ming Zhang is a Senior Researcher in the Mobility and Networking group at Microsoft Research, where he focuses on datacenter and wide-area networking. He creates cutting-edge technologies that power Microsoft’s massive cloud networks. His research is published in leading systems and networking conferences including SIGCOMM, NSDI, OSDI, and MobiSys. His work on MobiPerf won the Open Internet App Award and People's Choice App Award in FCC Open Internet Challenge. He received his Ph.D. in Computer Science from Princeton University in 2005 and his B.S. in Computer Science from Nanjing University in 1999.

1 0

Colloquium Speaker- Ming Zhang Tues Sept 29, 4:30pm
by Nicole E. Wagenblast 28 Sep '15

28 Sep '15

Colloquium Speaker Ming Zhang, Microsoft Research Tuesday, September 29, 4:30pm Computer Science 105 Software-Defined Datacenter Networks Today ’s cloud-scale services (e.g., search, social networking and cloud computing) operate on large datacenter networks (DCNs). Keeping these networks running smoothly is difficult, due to the sheer number of physical devices, the complexity of network software stack, and the dynamic nature of the environment. At any given moment, multiple devices experience component failures, are brought down for planned maintenance, are upgraded with new firmware, or are reconfigured to adapt to prevailing traffic demand. In this talk, I will go through some of the automated systems that are developed for managing the routing, configuration, and firmware and power of network devices in Microsoft Azure. I will first describe how NetPilot achieves fast, safe mitigation of common network failures by automatically deactivating or restarting offending links or devices. I will then describe how SWAN boosts the utilization of inter-datacenter networks by centrally controlling when and how much traffic each service sends and frequently reconfiguring the network’s data plane to match current traffic demand. Finally, I will present Network State Service (NSS) that manages the entire network state for Azure datacenter and wide-area networks. It serves as the foundation of multiple network management applications (including NetPilot and SWAN), allowing these applications to operate independently, while maintaining network-wide safety. Ming Zhang is a Senior Researcher in the Mobility and Networking group at Microsoft Research, where he focuses on datacenter and wide-area networking. He creates cutting-edge technologies that power Microsoft’s massive cloud networks. His research is published in leading systems and networking conferences including SIGCOMM, NSDI, OSDI, and MobiSys. His work on MobiPerf won the Open Internet App Award and People's Choice App Award in FCC Open Internet Challenge. He received his Ph.D. in Computer Science from Princeton University in 2005 and his B.S. in Computer Science from Nanjing University in 1999.

1 0

PACM/CS Colloquium Speaker- Ben Recht, Monday Sept 28, 4:30pm
by Nicole E. Wagenblast 28 Sep '15

28 Sep '15

Ben Recht , University of California, Berkeley The Resilience of the Perceptron Monday, September 28th- 4:30pm 214 Fine Hall The most widely used optimization method in machine learning practice is the Perceptron Algorithm, also known as the Stochastic Gradient Method (SGM). This method has been used since the fifties to build statistical estimators, iteratively improving models by correcting errors observed on single data points. SGM is not only scalable, robust, and simple to implement, but achieves the state-of-the-art performance in many different domains. In contemporary systems, SGM powers enterprise analytics systems and is the workhorse tool used to train complex pattern-recognition systems in speech and vision. In this talk, I will explore why SGM has had such staying power, focusing on notions of stability and robustness. I will first discuss how SGM is robust to perturbations of the model and the updates. From a computing systems perspective, this robustness enables parallel implementations with minimal communication, with no locking or synchronization, and with strong spatial locality. I will then show how SGM is robust to perturbations of the data itself, and prove that any model trained with stochastic gradient method in a reasonable amount of time attains small generalization error. I will subsequently provide a new interpretation of common practices in neural networks, and provide a formal rationale for many popular techniques in training large, deep models.

1 2

4:30pm Thu Oct 15 talk on online learning and optimization in wireless networks (E-Quad B-205)
by Jennifer Rexford 24 Sep '15

24 Sep '15

> From: "Katharine G. Furda" <kfurda(a)Princeton.EDU> > Subject: EE Seminar - Thursday, October 15, 4:30pm, EQuad B205 - Bhaskar Krishnamachari > Date: September 24, 2015 at 11:00:02 AM EDT > To: ee-seminar(a)Princeton.EDU > Reply-To: "Katharine G. Furda" <kfurda(a)Princeton.EDU> > > > DEPARTMENT OF > ELECTRICAL ENGINEERING SEMINAR SERIES > > > > Speaker: Bhaskar Krishnamachari, University of Southern California > Title: Bandits and Newsvendors: Joint Online Learning and Optimization in Wireless Networks > Date: Thursday, October 15, 2015 > Time: 4:30pm > Room: E-Quad, B205 > Host: Mung Chiang > > > Abstract: Algorithms for online learning and decision-making under uncertainty have become popular in recent years to improve the performance of wireless networks in unknown dynamic environments. I will give a brief overview of certain classic problem formulations such as multi-armed bandits (MAB) and newsvendor problems, talk about their applications to wireless networking, and present some recent results from my group's research in this area. These include results for decentralized MAB, combinatorial MAB, contextual MAB, multi-period newsvendors, and optimized robotic network formation in unknown environments. This talk will cover joint work with students Dr. Yi Gai, Pranav Sarkar, Parisa Mansourifard, and Shangxing Wang, and faculty collaborators Rahul Jain, Tara Javidi, and Nora Ayanian. > > > Bio: Bhaskar Krishnamachari is an Associate Professor and Ming Hsieh Faculty Fellow in Electrical Engineering, and Director of the Autonomous Networks Research Group (http://anrg.usc.edu/ <http://anrg.usc.edu/>) at the University of Southern California's Viterbi School of Engineering. He works on the design and analysis of algorithms and protocols for next generation wireless networks. His co-authored papers have received best paper awards at IPSN (2004, 2010), MSWiM (2006) and MobiCom (2010), a best paper runner-up at SECON (2012), and a top-three paper at MSWiM (2014). He has received the NSF CAREER award (2004), the ASEE Terman Award (2010), and has been included on Technology Review Magazine's TR-35 list (2011), and Popular Science's Brilliant 10 list (2015). He has authored a book titled "Networking Wireless Sensors" published by Cambridge University Press. He is an Editor for the ACM Transactions on Sensor Networks, was the TPC Co-Chair for IPSN 2015, and is a TPC Co-Chair for WiOpt 2016.

1 0

Colloquium Speaker- Ming Zhang Tues Sept 29, 4:30pm
by Nicole E. Wagenblast 23 Sep '15

23 Sep '15

Colloquium Speaker Ming Zhang, Microsoft Research Tuesday, September 29, 4:30pm Computer Science 105 Software-Defined Datacenter Networks Today ’s cloud-scale services (e.g., search, social networking and cloud computing) operate on large datacenter networks (DCNs). Keeping these networks running smoothly is difficult, due to the sheer number of physical devices, the complexity of network software stack, and the dynamic nature of the environment. At any given moment, multiple devices experience component failures, are brought down for planned maintenance, are upgraded with new firmware, or are reconfigured to adapt to prevailing traffic demand. In this talk, I will go through some of the automated systems that are developed for managing the routing, configuration, and firmware and power of network devices in Microsoft Azure. I will first describe how NetPilot achieves fast, safe mitigation of common network failures by automatically deactivating or restarting offending links or devices. I will then describe how SWAN boosts the utilization of inter-datacenter networks by centrally controlling when and how much traffic each service sends and frequently reconfiguring the network’s data plane to match current traffic demand. Finally, I will present Network State Service (NSS) that manages the entire network state for Azure datacenter and wide-area networks. It serves as the foundation of multiple network management applications (including NetPilot and SWAN), allowing these applications to operate independently, while maintaining network-wide safety. Ming Zhang is a Senior Researcher in the Mobility and Networking group at Microsoft Research, where he focuses on datacenter and wide-area networking. He creates cutting-edge technologies that power Microsoft’s massive cloud networks. His research is published in leading systems and networking conferences including SIGCOMM, NSDI, OSDI, and MobiSys. His work on MobiPerf won the Open Internet App Award and People's Choice App Award in FCC Open Internet Challenge. He received his Ph.D. in Computer Science from Princeton University in 2005 and his B.S. in Computer Science from Nanjing University in 1999.

1 0

Thur Sep 17, 4:30pm, E-Quad B205-Anna Choromanska-Optimization for large-scale machine learning: large data and large model
by Jennifer Rexford 10 Sep '15

10 Sep '15

> > DEPARTMENT OF > ELECTRICAL ENGINEERING SEMINAR SERIES > > > > Speaker: Anna Choromanska, > Courant Institute of Mathematical Sciences, New York University > Title: Optimization for large-scale machine learning: large data and large model > Date: Thursday, September 17, 2015 > Time: 4:30pm > Room: E-Quad, B205 > Host: Emmanuel Abbe > > Abstract: The talk will focus on selected challenges in modern large-scale machine learning in two settings: i) large data setting and ii) large model (deep learning) setting. The first part of the talk will focus on the case when the learning algorithm needs to be scaled to large data. The multi-class classification problem will be addressed, where the number of classes (k) is extremely large, with the goal of obtaining train and test time complexity logarithmic in the number of classes. A reduction of this problem to a set of binary classification problems organized in a tree structure will be discussed. A top-down online tree construction approach for constructing logarithmic depth trees will be demonstrated, which is based on a new objective function. Under favorable conditions, the new approach leads to logarithmic depth trees that have leaves with low label entropy. Discussed approach comes with theoretical guarantees following from convex analysis, though the underlying problem is inherently non-convex. The second part of the talk focuses on the theoretical analysis of more challenging non-convex learning setting, deep learning with multilayer networks. Despite the success of convex methods, deep learning methods, where the objective is inherently highly non-convex, have enjoyed a resurgence of interest in the last few years and they achieve state-of-the-art performance. In the second part of the talk we move to the world of non-convex optimization where recent findings suggest that we might eventually be able to describe these approaches theoretically. The connection between the highly non-convex loss function of a simple model of the fully-connected feed-forward neural network and the Hamiltonian of the spherical spin-glass model will be established. It will be shown that under certain assumptions i) for large-size networks, most local minima are equivalent and yield similar performance on a test set, (ii) the probability of finding a “bad” local minimum, i.e. with high value of loss, is non-zero for small-size networks and decreases quickly with network size, (iii) struggling to find the global minimum on the training set (as opposed to one of the many good local ones) is not useful in practice and may lead to overfitting. Discussion of open problems concludes the talk. > > Bio: Anna Choromanska is a Post-Doctoral Associate in the Computer Science Department at Courant Institute of Mathematical Sciences, New York University. She is working in the Computational and Biological Learning Lab, which is a part of Computational Intelligence, Learning, Vision, and Robotics Lab, of Prof. Yann LeCun. She graduated with her PhD from Columbia University, Department of Electrical Engineering, where she was the The Fu Foundation School of Engineering and Applied Science Presidential Fellowship holder. She was advised by Prof. Tony Jebara. She completed her MSc with distinctions in the Department of Electronics and Information Technology, Warsaw University of Technology with double specialization, Electronics and Computer Engineering and Electronics and Informatics in Medicine. She was working with various industrial institutions, including AT&T Research Laboratories, IBM T.J. Watson Research Center and Microsoft Research New York. Her research interests are in machine learning, optimization and statistics with applications in biomedicine and neurobiology. She also holds a music degree from Mieczyslaw Karlowicz Music School in Warsaw, Department of Piano Play. She is an avid salsa dancer performing with the Ache Performance Group.

1 0