<?xml version="1.0" encoding="utf-8"?>
<?xml-stylesheet type="text/xsl" href="style/detail_T.xsl"?>
<bibitem type="J">   <ARLID>0509948</ARLID> <utime>20240111141025.5</utime><mtime>20191024235959.9</mtime>   <WOS>000492301000002</WOS> <SCOPUS>85077750421</SCOPUS>  <DOI>10.1109/LSP.2019.2943060</DOI>           <title language="eng" primary="1">Sensitivity in tensor decomposition</title>  <specification> <page_count>5 s.</page_count> <media_type>P</media_type> </specification>   <serial><ARLID>cav_un_epca*0253212</ARLID><ISSN>1070-9908</ISSN><title>IEEE Signal Processing Letters</title><part_num/><part_title/><volume_id>26</volume_id><volume>11 (2019)</volume><page_num>1653-1657</page_num><publisher><place/><name>Institute of Electrical and Electronics Engineers</name><year/></publisher></serial>    <keyword>PARAFAC</keyword>   <keyword>convolutive neural networks</keyword>   <keyword>tensor</keyword>    <author primary="1"> <ARLID>cav_un_auth*0101212</ARLID> <name1>Tichavský</name1> <name2>Petr</name2> <institution>UTIA-B</institution> <full_dept language="cz">Stochastická informatika</full_dept> <full_dept language="eng">Department of Stochastic Informatics</full_dept> <department language="cz">SI</department> <department language="eng">SI</department> <full_dept>Department of Stochastic Informatics</full_dept> <garant>K</garant> <fullinstit>Ústav teorie informace a automatizace AV ČR, v. v. i.</fullinstit> </author> <author primary="0"> <ARLID>cav_un_auth*0382249</ARLID> <name1>Phan</name1> <name2>A. H.</name2> <country>RU</country> </author> <author primary="0"> <ARLID>cav_un_auth*0382250</ARLID> <name1>Cichocki</name1> <name2>A.</name2> <country>RU</country> </author>   <source> <url>http://library.utia.cas.cz/separaty/2019/SI/tichavsky-0509948.pdf</url> <source_size>732 kB</source_size> </source> <source> <url>https://ieeexplore.ieee.org/document/8846103</url>  </source>        <cas_special> <project> <ARLID>cav_un_auth*0345929</ARLID> <project_id>GA17-00902S</project_id> <agency>GA ČR</agency>  </project>  <abstract language="eng" primary="1">Canonical polyadic (CP) tensor decomposition is an important task in many applications. Many times, the true tensor rank is not known, or noise is present, and in such situations, different existing CP decomposition algorithms provide very different results. In this paper, we introduce a notion of sensitivity of CP decomposition and suggest to use it as a side criterion (besides the fitting error) to evaluate different CP decomposition results. Next, we propose a novel variant of a Krylov-Levenberg-Marquardt CP decomposition algorithm which may serve for CP decomposition with a constraint on the sensitivity. In simulations, we decompose order-4 tensors that come from convolutional neural networks. We show that it is useful to combine the CP decomposition algorithms with an error-preserving correction.</abstract>     <result_subspec>WOS</result_subspec> <RIV>BB</RIV> <FORD0>20000</FORD0> <FORD1>20200</FORD1> <FORD2>20201</FORD2>    <reportyear>2020</reportyear>      <num_of_auth>3</num_of_auth>  <unknown tag="mrcbC52"> 4 A hod sml 4ah 4as 20231122144345.3 </unknown> <inst_support> RVO:67985556 </inst_support>  <permalink>http://hdl.handle.net/11104/0301141</permalink>  <unknown tag="mrcbC64"> 1 Department of Stochastic Informatics UTIA-B 20201 ENGINEERING, ELECTRICAL &amp; ELECTRONIC </unknown>  <confidential>S</confidential>  <contract> <name>Copyright receipt</name> <date>20190919</date> </contract> <unknown tag="mrcbC86"> 3+4 Proceedings Paper Engineering Biomedical|Radiology Nuclear Medicine Medical Imaging </unknown> <unknown tag="mrcbC91"> C </unknown>         <unknown tag="mrcbT16-e">ENGINEERING.ELECTRICAL&amp;ELECTRONIC</unknown> <unknown tag="mrcbT16-f">3.414</unknown> <unknown tag="mrcbT16-g">0.482</unknown> <unknown tag="mrcbT16-h">5.4</unknown> <unknown tag="mrcbT16-i">0.02646</unknown> <unknown tag="mrcbT16-j">1.106</unknown> <unknown tag="mrcbT16-k">11929</unknown> <unknown tag="mrcbT16-q">167</unknown> <unknown tag="mrcbT16-s">1.145</unknown> <unknown tag="mrcbT16-y">25.9</unknown> <unknown tag="mrcbT16-x">4.55</unknown> <unknown tag="mrcbT16-3">5579</unknown> <unknown tag="mrcbT16-4">Q1</unknown> <unknown tag="mrcbT16-5">2.866</unknown> <unknown tag="mrcbT16-6">371</unknown> <unknown tag="mrcbT16-7">Q2</unknown> <unknown tag="mrcbT16-B">81.438</unknown> <unknown tag="mrcbT16-C">67.9</unknown> <unknown tag="mrcbT16-D">Q1</unknown> <unknown tag="mrcbT16-E">Q4</unknown> <unknown tag="mrcbT16-M">1.08</unknown> <unknown tag="mrcbT16-N">Q1</unknown> <unknown tag="mrcbT16-P">67.857</unknown> <arlyear>2019</arlyear>    <unknown tag="mrcbTft">  Soubory v repozitáři: tichavsky-0509948.pdf, tichavsky-0509948-CopyrightReceipt.pdf </unknown>    <unknown tag="mrcbU14"> 85077750421 SCOPUS </unknown> <unknown tag="mrcbU24"> PUBMED </unknown> <unknown tag="mrcbU34"> 000492301000002 WOS </unknown> <unknown tag="mrcbU56"> 732 kB </unknown> <unknown tag="mrcbU63"> cav_un_epca*0253212 IEEE Signal Processing Letters 1070-9908 1558-2361 Roč. 26 č. 11 2019 1653 1657 Institute of Electrical and Electronics Engineers </unknown> </cas_special> </bibitem>