Skip to content
conftrace_

Papers (including subtopics)

Don't Roll the Dice, Ask Twice: The Two-Query Distortion of Matching Problems and Beyond NeurIPS 2022 Doubly Adaptive Scaled Algorithm for Machine Learning Using Second-Order Information ICLR 2022 Doubly-Asynchronous Value Iteration: Making Value Iteration Asynchronous in Actions NeurIPS 2022 DPCD: Discrete Principal Coordinate Descent for Binary Variable Problems AAAI 2022 Dynamic Bandits with Temporal Structure IJCAI 2022 Dynamic Car Dispatching and Pricing: Revenue and Fairness for Ridesharing Platforms IJCAI 2022 Dynamic Fair Division with Partial Information NeurIPS 2022 Dynamic Learning in Large Matching Markets NeurIPS 2022 Dynamic Learning of Correlation Potentials for a Time-Dependent Kohn-Sham System L4DC 2022 Dynamic pricing and assortment under a contextual MNL demand NeurIPS 2022 Dynamic Pricing with Monotonicity Constraint under Unknown Parametric Demand Model NeurIPS 2022 Dynamic relocation in ridesharing via fixpoint construction UAI 2022 Dynamic Scheduling of Approximate Telemetry Queries NSDI 2022 Dynamics of SGD with Stochastic Polyak Stepsizes: Truly Adaptive Variants and Convergence to Exact Solution NeurIPS 2022 Dynamic Tensor Product Regression NeurIPS 2022 EENAS: An Efficient Evolutionary Algorithm for Neural Architecture Search ACML 2022 Efficiency of Ad Auctions with Price Displaying AAAI 2022 Efficiency Ordering of Stochastic Gradient Descent NeurIPS 2022 Efficient Active Search for Combinatorial Optimization Problems ICLR 2022 Efficient Aggregated Kernel Tests using Incomplete U-statistics NeurIPS 2022 Efficient Algorithms for Extreme Bandits AISTATS 2022 Efficient Algorithms for General Isotone Optimization AAAI 2022 Efficient Algorithms for Monotone Non-Submodular Maximization with Partition Matroid Constraint IJCAI 2022 Efficient and accurate top-k recovery from choice data UAI 2022 Efficient and Near-Optimal Smoothed Online Learning for Generalized Linear Functions NeurIPS 2022