SlideShare a Scribd company logo
1
n
• ~2013.3, PhD@ ,
• 2013.4~2016.3, @IBM
• 2016.4~2017.8, @ ERATO, NII
• 2017.9~, @ ,
n
•
ECML’11
AISTATS’15,17
•
AISTATS’18
AAAI’17,18
2
Cont.
n
• ℓ"
n
• Lasso
min
&
1
2
) − +, -
+ / , "
3
Cont.
n
• ℓ"
n
• Lasso
min
&
1
2
) − +, -
+ / , "
n
• Lasso
4
n
• Sparse Coding
Learned ISTA (LISTA)
n Sparse Coding
• Lasso
n LISTA ISTA
• ISTA: Iterative Soft-Threshold Algorithm
proximal gradient descent
5
[Gregor and LeCun, ICML’10]
Sparse Coding ISTA
n /
n ISTA Lasso
6
ISTA
Sparse Coding ISTA
n /
n ISTA Lasso
7
ISTA
Sparse Coding Learned ISTA
n Learned ISTA (LISTA) [Gregor and LeCun, ICML’10]
ISTA
n LISTA
•
•
•
8
MNIST LISTA
n
n
• ISTA
• Learned ISTA (LISTA)
n
n LISTA
n
n
9
Iterative Soft-Thresholding Algorithm (ISTA)
n
• !∗ ∈ ℝ% ←
n
• & ∈ ℝ' ←
• / ( ∈ ℝ'×% ←
!∗ & = (!∗ + ,
• !∗
n Lasso
-! = argmin
4
1
2
& − (! 8 + 9 ! :
10
Iterative Soft-Thresholding Algorithm (ISTA)
n
!" = argmin
*
1
2
- − /" 0 + 2 " 3
n ISTA Lasso
• " ← 06
• "
3
0
- − /" 0 "
• " ← " − 7 /8/" − /8- = 96 − 7/8/ " + 7/8-
"
• " ← ℎ;< " = sign " ⊙ max {0, abs " − 72}
11→
Learned ISTA (LISTA) [Gregor and LeCun, ICML’10]
n ISTA
• !" = ℎ%&
'()
→ !+ = ℎ%,
-"!" + '")
→ !/ = ℎ%0
-+!+ + '+)
→ …
n ISTA
12
-2 = 34 − 6787
'2 = 678
92 = :;
!"
)
!+ !/-" ℎ%, -+ ℎ%0
'(
'" '+
←
↑
ℎ%&
ISTA 3
4 DNN
Learned ISTA (LISTA) [Gregor and LeCun, ICML’10]
n LISTA
• !" = $"(&; (, *, +) K+1 DNN
• ISTA -! DNN !"
(, *, + DNN
13
-!
(, *, +
DNN
!.
/
!0 !1(. ℎ34 (0 ℎ35
*6
*. *0
←
↑
ℎ37
Learned ISTA (LISTA) [Gregor and LeCun, ICML’10]
n LISTA -
• ! "#
{ !%, "#% }%()
*
• K+1 DNN #+ = -+(!; 0, 1, 2)
•
min
7,8,9
1
2
<=, "> "# − -+(!; 0, 1, 2) @
n LISTA -
• #+ = -+(!; 0, 1, 2)
DNN
14
SGD
MNIST LISTA
n
n
• ISTA
• Learned ISTA (LISTA)
n
n LISTA
n
n
15
Research Question
LISTA
n 10~20
n
• ! = #$∗ + ' (($∗, ')
• (($∗
, ') !′ ISTA
-$′
16
ISTA 100
n
• !∗ #
!∗
$ ≤ &, !∗
( ≤ ), # * ≤ +
n
• ,- = / − 1-2 i.e. !-3* = ℎ56
!- + 1- 8 − 2!-
• s 9 !-
:, ; > 0 1-, >-
!- − !∗
? ≤ )&exp −:9 + ;+
17
s
8 = 2!∗
+ #
!-3* = ℎ56
,!- + 1-8
n
• !∗ #
!∗
$ ≤ &, !∗
( ≤ ), # * ≤ +
n
• ,- = / − 12- i.e. !34* = ℎ67
!3 + 2- 9 − 1!3
• : !3 ;, < > 0
2-, ?-
!3 − !∗
@ ≤ )&exp −;: + <+
s
9 = 1!∗
+ #
18
LISTA DNN
n
• !" = $ − &"' i.e. (")* = ℎ,-
(" + &" / − '("
• s 0 ("
1, 3 > 0 &", 6"
(" − (∗
8 ≤ :;exp −10 + 3?
n @ = supp (∗
• @ = supp (∗ : = D: (E
∗
≠ 0
n 2
• &E, 6E
1. (" E = 0, ∀D ∉ @, ∀0
2. (" − (∗
* 0
19
n Notation
• !
! " #
! $ %
• &
&"' (#, *)
&",: #
&:,' *
&:,$ %
• -. = 01 sup
5∗,7
8. − 8∗
: + <=>
01: = max
"B'
C. ",:D:,' <=: = max
",'
C. "'
20
1.
n DNN
• !"#$ = ℎ'(
!" + *" + − -!"
n !" . = 0, ∀2 ∉ 4
• + = -!∗ + 6 ∀2 ∉ 4
!"#$ . = ℎ'(
!" . + *" .,:- !∗ − !" + *" .,:6
= ℎ'(
*" .,:-:,8 !∗ − !" 8 + *" .,:6
n 9" = :; sup
?∗,@
!" − !∗
$ + ABC
• :;: = max
.GH
*" .,:-:,H AB: = max
.,H
*" .H
*" .,:-:,8 !∗ − !" 8 + *" .,:6 ≤ 9" ⇒ !"#$ . = 0
21≤ :; sup
?∗,@
!" − !∗
$ ≤ ABC
2. !" − !∗
% &
n ' ∈ )
!"*% + = ℎ./
!" + + 1" +,:4:,5 !∗ − !" 5 + 1" +,:6
n 1" +,:4:,+ = 1 1"
!" + + 1" +,:4:,5 !∗ − !" 5
= !" + + 1" +,:4:,5∖+ !∗ − !" 5∖+ + !∗ − !" +
= !∗
+ + 1" +,:4:,5∖+ !∗ − !" 5∖+
!"*% + − !∗
+ − 1" +,:4:,5∖+ !∗ − !" 5∖+ − 1" +,:6 ≤ :"
!"*% + − !∗
+
≤ 1" +,:4:,5∖+ !∗ − !" 5∖+ + 1" +,:6 + :"
≤ ;< !∗ − !" 5∖+ %
+ =>? + :"
22
ℎ./
:"
shrink
2. !" − !∗
% &
n !"'% − !∗
%
!"'% − !∗
% ≤ ∑*∈, !"'% * − !∗
*
≤ ∑*∈, -. !∗ − !" ,∖* %
+ 123 + 4"
≤ -. 5 − 1 !∗ − !" % + 5 4" + 5 123
n sup
sup
:∗,<
!"'% − !∗
%
≤ 2-.> − -. sup
:∗,<
!∗ − !" % + 2>123
≤ 2-.> − -. "'%sup
:∗,<
!∗ − !? % + 2>123 ∑@A?
"'%
2-.> − -. @
≤ 2-.> − -. ">B + 13
≤ >Bexp −E& + 13
23
E = −log 2-.> − -.
1 =
JKLM
%'NOPJNOK2 -.> − -. < 1
=
!* R = 0, ∀U ∉ 5
4" = -. sup
:∗,<
!" − !∗
% + 123
n LISTA-CP (LISTA with weights coupling)
• LISTA !"#$ = ℎ'(
)"!" + +",
• LISTA-CP !"#$ = ℎ'(
!" + +" , − .!"
n
• LISTA-CP +", 0"
!" − !∗
2 ≤ 45exp −9: + ;<
n LISTA-CP LISTA LISTA
)", +", 0"
24
n !∗ !# − !∗
%
n LISTA ISTA &!
!∗ !# − !∗
%
n !# − &! %
• !# − &! %
%
≤ !∗ − &! %
%
+ !# − !∗
%
%
!# − &! % tight
25
n
n
• ISTA
• Learned ISTA (LISTA)
n
n LISTA
n
n
26
LISTA
n ℎ"
• ℎ" # $
= sign #$ ⊙ max #$ − /
n Support Selection ℎ"
0
• #1 #1
→ shrink
• ℎ"
0
#
$
= 2
#$
ℎ" # $
27
#
shrink
#1 3% shrink
shrink
LISTA
n LISTA-CPSS
• s ! "#
$%% ≥ $, (%% ≤ ( *#, +#
"# − "∗
. ≤ /0exp −$%%! + (%%5
28
Weights Coupling Weights Coupling
Support Selection LISTA
"#67 = ℎ:;
<#"# + *#=
LISTA-CP
"#67 = ℎ:;
"# + *#(= − ?"#)
Support Selection LISTA-SS
"#67 = ℎ:;
A
<#"# + *#=
LISTA-CPSS
"#67 = ℎ:;
A
"# + *#(= − ?"#)
LIST-CP
n
n
• ISTA
• Learned ISTA (LISTA)
n
n LISTA
n
n
29
n
• !∗ 500
• # 250
• $
n LISTA-CP
30
NMSE
/
ISTA, FISTA
AMP
LISTA
LISTA-CP
NMSE
/
ISTA, FISTA
AMP
LISTA
LISTA-CP
LIST-CP
https://github.com/xchen-tamu/linear-lista-cpss
n
• !∗ 500
• # 250
• $
n LISTA-CPSS
31
LIST-CPSS
NMSE
/
LISTA-CPSS
NMSE
LISTA-CPSS
/
https://github.com/xchen-tamu/linear-lista-cpss
n Research Question
• Learned ISTA (LISTA)
n
• LISTA
• LISTA weights coupling (CP), support
selection (SS)
n LISTA-CPSS
32

More Related Content

What's hot

[Harvard CS264] 04 - Intermediate-level CUDA Programming
[Harvard CS264] 04 - Intermediate-level CUDA Programming[Harvard CS264] 04 - Intermediate-level CUDA Programming
[Harvard CS264] 04 - Intermediate-level CUDA Programming
npinto
 
EDAW Pamphlet
EDAW PamphletEDAW Pamphlet
EDAW Pamphlet
Tara Mah
 
SEO - It Works Even if You Don’t Know How or Why
SEO - It Works Even if You Don’t Know How or Why SEO - It Works Even if You Don’t Know How or Why
SEO - It Works Even if You Don’t Know How or Why
Wolfgang Weicht
 
Content exchanges for_trailblazers
Content exchanges for_trailblazersContent exchanges for_trailblazers
Content exchanges for_trailblazers
Team_TBD
 
Fiestaru07 2003
Fiestaru07 2003Fiestaru07 2003
Fiestaru07 2003
rukford1
 

What's hot (17)

Les polynômes formels à une indéterminée à coefficients dans un corps K
Les polynômes formels à une indéterminée à coefficients dans un corps KLes polynômes formels à une indéterminée à coefficients dans un corps K
Les polynômes formels à une indéterminée à coefficients dans un corps K
 
Who was william shakespeare ?
Who was william shakespeare ?Who was william shakespeare ?
Who was william shakespeare ?
 
Curso de leitura
Curso de leituraCurso de leitura
Curso de leitura
 
[Harvard CS264] 04 - Intermediate-level CUDA Programming
[Harvard CS264] 04 - Intermediate-level CUDA Programming[Harvard CS264] 04 - Intermediate-level CUDA Programming
[Harvard CS264] 04 - Intermediate-level CUDA Programming
 
Massive device deployment - EclipseCon 2011
Massive device deployment - EclipseCon 2011Massive device deployment - EclipseCon 2011
Massive device deployment - EclipseCon 2011
 
York, "Delivering Digital Content For New Generations of Research: Strategies...
York, "Delivering Digital Content For New Generations of Research: Strategies...York, "Delivering Digital Content For New Generations of Research: Strategies...
York, "Delivering Digital Content For New Generations of Research: Strategies...
 
Max Niederhofer, Qwerly
Max Niederhofer, QwerlyMax Niederhofer, Qwerly
Max Niederhofer, Qwerly
 
Instructivo manual de requisitos de inscripcion de informacion leagl, tecnica...
Instructivo manual de requisitos de inscripcion de informacion leagl, tecnica...Instructivo manual de requisitos de inscripcion de informacion leagl, tecnica...
Instructivo manual de requisitos de inscripcion de informacion leagl, tecnica...
 
Device deployment
Device deploymentDevice deployment
Device deployment
 
Can cafa white paper
Can cafa white paperCan cafa white paper
Can cafa white paper
 
EDAW Pamphlet
EDAW PamphletEDAW Pamphlet
EDAW Pamphlet
 
Gsp53 1
Gsp53 1Gsp53 1
Gsp53 1
 
Libro nicaragua y el fsln-marti puig close-libre
Libro nicaragua y el fsln-marti puig close-libreLibro nicaragua y el fsln-marti puig close-libre
Libro nicaragua y el fsln-marti puig close-libre
 
Csharp Intsight
Csharp IntsightCsharp Intsight
Csharp Intsight
 
SEO - It Works Even if You Don’t Know How or Why
SEO - It Works Even if You Don’t Know How or Why SEO - It Works Even if You Don’t Know How or Why
SEO - It Works Even if You Don’t Know How or Why
 
Content exchanges for_trailblazers
Content exchanges for_trailblazersContent exchanges for_trailblazers
Content exchanges for_trailblazers
 
Fiestaru07 2003
Fiestaru07 2003Fiestaru07 2003
Fiestaru07 2003
 

Similar to Theoretical Linear Convergence of Unfolded ISTA and its Practical Weights and Thresholds

الفروقات الفردية بين الطلاب كيف نفهمها
الفروقات الفردية بين الطلاب  كيف نفهمهاالفروقات الفردية بين الطلاب  كيف نفهمها
الفروقات الفردية بين الطلاب كيف نفهمها
Eladeb Marouan
 
Наибольшая общая мера: 2500 лет
Наибольшая общая мера: 2500 летНаибольшая общая мера: 2500 лет
Наибольшая общая мера: 2500 лет
sixtyone
 
الجزء الثالث أسئلة تنفيذية مهندس محمد زكى إسماعيل
الجزء الثالث أسئلة تنفيذية مهندس محمد زكى إسماعيلالجزء الثالث أسئلة تنفيذية مهندس محمد زكى إسماعيل
الجزء الثالث أسئلة تنفيذية مهندس محمد زكى إسماعيل
Mohamed Saeed
 
Toan pt.de075.2012
Toan pt.de075.2012Toan pt.de075.2012
Toan pt.de075.2012
BẢO Hí
 
The Colbert Report. La satire politique qui réveille l'Amérique
The Colbert Report. La satire politique qui réveille l'AmériqueThe Colbert Report. La satire politique qui réveille l'Amérique
The Colbert Report. La satire politique qui réveille l'Amérique
Antoine Patricot
 
La ideologia anarquista angel cappelletti
La ideologia anarquista   angel cappellettiLa ideologia anarquista   angel cappelletti
La ideologia anarquista angel cappelletti
aliinkaaaa
 
بهینه سازی استفاده از آنزیمهای پروتئاز...
بهینه سازی استفاده از آنزیمهای پروتئاز...بهینه سازی استفاده از آنزیمهای پروتئاز...
بهینه سازی استفاده از آنزیمهای پروتئاز...
Haleh Hadaegh
 
Lte 3 g 2g convergence 20120202
Lte 3 g 2g convergence 20120202Lte 3 g 2g convergence 20120202
Lte 3 g 2g convergence 20120202
中琳 李中琳
 
Vortrag alternativkonzept geothermie
Vortrag alternativkonzept geothermieVortrag alternativkonzept geothermie
Vortrag alternativkonzept geothermie
Harald Fratz
 

Similar to Theoretical Linear Convergence of Unfolded ISTA and its Practical Weights and Thresholds (20)

Functional Gradient Boosting based on Residual Network Perception
Functional Gradient Boosting based on Residual Network PerceptionFunctional Gradient Boosting based on Residual Network Perception
Functional Gradient Boosting based on Residual Network Perception
 
الفروقات الفردية بين الطلاب كيف نفهمها
الفروقات الفردية بين الطلاب  كيف نفهمهاالفروقات الفردية بين الطلاب  كيف نفهمها
الفروقات الفردية بين الطلاب كيف نفهمها
 
الفروقات الفردية بين الطلاب كيف نفهمها
الفروقات الفردية بين الطلاب  كيف نفهمهاالفروقات الفردية بين الطلاب  كيف نفهمها
الفروقات الفردية بين الطلاب كيف نفهمها
 
Наибольшая общая мера: 2500 лет
Наибольшая общая мера: 2500 летНаибольшая общая мера: 2500 лет
Наибольшая общая мера: 2500 лет
 
8 tonnes sustainable_household_consumption
8 tonnes sustainable_household_consumption8 tonnes sustainable_household_consumption
8 tonnes sustainable_household_consumption
 
Slownik
SlownikSlownik
Slownik
 
Arquitetura da Informação em Repositórios Digitais
Arquitetura da Informação em Repositórios DigitaisArquitetura da Informação em Repositórios Digitais
Arquitetura da Informação em Repositórios Digitais
 
الجزء الثالث أسئلة تنفيذية مهندس محمد زكى إسماعيل
الجزء الثالث أسئلة تنفيذية مهندس محمد زكى إسماعيلالجزء الثالث أسئلة تنفيذية مهندس محمد زكى إسماعيل
الجزء الثالث أسئلة تنفيذية مهندس محمد زكى إسماعيل
 
Toan pt.de075.2012
Toan pt.de075.2012Toan pt.de075.2012
Toan pt.de075.2012
 
The Colbert Report. La satire politique qui réveille l'Amérique
The Colbert Report. La satire politique qui réveille l'AmériqueThe Colbert Report. La satire politique qui réveille l'Amérique
The Colbert Report. La satire politique qui réveille l'Amérique
 
PCon 2016: Advanced Attribution & Predictive Customer Interaction (Dr. Alwin ...
PCon 2016: Advanced Attribution & Predictive Customer Interaction (Dr. Alwin ...PCon 2016: Advanced Attribution & Predictive Customer Interaction (Dr. Alwin ...
PCon 2016: Advanced Attribution & Predictive Customer Interaction (Dr. Alwin ...
 
Concurso de relatos qué es un libro para ti
Concurso de relatos qué es un libro para tiConcurso de relatos qué es un libro para ti
Concurso de relatos qué es un libro para ti
 
Janusz Korczak - wykaz książek i artykułów w zbiorach BP Cieszyn
Janusz Korczak - wykaz książek i artykułów w zbiorach BP CieszynJanusz Korczak - wykaz książek i artykułów w zbiorach BP Cieszyn
Janusz Korczak - wykaz książek i artykułów w zbiorach BP Cieszyn
 
Groupes
GroupesGroupes
Groupes
 
La ideologia anarquista angel cappelletti
La ideologia anarquista   angel cappellettiLa ideologia anarquista   angel cappelletti
La ideologia anarquista angel cappelletti
 
بهینه سازی استفاده از آنزیمهای پروتئاز...
بهینه سازی استفاده از آنزیمهای پروتئاز...بهینه سازی استفاده از آنزیمهای پروتئاز...
بهینه سازی استفاده از آنزیمهای پروتئاز...
 
Lte 3 g 2g convergence 20120202
Lte 3 g 2g convergence 20120202Lte 3 g 2g convergence 20120202
Lte 3 g 2g convergence 20120202
 
Oceans 2019 tutorial-geophysical-nav_7-updated
Oceans 2019 tutorial-geophysical-nav_7-updatedOceans 2019 tutorial-geophysical-nav_7-updated
Oceans 2019 tutorial-geophysical-nav_7-updated
 
Vortrag alternativkonzept geothermie
Vortrag alternativkonzept geothermieVortrag alternativkonzept geothermie
Vortrag alternativkonzept geothermie
 
Attention-Based Adaptive Selection of Operations for Image Restoration in the...
Attention-Based Adaptive Selection of Operations for Image Restoration in the...Attention-Based Adaptive Selection of Operations for Image Restoration in the...
Attention-Based Adaptive Selection of Operations for Image Restoration in the...
 

More from Satoshi Hara

More from Satoshi Hara (12)

Explanation in Machine Learning and Its Reliability
Explanation in Machine Learning and Its ReliabilityExplanation in Machine Learning and Its Reliability
Explanation in Machine Learning and Its Reliability
 
“機械学習の説明”の信頼性
“機械学習の説明”の信頼性“機械学習の説明”の信頼性
“機械学習の説明”の信頼性
 
【論文調査】XAI技術の効能を ユーザ実験で評価する研究
【論文調査】XAI技術の効能を ユーザ実験で評価する研究【論文調査】XAI技術の効能を ユーザ実験で評価する研究
【論文調査】XAI技術の効能を ユーザ実験で評価する研究
 
機械学習で嘘をつく話
機械学習で嘘をつく話機械学習で嘘をつく話
機械学習で嘘をつく話
 
機械学習モデルの判断根拠の説明(Ver.2)
機械学習モデルの判断根拠の説明(Ver.2)機械学習モデルの判断根拠の説明(Ver.2)
機械学習モデルの判断根拠の説明(Ver.2)
 
異常の定義と推定
異常の定義と推定異常の定義と推定
異常の定義と推定
 
Convex Hull Approximation of Nearly Optimal Lasso Solutions
Convex Hull Approximation of Nearly Optimal Lasso SolutionsConvex Hull Approximation of Nearly Optimal Lasso Solutions
Convex Hull Approximation of Nearly Optimal Lasso Solutions
 
Maximally Invariant Data Perturbation as Explanation
Maximally Invariant Data Perturbation as ExplanationMaximally Invariant Data Perturbation as Explanation
Maximally Invariant Data Perturbation as Explanation
 
アンサンブル木モデル解釈のためのモデル簡略化法
アンサンブル木モデル解釈のためのモデル簡略化法アンサンブル木モデル解釈のためのモデル簡略化法
アンサンブル木モデル解釈のためのモデル簡略化法
 
機械学習モデルの列挙
機械学習モデルの列挙機械学習モデルの列挙
機械学習モデルの列挙
 
KDD'17読み会:Anomaly Detection with Robust Deep Autoencoders
KDD'17読み会:Anomaly Detection with Robust Deep AutoencodersKDD'17読み会:Anomaly Detection with Robust Deep Autoencoders
KDD'17読み会:Anomaly Detection with Robust Deep Autoencoders
 
特徴選択のためのLasso解列挙
特徴選択のためのLasso解列挙特徴選択のためのLasso解列挙
特徴選択のためのLasso解列挙
 

Recently uploaded

Essentials of Automations: Optimizing FME Workflows with Parameters
Essentials of Automations: Optimizing FME Workflows with ParametersEssentials of Automations: Optimizing FME Workflows with Parameters
Essentials of Automations: Optimizing FME Workflows with Parameters
Safe Software
 

Recently uploaded (20)

Software Delivery At the Speed of AI: Inflectra Invests In AI-Powered Quality
Software Delivery At the Speed of AI: Inflectra Invests In AI-Powered QualitySoftware Delivery At the Speed of AI: Inflectra Invests In AI-Powered Quality
Software Delivery At the Speed of AI: Inflectra Invests In AI-Powered Quality
 
Free and Effective: Making Flows Publicly Accessible, Yumi Ibrahimzade
Free and Effective: Making Flows Publicly Accessible, Yumi IbrahimzadeFree and Effective: Making Flows Publicly Accessible, Yumi Ibrahimzade
Free and Effective: Making Flows Publicly Accessible, Yumi Ibrahimzade
 
Optimizing NoSQL Performance Through Observability
Optimizing NoSQL Performance Through ObservabilityOptimizing NoSQL Performance Through Observability
Optimizing NoSQL Performance Through Observability
 
Measures in SQL (a talk at SF Distributed Systems meetup, 2024-05-22)
Measures in SQL (a talk at SF Distributed Systems meetup, 2024-05-22)Measures in SQL (a talk at SF Distributed Systems meetup, 2024-05-22)
Measures in SQL (a talk at SF Distributed Systems meetup, 2024-05-22)
 
Essentials of Automations: Optimizing FME Workflows with Parameters
Essentials of Automations: Optimizing FME Workflows with ParametersEssentials of Automations: Optimizing FME Workflows with Parameters
Essentials of Automations: Optimizing FME Workflows with Parameters
 
ODC, Data Fabric and Architecture User Group
ODC, Data Fabric and Architecture User GroupODC, Data Fabric and Architecture User Group
ODC, Data Fabric and Architecture User Group
 
Knowledge engineering: from people to machines and back
Knowledge engineering: from people to machines and backKnowledge engineering: from people to machines and back
Knowledge engineering: from people to machines and back
 
In-Depth Performance Testing Guide for IT Professionals
In-Depth Performance Testing Guide for IT ProfessionalsIn-Depth Performance Testing Guide for IT Professionals
In-Depth Performance Testing Guide for IT Professionals
 
Demystifying gRPC in .Net by John Staveley
Demystifying gRPC in .Net by John StaveleyDemystifying gRPC in .Net by John Staveley
Demystifying gRPC in .Net by John Staveley
 
AI revolution and Salesforce, Jiří Karpíšek
AI revolution and Salesforce, Jiří KarpíšekAI revolution and Salesforce, Jiří Karpíšek
AI revolution and Salesforce, Jiří Karpíšek
 
Powerful Start- the Key to Project Success, Barbara Laskowska
Powerful Start- the Key to Project Success, Barbara LaskowskaPowerful Start- the Key to Project Success, Barbara Laskowska
Powerful Start- the Key to Project Success, Barbara Laskowska
 
De-mystifying Zero to One: Design Informed Techniques for Greenfield Innovati...
De-mystifying Zero to One: Design Informed Techniques for Greenfield Innovati...De-mystifying Zero to One: Design Informed Techniques for Greenfield Innovati...
De-mystifying Zero to One: Design Informed Techniques for Greenfield Innovati...
 
Mission to Decommission: Importance of Decommissioning Products to Increase E...
Mission to Decommission: Importance of Decommissioning Products to Increase E...Mission to Decommission: Importance of Decommissioning Products to Increase E...
Mission to Decommission: Importance of Decommissioning Products to Increase E...
 
"Impact of front-end architecture on development cost", Viktor Turskyi
"Impact of front-end architecture on development cost", Viktor Turskyi"Impact of front-end architecture on development cost", Viktor Turskyi
"Impact of front-end architecture on development cost", Viktor Turskyi
 
How world-class product teams are winning in the AI era by CEO and Founder, P...
How world-class product teams are winning in the AI era by CEO and Founder, P...How world-class product teams are winning in the AI era by CEO and Founder, P...
How world-class product teams are winning in the AI era by CEO and Founder, P...
 
To Graph or Not to Graph Knowledge Graph Architectures and LLMs
To Graph or Not to Graph Knowledge Graph Architectures and LLMsTo Graph or Not to Graph Knowledge Graph Architectures and LLMs
To Graph or Not to Graph Knowledge Graph Architectures and LLMs
 
Dev Dives: Train smarter, not harder – active learning and UiPath LLMs for do...
Dev Dives: Train smarter, not harder – active learning and UiPath LLMs for do...Dev Dives: Train smarter, not harder – active learning and UiPath LLMs for do...
Dev Dives: Train smarter, not harder – active learning and UiPath LLMs for do...
 
Unpacking Value Delivery - Agile Oxford Meetup - May 2024.pptx
Unpacking Value Delivery - Agile Oxford Meetup - May 2024.pptxUnpacking Value Delivery - Agile Oxford Meetup - May 2024.pptx
Unpacking Value Delivery - Agile Oxford Meetup - May 2024.pptx
 
IESVE for Early Stage Design and Planning
IESVE for Early Stage Design and PlanningIESVE for Early Stage Design and Planning
IESVE for Early Stage Design and Planning
 
From Siloed Products to Connected Ecosystem: Building a Sustainable and Scala...
From Siloed Products to Connected Ecosystem: Building a Sustainable and Scala...From Siloed Products to Connected Ecosystem: Building a Sustainable and Scala...
From Siloed Products to Connected Ecosystem: Building a Sustainable and Scala...
 

Theoretical Linear Convergence of Unfolded ISTA and its Practical Weights and Thresholds

  • 1. 1
  • 2. n • ~2013.3, PhD@ , • 2013.4~2016.3, @IBM • 2016.4~2017.8, @ ERATO, NII • 2017.9~, @ , n • ECML’11 AISTATS’15,17 • AISTATS’18 AAAI’17,18 2
  • 4. Cont. n • ℓ" n • Lasso min & 1 2 ) − +, - + / , " n • Lasso 4
  • 5. n • Sparse Coding Learned ISTA (LISTA) n Sparse Coding • Lasso n LISTA ISTA • ISTA: Iterative Soft-Threshold Algorithm proximal gradient descent 5 [Gregor and LeCun, ICML’10]
  • 6. Sparse Coding ISTA n / n ISTA Lasso 6 ISTA
  • 7. Sparse Coding ISTA n / n ISTA Lasso 7 ISTA
  • 8. Sparse Coding Learned ISTA n Learned ISTA (LISTA) [Gregor and LeCun, ICML’10] ISTA n LISTA • • • 8 MNIST LISTA
  • 9. n n • ISTA • Learned ISTA (LISTA) n n LISTA n n 9
  • 10. Iterative Soft-Thresholding Algorithm (ISTA) n • !∗ ∈ ℝ% ← n • & ∈ ℝ' ← • / ( ∈ ℝ'×% ← !∗ & = (!∗ + , • !∗ n Lasso -! = argmin 4 1 2 & − (! 8 + 9 ! : 10
  • 11. Iterative Soft-Thresholding Algorithm (ISTA) n !" = argmin * 1 2 - − /" 0 + 2 " 3 n ISTA Lasso • " ← 06 • " 3 0 - − /" 0 " • " ← " − 7 /8/" − /8- = 96 − 7/8/ " + 7/8- " • " ← ℎ;< " = sign " ⊙ max {0, abs " − 72} 11→
  • 12. Learned ISTA (LISTA) [Gregor and LeCun, ICML’10] n ISTA • !" = ℎ%& '() → !+ = ℎ%, -"!" + '") → !/ = ℎ%0 -+!+ + '+) → … n ISTA 12 -2 = 34 − 6787 '2 = 678 92 = :; !" ) !+ !/-" ℎ%, -+ ℎ%0 '( '" '+ ← ↑ ℎ%& ISTA 3 4 DNN
  • 13. Learned ISTA (LISTA) [Gregor and LeCun, ICML’10] n LISTA • !" = $"(&; (, *, +) K+1 DNN • ISTA -! DNN !" (, *, + DNN 13 -! (, *, + DNN !. / !0 !1(. ℎ34 (0 ℎ35 *6 *. *0 ← ↑ ℎ37
  • 14. Learned ISTA (LISTA) [Gregor and LeCun, ICML’10] n LISTA - • ! "# { !%, "#% }%() * • K+1 DNN #+ = -+(!; 0, 1, 2) • min 7,8,9 1 2 <=, "> "# − -+(!; 0, 1, 2) @ n LISTA - • #+ = -+(!; 0, 1, 2) DNN 14 SGD MNIST LISTA
  • 15. n n • ISTA • Learned ISTA (LISTA) n n LISTA n n 15
  • 16. Research Question LISTA n 10~20 n • ! = #$∗ + ' (($∗, ') • (($∗ , ') !′ ISTA -$′ 16 ISTA 100
  • 17. n • !∗ # !∗ $ ≤ &, !∗ ( ≤ ), # * ≤ + n • ,- = / − 1-2 i.e. !-3* = ℎ56 !- + 1- 8 − 2!- • s 9 !- :, ; > 0 1-, >- !- − !∗ ? ≤ )&exp −:9 + ;+ 17 s 8 = 2!∗ + # !-3* = ℎ56 ,!- + 1-8
  • 18. n • !∗ # !∗ $ ≤ &, !∗ ( ≤ ), # * ≤ + n • ,- = / − 12- i.e. !34* = ℎ67 !3 + 2- 9 − 1!3 • : !3 ;, < > 0 2-, ?- !3 − !∗ @ ≤ )&exp −;: + <+ s 9 = 1!∗ + # 18 LISTA DNN
  • 19. n • !" = $ − &"' i.e. (")* = ℎ,- (" + &" / − '(" • s 0 (" 1, 3 > 0 &", 6" (" − (∗ 8 ≤ :;exp −10 + 3? n @ = supp (∗ • @ = supp (∗ : = D: (E ∗ ≠ 0 n 2 • &E, 6E 1. (" E = 0, ∀D ∉ @, ∀0 2. (" − (∗ * 0 19
  • 20. n Notation • ! ! " # ! $ % • & &"' (#, *) &",: # &:,' * &:,$ % • -. = 01 sup 5∗,7 8. − 8∗ : + <=> 01: = max "B' C. ",:D:,' <=: = max ",' C. "' 20
  • 21. 1. n DNN • !"#$ = ℎ'( !" + *" + − -!" n !" . = 0, ∀2 ∉ 4 • + = -!∗ + 6 ∀2 ∉ 4 !"#$ . = ℎ'( !" . + *" .,:- !∗ − !" + *" .,:6 = ℎ'( *" .,:-:,8 !∗ − !" 8 + *" .,:6 n 9" = :; sup ?∗,@ !" − !∗ $ + ABC • :;: = max .GH *" .,:-:,H AB: = max .,H *" .H *" .,:-:,8 !∗ − !" 8 + *" .,:6 ≤ 9" ⇒ !"#$ . = 0 21≤ :; sup ?∗,@ !" − !∗ $ ≤ ABC
  • 22. 2. !" − !∗ % & n ' ∈ ) !"*% + = ℎ./ !" + + 1" +,:4:,5 !∗ − !" 5 + 1" +,:6 n 1" +,:4:,+ = 1 1" !" + + 1" +,:4:,5 !∗ − !" 5 = !" + + 1" +,:4:,5∖+ !∗ − !" 5∖+ + !∗ − !" + = !∗ + + 1" +,:4:,5∖+ !∗ − !" 5∖+ !"*% + − !∗ + − 1" +,:4:,5∖+ !∗ − !" 5∖+ − 1" +,:6 ≤ :" !"*% + − !∗ + ≤ 1" +,:4:,5∖+ !∗ − !" 5∖+ + 1" +,:6 + :" ≤ ;< !∗ − !" 5∖+ % + =>? + :" 22 ℎ./ :" shrink
  • 23. 2. !" − !∗ % & n !"'% − !∗ % !"'% − !∗ % ≤ ∑*∈, !"'% * − !∗ * ≤ ∑*∈, -. !∗ − !" ,∖* % + 123 + 4" ≤ -. 5 − 1 !∗ − !" % + 5 4" + 5 123 n sup sup :∗,< !"'% − !∗ % ≤ 2-.> − -. sup :∗,< !∗ − !" % + 2>123 ≤ 2-.> − -. "'%sup :∗,< !∗ − !? % + 2>123 ∑@A? "'% 2-.> − -. @ ≤ 2-.> − -. ">B + 13 ≤ >Bexp −E& + 13 23 E = −log 2-.> − -. 1 = JKLM %'NOPJNOK2 -.> − -. < 1 = !* R = 0, ∀U ∉ 5 4" = -. sup :∗,< !" − !∗ % + 123
  • 24. n LISTA-CP (LISTA with weights coupling) • LISTA !"#$ = ℎ'( )"!" + +", • LISTA-CP !"#$ = ℎ'( !" + +" , − .!" n • LISTA-CP +", 0" !" − !∗ 2 ≤ 45exp −9: + ;< n LISTA-CP LISTA LISTA )", +", 0" 24
  • 25. n !∗ !# − !∗ % n LISTA ISTA &! !∗ !# − !∗ % n !# − &! % • !# − &! % % ≤ !∗ − &! % % + !# − !∗ % % !# − &! % tight 25
  • 26. n n • ISTA • Learned ISTA (LISTA) n n LISTA n n 26
  • 27. LISTA n ℎ" • ℎ" # $ = sign #$ ⊙ max #$ − / n Support Selection ℎ" 0 • #1 #1 → shrink • ℎ" 0 # $ = 2 #$ ℎ" # $ 27 # shrink #1 3% shrink shrink
  • 28. LISTA n LISTA-CPSS • s ! "# $%% ≥ $, (%% ≤ ( *#, +# "# − "∗ . ≤ /0exp −$%%! + (%%5 28 Weights Coupling Weights Coupling Support Selection LISTA "#67 = ℎ:; <#"# + *#= LISTA-CP "#67 = ℎ:; "# + *#(= − ?"#) Support Selection LISTA-SS "#67 = ℎ:; A <#"# + *#= LISTA-CPSS "#67 = ℎ:; A "# + *#(= − ?"#) LIST-CP
  • 29. n n • ISTA • Learned ISTA (LISTA) n n LISTA n n 29
  • 30. n • !∗ 500 • # 250 • $ n LISTA-CP 30 NMSE / ISTA, FISTA AMP LISTA LISTA-CP NMSE / ISTA, FISTA AMP LISTA LISTA-CP LIST-CP https://github.com/xchen-tamu/linear-lista-cpss
  • 31. n • !∗ 500 • # 250 • $ n LISTA-CPSS 31 LIST-CPSS NMSE / LISTA-CPSS NMSE LISTA-CPSS / https://github.com/xchen-tamu/linear-lista-cpss
  • 32. n Research Question • Learned ISTA (LISTA) n • LISTA • LISTA weights coupling (CP), support selection (SS) n LISTA-CPSS 32