<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet type="text/xsl" href="static/style.xsl"?><OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-09-20T10:22:29Z</responseDate><request verb="GetRecord" identifier="oai:dspace.mit.edu:1721.1/156799" metadataPrefix="dim">https://dspace.mit.edu/server/oai/request</request><GetRecord><record><header><identifier>oai:dspace.mit.edu:1721.1/156799</identifier><datestamp>2024-09-17T03:02:09Z</datestamp><setSpec>com_1721.1_7582</setSpec><setSpec>com_1721.1_7581</setSpec><setSpec>col_1721.1_131023</setSpec></header><metadata><dim:dim xmlns:dim="http://www.dspace.org/xmlns/dspace/dim" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:doc="http://www.lyncode.com/xoai" xsi:schemaLocation="http://www.dspace.org/xmlns/dspace/dim http://www.dspace.org/schema/dim.xsd">
   <dim:field mdschema="dc" element="contributor" qualifier="advisor">Perakis, Georgia</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="author">Hensgen, Michael Lowell</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="department">Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2024-09-16T13:49:59Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2024-09-16T13:49:59Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2024-05</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="submitted">2024-07-11T14:37:01.788Z</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">https://hdl.handle.net/1721.1/156799</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract">In hierarchical time series forecasting, some series are aggregated from others, producing a known coherency metric between series. We present a new method for enforcing coherency on hierarchical time series forecasts. We propose a new loss function, called Network Coherency Loss, that minimizes the coherency loss of the weight and bias of the final linear layer of a neural network. We compare it against a baseline without coherency and a state of the art method that uses projection to strictly enforce coherency. We find that, by choosing our Network Coherency Loss parameters based on validation data, for four datasets of varying sizes we produce improved accuracy over our two benchmark models. We also find that, when compared to an alternative loss function also designed to produce coherency, our Network Coherency Loss function produces similar accuracies but improves the coherency on the test data.</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="degree">M.Eng.</dim:field>
   <dim:field mdschema="dc" element="publisher">Massachusetts Institute of Technology</dim:field>
   <dim:field mdschema="dc" element="rights">In Copyright - Educational Use Permitted</dim:field>
   <dim:field mdschema="dc" element="rights">Copyright retained by author(s)</dim:field>
   <dim:field mdschema="dc" element="rights" qualifier="uri">https://rightsstatements.org/page/InC-EDU/1.0/</dim:field>
   <dim:field mdschema="dc" element="title">Coherency Loss for Hierarchical Time Series Forecasting</dim:field>
   <dim:field mdschema="dc" element="type">Thesis</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="mimetype">application/pdf</dim:field>
   <dim:field mdschema="mit" element="thesis" qualifier="degree">Master</dim:field>
   <dim:field mdschema="thesis" element="degree" qualifier="name">Master of Engineering in Electrical Engineering and Computer Science</dim:field>
   <dim:field mdschema="dspace" element="entity" qualifier="type">Publication</dim:field>
   <dim:field mdschema="others" element="access-status">unknown</dim:field>
   <dim:field mdschema="others" element="access-status">unknown</dim:field>
   <dim:field mdschema="cerif" element="openaire" authority="" confidence="-1">&lt;Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="f26d5282-3466-4461-b9ec-4eec4d215fe6">
	&lt;Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843&lt;/Type>
   	&lt;Title>Coherency Loss for Hierarchical Time Series Forecasting&lt;/Title>
   	&lt;PublishedIn>
    	&lt;Publication>
      	&lt;/Publication>
   	&lt;/PublishedIn>
   	&lt;PublicationDate>2024-05&lt;/PublicationDate>
   	&lt;Authors>
      	&lt;Author>
        	&lt;DisplayName>Hensgen, Michael Lowell&lt;/DisplayName>
         	&lt;Affiliation>
         		&lt;OrgUnit>
         		&lt;/OrgUnit>
         	&lt;/Affiliation>
      	&lt;/Author>
	&lt;/Authors>
   	&lt;Editors>
	&lt;/Editors>
    &lt;Publishers>
        &lt;Publisher>
            &lt;DisplayName>Massachusetts Institute of Technology&lt;/DisplayName>
            &lt;OrgUnit />
        &lt;/Publisher>
    &lt;/Publishers>
    &lt;License>https://rightsstatements.org/page/InC-EDU/1.0/&lt;/License>
   	&lt;Abstract>In hierarchical time series forecasting, some series are aggregated from others, producing a known coherency metric between series. We present a new method for enforcing coherency on hierarchical time series forecasts. We propose a new loss function, called Network Coherency Loss, that minimizes the coherency loss of the weight and bias of the final linear layer of a neural network. We compare it against a baseline without coherency and a state of the art method that uses projection to strictly enforce coherency. We find that, by choosing our Network Coherency Loss parameters based on validation data, for four datasets of varying sizes we produce improved accuracy over our two benchmark models. We also find that, when compared to an alternative loss function also designed to produce coherency, our Network Coherency Loss function produces similar accuracies but improves the coherency on the test data.&lt;/Abstract>
	&lt;Access xmlns="http://purl.org/coar/access_right" 
    >
    &lt;/Access>
&lt;/Publication>
</dim:field>
</dim:dim>
</metadata></record></GetRecord></OAI-PMH>