Imagen de Portada

Optimal Decision Tree and Adaptive Submodular Ranking with Noisy Outcomes

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Jia, Su, Navidi, Fatemeh, Nagarajan, Viswanath, Ravi, R.
Formato:	Preprint
Publicado:	2023
Materias:	Machine Learning
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Lower Bound on the Greedy Approximation Ratio for Adaptive Submodular Cover
por: Harris, Blake, et al.
Publicado: (2024)

Minimum Cost Adaptive Submodular Cover
por: Al-Thani, Hessa, et al.
Publicado: (2022)

A Simple Approximation Algorithm for Optimal Decision Tree
por: Zhuo, Zhengjia, et al.
Publicado: (2025)

Learning Markov Decision Processes under Fully Bandit Feedback
por: Zhuo, Zhengjia, et al.
Publicado: (2026)

Semi-Bandit Learning for Monotone Stochastic Optimization
por: Agarwal, Arpit, et al.
Publicado: (2023)

Submodular Framework for Structured-Sparse Optimal Transport
por: Manupriya, Piyushi, et al.
Publicado: (2024)

Potential Outcome Rankings for Counterfactual Decision Making
por: Kawakami, Yuta, et al.
Publicado: (2025)

Nearly Minimax Optimal Submodular Maximization with Bandit Feedback
por: Tajdini, Artin, et al.
Publicado: (2023)

Optimal Transport for Measures with Noisy Tree Metric
por: Le, Tam, et al.
Publicado: (2023)

Provably Robust DPO: Aligning Language Models with Noisy Feedback
por: Chowdhury, Sayak Ray, et al.
Publicado: (2024)

Robust Loss Functions for Training Decision Trees with Noisy Labels
por: Wilton, Jonathan, et al.
Publicado: (2023)

Bandit Guided Submodular Curriculum for Adaptive Subset Selection
por: Chanda, Prateek, et al.
Publicado: (2025)

Automatic Rank Determination for Low-Rank Adaptation via Submodular Function Maximization
por: Gao, Yihang, et al.
Publicado: (2025)

Adaptive Threshold-Driven Continuous Greedy Method for Scalable Submodular Optimization
por: Rostami, Mohammadreza, et al.
Publicado: (2026)

Submodular Reinforcement Learning
por: Prajapat, Manish, et al.
Publicado: (2023)

Noisy Low Rank Column-wise Sensing
por: Singh, Ankit Pratap, et al.
Publicado: (2024)

Adaptive Combinatorial Experimental Design: Pareto Optimality for Decision-Making and Inference
por: Xie, Hongrui, et al.
Publicado: (2026)

Optimal Clustering from Noisy Binary Feedback
por: Ariu, Kaito, et al.
Publicado: (2019)

Learning Optimal Individualized Decision Rules with Conditional Demographic Parity
por: Cui, Wenhai, et al.
Publicado: (2026)

Interpretable Quantile Regression by Optimal Decision Trees
por: Lemaire, Valentin, et al.
Publicado: (2026)

Best of Both Worlds: Practical and Theoretically Optimal Submodular Maximization in Parallel
por: Chen, Yixin, et al.
Publicado: (2021)

Optimal Decision Tree Policies for Markov Decision Processes
por: Vos, Daniël, et al.
Publicado: (2023)

New Spiking Architecture for Multi-Modal Decision-Making in Autonomous Vehicles
por: Ghoreishee, Aref, et al.
Publicado: (2025)

Robust Generalization with Adaptive Optimal Transport Priors for Decision-Focused Learning
por: Sun, Haixiang, et al.
Publicado: (2026)

AdaPaD: Adaptive Parallel Deflation for PEFT with Self-Correcting Rank Discovery
por: Su, Barbara, et al.
Publicado: (2026)

Adaptive Estimation of Multivariate Piecewise Polynomials and Bounded Variation Functions by Optimal Decision Trees
por: Chatterjee, Sabyasachi, et al.
Publicado: (2019)

Near Optimal Decision Trees in a SPLIT Second
por: Babbar, Varun, et al.
Publicado: (2025)

Optimal Decision Tree Pruning Revisited: Algorithms and Complexity
por: Harviainen, Juha, et al.
Publicado: (2025)

Procurement Auctions via Approximately Optimal Submodular Optimization
por: Deng, Yuan, et al.
Publicado: (2024)

TreeGrad-Ranker: Feature Ranking via $O(L)$-Time Gradients for Decision Trees
por: Li, Weida, et al.
Publicado: (2026)

Fast Adaptive Non-Monotone Submodular Maximization Subject to a Knapsack Constraint
por: Amanatidis, Georgios, et al.
Publicado: (2020)

Scalable Submodular Policy Optimization via Pruned Submodularity Graph
por: Anand, Aditi, et al.
Publicado: (2025)

Clustered Policy Decision Ranking
por: Levin, Mark, et al.
Publicado: (2023)

Branches: Efficiently Seeking Optimal Sparse Decision Trees with AO*
por: Chaouki, Ayman, et al.
Publicado: (2024)

Optimal or Greedy Decision Trees? Revisiting their Objectives, Tuning, and Performance
por: van der Linden, Jacobus G. M., et al.
Publicado: (2024)

Consistent Submodular Maximization
por: Dütting, Paul, et al.
Publicado: (2024)

Submodular Maximization via Taylor Series Approximation
por: Özcan, Gözde, et al.
Publicado: (2021)

Online Dynamic Submodular Optimization
por: Lesage-Landry, Antoine, et al.
Publicado: (2023)

Extended Deep Submodular Functions
por: Hosseini, Seyed Mohammad, et al.
Publicado: (2024)

Deep Submodular Peripteral Networks
por: Bhatt, Gantavya, et al.
Publicado: (2024)