Papers
572 papers found
Evolution Strategies for Approximate Solution of Bayesian Games
Zun Li, Michael P. Wellman
Answering Regular Path Queries Under Approximate Semantics in Lightweight Description Logics
Oliver Fernández Gil, Anni-Yasmin Turhan
Learning Graph Neural Networks with Approximate Gradient Descent
Qunwei Li, Shaofeng Zou, Wenliang Zhong
Solving Common-Payoff Games with Approximate Policy Iteration
Samuel Sokota, Edward Lockhart, Finbarr Timbers et al.
Approximate Multiplication of Sparse Matrices with Limited Space
Yuanyu Wan, Lijun Zhang
ApproxASP – a Scalable Approximate Answer Set Counter
Mohimenul Kabir, Flavio O Everardo, Ankit K Shukla et al.
Listwise Learning to Rank Based on Approximate Rank Indicators
Thibaut Thonet, Yagmur Gizem Cinar, Eric Gaussier et al.
Learning Probably Approximately Complete and Safe Action Models for Stochastic Worlds
Brendan Juba, Roni Stern
Unsupervised Legal Evidence Retrieval via Contrastive Learning with Approximate Aggregated Positive
Feng Yao, Jingyuan Zhang, Yating Zhang et al.
Probably Approximate Shapley Fairness with Applications in Machine Learning
Zijian Zhou, Xinyi Xu, Rachael Hwee Ling Sim et al.
Very Fast, Approximate Counterfactual Explanations for Decision Forests
Miguel Á. Carreira-Perpinan, Suryabhan Singh Hada
Wasserstein Graph Distance Based on L1–Approximated Tree Edit Distance between Weisfeiler–Lehman Subtrees
Zhongxi Fang, Jianming Huang, Xun Su et al.
Reinforced Approximate Exploratory Data Analysis
Shaddy Garg, Subrata Mitra, Tong Yu et al.
A Tale of Two Latent Flows: Learning Latent Space Normalizing Flow with Short-Run Langevin Flow for Approximate Inference
Jianwen Xie, Yaxuan Zhu, Yifei Xu et al.
Learning to Approximate Adaptive Kernel Convolution on Graphs
Jaeyoon Sim, Sooyeon Jeon, InJun Choi et al.
An Approximate Skolem Function Counter
Arijit Shaw, Brendan Juba, Kuldeep S. Meel
Auditable Algorithms for Approximate Model Counting
Kuldeep S. Meel, Supratik Chakraborty, S. Akshay
SHAP@k: Efficient and Probably Approximately Correct (PAC) Identification of Top-K Features
Sanjay Kariyappa, Leonidas Tsepenekas, Freddy Lécué et al.
Approximate Distance Oracle for Fault-Tolerant Geometric Spanners
Kyungjin Cho, Jihun Shin, Eunjin Oh
Probabilistic Offline Policy Ranking with Approximate Bayesian Computation
Longchao Da, Porter Jenkins, Trevor Schwantes et al.
Towards Real-Time Approximate Counting
Yash Pote, Kuldeep S. Meel, Jiong Yang
Nearly Tight Bounds on Approximate Equilibria in Spatial Competition on the Line
Umang Bhaskar, Soumyajit Pyne
Hedging and Approximate Truthfulness in Traditional Forecasting Competitions
Mary Monroe, Anish Thilagar, Melody Hsu et al.
When Can We Approximate Wide Contrastive Models with Neural Tangent Kernels and Principal Component Analysis?
Gautham Govind Anil, Pascal Esser, Debarghya Ghoshdastidar