Oceania
R-MBO: A Multi-surrogate Approach for Preference Incorporation in Multi-objective Bayesian Optimisation
Many real-world multi-objective optimisation problems rely on computationally expensive function evaluations. Multi-objective Bayesian optimisation (BO) can be used to alleviate the computation time to find an approximated set of Pareto optimal solutions. In many real-world problems, a decision-maker has some preferences on the objective functions. One approach to incorporate the preferences in multi-objective BO is to use a scalarising function and build a single surrogate model (mono-surrogate approach) on it. This approach has two major limitations. Firstly, the fitness landscape of the scalarising function and the objective functions may not be similar. Secondly, the approach assumes that the scalarising function distribution is Gaussian, and thus a closed-form expression of an acquisition function e.g., expected improvement can be used. We overcome these limitations by building independent surrogate models (multi-surrogate approach) on each objective function and show that the distribution of the scalarising function is not Gaussian. We approximate the distribution using Generalised value distribution. We present an a-priori multi-surrogate approach to incorporate the desirable objective function values (or reference point) as the preferences of a decision-maker in multi-objective BO. The results and comparison with the existing mono-surrogate approach on benchmark and real-world optimisation problems show the potential of the proposed approach.
HyperBox: A Supervised Approach for Hypernym Discovery using Box Embeddings
Parmar, Maulik, Narayan, Apurva
Hypernymy plays a fundamental role in many AI tasks like taxonomy learning, ontology learning, etc. This has motivated the development of many automatic identification methods for extracting this relation, most of which rely on word distribution. We present a novel model HyperBox to learn box embeddings for hypernym discovery. Given an input term, HyperBox retrieves its suitable hypernym from a target corpus. For this task, we use the dataset published for SemEval 2018 Shared Task on Hypernym Discovery. We compare the performance of our model on two specific domains of knowledge: medical and music. Experimentally, we show that our model outperforms existing methods on the majority of the evaluation metrics. Moreover, our model generalize well over unseen hypernymy pairs using only a small set of training data.
Attention Mechanism in Neural Networks: Where it Comes and Where it Goes
A long time ago in the machine learning literature, the idea of incorporating a mechanism inspired by the human visual system into neural networks was introduced. This idea is named the attention mechanism, and it has gone through a long development period. Today, many works have been devoted to this idea in a variety of tasks. Remarkable performance has recently been demonstrated. The goal of this paper is to provide an overview from the early work on searching for ways to implement attention idea with neural networks until the recent trends. This review emphasizes the important milestones during this progress regarding different tasks. By this way, this study aims to provide a road map for researchers to explore the current development and get inspired for novel approaches beyond the attention.
MailOnline visits the world's first VERTIPORT in Coventry that will serve as a hub for flying cars
The idea of a hub for drones and Jetsons-style flying taxis may sound like a concept from the latest science fiction blockbuster. But such a hub – known as a vertiport – became a reality this week, with the opening of the Air-One site in Coventry. Air-One is a centre for drones and electric vertical take-off and landing (eVTOL) aircraft, including flying cars and taxis, and will serve as a blueprint for more than 200 vertiports planned worldwide over the next five years, according to Urban-Air Port, the UK-based developer of Air-One. MailOnline attended the opening of the Air-One vertiport this week for a look at what the future of transport could be. From a central rising launch pad from which flying taxis could shuttle passengers on their journeys, to a futuristic vending machine where you can order items to be delivered by drones on demand, here's a look at the key features.
ACM's 2022 General Election
The ACM constitution provides that our Association hold a general election in the even-numbered years for the positions of President, Vice President, Secretary/Treasurer, and Members-at-Large. Biographical information and statements of the candidates appear on the following pages (candidates' names appear in random order). In addition to the election of ACM's officers--President, Vice President, Secretary/Treasurer--two Members-at-Large will be elected to serve on ACM Council. The 2022 candidates for ACM President, Yannis Ioannidis and Joseph A. Konstan, are working together to solicit and answer questions from the computing community! Please refer to the instructions posted at https://vote.escvote.com/acm. Please note the election email will be addressed from acmhelp@mg.electionservicescorp.com. Please return your ballot in the enclosed envelope, which must be signed by you on the outside in the space provided. The signed ballot envelope may be inserted into a separate envelope for mailing if you prefer this method. All ballots must be received by no later than 16:00 UTC on 23 May 2022. Validation by the Elections Committee will take place at 14:00 UTC on 25 May 2022. Yannis Ioannidis is Professor of Informatics & Telecom at the U. of Athens, Greece (since 1997). Prior to that, he was a professor of Computer Sciences at the U. of Wisconsin-Madison (1986-1997).
UK Hosts 'World's First' Hub For Drones, Future Flying Taxis
A pop-up urban port for delivery drones -- and one day, potentially flying taxis -- launched Monday in Britain, lifting a box of prosecco for a brief celebratory test flight hailed as groundbreaking. Air-One, a so-called "vertiport" for drones and future electric vehicles taking off and landing vertically, was proclaimed as the first of its kind by proponents and heralding a new era of low-emission futuristic air transport. Based in Coventry, a former car manufacturing powerhouse in central England, the site will be used for a month-long showcase of the burgeoning industry. The inaugural flight symbolically lifted the six-bottle box of sparkling wine, weighing around 12 kilograms, from the launch pad. The commercial drone used -- Malloy Aeronautics' T150, on loan from its day job doing logistics for the British military -- is the largest ever to fly in such an urban environment, according to Ricky Sandhu, founder and executive chairman of Urban-Air Port, the British firm behind the vertiport venture.
Direct 3D Printing of Soft Fluidic Actuators with Graded Porosity
Willemstein, Nick, van der Kooij, Herman, Sadeghi, Ali
New additive manufacturing methods are needed to realize more complex soft robots. One example is soft fluidic robotics, which exploits fluidic power and stiffness gradients. Porous structures are an interesting type for this approach, as they are flexible and allow for fluid transport. Within this work, the Infill-Foam (InFoam) is proposed to print structures with graded porosity by liquid rope coiling (LRC). By exploiting LRC, the InFoam method could exploit the repeatable coiling patterns to print structures. To this end, only the characterization of the relation between nozzle height and coil radius and the extruded length were necessary (at a fixed temperature). Then by adjusting the nozzle height and/or extrusion speed the porosity of the printed structure could be set. The InFoam method was demonstrated by printing porous structures using styrene-ethylene-butylene-styrene (SEBS) with porosities ranging from 46\% to 89\%. In compression tests, the cubes showed large changes in modulus (more than 200 times), density (-89\% compared to bulk), and energy dissipation. The InFoam method combined coiling and normal plotting to realize a large range of porosity gradients. This grading was exploited to realize rectangular structures with varying deformation patterns, which included twisting, contraction, and bending. Furthermore, the InFoam method was shown to be capable of programming the behavior of bending actuators by varying the porosity. Both the output force and stroke showed correlations similar to those of the cubes. Thus, the InFoam method can fabricate and program the mechanical behavior of a soft fluidic (porous) actuator by grading porosity.
AI ethics - how do we put theory into practice when international approaches vary?
Many governments around the world have rightly put ethical development and deployment at the heart of their AI thinking. Core to this complex issue is a set of interconnected problems - AI systems that may automate societal problems, either due to a systemic lack of diversity in development teams, perhaps, or the use of training data that contains historic or structural biases. The design of systems may also be a factor. The result may be the algorithmic exclusion of individuals or groups because of their ethnicity, gender, sexuality, religion, or socioeconomic background. For example, facial recognition systems that misidentify black or Asian people because of a lack of relevant data; or CV-scanning applications that reject applicants from some postcodes/zip codes because, historically, human employers have actively excluded those jobseekers.
Australia must invest to secure a place in the AI race
Most technological advances spark incremental progress. And then a few come along that are truly game-changing. AI is one of those truly transformative technologies. It's set to revolutionise our lives and workplaces at rapid speed in the coming decade. It will potentially reshape almost every job, industry and life.
Federated Learning Enables Big Data for Rare Cancer Boundary Detection
Pati, Sarthak, Baid, Ujjwal, Edwards, Brandon, Sheller, Micah, Wang, Shih-Han, Reina, G Anthony, Foley, Patrick, Gruzdev, Alexey, Karkada, Deepthi, Davatzikos, Christos, Sako, Chiharu, Ghodasara, Satyam, Bilello, Michel, Mohan, Suyash, Vollmuth, Philipp, Brugnara, Gianluca, Preetha, Chandrakanth J, Sahm, Felix, Maier-Hein, Klaus, Zenk, Maximilian, Bendszus, Martin, Wick, Wolfgang, Calabrese, Evan, Rudie, Jeffrey, Villanueva-Meyer, Javier, Cha, Soonmee, Ingalhalikar, Madhura, Jadhav, Manali, Pandey, Umang, Saini, Jitender, Garrett, John, Larson, Matthew, Jeraj, Robert, Currie, Stuart, Frood, Russell, Fatania, Kavi, Huang, Raymond Y, Chang, Ken, Balana, Carmen, Capellades, Jaume, Puig, Josep, Trenkler, Johannes, Pichler, Josef, Necker, Georg, Haunschmidt, Andreas, Meckel, Stephan, Shukla, Gaurav, Liem, Spencer, Alexander, Gregory S, Lombardo, Joseph, Palmer, Joshua D, Flanders, Adam E, Dicker, Adam P, Sair, Haris I, Jones, Craig K, Venkataraman, Archana, Jiang, Meirui, So, Tiffany Y, Chen, Cheng, Heng, Pheng Ann, Dou, Qi, Kozubek, Michal, Lux, Filip, Michálek, Jan, Matula, Petr, Keřkovský, Miloš, Kopřivová, Tereza, Dostál, Marek, Vybíhal, Václav, Vogelbaum, Michael A, Mitchell, J Ross, Farinhas, Joaquim, Maldjian, Joseph A, Yogananda, Chandan Ganesh Bangalore, Pinho, Marco C, Reddy, Divya, Holcomb, James, Wagner, Benjamin C, Ellingson, Benjamin M, Cloughesy, Timothy F, Raymond, Catalina, Oughourlian, Talia, Hagiwara, Akifumi, Wang, Chencai, To, Minh-Son, Bhardwaj, Sargam, Chong, Chee, Agzarian, Marc, Falcão, Alexandre Xavier, Martins, Samuel B, Teixeira, Bernardo C A, Sprenger, Flávia, Menotti, David, Lucio, Diego R, LaMontagne, Pamela, Marcus, Daniel, Wiestler, Benedikt, Kofler, Florian, Ezhov, Ivan, Metz, Marie, Jain, Rajan, Lee, Matthew, Lui, Yvonne W, McKinley, Richard, Slotboom, Johannes, Radojewski, Piotr, Meier, Raphael, Wiest, Roland, Murcia, Derrick, Fu, Eric, Haas, Rourke, Thompson, John, Ormond, David Ryan, Badve, Chaitra, Sloan, Andrew E, Vadmal, Vachan, Waite, Kristin, Colen, Rivka R, Pei, Linmin, Ak, Murat, Srinivasan, Ashok, Bapuraj, J Rajiv, Rao, Arvind, Wang, Nicholas, Yoshiaki, Ota, Moritani, Toshio, Turk, Sevcan, Lee, Joonsang, Prabhudesai, Snehal, Morón, Fanny, Mandel, Jacob, Kamnitsas, Konstantinos, Glocker, Ben, Dixon, Luke V M, Williams, Matthew, Zampakis, Peter, Panagiotopoulos, Vasileios, Tsiganos, Panagiotis, Alexiou, Sotiris, Haliassos, Ilias, Zacharaki, Evangelia I, Moustakas, Konstantinos, Kalogeropoulou, Christina, Kardamakis, Dimitrios M, Choi, Yoon Seong, Lee, Seung-Koo, Chang, Jong Hee, Ahn, Sung Soo, Luo, Bing, Poisson, Laila, Wen, Ning, Tiwari, Pallavi, Verma, Ruchika, Bareja, Rohan, Yadav, Ipsa, Chen, Jonathan, Kumar, Neeraj, Smits, Marion, van der Voort, Sebastian R, Alafandi, Ahmed, Incekara, Fatih, Wijnenga, Maarten MJ, Kapsas, Georgios, Gahrmann, Renske, Schouten, Joost W, Dubbink, Hendrikus J, Vincent, Arnaud JPE, Bent, Martin J van den, French, Pim J, Klein, Stefan, Yuan, Yading, Sharma, Sonam, Tseng, Tzu-Chi, Adabi, Saba, Niclou, Simone P, Keunen, Olivier, Hau, Ann-Christin, Vallières, Martin, Fortin, David, Lepage, Martin, Landman, Bennett, Ramadass, Karthik, Xu, Kaiwen, Chotai, Silky, Chambless, Lola B, Mistry, Akshitkumar, Thompson, Reid C, Gusev, Yuriy, Bhuvaneshwar, Krithika, Sayah, Anousheh, Bencheqroun, Camelia, Belouali, Anas, Madhavan, Subha, Booth, Thomas C, Chelliah, Alysha, Modat, Marc, Shuaib, Haris, Dragos, Carmen, Abayazeed, Aly, Kolodziej, Kenneth, Hill, Michael, Abbassy, Ahmed, Gamal, Shady, Mekhaimar, Mahmoud, Qayati, Mohamed, Reyes, Mauricio, Park, Ji Eun, Yun, Jihye, Kim, Ho Sung, Mahajan, Abhishek, Muzi, Mark, Benson, Sean, Beets-Tan, Regina G H, Teuwen, Jonas, Herrera-Trujillo, Alejandro, Trujillo, Maria, Escobar, William, Abello, Ana, Bernal, Jose, Gómez, Jhon, Choi, Joseph, Baek, Stephen, Kim, Yusung, Ismael, Heba, Allen, Bryan, Buatti, John M, Kotrotsou, Aikaterini, Li, Hongwei, Weiss, Tobias, Weller, Michael, Bink, Andrea, Pouymayou, Bertrand, Shaykh, Hassan F, Saltz, Joel, Prasanna, Prateek, Shrestha, Sampurna, Mani, Kartik M, Payne, David, Kurc, Tahsin, Pelaez, Enrique, Franco-Maldonado, Heydy, Loayza, Francis, Quevedo, Sebastian, Guevara, Pamela, Torche, Esteban, Mendoza, Cristobal, Vera, Franco, Ríos, Elvis, López, Eduardo, Velastin, Sergio A, Ogbole, Godwin, Oyekunle, Dotun, Odafe-Oyibotha, Olubunmi, Osobu, Babatunde, Shu'aibu, Mustapha, Dorcas, Adeleye, Soneye, Mayowa, Dako, Farouk, Simpson, Amber L, Hamghalam, Mohammad, Peoples, Jacob J, Hu, Ricky, Tran, Anh, Cutler, Danielle, Moraes, Fabio Y, Boss, Michael A, Gimpel, James, Veettil, Deepak Kattil, Schmidt, Kendall, Bialecki, Brian, Marella, Sailaja, Price, Cynthia, Cimino, Lisa, Apgar, Charles, Shah, Prashant, Menze, Bjoern, Barnholtz-Sloan, Jill S, Martin, Jason, Bakas, Spyridon
Although machine learning (ML) has shown promise in numerous domains, there are concerns about generalizability to out-of-sample data. This is currently addressed by centrally sharing ample, and importantly diverse, data from multiple sites. However, such centralization is challenging to scale (or even not feasible) due to various limitations. Federated ML (FL) provides an alternative to train accurate and generalizable ML models, by only sharing numerical model updates. Here we present findings from the largest FL study to-date, involving data from 71 healthcare institutions across 6 continents, to generate an automatic tumor boundary detector for the rare disease of glioblastoma, utilizing the largest dataset of such patients ever used in the literature (25, 256 MRI scans from 6, 314 patients). We demonstrate a 33% improvement over a publicly trained model to delineate the surgically targetable tumor, and 23% improvement over the tumor's entire extent. We anticipate our study to: 1) enable more studies in healthcare informed by large and diverse data, ensuring meaningful results for rare diseases and underrepresented populations, 2) facilitate further quantitative analyses for glioblastoma via performance optimization of our consensus model for eventual public release, and 3) demonstrate the effectiveness of FL at such scale and task complexity as a paradigm shift for multi-site collaborations, alleviating the need for data sharing.