{"entities":{"Q6825504":{"pageid":15093166,"ns":120,"title":"Item:Q6825504","lastrevid":56069986,"modified":"2026-03-09T07:54:29Z","type":"item","id":"Q6825504","labels":{"en":{"language":"en","value":"gradient descent as a first-order steepest descent method for unconstrained smooth optimization"}},"descriptions":{"en":{"language":"en","value":"Iteratively updates parameters along negative gradient directions with chosen step sizes; a workhorse for smooth problems."}},"aliases":{},"claims":{"P31":[{"mainsnak":{"snaktype":"value","property":"P31","hash":"3549c24f9ade438a3be5e15249f51b5c11a6425f","datavalue":{"value":{"entity-type":"item","numeric-id":127020,"id":"Q127020"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6825504$0ADC8305-7943-435B-A621-F9D8A47EB3C3","rank":"normal"}],"P1460":[{"mainsnak":{"snaktype":"value","property":"P1460","hash":"0a78f5fbf685685f63a07a4db6904077932b6231","datavalue":{"value":{"entity-type":"item","numeric-id":6503323,"id":"Q6503323"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6825504$3CC055E7-32AF-422A-BD8B-C2AD6F68E7A0","rank":"normal"}],"P1765":[{"mainsnak":{"snaktype":"value","property":"P1765","hash":"91f71db87df086a2acf202b043a2aa0050c3bf7a","datavalue":{"value":"al:gradient_descent","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6825504$3C14538A-419C-48C5-856A-1CA63BC50177","rank":"normal"}],"P36":[{"mainsnak":{"snaktype":"value","property":"P36","hash":"20669a99f5d4b60a5a55781975a69ac71af992db","datavalue":{"value":{"entity-type":"item","numeric-id":6825487,"id":"Q6825487"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6825504$0DA0F4D8-C8A7-4EA6-BA4B-3ADAC86BA3D9","rank":"normal"}],"P286":[{"mainsnak":{"snaktype":"value","property":"P286","hash":"61758a8ec326d4ecd9e398dedc98601efe44d9e0","datavalue":{"value":{"entity-type":"item","numeric-id":3902415,"id":"Q3902415"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P560":[{"snaktype":"value","property":"P560","hash":"9becf743cb663559ec4901fe0e904d18c037cc9e","datavalue":{"value":{"entity-type":"item","numeric-id":6825292,"id":"Q6825292"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P560"],"id":"Q6825504$5CB487FB-7EA7-44DB-A843-6EF4B48B7D3A","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P286","hash":"b6ffce00b180d4a4393c1c678ebc570477a936e7","datavalue":{"value":{"entity-type":"item","numeric-id":6824670,"id":"Q6824670"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P560":[{"snaktype":"value","property":"P560","hash":"9becf743cb663559ec4901fe0e904d18c037cc9e","datavalue":{"value":{"entity-type":"item","numeric-id":6825292,"id":"Q6825292"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P560"],"id":"Q6825504$A9F2F0B6-FD3B-4040-B0BA-17921D27D076","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P286","hash":"bc9153cbdfe44611f5fb5410096038e24427b42a","datavalue":{"value":{"entity-type":"item","numeric-id":6824697,"id":"Q6824697"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P560":[{"snaktype":"value","property":"P560","hash":"9becf743cb663559ec4901fe0e904d18c037cc9e","datavalue":{"value":{"entity-type":"item","numeric-id":6825292,"id":"Q6825292"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P560"],"id":"Q6825504$D4714BED-FEFD-4C26-A57D-C1D70F54D303","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P286","hash":"df5ea47692a9a21ebfaa8fbea40a023956010203","datavalue":{"value":{"entity-type":"item","numeric-id":6825186,"id":"Q6825186"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P560":[{"snaktype":"value","property":"P560","hash":"9becf743cb663559ec4901fe0e904d18c037cc9e","datavalue":{"value":{"entity-type":"item","numeric-id":6825292,"id":"Q6825292"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P560"],"id":"Q6825504$F205D226-F754-4D16-9962-3DB64DDE4F6F","rank":"normal"}],"P1495":[{"mainsnak":{"snaktype":"value","property":"P1495","hash":"f2805069b00f1b632c8b9c49f426bddff1a8d1c5","datavalue":{"value":{"entity-type":"item","numeric-id":6830558,"id":"Q6830558"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6825504$32B04D8D-6593-4D1F-AEC7-8C77E8B7A7CC","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Gradient descent as a first-order steepest descent method for unconstrained smooth optimization","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Gradient_descent_as_a_first-order_steepest_descent_method_for_unconstrained_smooth_optimization"}}}}}