Arman Zharmagambetov

Publication Activity (10 Years)

Years Active: 2019-2024
Publications (10 Years): 19

Top Topics

Greedy Algorithm

Decision Tree Algorithm

Top Venues

Publications

Anselm Paulus, Arman Zharmagambetov, Chuan Guo, Brandon Amos, Yuandong Tian
AdvPrompter: Fast Adaptive Adversarial Prompting for LLMs. CoRR (2024)
Miguel Á. Carreira-Perpiñán, Magzhan Gabidolla, Arman Zharmagambetov
Towards Better Decision Forests: Forest Alternating Optimization. CVPR (2023)
Arman Zharmagambetov, Brandon Amos, Aaron M. Ferber, Taoan Huang, Bistra Dilkina, Yuandong Tian
Landscape Surrogate: Learning Decision Losses for Mathematical Optimization Under Partial Information. NeurIPS (2023)
Arman Zharmagambetov, Brandon Amos, Aaron M. Ferber, Taoan Huang, Bistra Dilkina, Yuandong Tian
Landscape Surrogate: Learning Decision Losses for Mathematical Optimization Under Partial Information. CoRR (2023)
Aaron M. Ferber, Arman Zharmagambetov, Taoan Huang, Bistra Dilkina, Yuandong Tian
GenCO: Generating Diverse Solutions to Design Problems with Combinatorial Nature. CoRR (2023)
Arman Zharmagambetov, Qingming Tang, Chieh-Chi Kao, Qin Zhang, Ming Sun, Viktor Rozgic, Jasha Droppo, Chao Wang
Improved Representation Learning For Acoustic Event Classification Using Tree-Structured Ontology. ICASSP (2022)
Magzhan Gabidolla, Arman Zharmagambetov, Miguel Á. Carreira-Perpiñán
Improved Multiclass AdaBoost Using Sparse Oblique Decision Trees. IJCNN (2022)
Arman Zharmagambetov, Miguel Á. Carreira-Perpiñán
Semi-Supervised Learning with Decision Trees: Graph Laplacian Tree Alternating Optimization. NeurIPS (2022)
Arman Zharmagambetov, Magzhan Gabidolla, Miguel Á. Carreira-Perpiñán
Improved Multiclass Adaboost For Image Classification: The Role Of Tree Optimization. ICIP (2021)
Arman Zharmagambetov, Magzhan Gabidolla, Miguel Á. Carreira-Perpiñán
Improved Boosted Regression Forests Through Non-Greedy Tree Optimization. IJCNN (2021)
Arman Zharmagambetov, Miguel Á. Carreira-Perpiñán
A Simple, Effective Way To Improve Neural Net Classification: Ensembling Unit Activations With A Sparse Oblique Decision Tree. ICIP (2021)
Arman Zharmagambetov, Suryabhan Singh Hada, Magzhan Gabidolla, Miguel Á. Carreira-Perpiñán
Non-Greedy Algorithms for Decision Tree Optimization: An Experimental Comparison. IJCNN (2021)
Arman Zharmagambetov, Miguel Á. Carreira-Perpiñán
Learning a Tree of Neural Nets. ICASSP (2021)
Suryabhan Singh Hada, Miguel Á. Carreira-Perpiñán, Arman Zharmagambetov
Sparse Oblique Decision Trees: A Tool to Understand and Manipulate Neural Net Features. CoRR (2021)
Suryabhan Singh Hada, Miguel Á. Carreira-Perpiñán, Arman Zharmagambetov
Understanding And Manipulating Neural Net Features Using Sparse Oblique Classification Trees. ICIP (2021)
Arman Zharmagambetov, Magzhan Gabidolla, Miguel Á. Carreira-Perpiñán
Softmax Tree: An Accurate, Fast Classifier When the Number of Classes Is Large. EMNLP (1) (2021)
Arman Zharmagambetov, Miguel Á. Carreira-Perpiñán
Smaller, more accurate regression forests using tree alternating optimization. ICML (2020)
Miguel Á. Carreira-Perpiñán, Arman Zharmagambetov
Ensembles of Bagged TAO Trees Consistently Improve over Random Forests, AdaBoost and Gradient Boosting. FODS (2020)
Arman Zharmagambetov, Suryabhan Singh Hada, Miguel Á. Carreira-Perpiñán
An Experimental Comparison of Old and New Decision Tree Algorithms. CoRR (2019)