• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 1
  • Tagged with
  • 2
  • 2
  • 2
  • 2
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
1

Statistical Design of Sequential Decision Making Algorithms

Chi-hua Wang (12469251) 27 April 2022 (has links)
<p>Sequential decision-making is a fundamental class of problem that motivates algorithm designs of online machine learning and reinforcement learning. Arguably, the resulting online algorithms have supported modern online service industries for their data-driven real-time automated decision making. The applications span across different industries, including dynamic pricing (Marketing), recommendation (Advertising), and dosage finding (Clinical Trial). In this dissertation, we contribute fundamental statistical design advances for sequential decision-making algorithms, leaping progress in theory and application of online learning and sequential decision making under uncertainty including online sparse learning, finite-armed bandits, and high-dimensional online decision making. Our work locates at the intersection of decision-making algorithm designs, online statistical machine learning, and operations research, contributing new algorithms, theory, and insights to diverse fields including optimization, statistics, and machine learning.</p> <p><br></p> <p>In part I, we contribute a theoretical framework of continuous risk monitoring for regularized online statistical learning. Such theoretical framework is desirable for modern online service industries on monitoring deployed model's performance of online machine learning task. In the first project (Chapter 1), we develop continuous risk monitoring for the online Lasso procedure and provide an always-valid algorithm for high-dimensional dynamic pricing problems. In the second project (Chapter 2), we develop continuous risk monitoring for online matrix regression and provide new algorithms for rank-constrained online matrix completion problems. Such theoretical advances are due to our elegant interplay between non-asymptotic martingale concentration theory and regularized online statistical machine learning.</p> <p><br></p> <p>In part II, we contribute a bootstrap-based methodology for finite-armed bandit problems, termed Residual Bootstrap exploration. Such a method opens a possibility to design model-agnostic bandit algorithms without problem-adaptive optimism-engineering and instance-specific prior-tuning. In the first project (Chapter 3), we develop residual bootstrap exploration for multi-armed bandit algorithms and shows its easy generalizability to bandit problems with complex or ambiguous reward structure. In the second project (Chapter 4), we develop a theoretical framework for residual bootstrap exploration in linear bandit with fixed action set. Such methodology advances are due to our development of non-asymptotic theory for the bootstrap procedure.</p> <p><br></p> <p>In part III, we contribute application-driven insights on the exploration-exploitation dilemma for high-dimensional online decision-making problems. Such insights help practitioners to implement effective high-dimensional statistics methods to solve online decisionmaking problems. In the first project (Chapter 5), we develop a bandit sampling scheme for online batch high-dimensional decision making, a practical scenario in interactive marketing, and sequential clinical trials. In the second project (Chapter 6), we develop a bandit sampling scheme for federated online high-dimensional decision-making to maintain data decentralization and perform collaborated decisions. These new insights are due to our new bandit sampling design to address application-driven exploration-exploitation trade-offs effectively. </p>
2

Model-Based Prediction of an Effective Adhesion Parameter Guiding Multi-Type Cell Segregation

Roßbach, Philipp, Böhme, Hans-Joachim, Lange, Steffen, Voß-Böhme, Anja 24 February 2022 (has links)
The process of cell-sorting is essential for development and maintenance of tissues. With the Differential Adhesion Hypothesis, Steinberg proposed that cellsorting is determined by quantitative differences in cell-type-specific intercellular adhesion strengths. An implementation of the Differential Adhesion Hypothesis is the Differential Migration Model by Voss-Böhme and Deutsch. There, an effective adhesion parameter was derived analytically for systems with two cell types, which predicts the asymptotic sorting pattern. However, the existence and form of such a parameter for more than two cell types is unclear. Here, we generalize analytically the concept of an effective adhesion parameter to three and more cell types and demonstrate its existence numerically for three cell types based on in silico time-series data that is produced by a cellular-automaton implementation of the Differential Migration Model. Additionally, we classify the segregation behavior using statistical learning methods and show that the estimated effective adhesion parameter for three cell types matches our analytical prediction. Finally, we demonstrate that the effective adhesion parameter can resolve a recent dispute about the impact of interfacial adhesion, cortical tension and heterotypic repulsion on cell segregation. / Der Prozess der Zellsortierung ist für die Entwicklung und Erhaltung von Geweben unerlässlich. Mit der Differentiellen Adhäsionshypothese schlug Steinberg vor, dass die Zellsortierung durch quantitative Unterschiede in den zelltypspezifischen interzellulären Adhäsionsstärken bestimmt wird. Eine Umsetzung der Differentiellen Adhäsionshypothese ist das Differentielle Migrationsmodell von Voss-Böhme und Deutsch. In diesem wurde für Systeme mit zwei Zelltypen ein effektiver Adhäsionsparameter analytisch hergeleitet, der das asymptotische Sortiermuster vorhersagt. Die Existenz und Form eines solchen Parameters für mehr als zwei Zelltypen ist jedoch unklar. Hier verallgemeinern wir analytisch das Konzept eines effektiven Adhäsionsparameters für drei und mehr Zelltypen und zeigen numerisch seine Existenz für drei Zelltypen auf der Basis von in silico Zeitreihendaten, die von einem zellulären Automaten des Differentiellen Migrationsmodells erzeugt werden. Darüber hinaus klassifizieren wir das Segregationsverhalten mithilfe statistischer Lernverfahren und zeigen, dass der geschätzte effektive Adhäsionsparameter für drei Zelltypen mit unserer analytischen Vorhersage übereinstimmt. Schließlich zeigen wir, dass der effektive Adhäsionsparameter eine kürzlich aufgekommene Diskussion über den Einfluss von Grenzflächenadhäsion, Kortikalspannung und heterotypischer Abstoßung auf die Zellsegregation lösen kann.

Page generated in 0.1751 seconds