IP Library Granted Patent US 12,223,399
Granted Patent B2
US 12,223,399 · App. 17/083,020 · Granted Feb 11, 2025

System and method for deep enriched neural networks for time series forecasting

Inventors: Suleyman Cetintas (Cupertino, CA); Xian Wu (Notre Dame, IN)
Assignee: YAHOO ASSETS LLC
G06N20/00G06F16/903
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,223,399
App. No.
17/083,020
Granted
Feb 11, 2025
Kind
B2
Abstract

The present teaching relates to method, system, medium, and implementations for machine learning. Upon receiving input data associated with a time series, hidden representations associated with the time series in a feature space are obtained and used to generate a query vector in a query space. Such generated query vector is then used to query relevant historic information related to the time series. The query vector and the relevant historic information are aggregated to generate at least one queried vector, which is aggregated with the hidden representations to generate enriched hidden representations that enhance the expressiveness of the hidden representations.

Claims (48)

1. A method implemented on at least one machine including at least one processor, memory, and communication platform capable of connecting to a network for machine learning, the method comprising:

receiving input data associated with a time series;

obtaining hidden representations associated with the time series in a feature space;

generating a query vector based on the hidden representations in a query space, wherein the query vector comprises a forward query vector and a backward query vector, each of which corresponds to a linear transformation of the hidden representations;

querying, based on the query vector and across a plurality of time series, relevant historic information related to the time series, wherein the time series is included in the plurality of time series;

aggregating the relevant historic information with the query vector to generate at least one queried pattern vector; and

enriching the hidden representations by aggregating therewith the at least one queried pattern vector to generate enriched hidden representations, wherein

the enriched hidden representations enhance expressiveness of the hidden representations.

2. The method of claim 1 , wherein the hidden representation corresponds to a set of parameters associated with a model learned for forecasting the time series.

3. The method of claim 1 , further comprising forecasting the time series using the enriched hidden representations based on the input data to generate a prediction.

4. The method of claim 3 , further comprising updating the enriched hidden representations based on an error based loss determined based on a discrepancy between a label of the input data and the prediction.

5. The method of claim 4 , wherein the update to the enriched hidden representations is determined also based on a graph based loss determined based on inter-time-series relationships.

6. The method of claim 1 , wherein

the input data include time series of different types;

the hidden representations are for forecasting the time series of the different types; and

the relevant historic information used to generate the enriched hidden representations encompasses time series of different types.

7. Machine readable and non-transitory medium having information recorded thereon for machine learning, wherein the information, when read by a machine, causes the machine to perform:

receiving input data associated with a time series;

obtaining hidden representations associated with the time series in a feature space;

generating a query vector based on the hidden representations in a query space, wherein the query vector comprises a forward query vector and a backward query vector, each of which corresponds to a linear transformation of the hidden representations;

querying, based on the query vector and across a plurality of time series, relevant historic information related to the time series, wherein the time series is included in the plurality of time series;

aggregating the relevant historic information with the query vector to generate at least one queried pattern vector; and

enriching the hidden representations by aggregating therewith the at least one queried pattern vector to generate enriched hidden representations, wherein

the enriched hidden representations enhance expressiveness of the hidden representations.

8. The medium of claim 7 , wherein the hidden representation corresponds to a set of parameters associated with a model learned for forecasting the time series.

9. The medium of claim 7 , wherein the information, when read by the machine, further causes the machine to perform forecasting the time series using the enriched hidden representations based on the input data to generate a prediction.

10. The medium of claim 9 , wherein the information, when read by the machine, further causes the machine to perform updating the enriched hidden representations based on an error based loss determined based on a discrepancy between a label of the input data and the prediction.

11. The medium of claim 10 , wherein the update to the enriched hidden representations is determined also based on a graph based loss determined based on inter-time-series relationships.

12. The medium of claim 7 , wherein

the input data include time series of different types;

the hidden representations are for forecasting the time series of the different types; and

the relevant historic information used to generate the enriched hidden representations encompasses time series of different types.

13. A system for machine learning, comprising:

a relevant historic information query engine implemented on a processor and configured for

receiving input data associated with a time series,

obtaining hidden representations associated with the time series in a feature space,

generating a query vector based on the hidden representations in a query space, wherein the query vector comprises a forward query vector and a backward query vector, each of which corresponds to a linear transformation of the hidden representations, and

querying, based on the query vector and across a plurality of time series, relevant historic information related to the time series, wherein the time series is included in the plurality of time series;

a graph based historic information aggregator implemented on the processor and configured for aggregating the relevant historic information with the query vector to generate at least one queried pattern vector; and

a feature aggregator implemented on the processor and configured for enriching the hidden representations by aggregating therewith the at least one queried pattern vector to generate enriched hidden representations, wherein

the enriched hidden representations enhance expressiveness of the hidden representations.

14. The system of claim 13 , wherein the hidden representation corresponds to a set of parameters associated with a model learned for forecasting the time series.

15. The system of claim 13 , further comprising a time series forecaster configured for forecasting the time series using the enriched hidden representations based on the input data to generate a prediction.

16. The system of claim 15 , further comprising a global model parameter updater implemented on the processor and configured for updating the enriched hidden representations based on an error based loss determined based on a discrepancy between a label of the input data and the prediction, wherein the update to the enriched hidden representations is determined also based on a graph based loss determined based on inter-time-series relationships.

17. The system of claim 13 , wherein

the input data include time series of different types;

the hidden representations are for forecasting the time series of the different types; and

the relevant historic information used to generate the enriched hidden representations encompasses time series of different types.

Assignments (4)
PATENT SECURITY AGREEMENT (FIRST LIEN) Recorded Sep 29, 2022
From: YAHOO ASSETS LLC
To: ROYAL BANK OF CANADA, AS COLLATERAL AGENT
Reel/Frame 061571/0773 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Dec 16, 2021
From: YAHOO AD TECH LLC (FORMERLY VERIZON MEDIA INC.)
To: YAHOO ASSETS LLC
Reel/Frame 058982/0282 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Feb 8, 2021
From: OATH INC
To: VERIZON MEDIA INC.
Reel/Frame 055184/0318 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Oct 28, 2020
From: CETINTAS, SULEYMAN; WU, XIAN
To: OATH INC.
Reel/Frame 054201/0032 →
Continuity (1)
Related Publication 20220129790A1 · Apr 28, 2022
References Cited (15)
US 10339235B1 · Ciarlini et al. · 2019 [cited by applicant]
US 10936947B1 · Flunkert · 2021 [cited by examiner]
US 11126660B1 · Sen · 2021 [cited by examiner]
US 20150142513A1 · Shnayder · 2015 [cited by examiner]
US 20180060732A1 · Yuan et al. · 2018 [cited by applicant]
US 20180211164A1 · Bazrafkan et al. · 2018 [cited by applicant]
US 20200104706A1 · Sandler et al. · 2020 [cited by applicant]
CN 111079931A · 2020 [cited by examiner]
Miller, Alexander, et al. “Key-value memory networks for directly reading documents.” arXiv preprint arXiv:1606.03126 (2016). (Year: 2016). [cited by examiner]
Chung J., et al., Empirical evaluation of gated recurrent neural networks on sequence modeling, NIPS 2014 Workshop on Deep Learning, Dec. 2014, arXiv:1412.3555, v1 (9 pgs.). [cited by applicant]
Finn, P., et al., Model-agnostic meta-learning for fast adaptation of deep networks, Proceedings of the 34th International Conference on Machine Learning in PMLR, 2017, pp. 1126-1135, v70 (10 pgs.). [cited by applicant]
Miller, A., et al., Key-Value Memory Networks for Directly Reading Documents, Proceedings of the 2016 Conference on Empirical Methods in Natural Language Processing, Oct.-Nov. 2016, pp. 1400-1409, arXiv:1606.03126, v2 (… [cited by applicant]
Non-Final Office Action mailed Nov. 21, 2023 in U.S. Appl. No. 17/083,093. [cited by applicant]
Deshpande et al., “Streaming Adaptation of Deep Forecasting Models using Adaptive Recurrent Units”, The 25th ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD '19), Aug. 4-8, 2019, pp. 1-10, Anchorage, A… [cited by applicant]
Huang et al., “Adaptive Sampling Towards Fast Graph Representation Learning”, 32nd Conference on Neural Information Processing Systems (NIPS 2018), pp. 1-12, Montreal, Canada. [cited by applicant]