Увійти

Готові списки джерел за темами / Exact recovery

Зміст

Статті в журналах
Дисертації
Книги
Частини книг
Тези доповідей конференцій
Звіти організацій

Добірка наукової літератури з теми "Exact recovery"

Автор: Grafiati

Опубліковано: 9 листопада 2024

Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями

Оберіть тип джерела:

Ознайомтеся зі списками актуальних статей, книг, дисертацій, тез та інших наукових джерел на тему "Exact recovery".

Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.

Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.

Статті в журналах з теми "Exact recovery"

1

Andrecut, M. "Exact Fourier spectrum recovery." Physics Letters A 377, no. 1-2 (December 2012): 1–6. http://dx.doi.org/10.1016/j.physleta.2012.10.018.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

2

Tsuda, Seiya, Yuji Iwahori, M. K. Bhuyan, Robert J. Woodham, and Kunio Kasugai. "Recovering 3D Shape with Absolute Size from Endoscope Images Using RBF Neural Network." International Journal of Biomedical Imaging 2015 (2015): 1–11. http://dx.doi.org/10.1155/2015/109804.

Повний текст джерела

Анотація:

Medical diagnosis judges the status of polyp from the size and the 3D shape of the polyp from its medical endoscope image. However the medical doctor judges the status empirically from the endoscope image and more accurate 3D shape recovery from its 2D image has been demanded to support this judgment. As a method to recover 3D shape with high speed, VBW (Vogel-Breuß-Weickert) model is proposed to recover 3D shape under the condition of point light source illumination and perspective projection. However, VBW model recovers the relative shape but there is a problem that the shape cannot be recovered with the exact size. Here, shape modification is introduced to recover the exact shape with modification from that with VBW model. RBF-NN is introduced for the mapping between input and output. Input is given as the output of gradient parameters of VBW model for the generated sphere. Output is given as the true gradient parameters of true values of the generated sphere. Learning mapping with NN can modify the gradient and the depth can be recovered according to the modified gradient parameters. Performance of the proposed approach is confirmed via computer simulation and real experiment.

Стилі APA, Harvard, Vancouver, ISO та ін.

3

Cheded, L. "Exact recovery of higher order moments." IEEE Transactions on Information Theory 44, no. 2 (March 1998): 851–58. http://dx.doi.org/10.1109/18.661534.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

4

Berthet, Quentin, Philippe Rigollet, and Piyush Srivastava. "Exact recovery in the Ising blockmodel." Annals of Statistics 47, no. 4 (August 2019): 1805–34. http://dx.doi.org/10.1214/17-aos1620.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

5

Dym, Nadav, and Yaron Lipman. "Exact Recovery with Symmetries for Procrustes Matching." SIAM Journal on Optimization 27, no. 3 (January 2017): 1513–30. http://dx.doi.org/10.1137/16m1078628.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

6

Abbe, Emmanuel, Afonso S. Bandeira, and Georgina Hall. "Exact Recovery in the Stochastic Block Model." IEEE Transactions on Information Theory 62, no. 1 (January 2016): 471–87. http://dx.doi.org/10.1109/tit.2015.2490670.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

7

Duval, Vincent, and Gabriel Peyré. "Exact Support Recovery for Sparse Spikes Deconvolution." Foundations of Computational Mathematics 15, no. 5 (October 9, 2014): 1315–55. http://dx.doi.org/10.1007/s10208-014-9228-6.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

8

You, Qing Shan, and Qun Wan. "Principal Component Pursuit with Weighted Nuclear Norm." Applied Mechanics and Materials 513-517 (February 2014): 1722–26. http://dx.doi.org/10.4028/www.scientific.net/amm.513-517.1722.

Повний текст джерела

Анотація:

Principal Component Pursuit (PCP) recovers low-dimensional structures from a small set of linear measurements, such as low rank matrix and sparse matrix. Pervious works mainly focus on exact recovery without additional noise. However, in many applications the observed measurements are corrupted by an additional white Gaussian noise (AWGN). In this paper, we model the recovered matrix the sum a low-rank matrix, a sparse matrix and an AWGN. We propose a weighted PCP for the recovery matrix, which is solved by alternating direction method. Numerical results show that the reconstructions performance of weighted PCP outperforms the classical PCP in term of accuracy.

Стилі APA, Harvard, Vancouver, ISO та ін.

9

Chen, Xiaohui, and Yun Yang. "Cutoff for Exact Recovery of Gaussian Mixture Models." IEEE Transactions on Information Theory 67, no. 6 (June 2021): 4223–38. http://dx.doi.org/10.1109/tit.2021.3063155.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

10

Hajek, Bruce, Yihong Wu, and Jiaming Xu. "Achieving Exact Cluster Recovery Threshold via Semidefinite Programming." IEEE Transactions on Information Theory 62, no. 5 (May 2016): 2788–97. http://dx.doi.org/10.1109/tit.2016.2546280.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Більше джерел

Дисертації з теми "Exact recovery"

1

Trede, Dennis. "Inverse problems with sparsity constraints convergence rates and exact recovery." Berlin Logos-Verl, 2010. http://d-nb.info/1002361532/04.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

2

Flinth, Axel [Verfasser], Gitta [Akademischer Betreuer] Kutyniok, Gitta [Gutachter] Kutyniok, Rémi [Gutachter] Gribonval, and Felix [Gutachter] Krahmer. "Exact and soft recovery of structured signals from atomic and total variation norm regularization / Axel Flinth ; Gutachter: Gitta Kutyniok, Rémi Gribonval, Felix Krahmer ; Betreuer: Gitta Kutyniok." Berlin : Technische Universität Berlin, 2018. http://d-nb.info/1172809291/34.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

3

Nguyen, Thi Thanh. "Algorithmes gloutons orthogonaux sous contrainte de positivité." Thesis, Université de Lorraine, 2019. http://www.theses.fr/2019LORR0133/document.

Повний текст джерела

Анотація:

De nombreux domaines applicatifs conduisent à résoudre des problèmes inverses où le signal ou l'image à reconstruire est à la fois parcimonieux et positif. Si la structure de certains algorithmes de reconstruction parcimonieuse s'adapte directement pour traiter les contraintes de positivité, il n'en va pas de même des algorithmes gloutons orthogonaux comme OMP et OLS. Leur extension positive pose des problèmes d'implémentation car les sous-problèmes de moindres carrés positifs à résoudre ne possèdent pas de solution explicite. Dans la littérature, les algorithmes gloutons positifs (NNOG, pour “Non-Negative Orthogonal Greedy algorithms”) sont souvent considérés comme lents, et les implémentations récemment proposées exploitent des schémas récursifs approchés pour compenser cette lenteur. Dans ce manuscrit, les algorithmes NNOG sont vus comme des heuristiques pour résoudre le problème de minimisation L0 sous contrainte de positivité. La première contribution est de montrer que ce problème est NP-difficile. Deuxièmement, nous dressons un panorama unifié des algorithmes NNOG et proposons une implémentation exacte et rapide basée sur la méthode des contraintes actives avec démarrage à chaud pour résoudre les sous-problèmes de moindres carrés positifs. Cette implémentation réduit considérablement le coût des algorithmes NNOG et s'avère avantageuse par rapport aux schémas approximatifs existants. La troisième contribution consiste en une analyse de reconstruction exacte en K étapes du support d'une représentation K-parcimonieuse par les algorithmes NNOG lorsque la cohérence mutuelle du dictionnaire est inférieure à 1/(2K-1). C'est la première analyse de ce type
Non-negative sparse approximation arises in many applications fields such as biomedical engineering, fluid mechanics, astrophysics, and remote sensing. Some classical sparse algorithms can be straightforwardly adapted to deal with non-negativity constraints. On the contrary, the non-negative extension of orthogonal greedy algorithms is a challenging issue since the unconstrained least square subproblems are replaced by non-negative least squares subproblems which do not have closed-form solutions. In the literature, non-negative orthogonal greedy (NNOG) algorithms are often considered to be slow. Moreover, some recent works exploit approximate schemes to derive efficient recursive implementations. In this thesis, NNOG algorithms are introduced as heuristic solvers dedicated to L0 minimization under non-negativity constraints. It is first shown that the latter L0 minimization problem is NP-hard. The second contribution is to propose a unified framework on NNOG algorithms together with an exact and fast implementation, where the non-negative least-square subproblems are solved using the active-set algorithm with warm start initialisation. The proposed implementation significantly reduces the cost of NNOG algorithms and appears to be more advantageous than existing approximate schemes. The third contribution consists of a unified K-step exact support recovery analysis of NNOG algorithms when the mutual coherence of the dictionary is lower than 1/(2K-1). This is the first analysis of this kind

Стилі APA, Harvard, Vancouver, ISO та ін.

4

Denoyelle, Quentin. "Theoretical and Numerical Analysis of Super-Resolution Without Grid." Thesis, Paris Sciences et Lettres (ComUE), 2018. http://www.theses.fr/2018PSLED030/document.

Повний текст джерела

Анотація:

Cette thèse porte sur l'utilisation du BLASSO, un problème d'optimisation convexe en dimension infinie généralisant le LASSO aux mesures, pour la super-résolution de sources ponctuelles. Nous montrons d'abord que la stabilité du support des solutions, pour N sources se regroupant, est contrôlée par un objet appelé pré-certificat aux 2N-1 dérivées nulles. Quand ce pré-certificat est non dégénéré, dans un régime de petit bruit dont la taille est contrôlée par la distance minimale séparant les sources, le BLASSO reconstruit exactement le support de la mesure initiale. Nous proposons ensuite l'algorithme Sliding Frank-Wolfe, une variante de l'algorithme de Frank-Wolfe avec déplacement continu des amplitudes et des positions, qui résout le BLASSO. Sous de faibles hypothèses, cet algorithme converge en un nombre fini d'itérations. Nous utilisons cet algorithme pour un problème 3D de microscopie par fluorescence en comparant trois modèles construits à partir des techniques PALM/STORM
This thesis studies the noisy sparse spikes super-resolution problem for positive measures using the BLASSO, an infinite dimensional convex optimization problem generalizing the LASSO to measures. First, we show that the support stability of the BLASSO for N clustered spikes is governed by an object called the (2N-1)-vanishing derivatives pre-certificate. When it is non-degenerate, solving the BLASSO leads to exact support recovery of the initial measure, in a low noise regime whose size is controlled by the minimal separation distance of the spikes. In a second part, we propose the Sliding Frank-Wolfe algorithm, based on the Frank-Wolfe algorithm with an added step moving continuously the amplitudes and positions of the spikes, that solves the BLASSO. We show that, under mild assumptions, it converges in a finite number of iterations. We apply this algorithm to the 3D fluorescent microscopy problem by comparing three models based on the PALM/STORM technics

Стилі APA, Harvard, Vancouver, ISO та ін.

5

Godeme, Jean-Jacques. "Ρhase retrieval with nοn-Euclidean Bregman based geοmetry". Electronic Thesis or Diss., Normandie, 2024. http://www.theses.fr/2024NORMC214.

Повний текст джерела

Анотація:

Dans ce travail, nous nous intéressons au problème de reconstruction de phase de signaux à valeurs réelles en dimension finie, un défi rencontré dans de nombreuses disciplines scientifiques et d’ingénierie. Nous explorons deux approches complémentaires : la reconstruction avec et sans régularisation. Dans les deux cas, notre travail se concentre sur la relaxation de l’hypothèse de Lipschitz-continuité généralement requise par les algorithmes de descente du premier ordre, et qui n’est pas valide pour la reconstruction de phase lorsqu’il formulée comme un problème de minimisation. L’idée clé ici est de remplacer la géométrie euclidienne par une divergence de Bregman non euclidienne associée à un noyau générateur approprié. Nous utilisons un algorithme de descente miroir ou de descente à la Bregman avec cette divergence pour résoudre le problème de reconstruction de phase sans régularisation. Nous démontrons des résultats de reconstruction exacte (à un signe global près) à la fois dans un cadre déterministe et avec une forte probabilité pour un nombre suffisant de mesures aléatoires (mesures Gaussiennes et pour des mesures structurées comme la diffraction codée). De plus, nous établissons la stabilité de cette approche vis-à-vis d’un bruit additif faible. En passant à la reconstruction de phase régularisée, nous développons et analysons d’abord un algorithme proximal inertiel à la Bregman pour minimiser la somme de deux fonctions, l’une étant convexe et potentiellement non lisse et la seconde étant relativement lisse dans la géométrie de Bregman. Nous fournissons des garanties de convergence à la fois globale et locale pour cet algorithme. Enfin, nous étudions la reconstruction sans bruit et la stabilité du problème régularisé par un a priori de faible complexité. Pour celà, nous formulons le problème comme la minimisation d’une objective impliquant un terme d’attache aux données non convexe et un terme de régularisation convexe favorisant les solutions conformes à une certaine notion de faible complexité. Nous établissons des conditions pour une reconstruction exacte et stable et fournissons des bornes sur le nombre de mesures aléatoires suffisants pour de garantir que ces conditionssoient remplies. Ces bornes d’échantillonnage dépendent de la faible complexité des signaux à reconstruire. Ces résultats nouveaux permettent d’aller bien au-delà du cas de la reconstruction de phase parcimonieuse
In this work, we investigate the phase retrieval problem of real-valued signals in finite dimension, a challenge encountered across various scientific and engineering disciplines. It explores two complementary approaches: retrieval with and without regularization. In both settings, our work is focused on relaxing the Lipschitz-smoothness assumption generally required by first-order splitting algorithms, and which is not valid for phase retrieval cast as a minimization problem. The key idea here is to replace the Euclidean geometry by a non-Euclidean Bregman divergence associated to an appropriate kernel. We use a Bregman gradient/mirror descent algorithm with this divergence to solve thephase retrieval problem without regularization, and we show exact (up to a global sign) recovery both in a deterministic setting and with high probability for a sufficient number of random measurements (Gaussian and Coded Diffraction Patterns). Furthermore, we establish the robustness of this approachagainst small additive noise. Shifting to regularized phase retrieval, we first develop and analyze an Inertial Bregman Proximal Gradient algorithm for minimizing the sum of two functions in finite dimension, one of which is convex and possibly nonsmooth and the second is relatively smooth in the Bregman geometry. We provide both global and local convergence guarantees for this algorithm. Finally, we study noiseless and stable recovery of low complexity regularized phase retrieval. For this, weformulate the problem as the minimization of an objective functional involving a nonconvex smooth data fidelity term and a convex regularizer promoting solutions conforming to some notion of low-complexity related to their nonsmoothness points. We establish conditions for exact and stable recovery and provide sample complexity bounds for random measurements to ensure that these conditions hold. These sample bounds depend on the low complexity of the signals to be recovered. Our new results allow to go far beyond the case of sparse phase retrieval

Стилі APA, Harvard, Vancouver, ISO та ін.

6

Nguyen, Thi Thanh. "Algorithmes gloutons orthogonaux sous contrainte de positivité." Electronic Thesis or Diss., Université de Lorraine, 2019. http://www.theses.fr/2019LORR0133.

Повний текст джерела

Анотація:

De nombreux domaines applicatifs conduisent à résoudre des problèmes inverses où le signal ou l'image à reconstruire est à la fois parcimonieux et positif. Si la structure de certains algorithmes de reconstruction parcimonieuse s'adapte directement pour traiter les contraintes de positivité, il n'en va pas de même des algorithmes gloutons orthogonaux comme OMP et OLS. Leur extension positive pose des problèmes d'implémentation car les sous-problèmes de moindres carrés positifs à résoudre ne possèdent pas de solution explicite. Dans la littérature, les algorithmes gloutons positifs (NNOG, pour “Non-Negative Orthogonal Greedy algorithms”) sont souvent considérés comme lents, et les implémentations récemment proposées exploitent des schémas récursifs approchés pour compenser cette lenteur. Dans ce manuscrit, les algorithmes NNOG sont vus comme des heuristiques pour résoudre le problème de minimisation L0 sous contrainte de positivité. La première contribution est de montrer que ce problème est NP-difficile. Deuxièmement, nous dressons un panorama unifié des algorithmes NNOG et proposons une implémentation exacte et rapide basée sur la méthode des contraintes actives avec démarrage à chaud pour résoudre les sous-problèmes de moindres carrés positifs. Cette implémentation réduit considérablement le coût des algorithmes NNOG et s'avère avantageuse par rapport aux schémas approximatifs existants. La troisième contribution consiste en une analyse de reconstruction exacte en K étapes du support d'une représentation K-parcimonieuse par les algorithmes NNOG lorsque la cohérence mutuelle du dictionnaire est inférieure à 1/(2K-1). C'est la première analyse de ce type
Non-negative sparse approximation arises in many applications fields such as biomedical engineering, fluid mechanics, astrophysics, and remote sensing. Some classical sparse algorithms can be straightforwardly adapted to deal with non-negativity constraints. On the contrary, the non-negative extension of orthogonal greedy algorithms is a challenging issue since the unconstrained least square subproblems are replaced by non-negative least squares subproblems which do not have closed-form solutions. In the literature, non-negative orthogonal greedy (NNOG) algorithms are often considered to be slow. Moreover, some recent works exploit approximate schemes to derive efficient recursive implementations. In this thesis, NNOG algorithms are introduced as heuristic solvers dedicated to L0 minimization under non-negativity constraints. It is first shown that the latter L0 minimization problem is NP-hard. The second contribution is to propose a unified framework on NNOG algorithms together with an exact and fast implementation, where the non-negative least-square subproblems are solved using the active-set algorithm with warm start initialisation. The proposed implementation significantly reduces the cost of NNOG algorithms and appears to be more advantageous than existing approximate schemes. The third contribution consists of a unified K-step exact support recovery analysis of NNOG algorithms when the mutual coherence of the dictionary is lower than 1/(2K-1). This is the first analysis of this kind

Стилі APA, Harvard, Vancouver, ISO та ін.

7

Afdideh, Fardin. "Block-sparse models in multi-modality : application to the inverse model in EEG/MEG." Thesis, Université Grenoble Alpes (ComUE), 2018. http://www.theses.fr/2018GREAT074/document.

Повний текст джерела

Анотація:

De nombreux phénomènes naturels sont trop complexes pour être pleinement reconnus par un seul instrument de mesure ou par une seule modalité. Par conséquent, le domaine de recherche de la multi-modalité a émergé pour mieux identifier les caractéristiques riches du phénomène naturel de la multi-propriété naturelle, en analysant conjointement les données collectées à partir d’uniques modalités, qui sont en quelque sorte complémentaires. Dans notre étude, le phénomène d’intérêt multi-propriétés est l’activité du cerveau humain et nous nous intéressons à mieux la localiser au moyen de ses propriétés électromagnétiques, mesurables de manière non invasive. En neurophysiologie, l’électroencéphalographie (EEG) et la magnétoencéphalographie (MEG) constituent un moyen courant de mesurer les propriétés électriques et magnétiques de l’activité cérébrale. Notre application dans le monde réel, à savoir le problème de reconstruction de source EEG / MEG, est un problème fondamental en neurosciences, allant des sciences cognitives à la neuropathologie en passant par la planification chirurgicale. Considérant que le problème de reconstruction de source EEG /MEG peut être reformulé en un système d’équations linéaires sous-déterminé, la solution (l’activité estimée de la source cérébrale) doit être suffisamment parcimonieuse pour pouvoir être récupérée de manière unique. La quantité de parcimonie est déterminée par les conditions dites de récupération. Cependant, dans les problèmes de grande dimension, les conditions de récupération conventionnelles sont extrêmement strictes. En regroupant les colonnes cohérentes d’un dictionnaire, on pourrait obtenir une structure plus incohérente. Cette stratégie a été proposée en tant que cadre d’identification de structure de bloc, ce qui aboutit à la segmentation automatique de l’espace source du cerveau, sans utiliser aucune information sur l’activité des sources du cerveau et les signaux EEG / MEG. En dépit du dictionnaire structuré en blocs moins cohérent qui en a résulté, la condition de récupération conventionnelle n’est plus en mesure de calculer la caractérisation de la cohérence. Afin de relever le défi mentionné, le cadre général des conditions de récupération exactes par bloc-parcimonie, comprenant trois conditions théoriques et une condition dépendante de l’algorithme, a été proposé. Enfin, nous avons étudié la multi-modalité EEG et MEG et montré qu’en combinant les deux modalités, des régions cérébrales plus raffinées sont apparues
Three main challenges have been addressed in this thesis, in three chapters.First challenge is about the ineffectiveness of some classic methods in high-dimensional problems. This challenge is partially addressed through the idea of clustering the coherent parts of a dictionary based on the proposed characterisation, in order to create more incoherent atomic entities in the dictionary, which is proposed as a block structure identification framework. The more incoherent atomic entities, the more improvement in the exact recovery conditions. In addition, we applied the mentioned clustering idea to real-world EEG/MEG leadfields to segment the brain source space, without using any information about the brain sources activity and EEG/MEG signals. Second challenge raises when classic recovery conditions cannot be established for the new concept of constraint, i.e., block-sparsity. Therefore, as the second research orientation, we developed a general framework for block-sparse exact recovery conditions, i.e., four theoretical and one algorithmic-dependent conditions, which ensure the uniqueness of the block-sparse solution of corresponding weighted mixed-norm optimisation problem in an underdetermined system of linear equations. The mentioned generality of the framework is in terms of the properties of the underdetermined system of linear equations, extracted dictionary characterisations, optimisation problems, and ultimately the recovery conditions. Finally, the combination of different information of a same phenomenon is the subject of the third challenge, which is addressed in the last part of dissertation with application to brain source space segmentation. More precisely, we showed that by combining the EEG and MEG leadfields and gaining the electromagnetic properties of the head, more refined brain regions appeared

Стилі APA, Harvard, Vancouver, ISO та ін.

8

Bertin, Karine. "Estimation asymptotiquement exacte en norme sup de fonctions multidimensionnelles." Phd thesis, Université Pierre et Marie Curie - Paris VI, 2004. http://tel.archives-ouvertes.fr/tel-00008028.

Повний текст джерела

Анотація:

On étudie deux modèles statistiques: le modèle de régression à pas aléatoire et le modèle de bruit blanc gaussien. Dans ces modèles, le but est d'estimer en norme sup une fonction f inconnue, à partir des observations, en supposant que f appartient à une classe de Holder. Dans le modèle de régression, pour l'estimation d'une fonction unidimensionnelle, on obtient la constante exacte et un estimateur asymptotiquement exact. Dans le modèle de bruit blanc, on s'intéresse à l'estimation sur deux classes de fonctions multidimensionnelles anisotropes dont une est une classe additive. Pour ces deux classes, on détermine la constante exacte et un estimateur asymptotiquement exact et on met en évidence leur lien avec l'"optimal recovery". La dernière partie donne des résultats d'asymptotique exacte dans un cadre adaptatif dans le modèle de bruit blanc. On détermine la constante exacte adaptative et un estimateur asymptotiquement exact adaptatif pour l'estimation sur des classes anisotropes.

Стилі APA, Harvard, Vancouver, ISO та ін.

9

Gaïffas, Stéphane. "Régression non-paramétrique et information spatialement inhomogène." Paris 7, 2005. https://tel.archives-ouvertes.fr/tel-00011261.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

10

Gaiffas, Stéphane. "Régression non-paramétrique et information spatialement inhomogène." Phd thesis, Université Paris-Diderot - Paris VII, 2005. http://tel.archives-ouvertes.fr/tel-00011261.

Повний текст джерела

Анотація:

Nous étudions l'estimation non-paramétrique d'un signal à partir de
données bruitées spatialement inhomogènes (données dont la quantité
varie sur le domaine d'estimation). Le prototype d'étude est le modèle
de régression avec design aléatoire. Notre objectif est de comprendre
les conséquences du caractère inhomogène des données sur le problème
d'estimation dans le cadre d'étude minimax. Nous adoptons deux points
de vue : local et global. Du point de vue local, nous nous intéressons
à l'estimation de la régression en un point avec peu ou beaucoup de
données. En traduisant cette propriété par différentes hypothèses sur
le comportement local de la densité du design, nous obtenons toute une
gamme de nouvelles vitesses minimax ponctuelles, comprenant des
vitesses très lentes et des vitesses très rapides. Puis, nous
construisons une procédure adaptative en la régularité de la
régression, et nous montrons qu'elle converge avec la vitesse minimax
à laquelle s'ajoute un coût minimal pour l'adaptation locale. Du point
de vue global, nous nous intéressons à l'estimation de la régression
en perte uniforme. Nous proposons des estimateurs qui convergent avec
des vitesses dépendantes de l'espace, lesquelles rendent compte du
caractère inhomogène de l'information dans le modèle. Nous montrons
l'optimalité spatiale de ces vitesses, qui consiste en un renforcement
de la borne inférieure minimax classique pour la perte uniforme. Nous
construisons notamment un estimateur asymptotiquement exact sur une
boule de Hölder de régularité quelconque, ainsi qu'une bande de
confiance dont la largeur s'adapte à la quantité locale de données.

Стилі APA, Harvard, Vancouver, ISO та ін.

Книги з теми "Exact recovery"

1

Prasad, Konasale M. Course, Prognosis, and Outcomes of Schizophrenia and Related Disorders. Oxford University Press, 2016. http://dx.doi.org/10.1093/med/9780199331505.003.0004.

Повний текст джерела

Анотація:

Course and outcome in schizophrenia and related disorders historically depend on diagnostic conceptualizations, with significant variability even across individuals with the exact same diagnosis. In this chapter, we will review the heterogeneity of course and outcome, providing some context in terms of factors that affect prognosis. Generally speaking, current outcomes are better than previously thought, with three-quarters of individuals having a good prognosis. Although these illnesses cannot be cured, we know that recovery is possible. The best predictors of outcome in schizophrenia are cognitive and negative symptoms (not positive symptoms), along with premorbid functioning, duration of untreated psychosis, and treatment adherence over time. Finally, we will touch on functional outcomes such as risk of violence and suicide, as well as issues around treatment discontinuation.

Стилі APA, Harvard, Vancouver, ISO та ін.

2

Vance, Jim. Triathlon 2.0. Human Kinetics, 2016. http://dx.doi.org/10.5040/9781718219298.

Повний текст джерела

Анотація:

Serious triathletes may be the most tech-savvy of all athletes. You have the latest devices and know that data to improve your performance are at hand, but putting it all together can be a daunting, confusing task. Triathlete, coach, researcher, and author Jim Vance maintains that, despite access to the relevant information, most triathletes start a race undertrained or overtrained. That's why he's developed Triathlon 2.0: Data-Driven Performance Training, the first program to take advantage of the latest science and technology. Triathlon 2.0 examines the sport's most popular devices, including cycling power meters, GPS trackers, and heart rate monitors. Capture the most accurate readings, learn what they mean, and, just as important, what they don't. Then, put the numbers to work for you, translating your data into a comprehensive program based on your performance needs and triathlon goals. With Triathlon 2.0, you will learn these skills: • Establish and identify optimal aerobic fitness base. • Determine the exact number of intervals for the most effective training and quickest recovery. • Identify performance markers to track training results. • Develop a tapering plan for peak performance. • Monitor pace and progress in real time. If you're serious about maximizing performance, then turn to the only program built around your personal performance data. With Triathlon 2.0, the power and plan are in your hands.

Стилі APA, Harvard, Vancouver, ISO та ін.

3

Mann, Barbara Alice, ed. Daughters of Mother Earth. Greenwood Publishing Group, Inc., 2006. http://dx.doi.org/10.5040/9798400637902.

Повний текст джерела

Анотація:

Daughters of Mother Earthis nothing less than a new way of looking at history—or more correctly, the reestablishment of a very old way. It holds that for too long, elements unnatural to Native American ways of knowing have been imposed on the study of Native America. Euro-American discourse styles, emphasizing elite male privilege and conceptual linearity, have drowned out the democratic and woman-centered Native approaches. Even when the damage of western linearity is understood to occur, analysis of Native American history, society, and culture has still been relentlessly placed in male custody, following the western assumption that Euro-American men speak ably for all. This book seeks to redress that balance, allowing, as editor Barbara Alice Mann writes, the Daughters of Mother Earth to reclaim their ancient responsibility to speak in council, to tell the truth, to guide the rising generations through spirit-spoken wisdom. The recovery of women's traditions is an important theme in this collection of essays that helps reframe Native issues as properly gendered. Thus, Paula Gunn Allen looks at Indian lifeways through the many stitches of Indian clothes and the many steps of their powwow fancy-dances. Lee Maracle calls for reconstitution of traditional social structures, based on Native American ways of knowing. Kay McGowan identifies the exact sites where woman-power was weakened historically through the heavy impositions of European culture, the better to repair them. Finally, Barbara Mann examines how communication between Natives east and west of the Mississippi came to be so deranged as to be dysfunctional, and outlines how to reestablish good east-west relations for the benefit of all.

Стилі APA, Harvard, Vancouver, ISO та ін.

4

Mashhoon, Bahram. Linearized Nonlocal Gravity. Oxford University Press, 2017. http://dx.doi.org/10.1093/oso/9780198803805.003.0007.

Повний текст джерела

Анотація:

The only known exact solution of the field equation of nonlocal gravity (NLG) is the trivial solution involving Minkowski spacetime that indicates the absence of a gravitational field. Therefore, this chapter is devoted to a thorough examination of NLG in the linear approximation beyond Minkowski spacetime. Moreover, the solutions of the linearized field equation of NLG are discussed in detail. We adopt the view that the kernel of the theory must be determined from observation. In the Newtonian regime of NLG, we recover the phenomenological Tohline-Kuhn approach to modified gravity. A simple generalization of the Kuhn kernel leads to a three-parameter modified Newtonian force law that is always attractive. Gravitational lensing is discussed. It is shown that nonlocal gravity (NLG), with a characteristic galactic lengthscale of order 1 kpc, simulates dark matter in the linear regime while preserving causality.

Стилі APA, Harvard, Vancouver, ISO та ін.

Частини книг з теми "Exact recovery"

1

Gao, Zheng, and Stilian Stoev. "Exact Support Recovery Under Dependence." In Concentration of Maxima and Fundamental Limits in High-Dimensional Testing and Inference, 47–61. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-80964-5_4.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

2

Avrachenkov, Konstantin, and Maximilien Dreveton. "Almost Exact Recovery in Label Spreading." In Lecture Notes in Computer Science, 30–43. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-25070-6_3.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

3

Gaudio, Julia, Xiaochun Niu, and Ermin Wei. "Exact Community Recovery in the Geometric SBM." In Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2158–84. Philadelphia, PA: Society for Industrial and Applied Mathematics, 2024. http://dx.doi.org/10.1137/1.9781611977912.78.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

4

Zhu, Binhai. "Efficient Exact and Approximate Algorithms for the Complement of Maximal Strip Recovery." In Algorithmic Aspects in Information and Management, 325–33. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-14355-7_33.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

5

Belkić, Dževad, and Karen Belkić. "Exact quantum-mechanical, Padé-based recovery of spectral parameters." In Signal Processing in Magnetic Resonance Spectroscopy with Biomedical Applications, 85–148. CRC Press, 2010. http://dx.doi.org/10.1201/9781439806456-3.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

6

"Exact Quantum-Mechanical, Pade-Based Recovery of Spectral Parameters." In Signal Processing in Magnetic Resonance Spectroscopy with Biomedical Applications, 85–148. CRC Press, 2010. http://dx.doi.org/10.1201/9781439806456-c3.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

7

Silverman, Michael J. "Treatments and illness management and recovery." In Music Therapy in Mental Health for Illness Management and Recovery, 21–57. Oxford University Press, 2022. http://dx.doi.org/10.1093/oso/9780198865285.003.0002.

Повний текст джерела

Анотація:

A singular or uniform approach to providing effective and efficient treatment for people with mental health conditions does not exist. Even with advances in genetics, neurology, etiology, and psychopharmacology, scientists have yet to identify or develop a “one-size-fits-all” intervention or treatment milieu for persons with mental health conditions. Uncertainty still remains related to the exact causes of mental health conditions, and, as such, relying solely upon a biological explanation may be futile without accounting for sociocultural, environmental, and psychological factors. This chapter provides readers with an orientation to pharmacological and psychosocial treatments for adults with mental health conditions. Topics covered include treatment compliance, side-effects, the antipsychiatry movement, the Dodo Bird Verdict, and cognitive behavioral therapy. Separating illness management from recovery, this chapter provides readers with introductions to these concepts. The chapter highlights the recovery concept by describing how it has gained considerable momentum and has allowed many people with mental health conditions to live and work in communities of their choice.

Стилі APA, Harvard, Vancouver, ISO та ін.

8

Boughton, James M. "Planning for a Stable Postwar Recovery, 1941–42." In Harry White and the American Creed, 141–53. Yale University Press, 2021. http://dx.doi.org/10.12987/yale/9780300253795.003.0010.

Повний текст джерела

Анотація:

This chapter recounts the U.S. entry into World War II in December 1941, which intensified Harry White's work in a direction that ultimately became the great purpose for his life. For the next four years, he devoted himself to two interrelated tasks: organizing the financing of the Allies' war effort and planning for economic and financial stability once the war was over. The chapter highlights that the main elements of international wartime finance involved designing and producing financial support for the Grand Alliance members and shoring up relations with Latin America to insulate the region from Axis influence. It details the main elements of postwar planning, which involved designing and generating support for the institutions that would become the International Monetary Fund and the International Bank for Reconstruction and Development. They would exact an overwhelming toll on Harry's health, but he would ultimately succeed on all fronts.

Стилі APA, Harvard, Vancouver, ISO та ін.

9

Thurtell, Matthew J., and Robert L. Tomsak. "Nonarteritic Ischemic Optic Neuropathy." In Neuro-Ophthalmology, edited by Matthew J. Thurtell and Robert L. Tomsak, 15–20. Oxford University Press, 2019. http://dx.doi.org/10.1093/med/9780190603953.003.0003.

Повний текст джерела

Анотація:

Nonarteritic anterior ischemic optic neuropathy is the most frequent cause of acute-onset optic neuropathy in older adults. Its exact pathogenesis remains uncertain, although it often occurs in patients with a small, structurally congested optic disc (“disc at risk”). In this chapter, we begin by reviewing the clinical features of nonarteritic anterior ischemic optic neuropathy. We then discuss the prognosis for recovery of vision and fellow eye involvement. We review the risk factors and precipitating factors for this condition. We list the medications that have been associated with this condition. Lastly, we review the workup and management approach for this common condition.

Стилі APA, Harvard, Vancouver, ISO та ін.

10

Back, Anthony. "Cancer." In Managing Death in the ICU, 301–10. Oxford University PressNew York, NY, 2000. http://dx.doi.org/10.1093/oso/9780195128819.003.0023.

Повний текст джерела

Анотація:

Abstract Patients with cancer are most commonly admitted to an ICU for postoperative recovery, respiratory failure, sepsis, or multiorgan system failure. Less commonly, the indication for admission is a complication of progressive cancer (such as pericardial tamponade) or a complication of anticancer therapy (such as neutropenic sepsis). Overall, the most common cause of death for patients with cancer in ICUs is infection, rather than pro gressive cancer. However, the exact cause of death may be difficult to identify clinically, and in one autopsy study that included 69% of the deaths in a medical oncology ICU, the clinically identified cause of death was correct in only 41% of cases.

Стилі APA, Harvard, Vancouver, ISO та ін.

Тези доповідей конференцій з теми "Exact recovery"

1

Atac, Meryem, and Altan Kayran. "Comparative Study of Finite Element Analysis and Geometrically Exact Beam Analysis of a Composite Helicopter Blade." In Vertical Flight Society 72nd Annual Forum & Technology Display, 1–10. The Vertical Flight Society, 2016. http://dx.doi.org/10.4050/f-0072-2016-11536.

Повний текст джерела

Анотація:

In this paper, comparative study of the finite element analysis and geometrically exact beam analysis of a composite helicopter blade is performed. The objective of this study is to investigate the applicability of the geometrically exact beam analysis of the composite helicopter blade in predicting the structural response of the composite blade. To evaluate the structural response determined by the geometrically exact beam analysis of the composite blade, detailed finite element model of the blade is prepared and the structural response of two methods are compared for different static and transient load cases and dynamic analysis. Geometrically exact beam analysis utilizes variational asymptotic beam section analysis for the calculation of sectional stiffness and mass matrices, and general deformation of the blade for the static and transient load cases can be determined with high accuracy. Three dimensional stresses in the selected blade sections can also be determined via the stress recovery feature of the variational asymptotic beam section method. It is shown that the neutral axis, shear center, still air natural frequency, static and transient displacement and static stress analysis results of the cross-sectional analysis tools, VABS and GEBT together, match perfectly with the FEM results for the rectangular section and airfoil section blade models studied. It is considered that especially for the structural design of the airfoil sections of the blade, which requires many re-analyses due to frequent design changes in the detailed design stage, geometrically exact beam analysis can replace finite element method which requires longer modelling times to reflect the design changes.

Стилі APA, Harvard, Vancouver, ISO та ін.

2

Li, Ping, and Cun-Hui Zhang. "Exact sparse recovery with L0 projections." In KDD' 13: The 19th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. New York, NY, USA: ACM, 2013. http://dx.doi.org/10.1145/2487575.2487694.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

3

Fu, M. "Exact, optimal, and partial loop transfer recovery." In 29th IEEE Conference on Decision and Control. IEEE, 1990. http://dx.doi.org/10.1109/cdc.1990.203936.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

4

Kudo, Hiroyuki, and Tsuneo Saito. "Feasible Cone Beam Scanning Methods for Exact 3-D Tomographic Image Reconstruction." In Signal Recovery and Synthesis. Washington, D.C.: Optica Publishing Group, 1989. http://dx.doi.org/10.1364/srs.1989.fd3.

Повний текст джерела

Анотація:

Considerable efforts have been made for visualizing 3-D structures of human organs by x-ray tomography. From the view point of the data collection time, the cone beam method with a circular source motion is promising for this purpose. However, the exact 3-D image reconstruction from the cone beam projections is a troublesome and time-consuming problem, because the solution cannot be decomposed into 2-D transaxial slices. For this difficulty, approximate reconstruction algorithms are proposed and practically used in many application areas [1,2]. Unfortunately, these algorithms suffer from the degradation of reconstructed images when the cone angle is large.

Стилі APA, Harvard, Vancouver, ISO та ін.

5

Lu, Canyi, Jiashi Feng, Zhouchen Lin, and Shuicheng Yan. "Exact Low Tubal Rank Tensor Recovery from Gaussian Measurements." In Twenty-Seventh International Joint Conference on Artificial Intelligence {IJCAI-18}. California: International Joint Conferences on Artificial Intelligence Organization, 2018. http://dx.doi.org/10.24963/ijcai.2018/347.

Повний текст джерела

Анотація:

The recent proposed Tensor Nuclear Norm (TNN) [Lu et al., 2016; 2018a] is an interesting convex penalty induced by the tensor SVD [Kilmer and Martin, 2011]. It plays a similar role as the matrix nuclear norm which is the convex surrogate of the matrix rank. Considering that the TNN based Tensor Robust PCA [Lu et al., 2018a] is an elegant extension of Robust PCA with a similar tight recovery bound, it is natural to solve other low rank tensor recovery problems extended from the matrix cases. However, the extensions and proofs are generally tedious. The general atomic norm provides a unified view of low-complexity structures induced norms, e.g., the l1-norm and nuclear norm. The sharp estimates of the required number of generic measurements for exact recovery based on the atomic norm are known in the literature. In this work, with a careful choice of the atomic set, we prove that TNN is a special atomic norm. Then by computing the Gaussian width of certain cone which is necessary for the sharp estimate, we achieve a simple bound for guaranteed low tubal rank tensor recovery from Gaussian measurements. Specifically, we show that by solving a TNN minimization problem, the underlying tensor of size n1×n2×n3 with tubal rank r can be exactly recovered when the given number of Gaussian measurements is O(r(n1+n2−r)n3). It is order optimal when comparing with the degrees of freedom r(n1+n2−r)n3. Beyond the Gaussian mapping, we also give the recovery guarantee of tensor completion based on the uniform random mapping by TNN minimization. Numerical experiments verify our theoretical results.

Стилі APA, Harvard, Vancouver, ISO та ін.

6

Hajek, Bruce, Yihong Wu, and Jiaming Xu. "Achieving exact cluster recovery threshold via semidefinite programming." In 2015 IEEE International Symposium on Information Theory (ISIT). IEEE, 2015. http://dx.doi.org/10.1109/isit.2015.7282694.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

7

Li, Qiang, Wing-Kin Ma, and Qiong Wu. "Hyperspectral Super-Resolution: Exact Recovery In Polynomial Time." In 2018 IEEE Statistical Signal Processing Workshop (SSP). IEEE, 2018. http://dx.doi.org/10.1109/ssp.2018.8450697.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

8

Lotfi, Mahsa, and Mathukumalli Vidyasagar. "Exact recovery of sparse signals from binary measurements." In 2018 Indian Control Conference (ICC). IEEE, 2018. http://dx.doi.org/10.1109/indiancc.2018.8307958.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

9

Hajek, Bruce, Yihong Wu, and Jiaming Xu. "Exact recovery threshold in the binary censored block model." In 2015 IEEE Information Theory Workshop - Fall (ITW). IEEE, 2015. http://dx.doi.org/10.1109/itwf.2015.7360742.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

10

Jin, Yuzhe, Young-Han Kim, and Bhaskar D. Rao. "Performance tradeoffs for exact support recovery of sparse signals." In 2010 IEEE International Symposium on Information Theory - ISIT. IEEE, 2010. http://dx.doi.org/10.1109/isit.2010.5513492.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Звіти організацій з теми "Exact recovery"

1

Barg, Rivka, Kendal D. Hirschi, Avner Silber, Gozal Ben-Hayyim, Yechiam Salts, and Marla Binzel. Combining Elevated Levels of Membrane Fatty Acid Desaturation and Vacuolar H+ -pyrophosphatase Activity for Improved Drought Tolerance. United States Department of Agriculture, December 2012. http://dx.doi.org/10.32747/2012.7613877.bard.

Повний текст джерела

Анотація:

Background to the topic: In previous works we have shown that Arabidopsis and tomato over-expressing H+-pyrophosphatase show increased tolerance to drought imposed by withholding irrigation of young plants in pots (Park et al. 2005). In addition, young tobacco plants over-expressing fatty acid desaturase 3 (OEX-FAD3) also showed increasing tolerance to drought stress (Zhang et al 2005), and similarly OEX-FAD3 young tomato plants (unpublished data from ARO), hence raising the possibility that pyramiding the two could further improve drought tolerance in tomato. Based on these findings the specific objects originally set were: 1. To analyze the impact of pyramiding transgenes for enhanced fatty acid desaturation and for elevated H+-PPase activity on tomato yielding under water deficit stress conditions. 2. To elucidate the biochemical relationship between elevated desaturation of the membrane lipids and the activities of selected vacuolar transporters in the context of drought responses. 3. To explore the S. pennellii introgression lines as alternative genetic sources for drought tolerance related to enhanced fatty acid desaturation and/or H+-PPase activity. 4. Since OEX-FAD3 increases the levels of linolenic acid which is the precursor of various oxylipins including the stress hormone Jasmonate. (JA), study of the effect of this transgene on tolerance to herbivore pests was added as additional goal. The Major conclusions, solutions, and achievements are: (1) The facts that ectopic over-expression of vacuolarH+-PPases (in line OEX-AVP1) does not change the fatty acid profile compared to the parental MoneyMaker (MM) line and that elevated level of FA desaturation (by OEX-FAD3) does not change the activity of either H+-PPase, H+-ATPaseor Ca2+ /H+ antiport, indicate that the observed increased drought tolerance reported before for increase FA desaturation in tobacco plants and increased H+PPase in tomato plants involves different mechanisms. (2) After generating hybrid lines bringing to a common genetic background (i.e. F1 hybrids between line MP-1 and MM) each of the two transgenes separately and the two transgenes together the effect of various drought stress regimes including recovery from a short and longer duration of complete water withhold as well as performance under chronic stresses imposed by reducing water supply to 75-25% of the control irrigation regime could be studied. Under all the tested conditions in Israel, for well established plants grown in 3L pots or larger, none of the transgenic lines exhibited a reproducible significantly better drought tolerance compare to the parental lines. Still, examining the performance of these hybrids under the growth practices followed in the USA is called for. (3) Young seedlings of none of the identified introgression lines including the S. pennellii homologs of two of the H+-PPase genes and one of the FAD7 genes performed better than line M82 upon irrigation withhold. However, differences in the general canopy structures between the IL lines and M82 might mask such differences if existing. (4). Over-expression of FAD3 in the background of line MP-1 was found to confer significant tolerance to three important pest insects in tomato: Bordered Straw (Heliothis peltigera), Egyptian cotton leafworm (Spodoptera littoralis) and Western Flower Thrips (Frankliniella occidentalis). Implications: Although the original hypothesis that pyramiding these two trasgenes could improve drought tolerance was not supported, the unexpected positive impact on herbivore deterring, as well as the changes in dynamics of JA biosynthesis in response to wounding and the profound changes in expression of wound response genes calls for deciphering the exact linolenic acid derived signaling molecule mediating this response. This will further facilitate breeding for herbivore pest and mechanical stress tolerance based on this pathway.

Стилі APA, Harvard, Vancouver, ISO та ін.

Ми пропонуємо знижки на всі преміум-плани для авторів, чиї праці увійшли до тематичних добірок літератури. Зв'яжіться з нами, щоб отримати унікальний промокод!