Machine Permutation
Machine permutation research explores how to effectively utilize and learn from data where the order of elements is unknown or irrelevant, focusing on developing algorithms and models robust to permutations. Current research emphasizes efficient permutation-invariant representations, particularly within deep learning architectures for tasks like graph neural networks and language models, often employing techniques like sorting, optimal transport, and Kronecker decompositions. This field is significant because it enables the analysis of data with inherent permutation symmetries, improving model efficiency and accuracy in various applications, including drug discovery, natural language processing, and materials science.
Papers
Efficient Pruning for Machine Learning Under Homomorphic Encryption
Ehud Aharoni, Moran Baruch, Pradip Bose, Alper Buyuktosunoglu, Nir Drucker, Subhankar Pal, Tomer Pelleg, Kanthi Sarpatwar, Hayim Shaul, Omri Soceanu, Roman Vaculin
Learning the Quality of Machine Permutations in Job Shop Scheduling
Andrea Corsini, Simone Calderara, Mauro Dell'Amico