{"total":37,"rows":[{"id":"2111.00364","title":"Sustainable AI: Environmental Implications, Challenges and Opportunities","created":"2021-10-30","cited_by_count":242,"area":null},{"id":"2101.07577","title":"Learnable Embedding Sizes for Recommender Systems","created":"2021-01-19","cited_by_count":42,"area":null},{"id":"2104.10584","title":"Deep Learning for Click-Through Rate Estimation","created":"2021-04-21","cited_by_count":33,"area":null},{"id":"2209.10117","title":"A Comprehensive Survey on Trustworthy Recommender Systems","created":"2022-09-21","cited_by_count":32,"area":null},{"id":"2106.06713","title":"AutoLoss: Automated Loss Function Search in Recommendations","created":"2021-06-12","cited_by_count":31,"area":null},{"id":"2201.10095","title":"RecShard: Statistical Feature-Based Memory Optimization for Industry-Scale Neural Recommendation","created":"2022-01-25","cited_by_count":28,"area":null},{"id":"2310.18608","title":"Embedding in Recommender Systems: A Survey","created":"2023-10-28","cited_by_count":20,"area":null},{"id":"2208.06399","title":"AutoShard: Automated Embedding Table Sharding for Recommender Systems","created":"2022-08-12","cited_by_count":17,"area":null},{"id":"2210.02023","title":"DreamShard: Generalizable Embedding Table Placement for Recommender Systems","created":"2022-10-05","cited_by_count":14,"area":null},{"id":"2311.05884","title":"Hiformer: Heterogeneous Feature Interactions Learning with Transformers for Recommender Systems","created":"2023-11-10","cited_by_count":14,"area":null},{"id":"2104.08542","title":"ScaleFreeCTR: MixCache-based Distributed Training System for CTR Models with Huge Embedding Table","created":"2021-04-17","cited_by_count":12,"area":null},{"id":"2108.11513","title":"Learning Effective and Efficient Embedding via an Adaptively-Masked Twins-based Layer","created":"2021-08-24","cited_by_count":12,"area":null},{"id":"2203.16218","title":"APG: Adaptive Parameter Generation Network for Click-Through Rate Prediction","created":"2022-03-30","cited_by_count":12,"area":null},{"id":"2109.02471","title":"Binary Code based Hash Embedding for Web-scale Applications","created":"2021-08-24","cited_by_count":11,"area":null},{"id":"2212.05735","title":"Adaptive Low-Precision Training for Embeddings in Click-Through Rate Prediction","created":"2022-12-12","cited_by_count":11,"area":null},{"id":"2308.07760","title":"Dynamic Embedding Size Search with Minimum Regret for Streaming Recommender System","created":"2023-08-15","cited_by_count":7,"area":null},{"id":"2311.04251","title":"MixtureGrowth: Growing Neural Networks by Recombining Learned Parameters","created":"2023-11-07","cited_by_count":7,"area":null},{"id":"2408.17162","title":"Deep Feature Embedding for Tabular Data","created":"2024-08-30","cited_by_count":7,"area":null},{"id":"2305.01868","title":"Pre-train and Search: Efficient Embedding Table Sharding with Pre-trained Neural Cost Models","created":"2023-05-03","cited_by_count":5,"area":null},{"id":"2108.02191","title":"Random Offset Block Embedding Array (ROBE) for CriteoTB Benchmark MLPerf DLRM Model : 1000$\\times$ Compression and 3.1$\\times$ Faster Inference","created":"2021-08-04","cited_by_count":4,"area":null},{"id":"2204.00281","title":"i-Razor: A Differentiable Neural Input Razor for Feature Selection and Dimension Search in DNN-Based Recommender Systems","created":"2022-04-01","cited_by_count":4,"area":null},{"id":"2204.01390","title":"A Comprehensive Survey on Automated Machine Learning for Recommendations","created":"2022-04-04","cited_by_count":4,"area":null},{"id":"2406.17335","title":"A Thorough Performance Benchmarking on Lightweight Embedding-based Recommender Systems","created":"2024-06-25","cited_by_count":4,"area":null},{"id":"2411.15731","title":"Fusion Matters: Learning Fusion in Deep Click-through Rate Prediction Models","created":"2024-11-24","cited_by_count":3,"area":null},{"id":"2506.19993","title":"CoVE: Compressed Vocabulary Expansion Makes Better LLM-based Recommender Systems","created":"2025-06-24","cited_by_count":3,"area":null},{"id":"2207.10731","title":"The trade-offs of model size in large recommendation models : A 10000 $\\times$ compressed criteo-tb DLRM model (100 GB parameters to mere 10MB)","created":"2022-07-21","cited_by_count":2,"area":null},{"id":"2411.13052","title":"On-device Content-based Recommendation with Single-shot Embedding Pruning: A Cooperative Game Perspective","created":"2024-11-20","cited_by_count":2,"area":null},{"id":"2107.01999","title":"FINT: Field-aware INTeraction Neural Network For CTR Prediction","created":"2021-07-05","cited_by_count":1,"area":null},{"id":"2205.11248","title":"Efficient Mixed Dimension Embeddings for Matrix Factorization","created":"2022-05-18","cited_by_count":1,"area":null},{"id":"2401.04408","title":"Fine-Grained Embedding Dimension Optimization During Training for Recommender Systems","created":"2024-01-09","cited_by_count":1,"area":null},{"id":"2609.04871","title":"AutoLR: Automating the Path from Research to Launch Review in Industrial Recommender Systems","created":"2026-09-04","cited_by_count":1,"area":null},{"id":"2112.03487","title":"Enhanced Exploration in Neural Feature Selection for Deep Click-Through Rate Prediction Models via Ensemble of Gating Layers","created":"2021-12-07","cited_by_count":0,"area":null},{"id":"2501.18126","title":"HyperZero: A Customized End-to-End Auto-Tuning System for Recommendation with Hourly Feedback","created":"2025-01-30","cited_by_count":0,"area":null},{"id":"2504.09870","title":"Ember: A Compiler for Efficient Embedding Operations on Decoupled Access-Execute Architectures","created":"2025-04-14","cited_by_count":0,"area":null},{"id":"2505.12683","title":"DimGrow: Memory-Efficient Field-level Embedding Dimension Search","created":"2025-05-19","cited_by_count":0,"area":null},{"id":"2506.03391","title":"Universal Reusability in Recommender Systems: The Case for Dataset- and Task-Independent Frameworks","created":"2025-06-03","cited_by_count":0,"area":null},{"id":"2602.03223","title":"Distribution-Aware End-to-End Embedding for Streaming Numerical Features in Click-Through Rate Prediction","created":"2026-02-03","cited_by_count":0,"area":null}],"next_cursor":null}