1 Ocak 2018 Dergi makalesi Açık Erişim

Gokcesu, Kaan; Kozat, Suleyman S.

DataCite XML

<?xml version='1.0' encoding='utf-8'?>
<resource xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://datacite.org/schema/kernel-4" xsi:schemaLocation="http://datacite.org/schema/kernel-4 http://schema.datacite.org/meta/kernel-4.1/metadata.xsd">
  <identifier identifierType="URL">https://aperta.ulakbim.gov.tr/record/30685</identifier>
  <creators>
    <creator>
      <creatorName>Gokcesu, Kaan</creatorName>
      <givenName>Kaan</givenName>
      <familyName>Gokcesu</familyName>
      <affiliation>Bilkent Univ, Dept Elect &amp; Elect Engn, TR-06800 Ankara, Turkey</affiliation>
    </creator>
    <creator>
      <creatorName>Kozat, Suleyman S.</creatorName>
      <givenName>Suleyman S.</givenName>
      <familyName>Kozat</familyName>
      <affiliation>Bilkent Univ, Dept Elect &amp; Elect Engn, TR-06800 Ankara, Turkey</affiliation>
    </creator>
  </creators>
  <titles>
    <title>Online Density Estimation Of Nonstationary Sources Using Exponential Family Of Distributions</title>
  </titles>
  <publisher>Aperta</publisher>
  <publicationYear>2018</publicationYear>
  <dates>
    <date dateType="Issued">2018-01-01</date>
  </dates>
  <resourceType resourceTypeGeneral="Text">Journal article</resourceType>
  <alternateIdentifiers>
    <alternateIdentifier alternateIdentifierType="url">https://aperta.ulakbim.gov.tr/record/30685</alternateIdentifier>
  </alternateIdentifiers>
  <relatedIdentifiers>
    <relatedIdentifier relatedIdentifierType="DOI" relationType="IsIdenticalTo">10.1109/TNNLS.2017.2740003</relatedIdentifier>
  </relatedIdentifiers>
  <rightsList>
    <rights rightsURI="http://www.opendefinition.org/licenses/cc-by">Creative Commons Attribution</rights>
    <rights rightsURI="info:eu-repo/semantics/openAccess">Open Access</rights>
  </rightsList>
  <descriptions>
    <description descriptionType="Abstract">We investigate online probability density estimation (or learning) of nonstationary (and memoryless) sources using exponential family of distributions. To this end, we introduce a truly sequential algorithm that achieves Hannan-consistent log-loss regret performance against true probability distribution without requiring any information about the observation sequence (e.g., the time horizon T and the drift of the underlying distribution C) to optimize its parameters. Our results are guaranteed to hold in an individual sequence manner. Our log-loss performance with respect to the true probability density has regret bounds of O((CT)(1/2)), where C is the total change (drift) in the natural parameters of the underlying distribution. To achieve this, we design a variety of probability density estimators with exponentially quantized learning rates and merge them with a mixture-of-experts notion. Hence, we achieve this square-root regret with computational complexity only logarithmic in the time horizon. Thus, our algorithm can be efficiently used in big data applications. Apart from the regret bounds, through synthetic and real-life experiments, we demonstrate substantial performance gains with respect to the state-of-the-art probability density estimation algorithms in the literature.</description>
  </descriptions>
</resource>