Min-hwan Oh

According to our database1, Min-hwan Oh authored at least 64 papers between 2015 and 2026.

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

2026
Variance-Adaptive Optimal Algorithm for Reinforcement Learning with Multinomial Logit Function Approximation.
CoRR, May, 2026

Latent Representation Alignment for Offline Goal-Conditioned Reinforcement Learning.
CoRR, May, 2026

Optimal Design for Multinomial Logit Model with Applications to Best Assortment Identification.
CoRR, May, 2026

Nonstationary Generalized Linear Bandits with Discounted Online Mirror Descent.
CoRR, May, 2026

Multi-Step Likelihood-Ratio Correction for Reinforcement Learning with Verifiable Rewards.
CoRR, May, 2026

Block-Sphere Vector Quantization.
CoRR, May, 2026

Peng's Q(λ) for Conservative Value Estimation in Offline Reinforcement Learning.
CoRR, May, 2026

RelFlexformer: Efficient Attention 3D-Transformers for Integrable Relative Positional Encodings.
CoRR, May, 2026

Unified Framework of Distributional Regret in Multi-Armed Bandits and Reinforcement Learning.
CoRR, May, 2026

Blessings of Multiple Good Arms in Multi-Objective Linear Bandits.
CoRR, February, 2026

Convergence of Muon with Newton-Schulz.
CoRR, January, 2026

Tractable Multinomial Logit Contextual Bandits with Non-Linear Utilities.
CoRR, January, 2026

2025
Oracle-Efficient Combinatorial Semi-Bandits.
CoRR, October, 2025

Follow-the-Perturbed-Leader for Decoupled Bandits: Best-of-Both-Worlds and Practicality.
CoRR, October, 2025

Batched Stochastic Matching Bandits.
CoRR, September, 2025

AI Should Sense Better, Not Just Scale Bigger: Adaptive Sensing as a Paradigm Shift.
CoRR, July, 2025

Exploration via Feature Perturbation in Contextual Bandits.
Proceedings of the Advances in Neural Information Processing Systems 38: Annual Conference on Neural Information Processing Systems 2025, 2025

Thompson Sampling for Multi-Objective Linear Contextual Bandit.
Proceedings of the Advances in Neural Information Processing Systems 38: Annual Conference on Neural Information Processing Systems 2025, 2025

Preference-based Reinforcement Learning beyond Pairwise Comparisons: Benefits of Multiple Options.
Proceedings of the Advances in Neural Information Processing Systems 38: Annual Conference on Neural Information Processing Systems 2025, 2025

Infrequent Exploration in Linear Bandits.
Proceedings of the Advances in Neural Information Processing Systems 38: Annual Conference on Neural Information Processing Systems 2025, 2025

Revisiting Follow-the-Perturbed-Leader with Unbounded Perturbations in Bandit Problems.
Proceedings of the Advances in Neural Information Processing Systems 38: Annual Conference on Neural Information Processing Systems 2025, 2025

EUGens: Efficient, Unified and General Dense Layers.
Proceedings of the Advances in Neural Information Processing Systems 38: Annual Conference on Neural Information Processing Systems 2025, 2025

True Impact of Cascade Length in Contextual Cascading Bandits.
Proceedings of the Advances in Neural Information Processing Systems 38: Annual Conference on Neural Information Processing Systems 2025, 2025

Optimal and Practical Batched Linear Bandit Algorithm.
Proceedings of the Forty-second International Conference on Machine Learning, 2025

Combinatorial Reinforcement Learning with Preference Feedback.
Proceedings of the Forty-second International Conference on Machine Learning, 2025

Improved Online Confidence Bounds for Multinomial Logistic Bandits.
Proceedings of the Forty-second International Conference on Machine Learning, 2025

Linear Bandits with Partially Observable Features.
Proceedings of the Forty-second International Conference on Machine Learning, 2025

Symmetry-Aware GFlowNets.
Proceedings of the Forty-second International Conference on Machine Learning, 2025

Minimax Optimal Reinforcement Learning with Quasi-Optimism.
Proceedings of the Thirteenth International Conference on Learning Representations, 2025

Lasso Bandit with Compatibility Condition on Optimal Arm.
Proceedings of the Thirteenth International Conference on Learning Representations, 2025

Dynamic Assortment Selection and Pricing with Censored Preference Feedback.
Proceedings of the Thirteenth International Conference on Learning Representations, 2025

ADAM Optimization with Adaptive Batch Selection.
Proceedings of the Thirteenth International Conference on Learning Representations, 2025

Adversarial Policy Optimization for Offline Preference-based Reinforcement Learning.
Proceedings of the Thirteenth International Conference on Learning Representations, 2025

Experimental Design for Semiparametric Bandits.
Proceedings of the Thirty Eighth Annual Conference on Learning Theory, 2025

2024
Magnituder Layers for Implicit Neural Representations in 3D.
CoRR, 2024

Nearly Minimax Optimal Regret for Multinomial Logistic Bandit.
Proceedings of the Advances in Neural Information Processing Systems 37: Annual Conference on Neural Information Processing Systems 2024, 2024

Improved Regret of Linear Ensemble Sampling.
Proceedings of the Advances in Neural Information Processing Systems 37: Annual Conference on Neural Information Processing Systems 2024, 2024

Local Anti-Concentration Class: Logarithmic Regret for Greedy Linear Contextual Bandit.
Proceedings of the Advances in Neural Information Processing Systems 37: Annual Conference on Neural Information Processing Systems 2024, 2024

Queueing Matching Bandits with Preference Feedback.
Proceedings of the Advances in Neural Information Processing Systems 37: Annual Conference on Neural Information Processing Systems 2024, 2024

Randomized Exploration for Reinforcement Learning with Multinomial Logistic Function Approximation.
Proceedings of the Advances in Neural Information Processing Systems 37: Annual Conference on Neural Information Processing Systems 2024, 2024

Demystifying Linear MDPs and Novel Dynamics Aggregation Framework.
Proceedings of the Twelfth International Conference on Learning Representations, 2024

Follow-the-Perturbed-Leader with Fréchet-type Tail Distributions: Optimality in Adversarial Bandits and Best-of-Both-Worlds.
Proceedings of the Thirty Seventh Annual Conference on Learning Theory, June 30, 2024

Learning Uncertainty-Aware Temporally-Extended Actions.
Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

Mixed-Effects Contextual Bandits.
Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

Doubly Perturbed Task Free Continual Learning.
Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023
Cascading Contextual Assortment Bandits.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Model-based Offline Reinforcement Learning with Count-based Conservatism.
Proceedings of the International Conference on Machine Learning, 2023

Combinatorial Neural Bandits.
Proceedings of the International Conference on Machine Learning, 2023

Semi-Parametric Contextual Pricing Algorithm using Cox Proportional Hazards Model.
Proceedings of the International Conference on Machine Learning, 2023

Squeeze All: Novel Estimator and Self-Normalized Bound for Linear Contextual Bandits.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2023

Model-Based Reinforcement Learning with Multinomial Logistic Function Approximation.
Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022
Personalized Federated Learning With Server-Side Information.
IEEE Access, 2022

Stochastic-Expert Variational Autoencoder for Collaborative Filtering.
Proceedings of the WWW '22: The ACM Web Conference 2022, Virtual Event, Lyon, France, April 25, 2022

2021
Sparsity-Agnostic Lasso Bandit.
Proceedings of the 38th International Conference on Machine Learning, 2021

Multinomial Logit Contextual Bandits: Provable Optimality and Practicality.
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020
Crowd Counting with Decomposed Uncertainty.
Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

2019
Counting and Segmenting Sorghum Heads.
CoRR, 2019

Corrections to "Learning Graph Topological Features via GAN".
IEEE Access, 2019

Thompson Sampling for Multinomial Logit Contextual Bandits.
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Sequential Anomaly Detection using Inverse Reinforcement Learning.
Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, 2019

2018
Directed Exploration in PAC Model-Free Reinforcement Learning.
CoRR, 2018

Adaptive Pattern Matching with Reinforcement Learning for Dynamic Graphs.
Proceedings of the 25th IEEE International Conference on High Performance Computing, 2018

2017
Can GAN Learn Topological Features of a Graph?
CoRR, 2017

2015
Efficient "Shotgun" Inference of Neural Connectivity from Highly Sub-sampled Activity Data.
PLoS Comput. Biol., 2015


  Loading...