AdversarialPolicy

Instance Constructors

new AdversarialPolicy(question: DiscreteScalarQuestion)

question
The question

Type Members

class PrematureAggregationException extends Exception

Definition Classes
AggregationPolicy

Value Members

final def !=(arg0: Any): Boolean

Definition Classes
AnyRef → Any
final def ##(): Int

Definition Classes
AnyRef → Any
final def ==(arg0: Any): Boolean

Definition Classes
AnyRef → Any
val NumberOfSimulations: Int

Attributes
protected[edu.umass.cs.automan]
val PrecompPath: String

Attributes
protected[edu.umass.cs.automan]
def allow_early_termination(): Boolean

Determines whether a policy allows for canceling running tasks.
Determines whether a policy allows for canceling running tasks. If true, is_done will be called more often, increasing the required confidence level to terminate. Note that an early termination check is always conducted when timeouts occur regardless of this setting.

Definition Classes
AggregationPolicy
final def asInstanceOf[T0]: T0

Definition Classes
Any
def blacklisted_workers(tasks: List[Task]): List[String]

Returns a list of blacklisted worker_ids given a set of tasks, completed or not.
Returns a list of blacklisted worker_ids given a set of tasks, completed or not.
tasks
The complete list of tasks.
returns
A list of worker IDs.

Definition Classes
AggregationPolicy
def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( ... )
def completed_tasks(tasks: List[Task]): List[Task]

Definition Classes
AggregationPolicy
def completed_workerunique_tasks(tasks: List[Task]): List[Task]

Definition Classes
AggregationPolicy
def current_confidence(tasks: List[Task]): Double

Implementations
Implementations

Definition Classes
AdversarialPolicy → ScalarPolicy
final def eq(arg0: AnyRef): Boolean

Definition Classes
AnyRef
def equals(arg0: Any): Boolean

Definition Classes
AnyRef → Any
def finalize(): Unit

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( classOf[java.lang.Throwable] )
final def getClass(): Class[_]

Definition Classes
AnyRef → Any
def getDistribution(tasks: List[Task]): Array[Response[A]]

Definition Classes
AggregationPolicy
def hashCode(): Int

Definition Classes
AnyRef → Any
final def isInstanceOf[T0]: Boolean

Definition Classes
Any
def is_confident(tasks: List[Task], num_comparisons: Int): (Boolean, Int)

Definition Classes
AdversarialPolicy → ScalarPolicy
def is_done(tasks: List[Task], num_comparisons: Int): (Boolean, Int)

Returns true if the strategy has enough data to stop scheduling work.
Returns true if the strategy has enough data to stop scheduling work.
tasks
The complete list of scheduled tasks.
num_comparisons
The number of times this function has been called, inclusive.
returns
(true iff done, new num_comparisons)

Definition Classes
ScalarPolicy → AggregationPolicy
def max_agree(tasks: List[Task]): Int
final def ne(arg0: AnyRef): Boolean

Definition Classes
AnyRef
def not_final(task: Task): Boolean

Definition Classes
AggregationPolicy
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

Definition Classes
AnyRef
def numOpts: Int
def num_to_run(tasks: List[Task], num_comparisons: Int, reward: BigDecimal): Int

Definition Classes
AdversarialPolicy → AggregationPolicy
def num_to_run_fallback(tasks: List[Task], num_comparisons: Int, reward: BigDecimal): Int
def outstanding_tasks(tasks: List[Task]): List[Task]

Definition Classes
AggregationPolicy
def partition_duplicates(tasks: List[Task]): (List[Task], List[Task])

Partitions a set of tasks into those that should be marked as duplicate and those that should not be.
Partitions a set of tasks into those that should be marked as duplicate and those that should not be. All tasks passed in are passed back out.
tasks
A list of tasks
returns
(list of non-duplicate tasks, list of duplicate tasks)

Definition Classes
AggregationPolicy
def pessimism(): Double
val precompTable: Option[PrecompTable]
def rejection_response(tasks: List[Task]): String

Returns a string explaining why the worker's answer was not accepted.
Returns a string explaining why the worker's answer was not accepted.
tasks
The list of accepted tasks. Used to determine the correct answer.
returns
Explanation string.

Definition Classes
AdversarialPolicy → AggregationPolicy
def select_answer(tasks: List[Task], num_comparisons: Int): AA

Returns the top answer.
Returns the top answer.
tasks
The complete list of tasks.
num_comparisons
The number of times is_done has been called.
returns
Top answer

Definition Classes
AdversarialPolicy → AggregationPolicy
def select_over_budget_answer(tasks: List[Task], need: BigDecimal, have: BigDecimal, num_comparisons: Int): AA

Returns an appropriate response for when the computation ran out of money.
Returns an appropriate response for when the computation ran out of money.
tasks
The complete list of tasks.
need
The smallest amount of money needed to complete the computation under optimistic assumptions.
have
The amount of money we have.
num_comparisons
The number of times is_done has been called.
returns
A low-confidence or over-budget answer.

Definition Classes
AdversarialPolicy → AggregationPolicy
def spawn(tasks: List[Task], suffered_timeout: Boolean, num_comparisons: Int): List[Task]

Computes the number of tasks needed to satisfy the quality-control algorithm given the already-collected list of tasks.
Computes the number of tasks needed to satisfy the quality-control algorithm given the already-collected list of tasks. Returns only newly-created tasks.
tasks
The complete list of previously-scheduled tasks
suffered_timeout
True if any of the latest batch of tasks suffered a timeout.
returns
A list of new tasks to schedule on the backend.

Definition Classes
AggregationPolicy
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
def tasks_to_accept(tasks: List[Task]): List[Task]

Definition Classes
AdversarialPolicy → AggregationPolicy
def tasks_to_accept_on_failure(tasks: List[Task]): List[Task]

Definition Classes
AggregationPolicy
def tasks_to_cancel(tasks: List[Task]): List[Task]

Definition Classes
AggregationPolicy
def tasks_to_reject(tasks: List[Task]): List[Task]

Definition Classes
AdversarialPolicy → AggregationPolicy
def toString(): String

Definition Classes
AnyRef → Any
def unique_by_date(ts: List[Task]): List[Task]

Attributes
protected
Definition Classes
AggregationPolicy
final def wait(): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
final def wait(arg0: Long, arg1: Int): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
final def wait(arg0: Long): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )

Related Doc: package aggregation

class AdversarialPolicy extends ScalarPolicy

Instance Constructors

new AdversarialPolicy(question: DiscreteScalarQuestion)

Type Members

class PrematureAggregationException extends Exception

Value Members

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

val NumberOfSimulations: Int

val PrecompPath: String

def allow_early_termination(): Boolean

final def asInstanceOf[T0]: T0

def blacklisted_workers(tasks: List[Task]): List[String]

def clone(): AnyRef

def completed_tasks(tasks: List[Task]): List[Task]

def completed_workerunique_tasks(tasks: List[Task]): List[Task]

def current_confidence(tasks: List[Task]): Double

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

final def getClass(): Class[_]

def getDistribution(tasks: List[Task]): Array[Response[A]]

def hashCode(): Int

final def isInstanceOf[T0]: Boolean

def is_confident(tasks: List[Task], num_comparisons: Int): (Boolean, Int)

def is_done(tasks: List[Task], num_comparisons: Int): (Boolean, Int)

def max_agree(tasks: List[Task]): Int

final def ne(arg0: AnyRef): Boolean

def not_final(task: Task): Boolean

final def notify(): Unit

final def notifyAll(): Unit

def numOpts: Int

def num_to_run(tasks: List[Task], num_comparisons: Int, reward: BigDecimal): Int

def num_to_run_fallback(tasks: List[Task], num_comparisons: Int, reward: BigDecimal): Int

def outstanding_tasks(tasks: List[Task]): List[Task]

def partition_duplicates(tasks: List[Task]): (List[Task], List[Task])

def pessimism(): Double

val precompTable: Option[PrecompTable]

def rejection_response(tasks: List[Task]): String

def select_answer(tasks: List[Task], num_comparisons: Int): AA

def select_over_budget_answer(tasks: List[Task], need: BigDecimal, have: BigDecimal, num_comparisons: Int): AA

def spawn(tasks: List[Task], suffered_timeout: Boolean, num_comparisons: Int): List[Task]

final def synchronized[T0](arg0: ⇒ T0): T0

def tasks_to_accept(tasks: List[Task]): List[Task]

def tasks_to_accept_on_failure(tasks: List[Task]): List[Task]

def tasks_to_cancel(tasks: List[Task]): List[Task]

def tasks_to_reject(tasks: List[Task]): List[Task]

def toString(): String

def unique_by_date(ts: List[Task]): List[Task]

final def wait(): Unit

final def wait(arg0: Long, arg1: Int): Unit

final def wait(arg0: Long): Unit

Inherited from ScalarPolicy

Inherited from AggregationPolicy

Inherited from AnyRef

Inherited from Any

Ungrouped