| Neural network integral representations with the ReLU activation function A Petrosyan, A Dereventsov, CG Webster Mathematical and Scientific Machine Learning, 128-143, 2020 | 19 | 2020 |
| A unified way of analyzing some greedy algorithms AV Dereventsov, VN Temlyakov Journal of Functional Analysis 277 (12), 108286, 2019 | 14 | 2019 |
| On the approximate weak Chebyshev greedy algorithm in uniformly smooth Banach spaces AV Dereventsov Journal of Mathematical Analysis and Applications 436 (1), 288-304, 2016 | 8 | 2016 |
| An adaptive stochastic gradient-free approach for high-dimensional blackbox optimization A Dereventsov, CG Webster, J Daws Proceedings of International Conference on Computational Intelligence: ICCI …, 2022 | 7 | 2022 |
| Zero-shot recommendations with pre-trained large language models for multimodal nudging RM Harrison, A Dereventsov, A Bibin 2023 IEEE International Conference on Data Mining Workshops (ICDMW), 1535-1542, 2023 | 5 | 2023 |
| On the unreasonable efficiency of state space clustering in personalization tasks A Dereventsov, R Vatsavai, CG Webster 2021 International Conference on Data Mining Workshops (ICDMW), 742-749, 2021 | 5 | 2021 |
| Greedy Shallow Networks: An Approach for Constructing and Training Neural Networks A Dereventsov, A Petrosyan, C Webster International Journal of Artificial Intelligence 19 (2), 2021 | 5 | 2021 |
| Biorthogonal Greedy Algorithms in convex optimization AV Dereventsov, VN Temlyakov Applied and Computational Harmonic Analysis 60, 489-511, 2022 | 3 | 2022 |
| Simulated contextual bandits for personalization tasks from recommendation datasets A Dereventsov, A Bibin 2022 IEEE International Conference on Data Mining Workshops (ICDMW), 1-6, 2022 | 2 | 2022 |
| Examining policy entropy of reinforcement learning agents for personalization tasks A Dereventsov, A Starnes, CG Webster arXiv preprint arXiv:2211.11869, 2022 | 2 | 2022 |
| Offline policy comparison under limited historical agent-environment interactions A Dereventsov, JD Daws Jr, C Webster arXiv preprint arXiv:2106.03934, 2021 | 2 | 2021 |
| The Natural Greedy Algorithm for reduced bases in Banach spaces A Dereventsov, C Webster arXiv preprint arXiv:1905.06448, 2019 | 2 | 2019 |
| Convergence and rate of convergence of approximate greedy-type algorithms A Dereventsov University of South Carolina, 2017 | 2 | 2017 |
| On the generalized approximate weak Chebyshev greedy algorithm A Dereventsov Studia Mathematica 237 (2), 153-175, 2017 | 1 | 2017 |
| Comparison of the convergence rate of pure greedy and orthogonal greedy algorithms AV Dereventsov Mathematical Notes 92, 485-489, 2012 | 1 | 2012 |
| An Empirical Categorization of Prompting Techniques for Large Language Models: A Practitioner's Guide O Fagbohun, RM Harrison, A Dereventsov arXiv preprint arXiv:2402.14837, 2024 | | 2024 |
| Increasing Entropy to Boost Policy Gradient Performance on Personalization Tasks A Starnes, A Dereventsov, C Webster 2023 IEEE International Conference on Data Mining Workshops (ICDMW), 1551-1558, 2023 | | 2023 |
| Gaussian smoothing gradient descent for minimizing high-dimensional non-convex functions A Starnes, A Dereventsov, C Webster arXiv preprint arXiv:2311.00521, 2023 | | 2023 |
| Modeling Non-deterministic Human Behaviors in Discrete Food Choices A Starnes, A Dereventsov, ES Blazek, F Phillips 2022 IEEE International Conference on Data Mining Workshops (ICDMW), 1010-1015, 2022 | | 2022 |
| Juvenile Reccurent Parotitis O Fagbohun, RM Harrison, A Dereventsov J Artif Intell Mach Learn & Data Sci 1 (4), 142-152, 0 | | |
Clayton WebsterUniversity of Texas at AustinVerified email at utexas.edu
