{"total":24,"rows":[{"id":"2305.16358","title":"Differentiable Clustering with Perturbed Spanning Forests","created":"2023-05-25","cited_by_count":14,"area":null},{"id":"2503.06242","title":"LapSum -- One Method to Differentiate Them All: Ranking, Sorting and Top-k Selection","created":"2025-03-08","cited_by_count":13,"area":null},{"id":"2305.15768","title":"High-Similarity-Pass Attention for Single Image Super-Resolution","created":"2023-05-25","cited_by_count":11,"area":null},{"id":"2310.01225","title":"A path-norm toolkit for modern networks: consequences, promises and challenges","created":"2023-10-02","cited_by_count":10,"area":null},{"id":"2505.19371","title":"Foundations of Top-$k$ Decoding For Language Models","created":"2025-05-25","cited_by_count":10,"area":null},{"id":"2402.11981","title":"Universal generalization guarantees for Wasserstein distributionally robust models","created":"2024-02-19","cited_by_count":5,"area":null},{"id":"2410.08125","title":"Generalizing Stochastic Smoothing for Differentiation and Gradient Estimation","created":"2024-10-10","cited_by_count":4,"area":null},{"id":"2506.11449","title":"Dynamic Sparse Training of Diagonally Sparse Networks","created":"2025-06-13","cited_by_count":4,"area":null},{"id":"2510.24039","title":"Geometric Algorithms for Neural Combinatorial Optimization with Constraints","created":"2025-10-28","cited_by_count":4,"area":null},{"id":"2511.05449","title":"How Many Tokens Do 3D Point Cloud Transformer Architectures Really Need?","created":"2025-11-07","cited_by_count":4,"area":null},{"id":"2406.19391","title":"Fibottention: Inceptive Visual Representation Learning with Diverse Attention Across Heads","created":"2024-06-27","cited_by_count":3,"area":null},{"id":"2411.00119","title":"Soft Condorcet Optimization for Ranking of General Agents","created":"2024-10-31","cited_by_count":3,"area":null},{"id":"2501.18528","title":"Joint Learning of Energy-based Models and their Partition Function","created":"2025-01-30","cited_by_count":3,"area":null},{"id":"2510.11472","title":"Differentiable Fast Top-K Selection for Large-Scale Recommendation","created":"2025-10-13","cited_by_count":3,"area":null},{"id":"2503.09492","title":"Learning Cascade Ranking as One Network","created":"2025-03-12","cited_by_count":2,"area":null},{"id":"2505.15661","title":"Deep greedy unfolding: Sorting out argsorting in greedy sparse recovery algorithms","created":"2025-05-21","cited_by_count":2,"area":null},{"id":"2603.08824","title":"SoftJAX & SoftTorch: Empowering Automatic Differentiation Libraries with Informative Gradients","created":"2026-03-09","cited_by_count":2,"area":null},{"id":"2403.19969","title":"Separate, Dynamic and Differentiable (SMART) Pruner for Block/Output Channel Pruning on Computer Vision Tasks","created":"2024-03-29","cited_by_count":1,"area":null},{"id":"2503.05622","title":"Decision-aware training of spatiotemporal forecasting models to select a top K subset of sites for intervention","created":"2025-03-07","cited_by_count":1,"area":null},{"id":"2511.08888","title":"Weaver: Kronecker Product Approximations of Spatiotemporal Attention for Traffic Network Forecasting","created":"2025-11-12","cited_by_count":1,"area":null},{"id":"2601.21775","title":"Differentiable Knapsack and Top-k Operators via Dynamic Programming","created":"2026-01-29","cited_by_count":1,"area":null},{"id":"2603.18712","title":"Accurate and Efficient Multi-Channel Time Series Forecasting via Sparse Attention Mechanism","created":"2026-03-19","cited_by_count":0,"area":null},{"id":"2608.04057","title":"LaPrune: Controllable Differentiable Sparsity at Million Scale","created":"2026-08-04","cited_by_count":0,"area":null},{"id":"2608.06912","title":"Fast LapSum: Exact Differentiable Top-$k$ at Million Scale","created":"2026-08-07","cited_by_count":0,"area":null}],"next_cursor":null}