Title
Topic
-
‘Explaining Dataset Changes for Semantic Data Versioning With Explain-Da-V’
“In multi-user environments in which data science and analysis is collaborative, multiple versions of the same datasets are generated. While managing and storing data versions has received some attention in the research literature, the semantic nature of such changes has remained under-explored. In this work, we introduce Explain-Da-V, a framework aiming to explain changes between two given dataset versions. Explain-Da-V generates explanations that use data transformations to explain changes. We further introduce a set of measures that evaluate the validity, generalizability, and explainability of these explanations.” Find the paper and full list of authors in VLDB Endowment proceedings.
-
‘Table Discovery in Data Lakes: State-of-the-Art and Future Directions’
“Data discovery refers to a set of tasks that enable users and downstream applications to explore and gain insights from massive collections of data sources such as data lakes. In this tutorial, we will provide a comprehensive overview of the most recent table discovery techniques developed by the data management community. We will cover table understanding tasks such as domain discovery, table annotation, and table representation learning which help data lake systems capture semantics of tables.” Find the paper and the full list of authors in the Companion of the 2023 International Conference on Management of Data.
-
‘SANTOS: Relationship-Based Semantic Table Union Search’
“Existing techniques for unionable table search define unionability using metadata (tables must have the same or similar schemas) or column-based metrics (for example, the values in a table should be drawn from the same domain). In this work, we introduce the use of semantic relationships between pairs of columns in a table to improve the accuracy of the union search. Consequently, we introduce a new notion of unionability that considers relationships between columns, together with the semantics of columns, in a principled way.” Find the paper and full list of authors in the Proceedings of ACM on Management of Data.
-
‘Direct Superpoints Matching for Fast and Robust Point Cloud Registration’
“Although deep neural networks endow the downsampled superpoints with discriminative feature representations, directly matching them is usually not used alone in state-of-the-art methods. … Existing approaches use the coarse-to-fine strategy to propagate the superpoints correspondences to the point level, which are not discriminative enough and further necessitates the postprocessing refinement. In this paper, we present a simple yet effective approach to extract correspondences by directly matching superpoints using a global softmax layer in an end-to-end manner, which are used to determine the rigid transformation between the source and target point cloud.” Find the paper and full list of authors at…
-
‘Do Machine Learning Models Produce TypeScript Types That Type Check? (Artifact)’
“Type migration is the process of adding types to untyped code to gain assurance at compile time. TypeScript and other gradual type systems facilitate type migration by allowing programmers to start with imprecise types and gradually strengthen them. … In this paper we argue that accuracy can be misleading, and we should address a different question: can an automatic type migration tool produce code that passes the TypeScript type checker? We present TypeWeaver, a TypeScript type migration tool that can be used with an arbitrary type prediction model.” Find the paper and full list of authors at Dagstuhl Research Online…
-
‘Online Learning in Multi-Unit Auctions’
“We consider repeated multi-unit auctions with uniform pricing, which are widely used in practice for allocating goods such as carbon licenses. In each round, K identical units of a good are sold to a group of buyers that have valuations with diminishing marginal returns. The buyers submit bids for the units, and then a price p is set per unit so that all the units are sold. We consider two variants of the auction, where the price is set to the K-th highest bid and (K+1)-st highest bid, respectively.” Find the paper and full list of authors at ArXiv.
-
‘State of the Art of Visual Analytics for eXplainable Deep Learning’
“The use and creation of machine-learning-based solutions to solve problems or reduce their computational costs are becoming increasingly widespread in many domains. … This survey aims to (i) systematically report the contributions of Visual Analytics for eXplainable Deep Learning; (ii) spot gaps and challenges; (iii) serve as an anthology of visual analytical solutions ready to be exploited and put into operation by the Deep Learning community (architects, trainers and end users) and (iv) prove the degree of maturity, ease of integration and results for specific domains.” Find the paper and full list of authors at Computer Graphics Forum.
-
Libby awarded $1.96M Early-Stage Investigator Grant from NIH
“Elizabeth Libby, assistant professor of bioengineering, recently received a five-year, $1.96 million Early Stage Investigator R35 MIRA (Maximizing Investigator’s Research Award) grant from the National Institutes of Health for ‘Physiological and Developmental Role of Bacterial Ser/Thr Kinases.’ Libby’s research is focused on how bacteria develop resistance at the cellular level—knowledge that will be crucial to the development of more effective antibiotics.”
-
Rouhanifard receives $3.4M NIH grant for modified mRNA research
“Bioengineering assistant professor Sara Rouhanifard was awarded a $3.4 million NIH R01 grant for ‘Synthetic mRNA Control Set for Nanopore-Based Pseudouridine Modification Profiling in Human Transcriptomes.’ The research has the potential to vastly increase insight into the epitranscriptome—changes in chemical modifications of RNA that can affect gene expression within cells—which could help identify new therapeutic targets and lead to new classes of drugs.”
-
‘Adapting Transformer Language Models for Predictive Typing in Brain-Computer Interfaces’
“Brain-computer interfaces (BCI) are an important mode of alternative and augmentative communication for many people. Unlike keyboards, many BCI systems do not display even the 26 letters of English at one time, let alone all the symbols in more complex systems. Using language models to make character-level predictions, therefore, can greatly speed up BCI typing (Ghosh and Kristensson, 2017). While most existing BCI systems employ character n-gram models or no LM at all, this paper adapts several wordpiece-level Transformer LMs to make character predictions and evaluates them on typing tasks.” Find the paper and the full list of authors at ArXiv.
-
‘Composition and Deformance: Measuring Imageability With a Text-to-Image Model’
“Although psycholinguists and psychologists have long studied the tendency of linguistic strings to evoke mental images in hearers or readers, most computational studies have applied this concept of imageability only to isolated words. Using recent developments in text-to-image generation models, such as DALLE mini, we propose computational methods that use generated images to measure the imageability of both single English words and connected text. We sample text prompts for image generation … [and] subject these prompts to different deformances to examine the model’s ability to detect changes in imageability caused by compositional change.” Find the paper and full authors list…
-
‘Adaptively Secure MPC With Sublinear Communication Complexity’
“A central challenge in the study of MPC is to balance between security guarantees, hardness assumptions, and resources required for the protocol. In this work, we study the cost of tolerating adaptive corruptions in MPC protocols under various corruption thresholds. … Our results highlight that the asymptotic cost of adaptive security can be reduced to be comparable to, and in many settings almost match, that of static security, with only a little sacrifice to the concrete round complexity and asymptotic communication complexity.” Find the paper and the full list of authors at the Journal of Cryptology.
-
‘Threshold ECDSA in Three Rounds’
” “We present a three-round protocol for threshold ECDSA signing with malicious security against a dishonest majority, which information-theoretically UC-realizes a standard threshold signing functionality, assuming ideal commitment and two-party multiplication primitives. Our work improves upon and fully subsumes the DKLs t-of-n and 2-of-n protocols. This document focuses on providing a succinct but complete description of the protocol and its security proof, and contains little expository text.” Find the paper and the full list of authors at the Cryptology ePrint Archive.
-
‘Threshold BBS+ Signatures for Distributed Anonymous Credential Issuance’
“We propose a secure multiparty signing protocol for the BBS+ signature scheme; in other words, an anonymous credential scheme with threshold issuance. We prove that due to the structure of the BBS+ signature, simply verifying the signature produced by an otherwise semi-honest protocol is sufficient to achieve composable security against a malicious adversary. Consequently, our protocol is extremely simple and efficient: it involves a single request from the client … to the signing parties, two exchanges of messages among the signing parties, and finally a response to the client.” Find the paper and full list of authors at Cryptology ePrint…
-
‘JaX: Detecting and Cancelling High-Power Jammers Using Convolutional Neural Network’
“We present JaX, a novel approach for detecting and cancelling high-power jammers in the scenarios when the traditional spread spectrum techniques and other jammer avoidance approaches are not sufficient. JaX does not require explicit probes, sounding, training sequences, channel estimation, or the cooperation of the transmitter. We identify and address multiple challenges, resulting in a convolutional neural network for a multi-antenna system to infer the existence of interference, the number of interfering emissions and their respective phases.” Find the paper and full list of authors in the 16th ACM Conference on Security and Privacy in Wireless and Mobile Networks proceedings.
-
‘A Formal Analysis of Karn’s Algorithm’
“The stability of the Internet relies on timeouts. The timeout value, known as the Retransmission TimeOut (RTO), is constantly updated, based on sampling the Round Trip Time (RTT) of each packet as measured by its sender – that is, the time between when the sender transmits a packet and receives a corresponding acknowledgement. Many of the Internet protocols compute those samples via the same sampling mechanism, known as Karn’s Algorithm. We present a formal description of the algorithm, and study its properties.” Find the paper and the full list of authors in Networked Systems.
-
‘Evaluating the Impact of Community Oversight for Managing Mobile Privacy and Security’
“Mobile privacy and security can be a collaborative process where individuals seek advice and help from their trusted communities. To support such collective privacy and security management, we developed a mobile app for Community Oversight of Privacy and Security (“CO-oPS”) that allows community members to review one another’s apps installed and permissions granted to provide feedback. … Measures of transparency, trust, and awareness of one another’s mobile privacy and security behaviors, along with individual and community participation in mobile privacy and security co-management, increased from pre- to post-study.” Find the paper and the full list of authors at ArXiv.
-
‘Disaster World: Decision-Theoretic Agents for Simulating Population Responses to Hurricanes’
“Artificial intelligence (AI) research provides a rich source of modeling languages capable of generating socially plausible simulations of human behavior, while also providing a transparent ground truth that can support validation of social-science methods applied to that simulation. In this work, we leverage two established AI representations: decision-theoretic planning and recursive modeling. … We used PsychSim, a multiagent social-simulation framework combining these two AI frameworks, to build a general parameterized model of human behavior during disaster response, grounding the model in social-psychological theories to ensure social plausibility.” Find the paper and the full list of authors at Computational and Mathematical Organization…
-
‘Effectiveness of Teamwork-Level Interventions Through Decision-Theoretic Reasoning in a Minecraft Search-and-Rescue Task’
“Autonomous agents offer the promise of improved human teamwork through automated assessment and assistance during task performance. Studies of human teamwork have identified various processes that underlie joint task performance, while abstracting away the specifics of the task.We present here an agent that focuses exclusively on teamwork-level variables in deciding what interventions to use in assisting a human team. Our agent … relies on input from analytic components (ACs) (developed by other research teams) that process environmental information and output only teamwork-relevant measures.” Find the paper and authors list in the 2023 International Conference on Autonomous Agents and Multiagent Systems…
-
‘Agent-Based Modeling of Human Decision-Makers Under Uncertain Information During Supply Chain Shortages’
“In recent years, product shortages caused by supply chain disruptions have generated problems for consumers worldwide. … Understanding how humans learn to interpret information from others and how it influences their decision-making is key to alleviating supply chain shortages. In this work, we investigated how downstream supply chain echelons, health centers in pharmaceutical supply chains, interpret and use manufacturers’ estimated resupply date (ERD) information during drug shortages.” Find the paper and the full list of authors in the 2023 International Conference on Autonomous Agents and Multiagent Systems proceedings.
-
‘Scaling Up and Stabilizing Differentiable Planning with Implicit Differentiation’
“Differentiable planning promises end-to-end differentiability and adaptivity. However, an issue prevents it from scaling up to larger-scale problems: they need to differentiate through forward iteration layers to compute gradients, which couples forward computation and backpropagation and needs to balance forward planner performance and computational cost of the backward pass. … We propose to differentiate through the Bellman fixed-point equation to decouple forward and backward passes for Value Iteration Network and its variants, which enables constant backward cost (in planning horizon) and flexible forward budget and helps scale up to large tasks.” Find the paper and full list of authors at Open…
-
‘When Fair Classification Meets Noisy Protected Attributes’
“The operationalization of algorithmic fairness comes with several practical challenges, … [including] the availability or reliability of protected attributes in datasets. In real-world contexts, practical and legal impediments may prevent the collection and use of demographic data, making it difficult to ensure algorithmic fairness. … recent proposals aim to achieve algorithmic fairness in classification by incorporating noisiness in protected attributes or not using protected attributes at all. … Our study reveals that attribute-blind and noise-tolerant fair classifiers can potentially achieve similar level of performance as attribute-reliant algorithms, even when protected attributes are noisy.” Find the paper and full list of…
-
‘Malicious Selling Strategies in Livestream E-Commerce: A Case Study of Alibaba’s Taobao and ByteDance’s TikTok’
“We sought to explore streamers’ malicious selling strategies and understand how viewers perceive these strategies. First, we recorded 40 livestream shopping sessions from two popular livestream platforms in China—Taobao and TikTok. We identified 16 malicious selling strategies that were used to deceive, coerce, or manipulate viewers and found that platform designs enhanced nine of the malicious selling strategies. Second, through an interview study with 13 viewers, we report three challenges of overcoming malicious selling in relation to imbalanced power between viewers, streamers, and the platforms.” Find the paper and full list of authors at ACM Transactions on Computer-Human Interactions.
-
‘Towards Unbiased Exploration in Partial Label Learning’
“We consider learning a probabilistic classifier from partially-labelled supervision (inputs denoted with multiple possibilities) using standard neural architectures with a softmax as the final layer. We identify a bias phenomenon that can arise from the softmax layer in even simple architectures that prevents proper exploration of alternative options, making the dynamics of gradient descent overly sensitive to initialisation. We introduce a novel loss function that allows for unbiased exploration within the space of alternative outputs.” Find the paper and the full list of authors at ArXiv.
-
‘Improved Learning-Augmented Algorithms for k-Means and k-Medians Clustering’
“We consider the problem of clustering in the learning-augmented setting. We are given a data set in d-dimensional Euclidean space, and a label for each data point given by a predictor indicating what subsets of points should be clustered together. … For a dataset of size m, we propose a deterministic k-means algorithm that produces centers with aimproved bound on the clustering cost compared to the previous randomized state-of-the-art algorithm while preserving the O(dm log m) runtime.” Find the paper and the full list of authors at Open Review.
-
‘Scheduling Under Non-Uniform Job and Machine Delays’
“We study the problem of scheduling precedence-constrained jobs on heterogenous machines in the presence of non-uniform job and machine communication delays. We are given a set of n unit size precedence-ordered jobs, and a set of m related machines each with size m_i (machine i can execute at most m_i jobs at any time). … The objective is to construct a schedule that minimizes makespan, … the maximum completion time over all jobs. We consider schedules which allow duplication of jobs as well as schedules which do not.” Find the paper and full list of authors at Dagstuhl Research Online…
-
‘ThreadLock: Native Principal Isolation Through Memory Protection Keys’
“Inter-process isolation has been deployed in operating systems for decades, but secure intra-process isolation remains an active research topic. Achieving secure intra-process isolation within an operating system process is notoriously difficult. However, viable solutions that securely consolidate workloads into the same process have the potential to be extremely valuable. In this work, we present native principal isolation, a technique to restrict threads’ access to process memory by enforcing intra-process security policies defined over a program’s application binary interface (ABI).” Find the paper and full list of authors in the 2023 ACM Asia Conference on Computer and Communications Security proceedings.
-
Grant from Broad Institute to combat antibiotic failure
Titled “Attacking Failure of Antibiotic Treatment by Targeting Antimicrobial Resistance Enabler Cell-States,” professor of biology Edward Geisinger writes that “This project aims to uncover the genetic mechanisms that underlie antibiotic treatment failure in hospital-acquired bacterial infections. We will analyze ‘enabler’ mutations and phenotypes that promote antibiotic tolerance and act as stepping stones for the development of antibiotic resistance and treatment failure. A major focus is the pathogen Acinetobacter baumannii, which causes hospital-acquired diseases including pneumonia and sepsis that have become increasingly difficult to treat.”