Mathematical studies in deep learning: overparameterization theories, graph generative models and applications in algorithmic pricing

Loading...
Thumbnail Image

Persistent link to this item

Statistics
View Statistics

Journal Title

Journal ISSN

Volume Title

Title

Mathematical studies in deep learning: overparameterization theories, graph generative models and applications in algorithmic pricing

Alternative title

Published Date

2024-11

Publisher

Type

Thesis or Dissertation

Abstract

This dissertation explores three key areas in deep learning. First, it extends the existing theoretical results on overparameterized deep neural networks to the ones incorporating leaky ReLU activation functions, offering insights into effective hyperparameter selection for such networks. Second, it proposes a novel graph data generation method, introducing an unpooling layer that leverages graph structures and resolves the non-differentiability in training using the policy gradient approach. Finally, the dissertation examines algorithmic pricing in two-sided markets, investigating how Q-learning strategies may lead to unintended collusion and proposing policy to mitigate this risk.

Keywords

Description

University of Minnesota Ph.D. dissertation. November 2024. Major: Mathematics. Advisor: Gilad Lerman. 1 computer file (PDF); xi, 269 pages.

Related to

Replaces

License

Collections

Series/Report Number

Funding information

Isbn identifier

Doi identifier

Previously Published Citation

Other identifiers

Suggested citation

Guo, Yinglong. (2024). Mathematical studies in deep learning: overparameterization theories, graph generative models and applications in algorithmic pricing. Retrieved from the University Digital Conservancy, https://hdl.handle.net/11299/270075.

Content distributed via the University Digital Conservancy may be subject to additional license and use restrictions applied by the depositor. By using these files, users agree to the Terms of Use. Materials in the UDC may contain content that is disturbing and/or harmful. For more information, please see our statement on harmful content in digital repositories.