Publication

Near-Optimally Teaching the Crowd to Classify

Related publications (34)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

, ,

The problem of control synthesis to maximize the probability of satisfying automata specifications for systems with uncertainty is addressed. Two types of uncertainty are considered; stochasticity in the dynamical system and in the sets defining the specif ...

2017

Scalable greedy algorithms for transfer learning

Barbara Caputo, Ilja Kuzborskij

In this paper we consider the binary transfer learning problem, focusing on how to select and combine sources from a large pool to yield a good performance on a target task. Constraining our scenario to real world, we do not assume the direct access to the ...

2017

Automaton-based stochastic control for navigation of emergency rescuers in buildings

Maryam Kamgarpour, Tony Alan Wood

In this paper we consider the problem of navigating emergency rescuers in buildings. The objective of the rescuer is to reach several critical regions in a building endangered by a spreading hazard and leave safely. We consider stochastic finite state mode ...

IEEE2016

, ,

The numerical solution of partial differential equations (PDEs) depending on para- metrized or random input data is computationally intensive. Reduced order modeling techniques, such as the reduced basis methods, have been developed to alleviate this compu ...

MATHICSE2016

Sensing the real world

Juri Ranieri

A sensor is a device that detects or measures a physical property and records, indicates, or otherwise responds to it. In other words, a sensor allows us to interact with the surrounding environment, by measuring qualitatively or quantitatively a given phe ...

EPFL2014

This dissertation develops geometric variational models for different inverse problems in imaging that are ill-posed, designing at the same time efficient numerical algorithms to compute their solutions. Variational methods solve inverse problems by the fo ...

EPFL2013

How to Allocate Tasks Asynchronously

Rachid Guerraoui, Seth Gilbert, Dan Alistarh

Asynchronous task allocation is a fundamental problem in distributed computing in which p asynchronous processes must execute a set of m tasks. Also known as write-all or do-all, this problem been studied extensively, both independently and as a key buildi ...

IEEE2012

Graph-Based Information Processing

Amin Karbasi

We live in a world characterized by massive information transfer and real-time communication. The demand for efficient yet low-complexity algorithms is widespread across different fields, including machine learning, signal processing and communications. Mo ...

EPFL2012

Optimal Linear Fusion for Distributed Detection Via Semidefinite Programming

Ali H. Sayed

Consider the problem of signal detection via multiple distributed noisy sensors. We study a linear decision fusion rule of [Z. Quan, S. Cui, and A. H. Sayed, ¿Optimal Linear Cooperation for Spectrum Sensing in Cognitive Radio Networks,¿ IEEE J. Sel. Topics ...

IEEE2010

Nonholonomic source seeking in switching random fields

Mahmut Selman Sakar

We consider the problem of designing controllers for nonholonomic mobile robots converging to the source (minimum) of a field. In addition to the mobility constraints posed by the nonholonomic dynamics, we assume that the field is completely unknown to the ...

2010

Near-Optimally Teaching the Crowd to Classify ￼

Graph Chatbot

Chat with Graph Search

Near-Optimally Teaching the Crowd to Classify