← Authors

Miguel Á. Carreira-Perpiñán

23 papers · 2006–2025 · 7 conferences · across top CS/AI conferences

Achievements

🏃 Academic Marathon (19) 🐣 Hot Topic Early Bird 🌉 Interdisciplinary Bridge 🗺️ Taxonomy Completionist (47) 🌈 Renaissance Researcher (8) 🧭 Keyword Pioneer 🐝 Cross-Pollinator (13) 🌍 Conference Polyglot (7) 🌟 Keyword Trendsetter Combo (5) 🔬 Deep Specialist (10) 🌱 Topic Pioneer 🏆 Keyword Champion 🗃️ Keyword Collector (127) 🔥 Unstoppable (6) 🚀 Conference Pioneer 💎 Century Club (23) 📈 Trend Setter

Conferences

NIPS (9) CVPR (7) AAAI (2) ICML (2) AISTATS (1) EMNLP (1) WACV (1)

Top co-authors

Magzhan Gabidolla (5) Arman Zharmagambetov (4) Yerlan Idelbayev (4) Suryabhan Singh Hada (3) Ramin Raziperchikolaei (3) Zhengdong Lu (2) Hongxu Yin (1) Arman S. Zharmagambetov (1) Weiran Wang (1) Andriy Myronenko (1)

Keywords

decision tree (5) dimensionality reduction (5) model compression (4) hash function (3) neural network (3) ensemble learning (3) tree-based model (3) binary hashing (3) alternating optimization (3) image retrieval (3) oblique tree (3) auxiliary coordinate (2) manifold learning (2) counterfactual explanation (2) nearest neighbor search (2) nonlinear embedding (2) ensemble method (2) decision forest (2) principal component analysis (1) representation learning (1)

Papers

Generalized additive models via direct optimization of regularized decision stump forests ICML 2025
Beyond the ROC Curve: Classification Trees Using Cost-Optimal Curves, with Application to Imbalanced Datasets ICML 2024
The tree autoencoder model, with application to hierarchical data visualization NIPS 2024
Very Fast, Approximate Counterfactual Explanations for Decision Forests AAAI 2023
Towards Better Decision Forests: Forest Alternating Optimization CVPR 2023
Semi-Supervised Learning with Decision Trees: Graph Laplacian Tree Alternating Optimization NIPS 2022
Pushing the Envelope of Gradient Boosting Forests via Globally-Optimized Oblique Trees CVPR 2022
Learning Interpretable, Tree-Based Projection Mappings for Nonlinear Embeddings AISTATS 2022
Style Transfer by Rigid Alignment in Neural Net Feature Space WACV 2021
Counterfactual Explanations for Oblique Decision Trees:Exact, Efficient Algorithms AAAI 2021
Optimal Quantization Using Scaled Codebook CVPR 2021
Softmax Tree: An Accurate, Fast Classifier When the Number of Classes Is Large EMNLP 2021
Low-Rank Compression of Neural Nets: Learning the Rank of Each Layer CVPR 2020
Structured Multi-Hashing for Model Compression CVPR 2020
Alternating optimization of decision trees, with application to learning sparse oblique trees NIPS 2018
“Learning-Compression” Algorithms for Neural Net Pruning CVPR 2018
Optimizing affinity-based binary hashing using auxiliary coordinates NIPS 2016
An ensemble diversity approach to supervised binary hashing NIPS 2016
A fast, universal algorithm to learn parametric nonlinear embeddings NIPS 2015
Hashing With Binary Autoencoders CVPR 2015
A Denoising View of Matrix Completion NIPS 2011
People Tracking with the Laplacian Eigenmaps Latent Variable Model NIPS 2007
Non-rigid point set registration: Coherent Point Drift NIPS 2006