
-
Meta-Reinforcement Learning for Reliable Communication in THz/VLC Wireless VR Networks
In this paper, the problem of enhancing the quality of virtual reality (...
read it
-
Adversarial Combinatorial Bandits with General Non-linear Reward Functions
In this paper we study the adversarial combinatorial bandit with a known...
read it
-
Smooth Bandit Optimization: Generalization to Hölder Space
We consider bandit optimization of a smooth reward function, where the g...
read it
-
Privacy-Preserving Dynamic Personalized Pricing with Demand Learning
The prevalence of e-commerce has made detailed customers' personal infor...
read it
-
Nearly Bounded Regret of Re-solving Heuristics in Price-based Revenue Management
Price-based revenue management is a class of important questions in oper...
read it
-
Nearly Dimension-Independent Sparse Linear Bandit over Small Action Spaces via Best Subset Selection
We consider the stochastic contextual bandit problem under the high dime...
read it
-
Uncertainty Quantification for Demand Prediction in Contextual Dynamic Pricing
Data-driven sequential decision has found a wide range of applications i...
read it
-
Optimism in Reinforcement Learning with Generalized Linear Function Approximation
We design a new provably efficient algorithm for episodic reinforcement ...
read it
-
Robust Dynamic Assortment Optimization in the Presence of Outlier Customers
We consider the dynamic assortment optimization problem under the multin...
read it
-
Gated Recurrent Units Learning for Optimal Deployment of Visible Light Communications Enabled UAVs
In this paper, the problem of optimizing the deployment of unmanned aeri...
read it
-
√(n)-Regret for Learning in Markov Decision Processes with Function Approximation and Low Bellman Rank
In this paper, we consider the problem of online learning of Markov deci...
read it
-
NCLS: Neural Cross-Lingual Summarization
Cross-lingual summarization (CLS) is the task to produce a summary in on...
read it
-
Tight Regret Bounds for Infinite-armed Linear Contextual Bandits
Linear contextual bandit is a class of sequential decision making proble...
read it
-
Nearly Minimax-Optimal Regret for Linearly Parameterized Bandits
We study the linear contextual bandit problem with finite action sets. W...
read it
-
On Asymptotically Tight Tail Bounds for Sums of Geometric and Exponential Random Variables
In this note we prove bounds on the upper and lower probability tails of...
read it
-
Dynamic Assortment Optimization with Changing Contextual Information
In this paper, we study the dynamic assortment optimization problem unde...
read it
-
Efficient Load Sampling for Worst-Case Structural Analysis Under Force Location Uncertainty
An important task in structural design is to quantify the structural per...
read it
-
Dynamic Assortment Selection under the Nested Logit Models
We study a stylized dynamic assortment planning problem during a selling...
read it
-
Robust Nonparametric Regression under Huber's ε-contamination Model
We consider the non-parametric regression problem under Huber's ϵ-contam...
read it
-
Phrase Table as Recommendation Memory for Neural Machine Translation
Neural Machine Translation (NMT) has drawn much attention due to its pro...
read it
-
How Many Samples are Needed to Learn a Convolutional Neural Network?
A widespread folklore for explaining the success of convolutional neural...
read it
-
Near-Optimal Policies for Dynamic Multinomial Logit Assortment Selection Models
In this paper we consider the dynamic assortment selection problem under...
read it
-
Optimization of Smooth Functions with Noisy Observations: Local Minimax Rates
We consider the problem of global optimization of an unknown non-convex ...
read it
-
Near-Linear Time Local Polynomial Nonparametric Estimation
Local polynomial regression (Fan & Gijbels, 1996) is an important class ...
read it
-
Direct Learning to Rank and Rerank
Learning-to-rank techniques have proven to be extremely useful for prior...
read it
-
Near-Optimal Discrete Optimization for Experimental Design: A Regret Minimization Approach
The experimental design problem concerns the selection of k points from ...
read it
-
Word, Subword or Character? An Empirical Study of Granularity in Chinese-English NMT
Neural machine translation (NMT), a new approach to machine translation,...
read it
-
Towards Neural Machine Translation with Partially Aligned Corpora
While neural machine translation (NMT) has become the new paradigm, the ...
read it
-
Convergence Rates of Latent Topic Models Under Relaxed Identifiability Conditions
In this paper we study the frequentist convergence rate for the Latent D...
read it
-
Stochastic Zeroth-order Optimization in High Dimensions
We consider the problem of optimizing a high-dimensional convex function...
read it
-
A Note on Tight Lower Bound for MNL-Bandit Assortment Selection Models
In this note we prove a tight lower bound for the MNL-bandit assortment ...
read it
-
Non-stationary Stochastic Optimization with Local Spatial and Temporal Changes
We consider a non-stationary sequential stochastic optimization problem,...
read it
-
Sequence Modeling via Segmentations
Segmental structure is a common pattern in many types of sequences such ...
read it
-
On the Power of Truncated SVD for General High-rank Matrix Estimation Problems
We show that given an estimate A that is close to a general high-rank po...
read it
-
Rate Optimal Estimation and Confidence Intervals for High-dimensional Regression with Missing Covariates
Although a majority of the theoretical literature in high-dimensional st...
read it
-
A Theoretical Analysis of Noisy Sparse Subspace Clustering on Dimensionality-Reduced Data
Subspace clustering is the problem of partitioning unlabeled data points...
read it
-
Online and Differentially-Private Tensor Decomposition
In this paper, we resolve many of the key algorithmic questions regardin...
read it
-
An Improved Gap-Dependency Analysis of the Noisy Power Method
We consider the noisy power method algorithm, which has wide application...
read it
-
Spectral Learning for Supervised Topic Models
Supervised topic models simultaneously model the latent topic structure ...
read it
-
On Computationally Tractable Selection of Experiments in Measurement-Constrained Regression Models
We derive computationally tractable methods to select a small subset of ...
read it
-
Fast and Guaranteed Tensor Decomposition via Sketching
Tensor CANDECOMP/PARAFAC (CP) decomposition has wide applications in sta...
read it
-
Provably Correct Algorithms for Matrix Column Subset Selection with Selectively Sampled Data
We consider the problem of matrix column subset selection, which selects...
read it
-
Graph Connectivity in Noisy Sparse Subspace Clustering
Subspace clustering is the problem of clustering data points into a unio...
read it
-
Noise-adaptive Margin-based Active Learning and Lower Bounds under Tsybakov Noise Condition
We present a simple noise-robust margin-based active learning algorithm ...
read it
-
A Theoretical Analysis of NDCG Type Ranking Measures
A central problem in ranking is to design a ranking measure for evaluati...
read it