About: A Further Improvement of a Fast Damped Gauss–Newton Algorithm for CANDECOMP-PARAFAC Tensor Decomposition

Facets (new session)
Description
Metadata
Settings
- owl:sameAs
- Inference Rule:

About: A Further Improvement of a Fast Damped Gauss–Newton Algorithm for CANDECOMP-PARAFAC Tensor Decomposition Goto Sponge NotDistinct Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

Attributes	Values
rdf:type	skos:Concept http://linked.opendata.cz/ontology/domain/vavai/Vysledek
Description	In this paper, a novel implementation of the damped Gauss-Newton algorithm (also known as Levenberg-Marquart) for the CANDECOMP-PARAFAC (CP) tensor decomposition is proposed. The method is based on a fast inversion of the approximate Hessian for the problem. It is shown that the inversion can be computed on O(NR^6) operations, where N and R is the tensor order and rank, respectively. It is less than in the best existing state-of-the art algorithm with O(N^3R^6) operations. The damped Gauss-Newton algorithm is suitable namely for difficult scenarios, where nearly-colinear factors appear in several modes simultaneously. Performance of the method is shown on decomposition of large tensors (100 100 100 and 100 100 100 100) of rank 5 to 90. In this paper, a novel implementation of the damped Gauss-Newton algorithm (also known as Levenberg-Marquart) for the CANDECOMP-PARAFAC (CP) tensor decomposition is proposed. The method is based on a fast inversion of the approximate Hessian for the problem. It is shown that the inversion can be computed on O(NR^6) operations, where N and R is the tensor order and rank, respectively. It is less than in the best existing state-of-the art algorithm with O(N^3R^6) operations. The damped Gauss-Newton algorithm is suitable namely for difficult scenarios, where nearly-colinear factors appear in several modes simultaneously. Performance of the method is shown on decomposition of large tensors (100 100 100 and 100 100 100 100) of rank 5 to 90. (en)
Title	A Further Improvement of a Fast Damped Gauss–Newton Algorithm for CANDECOMP-PARAFAC Tensor Decomposition A Further Improvement of a Fast Damped Gauss–Newton Algorithm for CANDECOMP-PARAFAC Tensor Decomposition (en)
skos:prefLabel	A Further Improvement of a Fast Damped Gauss–Newton Algorithm for CANDECOMP-PARAFAC Tensor Decomposition A Further Improvement of a Fast Damped Gauss–Newton Algorithm for CANDECOMP-PARAFAC Tensor Decomposition (en)
skos:notation	RIV/67985556:_____/13:00392903!RIV14-GA0-67985556
http://linked.open...avai/predkladatel	Ústav teorie informace a automatizace AV ČR, v. v. i.
http://linked.open...avai/riv/aktivita	I P
http://linked.open...avai/riv/aktivity	I, P(GA102/09/1278)
http://linked.open...vai/riv/dodaniDat	2014
http://linked.open...aciTvurceVysledku	Tichavský, Petr
http://linked.open.../riv/druhVysledku	D - Článek ve sborníku
http://linked.open...iv/duvernostUdaju	S - Úplné a pravdivé údaje nepodléhající ochraně podle zvláštních právních předpisů
http://linked.open...titaPredkladatele	Ústav teorie informace a automatizace AV ČR, v. v. i.
http://linked.open...dnocenehoVysledku	58624
http://linked.open...ai/riv/idVysledku	RIV/67985556:_____/13:00392903
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	tensor factorization; Gauss-Newton method (en)
http://linked.open.../riv/klicoveSlovo	Gauss-Newton method tensor factorization
http://linked.open...ontrolniKodProRIV	[B5F98CCC5446]
http://linked.open...v/mistoKonaniAkce	Vancouver
http://linked.open...i/riv/mistoVydani	Vancouver
http://linked.open...i/riv/nazevZdroje	2013 IEEE International Conference on Acoustics, Speech, and Signal Processing ICASSP 2013
http://linked.open...in/vavai/riv/obor	BB
http://linked.open...ichTvurcuVysledku	1 (xsd:int)
http://linked.open...cetTvurcuVysledku	3 (xsd:int)
http://linked.open...vavai/riv/projekt	Advanced methods of blind source separation and blind deconvolution
http://linked.open...UplatneniVysledku	2013
http://linked.open...iv/tvurceVysledku	Tichavský, Petr Cichocki, A. Phan, A. H.
http://linked.open...vavai/riv/typAkce	WRD - Světová
http://linked.open.../riv/zahajeniAkce	2013-05-27 (xsd:date)
number of pages	5 (xsd:int)
http://purl.org/ne...btex#hasPublisher	IEEE
https://schema.org/isbn	978-1-4799-0355-9

Faceted Search & Find service v1.16.116 as of Feb 22 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3239 as of Feb 22 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 82 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software