Arman Zharmagambetov

Affiliations:
  • University of California Merced, CA, USA


According to our database1, Arman Zharmagambetov authored at least 19 papers between 2016 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
GenCO: Generating Diverse Solutions to Design Problems with Combinatorial Nature.
CoRR, 2023

Landscape Surrogate: Learning Decision Losses for Mathematical Optimization Under Partial Information.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Towards Better Decision Forests: Forest Alternating Optimization.
Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2023

2022
Semi-Supervised Learning with Decision Trees: Graph Laplacian Tree Alternating Optimization.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Improved Multiclass AdaBoost Using Sparse Oblique Decision Trees.
Proceedings of the International Joint Conference on Neural Networks, 2022

Improved Representation Learning For Acoustic Event Classification Using Tree-Structured Ontology.
Proceedings of the IEEE International Conference on Acoustics, 2022

Learning Interpretable, Tree-Based Projection Mappings for Nonlinear Embeddings.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2022

2021
Sparse Oblique Decision Trees: A Tool to Understand and Manipulate Neural Net Features.
CoRR, 2021

Non-Greedy Algorithms for Decision Tree Optimization: An Experimental Comparison.
Proceedings of the International Joint Conference on Neural Networks, 2021

Improved Boosted Regression Forests Through Non-Greedy Tree Optimization.
Proceedings of the International Joint Conference on Neural Networks, 2021

Improved Multiclass Adaboost For Image Classification: The Role Of Tree Optimization.
Proceedings of the 2021 IEEE International Conference on Image Processing, 2021

A Simple, Effective Way To Improve Neural Net Classification: Ensembling Unit Activations With A Sparse Oblique Decision Tree.
Proceedings of the 2021 IEEE International Conference on Image Processing, 2021

Understanding And Manipulating Neural Net Features Using Sparse Oblique Classification Trees.
Proceedings of the 2021 IEEE International Conference on Image Processing, 2021

Learning a Tree of Neural Nets.
Proceedings of the IEEE International Conference on Acoustics, 2021

Softmax Tree: An Accurate, Fast Classifier When the Number of Classes Is Large.
Proceedings of the 2021 Conference on Empirical Methods in Natural Language Processing, 2021

2020
Smaller, more accurate regression forests using tree alternating optimization.
Proceedings of the 37th International Conference on Machine Learning, 2020

Ensembles of Bagged TAO Trees Consistently Improve over Random Forests, AdaBoost and Gradient Boosting.
Proceedings of the FODS '20: ACM-IMS Foundations of Data Science Conference, 2020

2019
An Experimental Comparison of Old and New Decision Tree Algorithms.
CoRR, 2019

2016
On One Approach of Solving Sentiment Analysis Task for Kazakh and Russian Languages Using Deep Learning.
Proceedings of the Computational Collective Intelligence - 8th International Conference, 2016


  Loading...