Search Results for author:
Found 9 papers, 3 papers with code
Fixed-Budget Differentially Private Best Arm Identification
We study best arm identification (BAI) in linear bandits in the fixed-budget regime under differential privacy constraints, when the arm rewards are supported on the unit interval.
FLAC: A Robust Failure-Aware Atomic Commit Protocol for Distributed Transactions
Consequently, it improves both the response time and throughput, and effectively handles nodes distributed across the Internet where crash and network failures might occur.
Learning Generalizable Models for Vehicle Routing Problems via Knowledge Distillation
Recent neural methods for vehicle routing problems always train and test the deep models on the same instance distribution (i. e., uniform).
Federated Best Arm Identification with Heterogeneous Clients
Furthermore, we show that for any algorithm whose upper bound on the expected stopping time matches with the lower bound up to a multiplicative constant ({\em almost-optimal} algorithm), the ratio of any two consecutive communication time instants must be {\em bounded}, a result that is of independent interest.
Neural Network Decoders for Permutation Codes Correcting Different Errors
Permutation codes were extensively studied in order to correct different types of errors for the applications on power line communication and rank modulation for flash memory.
Primitive3D: 3D Object Dataset Synthesis from Randomly Assembled Primitives
Further study suggests that our strategy can improve the model performance by pretraining and fine-tuning scheme, especially for the dataset with a small scale.
Efficient Neural Neighborhood Search for Pickup and Delivery Problems
We present an efficient Neural Neighborhood Search (N2S) approach for pickup and delivery problems (PDPs).
Serverless Data Science -- Are We There Yet? A Case Study of Model Serving
Data scientists today have to manage the end-to-end ML life cycle that includes both model training and model serving, the latter of which is essential, as it makes their works available to end-users.
Optimal Codes Correcting a Single Indel / Edit for DNA-Based Data Storage
In this paper, we investigate codes that combat either a single indel or a single edit and provide linear-time algorithms that encode binary messages into these codes of length n. Over the quaternary alphabet, we provide two linear-time encoders.
Information Theory Information Theory
