Artificial Intelligence
Pursuing computing advances to create intelligent machines that complement human reasoning to augment and enrich our experience and competencies.
Highlights
DO NOT LET PRIVACY OVERBILL UTILITY: GRADIENT EMBEDDING PERTURBATION FOR PRIVATE LEARNING
The privacy leakage of the model about the training data can be bounded in the differential privacy mechanism. However, for meaningful privacy parameters, a differentially private model degrades the utility drastically when the model comprises a large number of trainable parameters. In this paper, we propose an algorithm Gradient Embedding Perturbation (GEP) towards training differentially private deep models with decent accuracy. Specifically, in each gradient descent step, GEP first projects individual private gradient into a…
Neural Knowledge Extraction From Cloud Service Incidents
In the last decade, two paradigm shifts have reshaped the software industry – the move from boxed products to services and the widespread adoption of cloud computing. This has had a huge impact on the software development life cycle and the DevOps processes. Particularly, incident management has become critical for developing and operating large-scale services. Incidents are created to ensure timely communication of service issues and, also, their resolution. Prior work on incident management has…
Contrastive Multi-document Question Generation
Web search engines today return a ranked list of document links in response to a user’s query. However, when a user query is vague, the resultant documents span multiple subtopics. In such a scenario, it would be helpful if the search engine provided clarification options to the user’s initial query in a way that each clarification option is closely related to the documents in one subtopic and is far away from the documents in all…
Social Sensemaking with AI: Designing an Open-ended AI experience with a Blind Child
AI technologies are often used to aid people in performing discrete tasks with well-defined goals (e.g., recognising faces in images). Emerging technologies that provide continuous, real-time information enable more open-ended AI experiences. In partnership with a blind child, we explore the challenges and opportunities of designing human-AI interaction for a system intended to support social sensemaking. Adopting a research-through-design perspective, we reflect upon working with the uncertain capabilities of AI systems in the design of…
Data Augmentation for Abstractive Query-Focused Multi-Document Summarization
The progress in Query-focused Multi-Document Summarization (QMDS) has been limited by the lack of sufficient largescale high-quality training datasets. We present two QMDS training datasets, which we construct using two data augmentation methods: (1) transferring the commonly used single document CNN/Daily Mail summarization dataset to create the QMDSCNN dataset, and (2) mining search-query logs to create the QMDSIR dataset. These two datasets have complementary properties, i.e., QMDSCNN has real summaries but queries are simulated, while…
Split-Treatment Analysis to Rank Heterogeneous Causal Effects for Prospective Interventions
For many kinds of interventions, such as a new advertisement, marketing intervention, or feature recommendation, it is important to target a specific subset of people for maximizing its benefits at minimum cost or potential harm. However, a key challenge is that no data is available about the effect of such a prospective intervention since it has not been deployed yet. In this work, we propose a split-treatment analysis that ranks the individuals most likely to…
NuQClq: An Effective Local Search Algorithm for Maximum Quasi-Clique Problem
The maximum quasi-clique problem (MQCP) is an important extension of maximum clique problem with wide applications. Recent heuristic MQCP algorithms can hardly solve large and hard graphs effectively. This paper develops an efficient local search algorithm named NuQClq for the MQCP, which has two main ideas. First, we propose a novel vertex selection strategy, which utilizes cumulative saturation information to be a selection criterion when the candidate vertices have equal values on the primary scoring…
PULNS: Positive-Unlabeled Learning with Effective Negative Sample Selector
Positive-unlabeled learning (PU learning) is an important case of binary classification where the training data only contains positive and unlabeled samples. The current state-of-the-art approach for PU learning is the cost-sensitive approach, which casts PU learning as a cost-sensitive classification problem and relies on unbiased risk estimator for correcting the bias introduced by the unlabeled samples. However, this approach requires the knowledge of class prior and is subject to the potential label noise. In this…
Correlation-Aware Heuristic Search for Intelligent Virtual Machine Provisioning in Cloud Systems
to come soon.
AI and Gaming Research Summit
Engage, Learn, and Share at the Microsoft AI and Gaming Research Summit 2021. We invite you to a Microsoft in Virtual Event to join researchers and practitioners from academia, game studios, Gaming and Xbox at Microsoft, and Microsoft Research to engage and share ideas about how AI and machine learning is transforming the landscape of gaming.