A Pseudo-Gradient Approach for Model-free Markov Chain Optimization
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , |
|---|---|
| Format: | Preprint |
| Publié: |
2024
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866914879715147776 |
|---|---|
| author | Dieleman, Nanne A. Berkhout, Joost Heidergott, Bernd |
| author_facet | Dieleman, Nanne A. Berkhout, Joost Heidergott, Bernd |
| contents | We develop a first-order (pseudo-)gradient approach for optimizing functions over the stationary distribution of discrete-time Markov chains (DTMC). We give insights into why solving this optimization problem is challenging and show how transformations can be used to circumvent the hard constraints inherent in the optimization problem. The optimization framework is model-free since no explicit model of the interdependence of the row elements of the Markov chain transition matrix is required. Upon the transformation we build an extension of Simultaneous Perturbation Stochastic Approximation (SPSA) algorithm, called stochastic matrix SPSA (SM-SPSA) to solve the optimization problem. The performance of the SM-SPSA gradient search is compared with a benchmark commercial solver. Numerical examples show that SM-SPSA scales better which makes it the preferred solution method for large problem instances. We also apply the algorithm to the maximization of web-page rankings in web-graphs based on a real-life data set. As we explain in the paper, when applying a first-order gradient search one typically encounters a phenomenon which we call ``infliction points," that is, jumps in the optimization trajectories between periods of almost stationary behavior that slow down the optimization. We propose a heuristic for avoiding such infliction points and present a metastudy on a wide range of networks showing the positive effect of our heuristic on the convergence properties of SM-SPSA gradient search. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2407_14786 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | A Pseudo-Gradient Approach for Model-free Markov Chain Optimization Dieleman, Nanne A. Berkhout, Joost Heidergott, Bernd Optimization and Control We develop a first-order (pseudo-)gradient approach for optimizing functions over the stationary distribution of discrete-time Markov chains (DTMC). We give insights into why solving this optimization problem is challenging and show how transformations can be used to circumvent the hard constraints inherent in the optimization problem. The optimization framework is model-free since no explicit model of the interdependence of the row elements of the Markov chain transition matrix is required. Upon the transformation we build an extension of Simultaneous Perturbation Stochastic Approximation (SPSA) algorithm, called stochastic matrix SPSA (SM-SPSA) to solve the optimization problem. The performance of the SM-SPSA gradient search is compared with a benchmark commercial solver. Numerical examples show that SM-SPSA scales better which makes it the preferred solution method for large problem instances. We also apply the algorithm to the maximization of web-page rankings in web-graphs based on a real-life data set. As we explain in the paper, when applying a first-order gradient search one typically encounters a phenomenon which we call ``infliction points," that is, jumps in the optimization trajectories between periods of almost stationary behavior that slow down the optimization. We propose a heuristic for avoiding such infliction points and present a metastudy on a wide range of networks showing the positive effect of our heuristic on the convergence properties of SM-SPSA gradient search. |
| title | A Pseudo-Gradient Approach for Model-free Markov Chain Optimization |
| topic | Optimization and Control |
| url | https://arxiv.org/abs/2407.14786 |