{"total":106,"rows":[{"id":"2106.11959","title":"Revisiting Deep Learning Models for Tabular Data","created":"2021-06-22","cited_by_count":740,"area":null},{"id":"2106.03253","title":"Tabular Data: Deep Learning is Not All You Need","created":"2021-06-06","cited_by_count":535,"area":null},{"id":"2203.05556","title":"On Embeddings for Numerical Features in Tabular Deep Learning","created":"2022-03-10","cited_by_count":186,"area":null},{"id":"2210.10634","title":"RankT5: Fine-Tuning T5 for Text Ranking with Ranking Losses","created":"2022-10-12","cited_by_count":115,"area":null},{"id":"2410.24210","title":"TabM: Advancing Tabular Deep Learning with Parameter-Efficient Ensembling","created":"2024-10-31","cited_by_count":113,"area":null},{"id":"2307.14338","title":"TabR: Tabular Deep Learning Meets Nearest Neighbors in 2023","created":"2023-07-26","cited_by_count":74,"area":null},{"id":"2407.00128","title":"When Search Engine Services meet Large Language Models: Visions and Challenges","created":"2024-06-28","cited_by_count":59,"area":null},{"id":"2205.14120","title":"Neural Basis Models for Interpretability","created":"2022-05-27","cited_by_count":56,"area":null},{"id":"2211.12507","title":"OpenFE: Automated Feature Generation with Expert-level Performance","created":"2022-11-22","cited_by_count":52,"area":null},{"id":"2207.03208","title":"Revisiting Pretraining Objectives for Tabular Deep Learning","created":"2022-07-07","cited_by_count":43,"area":null},{"id":"2401.02013","title":"SwitchTab: Switched Autoencoders Are Effective Tabular Learners","created":"2024-01-04","cited_by_count":38,"area":null},{"id":"2206.04405","title":"Conformal Off-Policy Prediction in Contextual Bandits","created":"2022-06-09","cited_by_count":25,"area":null},{"id":"2408.09929","title":"Data Augmentation of Contrastive Learning is Estimating Positive-incentive Noise","created":"2024-08-19","cited_by_count":25,"area":null},{"id":"2311.05877","title":"A Performance-Driven Benchmark for Feature Selection in Tabular Deep Learning","created":"2023-11-10","cited_by_count":24,"area":null},{"id":"2202.12183","title":"Large-scale Stochastic Optimization of NDCG Surrogates for Deep Learning with Provable Convergence","created":"2022-02-24","cited_by_count":22,"area":null},{"id":"2203.17118","title":"Doubly-Robust Estimation for Correcting Position-Bias in Click Feedback for Unbiased Learning to Rank","created":"2022-03-31","cited_by_count":18,"area":null},{"id":"2209.08754","title":"Toward Understanding Privileged Features Distillation in Learning-to-Rank","created":"2022-09-19","cited_by_count":16,"area":null},{"id":"2206.05772","title":"Distributed Differential Privacy in Multi-Armed Bandits","created":"2022-06-12","cited_by_count":14,"area":null},{"id":"2302.13945","title":"On Differentially Private Federated Linear Contextual Bandits","created":"2023-02-27","cited_by_count":14,"area":null},{"id":"2106.07914","title":"Control Variates for Slate Off-Policy Evaluation","created":"2021-06-15","cited_by_count":13,"area":null},{"id":"2201.08315","title":"Predictive Inference with Weak Supervision","created":"2022-01-20","cited_by_count":13,"area":null},{"id":"2204.10872","title":"Learning-to-Rank at the Speed of Sampling: Plackett-Luce Gradient Estimation With Minimal Computational Complexity","created":"2022-04-22","cited_by_count":13,"area":null},{"id":"2410.11502","title":"Offline Model-Based Optimization by Learning to Rank","created":"2024-10-15","cited_by_count":13,"area":null},{"id":"2405.07414","title":"Binning as a Pretext Task: Improving Self-Supervised Learning in Tabular Domains","created":"2024-05-13","cited_by_count":12,"area":null},{"id":"2202.03237","title":"Introducing the Expohedron for Efficient Pareto-optimal Fairness-Utility Amortizations in Repeated Rankings","created":"2022-02-07","cited_by_count":11,"area":null},{"id":"2205.04346","title":"Towards Feature Selection for Ranking and Classification Exploiting Quantum Annealers","created":"2022-05-09","cited_by_count":11,"area":null},{"id":"2210.08872","title":"PTDE: Personalized Training with Distilled Execution for Multi-Agent Reinforcement Learning","created":"2022-10-17","cited_by_count":11,"area":null},{"id":"2305.01522","title":"Safe Deployment for Counterfactual Learning to Rank with Exposure-Based Risk Minimization","created":"2023-04-26","cited_by_count":11,"area":null},{"id":"2205.15436","title":"Uncertainty Quantification for Fairness in Two-Stage Recommender Systems","created":"2022-05-30","cited_by_count":10,"area":null},{"id":"2207.03060","title":"Multi-Label Learning to Rank through Multi-Objective Optimization","created":"2022-07-07","cited_by_count":10,"area":null},{"id":"2309.08250","title":"Optimization of Rank Losses for Image Retrieval","created":"2023-09-15","cited_by_count":10,"area":null},{"id":"2404.02543","title":"Unbiased Learning to Rank Meets Reality: Lessons from Baidu's Large-Scale Search Dataset","created":"2024-04-03","cited_by_count":10,"area":null},{"id":"2212.13937","title":"Towards Disentangling Relevance and Bias in Unbiased Learning to Rank","created":"2022-12-28","cited_by_count":9,"area":null},{"id":"2306.05808","title":"RankFormer: Listwise Learning-to-Rank Using Listwide Labels","created":"2023-06-09","cited_by_count":9,"area":null},{"id":"2407.02464","title":"Reliable Confidence Intervals for Information Retrieval Evaluation Using Generative A.I","created":"2024-07-02","cited_by_count":9,"area":null},{"id":"2508.05673","title":"Breaking the Top-$K$ Barrier: Advancing Top-$K$ Ranking Metrics Optimization in Recommender Systems","created":"2025-08-04","cited_by_count":9,"area":null},{"id":"2207.04873","title":"Hierarchical Average Precision Training for Pertinent Image Retrieval","created":"2022-07-05","cited_by_count":8,"area":null},{"id":"2402.02334","title":"Arithmetic Feature Interaction Is Necessary for Deep Tabular Learning","created":"2024-02-04","cited_by_count":8,"area":null},{"id":"2402.07742","title":"Asking Multimodal Clarifying Questions in Mixed-Initiative Conversational Search","created":"2024-02-12","cited_by_count":8,"area":null},{"id":"2103.11023","title":"Individually Fair Ranking","created":"2021-03-19","cited_by_count":7,"area":null},{"id":"2211.17264","title":"Interpretability with full complexity by constraining feature information","created":"2022-11-30","cited_by_count":7,"area":null},{"id":"2407.19943","title":"Practical and Robust Safety Guarantees for Advanced Counterfactual Learning to Rank","created":"2024-07-29","cited_by_count":7,"area":null},{"id":"2102.05990","title":"Robust Generalization and Safe Query-Specialization in Counterfactual Learning to Rank","created":"2021-02-11","cited_by_count":6,"area":null},{"id":"2103.00368","title":"PairRank: Online Pairwise Learning to Rank by Divide-and-Conquer","created":"2021-02-28","cited_by_count":6,"area":null},{"id":"2310.10462","title":"Adaptive Neural Ranking Framework: Toward Maximized Business Goal for Cascade Ranking Systems","created":"2023-10-16","cited_by_count":6,"area":null},{"id":"2404.17769","title":"Two-stage Risk Control with Application to Ranked Retrieval","created":"2024-04-27","cited_by_count":6,"area":null},{"id":"2203.09607","title":"Learning Distributionally Robust Models at Scale via Composite Optimization","created":"2022-03-17","cited_by_count":5,"area":null},{"id":"2202.10728","title":"Distilled Neural Networks for Efficient Learning to Rank","created":"2022-02-22","cited_by_count":4,"area":null},{"id":"2204.13765","title":"Probabilistic Permutation Graph Search: Black-Box Optimization for Fairness in Ranking","created":"2022-04-28","cited_by_count":4,"area":null},{"id":"2211.10293","title":"Dueling Bandits: From Two-dueling to Multi-dueling","created":"2022-11-16","cited_by_count":4,"area":null},{"id":"2502.15215","title":"Tensor Product Neural Networks for Functional ANOVA Model","created":"2025-02-21","cited_by_count":4,"area":null},{"id":"2110.15503","title":"A Pre-processing Method for Fairness in Ranking","created":"2021-10-29","cited_by_count":3,"area":null},{"id":"2204.01500","title":"Which Tricks Are Important for Learning to Rank?","created":"2022-04-04","cited_by_count":3,"area":null},{"id":"2208.09529","title":"Intersection of Parallels as an Early Stopping Criterion","created":"2022-08-19","cited_by_count":3,"area":null},{"id":"2306.07188","title":"Inference-time Stochastic Ranking with Risk Control","created":"2023-06-12","cited_by_count":3,"area":null},{"id":"2311.13159","title":"Multi-Objective Optimization via Wasserstein-Fisher-Rao Gradient Flow","created":"2023-11-22","cited_by_count":3,"area":null},{"id":"2404.08860","title":"Enhancing Mobile \"How-to\" Queries with Automated Search Results Verification and Reranking","created":"2024-04-13","cited_by_count":3,"area":null},{"id":"2408.14603","title":"Biased Dueling Bandits with Stochastic Delayed Feedback","created":"2024-08-26","cited_by_count":3,"area":null},{"id":"2505.12791","title":"Unlearning for Federated Online Learning to Rank: A Reproducibility Study","created":"2025-05-19","cited_by_count":3,"area":null},{"id":"2209.12108","title":"An Asymptotically Optimal Batched Algorithm for the Dueling Bandit Problem","created":"2022-09-25","cited_by_count":2,"area":null},{"id":"2306.08650","title":"Learning to Rank when Grades Matter","created":"2023-06-14","cited_by_count":2,"area":null},{"id":"2410.18527","title":"Probing Ranking LLMs: A Mechanistic Analysis for Information Retrieval","created":"2024-10-24","cited_by_count":2,"area":null},{"id":"2503.15089","title":"Continual Contrastive Learning on Tabular Data with Out of Distribution","created":"2025-03-19","cited_by_count":2,"area":null},{"id":"2504.11284","title":"Bipartite Ranking From Multiple Labels: On Loss Versus Label Aggregation","created":"2025-04-15","cited_by_count":2,"area":null},{"id":"2601.22969","title":"Improved Algorithms for Nash Welfare in Linear Bandits","created":"2026-01-30","cited_by_count":2,"area":null},{"id":"2108.05618","title":"Conditional Sequential Slate Optimization","created":"2021-08-12","cited_by_count":1,"area":null},{"id":"2111.00735","title":"Calibrating Explore-Exploit Trade-off for Fair Online Learning to Rank","created":"2021-11-01","cited_by_count":1,"area":null},{"id":"2112.02767","title":"A General Framework for Debiasing in CTR Prediction","created":"2021-12-06","cited_by_count":1,"area":null},{"id":"2201.06658","title":"Learning Neural Ranking Models Online from Implicit User Feedback","created":"2022-01-17","cited_by_count":1,"area":null},{"id":"2301.10651","title":"Overcoming Prior Misspecification in Online Learning to Rank","created":"2023-01-25","cited_by_count":1,"area":null},{"id":"2306.12165","title":"Post-hoc Selection of Pareto-Optimal Solutions in Search and Recommendation","created":"2023-06-21","cited_by_count":1,"area":null},{"id":"2308.00177","title":"Pretrained deep models outperform GBDTs in Learning-To-Rank under label scarcity","created":"2023-07-31","cited_by_count":1,"area":null},{"id":"2310.19163","title":"RAIFLE: Reconstruction Attacks on Interaction-based Federated Learning with Adversarial Data Manipulation","created":"2023-10-29","cited_by_count":1,"area":null},{"id":"2404.03707","title":"Investigating the Robustness of Counterfactual Learning to Rank Models: A Reproducibility Study","created":"2024-04-04","cited_by_count":1,"area":null},{"id":"2409.09881","title":"Proximal Ranking Policy Optimization for Practical Safety in Counterfactual Learning to Rank","created":"2024-09-15","cited_by_count":1,"area":null},{"id":"2506.06989","title":"A Control Function Framework for Mitigating Position Bias in Learning to Rank Systems","created":"2025-06-08","cited_by_count":1,"area":null},{"id":"2506.20501","title":"Unidentified and Confounded? Understanding Two-Tower Models for Unbiased Learning to Rank","created":"2025-06-25","cited_by_count":1,"area":null},{"id":"2509.23684","title":"Hedonic Neurons: A Mechanistic Mapping of Latent Coalitions in Transformer MLPs","created":"2025-09-28","cited_by_count":1,"area":null},{"id":"2607.13686","title":"Optimal and Efficient Contextual Combinatorial Semi-bandits with General Function Approximation","created":"2026-07-15","cited_by_count":1,"area":null},{"id":"2108.07081","title":"Toward the Understanding of Deep Text Matching Models for Information Retrieval","created":"2021-08-16","cited_by_count":0,"area":null},{"id":"2111.00870","title":"Statistical Consequences of Dueling Bandits","created":"2021-10-16","cited_by_count":0,"area":null},{"id":"2206.07236","title":"Query-Adaptive Predictive Inference with Partial Labels","created":"2022-06-15","cited_by_count":0,"area":null},{"id":"2212.07126","title":"Explainability of Text Processing and Retrieval Methods: A Survey","created":"2022-12-14","cited_by_count":0,"area":null},{"id":"2310.13269","title":"An Exploratory Study on Simulated Annealing for Feature Selection in Learning-to-Rank","created":"2023-10-20","cited_by_count":0,"area":null},{"id":"2402.14305","title":"Towards Efficient Pareto-optimal Utility-Fairness between Groups in Repeated Rankings","created":"2024-02-22","cited_by_count":0,"area":null},{"id":"2404.12190","title":"Estimating the Hessian Matrix of Ranking Objectives for Stochastic Learning to Rank with Gradient Boosted Trees","created":"2024-04-18","cited_by_count":0,"area":null},{"id":"2405.12840","title":"GotFunding: A grant recommendation system based on scientific articles","created":"2024-05-21","cited_by_count":0,"area":null},{"id":"2409.16590","title":"Pre-trained Graphformer-based Ranking at Web-scale Search (Extended Abstract)","created":"2024-09-25","cited_by_count":0,"area":null},{"id":"2409.16594","title":"Generative Pre-trained Ranking Model with Over-parameterization at Web-Scale (Extended Abstract)","created":"2024-09-25","cited_by_count":0,"area":null},{"id":"2410.01959","title":"Scale-Invariant Learning-to-Rank","created":"2024-10-02","cited_by_count":0,"area":null},{"id":"2411.12064","title":"TSPRank: Bridging Pairwise and Listwise Methods with a Bilinear Travelling Salesman Model","created":"2024-11-18","cited_by_count":0,"area":null},{"id":"2502.10095","title":"Representation Learning on Out of Distribution in Tabular Data","created":"2025-02-14","cited_by_count":0,"area":null},{"id":"2505.10759","title":"Random Client Selection on Contrastive Federated Learning for Tabular Data","created":"2025-05-16","cited_by_count":0,"area":null},{"id":"2505.23437","title":"Bounded-Abstention Pairwise Learning to Rank","created":"2025-05-29","cited_by_count":0,"area":null},{"id":"2506.02406","title":"Random at First, Fast at Last: NTK-Guided Fourier Pre-Processing for Tabular DL","created":"2025-06-03","cited_by_count":0,"area":null},{"id":"2506.23319","title":"Learning to Rank with Variable Result Presentation Lengths","created":"2025-06-29","cited_by_count":0,"area":null},{"id":"2507.20753","title":"Industry Insights from Comparing Deep Learning and GBDT Models for E-Commerce Learning-to-Rank","created":"2025-07-28","cited_by_count":0,"area":null},{"id":"2508.12353","title":"A Large-Scale Web Search Dataset for Federated Online Learning to Rank","created":"2025-08-17","cited_by_count":0,"area":null},{"id":"2512.19550","title":"DFORD: Directional Feedback based Online Ordinal Regression Learning","created":"2025-12-22","cited_by_count":0,"area":null},{"id":"2601.05590","title":"A Causal Information-Flow Framework for Unbiased Learning-to-Rank","created":"2026-01-09","cited_by_count":0,"area":null}],"next_cursor":"100"}