Matches in SemOpenAlex for { <https://semopenalex.org/work/W79102444> ?p ?o ?g. }
Showing items 1 to 78 of
78
with 100 items per page.
- W79102444 endingPage "214" @default.
- W79102444 startingPage "200" @default.
- W79102444 abstract "AbstractConsider the problem of learning how long to wait for a bus before walking, experimenting each day and assuming that the bus arrival times are independent and identically distributed random variables with an unknown distribution. Similar uncertain optimal stopping problems arise when devising power-saving strategies, e.g., learning the optimal disk spin-down time for mobile computers, or speeding up certain types of satisficing search procedures by switching from a potentially fast search method that is unreliable, to one that is reliable, but slower. Formally, the problem can be described as a repeated game. In each round of the game an agent is waiting for an event to occur. If the event occurs while the agent is waiting, the agent suffers a loss that is the sum of the event’s “arrival time” and some fixed loss. If the agents decides to give up waiting before the event occurs, he suffers a loss that is the sum of the waiting time and some other fixed loss. It is assumed that the arrival times are independent random quantities with the same distribution, which is unknown, while the agent knows the loss associated with each outcome. Two versions of the game are considered. In the full information case the agent observes the arrival times regardless of its actions, while in the partial information case the arrival time is observed only if it does not exceed the waiting time. After some general structural observations about the problem, we present a number of algorithms for both cases that learn the optimal weighting time with nearly matching minimax upper and lower bounds on their regret.KeywordsArrival TimePartial InformationInformation SettingStochastic Local SearchMinimax RegretThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves." @default.
- W79102444 created "2016-06-24" @default.
- W79102444 creator A5017031238 @default.
- W79102444 creator A5041609088 @default.
- W79102444 creator A5069856068 @default.
- W79102444 date "2014-01-01" @default.
- W79102444 modified "2023-10-05" @default.
- W79102444 title "On Learning the Optimal Waiting Time" @default.
- W79102444 cites W1570963478 @default.
- W79102444 cites W1988645907 @default.
- W79102444 cites W2013532620 @default.
- W79102444 cites W2025533349 @default.
- W79102444 cites W2092220612 @default.
- W79102444 cites W2115905049 @default.
- W79102444 cites W2160485179 @default.
- W79102444 cites W2164212322 @default.
- W79102444 cites W4205818646 @default.
- W79102444 cites W42473135 @default.
- W79102444 cites W79102444 @default.
- W79102444 doi "https://doi.org/10.1007/978-3-319-11662-4_15" @default.
- W79102444 hasPublicationYear "2014" @default.
- W79102444 type Work @default.
- W79102444 sameAs 79102444 @default.
- W79102444 citedByCount "6" @default.
- W79102444 countsByYear W791024442014 @default.
- W79102444 countsByYear W791024442015 @default.
- W79102444 countsByYear W791024442016 @default.
- W79102444 countsByYear W791024442018 @default.
- W79102444 countsByYear W791024442020 @default.
- W79102444 crossrefType "book-chapter" @default.
- W79102444 hasAuthorship W79102444A5017031238 @default.
- W79102444 hasAuthorship W79102444A5041609088 @default.
- W79102444 hasAuthorship W79102444A5069856068 @default.
- W79102444 hasBestOaLocation W791024442 @default.
- W79102444 hasConcept C105795698 @default.
- W79102444 hasConcept C121332964 @default.
- W79102444 hasConcept C122123141 @default.
- W79102444 hasConcept C126255220 @default.
- W79102444 hasConcept C127413603 @default.
- W79102444 hasConcept C141513077 @default.
- W79102444 hasConcept C22212356 @default.
- W79102444 hasConcept C2779662365 @default.
- W79102444 hasConcept C3017552255 @default.
- W79102444 hasConcept C33923547 @default.
- W79102444 hasConcept C41008148 @default.
- W79102444 hasConcept C62520636 @default.
- W79102444 hasConceptScore W79102444C105795698 @default.
- W79102444 hasConceptScore W79102444C121332964 @default.
- W79102444 hasConceptScore W79102444C122123141 @default.
- W79102444 hasConceptScore W79102444C126255220 @default.
- W79102444 hasConceptScore W79102444C127413603 @default.
- W79102444 hasConceptScore W79102444C141513077 @default.
- W79102444 hasConceptScore W79102444C22212356 @default.
- W79102444 hasConceptScore W79102444C2779662365 @default.
- W79102444 hasConceptScore W79102444C3017552255 @default.
- W79102444 hasConceptScore W79102444C33923547 @default.
- W79102444 hasConceptScore W79102444C41008148 @default.
- W79102444 hasConceptScore W79102444C62520636 @default.
- W79102444 hasLocation W791024441 @default.
- W79102444 hasLocation W791024442 @default.
- W79102444 hasOpenAccess W79102444 @default.
- W79102444 hasPrimaryLocation W791024441 @default.
- W79102444 hasRelatedWork W1979026279 @default.
- W79102444 hasRelatedWork W2053088477 @default.
- W79102444 hasRelatedWork W2066502241 @default.
- W79102444 hasRelatedWork W2128683635 @default.
- W79102444 hasRelatedWork W2292976891 @default.
- W79102444 hasRelatedWork W2324855947 @default.
- W79102444 hasRelatedWork W2347733609 @default.
- W79102444 hasRelatedWork W2605475288 @default.
- W79102444 hasRelatedWork W4237669622 @default.
- W79102444 hasRelatedWork W4245457074 @default.
- W79102444 isParatext "false" @default.
- W79102444 isRetracted "false" @default.
- W79102444 magId "79102444" @default.
- W79102444 workType "book-chapter" @default.