{"id":{"repo_id":"gmu","oai_identifier":"oai:MARS:1920/14015"},"canonical_url":"https://search.dev.ndltd.org/etd/gmu/oai:MARS:1920/14015","repository":{"repo_id":"gmu","name":"George Mason University","base_url":"https://mars.gmu.edu/server/oai/request"},"display":{"title":"Dynamic modeling for functional data","abstract":"The first part of this thesis proposes a measure for heteroscedascity for functional data in the Hilbert space $L^2[0,1]$ equipped with a particular inner product using a distance function on the kernel of the associated covariance function. This results in a closed form expression for the minimal distance of the observed functional data to the nearest homoscedasctic process. We develop an estimator for this measure which, under particular conditions on the observed data, converges to a zero mean normal distribution with a closed form variance if the hypothesis of homoscedascity holds. We propose bootstrap estimation to make the estimating the variance computationally tractable and investigate the accuracy and performance of the proposed methods on numerical simulations and a real data case study. This method is further extended theoretically to the cases of precise hypotheses of heteroscedascity and testing on surrogate variables. The second part of this thesis considers the variable selection problem in a functional logistic regression setting, the proposed methodology being adapting the group lasso penalty. The problem of low incidence rate it considered and handled using a bias reduced maximized incidence approach instead of the classic maximum likelihood estimator. Some theoretical results are established and block co-ordinate gradient descent algorithms are implemented to study the methodology in numerical simulations. As a result of these numerical simulations and the fact that the group lasso is not selection consistent, an adaptive group lasso is studied via numerical simulation for the functional logistic framework.","abstract_html":"The first part of this thesis proposes a measure for heteroscedascity for functional data in the Hilbert space <span class=\"etd-inline-math\">L<sup>2</sup>[0,1]</span> equipped with a particular inner product using a distance function on the kernel of the associated covariance function. This results in a closed form expression for the minimal distance of the observed functional data to the nearest homoscedasctic process. We develop an estimator for this measure which, under particular conditions on the observed data, converges to a zero mean normal distribution with a closed form variance if the hypothesis of homoscedascity holds. We propose bootstrap estimation to make the estimating the variance computationally tractable and investigate the accuracy and performance of the proposed methods on numerical simulations and a real data case study. This method is further extended theoretically to the cases of precise hypotheses of heteroscedascity and testing on surrogate variables. The second part of this thesis considers the variable selection problem in a functional logistic regression setting, the proposed methodology being adapting the group lasso penalty. The problem of low incidence rate it considered and handled using a bias reduced maximized incidence approach instead of the classic maximum likelihood estimator. Some theoretical results are established and block co-ordinate gradient descent algorithms are implemented to study the methodology in numerical simulations. As a result of these numerical simulations and the fact that the group lasso is not selection consistent, an adaptive group lasso is studied via numerical simulation for the functional logistic framework.","abstract_has_math":true,"creators":["Cameron, James"],"institution":null,"degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":null,"school":null,"contributors":[],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2023,"date_issued":"2023","date_published":"2023","updated_at":"2026-07-27T19:51:46Z","subjects":["adaptive group LASSO","functional data analysis","group LASSO","heteroscedascity"],"languages":[],"rights":[],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier","label":"Identifier","values":["hdl:1920/14015"],"render_values":[{"text":"hdl:1920/14015","href":null,"code":true}]}]},"links":{"outbound_url":null,"outbound_label":null,"outbound_source":null},"metadata_groups":[{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.issued","label":"Date","values":["2023"]},{"key":"dc:type","label":"Dc Type","values":["Dissertation"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["adaptive group LASSO","functional data analysis","group LASSO","heteroscedascity"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["hdl:1920/14015"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.other","label":"Dc Description Other","values":["The first part of this thesis proposes a measure for heteroscedascity for functional data in the Hilbert space $L^2[0,1]$ equipped with a particular inner product using a distance function on the kernel of the associated covariance function. This results in a closed form expression for the minimal distance of the observed functional data to the nearest homoscedasctic process. We develop an estimator for this measure which, under particular conditions on the observed data, converges to a zero mean normal distribution with a closed form variance if the hypothesis of homoscedascity holds. We propose bootstrap estimation to make the estimating the variance computationally tractable and investigate the accuracy and performance of the proposed methods on numerical simulations and a real data case study. This method is further extended theoretically to the cases of precise hypotheses of heteroscedascity and testing on surrogate variables. The second part of this thesis considers the variable selection problem in a functional logistic regression setting, the proposed methodology being adapting the group lasso penalty. The problem of low incidence rate it considered and handled using a bias reduced maximized incidence approach instead of the classic maximum likelihood estimator. Some theoretical results are established and block co-ordinate gradient descent algorithms are implemented to study the methodology in numerical simulations. As a result of these numerical simulations and the fact that the group lasso is not selection consistent, an adaptive group lasso is studied via numerical simulation for the functional logistic framework."]},{"key":"dc:title","label":"Title","values":["Dynamic modeling for functional data"]}]}],"canonical_facts":{"dc:date.issued":["2023"],"dc:description.other":["The first part of this thesis proposes a measure for heteroscedascity for functional data in the Hilbert space $L^2[0,1]$ equipped with a particular inner product using a distance function on the kernel of the associated covariance function. This results in a closed form expression for the minimal distance of the observed functional data to the nearest homoscedasctic process. We develop an estimator for this measure which, under particular conditions on the observed data, converges to a zero mean normal distribution with a closed form variance if the hypothesis of homoscedascity holds. We propose bootstrap estimation to make the estimating the variance computationally tractable and investigate the accuracy and performance of the proposed methods on numerical simulations and a real data case study. This method is further extended theoretically to the cases of precise hypotheses of heteroscedascity and testing on surrogate variables. The second part of this thesis considers the variable selection problem in a functional logistic regression setting, the proposed methodology being adapting the group lasso penalty. The problem of low incidence rate it considered and handled using a bias reduced maximized incidence approach instead of the classic maximum likelihood estimator. Some theoretical results are established and block co-ordinate gradient descent algorithms are implemented to study the methodology in numerical simulations. As a result of these numerical simulations and the fact that the group lasso is not selection consistent, an adaptive group lasso is studied via numerical simulation for the functional logistic framework."],"dc:identifier":["hdl:1920/14015"],"dc:subject":["adaptive group LASSO","functional data analysis","group LASSO","heteroscedascity"],"dc:title":["Dynamic modeling for functional data"],"dc:type":["Dissertation"]},"updated_at":"2026-07-27T19:51:46Z"}