FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W2118075434> ?p ?o ?g. }

• W2118075434 abstract "Online learning is the process of answering a sequence of questions given knowledge of the correct answers to previous questions and possibly additional available information. Answering questions in an intelligent fashion and being able to make rational decisions as a result is a basic feature of everyday life. Will it rain today (so should I take an umbrella)? Should I fight the wild animal that is after me, or should I run away? Should I open an attachment in an email message or is it a virus? The study of online learning algorithms is thus an important domain in machine learning, and one that has interesting theoretical properties and practical applications. This dissertation describes a novel framework for the design and analysis of online learning algorithms. We show that various online learning algorithms can all be derived as special cases of our algorithmic framework. This unified view explains the properties of existing algorithms and also enables us to derive several new interesting algorithms. Online learning is performed in a sequence of consecutive rounds, where at each round the learner is given a question and is required to provide an answer to this question. After predicting an answer, the correct answer is revealed and the learner suffers a loss if there is a discrepancy between his answer and the correct one. The algorithmic framework for online learning we propose in this dissertation stems from a connection that we make between the notions of regret in online learning and weak duality in convex optimization. Regret bounds are the common thread in the analysis of online learning algorithms. A regret bound measures the performance of an online algorithm relative to the performance of a competing prediction mechanism, called a competing hypothesis. The competing hypothesis can be chosen in hindsight from a class of hypotheses, after observing the entire sequence of question- answer pairs. Over the years, competitive analysis techniques have been refined and extended to numerous prediction problems by employing complex and varied notions of progress toward a good competing hypothesis. We propose a new perspective on regret bounds which is based on the notion of duality in convex optimization. Regret bounds are universal in the sense that they hold for any possible fixed hypothesis in a given hypothesis class. We therefore cast the universal bound as a lower bound" @default.
• W2118075434 created "2016-06-24" @default.
• W2118075434 creator A5078263052 @default.
• W2118075434 date "2007-01-01" @default.
• W2118075434 modified "2023-09-27" @default.
• W2118075434 title "Online Learning: Theory, Algorithms, and Applications" @default.
• W2118075434 cites W106639881 @default.
• W2118075434 cites W1481525066 @default.
• W2118075434 cites W1489504608 @default.
• W2118075434 cites W1506313179 @default.
• W2118075434 cites W1520252399 @default.
• W2118075434 cites W1529039634 @default.
• W2118075434 cites W1529707480 @default.
• W2118075434 cites W1540198634 @default.
• W2118075434 cites W1540586255 @default.
• W2118075434 cites W1545509459 @default.
• W2118075434 cites W1546961578 @default.
• W2118075434 cites W1551269584 @default.
• W2118075434 cites W1559312645 @default.
• W2118075434 cites W1560013842 @default.
• W2118075434 cites W1564947197 @default.
• W2118075434 cites W1570060426 @default.
• W2118075434 cites W1570963478 @default.
• W2118075434 cites W1575243176 @default.
• W2118075434 cites W1579877966 @default.
• W2118075434 cites W1601740268 @default.
• W2118075434 cites W1632601927 @default.
• W2118075434 cites W16591383 @default.
• W2118075434 cites W1709057194 @default.
• W2118075434 cites W1714704734 @default.
• W2118075434 cites W174980304 @default.
• W2118075434 cites W1761091820 @default.
• W2118075434 cites W1762008180 @default.
• W2118075434 cites W182881619 @default.
• W2118075434 cites W18289225 @default.
• W2118075434 cites W1832535073 @default.
• W2118075434 cites W1838096946 @default.
• W2118075434 cites W1961523962 @default.
• W2118075434 cites W1970483275 @default.
• W2118075434 cites W1975846642 @default.
• W2118075434 cites W1976026757 @default.
• W2118075434 cites W1978260564 @default.
• W2118075434 cites W1979675141 @default.
• W2118075434 cites W1979711143 @default.
• W2118075434 cites W1982813377 @default.
• W2118075434 cites W1983998816 @default.
• W2118075434 cites W1988790447 @default.
• W2118075434 cites W1999678910 @default.
• W2118075434 cites W2003677307 @default.
• W2118075434 cites W2008652694 @default.
• W2118075434 cites W2011395874 @default.
• W2118075434 cites W2014902932 @default.
• W2118075434 cites W2016133707 @default.
• W2118075434 cites W2017031328 @default.
• W2118075434 cites W2019363670 @default.
• W2118075434 cites W2020294948 @default.
• W2118075434 cites W2024046085 @default.
• W2118075434 cites W2029538739 @default.
• W2118075434 cites W2032210760 @default.
• W2118075434 cites W2040870580 @default.
• W2118075434 cites W2041954531 @default.
• W2118075434 cites W2054665642 @default.
• W2118075434 cites W2054882585 @default.
• W2118075434 cites W2055639053 @default.
• W2118075434 cites W2065861851 @default.
• W2118075434 cites W2067128174 @default.
• W2118075434 cites W2068871408 @default.
• W2118075434 cites W2069317438 @default.
• W2118075434 cites W2069671092 @default.
• W2118075434 cites W2071573426 @default.
• W2118075434 cites W2074586650 @default.
• W2118075434 cites W2077008409 @default.
• W2118075434 cites W2077804127 @default.
• W2118075434 cites W2079145130 @default.
• W2118075434 cites W2083459869 @default.
• W2118075434 cites W2086789740 @default.
• W2118075434 cites W2093717447 @default.
• W2118075434 cites W2094853078 @default.
• W2118075434 cites W2097477220 @default.
• W2118075434 cites W2099385852 @default.
• W2118075434 cites W2100423944 @default.
• W2118075434 cites W2102377898 @default.
• W2118075434 cites W2102426343 @default.
• W2118075434 cites W2102800374 @default.
• W2118075434 cites W2103231159 @default.
• W2118075434 cites W2103657184 @default.
• W2118075434 cites W2103736488 @default.
• W2118075434 cites W2105644991 @default.
• W2118075434 cites W2109339818 @default.
• W2118075434 cites W2118353660 @default.
• W2118075434 cites W2118712128 @default.
• W2118075434 cites W2120202836 @default.
• W2118075434 cites W2122962290 @default.
• W2118075434 cites W2126776273 @default.
• W2118075434 cites W2129113961 @default.
• W2118075434 cites W2131867500 @default.
• W2118075434 cites W2139686264 @default.
• W2118075434 cites W2142471335 @default.
• W2118075434 cites W2142623206 @default.
• W2118075434 cites W2144954502 @default.

• next