September 2019 - talks - lists.cs.princeton.edu

Oct 2: Diverse Decoding from Neural Sequence Models, Ashwin Kalyan (Georgia Tech)
by Karthik Narasimhan 01 Oct '19

01 Oct '19

Location: CS 402 Date: Oct 2, 2019 Time: 3 - 4pm Title: Diverse Decoding from Neural Sequence Models Abstract: Consider assistive technology like Google’s auto response that suggests replies with multiple intents. The ability to produce multiple diverse outputs is an integral component of such assistive systems and further, the fundamental problem of producing diverse outputs shows up across domains. In this talk, I will first introduce Diverse Beam Search (DBS) — a modification to the popular Beam Search algorithm that encourages diversity in the sequences decoded from neural sequence models. Then, I will present 𝛁BS, a fully-differentiable variant that directly models sets of sequences while optimizing more general set-level metrics including diversity. While both algorithms are task-agnostic, I will discuss their effectiveness in the context of image captioning. Bio: Ashwin Kalyan is a PhD student at Georgia Tech advised by Prof. Dhruv Batra. He is interested in developing machine learning solutions for producing diverse outputs, developing fast and accurate reasoning systems and modeling human preferences — all essential components of effective assistive technology. During his PhD, he has interned at Microsoft Research and IBM. He is also a professional violinist specializing in Karnatic Classical Music.

1 1

FW: Kurt James Werner visiting electronic music circuit modeling lecture this Wednesday, Sept 25, 5pm
by Emily Lawrence 23 Sep '19

23 Sep '19

I'm excited to let people know about a talk being presented by a visitor on Wednesday, Sept 25, at 5pm, in the PLOrk studio (Effron Music Building). Kurt James Werner will be visiting and talking about his music and giving an introduction to the techniques he uses to model analog audio circuits digitally, Wave Digital Filters (WDF). All are welcome, it's FREE and open to the public. Hope to see you there! Jeff Snyder Director of Electronic Music Princeton University --- Details below: WHEN: Wednesday, Sept 25 5pm-7pm WHERE: PLOrk Studio on the Forum Level of the Effron Music Building (in the new Lewis Arts Complex) FREE and open to the public Title: Virtual Analog Modeling using Wave Digital Filters: a Tutorial Introduction Bio: Dr. Kurt James Werner conducts research related to virtual analog (especially Wave Digital Filters), the history of music technology, 1-bit music, computer modeling of circuit-bent instruments, & sound synthesis more broadly. As part of his Ph.D. in Computer-Based Music Theory and Acoustics from Stanford University's Center for Computer Research in Music and Acoustics (CCRMA), he wrote a doctoral dissertation “Virtual Analog Modeling of Audio Circuitry Using Wave Digital Filters.” This greatly expanded the class of circuits that can be modeled using the Wave Digital Filter approach, using the classic Roland TR-808 bass drum circuit as a case study. As a researcher, he has also worked on the history of analog drum machine circuits. As a composer, his music references elements of chiptunes, musique concrète, circuit bending, algorithmic/generative composition, & breakbeat. As a Lecturer in Audio, he was based out of the Sonic Arts Research Centre (SARC) of Queen's University Belfast for several years, and will soon (in 1 week!) start a new position as a Research Engineer at iZotope, Inc. in Cambridge, MA. Synopsis: In this tutorial, the basics of the "Wave Digital Filter" (WDF) approach to virtual analog modeling will be presented. The WDF concept was introduced as a generic digital filter design technique by Alfred Fettweis in the 1970s, and has been picked up slowly by the audio DSP community starting in the early 2000s. Today, WDFs are capable of modeling audio circuits with complex topologies (bridges, feedback, &c.) and multiple nonlinearities (diodes, transistors, &c.) and can be considered one of the main approaches to modeling audio circuits in software. A wide variety of audio circuits have been successfully modeled, including the Roland TR-808 bass drum, amplifier tone stacks, Ibanez Tube Screamer, OTA-based state variable filters, tone boosters, the Electro-Harmonix Big Muff Pi, the Korg MS-50 VCF, & Fender and Mesa Boogie preamplifiers. The main focus of the talk will be the basic mathematical concepts that underpin WDF modeling and tutorial examples, including a simple RC lowpass filter & the Hammond organ vibrato/chorus circuit. Some progress on modeling a mysterious analog filter from the Experimental Music Studios (EMS) of the University of Illinois at Urbana-Champaign (UIUC) will also be presented. -- Composer, musician, instrument designer scattershot.org <http://scattershot.org> * @snyderphonics

1 0

Reminder: Colloquium Speaker Muhammad Jehangir Amjad : TODAY at 1:30pm
by Emily C. Lawrence 18 Sep '19

18 Sep '19

Colloquium Speaker Muhammad Jehangir Amjad from Google Wednesday, September 18 - 1:30pm Computer Science - Room 105 Host: Jennifer Rexford [ https://www.cs.princeton.edu/events/25874 | https://www.cs.princeton.edu/events/25874 ] Challenges in Cloud Networking Google's products, e.g. Search, YouTube, Gmail, etc. are used by billions of people the world over. Google Cloud hosts some of the most popular services in the world. Building systems that scale to support all these applications is among the greatest challenges at the company. Underlying all these systems is the network which must enable low-latency, high throughput, high capacity, high availability and secure access to compute and storage. While Google has been enormously successful in achieving these goals, cloud networking faces exciting new challenges today. With the demise of Moore's Law and explosive data growth, the implications for the performance, reliability, predictability and cost efficiency on networking, from hardware to communication protocols, will be profound. This talk will focus on highlighting some of the challenges in networking alluded to above. Additionally, we will discuss the current and future challenges in network telemetry systems and Google's approach to overcoming these challenges via statistical inference which allows us to estimate that which cannot be measured. Bio: Muhammad Jehangir Amjad is a Software Engineer in the Network Infrastructure team at Google working on inference and statistical learning on data produced by network telemetry systems. He joined Google from MIT where he has an appointment as a Lecturer of Machine Learning in CSAIL. Jehangir received his PhD from the Operations Research Center (ORC) and Laboratory of Information and Decision Systems (LIDS) at MIT, under the supervision of Prof Devavrat Shah. He received his BSE in Electrical Engineering from Princeton University.

1 0

Reminder: Colloquium Speaker Roxana Geambasu TODAY at 12:30pm
by Emily C. Lawrence 17 Sep '19

17 Sep '19

Colloquium Speaker Roxana Geambasu from Columbia University Tuesday, September 17 - 12:30pm Computer Science - Room 105 Host: Amit Levy [ https://www.cs.princeton.edu/events/25871 | https://www.cs.princeton.edu/events/25871 ] Security and Privacy Guarantees in Machine Learning with Differential Privacy Machine learning (ML) is becoming a critical foundation for how we construct the code driving our applications, cars, and life-changing financial decisions. Yet, it is often brittle and unstable, making decisions that are hard to understand and can be exploited. As one example, tiny changes to an input can cause dramatic changes in predictions; this results in decisions that surprise, appear unfair, or enable attack vectors such as adversarial examples. As another example, models trained on users' data have been shown to encode not only general trends from large datasets but also very specific, personal information from these datasets, such as social security numbers and credit card numbers from emails; this threatens to expose users' secrets through ML predictions or parameters. Over the years, researchers have proposed various approaches to address these rather distinct security, privacy, and transparency challenges. Most of the work has been best effort, which is insufficient if ML is to become a rigorous basis for how we construct our code. This talk positions differential privacy (DP) -- a theory developed by the privacy community -- as a versatile foundation for building into ML much-needed guarantees of not only privacy but also of security, stability, and transparency. As supporting evidence, I first present PixelDP , a scalable certified defense against adversarial examples that leverages DP theory to guarantee a level of robustness against this attack. I then present Sage, a DP ML platform that bounds the leakage of personal secrets through ML models while addressing some of the most pressing challenges of DP, such as the "running out of privacy budget" problem. Both PixelDP and Sage are designed from a pragmatic systems perspective and illustrate that DP theory is powerful but requires adaptation to achieve practical guarantees for ML workloads. Bio: Roxana Geambasu is an Associate Professor of Computer Science at Columbia University and a member of Columbia's Data Sciences Institute. She joined Columbia in Fall 2011 after finishing her Ph.D. at the University of Washington. For her work in cloud and mobile data privacy, she received: an Alfred P. Sloan Faculty Fellowship, an NSF CAREER award, a Microsoft Research Faculty Fellowship, several Google Faculty awards, a "Brilliant 10" Popular Science nomination, the Honorable Mention for the 2013 inaugural Dennis M. Ritchie Doctoral Dissertation Award, a William Chan Dissertation Award, two best paper awards at top systems conferences, and the first Google Ph.D. Fellowship in Cloud Computing.

1 0

Colloquium Speaker Muhammad Jehangir Amjad : Wednesday, Sept. 18
by Emily C. Lawrence 11 Sep '19

11 Sep '19

Colloquium Speaker Muhammad Jehangir Amjad from Google Wednesday, September 18 - 1:30pm Computer Science - Room 105 Host: Jennifer Rexford [ https://www.cs.princeton.edu/events/25874 | https://www.cs.princeton.edu/events/25874 ] Challenges in Cloud Networking Google's products, e.g. Search, YouTube, Gmail, etc. are used by billions of people the world over. Google Cloud hosts some of the most popular services in the world. Building systems that scale to support all these applications is among the greatest challenges at the company. Underlying all these systems is the network which must enable low-latency, high throughput, high capacity, high availability and secure access to compute and storage. While Google has been enormously successful in achieving these goals, cloud networking faces exciting new challenges today. With the demise of Moore's Law and explosive data growth, the implications for the performance, reliability, predictability and cost efficiency on networking, from hardware to communication protocols, will be profound. This talk will focus on highlighting some of the challenges in networking alluded to above. Additionally, we will discuss the current and future challenges in network telemetry systems and Google's approach to overcoming these challenges via statistical inference which allows us to estimate that which cannot be measured. Bio: Muhammad Jehangir Amjad is a Software Engineer in the Network Infrastructure team at Google working on inference and statistical learning on data produced by network telemetry systems. He joined Google from MIT where he has an appointment as a Lecturer of Machine Learning in CSAIL. Jehangir received his PhD from the Operations Research Center (ORC) and Laboratory of Information and Decision Systems (LIDS) at MIT, under the supervision of Prof Devavrat Shah. He received his BSE in Electrical Engineering from Princeton University.

1 0

Paul Ellenbogen will present his Pre-FPO, "Long range familial searches of genetic databases: New techniques and policy implications" on Tuesday, September 17, 2019 in CS 402 at 2:30pm
by Nicki Mahler 10 Sep '19

10 Sep '19

Paul Ellenbogen will present his Pre-FPO, "Long range familial searches of genetic databases: New techniques and policy implications" on Tuesday, September 17, 2019 in CS 402 at 2:30pm. The members of his committee are as follows: Arvind Narayanan (adviser), Ed Felten, Jonathan Mayer, Mona Singh, and Olga Troyanskaya. Everyone is invited to attend his talk. The talk title and abstract follow below. "Long range familial searches of genetic databases: New techniques and policy implications" Abstract: Consumer genetics databases hold dense genotypes of millions of people, and the number is growing quickly. In 2018, law enforcement agencies began using such databases to identify anonymous DNA via long-range familial searches. I show that this technique is far more powerful if combined with a genealogical database of the type collected by online ancestry services. I present a “genealogical triangulation” algorithm and study its effectiveness on simulated datasets. I show that for over 50% of targets, their anonymous DNA can be identified (matched to the correct individual or same-sex sibling) when the genetic database includes just 1% of the population. I also show the effectiveness of “snowball identification'” in which a successful identification adds to the genetic genealogical database, increasing the identification accuracy for future instances. I next turn to the policy implications of recent advances in familial searches, including the novel technique that I developed. I compare commercial databases to existing law enforcement databases. The existence of commercial databases and new familial searching requires new regulations. I argue for warrant requirements for law enforcement use of familial search against commercial databases. I also argue that websites that allow for user uploads must cryptographically verify the authenticity of those uploads to prevent re identification attacks.

1 0

Colloquium Speaker Roxana Geambasu: Tuesday, Sept. 17
by Emily C. Lawrence 10 Sep '19

10 Sep '19

Colloquium Speaker Roxana Geambasu from Columbia University Tuesday, September 17 - 12:30pm Computer Science - Room 105 Host: Amit Levy [ https://www.cs.princeton.edu/events/25871 | https://www.cs.princeton.edu/events/25871 ] Security and Privacy Guarantees in Machine Learning with Differential Privacy Machine learning (ML) is becoming a critical foundation for how we construct the code driving our applications, cars, and life-changing financial decisions. Yet, it is often brittle and unstable, making decisions that are hard to understand and can be exploited. As one example, tiny changes to an input can cause dramatic changes in predictions; this results in decisions that surprise, appear unfair, or enable attack vectors such as adversarial examples. As another example, models trained on users' data have been shown to encode not only general trends from large datasets but also very specific, personal information from these datasets, such as social security numbers and credit card numbers from emails; this threatens to expose users' secrets through ML predictions or parameters. Over the years, researchers have proposed various approaches to address these rather distinct security, privacy, and transparency challenges. Most of the work has been best effort, which is insufficient if ML is to become a rigorous basis for how we construct our code. This talk positions differential privacy (DP) -- a theory developed by the privacy community -- as a versatile foundation for building into ML much-needed guarantees of not only privacy but also of security, stability, and transparency. As supporting evidence, I first present PixelDP , a scalable certified defense against adversarial examples that leverages DP theory to guarantee a level of robustness against this attack. I then present Sage, a DP ML platform that bounds the leakage of personal secrets through ML models while addressing some of the most pressing challenges of DP, such as the "running out of privacy budget" problem. Both PixelDP and Sage are designed from a pragmatic systems perspective and illustrate that DP theory is powerful but requires adaptation to achieve practical guarantees for ML workloads. Bio: Roxana Geambasu is an Associate Professor of Computer Science at Columbia University and a member of Columbia's Data Sciences Institute. She joined Columbia in Fall 2011 after finishing her Ph.D. at the University of Washington. For her work in cloud and mobile data privacy, she received: an Alfred P. Sloan Faculty Fellowship, an NSF CAREER award, a Microsoft Research Faculty Fellowship, several Google Faculty awards, a "Brilliant 10" Popular Science nomination, the Honorable Mention for the 2013 inaugural Dennis M. Ritchie Doctoral Dissertation Award, a William Chan Dissertation Award, two best paper awards at top systems conferences, and the first Google Ph.D. Fellowship in Cloud Computing.

1 0

Prof. Andrew Houck, EE, Tuesday, Sept 10 at Quadrangle Club
by Emily C. Lawrence 03 Sep '19

03 Sep '19

A Princeton Propeller Event at Quadrangle Club Please join us for cocktails & hors d’oeuvres… 6:00pm, Tuesday, September 10th, 2019 33 Prospect Ave., Quadrangle Club Speaker: Prof. Andrew Houck, Electrical Engineering “Decoding the Realm(s) of Quantum Computing: Tilting at Tackling the Computationally Infeasible” Quantum Computing is poised to revolutionize myriad fields: cryptography, chemistry, medicine, optimization and machine learning. In contrast to familiar transistors, with a state 0 or 1, the quantum analog of a transistor or bit of information, aka a qubit, can be in a “superposition” of 0 and 1 simultaneously (e.g., 0 + 1, 0 - 1); and multiple qubits can be entangled, i.e., their states depend on each other. These two principles, superposition and entanglement, could enable powerful new algorithms to solve problems far beyond the capacity of today’s digital computing. Like the aviation term, “holding patterns,” maneuvers designed to delay something already in flight, while keeping it within a specified distance --- Quantum Computing may in the next decade bring such exciting new achievements as: factoring large numbers; allowing for RSA decryption; calculating binding energies of complex molecules; and solving large-scale brute-force problems. Andrew Houck, BSE Princeton 2000, PhD Harvard 2005, will introduce us to this strange new world and describe how it’s likely to transform ours. REGISTRATION REQUIRED via [ http://propellers.princetonaaa.org/ | http://propellers.princetonaaa.org/ ]

1 0