Institutions

About Us

Help

Gaeilge
0
1000
Home
Browse
Advanced Search
Search History
Marked List
Statistics
A
A
A
Author(s)
Institution
Publication types
Funder
Year
Limited By:
Author = Olsson, Rasmus K.;
2 items found
Sort by
Title
Author
Item type
Date
Institution
Peer review status
Language
Order
Ascending
Descending
25
50
100
per page
Bibtex
CSV
EndNote
RefWorks
RIS
XML
Displaying Results 1  2 of 2 on page 1 of 1
Marked
Mark
Linear program differentiation for singlechannel speech separation
(2006)
Pearlmutter, Barak A.; Olsson, Rasmus K.
Linear program differentiation for singlechannel speech separation
(2006)
Pearlmutter, Barak A.; Olsson, Rasmus K.
Abstract:
Many apparently difficult problems can be solved by reduction to linear programming. Such problems are often subproblems within larger systems. When gradient optimisation of the entire larger system is desired, it is necessary to propagate gradients through the internallyinvoked LP solver. For instance, when an intermediate quantity z is the solution to a linear program involving constraint matrix A, a vector of sensitivities dE/dz will induce sensitivities dE/dA. Here we show how these can be efficiently calculated, when they exist. This allows algorithmic differentiation to be applied to algorithms that invoke linear programming solvers as subroutines, as is common when using sparse representations in signal processing. Here we apply it to gradient optimisation of over complete dictionaries for maximally sparse representations of a speech corpus. The dictionaries are employed in a singlechannel speech separation task, leading to 5 dB and 8 dB targettointerference ratio improve...
http://mural.maynoothuniversity.ie/1376/
Marked
Mark
Linear Program Differentiation For SingleCHannel Speech Separation
(2005)
Pearlmutter, Barak A.; Olsson, Rasmus K.
Linear Program Differentiation For SingleCHannel Speech Separation
(2005)
Pearlmutter, Barak A.; Olsson, Rasmus K.
Abstract:
Many apparently difficult problems can be solved by reduction to linear programming. Such problems are often subproblems within larger systems. When gradient optimisation of the entire larger system is desired, it is necessary to propagate gradients through the internallyinvoked LP solver. For instance, when an intermediate quantity z is the solution to a linear program involving constraint matrix A, a vector of sensitivities dE/dz will induce sensitivities dE/dA. Here we show how these can be efficiently calculated, when they exist. This allows algorithmic differentiation to be applied to algorithms that invoke linear programming solvers as subroutines, as is common when using sparse representations in signal processing. Here we apply it to gradient optimisation of overcomplete dictionaries for maximally sparse representations of a speech corpus. The dictionaries are employed in a singlechannel speech separation task, leading to 5 dB and 8 dB targettointerference ratio improvem...
http://mural.maynoothuniversity.ie/565/
Displaying Results 1  2 of 2 on page 1 of 1
Bibtex
CSV
EndNote
RefWorks
RIS
XML
Item Type
Conference item (1)
Journal article (1)
Year
2006 (1)
2005 (1)
built by Enovation Solutions