Deutsch
 
Hilfe Datenschutzhinweis Impressum
  DetailsucheBrowse

Datensatz

DATENSATZ AKTIONENEXPORT
Zur Ablage hinzufügen
 Lokale TagsFreigabegeschichteDetailsÜbersicht
  Generalized Proximity and Projection with Norms and Mixed-norms

Sra, S.(2010). Generalized Proximity and Projection with Norms and Mixed-norms (192). Tübingen, Germany: Max Planck Institute for Biological Cybernetics.

Item is

 

einblenden: alle ausblenden: alle

Basisdaten

einblenden: ausblenden:
Datensatz-Permalink: https://hdl.handle.net/11858/00-001M-0000-0013-C05A-E Versions-Permalink: https://hdl.handle.net/21.11116/0000-0002-8595-F
Genre: Bericht

Dateien

einblenden: Dateien
ausblenden: Dateien
:
MPIK-TR-192_6518[0].pdf (Verlagsversion), 389KB
Öffnen   Speichern
Datei-Permalink:
https://hdl.handle.net/21.11116/0000-0002-8596-E
Name:
MPIK-TR-192_6518[0].pdf
Beschreibung:
-
OA-Status:
Sichtbarkeit:
Öffentlich
MIME-Typ / Prüfsumme:
application/pdf / [MD5]
Technische Metadaten:
Öffnen
Copyright Datum:
-
Copyright Info:
-
Lizenz:
-

Externe Referenzen

einblenden:

Urheber

einblenden:
ausblenden:
 Urheber:
Sra, S1, 2, Autor           
Affiliations:
1Department Empirical Inference, Max Planck Institute for Biological Cybernetics, Max Planck Society, ou_1497795              
2Max Planck Institute for Biological Cybernetics, Max Planck Society, Spemannstrasse 38, 72076 Tübingen, DE, ou_1497794              

Inhalt

einblenden:
ausblenden:
Schlagwörter: -
 Zusammenfassung: We discuss generalized proximity operators (GPO) and their associated generalized projection problems.
On inputs of size n, we show how to efficiently apply GPOs and generalized projections for separable
norms and distance-like functions to accuracy e in O(n log(1/e)) time. We also derive projection algorithms that
run theoretically in O(n log n log(1/e)) time but can for suitable parameter ranges empirically outperform the
O(n log(1/e)) projection method. The proximity and projection tasks are either separable, and solved directly, or
are reduced to a single root-finding step. We highlight that as a byproduct, our analysis also yields an O(n log(1/e))
(weakly linear-time) procedure for Euclidean projections onto the l1;1-norm ball; previously only an O(n log n)
method was known. We provide empirical evaluation to illustrate the performance of our methods, noting that
for the l1;1-norm projection, our implementation is more than two orders of magnitude faster than the previously
known method.

Details

einblenden:
ausblenden:
Sprache(n):
 Datum: 2010-05
 Publikationsstatus: Erschienen
 Seiten: 13
 Ort, Verlag, Ausgabe: Tübingen, Germany : Max Planck Institute for Biological Cybernetics
 Inhaltsverzeichnis: -
 Art der Begutachtung: -
 Identifikatoren: Reportnr.: 192
BibTex Citekey: 6518
 Art des Abschluß: -

Veranstaltung

einblenden:

Entscheidung

einblenden:

Projektinformation

einblenden:

Quelle 1

einblenden:
ausblenden:
Titel: Technical Report of the Max Planck Institute for Biological Cybernetics
Genre der Quelle: Reihe
 Urheber:
Affiliations:
Ort, Verlag, Ausgabe: -
Seiten: - Band / Heft: 192 Artikelnummer: - Start- / Endseite: - Identifikator: -