Event Archive

TechConnect 2020

inDuke Event
Location
Penn Pavilion, Duke University
Date and Time
-

TechConnect brings students and employers together for networking, education and connections. Twice each year, employers connect with Engineering and Computer Science students in an open, dynamic networking environment. Students come prepared with resumes to meet industry and tech representatives and learn about employment opportunities available, the characteristics employers seek, and also a realistic and insightful view of the job market and career paths for students interested in engineering and technical careers.

Active Learning Methods for Model Personalization in Mobile Health

Miscellaneous Talk
Speaker Name
Benjamin Marlin
Location
Bryan Research Room 103
Date and Time
-

In mobile health (mHealth), collecting momentary activity or behavioral state labels often comes at a significantly higher cost or level of user burden than collecting unlabeled data using passive sensing. This observation motivates the idea of attempting to optimize the collection of labeled data to minimize cost or burden when developing personalized models. In this talk, I will present on-going research on the problem of developing active learning methods for use in mobile health that leverage the affordances of this domain while respecting its unique constraints.

A Variational Perspective on Optimization, Sampling, and Games for Machine Learning

Duke Computer Science Colloquium
Speaker Name
Andre Wibisono
Location
LSRC D106
Date and Time
-

Machine learning has been successful and is prevalent in everyday life, shaping many aspects of modern society. Nevertheless, many fundamental questions remain, and it is important to develop a proper theoretical understanding of machine learning to guide its future development. In this talk I will discuss the fundamental properties of optimization, sampling, and game dynamics for machine learning.

Toward a New Theoretical Foundation for Machine Learning: The Lessons of Deep Learning

Duke Computer Science Colloquium
Speaker Name
Mikhail Belkin
Location
LSRC D106
Date and Time
-
In this talk I will discuss first steps toward a new theoretical foundations for modern ML. Furthermore, I will show how classical and modern ML models can be unified within a single "double descent" risk curve, which subsumes the classical U-shaped generalization curve and spans both parametric and non-parametric models. Finally, I will comment on the nature of the inductive biases, directions of future theoretical analyses and important implications for optimization.

On the Recent Progress on the Inapproximability of High Dimensional Clustering and the Johnson-Coverage Hypothesis

Algorithms Seminar
Speaker Name
Vincent Cohen-Addad
Location
LSRC D344
Date and Time
-
k-median, k-means, and k-minsum are amongst the three most popular objectives for clustering algorithms. Despite intensive effort, a complete understanding of the approximability of these objectives remains a major open problem. In this paper, we significantly improve upon the hardness of approximation factors known in literature.

Scalable Formal Methods

Triangle Computer Science Distinguished Lecturer Series
Speaker Name
Gul Agha
Location
LSRC D106
Date and Time
-

Concurrent systems may execute one of an exponential number of paths resulting in a large number of potential states. This often makes it infeasible to consider all possible behaviors of a system. Scalable formal methods, while not guaranteeing correctness, can provide greater confidence about properties of a system. The talk will describe three such methods: Statistical Model Checking (SMC), Euclidean Model Checking (EMC), and Predictive Runtime Verification (PRV).

Sparse Interpolation With Error Correction Beyond Redundant-Block Decoding

Algorithms Seminar
Speaker Name
Zhi-Hong Yang
Location
LSRC D344
Date and Time
-
This talk will present our recent work on sparse interpolation with error correction in a list-decoding manner: our algorithms compute in polynomial-time a list of all sparse interpolants that fit the black box inputs up to a maximal number E of errors. We will also mention algorithms for polynomials that are sparse in representation by orthogonal polynomials and applications to the sparse Fourier transform.

Computer Science Annual Department Holiday Party

Special Event
Location
JB Duke Hotel, Duke University
Date and Time
-

Holiday partyPlease join us for the Computer Science Department's annual holiday celebration. Families are welcome. This is a popular event, so please register today!

Date: Friday, December 6, 2019

Place: JB Duke Hotel

Time: 5:30 pm - 8:30 pm

Conformal Change of Metrics in Data Analysis

Algorithms Seminar
Speaker Name
Don Sheehy
Location
LSRC D344
Date and Time
-

I will survey a variety of algorithmic settings in which one would like to compute (or at least use) distances between points that are induced by local scaling of space.  I will track this idea through topics in mesh generation, surface reconstruction, and robotics.  Then, I will discuss some recent results on exact computation of such distances for the special case where the local scaling of space is proportional to the distance to the input.  This gives the first example of an exact computation for a so-called density-based distance.  

Canceled If You Want to be Rich, Get A Lot of Money: Theory and Systems for Weak Supervision

Triangle Computer Science Distinguished Lecturer Series
Speaker Name
Christopher Ré
Location
LSRC D106
Date and Time
-

 

If you want to build a high-quality machine learning product, build a large, high-quality training set. At first glance, this seems as useful as the statement “if you want to be rich, get a lot of money.” However, a key idea driving our work is that new theoretical and systems concepts including weak supervision, automatic data augmentation policies, and more, can enable engineers to build training sets more quickly and cost effectively.

The Battle of Internet Censorship: Bridging the Gap Between Theory and Practice

Duke Computer Science Colloquium
Speaker Name
Amir Houmansadr
Location
LSRC D106
Date and Time
-
My research aims at making Internet communications more secure and privacy-preserving. In this talk, I will focus on the design, implementation, and analysis of tools that help users bypass Internet censorship. I will discuss the major challenges in building effective censorship circumvention tools, and will introduce several theoretical and empirical directions towards reliable censorship circumvention.

Faster Minimum k-cut of a Simple Graph

Algorithms Seminar
Speaker Name
Jason Li
Location
LSRC D344
Date and Time
-

We consider the (exact, minimum) k-cut problem: given a graph and an integer k, delete a minimum-weight set of edges so that the remaining graph has at least k connected components. This problem is a natural generalization of the global minimum cut problem, where the goal is to break the graph into k=2 pieces.

From Visual Recognition to Visual Understanding

Duke Computer Science Colloquium
Speaker Name
Laurens van der Maaten
Location
LSRC D106
Date and Time
-
This talk gives an overview of some of our recent work on visual recognition and visual understanding. The first part of the talk considers visual recognition. It presents results of experiments in which we train convolutional networks on billions of weakly supervised web images. The second part of the talk raises the question whether recent successes in visual recognition also pave the way towards visual understanding.

The Design of a Wearable Application to Measure Anxiety with a Digital Fidget Toy

Master's Defense
Speaker Name
Yuxi Yang
Location
North 311
Date and Time
-

Anxiety is one of the main symptoms of some major disorders, such as general anxiety disorder (GAD) and attention-deficit/hyperactivity disorder (ADHD). Several biomarkers including heart rate (HR), heart rate vitality (HRV), excessive motions, etc. can be good metrics of anxiety levels, thus good metrics of GAD or ADHD. On one hand, with the development of mobile and wearable sensors, recent researches rise in the measurement of HR with wearable devices or self-reported results on mobile devices [23].

Black-box Anonymous Proofs

Algorithms Seminar
Speaker Name
Alessandra Scafuro
Location
LSRC D344
Date and Time
-
A cryptographic protocol is black-box if it uses the underlying cryptographic primitives as oracles. However, when only oracle access is allowed, is much more challenging to devise proofs in the anonymous setting. In this talk we will show techniques for building black-box anonymous proof systems that use only a hash function as an oracle.

Towards Fully Automated Interpretation of Volumetric Medical Images

Master's Defense
Speaker Name
Rachel Draelos
Location
LSRC D344
Date and Time
-

Computed tomography (CT) is a medical imaging technique used for the diagnosis and management of numerous conditions, including cancer, fractures, and infections. Automated interpretation of CT scans using machine learning holds immense promise: it may accelerate the radiology workflow, bring radiology expertise to underserved areas, and reduce missed diagnoses caused by human error.

ICPC Mid-Atlantic Regional Programming Contest

Special Event
Location
LSRC D-wing - multiple offices
Date and Time
-

The regional competition is the first tier of the ICPC International Collegiate Programming Contest (formerly known as the ACM International Collegiate Programming Contest). The Mid-Atlantic Region covers southern New Jersey, eastern Pennsylvania, Delaware, Maryland, the District of Columbia, Virginia, and North Carolina. For more information, see the Mid-Atlantic Regional Programming Contest or The ICPC International Collegiate Programming Contest.

Efficient Allocation of Free Stuff

Joint Algorithms/CS-ECON Seminar
Speaker Name
Yossi Azar
Location
LSRC D344
Date and Time
-
We study online matching settings with selfish agents when everything is free. Inconsiderate agents break ties arbitrarily amongst equal maximal value available choices, even if the maximal value is equal to zero. Even for the simplest case of zero/one valuations, where agents arrive online in an arbitrary order, and agents are restricted to taking at most one item, the resulting social welfare may be negligible for a deterministic algorithm. We overcome this challenge by introducing a new class of algorithms, which we refer to as prioritization algorithms.

General Framework for Metric Optimization Problems with Delay or with Deadlines

Algorithms Seminar
Speaker Name
Noam Touitou
Location
LSRC D344
Date and Time
-

We present a framework used to construct and analyze algorithms for online optimization problems with deadlines or with delay over a metric space. Using this framework, we present algorithms for several different problems. We present an O(D^2)-competitive deterministic algorithm for online multilevel aggregation with delay on a tree of depth D, an exponential improvement over the O(D^4 * 2^D)-competitive algorithm of Bienkowski et al. (ESA '16), where the only previously-known improvement was for the special case of deadlines by Buchbinder et al. (SODA '17).

A Personal History of Computers

Triangle Computer Science Distinguished Lecturer Series
Speaker Name
Frederick P. Brooks Jr.
Location
LSRC D106
Date and Time
-

Born a half-generation after the computer pioneers, I knew most of them.  This talk will sketch an early history of computers, emphasizing the personalities rather than the technology, and the parts I know from personal experience rather than uniform coverage.