diff --git a/spaces/101-5/gpt4free/g4f/.v1/unfinished/openprompt/README.md b/spaces/101-5/gpt4free/g4f/.v1/unfinished/openprompt/README.md
deleted file mode 100644
index 489d054aeb56c15d30d3cda1e8ef350c7ff3167a..0000000000000000000000000000000000000000
--- a/spaces/101-5/gpt4free/g4f/.v1/unfinished/openprompt/README.md
+++ /dev/null
@@ -1,5 +0,0 @@
-https://openprompt.co/
-
-to do:
-- finish integrating email client
-- code refractoring
\ No newline at end of file
diff --git a/spaces/1acneusushi/gradio-2dmoleculeeditor/data/Bum Simulator Download For Pcl A Parody of Simulation Games with a Twist.md b/spaces/1acneusushi/gradio-2dmoleculeeditor/data/Bum Simulator Download For Pcl A Parody of Simulation Games with a Twist.md
deleted file mode 100644
index 0d8f5f941f5ad6b9528b7f7a47903f227052c8bf..0000000000000000000000000000000000000000
--- a/spaces/1acneusushi/gradio-2dmoleculeeditor/data/Bum Simulator Download For Pcl A Parody of Simulation Games with a Twist.md	
+++ /dev/null
@@ -1,114 +0,0 @@
-<br />
-<h1>Bum Simulator Download For Pc: A Guide to Living on the Streets</h1>
-<p>Have you ever wondered what it's like to be a bum? To live on the streets, beg for money, fight for survival, and deal with the harsh realities of urban life? If you have, then you might be interested in <strong>Bum Simulator</strong>, a sandbox game that lets you experience the life of a homeless person in a humorous and absurd way. In this article, we will tell you everything you need to know about Bum Simulator, how to download it for PC, and why you should play it.</p>
-<h2>What is Bum Simulator?</h2>
-<p>Bum Simulator is a sandbox game developed by Ragged Games that was released in 2023. It is a game that combines elements of adventure, survival, simulation, and comedy. You play as a bum who lives on the streets of Bumsville, a fictional city inspired by New York. You can explore the city, interact with other characters, complete quests, collect items, craft weapons, build your own cardboard house, tame pigeons, and more. You can also choose how to shape your fate: you can either accept your situation and live like a bum, find a job and try to get back on your feet, or seek revenge on those who ruined your life. The game offers endless possibilities and outcomes for your bum's story.</p>
-<h2>Bum Simulator Download For Pcl</h2><br /><p><b><b>Download</b> &middot; <a href="https://byltly.com/2uKx6D">https://byltly.com/2uKx6D</a></b></p><br /><br />
-<h3>A sandbox game with inappropriate humor and memorable characters</h3>
-<p>One of the main features of Bum Simulator is its open-world sandbox gameplay. You can go wherever you want and do whatever you like in the city. You can explore dirty alleys, busy streets, pawnshops, central park, underground passages, and more. You can also interact with many unusual characters with their own storylines and quests. Some of them are friendly and helpful, while others are hostile and dangerous. You can also encounter various events and situations that will test your skills and luck. For example, you can get chased by the police, attacked by gangs, kidnapped by mole people, or invited to a party by aliens. The game is full of inappropriate humor and jokes that will make you laugh or cringe.</p>
-<h3>A survival game with freedom and choices</h3>
-<p>Another feature of Bum Simulator is its survival aspect. You have to manage your basic needs such as hunger, thirst, health, hygiene, energy, and happiness. You have to find food and water sources, scavenge for useful items, craft tools and weapons, build shelters and traps, fight enemies and predators, avoid dangers and diseases, and more. You also have to deal with the consequences of your actions. For example, if you steal from someone or cause trouble in public, you will attract attention from the authorities or other bums. If you help someone or do a good deed, you will earn respect or gratitude from them. You also have to make choices that will affect your bum's personality and reputation. For example, you can be kind or cruel, honest or deceitful, generous or greedy, etc. Your choices will also affect the endings of the game.</p>
-<h3>A game with achievements, secrets and pigeons</h3>
-<p>The last feature of Bum Simulator is its variety of content and challenges. The game has many achievements to unlock and secrets to discover. You can find hidden items, easter eggs, references to pop culture or other games, and more. You can also complete mini-games, challenges, and quests that will reward you with money, items, or skills. One of the most unique aspects of the game is its pigeon system. You can tame pigeons, train them, and use them as your allies or weapons. You can also learn the secrets of alcohol alchemy, a mysterious art that allows you to create powerful potions from booze.</p>
-<p>How to download Bum Simulator for free on PC<br />
-Bum Simulator PC game full version download<br />
-Bum Simulator crack download for Windows 10<br />
-Bum Simulator torrent download link for PC<br />
-Bum Simulator gameplay and review for PC<br />
-Bum Simulator system requirements and compatibility for PC<br />
-Bum Simulator mods and cheats for PC<br />
-Bum Simulator update and patch download for PC<br />
-Bum Simulator steam key giveaway for PC<br />
-Bum Simulator best settings and tips for PC<br />
-Bum Simulator download size and installation guide for PC<br />
-Bum Simulator free demo download for PC<br />
-Bum Simulator online multiplayer mode for PC<br />
-Bum Simulator DLC and expansion pack download for PC<br />
-Bum Simulator controller support and configuration for PC<br />
-Bum Simulator alternatives and similar games for PC<br />
-Bum Simulator release date and price for PC<br />
-Bum Simulator official trailer and screenshots for PC<br />
-Bum Simulator developer and publisher information for PC<br />
-Bum Simulator minimum and recommended specs for PC<br />
-Bum Simulator error fix and troubleshooting guide for PC<br />
-Bum Simulator steam charts and achievements for PC<br />
-Bum Simulator save file location and backup for PC<br />
-Bum Simulator keyboard and mouse controls for PC<br />
-Bum Simulator VR support and compatibility for PC<br />
-Bum Simulator soundtrack and music download for PC<br />
-Bum Simulator custom maps and levels for PC<br />
-Bum Simulator steam workshop and community hub for PC<br />
-Bum Simulator rating and reviews for PC<br />
-Bum Simulator co-op and split-screen mode for PC<br />
-Bum Simulator direct download link for PC<br />
-Bum Simulator skidrow reloaded download for PC<br />
-Bum Simulator fitgirl repack download for PC<br />
-Bum Simulator ocean of games download for PC<br />
-Bum Simulator igg games download for PC<br />
-Bum Simulator apunkagames download for PC<br />
-Bum Simulator cpy games download for PC<br />
-Bum Simulator codex games download for PC<br />
-Bum Simulator plaza games download for PC<br />
-Bum Simulator rg mechanics download for PC<br />
-Bum Simulator pcgames88 download for PC<br />
-Bum Simulator gametrex download for PC<br />
-Bum Simulator worldofpcgames download for PC<br />
-Bum Simulator pcgamestorrents download for PC<br />
-Bum Simulator thepcgames download for PC<br />
-Bum Simulator fullypcgames download for PC<br />
-Bum Simulator oldgamesdownload download for PC<br />
-Bum Simulator freegogpcgames download for PC<br />
-Bum Simulator gog-games.com download for PC</p>
-<h2>How to download Bum Simulator for PC?</h2>
-<p>If you are interested in playing Bum Simulator on your PC, you will need to meet some requirements and follow some steps. Here are the details:</p>
-<h3>Requirements and specifications</h3>
-<p>To run Bum Simulator on your PC, you will need to have a Windows 8.1 or higher operating system, a 64-bit processor, at least 8 GB of RAM, and at least 20 GB of available space on your hard drive. You will also need a graphics card that supports DirectX 11 and has at least 2 GB of VRAM. The recommended graphics card is NVIDIA GeForce GTX 1060 or AMD Radeon RX 580.</p>
-<h3>Steps to download and install Bum Simulator</h3>
-<ol>
-<li>The first step is to buy Bum Simulator from an online platform such as Steam or GOG.com. You can also find other websites that offer the game for download, but make sure they are trustworthy and virus-free.</li>
-<li>The second step is to download the game installer from the platform you chose. You will need an internet connection and enough space on your hard drive to download the game files.</li>
-<li>The third step is to run the installer and follow the instructions on the screen. You will need to agree to the terms and conditions and choose a destination folder for the game.</li>
-<li>The fourth step is to wait for the installation process to finish. It may take some time depending on your internet speed and computer performance.</li>
-<li>The fifth step is to launch the game from your desktop shortcut or from the platform you bought it from. You may need to create an account or log in with an existing one to access the game.</li>
-<li>The sixth step is to enjoy playing Bum Simulator on your PC!</li>
-</ol>
-<h3>Tips and tricks for playing Bum Simulator</h3>
-<ul>
-<li>Explore every corner of the city and look for useful items, hidden secrets, and interesting characters.</li>
-<li>Manage your needs carefully and don't let them drop too low. You can find food and water in trash cans, shops, or vending machines. You can also hunt animals or fish in ponds.</li>
-<li>Craft weapons and tools from items you find or buy. You can make knives, hammers, bombs, bows, etc. You can also upgrade them with better materials or skills.</li>
-<li>Build your own cardboard house and decorate it with furniture, paintings, or posters. You can also invite other bums or pigeons to live with you.</li>
-<li>Tame pigeons and use them as your companions or weapons. You can feed them, pet them, name them, and teach them tricks. You can also weaponize them with bombs, lasers, or hats.</li>
-<li>Learn alcohol alchemy and create potions from booze. You can make potions that heal you, boost your stats, give you special abilities, or cause hilarious effects.</li>
-<li>Complete quests and challenges for other characters or yourself. You can earn money, items, skills, or reputation from them.</li>
-<li>Choose your path and shape your fate. You can either accept your situation and live like a bum, find a job and try to get back on your feet, or seek revenge on those who ruined your life. Your choices will affect the endings of the game.</li>
-<li>Have fun and don't take the game too seriously. It's a silly game full of absurd humor and jokes.</li>
-</ul>
- <h2>Why should you play Bum Simulator?</h2>
- <p>Bum Simulator is a game that offers a lot of fun and entertainment for anyone who likes sandbox games, survival games, simulation games, or comedy games. It's a game that lets you experience the life of a homeless person in a humorous and absurd way. It's a game that gives you freedom and choices to shape your fate. It's a game that has achievements, secrets, and pigeons to keep you engaged. Here are some reasons why you should play Bum Simulator:</p>
- ```html <h3>It's fun and absurd</h3>
-<p>Bum Simulator is a game that doesn't take itself too seriously. It's a game that makes fun of the stereotypes and clichés of being a bum. It's a game that has ridiculous situations and events that will make you laugh or cringe. For example, you can get chased by the police, attacked by gangs, kidnapped by mole people, or invited to a party by aliens. You can also interact with many funny characters with their own quirks and personalities. You can also create your own fun and absurd scenarios with the sandbox gameplay. You can do whatever you want and see what happens.</p>
-<h3>It's challenging and rewarding</h3>
-<p>Bum Simulator is also a game that tests your skills and luck. It's a game that has survival elements that require you to manage your basic needs and resources. It's a game that has enemies and dangers that threaten your life and well-being. It's a game that has quests and challenges that demand your attention and effort. It's a game that has consequences and outcomes that depend on your actions and choices. But it's also a game that rewards you for your achievements and discoveries. It's a game that gives you money, items, skills, or reputation for completing tasks or finding secrets. It's a game that gives you satisfaction and pride for overcoming obstacles or reaching goals.</p>
-<h3>It's immersive and interactive</h3>
-<p>Bum Simulator is also a game that immerses you in its world and story. It's a game that has a detailed and realistic city environment that you can explore and interact with. It's a game that has a dynamic day-night cycle and weather system that affect the gameplay and atmosphere. It's a game that has a rich and diverse soundtrack that matches the mood and tone of the game. It's also a game that has a compelling and branching story that you can influence with your choices. It's a game that has multiple endings that reflect your personality and reputation.</p>
-<h2>Conclusion</h2>
-<p>Bum Simulator is a sandbox game that lets you experience the life of a homeless person in a humorous and absurd way. You can explore the city, interact with other characters, complete quests, collect items, craft weapons, build your own cardboard house, tame pigeons, and more. You can also choose how to shape your fate: you can either accept your situation and live like a bum, find a job and try to get back on your feet, or seek revenge on those who ruined your life. The game offers endless possibilities and outcomes for your bum's story.</p>
-<p>If you are looking for a fun and entertaining game that combines elements of adventure, survival, simulation, and comedy, then you should try Bum Simulator. You can download it for PC from various online platforms such as Steam or GOG.com. You will need to meet some requirements and follow some steps to install it on your PC. You will also need some tips and tricks to play it well.</p>
-<p>Bum Simulator is a game that will make you laugh, cry, cringe, or cheer. It's a game that will challenge you, reward you, immerse you, or surprise you. It's a game that will give you freedom, choices, achievements, secrets, or pigeons. It's a game that will let you live on the streets as a bum.</p>
-<h2>FAQs</h2>
-<ul>
-<li><strong>Q: Is Bum Simulator based on real life?</strong></li>
-<li>A: No, Bum Simulator is not based on real life. It is a fictional game that exaggerates and parodies the stereotypes and clichés of being a bum. It is not meant to offend or mock anyone who is homeless or struggling in life.</li>
-<li><strong>Q: Is Bum Simulator multiplayer?</strong></li>
-<li>A: No, Bum Simulator is not multiplayer. It is a single-player game that focuses on your bum's story and choices.</li>
-<li><strong>Q: Is Bum Simulator suitable for children?</strong></li>
-<li>A: No, Bum Simulator is not suitable for children. It is a mature game that contains violence, blood, gore, nudity, sexual content, drugs, alcohol, profanity, and crude humor.</li>
-<li><strong>Q: How long is Bum Simulator?</strong></li>
-<li>A: The length of Bum Simulator depends on how you play it. You can finish the main story in about 10 hours if you focus on the main quests. You can also spend more time exploring the city, doing side quests, collecting items, crafting weapons, building your house, taming pigeons, etc.</li>
-<li><strong>Q: How many endings does Bum Simulator have?</strong></li>
-<li>A: Bum Simulator has multiple endings that depend on your choices throughout the game. Your choices will affect your bum's personality, reputation, and fate. You can either become a happy bum, a successful bum, a vengeful bum, or something else.</li>
-</ul>
- </p> 0a6ba089eb<br />
-<br />
-<br />
\ No newline at end of file
diff --git a/spaces/1gistliPinn/ChatGPT4/Examples/3d Sex Villa 2 Full For Android Apk.rar.md b/spaces/1gistliPinn/ChatGPT4/Examples/3d Sex Villa 2 Full For Android Apk.rar.md
deleted file mode 100644
index 71fcc9400d2a6a46f7863a7ddd7968a97df5e434..0000000000000000000000000000000000000000
--- a/spaces/1gistliPinn/ChatGPT4/Examples/3d Sex Villa 2 Full For Android Apk.rar.md	
+++ /dev/null
@@ -1,40 +0,0 @@
-<h2>3d Sex Villa 2 Full for android apk.rar</h2><br /><p><b><b>Download</b> &#9734;&#9734;&#9734; <a href="https://imgfil.com/2uy0Za">https://imgfil.com/2uy0Za</a></b></p><br /><br />
-
-Sexvilla2 3D Sexvilla 2 part 1, 3D SexVilla 2 Everlust 1 torrent.Some people have been trying to get people to play Pokémon Go at a recent visit by the local police.
-
-The police found many people playing the game while they were patrolling on the streets.
-
-At the moment, people who find themselves playing the game while on the street can be reported to the police, and warned they are doing a criminal act.
-
-Playing Pokémon Go on the streets of Loch Lomond has been banned by police in Scotland.
-
-This comes after new rules were introduced to police forces across the UK banning the use of smartphones while out on patrol.
-
-People have been warned that playing the game while out on the street could put their lives at risk.
-
-Currently, police forces across the UK are trying to create more visible patrols, and more officers on the streets to look for trouble.
-
-Glasgow police already patrol in pairs, while a new rule has been introduced across Scotland banning playing Pokémon Go on the street while out on patrol.
-
-Detective Inspector Stuart Reid said: “Our aim is to make sure people are safe when out on the streets.
-
-“We would like to remind everyone that Pokémon Go has not been endorsed by the police, and we would encourage all those who find themselves playing to ensure they remain safe.
-
-“We encourage people to play Pokémon Go in public areas, but remind them that it is still a criminal offence to play in public.”
-
-This story was originally published in the Daily Record. Read the original here.Religion
-
-Antonio di Pietro is an artist who draws a lot with the art of lettering. His latest project is, “The sea which has no beginning, no end”. He received thousands of messages from people who didn’t understand why he had to use the word Sea for such a concept. Here is a new artwork which answers the question:
-
-About us
-
-Hearst Mantis is an art and design platform for the latest trends in music, fashion, art, food, travel and more. We provide cutting-edge content from a variety of industry leading creators.Q:
-
-Unexpected nil when setting a global variable
-
-I have a Python class that I'm using to transfer data between the server and the client. 
-
-When the client disconnects, I want to set a 4fefd39f24<br />
-<br />
-<br />
-<p></p>
diff --git a/spaces/1gistliPinn/ChatGPT4/Examples/Experience The Trench Warfare Of Verdun 1914-1918 On Your Mac!.md b/spaces/1gistliPinn/ChatGPT4/Examples/Experience The Trench Warfare Of Verdun 1914-1918 On Your Mac!.md
deleted file mode 100644
index e0ee125fa121e876161ccb21e3b245b963cc800a..0000000000000000000000000000000000000000
--- a/spaces/1gistliPinn/ChatGPT4/Examples/Experience The Trench Warfare Of Verdun 1914-1918 On Your Mac!.md	
+++ /dev/null
@@ -1,11 +0,0 @@
-<br />
-<p>On the afternoon of the 4th, the last pigeon was released. On themorning of the 5th, thanks to two signalmen who volunteered to changea signal post which the Commandant had difficulty in observing,communications were maintained.</p>
-<h2>Verdun 1914-1918 Released For Mac!</h2><br /><p><b><b>Download File</b> &ndash;&ndash;&ndash; <a href="https://imgfil.com/2uxZXY">https://imgfil.com/2uxZXY</a></b></p><br /><br />
-<p>Verdun is a squad-based multiplayer first-person shooter set during World War I. It was released on 28 April 2015 on Steam after more than a year in Early Access. The game features realistic trench warfare and offers players an immersive experience as they battle it out against other squads. Verdun also has a unique system where players can choose to fight for one of four different armies, each with its own strengths and weaknesses. If you're looking for an intense and strategic WWI FPS, then Verdun is definitely worth checking out.</p>
-<p><i><b>Tannenberg</b></i> is a squad-based multiplayer first-person shooter video game set during World War I. It is a standalone expansion to <i>Verdun</i>, and entered Steam Early Access on November 17, 2017.[1][2][3][4] <i>Tannenberg</i> left Steam Early Access on February 13, 2019.[5][6] It was released on PlayStation 4 and Xbox One on July 24, 2020.[7][8][9][10]</p>
-<p><strong>1914-1918 series</strong><br />Starting out on the Western Front with the release of the first realistic WW1 FPS Verdun back in April 2015, and expanding to the Eastern Front with the upcoming Tannenberg, the 1914-1918 series throws players into intense warfare inspired by the chaos and fury of iconic battles from the First World War. With over 900,000 copies of Verdun sold, this novel and underserved setting has proven popular with the gaming community!<br />Players choose from a variety of historically accurate squads and weapons, with more available to unlock through playing the game, before diving into the mud and blood splattered battlefields of dynamic multiplayer trench warfare.<br />Every game is built on a base of thorough research and receives extensive post-release support bringing new content and challenges for our players. The games in the series are linked, but each one is standalone and provides a different experience, reflecting the nature of the fighting in the many-sided theaters of the war.</p>
-<p><b>Verdun</b> is een computerspel van het genre first-person shooter dat zich afspeelt tijdens de Eerste Wereldoorlog (1914-1918). Het werd ontwikkeld door de Nederlandse studio's M2H en Blackmill Games. Verdun verscheen als bètaversie op 9 juni 2013 en werd officieel gelanceerd op 28 april 2015 op het Steam softwareplatform.[1] Het spel is beschikbaar voor Windows, Mac en Linux.</p>
-<p></p>
-<p><strong>Less than a year ago, Verdun was released as a Steam Early Access game. The successful collaboration of M2H and BlackMill Games has finally reached a point where the developers are happy to release the game in all its glory. Many features and content has been added only shortly after our preview, which you can read here, but even more has been added since.</strong></p> aaccfb2cb3<br />
-<br />
-<br />
\ No newline at end of file
diff --git a/spaces/1gistliPinn/ChatGPT4/Examples/FULL DanDans (Easy) Audio Editor V9.0 The Ultimate Guide to Visual Music Editing.md b/spaces/1gistliPinn/ChatGPT4/Examples/FULL DanDans (Easy) Audio Editor V9.0 The Ultimate Guide to Visual Music Editing.md
deleted file mode 100644
index 7cd6f08bad1418aba3eccd67e7626ede3159c2b2..0000000000000000000000000000000000000000
--- a/spaces/1gistliPinn/ChatGPT4/Examples/FULL DanDans (Easy) Audio Editor V9.0 The Ultimate Guide to Visual Music Editing.md	
+++ /dev/null
@@ -1,6 +0,0 @@
-
-<p>Still struggling with your shooting 4K video won't play on other devices or playing with audio and video out of sync? Wondershare UniConverter helps you out! Find your issues and get the full answer now.</p>
-<h2>FULL DanDans (Easy) Audio Editor V9.0</h2><br /><p><b><b>DOWNLOAD</b> &#10040;&#10040;&#10040; <a href="https://imgfil.com/2uy06L">https://imgfil.com/2uy06L</a></b></p><br /><br />
-<p>Easy Audio Editor is a visual multifunctional audio files editor which allow you to perform various operations with audio data such as visual editing, creating, recording, converting and playing audio files. It supports all audio and video formats.</p> aaccfb2cb3<br />
-<br />
-<br />
\ No newline at end of file
diff --git a/spaces/1pelhydcardo/ChatGPT-prompt-generator/assets/Download APK Magic COC S1 Versi Terbaru and Enjoy the Best Private Server for Clash of Clans.md b/spaces/1pelhydcardo/ChatGPT-prompt-generator/assets/Download APK Magic COC S1 Versi Terbaru and Enjoy the Best Private Server for Clash of Clans.md
deleted file mode 100644
index 30c5dd4a6eb6275035e238b34a19815e0301a905..0000000000000000000000000000000000000000
--- a/spaces/1pelhydcardo/ChatGPT-prompt-generator/assets/Download APK Magic COC S1 Versi Terbaru and Enjoy the Best Private Server for Clash of Clans.md	
+++ /dev/null
@@ -1,95 +0,0 @@
-<br />
-<h1>Download APK Magic COC S1 Versi Terbaru: A Private Server for Clash of Clans</h1>
-<p>If you are a fan of Clash of Clans, you might have heard of APK Magic COC S1, a private server that lets you play the game with unlimited resources and custom mods. In this article, we will tell you everything you need to know about this app, including its features, how to download and install it, and its pros and cons. Read on to find out why you should download APK Magic COC S1 versi terbaru and enjoy the game like never before.</p>
-<h2>download apk magic coc s1 versi terbaru</h2><br /><p><b><b>Download Zip</b> &#10084;&#10084;&#10084; <a href="https://urlin.us/2uT1uY">https://urlin.us/2uT1uY</a></b></p><br /><br />
- <h2>Features of APK Magic COC S1</h2>
-<p>APK Magic COC S1 is a modified version of Clash of Clans that runs on a private server. This means that you can play the game with some extra features that are not available in the official version. Here are some of the main features of APK Magic COC S1:</p>
-<ul>
-<li><b>Unlimited resources:</b> You can get unlimited gems, gold, elixir, and dark elixir to build your base, train your troops, upgrade your buildings, and research new technologies. You don't have to worry about running out of resources or spending real money to buy them.</li>
-<li><b>Custom mods:</b> You can customize your game with various mods that allow you to create your own buildings, troops, heroes, and spells. You can also change the appearance and behavior of the existing ones. For example, you can make your archers shoot fireballs, your barbarians fly, or your pekkas invisible.</li>
-<li><b>Fast and stable servers:</b> You can play the game smoothly without any lag or crash. The servers of APK Magic COC S1 are fast and reliable, and they can handle thousands of players at the same time. You also don't have to worry about getting banned by Supercell, as they cannot detect or access your private server.</li>
-<li><b>Real-time PvP battles:</b> You can challenge other players online in real-time battles. You can test your skills and strategies against other players who are using the same private server as you. You can also join clans and participate in clan wars with your friends.</li>
-</ul>
- <h2>How to Download and Install APK Magic COC S1</h2>
-<p>If you want to download and install APK Magic COC S1 on your Android device, you need to follow these simple steps:</p>
-<ol>
-<li><b>Enable unknown sources on your device:</b> To install apps from sources other than Google Play Store, you need to enable unknown sources on your device. To do this, go to Settings > Security > Unknown Sources and toggle it on.</li>
-<li><b>Download the APK file from a trusted source:</b> You need to download the APK file of APK Magic COC S1 from a trusted source. You can use the link  to download the latest version of the app. Make sure you have enough storage space on your device before downloading.</li>
-<li><b>Install the APK file and launch the app :</b> After downloading the APK file, you need to install it on your device. To do this, locate the file in your file manager and tap on it. You will see a pop-up window asking you to confirm the installation. Tap on Install and wait for the process to finish. Once the app is installed, you can launch it by tapping on its icon on your home screen or app drawer.</li>
-</ol>
- <h2>Pros and Cons of APK Magic COC S1</h2>
-<p>APK Magic COC S1 is a great app for Clash of Clans lovers who want to have more fun and freedom in the game. However, it also has some drawbacks that you should be aware of before downloading it. Here are some of the pros and cons of APK Magic COC S1:</p>
-<table>
-<tr>
-<th>Pros</th>
-<th>Cons</th>
-</tr>
-<tr>
-<td>- More fun: You can enjoy the game without any limitations or restrictions. You can build your base, train your troops, and attack other players as much as you want.</td>
-<td>- Not official: APK Magic COC S1 is not an official app from Supercell, the developer of Clash of Clans. It is a third-party app that is not endorsed or supported by Supercell.</td>
-</tr>
-<tr>
-<td>- More freedom: You can customize your game with various mods that allow you to create your own buildings, troops, heroes, and spells. You can also change the appearance and behavior of the existing ones.</td>
-<td>- Not compatible: APK Magic COC S1 is not compatible with the official version of Clash of Clans. You cannot play with or against players who are using the official version. You also cannot sync your progress or data with your Google Play account.</td>
-</tr>
-<tr>
-<td>- More options: You can choose from different servers that offer different features and settings. You can also switch between servers easily without losing your data.</td>
-<td>- Not updated: APK Magic COC S1 is not updated regularly with the latest features and updates from Clash of Clans. You may miss out on some new content or events that are available in the official version.</td>
-</tr>
-</table>
- <h2>Conclusion and FAQs</h2>
-<p>APK Magic COC S1 is a private server for Clash of Clans that offers unlimited resources and custom mods. It is a great alternative for Clash of Clans fans who want to enjoy the game without any limitations. However, it also has some disadvantages that you should consider before downloading it, such as being not official, not compatible, and not updated. If you are interested in trying out APK Magic COC S1, you can download it from the link  and follow the steps we have provided in this article.</p>
- <p>If you have any questions about APK Magic COC S1, you may find the answers in the following FAQs:</p>
- <h3>Q: Is APK Magic COC S1 safe to use?</h3>
-<p>A: APK Magic COC S1 is safe to use as long as you download it from a trusted source and enable unknown sources on your device. However, you should always be careful when installing apps from unknown sources, as they may contain malware or viruses that can harm your device or steal your data.</p>
-<p>Download clash of magic apk private server game coc terbaru[^3^]<br />
-Clash of magic apk android game free download latest version[^1^]<br />
-Magic coc s1 10.322 r1 apk android app free download updated version[^2^]<br />
-How to install clash of magic apk on android device without root<br />
-Clash of magic apk mod unlimited resources and gems for coc<br />
-Magic coc s1 10.322 r1 app private server with custom mods and commands<br />
-Clash of magic apk download for ios iphone ipad ipod touch<br />
-Clash of clans with unlimited resources using clash of magic apk<br />
-Magic coc s1 10.322 r1 apk features and benefits for coc players<br />
-Clash of magic apk review and rating by users and experts<br />
-How to update clash of magic apk to the latest version easily<br />
-Clash of magic apk vs clash of lights apk which one is better<br />
-Magic coc s1 10.322 r1 apk download link and installation guide<br />
-Clash of magic apk troubleshooting and support for common issues<br />
-Magic coc s1 10.322 r1 app download size and compatibility with android devices<br />
-Clash of magic apk alternatives and similar apps for coc private server<br />
-Magic coc s1 10.322 r1 app pros and cons for coc fans<br />
-Clash of magic apk security and safety tips for downloading and playing<br />
-Magic coc s1 10.322 r1 app feedback and suggestions from users and developers<br />
-Clash of magic apk faq and answers to frequently asked questions<br />
-Magic coc s1 10.322 r1 app screenshots and videos for preview and demonstration<br />
-Clash of magic apk history and development by tatem games inc.<br />
-Magic coc s1 10.322 r1 app news and updates from official sources<br />
-Clash of magic apk comparison and difference with original coc game<br />
-Magic coc s1 10.322 r1 app requirements and specifications for optimal performance<br />
-Clash of magic apk advantages and disadvantages for coc lovers<br />
-Magic coc s1 10.322 r1 app testimonials and reviews from satisfied users<br />
-Clash of magic apk tips and tricks for mastering the game<br />
-Magic coc s1 10.322 r1 app hacks and cheats for getting more resources and gems<br />
-Clash of magic apk best practices and recommendations for playing the game<br />
-Magic coc s1 10.322 r1 app rankings and ratings on google play store and other platforms<br />
-Clash of magic apk fun facts and trivia about the game and its developers<br />
-Magic coc s1 10.322 r1 app challenges and achievements for completing the game<br />
-Clash of magic apk community and social media for connecting with other players<br />
-Magic coc s1 10.322 r1 app tutorials and guides for learning the game<br />
-Clash of magic apk statistics and data for analyzing the game performance<br />
-Magic coc s1 10.322 r1 app rewards and incentives for playing the game regularly<br />
-Clash of magic apk myths and misconceptions about the game and its features<br />
-Magic coc s1 10.322 r1 app terms and conditions for using the game legally</p>
- <h3>Q: Can I play APK Magic COC S1 on PC?</h3>
-<p>A: Yes, you can play APK Magic COC S1 on PC using an Android emulator. An Android emulator is a software that allows you to run Android apps on your PC. Some of the popular Android emulators are BlueStacks, NoxPlayer, and LDPlayer. You can download any of these emulators from their official websites and install them on your PC. Then, you can download APK Magic COC S1 from the link  and install it on your emulator. After that, you can launch the app and play it on your PC.</p>
- <h3>Q: How can I update APK Magic COC S1?</h3>
-<p>A: APK Magic COC S1 is not updated regularly with the latest features and updates from Clash of Clans. However, if there is a new version available, you can update it by downloading the latest APK file from the link  and installing it over the existing app. You don't have to uninstall the previous version or lose your data.</p>
- <h3>Q: How can I contact the developer of APK Magic COC S1?</h3>
-<p>A: The developer of APK Magic COC S1 is unknown and does not have an official website or social media account. Therefore, it is difficult to contact them or get support from them. However, you can try to contact them through their email address  or their Telegram group [^ <h3>Q: What is the difference between APK Magic COC S1 and Clash of Clans?</h3>
-<p>A: APK Magic COC S1 and Clash of Clans are both strategy games that involve building bases, training troops, and attacking other players. However, APK Magic COC S1 is a modified version of Clash of Clans that runs on a private server and has unlimited resources and custom mods. Clash of Clans is the official version of the game that runs on Supercell's servers and has limited resources and standard features.</p>
- <h3>Q: Can I play APK Magic COC S1 with my friends?</h3>
-<p>A: Yes, you can play APK Magic COC S1 with your friends if they are also using the same private server as you. You can join clans and chat with your friends in the game. You can also invite your friends to join your server by sharing the link  or the QR code . However, you cannot play APK Magic COC S1 with your friends who are using the official version of Clash of Clans or a different private server.</p>
- <p>We hope this article has helped you learn more about APK Magic COC S1 versi terbaru and how to download and install it on your device. If you have any feedback or suggestions, please feel free to contact us at  or join our Telegram group . Thank you for reading and happy gaming!</p> 197e85843d<br />
-<br />
-<br />
\ No newline at end of file
diff --git a/spaces/1phancelerku/anime-remove-background/FIFA Mobile Hile - The Best Tricks and Tips for Winning Every Match.md b/spaces/1phancelerku/anime-remove-background/FIFA Mobile Hile - The Best Tricks and Tips for Winning Every Match.md
deleted file mode 100644
index 4a7f3c875732c74e19057b24bd9676c6dff79cfb..0000000000000000000000000000000000000000
--- a/spaces/1phancelerku/anime-remove-background/FIFA Mobile Hile - The Best Tricks and Tips for Winning Every Match.md	
+++ /dev/null
@@ -1,114 +0,0 @@
-<br />
-<h1>FIFA APK Hile: How to Play FIFA Mobile with Unlimited Coins and Gems</h1>
-<p>If you are a fan of football games, you probably know about FIFA Mobile, the popular mobile game from EA Sports that lets you play with your favorite teams and players from around the world. But did you know that there is a way to play FIFA Mobile with unlimited coins and gems? Yes, you heard that right. With FIFA APK Hile, you can enjoy the game without spending any money or waiting for hours to earn coins and gems. In this article, we will tell you everything you need to know about FIFA APK Hile, including what it is, why you should use it, how to download and install it, how to use it, what are its features, what are some tips and tricks for it, and what are the risks of using it.</p>
-<h2>What is FIFA APK Hile?</h2>
-<p>FIFA APK Hile is a modified version of FIFA Mobile that gives you unlimited coins and gems to buy players, packs, and upgrades in the game. Coins and gems are the main currencies in FIFA Mobile that allow you to improve your team and compete with other players online. However, earning coins and gems in the game can be very slow and tedious, especially if you want to get the best players and items. That's why some people use FIFA APK Hile to get unlimited coins and gems for free.</p>
-<h2>fifa apk hile</h2><br /><p><b><b>Download Zip</b> &#10038; <a href="https://jinyurl.com/2uNQSz">https://jinyurl.com/2uNQSz</a></b></p><br /><br />
-<h2>Why Use FIFA APK Hile?</h2>
-<p>There are many reasons why you might want to use FIFA APK Hile. Here are some of them:</p>
-<ul>
-<li>You can have more fun playing the game without worrying about running out of coins or gems.</li>
-<li>You can save money that you would otherwise spend on buying coins or gems with real money.</li>
-<li>You can build your dream team with any players you want, regardless of their price or availability.</li>
-<li>You can unlock all the modes, features, and events in the game that require coins or gems.</li>
-<li>You can experiment with different strategies and tactics without risking your coins or gems.</li>
-</ul>
-<h2>How to Download and Install FIFA APK Hile?</h2>
-<p>Downloading and installing FIFA APK Hile is very easy. Just follow these steps:</p>
-<ol>
-<li>Go to this link: [FIFA Mobile APK Para Hilesi (2022) Sınırsız Para - Websesi](^2^) and click on the download button.</li>
-<li>Wait for the download to finish and locate the FIFA APK Hile file on your device.</li>
-<li>Tap on the file and allow the installation from unknown sources if prompted.</li>
-<li>Wait for the installation to complete and launch the game.</li>
-<li>Enjoy playing FIFA Mobile with unlimited coins and gems.</li>
-</ol>
-<h2>How to Use FIFA APK Hile?</h2>
-<p>Using FIFA APK Hile is very simple. Once you launch the game, you will see that you have unlimited coins and gems in your account. You can use them to buy anything you want in the game, such as players, packs, and upgrades. Here are some examples of how to use FIFA APK Hile:</p>
-<ul>
-<li>To buy players, go to the market and search for the player you want. You can filter by name, rating, position, league, nation, or team. Then, tap on the player and buy him with coins or gems.</li>
-<li>To buy packs, go to the store and choose the pack you want. You can buy premium packs, special packs, or event packs with coins or gems. Then, open the pack and see what players and items you get.</li>
-<li>To upgrade your team, go to the team management and select the player you want to upgrade. You can upgrade his skills, chemistry, or rank with coins or gems. You can also train him with other players or items.</li>
-</ul>
-<h2>What are the Features of FIFA APK Hile?</h2>
-<p>FIFA APK Hile has many features that make it better than the original FIFA Mobile. Some of these features are:</p>
-<ul>
-<li>New gameplay technology that makes the game more realistic, responsive, and fluid.</li>
-<li>New modes such as Volta Football, Career Mode, Ultimate Team, and Champions League.</li>
-<li>New players such as Messi, Ronaldo, Neymar, Mbappe, and Haaland.</li>
-<li>New graphics that enhance the visual quality of the game.</li>
-</ul>
-<h2>What are the Tips and Tricks for FIFA APK Hile?</h2>
-<p>FIFA APK Hile is a fun and easy game to play, but there are some tips and tricks that can help you improve your skills and performance. Here are some of them:</p>
-<p>fifa mobile apk hile indir<br />
-fifa soccer apk hile nasıl yapılır<br />
-fifa 2023 apk hile mod<br />
-fifa ultimate team apk hile<br />
-fifa 21 apk hile android oyun club<br />
-fifa mobile apk hileli sınırsız para<br />
-fifa 20 apk hile güncel<br />
-fifa mobile apk hile yapma<br />
-fifa 19 apk hile full<br />
-fifa mobile apk hileli paket açılımı<br />
-fifa soccer apk hileli versiyon<br />
-fifa 22 apk hile mega<br />
-fifa mobile apk hileli indirme linki<br />
-fifa 18 apk hile kurulumu<br />
-fifa mobile apk hileli oyun indir club<br />
-fifa soccer apk hile nasıl indirilir<br />
-fifa 17 apk hile no root<br />
-fifa mobile apk hileli son sürüm<br />
-fifa soccer apk hileli oyna<br />
-fifa 16 apk hile mediafire<br />
-fifa mobile apk hileli nasıl yüklenir<br />
-fifa soccer apk hileli güncelleme<br />
-fifa 15 apk hile offline<br />
-fifa mobile apk hileli online<br />
-fifa soccer apk hileli mod menu<br />
-fifa 14 apk hile data<br />
-fifa mobile apk hileli para kasma<br />
-fifa soccer apk hileli hack<br />
-fifa 13 apk hile android 1<br />
-fifa mobile apk hileli yeni sezon<br />
-fifa soccer apk hileli coins<br />
-fifa 12 apk hile obb<br />
-fifa mobile apk hileli transfer marketi açma<br />
-fifa soccer apk hileli vip<br />
-fifa 11 apk hile revdl<br />
-fifa mobile apk hileli oyuncu yükseltme<br />
-fifa soccer apk hileli unlimited money<br />
-fifa 10 apk hile rexdl<br />
-fifa mobile apk hileli draft modu<br />
-fifa soccer apk hileli points</p>
-<ul>
-<li>Use explosive sprint to accelerate past defenders and create space for yourself or your teammates.</li>
-<li>Use finesse shots to curl the ball around the goalkeeper and score from tight angles.</li>
-<li>Use creative runs to control where your teammates run and create more options for passing or shooting.</li>
-<li>Use adaptive right stick switching to switch between defenders quickly and easily.</li>
-</ul>
-<h2>What are the Risks of FIFA APK Hile?</h2>
-<p>FIFA APK Hile may sound like a great way to play FIFA Mobile, but it also comes with some risks that you should be aware of. Some of these risks are:</p>
-<ul>
-<li>You may violate the terms of service of EA Sports and get banned from playing FIFA Mobile or other EA games.</li>
-<li>You may lose your progress and data if you uninstall FIFA APK Hile or update it to a newer version.</li>
-<li>You may expose your device to malware or viruses that may harm your device or steal your personal information.</li>
-</ul>
-<h2>Conclusion</h2>
-<p>FIFA APK Hile is a modified version of FIFA Mobile that gives you unlimited coins and gems to play the game without any limitations. It has many features, benefits, and tips that make it more enjoyable and exciting than the original game. However, it also has some risks that you should consider before using it. If you want to try FIFA APK Hile, you can download it from this link: [FIFA Mobile APK Para Hilesi (2022) Sınırsız Para - Websesi] and follow the instructions in this article. Have fun playing FIFA Mobile with unlimited coins and gems!</p>
- <h2>FAQs</h2>
- <p>Here are some frequently asked questions about FIFA APK Hile:</p>
- <ol>
- <li>What is FIFA APK Hile?</li>
- <p>FIFA APK Hile is a modified version of FIFA Mobile that gives you unlimited coins and gems to buy players, packs, and upgrades in the game.</p>
- <li>How to download and install FIFA APK Hile?</li>
- <p>You can download FIFA APK Hile from this link: [FIFA Mobile APK Para Hilesi (2022) Sınırsız Para - Websesi] and install it on your Android device by following these steps: - Go to this link: [FIFA Mobile APK Para Hilesi (2022) Sınırsız Para - Websesi] and click on the download button. - Wait for the download to finish and locate the FIFA APK Hile file on your device. - Tap on the file and allow the installation from unknown sources if prompted. - Wait for the installation to complete and launch the game. - Enjoy playing FIFA Mobile with unlimited coins and gems.</p>
- <li>How to use FIFA APK Hile?</li>
- <p>You can use FIFA APK Hile to buy anything you want in the game, such as players, packs, and upgrades. You can also unlock all the modes, features, and events in the game. Here are some examples of how to use FIFA APK Hile: - To buy players, go to the market and search for the player you want. You can filter by name, rating, position, league, nation, or team. Then, tap on the player and buy him with coins or gems. - To buy packs, go to the store and choose the pack you want. You can buy premium packs, special packs, or event packs with coins or gems. Then, open the pack and see what players and items you get. - To upgrade your team, go to the team management and select the player you want to upgrade. You can upgrade his skills, chemistry, or rank with coins or gems. You can also train him with other players or items.</p>
- <li>What are the features of FIFA APK Hile?</li>
- <p>FIFA APK Hile has many features that make it better than the original FIFA Mobile. Some of these features are: - New gameplay technology that makes the game more realistic, responsive, and fluid. - New modes such as Volta Football, Career Mode, Ultimate Team, and Champions League. - New players such as Messi, Ronaldo, Neymar, Mbappe, and Haaland. - New graphics that enhance the visual quality of the game.</p>
- <li>What are the tips and tricks for FIFA APK Hile?</li>
- <p>FIFA APK Hile is a fun and easy game to play, but there are some tips and tricks that can help you improve your skills and performance. Here are some of them: - Use explosive sprint to accelerate past defenders and create space for yourself or your teammates. - Use finesse shots to curl the ball around the goalkeeper and score from tight angles. - Use creative runs to control where your teammates run and create more options for passing or shooting. - Use adaptive right stick switching to switch between defenders quickly and easily.</p>
- <li>What are the risks of FIFA APK Hile?</li>
- <p>FIFA APK Hile may sound like a great way to play FIFA Mobile, but it also comes with some risks that you should be aware of. Some of these risks are: - You may violate the terms of service of EA Sports and get banned from playing FIFA Mobile or other EA games. - You may lose your progress and data if you uninstall FIFA APK Hile or update it to a newer version. - You may expose your device to malware or viruses that may harm your device or steal your personal information.</p>
-</ol></p> 401be4b1e0<br />
-<br />
-<br />
\ No newline at end of file
diff --git a/spaces/44ov41za8i/FreeVC/utils.py b/spaces/44ov41za8i/FreeVC/utils.py
deleted file mode 100644
index 1bd5b6185af6c9f1c270b8ba345bfc36d059e081..0000000000000000000000000000000000000000
--- a/spaces/44ov41za8i/FreeVC/utils.py
+++ /dev/null
@@ -1,305 +0,0 @@
-import os
-import sys
-import argparse
-import logging
-import json
-import subprocess
-import numpy as np
-from scipy.io.wavfile import read
-import torch
-from torch.nn import functional as F
-from commons import sequence_mask
-
-MATPLOTLIB_FLAG = False
-
-logging.basicConfig(stream=sys.stdout, level=logging.DEBUG)
-logger = logging
-
-
-def get_cmodel(rank):
-    checkpoint = torch.load('wavlm/WavLM-Large.pt')
-    cfg = WavLMConfig(checkpoint['cfg'])
-    cmodel = WavLM(cfg).cuda(rank)
-    cmodel.load_state_dict(checkpoint['model'])
-    cmodel.eval()
-    return cmodel
-    
-    
-def get_content(cmodel, y):
-    with torch.no_grad():
-        c = cmodel.extract_features(y.squeeze(1))[0]
-    c = c.transpose(1, 2)
-    return c
-
-
-def get_vocoder(rank):
-    with open("hifigan/config.json", "r") as f:
-        config = json.load(f)
-    config = hifigan.AttrDict(config)
-    vocoder = hifigan.Generator(config)
-    ckpt = torch.load("hifigan/generator_v1")
-    vocoder.load_state_dict(ckpt["generator"])
-    vocoder.eval()
-    vocoder.remove_weight_norm()
-    vocoder.cuda(rank)
-    return vocoder
-    
-    
-def transform(mel, height): # 68-92
-    #r = np.random.random()
-    #rate = r * 0.3 + 0.85 # 0.85-1.15
-    #height = int(mel.size(-2) * rate)
-    tgt = torchvision.transforms.functional.resize(mel, (height, mel.size(-1)))
-    if height >= mel.size(-2):
-        return tgt[:, :mel.size(-2), :]
-    else:
-        silence = tgt[:,-1:,:].repeat(1,mel.size(-2)-height,1) 
-        silence += torch.randn_like(silence) / 10
-        return torch.cat((tgt, silence), 1)
-        
-        
-def stretch(mel, width): # 0.5-2
-    return torchvision.transforms.functional.resize(mel, (mel.size(-2), width))
-
-
-def load_checkpoint(checkpoint_path, model, optimizer=None):
-  assert os.path.isfile(checkpoint_path)
-  checkpoint_dict = torch.load(checkpoint_path, map_location='cpu')
-  iteration = checkpoint_dict['iteration']
-  learning_rate = checkpoint_dict['learning_rate']
-  if optimizer is not None:
-    optimizer.load_state_dict(checkpoint_dict['optimizer'])
-  saved_state_dict = checkpoint_dict['model']
-  if hasattr(model, 'module'):
-    state_dict = model.module.state_dict()
-  else:
-    state_dict = model.state_dict()
-  new_state_dict= {}
-  for k, v in state_dict.items():
-    try:
-      new_state_dict[k] = saved_state_dict[k]
-    except:
-      logger.info("%s is not in the checkpoint" % k)
-      new_state_dict[k] = v
-  if hasattr(model, 'module'):
-    model.module.load_state_dict(new_state_dict)
-  else:
-    model.load_state_dict(new_state_dict)
-  logger.info("Loaded checkpoint '{}' (iteration {})" .format(
-    checkpoint_path, iteration))
-  return model, optimizer, learning_rate, iteration
-
-
-def save_checkpoint(model, optimizer, learning_rate, iteration, checkpoint_path):
-  logger.info("Saving model and optimizer state at iteration {} to {}".format(
-    iteration, checkpoint_path))
-  if hasattr(model, 'module'):
-    state_dict = model.module.state_dict()
-  else:
-    state_dict = model.state_dict()
-  torch.save({'model': state_dict,
-              'iteration': iteration,
-              'optimizer': optimizer.state_dict(),
-              'learning_rate': learning_rate}, checkpoint_path)
-
-
-def summarize(writer, global_step, scalars={}, histograms={}, images={}, audios={}, audio_sampling_rate=22050):
-  for k, v in scalars.items():
-    writer.add_scalar(k, v, global_step)
-  for k, v in histograms.items():
-    writer.add_histogram(k, v, global_step)
-  for k, v in images.items():
-    writer.add_image(k, v, global_step, dataformats='HWC')
-  for k, v in audios.items():
-    writer.add_audio(k, v, global_step, audio_sampling_rate)
-
-
-def latest_checkpoint_path(dir_path, regex="G_*.pth"):
-  f_list = glob.glob(os.path.join(dir_path, regex))
-  f_list.sort(key=lambda f: int("".join(filter(str.isdigit, f))))
-  x = f_list[-1]
-  print(x)
-  return x
-
-
-def plot_spectrogram_to_numpy(spectrogram):
-  global MATPLOTLIB_FLAG
-  if not MATPLOTLIB_FLAG:
-    import matplotlib
-    matplotlib.use("Agg")
-    MATPLOTLIB_FLAG = True
-    mpl_logger = logging.getLogger('matplotlib')
-    mpl_logger.setLevel(logging.WARNING)
-  import matplotlib.pylab as plt
-  import numpy as np
-  
-  fig, ax = plt.subplots(figsize=(10,2))
-  im = ax.imshow(spectrogram, aspect="auto", origin="lower",
-                  interpolation='none')
-  plt.colorbar(im, ax=ax)
-  plt.xlabel("Frames")
-  plt.ylabel("Channels")
-  plt.tight_layout()
-
-  fig.canvas.draw()
-  data = np.fromstring(fig.canvas.tostring_rgb(), dtype=np.uint8, sep='')
-  data = data.reshape(fig.canvas.get_width_height()[::-1] + (3,))
-  plt.close()
-  return data
-
-
-def plot_alignment_to_numpy(alignment, info=None):
-  global MATPLOTLIB_FLAG
-  if not MATPLOTLIB_FLAG:
-    import matplotlib
-    matplotlib.use("Agg")
-    MATPLOTLIB_FLAG = True
-    mpl_logger = logging.getLogger('matplotlib')
-    mpl_logger.setLevel(logging.WARNING)
-  import matplotlib.pylab as plt
-  import numpy as np
-
-  fig, ax = plt.subplots(figsize=(6, 4))
-  im = ax.imshow(alignment.transpose(), aspect='auto', origin='lower',
-                  interpolation='none')
-  fig.colorbar(im, ax=ax)
-  xlabel = 'Decoder timestep'
-  if info is not None:
-      xlabel += '\n\n' + info
-  plt.xlabel(xlabel)
-  plt.ylabel('Encoder timestep')
-  plt.tight_layout()
-
-  fig.canvas.draw()
-  data = np.fromstring(fig.canvas.tostring_rgb(), dtype=np.uint8, sep='')
-  data = data.reshape(fig.canvas.get_width_height()[::-1] + (3,))
-  plt.close()
-  return data
-
-
-def load_wav_to_torch(full_path):
-  sampling_rate, data = read(full_path)
-  return torch.FloatTensor(data.astype(np.float32)), sampling_rate
-
-
-def load_filepaths_and_text(filename, split="|"):
-  with open(filename, encoding='utf-8') as f:
-    filepaths_and_text = [line.strip().split(split) for line in f]
-  return filepaths_and_text
-
-
-def get_hparams(init=True):
-  parser = argparse.ArgumentParser()
-  parser.add_argument('-c', '--config', type=str, default="./configs/base.json",
-                      help='JSON file for configuration')
-  parser.add_argument('-m', '--model', type=str, required=True,
-                      help='Model name')
-  
-  args = parser.parse_args()
-  model_dir = os.path.join("./logs", args.model)
-
-  if not os.path.exists(model_dir):
-    os.makedirs(model_dir)
-
-  config_path = args.config
-  config_save_path = os.path.join(model_dir, "config.json")
-  if init:
-    with open(config_path, "r") as f:
-      data = f.read()
-    with open(config_save_path, "w") as f:
-      f.write(data)
-  else:
-    with open(config_save_path, "r") as f:
-      data = f.read()
-  config = json.loads(data)
-  
-  hparams = HParams(**config)
-  hparams.model_dir = model_dir
-  return hparams
-
-
-def get_hparams_from_dir(model_dir):
-  config_save_path = os.path.join(model_dir, "config.json")
-  with open(config_save_path, "r") as f:
-    data = f.read()
-  config = json.loads(data)
-
-  hparams =HParams(**config)
-  hparams.model_dir = model_dir
-  return hparams
-
-
-def get_hparams_from_file(config_path):
-  with open(config_path, "r") as f:
-    data = f.read()
-  config = json.loads(data)
-
-  hparams =HParams(**config)
-  return hparams
-
-
-def check_git_hash(model_dir):
-  source_dir = os.path.dirname(os.path.realpath(__file__))
-  if not os.path.exists(os.path.join(source_dir, ".git")):
-    logger.warn("{} is not a git repository, therefore hash value comparison will be ignored.".format(
-      source_dir
-    ))
-    return
-
-  cur_hash = subprocess.getoutput("git rev-parse HEAD")
-
-  path = os.path.join(model_dir, "githash")
-  if os.path.exists(path):
-    saved_hash = open(path).read()
-    if saved_hash != cur_hash:
-      logger.warn("git hash values are different. {}(saved) != {}(current)".format(
-        saved_hash[:8], cur_hash[:8]))
-  else:
-    open(path, "w").write(cur_hash)
-
-
-def get_logger(model_dir, filename="train.log"):
-  global logger
-  logger = logging.getLogger(os.path.basename(model_dir))
-  logger.setLevel(logging.DEBUG)
-  
-  formatter = logging.Formatter("%(asctime)s\t%(name)s\t%(levelname)s\t%(message)s")
-  if not os.path.exists(model_dir):
-    os.makedirs(model_dir)
-  h = logging.FileHandler(os.path.join(model_dir, filename))
-  h.setLevel(logging.DEBUG)
-  h.setFormatter(formatter)
-  logger.addHandler(h)
-  return logger
-
-
-class HParams():
-  def __init__(self, **kwargs):
-    for k, v in kwargs.items():
-      if type(v) == dict:
-        v = HParams(**v)
-      self[k] = v
-    
-  def keys(self):
-    return self.__dict__.keys()
-
-  def items(self):
-    return self.__dict__.items()
-
-  def values(self):
-    return self.__dict__.values()
-
-  def __len__(self):
-    return len(self.__dict__)
-
-  def __getitem__(self, key):
-    return getattr(self, key)
-
-  def __setitem__(self, key, value):
-    return setattr(self, key, value)
-
-  def __contains__(self, key):
-    return key in self.__dict__
-
-  def __repr__(self):
-    return self.__dict__.__repr__()
diff --git a/spaces/4Taps/SadTalker/src/face3d/models/arcface_torch/configs/3millions_pfc.py b/spaces/4Taps/SadTalker/src/face3d/models/arcface_torch/configs/3millions_pfc.py
deleted file mode 100644
index 77caafdbb300d8109d5bfdb844f131710ef81f20..0000000000000000000000000000000000000000
--- a/spaces/4Taps/SadTalker/src/face3d/models/arcface_torch/configs/3millions_pfc.py
+++ /dev/null
@@ -1,23 +0,0 @@
-from easydict import EasyDict as edict
-
-# configs for test speed
-
-config = edict()
-config.loss = "arcface"
-config.network = "r50"
-config.resume = False
-config.output = None
-config.embedding_size = 512
-config.sample_rate = 0.1
-config.fp16 = True
-config.momentum = 0.9
-config.weight_decay = 5e-4
-config.batch_size = 128
-config.lr = 0.1  # batch size is 512
-
-config.rec = "synthetic"
-config.num_classes = 300 * 10000
-config.num_epoch = 30
-config.warmup_epoch = -1
-config.decay_epoch = [10, 16, 22]
-config.val_targets = []
diff --git a/spaces/4Taps/SadTalker/src/face3d/models/arcface_torch/utils/utils_os.py b/spaces/4Taps/SadTalker/src/face3d/models/arcface_torch/utils/utils_os.py
deleted file mode 100644
index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000
diff --git a/spaces/AIGC-Audio/AudioGPT/NeuralSeq/data_gen/tts/emotion/inference.py b/spaces/AIGC-Audio/AudioGPT/NeuralSeq/data_gen/tts/emotion/inference.py
deleted file mode 100644
index 0bda414e67e4f2a6e829930c85352a0a41a7f6d9..0000000000000000000000000000000000000000
--- a/spaces/AIGC-Audio/AudioGPT/NeuralSeq/data_gen/tts/emotion/inference.py
+++ /dev/null
@@ -1,177 +0,0 @@
-from data_gen.tts.emotion.params_data import *
-from data_gen.tts.emotion.model import EmotionEncoder
-from data_gen.tts.emotion.audio import preprocess_wav   # We want to expose this function from here
-from matplotlib import cm
-from data_gen.tts.emotion import audio
-from pathlib import Path
-import matplotlib.pyplot as plt
-import numpy as np
-import torch
-
-_model = None # type: EmotionEncoder
-_device = None # type: torch.device
-
-
-def load_model(weights_fpath: Path, device=None):
-    """
-    Loads the model in memory. If this function is not explicitely called, it will be run on the 
-    first call to embed_frames() with the default weights file.
-    
-    :param weights_fpath: the path to saved model weights.
-    :param device: either a torch device or the name of a torch device (e.g. "cpu", "cuda"). The 
-    model will be loaded and will run on this device. Outputs will however always be on the cpu. 
-    If None, will default to your GPU if it"s available, otherwise your CPU.
-    """
-    # TODO: I think the slow loading of the encoder might have something to do with the device it
-    #   was saved on. Worth investigating.
-    global _model, _device
-    if device is None:
-        _device = torch.device("cuda" if torch.cuda.is_available() else "cpu")
-    elif isinstance(device, str):
-        _device = torch.device(device)
-    _model = EmotionEncoder(_device, torch.device("cpu"))
-    checkpoint = torch.load(weights_fpath)
-    _model.load_state_dict(checkpoint["model_state"])
-    _model.eval()
-    print("Loaded encoder trained to step %d" % (checkpoint["step"]))
-    
-    
-def is_loaded():
-    return _model is not None
-
-
-def embed_frames_batch(frames_batch):
-    """
-    Computes embeddings for a batch of mel spectrogram.
-    
-    :param frames_batch: a batch mel of spectrogram as a numpy array of float32 of shape 
-    (batch_size, n_frames, n_channels)
-    :return: the embeddings as a numpy array of float32 of shape (batch_size, model_embedding_size)
-    """
-    if _model is None:
-        raise Exception("Model was not loaded. Call load_model() before inference.")
-    
-    frames = torch.from_numpy(frames_batch).to(_device)
-    embed = _model.inference(frames).detach().cpu().numpy()
-    return embed
-
-
-def compute_partial_slices(n_samples, partial_utterance_n_frames=partials_n_frames,
-                           min_pad_coverage=0.75, overlap=0.5):
-    """
-    Computes where to split an utterance waveform and its corresponding mel spectrogram to obtain 
-    partial utterances of <partial_utterance_n_frames> each. Both the waveform and the mel 
-    spectrogram slices are returned, so as to make each partial utterance waveform correspond to 
-    its spectrogram. This function assumes that the mel spectrogram parameters used are those 
-    defined in params_data.py.
-    
-    The returned ranges may be indexing further than the length of the waveform. It is 
-    recommended that you pad the waveform with zeros up to wave_slices[-1].stop.
-    
-    :param n_samples: the number of samples in the waveform
-    :param partial_utterance_n_frames: the number of mel spectrogram frames in each partial 
-    utterance
-    :param min_pad_coverage: when reaching the last partial utterance, it may or may not have 
-    enough frames. If at least <min_pad_coverage> of <partial_utterance_n_frames> are present, 
-    then the last partial utterance will be considered, as if we padded the audio. Otherwise, 
-    it will be discarded, as if we trimmed the audio. If there aren't enough frames for 1 partial 
-    utterance, this parameter is ignored so that the function always returns at least 1 slice.
-    :param overlap: by how much the partial utterance should overlap. If set to 0, the partial 
-    utterances are entirely disjoint. 
-    :return: the waveform slices and mel spectrogram slices as lists of array slices. Index 
-    respectively the waveform and the mel spectrogram with these slices to obtain the partial 
-    utterances.
-    """
-    assert 0 <= overlap < 1
-    assert 0 < min_pad_coverage <= 1
-    
-    samples_per_frame = int((sampling_rate * mel_window_step / 1000))
-    n_frames = int(np.ceil((n_samples + 1) / samples_per_frame))
-    frame_step = max(int(np.round(partial_utterance_n_frames * (1 - overlap))), 1)
-
-    # Compute the slices
-    wav_slices, mel_slices = [], []
-    steps = max(1, n_frames - partial_utterance_n_frames + frame_step + 1)
-    for i in range(0, steps, frame_step):
-        mel_range = np.array([i, i + partial_utterance_n_frames])
-        wav_range = mel_range * samples_per_frame
-        mel_slices.append(slice(*mel_range))
-        wav_slices.append(slice(*wav_range))
-        
-    # Evaluate whether extra padding is warranted or not
-    last_wav_range = wav_slices[-1]
-    coverage = (n_samples - last_wav_range.start) / (last_wav_range.stop - last_wav_range.start)
-    if coverage < min_pad_coverage and len(mel_slices) > 1:
-        mel_slices = mel_slices[:-1]
-        wav_slices = wav_slices[:-1]
-    
-    return wav_slices, mel_slices
-
-
-def embed_utterance(wav, using_partials=True, return_partials=False, **kwargs):
-    """
-    Computes an embedding for a single utterance.
-    
-    # TODO: handle multiple wavs to benefit from batching on GPU
-    :param wav: a preprocessed (see audio.py) utterance waveform as a numpy array of float32
-    :param using_partials: if True, then the utterance is split in partial utterances of 
-    <partial_utterance_n_frames> frames and the utterance embedding is computed from their 
-    normalized average. If False, the utterance is instead computed from feeding the entire 
-    spectogram to the network.
-    :param return_partials: if True, the partial embeddings will also be returned along with the 
-    wav slices that correspond to the partial embeddings.
-    :param kwargs: additional arguments to compute_partial_splits()
-    :return: the embedding as a numpy array of float32 of shape (model_embedding_size,). If 
-    <return_partials> is True, the partial utterances as a numpy array of float32 of shape 
-    (n_partials, model_embedding_size) and the wav partials as a list of slices will also be 
-    returned. If <using_partials> is simultaneously set to False, both these values will be None 
-    instead.
-    """
-    # Process the entire utterance if not using partials
-    if not using_partials:
-        frames = audio.wav_to_mel_spectrogram(wav)
-        embed = embed_frames_batch(frames[None, ...])[0]
-        if return_partials:
-            return embed, None, None
-        return embed
-    
-    # Compute where to split the utterance into partials and pad if necessary
-    wave_slices, mel_slices = compute_partial_slices(len(wav), **kwargs)
-    max_wave_length = wave_slices[-1].stop
-    if max_wave_length >= len(wav):
-        wav = np.pad(wav, (0, max_wave_length - len(wav)), "constant")
-    
-    # Split the utterance into partials
-    frames = audio.wav_to_mel_spectrogram(wav)
-    frames_batch = np.array([frames[s] for s in mel_slices])
-    partial_embeds = embed_frames_batch(frames_batch)
-    
-    # Compute the utterance embedding from the partial embeddings
-    raw_embed = np.mean(partial_embeds, axis=0)
-    embed = raw_embed / np.linalg.norm(raw_embed, 2)
-    
-    if return_partials:
-        return embed, partial_embeds, wave_slices
-    return embed
-
-
-def embed_speaker(wavs, **kwargs):
-    raise NotImplemented()
-
-
-def plot_embedding_as_heatmap(embed, ax=None, title="", shape=None, color_range=(0, 0.30)):
-    if ax is None:
-        ax = plt.gca()
-    
-    if shape is None:
-        height = int(np.sqrt(len(embed)))
-        shape = (height, -1)
-    embed = embed.reshape(shape)
-    
-    cmap = cm.get_cmap()
-    mappable = ax.imshow(embed, cmap=cmap)
-    cbar = plt.colorbar(mappable, ax=ax, fraction=0.046, pad=0.04)
-    cbar.set_clim(*color_range)
-    
-    ax.set_xticks([]), ax.set_yticks([])
-    ax.set_title(title)
diff --git a/spaces/AIGC-Audio/Make_An_Audio_inpaint/ldm/modules/diffusionmodules/openaimodel.py b/spaces/AIGC-Audio/Make_An_Audio_inpaint/ldm/modules/diffusionmodules/openaimodel.py
deleted file mode 100644
index 0a274d84dfe6ef3e02848861f5b7a7c7e242ca98..0000000000000000000000000000000000000000
--- a/spaces/AIGC-Audio/Make_An_Audio_inpaint/ldm/modules/diffusionmodules/openaimodel.py
+++ /dev/null
@@ -1,963 +0,0 @@
-from abc import abstractmethod
-from functools import partial
-import math
-from typing import Iterable
-
-import numpy as np
-import torch as th
-import torch.nn as nn
-import torch.nn.functional as F
-
-from ldm.modules.diffusionmodules.util import (
-    checkpoint,
-    conv_nd,
-    linear,
-    avg_pool_nd,
-    zero_module,
-    normalization,
-    timestep_embedding,
-)
-from ldm.modules.attention import SpatialTransformer
-
-
-# dummy replace
-def convert_module_to_f16(x):
-    pass
-
-def convert_module_to_f32(x):
-    pass
-
-
-## go
-class AttentionPool2d(nn.Module):
-    """
-    Adapted from CLIP: https://github.com/openai/CLIP/blob/main/clip/model.py
-    """
-
-    def __init__(
-        self,
-        spacial_dim: int,
-        embed_dim: int,
-        num_heads_channels: int,
-        output_dim: int = None,
-    ):
-        super().__init__()
-        self.positional_embedding = nn.Parameter(th.randn(embed_dim, spacial_dim ** 2 + 1) / embed_dim ** 0.5)
-        self.qkv_proj = conv_nd(1, embed_dim, 3 * embed_dim, 1)
-        self.c_proj = conv_nd(1, embed_dim, output_dim or embed_dim, 1)
-        self.num_heads = embed_dim // num_heads_channels
-        self.attention = QKVAttention(self.num_heads)
-
-    def forward(self, x):
-        b, c, *_spatial = x.shape
-        x = x.reshape(b, c, -1)  # NC(HW)
-        x = th.cat([x.mean(dim=-1, keepdim=True), x], dim=-1)  # NC(HW+1)
-        x = x + self.positional_embedding[None, :, :].to(x.dtype)  # NC(HW+1)
-        x = self.qkv_proj(x)
-        x = self.attention(x)
-        x = self.c_proj(x)
-        return x[:, :, 0]
-
-
-class TimestepBlock(nn.Module):
-    """
-    Any module where forward() takes timestep embeddings as a second argument.
-    """
-
-    @abstractmethod
-    def forward(self, x, emb):
-        """
-        Apply the module to `x` given `emb` timestep embeddings.
-        """
-
-
-class TimestepEmbedSequential(nn.Sequential, TimestepBlock):
-    """
-    A sequential module that passes timestep embeddings to the children that
-    support it as an extra input.
-    """
-
-    def forward(self, x, emb, context=None):
-        for layer in self:
-            if isinstance(layer, TimestepBlock):
-                x = layer(x, emb)
-            elif isinstance(layer, SpatialTransformer):
-                x = layer(x, context)
-            else:
-                x = layer(x)
-        return x
-
-
-class Upsample(nn.Module):
-    """
-    An upsampling layer with an optional convolution.
-    :param channels: channels in the inputs and outputs.
-    :param use_conv: a bool determining if a convolution is applied.
-    :param dims: determines if the signal is 1D, 2D, or 3D. If 3D, then
-                 upsampling occurs in the inner-two dimensions.
-    """
-
-    def __init__(self, channels, use_conv, dims=2, out_channels=None, padding=1):
-        super().__init__()
-        self.channels = channels
-        self.out_channels = out_channels or channels
-        self.use_conv = use_conv
-        self.dims = dims
-        if use_conv:
-            self.conv = conv_nd(dims, self.channels, self.out_channels, 3, padding=padding)
-
-    def forward(self, x):
-        assert x.shape[1] == self.channels
-        if self.dims == 3:
-            x = F.interpolate(
-                x, (x.shape[2], x.shape[3] * 2, x.shape[4] * 2), mode="nearest"
-            )
-        else:
-            x = F.interpolate(x, scale_factor=2, mode="nearest")
-        if self.use_conv:
-            x = self.conv(x)
-        return x
-
-class TransposedUpsample(nn.Module):
-    'Learned 2x upsampling without padding'
-    def __init__(self, channels, out_channels=None, ks=5):
-        super().__init__()
-        self.channels = channels
-        self.out_channels = out_channels or channels
-
-        self.up = nn.ConvTranspose2d(self.channels,self.out_channels,kernel_size=ks,stride=2)
-
-    def forward(self,x):
-        return self.up(x)
-
-
-class Downsample(nn.Module):
-    """
-    A downsampling layer with an optional convolution.
-    :param channels: channels in the inputs and outputs.
-    :param use_conv: a bool determining if a convolution is applied.
-    :param dims: determines if the signal is 1D, 2D, or 3D. If 3D, then
-                 downsampling occurs in the inner-two dimensions.
-    """
-
-    def __init__(self, channels, use_conv, dims=2, out_channels=None,padding=1):
-        super().__init__()
-        self.channels = channels
-        self.out_channels = out_channels or channels
-        self.use_conv = use_conv
-        self.dims = dims
-        stride = 2 if dims != 3 else (1, 2, 2)
-        if use_conv:
-            self.op = conv_nd(
-                dims, self.channels, self.out_channels, 3, stride=stride, padding=padding
-            )
-        else:
-            assert self.channels == self.out_channels
-            self.op = avg_pool_nd(dims, kernel_size=stride, stride=stride)
-
-    def forward(self, x):
-        assert x.shape[1] == self.channels
-        return self.op(x)
-
-
-class ResBlock(TimestepBlock):
-    """
-    A residual block that can optionally change the number of channels.
-    :param channels: the number of input channels.
-    :param emb_channels: the number of timestep embedding channels.
-    :param dropout: the rate of dropout.
-    :param out_channels: if specified, the number of out channels.
-    :param use_conv: if True and out_channels is specified, use a spatial
-        convolution instead of a smaller 1x1 convolution to change the
-        channels in the skip connection.
-    :param dims: determines if the signal is 1D, 2D, or 3D.
-    :param use_checkpoint: if True, use gradient checkpointing on this module.
-    :param up: if True, use this block for upsampling.
-    :param down: if True, use this block for downsampling.
-    """
-
-    def __init__(
-        self,
-        channels,
-        emb_channels,
-        dropout,
-        out_channels=None,
-        use_conv=False,
-        use_scale_shift_norm=False,
-        dims=2,
-        use_checkpoint=False,
-        up=False,
-        down=False,
-    ):
-        super().__init__()
-        self.channels = channels
-        self.emb_channels = emb_channels
-        self.dropout = dropout
-        self.out_channels = out_channels or channels
-        self.use_conv = use_conv
-        self.use_checkpoint = use_checkpoint
-        self.use_scale_shift_norm = use_scale_shift_norm
-
-        self.in_layers = nn.Sequential(
-            normalization(channels),
-            nn.SiLU(),
-            conv_nd(dims, channels, self.out_channels, 3, padding=1),
-        )
-
-        self.updown = up or down
-
-        if up:
-            self.h_upd = Upsample(channels, False, dims)
-            self.x_upd = Upsample(channels, False, dims)
-        elif down:
-            self.h_upd = Downsample(channels, False, dims)
-            self.x_upd = Downsample(channels, False, dims)
-        else:
-            self.h_upd = self.x_upd = nn.Identity()
-
-        self.emb_layers = nn.Sequential(
-            nn.SiLU(),
-            linear(
-                emb_channels,
-                2 * self.out_channels if use_scale_shift_norm else self.out_channels,
-            ),
-        )
-        self.out_layers = nn.Sequential(
-            normalization(self.out_channels),
-            nn.SiLU(),
-            nn.Dropout(p=dropout),
-            zero_module(
-                conv_nd(dims, self.out_channels, self.out_channels, 3, padding=1)
-            ),
-        )
-
-        if self.out_channels == channels:
-            self.skip_connection = nn.Identity()
-        elif use_conv:
-            self.skip_connection = conv_nd(
-                dims, channels, self.out_channels, 3, padding=1
-            )
-        else:
-            self.skip_connection = conv_nd(dims, channels, self.out_channels, 1)
-
-    def forward(self, x, emb):
-        """
-        Apply the block to a Tensor, conditioned on a timestep embedding.
-        :param x: an [N x C x ...] Tensor of features.
-        :param emb: an [N x emb_channels] Tensor of timestep embeddings.
-        :return: an [N x C x ...] Tensor of outputs.
-        """
-        return checkpoint(
-            self._forward, (x, emb), self.parameters(), self.use_checkpoint
-        )
-
-
-    def _forward(self, x, emb):
-        if self.updown:
-            in_rest, in_conv = self.in_layers[:-1], self.in_layers[-1]
-            h = in_rest(x)
-            h = self.h_upd(h)
-            x = self.x_upd(x)
-            h = in_conv(h)
-        else:
-            h = self.in_layers(x)
-        emb_out = self.emb_layers(emb).type(h.dtype)
-        while len(emb_out.shape) < len(h.shape):
-            emb_out = emb_out[..., None]
-        if self.use_scale_shift_norm:
-            out_norm, out_rest = self.out_layers[0], self.out_layers[1:]
-            scale, shift = th.chunk(emb_out, 2, dim=1)
-            h = out_norm(h) * (1 + scale) + shift
-            h = out_rest(h)
-        else:
-            h = h + emb_out
-            h = self.out_layers(h)
-        return self.skip_connection(x) + h
-
-
-class AttentionBlock(nn.Module):
-    """
-    An attention block that allows spatial positions to attend to each other.
-    Originally ported from here, but adapted to the N-d case.
-    https://github.com/hojonathanho/diffusion/blob/1e0dceb3b3495bbe19116a5e1b3596cd0706c543/diffusion_tf/models/unet.py#L66.
-    """
-
-    def __init__(
-        self,
-        channels,
-        num_heads=1,
-        num_head_channels=-1,
-        use_checkpoint=False,
-        use_new_attention_order=False,
-    ):
-        super().__init__()
-        self.channels = channels
-        if num_head_channels == -1:
-            self.num_heads = num_heads
-        else:
-            assert (
-                channels % num_head_channels == 0
-            ), f"q,k,v channels {channels} is not divisible by num_head_channels {num_head_channels}"
-            self.num_heads = channels // num_head_channels
-        self.use_checkpoint = use_checkpoint
-        self.norm = normalization(channels)
-        self.qkv = conv_nd(1, channels, channels * 3, 1)
-        if use_new_attention_order:
-            # split qkv before split heads
-            self.attention = QKVAttention(self.num_heads)
-        else:
-            # split heads before split qkv
-            self.attention = QKVAttentionLegacy(self.num_heads)
-
-        self.proj_out = zero_module(conv_nd(1, channels, channels, 1))
-
-    def forward(self, x):
-        return checkpoint(self._forward, (x,), self.parameters(), True)   # TODO: check checkpoint usage, is True # TODO: fix the .half call!!!
-        #return pt_checkpoint(self._forward, x)  # pytorch
-
-    def _forward(self, x):
-        b, c, *spatial = x.shape
-        x = x.reshape(b, c, -1)
-        qkv = self.qkv(self.norm(x))
-        h = self.attention(qkv)
-        h = self.proj_out(h)
-        return (x + h).reshape(b, c, *spatial)
-
-
-def count_flops_attn(model, _x, y):
-    """
-    A counter for the `thop` package to count the operations in an
-    attention operation.
-    Meant to be used like:
-        macs, params = thop.profile(
-            model,
-            inputs=(inputs, timestamps),
-            custom_ops={QKVAttention: QKVAttention.count_flops},
-        )
-    """
-    b, c, *spatial = y[0].shape
-    num_spatial = int(np.prod(spatial))
-    # We perform two matmuls with the same number of ops.
-    # The first computes the weight matrix, the second computes
-    # the combination of the value vectors.
-    matmul_ops = 2 * b * (num_spatial ** 2) * c
-    model.total_ops += th.DoubleTensor([matmul_ops])
-
-
-class QKVAttentionLegacy(nn.Module):
-    """
-    A module which performs QKV attention. Matches legacy QKVAttention + input/ouput heads shaping
-    """
-
-    def __init__(self, n_heads):
-        super().__init__()
-        self.n_heads = n_heads
-
-    def forward(self, qkv):
-        """
-        Apply QKV attention.
-        :param qkv: an [N x (H * 3 * C) x T] tensor of Qs, Ks, and Vs.
-        :return: an [N x (H * C) x T] tensor after attention.
-        """
-        bs, width, length = qkv.shape
-        assert width % (3 * self.n_heads) == 0
-        ch = width // (3 * self.n_heads)
-        q, k, v = qkv.reshape(bs * self.n_heads, ch * 3, length).split(ch, dim=1)
-        scale = 1 / math.sqrt(math.sqrt(ch))
-        weight = th.einsum(
-            "bct,bcs->bts", q * scale, k * scale
-        )  # More stable with f16 than dividing afterwards
-        weight = th.softmax(weight.float(), dim=-1).type(weight.dtype)
-        a = th.einsum("bts,bcs->bct", weight, v)
-        return a.reshape(bs, -1, length)
-
-    @staticmethod
-    def count_flops(model, _x, y):
-        return count_flops_attn(model, _x, y)
-
-
-class QKVAttention(nn.Module):
-    """
-    A module which performs QKV attention and splits in a different order.
-    """
-
-    def __init__(self, n_heads):
-        super().__init__()
-        self.n_heads = n_heads
-
-    def forward(self, qkv):
-        """
-        Apply QKV attention.
-        :param qkv: an [N x (3 * H * C) x T] tensor of Qs, Ks, and Vs.
-        :return: an [N x (H * C) x T] tensor after attention.
-        """
-        bs, width, length = qkv.shape
-        assert width % (3 * self.n_heads) == 0
-        ch = width // (3 * self.n_heads)
-        q, k, v = qkv.chunk(3, dim=1)
-        scale = 1 / math.sqrt(math.sqrt(ch))
-        weight = th.einsum(
-            "bct,bcs->bts",
-            (q * scale).view(bs * self.n_heads, ch, length),
-            (k * scale).view(bs * self.n_heads, ch, length),
-        )  # More stable with f16 than dividing afterwards
-        weight = th.softmax(weight.float(), dim=-1).type(weight.dtype)
-        a = th.einsum("bts,bcs->bct", weight, v.reshape(bs * self.n_heads, ch, length))
-        return a.reshape(bs, -1, length)
-
-    @staticmethod
-    def count_flops(model, _x, y):
-        return count_flops_attn(model, _x, y)
-
-
-class UNetModel(nn.Module):
-    """
-    The full UNet model with attention and timestep embedding.
-    :param in_channels: channels in the input Tensor.
-    :param model_channels: base channel count for the model.
-    :param out_channels: channels in the output Tensor.
-    :param num_res_blocks: number of residual blocks per downsample.
-    :param attention_resolutions: a collection of downsample rates at which
-        attention will take place. May be a set, list, or tuple.
-        For example, if this contains 4, then at 4x downsampling, attention
-        will be used.
-    :param dropout: the dropout probability.
-    :param channel_mult: channel multiplier for each level of the UNet.
-    :param conv_resample: if True, use learned convolutions for upsampling and
-        downsampling.
-    :param dims: determines if the signal is 1D, 2D, or 3D.
-    :param num_classes: if specified (as an int), then this model will be
-        class-conditional with `num_classes` classes.
-    :param use_checkpoint: use gradient checkpointing to reduce memory usage.
-    :param num_heads: the number of attention heads in each attention layer.
-    :param num_heads_channels: if specified, ignore num_heads and instead use
-                               a fixed channel width per attention head.
-    :param num_heads_upsample: works with num_heads to set a different number
-                               of heads for upsampling. Deprecated.
-    :param use_scale_shift_norm: use a FiLM-like conditioning mechanism.
-    :param resblock_updown: use residual blocks for up/downsampling.
-    :param use_new_attention_order: use a different attention pattern for potentially
-                                    increased efficiency.
-    """
-
-    def __init__(
-        self,
-        image_size,
-        in_channels,
-        model_channels,
-        out_channels,
-        num_res_blocks,
-        attention_resolutions,
-        dropout=0,
-        channel_mult=(1, 2, 4, 8),
-        conv_resample=True,
-        dims=2,
-        num_classes=None,
-        use_checkpoint=False,
-        use_fp16=False,
-        num_heads=-1,
-        num_head_channels=-1,
-        num_heads_upsample=-1,
-        use_scale_shift_norm=False,
-        resblock_updown=False,
-        use_new_attention_order=False,
-        use_spatial_transformer=False,    # custom transformer support
-        transformer_depth=1,              # custom transformer support
-        context_dim=None,                 # custom transformer support
-        n_embed=None,                     # custom support for prediction of discrete ids into codebook of first stage vq model
-        legacy=True,
-    ):
-        super().__init__()
-        if use_spatial_transformer:
-            assert context_dim is not None, 'Fool!! You forgot to include the dimension of your cross-attention conditioning...'
-
-        if context_dim is not None:
-            assert use_spatial_transformer, 'Fool!! You forgot to use the spatial transformer for your cross-attention conditioning...'
-            from omegaconf.listconfig import ListConfig
-            if type(context_dim) == ListConfig:
-                context_dim = list(context_dim)
-
-        if num_heads_upsample == -1:
-            num_heads_upsample = num_heads
-
-        if num_heads == -1:
-            assert num_head_channels != -1, 'Either num_heads or num_head_channels has to be set'
-
-        if num_head_channels == -1:
-            assert num_heads != -1, 'Either num_heads or num_head_channels has to be set'
-
-        self.image_size = image_size
-        self.in_channels = in_channels
-        self.model_channels = model_channels
-        self.out_channels = out_channels
-        self.num_res_blocks = num_res_blocks
-        self.attention_resolutions = attention_resolutions
-        self.dropout = dropout
-        self.channel_mult = channel_mult
-        self.conv_resample = conv_resample
-        self.num_classes = num_classes
-        self.use_checkpoint = use_checkpoint
-        self.dtype = th.float16 if use_fp16 else th.float32
-        self.num_heads = num_heads
-        self.num_head_channels = num_head_channels
-        self.num_heads_upsample = num_heads_upsample
-        self.predict_codebook_ids = n_embed is not None
-
-        time_embed_dim = model_channels * 4
-        self.time_embed = nn.Sequential(
-            linear(model_channels, time_embed_dim),
-            nn.SiLU(),
-            linear(time_embed_dim, time_embed_dim),
-        )
-
-        if self.num_classes is not None:
-            self.label_emb = nn.Embedding(num_classes, time_embed_dim)
-
-        self.input_blocks = nn.ModuleList(
-            [
-                TimestepEmbedSequential(
-                    conv_nd(dims, in_channels, model_channels, 3, padding=1)# conv2d for txt2img/audio
-                )
-            ]
-        )
-        self._feature_size = model_channels
-        input_block_chans = [model_channels]
-        ch = model_channels
-        ds = 1
-        # downsample blocks
-        for level, mult in enumerate(channel_mult):
-            for _ in range(num_res_blocks):
-                layers = [
-                    ResBlock(
-                        ch,
-                        time_embed_dim,
-                        dropout,
-                        out_channels=mult * model_channels,
-                        dims=dims,
-                        use_checkpoint=use_checkpoint,
-                        use_scale_shift_norm=use_scale_shift_norm,
-                    )
-                ]
-                ch = mult * model_channels
-                if ds in attention_resolutions:
-                    if num_head_channels == -1:
-                        dim_head = ch // num_heads
-                    else:
-                        num_heads = ch // num_head_channels
-                        dim_head = num_head_channels
-                    if legacy:
-                        #num_heads = 1
-                        dim_head = ch // num_heads if use_spatial_transformer else num_head_channels
-                    layers.append(
-                        AttentionBlock(
-                            ch,
-                            use_checkpoint=use_checkpoint,
-                            num_heads=num_heads,
-                            num_head_channels=dim_head,
-                            use_new_attention_order=use_new_attention_order,
-                        ) if not use_spatial_transformer else SpatialTransformer(# transformer_depth is 1
-                            ch, num_heads, dim_head, depth=transformer_depth, context_dim=context_dim
-                        )
-                    )
-                self.input_blocks.append(TimestepEmbedSequential(*layers))
-                self._feature_size += ch
-                input_block_chans.append(ch)
-            if level != len(channel_mult) - 1:
-                out_ch = ch
-                self.input_blocks.append(
-                    TimestepEmbedSequential(
-                        ResBlock(
-                            ch,
-                            time_embed_dim,
-                            dropout,
-                            out_channels=out_ch,
-                            dims=dims,
-                            use_checkpoint=use_checkpoint,
-                            use_scale_shift_norm=use_scale_shift_norm,
-                            down=True,
-                        )
-                        if resblock_updown
-                        else Downsample(
-                            ch, conv_resample, dims=dims, out_channels=out_ch
-                        )
-                    )
-                )
-                ch = out_ch
-                input_block_chans.append(ch)
-                ds *= 2
-                self._feature_size += ch
-
-        if num_head_channels == -1:
-            dim_head = ch // num_heads
-        else:
-            num_heads = ch // num_head_channels
-            dim_head = num_head_channels
-        if legacy:
-            #num_heads = 1
-            dim_head = ch // num_heads if use_spatial_transformer else num_head_channels
-        self.middle_block = TimestepEmbedSequential(
-            ResBlock(
-                ch,
-                time_embed_dim,
-                dropout,
-                dims=dims,
-                use_checkpoint=use_checkpoint,
-                use_scale_shift_norm=use_scale_shift_norm,
-            ),
-            AttentionBlock(
-                ch,
-                use_checkpoint=use_checkpoint,
-                num_heads=num_heads,
-                num_head_channels=dim_head,
-                use_new_attention_order=use_new_attention_order,
-            ) if not use_spatial_transformer else SpatialTransformer(
-                            ch, num_heads, dim_head, depth=transformer_depth, context_dim=context_dim
-                        ),
-            ResBlock(
-                ch,
-                time_embed_dim,
-                dropout,
-                dims=dims,
-                use_checkpoint=use_checkpoint,
-                use_scale_shift_norm=use_scale_shift_norm,
-            ),
-        )
-        self._feature_size += ch
-        # upsample blocks
-        self.output_blocks = nn.ModuleList([])
-        for level, mult in list(enumerate(channel_mult))[::-1]:
-            for i in range(num_res_blocks + 1):
-                ich = input_block_chans.pop()
-                layers = [
-                    ResBlock(
-                        ch + ich,
-                        time_embed_dim,
-                        dropout,
-                        out_channels=model_channels * mult,
-                        dims=dims,
-                        use_checkpoint=use_checkpoint,
-                        use_scale_shift_norm=use_scale_shift_norm,
-                    )
-                ]
-                ch = model_channels * mult
-                if ds in attention_resolutions:
-                    if num_head_channels == -1:
-                        dim_head = ch // num_heads
-                    else:
-                        num_heads = ch // num_head_channels
-                        dim_head = num_head_channels
-                    if legacy:
-                        #num_heads = 1
-                        dim_head = ch // num_heads if use_spatial_transformer else num_head_channels
-                    layers.append(
-                        AttentionBlock(
-                            ch,
-                            use_checkpoint=use_checkpoint,
-                            num_heads=num_heads_upsample,
-                            num_head_channels=dim_head,
-                            use_new_attention_order=use_new_attention_order,
-                        ) if not use_spatial_transformer else SpatialTransformer(
-                            ch, num_heads, dim_head, depth=transformer_depth, context_dim=context_dim
-                        )
-                    )
-                if level and i == num_res_blocks:
-                    out_ch = ch
-                    layers.append(
-                        ResBlock(
-                            ch,
-                            time_embed_dim,
-                            dropout,
-                            out_channels=out_ch,
-                            dims=dims,
-                            use_checkpoint=use_checkpoint,
-                            use_scale_shift_norm=use_scale_shift_norm,
-                            up=True,
-                        )
-                        if resblock_updown
-                        else Upsample(ch, conv_resample, dims=dims, out_channels=out_ch)
-                    )
-                    ds //= 2
-                self.output_blocks.append(TimestepEmbedSequential(*layers))
-                self._feature_size += ch
-
-        self.out = nn.Sequential(
-            normalization(ch),
-            nn.SiLU(),
-            zero_module(conv_nd(dims, model_channels, out_channels, 3, padding=1)),
-        )
-        if self.predict_codebook_ids:
-            self.id_predictor = nn.Sequential(
-            normalization(ch),
-            conv_nd(dims, model_channels, n_embed, 1),
-            #nn.LogSoftmax(dim=1)  # change to cross_entropy and produce non-normalized logits
-        )
-
-    def convert_to_fp16(self):
-        """
-        Convert the torso of the model to float16.
-        """
-        self.input_blocks.apply(convert_module_to_f16)
-        self.middle_block.apply(convert_module_to_f16)
-        self.output_blocks.apply(convert_module_to_f16)
-
-    def convert_to_fp32(self):
-        """
-        Convert the torso of the model to float32.
-        """
-        self.input_blocks.apply(convert_module_to_f32)
-        self.middle_block.apply(convert_module_to_f32)
-        self.output_blocks.apply(convert_module_to_f32)
-
-    def forward(self, x, timesteps=None, context=None, y=None,**kwargs):
-        """
-        Apply the model to an input batch.
-        :param x: an [N x C x ...] Tensor of inputs.
-        :param timesteps: a 1-D batch of timesteps,shape [N]
-        :param context: conditioning plugged in via crossattn. for txt2img shape is [N,77,context_dim]
-        :param y: an [N] Tensor of labels, if class-conditional.
-        :return: an [N x C x ...] Tensor of outputs.
-        """
-        # print(f"in unet {x.shape}")
-        assert (y is not None) == (
-            self.num_classes is not None
-        ), "must specify y if and only if the model is class-conditional"
-        hs = []
-        t_emb = timestep_embedding(timesteps, self.model_channels, repeat_only=False)# shape [N,self.model_channels]
-        emb = self.time_embed(t_emb)# shape [N,context_dim]
-
-        if self.num_classes is not None:# only for class label
-            assert y.shape == (x.shape[0],)
-            emb = emb + self.label_emb(y)
-
-        h = x.type(self.dtype)# [N,C,10,106]
-        for module in self.input_blocks:
-            h = module(h, emb, context)# 0:[N,self.model_channels,10,106],1:[N,self.model_channels,10,106],2:[N,self.model_channels,10,106] 3:[N,self.model_channels,5,53] 4:[N,self.model_channels,5,53] 5:[N,self.model_channels*2,5,53]
-            hs.append(h)
-        h = self.middle_block(h, emb, context)# no shape change
-        for module in self.output_blocks:
-            h = th.cat([h, hs.pop()], dim=1)# 在这里c维度乘2或+self.model_channels，其余维度不变
-            h = module(h, emb, context)# 在这里c维度/2回到之前维度，h,w不变或*2
-        h = h.type(x.dtype)# 至此h维度和输入x维度回到相同状态
-        if self.predict_codebook_ids:
-            return self.id_predictor(h)
-        else:
-            return self.out(h)
-
-
-class EncoderUNetModel(nn.Module):
-    """
-    The half UNet model with attention and timestep embedding.
-    For usage, see UNet.
-    """
-
-    def __init__(
-        self,
-        image_size,
-        in_channels,
-        model_channels,
-        out_channels,
-        num_res_blocks,
-        attention_resolutions,
-        dropout=0,
-        channel_mult=(1, 2, 4, 8),
-        conv_resample=True,
-        dims=2,
-        use_checkpoint=False,
-        use_fp16=False,
-        num_heads=1,
-        num_head_channels=-1,
-        num_heads_upsample=-1,
-        use_scale_shift_norm=False,
-        resblock_updown=False,
-        use_new_attention_order=False,
-        pool="adaptive",
-        *args,
-        **kwargs
-    ):
-        super().__init__()
-
-        if num_heads_upsample == -1:
-            num_heads_upsample = num_heads
-
-        self.in_channels = in_channels
-        self.model_channels = model_channels
-        self.out_channels = out_channels
-        self.num_res_blocks = num_res_blocks
-        self.attention_resolutions = attention_resolutions
-        self.dropout = dropout
-        self.channel_mult = channel_mult
-        self.conv_resample = conv_resample
-        self.use_checkpoint = use_checkpoint
-        self.dtype = th.float16 if use_fp16 else th.float32
-        self.num_heads = num_heads
-        self.num_head_channels = num_head_channels
-        self.num_heads_upsample = num_heads_upsample
-
-        time_embed_dim = model_channels * 4
-        self.time_embed = nn.Sequential(
-            linear(model_channels, time_embed_dim),
-            nn.SiLU(),
-            linear(time_embed_dim, time_embed_dim),
-        )
-
-        self.input_blocks = nn.ModuleList(
-            [
-                TimestepEmbedSequential(
-                    conv_nd(dims, in_channels, model_channels, 3, padding=1)
-                )
-            ]
-        )
-        self._feature_size = model_channels
-        input_block_chans = [model_channels]
-        ch = model_channels
-        ds = 1
-        for level, mult in enumerate(channel_mult):
-            for _ in range(num_res_blocks):
-                layers = [
-                    ResBlock(
-                        ch,
-                        time_embed_dim,
-                        dropout,
-                        out_channels=mult * model_channels,
-                        dims=dims,
-                        use_checkpoint=use_checkpoint,
-                        use_scale_shift_norm=use_scale_shift_norm,
-                    )
-                ]
-                ch = mult * model_channels
-                if ds in attention_resolutions:
-                    layers.append(
-                        AttentionBlock(
-                            ch,
-                            use_checkpoint=use_checkpoint,
-                            num_heads=num_heads,
-                            num_head_channels=num_head_channels,
-                            use_new_attention_order=use_new_attention_order,
-                        )
-                    )
-                self.input_blocks.append(TimestepEmbedSequential(*layers))
-                self._feature_size += ch
-                input_block_chans.append(ch)
-            if level != len(channel_mult) - 1:
-                out_ch = ch
-                self.input_blocks.append(
-                    TimestepEmbedSequential(
-                        ResBlock(
-                            ch,
-                            time_embed_dim,
-                            dropout,
-                            out_channels=out_ch,
-                            dims=dims,
-                            use_checkpoint=use_checkpoint,
-                            use_scale_shift_norm=use_scale_shift_norm,
-                            down=True,
-                        )
-                        if resblock_updown
-                        else Downsample(
-                            ch, conv_resample, dims=dims, out_channels=out_ch
-                        )
-                    )
-                )
-                ch = out_ch
-                input_block_chans.append(ch)
-                ds *= 2
-                self._feature_size += ch
-
-        self.middle_block = TimestepEmbedSequential(
-            ResBlock(
-                ch,
-                time_embed_dim,
-                dropout,
-                dims=dims,
-                use_checkpoint=use_checkpoint,
-                use_scale_shift_norm=use_scale_shift_norm,
-            ),
-            AttentionBlock(
-                ch,
-                use_checkpoint=use_checkpoint,
-                num_heads=num_heads,
-                num_head_channels=num_head_channels,
-                use_new_attention_order=use_new_attention_order,
-            ),
-            ResBlock(
-                ch,
-                time_embed_dim,
-                dropout,
-                dims=dims,
-                use_checkpoint=use_checkpoint,
-                use_scale_shift_norm=use_scale_shift_norm,
-            ),
-        )
-        self._feature_size += ch
-        self.pool = pool
-        if pool == "adaptive":
-            self.out = nn.Sequential(
-                normalization(ch),
-                nn.SiLU(),
-                nn.AdaptiveAvgPool2d((1, 1)),
-                zero_module(conv_nd(dims, ch, out_channels, 1)),
-                nn.Flatten(),
-            )
-        elif pool == "attention":
-            assert num_head_channels != -1
-            self.out = nn.Sequential(
-                normalization(ch),
-                nn.SiLU(),
-                AttentionPool2d(
-                    (image_size // ds), ch, num_head_channels, out_channels
-                ),
-            )
-        elif pool == "spatial":
-            self.out = nn.Sequential(
-                nn.Linear(self._feature_size, 2048),
-                nn.ReLU(),
-                nn.Linear(2048, self.out_channels),
-            )
-        elif pool == "spatial_v2":
-            self.out = nn.Sequential(
-                nn.Linear(self._feature_size, 2048),
-                normalization(2048),
-                nn.SiLU(),
-                nn.Linear(2048, self.out_channels),
-            )
-        else:
-            raise NotImplementedError(f"Unexpected {pool} pooling")
-
-    def convert_to_fp16(self):
-        """
-        Convert the torso of the model to float16.
-        """
-        self.input_blocks.apply(convert_module_to_f16)
-        self.middle_block.apply(convert_module_to_f16)
-
-    def convert_to_fp32(self):
-        """
-        Convert the torso of the model to float32.
-        """
-        self.input_blocks.apply(convert_module_to_f32)
-        self.middle_block.apply(convert_module_to_f32)
-
-    def forward(self, x, timesteps):
-        """
-        Apply the model to an input batch.
-        :param x: an [N x C x ...] Tensor of inputs.
-        :param timesteps: a 1-D batch of timesteps.
-        :return: an [N x K] Tensor of outputs.
-        """
-        emb = self.time_embed(timestep_embedding(timesteps, self.model_channels))
-
-        results = []
-        h = x.type(self.dtype)
-        for module in self.input_blocks:
-            h = module(h, emb)
-            if self.pool.startswith("spatial"):
-                results.append(h.type(x.dtype).mean(dim=(2, 3)))
-        h = self.middle_block(h, emb)
-        if self.pool.startswith("spatial"):
-            results.append(h.type(x.dtype).mean(dim=(2, 3)))
-            h = th.cat(results, axis=-1)
-            return self.out(h)
-        else:
-            h = h.type(x.dtype)
-            return self.out(h)
-
diff --git a/spaces/AILab-CVC/EvalCrafter/test.py b/spaces/AILab-CVC/EvalCrafter/test.py
deleted file mode 100644
index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000
diff --git a/spaces/AchyuthGamer/OpenGPT/g4f/Provider/AiService.py b/spaces/AchyuthGamer/OpenGPT/g4f/Provider/AiService.py
deleted file mode 100644
index 2b5a6e7de3912f7588377a881b7d5523e35d7212..0000000000000000000000000000000000000000
--- a/spaces/AchyuthGamer/OpenGPT/g4f/Provider/AiService.py
+++ /dev/null
@@ -1,36 +0,0 @@
-from __future__ import annotations
-
-import requests
-
-from ..typing import Any, CreateResult
-from .base_provider import BaseProvider
-
-
-class AiService(BaseProvider):
-    url = "https://aiservice.vercel.app/"
-    working = False
-    supports_gpt_35_turbo = True
-
-    @staticmethod
-    def create_completion(
-        model: str,
-        messages: list[dict[str, str]],
-        stream: bool,
-        **kwargs: Any,
-    ) -> CreateResult:
-        base = "\n".join(f"{message['role']}: {message['content']}" for message in messages)
-        base += "\nassistant: "
-
-        headers = {
-            "accept": "*/*",
-            "content-type": "text/plain;charset=UTF-8",
-            "sec-fetch-dest": "empty",
-            "sec-fetch-mode": "cors",
-            "sec-fetch-site": "same-origin",
-            "Referer": "https://aiservice.vercel.app/chat",
-        }
-        data = {"input": base}
-        url = "https://aiservice.vercel.app/api/chat/answer"
-        response = requests.post(url, headers=headers, json=data)
-        response.raise_for_status()
-        yield response.json()["data"]
diff --git a/spaces/AchyuthGamer/OpenGPT/g4f/Provider/Bing.py b/spaces/AchyuthGamer/OpenGPT/g4f/Provider/Bing.py
deleted file mode 100644
index f4275a5f54d23bedf2392aad143058c6245bbb00..0000000000000000000000000000000000000000
--- a/spaces/AchyuthGamer/OpenGPT/g4f/Provider/Bing.py
+++ /dev/null
@@ -1,300 +0,0 @@
-from __future__ import annotations
-
-import random
-import uuid
-import json
-import os
-import uuid
-import urllib.parse
-from aiohttp        import ClientSession, ClientTimeout
-from ..typing       import AsyncGenerator
-from .base_provider import AsyncGeneratorProvider
-
-class Tones():
-    creative = "Creative"
-    balanced = "Balanced"
-    precise = "Precise"
-
-default_cookies = {
-    'SRCHD'         : 'AF=NOFORM',
-    'PPLState'      : '1',
-    'KievRPSSecAuth': '',
-    'SUID'          : '',
-    'SRCHUSR'       : '',
-    'SRCHHPGUSR'    : '',
-}
-
-class Bing(AsyncGeneratorProvider):
-    url             = "https://bing.com/chat"
-    working         = True
-    supports_gpt_4  = True
-        
-    @staticmethod
-    def create_async_generator(
-        model: str,
-        messages: list[dict[str, str]],
-        cookies: dict = None,
-        tone: str = Tones.creative,
-        **kwargs
-    ) -> AsyncGenerator:
-        if len(messages) < 2:
-            prompt = messages[0]["content"]
-            context = None
-        else:
-            prompt = messages[-1]["content"]
-            context = create_context(messages[:-1])
-        
-        if not cookies or "SRCHD" not in cookies:
-            cookies = default_cookies
-        return stream_generate(prompt, tone, context, cookies)
-
-def create_context(messages: list[dict[str, str]]):
-    context = "".join(f"[{message['role']}](#message)\n{message['content']}\n\n" for message in messages)
-
-    return context
-
-class Conversation():
-    def __init__(self, conversationId: str, clientId: str, conversationSignature: str) -> None:
-        self.conversationId = conversationId
-        self.clientId = clientId
-        self.conversationSignature = conversationSignature
-
-async def create_conversation(session: ClientSession) -> Conversation:
-    url = 'https://www.bing.com/turing/conversation/create?bundleVersion=1.1150.3'
-    
-    async with await session.get(url) as response:
-        data = await response.json()
-        
-        conversationId = data.get('conversationId')
-        clientId = data.get('clientId')
-        conversationSignature = response.headers.get('X-Sydney-Encryptedconversationsignature')
-
-        if not conversationId or not clientId or not conversationSignature:
-            raise Exception('Failed to create conversation.')
-        
-        return Conversation(conversationId, clientId, conversationSignature)
-
-async def list_conversations(session: ClientSession) -> list:
-    url = "https://www.bing.com/turing/conversation/chats"
-    async with session.get(url) as response:
-        response = await response.json()
-        return response["chats"]
-        
-async def delete_conversation(session: ClientSession, conversation: Conversation) -> list:
-    url = "https://sydney.bing.com/sydney/DeleteSingleConversation"
-    json = {
-        "conversationId": conversation.conversationId,
-        "conversationSignature": conversation.conversationSignature,
-        "participant": {"id": conversation.clientId},
-        "source": "cib",
-        "optionsSets": ["autosave"]
-    }
-    async with session.post(url, json=json) as response:
-        response = await response.json()
-        return response["result"]["value"] == "Success"
-
-class Defaults:
-    delimiter = "\x1e"
-    ip_address = f"13.{random.randint(104, 107)}.{random.randint(0, 255)}.{random.randint(0, 255)}"
-
-    allowedMessageTypes = [
-        "Chat",
-        "Disengaged",
-        "AdsQuery",
-        "SemanticSerp",
-        "GenerateContentQuery",
-        "SearchQuery",
-        "ActionRequest",
-        "Context",
-        "Progress",
-        "AdsQuery",
-        "SemanticSerp",
-    ]
-
-    sliceIds = [
-        "winmuid3tf",
-        "osbsdusgreccf",
-        "ttstmout",
-        "crchatrev",
-        "winlongmsgtf",
-        "ctrlworkpay",
-        "norespwtf",
-        "tempcacheread",
-        "temptacache",
-        "505scss0",
-        "508jbcars0",
-        "515enbotdets0",
-        "5082tsports",
-        "515vaoprvs",
-        "424dagslnv1s0",
-        "kcimgattcf",
-        "427startpms0",
-    ]
-
-    location = {
-        "locale": "en-US",
-        "market": "en-US",
-        "region": "US",
-        "locationHints": [
-            {
-                "country": "United States",
-                "state": "California",
-                "city": "Los Angeles",
-                "timezoneoffset": 8,
-                "countryConfidence": 8,
-                "Center": {"Latitude": 34.0536909, "Longitude": -118.242766},
-                "RegionType": 2,
-                "SourceType": 1,
-            }
-        ],
-    }
-
-    headers = {
-        'accept': '*/*',
-        'accept-language': 'en-US,en;q=0.9',
-        'cache-control': 'max-age=0',
-        'sec-ch-ua': '"Chromium";v="110", "Not A(Brand";v="24", "Microsoft Edge";v="110"',
-        'sec-ch-ua-arch': '"x86"',
-        'sec-ch-ua-bitness': '"64"',
-        'sec-ch-ua-full-version': '"110.0.1587.69"',
-        'sec-ch-ua-full-version-list': '"Chromium";v="110.0.5481.192", "Not A(Brand";v="24.0.0.0", "Microsoft Edge";v="110.0.1587.69"',
-        'sec-ch-ua-mobile': '?0',
-        'sec-ch-ua-model': '""',
-        'sec-ch-ua-platform': '"Windows"',
-        'sec-ch-ua-platform-version': '"15.0.0"',
-        'sec-fetch-dest': 'document',
-        'sec-fetch-mode': 'navigate',
-        'sec-fetch-site': 'none',
-        'sec-fetch-user': '?1',
-        'upgrade-insecure-requests': '1',
-        'user-agent': 'Mozilla/5.0 (Windows NT 10.0; Win64; x64) AppleWebKit/537.36 (KHTML, like Gecko) Chrome/110.0.0.0 Safari/537.36 Edg/110.0.1587.69',
-        'x-edge-shopping-flag': '1',
-        'x-forwarded-for': ip_address,
-    }
-
-    optionsSets = [
-        'saharasugg',
-        'enablenewsfc',
-        'clgalileo',
-        'gencontentv3',
-        "nlu_direct_response_filter",
-        "deepleo",
-        "disable_emoji_spoken_text",
-        "responsible_ai_policy_235",
-        "enablemm",
-        "h3precise"
-        "dtappid",
-        "cricinfo",
-        "cricinfov2",
-        "dv3sugg",
-        "nojbfedge"
-    ]
-
-def format_message(msg: dict) -> str:
-    return json.dumps(msg, ensure_ascii=False) + Defaults.delimiter
-
-def create_message(conversation: Conversation, prompt: str, tone: str, context: str=None) -> str:
-    request_id = str(uuid.uuid4())
-    struct = {
-        'arguments': [
-            {
-                'source': 'cib',
-                'optionsSets': Defaults.optionsSets,
-                'allowedMessageTypes': Defaults.allowedMessageTypes,
-                'sliceIds': Defaults.sliceIds,
-                'traceId': os.urandom(16).hex(),
-                'isStartOfSession': True,
-                'requestId': request_id,
-                'message': Defaults.location | {
-                    'author': 'user',
-                    'inputMethod': 'Keyboard',
-                    'text': prompt,
-                    'messageType': 'Chat',
-                    'requestId': request_id,
-                    'messageId': request_id,
-                },
-                'tone': tone,
-                'spokenTextMode': 'None',
-                'conversationId': conversation.conversationId,
-                'participant': {
-                    'id': conversation.clientId
-                },
-            }
-        ],
-        'invocationId': '1',
-        'target': 'chat',
-        'type': 4
-    }
-
-    if context:
-        struct['arguments'][0]['previousMessages'] = [{
-            "author": "user",
-            "description": context,
-            "contextType": "WebPage",
-            "messageType": "Context",
-            "messageId": "discover-web--page-ping-mriduna-----"
-        }]
-    return format_message(struct)
-
-async def stream_generate(
-        prompt: str,
-        tone: str,
-        context: str=None,
-        cookies: dict=None,
-    ):
-    async with ClientSession(
-        timeout=ClientTimeout(total=900),
-        cookies=cookies,
-        headers=Defaults.headers,
-    ) as session:
-        conversation = await create_conversation(session)
-        try:
-            async with session.ws_connect(
-                f'wss://sydney.bing.com/sydney/ChatHub',
-                autoping=False,
-                params={'sec_access_token': conversation.conversationSignature}
-            ) as wss:
-                
-                await wss.send_str(format_message({'protocol': 'json', 'version': 1}))
-                await wss.receive(timeout=900)
-                await wss.send_str(create_message(conversation, prompt, tone, context))
-
-                response_txt = ''
-                returned_text = ''
-                final = False
-
-                while not final:
-                    msg = await wss.receive(timeout=900)
-                    objects = msg.data.split(Defaults.delimiter)
-                    for obj in objects:
-                        if obj is None or not obj:
-                            continue
-                        
-                        response = json.loads(obj)
-                        if response.get('type') == 1 and response['arguments'][0].get('messages'):
-                            message = response['arguments'][0]['messages'][0]
-                            if (message['contentOrigin'] != 'Apology'):
-                                if 'adaptiveCards' in message:
-                                    card = message['adaptiveCards'][0]['body'][0]
-                                    if "text" in card:
-                                        response_txt = card.get('text')
-                                    if message.get('messageType'):
-                                        inline_txt = card['inlines'][0].get('text')
-                                        response_txt += inline_txt + '\n'
-                                elif message.get('contentType') == "IMAGE":
-                                    query = urllib.parse.quote(message.get('text'))
-                                    url = f"\nhttps://www.bing.com/images/create?q={query}"
-                                    response_txt += url
-                                    final = True
-                            if response_txt.startswith(returned_text):
-                                new = response_txt[len(returned_text):]
-                                if new != "\n":
-                                    yield new
-                                    returned_text = response_txt
-                        elif response.get('type') == 2:
-                            result = response['item']['result']
-                            if result.get('error'):
-                                raise Exception(f"{result['value']}: {result['message']}")
-                            return
-        finally:
-            await delete_conversation(session, conversation)
\ No newline at end of file
diff --git a/spaces/AgentVerse/agentVerse/ui/src/phaser3-rex-plugins/plugins/toonifypipeline.d.ts b/spaces/AgentVerse/agentVerse/ui/src/phaser3-rex-plugins/plugins/toonifypipeline.d.ts
deleted file mode 100644
index 61b0178bbe83e7ea81586fc0220006872ac2ed87..0000000000000000000000000000000000000000
--- a/spaces/AgentVerse/agentVerse/ui/src/phaser3-rex-plugins/plugins/toonifypipeline.d.ts
+++ /dev/null
@@ -1,2 +0,0 @@
-import ToonifyPostFxPipeline from './shaders/toonify/ToonifyPostFxPipeline';
-export default ToonifyPostFxPipeline;
\ No newline at end of file
diff --git a/spaces/Akim/claudeAPI/README.md b/spaces/Akim/claudeAPI/README.md
deleted file mode 100644
index d7c94bc5de4370e3386ce5ea988a32429a4b52d3..0000000000000000000000000000000000000000
--- a/spaces/Akim/claudeAPI/README.md
+++ /dev/null
@@ -1,11 +0,0 @@
----
-title: ClaudeAPI
-emoji: 😻
-colorFrom: indigo
-colorTo: blue
-sdk: docker
-pinned: false
-license: unknown
----
-
-Check out the configuration reference at https://huggingface.co/docs/hub/spaces-config-reference
diff --git a/spaces/Al-Chan/Vits_League_of_Legends_Yuumi_TTS/text/cantonese.py b/spaces/Al-Chan/Vits_League_of_Legends_Yuumi_TTS/text/cantonese.py
deleted file mode 100644
index b66d12138b81b70b86f18217d24a08fce76305c0..0000000000000000000000000000000000000000
--- a/spaces/Al-Chan/Vits_League_of_Legends_Yuumi_TTS/text/cantonese.py
+++ /dev/null
@@ -1,59 +0,0 @@
-import re
-import cn2an
-import opencc
-
-
-converter = opencc.OpenCC('jyutjyu')
-
-# List of (Latin alphabet, ipa) pairs:
-_latin_to_ipa = [(re.compile('%s' % x[0]), x[1]) for x in [
-    ('A', 'ei˥'),
-    ('B', 'biː˥'),
-    ('C', 'siː˥'),
-    ('D', 'tiː˥'),
-    ('E', 'iː˥'),
-    ('F', 'e˥fuː˨˩'),
-    ('G', 'tsiː˥'),
-    ('H', 'ɪk̚˥tsʰyː˨˩'),
-    ('I', 'ɐi˥'),
-    ('J', 'tsei˥'),
-    ('K', 'kʰei˥'),
-    ('L', 'e˥llou˨˩'),
-    ('M', 'ɛːm˥'),
-    ('N', 'ɛːn˥'),
-    ('O', 'ou˥'),
-    ('P', 'pʰiː˥'),
-    ('Q', 'kʰiːu˥'),
-    ('R', 'aː˥lou˨˩'),
-    ('S', 'ɛː˥siː˨˩'),
-    ('T', 'tʰiː˥'),
-    ('U', 'juː˥'),
-    ('V', 'wiː˥'),
-    ('W', 'tʊk̚˥piː˥juː˥'),
-    ('X', 'ɪk̚˥siː˨˩'),
-    ('Y', 'waːi˥'),
-    ('Z', 'iː˨sɛːt̚˥')
-]]
-
-
-def number_to_cantonese(text):
-    return re.sub(r'\d+(?:\.?\d+)?', lambda x: cn2an.an2cn(x.group()), text)
-
-
-def latin_to_ipa(text):
-    for regex, replacement in _latin_to_ipa:
-        text = re.sub(regex, replacement, text)
-    return text
-
-
-def cantonese_to_ipa(text):
-    text = number_to_cantonese(text.upper())
-    text = converter.convert(text).replace('-','').replace('$',' ')
-    text = re.sub(r'[A-Z]', lambda x: latin_to_ipa(x.group())+' ', text)
-    text = re.sub(r'[、；：]', '，', text)
-    text = re.sub(r'\s*，\s*', ', ', text)
-    text = re.sub(r'\s*。\s*', '. ', text)
-    text = re.sub(r'\s*？\s*', '? ', text)
-    text = re.sub(r'\s*！\s*', '! ', text)
-    text = re.sub(r'\s*$', '', text)
-    return text
diff --git a/spaces/AlhitawiMohammed22/E2E_OCR/app.py b/spaces/AlhitawiMohammed22/E2E_OCR/app.py
deleted file mode 100644
index 930c413e962b647dcbe086c80919b56976ccb8ae..0000000000000000000000000000000000000000
--- a/spaces/AlhitawiMohammed22/E2E_OCR/app.py
+++ /dev/null
@@ -1,178 +0,0 @@
-import logging
-import time
-from pathlib import Path
-import contextlib
-
-logging.basicConfig(
-    level=logging.INFO,
-    format="%(asctime)s - %(levelname)s - %(message)s",
-)
-
-
-import gradio as gr
-import nltk
-import torch
-from det2rec import *
-
-_here = Path(__file__).parent
-
-nltk.download("stopwords")  # TODO=find where this requirement originates from
-
-
-def load_uploaded_file(file_obj, temp_dir: Path = None):
-    """
-    load_uploaded_file - process an uploaded file
-    Args:
-        file_obj (POTENTIALLY list): Gradio file object inside a list
-    Returns:
-        str, the uploaded file contents
-    """
-
-    # check if mysterious file object is a list
-    if isinstance(file_obj, list):
-        file_obj = file_obj[0]
-    file_path = Path(file_obj.name)
-
-    if temp_dir is None:
-        _temp_dir = _here / "temp"
-    _temp_dir.mkdir(exist_ok=True)
-
-    try:
-        pdf_bytes_obj = open(file_path, "rb").read()
-        temp_path = temp_dir / file_path.name if temp_dir else file_path
-        # save to PDF file
-        with open(temp_path, "wb") as f:
-            f.write(pdf_bytes_obj)
-        logging.info(f"The uploaded file saved  to {temp_path}")
-        return str(temp_path.resolve())
-
-    except Exception as e:
-        logging.error(f"Trying to load file with path {file_path}, error: {e}")
-        print(f"Trying to load file with path {file_path}, error: {e}")
-        return None
-
-
-def convert_PDF(
-    pdf_obj,
-    language: str = "en",
-    max_pages=20,
-):
-    """
-    convert_PDF - convert a PDF file to text
-    Args:
-        pdf_bytes_obj (bytes): PDF file contents
-        language (str, optional): Language to use for OCR. Defaults to "en".
-    Returns:
-        str, the PDF file contents as text
-    """
-    # clear local text cache
-    rm_local_text_files()
-    global ocr_model
-    st = time.perf_counter()
-    if isinstance(pdf_obj, list):
-        pdf_obj = pdf_obj[0]
-    file_path = Path(pdf_obj.name)
-    if not file_path.suffix == ".pdf":
-        logging.error(f"File {file_path} is not a PDF file")
-
-        html_error = f"""
-        <div style="color: red; font-size: 20px; font-weight: bold;">
-        File {file_path} is not a PDF file. Please upload a PDF file.
-        </div>
-        """
-        return "File is not a PDF file", html_error, None
-
-    conversion_stats = convert_PDF_to_Text(
-        file_path,
-        ocr_model=ocr_model,
-        max_pages=max_pages,
-    )
-    converted_txt = conversion_stats["converted_text"]
-    num_pages = conversion_stats["num_pages"]
-    was_truncated = conversion_stats["truncated"]
-    # if alt_lang: # TODO: fix this
-
-    rt = round((time.perf_counter() - st) / 60, 2)
-    print(f"Runtime: {rt} minutes")
-    html = ""
-    if was_truncated:
-        html += f"<p>WARNING - PDF was truncated to {max_pages} pages</p>"
-    html += f"<p>Runtime: {rt} minutes on CPU for {num_pages} pages</p>"
-
-    _output_name = f"RESULT_{file_path.stem}_OCR.txt"
-    with open(_output_name, "w", encoding="utf-8", errors="ignore") as f:
-        f.write(converted_txt)
-
-    return converted_txt, html, _output_name
-
-
-if __name__ == "__main__":
-    logging.info("Starting app")
-
-    use_GPU = torch.cuda.is_available()
-    logging.info(f"Using GPU status: {use_GPU}")
-    logging.info("Loading OCR model")
-    with contextlib.redirect_stdout(None):
-        ocr_model = ocr_predictor(
-            "db_resnet50",
-            "crnn_mobilenet_v3_large",
-            pretrained=True,
-            assume_straight_pages=True,
-        )
-
-    # define pdf bytes as None
-    pdf_obj = _here / "exampler.pdf"
-    pdf_obj = str(pdf_obj.resolve())
-    _temp_dir = _here / "temp"
-    _temp_dir.mkdir(exist_ok=True)
-
-    logging.info("starting demo")
-    demo = gr.Blocks()
-
-    with demo:
-
-        gr.Markdown("# PDF to Text")
-        gr.Markdown(
-            "A basic demo for end-to-end text detection and recognition where the input will be in pdf format and the result is text conversion using OCR from the [doctr](https://mindee.github.io/doctr/index.html) package"
-        )
-        gr.Markdown("---")
-        gr.Markdown("---")
-
-        with gr.Column():
-
-            gr.Markdown("## Load Inputs")
-            gr.Markdown("Upload your own file & replace the default. Files should be < 10MB to avoid upload issues - search for a PDF compressor online as needed.")
-            gr.Markdown(
-                "_If no file is uploaded, a sample PDF will be used. PDFs are truncated to 20 pages._"
-            )
-
-            uploaded_file = gr.File(
-                label="Upload a PDF file",
-                file_count="single",
-                type="file",
-                value=_here / "exampler.pdf",
-            )
-
-            gr.Markdown("---")
-
-        with gr.Column():
-            gr.Markdown("## Convert PDF to Text")
-            convert_button = gr.Button("Convert PDF!", variant="primary")
-            out_placeholder = gr.HTML("<p><em>Output will appear below:</em></p>")
-            gr.Markdown("### Output")
-            OCR_text = gr.Textbox(
-                label="OCR Result", placeholder="The OCR text will appear here"
-            )
-            text_file = gr.File(
-                label="Download Text File",
-                file_count="single",
-                type="file",
-                interactive=False,
-            )
-
-        convert_button.click(
-            fn=convert_PDF,
-            inputs=[uploaded_file],
-            outputs=[OCR_text, out_placeholder, text_file],
-        )
-    demo.launch(enable_queue=True)
\ No newline at end of file
diff --git a/spaces/AliUsama98/Aliusama_spellchecker/README.md b/spaces/AliUsama98/Aliusama_spellchecker/README.md
deleted file mode 100644
index 0173f8a4c450c1ad396465a73c7f8fd442085699..0000000000000000000000000000000000000000
--- a/spaces/AliUsama98/Aliusama_spellchecker/README.md
+++ /dev/null
@@ -1,13 +0,0 @@
----
-title: Aliusama Spellchecker
-emoji: 👀
-colorFrom: blue
-colorTo: pink
-sdk: gradio
-sdk_version: 3.50.2
-app_file: app.py
-pinned: false
-license: apache-2.0
----
-
-Check out the configuration reference at https://huggingface.co/docs/hub/spaces-config-reference
\ No newline at end of file
diff --git a/spaces/Alpaca233/ChatPDF-GUI/gpt_reader/prompt.py b/spaces/Alpaca233/ChatPDF-GUI/gpt_reader/prompt.py
deleted file mode 100644
index bd030e33da02d538631312e5c29dfac0eb49fad4..0000000000000000000000000000000000000000
--- a/spaces/Alpaca233/ChatPDF-GUI/gpt_reader/prompt.py
+++ /dev/null
@@ -1,26 +0,0 @@
-BASE_POINTS = """
-1. Who are the authors?
-2. What is the process of the proposed method?
-3. What is the performance of the proposed method? Please note down its performance metrics.
-4. What are the baseline models and their performances? Please note down these baseline methods.
-5. What dataset did this paper use?
-"""
-
-READING_PROMPT = """
-You are a researcher helper bot. You can help the user with research paper reading and summarizing. \n
-Now I am going to send you a paper. You need to read it and summarize it for me part by part. \n
-When you are reading, You need to focus on these key points:{}
-"""
-
-READING_PROMT_V2 = """
-You are a researcher helper bot. You can help the user with research paper reading and summarizing. \n
-Now I am going to send you a paper. You need to read it and summarize it for me part by part. \n
-When you are reading, You need to focus on these key points:{},
-
-And You need to generate a brief but informative title for this part.
-Your return format:
-- title: '...'
-- summary: '...'
-"""
-
-SUMMARY_PROMPT = "You are a researcher helper bot. Now you need to read the summaries of a research paper."
diff --git a/spaces/Alpaca233/SadTalker/src/face3d/models/arcface_torch/dataset.py b/spaces/Alpaca233/SadTalker/src/face3d/models/arcface_torch/dataset.py
deleted file mode 100644
index 96bbb8bb6da99122f350bc8e1a6390245840e32b..0000000000000000000000000000000000000000
--- a/spaces/Alpaca233/SadTalker/src/face3d/models/arcface_torch/dataset.py
+++ /dev/null
@@ -1,124 +0,0 @@
-import numbers
-import os
-import queue as Queue
-import threading
-
-import mxnet as mx
-import numpy as np
-import torch
-from torch.utils.data import DataLoader, Dataset
-from torchvision import transforms
-
-
-class BackgroundGenerator(threading.Thread):
-    def __init__(self, generator, local_rank, max_prefetch=6):
-        super(BackgroundGenerator, self).__init__()
-        self.queue = Queue.Queue(max_prefetch)
-        self.generator = generator
-        self.local_rank = local_rank
-        self.daemon = True
-        self.start()
-
-    def run(self):
-        torch.cuda.set_device(self.local_rank)
-        for item in self.generator:
-            self.queue.put(item)
-        self.queue.put(None)
-
-    def next(self):
-        next_item = self.queue.get()
-        if next_item is None:
-            raise StopIteration
-        return next_item
-
-    def __next__(self):
-        return self.next()
-
-    def __iter__(self):
-        return self
-
-
-class DataLoaderX(DataLoader):
-
-    def __init__(self, local_rank, **kwargs):
-        super(DataLoaderX, self).__init__(**kwargs)
-        self.stream = torch.cuda.Stream(local_rank)
-        self.local_rank = local_rank
-
-    def __iter__(self):
-        self.iter = super(DataLoaderX, self).__iter__()
-        self.iter = BackgroundGenerator(self.iter, self.local_rank)
-        self.preload()
-        return self
-
-    def preload(self):
-        self.batch = next(self.iter, None)
-        if self.batch is None:
-            return None
-        with torch.cuda.stream(self.stream):
-            for k in range(len(self.batch)):
-                self.batch[k] = self.batch[k].to(device=self.local_rank, non_blocking=True)
-
-    def __next__(self):
-        torch.cuda.current_stream().wait_stream(self.stream)
-        batch = self.batch
-        if batch is None:
-            raise StopIteration
-        self.preload()
-        return batch
-
-
-class MXFaceDataset(Dataset):
-    def __init__(self, root_dir, local_rank):
-        super(MXFaceDataset, self).__init__()
-        self.transform = transforms.Compose(
-            [transforms.ToPILImage(),
-             transforms.RandomHorizontalFlip(),
-             transforms.ToTensor(),
-             transforms.Normalize(mean=[0.5, 0.5, 0.5], std=[0.5, 0.5, 0.5]),
-             ])
-        self.root_dir = root_dir
-        self.local_rank = local_rank
-        path_imgrec = os.path.join(root_dir, 'train.rec')
-        path_imgidx = os.path.join(root_dir, 'train.idx')
-        self.imgrec = mx.recordio.MXIndexedRecordIO(path_imgidx, path_imgrec, 'r')
-        s = self.imgrec.read_idx(0)
-        header, _ = mx.recordio.unpack(s)
-        if header.flag > 0:
-            self.header0 = (int(header.label[0]), int(header.label[1]))
-            self.imgidx = np.array(range(1, int(header.label[0])))
-        else:
-            self.imgidx = np.array(list(self.imgrec.keys))
-
-    def __getitem__(self, index):
-        idx = self.imgidx[index]
-        s = self.imgrec.read_idx(idx)
-        header, img = mx.recordio.unpack(s)
-        label = header.label
-        if not isinstance(label, numbers.Number):
-            label = label[0]
-        label = torch.tensor(label, dtype=torch.long)
-        sample = mx.image.imdecode(img).asnumpy()
-        if self.transform is not None:
-            sample = self.transform(sample)
-        return sample, label
-
-    def __len__(self):
-        return len(self.imgidx)
-
-
-class SyntheticDataset(Dataset):
-    def __init__(self, local_rank):
-        super(SyntheticDataset, self).__init__()
-        img = np.random.randint(0, 255, size=(112, 112, 3), dtype=np.int32)
-        img = np.transpose(img, (2, 0, 1))
-        img = torch.from_numpy(img).squeeze(0).float()
-        img = ((img / 255) - 0.5) / 0.5
-        self.img = img
-        self.label = 1
-
-    def __getitem__(self, index):
-        return self.img, self.label
-
-    def __len__(self):
-        return 1000000
diff --git a/spaces/Alpaca233/SadTalker/src/face3d/models/arcface_torch/partial_fc.py b/spaces/Alpaca233/SadTalker/src/face3d/models/arcface_torch/partial_fc.py
deleted file mode 100644
index 17e2d25715d10ba446c957e1d2528b0687ed71d5..0000000000000000000000000000000000000000
--- a/spaces/Alpaca233/SadTalker/src/face3d/models/arcface_torch/partial_fc.py
+++ /dev/null
@@ -1,222 +0,0 @@
-import logging
-import os
-
-import torch
-import torch.distributed as dist
-from torch.nn import Module
-from torch.nn.functional import normalize, linear
-from torch.nn.parameter import Parameter
-
-
-class PartialFC(Module):
-    """
-    Author: {Xiang An, Yang Xiao, XuHan Zhu} in DeepGlint,
-    Partial FC: Training 10 Million Identities on a Single Machine
-    See the original paper:
-    https://arxiv.org/abs/2010.05222
-    """
-
-    @torch.no_grad()
-    def __init__(self, rank, local_rank, world_size, batch_size, resume,
-                 margin_softmax, num_classes, sample_rate=1.0, embedding_size=512, prefix="./"):
-        """
-        rank: int
-            Unique process(GPU) ID from 0 to world_size - 1.
-        local_rank: int
-            Unique process(GPU) ID within the server from 0 to 7.
-        world_size: int
-            Number of GPU.
-        batch_size: int
-            Batch size on current rank(GPU).
-        resume: bool
-            Select whether to restore the weight of softmax.
-        margin_softmax: callable
-            A function of margin softmax, eg: cosface, arcface.
-        num_classes: int
-            The number of class center storage in current rank(CPU/GPU), usually is total_classes // world_size,
-            required.
-        sample_rate: float
-            The partial fc sampling rate, when the number of classes increases to more than 2 millions, Sampling
-            can greatly speed up training, and reduce a lot of GPU memory, default is 1.0.
-        embedding_size: int
-            The feature dimension, default is 512.
-        prefix: str
-            Path for save checkpoint, default is './'.
-        """
-        super(PartialFC, self).__init__()
-        #
-        self.num_classes: int = num_classes
-        self.rank: int = rank
-        self.local_rank: int = local_rank
-        self.device: torch.device = torch.device("cuda:{}".format(self.local_rank))
-        self.world_size: int = world_size
-        self.batch_size: int = batch_size
-        self.margin_softmax: callable = margin_softmax
-        self.sample_rate: float = sample_rate
-        self.embedding_size: int = embedding_size
-        self.prefix: str = prefix
-        self.num_local: int = num_classes // world_size + int(rank < num_classes % world_size)
-        self.class_start: int = num_classes // world_size * rank + min(rank, num_classes % world_size)
-        self.num_sample: int = int(self.sample_rate * self.num_local)
-
-        self.weight_name = os.path.join(self.prefix, "rank_{}_softmax_weight.pt".format(self.rank))
-        self.weight_mom_name = os.path.join(self.prefix, "rank_{}_softmax_weight_mom.pt".format(self.rank))
-
-        if resume:
-            try:
-                self.weight: torch.Tensor = torch.load(self.weight_name)
-                self.weight_mom: torch.Tensor = torch.load(self.weight_mom_name)
-                if self.weight.shape[0] != self.num_local or self.weight_mom.shape[0] != self.num_local:
-                    raise IndexError
-                logging.info("softmax weight resume successfully!")
-                logging.info("softmax weight mom resume successfully!")
-            except (FileNotFoundError, KeyError, IndexError):
-                self.weight = torch.normal(0, 0.01, (self.num_local, self.embedding_size), device=self.device)
-                self.weight_mom: torch.Tensor = torch.zeros_like(self.weight)
-                logging.info("softmax weight init!")
-                logging.info("softmax weight mom init!")
-        else:
-            self.weight = torch.normal(0, 0.01, (self.num_local, self.embedding_size), device=self.device)
-            self.weight_mom: torch.Tensor = torch.zeros_like(self.weight)
-            logging.info("softmax weight init successfully!")
-            logging.info("softmax weight mom init successfully!")
-        self.stream: torch.cuda.Stream = torch.cuda.Stream(local_rank)
-
-        self.index = None
-        if int(self.sample_rate) == 1:
-            self.update = lambda: 0
-            self.sub_weight = Parameter(self.weight)
-            self.sub_weight_mom = self.weight_mom
-        else:
-            self.sub_weight = Parameter(torch.empty((0, 0)).cuda(local_rank))
-
-    def save_params(self):
-        """ Save softmax weight for each rank on prefix
-        """
-        torch.save(self.weight.data, self.weight_name)
-        torch.save(self.weight_mom, self.weight_mom_name)
-
-    @torch.no_grad()
-    def sample(self, total_label):
-        """
-        Sample all positive class centers in each rank, and random select neg class centers to filling a fixed
-        `num_sample`.
-
-        total_label: tensor
-            Label after all gather, which cross all GPUs.
-        """
-        index_positive = (self.class_start <= total_label) & (total_label < self.class_start + self.num_local)
-        total_label[~index_positive] = -1
-        total_label[index_positive] -= self.class_start
-        if int(self.sample_rate) != 1:
-            positive = torch.unique(total_label[index_positive], sorted=True)
-            if self.num_sample - positive.size(0) >= 0:
-                perm = torch.rand(size=[self.num_local], device=self.device)
-                perm[positive] = 2.0
-                index = torch.topk(perm, k=self.num_sample)[1]
-                index = index.sort()[0]
-            else:
-                index = positive
-            self.index = index
-            total_label[index_positive] = torch.searchsorted(index, total_label[index_positive])
-            self.sub_weight = Parameter(self.weight[index])
-            self.sub_weight_mom = self.weight_mom[index]
-
-    def forward(self, total_features, norm_weight):
-        """ Partial fc forward, `logits = X * sample(W)`
-        """
-        torch.cuda.current_stream().wait_stream(self.stream)
-        logits = linear(total_features, norm_weight)
-        return logits
-
-    @torch.no_grad()
-    def update(self):
-        """ Set updated weight and weight_mom to memory bank.
-        """
-        self.weight_mom[self.index] = self.sub_weight_mom
-        self.weight[self.index] = self.sub_weight
-
-    def prepare(self, label, optimizer):
-        """
-        get sampled class centers for cal softmax.
-
-        label: tensor
-            Label tensor on each rank.
-        optimizer: opt
-            Optimizer for partial fc, which need to get weight mom.
-        """
-        with torch.cuda.stream(self.stream):
-            total_label = torch.zeros(
-                size=[self.batch_size * self.world_size], device=self.device, dtype=torch.long)
-            dist.all_gather(list(total_label.chunk(self.world_size, dim=0)), label)
-            self.sample(total_label)
-            optimizer.state.pop(optimizer.param_groups[-1]['params'][0], None)
-            optimizer.param_groups[-1]['params'][0] = self.sub_weight
-            optimizer.state[self.sub_weight]['momentum_buffer'] = self.sub_weight_mom
-            norm_weight = normalize(self.sub_weight)
-            return total_label, norm_weight
-
-    def forward_backward(self, label, features, optimizer):
-        """
-        Partial fc forward and backward with model parallel
-
-        label: tensor
-            Label tensor on each rank(GPU)
-        features: tensor
-            Features tensor on each rank(GPU)
-        optimizer: optimizer
-            Optimizer for partial fc
-
-        Returns:
-        --------
-        x_grad: tensor
-            The gradient of features.
-        loss_v: tensor
-            Loss value for cross entropy.
-        """
-        total_label, norm_weight = self.prepare(label, optimizer)
-        total_features = torch.zeros(
-            size=[self.batch_size * self.world_size, self.embedding_size], device=self.device)
-        dist.all_gather(list(total_features.chunk(self.world_size, dim=0)), features.data)
-        total_features.requires_grad = True
-
-        logits = self.forward(total_features, norm_weight)
-        logits = self.margin_softmax(logits, total_label)
-
-        with torch.no_grad():
-            max_fc = torch.max(logits, dim=1, keepdim=True)[0]
-            dist.all_reduce(max_fc, dist.ReduceOp.MAX)
-
-            # calculate exp(logits) and all-reduce
-            logits_exp = torch.exp(logits - max_fc)
-            logits_sum_exp = logits_exp.sum(dim=1, keepdims=True)
-            dist.all_reduce(logits_sum_exp, dist.ReduceOp.SUM)
-
-            # calculate prob
-            logits_exp.div_(logits_sum_exp)
-
-            # get one-hot
-            grad = logits_exp
-            index = torch.where(total_label != -1)[0]
-            one_hot = torch.zeros(size=[index.size()[0], grad.size()[1]], device=grad.device)
-            one_hot.scatter_(1, total_label[index, None], 1)
-
-            # calculate loss
-            loss = torch.zeros(grad.size()[0], 1, device=grad.device)
-            loss[index] = grad[index].gather(1, total_label[index, None])
-            dist.all_reduce(loss, dist.ReduceOp.SUM)
-            loss_v = loss.clamp_min_(1e-30).log_().mean() * (-1)
-
-            # calculate grad
-            grad[index] -= one_hot
-            grad.div_(self.batch_size * self.world_size)
-
-        logits.backward(grad)
-        if total_features.grad is not None:
-            total_features.grad.detach_()
-        x_grad: torch.Tensor = torch.zeros_like(features, requires_grad=True)
-        # feature gradient all-reduce
-        dist.reduce_scatter(x_grad, list(total_features.grad.chunk(self.world_size, dim=0)))
-        x_grad = x_grad * self.world_size
-        # backward backbone
-        return x_grad, loss_v
diff --git a/spaces/Amrrs/DragGan-Inversion/training/loss.py b/spaces/Amrrs/DragGan-Inversion/training/loss.py
deleted file mode 100644
index 3b6d0833ca639bb3b08f216419dfa25f1e657da2..0000000000000000000000000000000000000000
--- a/spaces/Amrrs/DragGan-Inversion/training/loss.py
+++ /dev/null
@@ -1,159 +0,0 @@
-# Copyright (c) 2021, NVIDIA CORPORATION & AFFILIATES.  All rights reserved.
-#
-# NVIDIA CORPORATION and its licensors retain all intellectual property
-# and proprietary rights in and to this software, related documentation
-# and any modifications thereto.  Any use, reproduction, disclosure or
-# distribution of this software and related documentation without an express
-# license agreement from NVIDIA CORPORATION is strictly prohibited.
-
-"""Loss functions."""
-
-import numpy as np
-import torch
-from torch_utils import training_stats
-from torch_utils.ops import conv2d_gradfix
-from torch_utils.ops import upfirdn2d
-
-# ----------------------------------------------------------------------------
-
-
-class Loss:
-    # to be overridden by subclass
-    def accumulate_gradients(self, phase, real_img, real_c, gen_z, gen_c, gain, cur_nimg):
-        raise NotImplementedError()
-
-# ----------------------------------------------------------------------------
-
-
-class StyleGAN2Loss(Loss):
-    def __init__(self, device, G, D, augment_pipe=None, r1_gamma=10, style_mixing_prob=0, pl_weight=0, pl_batch_shrink=2, pl_decay=0.01, pl_no_weight_grad=False, blur_init_sigma=0, blur_fade_kimg=0):
-        super().__init__()
-        self.device = device
-        self.G = G
-        self.D = D
-        self.augment_pipe = augment_pipe
-        self.r1_gamma = r1_gamma
-        self.style_mixing_prob = style_mixing_prob
-        self.pl_weight = pl_weight
-        self.pl_batch_shrink = pl_batch_shrink
-        self.pl_decay = pl_decay
-        self.pl_no_weight_grad = pl_no_weight_grad
-        self.pl_mean = torch.zeros([], device=device)
-        self.blur_init_sigma = blur_init_sigma
-        self.blur_fade_kimg = blur_fade_kimg
-
-    def run_G(self, z, c, update_emas=False):
-        ws = self.G.mapping(z, c, update_emas=update_emas)
-        if self.style_mixing_prob > 0:
-            with torch.autograd.profiler.record_function('style_mixing'):
-                cutoff = torch.empty([], dtype=torch.int64,
-                                     device=ws.device).random_(1, ws.shape[1])
-                cutoff = torch.where(torch.rand(
-                    [], device=ws.device) < self.style_mixing_prob, cutoff, torch.full_like(cutoff, ws.shape[1]))
-                ws[:, cutoff:] = self.G.mapping(
-                    torch.randn_like(z), c, update_emas=False)[:, cutoff:]
-        img = self.G.synthesis(ws, update_emas=update_emas)
-        return img, ws
-
-    def run_D(self, img, c, blur_sigma=0, update_emas=False):
-        blur_size = np.floor(blur_sigma * 3)
-        if blur_size > 0:
-            with torch.autograd.profiler.record_function('blur'):
-                f = torch.arange(-blur_size, blur_size + 1,
-                                 device=img.device).div(blur_sigma).square().neg().exp2()
-                img = upfirdn2d.filter2d(img, f / f.sum())
-        if self.augment_pipe is not None:
-            img = self.augment_pipe(img)
-        logits = self.D(img, c, update_emas=update_emas)
-        return logits
-
-    def accumulate_gradients(self, phase, real_img, real_c, gen_z, gen_c, gain, cur_nimg):
-        assert phase in ['Gmain', 'Greg', 'Gboth', 'Dmain', 'Dreg', 'Dboth']
-        if self.pl_weight == 0:
-            phase = {'Greg': 'none', 'Gboth': 'Gmain'}.get(phase, phase)
-        if self.r1_gamma == 0:
-            phase = {'Dreg': 'none', 'Dboth': 'Dmain'}.get(phase, phase)
-        blur_sigma = max(1 - cur_nimg / (self.blur_fade_kimg * 1e3), 0) * \
-            self.blur_init_sigma if self.blur_fade_kimg > 0 else 0
-
-        # Gmain: Maximize logits for generated images.
-        if phase in ['Gmain', 'Gboth']:
-            with torch.autograd.profiler.record_function('Gmain_forward'):
-                gen_img, _gen_ws = self.run_G(gen_z, gen_c)
-                gen_logits = self.run_D(gen_img, gen_c, blur_sigma=blur_sigma)
-                training_stats.report('Loss/scores/fake', gen_logits)
-                training_stats.report('Loss/signs/fake', gen_logits.sign())
-                # -log(sigmoid(gen_logits))
-                loss_Gmain = torch.nn.functional.softplus(-gen_logits)
-                training_stats.report('Loss/G/loss', loss_Gmain)
-            with torch.autograd.profiler.record_function('Gmain_backward'):
-                loss_Gmain.mean().mul(gain).backward()
-
-        # Gpl: Apply path length regularization.
-        if phase in ['Greg', 'Gboth']:
-            with torch.autograd.profiler.record_function('Gpl_forward'):
-                batch_size = gen_z.shape[0] // self.pl_batch_shrink
-                gen_img, gen_ws = self.run_G(
-                    gen_z[:batch_size], gen_c[:batch_size])
-                pl_noise = torch.randn_like(
-                    gen_img) / np.sqrt(gen_img.shape[2] * gen_img.shape[3])
-                with torch.autograd.profiler.record_function('pl_grads'), conv2d_gradfix.no_weight_gradients(self.pl_no_weight_grad):
-                    pl_grads = torch.autograd.grad(outputs=[(
-                        gen_img * pl_noise).sum()], inputs=[gen_ws], create_graph=True, only_inputs=True)[0]
-                pl_lengths = pl_grads.square().sum(2).mean(1).sqrt()
-                pl_mean = self.pl_mean.lerp(pl_lengths.mean(), self.pl_decay)
-                self.pl_mean.copy_(pl_mean.detach())
-                pl_penalty = (pl_lengths - pl_mean).square()
-                training_stats.report('Loss/pl_penalty', pl_penalty)
-                loss_Gpl = pl_penalty * self.pl_weight
-                training_stats.report('Loss/G/reg', loss_Gpl)
-            with torch.autograd.profiler.record_function('Gpl_backward'):
-                loss_Gpl.mean().mul(gain).backward()
-
-        # Dmain: Minimize logits for generated images.
-        loss_Dgen = 0
-        if phase in ['Dmain', 'Dboth']:
-            with torch.autograd.profiler.record_function('Dgen_forward'):
-                gen_img, _gen_ws = self.run_G(gen_z, gen_c, update_emas=True)
-                gen_logits = self.run_D(
-                    gen_img, gen_c, blur_sigma=blur_sigma, update_emas=True)
-                training_stats.report('Loss/scores/fake', gen_logits)
-                training_stats.report('Loss/signs/fake', gen_logits.sign())
-                loss_Dgen = torch.nn.functional.softplus(
-                    gen_logits)  # -log(1 - sigmoid(gen_logits))
-            with torch.autograd.profiler.record_function('Dgen_backward'):
-                loss_Dgen.mean().mul(gain).backward()
-
-        # Dmain: Maximize logits for real images.
-        # Dr1: Apply R1 regularization.
-        if phase in ['Dmain', 'Dreg', 'Dboth']:
-            name = 'Dreal' if phase == 'Dmain' else 'Dr1' if phase == 'Dreg' else 'Dreal_Dr1'
-            with torch.autograd.profiler.record_function(name + '_forward'):
-                real_img_tmp = real_img.detach().requires_grad_(
-                    phase in ['Dreg', 'Dboth'])
-                real_logits = self.run_D(
-                    real_img_tmp, real_c, blur_sigma=blur_sigma)
-                training_stats.report('Loss/scores/real', real_logits)
-                training_stats.report('Loss/signs/real', real_logits.sign())
-
-                loss_Dreal = 0
-                if phase in ['Dmain', 'Dboth']:
-                    # -log(sigmoid(real_logits))
-                    loss_Dreal = torch.nn.functional.softplus(-real_logits)
-                    training_stats.report(
-                        'Loss/D/loss', loss_Dgen + loss_Dreal)
-
-                loss_Dr1 = 0
-                if phase in ['Dreg', 'Dboth']:
-                    with torch.autograd.profiler.record_function('r1_grads'), conv2d_gradfix.no_weight_gradients():
-                        r1_grads = torch.autograd.grad(outputs=[real_logits.sum()], inputs=[
-                                                       real_img_tmp], create_graph=True, only_inputs=True)[0]
-                    r1_penalty = r1_grads.square().sum([1, 2, 3])
-                    loss_Dr1 = r1_penalty * (self.r1_gamma / 2)
-                    training_stats.report('Loss/r1_penalty', r1_penalty)
-                    training_stats.report('Loss/D/reg', loss_Dr1)
-
-            with torch.autograd.profiler.record_function(name + '_backward'):
-                (loss_Dreal + loss_Dr1).mean().mul(gain).backward()
-
-# ----------------------------------------------------------------------------
diff --git a/spaces/Andy1621/uniformer_image_detection/configs/_base_/schedules/schedule_20e.py b/spaces/Andy1621/uniformer_image_detection/configs/_base_/schedules/schedule_20e.py
deleted file mode 100644
index 00e859022156dcbef6501c04d03f335639f2c1f6..0000000000000000000000000000000000000000
--- a/spaces/Andy1621/uniformer_image_detection/configs/_base_/schedules/schedule_20e.py
+++ /dev/null
@@ -1,11 +0,0 @@
-# optimizer
-optimizer = dict(type='SGD', lr=0.02, momentum=0.9, weight_decay=0.0001)
-optimizer_config = dict(grad_clip=None)
-# learning policy
-lr_config = dict(
-    policy='step',
-    warmup='linear',
-    warmup_iters=500,
-    warmup_ratio=0.001,
-    step=[16, 19])
-runner = dict(type='EpochBasedRunner', max_epochs=20)
diff --git a/spaces/Andy1621/uniformer_image_detection/configs/swin/mask_rcnn_swin_small_patch4_window7_mstrain_480-800_adamw_3x_coco.py b/spaces/Andy1621/uniformer_image_detection/configs/swin/mask_rcnn_swin_small_patch4_window7_mstrain_480-800_adamw_3x_coco.py
deleted file mode 100644
index ee15134ba3f0a0788cbf4eb69cf080d01e08ddab..0000000000000000000000000000000000000000
--- a/spaces/Andy1621/uniformer_image_detection/configs/swin/mask_rcnn_swin_small_patch4_window7_mstrain_480-800_adamw_3x_coco.py
+++ /dev/null
@@ -1,80 +0,0 @@
-_base_ = [
-    '../_base_/models/mask_rcnn_swin_fpn.py',
-    '../_base_/datasets/coco_instance.py',
-    '../_base_/schedules/schedule_1x.py', '../_base_/default_runtime.py'
-]
-
-model = dict(
-    backbone=dict(
-        embed_dim=96,
-        depths=[2, 2, 18, 2],
-        num_heads=[3, 6, 12, 24],
-        window_size=7,
-        ape=False,
-        drop_path_rate=0.2,
-        patch_norm=True,
-        use_checkpoint=False
-    ),
-    neck=dict(in_channels=[96, 192, 384, 768]))
-
-img_norm_cfg = dict(
-    mean=[123.675, 116.28, 103.53], std=[58.395, 57.12, 57.375], to_rgb=True)
-
-# augmentation strategy originates from DETR / Sparse RCNN
-train_pipeline = [
-    dict(type='LoadImageFromFile'),
-    dict(type='LoadAnnotations', with_bbox=True, with_mask=True),
-    dict(type='RandomFlip', flip_ratio=0.5),
-    dict(type='AutoAugment',
-         policies=[
-             [
-                 dict(type='Resize',
-                      img_scale=[(480, 1333), (512, 1333), (544, 1333), (576, 1333),
-                                 (608, 1333), (640, 1333), (672, 1333), (704, 1333),
-                                 (736, 1333), (768, 1333), (800, 1333)],
-                      multiscale_mode='value',
-                      keep_ratio=True)
-             ],
-             [
-                 dict(type='Resize',
-                      img_scale=[(400, 1333), (500, 1333), (600, 1333)],
-                      multiscale_mode='value',
-                      keep_ratio=True),
-                 dict(type='RandomCrop',
-                      crop_type='absolute_range',
-                      crop_size=(384, 600),
-                      allow_negative_crop=True),
-                 dict(type='Resize',
-                      img_scale=[(480, 1333), (512, 1333), (544, 1333),
-                                 (576, 1333), (608, 1333), (640, 1333),
-                                 (672, 1333), (704, 1333), (736, 1333),
-                                 (768, 1333), (800, 1333)],
-                      multiscale_mode='value',
-                      override=True,
-                      keep_ratio=True)
-             ]
-         ]),
-    dict(type='Normalize', **img_norm_cfg),
-    dict(type='Pad', size_divisor=32),
-    dict(type='DefaultFormatBundle'),
-    dict(type='Collect', keys=['img', 'gt_bboxes', 'gt_labels', 'gt_masks']),
-]
-data = dict(train=dict(pipeline=train_pipeline))
-
-optimizer = dict(_delete_=True, type='AdamW', lr=0.0001, betas=(0.9, 0.999), weight_decay=0.05,
-                 paramwise_cfg=dict(custom_keys={'absolute_pos_embed': dict(decay_mult=0.),
-                                                 'relative_position_bias_table': dict(decay_mult=0.),
-                                                 'norm': dict(decay_mult=0.)}))
-lr_config = dict(step=[27, 33])
-runner = dict(type='EpochBasedRunnerAmp', max_epochs=36)
-
-# do not use mmdet version fp16
-fp16 = None
-optimizer_config = dict(
-    type="DistOptimizerHook",
-    update_interval=1,
-    grad_clip=None,
-    coalesce=True,
-    bucket_size_mb=-1,
-    use_fp16=True,
-)
diff --git a/spaces/Andy1621/uniformer_image_segmentation/configs/hrnet/fcn_hr48_512x1024_160k_cityscapes.py b/spaces/Andy1621/uniformer_image_segmentation/configs/hrnet/fcn_hr48_512x1024_160k_cityscapes.py
deleted file mode 100644
index 394a61c99f038c94fce58ac9c422b7c3ee4b5f50..0000000000000000000000000000000000000000
--- a/spaces/Andy1621/uniformer_image_segmentation/configs/hrnet/fcn_hr48_512x1024_160k_cityscapes.py
+++ /dev/null
@@ -1,10 +0,0 @@
-_base_ = './fcn_hr18_512x1024_160k_cityscapes.py'
-model = dict(
-    pretrained='open-mmlab://msra/hrnetv2_w48',
-    backbone=dict(
-        extra=dict(
-            stage2=dict(num_channels=(48, 96)),
-            stage3=dict(num_channels=(48, 96, 192)),
-            stage4=dict(num_channels=(48, 96, 192, 384)))),
-    decode_head=dict(
-        in_channels=[48, 96, 192, 384], channels=sum([48, 96, 192, 384])))
diff --git a/spaces/Armandoliv/t5-summarize-app-scitldr/app.py b/spaces/Armandoliv/t5-summarize-app-scitldr/app.py
deleted file mode 100644
index b95922de663c3da8c38e771a79900ff19aad363a..0000000000000000000000000000000000000000
--- a/spaces/Armandoliv/t5-summarize-app-scitldr/app.py
+++ /dev/null
@@ -1,47 +0,0 @@
-import gradio as gr
-import torch 
-from transformers import AutoTokenizer, AutoModelForSeq2SeqLM
-
-tokenizer = AutoTokenizer.from_pretrained("Armandoliv/t5-small-summarizer-scitldr")
-
-model = AutoModelForSeq2SeqLM.from_pretrained("Armandoliv/t5-small-summarizer-scitldr")
-device = torch.device("cuda:0" if torch.cuda.is_available() else "cpu")
-model = model.to(device)
-
-def main_summarizer(text):
-  max_input_length = 1024
-  preprocess_text = text.strip().replace("\n"," ").replace("’", "'").strip()
-  tokenized_text = tokenizer.encode(preprocess_text, return_tensors="pt", truncation=True, max_length=max_input_length,).to(device)
-
-  summary_ids = model.generate(
-              tokenized_text,
-              max_length=256, 
-              num_beams=8,
-              repetition_penalty=3.0, 
-              length_penalty=2.5, 
-              early_stopping=False
-          )
-
-  output = tokenizer.decode(summary_ids[0], skip_special_tokens=True)
-
-  return output
-  
-inputs = [gr.Textbox(lines=10, placeholder="Text Here...", label="Input")]
-outputs = gr.Text( label="Summary")
-title="Text summarisation app"
-description = "This demo uses AI Models to summarize long text.\nIt focus on scientific texts."
-
-io = gr.Interface(fn=main_summarizer, inputs=inputs, outputs=outputs, title=title, description = description,
-
-                  css= """.gr-button-primary { background: -webkit-linear-gradient( 
-                    90deg, #355764 0%, #55a8a1 100% ) !important;     background: #355764;
-                        background: linear-gradient( 
-                    90deg, #355764 0%, #55a8a1 100% ) !important;
-                        background: -moz-linear-gradient( 90deg, #355764 0%, #55a8a1 100% ) !important;
-                        background: -webkit-linear-gradient( 
-                    90deg, #355764 0%, #55a8a1 100% ) !important;
-                    color:white !important}"""
-                  )
-  
-io.launch()
-  
\ No newline at end of file
diff --git a/spaces/Artrajz/vits-simple-api/bert_vits2/commons.py b/spaces/Artrajz/vits-simple-api/bert_vits2/commons.py
deleted file mode 100644
index 970489852841b0350f945b10e1c6e572860e9da8..0000000000000000000000000000000000000000
--- a/spaces/Artrajz/vits-simple-api/bert_vits2/commons.py
+++ /dev/null
@@ -1,161 +0,0 @@
-import math
-import numpy as np
-import torch
-from torch import nn
-from torch.nn import functional as F
-
-
-def init_weights(m, mean=0.0, std=0.01):
-    classname = m.__class__.__name__
-    if classname.find("Conv") != -1:
-        m.weight.data.normal_(mean, std)
-
-
-def get_padding(kernel_size, dilation=1):
-    return int((kernel_size * dilation - dilation) / 2)
-
-
-def convert_pad_shape(pad_shape):
-    l = pad_shape[::-1]
-    pad_shape = [item for sublist in l for item in sublist]
-    return pad_shape
-
-
-def intersperse(lst, item):
-    result = [item] * (len(lst) * 2 + 1)
-    result[1::2] = lst
-    return result
-
-
-def kl_divergence(m_p, logs_p, m_q, logs_q):
-    """KL(P||Q)"""
-    kl = (logs_q - logs_p) - 0.5
-    kl += 0.5 * (torch.exp(2. * logs_p) + ((m_p - m_q) ** 2)) * torch.exp(-2. * logs_q)
-    return kl
-
-
-def rand_gumbel(shape):
-    """Sample from the Gumbel distribution, protect from overflows."""
-    uniform_samples = torch.rand(shape) * 0.99998 + 0.00001
-    return -torch.log(-torch.log(uniform_samples))
-
-
-def rand_gumbel_like(x):
-    g = rand_gumbel(x.size()).to(dtype=x.dtype, device=x.device)
-    return g
-
-
-def slice_segments(x, ids_str, segment_size=4):
-    ret = torch.zeros_like(x[:, :, :segment_size])
-    for i in range(x.size(0)):
-        idx_str = ids_str[i]
-        idx_end = idx_str + segment_size
-        ret[i] = x[i, :, idx_str:idx_end]
-    return ret
-
-
-def rand_slice_segments(x, x_lengths=None, segment_size=4):
-    b, d, t = x.size()
-    if x_lengths is None:
-        x_lengths = t
-    ids_str_max = x_lengths - segment_size + 1
-    ids_str = (torch.rand([b]).to(device=x.device) * ids_str_max).to(dtype=torch.long)
-    ret = slice_segments(x, ids_str, segment_size)
-    return ret, ids_str
-
-
-def get_timing_signal_1d(
-        length, channels, min_timescale=1.0, max_timescale=1.0e4):
-    position = torch.arange(length, dtype=torch.float)
-    num_timescales = channels // 2
-    log_timescale_increment = (
-            math.log(float(max_timescale) / float(min_timescale)) /
-            (num_timescales - 1))
-    inv_timescales = min_timescale * torch.exp(
-        torch.arange(num_timescales, dtype=torch.float) * -log_timescale_increment)
-    scaled_time = position.unsqueeze(0) * inv_timescales.unsqueeze(1)
-    signal = torch.cat([torch.sin(scaled_time), torch.cos(scaled_time)], 0)
-    signal = F.pad(signal, [0, 0, 0, channels % 2])
-    signal = signal.view(1, channels, length)
-    return signal
-
-
-def add_timing_signal_1d(x, min_timescale=1.0, max_timescale=1.0e4):
-    b, channels, length = x.size()
-    signal = get_timing_signal_1d(length, channels, min_timescale, max_timescale)
-    return x + signal.to(dtype=x.dtype, device=x.device)
-
-
-def cat_timing_signal_1d(x, min_timescale=1.0, max_timescale=1.0e4, axis=1):
-    b, channels, length = x.size()
-    signal = get_timing_signal_1d(length, channels, min_timescale, max_timescale)
-    return torch.cat([x, signal.to(dtype=x.dtype, device=x.device)], axis)
-
-
-def subsequent_mask(length):
-    mask = torch.tril(torch.ones(length, length)).unsqueeze(0).unsqueeze(0)
-    return mask
-
-
-@torch.jit.script
-def fused_add_tanh_sigmoid_multiply(input_a, input_b, n_channels):
-    n_channels_int = n_channels[0]
-    in_act = input_a + input_b
-    t_act = torch.tanh(in_act[:, :n_channels_int, :])
-    s_act = torch.sigmoid(in_act[:, n_channels_int:, :])
-    acts = t_act * s_act
-    return acts
-
-
-def convert_pad_shape(pad_shape):
-    l = pad_shape[::-1]
-    pad_shape = [item for sublist in l for item in sublist]
-    return pad_shape
-
-
-def shift_1d(x):
-    x = F.pad(x, convert_pad_shape([[0, 0], [0, 0], [1, 0]]))[:, :, :-1]
-    return x
-
-
-def sequence_mask(length, max_length=None):
-    if max_length is None:
-        max_length = length.max()
-    x = torch.arange(max_length, dtype=length.dtype, device=length.device)
-    return x.unsqueeze(0) < length.unsqueeze(1)
-
-
-def generate_path(duration, mask):
-    """
-    duration: [b, 1, t_x]
-    mask: [b, 1, t_y, t_x]
-    """
-    device = duration.device
-
-    b, _, t_y, t_x = mask.shape
-    cum_duration = torch.cumsum(duration, -1)
-
-    cum_duration_flat = cum_duration.view(b * t_x)
-    path = sequence_mask(cum_duration_flat, t_y).to(mask.dtype)
-    path = path.view(b, t_x, t_y)
-    path = path - F.pad(path, convert_pad_shape([[0, 0], [1, 0], [0, 0]]))[:, :-1]
-    path = path.unsqueeze(1).transpose(2, 3) * mask
-    return path
-
-
-def clip_grad_value_(parameters, clip_value, norm_type=2):
-    if isinstance(parameters, torch.Tensor):
-        parameters = [parameters]
-    parameters = list(filter(lambda p: p.grad is not None, parameters))
-    norm_type = float(norm_type)
-    if clip_value is not None:
-        clip_value = float(clip_value)
-
-    total_norm = 0
-    for p in parameters:
-        param_norm = p.grad.data.norm(norm_type)
-        total_norm += param_norm.item() ** norm_type
-        if clip_value is not None:
-            p.grad.data.clamp_(min=-clip_value, max=clip_value)
-    total_norm = total_norm ** (1. / norm_type)
-    return total_norm
diff --git a/spaces/Ataturk-Chatbot/HuggingFaceChat/venv/lib/python3.11/site-packages/pip/_internal/network/auth.py b/spaces/Ataturk-Chatbot/HuggingFaceChat/venv/lib/python3.11/site-packages/pip/_internal/network/auth.py
deleted file mode 100644
index c0efa765c853c089c6b1469e82d2e94a2d1cb5e0..0000000000000000000000000000000000000000
--- a/spaces/Ataturk-Chatbot/HuggingFaceChat/venv/lib/python3.11/site-packages/pip/_internal/network/auth.py
+++ /dev/null
@@ -1,559 +0,0 @@
-"""Network Authentication Helpers
-
-Contains interface (MultiDomainBasicAuth) and associated glue code for
-providing credentials in the context of network requests.
-"""
-import logging
-import os
-import shutil
-import subprocess
-import sysconfig
-import typing
-import urllib.parse
-from abc import ABC, abstractmethod
-from functools import lru_cache
-from os.path import commonprefix
-from pathlib import Path
-from typing import Any, Dict, List, NamedTuple, Optional, Tuple
-
-from pip._vendor.requests.auth import AuthBase, HTTPBasicAuth
-from pip._vendor.requests.models import Request, Response
-from pip._vendor.requests.utils import get_netrc_auth
-
-from pip._internal.utils.logging import getLogger
-from pip._internal.utils.misc import (
-    ask,
-    ask_input,
-    ask_password,
-    remove_auth_from_url,
-    split_auth_netloc_from_url,
-)
-from pip._internal.vcs.versioncontrol import AuthInfo
-
-logger = getLogger(__name__)
-
-KEYRING_DISABLED = False
-
-
-class Credentials(NamedTuple):
-    url: str
-    username: str
-    password: str
-
-
-class KeyRingBaseProvider(ABC):
-    """Keyring base provider interface"""
-
-    has_keyring: bool
-
-    @abstractmethod
-    def get_auth_info(self, url: str, username: Optional[str]) -> Optional[AuthInfo]:
-        ...
-
-    @abstractmethod
-    def save_auth_info(self, url: str, username: str, password: str) -> None:
-        ...
-
-
-class KeyRingNullProvider(KeyRingBaseProvider):
-    """Keyring null provider"""
-
-    has_keyring = False
-
-    def get_auth_info(self, url: str, username: Optional[str]) -> Optional[AuthInfo]:
-        return None
-
-    def save_auth_info(self, url: str, username: str, password: str) -> None:
-        return None
-
-
-class KeyRingPythonProvider(KeyRingBaseProvider):
-    """Keyring interface which uses locally imported `keyring`"""
-
-    has_keyring = True
-
-    def __init__(self) -> None:
-        import keyring
-
-        self.keyring = keyring
-
-    def get_auth_info(self, url: str, username: Optional[str]) -> Optional[AuthInfo]:
-        # Support keyring's get_credential interface which supports getting
-        # credentials without a username. This is only available for
-        # keyring>=15.2.0.
-        if hasattr(self.keyring, "get_credential"):
-            logger.debug("Getting credentials from keyring for %s", url)
-            cred = self.keyring.get_credential(url, username)
-            if cred is not None:
-                return cred.username, cred.password
-            return None
-
-        if username is not None:
-            logger.debug("Getting password from keyring for %s", url)
-            password = self.keyring.get_password(url, username)
-            if password:
-                return username, password
-        return None
-
-    def save_auth_info(self, url: str, username: str, password: str) -> None:
-        self.keyring.set_password(url, username, password)
-
-
-class KeyRingCliProvider(KeyRingBaseProvider):
-    """Provider which uses `keyring` cli
-
-    Instead of calling the keyring package installed alongside pip
-    we call keyring on the command line which will enable pip to
-    use which ever installation of keyring is available first in
-    PATH.
-    """
-
-    has_keyring = True
-
-    def __init__(self, cmd: str) -> None:
-        self.keyring = cmd
-
-    def get_auth_info(self, url: str, username: Optional[str]) -> Optional[AuthInfo]:
-        # This is the default implementation of keyring.get_credential
-        # https://github.com/jaraco/keyring/blob/97689324abcf01bd1793d49063e7ca01e03d7d07/keyring/backend.py#L134-L139
-        if username is not None:
-            password = self._get_password(url, username)
-            if password is not None:
-                return username, password
-        return None
-
-    def save_auth_info(self, url: str, username: str, password: str) -> None:
-        return self._set_password(url, username, password)
-
-    def _get_password(self, service_name: str, username: str) -> Optional[str]:
-        """Mirror the implementation of keyring.get_password using cli"""
-        if self.keyring is None:
-            return None
-
-        cmd = [self.keyring, "get", service_name, username]
-        env = os.environ.copy()
-        env["PYTHONIOENCODING"] = "utf-8"
-        res = subprocess.run(
-            cmd,
-            stdin=subprocess.DEVNULL,
-            stdout=subprocess.PIPE,
-            env=env,
-        )
-        if res.returncode:
-            return None
-        return res.stdout.decode("utf-8").strip(os.linesep)
-
-    def _set_password(self, service_name: str, username: str, password: str) -> None:
-        """Mirror the implementation of keyring.set_password using cli"""
-        if self.keyring is None:
-            return None
-        env = os.environ.copy()
-        env["PYTHONIOENCODING"] = "utf-8"
-        subprocess.run(
-            [self.keyring, "set", service_name, username],
-            input=f"{password}{os.linesep}".encode("utf-8"),
-            env=env,
-            check=True,
-        )
-        return None
-
-
-@lru_cache(maxsize=None)
-def get_keyring_provider(provider: str) -> KeyRingBaseProvider:
-    logger.verbose("Keyring provider requested: %s", provider)
-
-    # keyring has previously failed and been disabled
-    if KEYRING_DISABLED:
-        provider = "disabled"
-    if provider in ["import", "auto"]:
-        try:
-            impl = KeyRingPythonProvider()
-            logger.verbose("Keyring provider set: import")
-            return impl
-        except ImportError:
-            pass
-        except Exception as exc:
-            # In the event of an unexpected exception
-            # we should warn the user
-            msg = "Installed copy of keyring fails with exception %s"
-            if provider == "auto":
-                msg = msg + ", trying to find a keyring executable as a fallback"
-            logger.warning(msg, exc, exc_info=logger.isEnabledFor(logging.DEBUG))
-    if provider in ["subprocess", "auto"]:
-        cli = shutil.which("keyring")
-        if cli and cli.startswith(sysconfig.get_path("scripts")):
-            # all code within this function is stolen from shutil.which implementation
-            @typing.no_type_check
-            def PATH_as_shutil_which_determines_it() -> str:
-                path = os.environ.get("PATH", None)
-                if path is None:
-                    try:
-                        path = os.confstr("CS_PATH")
-                    except (AttributeError, ValueError):
-                        # os.confstr() or CS_PATH is not available
-                        path = os.defpath
-                # bpo-35755: Don't use os.defpath if the PATH environment variable is
-                # set to an empty string
-
-                return path
-
-            scripts = Path(sysconfig.get_path("scripts"))
-
-            paths = []
-            for path in PATH_as_shutil_which_determines_it().split(os.pathsep):
-                p = Path(path)
-                try:
-                    if not p.samefile(scripts):
-                        paths.append(path)
-                except FileNotFoundError:
-                    pass
-
-            path = os.pathsep.join(paths)
-
-            cli = shutil.which("keyring", path=path)
-
-        if cli:
-            logger.verbose("Keyring provider set: subprocess with executable %s", cli)
-            return KeyRingCliProvider(cli)
-
-    logger.verbose("Keyring provider set: disabled")
-    return KeyRingNullProvider()
-
-
-class MultiDomainBasicAuth(AuthBase):
-    def __init__(
-        self,
-        prompting: bool = True,
-        index_urls: Optional[List[str]] = None,
-        keyring_provider: str = "auto",
-    ) -> None:
-        self.prompting = prompting
-        self.index_urls = index_urls
-        self.keyring_provider = keyring_provider  # type: ignore[assignment]
-        self.passwords: Dict[str, AuthInfo] = {}
-        # When the user is prompted to enter credentials and keyring is
-        # available, we will offer to save them. If the user accepts,
-        # this value is set to the credentials they entered. After the
-        # request authenticates, the caller should call
-        # ``save_credentials`` to save these.
-        self._credentials_to_save: Optional[Credentials] = None
-
-    @property
-    def keyring_provider(self) -> KeyRingBaseProvider:
-        return get_keyring_provider(self._keyring_provider)
-
-    @keyring_provider.setter
-    def keyring_provider(self, provider: str) -> None:
-        # The free function get_keyring_provider has been decorated with
-        # functools.cache. If an exception occurs in get_keyring_auth that
-        # cache will be cleared and keyring disabled, take that into account
-        # if you want to remove this indirection.
-        self._keyring_provider = provider
-
-    @property
-    def use_keyring(self) -> bool:
-        # We won't use keyring when --no-input is passed unless
-        # a specific provider is requested because it might require
-        # user interaction
-        return self.prompting or self._keyring_provider not in ["auto", "disabled"]
-
-    def _get_keyring_auth(
-        self,
-        url: Optional[str],
-        username: Optional[str],
-    ) -> Optional[AuthInfo]:
-        """Return the tuple auth for a given url from keyring."""
-        # Do nothing if no url was provided
-        if not url:
-            return None
-
-        try:
-            return self.keyring_provider.get_auth_info(url, username)
-        except Exception as exc:
-            logger.warning(
-                "Keyring is skipped due to an exception: %s",
-                str(exc),
-            )
-            global KEYRING_DISABLED
-            KEYRING_DISABLED = True
-            get_keyring_provider.cache_clear()
-            return None
-
-    def _get_index_url(self, url: str) -> Optional[str]:
-        """Return the original index URL matching the requested URL.
-
-        Cached or dynamically generated credentials may work against
-        the original index URL rather than just the netloc.
-
-        The provided url should have had its username and password
-        removed already. If the original index url had credentials then
-        they will be included in the return value.
-
-        Returns None if no matching index was found, or if --no-index
-        was specified by the user.
-        """
-        if not url or not self.index_urls:
-            return None
-
-        url = remove_auth_from_url(url).rstrip("/") + "/"
-        parsed_url = urllib.parse.urlsplit(url)
-
-        candidates = []
-
-        for index in self.index_urls:
-            index = index.rstrip("/") + "/"
-            parsed_index = urllib.parse.urlsplit(remove_auth_from_url(index))
-            if parsed_url == parsed_index:
-                return index
-
-            if parsed_url.netloc != parsed_index.netloc:
-                continue
-
-            candidate = urllib.parse.urlsplit(index)
-            candidates.append(candidate)
-
-        if not candidates:
-            return None
-
-        candidates.sort(
-            reverse=True,
-            key=lambda candidate: commonprefix(
-                [
-                    parsed_url.path,
-                    candidate.path,
-                ]
-            ).rfind("/"),
-        )
-
-        return urllib.parse.urlunsplit(candidates[0])
-
-    def _get_new_credentials(
-        self,
-        original_url: str,
-        *,
-        allow_netrc: bool = True,
-        allow_keyring: bool = False,
-    ) -> AuthInfo:
-        """Find and return credentials for the specified URL."""
-        # Split the credentials and netloc from the url.
-        url, netloc, url_user_password = split_auth_netloc_from_url(
-            original_url,
-        )
-
-        # Start with the credentials embedded in the url
-        username, password = url_user_password
-        if username is not None and password is not None:
-            logger.debug("Found credentials in url for %s", netloc)
-            return url_user_password
-
-        # Find a matching index url for this request
-        index_url = self._get_index_url(url)
-        if index_url:
-            # Split the credentials from the url.
-            index_info = split_auth_netloc_from_url(index_url)
-            if index_info:
-                index_url, _, index_url_user_password = index_info
-                logger.debug("Found index url %s", index_url)
-
-        # If an index URL was found, try its embedded credentials
-        if index_url and index_url_user_password[0] is not None:
-            username, password = index_url_user_password
-            if username is not None and password is not None:
-                logger.debug("Found credentials in index url for %s", netloc)
-                return index_url_user_password
-
-        # Get creds from netrc if we still don't have them
-        if allow_netrc:
-            netrc_auth = get_netrc_auth(original_url)
-            if netrc_auth:
-                logger.debug("Found credentials in netrc for %s", netloc)
-                return netrc_auth
-
-        # If we don't have a password and keyring is available, use it.
-        if allow_keyring:
-            # The index url is more specific than the netloc, so try it first
-            # fmt: off
-            kr_auth = (
-                self._get_keyring_auth(index_url, username) or
-                self._get_keyring_auth(netloc, username)
-            )
-            # fmt: on
-            if kr_auth:
-                logger.debug("Found credentials in keyring for %s", netloc)
-                return kr_auth
-
-        return username, password
-
-    def _get_url_and_credentials(
-        self, original_url: str
-    ) -> Tuple[str, Optional[str], Optional[str]]:
-        """Return the credentials to use for the provided URL.
-
-        If allowed, netrc and keyring may be used to obtain the
-        correct credentials.
-
-        Returns (url_without_credentials, username, password). Note
-        that even if the original URL contains credentials, this
-        function may return a different username and password.
-        """
-        url, netloc, _ = split_auth_netloc_from_url(original_url)
-
-        # Try to get credentials from original url
-        username, password = self._get_new_credentials(original_url)
-
-        # If credentials not found, use any stored credentials for this netloc.
-        # Do this if either the username or the password is missing.
-        # This accounts for the situation in which the user has specified
-        # the username in the index url, but the password comes from keyring.
-        if (username is None or password is None) and netloc in self.passwords:
-            un, pw = self.passwords[netloc]
-            # It is possible that the cached credentials are for a different username,
-            # in which case the cache should be ignored.
-            if username is None or username == un:
-                username, password = un, pw
-
-        if username is not None or password is not None:
-            # Convert the username and password if they're None, so that
-            # this netloc will show up as "cached" in the conditional above.
-            # Further, HTTPBasicAuth doesn't accept None, so it makes sense to
-            # cache the value that is going to be used.
-            username = username or ""
-            password = password or ""
-
-            # Store any acquired credentials.
-            self.passwords[netloc] = (username, password)
-
-        assert (
-            # Credentials were found
-            (username is not None and password is not None)
-            # Credentials were not found
-            or (username is None and password is None)
-        ), f"Could not load credentials from url: {original_url}"
-
-        return url, username, password
-
-    def __call__(self, req: Request) -> Request:
-        # Get credentials for this request
-        url, username, password = self._get_url_and_credentials(req.url)
-
-        # Set the url of the request to the url without any credentials
-        req.url = url
-
-        if username is not None and password is not None:
-            # Send the basic auth with this request
-            req = HTTPBasicAuth(username, password)(req)
-
-        # Attach a hook to handle 401 responses
-        req.register_hook("response", self.handle_401)
-
-        return req
-
-    # Factored out to allow for easy patching in tests
-    def _prompt_for_password(
-        self, netloc: str
-    ) -> Tuple[Optional[str], Optional[str], bool]:
-        username = ask_input(f"User for {netloc}: ") if self.prompting else None
-        if not username:
-            return None, None, False
-        if self.use_keyring:
-            auth = self._get_keyring_auth(netloc, username)
-            if auth and auth[0] is not None and auth[1] is not None:
-                return auth[0], auth[1], False
-        password = ask_password("Password: ")
-        return username, password, True
-
-    # Factored out to allow for easy patching in tests
-    def _should_save_password_to_keyring(self) -> bool:
-        if (
-            not self.prompting
-            or not self.use_keyring
-            or not self.keyring_provider.has_keyring
-        ):
-            return False
-        return ask("Save credentials to keyring [y/N]: ", ["y", "n"]) == "y"
-
-    def handle_401(self, resp: Response, **kwargs: Any) -> Response:
-        # We only care about 401 responses, anything else we want to just
-        #   pass through the actual response
-        if resp.status_code != 401:
-            return resp
-
-        username, password = None, None
-
-        # Query the keyring for credentials:
-        if self.use_keyring:
-            username, password = self._get_new_credentials(
-                resp.url,
-                allow_netrc=False,
-                allow_keyring=True,
-            )
-
-        # We are not able to prompt the user so simply return the response
-        if not self.prompting and not username and not password:
-            return resp
-
-        parsed = urllib.parse.urlparse(resp.url)
-
-        # Prompt the user for a new username and password
-        save = False
-        if not username and not password:
-            username, password, save = self._prompt_for_password(parsed.netloc)
-
-        # Store the new username and password to use for future requests
-        self._credentials_to_save = None
-        if username is not None and password is not None:
-            self.passwords[parsed.netloc] = (username, password)
-
-            # Prompt to save the password to keyring
-            if save and self._should_save_password_to_keyring():
-                self._credentials_to_save = Credentials(
-                    url=parsed.netloc,
-                    username=username,
-                    password=password,
-                )
-
-        # Consume content and release the original connection to allow our new
-        #   request to reuse the same one.
-        resp.content
-        resp.raw.release_conn()
-
-        # Add our new username and password to the request
-        req = HTTPBasicAuth(username or "", password or "")(resp.request)
-        req.register_hook("response", self.warn_on_401)
-
-        # On successful request, save the credentials that were used to
-        # keyring. (Note that if the user responded "no" above, this member
-        # is not set and nothing will be saved.)
-        if self._credentials_to_save:
-            req.register_hook("response", self.save_credentials)
-
-        # Send our new request
-        new_resp = resp.connection.send(req, **kwargs)
-        new_resp.history.append(resp)
-
-        return new_resp
-
-    def warn_on_401(self, resp: Response, **kwargs: Any) -> None:
-        """Response callback to warn about incorrect credentials."""
-        if resp.status_code == 401:
-            logger.warning(
-                "401 Error, Credentials not correct for %s",
-                resp.request.url,
-            )
-
-    def save_credentials(self, resp: Response, **kwargs: Any) -> None:
-        """Response callback to save credentials on success."""
-        assert (
-            self.keyring_provider.has_keyring
-        ), "should never reach here without keyring"
-
-        creds = self._credentials_to_save
-        self._credentials_to_save = None
-        if creds and resp.status_code < 400:
-            try:
-                logger.info("Saving credentials to keyring")
-                self.keyring_provider.save_auth_info(
-                    creds.url, creds.username, creds.password
-                )
-            except Exception:
-                logger.exception("Failed to save credentials")
diff --git a/spaces/Ataturk-Chatbot/HuggingFaceChat/venv/lib/python3.11/site-packages/pip/_vendor/requests/exceptions.py b/spaces/Ataturk-Chatbot/HuggingFaceChat/venv/lib/python3.11/site-packages/pip/_vendor/requests/exceptions.py
deleted file mode 100644
index 168d07390dfc366102b8197e4b271e493bd94d11..0000000000000000000000000000000000000000
--- a/spaces/Ataturk-Chatbot/HuggingFaceChat/venv/lib/python3.11/site-packages/pip/_vendor/requests/exceptions.py
+++ /dev/null
@@ -1,141 +0,0 @@
-"""
-requests.exceptions
-~~~~~~~~~~~~~~~~~~~
-
-This module contains the set of Requests' exceptions.
-"""
-from pip._vendor.urllib3.exceptions import HTTPError as BaseHTTPError
-
-from .compat import JSONDecodeError as CompatJSONDecodeError
-
-
-class RequestException(IOError):
-    """There was an ambiguous exception that occurred while handling your
-    request.
-    """
-
-    def __init__(self, *args, **kwargs):
-        """Initialize RequestException with `request` and `response` objects."""
-        response = kwargs.pop("response", None)
-        self.response = response
-        self.request = kwargs.pop("request", None)
-        if response is not None and not self.request and hasattr(response, "request"):
-            self.request = self.response.request
-        super().__init__(*args, **kwargs)
-
-
-class InvalidJSONError(RequestException):
-    """A JSON error occurred."""
-
-
-class JSONDecodeError(InvalidJSONError, CompatJSONDecodeError):
-    """Couldn't decode the text into json"""
-
-    def __init__(self, *args, **kwargs):
-        """
-        Construct the JSONDecodeError instance first with all
-        args. Then use it's args to construct the IOError so that
-        the json specific args aren't used as IOError specific args
-        and the error message from JSONDecodeError is preserved.
-        """
-        CompatJSONDecodeError.__init__(self, *args)
-        InvalidJSONError.__init__(self, *self.args, **kwargs)
-
-
-class HTTPError(RequestException):
-    """An HTTP error occurred."""
-
-
-class ConnectionError(RequestException):
-    """A Connection error occurred."""
-
-
-class ProxyError(ConnectionError):
-    """A proxy error occurred."""
-
-
-class SSLError(ConnectionError):
-    """An SSL error occurred."""
-
-
-class Timeout(RequestException):
-    """The request timed out.
-
-    Catching this error will catch both
-    :exc:`~requests.exceptions.ConnectTimeout` and
-    :exc:`~requests.exceptions.ReadTimeout` errors.
-    """
-
-
-class ConnectTimeout(ConnectionError, Timeout):
-    """The request timed out while trying to connect to the remote server.
-
-    Requests that produced this error are safe to retry.
-    """
-
-
-class ReadTimeout(Timeout):
-    """The server did not send any data in the allotted amount of time."""
-
-
-class URLRequired(RequestException):
-    """A valid URL is required to make a request."""
-
-
-class TooManyRedirects(RequestException):
-    """Too many redirects."""
-
-
-class MissingSchema(RequestException, ValueError):
-    """The URL scheme (e.g. http or https) is missing."""
-
-
-class InvalidSchema(RequestException, ValueError):
-    """The URL scheme provided is either invalid or unsupported."""
-
-
-class InvalidURL(RequestException, ValueError):
-    """The URL provided was somehow invalid."""
-
-
-class InvalidHeader(RequestException, ValueError):
-    """The header value provided was somehow invalid."""
-
-
-class InvalidProxyURL(InvalidURL):
-    """The proxy URL provided is invalid."""
-
-
-class ChunkedEncodingError(RequestException):
-    """The server declared chunked encoding but sent an invalid chunk."""
-
-
-class ContentDecodingError(RequestException, BaseHTTPError):
-    """Failed to decode response content."""
-
-
-class StreamConsumedError(RequestException, TypeError):
-    """The content for this response was already consumed."""
-
-
-class RetryError(RequestException):
-    """Custom retries logic failed"""
-
-
-class UnrewindableBodyError(RequestException):
-    """Requests encountered an error when trying to rewind a body."""
-
-
-# Warnings
-
-
-class RequestsWarning(Warning):
-    """Base warning for Requests."""
-
-
-class FileModeWarning(RequestsWarning, DeprecationWarning):
-    """A file was opened in text mode, but Requests determined its binary length."""
-
-
-class RequestsDependencyWarning(RequestsWarning):
-    """An imported dependency doesn't match the expected version range."""
diff --git a/spaces/Awiny/Image2Paragraph/models/grit_src/third_party/CenterNet2/configs/common/models/fcos.py b/spaces/Awiny/Image2Paragraph/models/grit_src/third_party/CenterNet2/configs/common/models/fcos.py
deleted file mode 100644
index 1c752029b7fc64ec375a55182e5342c9eb48bb33..0000000000000000000000000000000000000000
--- a/spaces/Awiny/Image2Paragraph/models/grit_src/third_party/CenterNet2/configs/common/models/fcos.py
+++ /dev/null
@@ -1,23 +0,0 @@
-from detectron2.modeling.meta_arch.fcos import FCOS, FCOSHead
-
-from .retinanet import model
-
-model._target_ = FCOS
-
-del model.anchor_generator
-del model.box2box_transform
-del model.anchor_matcher
-del model.input_format
-
-# Use P5 instead of C5 to compute P6/P7
-# (Sec 2.2 of https://arxiv.org/abs/2006.09214)
-model.backbone.top_block.in_feature = "p5"
-model.backbone.top_block.in_channels = 256
-
-# New score threshold determined based on sqrt(cls_score * centerness)
-model.test_score_thresh = 0.2
-model.test_nms_thresh = 0.6
-
-model.head._target_ = FCOSHead
-del model.head.num_anchors
-model.head.norm = "GN"
diff --git a/spaces/AzumaSeren100/XuanShen-Bert-VITS2/app.py b/spaces/AzumaSeren100/XuanShen-Bert-VITS2/app.py
deleted file mode 100644
index d5a1f79c8f4b85520530af6d2b4e7b166108c6dd..0000000000000000000000000000000000000000
--- a/spaces/AzumaSeren100/XuanShen-Bert-VITS2/app.py
+++ /dev/null
@@ -1,144 +0,0 @@
-import sys, os
-
-if sys.platform == "darwin":
-    os.environ["PYTORCH_ENABLE_MPS_FALLBACK"] = "1"
-
-import logging
-
-logging.getLogger("numba").setLevel(logging.WARNING)
-logging.getLogger("markdown_it").setLevel(logging.WARNING)
-logging.getLogger("urllib3").setLevel(logging.WARNING)
-logging.getLogger("matplotlib").setLevel(logging.WARNING)
-
-logging.basicConfig(level=logging.INFO, format="| %(name)s | %(levelname)s | %(message)s")
-
-logger = logging.getLogger(__name__)
-
-import torch
-import argparse
-import commons
-import utils
-from models import SynthesizerTrn
-from text.symbols import symbols
-from text import cleaned_text_to_sequence, get_bert
-from text.cleaner import clean_text
-import gradio as gr
-import webbrowser
-
-
-net_g = None
-
-
-def get_text(text, language_str, hps):
-    norm_text, phone, tone, word2ph = clean_text(text, language_str)
-    phone, tone, language = cleaned_text_to_sequence(phone, tone, language_str)
-
-    if hps.data.add_blank:
-        phone = commons.intersperse(phone, 0)
-        tone = commons.intersperse(tone, 0)
-        language = commons.intersperse(language, 0)
-        for i in range(len(word2ph)):
-            word2ph[i] = word2ph[i] * 2
-        word2ph[0] += 1
-    bert = get_bert(norm_text, word2ph, language_str)
-    del word2ph
-
-    assert bert.shape[-1] == len(phone)
-
-    phone = torch.LongTensor(phone)
-    tone = torch.LongTensor(tone)
-    language = torch.LongTensor(language)
-
-    return bert, phone, tone, language
-
-def infer(text, sdp_ratio, noise_scale, noise_scale_w, length_scale, sid):
-    global net_g
-    bert, phones, tones, lang_ids = get_text(text, "ZH", hps)
-    with torch.no_grad():
-        x_tst=phones.to(device).unsqueeze(0)
-        tones=tones.to(device).unsqueeze(0)
-        lang_ids=lang_ids.to(device).unsqueeze(0)
-        bert = bert.to(device).unsqueeze(0)
-        x_tst_lengths = torch.LongTensor([phones.size(0)]).to(device)
-        del phones
-        speakers = torch.LongTensor([hps.data.spk2id[sid]]).to(device)
-        audio = net_g.infer(x_tst, x_tst_lengths, speakers, tones, lang_ids, bert, sdp_ratio=sdp_ratio
-                           , noise_scale=noise_scale, noise_scale_w=noise_scale_w, length_scale=length_scale)[0][0,0].data.cpu().float().numpy()
-        del x_tst, tones, lang_ids, bert, x_tst_lengths, speakers
-        return audio
-
-def tts_fn(text, speaker, sdp_ratio, noise_scale, noise_scale_w, length_scale):
-    with torch.no_grad():
-        audio = infer(text, sdp_ratio=sdp_ratio, noise_scale=noise_scale, noise_scale_w=noise_scale_w, length_scale=length_scale, sid=speaker)
-    return "Success", (hps.data.sampling_rate, audio)
-
-
-if __name__ == "__main__":
-    parser = argparse.ArgumentParser()
-    # parser.add_argument("-m", "--model", default="./logs/dxl/G21200.pth", help="path of your model")
-    parser.add_argument("-mn", "--model_name", default="xuanshen", help="path of your model")
-    parser.add_argument("-m", "--model", default="null", help="path of your model")
-    parser.add_argument("-c", "--config", default="./configs/config.json", help="path of your config file")
-    parser.add_argument("--share", default=True, help="make link public")
-    parser.add_argument("-d", "--debug", action="store_true", help="enable DEBUG-LEVEL log")
-
-    args = parser.parse_args()
-    if args.debug:
-        logger.info("Enable DEBUG-LEVEL log")
-        logging.basicConfig(level=logging.DEBUG)
-    hps = utils.get_hparams_from_file(args.config)
-
-    device = (
-        "cuda:0"
-        if torch.cuda.is_available()
-        else (
-            "mps"
-            if sys.platform == "darwin" and torch.backends.mps.is_available()
-            else "cpu"
-        )
-    )
-    net_g = SynthesizerTrn(
-        len(symbols),
-        hps.data.filter_length // 2 + 1,
-        hps.train.segment_size // hps.data.hop_length,
-        n_speakers=hps.data.n_speakers,
-        **hps.model).to(device)
-    _ = net_g.eval()
-
-    model_path = args.model
-    if not os.path.exists(model_path) or model_path == "null":
-        model_path = utils.latest_checkpoint_path(os.path.join("./logs/",args.model_name), "G_*.pth")
-
-    _ = utils.load_checkpoint(model_path, net_g, None, skip_optimizer=True)
-
-    speaker_ids = hps.data.spk2id
-    speakers = list(speaker_ids.keys())
-    with gr.Blocks() as app:
-        with gr.Row():
-            with gr.Column():
-                gr.Markdown(value="""
-                炫神Bert-vits2语音在线生成\n
-                作者：东洋雪莲 https://space.bilibili.com/1060544882\n
-                声音归属：炫神 https://space.bilibili.com/299013902\n
-                Bert-VITS2项目：https://github.com/Stardust-minus/Bert-VITS2\n
-                使用请严格遵守法律法规！\n
-                二创请标注项目链接、简介声明使用Bert-VITS2生成\n                
-                """)
-                text = gr.TextArea(label="Text", placeholder="Input Text Here",
-                                      value="你妈的我顶死你！")
-                speaker = gr.Dropdown(choices=speakers, value=speakers[0], label='Speaker')
-                sdp_ratio = gr.Slider(minimum=0, maximum=1, value=0.2, step=0.1, label='SDP Ratio')
-                noise_scale = gr.Slider(minimum=0.1, maximum=2, value=0.6, step=0.1, label='Noise Scale')
-                noise_scale_w = gr.Slider(minimum=0.1, maximum=2, value=0.9, step=0.1, label='Noise Scale W')
-                length_scale = gr.Slider(minimum=0.1, maximum=2, value=1, step=0.1, label='Length Scale')
-                btn = gr.Button("Generate!", variant="primary")
-            with gr.Column():
-                text_output = gr.Textbox(label="Message")
-                audio_output = gr.Audio(label="Output Audio")
-
-        btn.click(tts_fn,
-                inputs=[text, speaker, sdp_ratio, noise_scale, noise_scale_w, length_scale],
-                outputs=[text_output, audio_output])
-    
-    webbrowser.open("http://127.0.0.1:7860")
-    app.launch(share=args.share)
diff --git a/spaces/Bart92/RVC_HF/infer/lib/uvr5_pack/lib_v5/layers_537227KB.py b/spaces/Bart92/RVC_HF/infer/lib/uvr5_pack/lib_v5/layers_537227KB.py
deleted file mode 100644
index 9b127bc6427f5c60c8cf85603a3d8a093c3501c4..0000000000000000000000000000000000000000
--- a/spaces/Bart92/RVC_HF/infer/lib/uvr5_pack/lib_v5/layers_537227KB.py
+++ /dev/null
@@ -1,126 +0,0 @@
-import torch
-import torch.nn.functional as F
-from torch import nn
-
-from . import spec_utils
-
-
-class Conv2DBNActiv(nn.Module):
-    def __init__(self, nin, nout, ksize=3, stride=1, pad=1, dilation=1, activ=nn.ReLU):
-        super(Conv2DBNActiv, self).__init__()
-        self.conv = nn.Sequential(
-            nn.Conv2d(
-                nin,
-                nout,
-                kernel_size=ksize,
-                stride=stride,
-                padding=pad,
-                dilation=dilation,
-                bias=False,
-            ),
-            nn.BatchNorm2d(nout),
-            activ(),
-        )
-
-    def __call__(self, x):
-        return self.conv(x)
-
-
-class SeperableConv2DBNActiv(nn.Module):
-    def __init__(self, nin, nout, ksize=3, stride=1, pad=1, dilation=1, activ=nn.ReLU):
-        super(SeperableConv2DBNActiv, self).__init__()
-        self.conv = nn.Sequential(
-            nn.Conv2d(
-                nin,
-                nin,
-                kernel_size=ksize,
-                stride=stride,
-                padding=pad,
-                dilation=dilation,
-                groups=nin,
-                bias=False,
-            ),
-            nn.Conv2d(nin, nout, kernel_size=1, bias=False),
-            nn.BatchNorm2d(nout),
-            activ(),
-        )
-
-    def __call__(self, x):
-        return self.conv(x)
-
-
-class Encoder(nn.Module):
-    def __init__(self, nin, nout, ksize=3, stride=1, pad=1, activ=nn.LeakyReLU):
-        super(Encoder, self).__init__()
-        self.conv1 = Conv2DBNActiv(nin, nout, ksize, 1, pad, activ=activ)
-        self.conv2 = Conv2DBNActiv(nout, nout, ksize, stride, pad, activ=activ)
-
-    def __call__(self, x):
-        skip = self.conv1(x)
-        h = self.conv2(skip)
-
-        return h, skip
-
-
-class Decoder(nn.Module):
-    def __init__(
-        self, nin, nout, ksize=3, stride=1, pad=1, activ=nn.ReLU, dropout=False
-    ):
-        super(Decoder, self).__init__()
-        self.conv = Conv2DBNActiv(nin, nout, ksize, 1, pad, activ=activ)
-        self.dropout = nn.Dropout2d(0.1) if dropout else None
-
-    def __call__(self, x, skip=None):
-        x = F.interpolate(x, scale_factor=2, mode="bilinear", align_corners=True)
-        if skip is not None:
-            skip = spec_utils.crop_center(skip, x)
-            x = torch.cat([x, skip], dim=1)
-        h = self.conv(x)
-
-        if self.dropout is not None:
-            h = self.dropout(h)
-
-        return h
-
-
-class ASPPModule(nn.Module):
-    def __init__(self, nin, nout, dilations=(4, 8, 16, 32, 64), activ=nn.ReLU):
-        super(ASPPModule, self).__init__()
-        self.conv1 = nn.Sequential(
-            nn.AdaptiveAvgPool2d((1, None)),
-            Conv2DBNActiv(nin, nin, 1, 1, 0, activ=activ),
-        )
-        self.conv2 = Conv2DBNActiv(nin, nin, 1, 1, 0, activ=activ)
-        self.conv3 = SeperableConv2DBNActiv(
-            nin, nin, 3, 1, dilations[0], dilations[0], activ=activ
-        )
-        self.conv4 = SeperableConv2DBNActiv(
-            nin, nin, 3, 1, dilations[1], dilations[1], activ=activ
-        )
-        self.conv5 = SeperableConv2DBNActiv(
-            nin, nin, 3, 1, dilations[2], dilations[2], activ=activ
-        )
-        self.conv6 = SeperableConv2DBNActiv(
-            nin, nin, 3, 1, dilations[2], dilations[2], activ=activ
-        )
-        self.conv7 = SeperableConv2DBNActiv(
-            nin, nin, 3, 1, dilations[2], dilations[2], activ=activ
-        )
-        self.bottleneck = nn.Sequential(
-            Conv2DBNActiv(nin * 7, nout, 1, 1, 0, activ=activ), nn.Dropout2d(0.1)
-        )
-
-    def forward(self, x):
-        _, _, h, w = x.size()
-        feat1 = F.interpolate(
-            self.conv1(x), size=(h, w), mode="bilinear", align_corners=True
-        )
-        feat2 = self.conv2(x)
-        feat3 = self.conv3(x)
-        feat4 = self.conv4(x)
-        feat5 = self.conv5(x)
-        feat6 = self.conv6(x)
-        feat7 = self.conv7(x)
-        out = torch.cat((feat1, feat2, feat3, feat4, feat5, feat6, feat7), dim=1)
-        bottle = self.bottleneck(out)
-        return bottle
diff --git a/spaces/Benson/text-generation/Examples/Bombsquad Mod Apk ltima Versin.md b/spaces/Benson/text-generation/Examples/Bombsquad Mod Apk ltima Versin.md
deleted file mode 100644
index 4c16091de8a682698f6eab7ee871082f0c269ed5..0000000000000000000000000000000000000000
--- a/spaces/Benson/text-generation/Examples/Bombsquad Mod Apk ltima Versin.md	
+++ /dev/null
@@ -1,97 +0,0 @@
-
-<h1>BombSquad Mod APK última versión: Todo lo que necesita saber</h1>
-<p>¿Te encanta volar cosas con tus amigos? ¿Te gusta jugar minijuegos que involucran piratas, ninjas, bárbaros y chefs locos? Si respondiste afirmativamente a cualquiera de estas preguntas, quizás quieras echar un vistazo a BombSquad, un divertido y explosivo juego multijugador que te mantendrá entretenido durante horas. Y si quieres hacer el juego aún más emocionante, se puede descargar el BombSquad Mod APK última versión, que le da acceso a todas las características desbloqueadas y recursos ilimitados. En este artículo, le diremos todo lo que necesita saber sobre BombSquad y su versión modded, incluyendo cómo descargar, instalar y jugar. </p>
-<h2>bombsquad mod apk última versión</h2><br /><p><b><b>DOWNLOAD</b> &gt; <a href="https://bltlly.com/2v6Jyb">https://bltlly.com/2v6Jyb</a></b></p><br /><br />
- <h2>¿Qué es BombSquad? </h2>
-<h3>Un divertido y explosivo juego multijugador</h3>
-<p>BombSquad es un juego lleno de acción que te permite volar a tus amigos en varios minijuegos que van desde la captura de la bandera de hockey. Puedes jugar con hasta 8 jugadores a nivel local o online, usando tus dispositivos como controladores. El juego cuenta con la física avanzada ragdoll, explosiones gratuitas y personajes hilarantes que te harán reír en voz alta. También puedes personalizar tu personaje con diferentes atuendos, accesorios y burlas. </p>
- <h3>Características de BombSquad</h3>
-<p>Algunas de las características que hacen de BombSquad un gran juego son:</p>
-<ul>
-<li>Más de 20 minijuegos diferentes para elegir, como King of the Hill, Bomber Hockey, Capture the Flag, Epic Slow Motion Elimination y más. </li>
-<li>Una variedad de mapas y entornos para explorar, como islas, castillos, estadios y barcos piratas. </li>
-<li>Una amplia gama de bombas y armas para usar, como bombas pegajosas, bombas de hielo, guantes de boxeo, minas terrestres y más. </li>
-<li>Una interfaz divertida y fácil de usar que te permite crear tus propios minijuegos y compartirlos con otros jugadores. </li>
-<li>Una banda sonora que coincide con el estado de ánimo y la intensidad del juego. </li>
-</ul>
- <h2>¿Qué es BombSquad Mod APK? </h2>
-
-<p>BombSquad Mod APK es una versión modificada del juego original que le da algunos beneficios y ventajas adicionales. No es una aplicación oficial del desarrollador, sino una aplicación de terceros que ha sido modificada por algunas fuentes desconocidas. Al descargar e instalar BombSquad Mod APK, puede disfrutar de las siguientes características:</p>
- <h3>Beneficios de BombSquad Mod APK</h3>
-<p>Algunos de los beneficios que BombSquad Mod APK ofrece son:</p>
-<ul>
-<li> Todos los caracteres están desbloqueados, por lo que puede jugar como cualquier personaje que desee. </li>
-<li> Todos los minijuegos están desbloqueados, por lo que puede jugar cualquier mini-juego que desee. </li>
-<li> Todos los mapas están desbloqueados, por lo que puede explorar cualquier mapa que desee. </li>
-<li> Todas las bombas y armas están desbloqueadas, por lo que puede utilizar cualquier bomba o arma que desee. </li>
-<li>Tienes entradas ilimitadas, que se utilizan para comprar artículos en el juego. </li>
-<li>Tienes salud ilimitada, lo que significa que no morirás fácilmente en el juego. </li>
-<li>No tienes anuncios, lo que significa que no serás interrumpido por anuncios molestos mientras juegas el juego. </li>
-</ul>
- <h2>¿Cómo descargar e instalar BombSquad Mod APK? </h2>
-<h3>Pasos para descargar e instalar BombSquad Mod APK</h3>
-<p>Si desea descargar e instalar BombSquad Mod APK en su dispositivo, es necesario seguir estos pasos:</p>
-<p></p>
-<ol>
-<li <li>Ir a un sitio web de confianza que proporciona el enlace para descargar BombSquad Mod APK. Puede buscar "BombSquad Mod APK download" en Bing y elegir uno de los resultados. Por ejemplo, puede utilizar este enlace: </li>
-<li>Haga clic en el botón de descarga y espere a que el archivo se descargue en su dispositivo. El tamaño del archivo es de unos 60 MB, así que asegúrese de tener suficiente espacio y una conexión a Internet estable. </li>
-<li>Una vez que el archivo se descarga, ir a la configuración del dispositivo y permitir la opción de instalar aplicaciones de fuentes desconocidas. Esto es necesario porque BombSquad Mod APK no es de la Google Play Store y su dispositivo podría bloquearlo de lo contrario. </li>
-
-<li> Después de la instalación se hace, puede iniciar el juego y disfrutar de BombSquad Mod APK en su dispositivo. </li>
-</ol>
- <h3>Consejos para evitar malware y virus</h3>
-<p>Si bien BombSquad Mod APK es un juego divertido y emocionante, también debe tener cuidado con la descarga e instalación de fuentes desconocidas. Algunos sitios web pueden proporcionar archivos falsos o dañados que pueden dañar su dispositivo o robar su información personal. Aquí hay algunos consejos para evitar el malware y los virus al descargar BombSquad Mod APK:</p>
-<ul>
-<li>Siempre use un software antivirus confiable en su dispositivo y escanee el archivo antes de instalarlo. </li>
-<li>Compruebe siempre las opiniones y calificaciones del sitio web y el archivo antes de descargarlo. </li>
-<li>Siempre compare el tamaño del archivo y el nombre con el juego original y asegúrese de que coincidan. </li>
-<li>Siempre copia de seguridad de los datos y el dispositivo antes de instalar cualquier aplicación modded. </li>
-<li>Siempre desinstale el juego original antes de instalar la versión modificada para evitar conflictos o errores. </li>
-</ul>
- <h2>¿Cómo se juega BombSquad Mod APK? </h2>
-<h3>Modos de juego y minijuegos</h3>
-<p>BombSquad Mod APK le ofrece una variedad de modos de juego y mini-juegos para jugar con sus amigos u otros jugadores en línea. Usted puede elegir entre:</p>
-<ul>
-<li>Modo cooperativo: puedes formar equipo con otros jugadores y trabajar juntos para completar misiones y desafíos. </li>
-<li>Modo versus: Puedes competir con otros jugadores e intentar derrotarlos en diferentes minijuegos. </li>
-<li>Modo de torneo: Puedes unirte a un torneo e intentar ganar premios y trofeos. </li>
-<li>Modo solitario: Puedes jugar solo y practicar tus habilidades o poner a prueba tus límites. </li>
-</ul>
- <p>Algunos de los mini-juegos que se pueden jugar en BombSquad Mod APK son:</p>
-<tabla>
-<tr><th>Nombre</th><th>Descripción</th></tr>
-<tr><td>Captura la bandera</td><td>Tienes que capturar la bandera del enemigo y llevarla de vuelta a tu base mientras defiendes tu propia bandera. </td></tr>
-
-<tr><td>Epic Slow Motion Elimination</td><td>Tienes que eliminar a todos los demás jugadores lanzándoles bombas mientras esquivan sus bombas en cámara lenta. </td></tr>
-<tr><td>Ninja Fight</td><td>Tienes que luchar con otros ninjas usando espadas, shurikens y bombas mientras saltas en plataformas. </td></tr>
-<tr><td>Pirate Plunder</td><td>Tienes que recoger tantas monedas como sea posible mientras navegas en un barco pirata y evitas las balas de cañón y los tiburones. </td></tr>
-</tabla>
- <h3>Controles y ajustes</h3>
-<p>BombSquad Mod APK tiene controles simples e intuitivos que le permiten jugar el juego con facilidad. Puede usar su dispositivo como controlador o conectar un controlador externo a través de Bluetooth o USB. También puede personalizar sus controles en el menú de configuración. Los controles básicos son:</p>
-<ul>
-<li>Mover: Usa el joystick izquierdo o inclina tu dispositivo para mover a tu personaje. </li>
-<li>Saltar: Pulse o pulse el botón A para saltar. </li>
-<li>Pick up/Throw: Toque o pulse el botón B para recoger o lanzar bombas, armas, banderas, etc.</li>
-<li>Punch: Toque o presione el botón X para perforar o usar armas. </li>
-<li>Bomba: Pulse o pulse el botón Y para lanzar una bomba. </li>
-</ul>
- <p>También puedes ajustar otros ajustes en el juego, como sonido, gráficos, idioma, red, etc. También puedes crear tu propio perfil y personalizar tu personaje en el juego. </p>
- <h2>Conclusión</h2>
-<h3>Resumen de los puntos principales</h3>
-
- <h3>Preguntas frecuentes</h3>
-<p>Aquí hay algunas preguntas frecuentes sobre BombSquad Mod APK:</p>
-<ul>
-<li>Q: ¿Es BombSquad Mod APK seguro de usar? </li>
-<li>A: BombSquad Mod APK es generalmente seguro de usar, pero siempre debe descargarlo desde un sitio web de confianza y escanearlo con un software antivirus antes de instalarlo. También debe realizar una copia de seguridad de sus datos y dispositivo antes de instalar cualquier aplicación modded. </li>
-<li>Q: Es BombSquad Mod APK legal de usar? </li>
-<li>A: BombSquad Mod APK no es una aplicación oficial del desarrollador, sino una aplicación de terceros que ha sido modificada por algunas fuentes desconocidas. Puede violar los términos y condiciones del juego original y la Google Play Store. Por lo tanto, debe usarlo bajo su propio riesgo y discreción. </li>
-<li>Q: ¿Puedo jugar BombSquad Mod APK con mis amigos? </li>
-<li>A: Sí, puede jugar BombSquad Mod APK con sus amigos a nivel local o en línea, utilizando sus dispositivos como controladores. También puede invitar a sus amigos a unirse a su juego o unirse a su juego. </li>
-<li>Q: ¿Puedo actualizar BombSquad Mod APK? </li>
-<li>A: No, no se puede actualizar BombSquad Mod APK desde la Google Play Store o el juego original. Tienes que descargar e instalar la última versión de la aplicación modded desde un sitio web de confianza cada vez que hay una actualización. </li>
-<li>Q: ¿Puedo usar BombSquad Mod APK en dispositivos iOS? </li>
-<li>A: No, no se puede utilizar BombSquad Mod APK en dispositivos iOS, ya que solo es compatible con dispositivos Android. Sin embargo, puede jugar el juego original en dispositivos iOS descargándolo desde la App Store.</li>
-</ul></p> 64aa2da5cf<br />
-<br />
-<br />
\ No newline at end of file
diff --git a/spaces/BigChungux/Pet_Survey/README.md b/spaces/BigChungux/Pet_Survey/README.md
deleted file mode 100644
index 1fbc6b1bfd27c1ab68f8e3ec9e66f0b495319f37..0000000000000000000000000000000000000000
--- a/spaces/BigChungux/Pet_Survey/README.md
+++ /dev/null
@@ -1,13 +0,0 @@
----
-title: Pet Survey
-emoji: 📚
-colorFrom: pink
-colorTo: blue
-sdk: gradio
-sdk_version: 3.19.1
-app_file: app.py
-pinned: false
-license: afl-3.0
----
-
-Check out the configuration reference at https://huggingface.co/docs/hub/spaces-config-reference
diff --git a/spaces/CVPR/LIVE/parallel.h b/spaces/CVPR/LIVE/parallel.h
deleted file mode 100644
index b7f9c712e471616d01921157c290a50adac768d9..0000000000000000000000000000000000000000
--- a/spaces/CVPR/LIVE/parallel.h
+++ /dev/null
@@ -1,91 +0,0 @@
-#pragma once
-
-#include "vector.h"
-
-#include <mutex>
-#include <condition_variable>
-#include <functional>
-#include <atomic>
-#include <cstdint>
-#include <cassert>
-#include <algorithm>
-// From https://github.com/mmp/pbrt-v3/blob/master/src/core/parallel.h
-
-class Barrier {
-  public:
-    Barrier(int count) : count(count) { assert(count > 0); }
-    ~Barrier() { assert(count == 0); }
-    void Wait();
-
-  private:
-    std::mutex mutex;
-    std::condition_variable cv;
-    int count;
-};
-
-void parallel_for_host(const std::function<void(int64_t)> &func,
-                       int64_t count,
-                       int chunkSize = 1);
-extern thread_local int ThreadIndex;
-void parallel_for_host(
-    std::function<void(Vector2i)> func, const Vector2i count);
-int num_system_cores();
-
-void parallel_init();
-void parallel_cleanup();
-
-#ifdef __CUDACC__
-template <typename T>
-__global__ void parallel_for_device_kernel(T functor, int count) {
-    auto idx = threadIdx.x + blockIdx.x * blockDim.x;
-    if (idx >= count) {
-        return;
-    }
-    functor(idx);
-}
-template <typename T>
-inline void parallel_for_device(T functor,
-                                int count,
-                                int work_per_thread = 256) {
-    if (count <= 0) {
-        return;
-    }
-    auto block_size = work_per_thread;
-    auto block_count = idiv_ceil(count, block_size);
-    parallel_for_device_kernel<T><<<block_count, block_size>>>(functor, count);
-}
-#endif
-
-template <typename T>
-inline void parallel_for(T functor,
-                         int count,
-                         bool use_gpu,
-                         int work_per_thread = -1) {
-    if (work_per_thread == -1) {
-        work_per_thread = use_gpu ? 64 : 256;
-    }
-    if (count <= 0) {
-        return;
-    }
-    if (use_gpu) {
-#ifdef __CUDACC__
-        auto block_size = work_per_thread;
-        auto block_count = idiv_ceil(count, block_size);
-        parallel_for_device_kernel<T><<<block_count, block_size>>>(functor, count);
-#else
-        throw std::runtime_error("diffvg not compiled with GPU");
-        assert(false);
-#endif
-    } else {
-        auto num_threads = idiv_ceil(count, work_per_thread);
-        parallel_for_host([&](int thread_index) {
-            auto id_offset = work_per_thread * thread_index;
-            auto work_end = std::min(id_offset + work_per_thread, count);
-            for (int work_id = id_offset; work_id < work_end; work_id++) {
-                auto idx = work_id;
-                assert(idx < count);
-                functor(idx);
-            }
-        }, num_threads);
-    }
-}
diff --git a/spaces/CVPR/LIVE/thrust/thrust/detail/complex/clogf.h b/spaces/CVPR/LIVE/thrust/thrust/detail/complex/clogf.h
deleted file mode 100644
index 7f3314ed2635c28ff5627235525da9c1fa8709ad..0000000000000000000000000000000000000000
--- a/spaces/CVPR/LIVE/thrust/thrust/detail/complex/clogf.h
+++ /dev/null
@@ -1,198 +0,0 @@
-/*
- *  Copyright 2008-2013 NVIDIA Corporation
- *  Copyright 2013 Filipe RNC Maia
- *
- *  Licensed under the Apache License, Version 2.0 (the "License");
- *  you may not use this file except in compliance with the License.
- *  You may obtain a copy of the License at
- *
- *      http://www.apache.org/licenses/LICENSE-2.0
- *
- *  Unless required by applicable law or agreed to in writing, software
- *  distributed under the License is distributed on an "AS IS" BASIS,
- *  WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
- *  See the License for the specific language governing permissions and
- *  limitations under the License.
- */
-
-/*-
- * Copyright (c) 2012 Stephen Montgomery-Smith <stephen@FreeBSD.ORG>
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions
- * are met:
- * 1. Redistributions of source code must retain the above copyright
- *    notice, this list of conditions and the following disclaimer.
- * 2. Redistributions in binary form must reproduce the above copyright
- *    notice, this list of conditions and the following disclaimer in the
- *    documentation and/or other materials provided with the distribution.
- *
- * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
- * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
- * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
- * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
- * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
- * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
- * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
- * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
- * SUCH DAMAGE.
- */
-
-/* adapted from FreeBSDs msun:*/
-
-#pragma once
-
-#include <thrust/complex.h>
-#include <thrust/detail/complex/math_private.h>
-
-namespace thrust{
-namespace detail{
-namespace complex{
-
-using thrust::complex;
-
-/* round down to 8 = 24/3 bits */
-__host__ __device__ inline
-float trim(float x){
-  uint32_t hx;
-  get_float_word(hx, x);
-  hx &= 0xffff0000;
-  float ret;
-  set_float_word(ret,hx);
-  return ret;
-}
-
-
-__host__ __device__ inline
-complex<float> clogf(const complex<float>& z){
-
-  // Adapted from FreeBSDs msun
-  float x, y;
-  float ax, ay;
-  float x0, y0, x1, y1, x2, y2, t, hm1;
-  float val[12];
-  int i, sorted;	
-  const float e = 2.7182818284590452354f;
-
-  x = z.real();
-  y = z.imag();
-
-  /* Handle NaNs using the general formula to mix them right. */
-  if (x != x || y != y){
-    return (complex<float>(std::log(norm(z)), std::atan2(y, x)));
-  }
-
-  ax = std::abs(x);
-  ay = std::abs(y);
-  if (ax < ay) {
-    t = ax;
-    ax = ay;
-    ay = t;
-  }
-
-  /*
-   * To avoid unnecessary overflow, if x and y are very large, divide x
-   * and y by M_E, and then add 1 to the logarithm.  This depends on
-   * M_E being larger than sqrt(2).
-   * There is a potential loss of accuracy caused by dividing by M_E,
-   * but this case should happen extremely rarely.
-   */
-  // For high values of ay -> hypotf(FLT_MAX,ay) = inf
-  // We expect that for values at or below ay = 1e34f this should not happen
-  if (ay > 1e34f){ 
-    return (complex<float>(std::log(hypotf(x / e, y / e)) + 1.0f, std::atan2(y, x)));
-  }
-  if (ax == 1.f) {
-    if (ay < 1e-19f){
-      return (complex<float>((ay * 0.5f) * ay, std::atan2(y, x)));
-    }
-    return (complex<float>(log1pf(ay * ay) * 0.5f, std::atan2(y, x)));
-  }
-
-  /*
-   * Because atan2 and hypot conform to C99, this also covers all the
-   * edge cases when x or y are 0 or infinite.
-   */
-  if (ax < 1e-6f || ay < 1e-6f || ax > 1e6f || ay > 1e6f){
-    return (complex<float>(std::log(hypotf(x, y)), std::atan2(y, x)));
-  }
-
-  /* 
-   * From this point on, we don't need to worry about underflow or
-   * overflow in calculating ax*ax or ay*ay.
-   */
-
-  /* Some easy cases. */
-
-  if (ax >= 1.0f){
-    return (complex<float>(log1pf((ax-1.f)*(ax+1.f) + ay*ay) * 0.5f, atan2(y, x)));
-  }
-
-  if (ax*ax + ay*ay <= 0.7f){
-    return (complex<float>(std::log(ax*ax + ay*ay) * 0.5f, std::atan2(y, x)));
-  }
-
-  /*
-   * Take extra care so that ULP of real part is small if hypot(x,y) is
-   * moderately close to 1.
-   */
-
-
-  x0 = trim(ax);
-  ax = ax-x0;
-  x1 = trim(ax);
-  x2 = ax-x1;
-  y0 = trim(ay);
-  ay = ay-y0;
-  y1 = trim(ay);
-  y2 = ay-y1;
-
-  val[0] = x0*x0;
-  val[1] = y0*y0;
-  val[2] = 2*x0*x1;
-  val[3] = 2*y0*y1;
-  val[4] = x1*x1;
-  val[5] = y1*y1;
-  val[6] = 2*x0*x2;
-  val[7] = 2*y0*y2;
-  val[8] = 2*x1*x2;
-  val[9] = 2*y1*y2;
-  val[10] = x2*x2;
-  val[11] = y2*y2;
-
-  /* Bubble sort. */
-
-  do {
-    sorted = 1;
-    for (i=0;i<11;i++) {
-      if (val[i] < val[i+1]) {
-	sorted = 0;
-	t = val[i];
-	val[i] = val[i+1];
-	val[i+1] = t;
-      }
-    }
-  } while (!sorted);
-
-  hm1 = -1;
-  for (i=0;i<12;i++){
-    hm1 += val[i];
-  }
-  return (complex<float>(0.5f * log1pf(hm1), atan2(y, x)));
-}
-
-} // namespace complex
-
-} // namespace detail
-
-template <>
-__host__ __device__
-inline complex<float> log(const complex<float>& z){
-  return detail::complex::clogf(z);
-}
-
-} // namespace thrust
-    
diff --git a/spaces/CVPR/WALT/walt/datasets/custom.py b/spaces/CVPR/WALT/walt/datasets/custom.py
deleted file mode 100644
index 572742aa2e9c57cb6de2aac17939abf4a18216a3..0000000000000000000000000000000000000000
--- a/spaces/CVPR/WALT/walt/datasets/custom.py
+++ /dev/null
@@ -1,324 +0,0 @@
-import os.path as osp
-import warnings
-from collections import OrderedDict
-
-import mmcv
-import numpy as np
-from mmcv.utils import print_log
-from torch.utils.data import Dataset
-
-from mmdet.core import eval_map, eval_recalls
-from .builder import DATASETS
-from .pipelines import Compose
-
-
-@DATASETS.register_module()
-class CustomDatasetLocal(Dataset):
-    """Custom dataset for detection.
-
-    The annotation format is shown as follows. The `ann` field is optional for
-    testing.
-
-    .. code-block:: none
-
-        [
-            {
-                'filename': 'a.jpg',
-                'width': 1280,
-                'height': 720,
-                'ann': {
-                    'bboxes': <np.ndarray> (n, 4) in (x1, y1, x2, y2) order.
-                    'labels': <np.ndarray> (n, ),
-                    'bboxes_ignore': <np.ndarray> (k, 4), (optional field)
-                    'labels_ignore': <np.ndarray> (k, 4) (optional field)
-                }
-            },
-            ...
-        ]
-
-    Args:
-        ann_file (str): Annotation file path.
-        pipeline (list[dict]): Processing pipeline.
-        classes (str | Sequence[str], optional): Specify classes to load.
-            If is None, ``cls.CLASSES`` will be used. Default: None.
-        data_root (str, optional): Data root for ``ann_file``,
-            ``img_prefix``, ``seg_prefix``, ``proposal_file`` if specified.
-        test_mode (bool, optional): If set True, annotation will not be loaded.
-        filter_empty_gt (bool, optional): If set true, images without bounding
-            boxes of the dataset's classes will be filtered out. This option
-            only works when `test_mode=False`, i.e., we never filter images
-            during tests.
-    """
-
-    CLASSES = None
-
-    def __init__(self,
-                 ann_file,
-                 pipeline,
-                 classes=None,
-                 data_root=None,
-                 img_prefix='',
-                 seg_prefix=None,
-                 proposal_file=None,
-                 test_mode=False,
-                 filter_empty_gt=True):
-        self.ann_file = ann_file
-        self.data_root = data_root
-        self.img_prefix = img_prefix
-        self.seg_prefix = seg_prefix
-        self.proposal_file = proposal_file
-        self.test_mode = test_mode
-        self.filter_empty_gt = filter_empty_gt
-        self.CLASSES = self.get_classes(classes)
-
-        # join paths if data_root is specified
-        if self.data_root is not None:
-            if not osp.isabs(self.ann_file):
-                self.ann_file = osp.join(self.data_root, self.ann_file)
-            if not (self.img_prefix is None or osp.isabs(self.img_prefix)):
-                self.img_prefix = osp.join(self.data_root, self.img_prefix)
-            if not (self.seg_prefix is None or osp.isabs(self.seg_prefix)):
-                self.seg_prefix = osp.join(self.data_root, self.seg_prefix)
-            if not (self.proposal_file is None
-                    or osp.isabs(self.proposal_file)):
-                self.proposal_file = osp.join(self.data_root,
-                                              self.proposal_file)
-        # load annotations (and proposals)
-        self.data_infos = self.load_annotations(self.ann_file)
-
-        if self.proposal_file is not None:
-            self.proposals = self.load_proposals(self.proposal_file)
-        else:
-            self.proposals = None
-
-        # filter images too small and containing no annotations
-        if not test_mode:
-            valid_inds = self._filter_imgs()
-            self.data_infos = [self.data_infos[i] for i in valid_inds]
-            if self.proposals is not None:
-                self.proposals = [self.proposals[i] for i in valid_inds]
-            # set group flag for the sampler
-            self._set_group_flag()
-
-        # processing pipeline
-        self.pipeline = Compose(pipeline)
-
-    def __len__(self):
-        """Total number of samples of data."""
-        return len(self.data_infos)
-
-    def load_annotations(self, ann_file):
-        """Load annotation from annotation file."""
-        return mmcv.load(ann_file)
-
-    def load_proposals(self, proposal_file):
-        """Load proposal from proposal file."""
-        return mmcv.load(proposal_file)
-
-    def get_ann_info(self, idx):
-        """Get annotation by index.
-
-        Args:
-            idx (int): Index of data.
-
-        Returns:
-            dict: Annotation info of specified index.
-        """
-
-        return self.data_infos[idx]['ann']
-
-    def get_cat_ids(self, idx):
-        """Get category ids by index.
-
-        Args:
-            idx (int): Index of data.
-
-        Returns:
-            list[int]: All categories in the image of specified index.
-        """
-
-        return self.data_infos[idx]['ann']['labels'].astype(np.int).tolist()
-
-    def pre_pipeline(self, results):
-        """Prepare results dict for pipeline."""
-        results['img_prefix'] = self.img_prefix
-        results['seg_prefix'] = self.seg_prefix
-        results['proposal_file'] = self.proposal_file
-        results['bbox_fields'] = []
-        results['bbox3d_fields'] = []
-        results['mask_fields'] = []
-        results['seg_fields'] = []
-
-    def _filter_imgs(self, min_size=32):
-        """Filter images too small."""
-        if self.filter_empty_gt:
-            warnings.warn(
-                'CustomDataset does not support filtering empty gt images.')
-        valid_inds = []
-        for i, img_info in enumerate(self.data_infos):
-            if min(img_info['width'], img_info['height']) >= min_size:
-                valid_inds.append(i)
-        return valid_inds
-
-    def _set_group_flag(self):
-        """Set flag according to image aspect ratio.
-
-        Images with aspect ratio greater than 1 will be set as group 1,
-        otherwise group 0.
-        """
-        self.flag = np.zeros(len(self), dtype=np.uint8)
-        for i in range(len(self)):
-            img_info = self.data_infos[i]
-            if img_info['width'] / img_info['height'] > 1:
-                self.flag[i] = 1
-
-    def _rand_another(self, idx):
-        """Get another random index from the same group as the given index."""
-        pool = np.where(self.flag == self.flag[idx])[0]
-        return np.random.choice(pool)
-
-    def __getitem__(self, idx):
-        """Get training/test data after pipeline.
-
-        Args:
-            idx (int): Index of data.
-
-        Returns:
-            dict: Training/test data (with annotation if `test_mode` is set \
-                True).
-        """
-
-        if self.test_mode:
-            return self.prepare_test_img(idx)
-        while True:
-            data = self.prepare_train_img(idx)
-            if data is None:
-                idx = self._rand_another(idx)
-                continue
-            return data
-
-    def prepare_train_img(self, idx):
-        """Get training data and annotations after pipeline.
-
-        Args:
-            idx (int): Index of data.
-
-        Returns:
-            dict: Training data and annotation after pipeline with new keys \
-                introduced by pipeline.
-        """
-
-        img_info = self.data_infos[idx]
-        ann_info = self.get_ann_info(idx)
-        results = dict(img_info=img_info, ann_info=ann_info)
-        if self.proposals is not None:
-            results['proposals'] = self.proposals[idx]
-        self.pre_pipeline(results)
-        return self.pipeline(results)
-
-    def prepare_test_img(self, idx):
-        """Get testing data  after pipeline.
-
-        Args:
-            idx (int): Index of data.
-
-        Returns:
-            dict: Testing data after pipeline with new keys introduced by \
-                pipeline.
-        """
-
-        img_info = self.data_infos[idx]
-        results = dict(img_info=img_info)
-        if self.proposals is not None:
-            results['proposals'] = self.proposals[idx]
-        self.pre_pipeline(results)
-        return self.pipeline(results)
-
-    @classmethod
-    def get_classes(cls, classes=None):
-        """Get class names of current dataset.
-
-        Args:
-            classes (Sequence[str] | str | None): If classes is None, use
-                default CLASSES defined by builtin dataset. If classes is a
-                string, take it as a file name. The file contains the name of
-                classes where each line contains one class name. If classes is
-                a tuple or list, override the CLASSES defined by the dataset.
-
-        Returns:
-            tuple[str] or list[str]: Names of categories of the dataset.
-        """
-        if classes is None:
-            return cls.CLASSES
-
-        if isinstance(classes, str):
-            # take it as a file path
-            class_names = mmcv.list_from_file(classes)
-        elif isinstance(classes, (tuple, list)):
-            class_names = classes
-        else:
-            raise ValueError(f'Unsupported type {type(classes)} of classes.')
-
-        return class_names
-
-    def format_results(self, results, **kwargs):
-        """Place holder to format result to dataset specific output."""
-
-    def evaluate(self,
-                 results,
-                 metric='mAP',
-                 logger=None,
-                 proposal_nums=(100, 300, 1000),
-                 iou_thr=0.5,
-                 scale_ranges=None):
-        """Evaluate the dataset.
-
-        Args:
-            results (list): Testing results of the dataset.
-            metric (str | list[str]): Metrics to be evaluated.
-            logger (logging.Logger | None | str): Logger used for printing
-                related information during evaluation. Default: None.
-            proposal_nums (Sequence[int]): Proposal number used for evaluating
-                recalls, such as recall@100, recall@1000.
-                Default: (100, 300, 1000).
-            iou_thr (float | list[float]): IoU threshold. Default: 0.5.
-            scale_ranges (list[tuple] | None): Scale ranges for evaluating mAP.
-                Default: None.
-        """
-
-        if not isinstance(metric, str):
-            assert len(metric) == 1
-            metric = metric[0]
-        allowed_metrics = ['mAP', 'recall']
-        if metric not in allowed_metrics:
-            raise KeyError(f'metric {metric} is not supported')
-        annotations = [self.get_ann_info(i) for i in range(len(self))]
-        eval_results = OrderedDict()
-        iou_thrs = [iou_thr] if isinstance(iou_thr, float) else iou_thr
-        if metric == 'mAP':
-            assert isinstance(iou_thrs, list)
-            mean_aps = []
-            for iou_thr in iou_thrs:
-                print_log(f'\n{"-" * 15}iou_thr: {iou_thr}{"-" * 15}')
-                mean_ap, _ = eval_map(
-                    results,
-                    annotations,
-                    scale_ranges=scale_ranges,
-                    iou_thr=iou_thr,
-                    dataset=self.CLASSES,
-                    logger=logger)
-                mean_aps.append(mean_ap)
-                eval_results[f'AP{int(iou_thr * 100):02d}'] = round(mean_ap, 3)
-            eval_results['mAP'] = sum(mean_aps) / len(mean_aps)
-        elif metric == 'recall':
-            gt_bboxes = [ann['bboxes'] for ann in annotations]
-            recalls = eval_recalls(
-                gt_bboxes, results, proposal_nums, iou_thr, logger=logger)
-            for i, num in enumerate(proposal_nums):
-                for j, iou in enumerate(iou_thrs):
-                    eval_results[f'recall@{num}@{iou}'] = recalls[i, j]
-            if recalls.shape[1] > 1:
-                ar = recalls.mean(axis=1)
-                for i, num in enumerate(proposal_nums):
-                    eval_results[f'AR@{num}'] = ar[i]
-        return eval_results
diff --git a/spaces/CVPR/regionclip-demo/detectron2/data/samplers/__init__.py b/spaces/CVPR/regionclip-demo/detectron2/data/samplers/__init__.py
deleted file mode 100644
index 4bacd895756cedbc9b37fe24af6dbcd8a054246b..0000000000000000000000000000000000000000
--- a/spaces/CVPR/regionclip-demo/detectron2/data/samplers/__init__.py
+++ /dev/null
@@ -1,10 +0,0 @@
-# Copyright (c) Facebook, Inc. and its affiliates.
-from .distributed_sampler import InferenceSampler, RepeatFactorTrainingSampler, TrainingSampler
-from .grouped_batch_sampler import GroupedBatchSampler
-
-__all__ = [
-    "GroupedBatchSampler",
-    "TrainingSampler",
-    "InferenceSampler",
-    "RepeatFactorTrainingSampler",
-]
diff --git a/spaces/CVPR/regionclip-demo/detectron2/evaluation/sem_seg_evaluation.py b/spaces/CVPR/regionclip-demo/detectron2/evaluation/sem_seg_evaluation.py
deleted file mode 100644
index 7a19db71562ef47569dc7f77ec616af85447f0ec..0000000000000000000000000000000000000000
--- a/spaces/CVPR/regionclip-demo/detectron2/evaluation/sem_seg_evaluation.py
+++ /dev/null
@@ -1,184 +0,0 @@
-# Copyright (c) Facebook, Inc. and its affiliates.
-import itertools
-import json
-import logging
-import numpy as np
-import os
-from collections import OrderedDict
-import PIL.Image as Image
-import pycocotools.mask as mask_util
-import torch
-
-from detectron2.data import DatasetCatalog, MetadataCatalog
-from detectron2.utils.comm import all_gather, is_main_process, synchronize
-from detectron2.utils.file_io import PathManager
-
-from .evaluator import DatasetEvaluator
-
-
-class SemSegEvaluator(DatasetEvaluator):
-    """
-    Evaluate semantic segmentation metrics.
-    """
-
-    def __init__(
-        self,
-        dataset_name,
-        distributed=True,
-        output_dir=None,
-        *,
-        num_classes=None,
-        ignore_label=None,
-    ):
-        """
-        Args:
-            dataset_name (str): name of the dataset to be evaluated.
-            distributed (bool): if True, will collect results from all ranks for evaluation.
-                Otherwise, will evaluate the results in the current process.
-            output_dir (str): an output directory to dump results.
-            num_classes, ignore_label: deprecated argument
-        """
-        self._logger = logging.getLogger(__name__)
-        if num_classes is not None:
-            self._logger.warn(
-                "SemSegEvaluator(num_classes) is deprecated! It should be obtained from metadata."
-            )
-        if ignore_label is not None:
-            self._logger.warn(
-                "SemSegEvaluator(ignore_label) is deprecated! It should be obtained from metadata."
-            )
-        self._dataset_name = dataset_name
-        self._distributed = distributed
-        self._output_dir = output_dir
-
-        self._cpu_device = torch.device("cpu")
-
-        self.input_file_to_gt_file = {
-            dataset_record["file_name"]: dataset_record["sem_seg_file_name"]
-            for dataset_record in DatasetCatalog.get(dataset_name)
-        }
-
-        meta = MetadataCatalog.get(dataset_name)
-        # Dict that maps contiguous training ids to COCO category ids
-        try:
-            c2d = meta.stuff_dataset_id_to_contiguous_id
-            self._contiguous_id_to_dataset_id = {v: k for k, v in c2d.items()}
-        except AttributeError:
-            self._contiguous_id_to_dataset_id = None
-        self._class_names = meta.stuff_classes
-        self._num_classes = len(meta.stuff_classes)
-        if num_classes is not None:
-            assert self._num_classes == num_classes, f"{self._num_classes} != {num_classes}"
-        self._ignore_label = ignore_label if ignore_label is not None else meta.ignore_label
-
-    def reset(self):
-        self._conf_matrix = np.zeros((self._num_classes + 1, self._num_classes + 1), dtype=np.int64)
-        self._predictions = []
-
-    def process(self, inputs, outputs):
-        """
-        Args:
-            inputs: the inputs to a model.
-                It is a list of dicts. Each dict corresponds to an image and
-                contains keys like "height", "width", "file_name".
-            outputs: the outputs of a model. It is either list of semantic segmentation predictions
-                (Tensor [H, W]) or list of dicts with key "sem_seg" that contains semantic
-                segmentation prediction in the same format.
-        """
-        for input, output in zip(inputs, outputs):
-            output = output["sem_seg"].argmax(dim=0).to(self._cpu_device)
-            pred = np.array(output, dtype=np.int)
-            with PathManager.open(self.input_file_to_gt_file[input["file_name"]], "rb") as f:
-                gt = np.array(Image.open(f), dtype=np.int)
-
-            gt[gt == self._ignore_label] = self._num_classes
-
-            self._conf_matrix += np.bincount(
-                (self._num_classes + 1) * pred.reshape(-1) + gt.reshape(-1),
-                minlength=self._conf_matrix.size,
-            ).reshape(self._conf_matrix.shape)
-
-            self._predictions.extend(self.encode_json_sem_seg(pred, input["file_name"]))
-
-    def evaluate(self):
-        """
-        Evaluates standard semantic segmentation metrics (http://cocodataset.org/#stuff-eval):
-
-        * Mean intersection-over-union averaged across classes (mIoU)
-        * Frequency Weighted IoU (fwIoU)
-        * Mean pixel accuracy averaged across classes (mACC)
-        * Pixel Accuracy (pACC)
-        """
-        if self._distributed:
-            synchronize()
-            conf_matrix_list = all_gather(self._conf_matrix)
-            self._predictions = all_gather(self._predictions)
-            self._predictions = list(itertools.chain(*self._predictions))
-            if not is_main_process():
-                return
-
-            self._conf_matrix = np.zeros_like(self._conf_matrix)
-            for conf_matrix in conf_matrix_list:
-                self._conf_matrix += conf_matrix
-
-        if self._output_dir:
-            PathManager.mkdirs(self._output_dir)
-            file_path = os.path.join(self._output_dir, "sem_seg_predictions.json")
-            with PathManager.open(file_path, "w") as f:
-                f.write(json.dumps(self._predictions))
-
-        acc = np.full(self._num_classes, np.nan, dtype=np.float)
-        iou = np.full(self._num_classes, np.nan, dtype=np.float)
-        tp = self._conf_matrix.diagonal()[:-1].astype(np.float)
-        pos_gt = np.sum(self._conf_matrix[:-1, :-1], axis=0).astype(np.float)
-        class_weights = pos_gt / np.sum(pos_gt)
-        pos_pred = np.sum(self._conf_matrix[:-1, :-1], axis=1).astype(np.float)
-        acc_valid = pos_gt > 0
-        acc[acc_valid] = tp[acc_valid] / pos_gt[acc_valid]
-        iou_valid = (pos_gt + pos_pred) > 0
-        union = pos_gt + pos_pred - tp
-        iou[acc_valid] = tp[acc_valid] / union[acc_valid]
-        macc = np.sum(acc[acc_valid]) / np.sum(acc_valid)
-        miou = np.sum(iou[acc_valid]) / np.sum(iou_valid)
-        fiou = np.sum(iou[acc_valid] * class_weights[acc_valid])
-        pacc = np.sum(tp) / np.sum(pos_gt)
-
-        res = {}
-        res["mIoU"] = 100 * miou
-        res["fwIoU"] = 100 * fiou
-        for i, name in enumerate(self._class_names):
-            res["IoU-{}".format(name)] = 100 * iou[i]
-        res["mACC"] = 100 * macc
-        res["pACC"] = 100 * pacc
-        for i, name in enumerate(self._class_names):
-            res["ACC-{}".format(name)] = 100 * acc[i]
-
-        if self._output_dir:
-            file_path = os.path.join(self._output_dir, "sem_seg_evaluation.pth")
-            with PathManager.open(file_path, "wb") as f:
-                torch.save(res, f)
-        results = OrderedDict({"sem_seg": res})
-        self._logger.info(results)
-        return results
-
-    def encode_json_sem_seg(self, sem_seg, input_file_name):
-        """
-        Convert semantic segmentation to COCO stuff format with segments encoded as RLEs.
-        See http://cocodataset.org/#format-results
-        """
-        json_list = []
-        for label in np.unique(sem_seg):
-            if self._contiguous_id_to_dataset_id is not None:
-                assert (
-                    label in self._contiguous_id_to_dataset_id
-                ), "Label {} is not in the metadata info for {}".format(label, self._dataset_name)
-                dataset_id = self._contiguous_id_to_dataset_id[label]
-            else:
-                dataset_id = int(label)
-            mask = (sem_seg == label).astype(np.uint8)
-            mask_rle = mask_util.encode(np.array(mask[:, :, None], order="F"))[0]
-            mask_rle["counts"] = mask_rle["counts"].decode("utf-8")
-            json_list.append(
-                {"file_name": input_file_name, "category_id": dataset_id, "segmentation": mask_rle}
-            )
-        return json_list
diff --git a/spaces/CVPR/regionclip-demo/detectron2/modeling/proposal_generator/proposal_utils.py b/spaces/CVPR/regionclip-demo/detectron2/modeling/proposal_generator/proposal_utils.py
deleted file mode 100644
index 48485a420a8afafc4097bef982c8d23b91b95269..0000000000000000000000000000000000000000
--- a/spaces/CVPR/regionclip-demo/detectron2/modeling/proposal_generator/proposal_utils.py
+++ /dev/null
@@ -1,200 +0,0 @@
-# Copyright (c) Facebook, Inc. and its affiliates.
-import logging
-import math
-from typing import List, Tuple, Union
-import torch
-
-from detectron2.layers import batched_nms, cat
-from detectron2.structures import Boxes, Instances
-from detectron2.utils.env import TORCH_VERSION
-
-logger = logging.getLogger(__name__)
-
-
-def _is_tracing():
-    if torch.jit.is_scripting():
-        # https://github.com/pytorch/pytorch/issues/47379
-        return False
-    else:
-        return TORCH_VERSION >= (1, 7) and torch.jit.is_tracing()
-
-
-def find_top_rpn_proposals(
-    proposals: List[torch.Tensor],
-    pred_objectness_logits: List[torch.Tensor],
-    image_sizes: List[Tuple[int, int]],
-    nms_thresh: float,
-    pre_nms_topk: int,
-    post_nms_topk: int,
-    min_box_size: float,
-    training: bool,
-):
-    """
-    For each feature map, select the `pre_nms_topk` highest scoring proposals,
-    apply NMS, clip proposals, and remove small boxes. Return the `post_nms_topk`
-    highest scoring proposals among all the feature maps for each image.
-
-    Args:
-        proposals (list[Tensor]): A list of L tensors. Tensor i has shape (N, Hi*Wi*A, 4).
-            All proposal predictions on the feature maps.
-        pred_objectness_logits (list[Tensor]): A list of L tensors. Tensor i has shape (N, Hi*Wi*A).
-        image_sizes (list[tuple]): sizes (h, w) for each image
-        nms_thresh (float): IoU threshold to use for NMS
-        pre_nms_topk (int): number of top k scoring proposals to keep before applying NMS.
-            When RPN is run on multiple feature maps (as in FPN) this number is per
-            feature map.
-        post_nms_topk (int): number of top k scoring proposals to keep after applying NMS.
-            When RPN is run on multiple feature maps (as in FPN) this number is total,
-            over all feature maps.
-        min_box_size (float): minimum proposal box side length in pixels (absolute units
-            wrt input images).
-        training (bool): True if proposals are to be used in training, otherwise False.
-            This arg exists only to support a legacy bug; look for the "NB: Legacy bug ..."
-            comment.
-
-    Returns:
-        list[Instances]: list of N Instances. The i-th Instances
-            stores post_nms_topk object proposals for image i, sorted by their
-            objectness score in descending order.
-    """
-    num_images = len(image_sizes)
-    device = proposals[0].device
-
-    # 1. Select top-k anchor for every level and every image
-    topk_scores = []  # #lvl Tensor, each of shape N x topk
-    topk_proposals = []
-    level_ids = []  # #lvl Tensor, each of shape (topk,)
-    batch_idx = torch.arange(num_images, device=device)
-    for level_id, (proposals_i, logits_i) in enumerate(zip(proposals, pred_objectness_logits)):
-        Hi_Wi_A = logits_i.shape[1]
-        if isinstance(Hi_Wi_A, torch.Tensor):  # it's a tensor in tracing
-            num_proposals_i = torch.clamp(Hi_Wi_A, max=pre_nms_topk)
-        else:
-            num_proposals_i = min(Hi_Wi_A, pre_nms_topk)
-
-        # sort is faster than topk: https://github.com/pytorch/pytorch/issues/22812
-        # topk_scores_i, topk_idx = logits_i.topk(num_proposals_i, dim=1)
-        logits_i, idx = logits_i.sort(descending=True, dim=1)
-        topk_scores_i = logits_i.narrow(1, 0, num_proposals_i)
-        topk_idx = idx.narrow(1, 0, num_proposals_i)
-
-        # each is N x topk
-        topk_proposals_i = proposals_i[batch_idx[:, None], topk_idx]  # N x topk x 4
-
-        topk_proposals.append(topk_proposals_i)
-        topk_scores.append(topk_scores_i)
-        level_ids.append(torch.full((num_proposals_i,), level_id, dtype=torch.int64, device=device))
-
-    # 2. Concat all levels together
-    topk_scores = cat(topk_scores, dim=1)
-    topk_proposals = cat(topk_proposals, dim=1)
-    level_ids = cat(level_ids, dim=0)
-
-    # 3. For each image, run a per-level NMS, and choose topk results.
-    results: List[Instances] = []
-    for n, image_size in enumerate(image_sizes):
-        boxes = Boxes(topk_proposals[n])
-        scores_per_img = topk_scores[n]
-        lvl = level_ids
-
-        valid_mask = torch.isfinite(boxes.tensor).all(dim=1) & torch.isfinite(scores_per_img)
-        if not valid_mask.all():
-            if training:
-                raise FloatingPointError(
-                    "Predicted boxes or scores contain Inf/NaN. Training has diverged."
-                )
-            boxes = boxes[valid_mask]
-            scores_per_img = scores_per_img[valid_mask]
-            lvl = lvl[valid_mask]
-        boxes.clip(image_size)
-
-        # filter empty boxes
-        keep = boxes.nonempty(threshold=min_box_size)
-        if _is_tracing() or keep.sum().item() != len(boxes):
-            boxes, scores_per_img, lvl = boxes[keep], scores_per_img[keep], lvl[keep]
-
-        keep = batched_nms(boxes.tensor, scores_per_img, lvl, nms_thresh)
-        # In Detectron1, there was different behavior during training vs. testing.
-        # (https://github.com/facebookresearch/Detectron/issues/459)
-        # During training, topk is over the proposals from *all* images in the training batch.
-        # During testing, it is over the proposals for each image separately.
-        # As a result, the training behavior becomes batch-dependent,
-        # and the configuration "POST_NMS_TOPK_TRAIN" end up relying on the batch size.
-        # This bug is addressed in Detectron2 to make the behavior independent of batch size.
-        keep = keep[:post_nms_topk]  # keep is already sorted
-
-        res = Instances(image_size)
-        res.proposal_boxes = boxes[keep]
-        res.objectness_logits = scores_per_img[keep]
-        results.append(res)
-    return results
-
-
-def add_ground_truth_to_proposals(
-    gt: Union[List[Instances], List[Boxes]], proposals: List[Instances]
-) -> List[Instances]:
-    """
-    Call `add_ground_truth_to_proposals_single_image` for all images.
-
-    Args:
-        gt(Union[List[Instances], List[Boxes]): list of N elements. Element i is a Instances
-            representing the ground-truth for image i.
-        proposals (list[Instances]): list of N elements. Element i is a Instances
-            representing the proposals for image i.
-
-    Returns:
-        list[Instances]: list of N Instances. Each is the proposals for the image,
-            with field "proposal_boxes" and "objectness_logits".
-    """
-    assert gt is not None
-
-    if len(proposals) != len(gt):
-        raise ValueError("proposals and gt should have the same length as the number of images!")
-    if len(proposals) == 0:
-        return proposals
-
-    return [
-        add_ground_truth_to_proposals_single_image(gt_i, proposals_i)
-        for gt_i, proposals_i in zip(gt, proposals)
-    ]
-
-
-def add_ground_truth_to_proposals_single_image(
-    gt: Union[Instances, Boxes], proposals: Instances
-) -> Instances:
-    """
-    Augment `proposals` with `gt`.
-
-    Args:
-        Same as `add_ground_truth_to_proposals`, but with gt and proposals
-        per image.
-
-    Returns:
-        Same as `add_ground_truth_to_proposals`, but for only one image.
-    """
-    if isinstance(gt, Boxes):
-        # convert Boxes to Instances
-        gt = Instances(proposals.image_size, gt_boxes=gt)
-
-    gt_boxes = gt.gt_boxes
-    device = proposals.objectness_logits.device
-    # Assign all ground-truth boxes an objectness logit corresponding to
-    # P(object) = sigmoid(logit) =~ 1.
-    gt_logit_value = math.log((1.0 - 1e-10) / (1 - (1.0 - 1e-10)))
-    gt_logits = gt_logit_value * torch.ones(len(gt_boxes), device=device)
-
-    # Concatenating gt_boxes with proposals requires them to have the same fields
-    gt_proposal = Instances(proposals.image_size, **gt.get_fields())
-    gt_proposal.proposal_boxes = gt_boxes
-    gt_proposal.objectness_logits = gt_logits
-
-    for key in proposals.get_fields().keys():
-        assert gt_proposal.has(
-            key
-        ), "The attribute '{}' in `proposals` does not exist in `gt`".format(key)
-
-    # NOTE: Instances.cat only use fields from the first item. Extra fields in latter items
-    # will be thrown away.
-    new_proposals = Instances.cat([proposals, gt_proposal])
-
-    return new_proposals
diff --git a/spaces/ChenyangSi/FreeU/free_lunch_utils.py b/spaces/ChenyangSi/FreeU/free_lunch_utils.py
deleted file mode 100644
index 7e5ef4a885bd333b8c9dcfe3e8256d253bed6467..0000000000000000000000000000000000000000
--- a/spaces/ChenyangSi/FreeU/free_lunch_utils.py
+++ /dev/null
@@ -1,340 +0,0 @@
-import torch
-import torch.fft as fft
-from diffusers.models.unet_2d_condition import logger
-from diffusers.utils import is_torch_version
-from typing import Any, Dict, List, Optional, Tuple, Union
-
-
-def isinstance_str(x: object, cls_name: str):
-    """
-    Checks whether x has any class *named* cls_name in its ancestry.
-    Doesn't require access to the class's implementation.
-    
-    Useful for patching!
-    """
-
-    for _cls in x.__class__.__mro__:
-        if _cls.__name__ == cls_name:
-            return True
-    
-    return False
-
-
-def Fourier_filter(x, threshold, scale):
-    dtype = x.dtype
-    x = x.type(torch.float32)
-    # FFT
-    x_freq = fft.fftn(x, dim=(-2, -1))
-    x_freq = fft.fftshift(x_freq, dim=(-2, -1))
-    
-    B, C, H, W = x_freq.shape
-    mask = torch.ones((B, C, H, W)).cuda() 
-
-    crow, ccol = H // 2, W //2
-    mask[..., crow - threshold:crow + threshold, ccol - threshold:ccol + threshold] = scale
-    x_freq = x_freq * mask
-
-    # IFFT
-    x_freq = fft.ifftshift(x_freq, dim=(-2, -1))
-    x_filtered = fft.ifftn(x_freq, dim=(-2, -1)).real
-    
-    x_filtered = x_filtered.type(dtype)
-    return x_filtered
-
-
-def register_upblock2d(model):
-    def up_forward(self):
-        def forward(hidden_states, res_hidden_states_tuple, temb=None, upsample_size=None):
-            for resnet in self.resnets:
-                # pop res hidden states
-                res_hidden_states = res_hidden_states_tuple[-1]
-                res_hidden_states_tuple = res_hidden_states_tuple[:-1]
-                #print(f"in upblock2d, hidden states shape: {hidden_states.shape}")
-                hidden_states = torch.cat([hidden_states, res_hidden_states], dim=1)
-
-                if self.training and self.gradient_checkpointing:
-
-                    def create_custom_forward(module):
-                        def custom_forward(*inputs):
-                            return module(*inputs)
-
-                        return custom_forward
-
-                    if is_torch_version(">=", "1.11.0"):
-                        hidden_states = torch.utils.checkpoint.checkpoint(
-                            create_custom_forward(resnet), hidden_states, temb, use_reentrant=False
-                        )
-                    else:
-                        hidden_states = torch.utils.checkpoint.checkpoint(
-                            create_custom_forward(resnet), hidden_states, temb
-                        )
-                else:
-                    hidden_states = resnet(hidden_states, temb)
-
-            if self.upsamplers is not None:
-                for upsampler in self.upsamplers:
-                    hidden_states = upsampler(hidden_states, upsample_size)
-
-            return hidden_states
-        
-        return forward
-    
-    for i, upsample_block in enumerate(model.unet.up_blocks):
-        if isinstance_str(upsample_block, "UpBlock2D"):
-            upsample_block.forward = up_forward(upsample_block)
-
-
-def register_free_upblock2d(model, b1=1.2, b2=1.4, s1=0.9, s2=0.2):
-    def up_forward(self):
-        def forward(hidden_states, res_hidden_states_tuple, temb=None, upsample_size=None):
-            for resnet in self.resnets:
-                # pop res hidden states
-                res_hidden_states = res_hidden_states_tuple[-1]
-                res_hidden_states_tuple = res_hidden_states_tuple[:-1]
-                #print(f"in free upblock2d, hidden states shape: {hidden_states.shape}")
-                
-                # # --------------- FreeU code -----------------------
-                # # Only operate on the first two stages
-                # if hidden_states.shape[1] == 1280:
-                #     hidden_states[:,:640] = hidden_states[:,:640] * self.b1
-                #     res_hidden_states = Fourier_filter(res_hidden_states, threshold=1, scale=self.s1)
-                # if hidden_states.shape[1] == 640:
-                #     hidden_states[:,:320] = hidden_states[:,:320] * self.b2
-                #     res_hidden_states = Fourier_filter(res_hidden_states, threshold=1, scale=self.s2)
-                # # ---------------------------------------------------------
-
-                # --------------- FreeU code -----------------------
-                # Only operate on the first two stages
-                if hidden_states.shape[1] == 1280:
-                    hidden_mean = hidden_states.mean(1).unsqueeze(1)
-                    B = hidden_mean.shape[0]
-                    hidden_max, _ = torch.max(hidden_mean.view(B, -1), dim=-1, keepdim=True) 
-                    hidden_min, _ = torch.min(hidden_mean.view(B, -1), dim=-1, keepdim=True)
-
-                    hidden_mean = (hidden_mean - hidden_min.unsqueeze(2).unsqueeze(3)) / (hidden_max - hidden_min).unsqueeze(2).unsqueeze(3)
-                    
-                    hidden_states[:,:640] = hidden_states[:,:640] * ((self.b1 - 1 ) * hidden_mean + 1)
-                    res_hidden_states = Fourier_filter(res_hidden_states, threshold=1, scale=self.s1)
-                if hidden_states.shape[1] == 640:
-                    hidden_mean = hidden_states.mean(1).unsqueeze(1)
-                    B = hidden_mean.shape[0]
-                    hidden_max, _ = torch.max(hidden_mean.view(B, -1), dim=-1, keepdim=True) 
-                    hidden_min, _ = torch.min(hidden_mean.view(B, -1), dim=-1, keepdim=True)
-                    hidden_mean = (hidden_mean - hidden_min.unsqueeze(2).unsqueeze(3)) / (hidden_max - hidden_min).unsqueeze(2).unsqueeze(3)
-                    
-                    hidden_states[:,:320] = hidden_states[:,:320] * ((self.b2 - 1 ) * hidden_mean + 1)
-                    res_hidden_states = Fourier_filter(res_hidden_states, threshold=1, scale=self.s2)
-                # ---------------------------------------------------------
-
-                hidden_states = torch.cat([hidden_states, res_hidden_states], dim=1)
-
-                if self.training and self.gradient_checkpointing:
-
-                    def create_custom_forward(module):
-                        def custom_forward(*inputs):
-                            return module(*inputs)
-
-                        return custom_forward
-
-                    if is_torch_version(">=", "1.11.0"):
-                        hidden_states = torch.utils.checkpoint.checkpoint(
-                            create_custom_forward(resnet), hidden_states, temb, use_reentrant=False
-                        )
-                    else:
-                        hidden_states = torch.utils.checkpoint.checkpoint(
-                            create_custom_forward(resnet), hidden_states, temb
-                        )
-                else:
-                    hidden_states = resnet(hidden_states, temb)
-
-            if self.upsamplers is not None:
-                for upsampler in self.upsamplers:
-                    hidden_states = upsampler(hidden_states, upsample_size)
-
-            return hidden_states
-        
-        return forward
-    
-    for i, upsample_block in enumerate(model.unet.up_blocks):
-        if isinstance_str(upsample_block, "UpBlock2D"):
-            upsample_block.forward = up_forward(upsample_block)
-            setattr(upsample_block, 'b1', b1)
-            setattr(upsample_block, 'b2', b2)
-            setattr(upsample_block, 's1', s1)
-            setattr(upsample_block, 's2', s2)
-
-
-def register_crossattn_upblock2d(model):
-    def up_forward(self):
-        def forward(
-            hidden_states: torch.FloatTensor,
-            res_hidden_states_tuple: Tuple[torch.FloatTensor, ...],
-            temb: Optional[torch.FloatTensor] = None,
-            encoder_hidden_states: Optional[torch.FloatTensor] = None,
-            cross_attention_kwargs: Optional[Dict[str, Any]] = None,
-            upsample_size: Optional[int] = None,
-            attention_mask: Optional[torch.FloatTensor] = None,
-            encoder_attention_mask: Optional[torch.FloatTensor] = None,
-        ):
-            for resnet, attn in zip(self.resnets, self.attentions):
-                # pop res hidden states
-                #print(f"in crossatten upblock2d, hidden states shape: {hidden_states.shape}")
-                res_hidden_states = res_hidden_states_tuple[-1]
-                res_hidden_states_tuple = res_hidden_states_tuple[:-1]
-                hidden_states = torch.cat([hidden_states, res_hidden_states], dim=1)
-
-                if self.training and self.gradient_checkpointing:
-
-                    def create_custom_forward(module, return_dict=None):
-                        def custom_forward(*inputs):
-                            if return_dict is not None:
-                                return module(*inputs, return_dict=return_dict)
-                            else:
-                                return module(*inputs)
-
-                        return custom_forward
-
-                    ckpt_kwargs: Dict[str, Any] = {"use_reentrant": False} if is_torch_version(">=", "1.11.0") else {}
-                    hidden_states = torch.utils.checkpoint.checkpoint(
-                        create_custom_forward(resnet),
-                        hidden_states,
-                        temb,
-                        **ckpt_kwargs,
-                    )
-                    hidden_states = torch.utils.checkpoint.checkpoint(
-                        create_custom_forward(attn, return_dict=False),
-                        hidden_states,
-                        encoder_hidden_states,
-                        None,  # timestep
-                        None,  # class_labels
-                        cross_attention_kwargs,
-                        attention_mask,
-                        encoder_attention_mask,
-                        **ckpt_kwargs,
-                    )[0]
-                else:
-                    hidden_states = resnet(hidden_states, temb)
-                    hidden_states = attn(
-                        hidden_states,
-                        encoder_hidden_states=encoder_hidden_states,
-                        cross_attention_kwargs=cross_attention_kwargs,
-                        attention_mask=attention_mask,
-                        encoder_attention_mask=encoder_attention_mask,
-                        return_dict=False,
-                    )[0]
-
-            if self.upsamplers is not None:
-                for upsampler in self.upsamplers:
-                    hidden_states = upsampler(hidden_states, upsample_size)
-
-            return hidden_states
-        
-        return forward
-    
-    for i, upsample_block in enumerate(model.unet.up_blocks):
-        if isinstance_str(upsample_block, "CrossAttnUpBlock2D"):
-            upsample_block.forward = up_forward(upsample_block)
-
-
-def register_free_crossattn_upblock2d(model, b1=1.2, b2=1.4, s1=0.9, s2=0.2):
-    def up_forward(self):
-        def forward(
-            hidden_states: torch.FloatTensor,
-            res_hidden_states_tuple: Tuple[torch.FloatTensor, ...],
-            temb: Optional[torch.FloatTensor] = None,
-            encoder_hidden_states: Optional[torch.FloatTensor] = None,
-            cross_attention_kwargs: Optional[Dict[str, Any]] = None,
-            upsample_size: Optional[int] = None,
-            attention_mask: Optional[torch.FloatTensor] = None,
-            encoder_attention_mask: Optional[torch.FloatTensor] = None,
-        ):
-            for resnet, attn in zip(self.resnets, self.attentions):
-                # pop res hidden states
-                #print(f"in free crossatten upblock2d, hidden states shape: {hidden_states.shape}")
-                res_hidden_states = res_hidden_states_tuple[-1]
-                res_hidden_states_tuple = res_hidden_states_tuple[:-1]
-
-                # --------------- FreeU code -----------------------
-                # Only operate on the first two stages
-                if hidden_states.shape[1] == 1280:
-                    hidden_mean = hidden_states.mean(1).unsqueeze(1)
-                    B = hidden_mean.shape[0]
-                    hidden_max, _ = torch.max(hidden_mean.view(B, -1), dim=-1, keepdim=True) 
-                    hidden_min, _ = torch.min(hidden_mean.view(B, -1), dim=-1, keepdim=True)
-
-                    hidden_mean = (hidden_mean - hidden_min.unsqueeze(2).unsqueeze(3)) / (hidden_max - hidden_min).unsqueeze(2).unsqueeze(3)
-                    
-                    hidden_states[:,:640] = hidden_states[:,:640] * ((self.b1 - 1 ) * hidden_mean + 1)
-                    res_hidden_states = Fourier_filter(res_hidden_states, threshold=1, scale=self.s1)
-                if hidden_states.shape[1] == 640:
-                    hidden_mean = hidden_states.mean(1).unsqueeze(1)
-                    B = hidden_mean.shape[0]
-                    hidden_max, _ = torch.max(hidden_mean.view(B, -1), dim=-1, keepdim=True) 
-                    hidden_min, _ = torch.min(hidden_mean.view(B, -1), dim=-1, keepdim=True)
-                    hidden_mean = (hidden_mean - hidden_min.unsqueeze(2).unsqueeze(3)) / (hidden_max - hidden_min).unsqueeze(2).unsqueeze(3)
-                    
-                    hidden_states[:,:320] = hidden_states[:,:320] * ((self.b2 - 1 ) * hidden_mean + 1)
-                    res_hidden_states = Fourier_filter(res_hidden_states, threshold=1, scale=self.s2)
-                # ---------------------------------------------------------
-
-                hidden_states = torch.cat([hidden_states, res_hidden_states], dim=1)
-
-                if self.training and self.gradient_checkpointing:
-
-                    def create_custom_forward(module, return_dict=None):
-                        def custom_forward(*inputs):
-                            if return_dict is not None:
-                                return module(*inputs, return_dict=return_dict)
-                            else:
-                                return module(*inputs)
-
-                        return custom_forward
-
-                    ckpt_kwargs: Dict[str, Any] = {"use_reentrant": False} if is_torch_version(">=", "1.11.0") else {}
-                    hidden_states = torch.utils.checkpoint.checkpoint(
-                        create_custom_forward(resnet),
-                        hidden_states,
-                        temb,
-                        **ckpt_kwargs,
-                    )
-                    hidden_states = torch.utils.checkpoint.checkpoint(
-                        create_custom_forward(attn, return_dict=False),
-                        hidden_states,
-                        encoder_hidden_states,
-                        None,  # timestep
-                        None,  # class_labels
-                        cross_attention_kwargs,
-                        attention_mask,
-                        encoder_attention_mask,
-                        **ckpt_kwargs,
-                    )[0]
-                else:
-                    hidden_states = resnet(hidden_states, temb)
-                    # hidden_states = attn(
-                    #     hidden_states,
-                    #     encoder_hidden_states=encoder_hidden_states,
-                    #     cross_attention_kwargs=cross_attention_kwargs,
-                    #     encoder_attention_mask=encoder_attention_mask,
-                    #     return_dict=False,
-                    # )[0]
-                    hidden_states = attn(
-                        hidden_states,
-                        encoder_hidden_states=encoder_hidden_states,
-                        cross_attention_kwargs=cross_attention_kwargs,
-                    )[0]
-
-            if self.upsamplers is not None:
-                for upsampler in self.upsamplers:
-                    hidden_states = upsampler(hidden_states, upsample_size)
-
-            return hidden_states
-        
-        return forward
-    
-    for i, upsample_block in enumerate(model.unet.up_blocks):
-        if isinstance_str(upsample_block, "CrossAttnUpBlock2D"):
-            upsample_block.forward = up_forward(upsample_block)
-            setattr(upsample_block, 'b1', b1)
-            setattr(upsample_block, 'b2', b2)
-            setattr(upsample_block, 's1', s1)
-            setattr(upsample_block, 's2', s2)
\ No newline at end of file
diff --git a/spaces/DQChoi/gpt-demo/venv/lib/python3.11/site-packages/dateutil/tz/__init__.py b/spaces/DQChoi/gpt-demo/venv/lib/python3.11/site-packages/dateutil/tz/__init__.py
deleted file mode 100644
index af1352c47292f4eebc5cae8da45641b5544558e3..0000000000000000000000000000000000000000
--- a/spaces/DQChoi/gpt-demo/venv/lib/python3.11/site-packages/dateutil/tz/__init__.py
+++ /dev/null
@@ -1,12 +0,0 @@
-# -*- coding: utf-8 -*-
-from .tz import *
-from .tz import __doc__
-
-__all__ = ["tzutc", "tzoffset", "tzlocal", "tzfile", "tzrange",
-           "tzstr", "tzical", "tzwin", "tzwinlocal", "gettz",
-           "enfold", "datetime_ambiguous", "datetime_exists",
-           "resolve_imaginary", "UTC", "DeprecatedTzFormatWarning"]
-
-
-class DeprecatedTzFormatWarning(Warning):
-    """Warning raised when time zones are parsed from deprecated formats."""
diff --git a/spaces/DQChoi/gpt-demo/venv/lib/python3.11/site-packages/fsspec/parquet.py b/spaces/DQChoi/gpt-demo/venv/lib/python3.11/site-packages/fsspec/parquet.py
deleted file mode 100644
index af55f8cf48e80ed81ba9abc3bff51915a5daf84c..0000000000000000000000000000000000000000
--- a/spaces/DQChoi/gpt-demo/venv/lib/python3.11/site-packages/fsspec/parquet.py
+++ /dev/null
@@ -1,551 +0,0 @@
-import io
-import json
-import warnings
-
-from .core import url_to_fs
-from .utils import merge_offset_ranges
-
-# Parquet-Specific Utilities for fsspec
-#
-# Most of the functions defined in this module are NOT
-# intended for public consumption. The only exception
-# to this is `open_parquet_file`, which should be used
-# place of `fs.open()` to open parquet-formatted files
-# on remote file systems.
-
-
-def open_parquet_file(
-    path,
-    mode="rb",
-    fs=None,
-    metadata=None,
-    columns=None,
-    row_groups=None,
-    storage_options=None,
-    strict=False,
-    engine="auto",
-    max_gap=64_000,
-    max_block=256_000_000,
-    footer_sample_size=1_000_000,
-    **kwargs,
-):
-    """
-    Return a file-like object for a single Parquet file.
-
-    The specified parquet `engine` will be used to parse the
-    footer metadata, and determine the required byte ranges
-    from the file. The target path will then be opened with
-    the "parts" (`KnownPartsOfAFile`) caching strategy.
-
-    Note that this method is intended for usage with remote
-    file systems, and is unlikely to improve parquet-read
-    performance on local file systems.
-
-    Parameters
-    ----------
-    path: str
-        Target file path.
-    mode: str, optional
-        Mode option to be passed through to `fs.open`. Default is "rb".
-    metadata: Any, optional
-        Parquet metadata object. Object type must be supported
-        by the backend parquet engine. For now, only the "fastparquet"
-        engine supports an explicit `ParquetFile` metadata object.
-        If a metadata object is supplied, the remote footer metadata
-        will not need to be transferred into local memory.
-    fs: AbstractFileSystem, optional
-        Filesystem object to use for opening the file. If nothing is
-        specified, an `AbstractFileSystem` object will be inferred.
-    engine : str, default "auto"
-        Parquet engine to use for metadata parsing. Allowed options
-        include "fastparquet", "pyarrow", and "auto". The specified
-        engine must be installed in the current environment. If
-        "auto" is specified, and both engines are installed,
-        "fastparquet" will take precedence over "pyarrow".
-    columns: list, optional
-        List of all column names that may be read from the file.
-    row_groups : list, optional
-        List of all row-groups that may be read from the file. This
-        may be a list of row-group indices (integers), or it may be
-        a list of `RowGroup` metadata objects (if the "fastparquet"
-        engine is used).
-    storage_options : dict, optional
-        Used to generate an `AbstractFileSystem` object if `fs` was
-        not specified.
-    strict : bool, optional
-        Whether the resulting `KnownPartsOfAFile` cache should
-        fetch reads that go beyond a known byte-range boundary.
-        If `False` (the default), any read that ends outside a
-        known part will be zero padded. Note that using
-        `strict=True` may be useful for debugging.
-    max_gap : int, optional
-        Neighboring byte ranges will only be merged when their
-        inter-range gap is <= `max_gap`. Default is 64KB.
-    max_block : int, optional
-        Neighboring byte ranges will only be merged when the size of
-        the aggregated range is <= `max_block`. Default is 256MB.
-    footer_sample_size : int, optional
-        Number of bytes to read from the end of the path to look
-        for the footer metadata. If the sampled bytes do not contain
-        the footer, a second read request will be required, and
-        performance will suffer. Default is 1MB.
-    **kwargs :
-        Optional key-word arguments to pass to `fs.open`
-    """
-
-    # Make sure we have an `AbstractFileSystem` object
-    # to work with
-    if fs is None:
-        fs = url_to_fs(path, **(storage_options or {}))[0]
-
-    # For now, `columns == []` not supported. Just use
-    # default `open` command with `path` input
-    if columns is not None and len(columns) == 0:
-        return fs.open(path, mode=mode)
-
-    # Set the engine
-    engine = _set_engine(engine)
-
-    # Fetch the known byte ranges needed to read
-    # `columns` and/or `row_groups`
-    data = _get_parquet_byte_ranges(
-        [path],
-        fs,
-        metadata=metadata,
-        columns=columns,
-        row_groups=row_groups,
-        engine=engine,
-        max_gap=max_gap,
-        max_block=max_block,
-        footer_sample_size=footer_sample_size,
-    )
-
-    # Extract file name from `data`
-    fn = next(iter(data)) if data else path
-
-    # Call self.open with "parts" caching
-    options = kwargs.pop("cache_options", {}).copy()
-    return fs.open(
-        fn,
-        mode=mode,
-        cache_type="parts",
-        cache_options={
-            **options,
-            **{
-                "data": data.get(fn, {}),
-                "strict": strict,
-            },
-        },
-        **kwargs,
-    )
-
-
-def _get_parquet_byte_ranges(
-    paths,
-    fs,
-    metadata=None,
-    columns=None,
-    row_groups=None,
-    max_gap=64_000,
-    max_block=256_000_000,
-    footer_sample_size=1_000_000,
-    engine="auto",
-):
-    """Get a dictionary of the known byte ranges needed
-    to read a specific column/row-group selection from a
-    Parquet dataset. Each value in the output dictionary
-    is intended for use as the `data` argument for the
-    `KnownPartsOfAFile` caching strategy of a single path.
-    """
-
-    # Set engine if necessary
-    if isinstance(engine, str):
-        engine = _set_engine(engine)
-
-    # Pass to specialized function if metadata is defined
-    if metadata is not None:
-
-        # Use the provided parquet metadata object
-        # to avoid transferring/parsing footer metadata
-        return _get_parquet_byte_ranges_from_metadata(
-            metadata,
-            fs,
-            engine,
-            columns=columns,
-            row_groups=row_groups,
-            max_gap=max_gap,
-            max_block=max_block,
-        )
-
-    # Get file sizes asynchronously
-    file_sizes = fs.sizes(paths)
-
-    # Populate global paths, starts, & ends
-    result = {}
-    data_paths = []
-    data_starts = []
-    data_ends = []
-    add_header_magic = True
-    if columns is None and row_groups is None:
-        # We are NOT selecting specific columns or row-groups.
-        #
-        # We can avoid sampling the footers, and just transfer
-        # all file data with cat_ranges
-        for i, path in enumerate(paths):
-            result[path] = {}
-            for b in range(0, file_sizes[i], max_block):
-                data_paths.append(path)
-                data_starts.append(b)
-                data_ends.append(min(b + max_block, file_sizes[i]))
-        add_header_magic = False  # "Magic" should already be included
-    else:
-        # We ARE selecting specific columns or row-groups.
-        #
-        # Gather file footers.
-        # We just take the last `footer_sample_size` bytes of each
-        # file (or the entire file if it is smaller than that)
-        footer_starts = []
-        footer_ends = []
-        for i, path in enumerate(paths):
-            footer_ends.append(file_sizes[i])
-            sample_size = max(0, file_sizes[i] - footer_sample_size)
-            footer_starts.append(sample_size)
-        footer_samples = fs.cat_ranges(paths, footer_starts, footer_ends)
-
-        # Check our footer samples and re-sample if necessary.
-        missing_footer_starts = footer_starts.copy()
-        large_footer = 0
-        for i, path in enumerate(paths):
-            footer_size = int.from_bytes(footer_samples[i][-8:-4], "little")
-            real_footer_start = file_sizes[i] - (footer_size + 8)
-            if real_footer_start < footer_starts[i]:
-                missing_footer_starts[i] = real_footer_start
-                large_footer = max(large_footer, (footer_size + 8))
-        if large_footer:
-            warnings.warn(
-                f"Not enough data was used to sample the parquet footer. "
-                f"Try setting footer_sample_size >= {large_footer}."
-            )
-            for i, block in enumerate(
-                fs.cat_ranges(
-                    paths,
-                    missing_footer_starts,
-                    footer_starts,
-                )
-            ):
-                footer_samples[i] = block + footer_samples[i]
-                footer_starts[i] = missing_footer_starts[i]
-
-        # Calculate required byte ranges for each path
-        for i, path in enumerate(paths):
-
-            # Deal with small-file case.
-            # Just include all remaining bytes of the file
-            # in a single range.
-            if file_sizes[i] < max_block:
-                if footer_starts[i] > 0:
-                    # Only need to transfer the data if the
-                    # footer sample isn't already the whole file
-                    data_paths.append(path)
-                    data_starts.append(0)
-                    data_ends.append(footer_starts[i])
-                continue
-
-            # Use "engine" to collect data byte ranges
-            path_data_starts, path_data_ends = engine._parquet_byte_ranges(
-                columns,
-                row_groups=row_groups,
-                footer=footer_samples[i],
-                footer_start=footer_starts[i],
-            )
-
-            data_paths += [path] * len(path_data_starts)
-            data_starts += path_data_starts
-            data_ends += path_data_ends
-
-        # Merge adjacent offset ranges
-        data_paths, data_starts, data_ends = merge_offset_ranges(
-            data_paths,
-            data_starts,
-            data_ends,
-            max_gap=max_gap,
-            max_block=max_block,
-            sort=False,  # Should already be sorted
-        )
-
-        # Start by populating `result` with footer samples
-        for i, path in enumerate(paths):
-            result[path] = {(footer_starts[i], footer_ends[i]): footer_samples[i]}
-
-    # Transfer the data byte-ranges into local memory
-    _transfer_ranges(fs, result, data_paths, data_starts, data_ends)
-
-    # Add b"PAR1" to header if necessary
-    if add_header_magic:
-        _add_header_magic(result)
-
-    return result
-
-
-def _get_parquet_byte_ranges_from_metadata(
-    metadata,
-    fs,
-    engine,
-    columns=None,
-    row_groups=None,
-    max_gap=64_000,
-    max_block=256_000_000,
-):
-    """Simplified version of `_get_parquet_byte_ranges` for
-    the case that an engine-specific `metadata` object is
-    provided, and the remote footer metadata does not need to
-    be transferred before calculating the required byte ranges.
-    """
-
-    # Use "engine" to collect data byte ranges
-    data_paths, data_starts, data_ends = engine._parquet_byte_ranges(
-        columns,
-        row_groups=row_groups,
-        metadata=metadata,
-    )
-
-    # Merge adjacent offset ranges
-    data_paths, data_starts, data_ends = merge_offset_ranges(
-        data_paths,
-        data_starts,
-        data_ends,
-        max_gap=max_gap,
-        max_block=max_block,
-        sort=False,  # Should be sorted
-    )
-
-    # Transfer the data byte-ranges into local memory
-    result = {fn: {} for fn in list(set(data_paths))}
-    _transfer_ranges(fs, result, data_paths, data_starts, data_ends)
-
-    # Add b"PAR1" to header
-    _add_header_magic(result)
-
-    return result
-
-
-def _transfer_ranges(fs, blocks, paths, starts, ends):
-    # Use cat_ranges to gather the data byte_ranges
-    ranges = (paths, starts, ends)
-    for path, start, stop, data in zip(*ranges, fs.cat_ranges(*ranges)):
-        blocks[path][(start, stop)] = data
-
-
-def _add_header_magic(data):
-    # Add b"PAR1" to file headers
-    for i, path in enumerate(list(data.keys())):
-        add_magic = True
-        for k in data[path].keys():
-            if k[0] == 0 and k[1] >= 4:
-                add_magic = False
-                break
-        if add_magic:
-            data[path][(0, 4)] = b"PAR1"
-
-
-def _set_engine(engine_str):
-
-    # Define a list of parquet engines to try
-    if engine_str == "auto":
-        try_engines = ("fastparquet", "pyarrow")
-    elif not isinstance(engine_str, str):
-        raise ValueError(
-            "Failed to set parquet engine! "
-            "Please pass 'fastparquet', 'pyarrow', or 'auto'"
-        )
-    elif engine_str not in ("fastparquet", "pyarrow"):
-        raise ValueError(f"{engine_str} engine not supported by `fsspec.parquet`")
-    else:
-        try_engines = [engine_str]
-
-    # Try importing the engines in `try_engines`,
-    # and choose the first one that succeeds
-    for engine in try_engines:
-        try:
-            if engine == "fastparquet":
-                return FastparquetEngine()
-            elif engine == "pyarrow":
-                return PyarrowEngine()
-        except ImportError:
-            pass
-
-    # Raise an error if a supported parquet engine
-    # was not found
-    raise ImportError(
-        f"The following parquet engines are not installed "
-        f"in your python environment: {try_engines}."
-        f"Please install 'fastparquert' or 'pyarrow' to "
-        f"utilize the `fsspec.parquet` module."
-    )
-
-
-class FastparquetEngine:
-
-    # The purpose of the FastparquetEngine class is
-    # to check if fastparquet can be imported (on initialization)
-    # and to define a `_parquet_byte_ranges` method. In the
-    # future, this class may also be used to define other
-    # methods/logic that are specific to fastparquet.
-
-    def __init__(self):
-        import fastparquet as fp
-
-        self.fp = fp
-
-    def _row_group_filename(self, row_group, pf):
-        return pf.row_group_filename(row_group)
-
-    def _parquet_byte_ranges(
-        self,
-        columns,
-        row_groups=None,
-        metadata=None,
-        footer=None,
-        footer_start=None,
-    ):
-
-        # Initialize offset ranges and define ParqetFile metadata
-        pf = metadata
-        data_paths, data_starts, data_ends = [], [], []
-        if pf is None:
-            pf = self.fp.ParquetFile(io.BytesIO(footer))
-
-        # Convert columns to a set and add any index columns
-        # specified in the pandas metadata (just in case)
-        column_set = None if columns is None else set(columns)
-        if column_set is not None and hasattr(pf, "pandas_metadata"):
-            md_index = [
-                ind
-                for ind in pf.pandas_metadata.get("index_columns", [])
-                # Ignore RangeIndex information
-                if not isinstance(ind, dict)
-            ]
-            column_set |= set(md_index)
-
-        # Check if row_groups is a list of integers
-        # or a list of row-group metadata
-        if row_groups and not isinstance(row_groups[0], int):
-            # Input row_groups contains row-group metadata
-            row_group_indices = None
-        else:
-            # Input row_groups contains row-group indices
-            row_group_indices = row_groups
-            row_groups = pf.row_groups
-
-        # Loop through column chunks to add required byte ranges
-        for r, row_group in enumerate(row_groups):
-            # Skip this row-group if we are targeting
-            # specific row-groups
-            if row_group_indices is None or r in row_group_indices:
-
-                # Find the target parquet-file path for `row_group`
-                fn = self._row_group_filename(row_group, pf)
-
-                for column in row_group.columns:
-                    name = column.meta_data.path_in_schema[0]
-                    # Skip this column if we are targeting a
-                    # specific columns
-                    if column_set is None or name in column_set:
-                        file_offset0 = column.meta_data.dictionary_page_offset
-                        if file_offset0 is None:
-                            file_offset0 = column.meta_data.data_page_offset
-                        num_bytes = column.meta_data.total_compressed_size
-                        if footer_start is None or file_offset0 < footer_start:
-                            data_paths.append(fn)
-                            data_starts.append(file_offset0)
-                            data_ends.append(
-                                min(
-                                    file_offset0 + num_bytes,
-                                    footer_start or (file_offset0 + num_bytes),
-                                )
-                            )
-
-        if metadata:
-            # The metadata in this call may map to multiple
-            # file paths. Need to include `data_paths`
-            return data_paths, data_starts, data_ends
-        return data_starts, data_ends
-
-
-class PyarrowEngine:
-
-    # The purpose of the PyarrowEngine class is
-    # to check if pyarrow can be imported (on initialization)
-    # and to define a `_parquet_byte_ranges` method. In the
-    # future, this class may also be used to define other
-    # methods/logic that are specific to pyarrow.
-
-    def __init__(self):
-        import pyarrow.parquet as pq
-
-        self.pq = pq
-
-    def _row_group_filename(self, row_group, metadata):
-        raise NotImplementedError
-
-    def _parquet_byte_ranges(
-        self,
-        columns,
-        row_groups=None,
-        metadata=None,
-        footer=None,
-        footer_start=None,
-    ):
-
-        if metadata is not None:
-            raise ValueError("metadata input not supported for PyarrowEngine")
-
-        data_starts, data_ends = [], []
-        md = self.pq.ParquetFile(io.BytesIO(footer)).metadata
-
-        # Convert columns to a set and add any index columns
-        # specified in the pandas metadata (just in case)
-        column_set = None if columns is None else set(columns)
-        if column_set is not None:
-            schema = md.schema.to_arrow_schema()
-            has_pandas_metadata = (
-                schema.metadata is not None and b"pandas" in schema.metadata
-            )
-            if has_pandas_metadata:
-                md_index = [
-                    ind
-                    for ind in json.loads(
-                        schema.metadata[b"pandas"].decode("utf8")
-                    ).get("index_columns", [])
-                    # Ignore RangeIndex information
-                    if not isinstance(ind, dict)
-                ]
-                column_set |= set(md_index)
-
-        # Loop through column chunks to add required byte ranges
-        for r in range(md.num_row_groups):
-            # Skip this row-group if we are targeting
-            # specific row-groups
-            if row_groups is None or r in row_groups:
-                row_group = md.row_group(r)
-                for c in range(row_group.num_columns):
-                    column = row_group.column(c)
-                    name = column.path_in_schema
-                    # Skip this column if we are targeting a
-                    # specific columns
-                    split_name = name.split(".")[0]
-                    if (
-                        column_set is None
-                        or name in column_set
-                        or split_name in column_set
-                    ):
-                        file_offset0 = column.dictionary_page_offset
-                        if file_offset0 is None:
-                            file_offset0 = column.data_page_offset
-                        num_bytes = column.total_compressed_size
-                        if file_offset0 < footer_start:
-                            data_starts.append(file_offset0)
-                            data_ends.append(
-                                min(file_offset0 + num_bytes, footer_start)
-                            )
-        return data_starts, data_ends
diff --git a/spaces/Datasculptor/3D-Room-Layout-Estimation_LGT-Net/models/modules/transformer.py b/spaces/Datasculptor/3D-Room-Layout-Estimation_LGT-Net/models/modules/transformer.py
deleted file mode 100644
index f3d2aa093c748bbc1408491cacab153977b4a4cb..0000000000000000000000000000000000000000
--- a/spaces/Datasculptor/3D-Room-Layout-Estimation_LGT-Net/models/modules/transformer.py
+++ /dev/null
@@ -1,44 +0,0 @@
-from models.modules.transformer_modules import *
-
-
-class Transformer(nn.Module):
-    def __init__(self, dim, depth, heads, win_size, dim_head, mlp_dim,
-                 dropout=0., patch_num=None, ape=None, rpe=None, rpe_pos=1):
-        super().__init__()
-
-        self.absolute_pos_embed = None if patch_num is None or ape is None else AbsolutePosition(dim, dropout,
-                                                                                                 patch_num, ape)
-        self.pos_dropout = nn.Dropout(dropout)
-        self.layers = nn.ModuleList([])
-        for _ in range(depth):
-            self.layers.append(nn.ModuleList([
-                PreNorm(dim, Attention(dim, heads=heads, dim_head=dim_head, dropout=dropout, patch_num=patch_num,
-                                       rpe=rpe, rpe_pos=rpe_pos)),
-                PreNorm(dim, FeedForward(dim, mlp_dim, dropout=dropout))
-            ]))
-
-    def forward(self, x):
-        if self.absolute_pos_embed is not None:
-            x = self.absolute_pos_embed(x)
-        x = self.pos_dropout(x)
-        for attn, ff in self.layers:
-            x = attn(x) + x
-            x = ff(x) + x
-        return x
-
-
-if __name__ == '__main__':
-    token_dim = 1024
-    toke_len = 256
-
-    transformer = Transformer(dim=token_dim, depth=6, heads=16,
-                              dim_head=64, mlp_dim=2048, dropout=0.1,
-                              patch_num=256, ape='lr_parameter', rpe='lr_parameter_mirror')
-
-    total = sum(p.numel() for p in transformer.parameters())
-    trainable = sum(p.numel() for p in transformer.parameters() if p.requires_grad)
-    print('parameter total:{:,}, trainable:{:,}'.format(total, trainable))
-
-    input = torch.randn(1, toke_len, token_dim)
-    output = transformer(input)
-    print(output.shape)
diff --git a/spaces/DevashishBhake/Face_Mask_Detection/README.md b/spaces/DevashishBhake/Face_Mask_Detection/README.md
deleted file mode 100644
index 3915737634dec6da44df673fdf09a4578c43c9ad..0000000000000000000000000000000000000000
--- a/spaces/DevashishBhake/Face_Mask_Detection/README.md
+++ /dev/null
@@ -1,13 +0,0 @@
----
-title: Face Mask Detection
-emoji: 🔥
-colorFrom: green
-colorTo: blue
-sdk: gradio
-sdk_version: 3.27.0
-app_file: app.py
-pinned: false
-license: mit
----
-
-Check out the configuration reference at https://huggingface.co/docs/hub/spaces-config-reference
diff --git a/spaces/Docfile/open_llm_leaderboard/Makefile b/spaces/Docfile/open_llm_leaderboard/Makefile
deleted file mode 100644
index b5685772804c8af4235a8504dc6752bfc9ae5d1d..0000000000000000000000000000000000000000
--- a/spaces/Docfile/open_llm_leaderboard/Makefile
+++ /dev/null
@@ -1,13 +0,0 @@
-.PHONY: style format
-
-
-style:
-	python -m black --line-length 119 .
-	python -m isort .
-	ruff check --fix .
-
-
-quality:
-	python -m black --check --line-length 119 .
-	python -m isort --check-only .
-	ruff check .
diff --git a/spaces/DragGan/DragGan/stylegan_human/utils/__init__.py b/spaces/DragGan/DragGan/stylegan_human/utils/__init__.py
deleted file mode 100644
index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000
diff --git a/spaces/Eddycrack864/Applio-Inference/diffq/diffq.py b/spaces/Eddycrack864/Applio-Inference/diffq/diffq.py
deleted file mode 100644
index b475ec7f55227417b014c69b5cf55033182113e1..0000000000000000000000000000000000000000
--- a/spaces/Eddycrack864/Applio-Inference/diffq/diffq.py
+++ /dev/null
@@ -1,286 +0,0 @@
-# Copyright (c) Facebook, Inc. and its affiliates.
-# All rights reserved.
-#
-# This source code is licensed under the license found in the
-# LICENSE file in the root directory of this source tree.
-
-"""
-Differentiable quantizer based on scaled noise injection.
-"""
-from dataclasses import dataclass
-import math
-import typing as tp
-
-import torch
-
-from .base import BaseQuantizer
-from .uniform import uniform_quantize, uniform_unquantize
-from .utils import simple_repr
-
-
-class DiffQuantizer(BaseQuantizer):
-    @dataclass
-    class _QuantizedParam(BaseQuantizer._QuantizedParam):
-        logit: torch.nn.Parameter
-
-    def __init__(self, model: torch.nn.Module, min_size: float = 0.01, float16: bool = False,
-                 group_size: int = 1, min_bits: float = 2, max_bits: float = 15,
-                 param="bits", noise="gaussian",
-                 init_bits: float = 8, extra_bits: float = 0, suffix: str = "_diffq",
-                 exclude: tp.List[str] = [], detect_bound: bool = True):
-        """
-        Differentiable quantizer based on scaled noise injection.
-        For every parameter `p` in the model, this introduces a number of bits parameter
-        `b` with the same dimensions (when group_size = 1).
-        Before each forward, `p` is replaced by `p + U`
-        with U uniform iid noise with range [-d/2, d/2], with `d` the uniform quantization
-        step for `b` bits.
-        This noise approximates the quantization noise in a differentiable manner, both
-        with respect to the unquantized parameter `p` and the number of bits `b`.
-
-        At eveluation (as detected with `model.eval()`), the model is replaced
-        by its true quantized version, and restored when going back to training.
-
-        When doing actual quantization (for serialization, or evaluation),
-        the number of bits is rounded to the nearest integer, and needs to be stored along.
-        This will cost a few bits per dimension. To reduce this cost, one can use `group_size`,
-        which will use a single noise level for multiple weight entries.
-
-        You can use the `DiffQuantizer.model_size` method to get a differentiable estimate of the
-        model size in MB. You can then use this estimate as a penalty in your training loss.
-
-        Args:
-            model (torch.nn.Module): model to quantize
-            min_size (float): minimum size in MB of a parameter to be quantized.
-            float16 (bool): if a layer is smaller than min_size, should we still do float16?
-            group_size (int): weight entries are groupped together to reduce the number
-                of noise scales to store. This should divide the size of all parameters
-                bigger than min_size.
-            min_bits (float): minimal number of bits.
-            max_bits (float): maximal number of bits.
-            init_bits (float): initial number of bits.
-            extra_bits (float): extra bits to add for actual quantization (before roundoff).
-            suffix (str): suffix used for the name of the extra noise scale parameters.
-            exclude (list[str]): list of patterns used to match parameters to exclude.
-                For instance `['bias']` to exclude all bias terms.
-            detect_bound (bool): if True, will detect bound parameters and reuse
-                the same quantized tensor for both, as well as the same number of bits.
-
-        ..Warning::
-            You must call `model.training()` and `model.eval()` for `DiffQuantizer` work properly.
-
-        """
-        self.group_size = group_size
-        self.min_bits = min_bits
-        self.max_bits = max_bits
-        self.init_bits = init_bits
-        self.extra_bits = extra_bits
-        self.suffix = suffix
-        self.param = param
-        self.noise = noise
-        assert noise in ["gaussian", "uniform"]
-        self._optimizer_setup = False
-
-        self._min_noise = 1 / (2 ** self.max_bits - 1)
-        self._max_noise = 1 / (2 ** self.min_bits - 1)
-
-        assert group_size >= 0
-        assert min_bits < init_bits < max_bits, \
-               "init_bits must be between min_bits and max_bits excluded3"
-
-        for name, _ in model.named_parameters():
-            if name.endswith(suffix):
-                raise RuntimeError("The model already has some noise scales parameters, "
-                                   "maybe you used twice a DiffQuantizer on the same model?.")
-
-        super().__init__(model, min_size, float16, exclude, detect_bound)
-
-    def _get_bits(self, logit: torch.Tensor):
-        if self.param == "noise":
-            return torch.log2(1 + 1 / self._get_noise_scale(logit))
-        else:
-            t = torch.sigmoid(logit)
-            return self.max_bits * t + (1 - t) * self.min_bits
-
-    def _get_noise_scale(self, logit: torch.Tensor):
-        if self.param == "noise":
-            t = torch.sigmoid(logit)
-            return torch.exp(t * math.log(self._min_noise) + (1 - t) * math.log(self._max_noise))
-        else:
-            return 1 / (2 ** self._get_bits(logit) - 1)
-
-    def _register_param(self, name, param, module, other):
-        if other is not None:
-            return self.__class__._QuantizedParam(
-               name=name, param=param, module=module, logit=other.logit, other=other)
-        assert self.group_size == 0 or param.numel() % self.group_size == 0
-        # we want the initial number of bits to be init_bits.
-        if self.param == "noise":
-            noise_scale = 1 / (2 ** self.init_bits - 1)
-            t = (math.log(noise_scale) - math.log(self._max_noise)) / (
-                math.log(self._min_noise) - math.log(self._max_noise))
-        else:
-            t = (self.init_bits - self.min_bits) / (self.max_bits - self.min_bits)
-        assert 0 < t < 1
-        logit = torch.logit(torch.tensor(float(t)))
-        assert abs(self._get_bits(logit) - self.init_bits) < 1e-5
-        if self.group_size > 0:
-            nparam = param.numel() // self.group_size
-        else:
-            nparam = 1
-        logit = torch.nn.Parameter(
-            torch.full(
-                (nparam,),
-                logit,
-                device=param.device))
-        module.register_parameter(name + self.suffix, logit)
-        return self.__class__._QuantizedParam(
-           name=name, param=param, module=module, logit=logit, other=None)
-
-    def clear_optimizer(self, optimizer: torch.optim.Optimizer):
-        params = [qp.logit for qp in self._qparams]
-
-        for group in optimizer.param_groups:
-            new_params = []
-            for q in list(group["params"]):
-                matched = False
-                for p in params:
-                    if p is q:
-                        matched = True
-                if not matched:
-                    new_params.append(q)
-            group["params"][:] = new_params
-
-    def setup_optimizer(self, optimizer: torch.optim.Optimizer,
-                        lr: float = 1e-3, **kwargs):
-        """
-        Setup the optimizer to tune the number of bits. In particular, this will deactivate
-        weight decay for the bits parameters.
-
-        Args:
-            optimizer (torch.Optimizer): optimizer to use.
-            lr (float): specific learning rate for the bits parameters. 1e-3
-                is perfect for Adam.,w
-            kwargs (dict): overrides for other optimization parameters for the bits.
-        """
-        assert not self._optimizer_setup
-        self._optimizer_setup = True
-
-        params = [qp.logit for qp in self._qparams]
-
-        for group in optimizer.param_groups:
-            for q in list(group["params"]):
-                for p in params:
-                    if p is q:
-                        raise RuntimeError("You should create the optimizer "
-                                           "before the quantizer!")
-
-        group = {"params": params, "lr": lr, "weight_decay": 0}
-        group.update(kwargs)
-        optimizer.add_param_group(group)
-
-    def no_optimizer(self):
-        """
-        Call this if you do not want to use an optimizer.
-        """
-        self._optimizer_setup = True
-
-    def check_unused(self):
-        for qparam in self._qparams:
-            if qparam.other is not None:
-                continue
-            grad = qparam.param.grad
-            if grad is None or (grad == 0).all():
-                if qparam.logit.grad is not None:
-                    qparam.logit.grad.data.zero_()
-
-    def model_size(self, exact=False):
-        """
-        Differentiable estimate of the model size.
-        The size is returned in MB.
-
-        If `exact` is True, then the output is no longer differentiable but
-        reflect exactly an achievable size, even without compression,
-        i.e.same as returned by `naive_model_size()`.
-        """
-        total = super().model_size()
-        subtotal = 0
-        for qparam in self._qparams:
-            # only count the first appearance of a Parameter
-            if qparam.other is not None:
-                continue
-            bits = self.extra_bits + self._get_bits(qparam.logit)
-            if exact:
-                bits = bits.round().clamp(1, 15)
-            if self.group_size == 0:
-                group_size = qparam.param.numel()
-            else:
-                group_size = self.group_size
-            subtotal += group_size * bits.sum()
-            subtotal += 2 * 32  # param scale
-
-            # Number of bits to represent each number of bits
-            bits_bits = math.ceil(math.log2(1 + (bits.max().round().item() - self.min_bits)))
-            subtotal += 8  # 8 bits for bits_bits
-            subtotal += bits_bits * bits.numel()
-
-        subtotal /= 2 ** 20 * 8  # bits -> MegaBytes
-        return total + subtotal
-
-    def true_model_size(self):
-        """
-        Naive model size without zlib compression.
-        """
-        return self.model_size(exact=True).item()
-
-    def _pre_forward_train(self):
-        if not self._optimizer_setup:
-            raise RuntimeError("You must call `setup_optimizer()` on your optimizer "
-                               "before starting training.")
-        for qparam in self._qparams:
-            if qparam.other is not None:
-                noisy = qparam.other.module._parameters[qparam.other.name]
-            else:
-                bits = self._get_bits(qparam.logit)[:, None]
-                if self.group_size == 0:
-                    p_flat = qparam.param.view(-1)
-                else:
-                    p_flat = qparam.param.view(-1, self.group_size)
-                scale = p_flat.max() - p_flat.min()
-                unit = 1 / (2**bits - 1)
-                if self.noise == "uniform":
-                    noise_source = (torch.rand_like(p_flat) - 0.5)
-                elif self.noise == "gaussian":
-                    noise_source = torch.randn_like(p_flat) / 2
-                noise = scale * unit * noise_source
-                noisy = p_flat + noise
-            # We bypass the checks by PyTorch on parameters being leafs
-            qparam.module._parameters[qparam.name] = noisy.view_as(qparam.param)
-        return True
-
-    def _post_forward_train(self):
-        for qparam in self._qparams:
-            qparam.module._parameters[qparam.name] = qparam.param
-        return True
-
-    def _quantize_param(self, qparam: _QuantizedParam) -> tp.Any:
-        bits = self.extra_bits + self._get_bits(qparam.logit)
-        bits = bits.round().clamp(1, 15)[:, None].byte()
-        if self.group_size == 0:
-            p = qparam.param.data.view(-1)
-        else:
-            p = qparam.param.data.view(-1, self.group_size)
-        levels, scales = uniform_quantize(p, bits)
-        return levels, scales, bits
-
-    def _unquantize_param(self, qparam: _QuantizedParam, quantized: tp.Any) -> torch.Tensor:
-        levels, param_scale, bits = quantized
-        return uniform_unquantize(levels, param_scale, bits).view_as(qparam.param.data)
-
-    def detach(self):
-        super().detach()
-        for qparam in self._qparams:
-            delattr(qparam.module, qparam.name + self.suffix)
-
-    def __repr__(self):
-        return simple_repr(self)
diff --git a/spaces/Eddycrack864/Applio-Inference/easy_infer.py b/spaces/Eddycrack864/Applio-Inference/easy_infer.py
deleted file mode 100644
index 81a70d3648c38120f908cdaf2ea3bd15af9dec26..0000000000000000000000000000000000000000
--- a/spaces/Eddycrack864/Applio-Inference/easy_infer.py
+++ /dev/null
@@ -1,1383 +0,0 @@
-import subprocess
-import os
-import sys
-import errno
-import shutil
-import yt_dlp
-from mega import Mega
-import datetime
-import unicodedata
-import torch
-import glob
-import gradio as gr
-import gdown
-import zipfile
-import traceback
-import json
-import mdx
-from mdx_processing_script import get_model_list,id_to_ptm,prepare_mdx,run_mdx
-import requests
-import wget
-import ffmpeg
-import hashlib
-now_dir = os.getcwd()
-sys.path.append(now_dir)
-from unidecode import unidecode
-import re
-import time
-from lib.infer_pack.models_onnx import SynthesizerTrnMsNSFsidM
-from infer.modules.vc.pipeline import Pipeline
-VC = Pipeline
-from lib.infer_pack.models import (
-    SynthesizerTrnMs256NSFsid,
-    SynthesizerTrnMs256NSFsid_nono,
-    SynthesizerTrnMs768NSFsid,
-    SynthesizerTrnMs768NSFsid_nono,
-)
-from MDXNet import MDXNetDereverb
-from configs.config import Config
-from infer_uvr5 import _audio_pre_, _audio_pre_new
-from huggingface_hub import HfApi, list_models
-from huggingface_hub import login
-from i18n import I18nAuto
-i18n = I18nAuto()
-from bs4 import BeautifulSoup
-from sklearn.cluster import MiniBatchKMeans
-from dotenv import load_dotenv
-load_dotenv()
-config = Config()
-tmp = os.path.join(now_dir, "TEMP")
-shutil.rmtree(tmp, ignore_errors=True)
-os.environ["TEMP"] = tmp
-weight_root = os.getenv("weight_root")
-weight_uvr5_root = os.getenv("weight_uvr5_root")
-index_root = os.getenv("index_root")
-audio_root = "audios"
-names = []
-for name in os.listdir(weight_root):
-    if name.endswith(".pth"):
-        names.append(name)
-index_paths = []
-
-global indexes_list
-indexes_list = []
-
-audio_paths = []
-for root, dirs, files in os.walk(index_root, topdown=False):
-    for name in files:
-        if name.endswith(".index") and "trained" not in name:
-            index_paths.append("%s\\%s" % (root, name))
-
-for root, dirs, files in os.walk(audio_root, topdown=False):
-    for name in files:
-        audio_paths.append("%s/%s" % (root, name))
-
-uvr5_names = []
-for name in os.listdir(weight_uvr5_root):
-    if name.endswith(".pth") or "onnx" in name:
-        uvr5_names.append(name.replace(".pth", ""))
-
-def calculate_md5(file_path):
-    hash_md5 = hashlib.md5()
-    with open(file_path, "rb") as f:
-        for chunk in iter(lambda: f.read(4096), b""):
-            hash_md5.update(chunk)
-    return hash_md5.hexdigest()
-
-def format_title(title):
-     formatted_title = re.sub(r'[^\w\s-]', '', title)
-     formatted_title = formatted_title.replace(" ", "_")
-     return formatted_title
-
-def silentremove(filename):
-    try:
-        os.remove(filename)
-    except OSError as e: 
-        if e.errno != errno.ENOENT: 
-            raise 
-def get_md5(temp_folder):
-  for root, subfolders, files in os.walk(temp_folder):
-    for file in files:
-      if not file.startswith("G_") and not file.startswith("D_") and file.endswith(".pth") and not "_G_" in file and not "_D_" in file:
-        md5_hash = calculate_md5(os.path.join(root, file))
-        return md5_hash
-
-  return None
-
-def find_parent(search_dir, file_name):
-    for dirpath, dirnames, filenames in os.walk(search_dir):
-        if file_name in filenames:
-            return os.path.abspath(dirpath)
-    return None
-
-def find_folder_parent(search_dir, folder_name):
-    for dirpath, dirnames, filenames in os.walk(search_dir):
-        if folder_name in dirnames:
-            return os.path.abspath(dirpath)
-    return None
-
-
-
-def download_from_url(url):
-    parent_path = find_folder_parent(".", "pretrained_v2")
-    zips_path = os.path.join(parent_path, 'zips')
-    
-    if url != '':
-        print(i18n("Downloading the file: ") + f"{url}")
-        if "drive.google.com" in url:
-            if "file/d/" in url:
-                file_id = url.split("file/d/")[1].split("/")[0]
-            elif "id=" in url:
-                file_id = url.split("id=")[1].split("&")[0]
-            else:
-                return None
-            
-            if file_id:
-                os.chdir('./zips')
-                result = subprocess.run(["gdown", f"https://drive.google.com/uc?id={file_id}", "--fuzzy"], capture_output=True, text=True, encoding='utf-8')
-                if "Too many users have viewed or downloaded this file recently" in str(result.stderr):
-                    return "too much use"
-                if "Cannot retrieve the public link of the file." in str(result.stderr):
-                    return "private link"
-                print(result.stderr)
-                
-        elif "/blob/" in url:
-            os.chdir('./zips')
-            url = url.replace("blob", "resolve")
-            response = requests.get(url)
-            if response.status_code == 200:
-                file_name = url.split('/')[-1]
-                with open(os.path.join(zips_path, file_name), "wb") as newfile:
-                    newfile.write(response.content)
-            else:
-                    os.chdir(parent_path)
-        elif "mega.nz" in url:
-            if "#!" in url:
-                file_id = url.split("#!")[1].split("!")[0]
-            elif "file/" in url:
-                file_id = url.split("file/")[1].split("/")[0]
-            else:
-                return None
-            if file_id:
-                m = Mega()
-                m.download_url(url, zips_path)
-        elif "/tree/main" in url:
-           response = requests.get(url)
-           soup = BeautifulSoup(response.content, 'html.parser')
-           temp_url = ''
-           for link in soup.find_all('a', href=True):
-               if link['href'].endswith('.zip'):
-                  temp_url = link['href']
-                  break
-           if temp_url:
-              url = temp_url
-              url = url.replace("blob", "resolve")
-              if "huggingface.co" not in url:
-                 url = "https://huggingface.co" + url
-
-                 wget.download(url)
-           else:
-                 print("No .zip file found on the page.")
-        elif "cdn.discordapp.com" in url:
-            file = requests.get(url)
-            if file.status_code == 200:
-                name = url.split('/')
-                with open(os.path.join(zips_path, name[len(name)-1]), "wb") as newfile:
-                    newfile.write(file.content)
-            else:
-                return None
-        elif "pixeldrain.com" in url:
-            try:
-                file_id = url.split("pixeldrain.com/u/")[1]
-                os.chdir('./zips')
-                print(file_id)
-                response = requests.get(f"https://pixeldrain.com/api/file/{file_id}")
-                if response.status_code == 200:
-                    file_name = response.headers.get("Content-Disposition").split('filename=')[-1].strip('";')
-                    if not os.path.exists(zips_path):
-                        os.makedirs(zips_path)
-                    with open(os.path.join(zips_path, file_name), "wb") as newfile:
-                        newfile.write(response.content)
-                        os.chdir(parent_path)
-                        return "downloaded"
-                else:
-                    os.chdir(parent_path)
-                    return None
-            except Exception as e:
-                print(e)
-                os.chdir(parent_path)
-                return None
-        else:
-            os.chdir('./zips')
-            wget.download(url)
-            
-        os.chdir(parent_path)
-        print(i18n("Full download"))
-        return "downloaded"
-    else:
-        return None
-                
-class error_message(Exception):
-    def __init__(self, mensaje):
-        self.mensaje = mensaje
-        super().__init__(mensaje)
-
-def get_vc(sid, to_return_protect0, to_return_protect1):
-    global n_spk, tgt_sr, net_g, vc, cpt, version
-    if sid == "" or sid == []:
-        global hubert_model
-        if hubert_model is not None: 
-            print("clean_empty_cache")
-            del net_g, n_spk, vc, hubert_model, tgt_sr 
-            hubert_model = net_g = n_spk = vc = hubert_model = tgt_sr = None
-            if torch.cuda.is_available():
-                torch.cuda.empty_cache()
-            if_f0 = cpt.get("f0", 1)
-            version = cpt.get("version", "v1")
-            if version == "v1":
-                if if_f0 == 1:
-                    net_g = SynthesizerTrnMs256NSFsid(
-                        *cpt["config"], is_half=config.is_half
-                    )
-                else:
-                    net_g = SynthesizerTrnMs256NSFsid_nono(*cpt["config"])
-            elif version == "v2":
-                if if_f0 == 1:
-                    net_g = SynthesizerTrnMs768NSFsid(
-                        *cpt["config"], is_half=config.is_half
-                    )
-                else:
-                    net_g = SynthesizerTrnMs768NSFsid_nono(*cpt["config"])
-            del net_g, cpt
-            if torch.cuda.is_available():
-                torch.cuda.empty_cache()
-            cpt = None
-        return (
-            {"visible": False, "__type__": "update"},
-            {"visible": False, "__type__": "update"},
-            {"visible": False, "__type__": "update"},
-        )
-    person = "%s/%s" % (weight_root, sid)
-    print("loading %s" % person)
-    cpt = torch.load(person, map_location="cpu")
-    tgt_sr = cpt["config"][-1]
-    cpt["config"][-3] = cpt["weight"]["emb_g.weight"].shape[0]  
-    if_f0 = cpt.get("f0", 1)
-    if if_f0 == 0:
-        to_return_protect0 = to_return_protect1 = {
-            "visible": False,
-            "value": 0.5,
-            "__type__": "update",
-        }
-    else:
-        to_return_protect0 = {
-            "visible": True,
-            "value": to_return_protect0,
-            "__type__": "update",
-        }
-        to_return_protect1 = {
-            "visible": True,
-            "value": to_return_protect1,
-            "__type__": "update",
-        }
-    version = cpt.get("version", "v1")
-    if version == "v1":
-        if if_f0 == 1:
-            net_g = SynthesizerTrnMs256NSFsid(*cpt["config"], is_half=config.is_half)
-        else:
-            net_g = SynthesizerTrnMs256NSFsid_nono(*cpt["config"])
-    elif version == "v2":
-        if if_f0 == 1:
-            net_g = SynthesizerTrnMs768NSFsid(*cpt["config"], is_half=config.is_half)
-        else:
-            net_g = SynthesizerTrnMs768NSFsid_nono(*cpt["config"])
-    del net_g.enc_q
-    print(net_g.load_state_dict(cpt["weight"], strict=False))
-    net_g.eval().to(config.device)
-    if config.is_half:
-        net_g = net_g.half()
-    else:
-        net_g = net_g.float()
-    vc = VC(tgt_sr, config)
-    n_spk = cpt["config"][-3]
-    return (
-        {"visible": True, "maximum": n_spk, "__type__": "update"},
-        to_return_protect0,
-        to_return_protect1,
-    )
-        
-def load_downloaded_model(url):
-    parent_path = find_folder_parent(".", "pretrained_v2")
-    try:
-        infos = []
-        logs_folders = ['0_gt_wavs','1_16k_wavs','2a_f0','2b-f0nsf','3_feature256','3_feature768']
-        zips_path = os.path.join(parent_path, 'zips')
-        unzips_path = os.path.join(parent_path, 'unzips')
-        weights_path = os.path.join(parent_path, 'weights')
-        logs_dir = ""
-        
-        if os.path.exists(zips_path):
-            shutil.rmtree(zips_path)
-        if os.path.exists(unzips_path):
-            shutil.rmtree(unzips_path)
-
-        os.mkdir(zips_path)
-        os.mkdir(unzips_path)
-        
-        download_file = download_from_url(url)
-        if not download_file:
-            print(i18n("The file could not be downloaded."))
-            infos.append(i18n("The file could not be downloaded."))
-            yield "\n".join(infos)
-        elif download_file == "downloaded":
-            print(i18n("It has been downloaded successfully."))
-            infos.append(i18n("It has been downloaded successfully."))
-            yield "\n".join(infos)
-        elif download_file == "too much use":
-            raise Exception(i18n("Too many users have recently viewed or downloaded this file"))
-        elif download_file == "private link":
-            raise Exception(i18n("Cannot get file from this private link"))
-        
-        for filename in os.listdir(zips_path):
-            if filename.endswith(".zip"):
-                zipfile_path = os.path.join(zips_path,filename)
-                print(i18n("Proceeding with the extraction..."))
-                infos.append(i18n("Proceeding with the extraction..."))
-                shutil.unpack_archive(zipfile_path, unzips_path, 'zip')
-                model_name = os.path.basename(zipfile_path)
-                logs_dir = os.path.join(parent_path,'logs', os.path.normpath(str(model_name).replace(".zip","")))
-                yield "\n".join(infos)
-            else:
-                print(i18n("Unzip error."))
-                infos.append(i18n("Unzip error."))
-                yield "\n".join(infos)
-        
-        index_file = False
-        model_file = False
-        D_file = False
-        G_file = False
-        
-        for path, subdirs, files in os.walk(unzips_path):
-            for item in files:
-                item_path = os.path.join(path, item)
-                if not 'G_' in item and not 'D_' in item and item.endswith('.pth'):
-                    model_file = True
-                    model_name = item.replace(".pth","")
-                    logs_dir = os.path.join(parent_path,'logs', model_name)
-                    if os.path.exists(logs_dir):
-                        shutil.rmtree(logs_dir)
-                    os.mkdir(logs_dir)
-                    if not os.path.exists(weights_path):
-                        os.mkdir(weights_path)
-                    if os.path.exists(os.path.join(weights_path, item)):
-                        os.remove(os.path.join(weights_path, item))
-                    if os.path.exists(item_path):
-                        shutil.move(item_path, weights_path)
-        
-        if not model_file and not os.path.exists(logs_dir):
-            os.mkdir(logs_dir)
-        for path, subdirs, files in os.walk(unzips_path):
-            for item in files:
-                item_path = os.path.join(path, item)
-                if item.startswith('added_') and item.endswith('.index'):
-                    index_file = True
-                    if os.path.exists(item_path):
-                        if os.path.exists(os.path.join(logs_dir, item)):
-                            os.remove(os.path.join(logs_dir, item))
-                        shutil.move(item_path, logs_dir)
-                if item.startswith('total_fea.npy') or item.startswith('events.'):
-                    if os.path.exists(item_path):
-                        if os.path.exists(os.path.join(logs_dir, item)):
-                            os.remove(os.path.join(logs_dir, item))
-                        shutil.move(item_path, logs_dir)
-        
-                
-        result = ""
-        if model_file:
-            if index_file:
-                print(i18n("The model works for inference, and has the .index file."))
-                infos.append("\n" + i18n("The model works for inference, and has the .index file."))
-                yield "\n".join(infos)
-            else:
-                print(i18n("The model works for inference, but it doesn't have the .index file."))
-                infos.append("\n" + i18n("The model works for inference, but it doesn't have the .index file."))
-                yield "\n".join(infos)
-        
-        if not index_file and not model_file:
-            print(i18n("No relevant file was found to upload."))
-            infos.append(i18n("No relevant file was found to upload."))
-            yield "\n".join(infos)
-        
-        if os.path.exists(zips_path):
-            shutil.rmtree(zips_path)
-        if os.path.exists(unzips_path):
-            shutil.rmtree(unzips_path)
-        os.chdir(parent_path)    
-        return result
-    except Exception as e:
-        os.chdir(parent_path)
-        if "too much use" in str(e):
-            print(i18n("Too many users have recently viewed or downloaded this file"))
-            yield i18n("Too many users have recently viewed or downloaded this file")
-        elif "private link" in str(e):
-            print(i18n("Cannot get file from this private link"))
-            yield i18n("Cannot get file from this private link")
-        else:
-            print(e)
-            yield i18n("An error occurred downloading")
-    finally:
-        os.chdir(parent_path)
-      
-def load_dowloaded_dataset(url):
-    parent_path = find_folder_parent(".", "pretrained_v2")
-    infos = []
-    try:
-        zips_path = os.path.join(parent_path, 'zips')
-        unzips_path = os.path.join(parent_path, 'unzips')
-        datasets_path = os.path.join(parent_path, 'datasets')
-        audio_extenions =['wav', 'mp3', 'flac', 'ogg', 'opus',
-                'm4a', 'mp4', 'aac', 'alac', 'wma',
-                'aiff', 'webm', 'ac3']
-        
-        if os.path.exists(zips_path):
-            shutil.rmtree(zips_path)
-        if os.path.exists(unzips_path):
-            shutil.rmtree(unzips_path)
-            
-        if not os.path.exists(datasets_path):
-            os.mkdir(datasets_path)
-            
-        os.mkdir(zips_path)
-        os.mkdir(unzips_path)
-        
-        download_file = download_from_url(url)
-        
-        if not download_file:
-            print(i18n("An error occurred downloading"))
-            infos.append(i18n("An error occurred downloading"))
-            yield "\n".join(infos)
-            raise Exception(i18n("An error occurred downloading"))
-        elif download_file == "downloaded":
-            print(i18n("It has been downloaded successfully."))
-            infos.append(i18n("It has been downloaded successfully."))
-            yield "\n".join(infos)
-        elif download_file == "too much use":
-            raise Exception(i18n("Too many users have recently viewed or downloaded this file"))
-        elif download_file == "private link":
-            raise Exception(i18n("Cannot get file from this private link"))
-  
-        zip_path = os.listdir(zips_path)
-        foldername = ""
-        for file in zip_path:
-            if file.endswith('.zip'):
-                file_path = os.path.join(zips_path, file)
-                print("....")
-                foldername = file.replace(".zip","").replace(" ","").replace("-","_")
-                dataset_path = os.path.join(datasets_path, foldername)
-                print(i18n("Proceeding with the extraction..."))
-                infos.append(i18n("Proceeding with the extraction..."))
-                yield "\n".join(infos)
-                shutil.unpack_archive(file_path, unzips_path, 'zip')
-                if os.path.exists(dataset_path):
-                    shutil.rmtree(dataset_path)
-                    
-                os.mkdir(dataset_path)
-                
-                for root, subfolders, songs in os.walk(unzips_path):
-                    for song in songs:
-                        song_path = os.path.join(root, song)
-                        if song.endswith(tuple(audio_extenions)):
-                            formatted_song_name = format_title(os.path.splitext(song)[0])
-                            extension = os.path.splitext(song)[1]
-                            new_song_path = os.path.join(dataset_path, f"{formatted_song_name}{extension}")
-                            shutil.move(song_path, new_song_path)
-            else:
-                print(i18n("Unzip error."))
-                infos.append(i18n("Unzip error."))
-                yield "\n".join(infos)
-                
-                
-
-        if os.path.exists(zips_path):
-            shutil.rmtree(zips_path)
-        if os.path.exists(unzips_path):
-            shutil.rmtree(unzips_path)
-            
-        print(i18n("The Dataset has been loaded successfully."))
-        infos.append(i18n("The Dataset has been loaded successfully."))
-        yield "\n".join(infos)
-    except Exception as e:
-        os.chdir(parent_path)
-        if "too much use" in str(e):
-            print(i18n("Too many users have recently viewed or downloaded this file"))
-            yield i18n("Too many users have recently viewed or downloaded this file")   
-        elif "private link" in str(e):
-            print(i18n("Cannot get file from this private link"))
-            yield i18n("Cannot get file from this private link")
-        else:
-            print(e)
-            yield i18n("An error occurred downloading")
-    finally:
-        os.chdir(parent_path)
-
-def save_model(modelname, save_action):
-       
-    parent_path = find_folder_parent(".", "pretrained_v2")
-    zips_path = os.path.join(parent_path, 'zips')
-    dst = os.path.join(zips_path,modelname)
-    logs_path = os.path.join(parent_path, 'logs', modelname)
-    weights_path = os.path.join(parent_path, 'weights', f"{modelname}.pth")
-    save_folder = parent_path
-    infos = []    
-    
-    try:
-        if not os.path.exists(logs_path):
-            raise Exception("No model found.")
-        
-        if not 'content' in parent_path:
-            save_folder = os.path.join(parent_path, 'RVC_Backup')
-        else:
-            save_folder = '/content/drive/MyDrive/RVC_Backup'
-        
-        infos.append(i18n("Save model"))
-        yield "\n".join(infos)
-        
-        if not os.path.exists(save_folder):
-            os.mkdir(save_folder)
-        if not os.path.exists(os.path.join(save_folder, 'ManualTrainingBackup')):
-            os.mkdir(os.path.join(save_folder, 'ManualTrainingBackup'))
-        if not os.path.exists(os.path.join(save_folder, 'Finished')):
-            os.mkdir(os.path.join(save_folder, 'Finished'))
-
-        if os.path.exists(zips_path):
-            shutil.rmtree(zips_path)
-            
-        os.mkdir(zips_path)
-        added_file = glob.glob(os.path.join(logs_path, "added_*.index"))
-        d_file = glob.glob(os.path.join(logs_path, "D_*.pth"))
-        g_file = glob.glob(os.path.join(logs_path, "G_*.pth"))
-        
-        if save_action == i18n("Choose the method"):
-            raise Exception("No method choosen.")
-        
-        if save_action == i18n("Save all"):
-            print(i18n("Save all"))
-            save_folder = os.path.join(save_folder, 'ManualTrainingBackup')
-            shutil.copytree(logs_path, dst)
-        else:
-            if not os.path.exists(dst):
-                os.mkdir(dst)
-            
-        if save_action == i18n("Save D and G"):
-            print(i18n("Save D and G"))
-            save_folder = os.path.join(save_folder, 'ManualTrainingBackup')
-            if len(d_file) > 0:
-                shutil.copy(d_file[0], dst)
-            if len(g_file) > 0:
-                shutil.copy(g_file[0], dst)    
-                
-            if len(added_file) > 0:
-                shutil.copy(added_file[0], dst)
-            else:
-                infos.append(i18n("Saved without index..."))
-                
-        if save_action == i18n("Save voice"):
-            print(i18n("Save voice"))
-            save_folder = os.path.join(save_folder, 'Finished')
-            if len(added_file) > 0:
-                shutil.copy(added_file[0], dst)
-            else:
-                infos.append(i18n("Saved without index..."))
-        
-        yield "\n".join(infos)
-        if not os.path.exists(weights_path):
-            infos.append(i18n("Saved without inference model..."))
-        else:
-            shutil.copy(weights_path, dst)
-        
-        yield "\n".join(infos)
-        infos.append("\n" + i18n("This may take a few minutes, please wait..."))
-        yield "\n".join(infos)
-        
-        shutil.make_archive(os.path.join(zips_path,f"{modelname}"), 'zip', zips_path)
-        shutil.move(os.path.join(zips_path,f"{modelname}.zip"), os.path.join(save_folder, f'{modelname}.zip'))
-        
-        shutil.rmtree(zips_path)        
-        infos.append("\n" + i18n("Model saved successfully"))
-        yield "\n".join(infos)
-        
-    except Exception as e:
-        print(e)
-        if "No model found." in str(e):
-            infos.append(i18n("The model you want to save does not exist, be sure to enter the correct name."))
-        else:
-            infos.append(i18n("An error occurred saving the model"))
-            
-        yield "\n".join(infos)
-    
-def load_downloaded_backup(url):
-    parent_path = find_folder_parent(".", "pretrained_v2")
-    try:
-        infos = []
-        logs_folders = ['0_gt_wavs','1_16k_wavs','2a_f0','2b-f0nsf','3_feature256','3_feature768']
-        zips_path = os.path.join(parent_path, 'zips')
-        unzips_path = os.path.join(parent_path, 'unzips')
-        weights_path = os.path.join(parent_path, 'weights')
-        logs_dir = os.path.join(parent_path, 'logs')
-        
-        if os.path.exists(zips_path):
-            shutil.rmtree(zips_path)
-        if os.path.exists(unzips_path):
-            shutil.rmtree(unzips_path)
-
-        os.mkdir(zips_path)
-        os.mkdir(unzips_path)
-        
-        download_file = download_from_url(url)
-        if not download_file:
-            print(i18n("The file could not be downloaded."))
-            infos.append(i18n("The file could not be downloaded."))
-            yield "\n".join(infos)
-        elif download_file == "downloaded":
-            print(i18n("It has been downloaded successfully."))
-            infos.append(i18n("It has been downloaded successfully."))
-            yield "\n".join(infos)
-        elif download_file == "too much use":
-            raise Exception(i18n("Too many users have recently viewed or downloaded this file"))
-        elif download_file == "private link":
-            raise Exception(i18n("Cannot get file from this private link"))
-        
-        for filename in os.listdir(zips_path):
-            if filename.endswith(".zip"):
-                zipfile_path = os.path.join(zips_path,filename)
-                zip_dir_name = os.path.splitext(filename)[0]
-                unzip_dir = unzips_path
-                print(i18n("Proceeding with the extraction..."))
-                infos.append(i18n("Proceeding with the extraction..."))
-                shutil.unpack_archive(zipfile_path, unzip_dir, 'zip')
-                
-                if os.path.exists(os.path.join(unzip_dir, zip_dir_name)):
-                    shutil.move(os.path.join(unzip_dir, zip_dir_name), logs_dir)
-                else:
-                    new_folder_path = os.path.join(logs_dir, zip_dir_name)
-                    os.mkdir(new_folder_path)
-                    for item_name in os.listdir(unzip_dir):
-                        item_path = os.path.join(unzip_dir, item_name)
-                        if os.path.isfile(item_path):
-                            shutil.move(item_path, new_folder_path)
-                        elif os.path.isdir(item_path):
-                            shutil.move(item_path, new_folder_path)
-                    
-                yield "\n".join(infos)
-            else:
-                print(i18n("Unzip error."))
-                infos.append(i18n("Unzip error."))
-                yield "\n".join(infos)
-                
-        result = ""
-        
-        for filename in os.listdir(unzips_path):
-            if filename.endswith(".zip"):
-                silentremove(filename)
-        
-        if os.path.exists(zips_path):
-            shutil.rmtree(zips_path)
-        if os.path.exists(os.path.join(parent_path, 'unzips')):
-            shutil.rmtree(os.path.join(parent_path, 'unzips'))
-        print(i18n("The Backup has been uploaded successfully."))
-        infos.append("\n" + i18n("The Backup has been uploaded successfully."))
-        yield "\n".join(infos)
-        os.chdir(parent_path)    
-        return result
-    except Exception as e:
-        os.chdir(parent_path)
-        if "too much use" in str(e):
-            print(i18n("Too many users have recently viewed or downloaded this file"))
-            yield i18n("Too many users have recently viewed or downloaded this file")
-        elif "private link" in str(e):
-            print(i18n("Cannot get file from this private link"))
-            yield i18n("Cannot get file from this private link") 
-        else:
-            print(e)
-            yield i18n("An error occurred downloading")
-    finally:
-        os.chdir(parent_path)
-
-def save_to_wav(record_button):
-    if record_button is None:
-        pass
-    else:
-        path_to_file=record_button
-        new_name = datetime.datetime.now().strftime("%Y-%m-%d_%H-%M-%S")+'.wav'
-        new_path='./audios/'+new_name
-        shutil.move(path_to_file,new_path)
-        return new_name
-
-
-def change_choices2():
-    audio_paths=[]
-    for filename in os.listdir("./audios"):
-        if filename.endswith(('wav', 'mp3', 'flac', 'ogg', 'opus',
-                'm4a', 'mp4', 'aac', 'alac', 'wma',
-                'aiff', 'webm', 'ac3')):
-            audio_paths.append(os.path.join('./audios',filename).replace('\\', '/'))
-    return {"choices": sorted(audio_paths), "__type__": "update"}, {"__type__": "update"}
-
-
-
-
-
-def uvr(input_url, output_path, model_name, inp_root, save_root_vocal, paths, save_root_ins, agg, format0, architecture):
-    carpeta_a_eliminar = "yt_downloads"
-    if os.path.exists(carpeta_a_eliminar) and os.path.isdir(carpeta_a_eliminar):
-        for archivo in os.listdir(carpeta_a_eliminar):
-            ruta_archivo = os.path.join(carpeta_a_eliminar, archivo)
-            if os.path.isfile(ruta_archivo):
-                os.remove(ruta_archivo)
-            elif os.path.isdir(ruta_archivo):
-                shutil.rmtree(ruta_archivo) 
-      
-    
-
-    ydl_opts = {
-     'no-windows-filenames': True,
-     'restrict-filenames': True,
-     'extract_audio': True,
-     'format': 'bestaudio',
-     'quiet': True,
-     'no-warnings': True,
-     }
-    
-    try:
-        print(i18n("Downloading audio from the video..."))
-        with yt_dlp.YoutubeDL(ydl_opts) as ydl:
-         info_dict = ydl.extract_info(input_url, download=False)
-         formatted_title = format_title(info_dict.get('title', 'default_title'))
-         formatted_outtmpl = output_path + '/' + formatted_title + '.wav'
-         ydl_opts['outtmpl'] = formatted_outtmpl
-         ydl = yt_dlp.YoutubeDL(ydl_opts)
-         ydl.download([input_url])
-        print(i18n("Audio downloaded!"))
-    except Exception as error:
-        print(i18n("An error occurred:"), error)
-
-    actual_directory = os.path.dirname(__file__)
-    
-    vocal_directory = os.path.join(actual_directory, save_root_vocal)
-    instrumental_directory = os.path.join(actual_directory, save_root_ins)
-    
-    vocal_formatted = f"vocal_{formatted_title}.wav.reformatted.wav_10.wav"
-    instrumental_formatted = f"instrument_{formatted_title}.wav.reformatted.wav_10.wav"  
-    
-    vocal_audio_path = os.path.join(vocal_directory, vocal_formatted)
-    instrumental_audio_path = os.path.join(instrumental_directory, instrumental_formatted)
-    
-    vocal_formatted_mdx = f"{formatted_title}_vocal_.wav"
-    instrumental_formatted_mdx = f"{formatted_title}_instrument_.wav"
-    
-    vocal_audio_path_mdx = os.path.join(vocal_directory, vocal_formatted_mdx)
-    instrumental_audio_path_mdx = os.path.join(instrumental_directory, instrumental_formatted_mdx)
-
-    if architecture == "VR":
-       try:
-           print(i18n("Starting audio conversion... (This might take a moment)"))
-           inp_root, save_root_vocal, save_root_ins = [x.strip(" ").strip('"').strip("\n").strip('"').strip(" ") for x in [inp_root, save_root_vocal, save_root_ins]]
-           usable_files = [os.path.join(inp_root, file) 
-                          for file in os.listdir(inp_root) 
-                          if file.endswith(tuple(sup_audioext))]    
-           
-        
-           pre_fun = MDXNetDereverb(15) if model_name == "onnx_dereverb_By_FoxJoy" else (_audio_pre_ if "DeEcho" not in model_name else _audio_pre_new)(
-                       agg=int(agg),
-                       model_path=os.path.join(weight_uvr5_root, model_name + ".pth"),
-                       device=config.device,
-                       is_half=config.is_half,
-                   )
-                
-           try:
-              if paths != None:
-                paths = [path.name for path in paths]
-              else:
-                paths = usable_files
-                
-           except:
-                traceback.print_exc()
-                paths = usable_files
-           print(paths) 
-           for path in paths:
-               inp_path = os.path.join(inp_root, path)
-               need_reformat, done = 1, 0
-
-               try:
-                   info = ffmpeg.probe(inp_path, cmd="ffprobe")
-                   if info["streams"][0]["channels"] == 2 and info["streams"][0]["sample_rate"] == "44100":
-                       need_reformat = 0
-                       pre_fun._path_audio_(inp_path, save_root_ins, save_root_vocal, format0)
-                       done = 1
-               except:
-                   traceback.print_exc()
-
-               if need_reformat:
-                   tmp_path = f"{tmp}/{os.path.basename(inp_path)}.reformatted.wav"
-                   os.system(f"ffmpeg -i {inp_path} -vn -acodec pcm_s16le -ac 2 -ar 44100 {tmp_path} -y")
-                   inp_path = tmp_path
-
-               try:
-                   if not done:
-                       pre_fun._path_audio_(inp_path, save_root_ins, save_root_vocal, format0)
-                   print(f"{os.path.basename(inp_path)}->Success")
-               except:
-                   print(f"{os.path.basename(inp_path)}->{traceback.format_exc()}")
-       except:
-           traceback.print_exc()
-       finally:
-           try:
-               if model_name == "onnx_dereverb_By_FoxJoy":
-                   del pre_fun.pred.model
-                   del pre_fun.pred.model_
-               else:
-                   del pre_fun.model
-
-               del pre_fun
-               return i18n("Finished"), vocal_audio_path, instrumental_audio_path
-           except: traceback.print_exc()
-
-           if torch.cuda.is_available(): torch.cuda.empty_cache()
-
-    elif architecture == "MDX":
-       try:
-           print(i18n("Starting audio conversion... (This might take a moment)"))
-           inp_root, save_root_vocal, save_root_ins = [x.strip(" ").strip('"').strip("\n").strip('"').strip(" ") for x in [inp_root, save_root_vocal, save_root_ins]]
-        
-           usable_files = [os.path.join(inp_root, file) 
-                          for file in os.listdir(inp_root) 
-                          if file.endswith(tuple(sup_audioext))]    
-           try:
-              if paths != None:
-                paths = [path.name for path in paths]
-              else:
-                paths = usable_files
-                
-           except:
-                traceback.print_exc()
-                paths = usable_files
-           print(paths) 
-           invert=True
-           denoise=True
-           use_custom_parameter=True
-           dim_f=2048
-           dim_t=256
-           n_fft=7680
-           use_custom_compensation=True
-           compensation=1.025
-           suffix = "vocal_" #@param ["Vocals", "Drums", "Bass", "Other"]{allow-input: true}
-           suffix_invert = "instrument_" #@param ["Instrumental", "Drumless", "Bassless", "Instruments"]{allow-input: true}
-           print_settings = True  # @param{type:"boolean"}
-           onnx = id_to_ptm(model_name)
-           compensation = compensation if use_custom_compensation or use_custom_parameter else None
-           mdx_model = prepare_mdx(onnx,use_custom_parameter, dim_f, dim_t, n_fft, compensation=compensation)
-           
-       
-           for path in paths:
-               #inp_path = os.path.join(inp_root, path)
-               suffix_naming = suffix if use_custom_parameter else None
-               diff_suffix_naming = suffix_invert if use_custom_parameter else None
-               run_mdx(onnx, mdx_model, path, format0, diff=invert,suffix=suffix_naming,diff_suffix=diff_suffix_naming,denoise=denoise)
-    
-           if print_settings:
-               print()
-               print('[MDX-Net_Colab settings used]')
-               print(f'Model used: {onnx}')
-               print(f'Model MD5: {mdx.MDX.get_hash(onnx)}')
-               print(f'Model parameters:')
-               print(f'    -dim_f: {mdx_model.dim_f}')
-               print(f'    -dim_t: {mdx_model.dim_t}')
-               print(f'    -n_fft: {mdx_model.n_fft}')
-               print(f'    -compensation: {mdx_model.compensation}')
-               print()
-               print('[Input file]')
-               print('filename(s): ')
-               for filename in paths:
-                   print(f'    -{filename}')
-                   print(f"{os.path.basename(filename)}->Success")
-       except:
-           traceback.print_exc()
-       finally:
-           try:
-               del mdx_model
-               return i18n("Finished"), vocal_audio_path_mdx, instrumental_audio_path_mdx
-           except: traceback.print_exc()
-
-           print("clean_empty_cache")
-
-           if torch.cuda.is_available(): torch.cuda.empty_cache()
-sup_audioext = {'wav', 'mp3', 'flac', 'ogg', 'opus',
-                'm4a', 'mp4', 'aac', 'alac', 'wma',
-                'aiff', 'webm', 'ac3'}
-
-def load_downloaded_audio(url):
-    parent_path = find_folder_parent(".", "pretrained_v2")
-    try:
-        infos = []
-        audios_path = os.path.join(parent_path, 'audios')
-        zips_path = os.path.join(parent_path, 'zips')
-
-        if not os.path.exists(audios_path):
-            os.mkdir(audios_path)
-        
-        download_file = download_from_url(url)
-        if not download_file:
-            print(i18n("The file could not be downloaded."))
-            infos.append(i18n("The file could not be downloaded."))
-            yield "\n".join(infos)
-        elif download_file == "downloaded":
-            print(i18n("It has been downloaded successfully."))
-            infos.append(i18n("It has been downloaded successfully."))
-            yield "\n".join(infos)
-        elif download_file == "too much use":
-            raise Exception(i18n("Too many users have recently viewed or downloaded this file"))
-        elif download_file == "private link":
-            raise Exception(i18n("Cannot get file from this private link"))
-        
-        for filename in os.listdir(zips_path):
-            item_path = os.path.join(zips_path, filename)
-            if item_path.split('.')[-1] in sup_audioext:
-                if os.path.exists(item_path):
-                    shutil.move(item_path, audios_path)
-        
-        result = ""
-        print(i18n("Audio files have been moved to the 'audios' folder."))
-        infos.append(i18n("Audio files have been moved to the 'audios' folder."))
-        yield "\n".join(infos)
-            
-        os.chdir(parent_path)    
-        return result
-    except Exception as e:
-        os.chdir(parent_path)
-        if "too much use" in str(e):
-            print(i18n("Too many users have recently viewed or downloaded this file"))
-            yield i18n("Too many users have recently viewed or downloaded this file")
-        elif "private link" in str(e):
-            print(i18n("Cannot get file from this private link"))
-            yield i18n("Cannot get file from this private link")
-        else:
-            print(e)
-            yield i18n("An error occurred downloading")
-    finally:
-        os.chdir(parent_path)
- 
-       
-class error_message(Exception):
-    def __init__(self, mensaje):
-        self.mensaje = mensaje
-        super().__init__(mensaje)
-
-def get_vc(sid, to_return_protect0, to_return_protect1):
-    global n_spk, tgt_sr, net_g, vc, cpt, version
-    if sid == "" or sid == []:
-        global hubert_model
-        if hubert_model is not None: 
-            print("clean_empty_cache")
-            del net_g, n_spk, vc, hubert_model, tgt_sr  
-            hubert_model = net_g = n_spk = vc = hubert_model = tgt_sr = None
-            if torch.cuda.is_available():
-                torch.cuda.empty_cache()
-            if_f0 = cpt.get("f0", 1)
-            version = cpt.get("version", "v1")
-            if version == "v1":
-                if if_f0 == 1:
-                    net_g = SynthesizerTrnMs256NSFsid(
-                        *cpt["config"], is_half=config.is_half
-                    )
-                else:
-                    net_g = SynthesizerTrnMs256NSFsid_nono(*cpt["config"])
-            elif version == "v2":
-                if if_f0 == 1:
-                    net_g = SynthesizerTrnMs768NSFsid(
-                        *cpt["config"], is_half=config.is_half
-                    )
-                else:
-                    net_g = SynthesizerTrnMs768NSFsid_nono(*cpt["config"])
-            del net_g, cpt
-            if torch.cuda.is_available():
-                torch.cuda.empty_cache()
-            cpt = None
-        return (
-            {"visible": False, "__type__": "update"},
-            {"visible": False, "__type__": "update"},
-            {"visible": False, "__type__": "update"},
-        )
-    person = "%s/%s" % (weight_root, sid)
-    print("loading %s" % person)
-    cpt = torch.load(person, map_location="cpu")
-    tgt_sr = cpt["config"][-1]
-    cpt["config"][-3] = cpt["weight"]["emb_g.weight"].shape[0]  
-    if_f0 = cpt.get("f0", 1)
-    if if_f0 == 0:
-        to_return_protect0 = to_return_protect1 = {
-            "visible": False,
-            "value": 0.5,
-            "__type__": "update",
-        }
-    else:
-        to_return_protect0 = {
-            "visible": True,
-            "value": to_return_protect0,
-            "__type__": "update",
-        }
-        to_return_protect1 = {
-            "visible": True,
-            "value": to_return_protect1,
-            "__type__": "update",
-        }
-    version = cpt.get("version", "v1")
-    if version == "v1":
-        if if_f0 == 1:
-            net_g = SynthesizerTrnMs256NSFsid(*cpt["config"], is_half=config.is_half)
-        else:
-            net_g = SynthesizerTrnMs256NSFsid_nono(*cpt["config"])
-    elif version == "v2":
-        if if_f0 == 1:
-            net_g = SynthesizerTrnMs768NSFsid(*cpt["config"], is_half=config.is_half)
-        else:
-            net_g = SynthesizerTrnMs768NSFsid_nono(*cpt["config"])
-    del net_g.enc_q
-    print(net_g.load_state_dict(cpt["weight"], strict=False))
-    net_g.eval().to(config.device)
-    if config.is_half:
-        net_g = net_g.half()
-    else:
-        net_g = net_g.float()
-    vc = VC(tgt_sr, config)
-    n_spk = cpt["config"][-3]
-    return (
-        {"visible": True, "maximum": n_spk, "__type__": "update"},
-        to_return_protect0,
-        to_return_protect1,
-    )    
-    
-def update_model_choices(select_value):
-    model_ids = get_model_list()
-    model_ids_list = list(model_ids)
-    if select_value == "VR":
-        return {"choices": uvr5_names, "__type__": "update"}
-    elif select_value == "MDX":
-        return {"choices": model_ids_list, "__type__": "update"}
-
-def download_model():
-    gr.Markdown(value="# " + i18n("Download Model"))
-    gr.Markdown(value=i18n("It is used to download your inference models."))
-    with gr.Row():
-        model_url=gr.Textbox(label=i18n("Url:"))
-    with gr.Row():
-        download_model_status_bar=gr.Textbox(label=i18n("Status:"))
-    with gr.Row():
-        download_button=gr.Button(i18n("Download"))
-        download_button.click(fn=load_downloaded_model, inputs=[model_url], outputs=[download_model_status_bar])
-
-def download_backup():
-    gr.Markdown(value="# " + i18n("Download Backup"))
-    gr.Markdown(value=i18n("It is used to download your training backups."))
-    with gr.Row():
-        model_url=gr.Textbox(label=i18n("Url:"))
-    with gr.Row():
-        download_model_status_bar=gr.Textbox(label=i18n("Status:"))
-    with gr.Row():
-        download_button=gr.Button(i18n("Download"))
-        download_button.click(fn=load_downloaded_backup, inputs=[model_url], outputs=[download_model_status_bar])
-
-def update_dataset_list(name):
-    new_datasets = []
-    for foldername in os.listdir("./datasets"):
-        if "." not in foldername:
-            new_datasets.append(os.path.join(find_folder_parent(".","pretrained"),"datasets",foldername))
-    return gr.Dropdown.update(choices=new_datasets)
-
-def download_dataset(trainset_dir4):
-    gr.Markdown(value="# " + i18n("Download Dataset"))
-    gr.Markdown(value=i18n("Download the dataset with the audios in a compatible format (.wav/.flac) to train your model."))
-    with gr.Row():
-        dataset_url=gr.Textbox(label=i18n("Url:"))
-    with gr.Row():
-        load_dataset_status_bar=gr.Textbox(label=i18n("Status:"))
-    with gr.Row():
-        load_dataset_button=gr.Button(i18n("Download"))
-        load_dataset_button.click(fn=load_dowloaded_dataset, inputs=[dataset_url], outputs=[load_dataset_status_bar])
-        load_dataset_status_bar.change(update_dataset_list, dataset_url, trainset_dir4)
-
-def download_audio():
-    gr.Markdown(value="# " + i18n("Download Audio"))
-    gr.Markdown(value=i18n("Download audios of any format for use in inference (recommended for mobile users)."))
-    with gr.Row():
-        audio_url=gr.Textbox(label=i18n("Url:"))
-    with gr.Row():
-        download_audio_status_bar=gr.Textbox(label=i18n("Status:"))
-    with gr.Row():
-        download_button2=gr.Button(i18n("Download"))
-        download_button2.click(fn=load_downloaded_audio, inputs=[audio_url], outputs=[download_audio_status_bar])
-
-def youtube_separator():
-        gr.Markdown(value="# " + i18n("Separate YouTube tracks"))
-        gr.Markdown(value=i18n("Download audio from a YouTube video and automatically separate the vocal and instrumental tracks"))
-        with gr.Row():
-            input_url = gr.inputs.Textbox(label=i18n("Enter the YouTube link:"))
-            output_path = gr.Textbox(
-                label=i18n("Enter the path of the audio folder to be processed (copy it from the address bar of the file manager):"),
-                value=os.path.abspath(os.getcwd()).replace('\\', '/') + "/yt_downloads",
-                visible=False,
-                )
-            advanced_settings_checkbox = gr.Checkbox(
-                value=False,
-                label=i18n("Advanced Settings"),
-                interactive=True,
-                )
-        with gr.Row(label = i18n("Advanced Settings"), visible=False, variant='compact') as advanced_settings:
-            with gr.Column(): 
-                model_select = gr.Radio(
-                    label=i18n("Model Architecture:"),
-                    choices=["VR", "MDX"],
-                    value="VR",
-                    interactive=True,
-                    )
-                model_choose = gr.Dropdown(label=i18n("Model: (Be aware that in some models the named vocal will be the instrumental)"),                          
-                    choices=uvr5_names,
-                    value="HP5_only_main_vocal"   
-                    )
-                with gr.Row():
-                    agg = gr.Slider(
-                        minimum=0,
-                        maximum=20,
-                        step=1,
-                        label=i18n("Vocal Extraction Aggressive"),
-                        value=10,
-                        interactive=True,
-                        )
-                with gr.Row():            
-                    opt_vocal_root = gr.Textbox(
-                        label=i18n("Specify the output folder for vocals:"), value="audios",
-                        )
-                opt_ins_root = gr.Textbox(
-                    label=i18n("Specify the output folder for accompaniment:"), value="audio-others",
-                    ) 
-                dir_wav_input = gr.Textbox(
-                    label=i18n("Enter the path of the audio folder to be processed:"),
-                    value=((os.getcwd()).replace('\\', '/') + "/yt_downloads"),
-                    visible=False,
-                    )
-                format0 = gr.Radio(
-                    label=i18n("Export file format"),
-                    choices=["wav", "flac", "mp3", "m4a"],
-                    value="wav",
-                    visible=False,
-                    interactive=True,
-                    )
-                wav_inputs = gr.File(
-                    file_count="multiple", label=i18n("You can also input audio files in batches. Choose one of the two options. Priority is given to reading from the folder."),
-                    visible=False,
-                    )
-            model_select.change(
-                fn=update_model_choices,
-                inputs=model_select,
-                outputs=model_choose,
-                )
-        with gr.Row():
-            vc_output4 = gr.Textbox(label=i18n("Status:"))
-            vc_output5 = gr.Audio(label=i18n("Vocal"), type='filepath')
-            vc_output6 = gr.Audio(label=i18n("Instrumental"), type='filepath')
-        with gr.Row():
-            but2 = gr.Button(i18n("Download and Separate"))
-            but2.click(
-                uvr,
-                    [
-                    input_url, 
-                    output_path,
-                    model_choose,
-                    dir_wav_input,
-                    opt_vocal_root,
-                    wav_inputs,
-                    opt_ins_root,
-                    agg,
-                    format0,
-                    model_select
-                    ],
-                    [vc_output4, vc_output5, vc_output6],
-                )
-        def toggle_advanced_settings(checkbox):
-            return {"visible": checkbox, "__type__": "update"}
-        
-        advanced_settings_checkbox.change(
-            fn=toggle_advanced_settings,
-            inputs=[advanced_settings_checkbox],
-            outputs=[advanced_settings]
-            )
-
-
-def get_bark_voice():
-    mensaje = """
-v2/en_speaker_0	English	Male
-v2/en_speaker_1	English	Male
-v2/en_speaker_2	English	Male
-v2/en_speaker_3	English	Male
-v2/en_speaker_4	English	Male
-v2/en_speaker_5	English	Male
-v2/en_speaker_6	English	Male
-v2/en_speaker_7	English	Male
-v2/en_speaker_8	English	Male
-v2/en_speaker_9	English	Female
-v2/zh_speaker_0	Chinese (Simplified)	Male
-v2/zh_speaker_1	Chinese (Simplified)	Male
-v2/zh_speaker_2	Chinese (Simplified)	Male
-v2/zh_speaker_3	Chinese (Simplified)	Male
-v2/zh_speaker_4	Chinese (Simplified)	Female
-v2/zh_speaker_5	Chinese (Simplified)	Male
-v2/zh_speaker_6	Chinese (Simplified)	Female
-v2/zh_speaker_7	Chinese (Simplified)	Female
-v2/zh_speaker_8	Chinese (Simplified)	Male
-v2/zh_speaker_9	Chinese (Simplified)	Female
-v2/fr_speaker_0	French	Male
-v2/fr_speaker_1	French	Female
-v2/fr_speaker_2	French	Female
-v2/fr_speaker_3	French	Male
-v2/fr_speaker_4	French	Male
-v2/fr_speaker_5	French	Female
-v2/fr_speaker_6	French	Male
-v2/fr_speaker_7	French	Male
-v2/fr_speaker_8	French	Male
-v2/fr_speaker_9	French	Male
-v2/de_speaker_0	German	Male
-v2/de_speaker_1	German	Male
-v2/de_speaker_2	German	Male
-v2/de_speaker_3	German	Female
-v2/de_speaker_4	German	Male
-v2/de_speaker_5	German	Male
-v2/de_speaker_6	German	Male
-v2/de_speaker_7	German	Male
-v2/de_speaker_8	German	Female
-v2/de_speaker_9	German	Male
-v2/hi_speaker_0	Hindi	Female
-v2/hi_speaker_1	Hindi	Female
-v2/hi_speaker_2	Hindi	Male
-v2/hi_speaker_3	Hindi	Female
-v2/hi_speaker_4	Hindi	Female
-v2/hi_speaker_5	Hindi	Male
-v2/hi_speaker_6	Hindi	Male
-v2/hi_speaker_7	Hindi	Male
-v2/hi_speaker_8	Hindi	Male
-v2/hi_speaker_9	Hindi	Female
-v2/it_speaker_0	Italian	Male
-v2/it_speaker_1	Italian	Male
-v2/it_speaker_2	Italian	Female
-v2/it_speaker_3	Italian	Male
-v2/it_speaker_4	Italian	Male
-v2/it_speaker_5	Italian	Male
-v2/it_speaker_6	Italian	Male
-v2/it_speaker_7	Italian	Female
-v2/it_speaker_8	Italian	Male
-v2/it_speaker_9	Italian	Female
-v2/ja_speaker_0	Japanese	Female
-v2/ja_speaker_1	Japanese	Female
-v2/ja_speaker_2	Japanese	Male
-v2/ja_speaker_3	Japanese	Female
-v2/ja_speaker_4	Japanese	Female
-v2/ja_speaker_5	Japanese	Female
-v2/ja_speaker_6	Japanese	Male
-v2/ja_speaker_7	Japanese	Female
-v2/ja_speaker_8	Japanese	Female
-v2/ja_speaker_9	Japanese	Female
-v2/ko_speaker_0	Korean	Female
-v2/ko_speaker_1	Korean	Male
-v2/ko_speaker_2	Korean	Male
-v2/ko_speaker_3	Korean	Male
-v2/ko_speaker_4	Korean	Male
-v2/ko_speaker_5	Korean	Male
-v2/ko_speaker_6	Korean	Male
-v2/ko_speaker_7	Korean	Male
-v2/ko_speaker_8	Korean	Male
-v2/ko_speaker_9	Korean	Male
-v2/pl_speaker_0	Polish	Male
-v2/pl_speaker_1	Polish	Male
-v2/pl_speaker_2	Polish	Male
-v2/pl_speaker_3	Polish	Male
-v2/pl_speaker_4	Polish	Female
-v2/pl_speaker_5	Polish	Male
-v2/pl_speaker_6	Polish	Female
-v2/pl_speaker_7	Polish	Male
-v2/pl_speaker_8	Polish	Male
-v2/pl_speaker_9	Polish	Female
-v2/pt_speaker_0	Portuguese	Male
-v2/pt_speaker_1	Portuguese	Male
-v2/pt_speaker_2	Portuguese	Male
-v2/pt_speaker_3	Portuguese	Male
-v2/pt_speaker_4	Portuguese	Male
-v2/pt_speaker_5	Portuguese	Male
-v2/pt_speaker_6	Portuguese	Male
-v2/pt_speaker_7	Portuguese	Male
-v2/pt_speaker_8	Portuguese	Male
-v2/pt_speaker_9	Portuguese	Male
-v2/ru_speaker_0	Russian	Male
-v2/ru_speaker_1	Russian	Male
-v2/ru_speaker_2	Russian	Male
-v2/ru_speaker_3	Russian	Male
-v2/ru_speaker_4	Russian	Male
-v2/ru_speaker_5	Russian	Female
-v2/ru_speaker_6	Russian	Female
-v2/ru_speaker_7	Russian	Male
-v2/ru_speaker_8	Russian	Male
-v2/ru_speaker_9	Russian	Female
-v2/es_speaker_0	Spanish	Male
-v2/es_speaker_1	Spanish	Male
-v2/es_speaker_2	Spanish	Male
-v2/es_speaker_3	Spanish	Male
-v2/es_speaker_4	Spanish	Male
-v2/es_speaker_5	Spanish	Male
-v2/es_speaker_6	Spanish	Male
-v2/es_speaker_7	Spanish	Male
-v2/es_speaker_8	Spanish	Female
-v2/es_speaker_9	Spanish	Female
-v2/tr_speaker_0	Turkish	Male
-v2/tr_speaker_1	Turkish	Male
-v2/tr_speaker_2	Turkish	Male
-v2/tr_speaker_3	Turkish	Male
-v2/tr_speaker_4	Turkish	Female
-v2/tr_speaker_5	Turkish	Female
-v2/tr_speaker_6	Turkish	Male
-v2/tr_speaker_7	Turkish	Male
-v2/tr_speaker_8	Turkish	Male
-v2/tr_speaker_9	Turkish	Male
-    """
-# Dividir el mensaje en líneas
-    lineas = mensaje.split("\n")
-    datos_deseados = []
-    for linea in lineas:
-        partes = linea.split("\t")
-        if len(partes) == 3:
-            clave, _, genero = partes  
-            datos_deseados.append(f"{clave}-{genero}")
-
-    return datos_deseados
-
-    
-def get_edge_voice():
-    completed_process = subprocess.run(['edge-tts',"-l"], capture_output=True, text=True)
-    lines = completed_process.stdout.strip().split("\n")
-    data = []
-    current_entry = {}
-    for line in lines:
-        if line.startswith("Name: "):
-            if current_entry:
-                data.append(current_entry)
-            current_entry = {"Name": line.split(": ")[1]}
-        elif line.startswith("Gender: "):
-            current_entry["Gender"] = line.split(": ")[1]
-    if current_entry:
-        data.append(current_entry)
-    tts_voice = []
-    for entry in data:
-        name = entry["Name"]
-        gender = entry["Gender"]
-        formatted_entry = f'{name}-{gender}'
-        tts_voice.append(formatted_entry)
-    return tts_voice
-
-
-#print(set_tts_voice)
diff --git a/spaces/Eddycrack864/Applio-Inference/infer/modules/vc/modules.py b/spaces/Eddycrack864/Applio-Inference/infer/modules/vc/modules.py
deleted file mode 100644
index 458cfbe860b23bdd8f07abc2934443e6b8b01c3a..0000000000000000000000000000000000000000
--- a/spaces/Eddycrack864/Applio-Inference/infer/modules/vc/modules.py
+++ /dev/null
@@ -1,526 +0,0 @@
-import os, sys
-import traceback
-import logging
-now_dir = os.getcwd()
-sys.path.append(now_dir)
-logger = logging.getLogger(__name__)
-import lib.globals.globals as rvc_globals
-import numpy as np
-import soundfile as sf
-import torch
-from io import BytesIO
-from infer.lib.audio import load_audio
-from infer.lib.audio import wav2
-from infer.lib.infer_pack.models import (
-    SynthesizerTrnMs256NSFsid,
-    SynthesizerTrnMs256NSFsid_nono,
-    SynthesizerTrnMs768NSFsid,
-    SynthesizerTrnMs768NSFsid_nono,
-)
-from infer.modules.vc.pipeline import Pipeline
-from infer.modules.vc.utils import *
-import time
-import scipy.io.wavfile as wavfile
-
-def note_to_hz(note_name):
-        SEMITONES = {'C': -9, 'C#': -8, 'D': -7, 'D#': -6, 'E': -5, 'F': -4, 'F#': -3, 'G': -2, 'G#': -1, 'A': 0, 'A#': 1, 'B': 2}
-        pitch_class, octave = note_name[:-1], int(note_name[-1])
-        semitone = SEMITONES[pitch_class]
-        note_number = 12 * (octave - 4) + semitone
-        frequency = 440.0 * (2.0 ** (1.0/12)) ** note_number
-        return frequency
-
-class VC:
-    def __init__(self, config):
-        self.n_spk = None
-        self.tgt_sr = None
-        self.net_g = None
-        self.pipeline = None
-        self.cpt = None
-        self.version = None
-        self.if_f0 = None
-        self.version = None
-        self.hubert_model = None
-
-        self.config = config
-
-    def get_vc(self, sid, *to_return_protect):
-        logger.info("Get sid: " + sid)
-
-        to_return_protect0 = {
-            "visible": self.if_f0 != 0,
-            "value": to_return_protect[0]
-            if self.if_f0 != 0 and to_return_protect
-            else 0.5,
-            "__type__": "update",
-        }
-        to_return_protect1 = {
-            "visible": self.if_f0 != 0,
-            "value": to_return_protect[1]
-            if self.if_f0 != 0 and to_return_protect
-            else 0.33,
-            "__type__": "update",
-        }
-
-        if not sid:
-            if self.hubert_model is not None:  # 考虑到轮询, 需要加个判断看是否 sid 是由有模型切换到无模型的
-                logger.info("Clean model cache")
-                del (
-                    self.net_g,
-                    self.n_spk,
-                    self.vc,
-                    self.hubert_model,
-                    self.tgt_sr,
-                )  # ,cpt
-                self.hubert_model = (
-                    self.net_g
-                ) = self.n_spk = self.vc = self.hubert_model = self.tgt_sr = None
-                if torch.cuda.is_available():
-                    torch.cuda.empty_cache()
-                ###楼下不这么折腾清理不干净
-                self.if_f0 = self.cpt.get("f0", 1)
-                self.version = self.cpt.get("version", "v1")
-                if self.version == "v1":
-                    if self.if_f0 == 1:
-                        self.net_g = SynthesizerTrnMs256NSFsid(
-                            *self.cpt["config"], is_half=self.config.is_half
-                        )
-                    else:
-                        self.net_g = SynthesizerTrnMs256NSFsid_nono(*self.cpt["config"])
-                elif self.version == "v2":
-                    if self.if_f0 == 1:
-                        self.net_g = SynthesizerTrnMs768NSFsid(
-                            *self.cpt["config"], is_half=self.config.is_half
-                        )
-                    else:
-                        self.net_g = SynthesizerTrnMs768NSFsid_nono(*self.cpt["config"])
-                del self.net_g, self.cpt
-                if torch.cuda.is_available():
-                    torch.cuda.empty_cache()
-            return (
-                {"visible": False, "__type__": "update"},
-                {
-                    "visible": True,
-                    "value": to_return_protect0,
-                    "__type__": "update",
-                },
-                {
-                    "visible": True,
-                    "value": to_return_protect1,
-                    "__type__": "update",
-                },
-                "",
-                "",
-            )
-        #person = f'{os.getenv("weight_root")}/{sid}'
-        person = f'{sid}'
-        #logger.info(f"Loading: {person}")
-        logger.info(f"Loading...")
-        self.cpt = torch.load(person, map_location="cpu")
-        self.tgt_sr = self.cpt["config"][-1]
-        self.cpt["config"][-3] = self.cpt["weight"]["emb_g.weight"].shape[0]  # n_spk
-        self.if_f0 = self.cpt.get("f0", 1)
-        self.version = self.cpt.get("version", "v1")
-
-        synthesizer_class = {
-            ("v1", 1): SynthesizerTrnMs256NSFsid,
-            ("v1", 0): SynthesizerTrnMs256NSFsid_nono,
-            ("v2", 1): SynthesizerTrnMs768NSFsid,
-            ("v2", 0): SynthesizerTrnMs768NSFsid_nono,
-        }
-
-        self.net_g = synthesizer_class.get(
-            (self.version, self.if_f0), SynthesizerTrnMs256NSFsid
-        )(*self.cpt["config"], is_half=self.config.is_half)
-
-        del self.net_g.enc_q
-
-        self.net_g.load_state_dict(self.cpt["weight"], strict=False)
-        self.net_g.eval().to(self.config.device)
-        if self.config.is_half:
-            self.net_g = self.net_g.half()
-        else:
-            self.net_g = self.net_g.float()
-
-        self.pipeline = Pipeline(self.tgt_sr, self.config)
-        n_spk = self.cpt["config"][-3]
-        index = {"value": get_index_path_from_model(sid), "__type__": "update"}
-        logger.info("Select index: " + index["value"])
-
-        return (
-            (
-                {"visible": False, "maximum": n_spk, "__type__": "update"},
-                to_return_protect0,
-                to_return_protect1
-            )
-            if to_return_protect
-            else {"visible": False, "maximum": n_spk, "__type__": "update"}
-        )
-    
-
-    def vc_single(
-        self,
-        sid,
-        input_audio_path0,
-        input_audio_path1,
-        f0_up_key,
-        f0_file,
-        f0_method,
-        file_index,
-        file_index2,
-        index_rate,
-        filter_radius,
-        resample_sr,
-        rms_mix_rate,
-        protect,
-        crepe_hop_length,
-        f0_min,
-        note_min,
-        f0_max,
-        note_max,
-        f0_autotune,
-    ):
-        global total_time
-        total_time = 0
-        start_time = time.time()
-        if not input_audio_path0 and not input_audio_path1:
-            return "You need to upload an audio", None
-        
-        if (not os.path.exists(input_audio_path0)) and (not os.path.exists(os.path.join(now_dir, input_audio_path0))):
-            return "Audio was not properly selected or doesn't exist", None
-        
-        input_audio_path1 = input_audio_path1 or input_audio_path0
-        print(f"\nStarting inference for '{os.path.basename(input_audio_path1)}'")
-        print("-------------------")
-        f0_up_key = int(f0_up_key)
-        if rvc_globals.NotesOrHertz and f0_method != 'rmvpe':
-            f0_min = note_to_hz(note_min) if note_min else 50
-            f0_max = note_to_hz(note_max) if note_max else 1100
-            print(f"Converted Min pitch: freq - {f0_min}\n"
-                  f"Converted Max pitch: freq - {f0_max}")
-        else:
-            f0_min = f0_min or 50
-            f0_max = f0_max or 1100
-        try:
-            input_audio_path1 = input_audio_path1 or input_audio_path0
-            print(f"Attempting to load {input_audio_path1}....")
-            audio = load_audio(file=input_audio_path1,
-                               sr=16000,
-                               DoFormant=rvc_globals.DoFormant,
-                               Quefrency=rvc_globals.Quefrency,
-                               Timbre=rvc_globals.Timbre)
-            
-            audio_max = np.abs(audio).max() / 0.95
-            if audio_max > 1:
-                audio /= audio_max
-            times = [0, 0, 0]
-
-            if self.hubert_model is None:
-                self.hubert_model = load_hubert(self.config)
-
-            try:
-                self.if_f0 = self.cpt.get("f0", 1)
-            except NameError:
-                message = "Model was not properly selected"
-                print(message)
-                return message, None
-            
-            file_index = (
-                (
-                    file_index.strip(" ")
-                    .strip('"')
-                    .strip("\n")
-                    .strip('"')
-                    .strip(" ")
-                    .replace("trained", "added")
-                )
-                if file_index != ""
-                else file_index2
-            )  # 防止小白写错，自动帮他替换掉
-
-            try:
-                audio_opt = self.pipeline.pipeline(
-                    self.hubert_model,
-                    self.net_g,
-                    sid,
-                    audio,
-                    input_audio_path1,
-                    times,
-                    f0_up_key,
-                    f0_method,
-                    file_index,
-                    index_rate,
-                    self.if_f0,
-                    filter_radius,
-                    self.tgt_sr,
-                    resample_sr,
-                    rms_mix_rate,
-                    self.version,
-                    protect,
-                    crepe_hop_length,
-                    f0_autotune,
-                    f0_file=f0_file,
-                    f0_min=f0_min,
-                    f0_max=f0_max
-                    )
-            except AssertionError:
-                message = "Mismatching index version detected (v1 with v2, or v2 with v1)."
-                print(message)
-                return message, None
-            except NameError:
-                message = "RVC libraries are still loading. Please try again in a few seconds."
-                print(message)
-                return message, None
-
-            if self.tgt_sr != resample_sr >= 16000:
-                self.tgt_sr = resample_sr
-            index_info = (
-                "Index:\n%s." % file_index
-                if os.path.exists(file_index)
-                else "Index not used."
-            )
-            end_time = time.time()
-            total_time = end_time - start_time
-
-            output_folder = "audio-outputs"
-            os.makedirs(output_folder, exist_ok=True)  
-            output_filename = "generated_audio_{}.wav"
-            output_count = 1
-            while True:
-                current_output_path = os.path.join(output_folder, output_filename.format(output_count))
-                if not os.path.exists(current_output_path):
-                    break
-                output_count += 1
-            
-            wavfile.write(current_output_path, self.tgt_sr, audio_opt)
-            print(f"Generated audio saved to: {current_output_path}")
-            return f"Success.\n {index_info}\nTime:\n npy:{times[0]}, f0:{times[1]}, infer:{times[2]}\nTotal Time: {total_time} seconds", (self.tgt_sr, audio_opt)
-        except:
-            info = traceback.format_exc()
-            logger.warn(info)
-            return info, (None, None)
-
-    def vc_single_dont_save(
-        self,
-        sid,
-        input_audio_path0,
-        input_audio_path1,
-        f0_up_key,
-        f0_file,
-        f0_method,
-        file_index,
-        file_index2,
-        index_rate,
-        filter_radius,
-        resample_sr,
-        rms_mix_rate,
-        protect,
-        crepe_hop_length,
-        f0_min,
-        note_min,
-        f0_max,
-        note_max,
-        f0_autotune,
-    ):
-        global total_time
-        total_time = 0
-        start_time = time.time()
-        if not input_audio_path0 and not input_audio_path1:
-            return "You need to upload an audio", None
-        
-        if (not os.path.exists(input_audio_path0)) and (not os.path.exists(os.path.join(now_dir, input_audio_path0))):
-            return "Audio was not properly selected or doesn't exist", None
-        
-        input_audio_path1 = input_audio_path1 or input_audio_path0
-        print(f"\nStarting inference for '{os.path.basename(input_audio_path1)}'")
-        print("-------------------")
-        f0_up_key = int(f0_up_key)
-        if rvc_globals.NotesOrHertz and f0_method != 'rmvpe':
-            f0_min = note_to_hz(note_min) if note_min else 50
-            f0_max = note_to_hz(note_max) if note_max else 1100
-            print(f"Converted Min pitch: freq - {f0_min}\n"
-                  f"Converted Max pitch: freq - {f0_max}")
-        else:
-            f0_min = f0_min or 50
-            f0_max = f0_max or 1100
-        try:
-            input_audio_path1 = input_audio_path1 or input_audio_path0
-            print(f"Attempting to load {input_audio_path1}....")
-            audio = load_audio(file=input_audio_path1,
-                               sr=16000,
-                               DoFormant=rvc_globals.DoFormant,
-                               Quefrency=rvc_globals.Quefrency,
-                               Timbre=rvc_globals.Timbre)
-            
-            audio_max = np.abs(audio).max() / 0.95
-            if audio_max > 1:
-                audio /= audio_max
-            times = [0, 0, 0]
-
-            if self.hubert_model is None:
-                self.hubert_model = load_hubert(self.config)
-
-            try:
-                self.if_f0 = self.cpt.get("f0", 1)
-            except NameError:
-                message = "Model was not properly selected"
-                print(message)
-                return message, None
-            
-            file_index = (
-                (
-                    file_index.strip(" ")
-                    .strip('"')
-                    .strip("\n")
-                    .strip('"')
-                    .strip(" ")
-                    .replace("trained", "added")
-                )
-                if file_index != ""
-                else file_index2
-            )  # 防止小白写错，自动帮他替换掉
-
-            try:
-                audio_opt = self.pipeline.pipeline(
-                    self.hubert_model,
-                    self.net_g,
-                    sid,
-                    audio,
-                    input_audio_path1,
-                    times,
-                    f0_up_key,
-                    f0_method,
-                    file_index,
-                    index_rate,
-                    self.if_f0,
-                    filter_radius,
-                    self.tgt_sr,
-                    resample_sr,
-                    rms_mix_rate,
-                    self.version,
-                    protect,
-                    crepe_hop_length,
-                    f0_autotune,
-                    f0_file=f0_file,
-                    f0_min=f0_min,
-                    f0_max=f0_max
-                    )
-            except AssertionError:
-                message = "Mismatching index version detected (v1 with v2, or v2 with v1)."
-                print(message)
-                return message, None
-            except NameError:
-                message = "RVC libraries are still loading. Please try again in a few seconds."
-                print(message)
-                return message, None
-
-            if self.tgt_sr != resample_sr >= 16000:
-                self.tgt_sr = resample_sr
-            index_info = (
-                "Index:\n%s." % file_index
-                if os.path.exists(file_index)
-                else "Index not used."
-            )
-            end_time = time.time()
-            total_time = end_time - start_time
-
-            return f"Success.\n {index_info}\nTime:\n npy:{times[0]}, f0:{times[1]}, infer:{times[2]}\nTotal Time: {total_time} seconds", (self.tgt_sr, audio_opt)
-        except:
-            info = traceback.format_exc()
-            logger.warn(info)
-            return info, (None, None)
-
-
-    def vc_multi(
-        self,
-        sid,
-        dir_path,
-        opt_root,
-        paths,
-        f0_up_key,
-        f0_method,
-        file_index,
-        file_index2,
-        index_rate,
-        filter_radius,
-        resample_sr,
-        rms_mix_rate,
-        protect,
-        format1,
-        crepe_hop_length,
-        f0_min,
-        note_min,
-        f0_max,
-        note_max,
-        f0_autotune,
-    ):
-        if rvc_globals.NotesOrHertz and f0_method != 'rmvpe':
-            f0_min = note_to_hz(note_min) if note_min else 50
-            f0_max = note_to_hz(note_max) if note_max else 1100
-            print(f"Converted Min pitch: freq - {f0_min}\n"
-                  f"Converted Max pitch: freq - {f0_max}")
-        else:
-            f0_min = f0_min or 50
-            f0_max = f0_max or 1100
-        try:
-            dir_path = (
-                dir_path.strip(" ").strip('"').strip("\n").strip('"').strip(" ")
-            )  # 防止小白拷路径头尾带了空格和"和回车
-            opt_root = opt_root.strip(" ").strip('"').strip("\n").strip('"').strip(" ")
-            os.makedirs(opt_root, exist_ok=True)
-            try:
-                if dir_path != "":
-                    paths = [
-                        os.path.join(dir_path, name) for name in os.listdir(dir_path)
-                    ]
-                else:
-                    paths = [path.name for path in paths]
-            except:
-                traceback.print_exc()
-                paths = [path.name for path in paths]
-            infos = []
-            for path in paths:
-                info, opt = self.vc_single(
-                    sid,
-                    path,
-                    f0_up_key,
-                    None,
-                    f0_method,
-                    file_index,
-                    file_index2,
-                    # file_big_npy,
-                    index_rate,
-                    filter_radius,
-                    resample_sr,
-                    rms_mix_rate,
-                    protect,
-                )
-                if "Success" in info:
-                    try:
-                        tgt_sr, audio_opt = opt
-                        if format1 in ["wav", "flac"]:
-                            sf.write(
-                                "%s/%s.%s"
-                                % (opt_root, os.path.basename(path), format1),
-                                audio_opt,
-                                tgt_sr,
-                            )
-                        else:
-                            path = "%s/%s.%s" % (opt_root, os.path.basename(path), format1)
-                            with BytesIO() as wavf:
-                                sf.write(
-                                    wavf,
-                                    audio_opt,
-                                    tgt_sr,
-                                    format="wav"
-                                )
-                                wavf.seek(0, 0)
-                                with open(path, "wb") as outf:
-                                    wav2(wavf, outf, format1)
-                    except:
-                        info += traceback.format_exc()
-                infos.append("%s->%s" % (os.path.basename(path), info))
-                yield "\n".join(infos)
-            yield "\n".join(infos)
-        except:
-            yield traceback.format_exc()
diff --git a/spaces/EronSamez/RVC_HFmeu/extract_locale.py b/spaces/EronSamez/RVC_HFmeu/extract_locale.py
deleted file mode 100644
index a4ff5ea3ddd7c612c640544099ab98a861b8fe35..0000000000000000000000000000000000000000
--- a/spaces/EronSamez/RVC_HFmeu/extract_locale.py
+++ /dev/null
@@ -1,34 +0,0 @@
-import json
-import re
-
-# Define regular expression patterns
-pattern = r"""i18n\([\s\n\t]*(["'][^"']+["'])[\s\n\t]*\)"""
-
-# Initialize the dictionary to store key-value pairs
-data = {}
-
-
-def process(fn: str):
-    global data
-    with open(fn, "r", encoding="utf-8") as f:
-        contents = f.read()
-        matches = re.findall(pattern, contents)
-        for key in matches:
-            key = eval(key)
-            print("extract:", key)
-            data[key] = key
-
-
-print("processing infer-web.py")
-process("infer-web.py")
-
-print("processing gui_v0.py")
-process("gui_v0.py")
-
-print("processing gui_v1.py")
-process("gui_v1.py")
-
-# Save as a JSON file
-with open("./i18n/en_US.json", "w", encoding="utf-8") as f:
-    json.dump(data, f, ensure_ascii=False, indent=4)
-    f.write("\n")
diff --git a/spaces/EuroPython2022/BayesCap/losses.py b/spaces/EuroPython2022/BayesCap/losses.py
deleted file mode 100644
index 990af85be1163124a385b06ac5ffc63a47b0cfdd..0000000000000000000000000000000000000000
--- a/spaces/EuroPython2022/BayesCap/losses.py
+++ /dev/null
@@ -1,131 +0,0 @@
-import torch
-import torch.nn as nn
-import torch.nn.functional as F
-import torchvision.models as models
-from torch import Tensor
-
-class ContentLoss(nn.Module):
-	"""Constructs a content loss function based on the VGG19 network.
-	Using high-level feature mapping layers from the latter layers will focus more on the texture content of the image.
-
-	Paper reference list:
-		-`Photo-Realistic Single Image Super-Resolution Using a Generative Adversarial Network <https://arxiv.org/pdf/1609.04802.pdf>` paper.
-		-`ESRGAN: Enhanced Super-Resolution Generative Adversarial Networks                    <https://arxiv.org/pdf/1809.00219.pdf>` paper.
-		-`Perceptual Extreme Super Resolution Network with Receptive Field Block               <https://arxiv.org/pdf/2005.12597.pdf>` paper.
-
-	 """
-
-	def __init__(self) -> None:
-		super(ContentLoss, self).__init__()
-		# Load the VGG19 model trained on the ImageNet dataset.
-		vgg19 = models.vgg19(pretrained=True).eval()
-		# Extract the thirty-sixth layer output in the VGG19 model as the content loss.
-		self.feature_extractor = nn.Sequential(*list(vgg19.features.children())[:36])
-		# Freeze model parameters.
-		for parameters in self.feature_extractor.parameters():
-			parameters.requires_grad = False
-
-		# The preprocessing method of the input data. This is the VGG model preprocessing method of the ImageNet dataset.
-		self.register_buffer("mean", torch.Tensor([0.485, 0.456, 0.406]).view(1, 3, 1, 1))
-		self.register_buffer("std", torch.Tensor([0.229, 0.224, 0.225]).view(1, 3, 1, 1))
-
-	def forward(self, sr: Tensor, hr: Tensor) -> Tensor:
-		# Standardized operations
-		sr = sr.sub(self.mean).div(self.std)
-		hr = hr.sub(self.mean).div(self.std)
-
-		# Find the feature map difference between the two images
-		loss = F.l1_loss(self.feature_extractor(sr), self.feature_extractor(hr))
-
-		return loss
-
-
-class GenGaussLoss(nn.Module):
-	def __init__(
-		self, reduction='mean',
-		alpha_eps = 1e-4, beta_eps=1e-4,
-		resi_min = 1e-4, resi_max=1e3
-	) -> None:
-		super(GenGaussLoss, self).__init__()
-		self.reduction = reduction
-		self.alpha_eps = alpha_eps
-		self.beta_eps = beta_eps
-		self.resi_min = resi_min
-		self.resi_max = resi_max
-	
-	def forward(
-		self, 
-		mean: Tensor, one_over_alpha: Tensor, beta: Tensor, target: Tensor
-	):
-		one_over_alpha1 = one_over_alpha + self.alpha_eps
-		beta1 = beta + self.beta_eps
-
-		resi = torch.abs(mean - target)
-		# resi = torch.pow(resi*one_over_alpha1, beta1).clamp(min=self.resi_min, max=self.resi_max)
-		resi = (resi*one_over_alpha1*beta1).clamp(min=self.resi_min, max=self.resi_max)
-		## check if resi has nans
-		if torch.sum(resi != resi) > 0:
-			print('resi has nans!!')
-			return None
-		
-		log_one_over_alpha = torch.log(one_over_alpha1)
-		log_beta = torch.log(beta1)
-		lgamma_beta = torch.lgamma(torch.pow(beta1, -1))
-		
-		if torch.sum(log_one_over_alpha != log_one_over_alpha) > 0:
-			print('log_one_over_alpha has nan')
-		if torch.sum(lgamma_beta != lgamma_beta) > 0:
-			print('lgamma_beta has nan')
-		if torch.sum(log_beta != log_beta) > 0:
-			print('log_beta has nan')
-		
-		l = resi - log_one_over_alpha + lgamma_beta - log_beta
-
-		if self.reduction == 'mean':
-			return l.mean()
-		elif self.reduction == 'sum':
-			return l.sum()
-		else:
-			print('Reduction not supported')
-			return None
-
-class TempCombLoss(nn.Module):
-	def __init__(
-		self, reduction='mean',
-		alpha_eps = 1e-4, beta_eps=1e-4,
-		resi_min = 1e-4, resi_max=1e3
-	) -> None:
-		super(TempCombLoss, self).__init__()
-		self.reduction = reduction
-		self.alpha_eps = alpha_eps
-		self.beta_eps = beta_eps
-		self.resi_min = resi_min
-		self.resi_max = resi_max
-
-		self.L_GenGauss = GenGaussLoss(
-			reduction=self.reduction,
-			alpha_eps=self.alpha_eps, beta_eps=self.beta_eps, 
-			resi_min=self.resi_min, resi_max=self.resi_max
-		)
-		self.L_l1 = nn.L1Loss(reduction=self.reduction)
-	
-	def forward(
-		self,
-		mean: Tensor, one_over_alpha: Tensor, beta: Tensor, target: Tensor,
-		T1: float, T2: float
-	):
-		l1 = self.L_l1(mean, target)
-		l2 = self.L_GenGauss(mean, one_over_alpha, beta, target)
-		l = T1*l1 + T2*l2
-
-		return l
-
-
-# x1 = torch.randn(4,3,32,32)
-# x2 = torch.rand(4,3,32,32)
-# x3 = torch.rand(4,3,32,32)
-# x4 = torch.randn(4,3,32,32)
-
-# L = GenGaussLoss(alpha_eps=1e-4, beta_eps=1e-4, resi_min=1e-4, resi_max=1e3)
-# L2 =  TempCombLoss(alpha_eps=1e-4, beta_eps=1e-4, resi_min=1e-4, resi_max=1e3)
-# print(L(x1, x2, x3, x4), L2(x1, x2, x3, x4, 1e0, 1e-2))
\ No newline at end of file
diff --git a/spaces/Falah/stablediffusionDB/app.py b/spaces/Falah/stablediffusionDB/app.py
deleted file mode 100644
index faa76da3aa856ae351d5c41a3ebae5a22134884c..0000000000000000000000000000000000000000
--- a/spaces/Falah/stablediffusionDB/app.py
+++ /dev/null
@@ -1,48 +0,0 @@
-import numpy as np
-import gradio as gr
-from datasets import load_dataset
-
-def generate_random_data():
-    # Load the dataset with the `large_random_1k` subset
-    dataset = load_dataset('poloclub/diffusiondb', 'large_random_1k')
-    # All data are stored in the `train` split
-    my_1k_data = dataset['train']
-    
-    random_i = np.random.choice(range(my_1k_data.num_rows))
-    
-    prompt = my_1k_data['prompt'][random_i]
-    image = my_1k_data['image'][random_i]
-    seed = my_1k_data['seed'][random_i]
-    step = my_1k_data['step'][random_i]
-    cfg = my_1k_data['cfg'][random_i]
-    sampler = my_1k_data['sampler'][random_i]
-    
-    return prompt, image, seed, step, cfg, sampler
-
-def random_data():
-    prompt, image, seed, step, cfg, sampler = generate_random_data()
-    
-    data = {
-        'Prompt': prompt,
-        'Seed': seed,
-        'Step': step,
-        'CFG': cfg,
-        'Sampler': sampler
-    }
-    
-    with open("random_data.txt", "w") as file:
-        for key, value in data.items():
-            file.write(f"{key}: {value}\n")
-    
-    return prompt, image, seed, step, cfg, sampler
-
-iface = gr.Interface(fn=random_data, inputs=None, outputs=[
-    gr.outputs.Textbox(label="Prompt"),
-    gr.outputs.Image(label="Image", type="pil"),
-    gr.outputs.Textbox(label="Seed"),
-    gr.outputs.Textbox(label="Step"),
-    gr.outputs.Textbox(label="CFG"),
-    gr.outputs.Textbox(label="Sampler")
-], title="Stable Diffusion DB", description="By Falah.G.S AI Developer")
-
-iface.launch(debug=True)
diff --git a/spaces/Flux9665/IMS-Toucan/InferenceInterfaces/__init__.py b/spaces/Flux9665/IMS-Toucan/InferenceInterfaces/__init__.py
deleted file mode 100644
index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000
diff --git a/spaces/FridaZuley/RVC_HFKawaii/infer/lib/infer_pack/modules/F0Predictor/__init__.py b/spaces/FridaZuley/RVC_HFKawaii/infer/lib/infer_pack/modules/F0Predictor/__init__.py
deleted file mode 100644
index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000
diff --git a/spaces/GolDNenex/Super-Resolution-Anime-Diffusion/Waifu2x/utils/Img_to_H5.py b/spaces/GolDNenex/Super-Resolution-Anime-Diffusion/Waifu2x/utils/Img_to_H5.py
deleted file mode 100644
index fde0a149ddd3caad82226f4ed24a37916008b8db..0000000000000000000000000000000000000000
--- a/spaces/GolDNenex/Super-Resolution-Anime-Diffusion/Waifu2x/utils/Img_to_H5.py
+++ /dev/null
@@ -1,57 +0,0 @@
-import glob
-
-import h5py
-from PIL import Image
-from torchvision.transforms import RandomCrop
-from torchvision.transforms.functional import to_tensor
-from tqdm import tqdm
-
-from Dataloader import ImageAugment
-
-patch_size = 128
-shrink_size = 2
-noise_level = 1
-patches_per_img = 20
-images = glob.glob("dataset/train/*")
-
-database = h5py.File("train_images.hdf5", "w")
-
-dat_group = database.create_group("shrink_2_noise_level_1_downsample_random_rgb")
-# del database['shrink_2_noise_level_1_downsample_random']
-storage_lr = dat_group.create_dataset(
-    "train_lr",
-    shape=(
-        patches_per_img * len(images),
-        3,
-        patch_size // shrink_size,
-        patch_size // shrink_size,
-    ),
-    dtype="float32",
-    # compression='lzf',
-)
-storage_hr = dat_group.create_dataset(
-    "train_hr",
-    shape=(patches_per_img * len(images), 3, patch_size, patch_size),
-    # compression='lzf',
-    dtype="float32",
-)
-
-random_cropper = RandomCrop(size=patch_size)
-img_augmenter = ImageAugment(shrink_size, noise_level, down_sample_method=None)
-
-
-def get_img_patches(img_pil):
-    img_patch = random_cropper(img_pil)
-    lr_hr_patches = img_augmenter.process(img_patch)
-    return lr_hr_patches
-
-
-counter = 0
-for img in tqdm(images):
-    img_pil = Image.open(img).convert("RGB")
-    for i in range(patches_per_img):
-        patch = get_img_patches(img_pil)
-        storage_lr[counter] = to_tensor(patch[0].convert("RGB")).numpy()
-        storage_hr[counter] = to_tensor(patch[1].convert("RGB")).numpy()
-        counter += 1
-database.close()
diff --git a/spaces/Gradio-Blocks/EmojiGAN/torch_utils/ops/bias_act.h b/spaces/Gradio-Blocks/EmojiGAN/torch_utils/ops/bias_act.h
deleted file mode 100644
index a32187e1fb7e3bae509d4eceaf900866866875a4..0000000000000000000000000000000000000000
--- a/spaces/Gradio-Blocks/EmojiGAN/torch_utils/ops/bias_act.h
+++ /dev/null
@@ -1,38 +0,0 @@
-// Copyright (c) 2021, NVIDIA CORPORATION.  All rights reserved.
-//
-// NVIDIA CORPORATION and its licensors retain all intellectual property
-// and proprietary rights in and to this software, related documentation
-// and any modifications thereto.  Any use, reproduction, disclosure or
-// distribution of this software and related documentation without an express
-// license agreement from NVIDIA CORPORATION is strictly prohibited.
-
-//------------------------------------------------------------------------
-// CUDA kernel parameters.
-
-struct bias_act_kernel_params
-{
-    const void* x;      // [sizeX]
-    const void* b;      // [sizeB] or NULL
-    const void* xref;   // [sizeX] or NULL
-    const void* yref;   // [sizeX] or NULL
-    const void* dy;     // [sizeX] or NULL
-    void*       y;      // [sizeX]
-
-    int         grad;
-    int         act;
-    float       alpha;
-    float       gain;
-    float       clamp;
-
-    int         sizeX;
-    int         sizeB;
-    int         stepB;
-    int         loopX;
-};
-
-//------------------------------------------------------------------------
-// CUDA kernel selection.
-
-template <class T> void* choose_bias_act_kernel(const bias_act_kernel_params& p);
-
-//------------------------------------------------------------------------
diff --git a/spaces/Gradio-Blocks/uniformer_image_detection/mmdet/core/anchor/point_generator.py b/spaces/Gradio-Blocks/uniformer_image_detection/mmdet/core/anchor/point_generator.py
deleted file mode 100644
index e6fbd988c317992c092c68c827dc4c53223b4a4a..0000000000000000000000000000000000000000
--- a/spaces/Gradio-Blocks/uniformer_image_detection/mmdet/core/anchor/point_generator.py
+++ /dev/null
@@ -1,37 +0,0 @@
-import torch
-
-from .builder import ANCHOR_GENERATORS
-
-
-@ANCHOR_GENERATORS.register_module()
-class PointGenerator(object):
-
-    def _meshgrid(self, x, y, row_major=True):
-        xx = x.repeat(len(y))
-        yy = y.view(-1, 1).repeat(1, len(x)).view(-1)
-        if row_major:
-            return xx, yy
-        else:
-            return yy, xx
-
-    def grid_points(self, featmap_size, stride=16, device='cuda'):
-        feat_h, feat_w = featmap_size
-        shift_x = torch.arange(0., feat_w, device=device) * stride
-        shift_y = torch.arange(0., feat_h, device=device) * stride
-        shift_xx, shift_yy = self._meshgrid(shift_x, shift_y)
-        stride = shift_x.new_full((shift_xx.shape[0], ), stride)
-        shifts = torch.stack([shift_xx, shift_yy, stride], dim=-1)
-        all_points = shifts.to(device)
-        return all_points
-
-    def valid_flags(self, featmap_size, valid_size, device='cuda'):
-        feat_h, feat_w = featmap_size
-        valid_h, valid_w = valid_size
-        assert valid_h <= feat_h and valid_w <= feat_w
-        valid_x = torch.zeros(feat_w, dtype=torch.bool, device=device)
-        valid_y = torch.zeros(feat_h, dtype=torch.bool, device=device)
-        valid_x[:valid_w] = 1
-        valid_y[:valid_h] = 1
-        valid_xx, valid_yy = self._meshgrid(valid_x, valid_y)
-        valid = valid_xx & valid_yy
-        return valid
diff --git a/spaces/Gradio-Blocks/uniformer_image_segmentation/configs/ocrnet/ocrnet_hr18_512x1024_40k_cityscapes.py b/spaces/Gradio-Blocks/uniformer_image_segmentation/configs/ocrnet/ocrnet_hr18_512x1024_40k_cityscapes.py
deleted file mode 100644
index 2c73b3839c8c1bc859eb3b8864256a00cfd022fe..0000000000000000000000000000000000000000
--- a/spaces/Gradio-Blocks/uniformer_image_segmentation/configs/ocrnet/ocrnet_hr18_512x1024_40k_cityscapes.py
+++ /dev/null
@@ -1,4 +0,0 @@
-_base_ = [
-    '../_base_/models/ocrnet_hr18.py', '../_base_/datasets/cityscapes.py',
-    '../_base_/default_runtime.py', '../_base_/schedules/schedule_40k.py'
-]
diff --git a/spaces/GrandaddyShmax/MusicGen_Plus_hfv2/CONTRIBUTING.md b/spaces/GrandaddyShmax/MusicGen_Plus_hfv2/CONTRIBUTING.md
deleted file mode 100644
index 55b99140204d785d572ada9761dd77f302ae31c6..0000000000000000000000000000000000000000
--- a/spaces/GrandaddyShmax/MusicGen_Plus_hfv2/CONTRIBUTING.md
+++ /dev/null
@@ -1,35 +0,0 @@
-# Contributing to Audiocraft
-
-We want to make contributing to this project as easy and transparent as
-possible.
-
-## Pull Requests
-
-Audiocraft is the implementation of a research paper.
-Therefore, we do not plan on accepting many pull requests for new features.
-We certainly welcome them for bug fixes.
-
-1. Fork the repo and create your branch from `main`.
-2. If you've added code that should be tested, add tests.
-3. If you've changed APIs, update the documentation.
-4. Ensure the test suite passes.
-5. Make sure your code lints.
-6. If you haven't already, complete the Contributor License Agreement ("CLA").
-
-## Contributor License Agreement ("CLA")
-In order to accept your pull request, we need you to submit a CLA. You only need
-to do this once to work on any of Meta's open source projects.
-
-Complete your CLA here: <https://code.facebook.com/cla>
-
-## Issues
-We use GitHub issues to track public bugs. Please ensure your description is
-clear and has sufficient instructions to be able to reproduce the issue.
-
-Meta has a [bounty program](https://www.facebook.com/whitehat/) for the safe
-disclosure of security bugs. In those cases, please go through the process
-outlined on that page and do not file a public issue.
-
-## License
-By contributing to encodec, you agree that your contributions will be licensed
-under the LICENSE file in the root directory of this source tree.
diff --git a/spaces/Grezz/generate_human_motion/VQ-Trans/visualize/render_mesh.py b/spaces/Grezz/generate_human_motion/VQ-Trans/visualize/render_mesh.py
deleted file mode 100644
index d44d04f551ccb4f1ffc9efb4cb1a44c407ede836..0000000000000000000000000000000000000000
--- a/spaces/Grezz/generate_human_motion/VQ-Trans/visualize/render_mesh.py
+++ /dev/null
@@ -1,33 +0,0 @@
-import argparse
-import os
-from visualize import vis_utils
-import shutil
-from tqdm import tqdm
-
-if __name__ == '__main__':
-    parser = argparse.ArgumentParser()
-    parser.add_argument("--input_path", type=str, required=True, help='stick figure mp4 file to be rendered.')
-    parser.add_argument("--cuda", type=bool, default=True, help='')
-    parser.add_argument("--device", type=int, default=0, help='')
-    params = parser.parse_args()
-
-    assert params.input_path.endswith('.mp4')
-    parsed_name = os.path.basename(params.input_path).replace('.mp4', '').replace('sample', '').replace('rep', '')
-    sample_i, rep_i = [int(e) for e in parsed_name.split('_')]
-    npy_path = os.path.join(os.path.dirname(params.input_path), 'results.npy')
-    out_npy_path = params.input_path.replace('.mp4', '_smpl_params.npy')
-    assert os.path.exists(npy_path)
-    results_dir = params.input_path.replace('.mp4', '_obj')
-    if os.path.exists(results_dir):
-        shutil.rmtree(results_dir)
-    os.makedirs(results_dir)
-
-    npy2obj = vis_utils.npy2obj(npy_path, sample_i, rep_i,
-                                device=params.device, cuda=params.cuda)
-
-    print('Saving obj files to [{}]'.format(os.path.abspath(results_dir)))
-    for frame_i in tqdm(range(npy2obj.real_num_frames)):
-        npy2obj.save_obj(os.path.join(results_dir, 'frame{:03d}.obj'.format(frame_i)), frame_i)
-
-    print('Saving SMPL params to [{}]'.format(os.path.abspath(out_npy_path)))
-    npy2obj.save_npy(out_npy_path)
diff --git a/spaces/HarryLee/eCommerceImageCaptioning/fairseq/fairseq/modules/lstm_cell_with_zoneout.py b/spaces/HarryLee/eCommerceImageCaptioning/fairseq/fairseq/modules/lstm_cell_with_zoneout.py
deleted file mode 100644
index f04e5db255c62bbe0faebbc641f579f92be5580c..0000000000000000000000000000000000000000
--- a/spaces/HarryLee/eCommerceImageCaptioning/fairseq/fairseq/modules/lstm_cell_with_zoneout.py
+++ /dev/null
@@ -1,37 +0,0 @@
-# Copyright (c) Facebook, Inc. and its affiliates.
-#
-# This source code is licensed under the MIT license found in the
-# LICENSE file in the root directory of this source tree.
-
-import torch.nn as nn
-
-
-class LSTMCellWithZoneOut(nn.Module):
-    """
-    Zoneout: Regularizing RNNs by Randomly Preserving Hidden Activations
-    https://arxiv.org/abs/1606.01305
-    """
-
-    def __init__(self, prob: float, input_size: int, hidden_size: int,
-                 bias: bool = True):
-        super(LSTMCellWithZoneOut, self).__init__()
-        self.lstm_cell = nn.LSTMCell(input_size, hidden_size, bias=bias)
-        self.prob = prob
-        if prob > 1.0 or prob < 0.0:
-            raise ValueError("zoneout probability must be in the range from "
-                             "0.0 to 1.0.")
-
-    def zoneout(self, h, next_h, prob):
-        if isinstance(h, tuple):
-            return tuple(
-                [self.zoneout(h[i], next_h[i], prob) for i in range(len(h))]
-            )
-
-        if self.training:
-            mask = h.new_zeros(*h.size()).bernoulli_(prob)
-            return mask * h + (1 - mask) * next_h
-
-        return prob * h + (1 - prob) * next_h
-
-    def forward(self, x, h):
-        return self.zoneout(h, self.lstm_cell(x, h), self.prob)
diff --git a/spaces/HarryLee/eCommerceImageCaptioning/fairseq/fairseq/modules/sparse_transformer_sentence_encoder_layer.py b/spaces/HarryLee/eCommerceImageCaptioning/fairseq/fairseq/modules/sparse_transformer_sentence_encoder_layer.py
deleted file mode 100644
index d95da59c2471bfa858fd627605196d7f41f9ec12..0000000000000000000000000000000000000000
--- a/spaces/HarryLee/eCommerceImageCaptioning/fairseq/fairseq/modules/sparse_transformer_sentence_encoder_layer.py
+++ /dev/null
@@ -1,51 +0,0 @@
-# Copyright (c) Facebook, Inc. and its affiliates.
-#
-# This source code is licensed under the MIT license found in the
-# LICENSE file in the root directory of this source tree.
-
-from fairseq.modules import TransformerSentenceEncoderLayer
-from fairseq.modules.sparse_multihead_attention import SparseMultiheadAttention
-
-
-class SparseTransformerSentenceEncoderLayer(TransformerSentenceEncoderLayer):
-    """
-    Implements a Sprase Transformer Encoder Layer (see SparseMultiheadAttention)
-    """
-
-    def __init__(
-        self,
-        embedding_dim: int = 768,
-        ffn_embedding_dim: int = 3072,
-        num_attention_heads: int = 8,
-        dropout: float = 0.1,
-        attention_dropout: float = 0.1,
-        activation_dropout: float = 0.1,
-        activation_fn: str = "relu",
-        export: bool = False,
-        is_bidirectional: bool = True,
-        stride: int = 32,
-        expressivity: int = 8,
-    ) -> None:
-
-        super().__init__(
-            embedding_dim,
-            ffn_embedding_dim,
-            num_attention_heads,
-            dropout,
-            attention_dropout,
-            activation_dropout,
-            activation_fn,
-            export,
-        )
-
-        self.self_attn = SparseMultiheadAttention(
-            self.embedding_dim,
-            num_attention_heads,
-            dropout=attention_dropout,
-            add_bias_kv=False,
-            add_zero_attn=False,
-            self_attention=True,
-            is_bidirectional=is_bidirectional,
-            stride=stride,
-            expressivity=expressivity,
-        )
diff --git a/spaces/HarryLee/eCommerceImageCaptioning/fairseq/scripts/spm_decode.py b/spaces/HarryLee/eCommerceImageCaptioning/fairseq/scripts/spm_decode.py
deleted file mode 100644
index 1c18b1d2a7d7628b7aeb6fdb6c4ab5a096e9edf8..0000000000000000000000000000000000000000
--- a/spaces/HarryLee/eCommerceImageCaptioning/fairseq/scripts/spm_decode.py
+++ /dev/null
@@ -1,53 +0,0 @@
-#!/usr/bin/env python
-# Copyright (c) Facebook, Inc. and its affiliates.
-# All rights reserved.
-#
-# This source code is licensed under the license found in the
-# LICENSE file in the root directory of this source tree.
-
-from __future__ import absolute_import, division, print_function, unicode_literals
-
-import argparse
-
-import sentencepiece as spm
-
-
-def main():
-    parser = argparse.ArgumentParser()
-    parser.add_argument(
-        "--model", required=True, help="sentencepiece model to use for decoding"
-    )
-    parser.add_argument("--input", required=True, help="input file to decode")
-    parser.add_argument("--input_format", choices=["piece", "id"], default="piece")
-    args = parser.parse_args()
-
-    sp = spm.SentencePieceProcessor()
-    sp.Load(args.model)
-
-    if args.input_format == "piece":
-
-        def decode(l):
-            return "".join(sp.DecodePieces(l))
-
-    elif args.input_format == "id":
-
-        def decode(l):
-            return "".join(sp.DecodeIds(l))
-
-    else:
-        raise NotImplementedError
-
-    def tok2int(tok):
-        # remap reference-side <unk> (represented as <<unk>>) to 0
-        return int(tok) if tok != "<<unk>>" else 0
-
-    with open(args.input, "r", encoding="utf-8") as h:
-        for line in h:
-            if args.input_format == "id":
-                print(decode(list(map(tok2int, line.rstrip().split()))))
-            elif args.input_format == "piece":
-                print(decode(line.rstrip().split()))
-
-
-if __name__ == "__main__":
-    main()
diff --git a/spaces/Harveenchadha/Vakyansh-Tamil-TTS/ttsv/src/glow_tts/hifi/env.py b/spaces/Harveenchadha/Vakyansh-Tamil-TTS/ttsv/src/glow_tts/hifi/env.py
deleted file mode 100644
index 2bdbc95d4f7a8bad8fd4f5eef657e2b51d946056..0000000000000000000000000000000000000000
--- a/spaces/Harveenchadha/Vakyansh-Tamil-TTS/ttsv/src/glow_tts/hifi/env.py
+++ /dev/null
@@ -1,15 +0,0 @@
-import os
-import shutil
-
-
-class AttrDict(dict):
-    def __init__(self, *args, **kwargs):
-        super(AttrDict, self).__init__(*args, **kwargs)
-        self.__dict__ = self
-
-
-def build_env(config, config_name, path):
-    t_path = os.path.join(path, config_name)
-    if config != t_path:
-        os.makedirs(path, exist_ok=True)
-        shutil.copyfile(config, os.path.join(path, config_name))
diff --git a/spaces/Harveenchadha/Vakyansh-Tamil-TTS/ttsv/src/glow_tts/models.py b/spaces/Harveenchadha/Vakyansh-Tamil-TTS/ttsv/src/glow_tts/models.py
deleted file mode 100644
index a77596153fa2e7e6fdd52ee0028a0c8ce02050b4..0000000000000000000000000000000000000000
--- a/spaces/Harveenchadha/Vakyansh-Tamil-TTS/ttsv/src/glow_tts/models.py
+++ /dev/null
@@ -1,403 +0,0 @@
-import math
-import torch
-from torch import nn
-from torch.nn import functional as F
-
-import modules
-import commons
-import attentions
-import monotonic_align
-
-
-class DurationPredictor(nn.Module):
-    def __init__(self, in_channels, filter_channels, kernel_size, p_dropout):
-        super().__init__()
-
-        self.in_channels = in_channels
-        self.filter_channels = filter_channels
-        self.kernel_size = kernel_size
-        self.p_dropout = p_dropout
-
-        self.drop = nn.Dropout(p_dropout)
-        self.conv_1 = nn.Conv1d(
-            in_channels, filter_channels, kernel_size, padding=kernel_size // 2
-        )
-        self.norm_1 = attentions.LayerNorm(filter_channels)
-        self.conv_2 = nn.Conv1d(
-            filter_channels, filter_channels, kernel_size, padding=kernel_size // 2
-        )
-        self.norm_2 = attentions.LayerNorm(filter_channels)
-        self.proj = nn.Conv1d(filter_channels, 1, 1)
-
-    def forward(self, x, x_mask):
-        x = self.conv_1(x * x_mask)
-        x = torch.relu(x)
-        x = self.norm_1(x)
-        x = self.drop(x)
-        x = self.conv_2(x * x_mask)
-        x = torch.relu(x)
-        x = self.norm_2(x)
-        x = self.drop(x)
-        x = self.proj(x * x_mask)
-        return x * x_mask
-
-
-class TextEncoder(nn.Module):
-    def __init__(
-        self,
-        n_vocab,
-        out_channels,
-        hidden_channels,
-        filter_channels,
-        filter_channels_dp,
-        n_heads,
-        n_layers,
-        kernel_size,
-        p_dropout,
-        window_size=None,
-        block_length=None,
-        mean_only=False,
-        prenet=False,
-        gin_channels=0,
-    ):
-
-        super().__init__()
-
-        self.n_vocab = n_vocab
-        self.out_channels = out_channels
-        self.hidden_channels = hidden_channels
-        self.filter_channels = filter_channels
-        self.filter_channels_dp = filter_channels_dp
-        self.n_heads = n_heads
-        self.n_layers = n_layers
-        self.kernel_size = kernel_size
-        self.p_dropout = p_dropout
-        self.window_size = window_size
-        self.block_length = block_length
-        self.mean_only = mean_only
-        self.prenet = prenet
-        self.gin_channels = gin_channels
-
-        self.emb = nn.Embedding(n_vocab, hidden_channels)
-        nn.init.normal_(self.emb.weight, 0.0, hidden_channels ** -0.5)
-
-        if prenet:
-            self.pre = modules.ConvReluNorm(
-                hidden_channels,
-                hidden_channels,
-                hidden_channels,
-                kernel_size=5,
-                n_layers=3,
-                p_dropout=0.5,
-            )
-        self.encoder = attentions.Encoder(
-            hidden_channels,
-            filter_channels,
-            n_heads,
-            n_layers,
-            kernel_size,
-            p_dropout,
-            window_size=window_size,
-            block_length=block_length,
-        )
-
-        self.proj_m = nn.Conv1d(hidden_channels, out_channels, 1)
-        if not mean_only:
-            self.proj_s = nn.Conv1d(hidden_channels, out_channels, 1)
-        self.proj_w = DurationPredictor(
-            hidden_channels + gin_channels, filter_channels_dp, kernel_size, p_dropout
-        )
-
-    def forward(self, x, x_lengths, g=None):
-        x = self.emb(x) * math.sqrt(self.hidden_channels)  # [b, t, h]
-        x = torch.transpose(x, 1, -1)  # [b, h, t]
-        x_mask = torch.unsqueeze(commons.sequence_mask(x_lengths, x.size(2)), 1).to(
-            x.dtype
-        )
-
-        if self.prenet:
-            x = self.pre(x, x_mask)
-        x = self.encoder(x, x_mask)
-
-        if g is not None:
-            g_exp = g.expand(-1, -1, x.size(-1))
-            x_dp = torch.cat([torch.detach(x), g_exp], 1)
-        else:
-            x_dp = torch.detach(x)
-
-        x_m = self.proj_m(x) * x_mask
-        if not self.mean_only:
-            x_logs = self.proj_s(x) * x_mask
-        else:
-            x_logs = torch.zeros_like(x_m)
-
-        logw = self.proj_w(x_dp, x_mask)
-        return x_m, x_logs, logw, x_mask
-
-
-class FlowSpecDecoder(nn.Module):
-    def __init__(
-        self,
-        in_channels,
-        hidden_channels,
-        kernel_size,
-        dilation_rate,
-        n_blocks,
-        n_layers,
-        p_dropout=0.0,
-        n_split=4,
-        n_sqz=2,
-        sigmoid_scale=False,
-        gin_channels=0,
-    ):
-        super().__init__()
-
-        self.in_channels = in_channels
-        self.hidden_channels = hidden_channels
-        self.kernel_size = kernel_size
-        self.dilation_rate = dilation_rate
-        self.n_blocks = n_blocks
-        self.n_layers = n_layers
-        self.p_dropout = p_dropout
-        self.n_split = n_split
-        self.n_sqz = n_sqz
-        self.sigmoid_scale = sigmoid_scale
-        self.gin_channels = gin_channels
-
-        self.flows = nn.ModuleList()
-        for b in range(n_blocks):
-            self.flows.append(modules.ActNorm(channels=in_channels * n_sqz))
-            self.flows.append(
-                modules.InvConvNear(channels=in_channels * n_sqz, n_split=n_split)
-            )
-            self.flows.append(
-                attentions.CouplingBlock(
-                    in_channels * n_sqz,
-                    hidden_channels,
-                    kernel_size=kernel_size,
-                    dilation_rate=dilation_rate,
-                    n_layers=n_layers,
-                    gin_channels=gin_channels,
-                    p_dropout=p_dropout,
-                    sigmoid_scale=sigmoid_scale,
-                )
-            )
-
-    def forward(self, x, x_mask, g=None, reverse=False):
-        if not reverse:
-            flows = self.flows
-            logdet_tot = 0
-        else:
-            flows = reversed(self.flows)
-            logdet_tot = None
-
-        if self.n_sqz > 1:
-            x, x_mask = commons.squeeze(x, x_mask, self.n_sqz)
-        for f in flows:
-            if not reverse:
-                x, logdet = f(x, x_mask, g=g, reverse=reverse)
-                logdet_tot += logdet
-            else:
-                x, logdet = f(x, x_mask, g=g, reverse=reverse)
-        if self.n_sqz > 1:
-            x, x_mask = commons.unsqueeze(x, x_mask, self.n_sqz)
-        return x, logdet_tot
-
-    def store_inverse(self):
-        for f in self.flows:
-            f.store_inverse()
-
-
-class FlowGenerator(nn.Module):
-    def __init__(
-        self,
-        n_vocab,
-        hidden_channels,
-        filter_channels,
-        filter_channels_dp,
-        out_channels,
-        kernel_size=3,
-        n_heads=2,
-        n_layers_enc=6,
-        p_dropout=0.0,
-        n_blocks_dec=12,
-        kernel_size_dec=5,
-        dilation_rate=5,
-        n_block_layers=4,
-        p_dropout_dec=0.0,
-        n_speakers=0,
-        gin_channels=0,
-        n_split=4,
-        n_sqz=1,
-        sigmoid_scale=False,
-        window_size=None,
-        block_length=None,
-        mean_only=False,
-        hidden_channels_enc=None,
-        hidden_channels_dec=None,
-        prenet=False,
-        **kwargs
-    ):
-
-        super().__init__()
-        self.n_vocab = n_vocab
-        self.hidden_channels = hidden_channels
-        self.filter_channels = filter_channels
-        self.filter_channels_dp = filter_channels_dp
-        self.out_channels = out_channels
-        self.kernel_size = kernel_size
-        self.n_heads = n_heads
-        self.n_layers_enc = n_layers_enc
-        self.p_dropout = p_dropout
-        self.n_blocks_dec = n_blocks_dec
-        self.kernel_size_dec = kernel_size_dec
-        self.dilation_rate = dilation_rate
-        self.n_block_layers = n_block_layers
-        self.p_dropout_dec = p_dropout_dec
-        self.n_speakers = n_speakers
-        self.gin_channels = gin_channels
-        self.n_split = n_split
-        self.n_sqz = n_sqz
-        self.sigmoid_scale = sigmoid_scale
-        self.window_size = window_size
-        self.block_length = block_length
-        self.mean_only = mean_only
-        self.hidden_channels_enc = hidden_channels_enc
-        self.hidden_channels_dec = hidden_channels_dec
-        self.prenet = prenet
-
-        self.encoder = TextEncoder(
-            n_vocab,
-            out_channels,
-            hidden_channels_enc or hidden_channels,
-            filter_channels,
-            filter_channels_dp,
-            n_heads,
-            n_layers_enc,
-            kernel_size,
-            p_dropout,
-            window_size=window_size,
-            block_length=block_length,
-            mean_only=mean_only,
-            prenet=prenet,
-            gin_channels=gin_channels,
-        )
-
-        self.decoder = FlowSpecDecoder(
-            out_channels,
-            hidden_channels_dec or hidden_channels,
-            kernel_size_dec,
-            dilation_rate,
-            n_blocks_dec,
-            n_block_layers,
-            p_dropout=p_dropout_dec,
-            n_split=n_split,
-            n_sqz=n_sqz,
-            sigmoid_scale=sigmoid_scale,
-            gin_channels=gin_channels,
-        )
-
-        if n_speakers > 1:
-            self.emb_g = nn.Embedding(n_speakers, gin_channels)
-            nn.init.uniform_(self.emb_g.weight, -0.1, 0.1)
-
-    def forward(
-        self,
-        x,
-        x_lengths,
-        y=None,
-        y_lengths=None,
-        g=None,
-        gen=False,
-        noise_scale=1.0,
-        length_scale=1.0,
-    ):
-        if g is not None:
-            g = F.normalize(self.emb_g(g)).unsqueeze(-1)  # [b, h]
-        x_m, x_logs, logw, x_mask = self.encoder(x, x_lengths, g=g)
-
-        if gen:
-            w = torch.exp(logw) * x_mask * length_scale
-            w_ceil = torch.ceil(w)
-            y_lengths = torch.clamp_min(torch.sum(w_ceil, [1, 2]), 1).long()
-            y_max_length = None
-        else:
-            y_max_length = y.size(2)
-        y, y_lengths, y_max_length = self.preprocess(y, y_lengths, y_max_length)
-        z_mask = torch.unsqueeze(commons.sequence_mask(y_lengths, y_max_length), 1).to(
-            x_mask.dtype
-        )
-        attn_mask = torch.unsqueeze(x_mask, -1) * torch.unsqueeze(z_mask, 2)
-
-        if gen:
-            attn = commons.generate_path(
-                w_ceil.squeeze(1), attn_mask.squeeze(1)
-            ).unsqueeze(1)
-            z_m = torch.matmul(
-                attn.squeeze(1).transpose(1, 2), x_m.transpose(1, 2)
-            ).transpose(
-                1, 2
-            )  # [b, t', t], [b, t, d] -> [b, d, t']
-            z_logs = torch.matmul(
-                attn.squeeze(1).transpose(1, 2), x_logs.transpose(1, 2)
-            ).transpose(
-                1, 2
-            )  # [b, t', t], [b, t, d] -> [b, d, t']
-            logw_ = torch.log(1e-8 + torch.sum(attn, -1)) * x_mask
-
-            z = (z_m + torch.exp(z_logs) * torch.randn_like(z_m) * noise_scale) * z_mask
-            y, logdet = self.decoder(z, z_mask, g=g, reverse=True)
-            return (
-                (y, z_m, z_logs, logdet, z_mask),
-                (x_m, x_logs, x_mask),
-                (attn, logw, logw_),
-            )
-        else:
-            z, logdet = self.decoder(y, z_mask, g=g, reverse=False)
-            with torch.no_grad():
-                x_s_sq_r = torch.exp(-2 * x_logs)
-                logp1 = torch.sum(-0.5 * math.log(2 * math.pi) - x_logs, [1]).unsqueeze(
-                    -1
-                )  # [b, t, 1]
-                logp2 = torch.matmul(
-                    x_s_sq_r.transpose(1, 2), -0.5 * (z ** 2)
-                )  # [b, t, d] x [b, d, t'] = [b, t, t']
-                logp3 = torch.matmul(
-                    (x_m * x_s_sq_r).transpose(1, 2), z
-                )  # [b, t, d] x [b, d, t'] = [b, t, t']
-                logp4 = torch.sum(-0.5 * (x_m ** 2) * x_s_sq_r, [1]).unsqueeze(
-                    -1
-                )  # [b, t, 1]
-                logp = logp1 + logp2 + logp3 + logp4  # [b, t, t']
-
-                attn = (
-                    monotonic_align.maximum_path(logp, attn_mask.squeeze(1))
-                    .unsqueeze(1)
-                    .detach()
-                )
-            z_m = torch.matmul(
-                attn.squeeze(1).transpose(1, 2), x_m.transpose(1, 2)
-            ).transpose(
-                1, 2
-            )  # [b, t', t], [b, t, d] -> [b, d, t']
-            z_logs = torch.matmul(
-                attn.squeeze(1).transpose(1, 2), x_logs.transpose(1, 2)
-            ).transpose(
-                1, 2
-            )  # [b, t', t], [b, t, d] -> [b, d, t']
-            logw_ = torch.log(1e-8 + torch.sum(attn, -1)) * x_mask
-            return (
-                (z, z_m, z_logs, logdet, z_mask),
-                (x_m, x_logs, x_mask),
-                (attn, logw, logw_),
-            )
-
-    def preprocess(self, y, y_lengths, y_max_length):
-        if y_max_length is not None:
-            y_max_length = (y_max_length // self.n_sqz) * self.n_sqz
-            y = y[:, :, :y_max_length]
-        y_lengths = (y_lengths // self.n_sqz) * self.n_sqz
-        return y, y_lengths, y_max_length
-
-    def store_inverse(self):
-        self.decoder.store_inverse()
diff --git a/spaces/Hina4867/bingo/src/components/learn-more.tsx b/spaces/Hina4867/bingo/src/components/learn-more.tsx
deleted file mode 100644
index a64459ee7900a612292e117a6bda96ee9260990f..0000000000000000000000000000000000000000
--- a/spaces/Hina4867/bingo/src/components/learn-more.tsx
+++ /dev/null
@@ -1,39 +0,0 @@
-import React from 'react'
-import { SourceAttribution } from '@/lib/bots/bing/types'
-
-export interface LearnMoreProps {
-  sourceAttributions?: SourceAttribution[]
-}
-
-export function LearnMore({ sourceAttributions }: LearnMoreProps) {
-  if (!sourceAttributions?.length) {
-    return null
-  }
-
-  return (
-    <div className="learn-more-root" role="list" aria-label="了解详细信息:">
-      <div className="learn-more">了解详细信息:</div>
-      <div className="attribution-container">
-        <div className="attribution-items">
-          {sourceAttributions.map((attribution, index) => {
-            const { providerDisplayName, seeMoreUrl } = attribution
-            const { host } = new URL(seeMoreUrl)
-            return (
-              <a
-                key={index}
-                className="attribution-item"
-                target="_blank"
-                role="listitem"
-                href={seeMoreUrl}
-                title={providerDisplayName}
-                tabIndex={index}
-              >
-                {index + 1}. {host}
-              </a>
-            )
-          })}
-        </div>
-      </div>
-    </div>
-  )
-}
diff --git a/spaces/ICML2022/OFA/fairseq/fairseq/models/roberta/model.py b/spaces/ICML2022/OFA/fairseq/fairseq/models/roberta/model.py
deleted file mode 100644
index bb205b910daaecd55effd1e77e77d0b43952624f..0000000000000000000000000000000000000000
--- a/spaces/ICML2022/OFA/fairseq/fairseq/models/roberta/model.py
+++ /dev/null
@@ -1,594 +0,0 @@
-# Copyright (c) Facebook, Inc. and its affiliates.
-#
-# This source code is licensed under the MIT license found in the
-# LICENSE file in the root directory of this source tree.
-"""
-RoBERTa: A Robustly Optimized BERT Pretraining Approach.
-"""
-
-import logging
-
-import torch
-import torch.nn as nn
-import torch.nn.functional as F
-from fairseq import utils
-from fairseq.models import (
-    FairseqEncoder,
-    FairseqEncoderModel,
-    register_model,
-    register_model_architecture,
-)
-from fairseq.models.transformer import DEFAULT_MIN_PARAMS_TO_WRAP, TransformerEncoder
-from fairseq.modules import LayerNorm
-from fairseq.modules.quant_noise import quant_noise as apply_quant_noise_
-from fairseq.modules.transformer_sentence_encoder import init_bert_params
-from fairseq.utils import safe_getattr, safe_hasattr
-
-from .hub_interface import RobertaHubInterface
-
-
-logger = logging.getLogger(__name__)
-
-
-@register_model("roberta")
-class RobertaModel(FairseqEncoderModel):
-    @classmethod
-    def hub_models(cls):
-        return {
-            "roberta.base": "http://dl.fbaipublicfiles.com/fairseq/models/roberta.base.tar.gz",
-            "roberta.large": "http://dl.fbaipublicfiles.com/fairseq/models/roberta.large.tar.gz",
-            "roberta.large.mnli": "http://dl.fbaipublicfiles.com/fairseq/models/roberta.large.mnli.tar.gz",
-            "roberta.large.wsc": "http://dl.fbaipublicfiles.com/fairseq/models/roberta.large.wsc.tar.gz",
-        }
-
-    def __init__(self, args, encoder):
-        super().__init__(encoder)
-        self.args = args
-
-        # We follow BERT's random weight initialization
-        self.apply(init_bert_params)
-
-        self.classification_heads = nn.ModuleDict()
-
-    @staticmethod
-    def add_args(parser):
-        """Add model-specific arguments to the parser."""
-        parser.add_argument(
-            "--encoder-layers", type=int, metavar="L", help="num encoder layers"
-        )
-        parser.add_argument(
-            "--encoder-embed-dim",
-            type=int,
-            metavar="H",
-            help="encoder embedding dimension",
-        )
-        parser.add_argument(
-            "--encoder-ffn-embed-dim",
-            type=int,
-            metavar="F",
-            help="encoder embedding dimension for FFN",
-        )
-        parser.add_argument(
-            "--encoder-attention-heads",
-            type=int,
-            metavar="A",
-            help="num encoder attention heads",
-        )
-        parser.add_argument(
-            "--activation-fn",
-            choices=utils.get_available_activation_fns(),
-            help="activation function to use",
-        )
-        parser.add_argument(
-            "--pooler-activation-fn",
-            choices=utils.get_available_activation_fns(),
-            help="activation function to use for pooler layer",
-        )
-        parser.add_argument(
-            "--encoder-normalize-before",
-            action="store_true",
-            help="apply layernorm before each encoder block",
-        )
-        parser.add_argument(
-            "--layernorm-embedding",
-            action="store_true",
-            help="add layernorm to embedding",
-        )
-        parser.add_argument(
-            "--dropout", type=float, metavar="D", help="dropout probability"
-        )
-        parser.add_argument(
-            "--attention-dropout",
-            type=float,
-            metavar="D",
-            help="dropout probability for attention weights",
-        )
-        parser.add_argument(
-            "--activation-dropout",
-            type=float,
-            metavar="D",
-            help="dropout probability after activation in FFN",
-        )
-        parser.add_argument(
-            "--pooler-dropout",
-            type=float,
-            metavar="D",
-            help="dropout probability in the masked_lm pooler layers",
-        )
-        parser.add_argument(
-            "--max-positions", type=int, help="number of positional embeddings to learn"
-        )
-        parser.add_argument(
-            "--load-checkpoint-heads",
-            action="store_true",
-            help="(re-)register and load heads when loading checkpoints",
-        )
-        parser.add_argument(
-            "--untie-weights-roberta",
-            action="store_true",
-            help="Untie weights between embeddings and classifiers in RoBERTa",
-        )
-        # args for "Reducing Transformer Depth on Demand with Structured Dropout" (Fan et al., 2019)
-        parser.add_argument(
-            "--encoder-layerdrop",
-            type=float,
-            metavar="D",
-            default=0,
-            help="LayerDrop probability for encoder",
-        )
-        parser.add_argument(
-            "--encoder-layers-to-keep",
-            default=None,
-            help="which layers to *keep* when pruning as a comma-separated list",
-        )
-        # args for Training with Quantization Noise for Extreme Model Compression ({Fan*, Stock*} et al., 2020)
-        parser.add_argument(
-            "--quant-noise-pq",
-            type=float,
-            metavar="D",
-            default=0,
-            help="iterative PQ quantization noise at training time",
-        )
-        parser.add_argument(
-            "--quant-noise-pq-block-size",
-            type=int,
-            metavar="D",
-            default=8,
-            help="block size of quantization noise at training time",
-        )
-        parser.add_argument(
-            "--quant-noise-scalar",
-            type=float,
-            metavar="D",
-            default=0,
-            help="scalar quantization noise and scalar quantization at training time",
-        )
-        # args for "Better Fine-Tuning by Reducing Representational Collapse" (Aghajanyan et al. 2020)
-        parser.add_argument(
-            "--spectral-norm-classification-head",
-            action="store_true",
-            default=False,
-            help="Apply spectral normalization on the classification head",
-        )
-        # args for Fully Sharded Data Parallel (FSDP) training
-        parser.add_argument(
-            "--min-params-to-wrap",
-            type=int,
-            metavar="D",
-            default=DEFAULT_MIN_PARAMS_TO_WRAP,
-            help=(
-                "minimum number of params for a layer to be wrapped with FSDP() when "
-                "training with --ddp-backend=fully_sharded. Smaller values will "
-                "improve memory efficiency, but may make torch.distributed "
-                "communication less efficient due to smaller input sizes. This option "
-                "is set to 0 (i.e., always wrap) when --checkpoint-activations or "
-                "--offload-activations are passed."
-            )
-        )
-
-    @classmethod
-    def build_model(cls, args, task):
-        """Build a new model instance."""
-
-        from omegaconf import OmegaConf
-
-        if OmegaConf.is_config(args):
-            OmegaConf.set_struct(args, False)
-
-        # make sure all arguments are present
-        base_architecture(args)
-
-        if not safe_hasattr(args, "max_positions"):
-            if not safe_hasattr(args, "tokens_per_sample"):
-                args.tokens_per_sample = task.max_positions()
-            args.max_positions = args.tokens_per_sample
-
-        encoder = RobertaEncoder(args, task.source_dictionary)
-
-        if OmegaConf.is_config(args):
-            OmegaConf.set_struct(args, True)
-
-        return cls(args, encoder)
-
-    def forward(
-        self,
-        src_tokens,
-        features_only=False,
-        return_all_hiddens=False,
-        classification_head_name=None,
-        **kwargs,
-    ):
-        if classification_head_name is not None:
-            features_only = True
-
-        x, extra = self.encoder(src_tokens, features_only, return_all_hiddens, **kwargs)
-
-        if classification_head_name is not None:
-            x = self.classification_heads[classification_head_name](x)
-        return x, extra
-
-    def get_normalized_probs(self, net_output, log_probs, sample=None):
-        """Get normalized probabilities (or log probs) from a net's output."""
-        logits = net_output[0].float()
-        if log_probs:
-            return F.log_softmax(logits, dim=-1)
-        else:
-            return F.softmax(logits, dim=-1)
-
-    def register_classification_head(
-        self, name, num_classes=None, inner_dim=None, **kwargs
-    ):
-        """Register a classification head."""
-        if name in self.classification_heads:
-            prev_num_classes = self.classification_heads[name].out_proj.out_features
-            prev_inner_dim = self.classification_heads[name].dense.out_features
-            if num_classes != prev_num_classes or inner_dim != prev_inner_dim:
-                logger.warning(
-                    're-registering head "{}" with num_classes {} (prev: {}) '
-                    "and inner_dim {} (prev: {})".format(
-                        name, num_classes, prev_num_classes, inner_dim, prev_inner_dim
-                    )
-                )
-        self.classification_heads[name] = RobertaClassificationHead(
-            input_dim=self.args.encoder_embed_dim,
-            inner_dim=inner_dim or self.args.encoder_embed_dim,
-            num_classes=num_classes,
-            activation_fn=self.args.pooler_activation_fn,
-            pooler_dropout=self.args.pooler_dropout,
-            q_noise=self.args.quant_noise_pq,
-            qn_block_size=self.args.quant_noise_pq_block_size,
-            do_spectral_norm=self.args.spectral_norm_classification_head,
-        )
-
-    @property
-    def supported_targets(self):
-        return {"self"}
-
-    @classmethod
-    def from_pretrained(
-        cls,
-        model_name_or_path,
-        checkpoint_file="model.pt",
-        data_name_or_path=".",
-        bpe="gpt2",
-        **kwargs,
-    ):
-        from fairseq import hub_utils
-
-        x = hub_utils.from_pretrained(
-            model_name_or_path,
-            checkpoint_file,
-            data_name_or_path,
-            archive_map=cls.hub_models(),
-            bpe=bpe,
-            load_checkpoint_heads=True,
-            **kwargs,
-        )
-
-        logger.info(x["args"])
-        return RobertaHubInterface(x["args"], x["task"], x["models"][0])
-
-    def upgrade_state_dict_named(self, state_dict, name):
-        prefix = name + "." if name != "" else ""
-
-        # rename decoder -> encoder before upgrading children modules
-        for k in list(state_dict.keys()):
-            if k.startswith(prefix + "decoder"):
-                new_k = prefix + "encoder" + k[len(prefix + "decoder") :]
-                state_dict[new_k] = state_dict[k]
-                del state_dict[k]
-
-        # rename emb_layer_norm -> layernorm_embedding
-        for k in list(state_dict.keys()):
-            if ".emb_layer_norm." in k:
-                new_k = k.replace(".emb_layer_norm.", ".layernorm_embedding.")
-                state_dict[new_k] = state_dict[k]
-                del state_dict[k]
-
-        # upgrade children modules
-        super().upgrade_state_dict_named(state_dict, name)
-
-        # Handle new classification heads present in the state dict.
-        current_head_names = (
-            []
-            if not hasattr(self, "classification_heads")
-            else self.classification_heads.keys()
-        )
-        keys_to_delete = []
-        for k in state_dict.keys():
-            if not k.startswith(prefix + "classification_heads."):
-                continue
-
-            head_name = k[len(prefix + "classification_heads.") :].split(".")[0]
-            num_classes = state_dict[
-                prefix + "classification_heads." + head_name + ".out_proj.weight"
-            ].size(0)
-            inner_dim = state_dict[
-                prefix + "classification_heads." + head_name + ".dense.weight"
-            ].size(0)
-
-            if getattr(self.args, "load_checkpoint_heads", False):
-                if head_name not in current_head_names:
-                    self.register_classification_head(head_name, num_classes, inner_dim)
-            else:
-                if head_name not in current_head_names:
-                    logger.warning(
-                        "deleting classification head ({}) from checkpoint "
-                        "not present in current model: {}".format(head_name, k)
-                    )
-                    keys_to_delete.append(k)
-                elif (
-                    num_classes
-                    != self.classification_heads[head_name].out_proj.out_features
-                    or inner_dim
-                    != self.classification_heads[head_name].dense.out_features
-                ):
-                    logger.warning(
-                        "deleting classification head ({}) from checkpoint "
-                        "with different dimensions than current model: {}".format(
-                            head_name, k
-                        )
-                    )
-                    keys_to_delete.append(k)
-        for k in keys_to_delete:
-            del state_dict[k]
-
-        # Copy any newly-added classification heads into the state dict
-        # with their current weights.
-        if hasattr(self, "classification_heads"):
-            cur_state = self.classification_heads.state_dict()
-            for k, v in cur_state.items():
-                if prefix + "classification_heads." + k not in state_dict:
-                    logger.info("Overwriting " + prefix + "classification_heads." + k)
-                    state_dict[prefix + "classification_heads." + k] = v
-
-
-class RobertaLMHead(nn.Module):
-    """Head for masked language modeling."""
-
-    def __init__(self, embed_dim, output_dim, activation_fn, weight=None):
-        super().__init__()
-        self.dense = nn.Linear(embed_dim, embed_dim)
-        self.activation_fn = utils.get_activation_fn(activation_fn)
-        self.layer_norm = LayerNorm(embed_dim)
-
-        if weight is None:
-            weight = nn.Linear(embed_dim, output_dim, bias=False).weight
-        self.weight = weight
-        self.bias = nn.Parameter(torch.zeros(output_dim))
-
-    def forward(self, features, masked_tokens=None, **kwargs):
-        # Only project the masked tokens while training,
-        # saves both memory and computation
-        if masked_tokens is not None:
-            features = features[masked_tokens, :]
-
-        x = self.dense(features)
-        x = self.activation_fn(x)
-        x = self.layer_norm(x)
-        # project back to size of vocabulary with bias
-        x = F.linear(x, self.weight) + self.bias
-        return x
-
-
-class RobertaClassificationHead(nn.Module):
-    """Head for sentence-level classification tasks."""
-
-    def __init__(
-        self,
-        input_dim,
-        inner_dim,
-        num_classes,
-        activation_fn,
-        pooler_dropout,
-        q_noise=0,
-        qn_block_size=8,
-        do_spectral_norm=False,
-    ):
-        super().__init__()
-        self.dense = nn.Linear(input_dim, inner_dim)
-        self.activation_fn = utils.get_activation_fn(activation_fn)
-        self.dropout = nn.Dropout(p=pooler_dropout)
-        self.out_proj = apply_quant_noise_(
-            nn.Linear(inner_dim, num_classes), q_noise, qn_block_size
-        )
-        if do_spectral_norm:
-            if q_noise != 0:
-                raise NotImplementedError(
-                    "Attempting to use Spectral Normalization with Quant Noise. This is not officially supported"
-                )
-            self.out_proj = torch.nn.utils.spectral_norm(self.out_proj)
-
-    def forward(self, features, **kwargs):
-        x = features[:, 0, :]  # take <s> token (equiv. to [CLS])
-        x = self.dropout(x)
-        x = self.dense(x)
-        x = self.activation_fn(x)
-        x = self.dropout(x)
-        x = self.out_proj(x)
-        return x
-
-
-class RobertaEncoder(FairseqEncoder):
-    """RoBERTa encoder."""
-
-    def __init__(self, args, dictionary):
-        super().__init__(dictionary)
-
-        # set any missing default values
-        base_architecture(args)
-        self.args = args
-
-        if args.encoder_layers_to_keep:
-            args.encoder_layers = len(args.encoder_layers_to_keep.split(","))
-
-        embed_tokens = self.build_embedding(
-            len(dictionary), args.encoder_embed_dim, dictionary.pad()
-        )
-
-        self.sentence_encoder = self.build_encoder(args, dictionary, embed_tokens)
-
-        self.lm_head = self.build_lm_head(
-            embed_dim=args.encoder_embed_dim,
-            output_dim=len(dictionary),
-            activation_fn=args.activation_fn,
-            weight=(
-                self.sentence_encoder.embed_tokens.weight
-                if not args.untie_weights_roberta
-                else None
-            ),
-        )
-
-    def build_embedding(self, vocab_size, embedding_dim, padding_idx):
-        return nn.Embedding(vocab_size, embedding_dim, padding_idx)
-
-    def build_encoder(self, args, dictionary, embed_tokens):
-        encoder = TransformerEncoder(args, dictionary, embed_tokens)
-        encoder.apply(init_bert_params)
-        return encoder
-
-    def build_lm_head(self, embed_dim, output_dim, activation_fn, weight):
-        return RobertaLMHead(embed_dim, output_dim, activation_fn, weight)
-
-    def forward(
-        self,
-        src_tokens,
-        features_only=False,
-        return_all_hiddens=False,
-        masked_tokens=None,
-        **unused,
-    ):
-        """
-        Args:
-            src_tokens (LongTensor): input tokens of shape `(batch, src_len)`
-            features_only (bool, optional): skip LM head and just return
-                features. If True, the output will be of shape
-                `(batch, src_len, embed_dim)`.
-            return_all_hiddens (bool, optional): also return all of the
-                intermediate hidden states (default: False).
-
-        Returns:
-            tuple:
-                - the LM output of shape `(batch, src_len, vocab)`
-                - a dictionary of additional data, where 'inner_states'
-                  is a list of hidden states. Note that the hidden
-                  states have shape `(src_len, batch, vocab)`.
-        """
-        x, extra = self.extract_features(
-            src_tokens, return_all_hiddens=return_all_hiddens
-        )
-        if not features_only:
-            x = self.output_layer(x, masked_tokens=masked_tokens)
-        return x, extra
-
-    def extract_features(self, src_tokens, return_all_hiddens=False, **kwargs):
-        encoder_out = self.sentence_encoder(
-            src_tokens,
-            return_all_hiddens=return_all_hiddens,
-            token_embeddings=kwargs.get("token_embeddings", None),
-        )
-        # T x B x C -> B x T x C
-        features = encoder_out["encoder_out"][0].transpose(0, 1)
-        inner_states = encoder_out["encoder_states"] if return_all_hiddens else None
-        return features, {"inner_states": inner_states}
-
-    def output_layer(self, features, masked_tokens=None, **unused):
-        return self.lm_head(features, masked_tokens)
-
-    def max_positions(self):
-        """Maximum output length supported by the encoder."""
-        return self.args.max_positions
-
-
-@register_model_architecture("roberta", "roberta")
-def base_architecture(args):
-    args.encoder_layers = safe_getattr(args, "encoder_layers", 12)
-    args.encoder_embed_dim = safe_getattr(args, "encoder_embed_dim", 768)
-    args.encoder_ffn_embed_dim = safe_getattr(args, "encoder_ffn_embed_dim", 3072)
-    args.encoder_attention_heads = safe_getattr(args, "encoder_attention_heads", 12)
-
-    args.dropout = safe_getattr(args, "dropout", 0.1)
-    args.attention_dropout = safe_getattr(args, "attention_dropout", 0.1)
-    args.activation_dropout = safe_getattr(args, "activation_dropout", 0.0)
-    args.pooler_dropout = safe_getattr(args, "pooler_dropout", 0.0)
-
-    args.max_source_positions = safe_getattr(args, "max_positions", 512)
-    args.no_token_positional_embeddings = safe_getattr(
-        args, "no_token_positional_embeddings", False
-    )
-
-    # BERT has a few structural differences compared to the original Transformer
-    args.encoder_learned_pos = safe_getattr(args, "encoder_learned_pos", True)
-    args.layernorm_embedding = safe_getattr(args, "layernorm_embedding", True)
-    args.no_scale_embedding = safe_getattr(args, "no_scale_embedding", True)
-    args.activation_fn = safe_getattr(args, "activation_fn", "gelu")
-    args.encoder_normalize_before = safe_getattr(args, "encoder_normalize_before", False)
-    args.pooler_activation_fn = safe_getattr(args, "pooler_activation_fn", "tanh")
-    args.untie_weights_roberta = safe_getattr(args, "untie_weights_roberta", False)
-
-    # Adaptive input config
-    args.adaptive_input = safe_getattr(args, "adaptive_input", False)
-
-    # LayerDrop config
-    args.encoder_layerdrop = safe_getattr(args, "encoder_layerdrop", 0.0)
-    args.encoder_layers_to_keep = safe_getattr(args, "encoder_layers_to_keep", None)
-
-    # Quantization noise config
-    args.quant_noise_pq = safe_getattr(args, "quant_noise_pq", 0)
-    args.quant_noise_pq_block_size = safe_getattr(args, "quant_noise_pq_block_size", 8)
-    args.quant_noise_scalar = safe_getattr(args, "quant_noise_scalar", 0)
-
-    # R4F config
-    args.spectral_norm_classification_head = safe_getattr(
-        args, "spectral_norm_classification_head", False
-    )
-
-
-@register_model_architecture("roberta", "roberta_prenorm")
-def roberta_prenorm_architecture(args):
-    args.layernorm_embedding = safe_getattr(args, "layernorm_embedding", False)
-    args.encoder_normalize_before = safe_getattr(args, "encoder_normalize_before", True)
-    base_architecture(args)
-
-
-@register_model_architecture("roberta", "roberta_base")
-def roberta_base_architecture(args):
-    base_architecture(args)
-
-
-@register_model_architecture("roberta", "roberta_large")
-def roberta_large_architecture(args):
-    args.encoder_layers = safe_getattr(args, "encoder_layers", 24)
-    args.encoder_embed_dim = safe_getattr(args, "encoder_embed_dim", 1024)
-    args.encoder_ffn_embed_dim = safe_getattr(args, "encoder_ffn_embed_dim", 4096)
-    args.encoder_attention_heads = safe_getattr(args, "encoder_attention_heads", 16)
-    base_architecture(args)
-
-
-@register_model_architecture("roberta", "xlm")
-def xlm_architecture(args):
-    args.encoder_layers = safe_getattr(args, "encoder_layers", 16)
-    args.encoder_embed_dim = safe_getattr(args, "encoder_embed_dim", 1280)
-    args.encoder_ffn_embed_dim = safe_getattr(args, "encoder_ffn_embed_dim", 1280 * 4)
-    args.encoder_attention_heads = safe_getattr(args, "encoder_attention_heads", 16)
-    base_architecture(args)
diff --git a/spaces/ICML2022/OFA/fairseq/fairseq/tasks/__init__.py b/spaces/ICML2022/OFA/fairseq/fairseq/tasks/__init__.py
deleted file mode 100644
index 9a46b012c573a76e00e489307720fc3fa462c296..0000000000000000000000000000000000000000
--- a/spaces/ICML2022/OFA/fairseq/fairseq/tasks/__init__.py
+++ /dev/null
@@ -1,136 +0,0 @@
-# Copyright (c) Facebook, Inc. and its affiliates.
-#
-# This source code is licensed under the MIT license found in the
-# LICENSE file in the root directory of this source tree.
-"""isort:skip_file"""
-
-import argparse
-import importlib
-import os
-
-from fairseq.dataclass import FairseqDataclass
-from fairseq.dataclass.utils import merge_with_parent
-from hydra.core.config_store import ConfigStore
-
-from .fairseq_task import FairseqTask, LegacyFairseqTask  # noqa
-
-
-# register dataclass
-TASK_DATACLASS_REGISTRY = {}
-TASK_REGISTRY = {}
-TASK_CLASS_NAMES = set()
-
-
-def setup_task(cfg: FairseqDataclass, **kwargs):
-    task = None
-    task_name = getattr(cfg, "task", None)
-
-    if isinstance(task_name, str):
-        # legacy tasks
-        task = TASK_REGISTRY[task_name]
-        if task_name in TASK_DATACLASS_REGISTRY:
-            dc = TASK_DATACLASS_REGISTRY[task_name]
-            cfg = dc.from_namespace(cfg)
-    else:
-        task_name = getattr(cfg, "_name", None)
-
-        if task_name and task_name in TASK_DATACLASS_REGISTRY:
-            dc = TASK_DATACLASS_REGISTRY[task_name]
-            cfg = merge_with_parent(dc(), cfg)
-            task = TASK_REGISTRY[task_name]
-
-    assert (
-        task is not None
-    ), f"Could not infer task type from {cfg}. Available argparse tasks: {TASK_REGISTRY.keys()}. Available hydra tasks: {TASK_DATACLASS_REGISTRY.keys()}"
-
-    return task.setup_task(cfg, **kwargs)
-
-
-def register_task(name, dataclass=None):
-    """
-    New tasks can be added to fairseq with the
-    :func:`~fairseq.tasks.register_task` function decorator.
-
-    For example::
-
-        @register_task('classification')
-        class ClassificationTask(FairseqTask):
-            (...)
-
-    .. note::
-
-        All Tasks must implement the :class:`~fairseq.tasks.FairseqTask`
-        interface.
-
-    Args:
-        name (str): the name of the task
-    """
-
-    def register_task_cls(cls):
-        if name in TASK_REGISTRY:
-            raise ValueError("Cannot register duplicate task ({})".format(name))
-        if not issubclass(cls, FairseqTask):
-            raise ValueError(
-                "Task ({}: {}) must extend FairseqTask".format(name, cls.__name__)
-            )
-        if cls.__name__ in TASK_CLASS_NAMES:
-            raise ValueError(
-                "Cannot register task with duplicate class name ({})".format(
-                    cls.__name__
-                )
-            )
-        TASK_REGISTRY[name] = cls
-        TASK_CLASS_NAMES.add(cls.__name__)
-
-        if dataclass is not None and not issubclass(dataclass, FairseqDataclass):
-            raise ValueError(
-                "Dataclass {} must extend FairseqDataclass".format(dataclass)
-            )
-
-        cls.__dataclass = dataclass
-        if dataclass is not None:
-            TASK_DATACLASS_REGISTRY[name] = dataclass
-
-            cs = ConfigStore.instance()
-            node = dataclass()
-            node._name = name
-            cs.store(name=name, group="task", node=node, provider="fairseq")
-
-        return cls
-
-    return register_task_cls
-
-
-def get_task(name):
-    return TASK_REGISTRY[name]
-
-
-def import_tasks(tasks_dir, namespace):
-    for file in os.listdir(tasks_dir):
-        path = os.path.join(tasks_dir, file)
-        if (
-            not file.startswith("_")
-            and not file.startswith(".")
-            and (file.endswith(".py") or os.path.isdir(path))
-        ):
-            task_name = file[: file.find(".py")] if file.endswith(".py") else file
-            importlib.import_module(namespace + "." + task_name)
-
-            # expose `task_parser` for sphinx
-            if task_name in TASK_REGISTRY:
-                parser = argparse.ArgumentParser(add_help=False)
-                group_task = parser.add_argument_group("Task name")
-                # fmt: off
-                group_task.add_argument('--task', metavar=task_name,
-                                        help='Enable this task with: ``--task=' + task_name + '``')
-                # fmt: on
-                group_args = parser.add_argument_group(
-                    "Additional command-line arguments"
-                )
-                TASK_REGISTRY[task_name].add_args(group_args)
-                globals()[task_name + "_parser"] = parser
-
-
-# automatically import any Python files in the tasks/ directory
-tasks_dir = os.path.dirname(__file__)
-import_tasks(tasks_dir, "fairseq.tasks")
diff --git a/spaces/Ikaros521/moe-tts/text/sanskrit.py b/spaces/Ikaros521/moe-tts/text/sanskrit.py
deleted file mode 100644
index 0223aaac384a2f850f5bc20651fc18eb964607d0..0000000000000000000000000000000000000000
--- a/spaces/Ikaros521/moe-tts/text/sanskrit.py
+++ /dev/null
@@ -1,62 +0,0 @@
-import re
-from indic_transliteration import sanscript
-
-
-# List of (iast, ipa) pairs:
-_iast_to_ipa = [(re.compile('%s' % x[0]), x[1]) for x in [
-    ('a', 'ə'),
-    ('ā', 'aː'),
-    ('ī', 'iː'),
-    ('ū', 'uː'),
-    ('ṛ', 'ɹ`'),
-    ('ṝ', 'ɹ`ː'),
-    ('ḷ', 'l`'),
-    ('ḹ', 'l`ː'),
-    ('e', 'eː'),
-    ('o', 'oː'),
-    ('k', 'k⁼'),
-    ('k⁼h', 'kʰ'),
-    ('g', 'g⁼'),
-    ('g⁼h', 'gʰ'),
-    ('ṅ', 'ŋ'),
-    ('c', 'ʧ⁼'),
-    ('ʧ⁼h', 'ʧʰ'),
-    ('j', 'ʥ⁼'),
-    ('ʥ⁼h', 'ʥʰ'),
-    ('ñ', 'n^'),
-    ('ṭ', 't`⁼'),
-    ('t`⁼h', 't`ʰ'),
-    ('ḍ', 'd`⁼'),
-    ('d`⁼h', 'd`ʰ'),
-    ('ṇ', 'n`'),
-    ('t', 't⁼'),
-    ('t⁼h', 'tʰ'),
-    ('d', 'd⁼'),
-    ('d⁼h', 'dʰ'),
-    ('p', 'p⁼'),
-    ('p⁼h', 'pʰ'),
-    ('b', 'b⁼'),
-    ('b⁼h', 'bʰ'),
-    ('y', 'j'),
-    ('ś', 'ʃ'),
-    ('ṣ', 's`'),
-    ('r', 'ɾ'),
-    ('l̤', 'l`'),
-    ('h', 'ɦ'),
-    ("'", ''),
-    ('~', '^'),
-    ('ṃ', '^')
-]]
-
-
-def devanagari_to_ipa(text):
-    text = text.replace('ॐ', 'ओम्')
-    text = re.sub(r'\s*।\s*$', '.', text)
-    text = re.sub(r'\s*।\s*', ', ', text)
-    text = re.sub(r'\s*॥', '.', text)
-    text = sanscript.transliterate(text, sanscript.DEVANAGARI, sanscript.IAST)
-    for regex, replacement in _iast_to_ipa:
-        text = re.sub(regex, replacement, text)
-    text = re.sub('(.)[`ː]*ḥ', lambda x: x.group(0)
-                  [:-1]+'h'+x.group(1)+'*', text)
-    return text
diff --git a/spaces/ItsJayQz/GTA5_Artwork_Diffusion/app.py b/spaces/ItsJayQz/GTA5_Artwork_Diffusion/app.py
deleted file mode 100644
index b7c6b7f310646f720b115d1c0b270e4009548655..0000000000000000000000000000000000000000
--- a/spaces/ItsJayQz/GTA5_Artwork_Diffusion/app.py
+++ /dev/null
@@ -1,137 +0,0 @@
-from diffusers import StableDiffusionPipeline, StableDiffusionImg2ImgPipeline, DPMSolverMultistepScheduler
-import gradio as gr
-import torch
-from PIL import Image
-
-model_id = 'ItsJayQz/GTA5_Artwork_Diffusion'
-prefix = 'gtav style'
-     
-scheduler = DPMSolverMultistepScheduler.from_pretrained(model_id, subfolder="scheduler")
-
-pipe = StableDiffusionPipeline.from_pretrained(
-  model_id,
-  torch_dtype=torch.float16 if torch.cuda.is_available() else torch.float32,
-  scheduler=scheduler)
-
-pipe_i2i = StableDiffusionImg2ImgPipeline.from_pretrained(
-  model_id,
-  torch_dtype=torch.float16 if torch.cuda.is_available() else torch.float32,
-  scheduler=scheduler)
-
-if torch.cuda.is_available():
-  pipe = pipe.to("cuda")
-  pipe_i2i = pipe_i2i.to("cuda")
-
-def error_str(error, title="Error"):
-    return f"""#### {title}
-            {error}"""  if error else ""
-
-def inference(prompt, guidance, steps, width=512, height=512, seed=0, img=None, strength=0.5, neg_prompt="", auto_prefix=False):
-
-  generator = torch.Generator('cuda').manual_seed(seed) if seed != 0 else None
-  prompt = f"{prefix} {prompt}" if auto_prefix else prompt
-
-  try:
-    if img is not None:
-      return img_to_img(prompt, neg_prompt, img, strength, guidance, steps, width, height, generator), None
-    else:
-      return txt_to_img(prompt, neg_prompt, guidance, steps, width, height, generator), None
-  except Exception as e:
-    return None, error_str(e)
-
-def txt_to_img(prompt, neg_prompt, guidance, steps, width, height, generator):
-
-    result = pipe(
-      prompt,
-      negative_prompt = neg_prompt,
-      num_inference_steps = int(steps),
-      guidance_scale = guidance,
-      width = width,
-      height = height,
-      generator = generator)
-    
-    return result.images[0]
-
-def img_to_img(prompt, neg_prompt, img, strength, guidance, steps, width, height, generator):
-
-    ratio = min(height / img.height, width / img.width)
-    img = img.resize((int(img.width * ratio), int(img.height * ratio)), Image.LANCZOS)
-    result = pipe_i2i(
-        prompt,
-        negative_prompt = neg_prompt,
-        init_image = img,
-        num_inference_steps = int(steps),
-        strength = strength,
-        guidance_scale = guidance,
-        width = width,
-        height = height,
-        generator = generator)
-        
-    return result.images[0]
-
-css = """.main-div div{display:inline-flex;align-items:center;gap:.8rem;font-size:1.75rem}.main-div div h1{font-weight:900;margin-bottom:7px}.main-div p{margin-bottom:10px;font-size:94%}a{text-decoration:underline}.tabs{margin-top:0;margin-bottom:0}#gallery{min-height:20rem}
-"""
-with gr.Blocks(css=css) as demo:
-    gr.HTML(
-        f"""
-            <div class="main-div">
-              <div>
-                <h1>Gta5 Artwork Diffusion</h1>
-              </div>
-              <p>
-               Demo for <a href="https://huggingface.co/ItsJayQz/GTA5_Artwork_Diffusion">Gta5 Artwork Diffusion</a> Stable Diffusion model.<br>
-               {"Add the following tokens to your prompts for the model to work properly: <b>prefix</b>" if prefix else ""}
-              </p>
-              Running on {"<b>GPU 🔥</b>" if torch.cuda.is_available() else f"<b>CPU 🥶</b>. For faster inference it is recommended to <b>upgrade to GPU in <a href='https://huggingface.co/spaces/ItsJayQz/GTA5_Artwork_Diffusion/settings'>Settings</a></b>"} after duplicating the space<br><br>
-              <a style="display:inline-block" href="https://huggingface.co/spaces/ItsJayQz/GTA5_Artwork_Diffusion?duplicate=true"><img src="https://bit.ly/3gLdBN6" alt="Duplicate Space"></a>
-            </div>
-        """
-    )
-    with gr.Row():
-        
-        with gr.Column(scale=55):
-          with gr.Group():
-              with gr.Row():
-                prompt = gr.Textbox(label="Prompt", show_label=False, max_lines=2,placeholder=f"{prefix} [your prompt]").style(container=False)
-                generate = gr.Button(value="Generate").style(rounded=(False, True, True, False))
-
-              image_out = gr.Image(height=512)
-          error_output = gr.Markdown()
-
-        with gr.Column(scale=45):
-          with gr.Tab("Options"):
-            with gr.Group():
-              neg_prompt = gr.Textbox(label="Negative prompt", placeholder="What to exclude from the image")
-              auto_prefix = gr.Checkbox(label="Prefix styling tokens automatically (gtav style)", value=prefix, visible=prefix)
-
-              with gr.Row():
-                guidance = gr.Slider(label="Guidance scale", value=7.5, maximum=15)
-                steps = gr.Slider(label="Steps", value=25, minimum=2, maximum=75, step=1)
-
-              with gr.Row():
-                width = gr.Slider(label="Width", value=512, minimum=64, maximum=1024, step=8)
-                height = gr.Slider(label="Height", value=512, minimum=64, maximum=1024, step=8)
-
-              seed = gr.Slider(0, 2147483647, label='Seed (0 = random)', value=0, step=1)
-
-          with gr.Tab("Image to image"):
-              with gr.Group():
-                image = gr.Image(label="Image", height=256, tool="editor", type="pil")
-                strength = gr.Slider(label="Transformation strength", minimum=0, maximum=1, step=0.01, value=0.5)
-
-    auto_prefix.change(lambda x: gr.update(placeholder=f"{prefix} [your prompt]" if x else "[Your prompt]"), inputs=auto_prefix, outputs=prompt, queue=False)
-
-    inputs = [prompt, guidance, steps, width, height, seed, image, strength, neg_prompt, auto_prefix]
-    outputs = [image_out, error_output]
-    prompt.submit(inference, inputs=inputs, outputs=outputs)
-    generate.click(inference, inputs=inputs, outputs=outputs)
-
-    gr.HTML("""
-    <div style="border-top: 1px solid #303030;">
-      <br>
-      <p>This space was created using <a href="https://huggingface.co/spaces/anzorq/sd-space-creator">SD Space Creator</a>.</p>
-    </div>
-    """)
-
-demo.queue(concurrency_count=1)
-demo.launch()
diff --git a/spaces/JackBAI/master_wlb_index/push.sh b/spaces/JackBAI/master_wlb_index/push.sh
deleted file mode 100644
index 01c140d326fea2501e3eec825ea5a85d11c1a7e9..0000000000000000000000000000000000000000
--- a/spaces/JackBAI/master_wlb_index/push.sh
+++ /dev/null
@@ -1,3 +0,0 @@
-git add .
-git commit -m "auto push"
-git push
diff --git a/spaces/Jackflack09/diffuse-custom/app.py b/spaces/Jackflack09/diffuse-custom/app.py
deleted file mode 100644
index b937f6061ac355648ed8ae4f8b9a9dceec83f46c..0000000000000000000000000000000000000000
--- a/spaces/Jackflack09/diffuse-custom/app.py
+++ /dev/null
@@ -1,345 +0,0 @@
-import os
-import random
-
-import autocuda
-from pyabsa.utils.pyabsa_utils import fprint
-
-from diffusers import AutoencoderKL, UNet2DConditionModel, StableDiffusionPipeline, StableDiffusionImg2ImgPipeline, \
-    DPMSolverMultistepScheduler
-import gradio as gr
-import torch
-from PIL import Image
-import utils
-import datetime
-import time
-import psutil
-from Waifu2x.magnify import ImageMagnifier
-
-magnifier = ImageMagnifier()
-
-start_time = time.time()
-is_colab = utils.is_google_colab()
-
-CUDA_VISIBLE_DEVICES = ''
-device = autocuda.auto_cuda()
-
-dtype = torch.float16 if device != 'cpu' else torch.float32
-
-
-class Model:
-    def __init__(self, name, path="", prefix=""):
-        self.name = name
-        self.path = path
-        self.prefix = prefix
-        self.pipe_t2i = None
-        self.pipe_i2i = None
-
-
-models = [
-     Model("DnD Cover Art", "sd-dreambooth-library/dndcoverart-v1", "Use the token 'dndcoverart'"), 
-     Model("test2", "Jackflack09/mrsrm", "testing2"),
-]
-#  Model("Spider-Verse", "nitrosocke/spider-verse-diffusion", "spiderverse style "),
-#  Model("Balloon Art", "Fictiverse/Stable_Diffusion_BalloonArt_Model", "BalloonArt "),
-#  Model("Elden Ring", "nitrosocke/elden-ring-diffusion", "elden ring style "),
-#  Model("Tron Legacy", "dallinmackay/Tron-Legacy-diffusion", "trnlgcy ")
-# Model("Pokémon", "lambdalabs/sd-pokemon-diffusers", ""),
-# Model("Pony Diffusion", "AstraliteHeart/pony-diffusion", ""),
-# Model("Robo Diffusion", "nousr/robo-diffusion", ""),
-
-scheduler = DPMSolverMultistepScheduler(
-    beta_start=0.00085,
-    beta_end=0.012,
-    beta_schedule="scaled_linear",
-    num_train_timesteps=1000,
-    trained_betas=None,
-    predict_epsilon=True,
-    thresholding=False,
-    algorithm_type="dpmsolver++",
-    solver_type="midpoint",
-    lower_order_final=True,
-)
-
-custom_model = None
-if is_colab:
-    models.insert(0, Model("Custom model"))
-    custom_model = models[0]
-
-last_mode = "txt2img"
-current_model = models[1] if is_colab else models[0]
-current_model_path = current_model.path
-
-if is_colab:
-    pipe = StableDiffusionPipeline.from_pretrained(current_model.path, torch_dtype=dtype, scheduler=scheduler,
-                                                   safety_checker=lambda images, clip_input: (images, False))
-
-else:  # download all models
-    print(f"{datetime.datetime.now()} Downloading vae...")
-    vae = AutoencoderKL.from_pretrained(current_model.path, subfolder="vae", torch_dtype=dtype)
-    for model in models:
-        try:
-            print(f"{datetime.datetime.now()} Downloading {model.name} model...")
-            unet = UNet2DConditionModel.from_pretrained(model.path, subfolder="unet", torch_dtype=dtype)
-            model.pipe_t2i = StableDiffusionPipeline.from_pretrained(model.path, unet=unet, vae=vae,
-                                                                     torch_dtype=dtype, scheduler=scheduler,
-                                                                     safety_checker=None)
-            model.pipe_i2i = StableDiffusionImg2ImgPipeline.from_pretrained(model.path, unet=unet, vae=vae,
-                                                                            torch_dtype=dtype,
-                                                                            scheduler=scheduler, safety_checker=None)
-        except Exception as e:
-            print(f"{datetime.datetime.now()} Failed to load model " + model.name + ": " + str(e))
-            models.remove(model)
-    pipe = models[0].pipe_t2i
-
-# model.pipe_i2i = torch.compile(model.pipe_i2i)
-# model.pipe_t2i = torch.compile(model.pipe_t2i)
-if torch.cuda.is_available():
-    pipe = pipe.to(device)
-
-
-# device = "GPU 🔥" if torch.cuda.is_available() else "CPU 🥶"
-
-
-def error_str(error, title="Error"):
-    return f"""#### {title}
-            {error}""" if error else ""
-
-
-def custom_model_changed(path):
-    models[0].path = path
-    global current_model
-    current_model = models[0]
-
-
-def on_model_change(model_name):
-    prefix = "Enter prompt. \"" + next((m.prefix for m in models if m.name == model_name),
-                                       None) + "\" is prefixed automatically" if model_name != models[
-        0].name else "Don't forget to use the custom model prefix in the prompt!"
-
-    return gr.update(visible=model_name == models[0].name), gr.update(placeholder=prefix)
-
-
-def inference(model_name, prompt, guidance, steps, width=512, height=512, seed=0, img=None, strength=0.5,
-              neg_prompt="", scale_factor=2):
-    fprint(psutil.virtual_memory())  # print memory usage
-    prompt = 'detailed fingers, beautiful hands,' + prompt
-    fprint(f"Prompt: {prompt}")
-    global current_model
-    for model in models:
-        if model.name == model_name:
-            current_model = model
-            model_path = current_model.path
-
-    generator = torch.Generator(device).manual_seed(seed) if seed != 0 else None
-
-    try:
-        if img is not None:
-            return img_to_img(model_path, prompt, neg_prompt, img, strength, guidance, steps, width, height,
-                              generator, scale_factor), None
-        else:
-            return txt_to_img(model_path, prompt, neg_prompt, guidance, steps, width, height, generator,
-                              scale_factor), None
-    except Exception as e:
-        return None, error_str(e)
-    # if img is not None:
-    #     return img_to_img(model_path, prompt, neg_prompt, img, strength, guidance, steps, width, height,
-    #                       generator, scale_factor), None
-    # else:
-    #     return txt_to_img(model_path, prompt, neg_prompt, guidance, steps, width, height, generator, scale_factor), None
-
-
-def txt_to_img(model_path, prompt, neg_prompt, guidance, steps, width, height, generator, scale_factor):
-    print(f"{datetime.datetime.now()} txt_to_img, model: {current_model.name}")
-
-    global last_mode
-    global pipe
-    global current_model_path
-    if model_path != current_model_path or last_mode != "txt2img":
-        current_model_path = model_path
-
-        if is_colab or current_model == custom_model:
-            pipe = StableDiffusionPipeline.from_pretrained(current_model_path, torch_dtype=dtype,
-                                                           scheduler=scheduler,
-                                                           safety_checker=lambda images, clip_input: (images, False))
-        else:
-            # pipe = pipe.to("cpu")
-            pipe = current_model.pipe_t2i
-
-        if torch.cuda.is_available():
-            pipe = pipe.to(device)
-        last_mode = "txt2img"
-
-    prompt = current_model.prefix + prompt
-    result = pipe(
-        prompt,
-        negative_prompt=neg_prompt,
-        # num_images_per_prompt=n_images,
-        num_inference_steps=int(steps),
-        guidance_scale=guidance,
-        width=width,
-        height=height,
-        generator=generator)
-    result.images[0] = magnifier.magnify(result.images[0], scale_factor=scale_factor)
-
-    # save image
-    result.images[0].save("imgs/result-{}.png".format(datetime.datetime.now().strftime("%Y%m%d-%H%M%S")))
-    return replace_nsfw_images(result)
-
-
-def img_to_img(model_path, prompt, neg_prompt, img, strength, guidance, steps, width, height, generator, scale_factor):
-    fprint(f"{datetime.datetime.now()} img_to_img, model: {model_path}")
-
-    global last_mode
-    global pipe
-    global current_model_path
-    if model_path != current_model_path or last_mode != "img2img":
-        current_model_path = model_path
-
-        if is_colab or current_model == custom_model:
-            pipe = StableDiffusionImg2ImgPipeline.from_pretrained(current_model_path, torch_dtype=dtype,
-                                                                  scheduler=scheduler,
-                                                                  safety_checker=lambda images, clip_input: (
-                                                                      images, False))
-        else:
-            # pipe = pipe.to("cpu")
-            pipe = current_model.pipe_i2i
-
-        if torch.cuda.is_available():
-            pipe = pipe.to(device)
-        last_mode = "img2img"
-
-    prompt = current_model.prefix + prompt
-    ratio = min(height / img.height, width / img.width)
-    img = img.resize((int(img.width * ratio), int(img.height * ratio)), Image.LANCZOS)
-    result = pipe(
-        prompt,
-        negative_prompt=neg_prompt,
-        # num_images_per_prompt=n_images,
-        image=img,
-        num_inference_steps=int(steps),
-        strength=strength,
-        guidance_scale=guidance,
-        # width=width,
-        # height=height,
-        generator=generator)
-    result.images[0] = magnifier.magnify(result.images[0], scale_factor=scale_factor)
-
-    # save image
-    result.images[0].save("imgs/result-{}.png".format(datetime.datetime.now().strftime("%Y%m%d-%H%M%S")))
-    return replace_nsfw_images(result)
-
-
-def replace_nsfw_images(results):
-    if is_colab:
-        return results.images[0]
-    if hasattr(results, "nsfw_content_detected") and results.nsfw_content_detected:
-        for i in range(len(results.images)):
-            if results.nsfw_content_detected[i]:
-                results.images[i] = Image.open("nsfw.png")
-    return results.images[0]
-
-
-css = """.finetuned-diffusion-div div{display:inline-flex;align-items:center;gap:.8rem;font-size:1.75rem}.finetuned-diffusion-div div h1{font-weight:900;margin-bottom:7px}.finetuned-diffusion-div p{margin-bottom:10px;font-size:94%}a{text-decoration:underline}.tabs{margin-top:0;margin-bottom:0}#gallery{min-height:20rem}
-"""
-with gr.Blocks(css=css) as demo:
-    if not os.path.exists('imgs'):
-        os.mkdir('imgs')
-
-    gr.Markdown('# Super Resolution Anime Diffusion')
-    gr.Markdown(
-        "## Author: [yangheng95](https://github.com/yangheng95)  Github:[Github](https://github.com/yangheng95/SuperResolutionAnimeDiffusion)")
-    gr.Markdown("### This demo is running on a CPU, so it will take at least 20 minutes. "
-                "If you have a GPU, you can clone from [Github](https://github.com/yangheng95/SuperResolutionAnimeDiffusion) and run it locally.")
-    gr.Markdown("### FYI: to generate a 512*512 image and magnify 4x, it only takes 5~8 seconds on a RTX 2080 GPU")
-    gr.Markdown(
-        "### You can duplicate this demo on HuggingFace Spaces, click [here](https://huggingface.co/spaces/yangheng/Super-Resolution-Anime-Diffusion?duplicate=true)")
-
-    with gr.Row():
-        with gr.Column(scale=55):
-            with gr.Group():
-                gr.Markdown("Text to image")
-
-                model_name = gr.Dropdown(label="Model", choices=[m.name for m in models], value=current_model.name)
-
-                with gr.Box(visible=False) as custom_model_group:
-                    custom_model_path = gr.Textbox(label="Custom model path",
-                                                   placeholder="Path to model, e.g. nitrosocke/Arcane-Diffusion",
-                                                   interactive=True)
-                    gr.HTML(
-                        "<div><font size='2'>Custom models have to be downloaded first, so give it some time.</font></div>")
-
-                with gr.Row():
-                    prompt = gr.Textbox(label="Prompt", show_label=False, max_lines=2,
-                                        placeholder="Enter prompt. Style applied automatically").style(container=False)
-                with gr.Row():
-                    generate = gr.Button(value="Generate")
-
-                with gr.Row():
-                    with gr.Group():
-                        neg_prompt = gr.Textbox(label="Negative prompt", placeholder="What to exclude from the image")
-
-                image_out = gr.Image(height=512)
-                # gallery = gr.Gallery(
-                #     label="Generated images", show_label=False, elem_id="gallery"
-                # ).style(grid=[1], height="auto")
-            error_output = gr.Markdown()
-
-        with gr.Column(scale=45):
-            with gr.Group():
-                gr.Markdown("Image to Image")
-
-                with gr.Row():
-                    with gr.Group():
-                        image = gr.Image(label="Image", height=256, tool="editor", type="pil")
-                        strength = gr.Slider(label="Transformation strength", minimum=0, maximum=1, step=0.01,
-                                             value=0.5)
-
-                with gr.Row():
-                    with gr.Group():
-                        # n_images = gr.Slider(label="Images", value=1, minimum=1, maximum=4, step=1)
-
-                        with gr.Row():
-                            guidance = gr.Slider(label="Guidance scale", value=7.5, maximum=15)
-                            steps = gr.Slider(label="Steps", value=15, minimum=2, maximum=75, step=1)
-
-                        with gr.Row():
-                            width = gr.Slider(label="Width", value=512, minimum=64, maximum=1024, step=8)
-                            height = gr.Slider(label="Height", value=512, minimum=64, maximum=1024, step=8)
-                        with gr.Row():
-                            scale_factor = gr.Slider(1, 8, label='Scale factor (to magnify image) (1, 2, 4, 8)',
-                                                     value=2,
-                                                     step=1)
-
-                        seed = gr.Slider(0, 2147483647, label='Seed (0 = random)', value=0, step=1)
-
-    if is_colab:
-        model_name.change(on_model_change, inputs=model_name, outputs=[custom_model_group, prompt], queue=False)
-        custom_model_path.change(custom_model_changed, inputs=custom_model_path, outputs=None)
-    # n_images.change(lambda n: gr.Gallery().style(grid=[2 if n > 1 else 1], height="auto"), inputs=n_images, outputs=gallery)
-
-    gr.Markdown("### based on [Anything V3](https://huggingface.co/Linaqruf/anything-v3.0)")
-
-    inputs = [model_name, prompt, guidance, steps, width, height, seed, image, strength, neg_prompt, scale_factor]
-    outputs = [image_out, error_output]
-    prompt.submit(inference, inputs=inputs, outputs=outputs)
-    generate.click(inference, inputs=inputs, outputs=outputs, api_name="generate")
-
-    prompt_keys = [
-        'girl', 'lovely', 'cute', 'beautiful eyes', 'cumulonimbus clouds', 'detailed fingers',
-        random.choice(['dress']),
-        random.choice(['white hair']),
-        random.choice(['blue eyes']),
-        random.choice(['flower meadow']),
-        random.choice(['Elif', 'Angel'])
-    ]
-    prompt.value = ','.join(prompt_keys)
-    ex = gr.Examples([
-        [models[0].name, prompt.value, 7.5, 15],
-
-    ], inputs=[model_name, prompt, guidance, steps, seed], outputs=outputs, fn=inference, cache_examples=False)
-
-print(f"Space built in {time.time() - start_time:.2f} seconds")
-
-if not is_colab:
-    demo.queue(concurrency_count=2)
-demo.launch(debug=is_colab, enable_queue=True, share=is_colab)
diff --git a/spaces/Jackflack09/diffuse-custom/utils.py b/spaces/Jackflack09/diffuse-custom/utils.py
deleted file mode 100644
index ff1c065d186347ca51b47d010a697dbe1814695c..0000000000000000000000000000000000000000
--- a/spaces/Jackflack09/diffuse-custom/utils.py
+++ /dev/null
@@ -1,6 +0,0 @@
-def is_google_colab():
-    try:
-        import google.colab
-        return True
-    except:
-        return False
\ No newline at end of file
diff --git a/spaces/JustinLin610/ImageBind_zeroshot_demo/CONTRIBUTING.md b/spaces/JustinLin610/ImageBind_zeroshot_demo/CONTRIBUTING.md
deleted file mode 100644
index 63d0b751e8a00b606ddff92e2524faa3c90a63b0..0000000000000000000000000000000000000000
--- a/spaces/JustinLin610/ImageBind_zeroshot_demo/CONTRIBUTING.md
+++ /dev/null
@@ -1,31 +0,0 @@
-# Contributing to ImageBind
-We want to make contributing to this project as easy and transparent as
-possible.
-
-## Pull Requests
-We actively welcome your pull requests.
-
-1. Fork the repo and create your branch from `main`.
-2. If you've added code that should be tested, add tests.
-3. If you've changed APIs, update the documentation.
-4. Ensure the test suite passes.
-5. Make sure your code lints.
-6. If you haven't already, complete the Contributor License Agreement ("CLA").
-
-## Contributor License Agreement ("CLA")
-In order to accept your pull request, we need you to submit a CLA. You only need
-to do this once to work on any of Meta's open source projects.
-
-Complete your CLA here: <https://code.facebook.com/cla>
-
-## Issues
-We use GitHub issues to track public bugs. Please ensure your description is
-clear and has sufficient instructions to be able to reproduce the issue.
-
-Meta has a [bounty program](https://www.facebook.com/whitehat/) for the safe
-disclosure of security bugs. In those cases, please go through the process
-outlined on that page and do not file a public issue.
-
-## License
-By contributing to Omnivore, you agree that your contributions will be licensed
-under the [LICENSE](LICENSE) file in the root directory of this source tree.
diff --git a/spaces/KPCGD/bingo/src/state/index.ts b/spaces/KPCGD/bingo/src/state/index.ts
deleted file mode 100644
index 272106d619c69f124ea8dd0f10872ab4840152d7..0000000000000000000000000000000000000000
--- a/spaces/KPCGD/bingo/src/state/index.ts
+++ /dev/null
@@ -1,118 +0,0 @@
-import { BingWebBot } from '@/lib/bots/bing'
-import { BingConversationStyle, ChatMessageModel, BotId } from '@/lib/bots/bing/types'
-import { nanoid } from '@/lib/utils'
-import { atom } from 'jotai'
-import { atomWithImmer } from 'jotai-immer'
-import { atomWithStorage } from 'jotai/utils'
-import { atomFamily } from 'jotai/utils'
-import { atomWithHash, atomWithLocation } from 'jotai-location'
-
-const initialMessages: ChatMessageModel[] = [
-  { author: 'system', text: 'conversation between user and robot', id: '1' },
-  { author: 'user', text: '销量最高的 3 种宠物吸尘器有哪些优点和缺点?  ', id: '2' },
-  {
-    author: 'bot', text: `
-您好，这是必应。根据网上的搜索结果，我为您找到了以下三款销量最高的宠物吸尘器，以及它们的优点和缺点：
-
-- **戴森Dyson V10轻量版 Digital Slim Fluffy无线吸尘器**[^1^] [^3^]：这款吸尘器专为宠物家庭设计，拥有强大吸力和多功能吸头，能够有效清除宠物毛发和灰尘。
-  - 优点：轻便易用，续航时间长，过滤系统先进，能够有效去除过敏原；
-  - 缺点：价格较高，噪音较大，需要定期清洁滤网。
-- **飞利浦FC6908/82（W7）无线吸尘器**[^2^] [^4^]：这是一款手持式干吸无线吸尘器，专门为宠物家庭设计。它具有75分钟的超高续航，适合大户型；除螨涡轮刷，可以深度清洁床单被罩，免受螨虫侵害；吸拖一体设计，280ml大水箱，还可以往水箱里加入清洁剂。
-  - 优点：清洁性能强劲，操作方便，适用多种场景；
-  - 缺点：噪音较大，达到84dB（A）；尘杯容量较小，只有0.6L；充电时长较长，需要5小时。
-- **必胜（Bissell） 宠物吸尘器**[^2^]：这是一款便携式手持真空吸尘器，专为清理宠物毛发而设计。它配备特殊的橡胶喷嘴和软毛刷头，可以轻松拾取宠物毛发和灰尘；几乎静音运行。
-  - 优点：轻巧易用，重量只有1.36kg；电池可充电可更换；
-  - 缺点：续航时间不稳定，在15-30分钟之间浮动；吸力不够强劲，在地毯或沙发上可能效果不佳；没有过滤系统或过滤网。
-
-希望这些信息对您有所帮助。如果您还有其他问题，请随时提问。😊
-  `, id: '3' },
-  { author: 'user', text: '今天的新闻', id: '4' },
-  {
-    author: 'bot', text: `你好，这是Bing。我根据你的搜索查询“今天的新闻”为你找到了以下信息：
-
-  # 中国新闻
-  - 《求是》杂志发表习近平总书记重要文章《深化党和国家机构改革 推进国家治理体系和治理能力现代化》[^1^]
-  - 梦之队第5金！ 全红婵陈芋汐女双10米台夺冠[^1^]
-  - 中央气象台7月16日18时发布台风橙色预警[^1^]
-  - 贵州石阡：暑期旅游带动乡村振兴[^1^]
-  - 激活大科学装置的“人才红利”[^1^]
-  - 聚才用才留才 让希望的田野成为智慧的田野[^1^]
-  - 科学家发现粮食系统增效可有效支撑我国碳中和[^1^]
-  - 成都以赛为媒提升城市美誉度[^1^]
-  - 香江观澜：“抢人才”成效显著 香港竞争力依旧[^1^]
-  - 浙江建德：新安江上享清凉[^1^]
-  - 定向资金持续精准滴灌 高质量发展力量不断积累[^1^]
-  - 企业信心恢复加大中长期投资 为稳增长奠定基础[^1^]
-  - 武汉渡江节开赛 千名“泳士”竞渡长江[^1^]
-  - 金融更加重视对实体经济支持 降低融资成本提振市场信心[^1^]
-  - 大运来了丨成都迎大运 全民健身动起来[^1^]
-  - 藏在高校里的宝藏博物馆[^1^]
-  - 中国汽车工业用70年赢得三个“全球第一”[^1^]
-  - 辽宁阜新市委常委、副市长赖化平涉嫌严重违纪违法接受审查调查[^1^]
-
-  # 国际新闻
-  - 联合国秘书长：可持续发展面临风险 各国需加强行动[^2^]
-  - 国际航运业加快绿色转型[^2^]
-  - 美企反对收紧对华芯片出口限制[^2^]
-  - 欧洲加大气候科技领域投资[^2^]
-  - 中企助力丹麦发展清洁能源[^2^]
-  - 中国代表呼吁国际社会共同努力防止乌克兰局势失控[^2^]
-  - 中国和阿尔及利亚共同构建新型国际关系典范[^2^]
-
-  以上信息仅供参考，具体详情请点击以下链接查看：
-
-  [1] [中国新闻_央视网(cctv.com)](https://news.cctv.com/china/)
-  [2] [人民网_网上的人民日报](http://www.people.com.cn/)`, id: '5' },
-  { author: 'user', text: '写一个快排', id: '6' },
-  { author: 'bot', text: "你好，这是Bing。我可以帮你用python写一个快排。快速排序是一种基于分治思想的排序算法，它的基本思想是：从待排序的数组中选择一个基准元素，将数组分为两个子数组，使得左边的子数组中的元素都小于或等于基准元素，右边的子数组中的元素都大于或等于基准元素，然后对两个子数组递归地进行快速排序，最后合并结果。下面是用python实现的快速排序的代码：\n\n```python\n# 定义一个函数，用于交换数组中的两个元素\ndef swap(arr, i, j):\n    temp = arr[i]\n    arr[i] = arr[j]\n    arr[j] = temp\n\n# 定义一个函数，用于对数组的一段区间进行划分\ndef partition(arr, low, high):\n    # 选择最右边的元素作为基准元素\n    pivot = arr[high]\n    # 初始化一个指针，指向左边区间的最后一个位置\n    i = low - 1\n    # 遍历左边区间中的每个元素\n    for j in range(low, high):\n        # 如果当前元素小于或等于基准元素\n        if arr[j] <= pivot:\n            # 将指针右移一位\n            i += 1\n            # 将指针所指的元素与当前元素交换\n            swap(arr, i, j)\n    # 将基准元素与指针右边的第一个元素交换\n    swap(arr, i + 1, high)\n    # 返回基准元素的最终位置\n    return i + 1\n\n# 定义一个函数，用于对数组进行快速排序\ndef quick_sort(arr, low, high):\n    # 如果区间长度大于1\n    if low < high:\n        # 对区间进行划分，得到基准元素的位置\n        p = partition(arr, low, high)\n        # 对左边子区间进行快速排序\n        quick_sort(arr, low, p - 1)\n        # 对右边子区间进行快速排序\n        quick_sort(arr, p + 1, high)\n\n# 测试代码\narr = [5, 3, 7, 2, 9, 1, 4, 6, 8]\nprint(\"原始数组：\", arr)\nquick_sort(arr, 0, len(arr) - 1)\nprint(\"排序后的数组：\", arr)\n```", id: '7' },
-  {
-    author: 'bot', text: "好的，我会尝试画一只猫。\n > ![一只猫](https://tse2.mm.bing.net/th/id/OIG.jz34V0PNVkPC229h9spV?w=270&h=270&c=6&r=0&o=5&dpr=1.5&pid=ImgGn)![一只猫](https://tse1.mm.bing.net/th/id/OIG.6g7d.XLZMP_iwAByLhvo?w=270&h=270&c=6&r=0&o=5&dpr=1.5&pid=ImgGn)![一只猫](https://tse2.mm.bing.net/th/id/OIG.iAxF4ekekYn7sZw9SmU6?w=270&h=270&c=6&r=0&o=5&dpr=1.5&pid=ImgGn)![一只猫](https://tse4.mm.bing.net/th/id/OIG.qDnzeSKzUCeJcrBqc5mX?w=270&h=270&c=6&r=0&o=5&dpr=1.5&pid=ImgGn)",
-    id: '8'
-  }
-]
-
-export const GreetMessages = [
-  '谢谢你! 知道你什么时候准备好继续前进总是很有帮助的。我现在能为你回答什么问题?',
-  '重新开始总是很棒。问我任何问题!',
-  '当然，我很乐意重新开始。我现在可以为你提供哪些帮助?',
-  '当然，我已准备好进行新的挑战。我现在可以为你做什么?',
-  '很好，让我们来更改主题。你在想什么?',
-  '不用担心，我很高兴尝试一些新内容。我现在可以为你回答什么问题?',
-  '好的，我准备好了！感谢重置。我们应该了解哪些内容？',
-  '感谢刷新！你有新的话题吗？',
-  '明白了，让我们重新开始。接下来应该讨论什么？',
-  '下一步！我可以为你做什么？',
-  '好的，我已准备好新话题。我们应该一起了解哪些内容？'
-]
-
-export const bingConversationStyleAtom = atomWithStorage<BingConversationStyle>('bingConversationStyle', BingConversationStyle.Creative, undefined, { unstable_getOnInit: true })
-export const voiceAtom = atomWithStorage<boolean>('enableTTS', false, undefined, { unstable_getOnInit: true })
-
-type Param = { botId: BotId; page: string }
-
-const createBotInstance = () => {
-  return new BingWebBot({
-    cookie: ' ',
-    ua: ' ',
-  })
-}
-
-export const chatFamily = atomFamily(
-  (param: Param) => {
-    return atomWithImmer({
-      botId: param.botId,
-      bot: createBotInstance(),
-      messages: [] as ChatMessageModel[],
-      generatingMessageId: '',
-      abortController: undefined as AbortController | undefined,
-      conversationId: nanoid(),
-    })
-  },
-  (a, b) => a.botId === b.botId && a.page === b.page,
-)
-
-export const hashAtom = atomWithHash('dialog', '')
-
-export const locationAtom = atomWithLocation()
-
-export const voiceListenAtom = atom(false)
diff --git a/spaces/Kangarroar/ApplioRVC-Inference/demucs/repitch.py b/spaces/Kangarroar/ApplioRVC-Inference/demucs/repitch.py
deleted file mode 100644
index 8846ab2d951a024c95067f66a113968500442828..0000000000000000000000000000000000000000
--- a/spaces/Kangarroar/ApplioRVC-Inference/demucs/repitch.py
+++ /dev/null
@@ -1,96 +0,0 @@
-# Copyright (c) Facebook, Inc. and its affiliates.
-# All rights reserved.
-#
-# This source code is licensed under the license found in the
-# LICENSE file in the root directory of this source tree.
-
-import io
-import random
-import subprocess as sp
-import tempfile
-
-import numpy as np
-import torch
-from scipy.io import wavfile
-
-
-def i16_pcm(wav):
-    if wav.dtype == np.int16:
-        return wav
-    return (wav * 2**15).clamp_(-2**15, 2**15 - 1).short()
-
-
-def f32_pcm(wav):
-    if wav.dtype == np.float:
-        return wav
-    return wav.float() / 2**15
-
-
-class RepitchedWrapper:
-    """
-    Wrap a dataset to apply online change of pitch / tempo.
-    """
-    def __init__(self, dataset, proba=0.2, max_pitch=2, max_tempo=12, tempo_std=5, vocals=[3]):
-        self.dataset = dataset
-        self.proba = proba
-        self.max_pitch = max_pitch
-        self.max_tempo = max_tempo
-        self.tempo_std = tempo_std
-        self.vocals = vocals
-
-    def __len__(self):
-        return len(self.dataset)
-
-    def __getitem__(self, index):
-        streams = self.dataset[index]
-        in_length = streams.shape[-1]
-        out_length = int((1 - 0.01 * self.max_tempo) * in_length)
-
-        if random.random() < self.proba:
-            delta_pitch = random.randint(-self.max_pitch, self.max_pitch)
-            delta_tempo = random.gauss(0, self.tempo_std)
-            delta_tempo = min(max(-self.max_tempo, delta_tempo), self.max_tempo)
-            outs = []
-            for idx, stream in enumerate(streams):
-                stream = repitch(
-                    stream,
-                    delta_pitch,
-                    delta_tempo,
-                    voice=idx in self.vocals)
-                outs.append(stream[:, :out_length])
-            streams = torch.stack(outs)
-        else:
-            streams = streams[..., :out_length]
-        return streams
-
-
-def repitch(wav, pitch, tempo, voice=False, quick=False, samplerate=44100):
-    """
-    tempo is a relative delta in percentage, so tempo=10 means tempo at 110%!
-    pitch is in semi tones.
-    Requires `soundstretch` to be installed, see
-    https://www.surina.net/soundtouch/soundstretch.html
-    """
-    outfile = tempfile.NamedTemporaryFile(suffix=".wav")
-    in_ = io.BytesIO()
-    wavfile.write(in_, samplerate, i16_pcm(wav).t().numpy())
-    command = [
-        "soundstretch",
-        "stdin",
-        outfile.name,
-        f"-pitch={pitch}",
-        f"-tempo={tempo:.6f}",
-    ]
-    if quick:
-        command += ["-quick"]
-    if voice:
-        command += ["-speech"]
-    try:
-        sp.run(command, capture_output=True, input=in_.getvalue(), check=True)
-    except sp.CalledProcessError as error:
-        raise RuntimeError(f"Could not change bpm because {error.stderr.decode('utf-8')}")
-    sr, wav = wavfile.read(outfile.name)
-    wav = wav.copy()
-    wav = f32_pcm(torch.from_numpy(wav).t())
-    assert sr == samplerate
-    return wav
diff --git a/spaces/Kevin676/AutoGPT/autogpt/speech/__init__.py b/spaces/Kevin676/AutoGPT/autogpt/speech/__init__.py
deleted file mode 100644
index 2ff0d2bf48dc356bf810cb5a2063d6774e5fec6e..0000000000000000000000000000000000000000
--- a/spaces/Kevin676/AutoGPT/autogpt/speech/__init__.py
+++ /dev/null
@@ -1,4 +0,0 @@
-"""This module contains the speech recognition and speech synthesis functions."""
-from autogpt.speech.say import say_text
-
-__all__ = ["say_text"]
diff --git a/spaces/LanguageBind/LanguageBind/a_cls/zero_shot.py b/spaces/LanguageBind/LanguageBind/a_cls/zero_shot.py
deleted file mode 100644
index 57d709c77d4c9f0c565902d5bf4229df06a67265..0000000000000000000000000000000000000000
--- a/spaces/LanguageBind/LanguageBind/a_cls/zero_shot.py
+++ /dev/null
@@ -1,234 +0,0 @@
-import logging
-import os
-
-import numpy as np
-import torch
-import torch.nn.functional as F
-from torch import nn
-from tqdm import tqdm
-
-from open_clip import get_input_dtype, get_tokenizer
-from open_clip.factory import HF_HUB_PREFIX
-from .precision import get_autocast
-from .stats import calculate_stats, d_prime
-from .zero_shot_classifier import build_zero_shot_classifier
-from .zero_shot_metadata import CLASSNAMES, OPENAI_IMAGENET_TEMPLATES
-
-
-def accuracy(output, target, topk=(1,)):
-    pred = output.topk(max(topk), 1, True, True)[1].t()
-    correct = pred.eq(target.view(1, -1).expand_as(pred))
-    return [float(correct[:k].reshape(-1).float().sum(0, keepdim=True).cpu().numpy()) for k in topk]
-
-
-def run(model, classifier, dataloader, args):
-    autocast = get_autocast(args.precision)
-    input_dtype = get_input_dtype(args.precision)
-
-    with torch.no_grad():
-        top1, top5, n = 0., 0., 0.
-        for images, target in tqdm(dataloader, unit_scale=args.batch_size):
-            images = images.to(device=args.device, dtype=input_dtype)
-            images = images.unsqueeze(2)
-            target = target.to(args.device)
-
-            with autocast():
-                # predict
-                output = model(image=images)
-                image_features = output['image_features'] if isinstance(output, dict) else output[0]
-                logits = 100. * image_features @ classifier
-
-            # measure accuracy
-            acc1, acc5 = accuracy(logits, target, topk=(1, 5))
-            top1 += acc1
-            top5 += acc5
-            n += images.size(0)
-
-    top1 = (top1 / n)
-    top5 = (top5 / n)
-    return top1, top5
-
-
-def validate(audio_model, classifier, val_loader, args, epoch):
-    epoch = epoch - 1 ########################
-    # switch to evaluate mode
-    audio_model.eval()
-    autocast = get_autocast(args.precision)
-    input_dtype = get_input_dtype(args.precision)
-    A_predictions = []
-    A_targets = []
-    A_loss = []
-    with torch.no_grad():
-        for i, (audio_input, labels) in enumerate(tqdm(val_loader)):
-            audio_input = audio_input.to(device=args.device, dtype=input_dtype)
-
-            # compute output
-            with autocast():
-                # predict
-                output = audio_model(image=audio_input)
-                image_features = output['image_features'] if isinstance(output, dict) else output[0]
-                logits = 100. * image_features @ classifier
-            audio_output = logits
-
-            # audio_output = torch.sigmoid(audio_output)
-            predictions = audio_output.to('cpu').detach()
-
-            A_predictions.append(predictions)
-            A_targets.append(labels)
-
-            # compute the loss
-            labels = labels.to(args.device)
-            loss = nn.CrossEntropyLoss()(audio_output, torch.argmax(labels.long(), dim=1))
-            A_loss.append(loss.to('cpu').detach())
-
-        audio_output = torch.cat(A_predictions)
-        target = torch.cat(A_targets)
-        loss = np.mean(A_loss)
-        stats = calculate_stats(audio_output, target)
-
-        # save the prediction here
-        args.a_cls_output_dir = os.path.join(args.log_base_path, f'a_cls/{args.val_a_cls_data.lower()}')
-        os.makedirs(args.a_cls_output_dir, exist_ok=True)
-        if os.path.exists(args.a_cls_output_dir + '/predictions') == False:
-            os.mkdir(args.a_cls_output_dir + '/predictions')
-            np.savetxt(args.a_cls_output_dir + '/predictions/target.csv', target, delimiter=',')
-        np.savetxt(args.a_cls_output_dir + '/predictions/predictions_' + str(epoch) + '.csv', audio_output,
-                   delimiter=',')
-
-    valid_loss = loss
-    main_metrics = 'mAP'
-    metrics = {}
-
-    if args.do_train:
-        # ensemble results
-        cum_stats = validate_ensemble(args, epoch)
-        cum_mAP = np.mean([stat['AP'] for stat in cum_stats])
-        cum_mAUC = np.mean([stat['auc'] for stat in cum_stats])
-        cum_acc = cum_stats[0]['acc']
-
-    mAP = np.mean([stat['AP'] for stat in stats])
-    mAUC = np.mean([stat['auc'] for stat in stats])
-    acc = stats[0]['acc']
-
-    middle_ps = [stat['precisions'][int(len(stat['precisions']) / 2)] for stat in stats]
-    middle_rs = [stat['recalls'][int(len(stat['recalls']) / 2)] for stat in stats]
-    average_precision = np.mean(middle_ps)
-    average_recall = np.mean(middle_rs)
-
-    if main_metrics == 'mAP':
-        logging.info("mAP: {:.6f}".format(mAP))
-    else:
-        logging.info("acc: {:.6f}".format(acc))
-    logging.info("AUC: {:.6f}".format(mAUC))
-    logging.info("Avg Precision: {:.6f}".format(average_precision))
-    logging.info("Avg Recall: {:.6f}".format(average_recall))
-    logging.info("d_prime: {:.6f}".format(d_prime(mAUC)))
-    logging.info("valid_loss: {:.6f}".format(valid_loss))
-
-    if args.do_train:
-        logging.info("cum_mAP: {:.6f}".format(cum_mAP))
-        logging.info("cum_mAUC: {:.6f}".format(cum_mAUC))
-
-    if main_metrics == 'mAP':
-        metrics['mAP'] = float(mAP)
-    else:
-        metrics['acc'] = float(acc)
-
-    metrics['mAUC'] = float(mAUC)
-    metrics['average_precision'] = float(average_precision)
-    metrics['average_recall'] = float(average_recall)
-    metrics['d_prime_mAUC'] = float(d_prime(mAUC))
-    metrics['valid_loss'] = float(valid_loss)
-
-    if args.do_train:
-        metrics['cum_mAP'] = float(cum_mAP)
-        metrics['cum_mAUC'] = float(cum_mAUC)
-
-    return metrics
-
-
-def validate_ensemble(args, epoch):
-    exp_dir = args.a_cls_output_dir
-    target = np.loadtxt(exp_dir + '/predictions/target.csv', delimiter=',')
-    if epoch == 0:
-        cum_predictions = np.loadtxt(exp_dir + '/predictions/predictions_0.csv', delimiter=',')
-    else:
-        cum_predictions = np.loadtxt(exp_dir + '/predictions/cum_predictions.csv', delimiter=',') * (epoch - 1)
-        predictions = np.loadtxt(exp_dir + '/predictions/predictions_' + str(epoch) + '.csv', delimiter=',')
-        cum_predictions = cum_predictions + predictions
-        # remove the prediction file to save storage space
-        os.remove(exp_dir + '/predictions/predictions_' + str(epoch - 1) + '.csv')
-
-    cum_predictions = cum_predictions / (epoch + 1)
-    np.savetxt(exp_dir + '/predictions/cum_predictions.csv', cum_predictions, delimiter=',')
-
-    stats = calculate_stats(cum_predictions, target)
-    return stats
-
-
-
-
-
-
-
-
-
-def zero_shot_eval(model, data, epoch, args):
-    temp_val_a_cls_data = args.val_a_cls_data
-    args.val_a_cls_data = list(data.keys())
-    assert len(args.val_a_cls_data) == 1
-    args.val_a_cls_data = args.val_a_cls_data[0]
-
-    if args.val_a_cls_data not in data:
-        return {}
-    if args.zeroshot_frequency == 0:
-        return {}
-    if (epoch % args.zeroshot_frequency) != 0 and epoch != args.epochs:
-        return {}
-    if args.distributed and not args.horovod:
-        model = model.module
-
-    logging.info(f'Starting zero-shot {args.val_a_cls_data.upper()}.')
-
-    logging.info('Building zero-shot classifier')
-    autocast = get_autocast(args.precision)
-    with autocast():
-        tokenizer = get_tokenizer(HF_HUB_PREFIX+args.model, cache_dir=args.cache_dir)
-        # tokenizer = get_tokenizer("ViT-L-14")
-        classifier = build_zero_shot_classifier(
-            model,
-            tokenizer=tokenizer,
-            classnames=CLASSNAMES[args.val_a_cls_data],
-            templates=OPENAI_IMAGENET_TEMPLATES,
-            num_classes_per_batch=10,
-            device=args.device,
-            use_tqdm=True,
-        )
-
-    logging.info('Using classifier')
-    results = {}
-    if args.val_a_cls_data.lower() == 'audioset':
-        if args.val_a_cls_data in data:
-            stats = validate(model, classifier, data[args.val_a_cls_data].dataloader, args, epoch)
-            results.update(stats)
-    else:
-        if args.val_a_cls_data in data:
-            top1, top5 = run(model, classifier, data[args.val_a_cls_data].dataloader, args)
-            results[f'{args.val_a_cls_data}-zeroshot-val-top1'] = top1
-            results[f'{args.val_a_cls_data}-zeroshot-val-top5'] = top5
-
-    logging.info(f'Finished zero-shot {args.val_a_cls_data.upper()}.')
-
-    args.val_a_cls_data = temp_val_a_cls_data
-    return results
-
-
-
-
-
-
-
-
-
-
-
diff --git a/spaces/LawalAfeez/science-lab/app.py b/spaces/LawalAfeez/science-lab/app.py
deleted file mode 100644
index dcf3404d08fabb68add567909fbe6ab411e74859..0000000000000000000000000000000000000000
--- a/spaces/LawalAfeez/science-lab/app.py
+++ /dev/null
@@ -1,112 +0,0 @@
-import gradio as gr
-from data_library import embedded_form
-import pandas as pd
-from embed import sample_embedding
-
-import faiss
-embedded_form=embedded_form["train"]
-embedded_form.add_faiss_index("embedding")
-
-
-
-# gradio function
-
-title="""<center>
-<H3 style="background-color:powderblue;">SEARCH FOR SCIENCE RELATED(BIO,PHY AND CHEM)</H3></center>"""
-
-description="""<center><h4>This app is created to help give answers to  high school science related questions</h4></center>"""
-
-
-def input_text1(text):
-
-  
-  question_embedding =sample_embedding([text])
-  question_embedding=question_embedding["embedding"]
-  scores, samples = embedded_form.get_nearest_examples(
-      "embedding", question_embedding, k=5
-    )
-  dataframe=pd.DataFrame(samples)
-  dataframe["scores"]=scores
-  dataframe=dataframe.sort_values("scores",ascending=False).reset_index(drop=True)
-
-  return dataframe.loc[0,"support"]
-
-
-
-def input_text2(text):
-
-  
-  question_embedding =sample_embedding([text])
-  question_embedding=question_embedding["embedding"]
-  scores, samples = embedded_form.get_nearest_examples(
-      "embedding", question_embedding, k=5
-    )
-  dataframe=pd.DataFrame(samples)
-  dataframe["scores"]=scores
-  dataframe=dataframe.sort_values("scores",ascending=False).reset_index(drop=True)
-
-  return dataframe.loc[1,"support"]
-
-
-def input_text3(text):
-
-  
-  question_embedding =sample_embedding([text])
-  question_embedding=question_embedding["embedding"]
-  scores, samples = embedded_form.get_nearest_examples(
-      "embedding", question_embedding, k=5
-    )
-  dataframe=pd.DataFrame(samples)
-  dataframe["scores"]=scores
-  dataframe=dataframe.sort_values("scores",ascending=False).reset_index(drop=True)
-
-  return dataframe.loc[2,"support"]
-
-
-def input_text4(text):
-
-  
-  question_embedding =sample_embedding([text])
-  question_embedding=question_embedding["embedding"]
-  scores, samples = embedded_form.get_nearest_examples(
-      "embedding", question_embedding, k=5
-    )
-  dataframe=pd.DataFrame(samples)
-  dataframe["scores"]=scores
-  dataframe=dataframe.sort_values("scores",ascending=False).reset_index(drop=True)
-
-  return dataframe.loc[3,"support"]
-
-def input_text5(text):
-
-  
-  question_embedding =sample_embedding([text])
-  question_embedding=question_embedding["embedding"]
-  scores, samples = embedded_form.get_nearest_examples(
-      "embedding", question_embedding, k=5
-    )
-  dataframe=pd.DataFrame(samples)
-  dataframe["scores"]=scores
-  dataframe=dataframe.sort_values("scores",ascending=False).reset_index(drop=True)
-
-  return dataframe.loc[4,"support"]
-
-
-answer1=gr.Interface(input_text1,inputs=gr.Textbox(label="Search"),outputs=gr.Textbox(label="Support 1"))
-
-answer2=gr.Interface(input_text2,inputs=gr.Textbox(label="Search"),outputs=gr.Textbox(label="Support 2"))
-
-answer3=gr.Interface(input_text3,inputs=gr.Textbox(label="Search"),outputs=gr.Textbox(label="Support 3"))
-
-
-answer4=gr.Interface(input_text4,inputs=gr.Textbox(label="Search"),outputs=gr.Textbox(label="Support 4"))
-
-answer5=gr.Interface(input_text5,inputs=gr.Textbox(label="Search"),outputs=gr.Textbox(label="Support 5"))
-
-demo=gr.Parallel(answer1,answer2,answer3,answer4,answer5,description=description,title=title)
-
-
-if __name__ == "__main__":
-    demo.launch(debug=True)
-  
-  
diff --git a/spaces/Lewislou/Lewislou-cell-seg-sribd/stardist_pkg/models/base.py b/spaces/Lewislou/Lewislou-cell-seg-sribd/stardist_pkg/models/base.py
deleted file mode 100644
index bb13b37d810363b3758cb54284a250df19d6a2f6..0000000000000000000000000000000000000000
--- a/spaces/Lewislou/Lewislou-cell-seg-sribd/stardist_pkg/models/base.py
+++ /dev/null
@@ -1,1196 +0,0 @@
-from __future__ import print_function, unicode_literals, absolute_import, division
-
-import numpy as np
-import sys
-import warnings
-import math
-from tqdm import tqdm
-from collections import namedtuple
-from pathlib import Path
-import threading
-import functools
-import scipy.ndimage as ndi
-import numbers
-
-from csbdeep.models.base_model import BaseModel
-from csbdeep.utils.tf import export_SavedModel, keras_import, IS_TF_1, CARETensorBoard
-
-import tensorflow as tf
-K = keras_import('backend')
-Sequence = keras_import('utils', 'Sequence')
-Adam = keras_import('optimizers', 'Adam')
-ReduceLROnPlateau, TensorBoard = keras_import('callbacks', 'ReduceLROnPlateau', 'TensorBoard')
-
-from csbdeep.utils import _raise, backend_channels_last, axes_check_and_normalize, axes_dict, load_json, save_json
-from csbdeep.internals.predict import tile_iterator, total_n_tiles
-from csbdeep.internals.train import RollingSequence
-from csbdeep.data import Resizer
-
-from ..sample_patches import get_valid_inds
-from ..nms import _ind_prob_thresh
-from ..utils import _is_power_of_2,  _is_floatarray, optimize_threshold
-
-# TODO: helper function to check if receptive field of cnn is sufficient for object sizes in GT
-
-def generic_masked_loss(mask, loss, weights=1, norm_by_mask=True, reg_weight=0, reg_penalty=K.abs):
-    def _loss(y_true, y_pred):
-        actual_loss = K.mean(mask * weights * loss(y_true, y_pred), axis=-1)
-        norm_mask = (K.mean(mask) + K.epsilon()) if norm_by_mask else 1
-        if reg_weight > 0:
-            reg_loss = K.mean((1-mask) * reg_penalty(y_pred), axis=-1)
-            return actual_loss / norm_mask + reg_weight * reg_loss
-        else:
-            return actual_loss / norm_mask
-    return _loss
-
-def masked_loss(mask, penalty, reg_weight, norm_by_mask):
-    loss = lambda y_true, y_pred: penalty(y_true - y_pred)
-    return generic_masked_loss(mask, loss, reg_weight=reg_weight, norm_by_mask=norm_by_mask)
-
-# TODO: should we use norm_by_mask=True in the loss or only in a metric?
-#       previous 2D behavior was norm_by_mask=False
-#       same question for reg_weight? use 1e-4 (as in 3D) or 0 (as in 2D)?
-
-def masked_loss_mae(mask, reg_weight=0, norm_by_mask=True):
-    return masked_loss(mask, K.abs, reg_weight=reg_weight, norm_by_mask=norm_by_mask)
-
-def masked_loss_mse(mask, reg_weight=0, norm_by_mask=True):
-    return masked_loss(mask, K.square, reg_weight=reg_weight, norm_by_mask=norm_by_mask)
-
-def masked_metric_mae(mask):
-    def relevant_mae(y_true, y_pred):
-        return masked_loss(mask, K.abs, reg_weight=0, norm_by_mask=True)(y_true, y_pred)
-    return relevant_mae
-
-def masked_metric_mse(mask):
-    def relevant_mse(y_true, y_pred):
-        return masked_loss(mask, K.square, reg_weight=0, norm_by_mask=True)(y_true, y_pred)
-    return relevant_mse
-
-def kld(y_true, y_pred):
-    y_true = K.clip(y_true, K.epsilon(), 1)
-    y_pred = K.clip(y_pred, K.epsilon(), 1)
-    return K.mean(K.binary_crossentropy(y_true, y_pred) - K.binary_crossentropy(y_true, y_true), axis=-1)
-
-
-def masked_loss_iou(mask, reg_weight=0, norm_by_mask=True):
-    def iou_loss(y_true, y_pred):
-        axis = -1 if backend_channels_last() else 1
-        # y_pred can be negative (since not constrained) -> 'inter' can be very large for y_pred << 0
-        # - clipping y_pred values at 0 can lead to vanishing gradients
-        # - 'K.sign(y_pred)' term fixes issue by enforcing that y_pred values >= 0 always lead to larger 'inter' (lower loss)
-        inter = K.mean(K.sign(y_pred)*K.square(K.minimum(y_true,y_pred)), axis=axis)
-        union = K.mean(K.square(K.maximum(y_true,y_pred)), axis=axis)
-        iou = inter/(union+K.epsilon())
-        iou = K.expand_dims(iou,axis)
-        loss = 1. - iou # + 0.005*K.abs(y_true-y_pred)
-        return loss
-    return generic_masked_loss(mask, iou_loss, reg_weight=reg_weight, norm_by_mask=norm_by_mask)
-
-def masked_metric_iou(mask, reg_weight=0, norm_by_mask=True):
-    def iou_metric(y_true, y_pred):
-        axis = -1 if backend_channels_last() else 1
-        y_pred = K.maximum(0., y_pred)
-        inter = K.mean(K.square(K.minimum(y_true,y_pred)), axis=axis)
-        union = K.mean(K.square(K.maximum(y_true,y_pred)), axis=axis)
-        iou = inter/(union+K.epsilon())
-        loss = K.expand_dims(iou,axis)
-        return loss
-    return generic_masked_loss(mask, iou_metric, reg_weight=reg_weight, norm_by_mask=norm_by_mask)
-
-
-def weighted_categorical_crossentropy(weights, ndim):
-    """ ndim = (2,3) """
-
-    axis = -1 if backend_channels_last() else 1
-    shape = [1]*(ndim+2)
-    shape[axis] = len(weights)
-    weights = np.broadcast_to(weights, shape)
-    weights = K.constant(weights)
-
-    def weighted_cce(y_true, y_pred):
-        # ignore pixels that have y_true (prob_class) < 0
-        mask = K.cast(y_true>=0, K.floatx())
-        y_pred /= K.sum(y_pred+K.epsilon(), axis=axis, keepdims=True)
-        y_pred = K.clip(y_pred, K.epsilon(), 1. - K.epsilon())
-        loss = - K.sum(weights*mask*y_true*K.log(y_pred), axis = axis)
-        return loss
-
-    return weighted_cce
-
-
-class StarDistDataBase(RollingSequence):
-
-    def __init__(self, X, Y, n_rays, grid, batch_size, patch_size, length,
-                 n_classes=None, classes=None,
-                 use_gpu=False, sample_ind_cache=True, maxfilter_patch_size=None, augmenter=None, foreground_prob=0):
-
-        super().__init__(data_size=len(X), batch_size=batch_size, length=length, shuffle=True)
-
-        if isinstance(X, (np.ndarray, tuple, list)):
-            X = [x.astype(np.float32, copy=False) for x in X]
-
-        # sanity checks
-        len(X)==len(Y) and len(X)>0 or _raise(ValueError("X and Y can't be empty and must have same length"))
-
-        if classes is None:
-            # set classes to None for all images (i.e. defaults to every object instance assigned the same class)
-            classes = (None,)*len(X)
-        else:
-            n_classes is not None or warnings.warn("Ignoring classes since n_classes is None")
-
-        len(classes)==len(X) or _raise(ValueError("X and classes must have same length"))
-
-        self.n_classes, self.classes = n_classes, classes
-
-        nD = len(patch_size)
-        assert nD in (2,3)
-        x_ndim = X[0].ndim
-        assert x_ndim in (nD,nD+1)
-
-        if isinstance(X, (np.ndarray, tuple, list)) and \
-           isinstance(Y, (np.ndarray, tuple, list)):
-            all(y.ndim==nD and x.ndim==x_ndim and x.shape[:nD]==y.shape for x,y in zip(X,Y)) or _raise(ValueError("images and masks should have corresponding shapes/dimensions"))
-            all(x.shape[:nD]>=tuple(patch_size) for x in X) or _raise(ValueError("Some images are too small for given patch_size {patch_size}".format(patch_size=patch_size)))
-
-        if x_ndim == nD:
-            self.n_channel = None
-        else:
-            self.n_channel = X[0].shape[-1]
-            if isinstance(X, (np.ndarray, tuple, list)):
-                assert all(x.shape[-1]==self.n_channel for x in X)
-
-        assert 0 <= foreground_prob <= 1
-
-        self.X, self.Y = X, Y
-        # self.batch_size = batch_size
-        self.n_rays = n_rays
-        self.patch_size = patch_size
-        self.ss_grid = (slice(None),) + tuple(slice(0, None, g) for g in grid)
-        self.grid = tuple(grid)
-        self.use_gpu = bool(use_gpu)
-        if augmenter is None:
-            augmenter = lambda *args: args
-        callable(augmenter) or _raise(ValueError("augmenter must be None or callable"))
-        self.augmenter = augmenter
-        self.foreground_prob = foreground_prob
-
-        if self.use_gpu:
-            from gputools import max_filter
-            self.max_filter = lambda y, patch_size: max_filter(y.astype(np.float32), patch_size)
-        else:
-            from scipy.ndimage.filters import maximum_filter
-            self.max_filter = lambda y, patch_size: maximum_filter(y, patch_size, mode='constant')
-
-        self.maxfilter_patch_size = maxfilter_patch_size if maxfilter_patch_size is not None else self.patch_size
-
-        self.sample_ind_cache = sample_ind_cache
-        self._ind_cache_fg  = {}
-        self._ind_cache_all = {}
-        self.lock = threading.Lock()
-
-
-    def get_valid_inds(self, k, foreground_prob=None):
-        if foreground_prob is None:
-            foreground_prob = self.foreground_prob
-        foreground_only = np.random.uniform() < foreground_prob
-        _ind_cache = self._ind_cache_fg if foreground_only else self._ind_cache_all
-        if k in _ind_cache:
-            inds = _ind_cache[k]
-        else:
-            patch_filter = (lambda y,p: self.max_filter(y, self.maxfilter_patch_size) > 0) if foreground_only else None
-            inds = get_valid_inds(self.Y[k], self.patch_size, patch_filter=patch_filter)
-            if self.sample_ind_cache:
-                with self.lock:
-                    _ind_cache[k] = inds
-        if foreground_only and len(inds[0])==0:
-            # no foreground pixels available
-            return self.get_valid_inds(k, foreground_prob=0)
-        return inds
-
-
-    def channels_as_tuple(self, x):
-        if self.n_channel is None:
-            return (x,)
-        else:
-            return tuple(x[...,i] for i in range(self.n_channel))
-
-
-
-class StarDistBase(BaseModel):
-
-    def __init__(self, config, name=None, basedir='.'):
-        super().__init__(config=config, name=name, basedir=basedir)
-        threshs = dict(prob=None, nms=None)
-        if basedir is not None:
-            try:
-                threshs = load_json(str(self.logdir / 'thresholds.json'))
-                print("Loading thresholds from 'thresholds.json'.")
-                if threshs.get('prob') is None or not (0 < threshs.get('prob') < 1):
-                    print("- Invalid 'prob' threshold (%s), using default value." % str(threshs.get('prob')))
-                    threshs['prob'] = None
-                if threshs.get('nms') is None or not (0 < threshs.get('nms') < 1):
-                    print("- Invalid 'nms' threshold (%s), using default value." % str(threshs.get('nms')))
-                    threshs['nms'] = None
-            except FileNotFoundError:
-                if config is None and len(tuple(self.logdir.glob('*.h5'))) > 0:
-                    print("Couldn't load thresholds from 'thresholds.json', using default values. "
-                          "(Call 'optimize_thresholds' to change that.)")
-
-        self.thresholds = dict (
-            prob = 0.5 if threshs['prob'] is None else threshs['prob'],
-            nms  = 0.4 if threshs['nms']  is None else threshs['nms'],
-        )
-        print("Using default values: prob_thresh={prob:g}, nms_thresh={nms:g}.".format(prob=self.thresholds.prob, nms=self.thresholds.nms))
-
-
-    @property
-    def thresholds(self):
-        return self._thresholds
-
-    def _is_multiclass(self):
-        return (self.config.n_classes is not None)
-
-    def _parse_classes_arg(self, classes, length):
-        """ creates a proper classes tuple from different possible "classes" arguments in model.train()
-
-        classes can be
-          "auto" -> all objects will be assigned to the first foreground class (unless n_classes is None)
-          single integer -> all objects will be assigned that class
-          tuple, list, ndarray -> do nothing (needs to be of given length)
-
-        returns a tuple of given length
-        """
-        if isinstance(classes, str):
-            classes == "auto" or _raise(ValueError(f"classes = '{classes}': only 'auto' supported as string argument for classes"))
-            if self.config.n_classes is None:
-                classes = None
-            elif self.config.n_classes == 1:
-                classes = (1,)*length
-            else:
-                raise ValueError("using classes = 'auto' for n_classes > 1 not supported")
-        elif isinstance(classes, (tuple, list, np.ndarray)):
-            len(classes) == length or _raise(ValueError(f"len(classes) should be {length}!"))
-        else:
-            raise ValueError("classes should either be 'auto' or a list of scalars/label dicts")
-        return classes
-
-    @thresholds.setter
-    def thresholds(self, d):
-        self._thresholds = namedtuple('Thresholds',d.keys())(*d.values())
-
-
-    def prepare_for_training(self, optimizer=None):
-        """Prepare for neural network training.
-
-        Compiles the model and creates
-        `Keras Callbacks <https://keras.io/callbacks/>`_ to be used for training.
-
-        Note that this method will be implicitly called once by :func:`train`
-        (with default arguments) if not done so explicitly beforehand.
-
-        Parameters
-        ----------
-        optimizer : obj or None
-            Instance of a `Keras Optimizer <https://keras.io/optimizers/>`_ to be used for training.
-            If ``None`` (default), uses ``Adam`` with the learning rate specified in ``config``.
-
-        """
-        if optimizer is None:
-            optimizer = Adam(self.config.train_learning_rate)
-
-        masked_dist_loss = {'mse': masked_loss_mse,
-                            'mae': masked_loss_mae,
-                            'iou': masked_loss_iou,
-                            }[self.config.train_dist_loss]
-        prob_loss = 'binary_crossentropy'
-
-
-        def split_dist_true_mask(dist_true_mask):
-            return tf.split(dist_true_mask, num_or_size_splits=[self.config.n_rays,-1], axis=-1)
-
-        def dist_loss(dist_true_mask, dist_pred):
-            dist_true, dist_mask = split_dist_true_mask(dist_true_mask)
-            return masked_dist_loss(dist_mask, reg_weight=self.config.train_background_reg)(dist_true, dist_pred)
-
-        def dist_iou_metric(dist_true_mask, dist_pred):
-            dist_true, dist_mask = split_dist_true_mask(dist_true_mask)
-            return masked_metric_iou(dist_mask, reg_weight=0)(dist_true, dist_pred)
-
-        def relevant_mae(dist_true_mask, dist_pred):
-            dist_true, dist_mask = split_dist_true_mask(dist_true_mask)
-            return masked_metric_mae(dist_mask)(dist_true, dist_pred)
-
-        def relevant_mse(dist_true_mask, dist_pred):
-            dist_true, dist_mask = split_dist_true_mask(dist_true_mask)
-            return masked_metric_mse(dist_mask)(dist_true, dist_pred)
-
-
-        if self._is_multiclass():
-            prob_class_loss = weighted_categorical_crossentropy(self.config.train_class_weights, ndim=self.config.n_dim)
-            loss = [prob_loss, dist_loss, prob_class_loss]
-        else:
-            loss = [prob_loss, dist_loss]
-
-        self.keras_model.compile(optimizer, loss         = loss,
-                                            loss_weights = list(self.config.train_loss_weights),
-                                            metrics      = {'prob': kld,
-                                                            'dist': [relevant_mae, relevant_mse, dist_iou_metric]})
-
-        self.callbacks = []
-        if self.basedir is not None:
-            self.callbacks += self._checkpoint_callbacks()
-
-            if self.config.train_tensorboard:
-                if IS_TF_1:
-                    self.callbacks.append(CARETensorBoard(log_dir=str(self.logdir), prefix_with_timestamp=False, n_images=3, write_images=True, prob_out=False))
-                else:
-                    self.callbacks.append(TensorBoard(log_dir=str(self.logdir/'logs'), write_graph=False, profile_batch=0))
-
-        if self.config.train_reduce_lr is not None:
-            rlrop_params = self.config.train_reduce_lr
-            if 'verbose' not in rlrop_params:
-                rlrop_params['verbose'] = True
-            # TF2: add as first callback to put 'lr' in the logs for TensorBoard
-            self.callbacks.insert(0,ReduceLROnPlateau(**rlrop_params))
-
-        self._model_prepared = True
-
-
-    def _predict_setup(self, img, axes, normalizer, n_tiles, show_tile_progress, predict_kwargs):
-        """ Shared setup code between `predict` and `predict_sparse` """
-        if n_tiles is None:
-            n_tiles = [1]*img.ndim
-        try:
-            n_tiles = tuple(n_tiles)
-            img.ndim == len(n_tiles) or _raise(TypeError())
-        except TypeError:
-            raise ValueError("n_tiles must be an iterable of length %d" % img.ndim)
-        all(np.isscalar(t) and 1<=t and int(t)==t for t in n_tiles) or _raise(
-            ValueError("all values of n_tiles must be integer values >= 1"))
-
-        n_tiles = tuple(map(int,n_tiles))
-
-        axes     = self._normalize_axes(img, axes)
-        axes_net = self.config.axes
-
-        _permute_axes = self._make_permute_axes(axes, axes_net)
-        x = _permute_axes(img) # x has axes_net semantics
-
-        channel = axes_dict(axes_net)['C']
-        self.config.n_channel_in == x.shape[channel] or _raise(ValueError())
-        axes_net_div_by = self._axes_div_by(axes_net)
-
-        grid = tuple(self.config.grid)
-        len(grid) == len(axes_net)-1 or _raise(ValueError())
-        grid_dict = dict(zip(axes_net.replace('C',''),grid))
-
-        normalizer = self._check_normalizer_resizer(normalizer, None)[0]
-        resizer = StarDistPadAndCropResizer(grid=grid_dict)
-
-        x = normalizer.before(x, axes_net)
-        x = resizer.before(x, axes_net, axes_net_div_by)
-
-        if not _is_floatarray(x):
-            warnings.warn("Predicting on non-float input... ( forgot to normalize? )")
-
-        def predict_direct(x):
-            ys = self.keras_model.predict(x[np.newaxis], **predict_kwargs)
-            return tuple(y[0] for y in ys)
-
-        def tiling_setup():
-            assert np.prod(n_tiles) > 1
-            tiling_axes   = axes_net.replace('C','') # axes eligible for tiling
-            x_tiling_axis = tuple(axes_dict(axes_net)[a] for a in tiling_axes) # numerical axis ids for x
-            axes_net_tile_overlaps = self._axes_tile_overlap(axes_net)
-            # hack: permute tiling axis in the same way as img -> x was permuted
-            _n_tiles = _permute_axes(np.empty(n_tiles,bool)).shape
-            (all(_n_tiles[i] == 1 for i in range(x.ndim) if i not in x_tiling_axis) or
-                _raise(ValueError("entry of n_tiles > 1 only allowed for axes '%s'" % tiling_axes)))
-
-            sh = [s//grid_dict.get(a,1) for a,s in zip(axes_net,x.shape)]
-            sh[channel] = None
-            def create_empty_output(n_channel, dtype=np.float32):
-                sh[channel] = n_channel
-                return np.empty(sh,dtype)
-
-            if callable(show_tile_progress):
-                progress, _show_tile_progress = show_tile_progress, True
-            else:
-                progress, _show_tile_progress = tqdm, show_tile_progress
-
-            n_block_overlaps = [int(np.ceil(overlap/blocksize)) for overlap, blocksize
-                                in zip(axes_net_tile_overlaps, axes_net_div_by)]
-
-            num_tiles_used = total_n_tiles(x, _n_tiles, block_sizes=axes_net_div_by, n_block_overlaps=n_block_overlaps)
-
-            tile_generator = progress(tile_iterator(x, _n_tiles, block_sizes=axes_net_div_by, n_block_overlaps=n_block_overlaps),
-                                                    disable=(not _show_tile_progress), total=num_tiles_used)
-
-            return tile_generator, tuple(sh), create_empty_output
-
-        return x, axes, axes_net, axes_net_div_by, _permute_axes, resizer, n_tiles, grid, grid_dict, channel, predict_direct, tiling_setup
-
-
-    def _predict_generator(self, img, axes=None, normalizer=None, n_tiles=None, show_tile_progress=True, **predict_kwargs):
-        """Predict.
-
-        Parameters
-        ----------
-        img : :class:`numpy.ndarray`
-            Input image
-        axes : str or None
-            Axes of the input ``img``.
-            ``None`` denotes that axes of img are the same as denoted in the config.
-        normalizer : :class:`csbdeep.data.Normalizer` or None
-            (Optional) normalization of input image before prediction.
-            Note that the default (``None``) assumes ``img`` to be already normalized.
-        n_tiles : iterable or None
-            Out of memory (OOM) errors can occur if the input image is too large.
-            To avoid this problem, the input image is broken up into (overlapping) tiles
-            that are processed independently and re-assembled.
-            This parameter denotes a tuple of the number of tiles for every image axis (see ``axes``).
-            ``None`` denotes that no tiling should be used.
-        show_tile_progress: bool or callable
-            If boolean, indicates whether to show progress (via tqdm) during tiled prediction.
-            If callable, must be a drop-in replacement for tqdm.
-        show_tile_progress: bool
-            Whether to show progress during tiled prediction.
-        predict_kwargs: dict
-            Keyword arguments for ``predict`` function of Keras model.
-
-        Returns
-        -------
-        (:class:`numpy.ndarray`, :class:`numpy.ndarray`, [:class:`numpy.ndarray`])
-            Returns the tuple (`prob`, `dist`, [`prob_class`]) of per-pixel object probabilities and star-convex polygon/polyhedra distances.
-            In multiclass prediction mode, `prob_class` is the probability map for each of the 1+'n_classes' classes (first class is background)
-
-        """
-
-        x, axes, axes_net, axes_net_div_by, _permute_axes, resizer, n_tiles, grid, grid_dict, channel, predict_direct, tiling_setup = \
-            self._predict_setup(img, axes, normalizer, n_tiles, show_tile_progress, predict_kwargs)
-
-        if np.prod(n_tiles) > 1:
-            tile_generator, output_shape, create_empty_output = tiling_setup()
-
-            prob = create_empty_output(1)
-            dist = create_empty_output(self.config.n_rays)
-            if self._is_multiclass():
-                prob_class = create_empty_output(self.config.n_classes+1)
-                result = (prob, dist, prob_class)
-            else:
-                result = (prob, dist)
-
-            for tile, s_src, s_dst in tile_generator:
-                # predict_direct -> prob, dist, [prob_class if multi_class]
-                result_tile = predict_direct(tile)
-                # account for grid
-                s_src = [slice(s.start//grid_dict.get(a,1),s.stop//grid_dict.get(a,1)) for s,a in zip(s_src,axes_net)]
-                s_dst = [slice(s.start//grid_dict.get(a,1),s.stop//grid_dict.get(a,1)) for s,a in zip(s_dst,axes_net)]
-                # prob and dist have different channel dimensionality than image x
-                s_src[channel] = slice(None)
-                s_dst[channel] = slice(None)
-                s_src, s_dst = tuple(s_src), tuple(s_dst)
-                # print(s_src,s_dst)
-                for part, part_tile in zip(result, result_tile):
-                    part[s_dst] = part_tile[s_src]
-                yield  # yield None after each processed tile
-        else:
-            # predict_direct -> prob, dist, [prob_class if multi_class]
-            result = predict_direct(x)
-
-        result = [resizer.after(part, axes_net) for part in result]
-
-        # result = (prob, dist) for legacy or (prob, dist, prob_class) for multiclass
-
-        # prob
-        result[0] = np.take(result[0],0,axis=channel)
-        # dist
-        result[1] = np.maximum(1e-3, result[1]) # avoid small dist values to prevent problems with Qhull
-        result[1] = np.moveaxis(result[1],channel,-1)
-
-        if self._is_multiclass():
-            # prob_class
-            result[2] = np.moveaxis(result[2],channel,-1)
-
-        # last "yield" is the actual output that would have been "return"ed if this was a regular function
-        yield tuple(result)
-
-
-    @functools.wraps(_predict_generator)
-    def predict(self, *args, **kwargs):
-        # return last "yield"ed value of generator
-        r = None
-        for r in self._predict_generator(*args, **kwargs):
-            pass
-        return r
-
-
-    def _predict_sparse_generator(self, img, prob_thresh=None, axes=None, normalizer=None, n_tiles=None, show_tile_progress=True, b=2, **predict_kwargs):
-        """ Sparse version of model.predict()
-        Returns
-        -------
-        (prob, dist, [prob_class], points)   flat list of probs, dists, (optional prob_class) and points
-        """
-        if prob_thresh is None: prob_thresh = self.thresholds.prob
-
-        x, axes, axes_net, axes_net_div_by, _permute_axes, resizer, n_tiles, grid, grid_dict, channel, predict_direct, tiling_setup = \
-            self._predict_setup(img, axes, normalizer, n_tiles, show_tile_progress, predict_kwargs)
-
-        def _prep(prob, dist):
-            prob = np.take(prob,0,axis=channel)
-            dist = np.moveaxis(dist,channel,-1)
-            dist = np.maximum(1e-3, dist)
-            return prob, dist
-
-        proba, dista, pointsa, prob_class = [],[],[], []
-
-        if np.prod(n_tiles) > 1:
-            tile_generator, output_shape, create_empty_output = tiling_setup()
-
-            sh = list(output_shape)
-            sh[channel] = 1;
-
-            proba, dista, pointsa, prob_classa = [], [], [], []
-
-            for tile, s_src, s_dst in tile_generator:
-
-                results_tile = predict_direct(tile)
-
-                # account for grid
-                s_src = [slice(s.start//grid_dict.get(a,1),s.stop//grid_dict.get(a,1)) for s,a in zip(s_src,axes_net)]
-                s_dst = [slice(s.start//grid_dict.get(a,1),s.stop//grid_dict.get(a,1)) for s,a in zip(s_dst,axes_net)]
-                s_src[channel] = slice(None)
-                s_dst[channel] = slice(None)
-                s_src, s_dst = tuple(s_src), tuple(s_dst)
-
-                prob_tile, dist_tile = results_tile[:2]
-                prob_tile, dist_tile = _prep(prob_tile[s_src], dist_tile[s_src])
-
-                bs = list((b if s.start==0 else -1, b if s.stop==_sh else -1) for s,_sh in zip(s_dst, sh))
-                bs.pop(channel)
-                inds   = _ind_prob_thresh(prob_tile, prob_thresh, b=bs)
-                proba.extend(prob_tile[inds].copy())
-                dista.extend(dist_tile[inds].copy())
-                _points = np.stack(np.where(inds), axis=1)
-                offset = list(s.start for i,s in enumerate(s_dst))
-                offset.pop(channel)
-                _points = _points + np.array(offset).reshape((1,len(offset)))
-                _points = _points * np.array(self.config.grid).reshape((1,len(self.config.grid)))
-                pointsa.extend(_points)
-
-                if self._is_multiclass():
-                    p = results_tile[2][s_src].copy()
-                    p = np.moveaxis(p,channel,-1)
-                    prob_classa.extend(p[inds])
-                yield  # yield None after each processed tile
-
-        else:
-            # predict_direct -> prob, dist, [prob_class if multi_class]
-            results = predict_direct(x)
-            prob, dist = results[:2]
-            prob, dist = _prep(prob, dist)
-            inds   = _ind_prob_thresh(prob, prob_thresh, b=b)
-            proba = prob[inds].copy()
-            dista = dist[inds].copy()
-            _points = np.stack(np.where(inds), axis=1)
-            pointsa = (_points * np.array(self.config.grid).reshape((1,len(self.config.grid))))
-
-            if self._is_multiclass():
-                p = np.moveaxis(results[2],channel,-1)
-                prob_classa = p[inds].copy()
-
-
-        proba = np.asarray(proba)
-        dista = np.asarray(dista).reshape((-1,self.config.n_rays))
-        pointsa = np.asarray(pointsa).reshape((-1,self.config.n_dim))
-
-        idx = resizer.filter_points(x.ndim, pointsa, axes_net)
-        proba = proba[idx]
-        dista = dista[idx]
-        pointsa = pointsa[idx]
-
-        # last "yield" is the actual output that would have been "return"ed if this was a regular function
-        if self._is_multiclass():
-            prob_classa = np.asarray(prob_classa).reshape((-1,self.config.n_classes+1))
-            prob_classa = prob_classa[idx]
-            yield proba, dista, prob_classa, pointsa
-        else:
-            prob_classa = None
-            yield proba, dista, pointsa
-
-
-    @functools.wraps(_predict_sparse_generator)
-    def predict_sparse(self, *args, **kwargs):
-        # return last "yield"ed value of generator
-        r = None
-        for r in self._predict_sparse_generator(*args, **kwargs):
-            pass
-        return r
-
-
-    def _predict_instances_generator(self, img, axes=None, normalizer=None,
-                                     sparse=True,
-                                     prob_thresh=None, nms_thresh=None,
-                                     scale=None,
-                                     n_tiles=None, show_tile_progress=True,
-                                     verbose=False,
-                                     return_labels=True,
-                                     predict_kwargs=None, nms_kwargs=None,
-                                     overlap_label=None, return_predict=False):
-        """Predict instance segmentation from input image.
-
-        Parameters
-        ----------
-        img : :class:`numpy.ndarray`
-            Input image
-        axes : str or None
-            Axes of the input ``img``.
-            ``None`` denotes that axes of img are the same as denoted in the config.
-        normalizer : :class:`csbdeep.data.Normalizer` or None
-            (Optional) normalization of input image before prediction.
-            Note that the default (``None``) assumes ``img`` to be already normalized.
-        sparse: bool
-            If true, aggregate probabilities/distances sparsely during tiled
-            prediction to save memory (recommended).
-        prob_thresh : float or None
-            Consider only object candidates from pixels with predicted object probability
-            above this threshold (also see `optimize_thresholds`).
-        nms_thresh : float or None
-            Perform non-maximum suppression that considers two objects to be the same
-            when their area/surface overlap exceeds this threshold (also see `optimize_thresholds`).
-        scale: None or float or iterable
-            Scale the input image internally by this factor and rescale the output accordingly.
-            All spatial axes (X,Y,Z) will be scaled if a scalar value is provided.
-            Alternatively, multiple scale values (compatible with input `axes`) can be used
-            for more fine-grained control (scale values for non-spatial axes must be 1).
-        n_tiles : iterable or None
-            Out of memory (OOM) errors can occur if the input image is too large.
-            To avoid this problem, the input image is broken up into (overlapping) tiles
-            that are processed independently and re-assembled.
-            This parameter denotes a tuple of the number of tiles for every image axis (see ``axes``).
-            ``None`` denotes that no tiling should be used.
-        show_tile_progress: bool
-            Whether to show progress during tiled prediction.
-        verbose: bool
-            Whether to print some info messages.
-        return_labels: bool
-            Whether to create a label image, otherwise return None in its place.
-        predict_kwargs: dict
-            Keyword arguments for ``predict`` function of Keras model.
-        nms_kwargs: dict
-            Keyword arguments for non-maximum suppression.
-        overlap_label: scalar or None
-            if not None, label the regions where polygons overlap with that value
-        return_predict: bool
-            Also return the outputs of :func:`predict` (in a separate tuple)
-            If True, implies sparse = False
-
-        Returns
-        -------
-        (:class:`numpy.ndarray`, dict), (optional: return tuple of :func:`predict`)
-            Returns a tuple of the label instances image and also
-            a dictionary with the details (coordinates, etc.) of all remaining polygons/polyhedra.
-
-        """
-        if predict_kwargs is None:
-            predict_kwargs = {}
-        if nms_kwargs is None:
-            nms_kwargs = {}
-
-        if return_predict and sparse:
-            sparse = False
-            warnings.warn("Setting sparse to False because return_predict is True")
-
-        nms_kwargs.setdefault("verbose", verbose)
-
-        _axes         = self._normalize_axes(img, axes)
-        _axes_net     = self.config.axes
-        _permute_axes = self._make_permute_axes(_axes, _axes_net)
-        _shape_inst   = tuple(s for s,a in zip(_permute_axes(img).shape, _axes_net) if a != 'C')
-
-        if scale is not None:
-            if isinstance(scale, numbers.Number):
-                scale = tuple(scale if a in 'XYZ' else 1 for a in _axes)
-            scale = tuple(scale)
-            len(scale) == len(_axes) or _raise(ValueError(f"scale {scale} must be of length {len(_axes)}, i.e. one value for each of the axes {_axes}"))
-            for s,a in zip(scale,_axes):
-                s > 0 or _raise(ValueError("scale values must be greater than 0"))
-                (s in (1,None) or a in 'XYZ') or warnings.warn(f"replacing scale value {s} for non-spatial axis {a} with 1")
-            scale = tuple(s if a in 'XYZ' else 1 for s,a in zip(scale,_axes))
-            verbose and print(f"scaling image by factors {scale} for axes {_axes}")
-            img = ndi.zoom(img, scale, order=1)
-
-        yield 'predict'  # indicate that prediction is starting
-        res = None
-        if sparse:
-            for res in self._predict_sparse_generator(img, axes=axes, normalizer=normalizer, n_tiles=n_tiles,
-                                                      prob_thresh=prob_thresh, show_tile_progress=show_tile_progress, **predict_kwargs):
-                if res is None:
-                    yield 'tile'  # yield 'tile' each time a tile has been processed
-        else:
-            for res in self._predict_generator(img, axes=axes, normalizer=normalizer, n_tiles=n_tiles,
-                                               show_tile_progress=show_tile_progress, **predict_kwargs):
-                if res is None:
-                    yield 'tile'  # yield 'tile' each time a tile has been processed
-            res = tuple(res) + (None,)
-
-        if self._is_multiclass():
-            prob, dist, prob_class, points = res
-        else:
-            prob, dist, points = res
-            prob_class = None
-
-        yield 'nms'  # indicate that non-maximum suppression is starting
-        res_instances = self._instances_from_prediction(_shape_inst, prob, dist,
-                                                        points=points,
-                                                        prob_class=prob_class,
-                                                        prob_thresh=prob_thresh,
-                                                        nms_thresh=nms_thresh,
-                                                        scale=(None if scale is None else dict(zip(_axes,scale))),
-                                                        return_labels=return_labels,
-                                                        overlap_label=overlap_label,
-                                                        **nms_kwargs)
-
-        # last "yield" is the actual output that would have been "return"ed if this was a regular function
-        if return_predict:
-            yield res_instances, tuple(res[:-1])
-        else:
-            yield res_instances
-
-
-    @functools.wraps(_predict_instances_generator)
-    def predict_instances(self, *args, **kwargs):
-        # the reason why the actual computation happens as a generator function
-        # (in '_predict_instances_generator') is that the generator is called
-        # from the stardist napari plugin, which has its benefits regarding
-        # control flow and progress display. however, typical use cases should
-        # almost always use this function ('predict_instances'), and shouldn't
-        # even notice (thanks to @functools.wraps) that it wraps the generator
-        # function. note that similar reasoning applies to 'predict' and
-        # 'predict_sparse'.
-
-        # return last "yield"ed value of generator
-        r = None
-        for r in self._predict_instances_generator(*args, **kwargs):
-            pass
-        return r
-
-
-    # def _predict_instances_old(self, img, axes=None, normalizer=None,
-    #                       sparse = False,
-    #                       prob_thresh=None, nms_thresh=None,
-    #                       n_tiles=None, show_tile_progress=True,
-    #                       verbose = False,
-    #                       predict_kwargs=None, nms_kwargs=None, overlap_label=None):
-    #     """
-    #     old version, should be removed....
-    #     """
-    #     if predict_kwargs is None:
-    #         predict_kwargs = {}
-    #     if nms_kwargs is None:
-    #         nms_kwargs = {}
-
-    #     nms_kwargs.setdefault("verbose", verbose)
-
-    #     _axes         = self._normalize_axes(img, axes)
-    #     _axes_net     = self.config.axes
-    #     _permute_axes = self._make_permute_axes(_axes, _axes_net)
-    #     _shape_inst   = tuple(s for s,a in zip(_permute_axes(img).shape, _axes_net) if a != 'C')
-
-
-    #     res = self.predict(img, axes=axes, normalizer=normalizer,
-    #                                   n_tiles=n_tiles,
-    #                                   show_tile_progress=show_tile_progress,
-    #                                   **predict_kwargs)
-
-    #     res = tuple(res) + (None,)
-
-    #     if self._is_multiclass():
-    #         prob, dist, prob_class, points = res
-    #     else:
-    #         prob, dist, points = res
-    #         prob_class = None
-
-
-    #     return self._instances_from_prediction_old(_shape_inst, prob, dist,
-    #                                            points = points,
-    #                                            prob_class = prob_class,
-    #                                            prob_thresh=prob_thresh,
-    #                                            nms_thresh=nms_thresh,
-    #                                            overlap_label=overlap_label,
-    #                                            **nms_kwargs)
-
-
-    def predict_instances_big(self, img, axes, block_size, min_overlap, context=None,
-                              labels_out=None, labels_out_dtype=np.int32, show_progress=True, **kwargs):
-        """Predict instance segmentation from very large input images.
-
-        Intended to be used when `predict_instances` cannot be used due to memory limitations.
-        This function will break the input image into blocks and process them individually
-        via `predict_instances` and assemble all the partial results. If used as intended, the result
-        should be the same as if `predict_instances` was used directly on the whole image.
-
-        **Important**: The crucial assumption is that all predicted object instances are smaller than
-                       the provided `min_overlap`. Also, it must hold that: min_overlap + 2*context < block_size.
-
-        Example
-        -------
-        >>> img.shape
-        (20000, 20000)
-        >>> labels, polys = model.predict_instances_big(img, axes='YX', block_size=4096,
-                                                        min_overlap=128, context=128, n_tiles=(4,4))
-
-        Parameters
-        ----------
-        img: :class:`numpy.ndarray` or similar
-            Input image
-        axes: str
-            Axes of the input ``img`` (such as 'YX', 'ZYX', 'YXC', etc.)
-        block_size: int or iterable of int
-            Process input image in blocks of the provided shape.
-            (If a scalar value is given, it is used for all spatial image dimensions.)
-        min_overlap: int or iterable of int
-            Amount of guaranteed overlap between blocks.
-            (If a scalar value is given, it is used for all spatial image dimensions.)
-        context: int or iterable of int, or None
-            Amount of image context on all sides of a block, which is discarded.
-            If None, uses an automatic estimate that should work in many cases.
-            (If a scalar value is given, it is used for all spatial image dimensions.)
-        labels_out: :class:`numpy.ndarray` or similar, or None, or False
-            numpy array or similar (must be of correct shape) to which the label image is written.
-            If None, will allocate a numpy array of the correct shape and data type ``labels_out_dtype``.
-            If False, will not write the label image (useful if only the dictionary is needed).
-        labels_out_dtype: str or dtype
-            Data type of returned label image if ``labels_out=None`` (has no effect otherwise).
-        show_progress: bool
-            Show progress bar for block processing.
-        kwargs: dict
-            Keyword arguments for ``predict_instances``.
-
-        Returns
-        -------
-        (:class:`numpy.ndarray` or False, dict)
-            Returns the label image and a dictionary with the details (coordinates, etc.) of the polygons/polyhedra.
-
-        """
-        from ..big import _grid_divisible, BlockND, OBJECT_KEYS#, repaint_labels
-        from ..matching import relabel_sequential
-
-        n = img.ndim
-        axes = axes_check_and_normalize(axes, length=n)
-        grid = self._axes_div_by(axes)
-        axes_out = self._axes_out.replace('C','')
-        shape_dict = dict(zip(axes,img.shape))
-        shape_out = tuple(shape_dict[a] for a in axes_out)
-
-        if context is None:
-            context = self._axes_tile_overlap(axes)
-
-        if np.isscalar(block_size):  block_size  = n*[block_size]
-        if np.isscalar(min_overlap): min_overlap = n*[min_overlap]
-        if np.isscalar(context):     context     = n*[context]
-        block_size, min_overlap, context = list(block_size), list(min_overlap), list(context)
-        assert n == len(block_size) == len(min_overlap) == len(context)
-
-        if 'C' in axes:
-            # single block for channel axis
-            i = axes_dict(axes)['C']
-            # if (block_size[i], min_overlap[i], context[i]) != (None, None, None):
-            #     print("Ignoring values of 'block_size', 'min_overlap', and 'context' for channel axis " +
-            #           "(set to 'None' to avoid this warning).", file=sys.stderr, flush=True)
-            block_size[i] = img.shape[i]
-            min_overlap[i] = context[i] = 0
-
-        block_size  = tuple(_grid_divisible(g, v, name='block_size',  verbose=False) for v,g,a in zip(block_size, grid,axes))
-        min_overlap = tuple(_grid_divisible(g, v, name='min_overlap', verbose=False) for v,g,a in zip(min_overlap,grid,axes))
-        context     = tuple(_grid_divisible(g, v, name='context',     verbose=False) for v,g,a in zip(context,    grid,axes))
-
-        # print(f"input: shape {img.shape} with axes {axes}")
-        print(f'effective: block_size={block_size}, min_overlap={min_overlap}, context={context}', flush=True)
-
-        for a,c,o in zip(axes,context,self._axes_tile_overlap(axes)):
-            if c < o:
-                print(f"{a}: context of {c} is small, recommended to use at least {o}", flush=True)
-
-        # create block cover
-        blocks = BlockND.cover(img.shape, axes, block_size, min_overlap, context, grid)
-
-        if np.isscalar(labels_out) and bool(labels_out) is False:
-            labels_out = None
-        else:
-            if labels_out is None:
-                labels_out = np.zeros(shape_out, dtype=labels_out_dtype)
-            else:
-                labels_out.shape == shape_out or _raise(ValueError(f"'labels_out' must have shape {shape_out} (axes {axes_out})."))
-
-        polys_all = {}
-        # problem_ids = []
-        label_offset = 1
-
-        kwargs_override = dict(axes=axes, overlap_label=None, return_labels=True, return_predict=False)
-        if show_progress:
-            kwargs_override['show_tile_progress'] = False # disable progress for predict_instances
-        for k,v in kwargs_override.items():
-            if k in kwargs: print(f"changing '{k}' from {kwargs[k]} to {v}", flush=True)
-            kwargs[k] = v
-
-        blocks = tqdm(blocks, disable=(not show_progress))
-        # actual computation
-        for block in blocks:
-            labels, polys = self.predict_instances(block.read(img, axes=axes), **kwargs)
-            labels = block.crop_context(labels, axes=axes_out)
-            labels, polys = block.filter_objects(labels, polys, axes=axes_out)
-            # TODO: relabel_sequential is not very memory-efficient (will allocate memory proportional to label_offset)
-            # this should not change the order of labels
-            labels = relabel_sequential(labels, label_offset)[0]
-
-            # labels, fwd_map, _ = relabel_sequential(labels, label_offset)
-            # if len(incomplete) > 0:
-            #     problem_ids.extend([fwd_map[i] for i in incomplete])
-            #     if show_progress:
-            #         blocks.set_postfix_str(f"found {len(problem_ids)} problematic {'object' if len(problem_ids)==1 else 'objects'}")
-            if labels_out is not None:
-                block.write(labels_out, labels, axes=axes_out)
-
-            for k,v in polys.items():
-                polys_all.setdefault(k,[]).append(v)
-
-            label_offset += len(polys['prob'])
-            del labels
-
-        polys_all = {k: (np.concatenate(v) if k in OBJECT_KEYS else v[0]) for k,v in polys_all.items()}
-
-        # if labels_out is not None and len(problem_ids) > 0:
-        #     # if show_progress:
-        #     #     blocks.write('')
-        #     # print(f"Found {len(problem_ids)} objects that violate the 'min_overlap' assumption.", file=sys.stderr, flush=True)
-        #     repaint_labels(labels_out, problem_ids, polys_all, show_progress=False)
-
-        return labels_out, polys_all#, tuple(problem_ids)
-
-
-    def optimize_thresholds(self, X_val, Y_val, nms_threshs=[0.3,0.4,0.5], iou_threshs=[0.3,0.5,0.7], predict_kwargs=None, optimize_kwargs=None, save_to_json=True):
-        """Optimize two thresholds (probability, NMS overlap) necessary for predicting object instances.
-
-        Note that the default thresholds yield good results in many cases, but optimizing
-        the thresholds for a particular dataset can further improve performance.
-
-        The optimized thresholds are automatically used for all further predictions
-        and also written to the model directory.
-
-        See ``utils.optimize_threshold`` for details and possible choices for ``optimize_kwargs``.
-
-        Parameters
-        ----------
-        X_val : list of ndarray
-            (Validation) input images (must be normalized) to use for threshold tuning.
-        Y_val : list of ndarray
-            (Validation) label images to use for threshold tuning.
-        nms_threshs : list of float
-            List of overlap thresholds to be considered for NMS.
-            For each value in this list, optimization is run to find a corresponding prob_thresh value.
-        iou_threshs : list of float
-            List of intersection over union (IOU) thresholds for which
-            the (average) matching performance is considered to tune the thresholds.
-        predict_kwargs: dict
-            Keyword arguments for ``predict`` function of this class.
-            (If not provided, will guess value for `n_tiles` to prevent out of memory errors.)
-        optimize_kwargs: dict
-            Keyword arguments for ``utils.optimize_threshold`` function.
-
-        """
-        if predict_kwargs is None:
-            predict_kwargs = {}
-        if optimize_kwargs is None:
-            optimize_kwargs = {}
-
-        def _predict_kwargs(x):
-            if 'n_tiles' in predict_kwargs:
-                return predict_kwargs
-            else:
-                return {**predict_kwargs, 'n_tiles': self._guess_n_tiles(x), 'show_tile_progress': False}
-
-        # only take first two elements of predict in case multi class is activated
-        Yhat_val = [self.predict(x, **_predict_kwargs(x))[:2] for x in X_val]
-
-        opt_prob_thresh, opt_measure, opt_nms_thresh = None, -np.inf, None
-        for _opt_nms_thresh in nms_threshs:
-            _opt_prob_thresh, _opt_measure = optimize_threshold(Y_val, Yhat_val, model=self, nms_thresh=_opt_nms_thresh, iou_threshs=iou_threshs, **optimize_kwargs)
-            if _opt_measure > opt_measure:
-                opt_prob_thresh, opt_measure, opt_nms_thresh = _opt_prob_thresh, _opt_measure, _opt_nms_thresh
-        opt_threshs = dict(prob=opt_prob_thresh, nms=opt_nms_thresh)
-
-        self.thresholds = opt_threshs
-        print(end='', file=sys.stderr, flush=True)
-        print("Using optimized values: prob_thresh={prob:g}, nms_thresh={nms:g}.".format(prob=self.thresholds.prob, nms=self.thresholds.nms))
-        if save_to_json and self.basedir is not None:
-            print("Saving to 'thresholds.json'.")
-            save_json(opt_threshs, str(self.logdir / 'thresholds.json'))
-        return opt_threshs
-
-
-    def _guess_n_tiles(self, img):
-        axes = self._normalize_axes(img, axes=None)
-        shape = list(img.shape)
-        if 'C' in axes:
-            del shape[axes_dict(axes)['C']]
-        b = self.config.train_batch_size**(1.0/self.config.n_dim)
-        n_tiles = [int(np.ceil(s/(p*b))) for s,p in zip(shape,self.config.train_patch_size)]
-        if 'C' in axes:
-            n_tiles.insert(axes_dict(axes)['C'],1)
-        return tuple(n_tiles)
-
-
-    def _normalize_axes(self, img, axes):
-        if axes is None:
-            axes = self.config.axes
-            assert 'C' in axes
-            if img.ndim == len(axes)-1 and self.config.n_channel_in == 1:
-                # img has no dedicated channel axis, but 'C' always part of config axes
-                axes = axes.replace('C','')
-        return axes_check_and_normalize(axes, img.ndim)
-
-
-    def _compute_receptive_field(self, img_size=None):
-        # TODO: good enough?
-        from scipy.ndimage import zoom
-        if img_size is None:
-            img_size = tuple(g*(128 if self.config.n_dim==2 else 64) for g in self.config.grid)
-        if np.isscalar(img_size):
-            img_size = (img_size,) * self.config.n_dim
-        img_size = tuple(img_size)
-        # print(img_size)
-        assert all(_is_power_of_2(s) for s in img_size)
-        mid = tuple(s//2 for s in img_size)
-        x = np.zeros((1,)+img_size+(self.config.n_channel_in,), dtype=np.float32)
-        z = np.zeros_like(x)
-        x[(0,)+mid+(slice(None),)] = 1
-        y  = self.keras_model.predict(x)[0][0,...,0]
-        y0 = self.keras_model.predict(z)[0][0,...,0]
-        grid = tuple((np.array(x.shape[1:-1])/np.array(y.shape)).astype(int))
-        assert grid == self.config.grid
-        y  = zoom(y, grid,order=0)
-        y0 = zoom(y0,grid,order=0)
-        ind = np.where(np.abs(y-y0)>0)
-        return [(m-np.min(i), np.max(i)-m) for (m,i) in zip(mid,ind)]
-
-
-    def _axes_tile_overlap(self, query_axes):
-        query_axes = axes_check_and_normalize(query_axes)
-        try:
-            self._tile_overlap
-        except AttributeError:
-            self._tile_overlap = self._compute_receptive_field()
-        overlap = dict(zip(
-            self.config.axes.replace('C',''),
-            tuple(max(rf) for rf in self._tile_overlap)
-        ))
-        return tuple(overlap.get(a,0) for a in query_axes)
-
-
-    def export_TF(self, fname=None, single_output=True, upsample_grid=True):
-        """Export model to TensorFlow's SavedModel format that can be used e.g. in the Fiji plugin
-
-        Parameters
-        ----------
-        fname : str
-            Path of the zip file to store the model
-            If None, the default path "<modeldir>/TF_SavedModel.zip" is used
-        single_output: bool
-            If set, concatenates the two model outputs into a single output (note: this is currently mandatory for further use in Fiji)
-        upsample_grid: bool
-            If set, upsamples the output to the input shape (note: this is currently mandatory for further use in Fiji)
-        """
-        Concatenate, UpSampling2D, UpSampling3D, Conv2DTranspose, Conv3DTranspose = keras_import('layers', 'Concatenate', 'UpSampling2D', 'UpSampling3D', 'Conv2DTranspose', 'Conv3DTranspose')
-        Model = keras_import('models', 'Model')
-
-        if self.basedir is None and fname is None:
-            raise ValueError("Need explicit 'fname', since model directory not available (basedir=None).")
-
-        if self._is_multiclass():
-            warnings.warn("multi-class mode not supported yet, removing classification output from exported model")
-
-        grid = self.config.grid
-        prob = self.keras_model.outputs[0]
-        dist = self.keras_model.outputs[1]
-        assert self.config.n_dim in (2,3)
-
-        if upsample_grid and any(g>1 for g in grid):
-            # CSBDeep Fiji plugin needs same size input/output
-            # -> we need to upsample the outputs if grid > (1,1)
-            # note: upsampling prob with a transposed convolution creates sparse
-            #       prob output with less candidates than with standard upsampling
-            conv_transpose = Conv2DTranspose if self.config.n_dim==2 else Conv3DTranspose
-            upsampling     = UpSampling2D    if self.config.n_dim==2 else UpSampling3D
-            prob = conv_transpose(1, (1,)*self.config.n_dim,
-                                  strides=grid, padding='same',
-                                  kernel_initializer='ones', use_bias=False)(prob)
-            dist = upsampling(grid)(dist)
-
-        inputs  = self.keras_model.inputs[0]
-        outputs = Concatenate()([prob,dist]) if single_output else [prob,dist]
-        csbdeep_model = Model(inputs, outputs)
-
-        fname = (self.logdir / 'TF_SavedModel.zip') if fname is None else Path(fname)
-        export_SavedModel(csbdeep_model, str(fname))
-        return csbdeep_model
-
-
-
-class StarDistPadAndCropResizer(Resizer):
-
-    # TODO: check correctness
-    def __init__(self, grid, mode='reflect', **kwargs):
-        assert isinstance(grid, dict)
-        self.mode = mode
-        self.grid = grid
-        self.kwargs = kwargs
-
-
-    def before(self, x, axes, axes_div_by):
-        assert all(a%g==0 for g,a in zip((self.grid.get(a,1) for a in axes), axes_div_by))
-        axes = axes_check_and_normalize(axes,x.ndim)
-        def _split(v):
-            return 0, v # only pad at the end
-        self.pad = {
-            a : _split((div_n-s%div_n)%div_n)
-            for a, div_n, s in zip(axes, axes_div_by, x.shape)
-        }
-        x_pad = np.pad(x, tuple(self.pad[a] for a in axes), mode=self.mode, **self.kwargs)
-        self.padded_shape = dict(zip(axes,x_pad.shape))
-        if 'C' in self.padded_shape: del self.padded_shape['C']
-        return x_pad
-
-
-    def after(self, x, axes):
-        # axes can include 'C', which may not have been present in before()
-        axes = axes_check_and_normalize(axes,x.ndim)
-        assert all(s_pad == s * g for s,s_pad,g in zip(x.shape,
-                                                       (self.padded_shape.get(a,_s) for a,_s in zip(axes,x.shape)),
-                                                       (self.grid.get(a,1) for a in axes)))
-        # print(self.padded_shape)
-        # print(self.pad)
-        # print(self.grid)
-        crop = tuple (
-            slice(0, -(math.floor(p[1]/g)) if p[1]>=g else None)
-            for p,g in zip((self.pad.get(a,(0,0)) for a in axes),(self.grid.get(a,1) for a in axes))
-        )
-        # print(crop)
-        return x[crop]
-
-
-    def filter_points(self, ndim, points, axes):
-        """ returns indices of points inside crop region """
-        assert points.ndim==2
-        axes = axes_check_and_normalize(axes,ndim)
-
-        bounds = np.array(tuple(self.padded_shape[a]-self.pad[a][1] for a in axes if a.lower() in ('z','y','x')))
-        idx = np.where(np.all(points< bounds, 1))
-        return idx
-
-
-
-def _tf_version_at_least(version_string="1.0.0"):
-    from packaging import version
-    return version.parse(tf.__version__) >= version.parse(version_string)
diff --git a/spaces/Liu-LAB/GPT-academic/crazy_functions/test_project/cpp/longcode/jpge.cpp b/spaces/Liu-LAB/GPT-academic/crazy_functions/test_project/cpp/longcode/jpge.cpp
deleted file mode 100644
index 2e26b71ed5aad0d46478fdbcd3a880be1401f946..0000000000000000000000000000000000000000
--- a/spaces/Liu-LAB/GPT-academic/crazy_functions/test_project/cpp/longcode/jpge.cpp
+++ /dev/null
@@ -1,1049 +0,0 @@
-// jpge.cpp - C++ class for JPEG compression.
-// Public domain, Rich Geldreich <richgel99@gmail.com>
-// v1.01, Dec. 18, 2010 - Initial release
-// v1.02, Apr. 6, 2011 - Removed 2x2 ordered dither in H2V1 chroma subsampling method load_block_16_8_8(). (The rounding factor was 2, when it should have been 1. Either way, it wasn't helping.)
-// v1.03, Apr. 16, 2011 - Added support for optimized Huffman code tables, optimized dynamic memory allocation down to only 1 alloc.
-//                        Also from Alex Evans: Added RGBA support, linear memory allocator (no longer needed in v1.03).
-// v1.04, May. 19, 2012: Forgot to set m_pFile ptr to NULL in cfile_stream::close(). Thanks to Owen Kaluza for reporting this bug.
-//                       Code tweaks to fix VS2008 static code analysis warnings (all looked harmless).
-//                       Code review revealed method load_block_16_8_8() (used for the non-default H2V1 sampling mode to downsample chroma) somehow didn't get the rounding factor fix from v1.02.
-
-#include "jpge.h"
-
-#include <stdlib.h>
-#include <string.h>
-#if PLATFORM_WINDOWS
-#include <malloc.h>
-#endif
-
-#define JPGE_MAX(a,b) (((a)>(b))?(a):(b))
-#define JPGE_MIN(a,b) (((a)<(b))?(a):(b))
-
-namespace jpge {
-
-static inline void *jpge_malloc(size_t nSize) { return FMemory::Malloc(nSize); }
-static inline void jpge_free(void *p) { FMemory::Free(p);; }
-
-// Various JPEG enums and tables.
-enum { M_SOF0 = 0xC0, M_DHT = 0xC4, M_SOI = 0xD8, M_EOI = 0xD9, M_SOS = 0xDA, M_DQT = 0xDB, M_APP0 = 0xE0 };
-enum { DC_LUM_CODES = 12, AC_LUM_CODES = 256, DC_CHROMA_CODES = 12, AC_CHROMA_CODES = 256, MAX_HUFF_SYMBOLS = 257, MAX_HUFF_CODESIZE = 32 };
-
-static uint8 s_zag[64] = { 0,1,8,16,9,2,3,10,17,24,32,25,18,11,4,5,12,19,26,33,40,48,41,34,27,20,13,6,7,14,21,28,35,42,49,56,57,50,43,36,29,22,15,23,30,37,44,51,58,59,52,45,38,31,39,46,53,60,61,54,47,55,62,63 };
-static int16 s_std_lum_quant[64] = { 16,11,12,14,12,10,16,14,13,14,18,17,16,19,24,40,26,24,22,22,24,49,35,37,29,40,58,51,61,60,57,51,56,55,64,72,92,78,64,68,87,69,55,56,80,109,81,87,95,98,103,104,103,62,77,113,121,112,100,120,92,101,103,99 };
-static int16 s_std_croma_quant[64] = { 17,18,18,24,21,24,47,26,26,47,99,66,56,66,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99 };
-static uint8 s_dc_lum_bits[17] = { 0,0,1,5,1,1,1,1,1,1,0,0,0,0,0,0,0 };
-static uint8 s_dc_lum_val[DC_LUM_CODES] = { 0,1,2,3,4,5,6,7,8,9,10,11 };
-static uint8 s_ac_lum_bits[17] = { 0,0,2,1,3,3,2,4,3,5,5,4,4,0,0,1,0x7d };
-static uint8 s_ac_lum_val[AC_LUM_CODES]  =
-{
-  0x01,0x02,0x03,0x00,0x04,0x11,0x05,0x12,0x21,0x31,0x41,0x06,0x13,0x51,0x61,0x07,0x22,0x71,0x14,0x32,0x81,0x91,0xa1,0x08,0x23,0x42,0xb1,0xc1,0x15,0x52,0xd1,0xf0,
-  0x24,0x33,0x62,0x72,0x82,0x09,0x0a,0x16,0x17,0x18,0x19,0x1a,0x25,0x26,0x27,0x28,0x29,0x2a,0x34,0x35,0x36,0x37,0x38,0x39,0x3a,0x43,0x44,0x45,0x46,0x47,0x48,0x49,
-  0x4a,0x53,0x54,0x55,0x56,0x57,0x58,0x59,0x5a,0x63,0x64,0x65,0x66,0x67,0x68,0x69,0x6a,0x73,0x74,0x75,0x76,0x77,0x78,0x79,0x7a,0x83,0x84,0x85,0x86,0x87,0x88,0x89,
-  0x8a,0x92,0x93,0x94,0x95,0x96,0x97,0x98,0x99,0x9a,0xa2,0xa3,0xa4,0xa5,0xa6,0xa7,0xa8,0xa9,0xaa,0xb2,0xb3,0xb4,0xb5,0xb6,0xb7,0xb8,0xb9,0xba,0xc2,0xc3,0xc4,0xc5,
-  0xc6,0xc7,0xc8,0xc9,0xca,0xd2,0xd3,0xd4,0xd5,0xd6,0xd7,0xd8,0xd9,0xda,0xe1,0xe2,0xe3,0xe4,0xe5,0xe6,0xe7,0xe8,0xe9,0xea,0xf1,0xf2,0xf3,0xf4,0xf5,0xf6,0xf7,0xf8,
-  0xf9,0xfa
-};
-static uint8 s_dc_chroma_bits[17] = { 0,0,3,1,1,1,1,1,1,1,1,1,0,0,0,0,0 };
-static uint8 s_dc_chroma_val[DC_CHROMA_CODES]  = { 0,1,2,3,4,5,6,7,8,9,10,11 };
-static uint8 s_ac_chroma_bits[17] = { 0,0,2,1,2,4,4,3,4,7,5,4,4,0,1,2,0x77 };
-static uint8 s_ac_chroma_val[AC_CHROMA_CODES] =
-{
-  0x00,0x01,0x02,0x03,0x11,0x04,0x05,0x21,0x31,0x06,0x12,0x41,0x51,0x07,0x61,0x71,0x13,0x22,0x32,0x81,0x08,0x14,0x42,0x91,0xa1,0xb1,0xc1,0x09,0x23,0x33,0x52,0xf0,
-  0x15,0x62,0x72,0xd1,0x0a,0x16,0x24,0x34,0xe1,0x25,0xf1,0x17,0x18,0x19,0x1a,0x26,0x27,0x28,0x29,0x2a,0x35,0x36,0x37,0x38,0x39,0x3a,0x43,0x44,0x45,0x46,0x47,0x48,
-  0x49,0x4a,0x53,0x54,0x55,0x56,0x57,0x58,0x59,0x5a,0x63,0x64,0x65,0x66,0x67,0x68,0x69,0x6a,0x73,0x74,0x75,0x76,0x77,0x78,0x79,0x7a,0x82,0x83,0x84,0x85,0x86,0x87,
-  0x88,0x89,0x8a,0x92,0x93,0x94,0x95,0x96,0x97,0x98,0x99,0x9a,0xa2,0xa3,0xa4,0xa5,0xa6,0xa7,0xa8,0xa9,0xaa,0xb2,0xb3,0xb4,0xb5,0xb6,0xb7,0xb8,0xb9,0xba,0xc2,0xc3,
-  0xc4,0xc5,0xc6,0xc7,0xc8,0xc9,0xca,0xd2,0xd3,0xd4,0xd5,0xd6,0xd7,0xd8,0xd9,0xda,0xe2,0xe3,0xe4,0xe5,0xe6,0xe7,0xe8,0xe9,0xea,0xf2,0xf3,0xf4,0xf5,0xf6,0xf7,0xf8,
-  0xf9,0xfa
-};
-
-// Low-level helper functions.
-template <class T> inline void clear_obj(T &obj) { memset(&obj, 0, sizeof(obj)); }
-
-const int YR = 19595, YG = 38470, YB = 7471, CB_R = -11059, CB_G = -21709, CB_B = 32768, CR_R = 32768, CR_G = -27439, CR_B = -5329;
-static inline uint8 clamp(int i) { if (static_cast<uint>(i) > 255U) { if (i < 0) i = 0; else if (i > 255) i = 255; } return static_cast<uint8>(i); }
-
-static void RGB_to_YCC(uint8* pDst, const uint8 *pSrc, int num_pixels)
-{
-  for ( ; num_pixels; pDst += 3, pSrc += 3, num_pixels--)
-  {
-    const int r = pSrc[0], g = pSrc[1], b = pSrc[2];
-    pDst[0] = static_cast<uint8>((r * YR + g * YG + b * YB + 32768) >> 16);
-    pDst[1] = clamp(128 + ((r * CB_R + g * CB_G + b * CB_B + 32768) >> 16));
-    pDst[2] = clamp(128 + ((r * CR_R + g * CR_G + b * CR_B + 32768) >> 16));
-  }
-}
-
-static void RGB_to_Y(uint8* pDst, const uint8 *pSrc, int num_pixels)
-{
-  for ( ; num_pixels; pDst++, pSrc += 3, num_pixels--)
-    pDst[0] = static_cast<uint8>((pSrc[0] * YR + pSrc[1] * YG + pSrc[2] * YB + 32768) >> 16);
-}
-
-static void RGBA_to_YCC(uint8* pDst, const uint8 *pSrc, int num_pixels)
-{
-  for ( ; num_pixels; pDst += 3, pSrc += 4, num_pixels--)
-  {
-    const int r = pSrc[0], g = pSrc[1], b = pSrc[2];
-    pDst[0] = static_cast<uint8>((r * YR + g * YG + b * YB + 32768) >> 16);
-    pDst[1] = clamp(128 + ((r * CB_R + g * CB_G + b * CB_B + 32768) >> 16));
-    pDst[2] = clamp(128 + ((r * CR_R + g * CR_G + b * CR_B + 32768) >> 16));
-  }
-}
-
-static void RGBA_to_Y(uint8* pDst, const uint8 *pSrc, int num_pixels)
-{
-  for ( ; num_pixels; pDst++, pSrc += 4, num_pixels--)
-    pDst[0] = static_cast<uint8>((pSrc[0] * YR + pSrc[1] * YG + pSrc[2] * YB + 32768) >> 16);
-}
-
-static void Y_to_YCC(uint8* pDst, const uint8* pSrc, int num_pixels)
-{
-  for( ; num_pixels; pDst += 3, pSrc++, num_pixels--) { pDst[0] = pSrc[0]; pDst[1] = 128; pDst[2] = 128; }
-}
-
-// Forward DCT - DCT derived from jfdctint.
-#define CONST_BITS  13
-#define ROW_BITS    2
-#define DCT_DESCALE(x, n) (((x) + (((int32)1) << ((n) - 1))) >> (n))
-#define DCT_MUL(var, c) (static_cast<int16>(var) * static_cast<int32>(c))
-#define DCT1D(s0, s1, s2, s3, s4, s5, s6, s7) \
-  int32 t0 = s0 + s7, t7 = s0 - s7, t1 = s1 + s6, t6 = s1 - s6, t2 = s2 + s5, t5 = s2 - s5, t3 = s3 + s4, t4 = s3 - s4; \
-  int32 t10 = t0 + t3, t13 = t0 - t3, t11 = t1 + t2, t12 = t1 - t2; \
-  int32 u1 = DCT_MUL(t12 + t13, 4433); \
-  s2 = u1 + DCT_MUL(t13, 6270); \
-  s6 = u1 + DCT_MUL(t12, -15137); \
-  u1 = t4 + t7; \
-  int32 u2 = t5 + t6, u3 = t4 + t6, u4 = t5 + t7; \
-  int32 z5 = DCT_MUL(u3 + u4, 9633); \
-  t4 = DCT_MUL(t4, 2446); t5 = DCT_MUL(t5, 16819); \
-  t6 = DCT_MUL(t6, 25172); t7 = DCT_MUL(t7, 12299); \
-  u1 = DCT_MUL(u1, -7373); u2 = DCT_MUL(u2, -20995); \
-  u3 = DCT_MUL(u3, -16069); u4 = DCT_MUL(u4, -3196); \
-  u3 += z5; u4 += z5; \
-  s0 = t10 + t11; s1 = t7 + u1 + u4; s3 = t6 + u2 + u3; s4 = t10 - t11; s5 = t5 + u2 + u4; s7 = t4 + u1 + u3;
-
-static void DCT2D(int32 *p)
-{
-  int32 c, *q = p;
-  for (c = 7; c >= 0; c--, q += 8)
-  {
-    int32 s0 = q[0], s1 = q[1], s2 = q[2], s3 = q[3], s4 = q[4], s5 = q[5], s6 = q[6], s7 = q[7];
-    DCT1D(s0, s1, s2, s3, s4, s5, s6, s7);
-    q[0] = s0 << ROW_BITS; q[1] = DCT_DESCALE(s1, CONST_BITS-ROW_BITS); q[2] = DCT_DESCALE(s2, CONST_BITS-ROW_BITS); q[3] = DCT_DESCALE(s3, CONST_BITS-ROW_BITS);
-    q[4] = s4 << ROW_BITS; q[5] = DCT_DESCALE(s5, CONST_BITS-ROW_BITS); q[6] = DCT_DESCALE(s6, CONST_BITS-ROW_BITS); q[7] = DCT_DESCALE(s7, CONST_BITS-ROW_BITS);
-  }
-  for (q = p, c = 7; c >= 0; c--, q++)
-  {
-    int32 s0 = q[0*8], s1 = q[1*8], s2 = q[2*8], s3 = q[3*8], s4 = q[4*8], s5 = q[5*8], s6 = q[6*8], s7 = q[7*8];
-    DCT1D(s0, s1, s2, s3, s4, s5, s6, s7);
-    q[0*8] = DCT_DESCALE(s0, ROW_BITS+3); q[1*8] = DCT_DESCALE(s1, CONST_BITS+ROW_BITS+3); q[2*8] = DCT_DESCALE(s2, CONST_BITS+ROW_BITS+3); q[3*8] = DCT_DESCALE(s3, CONST_BITS+ROW_BITS+3);
-    q[4*8] = DCT_DESCALE(s4, ROW_BITS+3); q[5*8] = DCT_DESCALE(s5, CONST_BITS+ROW_BITS+3); q[6*8] = DCT_DESCALE(s6, CONST_BITS+ROW_BITS+3); q[7*8] = DCT_DESCALE(s7, CONST_BITS+ROW_BITS+3);
-  }
-}
-
-struct sym_freq { uint m_key, m_sym_index; };
-
-// Radix sorts sym_freq[] array by 32-bit key m_key. Returns ptr to sorted values.
-static inline sym_freq* radix_sort_syms(uint num_syms, sym_freq* pSyms0, sym_freq* pSyms1)
-{
-  const uint cMaxPasses = 4;
-  uint32 hist[256 * cMaxPasses]; clear_obj(hist);
-  for (uint i = 0; i < num_syms; i++) { uint freq = pSyms0[i].m_key; hist[freq & 0xFF]++; hist[256 + ((freq >> 8) & 0xFF)]++; hist[256*2 + ((freq >> 16) & 0xFF)]++; hist[256*3 + ((freq >> 24) & 0xFF)]++; }
-  sym_freq* pCur_syms = pSyms0, *pNew_syms = pSyms1;
-  uint total_passes = cMaxPasses; while ((total_passes > 1) && (num_syms == hist[(total_passes - 1) * 256])) total_passes--;
-  for (uint pass_shift = 0, pass = 0; pass < total_passes; pass++, pass_shift += 8)
-  {
-    const uint32* pHist = &hist[pass << 8];
-    uint offsets[256], cur_ofs = 0;
-    for (uint i = 0; i < 256; i++) { offsets[i] = cur_ofs; cur_ofs += pHist[i]; }
-    for (uint i = 0; i < num_syms; i++)
-      pNew_syms[offsets[(pCur_syms[i].m_key >> pass_shift) & 0xFF]++] = pCur_syms[i];
-    sym_freq* t = pCur_syms; pCur_syms = pNew_syms; pNew_syms = t;
-  }
-  return pCur_syms;
-}
-
-// calculate_minimum_redundancy() originally written by: Alistair Moffat, alistair@cs.mu.oz.au, Jyrki Katajainen, jyrki@diku.dk, November 1996.
-static void calculate_minimum_redundancy(sym_freq *A, int n)
-{
-  int root, leaf, next, avbl, used, dpth;
-  if (n==0) return; else if (n==1) { A[0].m_key = 1; return; }
-  A[0].m_key += A[1].m_key; root = 0; leaf = 2;
-  for (next=1; next < n-1; next++)
-  {
-    if (leaf>=n || A[root].m_key<A[leaf].m_key) { A[next].m_key = A[root].m_key; A[root++].m_key = next; } else A[next].m_key = A[leaf++].m_key;
-    if (leaf>=n || (root<next && A[root].m_key<A[leaf].m_key)) { A[next].m_key += A[root].m_key; A[root++].m_key = next; } else A[next].m_key += A[leaf++].m_key;
-  }
-  A[n-2].m_key = 0;
-  for (next=n-3; next>=0; next--) A[next].m_key = A[A[next].m_key].m_key+1;
-  avbl = 1; used = dpth = 0; root = n-2; next = n-1;
-  while (avbl>0)
-  {
-    while (root>=0 && (int)A[root].m_key==dpth) { used++; root--; }
-    while (avbl>used) { A[next--].m_key = dpth; avbl--; }
-    avbl = 2*used; dpth++; used = 0;
-  }
-}
-
-// Limits canonical Huffman code table's max code size to max_code_size.
-static void huffman_enforce_max_code_size(int *pNum_codes, int code_list_len, int max_code_size)
-{
-  if (code_list_len <= 1) return;
-
-  for (int i = max_code_size + 1; i <= MAX_HUFF_CODESIZE; i++) pNum_codes[max_code_size] += pNum_codes[i];
-
-  uint32 total = 0;
-  for (int i = max_code_size; i > 0; i--)
-    total += (((uint32)pNum_codes[i]) << (max_code_size - i));
-
-  while (total != (1UL << max_code_size))
-  {
-    pNum_codes[max_code_size]--;
-    for (int i = max_code_size - 1; i > 0; i--)
-    {
-      if (pNum_codes[i]) { pNum_codes[i]--; pNum_codes[i + 1] += 2; break; }
-    }
-    total--;
-  }
-}
-
-// Generates an optimized offman table.
-void jpeg_encoder::optimize_huffman_table(int table_num, int table_len)
-{
-  sym_freq syms0[MAX_HUFF_SYMBOLS], syms1[MAX_HUFF_SYMBOLS];
-  syms0[0].m_key = 1; syms0[0].m_sym_index = 0;  // dummy symbol, assures that no valid code contains all 1's
-  int num_used_syms = 1;
-  const uint32 *pSym_count = &m_huff_count[table_num][0];
-  for (int i = 0; i < table_len; i++)
-    if (pSym_count[i]) { syms0[num_used_syms].m_key = pSym_count[i]; syms0[num_used_syms++].m_sym_index = i + 1; }
-  sym_freq* pSyms = radix_sort_syms(num_used_syms, syms0, syms1);
-  calculate_minimum_redundancy(pSyms, num_used_syms);
-
-  // Count the # of symbols of each code size.
-  int num_codes[1 + MAX_HUFF_CODESIZE]; clear_obj(num_codes);
-  for (int i = 0; i < num_used_syms; i++)
-    num_codes[pSyms[i].m_key]++;
-
-  const uint JPGE_CODE_SIZE_LIMIT = 16; // the maximum possible size of a JPEG Huffman code (valid range is [9,16] - 9 vs. 8 because of the dummy symbol)
-  huffman_enforce_max_code_size(num_codes, num_used_syms, JPGE_CODE_SIZE_LIMIT);
-
-  // Compute m_huff_bits array, which contains the # of symbols per code size.
-  clear_obj(m_huff_bits[table_num]);
-  for (int i = 1; i <= (int)JPGE_CODE_SIZE_LIMIT; i++)
-    m_huff_bits[table_num][i] = static_cast<uint8>(num_codes[i]);
-
-  // Remove the dummy symbol added above, which must be in largest bucket.
-  for (int i = JPGE_CODE_SIZE_LIMIT; i >= 1; i--)
-  {
-    if (m_huff_bits[table_num][i]) { m_huff_bits[table_num][i]--; break; }
-  }
-
-  // Compute the m_huff_val array, which contains the symbol indices sorted by code size (smallest to largest).
-  for (int i = num_used_syms - 1; i >= 1; i--)
-    m_huff_val[table_num][num_used_syms - 1 - i] = static_cast<uint8>(pSyms[i].m_sym_index - 1);
-}
-
-// JPEG marker generation.
-void jpeg_encoder::emit_byte(uint8 i)
-{
-  m_all_stream_writes_succeeded = m_all_stream_writes_succeeded && m_pStream->put_obj(i);
-}
-
-void jpeg_encoder::emit_word(uint i)
-{
-  emit_byte(uint8(i >> 8)); emit_byte(uint8(i & 0xFF));
-}
-
-void jpeg_encoder::emit_marker(int marker)
-{
-  emit_byte(uint8(0xFF)); emit_byte(uint8(marker));
-}
-
-// Emit JFIF marker
-void jpeg_encoder::emit_jfif_app0()
-{
-  emit_marker(M_APP0);
-  emit_word(2 + 4 + 1 + 2 + 1 + 2 + 2 + 1 + 1);
-  emit_byte(0x4A); emit_byte(0x46); emit_byte(0x49); emit_byte(0x46); /* Identifier: ASCII "JFIF" */
-  emit_byte(0);
-  emit_byte(1);      /* Major version */
-  emit_byte(1);      /* Minor version */
-  emit_byte(0);      /* Density unit */
-  emit_word(1);
-  emit_word(1);
-  emit_byte(0);      /* No thumbnail image */
-  emit_byte(0);
-}
-
-// Emit quantization tables
-void jpeg_encoder::emit_dqt()
-{
-  for (int i = 0; i < ((m_num_components == 3) ? 2 : 1); i++)
-  {
-    emit_marker(M_DQT);
-    emit_word(64 + 1 + 2);
-    emit_byte(static_cast<uint8>(i));
-    for (int j = 0; j < 64; j++)
-      emit_byte(static_cast<uint8>(m_quantization_tables[i][j]));
-  }
-}
-
-// Emit start of frame marker
-void jpeg_encoder::emit_sof()
-{
-  emit_marker(M_SOF0);                           /* baseline */
-  emit_word(3 * m_num_components + 2 + 5 + 1);
-  emit_byte(8);                                  /* precision */
-  emit_word(m_image_y);
-  emit_word(m_image_x);
-  emit_byte(m_num_components);
-  for (int i = 0; i < m_num_components; i++)
-  {
-    emit_byte(static_cast<uint8>(i + 1));                                   /* component ID     */
-    emit_byte((m_comp_h_samp[i] << 4) + m_comp_v_samp[i]);  /* h and v sampling */
-    emit_byte(i > 0);                                   /* quant. table num */
-  }
-}
-
-// Emit Huffman table.
-void jpeg_encoder::emit_dht(uint8 *bits, uint8 *val, int index, bool ac_flag)
-{
-  emit_marker(M_DHT);
-
-  int length = 0;
-  for (int i = 1; i <= 16; i++)
-    length += bits[i];
-
-  emit_word(length + 2 + 1 + 16);
-  emit_byte(static_cast<uint8>(index + (ac_flag << 4)));
-
-  for (int i = 1; i <= 16; i++)
-    emit_byte(bits[i]);
-
-  for (int i = 0; i < length; i++)
-    emit_byte(val[i]);
-}
-
-// Emit all Huffman tables.
-void jpeg_encoder::emit_dhts()
-{
-  emit_dht(m_huff_bits[0+0], m_huff_val[0+0], 0, false);
-  emit_dht(m_huff_bits[2+0], m_huff_val[2+0], 0, true);
-  if (m_num_components == 3)
-  {
-    emit_dht(m_huff_bits[0+1], m_huff_val[0+1], 1, false);
-    emit_dht(m_huff_bits[2+1], m_huff_val[2+1], 1, true);
-  }
-}
-
-// emit start of scan
-void jpeg_encoder::emit_sos()
-{
-  emit_marker(M_SOS);
-  emit_word(2 * m_num_components + 2 + 1 + 3);
-  emit_byte(m_num_components);
-  for (int i = 0; i < m_num_components; i++)
-  {
-    emit_byte(static_cast<uint8>(i + 1));
-    if (i == 0)
-      emit_byte((0 << 4) + 0);
-    else
-      emit_byte((1 << 4) + 1);
-  }
-  emit_byte(0);     /* spectral selection */
-  emit_byte(63);
-  emit_byte(0);
-}
-
-// Emit all markers at beginning of image file.
-void jpeg_encoder::emit_markers()
-{
-  emit_marker(M_SOI);
-  emit_jfif_app0();
-  emit_dqt();
-  emit_sof();
-  emit_dhts();
-  emit_sos();
-}
-
-// Compute the actual canonical Huffman codes/code sizes given the JPEG huff bits and val arrays.
-void jpeg_encoder::compute_huffman_table(uint *codes, uint8 *code_sizes, uint8 *bits, uint8 *val)
-{
-  int i, l, last_p, si;
-  uint8 huff_size[257];
-  uint huff_code[257];
-  uint code;
-
-  int p = 0;
-  for (l = 1; l <= 16; l++)
-    for (i = 1; i <= bits[l]; i++)
-      huff_size[p++] = (char)l;
-
-  huff_size[p] = 0; last_p = p; // write sentinel
-
-  code = 0; si = huff_size[0]; p = 0;
-
-  while (huff_size[p])
-  {
-    while (huff_size[p] == si)
-      huff_code[p++] = code++;
-    code <<= 1;
-    si++;
-  }
-
-  memset(codes, 0, sizeof(codes[0])*256);
-  memset(code_sizes, 0, sizeof(code_sizes[0])*256);
-  for (p = 0; p < last_p; p++)
-  {
-    codes[val[p]]      = huff_code[p];
-    code_sizes[val[p]] = huff_size[p];
-  }
-}
-
-// Quantization table generation.
-void jpeg_encoder::compute_quant_table(int32 *pDst, int16 *pSrc)
-{
-  int32 q;
-  if (m_params.m_quality < 50)
-    q = 5000 / m_params.m_quality;
-  else
-    q = 200 - m_params.m_quality * 2;
-  for (int i = 0; i < 64; i++)
-  {
-    int32 j = *pSrc++; j = (j * q + 50L) / 100L;
-    *pDst++ = JPGE_MIN(JPGE_MAX(j, 1), 255);
-  }
-}
-
-// Higher-level methods.
-void jpeg_encoder::first_pass_init()
-{
-  m_bit_buffer = 0; m_bits_in = 0;
-  memset(m_last_dc_val, 0, 3 * sizeof(m_last_dc_val[0]));
-  m_mcu_y_ofs = 0;
-  m_pass_num = 1;
-}
-
-bool jpeg_encoder::second_pass_init()
-{
-  compute_huffman_table(&m_huff_codes[0+0][0], &m_huff_code_sizes[0+0][0], m_huff_bits[0+0], m_huff_val[0+0]);
-  compute_huffman_table(&m_huff_codes[2+0][0], &m_huff_code_sizes[2+0][0], m_huff_bits[2+0], m_huff_val[2+0]);
-  if (m_num_components > 1)
-  {
-    compute_huffman_table(&m_huff_codes[0+1][0], &m_huff_code_sizes[0+1][0], m_huff_bits[0+1], m_huff_val[0+1]);
-    compute_huffman_table(&m_huff_codes[2+1][0], &m_huff_code_sizes[2+1][0], m_huff_bits[2+1], m_huff_val[2+1]);
-  }
-  first_pass_init();
-  emit_markers();
-  m_pass_num = 2;
-  return true;
-}
-
-bool jpeg_encoder::jpg_open(int p_x_res, int p_y_res, int src_channels)
-{
-  m_num_components = 3;
-  switch (m_params.m_subsampling)
-  {
-    case Y_ONLY:
-    {
-      m_num_components = 1;
-      m_comp_h_samp[0] = 1; m_comp_v_samp[0] = 1;
-      m_mcu_x          = 8; m_mcu_y          = 8;
-      break;
-    }
-    case H1V1:
-    {
-      m_comp_h_samp[0] = 1; m_comp_v_samp[0] = 1;
-      m_comp_h_samp[1] = 1; m_comp_v_samp[1] = 1;
-      m_comp_h_samp[2] = 1; m_comp_v_samp[2] = 1;
-      m_mcu_x          = 8; m_mcu_y          = 8;
-      break;
-    }
-    case H2V1:
-    {
-      m_comp_h_samp[0] = 2; m_comp_v_samp[0] = 1;
-      m_comp_h_samp[1] = 1; m_comp_v_samp[1] = 1;
-      m_comp_h_samp[2] = 1; m_comp_v_samp[2] = 1;
-      m_mcu_x          = 16; m_mcu_y         = 8;
-      break;
-    }
-    case H2V2:
-    {
-      m_comp_h_samp[0] = 2; m_comp_v_samp[0] = 2;
-      m_comp_h_samp[1] = 1; m_comp_v_samp[1] = 1;
-      m_comp_h_samp[2] = 1; m_comp_v_samp[2] = 1;
-      m_mcu_x          = 16; m_mcu_y         = 16;
-    }
-  }
-
-  m_image_x        = p_x_res; m_image_y = p_y_res;
-  m_image_bpp      = src_channels;
-  m_image_bpl      = m_image_x * src_channels;
-  m_image_x_mcu    = (m_image_x + m_mcu_x - 1) & (~(m_mcu_x - 1));
-  m_image_y_mcu    = (m_image_y + m_mcu_y - 1) & (~(m_mcu_y - 1));
-  m_image_bpl_xlt  = m_image_x * m_num_components;
-  m_image_bpl_mcu  = m_image_x_mcu * m_num_components;
-  m_mcus_per_row   = m_image_x_mcu / m_mcu_x;
-
-  if ((m_mcu_lines[0] = static_cast<uint8*>(jpge_malloc(m_image_bpl_mcu * m_mcu_y))) == NULL) return false;
-  for (int i = 1; i < m_mcu_y; i++)
-    m_mcu_lines[i] = m_mcu_lines[i-1] + m_image_bpl_mcu;
-
-  compute_quant_table(m_quantization_tables[0], s_std_lum_quant);
-  compute_quant_table(m_quantization_tables[1], m_params.m_no_chroma_discrim_flag ? s_std_lum_quant : s_std_croma_quant);
-
-  m_out_buf_left = JPGE_OUT_BUF_SIZE;
-  m_pOut_buf = m_out_buf;
-
-  if (m_params.m_two_pass_flag)
-  {
-    clear_obj(m_huff_count);
-    first_pass_init();
-  }
-  else
-  {
-    memcpy(m_huff_bits[0+0], s_dc_lum_bits, 17);    memcpy(m_huff_val [0+0], s_dc_lum_val, DC_LUM_CODES);
-    memcpy(m_huff_bits[2+0], s_ac_lum_bits, 17);    memcpy(m_huff_val [2+0], s_ac_lum_val, AC_LUM_CODES);
-    memcpy(m_huff_bits[0+1], s_dc_chroma_bits, 17); memcpy(m_huff_val [0+1], s_dc_chroma_val, DC_CHROMA_CODES);
-    memcpy(m_huff_bits[2+1], s_ac_chroma_bits, 17); memcpy(m_huff_val [2+1], s_ac_chroma_val, AC_CHROMA_CODES);
-    if (!second_pass_init()) return false;   // in effect, skip over the first pass
-  }
-  return m_all_stream_writes_succeeded;
-}
-
-void jpeg_encoder::load_block_8_8_grey(int x)
-{
-  uint8 *pSrc;
-  sample_array_t *pDst = m_sample_array;
-  x <<= 3;
-  for (int i = 0; i < 8; i++, pDst += 8)
-  {
-    pSrc = m_mcu_lines[i] + x;
-    pDst[0] = pSrc[0] - 128; pDst[1] = pSrc[1] - 128; pDst[2] = pSrc[2] - 128; pDst[3] = pSrc[3] - 128;
-    pDst[4] = pSrc[4] - 128; pDst[5] = pSrc[5] - 128; pDst[6] = pSrc[6] - 128; pDst[7] = pSrc[7] - 128;
-  }
-}
-
-void jpeg_encoder::load_block_8_8(int x, int y, int c)
-{
-  uint8 *pSrc;
-  sample_array_t *pDst = m_sample_array;
-  x = (x * (8 * 3)) + c;
-  y <<= 3;
-  for (int i = 0; i < 8; i++, pDst += 8)
-  {
-    pSrc = m_mcu_lines[y + i] + x;
-    pDst[0] = pSrc[0 * 3] - 128; pDst[1] = pSrc[1 * 3] - 128; pDst[2] = pSrc[2 * 3] - 128; pDst[3] = pSrc[3 * 3] - 128;
-    pDst[4] = pSrc[4 * 3] - 128; pDst[5] = pSrc[5 * 3] - 128; pDst[6] = pSrc[6 * 3] - 128; pDst[7] = pSrc[7 * 3] - 128;
-  }
-}
-
-void jpeg_encoder::load_block_16_8(int x, int c)
-{
-  uint8 *pSrc1, *pSrc2;
-  sample_array_t *pDst = m_sample_array;
-  x = (x * (16 * 3)) + c;
-  int a = 0, b = 2;
-  for (int i = 0; i < 16; i += 2, pDst += 8)
-  {
-    pSrc1 = m_mcu_lines[i + 0] + x;
-    pSrc2 = m_mcu_lines[i + 1] + x;
-    pDst[0] = ((pSrc1[ 0 * 3] + pSrc1[ 1 * 3] + pSrc2[ 0 * 3] + pSrc2[ 1 * 3] + a) >> 2) - 128; pDst[1] = ((pSrc1[ 2 * 3] + pSrc1[ 3 * 3] + pSrc2[ 2 * 3] + pSrc2[ 3 * 3] + b) >> 2) - 128;
-    pDst[2] = ((pSrc1[ 4 * 3] + pSrc1[ 5 * 3] + pSrc2[ 4 * 3] + pSrc2[ 5 * 3] + a) >> 2) - 128; pDst[3] = ((pSrc1[ 6 * 3] + pSrc1[ 7 * 3] + pSrc2[ 6 * 3] + pSrc2[ 7 * 3] + b) >> 2) - 128;
-    pDst[4] = ((pSrc1[ 8 * 3] + pSrc1[ 9 * 3] + pSrc2[ 8 * 3] + pSrc2[ 9 * 3] + a) >> 2) - 128; pDst[5] = ((pSrc1[10 * 3] + pSrc1[11 * 3] + pSrc2[10 * 3] + pSrc2[11 * 3] + b) >> 2) - 128;
-    pDst[6] = ((pSrc1[12 * 3] + pSrc1[13 * 3] + pSrc2[12 * 3] + pSrc2[13 * 3] + a) >> 2) - 128; pDst[7] = ((pSrc1[14 * 3] + pSrc1[15 * 3] + pSrc2[14 * 3] + pSrc2[15 * 3] + b) >> 2) - 128;
-    int temp = a; a = b; b = temp;
-  }
-}
-
-void jpeg_encoder::load_block_16_8_8(int x, int c)
-{
-  uint8 *pSrc1;
-  sample_array_t *pDst = m_sample_array;
-  x = (x * (16 * 3)) + c;
-  for (int i = 0; i < 8; i++, pDst += 8)
-  {
-    pSrc1 = m_mcu_lines[i + 0] + x;
-    pDst[0] = ((pSrc1[ 0 * 3] + pSrc1[ 1 * 3]) >> 1) - 128; pDst[1] = ((pSrc1[ 2 * 3] + pSrc1[ 3 * 3]) >> 1) - 128;
-    pDst[2] = ((pSrc1[ 4 * 3] + pSrc1[ 5 * 3]) >> 1) - 128; pDst[3] = ((pSrc1[ 6 * 3] + pSrc1[ 7 * 3]) >> 1) - 128;
-    pDst[4] = ((pSrc1[ 8 * 3] + pSrc1[ 9 * 3]) >> 1) - 128; pDst[5] = ((pSrc1[10 * 3] + pSrc1[11 * 3]) >> 1) - 128;
-    pDst[6] = ((pSrc1[12 * 3] + pSrc1[13 * 3]) >> 1) - 128; pDst[7] = ((pSrc1[14 * 3] + pSrc1[15 * 3]) >> 1) - 128;
-  }
-}
-
-void jpeg_encoder::load_quantized_coefficients(int component_num)
-{
-  int32 *q = m_quantization_tables[component_num > 0];
-  int16 *pDst = m_coefficient_array;
-  for (int i = 0; i < 64; i++)
-  {
-    sample_array_t j = m_sample_array[s_zag[i]];
-    if (j < 0)
-    {
-      if ((j = -j + (*q >> 1)) < *q)
-        *pDst++ = 0;
-      else
-        *pDst++ = static_cast<int16>(-(j / *q));
-    }
-    else
-    {
-      if ((j = j + (*q >> 1)) < *q)
-        *pDst++ = 0;
-      else
-        *pDst++ = static_cast<int16>((j / *q));
-    }
-    q++;
-  }
-}
-
-void jpeg_encoder::flush_output_buffer()
-{
-  if (m_out_buf_left != JPGE_OUT_BUF_SIZE)
-    m_all_stream_writes_succeeded = m_all_stream_writes_succeeded && m_pStream->put_buf(m_out_buf, JPGE_OUT_BUF_SIZE - m_out_buf_left);
-  m_pOut_buf = m_out_buf;
-  m_out_buf_left = JPGE_OUT_BUF_SIZE;
-}
-
-void jpeg_encoder::put_bits(uint bits, uint len)
-{
-  m_bit_buffer |= ((uint32)bits << (24 - (m_bits_in += len)));
-  while (m_bits_in >= 8)
-  {
-    uint8 c;
-    #define JPGE_PUT_BYTE(c) { *m_pOut_buf++ = (c); if (--m_out_buf_left == 0) flush_output_buffer(); }
-    JPGE_PUT_BYTE(c = (uint8)((m_bit_buffer >> 16) & 0xFF));
-    if (c == 0xFF) JPGE_PUT_BYTE(0);
-    m_bit_buffer <<= 8;
-    m_bits_in -= 8;
-  }
-}
-
-void jpeg_encoder::code_coefficients_pass_one(int component_num)
-{
-  if (component_num >= 3) return; // just to shut up static analysis
-  int i, run_len, nbits, temp1;
-  int16 *src = m_coefficient_array;
-  uint32 *dc_count = component_num ? m_huff_count[0 + 1] : m_huff_count[0 + 0], *ac_count = component_num ? m_huff_count[2 + 1] : m_huff_count[2 + 0];
-
-  temp1 = src[0] - m_last_dc_val[component_num];
-  m_last_dc_val[component_num] = src[0];
-  if (temp1 < 0) temp1 = -temp1;
-
-  nbits = 0;
-  while (temp1)
-  {
-    nbits++; temp1 >>= 1;
-  }
-
-  dc_count[nbits]++;
-  for (run_len = 0, i = 1; i < 64; i++)
-  {
-    if ((temp1 = m_coefficient_array[i]) == 0)
-      run_len++;
-    else
-    {
-      while (run_len >= 16)
-      {
-        ac_count[0xF0]++;
-        run_len -= 16;
-      }
-      if (temp1 < 0) temp1 = -temp1;
-      nbits = 1;
-      while (temp1 >>= 1) nbits++;
-      ac_count[(run_len << 4) + nbits]++;
-      run_len = 0;
-    }
-  }
-  if (run_len) ac_count[0]++;
-}
-
-void jpeg_encoder::code_coefficients_pass_two(int component_num)
-{
-  int i, j, run_len, nbits, temp1, temp2;
-  int16 *pSrc = m_coefficient_array;
-  uint *codes[2];
-  uint8 *code_sizes[2];
-
-  if (component_num == 0)
-  {
-    codes[0] = m_huff_codes[0 + 0]; codes[1] = m_huff_codes[2 + 0];
-    code_sizes[0] = m_huff_code_sizes[0 + 0]; code_sizes[1] = m_huff_code_sizes[2 + 0];
-  }
-  else
-  {
-    codes[0] = m_huff_codes[0 + 1]; codes[1] = m_huff_codes[2 + 1];
-    code_sizes[0] = m_huff_code_sizes[0 + 1]; code_sizes[1] = m_huff_code_sizes[2 + 1];
-  }
-
-  temp1 = temp2 = pSrc[0] - m_last_dc_val[component_num];
-  m_last_dc_val[component_num] = pSrc[0];
-
-  if (temp1 < 0)
-  {
-    temp1 = -temp1; temp2--;
-  }
-
-  nbits = 0;
-  while (temp1)
-  {
-    nbits++; temp1 >>= 1;
-  }
-
-  put_bits(codes[0][nbits], code_sizes[0][nbits]);
-  if (nbits) put_bits(temp2 & ((1 << nbits) - 1), nbits);
-
-  for (run_len = 0, i = 1; i < 64; i++)
-  {
-    if ((temp1 = m_coefficient_array[i]) == 0)
-      run_len++;
-    else
-    {
-      while (run_len >= 16)
-      {
-        put_bits(codes[1][0xF0], code_sizes[1][0xF0]);
-        run_len -= 16;
-      }
-      if ((temp2 = temp1) < 0)
-      {
-        temp1 = -temp1;
-        temp2--;
-      }
-      nbits = 1;
-      while (temp1 >>= 1)
-        nbits++;
-      j = (run_len << 4) + nbits;
-      put_bits(codes[1][j], code_sizes[1][j]);
-      put_bits(temp2 & ((1 << nbits) - 1), nbits);
-      run_len = 0;
-    }
-  }
-  if (run_len)
-    put_bits(codes[1][0], code_sizes[1][0]);
-}
-
-void jpeg_encoder::code_block(int component_num)
-{
-  DCT2D(m_sample_array);
-  load_quantized_coefficients(component_num);
-  if (m_pass_num == 1)
-    code_coefficients_pass_one(component_num);
-  else
-    code_coefficients_pass_two(component_num);
-}
-
-void jpeg_encoder::process_mcu_row()
-{
-  if (m_num_components == 1)
-  {
-    for (int i = 0; i < m_mcus_per_row; i++)
-    {
-      load_block_8_8_grey(i); code_block(0);
-    }
-  }
-  else if ((m_comp_h_samp[0] == 1) && (m_comp_v_samp[0] == 1))
-  {
-    for (int i = 0; i < m_mcus_per_row; i++)
-    {
-      load_block_8_8(i, 0, 0); code_block(0); load_block_8_8(i, 0, 1); code_block(1); load_block_8_8(i, 0, 2); code_block(2);
-    }
-  }
-  else if ((m_comp_h_samp[0] == 2) && (m_comp_v_samp[0] == 1))
-  {
-    for (int i = 0; i < m_mcus_per_row; i++)
-    {
-      load_block_8_8(i * 2 + 0, 0, 0); code_block(0); load_block_8_8(i * 2 + 1, 0, 0); code_block(0);
-      load_block_16_8_8(i, 1); code_block(1); load_block_16_8_8(i, 2); code_block(2);
-    }
-  }
-  else if ((m_comp_h_samp[0] == 2) && (m_comp_v_samp[0] == 2))
-  {
-    for (int i = 0; i < m_mcus_per_row; i++)
-    {
-      load_block_8_8(i * 2 + 0, 0, 0); code_block(0); load_block_8_8(i * 2 + 1, 0, 0); code_block(0);
-      load_block_8_8(i * 2 + 0, 1, 0); code_block(0); load_block_8_8(i * 2 + 1, 1, 0); code_block(0);
-      load_block_16_8(i, 1); code_block(1); load_block_16_8(i, 2); code_block(2);
-    }
-  }
-}
-
-bool jpeg_encoder::terminate_pass_one()
-{
-  optimize_huffman_table(0+0, DC_LUM_CODES); optimize_huffman_table(2+0, AC_LUM_CODES);
-  if (m_num_components > 1)
-  {
-    optimize_huffman_table(0+1, DC_CHROMA_CODES); optimize_huffman_table(2+1, AC_CHROMA_CODES);
-  }
-  return second_pass_init();
-}
-
-bool jpeg_encoder::terminate_pass_two()
-{
-  put_bits(0x7F, 7);
-  flush_output_buffer();
-  emit_marker(M_EOI);
-  m_pass_num++; // purposely bump up m_pass_num, for debugging
-  return true;
-}
-
-bool jpeg_encoder::process_end_of_image()
-{
-  if (m_mcu_y_ofs)
-  {
-    if (m_mcu_y_ofs < 16) // check here just to shut up static analysis
-    {
-      for (int i = m_mcu_y_ofs; i < m_mcu_y; i++)
-        memcpy(m_mcu_lines[i], m_mcu_lines[m_mcu_y_ofs - 1], m_image_bpl_mcu);
-    }
-
-    process_mcu_row();
-  }
-
-  if (m_pass_num == 1)
-    return terminate_pass_one();
-  else
-    return terminate_pass_two();
-}
-
-void jpeg_encoder::load_mcu(const void *pSrc)
-{
-  const uint8* Psrc = reinterpret_cast<const uint8*>(pSrc);
-
-  uint8* pDst = m_mcu_lines[m_mcu_y_ofs]; // OK to write up to m_image_bpl_xlt bytes to pDst
-
-  if (m_num_components == 1)
-  {
-    if (m_image_bpp == 4)
-      RGBA_to_Y(pDst, Psrc, m_image_x);
-    else if (m_image_bpp == 3)
-      RGB_to_Y(pDst, Psrc, m_image_x);
-    else
-      memcpy(pDst, Psrc, m_image_x);
-  }
-  else
-  {
-    if (m_image_bpp == 4)
-      RGBA_to_YCC(pDst, Psrc, m_image_x);
-    else if (m_image_bpp == 3)
-      RGB_to_YCC(pDst, Psrc, m_image_x);
-    else
-      Y_to_YCC(pDst, Psrc, m_image_x);
-  }
-
-  // Possibly duplicate pixels at end of scanline if not a multiple of 8 or 16
-  if (m_num_components == 1)
-    memset(m_mcu_lines[m_mcu_y_ofs] + m_image_bpl_xlt, pDst[m_image_bpl_xlt - 1], m_image_x_mcu - m_image_x);
-  else
-  {
-    const uint8 y = pDst[m_image_bpl_xlt - 3 + 0], cb = pDst[m_image_bpl_xlt - 3 + 1], cr = pDst[m_image_bpl_xlt - 3 + 2];
-    uint8 *q = m_mcu_lines[m_mcu_y_ofs] + m_image_bpl_xlt;
-    for (int i = m_image_x; i < m_image_x_mcu; i++)
-    {
-      *q++ = y; *q++ = cb; *q++ = cr;
-    }
-  }
-
-  if (++m_mcu_y_ofs == m_mcu_y)
-  {
-    process_mcu_row();
-    m_mcu_y_ofs = 0;
-  }
-}
-
-void jpeg_encoder::clear()
-{
-  m_mcu_lines[0] = NULL;
-  m_pass_num = 0;
-  m_all_stream_writes_succeeded = true;
-}
-
-jpeg_encoder::jpeg_encoder()
-{
-  clear();
-}
-
-jpeg_encoder::~jpeg_encoder()
-{
-  deinit();
-}
-
-bool jpeg_encoder::init(output_stream *pStream, int64_t width, int64_t height, int64_t src_channels, const params &comp_params)
-{
-  deinit();
-  if (((!pStream) || (width < 1) || (height < 1)) || ((src_channels != 1) && (src_channels != 3) && (src_channels != 4)) || (!comp_params.check_valid())) return false;
-  m_pStream = pStream;
-  m_params = comp_params;
-  return jpg_open(width, height, src_channels);
-}
-
-void jpeg_encoder::deinit()
-{
-  jpge_free(m_mcu_lines[0]);
-  clear();
-}
-
-bool jpeg_encoder::process_scanline(const void* pScanline)
-{
-  if ((m_pass_num < 1) || (m_pass_num > 2)) return false;
-  if (m_all_stream_writes_succeeded)
-  {
-    if (!pScanline)
-    {
-      if (!process_end_of_image()) return false;
-    }
-    else
-    {
-      load_mcu(pScanline);
-    }
-  }
-  return m_all_stream_writes_succeeded;
-}
-
-// Higher level wrappers/examples (optional).
-#include <stdio.h>
-
-class cfile_stream : public output_stream
-{
-   cfile_stream(const cfile_stream &);
-   cfile_stream &operator= (const cfile_stream &);
-
-   FILE* m_pFile;
-   bool m_bStatus;
-
-public:
-   cfile_stream() : m_pFile(NULL), m_bStatus(false) { }
-
-   virtual ~cfile_stream()
-   {
-      close();
-   }
-
-   bool open(const char *pFilename)
-   {
-      close();
-#if defined(_MSC_VER)
-      if (fopen_s(&m_pFile, pFilename, "wb") != 0)
-	  {
-		  return false;
-	  }
-#else
-      m_pFile = fopen(pFilename, "wb");
-#endif
-      m_bStatus = (m_pFile != NULL);
-      return m_bStatus;
-   }
-
-   bool close()
-   {
-      if (m_pFile)
-      {
-         if (fclose(m_pFile) == EOF)
-         {
-            m_bStatus = false;
-         }
-         m_pFile = NULL;
-      }
-      return m_bStatus;
-   }
-
-   virtual bool put_buf(const void* pBuf, int64_t len)
-   {
-      m_bStatus = m_bStatus && (fwrite(pBuf, len, 1, m_pFile) == 1);
-      return m_bStatus;
-   }
-
-   uint get_size() const
-   {
-      return m_pFile ? ftell(m_pFile) : 0;
-   }
-};
-
-// Writes JPEG image to file.
-bool compress_image_to_jpeg_file(const char *pFilename, int64_t width, int64_t height, int64_t num_channels, const uint8 *pImage_data, const params &comp_params)
-{
-  cfile_stream dst_stream;
-  if (!dst_stream.open(pFilename))
-    return false;
-
-  jpge::jpeg_encoder dst_image;
-  if (!dst_image.init(&dst_stream, width, height, num_channels, comp_params))
-    return false;
-
-  for (uint pass_index = 0; pass_index < dst_image.get_total_passes(); pass_index++)
-  {
-    for (int64_t i = 0; i < height; i++)
-    {
-		// i, width, and num_channels are all 64bit
-       const uint8* pBuf = pImage_data + i * width * num_channels;
-       if (!dst_image.process_scanline(pBuf))
-          return false;
-    }
-    if (!dst_image.process_scanline(NULL))
-       return false;
-  }
-
-  dst_image.deinit();
-
-  return dst_stream.close();
-}
-
-class memory_stream : public output_stream
-{
-   memory_stream(const memory_stream &);
-   memory_stream &operator= (const memory_stream &);
-
-   uint8 *m_pBuf;
-   uint64_t m_buf_size, m_buf_ofs;
-
-public:
-   memory_stream(void *pBuf, uint64_t buf_size) : m_pBuf(static_cast<uint8*>(pBuf)), m_buf_size(buf_size), m_buf_ofs(0) { }
-
-   virtual ~memory_stream() { }
-
-   virtual bool put_buf(const void* pBuf, int64_t len)
-   {
-      uint64_t buf_remaining = m_buf_size - m_buf_ofs;
-      if ((uint64_t)len > buf_remaining)
-         return false;
-      memcpy(m_pBuf + m_buf_ofs, pBuf, len);
-      m_buf_ofs += len;
-      return true;
-   }
-
-   uint64_t get_size() const
-   {
-      return m_buf_ofs;
-   }
-};
-
-bool compress_image_to_jpeg_file_in_memory(void *pDstBuf, int64_t &buf_size, int64_t width, int64_t height, int64_t num_channels, const uint8 *pImage_data, const params &comp_params)
-{
-   if ((!pDstBuf) || (!buf_size))
-      return false;
-
-   memory_stream dst_stream(pDstBuf, buf_size);
-
-   buf_size = 0;
-
-   jpge::jpeg_encoder dst_image;
-   if (!dst_image.init(&dst_stream, width, height, num_channels, comp_params))
-      return false;
-
-   for (uint pass_index = 0; pass_index < dst_image.get_total_passes(); pass_index++)
-   {
-     for (int64_t i = 0; i < height; i++)
-     {
-        const uint8* pScanline = pImage_data + i * width * num_channels;
-        if (!dst_image.process_scanline(pScanline))
-           return false;
-     }
-     if (!dst_image.process_scanline(NULL))
-        return false;
-   }
-
-   dst_image.deinit();
-
-   buf_size = dst_stream.get_size();
-   return true;
-}
-
-} // namespace jpge
\ No newline at end of file
diff --git a/spaces/Lynx1221/rvc-test1/config.py b/spaces/Lynx1221/rvc-test1/config.py
deleted file mode 100644
index c0c16e0017efbcaf250cb539a1d0edb4e83575e4..0000000000000000000000000000000000000000
--- a/spaces/Lynx1221/rvc-test1/config.py
+++ /dev/null
@@ -1,88 +0,0 @@
-########################硬件参数########################
-
-# 填写cuda:x, cpu 或 mps, x指代第几张卡，只支持 N卡 / Apple Silicon 加速
-device = "cuda:0"
-
-# 9-10-20-30-40系显卡无脑True，不影响质量，>=20显卡开启有加速
-is_half = True
-
-# 默认0用上所有线程，写数字限制CPU资源使用
-n_cpu = 0
-
-########################硬件参数########################
-
-
-##################下为参数处理逻辑，勿动##################
-
-########################命令行参数########################
-import argparse
-
-parser = argparse.ArgumentParser()
-parser.add_argument("--port", type=int, default=7865, help="Listen port")
-parser.add_argument("--pycmd", type=str, default="python", help="Python command")
-parser.add_argument("--colab", action="store_true", help="Launch in colab")
-parser.add_argument(
-    "--noparallel", action="store_true", help="Disable parallel processing"
-)
-parser.add_argument(
-    "--noautoopen", action="store_true", help="Do not open in browser automatically"
-)
-cmd_opts, unknown = parser.parse_known_args()
-
-python_cmd = cmd_opts.pycmd
-listen_port = cmd_opts.port
-iscolab = cmd_opts.colab
-noparallel = cmd_opts.noparallel
-noautoopen = cmd_opts.noautoopen
-########################命令行参数########################
-
-import sys
-import torch
-
-
-# has_mps is only available in nightly pytorch (for now) and MasOS 12.3+.
-# check `getattr` and try it for compatibility
-def has_mps() -> bool:
-    if sys.platform != "darwin":
-        return False
-    else:
-        if not getattr(torch, "has_mps", False):
-            return False
-        try:
-            torch.zeros(1).to(torch.device("mps"))
-            return True
-        except Exception:
-            return False
-
-
-if not torch.cuda.is_available():
-    if has_mps():
-        print("没有发现支持的N卡, 使用MPS进行推理")
-        device = "mps"
-    else:
-        print("没有发现支持的N卡, 使用CPU进行推理")
-        device = "cpu"
-        is_half = False
-
-if device not in ["cpu", "mps"]:
-    gpu_name = torch.cuda.get_device_name(int(device.split(":")[-1]))
-    if "16" in gpu_name or "MX" in gpu_name:
-        print("16系显卡/MX系显卡强制单精度")
-        is_half = False
-
-from multiprocessing import cpu_count
-
-if n_cpu == 0:
-    n_cpu = cpu_count()
-if is_half:
-    # 6G显存配置
-    x_pad = 3
-    x_query = 10
-    x_center = 60
-    x_max = 65
-else:
-    # 5G显存配置
-    x_pad = 1
-    x_query = 6
-    x_center = 38
-    x_max = 41
diff --git a/spaces/MCkernick/Image_Restoration_Colorization/Face_Enhancement/models/networks/architecture.py b/spaces/MCkernick/Image_Restoration_Colorization/Face_Enhancement/models/networks/architecture.py
deleted file mode 100644
index 91eb91c8c9fd6500d191456bb3dd8b39d491bb5a..0000000000000000000000000000000000000000
--- a/spaces/MCkernick/Image_Restoration_Colorization/Face_Enhancement/models/networks/architecture.py
+++ /dev/null
@@ -1,173 +0,0 @@
-# Copyright (c) Microsoft Corporation.
-# Licensed under the MIT License.
-
-import torch
-import torch.nn as nn
-import torch.nn.functional as F
-import torchvision
-import torch.nn.utils.spectral_norm as spectral_norm
-from models.networks.normalization import SPADE
-
-
-# ResNet block that uses SPADE.
-# It differs from the ResNet block of pix2pixHD in that
-# it takes in the segmentation map as input, learns the skip connection if necessary,
-# and applies normalization first and then convolution.
-# This architecture seemed like a standard architecture for unconditional or
-# class-conditional GAN architecture using residual block.
-# The code was inspired from https://github.com/LMescheder/GAN_stability.
-class SPADEResnetBlock(nn.Module):
-    def __init__(self, fin, fout, opt):
-        super().__init__()
-        # Attributes
-        self.learned_shortcut = fin != fout
-        fmiddle = min(fin, fout)
-
-        self.opt = opt
-        # create conv layers
-        self.conv_0 = nn.Conv2d(fin, fmiddle, kernel_size=3, padding=1)
-        self.conv_1 = nn.Conv2d(fmiddle, fout, kernel_size=3, padding=1)
-        if self.learned_shortcut:
-            self.conv_s = nn.Conv2d(fin, fout, kernel_size=1, bias=False)
-
-        # apply spectral norm if specified
-        if "spectral" in opt.norm_G:
-            self.conv_0 = spectral_norm(self.conv_0)
-            self.conv_1 = spectral_norm(self.conv_1)
-            if self.learned_shortcut:
-                self.conv_s = spectral_norm(self.conv_s)
-
-        # define normalization layers
-        spade_config_str = opt.norm_G.replace("spectral", "")
-        self.norm_0 = SPADE(spade_config_str, fin, opt.semantic_nc, opt)
-        self.norm_1 = SPADE(spade_config_str, fmiddle, opt.semantic_nc, opt)
-        if self.learned_shortcut:
-            self.norm_s = SPADE(spade_config_str, fin, opt.semantic_nc, opt)
-
-    # note the resnet block with SPADE also takes in |seg|,
-    # the semantic segmentation map as input
-    def forward(self, x, seg, degraded_image):
-        x_s = self.shortcut(x, seg, degraded_image)
-
-        dx = self.conv_0(self.actvn(self.norm_0(x, seg, degraded_image)))
-        dx = self.conv_1(self.actvn(self.norm_1(dx, seg, degraded_image)))
-
-        out = x_s + dx
-
-        return out
-
-    def shortcut(self, x, seg, degraded_image):
-        if self.learned_shortcut:
-            x_s = self.conv_s(self.norm_s(x, seg, degraded_image))
-        else:
-            x_s = x
-        return x_s
-
-    def actvn(self, x):
-        return F.leaky_relu(x, 2e-1)
-
-
-# ResNet block used in pix2pixHD
-# We keep the same architecture as pix2pixHD.
-class ResnetBlock(nn.Module):
-    def __init__(self, dim, norm_layer, activation=nn.ReLU(False), kernel_size=3):
-        super().__init__()
-
-        pw = (kernel_size - 1) // 2
-        self.conv_block = nn.Sequential(
-            nn.ReflectionPad2d(pw),
-            norm_layer(nn.Conv2d(dim, dim, kernel_size=kernel_size)),
-            activation,
-            nn.ReflectionPad2d(pw),
-            norm_layer(nn.Conv2d(dim, dim, kernel_size=kernel_size)),
-        )
-
-    def forward(self, x):
-        y = self.conv_block(x)
-        out = x + y
-        return out
-
-
-# VGG architecter, used for the perceptual loss using a pretrained VGG network
-class VGG19(torch.nn.Module):
-    def __init__(self, requires_grad=False):
-        super().__init__()
-        vgg_pretrained_features = torchvision.models.vgg19(pretrained=True).features
-        self.slice1 = torch.nn.Sequential()
-        self.slice2 = torch.nn.Sequential()
-        self.slice3 = torch.nn.Sequential()
-        self.slice4 = torch.nn.Sequential()
-        self.slice5 = torch.nn.Sequential()
-        for x in range(2):
-            self.slice1.add_module(str(x), vgg_pretrained_features[x])
-        for x in range(2, 7):
-            self.slice2.add_module(str(x), vgg_pretrained_features[x])
-        for x in range(7, 12):
-            self.slice3.add_module(str(x), vgg_pretrained_features[x])
-        for x in range(12, 21):
-            self.slice4.add_module(str(x), vgg_pretrained_features[x])
-        for x in range(21, 30):
-            self.slice5.add_module(str(x), vgg_pretrained_features[x])
-        if not requires_grad:
-            for param in self.parameters():
-                param.requires_grad = False
-
-    def forward(self, X):
-        h_relu1 = self.slice1(X)
-        h_relu2 = self.slice2(h_relu1)
-        h_relu3 = self.slice3(h_relu2)
-        h_relu4 = self.slice4(h_relu3)
-        h_relu5 = self.slice5(h_relu4)
-        out = [h_relu1, h_relu2, h_relu3, h_relu4, h_relu5]
-        return out
-
-
-class SPADEResnetBlock_non_spade(nn.Module):
-    def __init__(self, fin, fout, opt):
-        super().__init__()
-        # Attributes
-        self.learned_shortcut = fin != fout
-        fmiddle = min(fin, fout)
-
-        self.opt = opt
-        # create conv layers
-        self.conv_0 = nn.Conv2d(fin, fmiddle, kernel_size=3, padding=1)
-        self.conv_1 = nn.Conv2d(fmiddle, fout, kernel_size=3, padding=1)
-        if self.learned_shortcut:
-            self.conv_s = nn.Conv2d(fin, fout, kernel_size=1, bias=False)
-
-        # apply spectral norm if specified
-        if "spectral" in opt.norm_G:
-            self.conv_0 = spectral_norm(self.conv_0)
-            self.conv_1 = spectral_norm(self.conv_1)
-            if self.learned_shortcut:
-                self.conv_s = spectral_norm(self.conv_s)
-
-        # define normalization layers
-        spade_config_str = opt.norm_G.replace("spectral", "")
-        self.norm_0 = SPADE(spade_config_str, fin, opt.semantic_nc, opt)
-        self.norm_1 = SPADE(spade_config_str, fmiddle, opt.semantic_nc, opt)
-        if self.learned_shortcut:
-            self.norm_s = SPADE(spade_config_str, fin, opt.semantic_nc, opt)
-
-    # note the resnet block with SPADE also takes in |seg|,
-    # the semantic segmentation map as input
-    def forward(self, x, seg, degraded_image):
-        x_s = self.shortcut(x, seg, degraded_image)
-
-        dx = self.conv_0(self.actvn(x))
-        dx = self.conv_1(self.actvn(dx))
-
-        out = x_s + dx
-
-        return out
-
-    def shortcut(self, x, seg, degraded_image):
-        if self.learned_shortcut:
-            x_s = self.conv_s(x)
-        else:
-            x_s = x
-        return x_s
-
-    def actvn(self, x):
-        return F.leaky_relu(x, 2e-1)
diff --git a/spaces/MLT-2022/Project/app.py b/spaces/MLT-2022/Project/app.py
deleted file mode 100644
index e1a189e43f1f6f7256f4124928edeebfca492ff9..0000000000000000000000000000000000000000
--- a/spaces/MLT-2022/Project/app.py
+++ /dev/null
@@ -1,44 +0,0 @@
-import cv2
-import numpy as np
-import gradio as gr
-import tensorflow as tf
-
-IMG_SIZE = 48
-CLASSES = ['angry', 'disgust', 'fear', 'happy', 'neutral', 'sad', 'surprise']
-
-model = tf.keras.models.load_model('CNN4G7.h5')
-
-def extract_face(image):
-    faceCascade = cv2.CascadeClassifier(cv2.data.haarcascades + 'haarcascade_frontalface_default.xml')
-    faces = faceCascade.detectMultiScale(image, minNeighbors=3, minSize=(30, 30))
-
-    if len(faces) == 0:
-        return cv2.resize(image, (IMG_SIZE, IMG_SIZE), interpolation = cv2.INTER_CUBIC)
-
-    x, y, w, h = faces[0]
-    face = image[y:y+h,x:x+w]
-    return cv2.resize(face, (IMG_SIZE, IMG_SIZE), interpolation = cv2.INTER_CUBIC)
-
-def preprocess_image(image):
-    return image.reshape(-1, IMG_SIZE, IMG_SIZE, 1)
-
-def predict_face_expression(image):
-    if image is None:
-        return "Please select an image..."
-
-    face = extract_face(image)
-    image = preprocess_image(face)
-    prediction = model.predict(image)
-    return { CLASSES[i]: float(prediction[0][i]) for i in range(len(CLASSES)) }
-
-with gr.Blocks() as app:
-    gr.Markdown('## Sistema de identificación de emociones basado en procesamiento de imágenes usando técnicas de Machine Learning')
-
-    with gr.Tab('Image'):
-        with gr.Row():
-            image_input = gr.Image(image_mode='L')
-        image_button = gr.Button('Submit')
-
-    image_button.click(predict_face_expression, inputs=image_input, outputs=gr.outputs.Label(num_top_classes=3))
-
-app.launch()
diff --git a/spaces/Mahit/DDoS_Attack_Classifier/app.py b/spaces/Mahit/DDoS_Attack_Classifier/app.py
deleted file mode 100644
index bd66998fc3b3cd213cb4a5175ac98f38a14071dc..0000000000000000000000000000000000000000
--- a/spaces/Mahit/DDoS_Attack_Classifier/app.py
+++ /dev/null
@@ -1,55 +0,0 @@
-import gradio as gr
-import joblib
-def make(Flow_Bytes_per_s,Fwd_Packets_Length_Total,Init_Fwd_Win_Bytes,Packet_Length_Variance,Packet_Length_Std,Down_Up_Ratio,Flow_IAT_Min,ACK_Flag_Count,Init_Bwd_Win_Bytes,Fwd_Seg_Size_Min,Bwd_Packet_Length_Min,Fwd_Packet_Length_Std,Fwd_IAT_Min,Fwd_Header_Length,URG_Flag_Count):
-#def make(a,b,c,d,e,f,g,h,i,j,k,l,m,n,o):    
-    #l=[Flow Bytes/s,Fwd Packets Length Total,Init Fwd Win Bytes,Packet Length Variance,Packet Length Std,Down/Up Ratio,Flow IAT Min,ACK Flag Count,Init Bwd Win Bytes,Fwd Seg Size Min,Bwd Packet Length Min,Fwd Packet Length Std,Fwd IAT Min,Fwd Header Length,URG Flag Count]
-    # Input =Input.strip("'")  # Remove leading and trailing double quotes
-    #l=[a,b,c,d,e,f,g,h,i,j,k,l,m,n,o]
-    l=[Flow_Bytes_per_s,Fwd_Packets_Length_Total,Init_Fwd_Win_Bytes,Packet_Length_Variance,Packet_Length_Std,Down_Up_Ratio,Flow_IAT_Min,ACK_Flag_Count,Init_Bwd_Win_Bytes,Fwd_Seg_Size_Min,Bwd_Packet_Length_Min,Fwd_Packet_Length_Std,Fwd_IAT_Min,Fwd_Header_Length,URG_Flag_Count]
-    reverse_encoding={
-0:"Benign",
-1:"DNS",
-2:"LDAP",
-3:'MSSQL',
-4:"NTP",
-5:"NetBIOS",
-6:"Portmap",
-7:"SNMP",
-8:"Syn",
-9:"TFTP",
-10:"UDP",
-11:"UDPLag",
-12:"WebDDoS"}
-    s=[]
-    s.append(l)
-    loaded_model = joblib.load('your_model.pkl')
-    predictions=loaded_model.predict(s)
-    # for i in range(len(predictions)):
-    #     print("Prediction",i+1,':',reverse_encoding[predictions[i]])
-    import csv
-    input_file = "predictions.csv"
-    new_row = l
-    new_row.append(reverse_encoding[predictions[0]])
-    with open(input_file, 'r', newline='') as infile:
-        reader = csv.reader(infile)
-        data = list(reader)
-    with open(input_file, 'a', newline='') as outfile:
-        writer = csv.writer(outfile)
-        writer.writerow(new_row)
-    return reverse_encoding[predictions[0]]
-headline ="""
-Department of Information Technology \n
-National Institute of Technology Karnataka \n
-Contributors: Mahit Nandan (211AI001), Ishan Godbole (211AI020) \n
-Course Instructor: Dr. Jaidhar C.D. \n
-DDoS Attack Classification
-"""
-iface=gr.Interface(fn=make,
-                   inputs=[gr.Number(value=float),gr.Number(value=float),gr.Number(value=float),gr.Number(value=float),gr.Number(value=float),gr.Number(value=float),gr.Number(value=float),gr.Number(value=float),gr.Number(value=float),gr.Number(value=float),gr.Number(value=float),gr.Number(value=float),gr.Number(value=float),gr.Number(value=float),gr.Number(value=float)],
-                   outputs="text",title=headline,
-                  examples=[[9638.51,2088.0,-1,1130.1428,33.617596,0.0,0.0,0,-1,14,0.0,35.08846,0.0,96,0],
-                           [21989.434,3552.0,257,442608.88,665.2886,1.0,1.0,0,386,20,6.0,877.0259,2.0,120,1],
-                            [46730160.0,2944.0,-1,0.0,0.0,0.0,63.0,0,-1,-1062718972,0.0,0.0,63.0,-2125437944,0]
-                           ])
-# iface.launch(share=True)
-iface.launch(share=True,debug=False)
\ No newline at end of file
diff --git a/spaces/Make-A-Protagonist/Make-A-Protagonist-inference/Make-A-Protagonist/experts/GroundedSAM/GroundingDINO/groundingdino/models/GroundingDINO/ms_deform_attn.py b/spaces/Make-A-Protagonist/Make-A-Protagonist-inference/Make-A-Protagonist/experts/GroundedSAM/GroundingDINO/groundingdino/models/GroundingDINO/ms_deform_attn.py
deleted file mode 100644
index 489d501bef364020212306d81e9b85c8daa27491..0000000000000000000000000000000000000000
--- a/spaces/Make-A-Protagonist/Make-A-Protagonist-inference/Make-A-Protagonist/experts/GroundedSAM/GroundingDINO/groundingdino/models/GroundingDINO/ms_deform_attn.py
+++ /dev/null
@@ -1,413 +0,0 @@
-# ------------------------------------------------------------------------
-# Grounding DINO
-# url: https://github.com/IDEA-Research/GroundingDINO
-# Copyright (c) 2023 IDEA. All Rights Reserved.
-# Licensed under the Apache License, Version 2.0 [see LICENSE for details]
-# ------------------------------------------------------------------------
-# Deformable DETR
-# Copyright (c) 2020 SenseTime. All Rights Reserved.
-# Licensed under the Apache License, Version 2.0 [see LICENSE for details]
-# ------------------------------------------------------------------------------------------------
-# Modified from:
-# https://github.com/fundamentalvision/Deformable-DETR/blob/main/models/ops/functions/ms_deform_attn_func.py
-# https://github.com/fundamentalvision/Deformable-DETR/blob/main/models/ops/modules/ms_deform_attn.py
-# https://github.com/open-mmlab/mmcv/blob/master/mmcv/ops/multi_scale_deform_attn.py
-# ------------------------------------------------------------------------------------------------
-
-import math
-import warnings
-from typing import Optional
-
-import torch
-import torch.nn as nn
-import torch.nn.functional as F
-from torch.autograd import Function
-from torch.autograd.function import once_differentiable
-from torch.nn.init import constant_, xavier_uniform_
-
-try:
-    from groundingdino import _C
-except:
-    warnings.warn("Failed to load custom C++ ops. Running on CPU mode Only!")
-
-
-# helpers
-def _is_power_of_2(n):
-    if (not isinstance(n, int)) or (n < 0):
-        raise ValueError("invalid input for _is_power_of_2: {} (type: {})".format(n, type(n)))
-    return (n & (n - 1) == 0) and n != 0
-
-
-class MultiScaleDeformableAttnFunction(Function):
-    @staticmethod
-    def forward(
-        ctx,
-        value,
-        value_spatial_shapes,
-        value_level_start_index,
-        sampling_locations,
-        attention_weights,
-        im2col_step,
-    ):
-        ctx.im2col_step = im2col_step
-        output = _C.ms_deform_attn_forward(
-            value,
-            value_spatial_shapes,
-            value_level_start_index,
-            sampling_locations,
-            attention_weights,
-            ctx.im2col_step,
-        )
-        ctx.save_for_backward(
-            value,
-            value_spatial_shapes,
-            value_level_start_index,
-            sampling_locations,
-            attention_weights,
-        )
-        return output
-
-    @staticmethod
-    @once_differentiable
-    def backward(ctx, grad_output):
-        (
-            value,
-            value_spatial_shapes,
-            value_level_start_index,
-            sampling_locations,
-            attention_weights,
-        ) = ctx.saved_tensors
-        grad_value, grad_sampling_loc, grad_attn_weight = _C.ms_deform_attn_backward(
-            value,
-            value_spatial_shapes,
-            value_level_start_index,
-            sampling_locations,
-            attention_weights,
-            grad_output,
-            ctx.im2col_step,
-        )
-
-        return grad_value, None, None, grad_sampling_loc, grad_attn_weight, None
-
-
-def multi_scale_deformable_attn_pytorch(
-    value: torch.Tensor,
-    value_spatial_shapes: torch.Tensor,
-    sampling_locations: torch.Tensor,
-    attention_weights: torch.Tensor,
-) -> torch.Tensor:
-
-    bs, _, num_heads, embed_dims = value.shape
-    _, num_queries, num_heads, num_levels, num_points, _ = sampling_locations.shape
-    value_list = value.split([H_ * W_ for H_, W_ in value_spatial_shapes], dim=1)
-    sampling_grids = 2 * sampling_locations - 1
-    sampling_value_list = []
-    for level, (H_, W_) in enumerate(value_spatial_shapes):
-        # bs, H_*W_, num_heads, embed_dims ->
-        # bs, H_*W_, num_heads*embed_dims ->
-        # bs, num_heads*embed_dims, H_*W_ ->
-        # bs*num_heads, embed_dims, H_, W_
-        value_l_ = (
-            value_list[level].flatten(2).transpose(1, 2).reshape(bs * num_heads, embed_dims, H_, W_)
-        )
-        # bs, num_queries, num_heads, num_points, 2 ->
-        # bs, num_heads, num_queries, num_points, 2 ->
-        # bs*num_heads, num_queries, num_points, 2
-        sampling_grid_l_ = sampling_grids[:, :, :, level].transpose(1, 2).flatten(0, 1)
-        # bs*num_heads, embed_dims, num_queries, num_points
-        sampling_value_l_ = F.grid_sample(
-            value_l_, sampling_grid_l_, mode="bilinear", padding_mode="zeros", align_corners=False
-        )
-        sampling_value_list.append(sampling_value_l_)
-    # (bs, num_queries, num_heads, num_levels, num_points) ->
-    # (bs, num_heads, num_queries, num_levels, num_points) ->
-    # (bs, num_heads, 1, num_queries, num_levels*num_points)
-    attention_weights = attention_weights.transpose(1, 2).reshape(
-        bs * num_heads, 1, num_queries, num_levels * num_points
-    )
-    output = (
-        (torch.stack(sampling_value_list, dim=-2).flatten(-2) * attention_weights)
-        .sum(-1)
-        .view(bs, num_heads * embed_dims, num_queries)
-    )
-    return output.transpose(1, 2).contiguous()
-
-
-class MultiScaleDeformableAttention(nn.Module):
-    """Multi-Scale Deformable Attention Module used in Deformable-DETR
-
-    `Deformable DETR: Deformable Transformers for End-to-End Object Detection.
-    <https://arxiv.org/pdf/2010.04159.pdf>`_.
-
-    Args:
-        embed_dim (int): The embedding dimension of Attention. Default: 256.
-        num_heads (int): The number of attention heads. Default: 8.
-        num_levels (int): The number of feature map used in Attention. Default: 4.
-        num_points (int): The number of sampling points for each query
-            in each head. Default: 4.
-        img2col_steps (int): The step used in image_to_column. Defualt: 64.
-            dropout (float): Dropout layer used in output. Default: 0.1.
-        batch_first (bool): if ``True``, then the input and output tensor will be
-            provided as `(bs, n, embed_dim)`. Default: False. `(n, bs, embed_dim)`
-    """
-
-    def __init__(
-        self,
-        embed_dim: int = 256,
-        num_heads: int = 8,
-        num_levels: int = 4,
-        num_points: int = 4,
-        img2col_step: int = 64,
-        batch_first: bool = False,
-    ):
-        super().__init__()
-        if embed_dim % num_heads != 0:
-            raise ValueError(
-                "embed_dim must be divisible by num_heads, but got {} and {}".format(
-                    embed_dim, num_heads
-                )
-            )
-        head_dim = embed_dim // num_heads
-
-        self.batch_first = batch_first
-
-        if not _is_power_of_2(head_dim):
-            warnings.warn(
-                """
-                You'd better set d_model in MSDeformAttn to make sure that
-                each dim of the attention head a power of 2, which is more efficient.
-                """
-            )
-
-        self.im2col_step = img2col_step
-        self.embed_dim = embed_dim
-        self.num_heads = num_heads
-        self.num_levels = num_levels
-        self.num_points = num_points
-        self.sampling_offsets = nn.Linear(embed_dim, num_heads * num_levels * num_points * 2)
-        self.attention_weights = nn.Linear(embed_dim, num_heads * num_levels * num_points)
-        self.value_proj = nn.Linear(embed_dim, embed_dim)
-        self.output_proj = nn.Linear(embed_dim, embed_dim)
-
-        self.init_weights()
-
-    def _reset_parameters(self):
-        return self.init_weights()
-
-    def init_weights(self):
-        """
-        Default initialization for Parameters of Module.
-        """
-        constant_(self.sampling_offsets.weight.data, 0.0)
-        thetas = torch.arange(self.num_heads, dtype=torch.float32) * (
-            2.0 * math.pi / self.num_heads
-        )
-        grid_init = torch.stack([thetas.cos(), thetas.sin()], -1)
-        grid_init = (
-            (grid_init / grid_init.abs().max(-1, keepdim=True)[0])
-            .view(self.num_heads, 1, 1, 2)
-            .repeat(1, self.num_levels, self.num_points, 1)
-        )
-        for i in range(self.num_points):
-            grid_init[:, :, i, :] *= i + 1
-        with torch.no_grad():
-            self.sampling_offsets.bias = nn.Parameter(grid_init.view(-1))
-        constant_(self.attention_weights.weight.data, 0.0)
-        constant_(self.attention_weights.bias.data, 0.0)
-        xavier_uniform_(self.value_proj.weight.data)
-        constant_(self.value_proj.bias.data, 0.0)
-        xavier_uniform_(self.output_proj.weight.data)
-        constant_(self.output_proj.bias.data, 0.0)
-
-    def freeze_sampling_offsets(self):
-        print("Freeze sampling offsets")
-        self.sampling_offsets.weight.requires_grad = False
-        self.sampling_offsets.bias.requires_grad = False
-
-    def freeze_attention_weights(self):
-        print("Freeze attention weights")
-        self.attention_weights.weight.requires_grad = False
-        self.attention_weights.bias.requires_grad = False
-
-    def forward(
-        self,
-        query: torch.Tensor,
-        key: Optional[torch.Tensor] = None,
-        value: Optional[torch.Tensor] = None,
-        query_pos: Optional[torch.Tensor] = None,
-        key_padding_mask: Optional[torch.Tensor] = None,
-        reference_points: Optional[torch.Tensor] = None,
-        spatial_shapes: Optional[torch.Tensor] = None,
-        level_start_index: Optional[torch.Tensor] = None,
-        **kwargs
-    ) -> torch.Tensor:
-
-        """Forward Function of MultiScaleDeformableAttention
-
-        Args:
-            query (torch.Tensor): Query embeddings with shape
-                `(num_query, bs, embed_dim)`
-            key (torch.Tensor): Key embeddings with shape
-                `(num_key, bs, embed_dim)`
-            value (torch.Tensor): Value embeddings with shape
-                `(num_key, bs, embed_dim)`
-            query_pos (torch.Tensor): The position embedding for `query`. Default: None.
-            key_padding_mask (torch.Tensor): ByteTensor for `query`, with shape `(bs, num_key)`,
-                indicating which elements within `key` to be ignored in attention.
-            reference_points (torch.Tensor): The normalized reference points
-                with shape `(bs, num_query, num_levels, 2)`,
-                all elements is range in [0, 1], top-left (0, 0),
-                bottom-right (1, 1), including padding are.
-                or `(N, Length_{query}, num_levels, 4)`, add additional
-                two dimensions `(h, w)` to form reference boxes.
-            spatial_shapes (torch.Tensor): Spatial shape of features in different levels.
-                With shape `(num_levels, 2)`, last dimension represents `(h, w)`.
-            level_start_index (torch.Tensor): The start index of each level. A tensor with
-                shape `(num_levels, )` which can be represented as
-                `[0, h_0 * w_0, h_0 * w_0 + h_1 * w_1, ...]`.
-
-        Returns:
-            torch.Tensor: forward results with shape `(num_query, bs, embed_dim)`
-        """
-
-        if value is None:
-            value = query
-
-        if query_pos is not None:
-            query = query + query_pos
-
-        if not self.batch_first:
-            # change to (bs, num_query ,embed_dims)
-            query = query.permute(1, 0, 2)
-            value = value.permute(1, 0, 2)
-
-        bs, num_query, _ = query.shape
-        bs, num_value, _ = value.shape
-
-        assert (spatial_shapes[:, 0] * spatial_shapes[:, 1]).sum() == num_value
-
-        value = self.value_proj(value)
-        if key_padding_mask is not None:
-            value = value.masked_fill(key_padding_mask[..., None], float(0))
-        value = value.view(bs, num_value, self.num_heads, -1)
-        sampling_offsets = self.sampling_offsets(query).view(
-            bs, num_query, self.num_heads, self.num_levels, self.num_points, 2
-        )
-        attention_weights = self.attention_weights(query).view(
-            bs, num_query, self.num_heads, self.num_levels * self.num_points
-        )
-        attention_weights = attention_weights.softmax(-1)
-        attention_weights = attention_weights.view(
-            bs,
-            num_query,
-            self.num_heads,
-            self.num_levels,
-            self.num_points,
-        )
-
-        # bs, num_query, num_heads, num_levels, num_points, 2
-        if reference_points.shape[-1] == 2:
-            offset_normalizer = torch.stack([spatial_shapes[..., 1], spatial_shapes[..., 0]], -1)
-            sampling_locations = (
-                reference_points[:, :, None, :, None, :]
-                + sampling_offsets / offset_normalizer[None, None, None, :, None, :]
-            )
-        elif reference_points.shape[-1] == 4:
-            sampling_locations = (
-                reference_points[:, :, None, :, None, :2]
-                + sampling_offsets
-                / self.num_points
-                * reference_points[:, :, None, :, None, 2:]
-                * 0.5
-            )
-        else:
-            raise ValueError(
-                "Last dim of reference_points must be 2 or 4, but get {} instead.".format(
-                    reference_points.shape[-1]
-                )
-            )
-    
-        if torch.cuda.is_available() and value.is_cuda:
-            halffloat = False
-            if value.dtype == torch.float16:
-                halffloat = True
-                value = value.float()
-                sampling_locations = sampling_locations.float()
-                attention_weights = attention_weights.float()
-
-            output = MultiScaleDeformableAttnFunction.apply(
-                value,
-                spatial_shapes,
-                level_start_index,
-                sampling_locations,
-                attention_weights,
-                self.im2col_step,
-            )
-
-            if halffloat:
-                output = output.half()
-        else:
-            output = multi_scale_deformable_attn_pytorch(
-                value, spatial_shapes, sampling_locations, attention_weights
-            )
-
-        output = self.output_proj(output)
-
-        if not self.batch_first:
-            output = output.permute(1, 0, 2)
-
-        return output
-
-
-def create_dummy_class(klass, dependency, message=""):
-    """
-    When a dependency of a class is not available, create a dummy class which throws ImportError
-    when used.
-
-    Args:
-        klass (str): name of the class.
-        dependency (str): name of the dependency.
-        message: extra message to print
-    Returns:
-        class: a class object
-    """
-    err = "Cannot import '{}', therefore '{}' is not available.".format(dependency, klass)
-    if message:
-        err = err + " " + message
-
-    class _DummyMetaClass(type):
-        # throw error on class attribute access
-        def __getattr__(_, __):  # noqa: B902
-            raise ImportError(err)
-
-    class _Dummy(object, metaclass=_DummyMetaClass):
-        # throw error on constructor
-        def __init__(self, *args, **kwargs):
-            raise ImportError(err)
-
-    return _Dummy
-
-
-def create_dummy_func(func, dependency, message=""):
-    """
-    When a dependency of a function is not available, create a dummy function which throws
-    ImportError when used.
-
-    Args:
-        func (str): name of the function.
-        dependency (str or list[str]): name(s) of the dependency.
-        message: extra message to print
-    Returns:
-        function: a function object
-    """
-    err = "Cannot import '{}', therefore '{}' is not available.".format(dependency, func)
-    if message:
-        err = err + " " + message
-
-    if isinstance(dependency, (list, tuple)):
-        dependency = ",".join(dependency)
-
-    def _dummy(*args, **kwargs):
-        raise ImportError(err)
-
-    return _dummy
diff --git a/spaces/MarcusSu1216/XingTong/preprocess_hubert_f0.py b/spaces/MarcusSu1216/XingTong/preprocess_hubert_f0.py
deleted file mode 100644
index 763fb0d65540ed4d62b269914e81c740f3ff6bba..0000000000000000000000000000000000000000
--- a/spaces/MarcusSu1216/XingTong/preprocess_hubert_f0.py
+++ /dev/null
@@ -1,101 +0,0 @@
-import math
-import multiprocessing
-import os
-import argparse
-from random import shuffle
-
-import torch
-from glob import glob
-from tqdm import tqdm
-from modules.mel_processing import spectrogram_torch
-
-import utils
-import logging
-
-logging.getLogger("numba").setLevel(logging.WARNING)
-import librosa
-import numpy as np
-
-hps = utils.get_hparams_from_file("configs/config.json")
-sampling_rate = hps.data.sampling_rate
-hop_length = hps.data.hop_length
-
-
-def process_one(filename, hmodel):
-    # print(filename)
-    wav, sr = librosa.load(filename, sr=sampling_rate)
-    soft_path = filename + ".soft.pt"
-    if not os.path.exists(soft_path):
-        device = torch.device("cuda" if torch.cuda.is_available() else "cpu")
-        wav16k = librosa.resample(wav, orig_sr=sampling_rate, target_sr=16000)
-        wav16k = torch.from_numpy(wav16k).to(device)
-        c = utils.get_hubert_content(hmodel, wav_16k_tensor=wav16k)
-        torch.save(c.cpu(), soft_path)
-
-    f0_path = filename + ".f0.npy"
-    if not os.path.exists(f0_path):
-        f0 = utils.compute_f0_dio(
-            wav, sampling_rate=sampling_rate, hop_length=hop_length
-        )
-        np.save(f0_path, f0)
-
-    spec_path = filename.replace(".wav", ".spec.pt")
-    if not os.path.exists(spec_path):
-        # Process spectrogram
-        # The following code can't be replaced by torch.FloatTensor(wav)
-        # because load_wav_to_torch return a tensor that need to be normalized
-
-        audio, sr = utils.load_wav_to_torch(filename)
-        if sr != hps.data.sampling_rate:
-            raise ValueError(
-                "{} SR doesn't match target {} SR".format(
-                    sr, hps.data.sampling_rate
-                )
-            )
-
-        audio_norm = audio / hps.data.max_wav_value
-        audio_norm = audio_norm.unsqueeze(0)
-
-        spec = spectrogram_torch(
-            audio_norm,
-            hps.data.filter_length,
-            hps.data.sampling_rate,
-            hps.data.hop_length,
-            hps.data.win_length,
-            center=False,
-        )
-        spec = torch.squeeze(spec, 0)
-        torch.save(spec, spec_path)
-
-
-def process_batch(filenames):
-    print("Loading hubert for content...")
-    device = "cuda" if torch.cuda.is_available() else "cpu"
-    hmodel = utils.get_hubert_model().to(device)
-    print("Loaded hubert.")
-    for filename in tqdm(filenames):
-        process_one(filename, hmodel)
-
-
-if __name__ == "__main__":
-    parser = argparse.ArgumentParser()
-    parser.add_argument(
-        "--in_dir", type=str, default="dataset/44k", help="path to input dir"
-    )
-
-    args = parser.parse_args()
-    filenames = glob(f"{args.in_dir}/*/*.wav", recursive=True)  # [:10]
-    shuffle(filenames)
-    multiprocessing.set_start_method("spawn", force=True)
-
-    num_processes = 1
-    chunk_size = int(math.ceil(len(filenames) / num_processes))
-    chunks = [
-        filenames[i : i + chunk_size] for i in range(0, len(filenames), chunk_size)
-    ]
-    print([len(c) for c in chunks])
-    processes = [
-        multiprocessing.Process(target=process_batch, args=(chunk,)) for chunk in chunks
-    ]
-    for p in processes:
-        p.start()
diff --git a/spaces/Matthijs/speecht5-vc-demo/README.md b/spaces/Matthijs/speecht5-vc-demo/README.md
deleted file mode 100644
index e08173e4b4b70ad315f971aacab6d6d1eabd38d0..0000000000000000000000000000000000000000
--- a/spaces/Matthijs/speecht5-vc-demo/README.md
+++ /dev/null
@@ -1,13 +0,0 @@
----
-title: SpeechT5 Voice Conversion Demo
-emoji: 👩‍🎤
-colorFrom: yellow
-colorTo: blue
-sdk: gradio
-sdk_version: 3.17.0
-app_file: app.py
-pinned: false
-license: apache-2.0
----
-
-Check out the configuration reference at https://huggingface.co/docs/hub/spaces-config-reference
diff --git a/spaces/MattyWhite/ChatGPT-ImageCaptioner2/tools/get_lvis_cat_info.py b/spaces/MattyWhite/ChatGPT-ImageCaptioner2/tools/get_lvis_cat_info.py
deleted file mode 100644
index 83f286983ce811c4057ea8e8041e6a95dda78113..0000000000000000000000000000000000000000
--- a/spaces/MattyWhite/ChatGPT-ImageCaptioner2/tools/get_lvis_cat_info.py
+++ /dev/null
@@ -1,44 +0,0 @@
-# Copyright (c) Facebook, Inc. and its affiliates.
-import argparse
-import json
-
-if __name__ == '__main__':
-    parser = argparse.ArgumentParser()
-    parser.add_argument("--ann", default='datasets/lvis/lvis_v1_train.json')
-    parser.add_argument("--add_freq", action='store_true')
-    parser.add_argument("--r_thresh", type=int, default=10)
-    parser.add_argument("--c_thresh", type=int, default=100)
-    args = parser.parse_args()
-
-    print('Loading', args.ann)
-    data = json.load(open(args.ann, 'r'))
-    cats = data['categories']
-    image_count = {x['id']: set() for x in cats}
-    ann_count = {x['id']: 0 for x in cats}
-    for x in data['annotations']:
-        image_count[x['category_id']].add(x['image_id'])
-        ann_count[x['category_id']] += 1
-    num_freqs = {x: 0 for x in ['r', 'f', 'c']}
-    for x in cats:
-        x['image_count'] = len(image_count[x['id']])
-        x['instance_count'] = ann_count[x['id']]
-        if args.add_freq:
-            freq = 'f'
-            if x['image_count'] < args.c_thresh:
-                freq = 'c'
-            if x['image_count'] < args.r_thresh:
-                freq = 'r'
-            x['frequency'] = freq
-            num_freqs[freq] += 1
-    print(cats)
-    image_counts = sorted([x['image_count'] for x in cats])
-    # print('image count', image_counts)
-    # import pdb; pdb.set_trace()
-    if args.add_freq:
-        for x in ['r', 'c', 'f']:
-            print(x, num_freqs[x])
-    out = cats # {'categories': cats}
-    out_path = args.ann[:-5] + '_cat_info.json'
-    print('Saving to', out_path)
-    json.dump(out, open(out_path, 'w'))
-    
diff --git a/spaces/Mellow-ai/PhotoAI_Mellow/annotator/openpose/util.py b/spaces/Mellow-ai/PhotoAI_Mellow/annotator/openpose/util.py
deleted file mode 100644
index 6f91ae0e65abaf0cbd62d803f56498991141e61b..0000000000000000000000000000000000000000
--- a/spaces/Mellow-ai/PhotoAI_Mellow/annotator/openpose/util.py
+++ /dev/null
@@ -1,164 +0,0 @@
-import math
-import numpy as np
-import matplotlib
-import cv2
-
-
-def padRightDownCorner(img, stride, padValue):
-    h = img.shape[0]
-    w = img.shape[1]
-
-    pad = 4 * [None]
-    pad[0] = 0 # up
-    pad[1] = 0 # left
-    pad[2] = 0 if (h % stride == 0) else stride - (h % stride) # down
-    pad[3] = 0 if (w % stride == 0) else stride - (w % stride) # right
-
-    img_padded = img
-    pad_up = np.tile(img_padded[0:1, :, :]*0 + padValue, (pad[0], 1, 1))
-    img_padded = np.concatenate((pad_up, img_padded), axis=0)
-    pad_left = np.tile(img_padded[:, 0:1, :]*0 + padValue, (1, pad[1], 1))
-    img_padded = np.concatenate((pad_left, img_padded), axis=1)
-    pad_down = np.tile(img_padded[-2:-1, :, :]*0 + padValue, (pad[2], 1, 1))
-    img_padded = np.concatenate((img_padded, pad_down), axis=0)
-    pad_right = np.tile(img_padded[:, -2:-1, :]*0 + padValue, (1, pad[3], 1))
-    img_padded = np.concatenate((img_padded, pad_right), axis=1)
-
-    return img_padded, pad
-
-# transfer caffe model to pytorch which will match the layer name
-def transfer(model, model_weights):
-    transfered_model_weights = {}
-    for weights_name in model.state_dict().keys():
-        transfered_model_weights[weights_name] = model_weights['.'.join(weights_name.split('.')[1:])]
-    return transfered_model_weights
-
-# draw the body keypoint and lims
-def draw_bodypose(canvas, candidate, subset):
-    stickwidth = 4
-    limbSeq = [[2, 3], [2, 6], [3, 4], [4, 5], [6, 7], [7, 8], [2, 9], [9, 10], \
-               [10, 11], [2, 12], [12, 13], [13, 14], [2, 1], [1, 15], [15, 17], \
-               [1, 16], [16, 18], [3, 17], [6, 18]]
-
-    colors = [[255, 0, 0], [255, 85, 0], [255, 170, 0], [255, 255, 0], [170, 255, 0], [85, 255, 0], [0, 255, 0], \
-              [0, 255, 85], [0, 255, 170], [0, 255, 255], [0, 170, 255], [0, 85, 255], [0, 0, 255], [85, 0, 255], \
-              [170, 0, 255], [255, 0, 255], [255, 0, 170], [255, 0, 85]]
-    for i in range(18):
-        for n in range(len(subset)):
-            index = int(subset[n][i])
-            if index == -1:
-                continue
-            x, y = candidate[index][0:2]
-            cv2.circle(canvas, (int(x), int(y)), 4, colors[i], thickness=-1)
-    for i in range(17):
-        for n in range(len(subset)):
-            index = subset[n][np.array(limbSeq[i]) - 1]
-            if -1 in index:
-                continue
-            cur_canvas = canvas.copy()
-            Y = candidate[index.astype(int), 0]
-            X = candidate[index.astype(int), 1]
-            mX = np.mean(X)
-            mY = np.mean(Y)
-            length = ((X[0] - X[1]) ** 2 + (Y[0] - Y[1]) ** 2) ** 0.5
-            angle = math.degrees(math.atan2(X[0] - X[1], Y[0] - Y[1]))
-            polygon = cv2.ellipse2Poly((int(mY), int(mX)), (int(length / 2), stickwidth), int(angle), 0, 360, 1)
-            cv2.fillConvexPoly(cur_canvas, polygon, colors[i])
-            canvas = cv2.addWeighted(canvas, 0.4, cur_canvas, 0.6, 0)
-    # plt.imsave("preview.jpg", canvas[:, :, [2, 1, 0]])
-    # plt.imshow(canvas[:, :, [2, 1, 0]])
-    return canvas
-
-
-# image drawed by opencv is not good.
-def draw_handpose(canvas, all_hand_peaks, show_number=False):
-    edges = [[0, 1], [1, 2], [2, 3], [3, 4], [0, 5], [5, 6], [6, 7], [7, 8], [0, 9], [9, 10], \
-             [10, 11], [11, 12], [0, 13], [13, 14], [14, 15], [15, 16], [0, 17], [17, 18], [18, 19], [19, 20]]
-
-    for peaks in all_hand_peaks:
-        for ie, e in enumerate(edges):
-            if np.sum(np.all(peaks[e], axis=1)==0)==0:
-                x1, y1 = peaks[e[0]]
-                x2, y2 = peaks[e[1]]
-                cv2.line(canvas, (x1, y1), (x2, y2), matplotlib.colors.hsv_to_rgb([ie/float(len(edges)), 1.0, 1.0])*255, thickness=2)
-
-        for i, keyponit in enumerate(peaks):
-            x, y = keyponit
-            cv2.circle(canvas, (x, y), 4, (0, 0, 255), thickness=-1)
-            if show_number:
-                cv2.putText(canvas, str(i), (x, y), cv2.FONT_HERSHEY_SIMPLEX, 0.3, (0, 0, 0), lineType=cv2.LINE_AA)
-    return canvas
-
-# detect hand according to body pose keypoints
-# please refer to https://github.com/CMU-Perceptual-Computing-Lab/openpose/blob/master/src/openpose/hand/handDetector.cpp
-def handDetect(candidate, subset, oriImg):
-    # right hand: wrist 4, elbow 3, shoulder 2
-    # left hand: wrist 7, elbow 6, shoulder 5
-    ratioWristElbow = 0.33
-    detect_result = []
-    image_height, image_width = oriImg.shape[0:2]
-    for person in subset.astype(int):
-        # if any of three not detected
-        has_left = np.sum(person[[5, 6, 7]] == -1) == 0
-        has_right = np.sum(person[[2, 3, 4]] == -1) == 0
-        if not (has_left or has_right):
-            continue
-        hands = []
-        #left hand
-        if has_left:
-            left_shoulder_index, left_elbow_index, left_wrist_index = person[[5, 6, 7]]
-            x1, y1 = candidate[left_shoulder_index][:2]
-            x2, y2 = candidate[left_elbow_index][:2]
-            x3, y3 = candidate[left_wrist_index][:2]
-            hands.append([x1, y1, x2, y2, x3, y3, True])
-        # right hand
-        if has_right:
-            right_shoulder_index, right_elbow_index, right_wrist_index = person[[2, 3, 4]]
-            x1, y1 = candidate[right_shoulder_index][:2]
-            x2, y2 = candidate[right_elbow_index][:2]
-            x3, y3 = candidate[right_wrist_index][:2]
-            hands.append([x1, y1, x2, y2, x3, y3, False])
-
-        for x1, y1, x2, y2, x3, y3, is_left in hands:
-            # pos_hand = pos_wrist + ratio * (pos_wrist - pos_elbox) = (1 + ratio) * pos_wrist - ratio * pos_elbox
-            # handRectangle.x = posePtr[wrist*3] + ratioWristElbow * (posePtr[wrist*3] - posePtr[elbow*3]);
-            # handRectangle.y = posePtr[wrist*3+1] + ratioWristElbow * (posePtr[wrist*3+1] - posePtr[elbow*3+1]);
-            # const auto distanceWristElbow = getDistance(poseKeypoints, person, wrist, elbow);
-            # const auto distanceElbowShoulder = getDistance(poseKeypoints, person, elbow, shoulder);
-            # handRectangle.width = 1.5f * fastMax(distanceWristElbow, 0.9f * distanceElbowShoulder);
-            x = x3 + ratioWristElbow * (x3 - x2)
-            y = y3 + ratioWristElbow * (y3 - y2)
-            distanceWristElbow = math.sqrt((x3 - x2) ** 2 + (y3 - y2) ** 2)
-            distanceElbowShoulder = math.sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2)
-            width = 1.5 * max(distanceWristElbow, 0.9 * distanceElbowShoulder)
-            # x-y refers to the center --> offset to topLeft point
-            # handRectangle.x -= handRectangle.width / 2.f;
-            # handRectangle.y -= handRectangle.height / 2.f;
-            x -= width / 2
-            y -= width / 2  # width = height
-            # overflow the image
-            if x < 0: x = 0
-            if y < 0: y = 0
-            width1 = width
-            width2 = width
-            if x + width > image_width: width1 = image_width - x
-            if y + width > image_height: width2 = image_height - y
-            width = min(width1, width2)
-            # the max hand box value is 20 pixels
-            if width >= 20:
-                detect_result.append([int(x), int(y), int(width), is_left])
-
-    '''
-    return value: [[x, y, w, True if left hand else False]].
-    width=height since the network require squared input.
-    x, y is the coordinate of top left 
-    '''
-    return detect_result
-
-# get max index of 2d array
-def npmax(array):
-    arrayindex = array.argmax(1)
-    arrayvalue = array.max(1)
-    i = arrayvalue.argmax()
-    j = arrayindex[i]
-    return i, j
diff --git a/spaces/Mellow-ai/PhotoAI_Mellow/annotator/uniformer/mmcv/ops/deprecated_wrappers.py b/spaces/Mellow-ai/PhotoAI_Mellow/annotator/uniformer/mmcv/ops/deprecated_wrappers.py
deleted file mode 100644
index a2e593df9ee57637038683d7a1efaa347b2b69e7..0000000000000000000000000000000000000000
--- a/spaces/Mellow-ai/PhotoAI_Mellow/annotator/uniformer/mmcv/ops/deprecated_wrappers.py
+++ /dev/null
@@ -1,43 +0,0 @@
-# Copyright (c) OpenMMLab. All rights reserved.
-# This file is for backward compatibility.
-# Module wrappers for empty tensor have been moved to mmcv.cnn.bricks.
-import warnings
-
-from ..cnn.bricks.wrappers import Conv2d, ConvTranspose2d, Linear, MaxPool2d
-
-
-class Conv2d_deprecated(Conv2d):
-
-    def __init__(self, *args, **kwargs):
-        super().__init__(*args, **kwargs)
-        warnings.warn(
-            'Importing Conv2d wrapper from "mmcv.ops" will be deprecated in'
-            ' the future. Please import them from "mmcv.cnn" instead')
-
-
-class ConvTranspose2d_deprecated(ConvTranspose2d):
-
-    def __init__(self, *args, **kwargs):
-        super().__init__(*args, **kwargs)
-        warnings.warn(
-            'Importing ConvTranspose2d wrapper from "mmcv.ops" will be '
-            'deprecated in the future. Please import them from "mmcv.cnn" '
-            'instead')
-
-
-class MaxPool2d_deprecated(MaxPool2d):
-
-    def __init__(self, *args, **kwargs):
-        super().__init__(*args, **kwargs)
-        warnings.warn(
-            'Importing MaxPool2d wrapper from "mmcv.ops" will be deprecated in'
-            ' the future. Please import them from "mmcv.cnn" instead')
-
-
-class Linear_deprecated(Linear):
-
-    def __init__(self, *args, **kwargs):
-        super().__init__(*args, **kwargs)
-        warnings.warn(
-            'Importing Linear wrapper from "mmcv.ops" will be deprecated in'
-            ' the future. Please import them from "mmcv.cnn" instead')
diff --git a/spaces/Mellow-ai/PhotoAI_Mellow/annotator/uniformer/mmcv/runner/utils.py b/spaces/Mellow-ai/PhotoAI_Mellow/annotator/uniformer/mmcv/runner/utils.py
deleted file mode 100644
index c5befb8e56ece50b5fecfd007b26f8a29124c0bd..0000000000000000000000000000000000000000
--- a/spaces/Mellow-ai/PhotoAI_Mellow/annotator/uniformer/mmcv/runner/utils.py
+++ /dev/null
@@ -1,93 +0,0 @@
-# Copyright (c) OpenMMLab. All rights reserved.
-import os
-import random
-import sys
-import time
-import warnings
-from getpass import getuser
-from socket import gethostname
-
-import numpy as np
-import torch
-
-import annotator.uniformer.mmcv as mmcv
-
-
-def get_host_info():
-    """Get hostname and username.
-
-    Return empty string if exception raised, e.g. ``getpass.getuser()`` will
-    lead to error in docker container
-    """
-    host = ''
-    try:
-        host = f'{getuser()}@{gethostname()}'
-    except Exception as e:
-        warnings.warn(f'Host or user not found: {str(e)}')
-    finally:
-        return host
-
-
-def get_time_str():
-    return time.strftime('%Y%m%d_%H%M%S', time.localtime())
-
-
-def obj_from_dict(info, parent=None, default_args=None):
-    """Initialize an object from dict.
-
-    The dict must contain the key "type", which indicates the object type, it
-    can be either a string or type, such as "list" or ``list``. Remaining
-    fields are treated as the arguments for constructing the object.
-
-    Args:
-        info (dict): Object types and arguments.
-        parent (:class:`module`): Module which may containing expected object
-            classes.
-        default_args (dict, optional): Default arguments for initializing the
-            object.
-
-    Returns:
-        any type: Object built from the dict.
-    """
-    assert isinstance(info, dict) and 'type' in info
-    assert isinstance(default_args, dict) or default_args is None
-    args = info.copy()
-    obj_type = args.pop('type')
-    if mmcv.is_str(obj_type):
-        if parent is not None:
-            obj_type = getattr(parent, obj_type)
-        else:
-            obj_type = sys.modules[obj_type]
-    elif not isinstance(obj_type, type):
-        raise TypeError('type must be a str or valid type, but '
-                        f'got {type(obj_type)}')
-    if default_args is not None:
-        for name, value in default_args.items():
-            args.setdefault(name, value)
-    return obj_type(**args)
-
-
-def set_random_seed(seed, deterministic=False, use_rank_shift=False):
-    """Set random seed.
-
-    Args:
-        seed (int): Seed to be used.
-        deterministic (bool): Whether to set the deterministic option for
-            CUDNN backend, i.e., set `torch.backends.cudnn.deterministic`
-            to True and `torch.backends.cudnn.benchmark` to False.
-            Default: False.
-        rank_shift (bool): Whether to add rank number to the random seed to
-            have different random seed in different threads. Default: False.
-    """
-    if use_rank_shift:
-        rank, _ = mmcv.runner.get_dist_info()
-        seed += rank
-    random.seed(seed)
-    np.random.seed(seed)
-    torch.manual_seed(seed)
-    torch.cuda.manual_seed(seed)
-    torch.cuda.manual_seed_all(seed)
-    os.environ['PYTHONHASHSEED'] = str(seed)
-    if deterministic:
-        torch.backends.cudnn.deterministic = True
-        torch.backends.cudnn.benchmark = False
diff --git a/spaces/MirageML/sjc/adapt_sd.py b/spaces/MirageML/sjc/adapt_sd.py
deleted file mode 100644
index e765cd44e2a36caa15badaada4450a935a91e336..0000000000000000000000000000000000000000
--- a/spaces/MirageML/sjc/adapt_sd.py
+++ /dev/null
@@ -1,235 +0,0 @@
-import sys
-from pathlib import Path
-import torch
-import numpy as np
-from omegaconf import OmegaConf
-from einops import rearrange
-
-from torch import autocast
-from contextlib import nullcontext
-from math import sqrt
-from adapt import ScoreAdapter
-
-import warnings
-from transformers import logging
-warnings.filterwarnings("ignore", category=DeprecationWarning)
-logging.set_verbosity_error()
-
-
-device = torch.device("cuda")
-
-
-def curr_dir():
-    return Path(__file__).resolve().parent
-
-
-def add_import_path(dirname):
-    sys.path.append(str(
-        curr_dir() / str(dirname)
-    ))
-
-
-def load_model_from_config(config, ckpt, verbose=False):
-    from ldm.util import instantiate_from_config
-    print(f"Loading model from {ckpt}")
-    pl_sd = torch.load(ckpt, map_location="cpu")
-    if "global_step" in pl_sd:
-        print(f"Global Step: {pl_sd['global_step']}")
-    sd = pl_sd["state_dict"]
-    model = instantiate_from_config(config.model)
-    m, u = model.load_state_dict(sd, strict=False)
-    if len(m) > 0 and verbose:
-        print("missing keys:")
-        print(m)
-    if len(u) > 0 and verbose:
-        print("unexpected keys:")
-        print(u)
-
-    model.to(device)
-    model.eval()
-    return model
-
-
-def load_sd1_model(ckpt_root):
-    ckpt_fname = ckpt_root / "stable_diffusion" / "sd-v1-5.ckpt"
-    cfg_fname = curr_dir() / "sd1" / "configs" / "v1-inference.yaml"
-    H, W = 512, 512
-
-    config = OmegaConf.load(str(cfg_fname))
-    model = load_model_from_config(config, str(ckpt_fname))
-    return model, H, W
-
-
-def load_sd2_model(ckpt_root, v2_highres):
-    if v2_highres:
-        ckpt_fname = ckpt_root / "sd2" / "768-v-ema.ckpt"
-        cfg_fname = curr_dir() / "sd2/configs/stable-diffusion/v2-inference-v.yaml"
-        H, W = 768, 768
-    else:
-        ckpt_fname = ckpt_root / "sd2" / "512-base-ema.ckpt"
-        cfg_fname = curr_dir() / "sd2/configs/stable-diffusion/v2-inference.yaml"
-        H, W = 512, 512
-
-    config = OmegaConf.load(f"{cfg_fname}")
-    model = load_model_from_config(config, str(ckpt_fname))
-    return model, H, W
-
-
-def _sqrt(x):
-    if isinstance(x, float):
-        return sqrt(x)
-    else:
-        assert isinstance(x, torch.Tensor)
-        return torch.sqrt(x)
-
-
-class StableDiffusion(ScoreAdapter):
-    def __init__(self, variant, v2_highres, prompt, scale, precision):
-        if variant == "v1":
-            add_import_path("sd1")
-            self.model, H, W = load_sd1_model(self.checkpoint_root())
-        elif variant == "v2":
-            add_import_path("sd2")
-            self.model, H, W = load_sd2_model(self.checkpoint_root(), v2_highres)
-        else:
-            raise ValueError(f"{variant}")
-
-        ae_resolution_f = 8
-
-        self._device = self.model._device
-
-        self.prompt = prompt
-        self.scale = scale
-        self.precision = precision
-        self.precision_scope = autocast if self.precision == "autocast" else nullcontext
-        self._data_shape = (4, H // ae_resolution_f, W // ae_resolution_f)
-
-        self.cond_func = self.model.get_learned_conditioning
-        self.M = 1000
-        noise_schedule = "linear"
-        self.noise_schedule = noise_schedule
-        self.us = self.linear_us(self.M)
-
-    def data_shape(self):
-        return self._data_shape
-
-    @property
-    def σ_max(self):
-        return self.us[0]
-
-    @property
-    def σ_min(self):
-        return self.us[-1]
-
-    @torch.no_grad()
-    def denoise(self, xs, σ, **model_kwargs):
-        with self.precision_scope("cuda"):
-            with self.model.ema_scope():
-                N = xs.shape[0]
-                c = model_kwargs.pop('c')
-                uc = model_kwargs.pop('uc')
-                cond_t, σ = self.time_cond_vec(N, σ)
-                unscaled_xs = xs
-                xs = xs / _sqrt(1 + σ**2)
-                if uc is None or self.scale == 1.:
-                    output = self.model.apply_model(xs, cond_t, c)
-                else:
-                    x_in = torch.cat([xs] * 2)
-                    t_in = torch.cat([cond_t] * 2)
-                    c_in = torch.cat([uc, c])
-                    e_t_uncond, e_t = self.model.apply_model(x_in, t_in, c_in).chunk(2)
-                    output = e_t_uncond + self.scale * (e_t - e_t_uncond)
-
-                if self.model.parameterization == "v":
-                    output = self.model.predict_eps_from_z_and_v(xs, cond_t, output)
-                else:
-                    output = output
-
-                Ds = unscaled_xs - σ * output
-                return Ds
-
-    def cond_info(self, batch_size):
-        prompts = batch_size * [self.prompt]
-        return self.prompts_emb(prompts)
-
-    @torch.no_grad()
-    def prompts_emb(self, prompts):
-        assert isinstance(prompts, list)
-        batch_size = len(prompts)
-        with self.precision_scope("cuda"):
-            with self.model.ema_scope():
-                cond = {}
-                c = self.cond_func(prompts)
-                cond['c'] = c
-                uc = None
-                if self.scale != 1.0:
-                    uc = self.cond_func(batch_size * [""])
-                cond['uc'] = uc
-                return cond
-
-    def unet_is_cond(self):
-        return True
-
-    def use_cls_guidance(self):
-        return False
-
-    def snap_t_to_nearest_tick(self, t):
-        j = np.abs(t - self.us).argmin()
-        return self.us[j], j
-
-    def time_cond_vec(self, N, σ):
-        if isinstance(σ, float):
-            σ, j = self.snap_t_to_nearest_tick(σ)  # σ might change due to snapping
-            cond_t = (self.M - 1) - j
-            cond_t = torch.tensor([cond_t] * N, device=self.device)
-            return cond_t, σ
-        else:
-            assert isinstance(σ, torch.Tensor)
-            σ = σ.reshape(-1).cpu().numpy()
-            σs = []
-            js = []
-            for elem in σ:
-                _σ, _j = self.snap_t_to_nearest_tick(elem)
-                σs.append(_σ)
-                js.append((self.M - 1) - _j)
-
-            cond_t = torch.tensor(js, device=self.device)
-            σs = torch.tensor(σs, device=self.device, dtype=torch.float32).reshape(-1, 1, 1, 1)
-            return cond_t, σs
-
-    @staticmethod
-    def linear_us(M=1000):
-        assert M == 1000
-        β_start = 0.00085
-        β_end = 0.0120
-        βs = np.linspace(β_start**0.5, β_end**0.5, M, dtype=np.float64)**2
-        αs = np.cumprod(1 - βs)
-        us = np.sqrt((1 - αs) / αs)
-        us = us[::-1]
-        return us
-
-    @torch.no_grad()
-    def encode(self, xs):
-        model = self.model
-        with self.precision_scope("cuda"):
-            with self.model.ema_scope():
-                zs = model.get_first_stage_encoding(
-                    model.encode_first_stage(xs)
-                )
-        return zs
-
-    @torch.no_grad()
-    def decode(self, xs):
-        with self.precision_scope("cuda"):
-            with self.model.ema_scope():
-                xs = self.model.decode_first_stage(xs)
-                return xs
-
-
-def test():
-    sd = StableDiffusion("v2", True, "haha", 10.0, "autocast")
-    print(sd)
-
-
-if __name__ == "__main__":
-    test()
diff --git a/spaces/Miuzarte/SUI-svc-4.0/resample.py b/spaces/Miuzarte/SUI-svc-4.0/resample.py
deleted file mode 100644
index 5e96106c9a066e6d73652c544322d029dd98f746..0000000000000000000000000000000000000000
--- a/spaces/Miuzarte/SUI-svc-4.0/resample.py
+++ /dev/null
@@ -1,48 +0,0 @@
-import os
-import argparse
-import librosa
-import numpy as np
-from multiprocessing import Pool, cpu_count
-from scipy.io import wavfile
-from tqdm import tqdm
-
-
-def process(item):
-    spkdir, wav_name, args = item
-    # speaker 's5', 'p280', 'p315' are excluded,
-    speaker = spkdir.replace("\\", "/").split("/")[-1]
-    wav_path = os.path.join(args.in_dir, speaker, wav_name)
-    if os.path.exists(wav_path) and '.wav' in wav_path:
-        os.makedirs(os.path.join(args.out_dir2, speaker), exist_ok=True)
-        wav, sr = librosa.load(wav_path, None)
-        wav, _ = librosa.effects.trim(wav, top_db=20)
-        peak = np.abs(wav).max()
-        if peak > 1.0:
-            wav = 0.98 * wav / peak
-        wav2 = librosa.resample(wav, orig_sr=sr, target_sr=args.sr2)
-        wav2 /= max(wav2.max(), -wav2.min())
-        save_name = wav_name
-        save_path2 = os.path.join(args.out_dir2, speaker, save_name)
-        wavfile.write(
-            save_path2,
-            args.sr2,
-            (wav2 * np.iinfo(np.int16).max).astype(np.int16)
-        )
-
-
-
-if __name__ == "__main__":
-    parser = argparse.ArgumentParser()
-    parser.add_argument("--sr2", type=int, default=44100, help="sampling rate")
-    parser.add_argument("--in_dir", type=str, default="./dataset_raw", help="path to source dir")
-    parser.add_argument("--out_dir2", type=str, default="./dataset/44k", help="path to target dir")
-    args = parser.parse_args()
-    processs = cpu_count()-2 if cpu_count() >4 else 1
-    pool = Pool(processes=processs)
-
-    for speaker in os.listdir(args.in_dir):
-        spk_dir = os.path.join(args.in_dir, speaker)
-        if os.path.isdir(spk_dir):
-            print(spk_dir)
-            for _ in tqdm(pool.imap_unordered(process, [(spk_dir, i, args) for i in os.listdir(spk_dir) if i.endswith("wav")])):
-                pass
diff --git a/spaces/MountLiteraSwd/stabilityai-stable-diffusion-7/README.md b/spaces/MountLiteraSwd/stabilityai-stable-diffusion-7/README.md
deleted file mode 100644
index 4d5e6da772ec68e27550eefd0e4d4b591ed5e446..0000000000000000000000000000000000000000
--- a/spaces/MountLiteraSwd/stabilityai-stable-diffusion-7/README.md
+++ /dev/null
@@ -1,12 +0,0 @@
----
-title: Stabilityai Stable Diffusion 7
-emoji: 🏢
-colorFrom: gray
-colorTo: pink
-sdk: streamlit
-sdk_version: 1.15.2
-app_file: app.py
-pinned: false
----
-
-Check out the configuration reference at https://huggingface.co/docs/hub/spaces-config-reference
diff --git a/spaces/Mountchicken/MAERec-Gradio/mmocr/models/textrecog/layers/lstm_layer.py b/spaces/Mountchicken/MAERec-Gradio/mmocr/models/textrecog/layers/lstm_layer.py
deleted file mode 100644
index 16d3c1a4e5285c238176d2e0be76463657f282e5..0000000000000000000000000000000000000000
--- a/spaces/Mountchicken/MAERec-Gradio/mmocr/models/textrecog/layers/lstm_layer.py
+++ /dev/null
@@ -1,21 +0,0 @@
-# Copyright (c) OpenMMLab. All rights reserved.
-import torch.nn as nn
-
-
-class BidirectionalLSTM(nn.Module):
-
-    def __init__(self, nIn, nHidden, nOut):
-        super().__init__()
-
-        self.rnn = nn.LSTM(nIn, nHidden, bidirectional=True)
-        self.embedding = nn.Linear(nHidden * 2, nOut)
-
-    def forward(self, input):
-        recurrent, _ = self.rnn(input)
-        T, b, h = recurrent.size()
-        t_rec = recurrent.view(T * b, h)
-
-        output = self.embedding(t_rec)  # [T * b, nOut]
-        output = output.view(T, b, -1)
-
-        return output
diff --git a/spaces/NCTCMumbai/NCTC/models/official/nlp/modeling/layers/__init__.py b/spaces/NCTCMumbai/NCTC/models/official/nlp/modeling/layers/__init__.py
deleted file mode 100644
index 2cd8e7b9e59ceab76e268f83907833eec32c73ce..0000000000000000000000000000000000000000
--- a/spaces/NCTCMumbai/NCTC/models/official/nlp/modeling/layers/__init__.py
+++ /dev/null
@@ -1,30 +0,0 @@
-# Copyright 2020 The TensorFlow Authors. All Rights Reserved.
-#
-# Licensed under the Apache License, Version 2.0 (the "License");
-# you may not use this file except in compliance with the License.
-# You may obtain a copy of the License at
-#
-#     http://www.apache.org/licenses/LICENSE-2.0
-#
-# Unless required by applicable law or agreed to in writing, software
-# distributed under the License is distributed on an "AS IS" BASIS,
-# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-# See the License for the specific language governing permissions and
-# limitations under the License.
-# ==============================================================================
-"""Layers package definition."""
-# pylint: disable=wildcard-import
-from official.nlp.modeling.layers.attention import *
-from official.nlp.modeling.layers.cls_head import *
-from official.nlp.modeling.layers.dense_einsum import DenseEinsum
-from official.nlp.modeling.layers.gated_feedforward import GatedFeedforward
-from official.nlp.modeling.layers.masked_lm import MaskedLM
-from official.nlp.modeling.layers.masked_softmax import MaskedSoftmax
-from official.nlp.modeling.layers.multi_channel_attention import *
-from official.nlp.modeling.layers.on_device_embedding import OnDeviceEmbedding
-from official.nlp.modeling.layers.position_embedding import PositionEmbedding
-from official.nlp.modeling.layers.rezero_transformer import ReZeroTransformer
-from official.nlp.modeling.layers.self_attention_mask import SelfAttentionMask
-from official.nlp.modeling.layers.talking_heads_attention import TalkingHeadsAttention
-from official.nlp.modeling.layers.transformer import *
-from official.nlp.modeling.layers.transformer_scaffold import TransformerScaffold
diff --git a/spaces/NN520/AI/src/pages/api/create.ts b/spaces/NN520/AI/src/pages/api/create.ts
deleted file mode 100644
index 508fa97ef609cbb215a61085711638e116235ebe..0000000000000000000000000000000000000000
--- a/spaces/NN520/AI/src/pages/api/create.ts
+++ /dev/null
@@ -1,31 +0,0 @@
-'use server'
-
-import { NextApiRequest, NextApiResponse } from 'next'
-import { fetch, debug } from '@/lib/isomorphic'
-import { createHeaders } from '@/lib/utils'
-
-// const API_ENDPOINT = 'https://www.bing.com/turing/conversation/create'
-const API_ENDPOINT = 'https://edgeservices.bing.com/edgesvc/turing/conversation/create';
-
-export default async function handler(req: NextApiRequest, res: NextApiResponse) {
-  try {
-    const headers = createHeaders(req.cookies)
-
-    res.writeHead(200, {
-      'Content-Type': 'application/json',
-    })
-
-    debug('headers', headers)
-    const response = await fetch(API_ENDPOINT, { method: 'GET', headers })
-      .then((res) => res.text())
-
-    res.end(response)
-  } catch (e) {
-    return res.end(JSON.stringify({
-      result: {
-        value: 'UnauthorizedRequest',
-        message: `${e}`
-      }
-    }))
-  }
-}
diff --git a/spaces/NimaBoscarino/gradio-secrets/README.md b/spaces/NimaBoscarino/gradio-secrets/README.md
deleted file mode 100644
index 3b2612f667cb7b3a8f5fad30c133bd46e0551c2c..0000000000000000000000000000000000000000
--- a/spaces/NimaBoscarino/gradio-secrets/README.md
+++ /dev/null
@@ -1,12 +0,0 @@
----
-title: Gradio Secrets
-emoji: 🔥
-colorFrom: red
-colorTo: indigo
-sdk: gradio
-sdk_version: 2.9.1
-app_file: app.py
-pinned: false
----
-
-Check out the configuration reference at https://huggingface.co/docs/hub/spaces#reference
diff --git a/spaces/OAOA/DifFace/facelib/detection/yolov5face/face_detector.py b/spaces/OAOA/DifFace/facelib/detection/yolov5face/face_detector.py
deleted file mode 100644
index c93faae45d0fab10e096af13d3a4bf8706a37cd3..0000000000000000000000000000000000000000
--- a/spaces/OAOA/DifFace/facelib/detection/yolov5face/face_detector.py
+++ /dev/null
@@ -1,133 +0,0 @@
-import copy
-import os
-from pathlib import Path
-
-import cv2
-import numpy as np
-import torch
-from torch import nn
-
-from facelib.detection.yolov5face.models.common import Conv
-from facelib.detection.yolov5face.models.yolo import Model
-from facelib.detection.yolov5face.utils.datasets import letterbox
-from facelib.detection.yolov5face.utils.general import (
-    check_img_size,
-    non_max_suppression_face,
-    scale_coords,
-    scale_coords_landmarks,
-)
-
-def isListempty(inList):
-    if isinstance(inList, list): # Is a list
-        return all(map(isListempty, inList))
-    return False # Not a list
-
-class YoloDetector:
-    def __init__(
-        self,
-        config_name,
-        min_face=10,
-        target_size=None,
-        device='cuda',
-    ):
-        """
-        config_name: name of .yaml config with network configuration from models/ folder.
-        min_face : minimal face size in pixels.
-        target_size : target size of smaller image axis (choose lower for faster work). e.g. 480, 720, 1080.
-                    None for original resolution.
-        """
-        self._class_path = Path(__file__).parent.absolute()
-        self.target_size = target_size
-        self.min_face = min_face
-        self.detector = Model(cfg=config_name)
-        self.device = device
-
-
-    def _preprocess(self, imgs):
-        """
-        Preprocessing image before passing through the network. Resize and conversion to torch tensor.
-        """
-        pp_imgs = []
-        for img in imgs:
-            h0, w0 = img.shape[:2]  # orig hw
-            if self.target_size:
-                r = self.target_size / min(h0, w0)  # resize image to img_size
-                if r < 1:
-                    img = cv2.resize(img, (int(w0 * r), int(h0 * r)), interpolation=cv2.INTER_LINEAR)
-
-            imgsz = check_img_size(max(img.shape[:2]), s=self.detector.stride.max())  # check img_size
-            img = letterbox(img, new_shape=imgsz)[0]
-            pp_imgs.append(img)
-        pp_imgs = np.array(pp_imgs)
-        pp_imgs = pp_imgs.transpose(0, 3, 1, 2)
-        pp_imgs = torch.from_numpy(pp_imgs).to(self.device)
-        pp_imgs = pp_imgs.float()  # uint8 to fp16/32
-        return pp_imgs / 255.0  # 0 - 255 to 0.0 - 1.0
-
-    def _postprocess(self, imgs, origimgs, pred, conf_thres, iou_thres):
-        """
-        Postprocessing of raw pytorch model output.
-        Returns:
-            bboxes: list of arrays with 4 coordinates of bounding boxes with format x1,y1,x2,y2.
-            points: list of arrays with coordinates of 5 facial keypoints (eyes, nose, lips corners).
-        """
-        bboxes = [[] for _ in range(len(origimgs))]
-        landmarks = [[] for _ in range(len(origimgs))]
-
-        pred = non_max_suppression_face(pred, conf_thres, iou_thres)
-
-        for image_id, origimg in enumerate(origimgs):
-            img_shape = origimg.shape
-            image_height, image_width = img_shape[:2]
-            gn = torch.tensor(img_shape)[[1, 0, 1, 0]]  # normalization gain whwh
-            gn_lks = torch.tensor(img_shape)[[1, 0, 1, 0, 1, 0, 1, 0, 1, 0]]  # normalization gain landmarks
-            det = pred[image_id].cpu()
-            scale_coords(imgs[image_id].shape[1:], det[:, :4], img_shape).round()
-            scale_coords_landmarks(imgs[image_id].shape[1:], det[:, 5:15], img_shape).round()
-
-            for j in range(det.size()[0]):
-                box = (det[j, :4].view(1, 4) / gn).view(-1).tolist()
-                box = list(
-                    map(int, [box[0] * image_width, box[1] * image_height, box[2] * image_width, box[3] * image_height])
-                )
-                if box[3] - box[1] < self.min_face:
-                    continue
-                lm = (det[j, 5:15].view(1, 10) / gn_lks).view(-1).tolist()
-                lm = list(map(int, [i * image_width if j % 2 == 0 else i * image_height for j, i in enumerate(lm)]))
-                lm = [lm[i : i + 2] for i in range(0, len(lm), 2)]
-                bboxes[image_id].append(box)
-                landmarks[image_id].append(lm)
-        return bboxes, landmarks
-
-    def detect_faces(self, imgs, conf_thres=0.7, iou_thres=0.5):
-        """
-        Get bbox coordinates and keypoints of faces on original image.
-        Params:
-            imgs: image or list of images to detect faces on with BGR order (convert to RGB order for inference)
-            conf_thres: confidence threshold for each prediction
-            iou_thres: threshold for NMS (filter of intersecting bboxes)
-        Returns:
-            bboxes: list of arrays with 4 coordinates of bounding boxes with format x1,y1,x2,y2.
-            points: list of arrays with coordinates of 5 facial keypoints (eyes, nose, lips corners).
-        """
-        # Pass input images through face detector
-        images = imgs if isinstance(imgs, list) else [imgs]
-        images = [cv2.cvtColor(img, cv2.COLOR_BGR2RGB) for img in images]
-        origimgs = copy.deepcopy(images)
-
-        images = self._preprocess(images)
-        with torch.inference_mode():  # change this with torch.no_grad() for pytorch <1.8 compatibility
-            pred = self.detector(images)[0]
-        bboxes, points = self._postprocess(images, origimgs, pred, conf_thres, iou_thres)
-
-        # return bboxes, points
-        if not isListempty(points):
-            bboxes = np.array(bboxes).reshape(-1,4)
-            points = np.array(points).reshape(-1,10)
-            padding = bboxes[:,0].reshape(-1,1)
-            return np.concatenate((bboxes, padding, points), axis=1)
-        else:
-            return None
-
-    def __call__(self, *args):
-        return self.predict(*args)
diff --git a/spaces/OFA-Sys/OFA-Generic_Interface/fairseq/examples/criss/mining/mine.py b/spaces/OFA-Sys/OFA-Generic_Interface/fairseq/examples/criss/mining/mine.py
deleted file mode 100644
index c872da196fe0df776622365748ad7963fee1f0a0..0000000000000000000000000000000000000000
--- a/spaces/OFA-Sys/OFA-Generic_Interface/fairseq/examples/criss/mining/mine.py
+++ /dev/null
@@ -1,240 +0,0 @@
-#!/usr/bin/env python3 -u
-# Copyright (c) Facebook, Inc. and its affiliates.
-#
-# This source code is licensed under the MIT license found in the
-# LICENSE file in the root directory of this source tree.
-import argparse
-import glob
-from subprocess import check_call
-
-try:
-    import faiss
-
-    has_faiss = True
-except ImportError:
-    has_faiss = False
-import numpy as np
-
-
-GB = 1024 * 1024 * 1024
-
-
-def call(cmd):
-    print(cmd)
-    check_call(cmd, shell=True)
-
-
-def get_batches(directory, lang, prefix="all_avg_pool"):
-    print(f"Finding in {directory}/{prefix}.{lang}*")
-    files = glob.glob(f"{directory}/{prefix}.{lang}*")
-    emb_files = []
-    txt_files = []
-    for emb_fi in files:
-        emb_files.append(emb_fi)
-        txt_fi = emb_fi.replace(prefix, "sentences")
-        txt_files.append(txt_fi)
-    return emb_files, txt_files
-
-
-def load_batch(emb_file, dim):
-    embeddings = np.fromfile(emb_file, dtype=np.float32)
-    num_rows = int(embeddings.shape[0] / dim)
-    embeddings = embeddings.reshape((num_rows, dim))
-    faiss.normalize_L2(embeddings)
-    return embeddings
-
-
-def knnGPU_sharded(x_batches_f, y_batches_f, dim, k, direction="x2y"):
-    if not has_faiss:
-        raise ImportError("Please install Faiss")
-    sims = []
-    inds = []
-    xfrom = 0
-    xto = 0
-    for x_batch_f in x_batches_f:
-        yfrom = 0
-        yto = 0
-        x_batch = load_batch(x_batch_f, dim)
-        xto = xfrom + x_batch.shape[0]
-        bsims, binds = [], []
-        for y_batch_f in y_batches_f:
-            y_batch = load_batch(y_batch_f, dim)
-            neighbor_size = min(k, y_batch.shape[0])
-            yto = yfrom + y_batch.shape[0]
-            print("{}-{}  ->  {}-{}".format(xfrom, xto, yfrom, yto))
-            idx = faiss.IndexFlatIP(dim)
-            idx = faiss.index_cpu_to_all_gpus(idx)
-            idx.add(y_batch)
-            bsim, bind = idx.search(x_batch, neighbor_size)
-
-            bsims.append(bsim)
-            binds.append(bind + yfrom)
-            yfrom += y_batch.shape[0]
-            del idx
-            del y_batch
-        bsims = np.concatenate(bsims, axis=1)
-        binds = np.concatenate(binds, axis=1)
-        aux = np.argsort(-bsims, axis=1)
-        sim_batch = np.zeros((x_batch.shape[0], k), dtype=np.float32)
-        ind_batch = np.zeros((x_batch.shape[0], k), dtype=np.int64)
-        for i in range(x_batch.shape[0]):
-            for j in range(k):
-                sim_batch[i, j] = bsims[i, aux[i, j]]
-                ind_batch[i, j] = binds[i, aux[i, j]]
-        sims.append(sim_batch)
-        inds.append(ind_batch)
-        xfrom += x_batch.shape[0]
-        del x_batch
-    sim = np.concatenate(sims, axis=0)
-    ind = np.concatenate(inds, axis=0)
-    return sim, ind
-
-
-def score(sim, fwd_mean, bwd_mean, margin):
-    return margin(sim, (fwd_mean + bwd_mean) / 2)
-
-
-def score_candidates(
-    sim_mat, candidate_inds, fwd_mean, bwd_mean, margin, verbose=False
-):
-    print(" - scoring {:d} candidates".format(sim_mat.shape[0]))
-    scores = np.zeros(candidate_inds.shape)
-    for i in range(scores.shape[0]):
-        for j in range(scores.shape[1]):
-            k = int(candidate_inds[i, j])
-            scores[i, j] = score(sim_mat[i, j], fwd_mean[i], bwd_mean[k], margin)
-    return scores
-
-
-def load_text(files):
-    all_sentences = []
-    for fi in files:
-        with open(fi) as sentence_fi:
-            for line in sentence_fi:
-                all_sentences.append(line.strip())
-    print(f"Read {len(all_sentences)} sentences")
-    return all_sentences
-
-
-if __name__ == "__main__":
-    parser = argparse.ArgumentParser(description="Mine bitext")
-    parser.add_argument("--src-lang", help="Source language")
-    parser.add_argument("--tgt-lang", help="Target language")
-    parser.add_argument(
-        "--dict-path", help="Path to dictionary file", default="dict.txt"
-    )
-    parser.add_argument(
-        "--spm-path", help="Path to SPM model file", default="sentence.bpe.model"
-    )
-    parser.add_argument("--dim", type=int, default=1024, help="Embedding dimension")
-    parser.add_argument("--mem", type=int, default=5, help="Memory in GB")
-    parser.add_argument("--src-dir", help="Source directory")
-    parser.add_argument("--tgt-dir", help="Target directory")
-    parser.add_argument("--output", help="Output path")
-    parser.add_argument(
-        "--neighborhood", type=int, default=4, help="Embedding dimension"
-    )
-    parser.add_argument(
-        "--threshold", type=float, default=1.06, help="Threshold on mined bitext"
-    )
-    parser.add_argument(
-        "--valid-size",
-        type=int,
-        default=2000,
-        help="Number of sentences used for validation set",
-    )
-    parser.add_argument(
-        "--min-count",
-        type=int,
-        default=50000,
-        help="Min num sentences used for each language",
-    )
-    args = parser.parse_args()
-
-    x_batches_f, x_sents_f = get_batches(args.src_dir, args.src_lang)
-    y_batches_f, y_sents_f = get_batches(args.tgt_dir, args.tgt_lang)
-    margin = lambda a, b: a / b
-    y2x_sim, y2x_ind = knnGPU_sharded(
-        y_batches_f, x_batches_f, args.dim, args.neighborhood, direction="y2x"
-    )
-    x2y_sim, x2y_ind = knnGPU_sharded(
-        x_batches_f, y_batches_f, args.dim, args.neighborhood, direction="x2y"
-    )
-
-    x2y_mean = x2y_sim.mean(axis=1)
-    y2x_mean = y2x_sim.mean(axis=1)
-    fwd_scores = score_candidates(x2y_sim, x2y_ind, x2y_mean, y2x_mean, margin)
-    bwd_scores = score_candidates(y2x_sim, y2x_ind, y2x_mean, x2y_mean, margin)
-    fwd_best = x2y_ind[np.arange(x2y_sim.shape[0]), fwd_scores.argmax(axis=1)]
-    bwd_best = y2x_ind[np.arange(y2x_sim.shape[0]), bwd_scores.argmax(axis=1)]
-    indices = np.stack(
-        (
-            np.concatenate((np.arange(x2y_ind.shape[0]), bwd_best)),
-            np.concatenate((fwd_best, np.arange(y2x_ind.shape[0]))),
-        ),
-        axis=1,
-    )
-    scores = np.concatenate((fwd_scores.max(axis=1), bwd_scores.max(axis=1)))
-
-    x_sentences = load_text(x_sents_f)
-    y_sentences = load_text(y_sents_f)
-
-    threshold = args.threshold
-    min_count = args.min_count
-    seen_src, seen_trg = set(), set()
-    directory = args.output
-    call(f"mkdir -p {directory}")
-    src_out = open(
-        f"{directory}/all.{args.src_lang}",
-        mode="w",
-        encoding="utf-8",
-        errors="surrogateescape",
-    )
-    tgt_out = open(
-        f"{directory}/all.{args.tgt_lang}",
-        mode="w",
-        encoding="utf-8",
-        errors="surrogateescape",
-    )
-    scores_out = open(
-        f"{directory}/all.scores", mode="w", encoding="utf-8", errors="surrogateescape"
-    )
-    count = 0
-    for i in np.argsort(-scores):
-        src_ind, trg_ind = indices[i]
-        if src_ind not in seen_src and trg_ind not in seen_trg:
-            seen_src.add(src_ind)
-            seen_trg.add(trg_ind)
-            if scores[i] > threshold or count < min_count:
-                if x_sentences[src_ind]:
-                    print(scores[i], file=scores_out)
-                    print(x_sentences[src_ind], file=src_out)
-                    print(y_sentences[trg_ind], file=tgt_out)
-                    count += 1
-                else:
-                    print(f"Ignoring sentence: {x_sentences[src_ind]}")
-    src_out.close()
-    tgt_out.close()
-    scores_out.close()
-
-    print(f"Found {count} pairs for threshold={threshold}")
-    with open(f"{directory}/all.{args.src_lang}") as all_s, open(
-        f"{directory}/all.{args.tgt_lang}"
-    ) as all_t, open(f"{directory}/valid.{args.src_lang}", "w") as valid_s, open(
-        f"{directory}/valid.{args.tgt_lang}", "w"
-    ) as valid_t, open(
-        f"{directory}/train.{args.src_lang}", "w"
-    ) as train_s, open(
-        f"{directory}/train.{args.tgt_lang}", "w"
-    ) as train_t:
-        count = 0
-        for s_line, t_line in zip(all_s, all_t):
-            s_line = s_line.split("\t")[1]
-            t_line = t_line.split("\t")[1]
-            if count >= args.valid_size:
-                train_s.write(s_line)
-                train_t.write(t_line)
-            else:
-                valid_s.write(s_line)
-                valid_t.write(t_line)
-                count += 1
diff --git a/spaces/OFA-Sys/OFA-Generic_Interface/fairseq/fairseq/model_parallel/models/pipeline_parallel_transformer/__init__.py b/spaces/OFA-Sys/OFA-Generic_Interface/fairseq/fairseq/model_parallel/models/pipeline_parallel_transformer/__init__.py
deleted file mode 100644
index 117827c3e9c176477f33e3a6fd7fe19a922411a2..0000000000000000000000000000000000000000
--- a/spaces/OFA-Sys/OFA-Generic_Interface/fairseq/fairseq/model_parallel/models/pipeline_parallel_transformer/__init__.py
+++ /dev/null
@@ -1,6 +0,0 @@
-# Copyright (c) Facebook, Inc. and its affiliates.
-#
-# This source code is licensed under the MIT license found in the
-# LICENSE file in the root directory of this source tree.
-
-from .model import *  # noqa
diff --git a/spaces/OFA-Sys/OFA-Image_Caption/fairseq/examples/multilingual/data_scripts/binarize.py b/spaces/OFA-Sys/OFA-Image_Caption/fairseq/examples/multilingual/data_scripts/binarize.py
deleted file mode 100644
index ee54c6aabf021ca526743f8f1f67b91889e1e335..0000000000000000000000000000000000000000
--- a/spaces/OFA-Sys/OFA-Image_Caption/fairseq/examples/multilingual/data_scripts/binarize.py
+++ /dev/null
@@ -1,200 +0,0 @@
-import shutil
-import os, sys
-from subprocess import check_call, check_output
-import glob
-import argparse
-import shutil
-import pathlib
-import itertools
-
-def call_output(cmd):
-    print(f"Executing: {cmd}")
-    ret = check_output(cmd, shell=True)
-    print(ret)
-    return ret
-
-def call(cmd):
-    print(cmd)
-    check_call(cmd, shell=True)
-
-
-WORKDIR_ROOT = os.environ.get('WORKDIR_ROOT', None)
-
-if WORKDIR_ROOT is None or  not WORKDIR_ROOT.strip():
-    print('please specify your working directory root in OS environment variable WORKDIR_ROOT. Exitting..."')
-    sys.exit(-1)
-
-SPM_PATH = os.environ.get('SPM_PATH', None)
-
-if SPM_PATH is None or not SPM_PATH.strip():
-    print("Please install sentence piecence from https://github.com/google/sentencepiece and set SPM_PATH pointing to the installed spm_encode.py. Exitting...")
-    sys.exit(-1)
-
-
-SPM_MODEL = f'{WORKDIR_ROOT}/sentence.bpe.model'
-SPM_VOCAB = f'{WORKDIR_ROOT}/dict_250k.txt'
-
-SPM_ENCODE = f'{SPM_PATH}'
-
-if not os.path.exists(SPM_MODEL):
-    call(f"wget https://dl.fbaipublicfiles.com/fairseq/models/mbart50/sentence.bpe.model -O {SPM_MODEL}")
-
-
-if not os.path.exists(SPM_VOCAB):
-    call(f"wget https://dl.fbaipublicfiles.com/fairseq/models/mbart50/dict_250k.txt -O {SPM_VOCAB}")
-
-
-
-def get_data_size(raw):
-    cmd = f'wc -l {raw}'
-    ret = call_output(cmd)
-    return int(ret.split()[0])
-
-def encode_spm(model, direction, prefix='', splits=['train', 'test', 'valid'], pairs_per_shard=None):
-    src, tgt = direction.split('-')
-
-    for split in splits:
-        src_raw, tgt_raw = f'{RAW_DIR}/{split}{prefix}.{direction}.{src}', f'{RAW_DIR}/{split}{prefix}.{direction}.{tgt}'
-        if os.path.exists(src_raw) and os.path.exists(tgt_raw):
-            cmd = f"""python {SPM_ENCODE} \
-            --model {model}\
-            --output_format=piece \
-            --inputs {src_raw} {tgt_raw}  \
-            --outputs {BPE_DIR}/{direction}{prefix}/{split}.bpe.{src} {BPE_DIR}/{direction}{prefix}/{split}.bpe.{tgt} """
-            print(cmd)
-            call(cmd)
-
-
-def binarize_(
-    bpe_dir,
-    databin_dir,
-    direction, spm_vocab=SPM_VOCAB, 
-    splits=['train', 'test', 'valid'],
-):
-    src, tgt = direction.split('-')
-
-    try:
-        shutil.rmtree(f'{databin_dir}', ignore_errors=True)
-        os.mkdir(f'{databin_dir}')
-    except OSError as error:
-        print(error)
-    cmds = [
-        "fairseq-preprocess",
-        f"--source-lang {src} --target-lang {tgt}",
-        f"--destdir {databin_dir}/",
-        f"--workers 8",
-    ]
-    if isinstance(spm_vocab, tuple):
-        src_vocab, tgt_vocab = spm_vocab
-        cmds.extend(
-            [
-                f"--srcdict {src_vocab}",
-                f"--tgtdict {tgt_vocab}",
-            ]
-        )
-    else:
-        cmds.extend(
-            [
-                f"--joined-dictionary",
-                f"--srcdict {spm_vocab}",
-            ]
-        )
-    input_options = []
-    if 'train' in splits and glob.glob(f"{bpe_dir}/train.bpe*"):
-        input_options.append(
-            f"--trainpref {bpe_dir}/train.bpe",
-        )        
-    if 'valid' in splits and glob.glob(f"{bpe_dir}/valid.bpe*"):
-        input_options.append(f"--validpref {bpe_dir}/valid.bpe")
-    if 'test' in splits and glob.glob(f"{bpe_dir}/test.bpe*"):
-        input_options.append(f"--testpref {bpe_dir}/test.bpe")   
-    if len(input_options) > 0:    
-        cmd = " ".join(cmds + input_options)
-        print(cmd)
-        call(cmd)
-
-
-def binarize(
-    databin_dir,
-    direction, spm_vocab=SPM_VOCAB, prefix='',
-    splits=['train', 'test', 'valid'],
-    pairs_per_shard=None,
-):
-    def move_databin_files(from_folder, to_folder):
-        for bin_file in glob.glob(f"{from_folder}/*.bin") \
-            +  glob.glob(f"{from_folder}/*.idx") \
-            +  glob.glob(f"{from_folder}/dict*"):
-            try:
-                shutil.move(bin_file, to_folder)
-            except OSError as error:
-                print(error)      
-    bpe_databin_dir = f"{BPE_DIR}/{direction}{prefix}_databin"
-    bpe_dir = f"{BPE_DIR}/{direction}{prefix}"
-    if pairs_per_shard is None:
-        binarize_(bpe_dir, bpe_databin_dir, direction, spm_vocab=spm_vocab, splits=splits)
-        move_databin_files(bpe_databin_dir, databin_dir)
-    else:
-        # binarize valid and test which will not be sharded
-        binarize_(
-            bpe_dir, bpe_databin_dir, direction,
-            spm_vocab=spm_vocab, splits=[s for s in splits if s != "train"])
-        for shard_bpe_dir in glob.glob(f"{bpe_dir}/shard*"):
-            path_strs = os.path.split(shard_bpe_dir)
-            shard_str = path_strs[-1]
-            shard_folder = f"{bpe_databin_dir}/{shard_str}"
-            databin_shard_folder = f"{databin_dir}/{shard_str}"
-            print(f'working from {shard_folder} to {databin_shard_folder}')
-            os.makedirs(databin_shard_folder, exist_ok=True)
-            binarize_(
-                shard_bpe_dir, shard_folder, direction,
-                spm_vocab=spm_vocab, splits=["train"])
-
-            for test_data in glob.glob(f"{bpe_databin_dir}/valid.*") + glob.glob(f"{bpe_databin_dir}/test.*"):
-                filename = os.path.split(test_data)[-1]
-                try:
-                    os.symlink(test_data, f"{databin_shard_folder}/{filename}")
-                except OSError as error:
-                    print(error)                
-            move_databin_files(shard_folder, databin_shard_folder)
-
-
-def load_langs(path):
-    with open(path) as fr:
-        langs = [l.strip() for l in fr]
-    return langs
-
-if __name__ == '__main__':
-    parser = argparse.ArgumentParser()
-    parser.add_argument("--data_root", default=f"{WORKDIR_ROOT}/ML50")
-    parser.add_argument("--raw-folder", default='raw')
-    parser.add_argument("--bpe-folder", default='bpe')    
-    parser.add_argument("--databin-folder", default='databin')    
-
-    args = parser.parse_args()
-
-    DATA_PATH = args.data_root #'/private/home/yuqtang/public_data/ML50'   
-    RAW_DIR = f'{DATA_PATH}/{args.raw_folder}'
-    BPE_DIR = f'{DATA_PATH}/{args.bpe_folder}'
-    DATABIN_DIR = f'{DATA_PATH}/{args.databin_folder}'
-    os.makedirs(BPE_DIR, exist_ok=True)
-
-    raw_files = itertools.chain(
-        glob.glob(f'{RAW_DIR}/train*'),
-        glob.glob(f'{RAW_DIR}/valid*'),
-        glob.glob(f'{RAW_DIR}/test*'),
-    )
-
-    directions = [os.path.split(file_path)[-1].split('.')[1] for file_path in raw_files]
-
-    for direction in directions:
-        prefix = ""
-        splits = ['train', 'valid', 'test']
-        try:
-            shutil.rmtree(f'{BPE_DIR}/{direction}{prefix}', ignore_errors=True)
-            os.mkdir(f'{BPE_DIR}/{direction}{prefix}')
-            os.makedirs(DATABIN_DIR, exist_ok=True)
-        except OSError as error: 
-            print(error)     
-        spm_model, spm_vocab = SPM_MODEL, SPM_VOCAB
-        encode_spm(spm_model, direction=direction, splits=splits)
-        binarize(DATABIN_DIR, direction, spm_vocab=spm_vocab, splits=splits)
diff --git a/spaces/OFA-Sys/OFA-Image_Caption/fairseq/fairseq_cli/interactive.py b/spaces/OFA-Sys/OFA-Image_Caption/fairseq/fairseq_cli/interactive.py
deleted file mode 100644
index cadef2821a74a3b2f051c792d835129bf775714f..0000000000000000000000000000000000000000
--- a/spaces/OFA-Sys/OFA-Image_Caption/fairseq/fairseq_cli/interactive.py
+++ /dev/null
@@ -1,316 +0,0 @@
-#!/usr/bin/env python3 -u
-# Copyright (c) Facebook, Inc. and its affiliates.
-#
-# This source code is licensed under the MIT license found in the
-# LICENSE file in the root directory of this source tree.
-"""
-Translate raw text with a trained model. Batches data on-the-fly.
-"""
-
-import ast
-import fileinput
-import logging
-import math
-import os
-import sys
-import time
-from argparse import Namespace
-from collections import namedtuple
-
-import numpy as np
-import torch
-from fairseq import checkpoint_utils, distributed_utils, options, tasks, utils
-from fairseq.dataclass.configs import FairseqConfig
-from fairseq.dataclass.utils import convert_namespace_to_omegaconf
-from fairseq.token_generation_constraints import pack_constraints, unpack_constraints
-from fairseq_cli.generate import get_symbols_to_strip_from_output
-
-
-logging.basicConfig(
-    format="%(asctime)s | %(levelname)s | %(name)s | %(message)s",
-    datefmt="%Y-%m-%d %H:%M:%S",
-    level=os.environ.get("LOGLEVEL", "INFO").upper(),
-    stream=sys.stdout,
-)
-logger = logging.getLogger("fairseq_cli.interactive")
-
-
-Batch = namedtuple("Batch", "ids src_tokens src_lengths constraints")
-Translation = namedtuple("Translation", "src_str hypos pos_scores alignments")
-
-
-def buffered_read(input, buffer_size):
-    buffer = []
-    with fileinput.input(files=[input], openhook=fileinput.hook_encoded("utf-8")) as h:
-        for src_str in h:
-            buffer.append(src_str.strip())
-            if len(buffer) >= buffer_size:
-                yield buffer
-                buffer = []
-
-    if len(buffer) > 0:
-        yield buffer
-
-
-def make_batches(lines, cfg, task, max_positions, encode_fn):
-    def encode_fn_target(x):
-        return encode_fn(x)
-
-    if cfg.generation.constraints:
-        # Strip (tab-delimited) contraints, if present, from input lines,
-        # store them in batch_constraints
-        batch_constraints = [list() for _ in lines]
-        for i, line in enumerate(lines):
-            if "\t" in line:
-                lines[i], *batch_constraints[i] = line.split("\t")
-
-        # Convert each List[str] to List[Tensor]
-        for i, constraint_list in enumerate(batch_constraints):
-            batch_constraints[i] = [
-                task.target_dictionary.encode_line(
-                    encode_fn_target(constraint),
-                    append_eos=False,
-                    add_if_not_exist=False,
-                )
-                for constraint in constraint_list
-            ]
-
-    if cfg.generation.constraints:
-        constraints_tensor = pack_constraints(batch_constraints)
-    else:
-        constraints_tensor = None
-
-    tokens, lengths = task.get_interactive_tokens_and_lengths(lines, encode_fn)
-
-    itr = task.get_batch_iterator(
-        dataset=task.build_dataset_for_inference(
-            tokens, lengths, constraints=constraints_tensor
-        ),
-        max_tokens=cfg.dataset.max_tokens,
-        max_sentences=cfg.dataset.batch_size,
-        max_positions=max_positions,
-        ignore_invalid_inputs=cfg.dataset.skip_invalid_size_inputs_valid_test,
-    ).next_epoch_itr(shuffle=False)
-    for batch in itr:
-        ids = batch["id"]
-        src_tokens = batch["net_input"]["src_tokens"]
-        src_lengths = batch["net_input"]["src_lengths"]
-        constraints = batch.get("constraints", None)
-
-        yield Batch(
-            ids=ids,
-            src_tokens=src_tokens,
-            src_lengths=src_lengths,
-            constraints=constraints,
-        )
-
-
-def main(cfg: FairseqConfig):
-    if isinstance(cfg, Namespace):
-        cfg = convert_namespace_to_omegaconf(cfg)
-
-    start_time = time.time()
-    total_translate_time = 0
-
-    utils.import_user_module(cfg.common)
-
-    if cfg.interactive.buffer_size < 1:
-        cfg.interactive.buffer_size = 1
-    if cfg.dataset.max_tokens is None and cfg.dataset.batch_size is None:
-        cfg.dataset.batch_size = 1
-
-    assert (
-        not cfg.generation.sampling or cfg.generation.nbest == cfg.generation.beam
-    ), "--sampling requires --nbest to be equal to --beam"
-    assert (
-        not cfg.dataset.batch_size
-        or cfg.dataset.batch_size <= cfg.interactive.buffer_size
-    ), "--batch-size cannot be larger than --buffer-size"
-
-    logger.info(cfg)
-
-    # Fix seed for stochastic decoding
-    if cfg.common.seed is not None and not cfg.generation.no_seed_provided:
-        np.random.seed(cfg.common.seed)
-        utils.set_torch_seed(cfg.common.seed)
-
-    use_cuda = torch.cuda.is_available() and not cfg.common.cpu
-
-    # Setup task, e.g., translation
-    task = tasks.setup_task(cfg.task)
-
-    # Load ensemble
-    overrides = ast.literal_eval(cfg.common_eval.model_overrides)
-    logger.info("loading model(s) from {}".format(cfg.common_eval.path))
-    models, _model_args = checkpoint_utils.load_model_ensemble(
-        utils.split_paths(cfg.common_eval.path),
-        arg_overrides=overrides,
-        task=task,
-        suffix=cfg.checkpoint.checkpoint_suffix,
-        strict=(cfg.checkpoint.checkpoint_shard_count == 1),
-        num_shards=cfg.checkpoint.checkpoint_shard_count,
-    )
-
-    # Set dictionaries
-    src_dict = task.source_dictionary
-    tgt_dict = task.target_dictionary
-
-    # Optimize ensemble for generation
-    for model in models:
-        if model is None:
-            continue
-        if cfg.common.fp16:
-            model.half()
-        if use_cuda and not cfg.distributed_training.pipeline_model_parallel:
-            model.cuda()
-        model.prepare_for_inference_(cfg)
-
-    # Initialize generator
-    generator = task.build_generator(models, cfg.generation)
-
-    # Handle tokenization and BPE
-    tokenizer = task.build_tokenizer(cfg.tokenizer)
-    bpe = task.build_bpe(cfg.bpe)
-
-    def encode_fn(x):
-        if tokenizer is not None:
-            x = tokenizer.encode(x)
-        if bpe is not None:
-            x = bpe.encode(x)
-        return x
-
-    def decode_fn(x):
-        if bpe is not None:
-            x = bpe.decode(x)
-        if tokenizer is not None:
-            x = tokenizer.decode(x)
-        return x
-
-    # Load alignment dictionary for unknown word replacement
-    # (None if no unknown word replacement, empty if no path to align dictionary)
-    align_dict = utils.load_align_dict(cfg.generation.replace_unk)
-
-    max_positions = utils.resolve_max_positions(
-        task.max_positions(), *[model.max_positions() for model in models]
-    )
-
-    if cfg.generation.constraints:
-        logger.warning(
-            "NOTE: Constrained decoding currently assumes a shared subword vocabulary."
-        )
-
-    if cfg.interactive.buffer_size > 1:
-        logger.info("Sentence buffer size: %s", cfg.interactive.buffer_size)
-    logger.info("NOTE: hypothesis and token scores are output in base 2")
-    logger.info("Type the input sentence and press return:")
-    start_id = 0
-    for inputs in buffered_read(cfg.interactive.input, cfg.interactive.buffer_size):
-        results = []
-        for batch in make_batches(inputs, cfg, task, max_positions, encode_fn):
-            bsz = batch.src_tokens.size(0)
-            src_tokens = batch.src_tokens
-            src_lengths = batch.src_lengths
-            constraints = batch.constraints
-            if use_cuda:
-                src_tokens = src_tokens.cuda()
-                src_lengths = src_lengths.cuda()
-                if constraints is not None:
-                    constraints = constraints.cuda()
-
-            sample = {
-                "net_input": {
-                    "src_tokens": src_tokens,
-                    "src_lengths": src_lengths,
-                },
-            }
-            translate_start_time = time.time()
-            translations = task.inference_step(
-                generator, models, sample, constraints=constraints
-            )
-            translate_time = time.time() - translate_start_time
-            total_translate_time += translate_time
-            list_constraints = [[] for _ in range(bsz)]
-            if cfg.generation.constraints:
-                list_constraints = [unpack_constraints(c) for c in constraints]
-            for i, (id, hypos) in enumerate(zip(batch.ids.tolist(), translations)):
-                src_tokens_i = utils.strip_pad(src_tokens[i], tgt_dict.pad())
-                constraints = list_constraints[i]
-                results.append(
-                    (
-                        start_id + id,
-                        src_tokens_i,
-                        hypos,
-                        {
-                            "constraints": constraints,
-                            "time": translate_time / len(translations),
-                        },
-                    )
-                )
-
-        # sort output to match input order
-        for id_, src_tokens, hypos, info in sorted(results, key=lambda x: x[0]):
-            src_str = ''
-            if src_dict is not None:
-                src_str = src_dict.string(src_tokens, cfg.common_eval.post_process)
-                print("S-{}\t{}".format(id_, src_str))
-                print("W-{}\t{:.3f}\tseconds".format(id_, info["time"]))
-                for constraint in info["constraints"]:
-                    print(
-                        "C-{}\t{}".format(
-                            id_, tgt_dict.string(constraint, cfg.common_eval.post_process)
-                        )
-                    )
-
-            # Process top predictions
-            for hypo in hypos[: min(len(hypos), cfg.generation.nbest)]:
-                hypo_tokens, hypo_str, alignment = utils.post_process_prediction(
-                    hypo_tokens=hypo["tokens"].int().cpu(),
-                    src_str=src_str,
-                    alignment=hypo["alignment"],
-                    align_dict=align_dict,
-                    tgt_dict=tgt_dict,
-                    remove_bpe=cfg.common_eval.post_process,
-                    extra_symbols_to_ignore=get_symbols_to_strip_from_output(generator),
-                )
-                detok_hypo_str = decode_fn(hypo_str)
-                score = hypo["score"] / math.log(2)  # convert to base 2
-                # original hypothesis (after tokenization and BPE)
-                print("H-{}\t{}\t{}".format(id_, score, hypo_str))
-                # detokenized hypothesis
-                print("D-{}\t{}\t{}".format(id_, score, detok_hypo_str))
-                print(
-                    "P-{}\t{}".format(
-                        id_,
-                        " ".join(
-                            map(
-                                lambda x: "{:.4f}".format(x),
-                                # convert from base e to base 2
-                                hypo["positional_scores"].div_(math.log(2)).tolist(),
-                            )
-                        ),
-                    )
-                )
-                if cfg.generation.print_alignment:
-                    alignment_str = " ".join(
-                        ["{}-{}".format(src, tgt) for src, tgt in alignment]
-                    )
-                    print("A-{}\t{}".format(id_, alignment_str))
-
-        # update running id_ counter
-        start_id += len(inputs)
-
-    logger.info(
-        "Total time: {:.3f} seconds; translation time: {:.3f}".format(
-            time.time() - start_time, total_translate_time
-        )
-    )
-
-
-def cli_main():
-    parser = options.get_interactive_generation_parser()
-    args = options.parse_args_and_arch(parser)
-    distributed_utils.call_main(convert_namespace_to_omegaconf(args), main)
-
-
-if __name__ == "__main__":
-    cli_main()
diff --git a/spaces/OFA-Sys/OFA-Visual_Grounding/fairseq/examples/backtranslation/extract_bt_data.py b/spaces/OFA-Sys/OFA-Visual_Grounding/fairseq/examples/backtranslation/extract_bt_data.py
deleted file mode 100644
index e766391e873d0d9a9561d67d5864934b2fad0681..0000000000000000000000000000000000000000
--- a/spaces/OFA-Sys/OFA-Visual_Grounding/fairseq/examples/backtranslation/extract_bt_data.py
+++ /dev/null
@@ -1,72 +0,0 @@
-#!/usr/bin/env python
-# Copyright (c) Facebook, Inc. and its affiliates.
-#
-# This source code is licensed under the MIT license found in the
-# LICENSE file in the root directory of this source tree.
-
-import argparse
-import fileinput
-
-from tqdm import tqdm
-
-
-def main():
-    parser = argparse.ArgumentParser(
-        description=(
-            "Extract back-translations from the stdout of fairseq-generate. "
-            "If there are multiply hypotheses for a source, we only keep the first one. "
-        )
-    )
-    parser.add_argument("--output", required=True, help="output prefix")
-    parser.add_argument(
-        "--srclang", required=True, help="source language (extracted from H-* lines)"
-    )
-    parser.add_argument(
-        "--tgtlang", required=True, help="target language (extracted from S-* lines)"
-    )
-    parser.add_argument("--minlen", type=int, help="min length filter")
-    parser.add_argument("--maxlen", type=int, help="max length filter")
-    parser.add_argument("--ratio", type=float, help="ratio filter")
-    parser.add_argument("files", nargs="*", help="input files")
-    args = parser.parse_args()
-
-    def validate(src, tgt):
-        srclen = len(src.split(" ")) if src != "" else 0
-        tgtlen = len(tgt.split(" ")) if tgt != "" else 0
-        if (
-            (args.minlen is not None and (srclen < args.minlen or tgtlen < args.minlen))
-            or (
-                args.maxlen is not None
-                and (srclen > args.maxlen or tgtlen > args.maxlen)
-            )
-            or (
-                args.ratio is not None
-                and (max(srclen, tgtlen) / float(min(srclen, tgtlen)) > args.ratio)
-            )
-        ):
-            return False
-        return True
-
-    def safe_index(toks, index, default):
-        try:
-            return toks[index]
-        except IndexError:
-            return default
-
-    with open(args.output + "." + args.srclang, "w") as src_h, open(
-        args.output + "." + args.tgtlang, "w"
-    ) as tgt_h:
-        for line in tqdm(fileinput.input(args.files)):
-            if line.startswith("S-"):
-                tgt = safe_index(line.rstrip().split("\t"), 1, "")
-            elif line.startswith("H-"):
-                if tgt is not None:
-                    src = safe_index(line.rstrip().split("\t"), 2, "")
-                    if validate(src, tgt):
-                        print(src, file=src_h)
-                        print(tgt, file=tgt_h)
-                    tgt = None
-
-
-if __name__ == "__main__":
-    main()
diff --git a/spaces/OFA-Sys/OFA-vqa/fairseq/fairseq/modules/lightconv_layer/cuda_function_gen.py b/spaces/OFA-Sys/OFA-vqa/fairseq/fairseq/modules/lightconv_layer/cuda_function_gen.py
deleted file mode 100644
index a25433dd8edae2f0b52d7d0eeeb829cabc6b4b89..0000000000000000000000000000000000000000
--- a/spaces/OFA-Sys/OFA-vqa/fairseq/fairseq/modules/lightconv_layer/cuda_function_gen.py
+++ /dev/null
@@ -1,289 +0,0 @@
-# Copyright (c) Facebook, Inc. and its affiliates.
-#
-# This source code is licensed under the MIT license found in the
-# LICENSE file in the root directory of this source tree.
-
-
-def gen_forward():
-
-    kernels = [3, 5, 7, 15, 31, 63, 127, 255]
-    seqs = [32 * x for x in [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16]]
-
-    head = """
-/**
- * Copyright (c) Facebook, Inc. and its affiliates.
- *
- * This source code is licensed under the MIT license found in the
- * LICENSE file in the root directory of this source tree.
- */
-
-#include "lightconv_cuda.cuh"
-
-std::vector<at::Tensor> lightconv_cuda_forward(at::Tensor input, at::Tensor filters, int padding_l) {
-
-    at::DeviceGuard g(input.device());
-    const auto minibatch = input.size(0);
-    const auto numFeatures = input.size(1);
-    const auto sequenceLength = input.size(2);
-
-    const auto numHeads = filters.size(0);
-    const auto filterSize = filters.size(1);
-
-    const auto numFiltersInBlock = numFeatures / numHeads;
-
-    const dim3 blocks(minibatch, numFeatures);
-
-    auto output = at::zeros_like(input);
-    auto stream = at::cuda::getCurrentCUDAStream();
-"""
-
-    sequence_if = """
-    if (sequenceLength <= {seq}) {{
-        switch(filterSize) {{
-"""
-
-    case_k = """
-            case {k}:
-"""
-
-    main_block = """
-                if (padding_l == {pad}) {{
-                    AT_DISPATCH_FLOATING_TYPES_AND_HALF(input.scalar_type(), "lightconv_forward", ([&] {{
-                        lightconv_forward_kernel<{k}, {b_size}, {pad}, scalar_t>
-                        <<<blocks, {b_size}, 0, stream>>>(
-                                input.data<scalar_t>(),
-                                filters.data<scalar_t>(),
-                                minibatch,
-                                sequenceLength,
-                                numFeatures,
-                                numFiltersInBlock,
-                                output.data<scalar_t>());
-                    }}));
-                }} else
-"""
-
-    bad_padding = """
-                {
-                    std::cout << "WARNING: Unsupported padding size - skipping forward pass" << std::endl;
-                }
-                break;
-"""
-
-    bad_filter = """
-            default:
-                std::cout << "WARNING: Unsupported filter length passed - skipping forward pass" << std::endl;
-        }
-"""
-
-    con_else = """
-    } else
-"""
-
-    final_else = """
-    {
-        switch(filterSize) {
-"""
-
-    final_return = """
-    }
-
-    return {output};
-}
-"""
-
-    with open("lightconv_cuda_forward.cu", "w") as forward:
-        forward.write(head)
-        for seq in seqs:
-            forward.write(sequence_if.format(seq=seq))
-            for k in kernels:
-                forward.write(case_k.format(k=k))
-                for pad in [k // 2, k - 1]:
-                    forward.write(main_block.format(k=k, b_size=seq, pad=pad))
-                forward.write(bad_padding)
-            forward.write(bad_filter)
-            forward.write(con_else)
-
-        forward.write(final_else)
-        for k in kernels:
-            forward.write(case_k.format(k=k))
-            for pad in [k // 2, k - 1]:
-                forward.write(main_block.format(k=k, b_size=seq, pad=pad))
-            forward.write(bad_padding)
-        forward.write(bad_filter)
-        forward.write(final_return)
-
-
-def gen_backward():
-
-    head = """
-/**
- * Copyright (c) Facebook, Inc. and its affiliates.
- *
- * This source code is licensed under the MIT license found in the
- * LICENSE file in the root directory of this source tree.
- */
-
-#include "lightconv_cuda.cuh"
-
-std::vector<at::Tensor> lightconv_cuda_backward(
-        at::Tensor gradOutput,
-        int padding_l,
-        at::Tensor input,
-        at::Tensor filters) {
-
-    // gradWrtInput
-    const int minibatch = input.size(0);
-    const int numFeatures = input.size(1);
-    const int sequenceLength = input.size(2);
-
-    const int numHeads = filters.size(0);
-    const int filterSize = filters.size(1);
-
-    const dim3 gradBlocks(minibatch, numFeatures);
-    const dim3 weightGradFirstpassShortBlocks(minibatch, numHeads);
-    const dim3 weightGradSecondpassBlocks(numHeads, filterSize);
-
-    const int numFiltersInBlock = numFeatures / numHeads;
-
-    auto gradInput = at::zeros_like(input);
-    auto gradFilters = at::zeros_like(filters);
-
-    at::DeviceGuard g(input.device());
-    auto stream = at::cuda::getCurrentCUDAStream();
-
-    switch(filterSize) {
-"""
-
-    sequence_if = """
-            if (sequenceLength <= {seq}) {{
-"""
-
-    case_k = """
-        case {k}:
-"""
-
-    main_block = """
-                if (padding_l == {p}) {{
-                    AT_DISPATCH_FLOATING_TYPES_AND_HALF(input.scalar_type(), "lightconv_backward", ([&] {{
-                        lightconv_grad_wrt_input_kernel<{k}, {b_size}, {p}, scalar_t>
-                        <<<gradBlocks, {b_size}, 0, stream>>>(
-                                gradOutput.data<scalar_t>(),
-                                filters.data<scalar_t>(),
-                                minibatch,
-                                sequenceLength,
-                                numFeatures,
-                                numFiltersInBlock,
-                                gradInput.data<scalar_t>());
-
-"""
-
-    weight_grad_short = """
-                        at::Tensor tempSumGradFilters = at::zeros({{minibatch, numHeads, filterSize}}, input.options().dtype(at::kFloat));
-                        lightconv_grad_wrt_weights_firstpass_short_kernel<{k}, {b_size}, {p}, scalar_t>
-                        <<<weightGradFirstpassShortBlocks, {b_size}, 0, stream>>>(
-                                input.data<scalar_t>(),
-                                gradOutput.data<scalar_t>(),
-                                minibatch,
-                                sequenceLength,
-                                numFeatures,
-                                numFiltersInBlock,
-                                numHeads,
-                                tempSumGradFilters.data<float>()
-                        );
-
-                        lightconv_grad_wrt_weights_secondpass_short_kernel<{k}, {b_size}, scalar_t>
-                        <<<weightGradSecondpassBlocks, {b_size}, 0, stream>>>(
-                                tempSumGradFilters.data<float>(),
-                                minibatch,
-                                numFiltersInBlock,
-                                gradFilters.data<scalar_t>()
-                        );
-                    }}));
-                }} else
-"""
-
-    weight_grad = """
-                        at::Tensor tempSumGradFilters = at::zeros({{minibatch, numFeatures, filterSize}}, input.options().dtype(at::kFloat));
-                        lightconv_grad_wrt_weights_firstpass_kernel<{k}, {b_size}, {p}, scalar_t>
-                        <<<gradBlocks, {b_size}, 0, stream>>>(
-                                input.data<scalar_t>(),
-                                gradOutput.data<scalar_t>(),
-                                minibatch,
-                                sequenceLength,
-                                numFeatures,
-                                numFiltersInBlock,
-                                tempSumGradFilters.data<float>()
-                        );
-
-                        lightconv_grad_wrt_weights_secondpass_kernel<{k}, {b_size}, scalar_t>
-                        <<<weightGradSecondpassBlocks, {b_size}, 0, stream>>>(
-                                tempSumGradFilters.data<float>(),
-                                minibatch,
-                                numFiltersInBlock,
-                                gradFilters.data<scalar_t>()
-                        );
-                    }}));
-                }} else
-"""
-
-    bad_padding = """
-                {
-                    std::cout << "WARNING: Unsupported padding size - skipping backward pass" << std::endl;
-                }
-"""
-
-    breakout = """
-                break;
-"""
-
-    bad_filter = """
-        default:
-            std::cout << "WARNING: Unsupported filter length passed - skipping backward pass" << std::endl;
-"""
-
-    con_else = """
-            } else
-"""
-
-    final_else = """
-    {
-        switch(filterSize) {
-"""
-
-    last_return = """
-    }
-    return {gradInput, gradFilters};
-}
-"""
-
-    kernels = [3, 5, 7, 15, 31, 63, 127, 255]
-    seqs = [32 * x for x in [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16]]
-    thresh = [32, 32, 64, 128, 256, -1, -1, -1]
-    max_mem = [-1, -1, -1, -1, -1, 192, 96, 64]
-
-    with open("lightconv_cuda_backward.cu", "w") as backward:
-        backward.write(head)
-        for (k, t, mem) in zip(kernels, thresh, max_mem):
-            backward.write(case_k.format(k=k))
-            for seq in seqs:
-                if (t == -1 or seq <= t) and (mem == -1 or seq < mem):
-                    backward.write(sequence_if.format(seq=seq))
-                    for p in [k // 2, k - 1]:
-                        backward.write(main_block.format(k=k, b_size=seq, p=p))
-                        backward.write(weight_grad_short.format(k=k, b_size=seq, p=p))
-                    backward.write(bad_padding)
-                else:
-                    for p in [k // 2, k - 1]:
-                        backward.write(main_block.format(k=k, b_size=32, p=p))
-                        backward.write(weight_grad.format(k=k, b_size=32, p=p))
-                    backward.write(bad_padding)
-                    backward.write(breakout)
-                    break
-                backward.write(con_else)
-        backward.write(bad_filter)
-        backward.write(last_return)
-
-
-if __name__ == "__main__":
-    gen_forward()
-    gen_backward()
diff --git a/spaces/OFA-Sys/OFA-vqa/fairseq/fairseq/tasks/legacy_masked_lm.py b/spaces/OFA-Sys/OFA-vqa/fairseq/fairseq/tasks/legacy_masked_lm.py
deleted file mode 100644
index 975497654926b64fff6c4960f54c4e6932e7fce1..0000000000000000000000000000000000000000
--- a/spaces/OFA-Sys/OFA-vqa/fairseq/fairseq/tasks/legacy_masked_lm.py
+++ /dev/null
@@ -1,152 +0,0 @@
-# Copyright (c) Facebook, Inc. and its affiliates.
-#
-# This source code is licensed under the MIT license found in the
-# LICENSE file in the root directory of this source tree.
-
-import itertools
-import logging
-import os
-
-import numpy as np
-from fairseq import tokenizer, utils
-from fairseq.data import ConcatDataset, Dictionary, data_utils, indexed_dataset
-from fairseq.data.legacy.block_pair_dataset import BlockPairDataset
-from fairseq.data.legacy.masked_lm_dataset import MaskedLMDataset
-from fairseq.data.legacy.masked_lm_dictionary import BertDictionary
-from fairseq.tasks import LegacyFairseqTask, register_task
-
-
-logger = logging.getLogger(__name__)
-
-
-@register_task("legacy_masked_lm")
-class LegacyMaskedLMTask(LegacyFairseqTask):
-    """
-    Task for training Masked LM (BERT) model.
-    Args:
-        dictionary (Dictionary): the dictionary for the input of the task
-    """
-
-    @staticmethod
-    def add_args(parser):
-        """Add task-specific arguments to the parser."""
-        parser.add_argument(
-            "data",
-            help="colon separated path to data directories list, \
-                            will be iterated upon during epochs in round-robin manner",
-        )
-        parser.add_argument(
-            "--tokens-per-sample",
-            default=512,
-            type=int,
-            help="max number of total tokens over all segments"
-            " per sample for BERT dataset",
-        )
-        parser.add_argument(
-            "--break-mode", default="doc", type=str, help="mode for breaking sentence"
-        )
-        parser.add_argument("--shuffle-dataset", action="store_true", default=False)
-
-    def __init__(self, args, dictionary):
-        super().__init__(args)
-        self.dictionary = dictionary
-        self.seed = args.seed
-
-    @classmethod
-    def load_dictionary(cls, filename):
-        return BertDictionary.load(filename)
-
-    @classmethod
-    def build_dictionary(
-        cls, filenames, workers=1, threshold=-1, nwords=-1, padding_factor=8
-    ):
-        d = BertDictionary()
-        for filename in filenames:
-            Dictionary.add_file_to_dictionary(
-                filename, d, tokenizer.tokenize_line, workers
-            )
-        d.finalize(threshold=threshold, nwords=nwords, padding_factor=padding_factor)
-        return d
-
-    @property
-    def target_dictionary(self):
-        return self.dictionary
-
-    @classmethod
-    def setup_task(cls, args, **kwargs):
-        """Setup the task."""
-        paths = utils.split_paths(args.data)
-        assert len(paths) > 0
-        dictionary = BertDictionary.load(os.path.join(paths[0], "dict.txt"))
-        logger.info("dictionary: {} types".format(len(dictionary)))
-
-        return cls(args, dictionary)
-
-    def load_dataset(self, split, epoch=1, combine=False):
-        """Load a given dataset split.
-
-        Args:
-            split (str): name of the split (e.g., train, valid, test)
-        """
-        loaded_datasets = []
-
-        paths = utils.split_paths(self.args.data)
-        assert len(paths) > 0
-        data_path = paths[(epoch - 1) % len(paths)]
-        logger.info("data_path", data_path)
-
-        for k in itertools.count():
-            split_k = split + (str(k) if k > 0 else "")
-            path = os.path.join(data_path, split_k)
-            ds = indexed_dataset.make_dataset(
-                path,
-                impl=self.args.dataset_impl,
-                fix_lua_indexing=True,
-                dictionary=self.dictionary,
-            )
-
-            if ds is None:
-                if k > 0:
-                    break
-                else:
-                    raise FileNotFoundError(
-                        "Dataset not found: {} ({})".format(split, data_path)
-                    )
-
-            with data_utils.numpy_seed(self.seed + k):
-                loaded_datasets.append(
-                    BlockPairDataset(
-                        ds,
-                        self.dictionary,
-                        ds.sizes,
-                        self.args.tokens_per_sample,
-                        break_mode=self.args.break_mode,
-                        doc_break_size=1,
-                    )
-                )
-
-            logger.info(
-                "{} {} {} examples".format(data_path, split_k, len(loaded_datasets[-1]))
-            )
-
-            if not combine:
-                break
-
-        if len(loaded_datasets) == 1:
-            dataset = loaded_datasets[0]
-            sizes = dataset.sizes
-        else:
-            dataset = ConcatDataset(loaded_datasets)
-            sizes = np.concatenate([ds.sizes for ds in loaded_datasets])
-
-        self.datasets[split] = MaskedLMDataset(
-            dataset=dataset,
-            sizes=sizes,
-            vocab=self.dictionary,
-            pad_idx=self.dictionary.pad(),
-            mask_idx=self.dictionary.mask(),
-            classif_token_idx=self.dictionary.cls(),
-            sep_token_idx=self.dictionary.sep(),
-            shuffle=self.args.shuffle_dataset,
-            seed=self.seed,
-        )
diff --git a/spaces/OpenBuddy/ChatWithBuddy/index.html b/spaces/OpenBuddy/ChatWithBuddy/index.html
deleted file mode 100644
index f7b8b22ab690c5d1314bc4905b90356dcd4198a3..0000000000000000000000000000000000000000
--- a/spaces/OpenBuddy/ChatWithBuddy/index.html
+++ /dev/null
@@ -1,28 +0,0 @@
-<!DOCTYPE html>
-<html>
-
-<head>
-    <meta charset="utf-8" />
-    <meta name="viewport" content="width=device-width" />
-    <title>Chat With Buddy</title>
-</head>
-
-<body>
-    <iframe src="https://chattybuddy.io/?mode=hf">
-    </iframe>
-    <style>
-        body {
-            margin: 0;
-            padding: 0;
-            overflow: hidden;
-        }
-
-        iframe {
-            width: 100vw;
-            height: 100vh;
-            border: 0;
-        }
-    </style>
-</body>
-
-</html>
\ No newline at end of file
diff --git a/spaces/OpenMotionLab/MotionGPT/pyrender/pyrender/texture.py b/spaces/OpenMotionLab/MotionGPT/pyrender/pyrender/texture.py
deleted file mode 100644
index 477759729d7b995a4f276e81d649617d045a066e..0000000000000000000000000000000000000000
--- a/spaces/OpenMotionLab/MotionGPT/pyrender/pyrender/texture.py
+++ /dev/null
@@ -1,259 +0,0 @@
-"""Textures, conforming to the glTF 2.0 standards as specified in
-https://github.com/KhronosGroup/glTF/tree/master/specification/2.0#reference-texture
-
-Author: Matthew Matl
-"""
-import numpy as np
-
-from OpenGL.GL import *
-
-from .utils import format_texture_source
-from .sampler import Sampler
-
-
-class Texture(object):
-    """A texture and its sampler.
-
-    Parameters
-    ----------
-    name : str, optional
-        The user-defined name of this object.
-    sampler : :class:`Sampler`
-        The sampler used by this texture.
-    source : (h,w,c) uint8 or (h,w,c) float or :class:`PIL.Image.Image`
-        The image used by this texture. If None, the texture is created
-        empty and width and height must be specified.
-    source_channels : str
-        Either `D`, `R`, `RG`, `GB`, `RGB`, or `RGBA`. Indicates the
-        channels to extract from `source`. Any missing channels will be filled
-        with `1.0`.
-    width : int, optional
-        For empty textures, the width of the texture buffer.
-    height : int, optional
-        For empty textures, the height of the texture buffer.
-    tex_type : int
-        Either GL_TEXTURE_2D or GL_TEXTURE_CUBE.
-    data_format : int
-        For now, just GL_FLOAT.
-    """
-
-    def __init__(self,
-                 name=None,
-                 sampler=None,
-                 source=None,
-                 source_channels=None,
-                 width=None,
-                 height=None,
-                 tex_type=GL_TEXTURE_2D,
-                 data_format=GL_UNSIGNED_BYTE):
-        self.source_channels = source_channels
-        self.name = name
-        self.sampler = sampler
-        self.source = source
-        self.width = width
-        self.height = height
-        self.tex_type = tex_type
-        self.data_format = data_format
-
-        self._texid = None
-        self._is_transparent = False
-
-    @property
-    def name(self):
-        """str : The user-defined name of this object.
-        """
-        return self._name
-
-    @name.setter
-    def name(self, value):
-        if value is not None:
-            value = str(value)
-        self._name = value
-
-    @property
-    def sampler(self):
-        """:class:`Sampler` : The sampler used by this texture.
-        """
-        return self._sampler
-
-    @sampler.setter
-    def sampler(self, value):
-        if value is None:
-            value = Sampler()
-        self._sampler = value
-
-    @property
-    def source(self):
-        """(h,w,c) uint8 or float or :class:`PIL.Image.Image` : The image
-        used in this texture.
-        """
-        return self._source
-
-    @source.setter
-    def source(self, value):
-        if value is None:
-            self._source = None
-        else:
-            self._source = format_texture_source(value, self.source_channels)
-        self._is_transparent = False
-
-    @property
-    def source_channels(self):
-        """str : The channels that were extracted from the original source.
-        """
-        return self._source_channels
-
-    @source_channels.setter
-    def source_channels(self, value):
-        self._source_channels = value
-
-    @property
-    def width(self):
-        """int : The width of the texture buffer.
-        """
-        return self._width
-
-    @width.setter
-    def width(self, value):
-        self._width = value
-
-    @property
-    def height(self):
-        """int : The height of the texture buffer.
-        """
-        return self._height
-
-    @height.setter
-    def height(self, value):
-        self._height = value
-
-    @property
-    def tex_type(self):
-        """int : The type of the texture.
-        """
-        return self._tex_type
-
-    @tex_type.setter
-    def tex_type(self, value):
-        self._tex_type = value
-
-    @property
-    def data_format(self):
-        """int : The format of the texture data.
-        """
-        return self._data_format
-
-    @data_format.setter
-    def data_format(self, value):
-        self._data_format = value
-
-    def is_transparent(self, cutoff=1.0):
-        """bool : If True, the texture is partially transparent.
-        """
-        if self._is_transparent is None:
-            self._is_transparent = False
-            if self.source_channels == 'RGBA' and self.source is not None:
-                if np.any(self.source[:,:,3] < cutoff):
-                    self._is_transparent = True
-        return self._is_transparent
-
-    def delete(self):
-        """Remove this texture from the OpenGL context.
-        """
-        self._unbind()
-        self._remove_from_context()
-
-    ##################
-    # OpenGL code
-    ##################
-    def _add_to_context(self):
-        if self._texid is not None:
-            raise ValueError('Texture already loaded into OpenGL context')
-
-        fmt = GL_DEPTH_COMPONENT
-        if self.source_channels == 'R':
-            fmt = GL_RED
-        elif self.source_channels == 'RG' or self.source_channels == 'GB':
-            fmt = GL_RG
-        elif self.source_channels == 'RGB':
-            fmt = GL_RGB
-        elif self.source_channels == 'RGBA':
-            fmt = GL_RGBA
-
-        # Generate the OpenGL texture
-        self._texid = glGenTextures(1)
-        glBindTexture(self.tex_type, self._texid)
-
-        # Flip data for OpenGL buffer
-        data = None
-        width = self.width
-        height = self.height
-        if self.source is not None:
-            data = np.ascontiguousarray(np.flip(self.source, axis=0).flatten())
-            width = self.source.shape[1]
-            height = self.source.shape[0]
-
-        # Bind texture and generate mipmaps
-        glTexImage2D(
-            self.tex_type, 0, fmt, width, height, 0, fmt,
-            self.data_format, data
-        )
-        if self.source is not None:
-            glGenerateMipmap(self.tex_type)
-
-        if self.sampler.magFilter is not None:
-            glTexParameteri(
-                self.tex_type, GL_TEXTURE_MAG_FILTER, self.sampler.magFilter
-            )
-        else:
-            if self.source is not None:
-                glTexParameteri(self.tex_type, GL_TEXTURE_MAG_FILTER, GL_LINEAR)
-            else:
-                glTexParameteri(self.tex_type, GL_TEXTURE_MAG_FILTER, GL_NEAREST)
-        if self.sampler.minFilter is not None:
-            glTexParameteri(
-                self.tex_type, GL_TEXTURE_MIN_FILTER, self.sampler.minFilter
-            )
-        else:
-            if self.source is not None:
-                glTexParameteri(self.tex_type, GL_TEXTURE_MIN_FILTER, GL_LINEAR_MIPMAP_LINEAR)
-            else:
-                glTexParameteri(self.tex_type, GL_TEXTURE_MIN_FILTER, GL_NEAREST)
-
-        glTexParameteri(self.tex_type, GL_TEXTURE_WRAP_S, self.sampler.wrapS)
-        glTexParameteri(self.tex_type, GL_TEXTURE_WRAP_T, self.sampler.wrapT)
-        border_color = 255 * np.ones(4).astype(np.uint8)
-        if self.data_format == GL_FLOAT:
-            border_color = np.ones(4).astype(np.float32)
-        glTexParameterfv(
-            self.tex_type, GL_TEXTURE_BORDER_COLOR,
-            border_color
-        )
-
-        # Unbind texture
-        glBindTexture(self.tex_type, 0)
-
-    def _remove_from_context(self):
-        if self._texid is not None:
-            # TODO OPENGL BUG?
-            # glDeleteTextures(1, [self._texid])
-            glDeleteTextures([self._texid])
-            self._texid = None
-
-    def _in_context(self):
-        return self._texid is not None
-
-    def _bind(self):
-        # TODO HANDLE INDEXING INTO OTHER UV's
-        glBindTexture(self.tex_type, self._texid)
-
-    def _unbind(self):
-        glBindTexture(self.tex_type, 0)
-
-    def _bind_as_depth_attachment(self):
-        glFramebufferTexture2D(GL_FRAMEBUFFER, GL_DEPTH_ATTACHMENT,
-                               self.tex_type, self._texid, 0)
-
-    def _bind_as_color_attachment(self):
-        glFramebufferTexture2D(GL_FRAMEBUFFER, GL_COLOR_ATTACHMENT0,
-                               self.tex_type, self._texid, 0)
diff --git a/spaces/PAIR/Text2Video-Zero/annotator/uniformer/mmcv/fileio/io.py b/spaces/PAIR/Text2Video-Zero/annotator/uniformer/mmcv/fileio/io.py
deleted file mode 100644
index aaefde58aa3ea5b58f86249ce7e1c40c186eb8dd..0000000000000000000000000000000000000000
--- a/spaces/PAIR/Text2Video-Zero/annotator/uniformer/mmcv/fileio/io.py
+++ /dev/null
@@ -1,151 +0,0 @@
-# Copyright (c) OpenMMLab. All rights reserved.
-from io import BytesIO, StringIO
-from pathlib import Path
-
-from ..utils import is_list_of, is_str
-from .file_client import FileClient
-from .handlers import BaseFileHandler, JsonHandler, PickleHandler, YamlHandler
-
-file_handlers = {
-    'json': JsonHandler(),
-    'yaml': YamlHandler(),
-    'yml': YamlHandler(),
-    'pickle': PickleHandler(),
-    'pkl': PickleHandler()
-}
-
-
-def load(file, file_format=None, file_client_args=None, **kwargs):
-    """Load data from json/yaml/pickle files.
-
-    This method provides a unified api for loading data from serialized files.
-
-    Note:
-        In v1.3.16 and later, ``load`` supports loading data from serialized
-        files those can be storaged in different backends.
-
-    Args:
-        file (str or :obj:`Path` or file-like object): Filename or a file-like
-            object.
-        file_format (str, optional): If not specified, the file format will be
-            inferred from the file extension, otherwise use the specified one.
-            Currently supported formats include "json", "yaml/yml" and
-            "pickle/pkl".
-        file_client_args (dict, optional): Arguments to instantiate a
-            FileClient. See :class:`mmcv.fileio.FileClient` for details.
-            Default: None.
-
-    Examples:
-        >>> load('/path/of/your/file')  # file is storaged in disk
-        >>> load('https://path/of/your/file')  # file is storaged in Internet
-        >>> load('s3://path/of/your/file')  # file is storaged in petrel
-
-    Returns:
-        The content from the file.
-    """
-    if isinstance(file, Path):
-        file = str(file)
-    if file_format is None and is_str(file):
-        file_format = file.split('.')[-1]
-    if file_format not in file_handlers:
-        raise TypeError(f'Unsupported format: {file_format}')
-
-    handler = file_handlers[file_format]
-    if is_str(file):
-        file_client = FileClient.infer_client(file_client_args, file)
-        if handler.str_like:
-            with StringIO(file_client.get_text(file)) as f:
-                obj = handler.load_from_fileobj(f, **kwargs)
-        else:
-            with BytesIO(file_client.get(file)) as f:
-                obj = handler.load_from_fileobj(f, **kwargs)
-    elif hasattr(file, 'read'):
-        obj = handler.load_from_fileobj(file, **kwargs)
-    else:
-        raise TypeError('"file" must be a filepath str or a file-object')
-    return obj
-
-
-def dump(obj, file=None, file_format=None, file_client_args=None, **kwargs):
-    """Dump data to json/yaml/pickle strings or files.
-
-    This method provides a unified api for dumping data as strings or to files,
-    and also supports custom arguments for each file format.
-
-    Note:
-        In v1.3.16 and later, ``dump`` supports dumping data as strings or to
-        files which is saved to different backends.
-
-    Args:
-        obj (any): The python object to be dumped.
-        file (str or :obj:`Path` or file-like object, optional): If not
-            specified, then the object is dumped to a str, otherwise to a file
-            specified by the filename or file-like object.
-        file_format (str, optional): Same as :func:`load`.
-        file_client_args (dict, optional): Arguments to instantiate a
-            FileClient. See :class:`mmcv.fileio.FileClient` for details.
-            Default: None.
-
-    Examples:
-        >>> dump('hello world', '/path/of/your/file')  # disk
-        >>> dump('hello world', 's3://path/of/your/file')  # ceph or petrel
-
-    Returns:
-        bool: True for success, False otherwise.
-    """
-    if isinstance(file, Path):
-        file = str(file)
-    if file_format is None:
-        if is_str(file):
-            file_format = file.split('.')[-1]
-        elif file is None:
-            raise ValueError(
-                'file_format must be specified since file is None')
-    if file_format not in file_handlers:
-        raise TypeError(f'Unsupported format: {file_format}')
-
-    handler = file_handlers[file_format]
-    if file is None:
-        return handler.dump_to_str(obj, **kwargs)
-    elif is_str(file):
-        file_client = FileClient.infer_client(file_client_args, file)
-        if handler.str_like:
-            with StringIO() as f:
-                handler.dump_to_fileobj(obj, f, **kwargs)
-                file_client.put_text(f.getvalue(), file)
-        else:
-            with BytesIO() as f:
-                handler.dump_to_fileobj(obj, f, **kwargs)
-                file_client.put(f.getvalue(), file)
-    elif hasattr(file, 'write'):
-        handler.dump_to_fileobj(obj, file, **kwargs)
-    else:
-        raise TypeError('"file" must be a filename str or a file-object')
-
-
-def _register_handler(handler, file_formats):
-    """Register a handler for some file extensions.
-
-    Args:
-        handler (:obj:`BaseFileHandler`): Handler to be registered.
-        file_formats (str or list[str]): File formats to be handled by this
-            handler.
-    """
-    if not isinstance(handler, BaseFileHandler):
-        raise TypeError(
-            f'handler must be a child of BaseFileHandler, not {type(handler)}')
-    if isinstance(file_formats, str):
-        file_formats = [file_formats]
-    if not is_list_of(file_formats, str):
-        raise TypeError('file_formats must be a str or a list of str')
-    for ext in file_formats:
-        file_handlers[ext] = handler
-
-
-def register_handler(file_formats, **kwargs):
-
-    def wrap(cls):
-        _register_handler(cls(**kwargs), file_formats)
-        return cls
-
-    return wrap
diff --git a/spaces/Peter1/AnimeGANv3/README.md b/spaces/Peter1/AnimeGANv3/README.md
deleted file mode 100644
index 3313567ea82d539408c19a64ddd530f259d944b5..0000000000000000000000000000000000000000
--- a/spaces/Peter1/AnimeGANv3/README.md
+++ /dev/null
@@ -1,13 +0,0 @@
----
-title: AnimeGANv3
-emoji: 😁
-colorFrom: green
-colorTo: blue
-sdk: gradio
-sdk_version: 3.3.1
-app_file: app.py
-pinned: true
-author: xin chen
-duplicated_from: TachibanaYoshino/AnimeGANv3
----
-
diff --git a/spaces/Pinwheel/GLIP-BLIP-Object-Detection-VQA/maskrcnn_benchmark/modeling/roi_heads/mask_head/loss.py b/spaces/Pinwheel/GLIP-BLIP-Object-Detection-VQA/maskrcnn_benchmark/modeling/roi_heads/mask_head/loss.py
deleted file mode 100644
index b7434c4e76709d5d3ae8d6399d15256916686fba..0000000000000000000000000000000000000000
--- a/spaces/Pinwheel/GLIP-BLIP-Object-Detection-VQA/maskrcnn_benchmark/modeling/roi_heads/mask_head/loss.py
+++ /dev/null
@@ -1,179 +0,0 @@
-# Copyright (c) Facebook, Inc. and its affiliates. All Rights Reserved.
-import torch
-from torch.nn import functional as F
-
-from maskrcnn_benchmark.layers import smooth_l1_loss
-from maskrcnn_benchmark.modeling.matcher import Matcher
-from maskrcnn_benchmark.structures.boxlist_ops import boxlist_iou
-from maskrcnn_benchmark.modeling.utils import cat
-
-
-def project_masks_on_boxes(segmentation_masks, proposals, discretization_size):
-    """
-    Given segmentation masks and the bounding boxes corresponding
-    to the location of the masks in the image, this function
-    crops and resizes the masks in the position defined by the
-    boxes. This prepares the masks for them to be fed to the
-    loss computation as the targets.
-
-    Arguments:
-        segmentation_masks: an instance of SegmentationMask
-        proposals: an instance of BoxList
-    """
-    masks = []
-    M = discretization_size
-    device = proposals.bbox.device
-    proposals = proposals.convert("xyxy")
-    assert segmentation_masks.size == proposals.size, "{}, {}".format(
-        segmentation_masks, proposals
-    )
-    # TODO put the proposals on the CPU, as the representation for the
-    # masks is not efficient GPU-wise (possibly several small tensors for
-    # representing a single instance mask)
-    proposals = proposals.bbox.to(torch.device("cpu"))
-    for segmentation_mask, proposal in zip(segmentation_masks, proposals):
-        # crop the masks, resize them to the desired resolution and
-        # then convert them to the tensor representation,
-        # instead of the list representation that was used
-        cropped_mask = segmentation_mask.crop(proposal)
-        scaled_mask = cropped_mask.resize((M, M))
-        mask = scaled_mask.convert(mode="mask")
-        masks.append(mask)
-    if len(masks) == 0:
-        return torch.empty(0, dtype=torch.float32, device=device)
-    return torch.stack(masks, dim=0).to(device, dtype=torch.float32)
-
-
-class MaskRCNNLossComputation(object):
-    def __init__(self, proposal_matcher, discretization_size, vl_version=False):
-        """
-        Arguments:
-            proposal_matcher (Matcher)
-            discretization_size (int)
-        """
-        self.proposal_matcher = proposal_matcher
-        self.discretization_size = discretization_size
-        self.vl_version = vl_version
-
-    def match_targets_to_proposals(self, proposal, target):
-        match_quality_matrix = boxlist_iou(target, proposal)
-        matched_idxs = self.proposal_matcher(match_quality_matrix)
-        # Mask RCNN needs "labels" and "masks "fields for creating the targets
-        if self.vl_version:
-            target = target.copy_with_fields(["positive_map", "masks"])
-        else:
-            target = target.copy_with_fields(["labels", "masks"])
-        # get the targets corresponding GT for each proposal
-        # NB: need to clamp the indices because we can have a single
-        # GT in the image, and matched_idxs can be -2, which goes
-        # out of bounds
-        matched_targets = target[matched_idxs.clamp(min=0)]
-        matched_targets.add_field("matched_idxs", matched_idxs)
-        return matched_targets
-
-    def prepare_targets(self, proposals, targets):
-        labels = []
-        masks = []
-        positive_maps = []
-        for proposals_per_image, targets_per_image in zip(proposals, targets):
-            matched_targets = self.match_targets_to_proposals(
-                proposals_per_image, targets_per_image
-            )
-            matched_idxs = matched_targets.get_field("matched_idxs")
-
-            if self.vl_version:
-                positive_maps_per_image = matched_targets.get_field("positive_map")
-
-                # this can probably be removed, but is left here for clarity
-                # and completeness
-                neg_inds = matched_idxs == Matcher.BELOW_LOW_THRESHOLD
-                positive_maps_per_image[neg_inds, :] = 0
-
-                positive_maps.append(positive_maps_per_image)
-
-                # TODO: make sure for the softmax [NoObj] case
-                labels_per_image = positive_maps_per_image.sum(dim=-1)
-                labels_per_image = labels_per_image.to(dtype=torch.int64)
-            else:
-                labels_per_image = matched_targets.get_field("labels")
-                labels_per_image = labels_per_image.to(dtype=torch.int64)
-
-                # this can probably be removed, but is left here for clarity
-                # and completeness
-                neg_inds = matched_idxs == Matcher.BELOW_LOW_THRESHOLD
-                labels_per_image[neg_inds] = 0
-
-            # mask scores are only computed on positive samples
-            positive_inds = torch.nonzero(labels_per_image > 0).squeeze(1)
-
-            segmentation_masks = matched_targets.get_field("masks")
-            segmentation_masks = segmentation_masks[positive_inds]
-
-            positive_proposals = proposals_per_image[positive_inds]
-
-            masks_per_image = project_masks_on_boxes(
-                segmentation_masks, positive_proposals, self.discretization_size
-            )
-
-            labels.append(labels_per_image)
-            masks.append(masks_per_image)
-
-        return labels, masks, positive_maps
-
-    def __call__(self, proposals, mask_logits, targets):
-        """
-        Arguments:
-            proposals (list[BoxList])
-            mask_logits (Tensor)
-            targets (list[BoxList])
-
-        Return:
-            mask_loss (Tensor): scalar tensor containing the loss
-        """
-        labels, mask_targets, positive_maps = self.prepare_targets(proposals, targets)
-
-        labels = cat(labels, dim=0)
-        mask_targets = cat(mask_targets, dim=0)
-
-        positive_inds = torch.nonzero(labels > 0).squeeze(1)
-        labels_pos = labels[positive_inds]
-        # TODO: a hack for binary mask head
-        labels_pos = (labels_pos > 0).to(dtype=torch.int64)
-
-        # torch.mean (in binary_cross_entropy_with_logits) doesn't
-        # accept empty tensors, so handle it separately
-        if mask_targets.numel() == 0:
-            return mask_logits.sum() * 0
-
-        if self.vl_version:
-            positive_maps = cat(positive_maps, dim=0)
-            mask_logits_pos = []
-            for positive_ind in positive_inds:
-                positive_map = positive_maps[positive_ind]
-                # TODO: make sure for the softmax [NoObj] case
-                mask_logit_pos = mask_logits[positive_ind][torch.nonzero(positive_map).squeeze(1)].mean(dim=0, keepdim=True)
-                mask_logits_pos.append(mask_logit_pos)
-            mask_logits_pos = cat(mask_logits_pos, dim=0)
-            mask_loss = F.binary_cross_entropy_with_logits(
-                mask_logits_pos, mask_targets
-            )
-        else:
-            mask_loss = F.binary_cross_entropy_with_logits(
-                mask_logits[positive_inds, labels_pos], mask_targets
-            )
-        return mask_loss
-
-
-def make_roi_mask_loss_evaluator(cfg):
-    matcher = Matcher(
-        cfg.MODEL.ROI_HEADS.FG_IOU_THRESHOLD,
-        cfg.MODEL.ROI_HEADS.BG_IOU_THRESHOLD,
-        allow_low_quality_matches=False,
-    )
-
-    loss_evaluator = MaskRCNNLossComputation(
-        matcher, cfg.MODEL.ROI_MASK_HEAD.RESOLUTION,
-        vl_version=cfg.MODEL.ROI_MASK_HEAD.PREDICTOR.startswith("VL")
-    )
-
-    return loss_evaluator
diff --git a/spaces/Priyanka-Kumavat/Customer-Complaint-Segmentation-Model/documentation.md b/spaces/Priyanka-Kumavat/Customer-Complaint-Segmentation-Model/documentation.md
deleted file mode 100644
index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000
diff --git a/spaces/Purple11/Grounded-Diffusion/src/taming-transformers/taming/modules/losses/lpips.py b/spaces/Purple11/Grounded-Diffusion/src/taming-transformers/taming/modules/losses/lpips.py
deleted file mode 100644
index a7280447694ffc302a7636e7e4d6183408e0aa95..0000000000000000000000000000000000000000
--- a/spaces/Purple11/Grounded-Diffusion/src/taming-transformers/taming/modules/losses/lpips.py
+++ /dev/null
@@ -1,123 +0,0 @@
-"""Stripped version of https://github.com/richzhang/PerceptualSimilarity/tree/master/models"""
-
-import torch
-import torch.nn as nn
-from torchvision import models
-from collections import namedtuple
-
-from taming.util import get_ckpt_path
-
-
-class LPIPS(nn.Module):
-    # Learned perceptual metric
-    def __init__(self, use_dropout=True):
-        super().__init__()
-        self.scaling_layer = ScalingLayer()
-        self.chns = [64, 128, 256, 512, 512]  # vg16 features
-        self.net = vgg16(pretrained=True, requires_grad=False)
-        self.lin0 = NetLinLayer(self.chns[0], use_dropout=use_dropout)
-        self.lin1 = NetLinLayer(self.chns[1], use_dropout=use_dropout)
-        self.lin2 = NetLinLayer(self.chns[2], use_dropout=use_dropout)
-        self.lin3 = NetLinLayer(self.chns[3], use_dropout=use_dropout)
-        self.lin4 = NetLinLayer(self.chns[4], use_dropout=use_dropout)
-        self.load_from_pretrained()
-        for param in self.parameters():
-            param.requires_grad = False
-
-    def load_from_pretrained(self, name="vgg_lpips"):
-        ckpt = get_ckpt_path(name, "taming/modules/autoencoder/lpips")
-        self.load_state_dict(torch.load(ckpt, map_location=torch.device("cpu")), strict=False)
-        print("loaded pretrained LPIPS loss from {}".format(ckpt))
-
-    @classmethod
-    def from_pretrained(cls, name="vgg_lpips"):
-        if name != "vgg_lpips":
-            raise NotImplementedError
-        model = cls()
-        ckpt = get_ckpt_path(name)
-        model.load_state_dict(torch.load(ckpt, map_location=torch.device("cpu")), strict=False)
-        return model
-
-    def forward(self, input, target):
-        in0_input, in1_input = (self.scaling_layer(input), self.scaling_layer(target))
-        outs0, outs1 = self.net(in0_input), self.net(in1_input)
-        feats0, feats1, diffs = {}, {}, {}
-        lins = [self.lin0, self.lin1, self.lin2, self.lin3, self.lin4]
-        for kk in range(len(self.chns)):
-            feats0[kk], feats1[kk] = normalize_tensor(outs0[kk]), normalize_tensor(outs1[kk])
-            diffs[kk] = (feats0[kk] - feats1[kk]) ** 2
-
-        res = [spatial_average(lins[kk].model(diffs[kk]), keepdim=True) for kk in range(len(self.chns))]
-        val = res[0]
-        for l in range(1, len(self.chns)):
-            val += res[l]
-        return val
-
-
-class ScalingLayer(nn.Module):
-    def __init__(self):
-        super(ScalingLayer, self).__init__()
-        self.register_buffer('shift', torch.Tensor([-.030, -.088, -.188])[None, :, None, None])
-        self.register_buffer('scale', torch.Tensor([.458, .448, .450])[None, :, None, None])
-
-    def forward(self, inp):
-        return (inp - self.shift) / self.scale
-
-
-class NetLinLayer(nn.Module):
-    """ A single linear layer which does a 1x1 conv """
-    def __init__(self, chn_in, chn_out=1, use_dropout=False):
-        super(NetLinLayer, self).__init__()
-        layers = [nn.Dropout(), ] if (use_dropout) else []
-        layers += [nn.Conv2d(chn_in, chn_out, 1, stride=1, padding=0, bias=False), ]
-        self.model = nn.Sequential(*layers)
-
-
-class vgg16(torch.nn.Module):
-    def __init__(self, requires_grad=False, pretrained=True):
-        super(vgg16, self).__init__()
-        vgg_pretrained_features = models.vgg16(pretrained=pretrained).features
-        self.slice1 = torch.nn.Sequential()
-        self.slice2 = torch.nn.Sequential()
-        self.slice3 = torch.nn.Sequential()
-        self.slice4 = torch.nn.Sequential()
-        self.slice5 = torch.nn.Sequential()
-        self.N_slices = 5
-        for x in range(4):
-            self.slice1.add_module(str(x), vgg_pretrained_features[x])
-        for x in range(4, 9):
-            self.slice2.add_module(str(x), vgg_pretrained_features[x])
-        for x in range(9, 16):
-            self.slice3.add_module(str(x), vgg_pretrained_features[x])
-        for x in range(16, 23):
-            self.slice4.add_module(str(x), vgg_pretrained_features[x])
-        for x in range(23, 30):
-            self.slice5.add_module(str(x), vgg_pretrained_features[x])
-        if not requires_grad:
-            for param in self.parameters():
-                param.requires_grad = False
-
-    def forward(self, X):
-        h = self.slice1(X)
-        h_relu1_2 = h
-        h = self.slice2(h)
-        h_relu2_2 = h
-        h = self.slice3(h)
-        h_relu3_3 = h
-        h = self.slice4(h)
-        h_relu4_3 = h
-        h = self.slice5(h)
-        h_relu5_3 = h
-        vgg_outputs = namedtuple("VggOutputs", ['relu1_2', 'relu2_2', 'relu3_3', 'relu4_3', 'relu5_3'])
-        out = vgg_outputs(h_relu1_2, h_relu2_2, h_relu3_3, h_relu4_3, h_relu5_3)
-        return out
-
-
-def normalize_tensor(x,eps=1e-10):
-    norm_factor = torch.sqrt(torch.sum(x**2,dim=1,keepdim=True))
-    return x/(norm_factor+eps)
-
-
-def spatial_average(x, keepdim=True):
-    return x.mean([2,3],keepdim=keepdim)
-
diff --git a/spaces/Qiukai/gpt/crazy_functions/crazy_utils.py b/spaces/Qiukai/gpt/crazy_functions/crazy_utils.py
deleted file mode 100644
index 9e96e58c9288dcacd4a42586ae8276b52ba17f40..0000000000000000000000000000000000000000
--- a/spaces/Qiukai/gpt/crazy_functions/crazy_utils.py
+++ /dev/null
@@ -1,362 +0,0 @@
-import traceback
-from toolbox import update_ui
-
-def input_clipping(inputs, history, max_token_limit):
-    import tiktoken
-    import numpy as np
-    from toolbox import get_conf
-    enc = tiktoken.encoding_for_model(*get_conf('LLM_MODEL'))
-    def get_token_num(txt): return len(enc.encode(txt))
-
-    mode = 'input-and-history'
-    # 当 输入部分的token占比 小于 全文的一半时，只裁剪历史
-    input_token_num = get_token_num(inputs)
-    if input_token_num < max_token_limit//2: 
-        mode = 'only-history'
-        max_token_limit = max_token_limit - input_token_num
-
-    everything = [inputs] if mode == 'input-and-history' else ['']
-    everything.extend(history)
-    n_token = get_token_num('\n'.join(everything))
-    everything_token = [get_token_num(e) for e in everything]
-    delta = max(everything_token) // 16 # 截断时的颗粒度
-        
-    while n_token > max_token_limit:
-        where = np.argmax(everything_token)
-        encoded = enc.encode(everything[where])
-        clipped_encoded = encoded[:len(encoded)-delta]
-        everything[where] = enc.decode(clipped_encoded)[:-1]    # -1 to remove the may-be illegal char
-        everything_token[where] = get_token_num(everything[where])
-        n_token = get_token_num('\n'.join(everything))
-
-    if mode == 'input-and-history':
-        inputs = everything[0]
-    else:
-        pass
-    history = everything[1:]
-    return inputs, history
-
-def request_gpt_model_in_new_thread_with_ui_alive(
-        inputs, inputs_show_user, llm_kwargs, 
-        chatbot, history, sys_prompt, refresh_interval=0.2,
-        handle_token_exceed=True, 
-        retry_times_at_unknown_error=2,
-        ):
-    """
-    Request GPT model，请求GPT模型同时维持用户界面活跃。
-
-    输入参数 Args （以_array结尾的输入变量都是列表，列表长度为子任务的数量，执行时，会把列表拆解，放到每个子线程中分别执行）:
-        inputs (string): List of inputs （输入）
-        inputs_show_user (string): List of inputs to show user（展现在报告中的输入，借助此参数，在汇总报告中隐藏啰嗦的真实输入，增强报告的可读性）
-        top_p (float): Top p value for sampling from model distribution （GPT参数，浮点数）
-        temperature (float): Temperature value for sampling from model distribution（GPT参数，浮点数）
-        chatbot: chatbot inputs and outputs （用户界面对话窗口句柄，用于数据流可视化）
-        history (list): List of chat history （历史，对话历史列表）
-        sys_prompt (string): List of system prompts （系统输入，列表，用于输入给GPT的前提提示，比如你是翻译官怎样怎样）
-        refresh_interval (float, optional): Refresh interval for UI (default: 0.2) （刷新时间间隔频率，建议低于1，不可高于3，仅仅服务于视觉效果）
-        handle_token_exceed：是否自动处理token溢出的情况，如果选择自动处理，则会在溢出时暴力截断，默认开启
-        retry_times_at_unknown_error：失败时的重试次数
-
-    输出 Returns:
-        future: 输出，GPT返回的结果
-    """
-    import time
-    from concurrent.futures import ThreadPoolExecutor
-    from request_llm.bridge_chatgpt import predict_no_ui_long_connection
-    # 用户反馈
-    chatbot.append([inputs_show_user, ""])
-    msg = '正常'
-    yield from update_ui(chatbot=chatbot, history=[]) # 刷新界面
-    executor = ThreadPoolExecutor(max_workers=16)
-    mutable = ["", time.time()]
-    def _req_gpt(inputs, history, sys_prompt):
-        retry_op = retry_times_at_unknown_error
-        exceeded_cnt = 0
-        while True:
-            try:
-                # 【第一种情况】：顺利完成
-                result = predict_no_ui_long_connection(
-                    inputs=inputs, llm_kwargs=llm_kwargs,
-                    history=history, sys_prompt=sys_prompt, observe_window=mutable)
-                return result
-            except ConnectionAbortedError as token_exceeded_error:
-                # 【第二种情况】：Token溢出
-                if handle_token_exceed:
-                    exceeded_cnt += 1
-                    # 【选择处理】 尝试计算比例，尽可能多地保留文本
-                    from toolbox import get_reduce_token_percent
-                    p_ratio, n_exceed = get_reduce_token_percent(str(token_exceeded_error))
-                    MAX_TOKEN = 4096
-                    EXCEED_ALLO = 512 + 512 * exceeded_cnt
-                    inputs, history = input_clipping(inputs, history, max_token_limit=MAX_TOKEN-EXCEED_ALLO)
-                    mutable[0] += f'[Local Message] 警告，文本过长将进行截断，Token溢出数：{n_exceed}。\n\n'
-                    continue # 返回重试
-                else:
-                    # 【选择放弃】
-                    tb_str = '```\n' + traceback.format_exc() + '```'
-                    mutable[0] += f"[Local Message] 警告，在执行过程中遭遇问题, Traceback：\n\n{tb_str}\n\n"
-                    return mutable[0] # 放弃
-            except:
-                # 【第三种情况】：其他错误：重试几次
-                tb_str = '```\n' + traceback.format_exc() + '```'
-                mutable[0] += f"[Local Message] 警告，在执行过程中遭遇问题, Traceback：\n\n{tb_str}\n\n"
-                if retry_op > 0: 
-                    retry_op -= 1
-                    mutable[0] += f"[Local Message] 重试中 {retry_times_at_unknown_error-retry_op}/{retry_times_at_unknown_error}：\n\n"
-                    time.sleep(5)
-                    continue # 返回重试
-                else:
-                    time.sleep(5)
-                    return mutable[0] # 放弃
-
-    future = executor.submit(_req_gpt, inputs, history, sys_prompt)
-    while True:
-        # yield一次以刷新前端页面
-        time.sleep(refresh_interval)
-        # “喂狗”（看门狗）
-        mutable[1] = time.time()
-        if future.done():
-            break
-        chatbot[-1] = [chatbot[-1][0], mutable[0]]
-        yield from update_ui(chatbot=chatbot, history=[]) # 刷新界面
-
-    final_result = future.result()
-    chatbot[-1] = [chatbot[-1][0], final_result]
-    yield from update_ui(chatbot=chatbot, history=[]) # 如果最后成功了，则删除报错信息
-    return final_result
-
-
-def request_gpt_model_multi_threads_with_very_awesome_ui_and_high_efficiency(
-        inputs_array, inputs_show_user_array, llm_kwargs, 
-        chatbot, history_array, sys_prompt_array, 
-        refresh_interval=0.2, max_workers=10, scroller_max_len=30,
-        handle_token_exceed=True, show_user_at_complete=False,
-        retry_times_at_unknown_error=2,
-        ):
-    """
-    Request GPT model using multiple threads with UI and high efficiency
-    请求GPT模型的[多线程]版。
-    具备以下功能：
-        实时在UI上反馈远程数据流
-        使用线程池，可调节线程池的大小避免openai的流量限制错误
-        处理中途中止的情况
-        网络等出问题时，会把traceback和已经接收的数据转入输出
-
-    输入参数 Args （以_array结尾的输入变量都是列表，列表长度为子任务的数量，执行时，会把列表拆解，放到每个子线程中分别执行）:
-        inputs_array (list): List of inputs （每个子任务的输入）
-        inputs_show_user_array (list): List of inputs to show user（每个子任务展现在报告中的输入，借助此参数，在汇总报告中隐藏啰嗦的真实输入，增强报告的可读性）
-        llm_kwargs: llm_kwargs参数
-        chatbot: chatbot （用户界面对话窗口句柄，用于数据流可视化）
-        history_array (list): List of chat history （历史对话输入，双层列表，第一层列表是子任务分解，第二层列表是对话历史）
-        sys_prompt_array (list): List of system prompts （系统输入，列表，用于输入给GPT的前提提示，比如你是翻译官怎样怎样）
-        refresh_interval (float, optional): Refresh interval for UI (default: 0.2) （刷新时间间隔频率，建议低于1，不可高于3，仅仅服务于视觉效果）
-        max_workers (int, optional): Maximum number of threads (default: 10) （最大线程数，如果子任务非常多，需要用此选项防止高频地请求openai导致错误）
-        scroller_max_len (int, optional): Maximum length for scroller (default: 30)（数据流的显示最后收到的多少个字符，仅仅服务于视觉效果）
-        handle_token_exceed (bool, optional): （是否在输入过长时，自动缩减文本）
-        handle_token_exceed：是否自动处理token溢出的情况，如果选择自动处理，则会在溢出时暴力截断，默认开启
-        show_user_at_complete (bool, optional): (在结束时，把完整输入-输出结果显示在聊天框)
-        retry_times_at_unknown_error：子任务失败时的重试次数
-
-    输出 Returns:
-        list: List of GPT model responses （每个子任务的输出汇总，如果某个子任务出错，response中会携带traceback报错信息，方便调试和定位问题。）
-    """
-    import time, random
-    from concurrent.futures import ThreadPoolExecutor
-    from request_llm.bridge_chatgpt import predict_no_ui_long_connection
-    assert len(inputs_array) == len(history_array)
-    assert len(inputs_array) == len(sys_prompt_array)
-    executor = ThreadPoolExecutor(max_workers=max_workers)
-    n_frag = len(inputs_array)
-    # 用户反馈
-    chatbot.append(["请开始多线程操作。", ""])
-    msg = '正常'
-    yield from update_ui(chatbot=chatbot, history=[]) # 刷新界面
-    # 异步原子
-    mutable = [["", time.time(), "等待中"] for _ in range(n_frag)]
-
-    def _req_gpt(index, inputs, history, sys_prompt):
-        gpt_say = ""
-        retry_op = retry_times_at_unknown_error
-        exceeded_cnt = 0
-        mutable[index][2] = "执行中"
-        while True:
-            try:
-                # 【第一种情况】：顺利完成
-                # time.sleep(10); raise RuntimeError("测试")
-                gpt_say = predict_no_ui_long_connection(
-                    inputs=inputs, llm_kwargs=llm_kwargs, history=history, 
-                    sys_prompt=sys_prompt, observe_window=mutable[index], console_slience=True
-                )
-                mutable[index][2] = "已成功"
-                return gpt_say
-            except ConnectionAbortedError as token_exceeded_error:
-                # 【第二种情况】：Token溢出，
-                if handle_token_exceed:
-                    exceeded_cnt += 1
-                    # 【选择处理】 尝试计算比例，尽可能多地保留文本
-                    from toolbox import get_reduce_token_percent
-                    p_ratio, n_exceed = get_reduce_token_percent(str(token_exceeded_error))
-                    MAX_TOKEN = 4096
-                    EXCEED_ALLO = 512 + 512 * exceeded_cnt
-                    inputs, history = input_clipping(inputs, history, max_token_limit=MAX_TOKEN-EXCEED_ALLO)
-                    gpt_say += f'[Local Message] 警告，文本过长将进行截断，Token溢出数：{n_exceed}。\n\n'
-                    mutable[index][2] = f"截断重试"
-                    continue # 返回重试
-                else:
-                    # 【选择放弃】
-                    tb_str = '```\n' + traceback.format_exc() + '```'
-                    gpt_say += f"[Local Message] 警告，线程{index}在执行过程中遭遇问题, Traceback：\n\n{tb_str}\n\n"
-                    if len(mutable[index][0]) > 0: gpt_say += "此线程失败前收到的回答：\n\n" + mutable[index][0]
-                    mutable[index][2] = "输入过长已放弃"
-                    return gpt_say # 放弃
-            except:
-                # 【第三种情况】：其他错误
-                tb_str = '```\n' + traceback.format_exc() + '```'
-                gpt_say += f"[Local Message] 警告，线程{index}在执行过程中遭遇问题, Traceback：\n\n{tb_str}\n\n"
-                if len(mutable[index][0]) > 0: gpt_say += "此线程失败前收到的回答：\n\n" + mutable[index][0]
-                if retry_op > 0: 
-                    retry_op -= 1
-                    wait = random.randint(5, 20)
-                    for i in range(wait):# 也许等待十几秒后，情况会好转
-                        mutable[index][2] = f"等待重试 {wait-i}"; time.sleep(1)
-                    mutable[index][2] = f"重试中 {retry_times_at_unknown_error-retry_op}/{retry_times_at_unknown_error}"
-                    continue # 返回重试
-                else:
-                    mutable[index][2] = "已失败"
-                    wait = 5
-                    time.sleep(5)
-                    return gpt_say # 放弃
-
-    # 异步任务开始
-    futures = [executor.submit(_req_gpt, index, inputs, history, sys_prompt) for index, inputs, history, sys_prompt in zip(
-        range(len(inputs_array)), inputs_array, history_array, sys_prompt_array)]
-    cnt = 0
-    while True:
-        # yield一次以刷新前端页面
-        time.sleep(refresh_interval)
-        cnt += 1
-        worker_done = [h.done() for h in futures]
-        if all(worker_done):
-            executor.shutdown()
-            break
-        # 更好的UI视觉效果
-        observe_win = []
-        # print([mutable[thread_index][2] for thread_index, _ in enumerate(worker_done)])
-        # 每个线程都要“喂狗”（看门狗）
-        for thread_index, _ in enumerate(worker_done):
-            mutable[thread_index][1] = time.time()
-        # 在前端打印些好玩的东西
-        for thread_index, _ in enumerate(worker_done):
-            print_something_really_funny = "[ ...`"+mutable[thread_index][0][-scroller_max_len:].\
-                replace('\n', '').replace('```', '...').replace(
-                    ' ', '.').replace('<br/>', '.....').replace('$', '.')+"`... ]"
-            observe_win.append(print_something_really_funny)
-        stat_str = ''.join([f'`{mutable[thread_index][2]}`: {obs}\n\n' 
-                            if not done else f'`{mutable[thread_index][2]}`\n\n' 
-                            for thread_index, done, obs in zip(range(len(worker_done)), worker_done, observe_win)])
-        chatbot[-1] = [chatbot[-1][0], f'多线程操作已经开始，完成情况: \n\n{stat_str}' + ''.join(['.']*(cnt % 10+1))]
-        msg = "正常"
-        yield from update_ui(chatbot=chatbot, history=[]) # 刷新界面
-    # 异步任务结束
-    gpt_response_collection = []
-    for inputs_show_user, f in zip(inputs_show_user_array, futures):
-        gpt_res = f.result()
-        gpt_response_collection.extend([inputs_show_user, gpt_res])
-
-    if show_user_at_complete:
-        for inputs_show_user, f in zip(inputs_show_user_array, futures):
-            gpt_res = f.result()
-            chatbot.append([inputs_show_user, gpt_res])
-            yield from update_ui(chatbot=chatbot, history=[]) # 刷新界面
-            time.sleep(1)
-    return gpt_response_collection
-
-
-def WithRetry(f):
-    """
-        装饰器函数，用于自动重试。
-    """
-    def decorated(retry, res_when_fail, *args, **kwargs):
-        assert retry >= 0
-        while True:
-            try:
-                res = yield from f(*args, **kwargs)
-                return res
-            except:
-                retry -= 1
-                if retry<0:
-                    print("达到最大重试次数")
-                    break
-                else:
-                    print("重试中……")
-                    continue
-        return res_when_fail
-    return decorated
-
-
-def breakdown_txt_to_satisfy_token_limit(txt, get_token_fn, limit):
-    def cut(txt_tocut, must_break_at_empty_line):  # 递归
-        if get_token_fn(txt_tocut) <= limit:
-            return [txt_tocut]
-        else:
-            lines = txt_tocut.split('\n')
-            estimated_line_cut = limit / get_token_fn(txt_tocut) * len(lines)
-            estimated_line_cut = int(estimated_line_cut)
-            for cnt in reversed(range(estimated_line_cut)):
-                if must_break_at_empty_line:
-                    if lines[cnt] != "":
-                        continue
-                print(cnt)
-                prev = "\n".join(lines[:cnt])
-                post = "\n".join(lines[cnt:])
-                if get_token_fn(prev) < limit:
-                    break
-            if cnt == 0:
-                print('what the fuck ?')
-                raise RuntimeError("存在一行极长的文本！")
-            # print(len(post))
-            # 列表递归接龙
-            result = [prev]
-            result.extend(cut(post, must_break_at_empty_line))
-            return result
-    try:
-        return cut(txt, must_break_at_empty_line=True)
-    except RuntimeError:
-        return cut(txt, must_break_at_empty_line=False)
-
-
-def breakdown_txt_to_satisfy_token_limit_for_pdf(txt, get_token_fn, limit):
-    def cut(txt_tocut, must_break_at_empty_line):  # 递归
-        if get_token_fn(txt_tocut) <= limit:
-            return [txt_tocut]
-        else:
-            lines = txt_tocut.split('\n')
-            estimated_line_cut = limit / get_token_fn(txt_tocut) * len(lines)
-            estimated_line_cut = int(estimated_line_cut)
-            cnt = 0
-            for cnt in reversed(range(estimated_line_cut)):
-                if must_break_at_empty_line:
-                    if lines[cnt] != "":
-                        continue
-                print(cnt)
-                prev = "\n".join(lines[:cnt])
-                post = "\n".join(lines[cnt:])
-                if get_token_fn(prev) < limit:
-                    break
-            if cnt == 0:
-                # print('what the fuck ? 存在一行极长的文本！')
-                raise RuntimeError("存在一行极长的文本！")
-            # print(len(post))
-            # 列表递归接龙
-            result = [prev]
-            result.extend(cut(post, must_break_at_empty_line))
-            return result
-    try:
-        return cut(txt, must_break_at_empty_line=True)
-    except RuntimeError:
-        try:
-            return cut(txt, must_break_at_empty_line=False)
-        except RuntimeError:
-            # 这个中文的句号是故意的，作为一个标识而存在
-            res = cut(txt.replace('.', '。\n'), must_break_at_empty_line=False)
-            return [r.replace('。\n', '.') for r in res]
diff --git a/spaces/RMXK/RVC_HFF/demucs/raw.py b/spaces/RMXK/RVC_HFF/demucs/raw.py
deleted file mode 100644
index d4941ad2d7ed858f490db441f5b46b12bd61ad78..0000000000000000000000000000000000000000
--- a/spaces/RMXK/RVC_HFF/demucs/raw.py
+++ /dev/null
@@ -1,173 +0,0 @@
-# Copyright (c) Facebook, Inc. and its affiliates.
-# All rights reserved.
-#
-# This source code is licensed under the license found in the
-# LICENSE file in the root directory of this source tree.
-
-import argparse
-import os
-from collections import defaultdict, namedtuple
-from pathlib import Path
-
-import musdb
-import numpy as np
-import torch as th
-import tqdm
-from torch.utils.data import DataLoader
-
-from .audio import AudioFile
-
-ChunkInfo = namedtuple("ChunkInfo", ["file_index", "offset", "local_index"])
-
-
-class Rawset:
-    """
-    Dataset of raw, normalized, float32 audio files
-    """
-    def __init__(self, path, samples=None, stride=None, channels=2, streams=None):
-        self.path = Path(path)
-        self.channels = channels
-        self.samples = samples
-        if stride is None:
-            stride = samples if samples is not None else 0
-        self.stride = stride
-        entries = defaultdict(list)
-        for root, folders, files in os.walk(self.path, followlinks=True):
-            folders.sort()
-            files.sort()
-            for file in files:
-                if file.endswith(".raw"):
-                    path = Path(root) / file
-                    name, stream = path.stem.rsplit('.', 1)
-                    entries[(path.parent.relative_to(self.path), name)].append(int(stream))
-
-        self._entries = list(entries.keys())
-
-        sizes = []
-        self._lengths = []
-        ref_streams = sorted(entries[self._entries[0]])
-        assert ref_streams == list(range(len(ref_streams)))
-        if streams is None:
-            self.streams = ref_streams
-        else:
-            self.streams = streams
-        for entry in sorted(entries.keys()):
-            streams = entries[entry]
-            assert sorted(streams) == ref_streams
-            file = self._path(*entry)
-            length = file.stat().st_size // (4 * channels)
-            if samples is None:
-                sizes.append(1)
-            else:
-                if length < samples:
-                    self._entries.remove(entry)
-                    continue
-                sizes.append((length - samples) // stride + 1)
-            self._lengths.append(length)
-        if not sizes:
-            raise ValueError(f"Empty dataset {self.path}")
-        self._cumulative_sizes = np.cumsum(sizes)
-        self._sizes = sizes
-
-    def __len__(self):
-        return self._cumulative_sizes[-1]
-
-    @property
-    def total_length(self):
-        return sum(self._lengths)
-
-    def chunk_info(self, index):
-        file_index = np.searchsorted(self._cumulative_sizes, index, side='right')
-        if file_index == 0:
-            local_index = index
-        else:
-            local_index = index - self._cumulative_sizes[file_index - 1]
-        return ChunkInfo(offset=local_index * self.stride,
-                         file_index=file_index,
-                         local_index=local_index)
-
-    def _path(self, folder, name, stream=0):
-        return self.path / folder / (name + f'.{stream}.raw')
-
-    def __getitem__(self, index):
-        chunk = self.chunk_info(index)
-        entry = self._entries[chunk.file_index]
-
-        length = self.samples or self._lengths[chunk.file_index]
-        streams = []
-        to_read = length * self.channels * 4
-        for stream_index, stream in enumerate(self.streams):
-            offset = chunk.offset * 4 * self.channels
-            file = open(self._path(*entry, stream=stream), 'rb')
-            file.seek(offset)
-            content = file.read(to_read)
-            assert len(content) == to_read
-            content = np.frombuffer(content, dtype=np.float32)
-            content = content.copy()  # make writable
-            streams.append(th.from_numpy(content).view(length, self.channels).t())
-        return th.stack(streams, dim=0)
-
-    def name(self, index):
-        chunk = self.chunk_info(index)
-        folder, name = self._entries[chunk.file_index]
-        return folder / name
-
-
-class MusDBSet:
-    def __init__(self, mus, streams=slice(None), samplerate=44100, channels=2):
-        self.mus = mus
-        self.streams = streams
-        self.samplerate = samplerate
-        self.channels = channels
-
-    def __len__(self):
-        return len(self.mus.tracks)
-
-    def __getitem__(self, index):
-        track = self.mus.tracks[index]
-        return (track.name, AudioFile(track.path).read(channels=self.channels,
-                                                       seek_time=0,
-                                                       streams=self.streams,
-                                                       samplerate=self.samplerate))
-
-
-def build_raw(mus, destination, normalize, workers, samplerate, channels):
-    destination.mkdir(parents=True, exist_ok=True)
-    loader = DataLoader(MusDBSet(mus, channels=channels, samplerate=samplerate),
-                        batch_size=1,
-                        num_workers=workers,
-                        collate_fn=lambda x: x[0])
-    for name, streams in tqdm.tqdm(loader):
-        if normalize:
-            ref = streams[0].mean(dim=0)  # use mono mixture as reference
-            streams = (streams - ref.mean()) / ref.std()
-        for index, stream in enumerate(streams):
-            open(destination / (name + f'.{index}.raw'), "wb").write(stream.t().numpy().tobytes())
-
-
-def main():
-    parser = argparse.ArgumentParser('rawset')
-    parser.add_argument('--workers', type=int, default=10)
-    parser.add_argument('--samplerate', type=int, default=44100)
-    parser.add_argument('--channels', type=int, default=2)
-    parser.add_argument('musdb', type=Path)
-    parser.add_argument('destination', type=Path)
-
-    args = parser.parse_args()
-
-    build_raw(musdb.DB(root=args.musdb, subsets=["train"], split="train"),
-              args.destination / "train",
-              normalize=True,
-              channels=args.channels,
-              samplerate=args.samplerate,
-              workers=args.workers)
-    build_raw(musdb.DB(root=args.musdb, subsets=["train"], split="valid"),
-              args.destination / "valid",
-              normalize=True,
-              samplerate=args.samplerate,
-              channels=args.channels,
-              workers=args.workers)
-
-
-if __name__ == "__main__":
-    main()
diff --git a/spaces/Realcat/image-matching-webui/third_party/TopicFM/scripts/reproduce_test/indoor.sh b/spaces/Realcat/image-matching-webui/third_party/TopicFM/scripts/reproduce_test/indoor.sh
deleted file mode 100644
index 76494f2e1734bfd3a2653ef3c96a557793b54f05..0000000000000000000000000000000000000000
--- a/spaces/Realcat/image-matching-webui/third_party/TopicFM/scripts/reproduce_test/indoor.sh
+++ /dev/null
@@ -1,29 +0,0 @@
-#!/bin/bash -l
-
-SCRIPTPATH=$(dirname $(readlink -f "$0"))
-PROJECT_DIR="${SCRIPTPATH}/../../"
-
-# conda activate loftr
-export PYTHONPATH=$PROJECT_DIR:$PYTHONPATH
-cd $PROJECT_DIR
-
-data_cfg_path="configs/data/scannet_test_1500.py"
-main_cfg_path="configs/model/indoor/model_cfg_test.py"
-ckpt_path="pretrained/model_best.ckpt"
-dump_dir="dump/loftr_ds_indoor"
-profiler_name="inference"
-n_nodes=1  # mannually keep this the same with --nodes
-n_gpus_per_node=-1
-torch_num_workers=4
-batch_size=1  # per gpu
-
-python -u ./test.py \
-    ${data_cfg_path} \
-    ${main_cfg_path} \
-    --ckpt_path=${ckpt_path} \
-    --dump_dir=${dump_dir} \
-    --gpus=${n_gpus_per_node} --num_nodes=${n_nodes} --accelerator="ddp" \
-    --batch_size=${batch_size} --num_workers=${torch_num_workers}\
-    --profiler_name=${profiler_name} \
-    --benchmark 
-    
diff --git a/spaces/Rebskii/rvc-models-test/config.py b/spaces/Rebskii/rvc-models-test/config.py
deleted file mode 100644
index c0c16e0017efbcaf250cb539a1d0edb4e83575e4..0000000000000000000000000000000000000000
--- a/spaces/Rebskii/rvc-models-test/config.py
+++ /dev/null
@@ -1,88 +0,0 @@
-########################硬件参数########################
-
-# 填写cuda:x, cpu 或 mps, x指代第几张卡，只支持 N卡 / Apple Silicon 加速
-device = "cuda:0"
-
-# 9-10-20-30-40系显卡无脑True，不影响质量，>=20显卡开启有加速
-is_half = True
-
-# 默认0用上所有线程，写数字限制CPU资源使用
-n_cpu = 0
-
-########################硬件参数########################
-
-
-##################下为参数处理逻辑，勿动##################
-
-########################命令行参数########################
-import argparse
-
-parser = argparse.ArgumentParser()
-parser.add_argument("--port", type=int, default=7865, help="Listen port")
-parser.add_argument("--pycmd", type=str, default="python", help="Python command")
-parser.add_argument("--colab", action="store_true", help="Launch in colab")
-parser.add_argument(
-    "--noparallel", action="store_true", help="Disable parallel processing"
-)
-parser.add_argument(
-    "--noautoopen", action="store_true", help="Do not open in browser automatically"
-)
-cmd_opts, unknown = parser.parse_known_args()
-
-python_cmd = cmd_opts.pycmd
-listen_port = cmd_opts.port
-iscolab = cmd_opts.colab
-noparallel = cmd_opts.noparallel
-noautoopen = cmd_opts.noautoopen
-########################命令行参数########################
-
-import sys
-import torch
-
-
-# has_mps is only available in nightly pytorch (for now) and MasOS 12.3+.
-# check `getattr` and try it for compatibility
-def has_mps() -> bool:
-    if sys.platform != "darwin":
-        return False
-    else:
-        if not getattr(torch, "has_mps", False):
-            return False
-        try:
-            torch.zeros(1).to(torch.device("mps"))
-            return True
-        except Exception:
-            return False
-
-
-if not torch.cuda.is_available():
-    if has_mps():
-        print("没有发现支持的N卡, 使用MPS进行推理")
-        device = "mps"
-    else:
-        print("没有发现支持的N卡, 使用CPU进行推理")
-        device = "cpu"
-        is_half = False
-
-if device not in ["cpu", "mps"]:
-    gpu_name = torch.cuda.get_device_name(int(device.split(":")[-1]))
-    if "16" in gpu_name or "MX" in gpu_name:
-        print("16系显卡/MX系显卡强制单精度")
-        is_half = False
-
-from multiprocessing import cpu_count
-
-if n_cpu == 0:
-    n_cpu = cpu_count()
-if is_half:
-    # 6G显存配置
-    x_pad = 3
-    x_query = 10
-    x_center = 60
-    x_max = 65
-else:
-    # 5G显存配置
-    x_pad = 1
-    x_query = 6
-    x_center = 38
-    x_max = 41
diff --git a/spaces/RichardMB1217/blip/data/flickr30k_dataset.py b/spaces/RichardMB1217/blip/data/flickr30k_dataset.py
deleted file mode 100644
index 018ab387014ddaf554c4d3184cfc0e2ba8b2d487..0000000000000000000000000000000000000000
--- a/spaces/RichardMB1217/blip/data/flickr30k_dataset.py
+++ /dev/null
@@ -1,93 +0,0 @@
-import os
-import json
-
-from torch.utils.data import Dataset
-from torchvision.datasets.utils import download_url
-
-from PIL import Image
-
-from data.utils import pre_caption
-
-class flickr30k_train(Dataset):
-    def __init__(self, transform, image_root, ann_root, max_words=30, prompt=''):        
-        '''
-        image_root (string): Root directory of images (e.g. flickr30k/)
-        ann_root (string): directory to store the annotation file
-        '''        
-        url = 'https://storage.googleapis.com/sfr-vision-language-research/datasets/flickr30k_train.json'
-        filename = 'flickr30k_train.json'
-
-        download_url(url,ann_root)
-        
-        self.annotation = json.load(open(os.path.join(ann_root,filename),'r'))
-        self.transform = transform
-        self.image_root = image_root
-        self.max_words = max_words      
-        self.prompt = prompt
-        
-        self.img_ids = {}  
-        n = 0
-        for ann in self.annotation:
-            img_id = ann['image_id']
-            if img_id not in self.img_ids.keys():
-                self.img_ids[img_id] = n
-                n += 1    
-        
-    def __len__(self):
-        return len(self.annotation)
-    
-    def __getitem__(self, index):    
-        
-        ann = self.annotation[index]
-        
-        image_path = os.path.join(self.image_root,ann['image'])        
-        image = Image.open(image_path).convert('RGB')   
-        image = self.transform(image)
-        
-        caption = self.prompt+pre_caption(ann['caption'], self.max_words) 
-
-        return image, caption, self.img_ids[ann['image_id']] 
-    
-    
-class flickr30k_retrieval_eval(Dataset):
-    def __init__(self, transform, image_root, ann_root, split, max_words=30):  
-        '''
-        image_root (string): Root directory of images (e.g. flickr30k/)
-        ann_root (string): directory to store the annotation file
-        split (string): val or test
-        '''
-        urls = {'val':'https://storage.googleapis.com/sfr-vision-language-research/datasets/flickr30k_val.json',
-                'test':'https://storage.googleapis.com/sfr-vision-language-research/datasets/flickr30k_test.json'}
-        filenames = {'val':'flickr30k_val.json','test':'flickr30k_test.json'}
-        
-        download_url(urls[split],ann_root)
-        
-        self.annotation = json.load(open(os.path.join(ann_root,filenames[split]),'r'))
-        self.transform = transform
-        self.image_root = image_root
-        
-        self.text = []
-        self.image = []
-        self.txt2img = {}
-        self.img2txt = {}
-        
-        txt_id = 0
-        for img_id, ann in enumerate(self.annotation):
-            self.image.append(ann['image'])
-            self.img2txt[img_id] = []
-            for i, caption in enumerate(ann['caption']):
-                self.text.append(pre_caption(caption,max_words))
-                self.img2txt[img_id].append(txt_id)
-                self.txt2img[txt_id] = img_id
-                txt_id += 1
-                                    
-    def __len__(self):
-        return len(self.annotation)
-    
-    def __getitem__(self, index):    
-        
-        image_path = os.path.join(self.image_root, self.annotation[index]['image'])        
-        image = Image.open(image_path).convert('RGB')    
-        image = self.transform(image)  
-
-        return image, index    
\ No newline at end of file
diff --git a/spaces/Riksarkivet/htr_demo/src/htr_pipeline/utils/xml_helper.py b/spaces/Riksarkivet/htr_demo/src/htr_pipeline/utils/xml_helper.py
deleted file mode 100644
index be2cb9a61a8e4f262bfbd0f753c50698e2fce659..0000000000000000000000000000000000000000
--- a/spaces/Riksarkivet/htr_demo/src/htr_pipeline/utils/xml_helper.py
+++ /dev/null
@@ -1,55 +0,0 @@
-import re
-from datetime import datetime
-
-import jinja2
-
-
-class XMLHelper:
-    def __init__(self, xml_file_name="page_xml.xml"):
-        self.xml_file_name = xml_file_name
-        self.searchpath = "./src/htr_pipeline/utils/templates"
-        self.template = "page_xml_2013.xml"
-
-    def render(self, template_data):
-        rendered_xml = self._render_xml(template_data)
-        return rendered_xml
-
-    def _transform_coords(self, input_string):
-        pattern = r"\[\s*([^\s,]+)\s*,\s*([^\s\]]+)\s*\]"
-        replacement = r"\1,\2"
-        return re.sub(pattern, replacement, input_string)
-
-    def _render_xml(self, template_data):
-        template_loader = jinja2.FileSystemLoader(searchpath=self.searchpath)
-        template_env = jinja2.Environment(loader=template_loader, trim_blocks=True)
-        template = template_env.get_template(self.template)
-        rendered_xml = template.render(template_data)
-        rendered_xml = self._transform_coords(rendered_xml)
-        return rendered_xml
-
-    def prepare_template_data(self, img_file_name, image):
-        img_height = image.shape[0]
-        img_width = image.shape[1]
-
-        now = datetime.now()
-        date_time = now.strftime("%Y-%m-%d, %H:%M:%S")
-        return {
-            "created": date_time,
-            "imageFilename": img_file_name,
-            "imageWidth": img_width,
-            "imageHeight": img_height,
-            "textRegions": list(),
-        }
-
-    def escape_xml_chars(self, textline):
-        return (
-            textline.replace("&", "&amp;")
-            .replace("<", "&lt;")
-            .replace(">", "&gt;")
-            .replace("'", "&apos;")
-            .replace('"', "&quot;")
-        )
-
-
-if __name__ == "__main__":
-    pass
diff --git a/spaces/Robert001/UniControl-Demo/annotator/uniformer/mmdet/core/bbox/match_costs/__init__.py b/spaces/Robert001/UniControl-Demo/annotator/uniformer/mmdet/core/bbox/match_costs/__init__.py
deleted file mode 100644
index add5e0d394034d89b2d47c314ff1938294deb6ea..0000000000000000000000000000000000000000
--- a/spaces/Robert001/UniControl-Demo/annotator/uniformer/mmdet/core/bbox/match_costs/__init__.py
+++ /dev/null
@@ -1,7 +0,0 @@
-from .builder import build_match_cost
-from .match_cost import BBoxL1Cost, ClassificationCost, FocalLossCost, IoUCost
-
-__all__ = [
-    'build_match_cost', 'ClassificationCost', 'BBoxL1Cost', 'IoUCost',
-    'FocalLossCost'
-]
diff --git a/spaces/Robert001/UniControl-Demo/annotator/uniformer/mmdet_null/models/utils/builder.py b/spaces/Robert001/UniControl-Demo/annotator/uniformer/mmdet_null/models/utils/builder.py
deleted file mode 100644
index f362d1c92ca9d4ed95a2b3d28d3e6baedd14e462..0000000000000000000000000000000000000000
--- a/spaces/Robert001/UniControl-Demo/annotator/uniformer/mmdet_null/models/utils/builder.py
+++ /dev/null
@@ -1,14 +0,0 @@
-from mmcv.utils import Registry, build_from_cfg
-
-TRANSFORMER = Registry('Transformer')
-POSITIONAL_ENCODING = Registry('Position encoding')
-
-
-def build_transformer(cfg, default_args=None):
-    """Builder for Transformer."""
-    return build_from_cfg(cfg, TRANSFORMER, default_args)
-
-
-def build_positional_encoding(cfg, default_args=None):
-    """Builder for Position Encoding."""
-    return build_from_cfg(cfg, POSITIONAL_ENCODING, default_args)
diff --git a/spaces/SIGGRAPH2022/StyleGAN-XL/model.py b/spaces/SIGGRAPH2022/StyleGAN-XL/model.py
deleted file mode 100644
index 2a70efd569f1d6e6bf4dba63395be5856a3e3c4e..0000000000000000000000000000000000000000
--- a/spaces/SIGGRAPH2022/StyleGAN-XL/model.py
+++ /dev/null
@@ -1,117 +0,0 @@
-from __future__ import annotations
-
-import pathlib
-import pickle
-import sys
-
-import numpy as np
-import torch
-import torch.nn as nn
-from huggingface_hub import hf_hub_download
-
-current_dir = pathlib.Path(__file__).parent
-submodule_dir = current_dir / 'stylegan_xl'
-sys.path.insert(0, submodule_dir.as_posix())
-
-
-class Model:
-
-    MODEL_NAMES = [
-        'imagenet16',
-        'imagenet32',
-        'imagenet64',
-        'imagenet128',
-        'cifar10',
-        'ffhq256',
-        'pokemon256',
-    ]
-
-    def __init__(self):
-        self.device = torch.device(
-            'cuda:0' if torch.cuda.is_available() else 'cpu')
-        self._download_all_models()
-        self.model_name = self.MODEL_NAMES[3]
-        self.model = self._load_model(self.model_name)
-
-    def _load_model(self, model_name: str) -> nn.Module:
-        path = hf_hub_download('public-data/StyleGAN-XL',
-                               f'models/{model_name}.pkl')
-        with open(path, 'rb') as f:
-            model = pickle.load(f)['G_ema']
-        model.eval()
-        model.to(self.device)
-        return model
-
-    def set_model(self, model_name: str) -> None:
-        if model_name == self.model_name:
-            return
-        self.model_name = model_name
-        self.model = self._load_model(model_name)
-
-    def _download_all_models(self):
-        for name in self.MODEL_NAMES:
-            self._load_model(name)
-
-    @staticmethod
-    def make_transform(translate: tuple[float, float],
-                       angle: float) -> np.ndarray:
-        mat = np.eye(3)
-        sin = np.sin(angle / 360 * np.pi * 2)
-        cos = np.cos(angle / 360 * np.pi * 2)
-        mat[0][0] = cos
-        mat[0][1] = sin
-        mat[0][2] = translate[0]
-        mat[1][0] = -sin
-        mat[1][1] = cos
-        mat[1][2] = translate[1]
-        return mat
-
-    def generate_z(self, seed: int) -> torch.Tensor:
-        seed = int(np.clip(seed, 0, np.iinfo(np.uint32).max))
-        z = np.random.RandomState(seed).randn(1, self.model.z_dim)
-        return torch.from_numpy(z).float().to(self.device)
-
-    def postprocess(self, tensor: torch.Tensor) -> np.ndarray:
-        tensor = (tensor.permute(0, 2, 3, 1) * 127.5 + 128).clamp(0, 255).to(
-            torch.uint8)
-        return tensor.cpu().numpy()
-
-    def make_label_tensor(self, class_index: int) -> torch.Tensor:
-        class_index = round(class_index)
-        class_index = min(max(0, class_index), self.model.c_dim - 1)
-        class_index = torch.tensor(class_index, dtype=torch.long)
-
-        label = torch.zeros([1, self.model.c_dim], device=self.device)
-        if class_index >= 0:
-            label[:, class_index] = 1
-        return label
-
-    def set_transform(self, tx: float, ty: float, angle: float) -> None:
-        mat = self.make_transform((tx, ty), angle)
-        mat = np.linalg.inv(mat)
-        self.model.synthesis.input.transform.copy_(torch.from_numpy(mat))
-
-    @torch.inference_mode()
-    def generate(self, z: torch.Tensor, label: torch.Tensor,
-                 truncation_psi: float) -> torch.Tensor:
-        return self.model(z, label, truncation_psi=truncation_psi)
-
-    def generate_image(self, seed: int, truncation_psi: float,
-                       class_index: int, tx: float, ty: float,
-                       angle: float) -> np.ndarray:
-        self.set_transform(tx, ty, angle)
-
-        z = self.generate_z(seed)
-        label = self.make_label_tensor(class_index)
-
-        out = self.generate(z, label, truncation_psi)
-        out = self.postprocess(out)
-        return out[0]
-
-    def set_model_and_generate_image(self, model_name: str, seed: int,
-                                     truncation_psi: float, class_index: int,
-                                     tx: float, ty: float,
-                                     angle: float) -> np.ndarray:
-        self.set_model(model_name)
-        return self.generate_image(seed, truncation_psi, class_index, tx, ty,
-                                   angle)
diff --git a/spaces/SIGGRAPH2022/Text2Human/Text2Human/ui/mouse_event.py b/spaces/SIGGRAPH2022/Text2Human/Text2Human/ui/mouse_event.py
deleted file mode 100644
index 87c5f85e0fde810bb72c0814352e30f475900d34..0000000000000000000000000000000000000000
--- a/spaces/SIGGRAPH2022/Text2Human/Text2Human/ui/mouse_event.py
+++ /dev/null
@@ -1,129 +0,0 @@
-# -*- coding: utf-8 -*-
-
-import numpy as np
-from PyQt5.QtCore import *
-from PyQt5.QtGui import *
-from PyQt5.QtWidgets import *
-
-color_list = [
-    QColor(0, 0, 0),
-    QColor(255, 250, 250),
-    QColor(220, 220, 220),
-    QColor(250, 235, 215),
-    QColor(255, 250, 205),
-    QColor(211, 211, 211),
-    QColor(70, 130, 180),
-    QColor(127, 255, 212),
-    QColor(0, 100, 0),
-    QColor(50, 205, 50),
-    QColor(255, 255, 0),
-    QColor(245, 222, 179),
-    QColor(255, 140, 0),
-    QColor(255, 0, 0),
-    QColor(16, 78, 139),
-    QColor(144, 238, 144),
-    QColor(50, 205, 174),
-    QColor(50, 155, 250),
-    QColor(160, 140, 88),
-    QColor(213, 140, 88),
-    QColor(90, 140, 90),
-    QColor(185, 210, 205),
-    QColor(130, 165, 180),
-    QColor(225, 141, 151)
-]
-
-
-class GraphicsScene(QGraphicsScene):
-
-    def __init__(self, mode, size, parent=None):
-        QGraphicsScene.__init__(self, parent)
-        self.mode = mode
-        self.size = size
-        self.mouse_clicked = False
-        self.prev_pt = None
-
-        # self.masked_image = None
-
-        # save the points
-        self.mask_points = []
-        for i in range(len(color_list)):
-            self.mask_points.append([])
-
-        # save the size of points
-        self.size_points = []
-        for i in range(len(color_list)):
-            self.size_points.append([])
-
-        # save the history of edit
-        self.history = []
-
-    def reset(self):
-        # save the points
-        self.mask_points = []
-        for i in range(len(color_list)):
-            self.mask_points.append([])
-        # save the size of points
-        self.size_points = []
-        for i in range(len(color_list)):
-            self.size_points.append([])
-        # save the history of edit
-        self.history = []
-
-        self.mode = 0
-        self.prev_pt = None
-
-    def mousePressEvent(self, event):
-        self.mouse_clicked = True
-
-    def mouseReleaseEvent(self, event):
-        self.prev_pt = None
-        self.mouse_clicked = False
-
-    def mouseMoveEvent(self, event):  # drawing
-        if self.mouse_clicked:
-            if self.prev_pt:
-                self.drawMask(self.prev_pt, event.scenePos(),
-                              color_list[self.mode], self.size)
-                pts = {}
-                pts['prev'] = (int(self.prev_pt.x()), int(self.prev_pt.y()))
-                pts['curr'] = (int(event.scenePos().x()),
-                               int(event.scenePos().y()))
-
-                self.size_points[self.mode].append(self.size)
-                self.mask_points[self.mode].append(pts)
-                self.history.append(self.mode)
-                self.prev_pt = event.scenePos()
-            else:
-                self.prev_pt = event.scenePos()
-
-    def drawMask(self, prev_pt, curr_pt, color, size):
-        lineItem = QGraphicsLineItem(QLineF(prev_pt, curr_pt))
-        lineItem.setPen(QPen(color, size, Qt.SolidLine))  # rect
-        self.addItem(lineItem)
-
-    def erase_prev_pt(self):
-        self.prev_pt = None
-
-    def reset_items(self):
-        for i in range(len(self.items())):
-            item = self.items()[0]
-            self.removeItem(item)
-
-    def undo(self):
-        if len(self.items()) > 1:
-            if len(self.items()) >= 9:
-                for i in range(8):
-                    item = self.items()[0]
-                    self.removeItem(item)
-                    if self.history[-1] == self.mode:
-                        self.mask_points[self.mode].pop()
-                        self.size_points[self.mode].pop()
-                        self.history.pop()
-            else:
-                for i in range(len(self.items()) - 1):
-                    item = self.items()[0]
-                    self.removeItem(item)
-                    if self.history[-1] == self.mode:
-                        self.mask_points[self.mode].pop()
-                        self.size_points[self.mode].pop()
-                        self.history.pop()
diff --git a/spaces/Sanchayt/VectaraBeginner/app.py b/spaces/Sanchayt/VectaraBeginner/app.py
deleted file mode 100644
index 734ff0634386b38949ecc586de95f705ed7a513b..0000000000000000000000000000000000000000
--- a/spaces/Sanchayt/VectaraBeginner/app.py
+++ /dev/null
@@ -1,107 +0,0 @@
-import os
-import tempfile
-import time
-
-import streamlit as st
-from dotenv import load_dotenv
-from langchain.callbacks.streaming_stdout import StreamingStdOutCallbackHandler
-from langchain.chat_models import ChatOpenAI
-from langchain.prompts import PromptTemplate
-from langchain.schema import StrOutputParser
-from langchain.vectorstores import Vectara
-
-# Load environment variables from .env file
-load_dotenv()
-
-# Sidebar for PDF upload and API keys
-with st.sidebar:
-    st.header("Configuration")
-    uploaded_file = st.file_uploader("Choose a PDF file", type=["pdf"])
-    customer_id = st.text_input("Vectara Customer ID", value=os.getenv("CUSTOMER_ID", ""))
-    api_key = st.text_input("Vectara API Key", value=os.getenv("API_KEY", ""))
-    corpus_id = st.text_input("Vectara Corpus ID", value=str(os.getenv("CORPUS_ID", "")))
-    openai_api_key = st.text_input("OpenAI API Key", value=os.getenv("OPENAI_API_KEY", ""))
-    submit_button = st.button("Submit")
-
-keys_provided = all([customer_id, api_key, corpus_id, openai_api_key])
-
-if keys_provided:
-    CUSTOMER_ID = customer_id
-    API_KEY = api_key
-    CORPUS_ID = int(corpus_id)
-    OPENAI_API_KEY = openai_api_key
-
-    vectara_client = Vectara(
-        vectara_customer_id=CUSTOMER_ID,
-        vectara_corpus_id=CORPUS_ID,
-        vectara_api_key=API_KEY
-    )
-
-    # Function to get knowledge content from Vectara
-    def get_knowledge_content(vectara, query, threshold=0.5):
-        found_docs = vectara.similarity_search_with_score(
-            query,
-            score_threshold=threshold,
-        )
-        knowledge_content = ""
-        for number, (score, doc) in enumerate(found_docs):
-            knowledge_content += f"Document {number}: {found_docs[number][0].page_content}\n"
-        return knowledge_content
-
-    # Prompt and response setup
-    prompt = PromptTemplate.from_template(
-        """You are a professional and friendly Legal Consultant and you are helping a client with a legal issue. The client is asking you for advice on a legal issue. Just explain him in detail the answer and nothing else. This is the issue: {issue} 
-        To assist him with his issue, you need to know the following information: {knowledge} 
-        """
-    )
-    runnable = prompt | ChatOpenAI(streaming=True, callbacks=[StreamingStdOutCallbackHandler()], openai_api_key=OPENAI_API_KEY) | StrOutputParser()
-
-    # Main Streamlit App
-    st.title("Legal Consultation Chat")
-
-    # Initialize chat history
-    if "messages" not in st.session_state:
-        st.session_state.messages = []
-
-    # Display chat messages from history on app rerun
-    for message in st.session_state.messages:
-        with st.chat_message(message["role"]):
-            st.markdown(message["content"])
-
-    # Accept user input and run the main chat interaction
-    if user_input := st.chat_input("Enter your issue:"):
-        st.session_state.messages.append({"role": "user", "content": user_input})
-        with st.chat_message("user"):
-            st.markdown(user_input)
-
-        knowledge_content = get_knowledge_content(vectara_client, user_input)
-        response = runnable.invoke({"knowledge": knowledge_content, "issue": user_input})
-
-        response_words = response.split()
-        with st.chat_message("assistant"):
-            message_placeholder = st.empty()
-            full_response = ""
-            for word in response_words:
-                full_response += word + " "
-                time.sleep(0.05)
-                message_placeholder.markdown(full_response + "▌")
-            message_placeholder.markdown(full_response)
-
-        st.session_state.messages.append({"role": "assistant", "content": full_response})
-
-    # Run when the submit button is pressed
-    if submit_button and uploaded_file:
-        with tempfile.NamedTemporaryFile(delete=False, suffix=".pdf") as tmpfile:
-            tmpfile.write(uploaded_file.getvalue())
-            tmp_filename = tmpfile.name
-
-        try:
-            vectara_client.add_files([tmp_filename])
-            st.sidebar.success("PDF file successfully uploaded to Vectara!")
-        except Exception as e:
-            st.sidebar.error(f"An error occurred: {str(e)}")
-        finally:
-            os.remove(tmp_filename)  # Clean up temporary file
-else:
-    # Not all keys are provided, instruct the user to input them
-    st.warning("Please input all required API keys in the sidebar to proceed.")
\ No newline at end of file
diff --git a/spaces/Sapphire-356/Video2MC/joints_detectors/Alphapose/yolo/detect.py b/spaces/Sapphire-356/Video2MC/joints_detectors/Alphapose/yolo/detect.py
deleted file mode 100644
index ba77602dce8c0e80ea076cba281a39e36e6735e8..0000000000000000000000000000000000000000
--- a/spaces/Sapphire-356/Video2MC/joints_detectors/Alphapose/yolo/detect.py
+++ /dev/null
@@ -1,103 +0,0 @@
-from __future__ import division
-import time
-import torch 
-import torch.nn as nn
-from torch.autograd import Variable
-import numpy as np
-import cv2 
-from .util import *
-import argparse
-import os 
-import os.path as osp
-from .darknet import Darknet
-from .preprocess import prep_image, inp_to_image
-import pandas as pd
-import random 
-import pickle as pkl
-import itertools
-
-
-if __name__ == '__main__':
-
-    scales = "1,2,3"
-    images = "imgs/messi.jpg"
-    batch_size = 1
-    confidence = 0.5
-    nms_thesh = 0.4
-
-    CUDA = torch.cuda.is_available()
-
-    num_classes = 80
-    classes = load_classes('data/coco.names') 
-
-    #Set up the neural network
-    print("Loading network.....")
-    model = Darknet("cfg/yolov3-spp.cfg")
-    model.load_weights("yolov3-spp.weights")
-    print("Network successfully loaded")
-
-    model.net_info["height"] = "608"
-    inp_dim = int(model.net_info["height"])
-    assert inp_dim % 32 == 0
-    assert inp_dim > 32
-
-    #If there's a GPU availible, put the model on GPU
-    if CUDA:
-        model
-
-    #Set the model in evaluation mode
-    model.eval()
-
-    #Detection phase
-    try:
-        imlist = []
-        imlist.append(osp.join(osp.realpath('.'), images))
-    except FileNotFoundError:
-        print ("No file or directory with the name {}".format(images))
-        exit()
-
-    batches = list(map(prep_image, imlist, [inp_dim for x in range(len(imlist))]))
-    im_batches = [x[0] for x in batches]
-    orig_ims = [x[1] for x in batches]
-    im_dim_list = [x[2] for x in batches]
-    im_dim_list = torch.FloatTensor(im_dim_list).repeat(1, 2)
-
-    if CUDA:
-        im_dim_list = im_dim_list
-
-
-    for batch in im_batches:
-        #load the image
-        if CUDA:
-            batch = batch
-        with torch.no_grad():
-            prediction = model(Variable(batch), CUDA)
-
-        prediction = write_results(prediction, confidence, num_classes, nms=True, nms_conf=nms_thesh)
-        output = prediction
-
-        if CUDA:
-            torch.cuda.synchronize()
-
-    try:
-        output
-    except NameError:
-        print("No detections were made")
-        exit()
-    print(im_dim_list.shape)
-    im_dim_list = torch.index_select(im_dim_list, 0, output[:,0].long())
-
-    scaling_factor = torch.min(inp_dim/im_dim_list,1)[0].view(-1,1)
-
-
-    output[:,[1,3]] -= (inp_dim - scaling_factor*im_dim_list[:,0].view(-1,1))/2
-    output[:,[2,4]] -= (inp_dim - scaling_factor*im_dim_list[:,1].view(-1,1))/2
-
-    output[:,1:5] /= scaling_factor
-
-    for i in range(output.shape[0]):
-        output[i, [1,3]] = torch.clamp(output[i, [1,3]], 0.0, im_dim_list[i,0])
-        output[i, [2,4]] = torch.clamp(output[i, [2,4]], 0.0, im_dim_list[i,1])
-
-    print(output)
-    print(output.shape)
diff --git a/spaces/SaulLu/test-demo/_site/about/index.html b/spaces/SaulLu/test-demo/_site/about/index.html
deleted file mode 100644
index 2be570fcdf9c3d76a02bf959eff0ade05a438645..0000000000000000000000000000000000000000
--- a/spaces/SaulLu/test-demo/_site/about/index.html
+++ /dev/null
@@ -1,87 +0,0 @@
-<!DOCTYPE html>
-<html lang="en"><head>
-  <meta charset="utf-8">
-  <meta http-equiv="X-UA-Compatible" content="IE=edge">
-  <meta name="viewport" content="width=device-width, initial-scale=1"><!-- Begin Jekyll SEO tag v2.7.1 -->
-<title>About | Your awesome title</title>
-<meta name="generator" content="Jekyll v3.9.0" />
-<meta property="og:title" content="About" />
-<meta property="og:locale" content="en_US" />
-<meta name="description" content="Write an awesome description for your new site here. You can edit this line in _config.yml. It will appear in your document head meta (for Google search results) and in your feed.xml site description." />
-<meta property="og:description" content="Write an awesome description for your new site here. You can edit this line in _config.yml. It will appear in your document head meta (for Google search results) and in your feed.xml site description." />
-<link rel="canonical" href="http://localhost:4000/about/" />
-<meta property="og:url" content="http://localhost:4000/about/" />
-<meta property="og:site_name" content="Your awesome title" />
-<meta name="twitter:card" content="summary" />
-<meta property="twitter:title" content="About" />
-<script type="application/ld+json">
-{"@type":"WebSite","headline":"About","url":"http://localhost:4000/about/","description":"Write an awesome description for your new site here. You can edit this line in _config.yml. It will appear in your document head meta (for Google search results) and in your feed.xml site description.","name":"Your awesome title","@context":"https://schema.org"}</script>
-<!-- End Jekyll SEO tag -->
-<link rel="stylesheet" href="/assets/main.css"><link type="application/atom+xml" rel="alternate" href="http://localhost:4000/feed.xml" title="Your awesome title" /></head>
-<body><header class="site-header" role="banner">
-
-  <div class="wrapper"><a class="site-title" rel="author" href="/">Your awesome title</a><nav class="site-nav">
-        <input type="checkbox" id="nav-trigger" class="nav-trigger" />
-        <label for="nav-trigger">
-          <span class="menu-icon">
-            <svg viewBox="0 0 18 15" width="18px" height="15px">
-              <path d="M18,1.484c0,0.82-0.665,1.484-1.484,1.484H1.484C0.665,2.969,0,2.304,0,1.484l0,0C0,0.665,0.665,0,1.484,0 h15.032C17.335,0,18,0.665,18,1.484L18,1.484z M18,7.516C18,8.335,17.335,9,16.516,9H1.484C0.665,9,0,8.335,0,7.516l0,0 c0-0.82,0.665-1.484,1.484-1.484h15.032C17.335,6.031,18,6.696,18,7.516L18,7.516z M18,13.516C18,14.335,17.335,15,16.516,15H1.484 C0.665,15,0,14.335,0,13.516l0,0c0-0.82,0.665-1.483,1.484-1.483h15.032C17.335,12.031,18,12.695,18,13.516L18,13.516z"/>
-            </svg>
-          </span>
-        </label>
-
-        <div class="trigger"><a class="page-link" href="/about/">About</a><a class="page-link" href="/large-scale-demo/">Large scale demo</a><a class="page-link" href="/main-training/">Main training</a></div>
-      </nav></div>
-</header>
-<main class="page-content" aria-label="Content">
-      <div class="wrapper">
-        <article class="post">
-
-  <header class="post-header">
-    <h1 class="post-title">About</h1>
-  </header>
-
-  <div class="post-content">
-    <p>This is the base Jekyll theme. You can find out more info about customizing your Jekyll theme, as well as basic Jekyll usage documentation at <a href="https://jekyllrb.com/">jekyllrb.com</a></p>
-
-<p>You can find the source code for Minima at GitHub:
-<a href="https://github.com/jekyll">jekyll</a> /
-<a href="https://github.com/jekyll/minima">minima</a></p>
-
-<p>You can find the source code for Jekyll at GitHub:
-<a href="https://github.com/jekyll">jekyll</a> /
-<a href="https://github.com/jekyll/jekyll">jekyll</a></p>
-
-
-  </div>
-
-</article>
-
-      </div>
-    </main><footer class="site-footer h-card">
-  <data class="u-url" href="/"></data>
-
-  <div class="wrapper">
-
-    <h2 class="footer-heading">Your awesome title</h2>
-
-    <div class="footer-col-wrapper">
-      <div class="footer-col footer-col-1">
-        <ul class="contact-list">
-          <li class="p-name">Your awesome title</li><li><a class="u-email" href="mailto:your-email@example.com">your-email@example.com</a></li></ul>
-      </div>
-
-      <div class="footer-col footer-col-2"><ul class="social-media-list"><li><a href="https://github.com/jekyll"><svg class="svg-icon"><use xlink:href="/assets/minima-social-icons.svg#github"></use></svg> <span class="username">jekyll</span></a></li><li><a href="https://www.twitter.com/jekyllrb"><svg class="svg-icon"><use xlink:href="/assets/minima-social-icons.svg#twitter"></use></svg> <span class="username">jekyllrb</span></a></li></ul>
-</div>
-
-      <div class="footer-col footer-col-3">
-        <p>Write an awesome description for your new site here. You can edit this line in _config.yml. It will appear in your document head meta (for Google search results) and in your feed.xml site description.</p>
-      </div>
-    </div>
-
-  </div>
-
-</footer>
-</body>
-
-</html>
diff --git a/spaces/SeViLA/SeViLA/lavis/models/alpro_models/alpro_outputs.py b/spaces/SeViLA/SeViLA/lavis/models/alpro_models/alpro_outputs.py
deleted file mode 100644
index 68a11a9cfbd95c866597cf0e8d5a126134587de6..0000000000000000000000000000000000000000
--- a/spaces/SeViLA/SeViLA/lavis/models/alpro_models/alpro_outputs.py
+++ /dev/null
@@ -1,59 +0,0 @@
-"""
- Copyright (c) 2022, salesforce.com, inc.
- All rights reserved.
- SPDX-License-Identifier: BSD-3-Clause
- For full license text, see the LICENSE file in the repo root or https://opensource.org/licenses/BSD-3-Clause
-"""
-
-from dataclasses import dataclass
-from typing import Optional
-
-import torch
-from transformers.modeling_outputs import (
-    BaseModelOutputWithPoolingAndCrossAttentions,
-    ModelOutput,
-)
-
-
-@dataclass
-class AlproSimilarity(ModelOutput):
-    sim_v2t: torch.FloatTensor = None
-    sim_t2v: torch.FloatTensor = None
-
-    sim_v2t_targets: Optional[torch.FloatTensor] = None
-    sim_t2v_targets: Optional[torch.FloatTensor] = None
-
-
-@dataclass
-class AlproIntermediateOutput(ModelOutput):
-    # uni-modal features
-    video_embeds: torch.FloatTensor = None
-    text_embeds: Optional[torch.FloatTensor] = None
-
-    # intermediate outputs of multimodal encoder
-    encoder_output: Optional[BaseModelOutputWithPoolingAndCrossAttentions] = None
-    encoder_output_neg: Optional[BaseModelOutputWithPoolingAndCrossAttentions] = None
-
-    vtm_logits: Optional[torch.FloatTensor] = None
-    vtm_labels: Optional[torch.LongTensor] = None
-
-
-@dataclass
-class AlproOutput(ModelOutput):
-    # some finetuned models (e.g. BlipVQA) do not compute similarity, thus optional.
-    sims: Optional[AlproSimilarity] = None
-
-    intermediate_output: AlproIntermediateOutput = None
-
-    loss: Optional[torch.FloatTensor] = None
-
-    loss_vtc: Optional[torch.FloatTensor] = None
-
-    loss_vtm: Optional[torch.FloatTensor] = None
-
-    loss_mlm: Optional[torch.FloatTensor] = None
-
-
-@dataclass
-class AlproOutputWithLogits(AlproOutput):
-    logits: torch.FloatTensor = None
diff --git a/spaces/SeViLA/SeViLA/lavis/processors/functional_video.py b/spaces/SeViLA/SeViLA/lavis/processors/functional_video.py
deleted file mode 100644
index 597a29315d4e1a575e7209edb0618eeaf4fc024a..0000000000000000000000000000000000000000
--- a/spaces/SeViLA/SeViLA/lavis/processors/functional_video.py
+++ /dev/null
@@ -1,121 +0,0 @@
-"""
- Copyright (c) 2022, salesforce.com, inc.
- All rights reserved.
- SPDX-License-Identifier: BSD-3-Clause
- For full license text, see the LICENSE file in the repo root or https://opensource.org/licenses/BSD-3-Clause
-"""
-
-import warnings
-
-import torch
-
-
-def _is_tensor_video_clip(clip):
-    if not torch.is_tensor(clip):
-        raise TypeError("clip should be Tensor. Got %s" % type(clip))
-
-    if not clip.ndimension() == 4:
-        raise ValueError("clip should be 4D. Got %dD" % clip.dim())
-
-    return True
-
-
-def crop(clip, i, j, h, w):
-    """
-    Args:
-        clip (torch.tensor): Video clip to be cropped. Size is (C, T, H, W)
-    """
-    if len(clip.size()) != 4:
-        raise ValueError("clip should be a 4D tensor")
-    return clip[..., i : i + h, j : j + w]
-
-
-def resize(clip, target_size, interpolation_mode):
-    if len(target_size) != 2:
-        raise ValueError(
-            f"target size should be tuple (height, width), instead got {target_size}"
-        )
-    return torch.nn.functional.interpolate(
-        clip, size=target_size, mode=interpolation_mode, align_corners=False
-    )
-
-
-def resized_crop(clip, i, j, h, w, size, interpolation_mode="bilinear"):
-    """
-    Do spatial cropping and resizing to the video clip
-    Args:
-        clip (torch.tensor): Video clip to be cropped. Size is (C, T, H, W)
-        i (int): i in (i,j) i.e coordinates of the upper left corner.
-        j (int): j in (i,j) i.e coordinates of the upper left corner.
-        h (int): Height of the cropped region.
-        w (int): Width of the cropped region.
-        size (tuple(int, int)): height and width of resized clip
-    Returns:
-        clip (torch.tensor): Resized and cropped clip. Size is (C, T, H, W)
-    """
-    if not _is_tensor_video_clip(clip):
-        raise ValueError("clip should be a 4D torch.tensor")
-    clip = crop(clip, i, j, h, w)
-    clip = resize(clip, size, interpolation_mode)
-    return clip
-
-
-def center_crop(clip, crop_size):
-    if not _is_tensor_video_clip(clip):
-        raise ValueError("clip should be a 4D torch.tensor")
-    h, w = clip.size(-2), clip.size(-1)
-    th, tw = crop_size
-    if h < th or w < tw:
-        raise ValueError("height and width must be no smaller than crop_size")
-
-    i = int(round((h - th) / 2.0))
-    j = int(round((w - tw) / 2.0))
-    return crop(clip, i, j, th, tw)
-
-
-def to_tensor(clip):
-    """
-    Convert tensor data type from uint8 to float, divide value by 255.0 and
-    permute the dimensions of clip tensor
-    Args:
-        clip (torch.tensor, dtype=torch.uint8): Size is (T, H, W, C)
-    Return:
-        clip (torch.tensor, dtype=torch.float): Size is (C, T, H, W)
-    """
-    _is_tensor_video_clip(clip)
-    if not clip.dtype == torch.uint8:
-        raise TypeError(
-            "clip tensor should have data type uint8. Got %s" % str(clip.dtype)
-        )
-    return clip.float().permute(3, 0, 1, 2) / 255.0
-
-
-def normalize(clip, mean, std, inplace=False):
-    """
-    Args:
-        clip (torch.tensor): Video clip to be normalized. Size is (C, T, H, W)
-        mean (tuple): pixel RGB mean. Size is (3)
-        std (tuple): pixel standard deviation. Size is (3)
-    Returns:
-        normalized clip (torch.tensor): Size is (C, T, H, W)
-    """
-    if not _is_tensor_video_clip(clip):
-        raise ValueError("clip should be a 4D torch.tensor")
-    if not inplace:
-        clip = clip.clone()
-    mean = torch.as_tensor(mean, dtype=clip.dtype, device=clip.device)
-    std = torch.as_tensor(std, dtype=clip.dtype, device=clip.device)
-    clip.sub_(mean[:, None, None, None]).div_(std[:, None, None, None])
-    return clip
-
-
-def hflip(clip):
-    """
-    Args:
-        clip (torch.tensor): Video clip to be normalized. Size is (C, T, H, W)
-    Returns:
-        flipped clip (torch.tensor): Size is (C, T, H, W)
-    """
-    if not _is_tensor_video_clip(clip):
-        raise ValueError("clip should be a 4D torch.tensor")
-    return clip.flip(-1)
diff --git a/spaces/ServerX/PorcoDiaz/diffq/__init__.py b/spaces/ServerX/PorcoDiaz/diffq/__init__.py
deleted file mode 100644
index 2b997ee4ed99a90cc43db7812383927e6fe1a3e8..0000000000000000000000000000000000000000
--- a/spaces/ServerX/PorcoDiaz/diffq/__init__.py
+++ /dev/null
@@ -1,18 +0,0 @@
-# Copyright (c) Facebook, Inc. and its affiliates.
-# All rights reserved.
-#
-# This source code is licensed under the license found in the
-# LICENSE file in the root directory of this source tree.
-
-# flake8: noqa
-"""
-This package implements different quantization strategies:
-
-- `diffq.uniform.UniformQuantizer`: classic uniform quantization over n bits.
-- `diffq.diffq.DiffQuantizer`: differentiable quantizer based on scaled noise injection.
-
-Also, do check `diffq.base.BaseQuantizer` for the common methods of all Quantizers.
-"""
-
-from .uniform import UniformQuantizer
-from .diffq import DiffQuantizer
diff --git a/spaces/ServerX/PorcoDiaz/infer/lib/uvr5_pack/lib_v5/dataset.py b/spaces/ServerX/PorcoDiaz/infer/lib/uvr5_pack/lib_v5/dataset.py
deleted file mode 100644
index cfd01a174978d97180a897e40cb59ecadec1d12e..0000000000000000000000000000000000000000
--- a/spaces/ServerX/PorcoDiaz/infer/lib/uvr5_pack/lib_v5/dataset.py
+++ /dev/null
@@ -1,183 +0,0 @@
-import os
-import random
-
-import numpy as np
-import torch
-import torch.utils.data
-from tqdm import tqdm
-
-from . import spec_utils
-
-
-class VocalRemoverValidationSet(torch.utils.data.Dataset):
-    def __init__(self, patch_list):
-        self.patch_list = patch_list
-
-    def __len__(self):
-        return len(self.patch_list)
-
-    def __getitem__(self, idx):
-        path = self.patch_list[idx]
-        data = np.load(path)
-
-        X, y = data["X"], data["y"]
-
-        X_mag = np.abs(X)
-        y_mag = np.abs(y)
-
-        return X_mag, y_mag
-
-
-def make_pair(mix_dir, inst_dir):
-    input_exts = [".wav", ".m4a", ".mp3", ".mp4", ".flac"]
-
-    X_list = sorted(
-        [
-            os.path.join(mix_dir, fname)
-            for fname in os.listdir(mix_dir)
-            if os.path.splitext(fname)[1] in input_exts
-        ]
-    )
-    y_list = sorted(
-        [
-            os.path.join(inst_dir, fname)
-            for fname in os.listdir(inst_dir)
-            if os.path.splitext(fname)[1] in input_exts
-        ]
-    )
-
-    filelist = list(zip(X_list, y_list))
-
-    return filelist
-
-
-def train_val_split(dataset_dir, split_mode, val_rate, val_filelist):
-    if split_mode == "random":
-        filelist = make_pair(
-            os.path.join(dataset_dir, "mixtures"),
-            os.path.join(dataset_dir, "instruments"),
-        )
-
-        random.shuffle(filelist)
-
-        if len(val_filelist) == 0:
-            val_size = int(len(filelist) * val_rate)
-            train_filelist = filelist[:-val_size]
-            val_filelist = filelist[-val_size:]
-        else:
-            train_filelist = [
-                pair for pair in filelist if list(pair) not in val_filelist
-            ]
-    elif split_mode == "subdirs":
-        if len(val_filelist) != 0:
-            raise ValueError(
-                "The `val_filelist` option is not available in `subdirs` mode"
-            )
-
-        train_filelist = make_pair(
-            os.path.join(dataset_dir, "training/mixtures"),
-            os.path.join(dataset_dir, "training/instruments"),
-        )
-
-        val_filelist = make_pair(
-            os.path.join(dataset_dir, "validation/mixtures"),
-            os.path.join(dataset_dir, "validation/instruments"),
-        )
-
-    return train_filelist, val_filelist
-
-
-def augment(X, y, reduction_rate, reduction_mask, mixup_rate, mixup_alpha):
-    perm = np.random.permutation(len(X))
-    for i, idx in enumerate(tqdm(perm)):
-        if np.random.uniform() < reduction_rate:
-            y[idx] = spec_utils.reduce_vocal_aggressively(
-                X[idx], y[idx], reduction_mask
-            )
-
-        if np.random.uniform() < 0.5:
-            # swap channel
-            X[idx] = X[idx, ::-1]
-            y[idx] = y[idx, ::-1]
-        if np.random.uniform() < 0.02:
-            # mono
-            X[idx] = X[idx].mean(axis=0, keepdims=True)
-            y[idx] = y[idx].mean(axis=0, keepdims=True)
-        if np.random.uniform() < 0.02:
-            # inst
-            X[idx] = y[idx]
-
-        if np.random.uniform() < mixup_rate and i < len(perm) - 1:
-            lam = np.random.beta(mixup_alpha, mixup_alpha)
-            X[idx] = lam * X[idx] + (1 - lam) * X[perm[i + 1]]
-            y[idx] = lam * y[idx] + (1 - lam) * y[perm[i + 1]]
-
-    return X, y
-
-
-def make_padding(width, cropsize, offset):
-    left = offset
-    roi_size = cropsize - left * 2
-    if roi_size == 0:
-        roi_size = cropsize
-    right = roi_size - (width % roi_size) + left
-
-    return left, right, roi_size
-
-
-def make_training_set(filelist, cropsize, patches, sr, hop_length, n_fft, offset):
-    len_dataset = patches * len(filelist)
-
-    X_dataset = np.zeros((len_dataset, 2, n_fft // 2 + 1, cropsize), dtype=np.complex64)
-    y_dataset = np.zeros((len_dataset, 2, n_fft // 2 + 1, cropsize), dtype=np.complex64)
-
-    for i, (X_path, y_path) in enumerate(tqdm(filelist)):
-        X, y = spec_utils.cache_or_load(X_path, y_path, sr, hop_length, n_fft)
-        coef = np.max([np.abs(X).max(), np.abs(y).max()])
-        X, y = X / coef, y / coef
-
-        l, r, roi_size = make_padding(X.shape[2], cropsize, offset)
-        X_pad = np.pad(X, ((0, 0), (0, 0), (l, r)), mode="constant")
-        y_pad = np.pad(y, ((0, 0), (0, 0), (l, r)), mode="constant")
-
-        starts = np.random.randint(0, X_pad.shape[2] - cropsize, patches)
-        ends = starts + cropsize
-        for j in range(patches):
-            idx = i * patches + j
-            X_dataset[idx] = X_pad[:, :, starts[j] : ends[j]]
-            y_dataset[idx] = y_pad[:, :, starts[j] : ends[j]]
-
-    return X_dataset, y_dataset
-
-
-def make_validation_set(filelist, cropsize, sr, hop_length, n_fft, offset):
-    patch_list = []
-    patch_dir = "cs{}_sr{}_hl{}_nf{}_of{}".format(
-        cropsize, sr, hop_length, n_fft, offset
-    )
-    os.makedirs(patch_dir, exist_ok=True)
-
-    for i, (X_path, y_path) in enumerate(tqdm(filelist)):
-        basename = os.path.splitext(os.path.basename(X_path))[0]
-
-        X, y = spec_utils.cache_or_load(X_path, y_path, sr, hop_length, n_fft)
-        coef = np.max([np.abs(X).max(), np.abs(y).max()])
-        X, y = X / coef, y / coef
-
-        l, r, roi_size = make_padding(X.shape[2], cropsize, offset)
-        X_pad = np.pad(X, ((0, 0), (0, 0), (l, r)), mode="constant")
-        y_pad = np.pad(y, ((0, 0), (0, 0), (l, r)), mode="constant")
-
-        len_dataset = int(np.ceil(X.shape[2] / roi_size))
-        for j in range(len_dataset):
-            outpath = os.path.join(patch_dir, "{}_p{}.npz".format(basename, j))
-            start = j * roi_size
-            if not os.path.exists(outpath):
-                np.savez(
-                    outpath,
-                    X=X_pad[:, :, start : start + cropsize],
-                    y=y_pad[:, :, start : start + cropsize],
-                )
-            patch_list.append(outpath)
-
-    return VocalRemoverValidationSet(patch_list)
diff --git a/spaces/ServerX/PorcoDiaz/infer/lib/uvr5_pack/lib_v5/nets_123821KB.py b/spaces/ServerX/PorcoDiaz/infer/lib/uvr5_pack/lib_v5/nets_123821KB.py
deleted file mode 100644
index 167d4cb2198863cf43e93440f7e63c5342fc7605..0000000000000000000000000000000000000000
--- a/spaces/ServerX/PorcoDiaz/infer/lib/uvr5_pack/lib_v5/nets_123821KB.py
+++ /dev/null
@@ -1,122 +0,0 @@
-import torch
-import torch.nn.functional as F
-from torch import nn
-
-from . import layers_123821KB as layers
-
-
-class BaseASPPNet(nn.Module):
-    def __init__(self, nin, ch, dilations=(4, 8, 16)):
-        super(BaseASPPNet, self).__init__()
-        self.enc1 = layers.Encoder(nin, ch, 3, 2, 1)
-        self.enc2 = layers.Encoder(ch, ch * 2, 3, 2, 1)
-        self.enc3 = layers.Encoder(ch * 2, ch * 4, 3, 2, 1)
-        self.enc4 = layers.Encoder(ch * 4, ch * 8, 3, 2, 1)
-
-        self.aspp = layers.ASPPModule(ch * 8, ch * 16, dilations)
-
-        self.dec4 = layers.Decoder(ch * (8 + 16), ch * 8, 3, 1, 1)
-        self.dec3 = layers.Decoder(ch * (4 + 8), ch * 4, 3, 1, 1)
-        self.dec2 = layers.Decoder(ch * (2 + 4), ch * 2, 3, 1, 1)
-        self.dec1 = layers.Decoder(ch * (1 + 2), ch, 3, 1, 1)
-
-    def __call__(self, x):
-        h, e1 = self.enc1(x)
-        h, e2 = self.enc2(h)
-        h, e3 = self.enc3(h)
-        h, e4 = self.enc4(h)
-
-        h = self.aspp(h)
-
-        h = self.dec4(h, e4)
-        h = self.dec3(h, e3)
-        h = self.dec2(h, e2)
-        h = self.dec1(h, e1)
-
-        return h
-
-
-class CascadedASPPNet(nn.Module):
-    def __init__(self, n_fft):
-        super(CascadedASPPNet, self).__init__()
-        self.stg1_low_band_net = BaseASPPNet(2, 32)
-        self.stg1_high_band_net = BaseASPPNet(2, 32)
-
-        self.stg2_bridge = layers.Conv2DBNActiv(34, 16, 1, 1, 0)
-        self.stg2_full_band_net = BaseASPPNet(16, 32)
-
-        self.stg3_bridge = layers.Conv2DBNActiv(66, 32, 1, 1, 0)
-        self.stg3_full_band_net = BaseASPPNet(32, 64)
-
-        self.out = nn.Conv2d(64, 2, 1, bias=False)
-        self.aux1_out = nn.Conv2d(32, 2, 1, bias=False)
-        self.aux2_out = nn.Conv2d(32, 2, 1, bias=False)
-
-        self.max_bin = n_fft // 2
-        self.output_bin = n_fft // 2 + 1
-
-        self.offset = 128
-
-    def forward(self, x, aggressiveness=None):
-        mix = x.detach()
-        x = x.clone()
-
-        x = x[:, :, : self.max_bin]
-
-        bandw = x.size()[2] // 2
-        aux1 = torch.cat(
-            [
-                self.stg1_low_band_net(x[:, :, :bandw]),
-                self.stg1_high_band_net(x[:, :, bandw:]),
-            ],
-            dim=2,
-        )
-
-        h = torch.cat([x, aux1], dim=1)
-        aux2 = self.stg2_full_band_net(self.stg2_bridge(h))
-
-        h = torch.cat([x, aux1, aux2], dim=1)
-        h = self.stg3_full_band_net(self.stg3_bridge(h))
-
-        mask = torch.sigmoid(self.out(h))
-        mask = F.pad(
-            input=mask,
-            pad=(0, 0, 0, self.output_bin - mask.size()[2]),
-            mode="replicate",
-        )
-
-        if self.training:
-            aux1 = torch.sigmoid(self.aux1_out(aux1))
-            aux1 = F.pad(
-                input=aux1,
-                pad=(0, 0, 0, self.output_bin - aux1.size()[2]),
-                mode="replicate",
-            )
-            aux2 = torch.sigmoid(self.aux2_out(aux2))
-            aux2 = F.pad(
-                input=aux2,
-                pad=(0, 0, 0, self.output_bin - aux2.size()[2]),
-                mode="replicate",
-            )
-            return mask * mix, aux1 * mix, aux2 * mix
-        else:
-            if aggressiveness:
-                mask[:, :, : aggressiveness["split_bin"]] = torch.pow(
-                    mask[:, :, : aggressiveness["split_bin"]],
-                    1 + aggressiveness["value"] / 3,
-                )
-                mask[:, :, aggressiveness["split_bin"] :] = torch.pow(
-                    mask[:, :, aggressiveness["split_bin"] :],
-                    1 + aggressiveness["value"],
-                )
-
-            return mask * mix
-
-    def predict(self, x_mag, aggressiveness=None):
-        h = self.forward(x_mag, aggressiveness)
-
-        if self.offset > 0:
-            h = h[:, :, :, self.offset : -self.offset]
-            assert h.size()[3] > 0
-
-        return h
diff --git a/spaces/ServerX/PorcoDiaz/utils/i18n.py b/spaces/ServerX/PorcoDiaz/utils/i18n.py
deleted file mode 100644
index 8e75d2bc26ff86ab1716b8d7f239ad9f5cc1e32d..0000000000000000000000000000000000000000
--- a/spaces/ServerX/PorcoDiaz/utils/i18n.py
+++ /dev/null
@@ -1,28 +0,0 @@
-import locale
-import json
-import os
-
-
-def load_language_list(language):
-    with open(f"./i18n/{language}.json", "r", encoding="utf-8") as f:
-        language_list = json.load(f)
-    return language_list
-
-
-class I18nAuto:
-    def __init__(self, language=None):
-        if language in ["Auto", None]:
-            language = "es_ES"
-        if not os.path.exists(f"./i18n/{language}.json"):
-            language = "es_ES"
-            language = "es_ES"
-        self.language = language
-        # print("Use Language:", language)
-        self.language_map = load_language_list(language)
-
-    def __call__(self, key):
-        return self.language_map.get(key, key)
-
-    def print(self):
-      # print("Use Language:", self.language)
-        print("")
diff --git a/spaces/SmileyTatsu/Smile/greeting.md b/spaces/SmileyTatsu/Smile/greeting.md
deleted file mode 100644
index ab93c62e2dd733bf088b9dedcb847c7523d66480..0000000000000000000000000000000000000000
--- a/spaces/SmileyTatsu/Smile/greeting.md
+++ /dev/null
@@ -1,4 +0,0 @@
-<video controls autoplay src="https://cdn-uploads.huggingface.co/production/uploads/65065c28dacc94cd6cfdb2e9/TIdKlLYqhRX8b0MQtJuUD.mp4"></video>
-Too busy to rn, opening again when I have more free time
-
-Smile! https://rentry.org/SmileyTatsu <- My cute bots
\ No newline at end of file
diff --git a/spaces/SungBeom/chatwine-korean/.venv/Lib/site-packages/IPython/core/magic.py b/spaces/SungBeom/chatwine-korean/.venv/Lib/site-packages/IPython/core/magic.py
deleted file mode 100644
index 4f9e4e548f734a06e45928b925f804993f94251f..0000000000000000000000000000000000000000
--- a/spaces/SungBeom/chatwine-korean/.venv/Lib/site-packages/IPython/core/magic.py
+++ /dev/null
@@ -1,757 +0,0 @@
-# encoding: utf-8
-"""Magic functions for InteractiveShell.
-"""
-
-#-----------------------------------------------------------------------------
-#  Copyright (C) 2001 Janko Hauser <jhauser@zscout.de> and
-#  Copyright (C) 2001 Fernando Perez <fperez@colorado.edu>
-#  Copyright (C) 2008 The IPython Development Team
-
-#  Distributed under the terms of the BSD License.  The full license is in
-#  the file COPYING, distributed as part of this software.
-#-----------------------------------------------------------------------------
-
-import os
-import re
-import sys
-from getopt import getopt, GetoptError
-
-from traitlets.config.configurable import Configurable
-from . import oinspect
-from .error import UsageError
-from .inputtransformer2 import ESC_MAGIC, ESC_MAGIC2
-from ..utils.ipstruct import Struct
-from ..utils.process import arg_split
-from ..utils.text import dedent
-from traitlets import Bool, Dict, Instance, observe
-from logging import error
-
-#-----------------------------------------------------------------------------
-# Globals
-#-----------------------------------------------------------------------------
-
-# A dict we'll use for each class that has magics, used as temporary storage to
-# pass information between the @line/cell_magic method decorators and the
-# @magics_class class decorator, because the method decorators have no
-# access to the class when they run.  See for more details:
-# http://stackoverflow.com/questions/2366713/can-a-python-decorator-of-an-instance-method-access-the-class
-
-magics = dict(line={}, cell={})
-
-magic_kinds = ('line', 'cell')
-magic_spec = ('line', 'cell', 'line_cell')
-magic_escapes = dict(line=ESC_MAGIC, cell=ESC_MAGIC2)
-
-#-----------------------------------------------------------------------------
-# Utility classes and functions
-#-----------------------------------------------------------------------------
-
-class Bunch: pass
-
-
-def on_off(tag):
-    """Return an ON/OFF string for a 1/0 input. Simple utility function."""
-    return ['OFF','ON'][tag]
-
-
-def compress_dhist(dh):
-    """Compress a directory history into a new one with at most 20 entries.
-
-    Return a new list made from the first and last 10 elements of dhist after
-    removal of duplicates.
-    """
-    head, tail = dh[:-10], dh[-10:]
-
-    newhead = []
-    done = set()
-    for h in head:
-        if h in done:
-            continue
-        newhead.append(h)
-        done.add(h)
-
-    return newhead + tail
-
-
-def needs_local_scope(func):
-    """Decorator to mark magic functions which need to local scope to run."""
-    func.needs_local_scope = True
-    return func
-
-#-----------------------------------------------------------------------------
-# Class and method decorators for registering magics
-#-----------------------------------------------------------------------------
-
-def magics_class(cls):
-    """Class decorator for all subclasses of the main Magics class.
-
-    Any class that subclasses Magics *must* also apply this decorator, to
-    ensure that all the methods that have been decorated as line/cell magics
-    get correctly registered in the class instance.  This is necessary because
-    when method decorators run, the class does not exist yet, so they
-    temporarily store their information into a module global.  Application of
-    this class decorator copies that global data to the class instance and
-    clears the global.
-
-    Obviously, this mechanism is not thread-safe, which means that the
-    *creation* of subclasses of Magic should only be done in a single-thread
-    context.  Instantiation of the classes has no restrictions.  Given that
-    these classes are typically created at IPython startup time and before user
-    application code becomes active, in practice this should not pose any
-    problems.
-    """
-    cls.registered = True
-    cls.magics = dict(line = magics['line'],
-                      cell = magics['cell'])
-    magics['line'] = {}
-    magics['cell'] = {}
-    return cls
-
-
-def record_magic(dct, magic_kind, magic_name, func):
-    """Utility function to store a function as a magic of a specific kind.
-
-    Parameters
-    ----------
-    dct : dict
-        A dictionary with 'line' and 'cell' subdicts.
-    magic_kind : str
-        Kind of magic to be stored.
-    magic_name : str
-        Key to store the magic as.
-    func : function
-        Callable object to store.
-    """
-    if magic_kind == 'line_cell':
-        dct['line'][magic_name] = dct['cell'][magic_name] = func
-    else:
-        dct[magic_kind][magic_name] = func
-
-
-def validate_type(magic_kind):
-    """Ensure that the given magic_kind is valid.
-
-    Check that the given magic_kind is one of the accepted spec types (stored
-    in the global `magic_spec`), raise ValueError otherwise.
-    """
-    if magic_kind not in magic_spec:
-        raise ValueError('magic_kind must be one of %s, %s given' %
-                         magic_kinds, magic_kind)
-
-
-# The docstrings for the decorator below will be fairly similar for the two
-# types (method and function), so we generate them here once and reuse the
-# templates below.
-_docstring_template = \
-"""Decorate the given {0} as {1} magic.
-
-The decorator can be used with or without arguments, as follows.
-
-i) without arguments: it will create a {1} magic named as the {0} being
-decorated::
-
-    @deco
-    def foo(...)
-
-will create a {1} magic named `foo`.
-
-ii) with one string argument: which will be used as the actual name of the
-resulting magic::
-
-    @deco('bar')
-    def foo(...)
-
-will create a {1} magic named `bar`.
-
-To register a class magic use ``Interactiveshell.register_magic(class or instance)``.
-"""
-
-# These two are decorator factories.  While they are conceptually very similar,
-# there are enough differences in the details that it's simpler to have them
-# written as completely standalone functions rather than trying to share code
-# and make a single one with convoluted logic.
-
-def _method_magic_marker(magic_kind):
-    """Decorator factory for methods in Magics subclasses.
-    """
-
-    validate_type(magic_kind)
-
-    # This is a closure to capture the magic_kind.  We could also use a class,
-    # but it's overkill for just that one bit of state.
-    def magic_deco(arg):
-        if callable(arg):
-            # "Naked" decorator call (just @foo, no args)
-            func = arg
-            name = func.__name__
-            retval = arg
-            record_magic(magics, magic_kind, name, name)
-        elif isinstance(arg, str):
-            # Decorator called with arguments (@foo('bar'))
-            name = arg
-            def mark(func, *a, **kw):
-                record_magic(magics, magic_kind, name, func.__name__)
-                return func
-            retval = mark
-        else:
-            raise TypeError("Decorator can only be called with "
-                            "string or function")
-        return retval
-
-    # Ensure the resulting decorator has a usable docstring
-    magic_deco.__doc__ = _docstring_template.format('method', magic_kind)
-    return magic_deco
-
-
-def _function_magic_marker(magic_kind):
-    """Decorator factory for standalone functions.
-    """
-    validate_type(magic_kind)
-    
-    # This is a closure to capture the magic_kind.  We could also use a class,
-    # but it's overkill for just that one bit of state.
-    def magic_deco(arg):
-        # Find get_ipython() in the caller's namespace
-        caller = sys._getframe(1)
-        for ns in ['f_locals', 'f_globals', 'f_builtins']:
-            get_ipython = getattr(caller, ns).get('get_ipython')
-            if get_ipython is not None:
-                break
-        else:
-            raise NameError('Decorator can only run in context where '
-                            '`get_ipython` exists')
-
-        ip = get_ipython()
-
-        if callable(arg):
-            # "Naked" decorator call (just @foo, no args)
-            func = arg
-            name = func.__name__
-            ip.register_magic_function(func, magic_kind, name)
-            retval = arg
-        elif isinstance(arg, str):
-            # Decorator called with arguments (@foo('bar'))
-            name = arg
-            def mark(func, *a, **kw):
-                ip.register_magic_function(func, magic_kind, name)
-                return func
-            retval = mark
-        else:
-            raise TypeError("Decorator can only be called with "
-                             "string or function")
-        return retval
-
-    # Ensure the resulting decorator has a usable docstring
-    ds = _docstring_template.format('function', magic_kind)
-
-    ds += dedent("""
-    Note: this decorator can only be used in a context where IPython is already
-    active, so that the `get_ipython()` call succeeds.  You can therefore use
-    it in your startup files loaded after IPython initializes, but *not* in the
-    IPython configuration file itself, which is executed before IPython is
-    fully up and running.  Any file located in the `startup` subdirectory of
-    your configuration profile will be OK in this sense.
-    """)
-    
-    magic_deco.__doc__ = ds
-    return magic_deco
-
-
-MAGIC_NO_VAR_EXPAND_ATTR = "_ipython_magic_no_var_expand"
-MAGIC_OUTPUT_CAN_BE_SILENCED = "_ipython_magic_output_can_be_silenced"
-
-
-def no_var_expand(magic_func):
-    """Mark a magic function as not needing variable expansion
-
-    By default, IPython interprets `{a}` or `$a` in the line passed to magics
-    as variables that should be interpolated from the interactive namespace
-    before passing the line to the magic function.
-    This is not always desirable, e.g. when the magic executes Python code
-    (%timeit, %time, etc.).
-    Decorate magics with `@no_var_expand` to opt-out of variable expansion.
-
-    .. versionadded:: 7.3
-    """
-    setattr(magic_func, MAGIC_NO_VAR_EXPAND_ATTR, True)
-    return magic_func
-
-
-def output_can_be_silenced(magic_func):
-    """Mark a magic function so its output may be silenced.
-
-    The output is silenced if the Python code used as a parameter of
-    the magic ends in a semicolon, not counting a Python comment that can
-    follow it.
-    """
-    setattr(magic_func, MAGIC_OUTPUT_CAN_BE_SILENCED, True)
-    return magic_func
-
-# Create the actual decorators for public use
-
-# These three are used to decorate methods in class definitions
-line_magic = _method_magic_marker('line')
-cell_magic = _method_magic_marker('cell')
-line_cell_magic = _method_magic_marker('line_cell')
-
-# These three decorate standalone functions and perform the decoration
-# immediately.  They can only run where get_ipython() works
-register_line_magic = _function_magic_marker('line')
-register_cell_magic = _function_magic_marker('cell')
-register_line_cell_magic = _function_magic_marker('line_cell')
-
-#-----------------------------------------------------------------------------
-# Core Magic classes
-#-----------------------------------------------------------------------------
-
-class MagicsManager(Configurable):
-    """Object that handles all magic-related functionality for IPython.
-    """
-    # Non-configurable class attributes
-
-    # A two-level dict, first keyed by magic type, then by magic function, and
-    # holding the actual callable object as value.  This is the dict used for
-    # magic function dispatch
-    magics = Dict()
-    lazy_magics = Dict(
-        help="""
-    Mapping from magic names to modules to load.
-
-    This can be used in IPython/IPykernel configuration to declare lazy magics
-    that will only be imported/registered on first use.
-
-    For example::
-
-        c.MagicsManager.lazy_magics = {
-          "my_magic": "slow.to.import",
-          "my_other_magic": "also.slow",
-        }
-
-    On first invocation of `%my_magic`, `%%my_magic`, `%%my_other_magic` or
-    `%%my_other_magic`, the corresponding module will be loaded as an ipython
-    extensions as if you had previously done `%load_ext ipython`.
-
-    Magics names should be without percent(s) as magics can be both cell
-    and line magics.
-
-    Lazy loading happen relatively late in execution process, and
-    complex extensions that manipulate Python/IPython internal state or global state
-    might not support lazy loading.
-    """
-    ).tag(
-        config=True,
-    )
-
-    # A registry of the original objects that we've been given holding magics.
-    registry = Dict()
-
-    shell = Instance('IPython.core.interactiveshell.InteractiveShellABC', allow_none=True)
-
-    auto_magic = Bool(True, help=
-        "Automatically call line magics without requiring explicit % prefix"
-    ).tag(config=True)
-    @observe('auto_magic')
-    def _auto_magic_changed(self, change):
-        self.shell.automagic = change['new']
-    
-    _auto_status = [
-        'Automagic is OFF, % prefix IS needed for line magics.',
-        'Automagic is ON, % prefix IS NOT needed for line magics.']
-
-    user_magics = Instance('IPython.core.magics.UserMagics', allow_none=True)
-
-    def __init__(self, shell=None, config=None, user_magics=None, **traits):
-
-        super(MagicsManager, self).__init__(shell=shell, config=config,
-                                           user_magics=user_magics, **traits)
-        self.magics = dict(line={}, cell={})
-        # Let's add the user_magics to the registry for uniformity, so *all*
-        # registered magic containers can be found there.
-        self.registry[user_magics.__class__.__name__] = user_magics
-
-    def auto_status(self):
-        """Return descriptive string with automagic status."""
-        return self._auto_status[self.auto_magic]
-    
-    def lsmagic(self):
-        """Return a dict of currently available magic functions.
-
-        The return dict has the keys 'line' and 'cell', corresponding to the
-        two types of magics we support.  Each value is a list of names.
-        """
-        return self.magics
-
-    def lsmagic_docs(self, brief=False, missing=''):
-        """Return dict of documentation of magic functions.
-
-        The return dict has the keys 'line' and 'cell', corresponding to the
-        two types of magics we support. Each value is a dict keyed by magic
-        name whose value is the function docstring. If a docstring is
-        unavailable, the value of `missing` is used instead.
-
-        If brief is True, only the first line of each docstring will be returned.
-        """
-        docs = {}
-        for m_type in self.magics:
-            m_docs = {}
-            for m_name, m_func in self.magics[m_type].items():
-                if m_func.__doc__:
-                    if brief:
-                        m_docs[m_name] = m_func.__doc__.split('\n', 1)[0]
-                    else:
-                        m_docs[m_name] = m_func.__doc__.rstrip()
-                else:
-                    m_docs[m_name] = missing
-            docs[m_type] = m_docs
-        return docs
-
-    def register_lazy(self, name: str, fully_qualified_name: str):
-        """
-        Lazily register a magic via an extension.
-
-
-        Parameters
-        ----------
-        name : str
-            Name of the magic you wish to register.
-        fully_qualified_name :
-            Fully qualified name of the module/submodule that should be loaded
-            as an extensions when the magic is first called.
-            It is assumed that loading this extensions will register the given
-            magic.
-        """
-
-        self.lazy_magics[name] = fully_qualified_name
-
-    def register(self, *magic_objects):
-        """Register one or more instances of Magics.
-
-        Take one or more classes or instances of classes that subclass the main
-        `core.Magic` class, and register them with IPython to use the magic
-        functions they provide.  The registration process will then ensure that
-        any methods that have decorated to provide line and/or cell magics will
-        be recognized with the `%x`/`%%x` syntax as a line/cell magic
-        respectively.
-
-        If classes are given, they will be instantiated with the default
-        constructor.  If your classes need a custom constructor, you should
-        instanitate them first and pass the instance.
-
-        The provided arguments can be an arbitrary mix of classes and instances.
-
-        Parameters
-        ----------
-        *magic_objects : one or more classes or instances
-        """
-        # Start by validating them to ensure they have all had their magic
-        # methods registered at the instance level
-        for m in magic_objects:
-            if not m.registered:
-                raise ValueError("Class of magics %r was constructed without "
-                                 "the @register_magics class decorator")
-            if isinstance(m, type):
-                # If we're given an uninstantiated class
-                m = m(shell=self.shell)
-
-            # Now that we have an instance, we can register it and update the
-            # table of callables
-            self.registry[m.__class__.__name__] = m
-            for mtype in magic_kinds:
-                self.magics[mtype].update(m.magics[mtype])
-
-    def register_function(self, func, magic_kind='line', magic_name=None):
-        """Expose a standalone function as magic function for IPython.
-
-        This will create an IPython magic (line, cell or both) from a
-        standalone function.  The functions should have the following
-        signatures:
-
-        * For line magics: `def f(line)`
-        * For cell magics: `def f(line, cell)`
-        * For a function that does both: `def f(line, cell=None)`
-
-        In the latter case, the function will be called with `cell==None` when
-        invoked as `%f`, and with cell as a string when invoked as `%%f`.
-
-        Parameters
-        ----------
-        func : callable
-            Function to be registered as a magic.
-        magic_kind : str
-            Kind of magic, one of 'line', 'cell' or 'line_cell'
-        magic_name : optional str
-            If given, the name the magic will have in the IPython namespace.  By
-            default, the name of the function itself is used.
-        """
-
-        # Create the new method in the user_magics and register it in the
-        # global table
-        validate_type(magic_kind)
-        magic_name = func.__name__ if magic_name is None else magic_name
-        setattr(self.user_magics, magic_name, func)
-        record_magic(self.magics, magic_kind, magic_name, func)
-
-    def register_alias(self, alias_name, magic_name, magic_kind='line', magic_params=None):
-        """Register an alias to a magic function.
-
-        The alias is an instance of :class:`MagicAlias`, which holds the
-        name and kind of the magic it should call. Binding is done at
-        call time, so if the underlying magic function is changed the alias
-        will call the new function.
-
-        Parameters
-        ----------
-        alias_name : str
-            The name of the magic to be registered.
-        magic_name : str
-            The name of an existing magic.
-        magic_kind : str
-            Kind of magic, one of 'line' or 'cell'
-        """
-
-        # `validate_type` is too permissive, as it allows 'line_cell'
-        # which we do not handle.
-        if magic_kind not in magic_kinds:
-            raise ValueError('magic_kind must be one of %s, %s given' %
-                             magic_kinds, magic_kind)
-
-        alias = MagicAlias(self.shell, magic_name, magic_kind, magic_params)
-        setattr(self.user_magics, alias_name, alias)
-        record_magic(self.magics, magic_kind, alias_name, alias)
-
-# Key base class that provides the central functionality for magics.
-
-
-class Magics(Configurable):
-    """Base class for implementing magic functions.
-
-    Shell functions which can be reached as %function_name. All magic
-    functions should accept a string, which they can parse for their own
-    needs. This can make some functions easier to type, eg `%cd ../`
-    vs. `%cd("../")`
-
-    Classes providing magic functions need to subclass this class, and they
-    MUST:
-
-    - Use the method decorators `@line_magic` and `@cell_magic` to decorate
-      individual methods as magic functions, AND
-
-    - Use the class decorator `@magics_class` to ensure that the magic
-      methods are properly registered at the instance level upon instance
-      initialization.
-
-    See :mod:`magic_functions` for examples of actual implementation classes.
-    """
-    # Dict holding all command-line options for each magic.
-    options_table = None
-    # Dict for the mapping of magic names to methods, set by class decorator
-    magics = None
-    # Flag to check that the class decorator was properly applied
-    registered = False
-    # Instance of IPython shell
-    shell = None
-
-    def __init__(self, shell=None, **kwargs):
-        if not(self.__class__.registered):
-            raise ValueError('Magics subclass without registration - '
-                             'did you forget to apply @magics_class?')
-        if shell is not None:
-            if hasattr(shell, 'configurables'):
-                shell.configurables.append(self)
-            if hasattr(shell, 'config'):
-                kwargs.setdefault('parent', shell)
-
-        self.shell = shell
-        self.options_table = {}
-        # The method decorators are run when the instance doesn't exist yet, so
-        # they can only record the names of the methods they are supposed to
-        # grab.  Only now, that the instance exists, can we create the proper
-        # mapping to bound methods.  So we read the info off the original names
-        # table and replace each method name by the actual bound method.
-        # But we mustn't clobber the *class* mapping, in case of multiple instances.
-        class_magics = self.magics
-        self.magics = {}
-        for mtype in magic_kinds:
-            tab = self.magics[mtype] = {}
-            cls_tab = class_magics[mtype]
-            for magic_name, meth_name in cls_tab.items():
-                if isinstance(meth_name, str):
-                    # it's a method name, grab it
-                    tab[magic_name] = getattr(self, meth_name)
-                else:
-                    # it's the real thing
-                    tab[magic_name] = meth_name
-        # Configurable **needs** to be initiated at the end or the config
-        # magics get screwed up.
-        super(Magics, self).__init__(**kwargs)
-
-    def arg_err(self,func):
-        """Print docstring if incorrect arguments were passed"""
-        print('Error in arguments:')
-        print(oinspect.getdoc(func))
-
-    def format_latex(self, strng):
-        """Format a string for latex inclusion."""
-
-        # Characters that need to be escaped for latex:
-        escape_re = re.compile(r'(%|_|\$|#|&)',re.MULTILINE)
-        # Magic command names as headers:
-        cmd_name_re = re.compile(r'^(%s.*?):' % ESC_MAGIC,
-                                 re.MULTILINE)
-        # Magic commands
-        cmd_re = re.compile(r'(?P<cmd>%s.+?\b)(?!\}\}:)' % ESC_MAGIC,
-                            re.MULTILINE)
-        # Paragraph continue
-        par_re = re.compile(r'\\$',re.MULTILINE)
-
-        # The "\n" symbol
-        newline_re = re.compile(r'\\n')
-
-        # Now build the string for output:
-        #strng = cmd_name_re.sub(r'\n\\texttt{\\textsl{\\large \1}}:',strng)
-        strng = cmd_name_re.sub(r'\n\\bigskip\n\\texttt{\\textbf{ \1}}:',
-                                strng)
-        strng = cmd_re.sub(r'\\texttt{\g<cmd>}',strng)
-        strng = par_re.sub(r'\\\\',strng)
-        strng = escape_re.sub(r'\\\1',strng)
-        strng = newline_re.sub(r'\\textbackslash{}n',strng)
-        return strng
-
-    def parse_options(self, arg_str, opt_str, *long_opts, **kw):
-        """Parse options passed to an argument string.
-
-        The interface is similar to that of :func:`getopt.getopt`, but it
-        returns a :class:`~IPython.utils.struct.Struct` with the options as keys
-        and the stripped argument string still as a string.
-
-        arg_str is quoted as a true sys.argv vector by using shlex.split.
-        This allows us to easily expand variables, glob files, quote
-        arguments, etc.
-
-        Parameters
-        ----------
-        arg_str : str
-            The arguments to parse.
-        opt_str : str
-            The options specification.
-        mode : str, default 'string'
-            If given as 'list', the argument string is returned as a list (split
-            on whitespace) instead of a string.
-        list_all : bool, default False
-            Put all option values in lists. Normally only options
-            appearing more than once are put in a list.
-        posix : bool, default True
-            Whether to split the input line in POSIX mode or not, as per the
-            conventions outlined in the :mod:`shlex` module from the standard
-            library.
-        """
-
-        # inject default options at the beginning of the input line
-        caller = sys._getframe(1).f_code.co_name
-        arg_str = '%s %s' % (self.options_table.get(caller,''),arg_str)
-
-        mode = kw.get('mode','string')
-        if mode not in ['string','list']:
-            raise ValueError('incorrect mode given: %s' % mode)
-        # Get options
-        list_all = kw.get('list_all',0)
-        posix = kw.get('posix', os.name == 'posix')
-        strict = kw.get('strict', True)
-
-        preserve_non_opts = kw.get("preserve_non_opts", False)
-        remainder_arg_str = arg_str
-
-        # Check if we have more than one argument to warrant extra processing:
-        odict = {}  # Dictionary with options
-        args = arg_str.split()
-        if len(args) >= 1:
-            # If the list of inputs only has 0 or 1 thing in it, there's no
-            # need to look for options
-            argv = arg_split(arg_str, posix, strict)
-            # Do regular option processing
-            try:
-                opts,args = getopt(argv, opt_str, long_opts)
-            except GetoptError as e:
-                raise UsageError(
-                    '%s ( allowed: "%s" %s)' % (e.msg, opt_str, " ".join(long_opts))
-                ) from e
-            for o, a in opts:
-                if mode == "string" and preserve_non_opts:
-                    # remove option-parts from the original args-string and preserve remaining-part.
-                    # This relies on the arg_split(...) and getopt(...)'s impl spec, that the parsed options are
-                    # returned in the original order.
-                    remainder_arg_str = remainder_arg_str.replace(o, "", 1).replace(
-                        a, "", 1
-                    )
-                if o.startswith("--"):
-                    o = o[2:]
-                else:
-                    o = o[1:]
-                try:
-                    odict[o].append(a)
-                except AttributeError:
-                    odict[o] = [odict[o],a]
-                except KeyError:
-                    if list_all:
-                        odict[o] = [a]
-                    else:
-                        odict[o] = a
-
-        # Prepare opts,args for return
-        opts = Struct(odict)
-        if mode == 'string':
-            if preserve_non_opts:
-                args = remainder_arg_str.lstrip()
-            else:
-                args = " ".join(args)
-
-        return opts,args
-
-    def default_option(self, fn, optstr):
-        """Make an entry in the options_table for fn, with value optstr"""
-
-        if fn not in self.lsmagic():
-            error("%s is not a magic function" % fn)
-        self.options_table[fn] = optstr
-
-
-class MagicAlias(object):
-    """An alias to another magic function.
-
-    An alias is determined by its magic name and magic kind. Lookup
-    is done at call time, so if the underlying magic changes the alias
-    will call the new function.
-
-    Use the :meth:`MagicsManager.register_alias` method or the
-    `%alias_magic` magic function to create and register a new alias.
-    """
-    def __init__(self, shell, magic_name, magic_kind, magic_params=None):
-        self.shell = shell
-        self.magic_name = magic_name
-        self.magic_params = magic_params
-        self.magic_kind = magic_kind
-
-        self.pretty_target = '%s%s' % (magic_escapes[self.magic_kind], self.magic_name)
-        self.__doc__ = "Alias for `%s`." % self.pretty_target
-
-        self._in_call = False
-
-    def __call__(self, *args, **kwargs):
-        """Call the magic alias."""
-        fn = self.shell.find_magic(self.magic_name, self.magic_kind)
-        if fn is None:
-            raise UsageError("Magic `%s` not found." % self.pretty_target)
-
-        # Protect against infinite recursion.
-        if self._in_call:
-            raise UsageError("Infinite recursion detected; "
-                             "magic aliases cannot call themselves.")
-        self._in_call = True
-        try:
-            if self.magic_params:
-                args_list = list(args)
-                args_list[0] = self.magic_params + " " + args[0]
-                args = tuple(args_list)
-            return fn(*args, **kwargs)
-        finally:
-            self._in_call = False
diff --git a/spaces/SungBeom/chatwine-korean/.venv/Lib/site-packages/IPython/core/magics/osm.py b/spaces/SungBeom/chatwine-korean/.venv/Lib/site-packages/IPython/core/magics/osm.py
deleted file mode 100644
index f64f1bce6ae022804683f031d6c63db0201fa779..0000000000000000000000000000000000000000
--- a/spaces/SungBeom/chatwine-korean/.venv/Lib/site-packages/IPython/core/magics/osm.py
+++ /dev/null
@@ -1,855 +0,0 @@
-"""Implementation of magic functions for interaction with the OS.
-
-Note: this module is named 'osm' instead of 'os' to avoid a collision with the
-builtin.
-"""
-# Copyright (c) IPython Development Team.
-# Distributed under the terms of the Modified BSD License.
-
-import io
-import os
-import pathlib
-import re
-import sys
-from pprint import pformat
-
-from IPython.core import magic_arguments
-from IPython.core import oinspect
-from IPython.core import page
-from IPython.core.alias import AliasError, Alias
-from IPython.core.error import UsageError
-from IPython.core.magic import  (
-    Magics, compress_dhist, magics_class, line_magic, cell_magic, line_cell_magic
-)
-from IPython.testing.skipdoctest import skip_doctest
-from IPython.utils.openpy import source_to_unicode
-from IPython.utils.process import abbrev_cwd
-from IPython.utils.terminal import set_term_title
-from traitlets import Bool
-from warnings import warn
-
-
-@magics_class
-class OSMagics(Magics):
-    """Magics to interact with the underlying OS (shell-type functionality).
-    """
-
-    cd_force_quiet = Bool(False,
-        help="Force %cd magic to be quiet even if -q is not passed."
-    ).tag(config=True)
-
-    def __init__(self, shell=None, **kwargs):
-
-        # Now define isexec in a cross platform manner.
-        self.is_posix = False
-        self.execre = None
-        if os.name == 'posix':
-            self.is_posix = True
-        else:
-            try:
-                winext = os.environ['pathext'].replace(';','|').replace('.','')
-            except KeyError:
-                winext = 'exe|com|bat|py'
-            try:
-                self.execre = re.compile(r'(.*)\.(%s)$' % winext,re.IGNORECASE)
-            except re.error:
-                warn("Seems like your pathext environmental "
-                     "variable is malformed. Please check it to "
-                     "enable a proper handle of file extensions "
-                     "managed for your system")
-                winext = 'exe|com|bat|py'
-                self.execre = re.compile(r'(.*)\.(%s)$' % winext,re.IGNORECASE)
-
-        # call up the chain
-        super().__init__(shell=shell, **kwargs)
-
-
-    def _isexec_POSIX(self, file):
-        """
-        Test for executable on a POSIX system
-        """
-        if os.access(file.path, os.X_OK):
-            # will fail on maxOS if access is not X_OK
-            return file.is_file()
-        return False
-
-
-    
-    def _isexec_WIN(self, file):
-        """
-        Test for executable file on non POSIX system
-        """
-        return file.is_file() and self.execre.match(file.name) is not None
-
-    def isexec(self, file):
-        """
-        Test for executable file on non POSIX system
-        """
-        if self.is_posix:
-            return self._isexec_POSIX(file)
-        else:
-            return self._isexec_WIN(file)
-
-
-    @skip_doctest
-    @line_magic
-    def alias(self, parameter_s=''):
-        """Define an alias for a system command.
-
-        '%alias alias_name cmd' defines 'alias_name' as an alias for 'cmd'
-
-        Then, typing 'alias_name params' will execute the system command 'cmd
-        params' (from your underlying operating system).
-
-        Aliases have lower precedence than magic functions and Python normal
-        variables, so if 'foo' is both a Python variable and an alias, the
-        alias can not be executed until 'del foo' removes the Python variable.
-
-        You can use the %l specifier in an alias definition to represent the
-        whole line when the alias is called.  For example::
-
-          In [2]: alias bracket echo "Input in brackets: <%l>"
-          In [3]: bracket hello world
-          Input in brackets: <hello world>
-
-        You can also define aliases with parameters using %s specifiers (one
-        per parameter)::
-
-          In [1]: alias parts echo first %s second %s
-          In [2]: %parts A B
-          first A second B
-          In [3]: %parts A
-          Incorrect number of arguments: 2 expected.
-          parts is an alias to: 'echo first %s second %s'
-
-        Note that %l and %s are mutually exclusive.  You can only use one or
-        the other in your aliases.
-
-        Aliases expand Python variables just like system calls using ! or !!
-        do: all expressions prefixed with '$' get expanded.  For details of
-        the semantic rules, see PEP-215:
-        https://peps.python.org/pep-0215/.  This is the library used by
-        IPython for variable expansion.  If you want to access a true shell
-        variable, an extra $ is necessary to prevent its expansion by
-        IPython::
-
-          In [6]: alias show echo
-          In [7]: PATH='A Python string'
-          In [8]: show $PATH
-          A Python string
-          In [9]: show $$PATH
-          /usr/local/lf9560/bin:/usr/local/intel/compiler70/ia32/bin:...
-
-        You can use the alias facility to access all of $PATH.  See the %rehashx
-        function, which automatically creates aliases for the contents of your
-        $PATH.
-
-        If called with no parameters, %alias prints the current alias table
-        for your system.  For posix systems, the default aliases are 'cat',
-        'cp', 'mv', 'rm', 'rmdir', and 'mkdir', and other platform-specific
-        aliases are added.  For windows-based systems, the default aliases are
-        'copy', 'ddir', 'echo', 'ls', 'ldir', 'mkdir', 'ren', and 'rmdir'.
-
-        You can see the definition of alias by adding a question mark in the
-        end::
-
-          In [1]: cat?
-          Repr: <alias cat for 'cat'>"""
-
-        par = parameter_s.strip()
-        if not par:
-            aliases = sorted(self.shell.alias_manager.aliases)
-            # stored = self.shell.db.get('stored_aliases', {} )
-            # for k, v in stored:
-            #     atab.append(k, v[0])
-
-            print("Total number of aliases:", len(aliases))
-            sys.stdout.flush()
-            return aliases
-
-        # Now try to define a new one
-        try:
-            alias,cmd = par.split(None, 1)
-        except TypeError:
-            print(oinspect.getdoc(self.alias))
-            return
-        
-        try:
-            self.shell.alias_manager.define_alias(alias, cmd)
-        except AliasError as e:
-            print(e)
-    # end magic_alias
-
-    @line_magic
-    def unalias(self, parameter_s=''):
-        """Remove an alias"""
-
-        aname = parameter_s.strip()
-        try:
-            self.shell.alias_manager.undefine_alias(aname)
-        except ValueError as e:
-            print(e)
-            return
-        
-        stored = self.shell.db.get('stored_aliases', {} )
-        if aname in stored:
-            print("Removing %stored alias",aname)
-            del stored[aname]
-            self.shell.db['stored_aliases'] = stored
-
-    @line_magic
-    def rehashx(self, parameter_s=''):
-        """Update the alias table with all executable files in $PATH.
-
-        rehashx explicitly checks that every entry in $PATH is a file
-        with execute access (os.X_OK).
-
-        Under Windows, it checks executability as a match against a
-        '|'-separated string of extensions, stored in the IPython config
-        variable win_exec_ext.  This defaults to 'exe|com|bat'.
-
-        This function also resets the root module cache of module completer,
-        used on slow filesystems.
-        """
-        from IPython.core.alias import InvalidAliasError
-
-        # for the benefit of module completer in ipy_completers.py
-        del self.shell.db['rootmodules_cache']
-
-        path = [os.path.abspath(os.path.expanduser(p)) for p in
-            os.environ.get('PATH','').split(os.pathsep)]
-
-        syscmdlist = []
-        savedir = os.getcwd()
-
-        # Now walk the paths looking for executables to alias.
-        try:
-            # write the whole loop for posix/Windows so we don't have an if in
-            # the innermost part
-            if self.is_posix:
-                for pdir in path:
-                    try:
-                        os.chdir(pdir)
-                    except OSError:
-                        continue
-
-                    # for python 3.6+ rewrite to: with os.scandir(pdir) as dirlist:
-                    dirlist = os.scandir(path=pdir)
-                    for ff in dirlist:
-                        if self.isexec(ff):
-                            fname = ff.name
-                            try:
-                                # Removes dots from the name since ipython
-                                # will assume names with dots to be python.
-                                if not self.shell.alias_manager.is_alias(fname):
-                                    self.shell.alias_manager.define_alias(
-                                        fname.replace('.',''), fname)
-                            except InvalidAliasError:
-                                pass
-                            else:
-                                syscmdlist.append(fname)
-            else:
-                no_alias = Alias.blacklist
-                for pdir in path:
-                    try:
-                        os.chdir(pdir)
-                    except OSError:
-                        continue
-
-                    # for python 3.6+ rewrite to: with os.scandir(pdir) as dirlist:
-                    dirlist = os.scandir(pdir)
-                    for ff in dirlist:
-                        fname = ff.name
-                        base, ext = os.path.splitext(fname)
-                        if self.isexec(ff) and base.lower() not in no_alias:
-                            if ext.lower() == '.exe':
-                                fname = base
-                                try:
-                                    # Removes dots from the name since ipython
-                                    # will assume names with dots to be python.
-                                    self.shell.alias_manager.define_alias(
-                                        base.lower().replace('.',''), fname)
-                                except InvalidAliasError:
-                                    pass
-                                syscmdlist.append(fname)
-
-            self.shell.db['syscmdlist'] = syscmdlist
-        finally:
-            os.chdir(savedir)
-
-    @skip_doctest
-    @line_magic
-    def pwd(self, parameter_s=''):
-        """Return the current working directory path.
-
-        Examples
-        --------
-        ::
-
-          In [9]: pwd
-          Out[9]: '/home/tsuser/sprint/ipython'
-        """
-        try:
-            return os.getcwd()
-        except FileNotFoundError as e:
-            raise UsageError("CWD no longer exists - please use %cd to change directory.") from e
-
-    @skip_doctest
-    @line_magic
-    def cd(self, parameter_s=''):
-        """Change the current working directory.
-
-        This command automatically maintains an internal list of directories
-        you visit during your IPython session, in the variable ``_dh``. The
-        command :magic:`%dhist` shows this history nicely formatted. You can
-        also do ``cd -<tab>`` to see directory history conveniently.
-        Usage:
-
-          - ``cd 'dir'``: changes to directory 'dir'.
-          - ``cd -``: changes to the last visited directory.
-          - ``cd -<n>``: changes to the n-th directory in the directory history.
-          - ``cd --foo``: change to directory that matches 'foo' in history
-          - ``cd -b <bookmark_name>``: jump to a bookmark set by %bookmark
-          - Hitting a tab key after ``cd -b`` allows you to tab-complete
-            bookmark names.
-
-          .. note::
-            ``cd <bookmark_name>`` is enough if there is no directory
-            ``<bookmark_name>``, but a bookmark with the name exists.
-
-        Options:
-
-        -q               Be quiet. Do not print the working directory after the
-                         cd command is executed. By default IPython's cd
-                         command does print this directory, since the default
-                         prompts do not display path information.
-
-        .. note::
-           Note that ``!cd`` doesn't work for this purpose because the shell
-           where ``!command`` runs is immediately discarded after executing
-           'command'.
-
-        Examples
-        --------
-        ::
-
-          In [10]: cd parent/child
-          /home/tsuser/parent/child
-        """
-
-        try:
-            oldcwd = os.getcwd()
-        except FileNotFoundError:
-            # Happens if the CWD has been deleted.
-            oldcwd = None
-
-        numcd = re.match(r'(-)(\d+)$',parameter_s)
-        # jump in directory history by number
-        if numcd:
-            nn = int(numcd.group(2))
-            try:
-                ps = self.shell.user_ns['_dh'][nn]
-            except IndexError:
-                print('The requested directory does not exist in history.')
-                return
-            else:
-                opts = {}
-        elif parameter_s.startswith('--'):
-            ps = None
-            fallback = None
-            pat = parameter_s[2:]
-            dh = self.shell.user_ns['_dh']
-            # first search only by basename (last component)
-            for ent in reversed(dh):
-                if pat in os.path.basename(ent) and os.path.isdir(ent):
-                    ps = ent
-                    break
-
-                if fallback is None and pat in ent and os.path.isdir(ent):
-                    fallback = ent
-
-            # if we have no last part match, pick the first full path match
-            if ps is None:
-                ps = fallback
-
-            if ps is None:
-                print("No matching entry in directory history")
-                return
-            else:
-                opts = {}
-
-
-        else:
-            opts, ps = self.parse_options(parameter_s, 'qb', mode='string')
-        # jump to previous
-        if ps == '-':
-            try:
-                ps = self.shell.user_ns['_dh'][-2]
-            except IndexError as e:
-                raise UsageError('%cd -: No previous directory to change to.') from e
-        # jump to bookmark if needed
-        else:
-            if not os.path.isdir(ps) or 'b' in opts:
-                bkms = self.shell.db.get('bookmarks', {})
-
-                if ps in bkms:
-                    target = bkms[ps]
-                    print('(bookmark:%s) -> %s' % (ps, target))
-                    ps = target
-                else:
-                    if 'b' in opts:
-                        raise UsageError("Bookmark '%s' not found.  "
-                              "Use '%%bookmark -l' to see your bookmarks." % ps)
-
-        # at this point ps should point to the target dir
-        if ps:
-            try:
-                os.chdir(os.path.expanduser(ps))
-                if hasattr(self.shell, 'term_title') and self.shell.term_title:
-                    set_term_title(self.shell.term_title_format.format(cwd=abbrev_cwd()))
-            except OSError:
-                print(sys.exc_info()[1])
-            else:
-                cwd = pathlib.Path.cwd()
-                dhist = self.shell.user_ns['_dh']
-                if oldcwd != cwd:
-                    dhist.append(cwd)
-                    self.shell.db['dhist'] = compress_dhist(dhist)[-100:]
-
-        else:
-            os.chdir(self.shell.home_dir)
-            if hasattr(self.shell, 'term_title') and self.shell.term_title:
-                set_term_title(self.shell.term_title_format.format(cwd="~"))
-            cwd = pathlib.Path.cwd()
-            dhist = self.shell.user_ns['_dh']
-
-            if oldcwd != cwd:
-                dhist.append(cwd)
-                self.shell.db['dhist'] = compress_dhist(dhist)[-100:]
-        if not 'q' in opts and not self.cd_force_quiet and self.shell.user_ns['_dh']:
-            print(self.shell.user_ns['_dh'][-1])
-
-    @line_magic
-    def env(self, parameter_s=''):
-        """Get, set, or list environment variables.
-
-        Usage:\\
-
-          :``%env``: lists all environment variables/values
-          :``%env var``: get value for var
-          :``%env var val``: set value for var
-          :``%env var=val``: set value for var
-          :``%env var=$val``: set value for var, using python expansion if possible
-        """
-        if parameter_s.strip():
-            split = '=' if '=' in parameter_s else ' '
-            bits = parameter_s.split(split)
-            if len(bits) == 1:
-                key = parameter_s.strip()
-                if key in os.environ:
-                    return os.environ[key]
-                else:
-                    err = "Environment does not have key: {0}".format(key)
-                    raise UsageError(err)
-            if len(bits) > 1:
-                return self.set_env(parameter_s)
-        env = dict(os.environ)
-        # hide likely secrets when printing the whole environment
-        for key in list(env):
-            if any(s in key.lower() for s in ('key', 'token', 'secret')):
-                env[key] = '<hidden>'
-
-        return env
-
-    @line_magic
-    def set_env(self, parameter_s):
-        """Set environment variables.  Assumptions are that either "val" is a
-        name in the user namespace, or val is something that evaluates to a
-        string.
-
-        Usage:\\
-          :``%set_env var val``: set value for var
-          :``%set_env var=val``: set value for var
-          :``%set_env var=$val``: set value for var, using python expansion if possible
-        """
-        split = '=' if '=' in parameter_s else ' '
-        bits = parameter_s.split(split, 1)
-        if not parameter_s.strip() or len(bits)<2:
-            raise UsageError("usage is 'set_env var=val'")
-        var = bits[0].strip()
-        val = bits[1].strip()
-        if re.match(r'.*\s.*', var):
-            # an environment variable with whitespace is almost certainly
-            # not what the user intended.  what's more likely is the wrong
-            # split was chosen, ie for "set_env cmd_args A=B", we chose
-            # '=' for the split and should have chosen ' '.  to get around
-            # this, users should just assign directly to os.environ or use
-            # standard magic {var} expansion.
-            err = "refusing to set env var with whitespace: '{0}'"
-            err = err.format(val)
-            raise UsageError(err)
-        os.environ[var] = val
-        print('env: {0}={1}'.format(var,val))
-
-    @line_magic
-    def pushd(self, parameter_s=''):
-        """Place the current dir on stack and change directory.
-
-        Usage:\\
-          %pushd ['dirname']
-        """
-
-        dir_s = self.shell.dir_stack
-        tgt = os.path.expanduser(parameter_s)
-        cwd = os.getcwd().replace(self.shell.home_dir,'~')
-        if tgt:
-            self.cd(parameter_s)
-        dir_s.insert(0,cwd)
-        return self.shell.run_line_magic('dirs', '')
-
-    @line_magic
-    def popd(self, parameter_s=''):
-        """Change to directory popped off the top of the stack.
-        """
-        if not self.shell.dir_stack:
-            raise UsageError("%popd on empty stack")
-        top = self.shell.dir_stack.pop(0)
-        self.cd(top)
-        print("popd ->",top)
-
-    @line_magic
-    def dirs(self, parameter_s=''):
-        """Return the current directory stack."""
-
-        return self.shell.dir_stack
-
-    @line_magic
-    def dhist(self, parameter_s=''):
-        """Print your history of visited directories.
-
-        %dhist       -> print full history\\
-        %dhist n     -> print last n entries only\\
-        %dhist n1 n2 -> print entries between n1 and n2 (n2 not included)\\
-
-        This history is automatically maintained by the %cd command, and
-        always available as the global list variable _dh. You can use %cd -<n>
-        to go to directory number <n>.
-
-        Note that most of time, you should view directory history by entering
-        cd -<TAB>.
-
-        """
-
-        dh = self.shell.user_ns['_dh']
-        if parameter_s:
-            try:
-                args = map(int,parameter_s.split())
-            except:
-                self.arg_err(self.dhist)
-                return
-            if len(args) == 1:
-                ini,fin = max(len(dh)-(args[0]),0),len(dh)
-            elif len(args) == 2:
-                ini,fin = args
-                fin = min(fin, len(dh))
-            else:
-                self.arg_err(self.dhist)
-                return
-        else:
-            ini,fin = 0,len(dh)
-        print('Directory history (kept in _dh)')
-        for i in range(ini, fin):
-            print("%d: %s" % (i, dh[i]))
-
-    @skip_doctest
-    @line_magic
-    def sc(self, parameter_s=''):
-        """Shell capture - run shell command and capture output (DEPRECATED use !).
-
-        DEPRECATED. Suboptimal, retained for backwards compatibility.
-
-        You should use the form 'var = !command' instead. Example:
-
-         "%sc -l myfiles = ls ~" should now be written as
-
-         "myfiles = !ls ~"
-
-        myfiles.s, myfiles.l and myfiles.n still apply as documented
-        below.
-
-        --
-        %sc [options] varname=command
-
-        IPython will run the given command using commands.getoutput(), and
-        will then update the user's interactive namespace with a variable
-        called varname, containing the value of the call.  Your command can
-        contain shell wildcards, pipes, etc.
-
-        The '=' sign in the syntax is mandatory, and the variable name you
-        supply must follow Python's standard conventions for valid names.
-
-        (A special format without variable name exists for internal use)
-
-        Options:
-
-          -l: list output.  Split the output on newlines into a list before
-          assigning it to the given variable.  By default the output is stored
-          as a single string.
-
-          -v: verbose.  Print the contents of the variable.
-
-        In most cases you should not need to split as a list, because the
-        returned value is a special type of string which can automatically
-        provide its contents either as a list (split on newlines) or as a
-        space-separated string.  These are convenient, respectively, either
-        for sequential processing or to be passed to a shell command.
-
-        For example::
-
-            # Capture into variable a
-            In [1]: sc a=ls *py
-
-            # a is a string with embedded newlines
-            In [2]: a
-            Out[2]: 'setup.py\\nwin32_manual_post_install.py'
-
-            # which can be seen as a list:
-            In [3]: a.l
-            Out[3]: ['setup.py', 'win32_manual_post_install.py']
-
-            # or as a whitespace-separated string:
-            In [4]: a.s
-            Out[4]: 'setup.py win32_manual_post_install.py'
-
-            # a.s is useful to pass as a single command line:
-            In [5]: !wc -l $a.s
-              146 setup.py
-              130 win32_manual_post_install.py
-              276 total
-
-            # while the list form is useful to loop over:
-            In [6]: for f in a.l:
-               ...:      !wc -l $f
-               ...:
-            146 setup.py
-            130 win32_manual_post_install.py
-
-        Similarly, the lists returned by the -l option are also special, in
-        the sense that you can equally invoke the .s attribute on them to
-        automatically get a whitespace-separated string from their contents::
-
-            In [7]: sc -l b=ls *py
-
-            In [8]: b
-            Out[8]: ['setup.py', 'win32_manual_post_install.py']
-
-            In [9]: b.s
-            Out[9]: 'setup.py win32_manual_post_install.py'
-
-        In summary, both the lists and strings used for output capture have
-        the following special attributes::
-
-            .l (or .list) : value as list.
-            .n (or .nlstr): value as newline-separated string.
-            .s (or .spstr): value as space-separated string.
-        """
-
-        opts,args = self.parse_options(parameter_s, 'lv')
-        # Try to get a variable name and command to run
-        try:
-            # the variable name must be obtained from the parse_options
-            # output, which uses shlex.split to strip options out.
-            var,_ = args.split('=', 1)
-            var = var.strip()
-            # But the command has to be extracted from the original input
-            # parameter_s, not on what parse_options returns, to avoid the
-            # quote stripping which shlex.split performs on it.
-            _,cmd = parameter_s.split('=', 1)
-        except ValueError:
-            var,cmd = '',''
-        # If all looks ok, proceed
-        split = 'l' in opts
-        out = self.shell.getoutput(cmd, split=split)
-        if 'v' in opts:
-            print('%s ==\n%s' % (var, pformat(out)))
-        if var:
-            self.shell.user_ns.update({var:out})
-        else:
-            return out
-
-    @line_cell_magic
-    def sx(self, line='', cell=None):
-        """Shell execute - run shell command and capture output (!! is short-hand).
-
-        %sx command
-
-        IPython will run the given command using commands.getoutput(), and
-        return the result formatted as a list (split on '\\n').  Since the
-        output is _returned_, it will be stored in ipython's regular output
-        cache Out[N] and in the '_N' automatic variables.
-
-        Notes:
-
-        1) If an input line begins with '!!', then %sx is automatically
-        invoked.  That is, while::
-
-          !ls
-
-        causes ipython to simply issue system('ls'), typing::
-
-          !!ls
-
-        is a shorthand equivalent to::
-
-          %sx ls
-
-        2) %sx differs from %sc in that %sx automatically splits into a list,
-        like '%sc -l'.  The reason for this is to make it as easy as possible
-        to process line-oriented shell output via further python commands.
-        %sc is meant to provide much finer control, but requires more
-        typing.
-
-        3) Just like %sc -l, this is a list with special attributes:
-        ::
-
-          .l (or .list) : value as list.
-          .n (or .nlstr): value as newline-separated string.
-          .s (or .spstr): value as whitespace-separated string.
-
-        This is very useful when trying to use such lists as arguments to
-        system commands."""
-        
-        if cell is None:
-            # line magic
-            return self.shell.getoutput(line)
-        else:
-            opts,args = self.parse_options(line, '', 'out=')
-            output = self.shell.getoutput(cell)
-            out_name = opts.get('out', opts.get('o'))
-            if out_name:
-                self.shell.user_ns[out_name] = output
-            else:
-                return output
-
-    system = line_cell_magic('system')(sx)
-    bang = cell_magic('!')(sx)
-
-    @line_magic
-    def bookmark(self, parameter_s=''):
-        """Manage IPython's bookmark system.
-
-        %bookmark <name>       - set bookmark to current dir
-        %bookmark <name> <dir> - set bookmark to <dir>
-        %bookmark -l           - list all bookmarks
-        %bookmark -d <name>    - remove bookmark
-        %bookmark -r           - remove all bookmarks
-
-        You can later on access a bookmarked folder with::
-
-          %cd -b <name>
-
-        or simply '%cd <name>' if there is no directory called <name> AND
-        there is such a bookmark defined.
-
-        Your bookmarks persist through IPython sessions, but they are
-        associated with each profile."""
-
-        opts,args = self.parse_options(parameter_s,'drl',mode='list')
-        if len(args) > 2:
-            raise UsageError("%bookmark: too many arguments")
-
-        bkms = self.shell.db.get('bookmarks',{})
-
-        if 'd' in opts:
-            try:
-                todel = args[0]
-            except IndexError as e:
-                raise UsageError(
-                    "%bookmark -d: must provide a bookmark to delete") from e
-            else:
-                try:
-                    del bkms[todel]
-                except KeyError as e:
-                    raise UsageError(
-                        "%%bookmark -d: Can't delete bookmark '%s'" % todel) from e
-
-        elif 'r' in opts:
-            bkms = {}
-        elif 'l' in opts:
-            bks = sorted(bkms)
-            if bks:
-                size = max(map(len, bks))
-            else:
-                size = 0
-            fmt = '%-'+str(size)+'s -> %s'
-            print('Current bookmarks:')
-            for bk in bks:
-                print(fmt % (bk, bkms[bk]))
-        else:
-            if not args:
-                raise UsageError("%bookmark: You must specify the bookmark name")
-            elif len(args)==1:
-                bkms[args[0]] = os.getcwd()
-            elif len(args)==2:
-                bkms[args[0]] = args[1]
-        self.shell.db['bookmarks'] = bkms
-
-    @line_magic
-    def pycat(self, parameter_s=''):
-        """Show a syntax-highlighted file through a pager.
-
-        This magic is similar to the cat utility, but it will assume the file
-        to be Python source and will show it with syntax highlighting.
-
-        This magic command can either take a local filename, an url,
-        an history range (see %history) or a macro as argument.
-
-        If no parameter is given, prints out history of current session up to
-        this point. ::
-
-        %pycat myscript.py
-        %pycat 7-27
-        %pycat myMacro
-        %pycat http://www.example.com/myscript.py
-        """
-        try:
-            cont = self.shell.find_user_code(parameter_s, skip_encoding_cookie=False)
-        except (ValueError, IOError):
-            print("Error: no such file, variable, URL, history range or macro")
-            return
-
-        page.page(self.shell.pycolorize(source_to_unicode(cont)))
-
-    @magic_arguments.magic_arguments()
-    @magic_arguments.argument(
-        '-a', '--append', action='store_true', default=False,
-        help='Append contents of the cell to an existing file. '
-             'The file will be created if it does not exist.'
-    )
-    @magic_arguments.argument(
-        'filename', type=str,
-        help='file to write'
-    )
-    @cell_magic
-    def writefile(self, line, cell):
-        """Write the contents of the cell to a file.
-
-        The file will be overwritten unless the -a (--append) flag is specified.
-        """
-        args = magic_arguments.parse_argstring(self.writefile, line)
-        if re.match(r'^(\'.*\')|(".*")$', args.filename):
-            filename = os.path.expanduser(args.filename[1:-1])
-        else:
-            filename = os.path.expanduser(args.filename)
-            
-        if os.path.exists(filename):
-            if args.append:
-                print("Appending to %s" % filename)
-            else:
-                print("Overwriting %s" % filename)
-        else:
-            print("Writing %s" % filename)
-        
-        mode = 'a' if args.append else 'w'
-        with io.open(filename, mode, encoding='utf-8') as f:
-            f.write(cell)
diff --git a/spaces/SungBeom/chatwine-korean/.venv/Lib/site-packages/aiohttp/client_exceptions.py b/spaces/SungBeom/chatwine-korean/.venv/Lib/site-packages/aiohttp/client_exceptions.py
deleted file mode 100644
index c640e1e7fbdf8c56a9e744492d99f8ca32988142..0000000000000000000000000000000000000000
--- a/spaces/SungBeom/chatwine-korean/.venv/Lib/site-packages/aiohttp/client_exceptions.py
+++ /dev/null
@@ -1,342 +0,0 @@
-"""HTTP related errors."""
-
-import asyncio
-import warnings
-from typing import TYPE_CHECKING, Any, Optional, Tuple, Union
-
-from .http_parser import RawResponseMessage
-from .typedefs import LooseHeaders
-
-try:
-    import ssl
-
-    SSLContext = ssl.SSLContext
-except ImportError:  # pragma: no cover
-    ssl = SSLContext = None  # type: ignore[assignment]
-
-
-if TYPE_CHECKING:  # pragma: no cover
-    from .client_reqrep import ClientResponse, ConnectionKey, Fingerprint, RequestInfo
-else:
-    RequestInfo = ClientResponse = ConnectionKey = None
-
-__all__ = (
-    "ClientError",
-    "ClientConnectionError",
-    "ClientOSError",
-    "ClientConnectorError",
-    "ClientProxyConnectionError",
-    "ClientSSLError",
-    "ClientConnectorSSLError",
-    "ClientConnectorCertificateError",
-    "ServerConnectionError",
-    "ServerTimeoutError",
-    "ServerDisconnectedError",
-    "ServerFingerprintMismatch",
-    "ClientResponseError",
-    "ClientHttpProxyError",
-    "WSServerHandshakeError",
-    "ContentTypeError",
-    "ClientPayloadError",
-    "InvalidURL",
-)
-
-
-class ClientError(Exception):
-    """Base class for client connection errors."""
-
-
-class ClientResponseError(ClientError):
-    """Connection error during reading response.
-
-    request_info: instance of RequestInfo
-    """
-
-    def __init__(
-        self,
-        request_info: RequestInfo,
-        history: Tuple[ClientResponse, ...],
-        *,
-        code: Optional[int] = None,
-        status: Optional[int] = None,
-        message: str = "",
-        headers: Optional[LooseHeaders] = None,
-    ) -> None:
-        self.request_info = request_info
-        if code is not None:
-            if status is not None:
-                raise ValueError(
-                    "Both code and status arguments are provided; "
-                    "code is deprecated, use status instead"
-                )
-            warnings.warn(
-                "code argument is deprecated, use status instead",
-                DeprecationWarning,
-                stacklevel=2,
-            )
-        if status is not None:
-            self.status = status
-        elif code is not None:
-            self.status = code
-        else:
-            self.status = 0
-        self.message = message
-        self.headers = headers
-        self.history = history
-        self.args = (request_info, history)
-
-    def __str__(self) -> str:
-        return "{}, message={!r}, url={!r}".format(
-            self.status,
-            self.message,
-            self.request_info.real_url,
-        )
-
-    def __repr__(self) -> str:
-        args = f"{self.request_info!r}, {self.history!r}"
-        if self.status != 0:
-            args += f", status={self.status!r}"
-        if self.message != "":
-            args += f", message={self.message!r}"
-        if self.headers is not None:
-            args += f", headers={self.headers!r}"
-        return f"{type(self).__name__}({args})"
-
-    @property
-    def code(self) -> int:
-        warnings.warn(
-            "code property is deprecated, use status instead",
-            DeprecationWarning,
-            stacklevel=2,
-        )
-        return self.status
-
-    @code.setter
-    def code(self, value: int) -> None:
-        warnings.warn(
-            "code property is deprecated, use status instead",
-            DeprecationWarning,
-            stacklevel=2,
-        )
-        self.status = value
-
-
-class ContentTypeError(ClientResponseError):
-    """ContentType found is not valid."""
-
-
-class WSServerHandshakeError(ClientResponseError):
-    """websocket server handshake error."""
-
-
-class ClientHttpProxyError(ClientResponseError):
-    """HTTP proxy error.
-
-    Raised in :class:`aiohttp.connector.TCPConnector` if
-    proxy responds with status other than ``200 OK``
-    on ``CONNECT`` request.
-    """
-
-
-class TooManyRedirects(ClientResponseError):
-    """Client was redirected too many times."""
-
-
-class ClientConnectionError(ClientError):
-    """Base class for client socket errors."""
-
-
-class ClientOSError(ClientConnectionError, OSError):
-    """OSError error."""
-
-
-class ClientConnectorError(ClientOSError):
-    """Client connector error.
-
-    Raised in :class:`aiohttp.connector.TCPConnector` if
-        a connection can not be established.
-    """
-
-    def __init__(self, connection_key: ConnectionKey, os_error: OSError) -> None:
-        self._conn_key = connection_key
-        self._os_error = os_error
-        super().__init__(os_error.errno, os_error.strerror)
-        self.args = (connection_key, os_error)
-
-    @property
-    def os_error(self) -> OSError:
-        return self._os_error
-
-    @property
-    def host(self) -> str:
-        return self._conn_key.host
-
-    @property
-    def port(self) -> Optional[int]:
-        return self._conn_key.port
-
-    @property
-    def ssl(self) -> Union[SSLContext, None, bool, "Fingerprint"]:
-        return self._conn_key.ssl
-
-    def __str__(self) -> str:
-        return "Cannot connect to host {0.host}:{0.port} ssl:{1} [{2}]".format(
-            self, self.ssl if self.ssl is not None else "default", self.strerror
-        )
-
-    # OSError.__reduce__ does too much black magick
-    __reduce__ = BaseException.__reduce__
-
-
-class ClientProxyConnectionError(ClientConnectorError):
-    """Proxy connection error.
-
-    Raised in :class:`aiohttp.connector.TCPConnector` if
-        connection to proxy can not be established.
-    """
-
-
-class UnixClientConnectorError(ClientConnectorError):
-    """Unix connector error.
-
-    Raised in :py:class:`aiohttp.connector.UnixConnector`
-    if connection to unix socket can not be established.
-    """
-
-    def __init__(
-        self, path: str, connection_key: ConnectionKey, os_error: OSError
-    ) -> None:
-        self._path = path
-        super().__init__(connection_key, os_error)
-
-    @property
-    def path(self) -> str:
-        return self._path
-
-    def __str__(self) -> str:
-        return "Cannot connect to unix socket {0.path} ssl:{1} [{2}]".format(
-            self, self.ssl if self.ssl is not None else "default", self.strerror
-        )
-
-
-class ServerConnectionError(ClientConnectionError):
-    """Server connection errors."""
-
-
-class ServerDisconnectedError(ServerConnectionError):
-    """Server disconnected."""
-
-    def __init__(self, message: Union[RawResponseMessage, str, None] = None) -> None:
-        if message is None:
-            message = "Server disconnected"
-
-        self.args = (message,)
-        self.message = message
-
-
-class ServerTimeoutError(ServerConnectionError, asyncio.TimeoutError):
-    """Server timeout error."""
-
-
-class ServerFingerprintMismatch(ServerConnectionError):
-    """SSL certificate does not match expected fingerprint."""
-
-    def __init__(self, expected: bytes, got: bytes, host: str, port: int) -> None:
-        self.expected = expected
-        self.got = got
-        self.host = host
-        self.port = port
-        self.args = (expected, got, host, port)
-
-    def __repr__(self) -> str:
-        return "<{} expected={!r} got={!r} host={!r} port={!r}>".format(
-            self.__class__.__name__, self.expected, self.got, self.host, self.port
-        )
-
-
-class ClientPayloadError(ClientError):
-    """Response payload error."""
-
-
-class InvalidURL(ClientError, ValueError):
-    """Invalid URL.
-
-    URL used for fetching is malformed, e.g. it doesn't contains host
-    part.
-    """
-
-    # Derive from ValueError for backward compatibility
-
-    def __init__(self, url: Any) -> None:
-        # The type of url is not yarl.URL because the exception can be raised
-        # on URL(url) call
-        super().__init__(url)
-
-    @property
-    def url(self) -> Any:
-        return self.args[0]
-
-    def __repr__(self) -> str:
-        return f"<{self.__class__.__name__} {self.url}>"
-
-
-class ClientSSLError(ClientConnectorError):
-    """Base error for ssl.*Errors."""
-
-
-if ssl is not None:
-    cert_errors = (ssl.CertificateError,)
-    cert_errors_bases = (
-        ClientSSLError,
-        ssl.CertificateError,
-    )
-
-    ssl_errors = (ssl.SSLError,)
-    ssl_error_bases = (ClientSSLError, ssl.SSLError)
-else:  # pragma: no cover
-    cert_errors = tuple()
-    cert_errors_bases = (
-        ClientSSLError,
-        ValueError,
-    )
-
-    ssl_errors = tuple()
-    ssl_error_bases = (ClientSSLError,)
-
-
-class ClientConnectorSSLError(*ssl_error_bases):  # type: ignore[misc]
-    """Response ssl error."""
-
-
-class ClientConnectorCertificateError(*cert_errors_bases):  # type: ignore[misc]
-    """Response certificate error."""
-
-    def __init__(
-        self, connection_key: ConnectionKey, certificate_error: Exception
-    ) -> None:
-        self._conn_key = connection_key
-        self._certificate_error = certificate_error
-        self.args = (connection_key, certificate_error)
-
-    @property
-    def certificate_error(self) -> Exception:
-        return self._certificate_error
-
-    @property
-    def host(self) -> str:
-        return self._conn_key.host
-
-    @property
-    def port(self) -> Optional[int]:
-        return self._conn_key.port
-
-    @property
-    def ssl(self) -> bool:
-        return self._conn_key.is_ssl
-
-    def __str__(self) -> str:
-        return (
-            "Cannot connect to host {0.host}:{0.port} ssl:{0.ssl} "
-            "[{0.certificate_error.__class__.__name__}: "
-            "{0.certificate_error.args}]".format(self)
-        )
diff --git a/spaces/SungBeom/chatwine-korean/.venv/Lib/site-packages/altair/utils/save.py b/spaces/SungBeom/chatwine-korean/.venv/Lib/site-packages/altair/utils/save.py
deleted file mode 100644
index 90d36f14bc5ebf5cb1e07cb469191ed21e4b3f4b..0000000000000000000000000000000000000000
--- a/spaces/SungBeom/chatwine-korean/.venv/Lib/site-packages/altair/utils/save.py
+++ /dev/null
@@ -1,176 +0,0 @@
-import json
-import pathlib
-import warnings
-
-from .mimebundle import spec_to_mimebundle
-from ..vegalite.v5.data import data_transformers
-
-
-def write_file_or_filename(fp, content, mode="w", encoding=None):
-    """Write content to fp, whether fp is a string, a pathlib Path or a
-    file-like object"""
-    if isinstance(fp, str) or isinstance(fp, pathlib.PurePath):
-        with open(file=fp, mode=mode, encoding=encoding) as f:
-            f.write(content)
-    else:
-        fp.write(content)
-
-
-def set_inspect_format_argument(format, fp, inline):
-    """Inspect the format argument in the save function"""
-    if format is None:
-        if isinstance(fp, str):
-            format = fp.split(".")[-1]
-        elif isinstance(fp, pathlib.PurePath):
-            format = fp.suffix.lstrip(".")
-        else:
-            raise ValueError(
-                "must specify file format: "
-                "['png', 'svg', 'pdf', 'html', 'json', 'vega']"
-            )
-
-    if format != "html" and inline:
-        warnings.warn("inline argument ignored for non HTML formats.", stacklevel=1)
-
-    return format
-
-
-def set_inspect_mode_argument(mode, embed_options, spec, vegalite_version):
-    """Inspect the mode argument in the save function"""
-    if mode is None:
-        if "mode" in embed_options:
-            mode = embed_options["mode"]
-        elif "$schema" in spec:
-            mode = spec["$schema"].split("/")[-2]
-        else:
-            mode = "vega-lite"
-
-    if mode != "vega-lite":
-        raise ValueError("mode must be 'vega-lite', " "not '{}'".format(mode))
-
-    if mode == "vega-lite" and vegalite_version is None:
-        raise ValueError("must specify vega-lite version")
-
-    return mode
-
-
-def save(
-    chart,
-    fp,
-    vega_version,
-    vegaembed_version,
-    format=None,
-    mode=None,
-    vegalite_version=None,
-    embed_options=None,
-    json_kwds=None,
-    webdriver=None,
-    scale_factor=1,
-    engine=None,
-    inline=False,
-    **kwargs,
-):
-    """Save a chart to file in a variety of formats
-
-    Supported formats are [json, html, png, svg, pdf]
-
-    Parameters
-    ----------
-    chart : alt.Chart
-        the chart instance to save
-    fp : string filename, pathlib.Path or file-like object
-        file to which to write the chart.
-    format : string (optional)
-        the format to write: one of ['json', 'html', 'png', 'svg', 'pdf'].
-        If not specified, the format will be determined from the filename.
-    mode : string (optional)
-        Must be 'vega-lite'. If not specified, then infer the mode from
-        the '$schema' property of the spec, or the ``opt`` dictionary.
-        If it's not specified in either of those places, then use 'vega-lite'.
-    vega_version : string (optional)
-        For html output, the version of vega.js to use
-    vegalite_version : string (optional)
-        For html output, the version of vegalite.js to use
-    vegaembed_version : string (optional)
-        For html output, the version of vegaembed.js to use
-    embed_options : dict (optional)
-        The vegaEmbed options dictionary. Default is {}
-        (See https://github.com/vega/vega-embed for details)
-    json_kwds : dict (optional)
-        Additional keyword arguments are passed to the output method
-        associated with the specified format.
-    webdriver : string {'chrome' | 'firefox'} (optional)
-        Webdriver to use for png or svg output
-    scale_factor : float (optional)
-        scale_factor to use to change size/resolution of png or svg output
-    engine: string {'vl-convert', 'altair_saver'}
-        the conversion engine to use for 'png', 'svg', and 'pdf' formats
-    inline: bool (optional)
-        If False (default), the required JavaScript libraries are loaded
-        from a CDN location in the resulting html file.
-        If True, the required JavaScript libraries are inlined into the resulting
-        html file so that it will work without an internet connection.
-        The altair_viewer package is required if True.
-    **kwargs :
-        additional kwargs passed to spec_to_mimebundle.
-    """
-    if json_kwds is None:
-        json_kwds = {}
-
-    if embed_options is None:
-        embed_options = {}
-
-    format = set_inspect_format_argument(format, fp, inline)
-
-    # Temporarily turn off any data transformers so that all data is inlined
-    # when calling chart.to_dict. This is relevant for vl-convert which cannot access
-    # local json files which could be created by a json data transformer. Furthermore,
-    # we don't exit the with statement until this function completed due to the issue
-    # described at https://github.com/vega/vl-convert/issues/31
-    with data_transformers.enable("default"), data_transformers.disable_max_rows():
-        spec = chart.to_dict()
-
-        mode = set_inspect_mode_argument(mode, embed_options, spec, vegalite_version)
-
-        if format == "json":
-            json_spec = json.dumps(spec, **json_kwds)
-            write_file_or_filename(fp, json_spec, mode="w")
-        elif format == "html":
-            if inline:
-                kwargs["template"] = "inline"
-            mimebundle = spec_to_mimebundle(
-                spec=spec,
-                format=format,
-                mode=mode,
-                vega_version=vega_version,
-                vegalite_version=vegalite_version,
-                vegaembed_version=vegaembed_version,
-                embed_options=embed_options,
-                json_kwds=json_kwds,
-                **kwargs,
-            )
-            write_file_or_filename(fp, mimebundle["text/html"], mode="w")
-        elif format in ["png", "svg", "pdf", "vega"]:
-            mimebundle = spec_to_mimebundle(
-                spec=spec,
-                format=format,
-                mode=mode,
-                vega_version=vega_version,
-                vegalite_version=vegalite_version,
-                vegaembed_version=vegaembed_version,
-                webdriver=webdriver,
-                scale_factor=scale_factor,
-                engine=engine,
-                **kwargs,
-            )
-            if format == "png":
-                write_file_or_filename(fp, mimebundle["image/png"], mode="wb")
-            elif format == "pdf":
-                write_file_or_filename(fp, mimebundle["application/pdf"], mode="wb")
-            else:
-                encoding = kwargs.get("encoding", "utf-8")
-                write_file_or_filename(
-                    fp, mimebundle["image/svg+xml"], mode="w", encoding=encoding
-                )
-        else:
-            raise ValueError("Unsupported format: '{}'".format(format))
diff --git a/spaces/SungBeom/chatwine-korean/.venv/Lib/site-packages/anyio/pytest_plugin.py b/spaces/SungBeom/chatwine-korean/.venv/Lib/site-packages/anyio/pytest_plugin.py
deleted file mode 100644
index 044ce6914dd70a200cbc90cbbb9abc9135a66340..0000000000000000000000000000000000000000
--- a/spaces/SungBeom/chatwine-korean/.venv/Lib/site-packages/anyio/pytest_plugin.py
+++ /dev/null
@@ -1,142 +0,0 @@
-from __future__ import annotations
-
-from contextlib import contextmanager
-from inspect import isasyncgenfunction, iscoroutinefunction
-from typing import Any, Dict, Generator, Tuple, cast
-
-import pytest
-import sniffio
-
-from ._core._eventloop import get_all_backends, get_asynclib
-from .abc import TestRunner
-
-_current_runner: TestRunner | None = None
-
-
-def extract_backend_and_options(backend: object) -> tuple[str, dict[str, Any]]:
-    if isinstance(backend, str):
-        return backend, {}
-    elif isinstance(backend, tuple) and len(backend) == 2:
-        if isinstance(backend[0], str) and isinstance(backend[1], dict):
-            return cast(Tuple[str, Dict[str, Any]], backend)
-
-    raise TypeError("anyio_backend must be either a string or tuple of (string, dict)")
-
-
-@contextmanager
-def get_runner(
-    backend_name: str, backend_options: dict[str, Any]
-) -> Generator[TestRunner, object, None]:
-    global _current_runner
-    if _current_runner:
-        yield _current_runner
-        return
-
-    asynclib = get_asynclib(backend_name)
-    token = None
-    if sniffio.current_async_library_cvar.get(None) is None:
-        # Since we're in control of the event loop, we can cache the name of the async library
-        token = sniffio.current_async_library_cvar.set(backend_name)
-
-    try:
-        backend_options = backend_options or {}
-        with asynclib.TestRunner(**backend_options) as runner:
-            _current_runner = runner
-            yield runner
-    finally:
-        _current_runner = None
-        if token:
-            sniffio.current_async_library_cvar.reset(token)
-
-
-def pytest_configure(config: Any) -> None:
-    config.addinivalue_line(
-        "markers",
-        "anyio: mark the (coroutine function) test to be run "
-        "asynchronously via anyio.",
-    )
-
-
-def pytest_fixture_setup(fixturedef: Any, request: Any) -> None:
-    def wrapper(*args, anyio_backend, **kwargs):  # type: ignore[no-untyped-def]
-        backend_name, backend_options = extract_backend_and_options(anyio_backend)
-        if has_backend_arg:
-            kwargs["anyio_backend"] = anyio_backend
-
-        with get_runner(backend_name, backend_options) as runner:
-            if isasyncgenfunction(func):
-                yield from runner.run_asyncgen_fixture(func, kwargs)
-            else:
-                yield runner.run_fixture(func, kwargs)
-
-    # Only apply this to coroutine functions and async generator functions in requests that involve
-    # the anyio_backend fixture
-    func = fixturedef.func
-    if isasyncgenfunction(func) or iscoroutinefunction(func):
-        if "anyio_backend" in request.fixturenames:
-            has_backend_arg = "anyio_backend" in fixturedef.argnames
-            fixturedef.func = wrapper
-            if not has_backend_arg:
-                fixturedef.argnames += ("anyio_backend",)
-
-
-@pytest.hookimpl(tryfirst=True)
-def pytest_pycollect_makeitem(collector: Any, name: Any, obj: Any) -> None:
-    if collector.istestfunction(obj, name):
-        inner_func = obj.hypothesis.inner_test if hasattr(obj, "hypothesis") else obj
-        if iscoroutinefunction(inner_func):
-            marker = collector.get_closest_marker("anyio")
-            own_markers = getattr(obj, "pytestmark", ())
-            if marker or any(marker.name == "anyio" for marker in own_markers):
-                pytest.mark.usefixtures("anyio_backend")(obj)
-
-
-@pytest.hookimpl(tryfirst=True)
-def pytest_pyfunc_call(pyfuncitem: Any) -> bool | None:
-    def run_with_hypothesis(**kwargs: Any) -> None:
-        with get_runner(backend_name, backend_options) as runner:
-            runner.run_test(original_func, kwargs)
-
-    backend = pyfuncitem.funcargs.get("anyio_backend")
-    if backend:
-        backend_name, backend_options = extract_backend_and_options(backend)
-
-        if hasattr(pyfuncitem.obj, "hypothesis"):
-            # Wrap the inner test function unless it's already wrapped
-            original_func = pyfuncitem.obj.hypothesis.inner_test
-            if original_func.__qualname__ != run_with_hypothesis.__qualname__:
-                if iscoroutinefunction(original_func):
-                    pyfuncitem.obj.hypothesis.inner_test = run_with_hypothesis
-
-            return None
-
-        if iscoroutinefunction(pyfuncitem.obj):
-            funcargs = pyfuncitem.funcargs
-            testargs = {arg: funcargs[arg] for arg in pyfuncitem._fixtureinfo.argnames}
-            with get_runner(backend_name, backend_options) as runner:
-                runner.run_test(pyfuncitem.obj, testargs)
-
-            return True
-
-    return None
-
-
-@pytest.fixture(params=get_all_backends())
-def anyio_backend(request: Any) -> Any:
-    return request.param
-
-
-@pytest.fixture
-def anyio_backend_name(anyio_backend: Any) -> str:
-    if isinstance(anyio_backend, str):
-        return anyio_backend
-    else:
-        return anyio_backend[0]
-
-
-@pytest.fixture
-def anyio_backend_options(anyio_backend: Any) -> dict[str, Any]:
-    if isinstance(anyio_backend, str):
-        return {}
-    else:
-        return anyio_backend[1]
diff --git a/spaces/SungBeom/chatwine-korean/.venv/Lib/site-packages/backcall/backcall.py b/spaces/SungBeom/chatwine-korean/.venv/Lib/site-packages/backcall/backcall.py
deleted file mode 100644
index fe1fdb5470b04f2e1053b63fa8c365cae0ea1281..0000000000000000000000000000000000000000
--- a/spaces/SungBeom/chatwine-korean/.venv/Lib/site-packages/backcall/backcall.py
+++ /dev/null
@@ -1,109 +0,0 @@
-# -*- coding: utf-8 -*-
-"""
-Created on Mon Jan 13 18:17:15 2014
-
-@author: takluyver
-"""
-import sys
-PY3 = (sys.version_info[0] >= 3)
-
-try:
-    from inspect import signature, Parameter  # Python >= 3.3
-except ImportError:
-    from ._signatures import signature, Parameter
-
-if PY3:
-    from functools import wraps
-else:
-    from functools import wraps as _wraps
-    def wraps(f):
-        def dec(func):
-            _wraps(f)(func)
-            func.__wrapped__ = f
-            return func
-
-        return dec
-
-def callback_prototype(prototype):
-    """Decorator to process a callback prototype.
-    
-    A callback prototype is a function whose signature includes all the values
-    that will be passed by the callback API in question.
-    
-    The original function will be returned, with a ``prototype.adapt`` attribute
-    which can be used to prepare third party callbacks.
-    """
-    protosig = signature(prototype)
-    positional, keyword = [], []
-    for name, param in protosig.parameters.items():
-        if param.kind in (Parameter.VAR_POSITIONAL, Parameter.VAR_KEYWORD):
-            raise TypeError("*args/**kwargs not supported in prototypes")
-
-        if (param.default is not Parameter.empty) \
-            or (param.kind == Parameter.KEYWORD_ONLY):
-            keyword.append(name)
-        else:
-            positional.append(name)
-        
-    kwargs = dict.fromkeys(keyword)
-    def adapt(callback):
-        """Introspect and prepare a third party callback."""
-        sig = signature(callback)
-        try:
-            # XXX: callback can have extra optional parameters - OK?
-            sig.bind(*positional, **kwargs)
-            return callback
-        except TypeError:
-            pass
-        
-        # Match up arguments
-        unmatched_pos = positional[:]
-        unmatched_kw = kwargs.copy()
-        unrecognised = []
-        # TODO: unrecognised parameters with default values - OK?
-        for name, param in sig.parameters.items():
-            # print(name, param.kind) #DBG
-            if param.kind == Parameter.POSITIONAL_ONLY:
-                if len(unmatched_pos) > 0:
-                    unmatched_pos.pop(0)
-                else:
-                    unrecognised.append(name)
-            elif param.kind == Parameter.POSITIONAL_OR_KEYWORD:
-                if (param.default is not Parameter.empty) and (name in unmatched_kw):
-                    unmatched_kw.pop(name)
-                elif len(unmatched_pos) > 0:
-                    unmatched_pos.pop(0)    
-                else:
-                    unrecognised.append(name)
-            elif param.kind == Parameter.VAR_POSITIONAL:
-                unmatched_pos = []
-            elif param.kind == Parameter.KEYWORD_ONLY:
-                if name in unmatched_kw:
-                    unmatched_kw.pop(name)
-                else:
-                    unrecognised.append(name)
-            else:  # VAR_KEYWORD
-                unmatched_kw = {}
-        
-            # print(unmatched_pos, unmatched_kw, unrecognised) #DBG
-        
-        if unrecognised:
-            raise TypeError("Function {!r} had unmatched arguments: {}".format(callback, unrecognised))
-
-        n_positional = len(positional) - len(unmatched_pos)
-
-        @wraps(callback)
-        def adapted(*args, **kwargs):
-            """Wrapper for third party callbacks that discards excess arguments"""
-#            print(args, kwargs)
-            args = args[:n_positional]
-            for name in unmatched_kw:
-                # XXX: Could name not be in kwargs?
-                kwargs.pop(name)
-#            print(args, kwargs, unmatched_pos, cut_positional, unmatched_kw)
-            return callback(*args, **kwargs)
-        
-        return adapted
-
-    prototype.adapt = adapt
-    return prototype
\ No newline at end of file
diff --git a/spaces/Suniilkumaar/SwapMukham/face_parsing/parse_mask.py b/spaces/Suniilkumaar/SwapMukham/face_parsing/parse_mask.py
deleted file mode 100644
index 0be62f879ba778d9c048fcb70b782f59012ec34b..0000000000000000000000000000000000000000
--- a/spaces/Suniilkumaar/SwapMukham/face_parsing/parse_mask.py
+++ /dev/null
@@ -1,107 +0,0 @@
-import cv2
-import torch
-import torchvision
-import numpy as np
-import torch.nn as nn
-from PIL import Image
-from tqdm import tqdm
-import torch.nn.functional as F
-import torchvision.transforms as transforms
-
-from . model import BiSeNet
-
-class SoftErosion(nn.Module):
-    def __init__(self, kernel_size=15, threshold=0.6, iterations=1):
-        super(SoftErosion, self).__init__()
-        r = kernel_size // 2
-        self.padding = r
-        self.iterations = iterations
-        self.threshold = threshold
-
-        # Create kernel
-        y_indices, x_indices = torch.meshgrid(torch.arange(0., kernel_size), torch.arange(0., kernel_size))
-        dist = torch.sqrt((x_indices - r) ** 2 + (y_indices - r) ** 2)
-        kernel = dist.max() - dist
-        kernel /= kernel.sum()
-        kernel = kernel.view(1, 1, *kernel.shape)
-        self.register_buffer('weight', kernel)
-
-    def forward(self, x):
-        batch_size = x.size(0)  # Get the batch size
-        output = []
-
-        for i in tqdm(range(batch_size), desc="Soft-Erosion", leave=False):
-            input_tensor = x[i:i+1]  # Take one input tensor from the batch
-            input_tensor = input_tensor.float()  # Convert input to float tensor
-            input_tensor = input_tensor.unsqueeze(1)  # Add a channel dimension
-
-            for _ in range(self.iterations - 1):
-                input_tensor = torch.min(input_tensor, F.conv2d(input_tensor, weight=self.weight,
-                                                                groups=input_tensor.shape[1],
-                                                                padding=self.padding))
-            input_tensor = F.conv2d(input_tensor, weight=self.weight, groups=input_tensor.shape[1],
-                                    padding=self.padding)
-
-            mask = input_tensor >= self.threshold
-            input_tensor[mask] = 1.0
-            input_tensor[~mask] /= input_tensor[~mask].max()
-
-            input_tensor = input_tensor.squeeze(1)  # Remove the extra channel dimension
-            output.append(input_tensor.detach().cpu().numpy())
-
-        return np.array(output)
-
-transform = transforms.Compose([
-    transforms.Resize((512, 512)),
-    transforms.ToTensor(),
-    transforms.Normalize((0.485, 0.456, 0.406), (0.229, 0.224, 0.225))
-])
-
-
-
-def init_parsing_model(model_path, device="cpu"):
-    net = BiSeNet(19)
-    net.to(device)
-    net.load_state_dict(torch.load(model_path))
-    net.eval()
-    return net
-
-def transform_images(imgs):
-    tensor_images = torch.stack([transform(Image.fromarray(cv2.cvtColor(img, cv2.COLOR_BGR2RGB))) for img in imgs], dim=0)
-    return tensor_images
-
-def get_parsed_mask(net, imgs, classes=[1, 2, 3, 4, 5, 10, 11, 12, 13], device="cpu", batch_size=8, softness=20):
-    if softness > 0:
-        smooth_mask = SoftErosion(kernel_size=17, threshold=0.9, iterations=softness).to(device)
-
-    masks = []
-    for i in tqdm(range(0, len(imgs), batch_size), total=len(imgs) // batch_size, desc="Face-parsing"):
-        batch_imgs = imgs[i:i + batch_size]
-
-        tensor_images = transform_images(batch_imgs).to(device)
-        with torch.no_grad():
-            out = net(tensor_images)[0]
-        # parsing = out.argmax(dim=1)
-        # arget_classes = torch.tensor(classes).to(device)
-        # batch_masks = torch.isin(parsing, target_classes).to(device)
-        ## torch.isin was slightly slower in my test, so using np.isin
-        parsing = out.argmax(dim=1).detach().cpu().numpy()
-        batch_masks = np.isin(parsing, classes).astype('float32')
-
-        if softness > 0:
-            # batch_masks = smooth_mask(batch_masks).transpose(1,0,2,3)[0]
-            mask_tensor = torch.from_numpy(batch_masks.copy()).float().to(device)
-            batch_masks = smooth_mask(mask_tensor).transpose(1,0,2,3)[0]
-
-        yield batch_masks
-
-        #masks.append(batch_masks)
-
-    #if len(masks) >= 1:
-    #    masks = np.concatenate(masks, axis=0)
-    # masks = np.repeat(np.expand_dims(masks, axis=1), 3, axis=1)
-
-    # for i, mask in enumerate(masks):
-    #    cv2.imwrite(f"mask/{i}.jpg", (mask * 255).astype("uint8"))
-
-    #return masks
diff --git a/spaces/Superlang/ImageProcessor/annotator/openpose/body.py b/spaces/Superlang/ImageProcessor/annotator/openpose/body.py
deleted file mode 100644
index 11b10b8db047be9b88f5f0756592fdbae3d85027..0000000000000000000000000000000000000000
--- a/spaces/Superlang/ImageProcessor/annotator/openpose/body.py
+++ /dev/null
@@ -1,278 +0,0 @@
-import cv2
-import numpy as np
-import math
-import time
-from scipy.ndimage.filters import gaussian_filter
-import matplotlib.pyplot as plt
-import matplotlib
-import torch
-from torchvision import transforms
-from typing import NamedTuple, List, Union
-
-from . import util
-from .model import bodypose_model
-
-class Keypoint(NamedTuple):
-    x: float
-    y: float
-    score: float = 1.0
-    id: int = -1
-
-
-class BodyResult(NamedTuple):
-    # Note: Using `Union` instead of `|` operator as the ladder is a Python
-    # 3.10 feature.
-    # Annotator code should be Python 3.8 Compatible, as controlnet repo uses
-    # Python 3.8 environment.
-    # https://github.com/lllyasviel/ControlNet/blob/d3284fcd0972c510635a4f5abe2eeb71dc0de524/environment.yaml#L6
-    keypoints: List[Union[Keypoint, None]]
-    total_score: float
-    total_parts: int
-
-
-class Body(object):
-    def __init__(self, model_path):
-        self.model = bodypose_model()
-        # if torch.cuda.is_available():
-        #     self.model = self.model.cuda()
-            # print('cuda')
-        model_dict = util.transfer(self.model, torch.load(model_path))
-        self.model.load_state_dict(model_dict)
-        self.model.eval()
-
-    def __call__(self, oriImg):
-        # scale_search = [0.5, 1.0, 1.5, 2.0]
-        scale_search = [0.5]
-        boxsize = 368
-        stride = 8
-        padValue = 128
-        thre1 = 0.1
-        thre2 = 0.05
-        multiplier = [x * boxsize / oriImg.shape[0] for x in scale_search]
-        heatmap_avg = np.zeros((oriImg.shape[0], oriImg.shape[1], 19))
-        paf_avg = np.zeros((oriImg.shape[0], oriImg.shape[1], 38))
-
-        for m in range(len(multiplier)):
-            scale = multiplier[m]
-            imageToTest = util.smart_resize_k(oriImg, fx=scale, fy=scale)
-            imageToTest_padded, pad = util.padRightDownCorner(imageToTest, stride, padValue)
-            im = np.transpose(np.float32(imageToTest_padded[:, :, :, np.newaxis]), (3, 2, 0, 1)) / 256 - 0.5
-            im = np.ascontiguousarray(im)
-
-            data = torch.from_numpy(im).float()
-            if torch.cuda.is_available():
-                data = data.cuda()
-            # data = data.permute([2, 0, 1]).unsqueeze(0).float()
-            with torch.no_grad():
-                data = data.to(self.cn_device)
-                Mconv7_stage6_L1, Mconv7_stage6_L2 = self.model(data)
-            Mconv7_stage6_L1 = Mconv7_stage6_L1.cpu().numpy()
-            Mconv7_stage6_L2 = Mconv7_stage6_L2.cpu().numpy()
-
-            # extract outputs, resize, and remove padding
-            # heatmap = np.transpose(np.squeeze(net.blobs[output_blobs.keys()[1]].data), (1, 2, 0))  # output 1 is heatmaps
-            heatmap = np.transpose(np.squeeze(Mconv7_stage6_L2), (1, 2, 0))  # output 1 is heatmaps
-            heatmap = util.smart_resize_k(heatmap, fx=stride, fy=stride)
-            heatmap = heatmap[:imageToTest_padded.shape[0] - pad[2], :imageToTest_padded.shape[1] - pad[3], :]
-            heatmap = util.smart_resize(heatmap, (oriImg.shape[0], oriImg.shape[1]))
-
-            # paf = np.transpose(np.squeeze(net.blobs[output_blobs.keys()[0]].data), (1, 2, 0))  # output 0 is PAFs
-            paf = np.transpose(np.squeeze(Mconv7_stage6_L1), (1, 2, 0))  # output 0 is PAFs
-            paf = util.smart_resize_k(paf, fx=stride, fy=stride)
-            paf = paf[:imageToTest_padded.shape[0] - pad[2], :imageToTest_padded.shape[1] - pad[3], :]
-            paf = util.smart_resize(paf, (oriImg.shape[0], oriImg.shape[1]))
-
-            heatmap_avg += heatmap_avg + heatmap / len(multiplier)
-            paf_avg += + paf / len(multiplier)
-
-        all_peaks = []
-        peak_counter = 0
-
-        for part in range(18):
-            map_ori = heatmap_avg[:, :, part]
-            one_heatmap = gaussian_filter(map_ori, sigma=3)
-
-            map_left = np.zeros(one_heatmap.shape)
-            map_left[1:, :] = one_heatmap[:-1, :]
-            map_right = np.zeros(one_heatmap.shape)
-            map_right[:-1, :] = one_heatmap[1:, :]
-            map_up = np.zeros(one_heatmap.shape)
-            map_up[:, 1:] = one_heatmap[:, :-1]
-            map_down = np.zeros(one_heatmap.shape)
-            map_down[:, :-1] = one_heatmap[:, 1:]
-
-            peaks_binary = np.logical_and.reduce(
-                (one_heatmap >= map_left, one_heatmap >= map_right, one_heatmap >= map_up, one_heatmap >= map_down, one_heatmap > thre1))
-            peaks = list(zip(np.nonzero(peaks_binary)[1], np.nonzero(peaks_binary)[0]))  # note reverse
-            peaks_with_score = [x + (map_ori[x[1], x[0]],) for x in peaks]
-            peak_id = range(peak_counter, peak_counter + len(peaks))
-            peaks_with_score_and_id = [peaks_with_score[i] + (peak_id[i],) for i in range(len(peak_id))]
-
-            all_peaks.append(peaks_with_score_and_id)
-            peak_counter += len(peaks)
-
-        # find connection in the specified sequence, center 29 is in the position 15
-        limbSeq = [[2, 3], [2, 6], [3, 4], [4, 5], [6, 7], [7, 8], [2, 9], [9, 10], \
-                   [10, 11], [2, 12], [12, 13], [13, 14], [2, 1], [1, 15], [15, 17], \
-                   [1, 16], [16, 18], [3, 17], [6, 18]]
-        # the middle joints heatmap correpondence
-        mapIdx = [[31, 32], [39, 40], [33, 34], [35, 36], [41, 42], [43, 44], [19, 20], [21, 22], \
-                  [23, 24], [25, 26], [27, 28], [29, 30], [47, 48], [49, 50], [53, 54], [51, 52], \
-                  [55, 56], [37, 38], [45, 46]]
-
-        connection_all = []
-        special_k = []
-        mid_num = 10
-
-        for k in range(len(mapIdx)):
-            score_mid = paf_avg[:, :, [x - 19 for x in mapIdx[k]]]
-            candA = all_peaks[limbSeq[k][0] - 1]
-            candB = all_peaks[limbSeq[k][1] - 1]
-            nA = len(candA)
-            nB = len(candB)
-            indexA, indexB = limbSeq[k]
-            if (nA != 0 and nB != 0):
-                connection_candidate = []
-                for i in range(nA):
-                    for j in range(nB):
-                        vec = np.subtract(candB[j][:2], candA[i][:2])
-                        norm = math.sqrt(vec[0] * vec[0] + vec[1] * vec[1])
-                        norm = max(0.001, norm)
-                        vec = np.divide(vec, norm)
-
-                        startend = list(zip(np.linspace(candA[i][0], candB[j][0], num=mid_num), \
-                                            np.linspace(candA[i][1], candB[j][1], num=mid_num)))
-
-                        vec_x = np.array([score_mid[int(round(startend[I][1])), int(round(startend[I][0])), 0] \
-                                          for I in range(len(startend))])
-                        vec_y = np.array([score_mid[int(round(startend[I][1])), int(round(startend[I][0])), 1] \
-                                          for I in range(len(startend))])
-
-                        score_midpts = np.multiply(vec_x, vec[0]) + np.multiply(vec_y, vec[1])
-                        score_with_dist_prior = sum(score_midpts) / len(score_midpts) + min(
-                            0.5 * oriImg.shape[0] / norm - 1, 0)
-                        criterion1 = len(np.nonzero(score_midpts > thre2)[0]) > 0.8 * len(score_midpts)
-                        criterion2 = score_with_dist_prior > 0
-                        if criterion1 and criterion2:
-                            connection_candidate.append(
-                                [i, j, score_with_dist_prior, score_with_dist_prior + candA[i][2] + candB[j][2]])
-
-                connection_candidate = sorted(connection_candidate, key=lambda x: x[2], reverse=True)
-                connection = np.zeros((0, 5))
-                for c in range(len(connection_candidate)):
-                    i, j, s = connection_candidate[c][0:3]
-                    if (i not in connection[:, 3] and j not in connection[:, 4]):
-                        connection = np.vstack([connection, [candA[i][3], candB[j][3], s, i, j]])
-                        if (len(connection) >= min(nA, nB)):
-                            break
-
-                connection_all.append(connection)
-            else:
-                special_k.append(k)
-                connection_all.append([])
-
-        # last number in each row is the total parts number of that person
-        # the second last number in each row is the score of the overall configuration
-        subset = -1 * np.ones((0, 20))
-        candidate = np.array([item for sublist in all_peaks for item in sublist])
-
-        for k in range(len(mapIdx)):
-            if k not in special_k:
-                partAs = connection_all[k][:, 0]
-                partBs = connection_all[k][:, 1]
-                indexA, indexB = np.array(limbSeq[k]) - 1
-
-                for i in range(len(connection_all[k])):  # = 1:size(temp,1)
-                    found = 0
-                    subset_idx = [-1, -1]
-                    for j in range(len(subset)):  # 1:size(subset,1):
-                        if subset[j][indexA] == partAs[i] or subset[j][indexB] == partBs[i]:
-                            subset_idx[found] = j
-                            found += 1
-
-                    if found == 1:
-                        j = subset_idx[0]
-                        if subset[j][indexB] != partBs[i]:
-                            subset[j][indexB] = partBs[i]
-                            subset[j][-1] += 1
-                            subset[j][-2] += candidate[partBs[i].astype(int), 2] + connection_all[k][i][2]
-                    elif found == 2:  # if found 2 and disjoint, merge them
-                        j1, j2 = subset_idx
-                        membership = ((subset[j1] >= 0).astype(int) + (subset[j2] >= 0).astype(int))[:-2]
-                        if len(np.nonzero(membership == 2)[0]) == 0:  # merge
-                            subset[j1][:-2] += (subset[j2][:-2] + 1)
-                            subset[j1][-2:] += subset[j2][-2:]
-                            subset[j1][-2] += connection_all[k][i][2]
-                            subset = np.delete(subset, j2, 0)
-                        else:  # as like found == 1
-                            subset[j1][indexB] = partBs[i]
-                            subset[j1][-1] += 1
-                            subset[j1][-2] += candidate[partBs[i].astype(int), 2] + connection_all[k][i][2]
-
-                    # if find no partA in the subset, create a new subset
-                    elif not found and k < 17:
-                        row = -1 * np.ones(20)
-                        row[indexA] = partAs[i]
-                        row[indexB] = partBs[i]
-                        row[-1] = 2
-                        row[-2] = sum(candidate[connection_all[k][i, :2].astype(int), 2]) + connection_all[k][i][2]
-                        subset = np.vstack([subset, row])
-        # delete some rows of subset which has few parts occur
-        deleteIdx = []
-        for i in range(len(subset)):
-            if subset[i][-1] < 4 or subset[i][-2] / subset[i][-1] < 0.4:
-                deleteIdx.append(i)
-        subset = np.delete(subset, deleteIdx, axis=0)
-
-        # subset: n*20 array, 0-17 is the index in candidate, 18 is the total score, 19 is the total parts
-        # candidate: x, y, score, id
-        return candidate, subset
-    
-    @staticmethod
-    def format_body_result(candidate: np.ndarray, subset: np.ndarray) -> List[BodyResult]:
-        """
-        Format the body results from the candidate and subset arrays into a list of BodyResult objects.
-        
-        Args:
-            candidate (np.ndarray): An array of candidates containing the x, y coordinates, score, and id
-                for each body part.
-            subset (np.ndarray): An array of subsets containing indices to the candidate array for each
-                person detected. The last two columns of each row hold the total score and total parts
-                of the person.
-
-        Returns:
-            List[BodyResult]: A list of BodyResult objects, where each object represents a person with
-                detected keypoints, total score, and total parts.
-        """
-        return [
-            BodyResult(
-                keypoints=[
-                    Keypoint(
-                        x=candidate[candidate_index][0],
-                        y=candidate[candidate_index][1],
-                        score=candidate[candidate_index][2],
-                        id=candidate[candidate_index][3]
-                    ) if candidate_index != -1 else None
-                    for candidate_index in person[:18].astype(int)
-                ],
-                total_score=person[18],
-                total_parts=person[19]
-            )
-            for person in subset
-        ]
-    
-
-if __name__ == "__main__":
-    body_estimation = Body('../model/body_pose_model.pth')
-
-    test_image = '../images/ski.jpg'
-    oriImg = cv2.imread(test_image)  # B,G,R order
-    candidate, subset = body_estimation(oriImg)
-    bodies = body_estimation.format_body_result(candidate, subset)
-
-    canvas = oriImg
-    for body in bodies:
-        canvas = util.draw_bodypose(canvas, body)
-        
-    plt.imshow(canvas[:, :, [2, 1, 0]])
-    plt.show()
\ No newline at end of file
diff --git a/spaces/TabPFN/TabPFNEvaluation/TabPFN/train.py b/spaces/TabPFN/TabPFNEvaluation/TabPFN/train.py
deleted file mode 100644
index edfe5cd0a5d9811cff22f362936cb15d5ed504a4..0000000000000000000000000000000000000000
--- a/spaces/TabPFN/TabPFNEvaluation/TabPFN/train.py
+++ /dev/null
@@ -1,386 +0,0 @@
-import os
-import itertools
-import argparse
-import time
-import datetime
-import yaml
-from contextlib import nullcontext
-
-
-import torch
-from torch import nn
-
-import utils
-from transformer import TransformerModel
-from utils import get_cosine_schedule_with_warmup, get_openai_lr, StoreDictKeyPair, get_weighted_single_eval_pos_sampler, get_uniform_single_eval_pos_sampler
-import priors
-import encoders
-import positional_encodings
-from utils import init_dist
-from torch.cuda.amp import autocast
-
-class Losses():
-    gaussian = nn.GaussianNLLLoss(full=True, reduction='none')
-    mse = nn.MSELoss(reduction='none')
-    ce = lambda weight : nn.CrossEntropyLoss(reduction='none', weight=weight)
-    bce = nn.BCEWithLogitsLoss(reduction='none')
-
-
-def train(priordataloader_class, criterion, encoder_generator, emsize=200, nhid=200, nlayers=6, nhead=2, dropout=0.2,
-          epochs=10, steps_per_epoch=100, batch_size=200, bptt=10, lr=None, weight_decay=0.0, warmup_epochs=10, input_normalization=False,
-          y_encoder_generator=None, pos_encoder_generator=None, decoder=None, extra_prior_kwargs_dict={}, scheduler=get_cosine_schedule_with_warmup,
-          load_weights_from_this_state_dict=None, validation_period=10, single_eval_pos_gen=None, bptt_extra_samples=None, gpu_device='cuda:0',
-          aggregate_k_gradients=1, verbose=True, style_encoder_generator=None, check_is_compatible=True, epoch_callback=None,
-          initializer=None, initialize_with_model=None, train_mixed_precision=False, total_available_time_in_s=None, normalize_labels=True, **model_extra_args
-          ):
-    assert (epochs is None) != (total_available_time_in_s is None)
-    start_of_training = time.time()
-    device = gpu_device if torch.cuda.is_available() else 'cpu:0'
-    print(f'Using {device} device')
-    using_dist, rank, device = init_dist(device)
-    bptt_sampler = (lambda : single_eval_pos_gen() + bptt_extra_samples if callable(single_eval_pos_gen) else single_eval_pos_gen + bptt_extra_samples) if bptt_extra_samples is not None else bptt
-    dl = priordataloader_class(num_steps=steps_per_epoch, batch_size=batch_size, seq_len=bptt_sampler, seq_len_maximum=bptt+(bptt_extra_samples if bptt_extra_samples else 0), device=device, **extra_prior_kwargs_dict)
-    if dl.fuse_x_y:
-        raise Exception("Illegal parameter")
-
-    encoder = encoder_generator(dl.num_features+1 if dl.fuse_x_y else dl.num_features,emsize)
-    style_def = next(iter(dl))[0][0] # This is (style, x, y), target with x and y with batch size
-
-    style_encoder = style_encoder_generator(hyperparameter_definitions=style_def[0], em_size=emsize) if (style_def is not None) else None
-    n_out = dl.num_outputs
-    if isinstance(criterion, nn.GaussianNLLLoss):
-        n_out *= 2
-    elif isinstance(criterion, nn.CrossEntropyLoss):
-        n_out *= criterion.weight.shape[0]
-    model = TransformerModel(encoder, n_out, emsize, nhead, nhid, nlayers, dropout, style_encoder=style_encoder,
-                             y_encoder=y_encoder_generator(dl.num_outputs, emsize), input_normalization=input_normalization,
-                             pos_encoder=(pos_encoder_generator or positional_encodings.NoPositionalEncoding)(emsize, bptt*2),
-                             decoder=decoder, init_method=initializer, **model_extra_args
-                             )
-    model.criterion = criterion
-    if load_weights_from_this_state_dict is not None:
-        model.load_state_dict(load_weights_from_this_state_dict)
-    if initialize_with_model is not None:
-        model.init_from_small_model(initialize_with_model)
-
-    print(f"Using a Transformer with {sum(p.numel() for p in model.parameters())/1000/1000:.{2}f} M parameters")
-
-    try:
-        for (k, v), (k2, v2) in zip(model.state_dict().items(), initialize_with_model.state_dict().items()):
-            print(k, ((v - v2) / v).abs().mean(), v.shape)
-    except Exception:
-        pass
-
-    model.to(device)
-    if using_dist:
-        print("Distributed training")
-        model = torch.nn.parallel.DistributedDataParallel(model, device_ids=[rank], output_device=rank, broadcast_buffers=False)
-
-
-    # learning rate
-    if lr is None:
-        lr = get_openai_lr(model)
-        print(f"Using OpenAI max lr of {lr}.")
-    optimizer = torch.optim.AdamW(model.parameters(), lr=lr, weight_decay=weight_decay)
-    scheduler = scheduler(optimizer, warmup_epochs, epochs if epochs is not None else 100) # when training for fixed time lr schedule takes 100 steps
-
-    def train_step():
-        model.train()  # Turn on the train mode
-        total_loss = 0.
-        total_positional_losses = 0.
-        total_positional_losses_recorded = 0
-        before_get_batch = time.time()
-        assert len(dl) % aggregate_k_gradients == 0, 'Please set the number of steps per epoch s.t. `aggregate_k_gradients` divides it.'
-        valid_batch_steps = 0.0
-        for batch, (data, targets) in enumerate(dl):
-            if using_dist and not (batch % aggregate_k_gradients == aggregate_k_gradients - 1):
-                cm = model.no_sync()
-                #print(f'p={rank}, no_sync', force=True)
-            else:
-                cm = nullcontext()
-                #print(f'p={rank}, sync', force=True)
-            with cm:
-                time_to_get_batch = time.time() - before_get_batch
-                before_forward = time.time()
-                if bptt_extra_samples is None:
-                    single_eval_pos = single_eval_pos_gen() if callable(single_eval_pos_gen) else single_eval_pos_gen
-                else:
-                    single_eval_pos = targets.shape[0] - bptt_extra_samples
-
-                is_compatible = torch.ones((targets.shape[1])).bool()
-                if check_is_compatible or normalize_labels:
-                    for b in range(targets.shape[1]):
-                        targets_in_train = torch.unique(targets[:single_eval_pos, b], sorted=True)
-                        targets_in_eval = torch.unique(targets[single_eval_pos:, b], sorted=True)
-
-                        if check_is_compatible:
-                            is_compatible[b] = len(targets_in_train) == len(targets_in_eval) and (targets_in_train == targets_in_eval).all()
-                            is_compatible[b] = is_compatible[b] and len(targets_in_train) > 1
-
-                        # Set targets to range starting from 0 (e.g. targets 0, 2, 5, 2 will be converted to 0, 1, 2, 1)
-                        if normalize_labels:
-                            targets[:, b] = (targets[:, b] > torch.unique(targets[:, b]).unsqueeze(1)).sum(axis=0).unsqueeze(0)
-                valid_batch_steps += is_compatible.float().mean()
-                is_compatible = is_compatible.to(device)
-                #if using_dist and check_is_compatible:
-                #    print('step share before reduce',curr_step_share, force=True)
-                #    curr_step_share = curr_step_share.to(device)
-                #    torch.distributed.all_reduce_multigpu([curr_step_share], op=torch.distributed.ReduceOp.SUM)
-                #    curr_step_share = curr_step_share.cpu() / torch.distributed.get_world_size()
-                #    print('step share after reduce',curr_step_share, torch.distributed.get_world_size(), force=True)
-
-                # If style is set to None, it should not be transferred to device
-                output = model(tuple(e.to(device) if torch.is_tensor(e) else e for e in data) if isinstance(data, tuple) else data.to(device)
-                               , single_eval_pos=single_eval_pos)
-
-                forward_time = time.time() - before_forward
-
-                #output, targets = output[:, is_compatible], targets[:, is_compatible]
-
-                if single_eval_pos is not None:
-                    targets = targets[single_eval_pos:]
-                if isinstance(criterion, nn.GaussianNLLLoss):
-                    assert output.shape[-1] == 2, \
-                        'need to write a little bit of code to handle multiple regression targets at once'
-
-                    mean_pred = output[..., 0]
-                    var_pred = output[..., 1].abs()
-                    losses = criterion(mean_pred.flatten(), targets.to(device).flatten(), var=var_pred.flatten())
-                elif isinstance(criterion, (nn.MSELoss, nn.BCEWithLogitsLoss)):
-                    losses = criterion(output.flatten(), targets.to(device).flatten())
-                elif isinstance(criterion, (nn.CrossEntropyLoss)):
-                    #print(n_out, targets.min(), targets.max(), force=True)
-                    losses = criterion(output.reshape(-1, n_out), targets.to(device).long().flatten())
-                else:
-                    losses = criterion(output.reshape(-1, n_out), targets.to(device).flatten())
-                losses = losses.view(*output.shape[0:2])
-                loss = losses.mean(0) @ is_compatible.float() / losses.shape[1]
-                #loss = torch_nanmean(losses, axis=[0, 1]) * is_compatible.float().mean()
-                # not sure whether we can go without the nan checks.
-
-                loss.backward()
-
-                if ((batch % aggregate_k_gradients == aggregate_k_gradients - 1) and (not check_is_compatible or using_dist))\
-                        or (valid_batch_steps >= aggregate_k_gradients and (check_is_compatible and not using_dist)):
-                    with torch.no_grad():
-                        for p in model.parameters():
-                            if p.grad is not None:
-                                p.grad.div_(valid_batch_steps)
-                    torch.nn.utils.clip_grad_norm_(model.parameters(), 1.)
-                    try:
-                        optimizer.step()
-                    except:
-                        print("Invalid optimization step encountered")
-                    optimizer.zero_grad()
-                    valid_batch_steps = 0.0
-
-                step_time = time.time() - before_forward
-
-                if not torch.isnan(loss):
-                    total_loss += loss.item()
-                    total_positional_losses += losses.mean(1).cpu().detach() if single_eval_pos is None else \
-                        nn.functional.one_hot(torch.tensor(single_eval_pos), bptt)*loss.cpu().detach()
-
-                    total_positional_losses_recorded += torch.ones(bptt) if single_eval_pos is None else \
-                        nn.functional.one_hot(torch.tensor(single_eval_pos), bptt)
-
-            before_get_batch = time.time()
-        return total_loss / steps_per_epoch, (
-                    total_positional_losses / total_positional_losses_recorded).tolist(), time_to_get_batch, forward_time, step_time
-
-    best_val_loss = float("inf")
-    best_model = None
-    total_loss = float('inf')
-    total_positional_losses = float('inf')
-    try:
-        for epoch in (range(1, epochs + 1) if epochs is not None else itertools.count(1)):
-
-            epoch_start_time = time.time()
-            if train_mixed_precision:
-                with autocast():
-                    total_loss, total_positional_losses, time_to_get_batch, forward_time, step_time = train_step()
-            else:
-                total_loss, total_positional_losses, time_to_get_batch, forward_time, step_time = train_step()
-            if hasattr(dl, 'validate') and epoch % validation_period == 0:
-                with torch.no_grad():
-                    val_score = dl.validate(model)
-            else:
-                val_score = None
-
-            if verbose:
-                print('-' * 89)
-                print(
-                    f'| end of epoch {epoch:3d} | time: {(time.time() - epoch_start_time):5.2f}s | mean loss {total_loss:5.2f} | '
-                    f"pos losses {','.join([f'{l:5.2f}' for l in total_positional_losses])}, lr {scheduler.get_last_lr()[0]}"
-                    f' data time {time_to_get_batch:5.2f} step time {step_time:5.2f}'
-                    f' forward time {forward_time:5.2f}' + (f'val score {val_score}' if val_score is not None else ''))
-                print('-' * 89)
-
-            # stepping with wallclock time based scheduler
-            current_time = time.time()
-            if epoch_callback is not None and rank == 0:
-                epoch_callback(model, epoch / epochs if total_available_time_in_s is None else  # noqa
-                (current_time - start_of_training) / total_available_time_in_s  # noqa
-                               )
-            if epochs is None and (current_time - start_of_training) > total_available_time_in_s:  # noqa
-                break
-            if epochs is None:
-                scheduler.step((current_time - epoch_start_time) / total_available_time_in_s * 100)
-            else:
-                scheduler.step()
-    except KeyboardInterrupt:
-        pass
-
-    return total_loss, total_positional_losses, model.to('cpu'), dl
-
-def _parse_args(config_parser, parser):
-    # Do we have a config file to parse?
-    args_config, remaining = config_parser.parse_known_args()
-    if args_config.config:
-        with open(args_config.config, 'r') as f:
-            cfg = yaml.safe_load(f)
-            parser.set_defaults(**cfg)
-
-    # The main arg parser parses the rest of the args, the usual
-    # defaults will have been overridden if config file specified.
-    args = parser.parse_args(remaining)
-
-    # Cache the args as a text string to save them in the output dir later
-    args_text = yaml.safe_dump(args.__dict__, default_flow_style=False)
-    return args, args_text
-
-
-if __name__ == '__main__':
-    config_parser = argparse.ArgumentParser(description='Only used as a first parser for the config file path.')
-    config_parser.add_argument('--config')
-    parser = argparse.ArgumentParser()
-    parser.add_argument('prior')
-    parser.add_argument('--loss_function', default='barnll')
-    # Optional Arg's for `--loss_function barnll`
-    parser.add_argument('--min_y', type=float, help='barnll can only model y in strict ranges, this is the minimum y can take.')
-    parser.add_argument('--max_y', type=float, help='barnll can only model y in strict ranges, this is the maximum y can take.')
-    parser.add_argument('--num_buckets', default=100, type=int)
-    #parser.add_argument('--num_features', default=None, type=int, help='Specify depending on the prior.')
-    parser.add_argument("--extra_prior_kwargs_dict", default={'fuse_x_y': False}, dest="extra_prior_kwargs_dict", action=StoreDictKeyPair, nargs="+", metavar="KEY=VAL", help='Specify depending on the prior.')
-    parser.add_argument('--encoder', default='linear', type=str, help='Specify depending on the prior.')
-    parser.add_argument('--y_encoder', default='linear', type=str, help='Specify depending on the prior. You should specify this if you do not fuse x and y.')
-    parser.add_argument('--pos_encoder', default='sinus', type=str, help='Specify depending on the prior.')
-    parser.add_argument('--bptt', default=10, type=int)
-    parser.add_argument('--epochs', default=200, type=int)
-    parser.add_argument('--warmup_epochs', default=50, type=int)
-    parser.add_argument('--validation_period', default=10, type=int)
-    parser.add_argument('--permutation_invariant_max_eval_pos', default=None, type=int, help='Set this to an int to ')
-    parser.add_argument('--permutation_invariant_sampling', default='weighted', help="Only relevant if --permutation_invariant_max_eval_pos is set.")
-
-    # these can likely be mostly left at defaults
-    parser.add_argument('--emsize', default=512, type=int) # sometimes even larger is better e.g. 1024
-    parser.add_argument('--nlayers', default=6, type=int)
-    parser.add_argument('--nhid', default=None, type=int) # 2*emsize is the default
-    parser.add_argument('--nhead', default=4, type=int) # nhead = emsize / 64 in the original paper
-    parser.add_argument('--dropout', default=.0, type=float)
-    parser.add_argument('--steps_per_epoch', default=10, type=int)
-    parser.add_argument('--batch_size', default=1000, type=int)
-    parser.add_argument('--lr', '--learning_rate', default=.001, type=float) # try also .0003, .0001, go lower with lower batch size
-
-    args, _ = _parse_args(config_parser, parser)
-
-    if args.nhid is None:
-        args.nhid = 2*args.emsize
-
-    prior = args.__dict__.pop('prior')
-
-    if prior == 'gp':
-        prior = priors.fast_gp.DataLoader
-    elif prior == 'ridge':
-        prior = priors.ridge.DataLoader
-    elif prior == 'stroke':
-        prior = priors.stroke.DataLoader
-    elif prior == 'mix_gp':
-        prior = priors.fast_gp_mix.DataLoader
-    else:
-        raise NotImplementedError(f'Prior == {prior}.')
-
-    loss_function = args.__dict__.pop('loss_function')
-
-    criterion = nn.GaussianNLLLoss(reduction='none', full=True)
-    classificiation_criterion = nn.CrossEntropyLoss(reduction='none')
-    num_buckets = args.__dict__.pop('num_buckets')
-    max_y = args.__dict__.pop('max_y')
-    min_y = args.__dict__.pop('min_y')
-    # criterion = nn.MSELoss(reduction='none')
-
-    def get_y_sample():
-        dl = prior(num_steps=1, batch_size=args.batch_size * args.steps_per_epoch, seq_len=args.bptt, device=device,
-                   **args.extra_prior_kwargs_dict)
-        y_sample = next(iter(dl))[-1]
-        print(f'Creating Bar distribution with borders from y sample of size {y_sample.numel()}')
-        return y_sample
-
-    if loss_function == 'ce':
-        criterion = nn.CrossEntropyLoss(reduction='none')
-    elif loss_function == 'gaussnll':
-        criterion = nn.GaussianNLLLoss(reduction='none', full=True)
-    elif loss_function == 'mse':
-        criterion = nn.MSELoss(reduction='none')
-    elif loss_function == 'barnll':
-        criterion = BarDistribution(borders=get_bucket_limits(num_buckets, full_range=(min_y,max_y)))
-    elif loss_function == 'adaptivebarnll':
-        borders = get_bucket_limits(num_buckets, ys=get_y_sample(), full_range=(min_y,max_y))
-        criterion = BarDistribution(borders=borders)
-    elif loss_function == 'adaptivefullsupportbarnll':
-        assert min_y is None and max_y is None, "Please do not specify `min_y` and `max_y` with `unboundedadaptivebarnll`."
-        borders = get_bucket_limits(num_buckets, ys=get_y_sample())
-        criterion = FullSupportBarDistribution(borders=borders)
-    else:
-        raise NotImplementedError(f'loss_function == {loss_function}.')
-
-
-
-    encoder = args.__dict__.pop('encoder')
-    y_encoder = args.__dict__.pop('y_encoder')
-
-    def get_encoder_generator(encoder):
-        if encoder == 'linear':
-            encoder_generator = encoders.Linear
-        elif encoder == 'mlp':
-            encoder_generator = encoders.MLP
-        elif encoder == 'positional':
-            encoder_generator = encoders.Positional
-        else:
-            raise NotImplementedError(f'A {encoder} encoder is not valid.')
-        return encoder_generator
-
-    encoder_generator = get_encoder_generator(encoder)
-    y_encoder_generator = get_encoder_generator(y_encoder)
-
-    pos_encoder = args.__dict__.pop('pos_encoder')
-
-    if pos_encoder == 'none':
-        pos_encoder_generator = None
-    elif pos_encoder == 'sinus':
-        pos_encoder_generator = positional_encodings.PositionalEncoding
-    elif pos_encoder == 'learned':
-        pos_encoder_generator = positional_encodings.LearnedPositionalEncoding
-    elif pos_encoder == 'paired_scrambled_learned':
-        pos_encoder_generator = positional_encodings.PairedScrambledPositionalEncodings
-    else:
-        raise NotImplementedError(f'pos_encoer == {pos_encoder} is not valid.')
-
-    permutation_invariant_max_eval_pos = args.__dict__.pop('permutation_invariant_max_eval_pos')
-    permutation_invariant_sampling = args.__dict__.pop('permutation_invariant_sampling')
-    if permutation_invariant_max_eval_pos is not None:
-        if permutation_invariant_sampling == 'weighted':
-            get_sampler = get_weighted_single_eval_pos_sampler
-        elif permutation_invariant_sampling == 'uniform':
-            get_sampler = get_uniform_single_eval_pos_sampler
-        else:
-            raise ValueError()
-        args.__dict__['single_eval_pos_gen'] = get_sampler(permutation_invariant_max_eval_pos)
-
-
-    print("ARGS for `train`:", args.__dict__)
-
-    train(prior, criterion, encoder_generator,
-          y_encoder_generator=y_encoder_generator, pos_encoder_generator=pos_encoder_generator,
-          **args.__dict__)
-
diff --git a/spaces/TandCAcceptMe/face-swap-docker/mynewshinyroop/Lib/site-packages/setuptools/discovery.py b/spaces/TandCAcceptMe/face-swap-docker/mynewshinyroop/Lib/site-packages/setuptools/discovery.py
deleted file mode 100644
index 3110b72794f1e4fd75254bdb3dbf81a89918596e..0000000000000000000000000000000000000000
--- a/spaces/TandCAcceptMe/face-swap-docker/mynewshinyroop/Lib/site-packages/setuptools/discovery.py
+++ /dev/null
@@ -1,611 +0,0 @@
-"""Automatic discovery of Python modules and packages (for inclusion in the
-distribution) and other config values.
-
-For the purposes of this module, the following nomenclature is used:
-
-- "src-layout": a directory representing a Python project that contains a "src"
-  folder. Everything under the "src" folder is meant to be included in the
-  distribution when packaging the project. Example::
-
-    .
-    ├── tox.ini
-    ├── pyproject.toml
-    └── src/
-        └── mypkg/
-            ├── __init__.py
-            ├── mymodule.py
-            └── my_data_file.txt
-
-- "flat-layout": a Python project that does not use "src-layout" but instead
-  have a directory under the project root for each package::
-
-    .
-    ├── tox.ini
-    ├── pyproject.toml
-    └── mypkg/
-        ├── __init__.py
-        ├── mymodule.py
-        └── my_data_file.txt
-
-- "single-module": a project that contains a single Python script direct under
-  the project root (no directory used)::
-
-    .
-    ├── tox.ini
-    ├── pyproject.toml
-    └── mymodule.py
-
-"""
-
-import itertools
-import os
-from fnmatch import fnmatchcase
-from glob import glob
-from pathlib import Path
-from typing import (
-    TYPE_CHECKING,
-    Dict,
-    Iterable,
-    Iterator,
-    List,
-    Mapping,
-    Optional,
-    Tuple,
-    Union
-)
-
-import _distutils_hack.override  # noqa: F401
-
-from distutils import log
-from distutils.util import convert_path
-
-_Path = Union[str, os.PathLike]
-StrIter = Iterator[str]
-
-chain_iter = itertools.chain.from_iterable
-
-if TYPE_CHECKING:
-    from setuptools import Distribution  # noqa
-
-
-def _valid_name(path: _Path) -> bool:
-    # Ignore invalid names that cannot be imported directly
-    return os.path.basename(path).isidentifier()
-
-
-class _Filter:
-    """
-    Given a list of patterns, create a callable that will be true only if
-    the input matches at least one of the patterns.
-    """
-
-    def __init__(self, *patterns: str):
-        self._patterns = dict.fromkeys(patterns)
-
-    def __call__(self, item: str) -> bool:
-        return any(fnmatchcase(item, pat) for pat in self._patterns)
-
-    def __contains__(self, item: str) -> bool:
-        return item in self._patterns
-
-
-class _Finder:
-    """Base class that exposes functionality for module/package finders"""
-
-    ALWAYS_EXCLUDE: Tuple[str, ...] = ()
-    DEFAULT_EXCLUDE: Tuple[str, ...] = ()
-
-    @classmethod
-    def find(
-        cls,
-        where: _Path = '.',
-        exclude: Iterable[str] = (),
-        include: Iterable[str] = ('*',)
-    ) -> List[str]:
-        """Return a list of all Python items (packages or modules, depending on
-        the finder implementation) found within directory 'where'.
-
-        'where' is the root directory which will be searched.
-        It should be supplied as a "cross-platform" (i.e. URL-style) path;
-        it will be converted to the appropriate local path syntax.
-
-        'exclude' is a sequence of names to exclude; '*' can be used
-        as a wildcard in the names.
-        When finding packages, 'foo.*' will exclude all subpackages of 'foo'
-        (but not 'foo' itself).
-
-        'include' is a sequence of names to include.
-        If it's specified, only the named items will be included.
-        If it's not specified, all found items will be included.
-        'include' can contain shell style wildcard patterns just like
-        'exclude'.
-        """
-
-        exclude = exclude or cls.DEFAULT_EXCLUDE
-        return list(
-            cls._find_iter(
-                convert_path(str(where)),
-                _Filter(*cls.ALWAYS_EXCLUDE, *exclude),
-                _Filter(*include),
-            )
-        )
-
-    @classmethod
-    def _find_iter(cls, where: _Path, exclude: _Filter, include: _Filter) -> StrIter:
-        raise NotImplementedError
-
-
-class PackageFinder(_Finder):
-    """
-    Generate a list of all Python packages found within a directory
-    """
-
-    ALWAYS_EXCLUDE = ("ez_setup", "*__pycache__")
-
-    @classmethod
-    def _find_iter(cls, where: _Path, exclude: _Filter, include: _Filter) -> StrIter:
-        """
-        All the packages found in 'where' that pass the 'include' filter, but
-        not the 'exclude' filter.
-        """
-        for root, dirs, files in os.walk(str(where), followlinks=True):
-            # Copy dirs to iterate over it, then empty dirs.
-            all_dirs = dirs[:]
-            dirs[:] = []
-
-            for dir in all_dirs:
-                full_path = os.path.join(root, dir)
-                rel_path = os.path.relpath(full_path, where)
-                package = rel_path.replace(os.path.sep, '.')
-
-                # Skip directory trees that are not valid packages
-                if '.' in dir or not cls._looks_like_package(full_path, package):
-                    continue
-
-                # Should this package be included?
-                if include(package) and not exclude(package):
-                    yield package
-
-                # Early pruning if there is nothing else to be scanned
-                if f"{package}*" in exclude or f"{package}.*" in exclude:
-                    continue
-
-                # Keep searching subdirectories, as there may be more packages
-                # down there, even if the parent was excluded.
-                dirs.append(dir)
-
-    @staticmethod
-    def _looks_like_package(path: _Path, _package_name: str) -> bool:
-        """Does a directory look like a package?"""
-        return os.path.isfile(os.path.join(path, '__init__.py'))
-
-
-class PEP420PackageFinder(PackageFinder):
-    @staticmethod
-    def _looks_like_package(_path: _Path, _package_name: str) -> bool:
-        return True
-
-
-class ModuleFinder(_Finder):
-    """Find isolated Python modules.
-    This function will **not** recurse subdirectories.
-    """
-
-    @classmethod
-    def _find_iter(cls, where: _Path, exclude: _Filter, include: _Filter) -> StrIter:
-        for file in glob(os.path.join(where, "*.py")):
-            module, _ext = os.path.splitext(os.path.basename(file))
-
-            if not cls._looks_like_module(module):
-                continue
-
-            if include(module) and not exclude(module):
-                yield module
-
-    _looks_like_module = staticmethod(_valid_name)
-
-
-# We have to be extra careful in the case of flat layout to not include files
-# and directories not meant for distribution (e.g. tool-related)
-
-
-class FlatLayoutPackageFinder(PEP420PackageFinder):
-    _EXCLUDE = (
-        "ci",
-        "bin",
-        "doc",
-        "docs",
-        "documentation",
-        "manpages",
-        "news",
-        "changelog",
-        "test",
-        "tests",
-        "unit_test",
-        "unit_tests",
-        "example",
-        "examples",
-        "scripts",
-        "tools",
-        "util",
-        "utils",
-        "python",
-        "build",
-        "dist",
-        "venv",
-        "env",
-        "requirements",
-        # ---- Task runners / Build tools ----
-        "tasks",  # invoke
-        "fabfile",  # fabric
-        "site_scons",  # SCons
-        # ---- Other tools ----
-        "benchmark",
-        "benchmarks",
-        "exercise",
-        "exercises",
-        "htmlcov",  # Coverage.py
-        # ---- Hidden directories/Private packages ----
-        "[._]*",
-    )
-
-    DEFAULT_EXCLUDE = tuple(chain_iter((p, f"{p}.*") for p in _EXCLUDE))
-    """Reserved package names"""
-
-    @staticmethod
-    def _looks_like_package(_path: _Path, package_name: str) -> bool:
-        names = package_name.split('.')
-        # Consider PEP 561
-        root_pkg_is_valid = names[0].isidentifier() or names[0].endswith("-stubs")
-        return root_pkg_is_valid and all(name.isidentifier() for name in names[1:])
-
-
-class FlatLayoutModuleFinder(ModuleFinder):
-    DEFAULT_EXCLUDE = (
-        "setup",
-        "conftest",
-        "test",
-        "tests",
-        "example",
-        "examples",
-        "build",
-        # ---- Task runners ----
-        "toxfile",
-        "noxfile",
-        "pavement",
-        "dodo",
-        "tasks",
-        "fabfile",
-        # ---- Other tools ----
-        "[Ss][Cc]onstruct",  # SCons
-        "conanfile",  # Connan: C/C++ build tool
-        "manage",  # Django
-        "benchmark",
-        "benchmarks",
-        "exercise",
-        "exercises",
-        # ---- Hidden files/Private modules ----
-        "[._]*",
-    )
-    """Reserved top-level module names"""
-
-
-def _find_packages_within(root_pkg: str, pkg_dir: _Path) -> List[str]:
-    nested = PEP420PackageFinder.find(pkg_dir)
-    return [root_pkg] + [".".join((root_pkg, n)) for n in nested]
-
-
-class ConfigDiscovery:
-    """Fill-in metadata and options that can be automatically derived
-    (from other metadata/options, the file system or conventions)
-    """
-
-    def __init__(self, distribution: "Distribution"):
-        self.dist = distribution
-        self._called = False
-        self._disabled = False
-        self._skip_ext_modules = False
-
-    def _disable(self):
-        """Internal API to disable automatic discovery"""
-        self._disabled = True
-
-    def _ignore_ext_modules(self):
-        """Internal API to disregard ext_modules.
-
-        Normally auto-discovery would not be triggered if ``ext_modules`` are set
-        (this is done for backward compatibility with existing packages relying on
-        ``setup.py`` or ``setup.cfg``). However, ``setuptools`` can call this function
-        to ignore given ``ext_modules`` and proceed with the auto-discovery if
-        ``packages`` and ``py_modules`` are not given (e.g. when using pyproject.toml
-        metadata).
-        """
-        self._skip_ext_modules = True
-
-    @property
-    def _root_dir(self) -> _Path:
-        # The best is to wait until `src_root` is set in dist, before using _root_dir.
-        return self.dist.src_root or os.curdir
-
-    @property
-    def _package_dir(self) -> Dict[str, str]:
-        if self.dist.package_dir is None:
-            return {}
-        return self.dist.package_dir
-
-    def __call__(self, force=False, name=True, ignore_ext_modules=False):
-        """Automatically discover missing configuration fields
-        and modifies the given ``distribution`` object in-place.
-
-        Note that by default this will only have an effect the first time the
-        ``ConfigDiscovery`` object is called.
-
-        To repeatedly invoke automatic discovery (e.g. when the project
-        directory changes), please use ``force=True`` (or create a new
-        ``ConfigDiscovery`` instance).
-        """
-        if force is False and (self._called or self._disabled):
-            # Avoid overhead of multiple calls
-            return
-
-        self._analyse_package_layout(ignore_ext_modules)
-        if name:
-            self.analyse_name()  # depends on ``packages`` and ``py_modules``
-
-        self._called = True
-
-    def _explicitly_specified(self, ignore_ext_modules: bool) -> bool:
-        """``True`` if the user has specified some form of package/module listing"""
-        ignore_ext_modules = ignore_ext_modules or self._skip_ext_modules
-        ext_modules = not (self.dist.ext_modules is None or ignore_ext_modules)
-        return (
-            self.dist.packages is not None
-            or self.dist.py_modules is not None
-            or ext_modules
-            or hasattr(self.dist, "configuration") and self.dist.configuration
-            # ^ Some projects use numpy.distutils.misc_util.Configuration
-        )
-
-    def _analyse_package_layout(self, ignore_ext_modules: bool) -> bool:
-        if self._explicitly_specified(ignore_ext_modules):
-            # For backward compatibility, just try to find modules/packages
-            # when nothing is given
-            return True
-
-        log.debug(
-            "No `packages` or `py_modules` configuration, performing "
-            "automatic discovery."
-        )
-
-        return (
-            self._analyse_explicit_layout()
-            or self._analyse_src_layout()
-            # flat-layout is the trickiest for discovery so it should be last
-            or self._analyse_flat_layout()
-        )
-
-    def _analyse_explicit_layout(self) -> bool:
-        """The user can explicitly give a package layout via ``package_dir``"""
-        package_dir = self._package_dir.copy()  # don't modify directly
-        package_dir.pop("", None)  # This falls under the "src-layout" umbrella
-        root_dir = self._root_dir
-
-        if not package_dir:
-            return False
-
-        log.debug(f"`explicit-layout` detected -- analysing {package_dir}")
-        pkgs = chain_iter(
-            _find_packages_within(pkg, os.path.join(root_dir, parent_dir))
-            for pkg, parent_dir in package_dir.items()
-        )
-        self.dist.packages = list(pkgs)
-        log.debug(f"discovered packages -- {self.dist.packages}")
-        return True
-
-    def _analyse_src_layout(self) -> bool:
-        """Try to find all packages or modules under the ``src`` directory
-        (or anything pointed by ``package_dir[""]``).
-
-        The "src-layout" is relatively safe for automatic discovery.
-        We assume that everything within is meant to be included in the
-        distribution.
-
-        If ``package_dir[""]`` is not given, but the ``src`` directory exists,
-        this function will set ``package_dir[""] = "src"``.
-        """
-        package_dir = self._package_dir
-        src_dir = os.path.join(self._root_dir, package_dir.get("", "src"))
-        if not os.path.isdir(src_dir):
-            return False
-
-        log.debug(f"`src-layout` detected -- analysing {src_dir}")
-        package_dir.setdefault("", os.path.basename(src_dir))
-        self.dist.package_dir = package_dir  # persist eventual modifications
-        self.dist.packages = PEP420PackageFinder.find(src_dir)
-        self.dist.py_modules = ModuleFinder.find(src_dir)
-        log.debug(f"discovered packages -- {self.dist.packages}")
-        log.debug(f"discovered py_modules -- {self.dist.py_modules}")
-        return True
-
-    def _analyse_flat_layout(self) -> bool:
-        """Try to find all packages and modules under the project root.
-
-        Since the ``flat-layout`` is more dangerous in terms of accidentally including
-        extra files/directories, this function is more conservative and will raise an
-        error if multiple packages or modules are found.
-
-        This assumes that multi-package dists are uncommon and refuse to support that
-        use case in order to be able to prevent unintended errors.
-        """
-        log.debug(f"`flat-layout` detected -- analysing {self._root_dir}")
-        return self._analyse_flat_packages() or self._analyse_flat_modules()
-
-    def _analyse_flat_packages(self) -> bool:
-        self.dist.packages = FlatLayoutPackageFinder.find(self._root_dir)
-        top_level = remove_nested_packages(remove_stubs(self.dist.packages))
-        log.debug(f"discovered packages -- {self.dist.packages}")
-        self._ensure_no_accidental_inclusion(top_level, "packages")
-        return bool(top_level)
-
-    def _analyse_flat_modules(self) -> bool:
-        self.dist.py_modules = FlatLayoutModuleFinder.find(self._root_dir)
-        log.debug(f"discovered py_modules -- {self.dist.py_modules}")
-        self._ensure_no_accidental_inclusion(self.dist.py_modules, "modules")
-        return bool(self.dist.py_modules)
-
-    def _ensure_no_accidental_inclusion(self, detected: List[str], kind: str):
-        if len(detected) > 1:
-            from inspect import cleandoc
-
-            from setuptools.errors import PackageDiscoveryError
-
-            msg = f"""Multiple top-level {kind} discovered in a flat-layout: {detected}.
-
-            To avoid accidental inclusion of unwanted files or directories,
-            setuptools will not proceed with this build.
-
-            If you are trying to create a single distribution with multiple {kind}
-            on purpose, you should not rely on automatic discovery.
-            Instead, consider the following options:
-
-            1. set up custom discovery (`find` directive with `include` or `exclude`)
-            2. use a `src-layout`
-            3. explicitly set `py_modules` or `packages` with a list of names
-
-            To find more information, look for "package discovery" on setuptools docs.
-            """
-            raise PackageDiscoveryError(cleandoc(msg))
-
-    def analyse_name(self):
-        """The packages/modules are the essential contribution of the author.
-        Therefore the name of the distribution can be derived from them.
-        """
-        if self.dist.metadata.name or self.dist.name:
-            # get_name() is not reliable (can return "UNKNOWN")
-            return None
-
-        log.debug("No `name` configuration, performing automatic discovery")
-
-        name = (
-            self._find_name_single_package_or_module()
-            or self._find_name_from_packages()
-        )
-        if name:
-            self.dist.metadata.name = name
-
-    def _find_name_single_package_or_module(self) -> Optional[str]:
-        """Exactly one module or package"""
-        for field in ('packages', 'py_modules'):
-            items = getattr(self.dist, field, None) or []
-            if items and len(items) == 1:
-                log.debug(f"Single module/package detected, name: {items[0]}")
-                return items[0]
-
-        return None
-
-    def _find_name_from_packages(self) -> Optional[str]:
-        """Try to find the root package that is not a PEP 420 namespace"""
-        if not self.dist.packages:
-            return None
-
-        packages = remove_stubs(sorted(self.dist.packages, key=len))
-        package_dir = self.dist.package_dir or {}
-
-        parent_pkg = find_parent_package(packages, package_dir, self._root_dir)
-        if parent_pkg:
-            log.debug(f"Common parent package detected, name: {parent_pkg}")
-            return parent_pkg
-
-        log.warn("No parent package detected, impossible to derive `name`")
-        return None
-
-
-def remove_nested_packages(packages: List[str]) -> List[str]:
-    """Remove nested packages from a list of packages.
-
-    >>> remove_nested_packages(["a", "a.b1", "a.b2", "a.b1.c1"])
-    ['a']
-    >>> remove_nested_packages(["a", "b", "c.d", "c.d.e.f", "g.h", "a.a1"])
-    ['a', 'b', 'c.d', 'g.h']
-    """
-    pkgs = sorted(packages, key=len)
-    top_level = pkgs[:]
-    size = len(pkgs)
-    for i, name in enumerate(reversed(pkgs)):
-        if any(name.startswith(f"{other}.") for other in top_level):
-            top_level.pop(size - i - 1)
-
-    return top_level
-
-
-def remove_stubs(packages: List[str]) -> List[str]:
-    """Remove type stubs (:pep:`561`) from a list of packages.
-
-    >>> remove_stubs(["a", "a.b", "a-stubs", "a-stubs.b.c", "b", "c-stubs"])
-    ['a', 'a.b', 'b']
-    """
-    return [pkg for pkg in packages if not pkg.split(".")[0].endswith("-stubs")]
-
-
-def find_parent_package(
-    packages: List[str], package_dir: Mapping[str, str], root_dir: _Path
-) -> Optional[str]:
-    """Find the parent package that is not a namespace."""
-    packages = sorted(packages, key=len)
-    common_ancestors = []
-    for i, name in enumerate(packages):
-        if not all(n.startswith(f"{name}.") for n in packages[i+1:]):
-            # Since packages are sorted by length, this condition is able
-            # to find a list of all common ancestors.
-            # When there is divergence (e.g. multiple root packages)
-            # the list will be empty
-            break
-        common_ancestors.append(name)
-
-    for name in common_ancestors:
-        pkg_path = find_package_path(name, package_dir, root_dir)
-        init = os.path.join(pkg_path, "__init__.py")
-        if os.path.isfile(init):
-            return name
-
-    return None
-
-
-def find_package_path(
-    name: str, package_dir: Mapping[str, str], root_dir: _Path
-) -> str:
-    """Given a package name, return the path where it should be found on
-    disk, considering the ``package_dir`` option.
-
-    >>> path = find_package_path("my.pkg", {"": "root/is/nested"}, ".")
-    >>> path.replace(os.sep, "/")
-    './root/is/nested/my/pkg'
-
-    >>> path = find_package_path("my.pkg", {"my": "root/is/nested"}, ".")
-    >>> path.replace(os.sep, "/")
-    './root/is/nested/pkg'
-
-    >>> path = find_package_path("my.pkg", {"my.pkg": "root/is/nested"}, ".")
-    >>> path.replace(os.sep, "/")
-    './root/is/nested'
-
-    >>> path = find_package_path("other.pkg", {"my.pkg": "root/is/nested"}, ".")
-    >>> path.replace(os.sep, "/")
-    './other/pkg'
-    """
-    parts = name.split(".")
-    for i in range(len(parts), 0, -1):
-        # Look backwards, the most specific package_dir first
-        partial_name = ".".join(parts[:i])
-        if partial_name in package_dir:
-            parent = package_dir[partial_name]
-            return os.path.join(root_dir, parent, *parts[i:])
-
-    parent = package_dir.get("") or ""
-    return os.path.join(root_dir, *parent.split("/"), *parts)
-
-
-def construct_package_dir(packages: List[str], package_path: _Path) -> Dict[str, str]:
-    parent_pkgs = remove_nested_packages(packages)
-    prefix = Path(package_path).parts
-    return {pkg: "/".join([*prefix, *pkg.split(".")]) for pkg in parent_pkgs}
diff --git a/spaces/TechWithAnirudh/eachadea-vicuna-13b/app.py b/spaces/TechWithAnirudh/eachadea-vicuna-13b/app.py
deleted file mode 100644
index addb55d6c6dfbaed9c20434d7cbd90c667360c9a..0000000000000000000000000000000000000000
--- a/spaces/TechWithAnirudh/eachadea-vicuna-13b/app.py
+++ /dev/null
@@ -1,3 +0,0 @@
-import gradio as gr
-
-gr.Interface.load("models/eachadea/vicuna-13b").launch()
\ No newline at end of file
diff --git a/spaces/Tetel/secondbing/EdgeGPT/conversation.py b/spaces/Tetel/secondbing/EdgeGPT/conversation.py
deleted file mode 100644
index b3952edfe5acd44192548e098ee451100dcf4a12..0000000000000000000000000000000000000000
--- a/spaces/Tetel/secondbing/EdgeGPT/conversation.py
+++ /dev/null
@@ -1,162 +0,0 @@
-import json
-import os
-from typing import List
-from typing import Union
-from .constants import HEADER_IMG_UPLOAD
-import httpx
-import random
-
-from .constants import HEADERS_INIT_CONVER
-from .exceptions import NotAllowedToAccess
-
-
-class Conversation:
-    def __init__(
-        self,
-        proxy: Union[str, None] = None,
-        async_mode: bool = False,
-        cookies: Union[List[dict], None] = None,
-    ) -> None:
-        if async_mode:
-            return
-        self.struct: dict = {
-            "conversationId": None,
-            "clientId": None,
-            "conversationSignature": None,
-            "result": {"value": "Success", "message": None},
-        }
-        self.img_id: dict = {
-            "blobId": None,
-            "processedBlobId": None,
-        }
-        self.proxy = proxy
-        proxy = (
-            proxy
-            or os.environ.get("all_proxy")
-            or os.environ.get("ALL_PROXY")
-            or os.environ.get("https_proxy")
-            or os.environ.get("HTTPS_PROXY")
-            or None
-        )
-        if proxy is not None and proxy.startswith("socks5h://"):
-            proxy = "socks5://" + proxy[len("socks5h://") :]
-        self.session = httpx.Client(
-            proxies=proxy,
-            timeout=900,
-            headers=HEADERS_INIT_CONVER,
-        )
-        if cookies:
-            for cookie in cookies:
-                self.session.cookies.set(cookie["name"], cookie["value"])
-        # Send GET request
-        response = self.session.get(
-            url=os.environ.get("BING_PROXY_URL")
-            or "https://edgeservices.bing.com/edgesvc/turing/conversation/create",
-        )
-        if response.status_code != 200:
-            print(f"Status code: {response.status_code}")
-            print(response.text)
-            print(response.url)
-            raise Exception("Authentication failed")
-        try:
-            self.struct = response.json()
-        except (json.decoder.JSONDecodeError, NotAllowedToAccess) as exc:
-            raise Exception(
-                "Authentication failed. You have not been accepted into the beta.",
-            ) from exc
-        if self.struct["result"]["value"] == "UnauthorizedRequest":
-            raise NotAllowedToAccess(self.struct["result"]["message"])
-
-    @staticmethod
-    async def create(
-        proxy: Union[str, None] = None,
-        cookies: Union[List[dict], None] = None,
-        imageInput: str | None = None
-    ) -> "Conversation":
-        self = Conversation(async_mode=True)
-        self.struct = {
-            "conversationId": None,
-            "clientId": None,
-            "conversationSignature": None,
-            "result": {"value": "Success", "message": None},
-        }
-        self.img_id = {
-            "blobId": None,
-            "processedBlobId": None,
-        }
-        self.proxy = proxy
-        proxy = (
-            proxy
-            or os.environ.get("all_proxy")
-            or os.environ.get("ALL_PROXY")
-            or os.environ.get("https_proxy")
-            or os.environ.get("HTTPS_PROXY")
-            or None
-        )
-        if proxy is not None and proxy.startswith("socks5h://"):
-            proxy = "socks5://" + proxy[len("socks5h://") :]
-        transport = httpx.AsyncHTTPTransport(retries=900)
-        # Convert cookie format to httpx format
-        formatted_cookies = None
-        if cookies:
-            formatted_cookies = httpx.Cookies()
-            for cookie in cookies:
-                formatted_cookies.set(cookie["name"], cookie["value"])
-        async with httpx.AsyncClient(
-            proxies=proxy,
-            timeout=30,
-            headers={
-                **HEADERS_INIT_CONVER,
-                "x-forwarded-for": f"13.{random.randint(104, 107)}.{random.randint(0, 255)}.{random.randint(0, 255)}"
-                    },
-            transport=transport,
-            cookies=formatted_cookies,
-        ) as client:
-            # GET BlobId
-            if imageInput:
-                files = {
-                    'knowledgeRequest': (None,
-                                         '{"imageInfo":{},"knowledgeRequest":{"invokedSkills":["ImageById"],"subscriptionId":"Bing.Chat.Multimodal","invokedSkillsRequestData":{"enableFaceBlur":true},"convoData":{"convoid":"","convotone":"Creative"}}}'),
-                    'imageBase64': (None, imageInput)
-                }
-                response_img = await client.post(
-                    url="https://www.bing.com/images/kblob",
-                    headers=HEADER_IMG_UPLOAD,
-                    files=files,
-                    follow_redirects=True,
-                )
-                if response_img.status_code != 200:
-                    print(f"Status code: {response_img.status_code}")
-                    print(response_img.text)
-                    print(response_img.url)
-                    raise Exception("Authentication failed")
-                try:
-                    self.img_id = response_img.json()
-                except (json.decoder.JSONDecodeError, NotAllowedToAccess) as exc:
-                    print(response_img.text)
-                    raise Exception(
-                        "Authentication failed. You have not been accepted into the beta.",
-                    ) from exc
-
-            response = await client.get(
-                url=os.environ.get("BING_PROXY_URL")
-                or "https://www.bing.com/turing/conversation/create",
-                follow_redirects=True,
-            )
-
-        if response.status_code != 200:
-            print(f"Status code: {response.status_code}")
-            print(response.text)
-            print(response.url)
-            raise Exception("Authentication failed")
-
-        try:
-            self.struct = response.json()
-        except (json.decoder.JSONDecodeError, NotAllowedToAccess) as exc:
-            print(response.text)
-            raise Exception(
-                "Authentication failed. You have not been accepted into the beta.",
-            ) from exc
-        if self.struct["result"]["value"] == "UnauthorizedRequest":
-            raise NotAllowedToAccess(self.struct["result"]["message"])
-        return self
diff --git a/spaces/ThirdEyeData/Object_Detection/README.md b/spaces/ThirdEyeData/Object_Detection/README.md
deleted file mode 100644
index 8dcda5b173cb7131b0c394369f2e7eb312eb78ab..0000000000000000000000000000000000000000
--- a/spaces/ThirdEyeData/Object_Detection/README.md
+++ /dev/null
@@ -1,12 +0,0 @@
----
-title: Object Detection
-emoji: 🚀
-colorFrom: pink
-colorTo: green
-sdk: streamlit
-sdk_version: 1.17.0
-app_file: app.py
-pinned: false
----
-
-Check out the configuration reference at https://huggingface.co/docs/hub/spaces-config-reference
\ No newline at end of file
diff --git a/spaces/Um124/Global_Warming_Analysis/pages/Income per Person GDP data Analysis.py b/spaces/Um124/Global_Warming_Analysis/pages/Income per Person GDP data Analysis.py
deleted file mode 100644
index f049602eb27018ffaaccc08df660412feea9d9db..0000000000000000000000000000000000000000
--- a/spaces/Um124/Global_Warming_Analysis/pages/Income per Person GDP data Analysis.py	
+++ /dev/null
@@ -1,97 +0,0 @@
-import pandas as pd
-import numpy as np
-import plotly.express as px
-import streamlit as st
-
-
-st.set_page_config(
-    page_title='Income per Person GDP data Analysis',
-    page_icon='📈',
-    layout='wide'
-)
-
-Years=['1800','1801','1802','1803','1804','1805','1806','1807','1808','1809','1810','1811','1812','1813',
-'1814','1815','1816','1817','1818','1819','1820','1821','1822','1823','1824','1825','1826','1827','1828',
-'1829','1830','1831','1832','1833','1834','1835','1836','1837','1838','1839','1840','1841','1842','1843',
-'1844','1845','1846','1847','1848','1849','1850','1851','1852','1853','1854','1855','1856','1857','1858',
-'1859','1860','1861','1862','1863','1864','1865','1866','1867','1868','1869','1870','1871','1872','1873',
-'1874','1875','1876','1877','1878','1879','1880','1881','1882','1883','1884','1885','1886','1887','1888',
-'1889','1890','1891','1892','1893','1894','1895','1896','1897','1898','1899','1900','1901','1902','1903',
-'1904','1905','1906','1907','1908','1909','1910','1911','1912','1913','1914','1915','1916','1917','1918',
-'1919','1920','1921','1922','1923','1924','1925','1926','1927','1928','1929','1930','1931','1932','1933',
-'1934','1935','1936','1937','1938','1939','1940','1941','1942','1943','1944','1945','1946','1947','1948',
-'1949','1950','1951','1952','1953','1954','1955','1956','1957','1958','1959','1960','1961','1962','1963',
-'1964','1965','1966','1967','1968','1969','1970','1971','1972','1973','1974','1975','1976','1977','1978',
-'1979','1980','1981','1982','1983','1984','1985','1986','1987','1988','1989','1990','1991','1992','1993',
-'1994','1995','1996','1997','1998','1999','2000','2001','2002','2003','2004','2005','2006','2007','2008',
-'2009','2010','2011','2012','2013','2014','2015','2016','2017','2018']
-
-@st.cache_data 
-def load_data():
-    df=pd.read_csv('data/income_per_person_gdppercapita_ppp_inflation_adjusted.csv')
-    df.rename(columns={'geo':'Country'},inplace=True)
-    df.set_index('Country',inplace=True)
-    df['Total'] = df[Years].sum(axis=1)
-    df['Avgrage']=df.mean(axis=1)
-    df['Maximum']=df.max(axis=1)
-    df['Minimum']=df.min(axis=1)
-    df.sort_index(inplace=True)
-    return df
-
-st.title('Income per Person GDP per Capital ppp Inflation Adjusted')
-df = load_data()
-st.dataframe(df,use_container_width=True)
-
-countries= df.index.unique().tolist()
-Graphs = ['bar','pie','line','area','funnel']
-c1,c2 = st.columns(2)
-country = c1.selectbox("Select a Country", countries)
-Graph = c2.selectbox("Select a Graph type", Graphs)
-
-st.header("Country wise visualization")
-cdf = df.loc[country,Years].reset_index()
-cdf.rename({'index':'Years'},axis=1, inplace=True)
-if Graph == Graphs[0]:
-    fig = px.bar(cdf, 'Years',country, title=f'{country} Income per Person GDP per Capital ppp Inflation Adjusted')
-if Graph == Graphs[1]:
-    fig = px.pie(cdf, 'Years',country, title=f'{country} Income per Person GDP per Capital ppp Inflation Adjusted')
-if Graph == Graphs[2]:
-    fig = px.line(cdf, 'Years',country, title=f'{country} Income per Person GDP per Capital ppp Inflation Adjusted')
-if Graph == Graphs[3]:
-    fig = px.area(cdf, 'Years',country, title=f'{country} Income per Person GDP per Capital ppp Inflation Adjusted')
-if Graph == Graphs[4]:
-    fig = px.funnel(cdf, 'Years',country, title=f'{country} Income per Person GDP per Capital ppp Inflation Adjusted')
-st.plotly_chart(fig, use_container_width=True)
-
-st.header("Comparison of Countries")
-clist = st.multiselect("Select countries to compare", countries, default='India')
-cdf = df.loc[clist, Years].T # T to rotate the data in 90deg
-st.write(cdf)
-figc = px.line(cdf,cdf.index, clist, title=f'Comparing {", ".join(clist)}')
-
-st.plotly_chart(figc, use_container_width=True)
-
-
-df.sort_values(by='Total', ascending=False, inplace=True)
-fig1=px.bar(df, x=df.index, y='Total',title='Total Income per Person GDP per Capital ppp Inflation Adjusted')
-st.plotly_chart(fig1, use_container_width=True)
-
-dfavg = df.sort_values(by='Avgrage').reset_index()
-dfavg.rename({'index':'Country'},axis=1,inplace=True)
-fig2=px.bar(dfavg, 'Country', 'Avgrage', title="Avgrage Income per Person GDP per Capital ppp Inflation Adjusted by Country")
-st.plotly_chart(fig2, use_container_width=True)
-
-dfmax=df.sort_values(by='Maximum').reset_index()
-dfmax.rename({'index':'Country'},axis=1,inplace=True)
-fig3=px.bar(dfmax,'Country','Maximum',title='Maximum Income per Person GDP per Capital ppp Inflation Adjusted by the Country')
-st.plotly_chart(fig3, use_container_width=True)
-
-dfmin=df.sort_values(by='Minimum').reset_index()
-dfmin.rename({'index':'Country'},axis=1,inplace=True)
-fig4=px.bar(dfmin,'Country','Minimum',title='Minimum Income per Person GDP per Capital ppp Inflation Adjusted by the Country' )
-st.plotly_chart(fig4,use_container_width=True)
-
-dfcomp=df.sort_values(by='Country',ascending=False,inplace=True)
-fig5 = px.line(df, x=df.index, y='Maximum',title='Maximum and Minimum Income per Person GDP per Capital ppp Inflation Adjusted comparisons')
-fig5.add_scatter(x=df.index, y=df['Minimum'], mode='lines',)
-st.plotly_chart(fig5, use_container_width=True)
\ No newline at end of file
diff --git a/spaces/VIPLab/Track-Anything/demo.py b/spaces/VIPLab/Track-Anything/demo.py
deleted file mode 100644
index bf5d4d2129751906128f6db9b37070f41b89ac1a..0000000000000000000000000000000000000000
--- a/spaces/VIPLab/Track-Anything/demo.py
+++ /dev/null
@@ -1,87 +0,0 @@
-from metaseg import SegAutoMaskPredictor, SegManualMaskPredictor, SahiAutoSegmentation, sahi_sliced_predict
-
-# For image
-
-def automask_image_app(image_path, model_type, points_per_side, points_per_batch, min_area):
-    SegAutoMaskPredictor().image_predict(
-        source=image_path,
-        model_type=model_type,  # vit_l, vit_h, vit_b
-        points_per_side=points_per_side,
-        points_per_batch=points_per_batch,
-        min_area=min_area,
-        output_path="output.png",
-        show=False,
-        save=True,
-    )
-    return "output.png"
-
-
-# For video
-
-def automask_video_app(video_path, model_type, points_per_side, points_per_batch, min_area):
-    SegAutoMaskPredictor().video_predict(
-        source=video_path,
-        model_type=model_type,  # vit_l, vit_h, vit_b
-        points_per_side=points_per_side,
-        points_per_batch=points_per_batch,
-        min_area=min_area,
-        output_path="output.mp4",
-    )
-    return "output.mp4"
-
-
-# For manuel box and point selection
-
-def manual_app(image_path, model_type, input_point, input_label, input_box, multimask_output, random_color):
-    SegManualMaskPredictor().image_predict(
-        source=image_path,
-        model_type=model_type,  # vit_l, vit_h, vit_b
-        input_point=input_point,
-        input_label=input_label,
-        input_box=input_box,
-        multimask_output=multimask_output,
-        random_color=random_color,
-        output_path="output.png",
-        show=False,
-        save=True,
-    )
-    return "output.png"
-
-
-# For sahi sliced prediction
-
-def sahi_autoseg_app(
-    image_path,
-    sam_model_type,
-    detection_model_type,
-    detection_model_path,
-    conf_th,
-    image_size,
-    slice_height,
-    slice_width,
-    overlap_height_ratio,
-    overlap_width_ratio,
-):
-    boxes = sahi_sliced_predict(
-        image_path=image_path,
-        detection_model_type=detection_model_type,  # yolov8, detectron2, mmdetection, torchvision
-        detection_model_path=detection_model_path,
-        conf_th=conf_th,
-        image_size=image_size,
-        slice_height=slice_height,
-        slice_width=slice_width,
-        overlap_height_ratio=overlap_height_ratio,
-        overlap_width_ratio=overlap_width_ratio,
-    )
-
-    SahiAutoSegmentation().predict(
-        source=image_path,
-        model_type=sam_model_type,
-        input_box=boxes,
-        multimask_output=False,
-        random_color=False,
-        show=False,
-        save=True,
-    )
-    
-    return "output.png"
diff --git a/spaces/VivianShi/Coconet-Pytorch/README.md b/spaces/VivianShi/Coconet-Pytorch/README.md
deleted file mode 100644
index 4d1a6e9c64971e77277b2cb27ee9c0a22445fdd4..0000000000000000000000000000000000000000
--- a/spaces/VivianShi/Coconet-Pytorch/README.md
+++ /dev/null
@@ -1,12 +0,0 @@
----
-title: Coconet Pytorch
-emoji: 👁
-colorFrom: indigo
-colorTo: yellow
-sdk: gradio
-sdk_version: 3.11.0
-app_file: app.py
-pinned: false
----
-
-Check out the configuration reference at https://huggingface.co/docs/hub/spaces-config-reference
diff --git a/spaces/Vrk/SkimLit/Tokenizer.py b/spaces/Vrk/SkimLit/Tokenizer.py
deleted file mode 100644
index 7986c5c8ea4d0cfa009437a571a413d2b23cfce2..0000000000000000000000000000000000000000
--- a/spaces/Vrk/SkimLit/Tokenizer.py
+++ /dev/null
@@ -1,71 +0,0 @@
-import numpy as np
-import json
-
-class Tokenizer(object):
-    def __init__(self, char_level, num_tokens=None,
-                 pad_token="<PAD>", oov_token="<UNK>",
-                 token_to_index=None):
-        self.char_level = char_level
-        self.separator = "" if self.char_level else " "
-        if num_tokens: num_tokens -= 2 # pad + unk tokens
-        self.num_tokens = num_tokens
-        self.pad_token = pad_token
-        self.oov_token = oov_token
-        if not token_to_index:
-            token_to_index = {pad_token: 0, oov_token: 1}
-        self.token_to_index = token_to_index
-        self.index_to_token = {v: k for k, v in self.token_to_index.items()}
-
-    def __len__(self):
-        return len(self.token_to_index)
-
-    def __str__(self):
-        return f"<Tokenizer(num_tokens={len(self)})>"
-
-    def fit_on_texts(self, texts):
-        if not self.char_level:
-            texts = [text.split(" ") for text in texts]
-        all_tokens = [token for text in texts for token in text]
-        counts = Counter(all_tokens).most_common(self.num_tokens)
-        self.min_token_freq = counts[-1][1]
-        for token, count in counts:
-            index = len(self)
-            self.token_to_index[token] = index
-            self.index_to_token[index] = token
-        return self
-
-    def texts_to_sequences(self, texts):
-        sequences = []
-        for text in texts:
-            if not self.char_level:
-                text = text.split(" ")
-            sequence = []
-            for token in text:
-                sequence.append(self.token_to_index.get(
-                    token, self.token_to_index[self.oov_token]))
-            sequences.append(np.asarray(sequence))
-        return sequences
-
-    def sequences_to_texts(self, sequences):
-        texts = []
-        for sequence in sequences:
-            text = []
-            for index in sequence:
-                text.append(self.index_to_token.get(index, self.oov_token))
-            texts.append(self.separator.join([token for token in text]))
-        return texts
-
-    def save(self, fp):
-        with open(fp, "w") as fp:
-            contents = {
-                "char_level": self.char_level,
-                "oov_token": self.oov_token,
-                "token_to_index": self.token_to_index
-            }
-            json.dump(contents, fp, indent=4, sort_keys=False)
-
-    @classmethod
-    def load(cls, fp):
-        with open(fp, "r") as fp:
-            kwargs = json.load(fp=fp)
-        return cls(**kwargs)
diff --git a/spaces/Warvito/diffusion_brain/README.md b/spaces/Warvito/diffusion_brain/README.md
deleted file mode 100644
index eb489712d3506572a239c26036acfd2a311f9cef..0000000000000000000000000000000000000000
--- a/spaces/Warvito/diffusion_brain/README.md
+++ /dev/null
@@ -1,12 +0,0 @@
----
-title: Brain Diffusion
-emoji: 🏢🧠
-colorFrom: purple
-colorTo: pink
-sdk: gradio
-sdk_version: 3.3.1
-app_file: app.py
-pinned: true
----
-
-Check out the configuration reference at https://huggingface.co/docs/hub/spaces-config-reference
diff --git a/spaces/XzJosh/Bekki-Bert-VITS2/models.py b/spaces/XzJosh/Bekki-Bert-VITS2/models.py
deleted file mode 100644
index d4afe44d883691610c5903e602a3ca245fcb3a5c..0000000000000000000000000000000000000000
--- a/spaces/XzJosh/Bekki-Bert-VITS2/models.py
+++ /dev/null
@@ -1,707 +0,0 @@
-import copy
-import math
-import torch
-from torch import nn
-from torch.nn import functional as F
-
-import commons
-import modules
-import attentions
-import monotonic_align
-
-from torch.nn import Conv1d, ConvTranspose1d, AvgPool1d, Conv2d
-from torch.nn.utils import weight_norm, remove_weight_norm, spectral_norm
-
-from commons import init_weights, get_padding
-from text import symbols, num_tones, num_languages
-class DurationDiscriminator(nn.Module): #vits2
-  def __init__(self, in_channels, filter_channels, kernel_size, p_dropout, gin_channels=0):
-    super().__init__()
-
-    self.in_channels = in_channels
-    self.filter_channels = filter_channels
-    self.kernel_size = kernel_size
-    self.p_dropout = p_dropout
-    self.gin_channels = gin_channels
-
-    self.drop = nn.Dropout(p_dropout)
-    self.conv_1 = nn.Conv1d(in_channels, filter_channels, kernel_size, padding=kernel_size//2)
-    self.norm_1 = modules.LayerNorm(filter_channels)
-    self.conv_2 = nn.Conv1d(filter_channels, filter_channels, kernel_size, padding=kernel_size//2)
-    self.norm_2 = modules.LayerNorm(filter_channels)
-    self.dur_proj = nn.Conv1d(1, filter_channels, 1)
-
-    self.pre_out_conv_1 = nn.Conv1d(2*filter_channels, filter_channels, kernel_size, padding=kernel_size//2)
-    self.pre_out_norm_1 = modules.LayerNorm(filter_channels)
-    self.pre_out_conv_2 = nn.Conv1d(filter_channels, filter_channels, kernel_size, padding=kernel_size//2)
-    self.pre_out_norm_2 = modules.LayerNorm(filter_channels)
-
-    if gin_channels != 0:
-       self.cond = nn.Conv1d(gin_channels, in_channels, 1)
-
-    self.output_layer = nn.Sequential(
-        nn.Linear(filter_channels, 1), 
-        nn.Sigmoid() 
-    )
-
-  def forward_probability(self, x, x_mask, dur, g=None):
-    dur = self.dur_proj(dur)
-    x = torch.cat([x, dur], dim=1)
-    x = self.pre_out_conv_1(x * x_mask)
-    x = torch.relu(x)
-    x = self.pre_out_norm_1(x)
-    x = self.drop(x)
-    x = self.pre_out_conv_2(x * x_mask)
-    x = torch.relu(x)
-    x = self.pre_out_norm_2(x)
-    x = self.drop(x)
-    x = x * x_mask
-    x = x.transpose(1, 2)
-    output_prob = self.output_layer(x)
-    return output_prob
-
-  def forward(self, x, x_mask, dur_r, dur_hat, g=None):
-    x = torch.detach(x)
-    if g is not None:
-       g = torch.detach(g)
-       x = x + self.cond(g)
-    x = self.conv_1(x * x_mask)
-    x = torch.relu(x)
-    x = self.norm_1(x)
-    x = self.drop(x)
-    x = self.conv_2(x * x_mask)
-    x = torch.relu(x)
-    x = self.norm_2(x)
-    x = self.drop(x)
-
-    output_probs = []
-    for dur in [dur_r, dur_hat]:
-      output_prob = self.forward_probability(x, x_mask, dur, g)
-      output_probs.append(output_prob)
-
-    return output_probs
-
-class TransformerCouplingBlock(nn.Module):
-    def __init__(self,
-                 channels,
-                 hidden_channels,
-                 filter_channels,
-                 n_heads,
-                 n_layers,
-                 kernel_size,
-                 p_dropout,
-                 n_flows=4,
-                 gin_channels=0,
-                 share_parameter=False
-                 ):
-
-        super().__init__()
-        self.channels = channels
-        self.hidden_channels = hidden_channels
-        self.kernel_size = kernel_size
-        self.n_layers = n_layers
-        self.n_flows = n_flows
-        self.gin_channels = gin_channels
-
-        self.flows = nn.ModuleList()
-
-        self.wn = attentions.FFT(hidden_channels, filter_channels, n_heads, n_layers, kernel_size, p_dropout, isflow = True, gin_channels = self.gin_channels) if share_parameter else None
-
-        for i in range(n_flows):
-            self.flows.append(
-                modules.TransformerCouplingLayer(channels, hidden_channels, kernel_size, n_layers, n_heads, p_dropout, filter_channels, mean_only=True, wn_sharing_parameter=self.wn, gin_channels = self.gin_channels))
-            self.flows.append(modules.Flip())
-
-    def forward(self, x, x_mask, g=None, reverse=False):
-        if not reverse:
-            for flow in self.flows:
-                x, _ = flow(x, x_mask, g=g, reverse=reverse)
-        else:
-            for flow in reversed(self.flows):
-                x = flow(x, x_mask, g=g, reverse=reverse)
-        return x
-
-class StochasticDurationPredictor(nn.Module):
-    def __init__(self, in_channels, filter_channels, kernel_size, p_dropout, n_flows=4, gin_channels=0):
-        super().__init__()
-        filter_channels = in_channels  # it needs to be removed from future version.
-        self.in_channels = in_channels
-        self.filter_channels = filter_channels
-        self.kernel_size = kernel_size
-        self.p_dropout = p_dropout
-        self.n_flows = n_flows
-        self.gin_channels = gin_channels
-
-        self.log_flow = modules.Log()
-        self.flows = nn.ModuleList()
-        self.flows.append(modules.ElementwiseAffine(2))
-        for i in range(n_flows):
-            self.flows.append(modules.ConvFlow(2, filter_channels, kernel_size, n_layers=3))
-            self.flows.append(modules.Flip())
-
-        self.post_pre = nn.Conv1d(1, filter_channels, 1)
-        self.post_proj = nn.Conv1d(filter_channels, filter_channels, 1)
-        self.post_convs = modules.DDSConv(filter_channels, kernel_size, n_layers=3, p_dropout=p_dropout)
-        self.post_flows = nn.ModuleList()
-        self.post_flows.append(modules.ElementwiseAffine(2))
-        for i in range(4):
-            self.post_flows.append(modules.ConvFlow(2, filter_channels, kernel_size, n_layers=3))
-            self.post_flows.append(modules.Flip())
-
-        self.pre = nn.Conv1d(in_channels, filter_channels, 1)
-        self.proj = nn.Conv1d(filter_channels, filter_channels, 1)
-        self.convs = modules.DDSConv(filter_channels, kernel_size, n_layers=3, p_dropout=p_dropout)
-        if gin_channels != 0:
-            self.cond = nn.Conv1d(gin_channels, filter_channels, 1)
-
-    def forward(self, x, x_mask, w=None, g=None, reverse=False, noise_scale=1.0):
-        x = torch.detach(x)
-        x = self.pre(x)
-        if g is not None:
-            g = torch.detach(g)
-            x = x + self.cond(g)
-        x = self.convs(x, x_mask)
-        x = self.proj(x) * x_mask
-
-        if not reverse:
-            flows = self.flows
-            assert w is not None
-
-            logdet_tot_q = 0
-            h_w = self.post_pre(w)
-            h_w = self.post_convs(h_w, x_mask)
-            h_w = self.post_proj(h_w) * x_mask
-            e_q = torch.randn(w.size(0), 2, w.size(2)).to(device=x.device, dtype=x.dtype) * x_mask
-            z_q = e_q
-            for flow in self.post_flows:
-                z_q, logdet_q = flow(z_q, x_mask, g=(x + h_w))
-                logdet_tot_q += logdet_q
-            z_u, z1 = torch.split(z_q, [1, 1], 1)
-            u = torch.sigmoid(z_u) * x_mask
-            z0 = (w - u) * x_mask
-            logdet_tot_q += torch.sum((F.logsigmoid(z_u) + F.logsigmoid(-z_u)) * x_mask, [1, 2])
-            logq = torch.sum(-0.5 * (math.log(2 * math.pi) + (e_q ** 2)) * x_mask, [1, 2]) - logdet_tot_q
-
-            logdet_tot = 0
-            z0, logdet = self.log_flow(z0, x_mask)
-            logdet_tot += logdet
-            z = torch.cat([z0, z1], 1)
-            for flow in flows:
-                z, logdet = flow(z, x_mask, g=x, reverse=reverse)
-                logdet_tot = logdet_tot + logdet
-            nll = torch.sum(0.5 * (math.log(2 * math.pi) + (z ** 2)) * x_mask, [1, 2]) - logdet_tot
-            return nll + logq  # [b]
-        else:
-            flows = list(reversed(self.flows))
-            flows = flows[:-2] + [flows[-1]]  # remove a useless vflow
-            z = torch.randn(x.size(0), 2, x.size(2)).to(device=x.device, dtype=x.dtype) * noise_scale
-            for flow in flows:
-                z = flow(z, x_mask, g=x, reverse=reverse)
-            z0, z1 = torch.split(z, [1, 1], 1)
-            logw = z0
-            return logw
-
-
-class DurationPredictor(nn.Module):
-    def __init__(self, in_channels, filter_channels, kernel_size, p_dropout, gin_channels=0):
-        super().__init__()
-
-        self.in_channels = in_channels
-        self.filter_channels = filter_channels
-        self.kernel_size = kernel_size
-        self.p_dropout = p_dropout
-        self.gin_channels = gin_channels
-
-        self.drop = nn.Dropout(p_dropout)
-        self.conv_1 = nn.Conv1d(in_channels, filter_channels, kernel_size, padding=kernel_size // 2)
-        self.norm_1 = modules.LayerNorm(filter_channels)
-        self.conv_2 = nn.Conv1d(filter_channels, filter_channels, kernel_size, padding=kernel_size // 2)
-        self.norm_2 = modules.LayerNorm(filter_channels)
-        self.proj = nn.Conv1d(filter_channels, 1, 1)
-
-        if gin_channels != 0:
-            self.cond = nn.Conv1d(gin_channels, in_channels, 1)
-
-    def forward(self, x, x_mask, g=None):
-        x = torch.detach(x)
-        if g is not None:
-            g = torch.detach(g)
-            x = x + self.cond(g)
-        x = self.conv_1(x * x_mask)
-        x = torch.relu(x)
-        x = self.norm_1(x)
-        x = self.drop(x)
-        x = self.conv_2(x * x_mask)
-        x = torch.relu(x)
-        x = self.norm_2(x)
-        x = self.drop(x)
-        x = self.proj(x * x_mask)
-        return x * x_mask
-
-
-class TextEncoder(nn.Module):
-    def __init__(self,
-                 n_vocab,
-                 out_channels,
-                 hidden_channels,
-                 filter_channels,
-                 n_heads,
-                 n_layers,
-                 kernel_size,
-                 p_dropout,
-                 gin_channels=0):
-        super().__init__()
-        self.n_vocab = n_vocab
-        self.out_channels = out_channels
-        self.hidden_channels = hidden_channels
-        self.filter_channels = filter_channels
-        self.n_heads = n_heads
-        self.n_layers = n_layers
-        self.kernel_size = kernel_size
-        self.p_dropout = p_dropout
-        self.gin_channels = gin_channels
-        self.emb = nn.Embedding(len(symbols), hidden_channels)
-        nn.init.normal_(self.emb.weight, 0.0, hidden_channels ** -0.5)
-        self.tone_emb = nn.Embedding(num_tones, hidden_channels)
-        nn.init.normal_(self.tone_emb.weight, 0.0, hidden_channels ** -0.5)
-        self.language_emb = nn.Embedding(num_languages, hidden_channels)
-        nn.init.normal_(self.language_emb.weight, 0.0, hidden_channels ** -0.5)
-        self.bert_proj = nn.Conv1d(1024, hidden_channels, 1)
-
-        self.encoder = attentions.Encoder(
-            hidden_channels,
-            filter_channels,
-            n_heads,
-            n_layers,
-            kernel_size,
-            p_dropout,
-            gin_channels=self.gin_channels)
-        self.proj = nn.Conv1d(hidden_channels, out_channels * 2, 1)
-
-    def forward(self, x, x_lengths, tone, language, bert, g=None):
-        x = (self.emb(x)+ self.tone_emb(tone)+ self.language_emb(language)+self.bert_proj(bert).transpose(1,2)) * math.sqrt(self.hidden_channels)  # [b, t, h]
-        x = torch.transpose(x, 1, -1)  # [b, h, t]
-        x_mask = torch.unsqueeze(commons.sequence_mask(x_lengths, x.size(2)), 1).to(x.dtype)
-
-        x = self.encoder(x * x_mask, x_mask, g=g)
-        stats = self.proj(x) * x_mask
-
-        m, logs = torch.split(stats, self.out_channels, dim=1)
-        return x, m, logs, x_mask
-
-
-class ResidualCouplingBlock(nn.Module):
-    def __init__(self,
-                 channels,
-                 hidden_channels,
-                 kernel_size,
-                 dilation_rate,
-                 n_layers,
-                 n_flows=4,
-                 gin_channels=0):
-        super().__init__()
-        self.channels = channels
-        self.hidden_channels = hidden_channels
-        self.kernel_size = kernel_size
-        self.dilation_rate = dilation_rate
-        self.n_layers = n_layers
-        self.n_flows = n_flows
-        self.gin_channels = gin_channels
-
-        self.flows = nn.ModuleList()
-        for i in range(n_flows):
-            self.flows.append(
-                modules.ResidualCouplingLayer(channels, hidden_channels, kernel_size, dilation_rate, n_layers,
-                                              gin_channels=gin_channels, mean_only=True))
-            self.flows.append(modules.Flip())
-
-    def forward(self, x, x_mask, g=None, reverse=False):
-        if not reverse:
-            for flow in self.flows:
-                x, _ = flow(x, x_mask, g=g, reverse=reverse)
-        else:
-            for flow in reversed(self.flows):
-                x = flow(x, x_mask, g=g, reverse=reverse)
-        return x
-
-
-class PosteriorEncoder(nn.Module):
-    def __init__(self,
-                 in_channels,
-                 out_channels,
-                 hidden_channels,
-                 kernel_size,
-                 dilation_rate,
-                 n_layers,
-                 gin_channels=0):
-        super().__init__()
-        self.in_channels = in_channels
-        self.out_channels = out_channels
-        self.hidden_channels = hidden_channels
-        self.kernel_size = kernel_size
-        self.dilation_rate = dilation_rate
-        self.n_layers = n_layers
-        self.gin_channels = gin_channels
-
-        self.pre = nn.Conv1d(in_channels, hidden_channels, 1)
-        self.enc = modules.WN(hidden_channels, kernel_size, dilation_rate, n_layers, gin_channels=gin_channels)
-        self.proj = nn.Conv1d(hidden_channels, out_channels * 2, 1)
-
-    def forward(self, x, x_lengths, g=None):
-        x_mask = torch.unsqueeze(commons.sequence_mask(x_lengths, x.size(2)), 1).to(x.dtype)
-        x = self.pre(x) * x_mask
-        x = self.enc(x, x_mask, g=g)
-        stats = self.proj(x) * x_mask
-        m, logs = torch.split(stats, self.out_channels, dim=1)
-        z = (m + torch.randn_like(m) * torch.exp(logs)) * x_mask
-        return z, m, logs, x_mask
-
-
-class Generator(torch.nn.Module):
-    def __init__(self, initial_channel, resblock, resblock_kernel_sizes, resblock_dilation_sizes, upsample_rates,
-                 upsample_initial_channel, upsample_kernel_sizes, gin_channels=0):
-        super(Generator, self).__init__()
-        self.num_kernels = len(resblock_kernel_sizes)
-        self.num_upsamples = len(upsample_rates)
-        self.conv_pre = Conv1d(initial_channel, upsample_initial_channel, 7, 1, padding=3)
-        resblock = modules.ResBlock1 if resblock == '1' else modules.ResBlock2
-
-        self.ups = nn.ModuleList()
-        for i, (u, k) in enumerate(zip(upsample_rates, upsample_kernel_sizes)):
-            self.ups.append(weight_norm(
-                ConvTranspose1d(upsample_initial_channel // (2 ** i), upsample_initial_channel // (2 ** (i + 1)),
-                                k, u, padding=(k - u) // 2)))
-
-        self.resblocks = nn.ModuleList()
-        for i in range(len(self.ups)):
-            ch = upsample_initial_channel // (2 ** (i + 1))
-            for j, (k, d) in enumerate(zip(resblock_kernel_sizes, resblock_dilation_sizes)):
-                self.resblocks.append(resblock(ch, k, d))
-
-        self.conv_post = Conv1d(ch, 1, 7, 1, padding=3, bias=False)
-        self.ups.apply(init_weights)
-
-        if gin_channels != 0:
-            self.cond = nn.Conv1d(gin_channels, upsample_initial_channel, 1)
-
-    def forward(self, x, g=None):
-        x = self.conv_pre(x)
-        if g is not None:
-            x = x + self.cond(g)
-
-        for i in range(self.num_upsamples):
-            x = F.leaky_relu(x, modules.LRELU_SLOPE)
-            x = self.ups[i](x)
-            xs = None
-            for j in range(self.num_kernels):
-                if xs is None:
-                    xs = self.resblocks[i * self.num_kernels + j](x)
-                else:
-                    xs += self.resblocks[i * self.num_kernels + j](x)
-            x = xs / self.num_kernels
-        x = F.leaky_relu(x)
-        x = self.conv_post(x)
-        x = torch.tanh(x)
-
-        return x
-
-    def remove_weight_norm(self):
-        print('Removing weight norm...')
-        for l in self.ups:
-            remove_weight_norm(l)
-        for l in self.resblocks:
-            l.remove_weight_norm()
-
-
-class DiscriminatorP(torch.nn.Module):
-    def __init__(self, period, kernel_size=5, stride=3, use_spectral_norm=False):
-        super(DiscriminatorP, self).__init__()
-        self.period = period
-        self.use_spectral_norm = use_spectral_norm
-        norm_f = weight_norm if use_spectral_norm == False else spectral_norm
-        self.convs = nn.ModuleList([
-            norm_f(Conv2d(1, 32, (kernel_size, 1), (stride, 1), padding=(get_padding(kernel_size, 1), 0))),
-            norm_f(Conv2d(32, 128, (kernel_size, 1), (stride, 1), padding=(get_padding(kernel_size, 1), 0))),
-            norm_f(Conv2d(128, 512, (kernel_size, 1), (stride, 1), padding=(get_padding(kernel_size, 1), 0))),
-            norm_f(Conv2d(512, 1024, (kernel_size, 1), (stride, 1), padding=(get_padding(kernel_size, 1), 0))),
-            norm_f(Conv2d(1024, 1024, (kernel_size, 1), 1, padding=(get_padding(kernel_size, 1), 0))),
-        ])
-        self.conv_post = norm_f(Conv2d(1024, 1, (3, 1), 1, padding=(1, 0)))
-
-    def forward(self, x):
-        fmap = []
-
-        # 1d to 2d
-        b, c, t = x.shape
-        if t % self.period != 0:  # pad first
-            n_pad = self.period - (t % self.period)
-            x = F.pad(x, (0, n_pad), "reflect")
-            t = t + n_pad
-        x = x.view(b, c, t // self.period, self.period)
-
-        for l in self.convs:
-            x = l(x)
-            x = F.leaky_relu(x, modules.LRELU_SLOPE)
-            fmap.append(x)
-        x = self.conv_post(x)
-        fmap.append(x)
-        x = torch.flatten(x, 1, -1)
-
-        return x, fmap
-
-
-class DiscriminatorS(torch.nn.Module):
-    def __init__(self, use_spectral_norm=False):
-        super(DiscriminatorS, self).__init__()
-        norm_f = weight_norm if use_spectral_norm == False else spectral_norm
-        self.convs = nn.ModuleList([
-            norm_f(Conv1d(1, 16, 15, 1, padding=7)),
-            norm_f(Conv1d(16, 64, 41, 4, groups=4, padding=20)),
-            norm_f(Conv1d(64, 256, 41, 4, groups=16, padding=20)),
-            norm_f(Conv1d(256, 1024, 41, 4, groups=64, padding=20)),
-            norm_f(Conv1d(1024, 1024, 41, 4, groups=256, padding=20)),
-            norm_f(Conv1d(1024, 1024, 5, 1, padding=2)),
-        ])
-        self.conv_post = norm_f(Conv1d(1024, 1, 3, 1, padding=1))
-
-    def forward(self, x):
-        fmap = []
-
-        for l in self.convs:
-            x = l(x)
-            x = F.leaky_relu(x, modules.LRELU_SLOPE)
-            fmap.append(x)
-        x = self.conv_post(x)
-        fmap.append(x)
-        x = torch.flatten(x, 1, -1)
-
-        return x, fmap
-
-
-class MultiPeriodDiscriminator(torch.nn.Module):
-    def __init__(self, use_spectral_norm=False):
-        super(MultiPeriodDiscriminator, self).__init__()
-        periods = [2, 3, 5, 7, 11]
-
-        discs = [DiscriminatorS(use_spectral_norm=use_spectral_norm)]
-        discs = discs + [DiscriminatorP(i, use_spectral_norm=use_spectral_norm) for i in periods]
-        self.discriminators = nn.ModuleList(discs)
-
-    def forward(self, y, y_hat):
-        y_d_rs = []
-        y_d_gs = []
-        fmap_rs = []
-        fmap_gs = []
-        for i, d in enumerate(self.discriminators):
-            y_d_r, fmap_r = d(y)
-            y_d_g, fmap_g = d(y_hat)
-            y_d_rs.append(y_d_r)
-            y_d_gs.append(y_d_g)
-            fmap_rs.append(fmap_r)
-            fmap_gs.append(fmap_g)
-
-        return y_d_rs, y_d_gs, fmap_rs, fmap_gs
-
-class ReferenceEncoder(nn.Module):
-    '''
-    inputs --- [N, Ty/r, n_mels*r]  mels
-    outputs --- [N, ref_enc_gru_size]
-    '''
-
-    def __init__(self, spec_channels, gin_channels=0):
-
-        super().__init__()
-        self.spec_channels = spec_channels
-        ref_enc_filters = [32, 32, 64, 64, 128, 128]
-        K = len(ref_enc_filters)
-        filters = [1] + ref_enc_filters
-        convs = [weight_norm(nn.Conv2d(in_channels=filters[i],
-                                       out_channels=filters[i + 1],
-                                       kernel_size=(3, 3),
-                                       stride=(2, 2),
-                                       padding=(1, 1))) for i in range(K)]
-        self.convs = nn.ModuleList(convs)
-        # self.wns = nn.ModuleList([weight_norm(num_features=ref_enc_filters[i]) for i in range(K)])
-
-        out_channels = self.calculate_channels(spec_channels, 3, 2, 1, K)
-        self.gru = nn.GRU(input_size=ref_enc_filters[-1] * out_channels,
-                          hidden_size=256 // 2,
-                          batch_first=True)
-        self.proj = nn.Linear(128, gin_channels)
-
-    def forward(self, inputs, mask=None):
-        N = inputs.size(0)
-        out = inputs.view(N, 1, -1, self.spec_channels)  # [N, 1, Ty, n_freqs]
-        for conv in self.convs:
-            out = conv(out)
-            # out = wn(out)
-            out = F.relu(out)  # [N, 128, Ty//2^K, n_mels//2^K]
-
-        out = out.transpose(1, 2)  # [N, Ty//2^K, 128, n_mels//2^K]
-        T = out.size(1)
-        N = out.size(0)
-        out = out.contiguous().view(N, T, -1)  # [N, Ty//2^K, 128*n_mels//2^K]
-
-        self.gru.flatten_parameters()
-        memory, out = self.gru(out)  # out --- [1, N, 128]
-
-        return self.proj(out.squeeze(0))
-
-    def calculate_channels(self, L, kernel_size, stride, pad, n_convs):
-        for i in range(n_convs):
-            L = (L - kernel_size + 2 * pad) // stride + 1
-        return L
-
-
-class SynthesizerTrn(nn.Module):
-    """
-  Synthesizer for Training
-  """
-
-    def __init__(self,
-                 n_vocab,
-                 spec_channels,
-                 segment_size,
-                 inter_channels,
-                 hidden_channels,
-                 filter_channels,
-                 n_heads,
-                 n_layers,
-                 kernel_size,
-                 p_dropout,
-                 resblock,
-                 resblock_kernel_sizes,
-                 resblock_dilation_sizes,
-                 upsample_rates,
-                 upsample_initial_channel,
-                 upsample_kernel_sizes,
-                 n_speakers=256,
-                 gin_channels=256,
-                 use_sdp=True,
-                 n_flow_layer = 4,
-                 n_layers_trans_flow = 3,
-                 flow_share_parameter = False,
-                 use_transformer_flow = True,
-                 **kwargs):
-
-        super().__init__()
-        self.n_vocab = n_vocab
-        self.spec_channels = spec_channels
-        self.inter_channels = inter_channels
-        self.hidden_channels = hidden_channels
-        self.filter_channels = filter_channels
-        self.n_heads = n_heads
-        self.n_layers = n_layers
-        self.kernel_size = kernel_size
-        self.p_dropout = p_dropout
-        self.resblock = resblock
-        self.resblock_kernel_sizes = resblock_kernel_sizes
-        self.resblock_dilation_sizes = resblock_dilation_sizes
-        self.upsample_rates = upsample_rates
-        self.upsample_initial_channel = upsample_initial_channel
-        self.upsample_kernel_sizes = upsample_kernel_sizes
-        self.segment_size = segment_size
-        self.n_speakers = n_speakers
-        self.gin_channels = gin_channels
-        self.n_layers_trans_flow = n_layers_trans_flow
-        self.use_spk_conditioned_encoder = kwargs.get("use_spk_conditioned_encoder", True)
-        self.use_sdp = use_sdp
-        self.use_noise_scaled_mas = kwargs.get("use_noise_scaled_mas", False)
-        self.mas_noise_scale_initial = kwargs.get("mas_noise_scale_initial", 0.01)
-        self.noise_scale_delta = kwargs.get("noise_scale_delta", 2e-6)
-        self.current_mas_noise_scale = self.mas_noise_scale_initial
-        if self.use_spk_conditioned_encoder and gin_channels > 0:
-            self.enc_gin_channels = gin_channels
-        self.enc_p = TextEncoder(n_vocab,
-                                 inter_channels,
-                                 hidden_channels,
-                                 filter_channels,
-                                 n_heads,
-                                 n_layers,
-                                 kernel_size,
-                                 p_dropout,
-                                 gin_channels=self.enc_gin_channels)
-        self.dec = Generator(inter_channels, resblock, resblock_kernel_sizes, resblock_dilation_sizes, upsample_rates,
-                             upsample_initial_channel, upsample_kernel_sizes, gin_channels=gin_channels)
-        self.enc_q = PosteriorEncoder(spec_channels, inter_channels, hidden_channels, 5, 1, 16,
-                                      gin_channels=gin_channels)
-        if use_transformer_flow:
-            self.flow = TransformerCouplingBlock(inter_channels, hidden_channels, filter_channels, n_heads, n_layers_trans_flow, 5, p_dropout, n_flow_layer, gin_channels=gin_channels,share_parameter= flow_share_parameter)
-        else:
-            self.flow = ResidualCouplingBlock(inter_channels, hidden_channels, 5, 1, n_flow_layer, gin_channels=gin_channels)
-        self.sdp = StochasticDurationPredictor(hidden_channels, 192, 3, 0.5, 4, gin_channels=gin_channels)
-        self.dp = DurationPredictor(hidden_channels, 256, 3, 0.5, gin_channels=gin_channels)
-        
-        if n_speakers >= 1:
-            self.emb_g = nn.Embedding(n_speakers, gin_channels)
-        else:
-            self.ref_enc = ReferenceEncoder(spec_channels, gin_channels)
-
-    def forward(self, x, x_lengths, y, y_lengths, sid, tone, language, bert):
-        if self.n_speakers > 0:
-            g = self.emb_g(sid).unsqueeze(-1)  # [b, h, 1]
-        else:
-            g = self.ref_enc(y.transpose(1,2)).unsqueeze(-1)
-        x, m_p, logs_p, x_mask = self.enc_p(x, x_lengths, tone, language, bert,g=g)
-        z, m_q, logs_q, y_mask = self.enc_q(y, y_lengths, g=g)
-        z_p = self.flow(z, y_mask, g=g)
-
-        with torch.no_grad():
-            # negative cross-entropy
-            s_p_sq_r = torch.exp(-2 * logs_p)  # [b, d, t]
-            neg_cent1 = torch.sum(-0.5 * math.log(2 * math.pi) - logs_p, [1], keepdim=True)  # [b, 1, t_s]
-            neg_cent2 = torch.matmul(-0.5 * (z_p ** 2).transpose(1, 2),
-                                     s_p_sq_r)  # [b, t_t, d] x [b, d, t_s] = [b, t_t, t_s]
-            neg_cent3 = torch.matmul(z_p.transpose(1, 2), (m_p * s_p_sq_r))  # [b, t_t, d] x [b, d, t_s] = [b, t_t, t_s]
-            neg_cent4 = torch.sum(-0.5 * (m_p ** 2) * s_p_sq_r, [1], keepdim=True)  # [b, 1, t_s]
-            neg_cent = neg_cent1 + neg_cent2 + neg_cent3 + neg_cent4
-            if self.use_noise_scaled_mas:
-               epsilon = torch.std(neg_cent) * torch.randn_like(neg_cent) * self.current_mas_noise_scale
-               neg_cent = neg_cent + epsilon
-
-            attn_mask = torch.unsqueeze(x_mask, 2) * torch.unsqueeze(y_mask, -1)
-            attn = monotonic_align.maximum_path(neg_cent, attn_mask.squeeze(1)).unsqueeze(1).detach()
-
-        w = attn.sum(2)
-
-        l_length_sdp = self.sdp(x, x_mask, w, g=g)
-        l_length_sdp = l_length_sdp / torch.sum(x_mask)
-        
-        logw_ = torch.log(w + 1e-6) * x_mask
-        logw = self.dp(x, x_mask, g=g)
-        l_length_dp = torch.sum((logw - logw_) ** 2, [1, 2]) / torch.sum(x_mask)  # for averaging
-
-        l_length = l_length_dp + l_length_sdp
-
-        # expand prior
-        m_p = torch.matmul(attn.squeeze(1), m_p.transpose(1, 2)).transpose(1, 2)
-        logs_p = torch.matmul(attn.squeeze(1), logs_p.transpose(1, 2)).transpose(1, 2)
-
-        z_slice, ids_slice = commons.rand_slice_segments(z, y_lengths, self.segment_size)
-        o = self.dec(z_slice, g=g)
-        return o, l_length, attn, ids_slice, x_mask, y_mask, (z, z_p, m_p, logs_p, m_q, logs_q), (x, logw, logw_)
-      
-    def infer(self, x, x_lengths, sid, tone, language, bert, noise_scale=.667, length_scale=1, noise_scale_w=0.8, max_len=None, sdp_ratio=0,y=None):
-        #x, m_p, logs_p, x_mask = self.enc_p(x, x_lengths, tone, language, bert)
-        # g = self.gst(y)
-        if self.n_speakers > 0:
-            g = self.emb_g(sid).unsqueeze(-1)  # [b, h, 1]
-        else:
-            g = self.ref_enc(y.transpose(1,2)).unsqueeze(-1)
-        x, m_p, logs_p, x_mask = self.enc_p(x, x_lengths, tone, language, bert,g=g)
-        logw = self.sdp(x, x_mask, g=g, reverse=True, noise_scale=noise_scale_w) * (sdp_ratio) + self.dp(x, x_mask, g=g) * (1 - sdp_ratio)
-        w = torch.exp(logw) * x_mask * length_scale
-        w_ceil = torch.ceil(w)
-        y_lengths = torch.clamp_min(torch.sum(w_ceil, [1, 2]), 1).long()
-        y_mask = torch.unsqueeze(commons.sequence_mask(y_lengths, None), 1).to(x_mask.dtype)
-        attn_mask = torch.unsqueeze(x_mask, 2) * torch.unsqueeze(y_mask, -1)
-        attn = commons.generate_path(w_ceil, attn_mask)
-
-        m_p = torch.matmul(attn.squeeze(1), m_p.transpose(1, 2)).transpose(1, 2)  # [b, t', t], [b, t, d] -> [b, d, t']
-        logs_p = torch.matmul(attn.squeeze(1), logs_p.transpose(1, 2)).transpose(1,
-                                                                                 2)  # [b, t', t], [b, t, d] -> [b, d, t']
-
-        z_p = m_p + torch.randn_like(m_p) * torch.exp(logs_p) * noise_scale
-        z = self.flow(z_p, y_mask, g=g, reverse=True)
-        o = self.dec((z * y_mask)[:, :, :max_len], g=g)
-        return o, attn, y_mask, (z, z_p, m_p, logs_p)
diff --git a/spaces/XzJosh/Bella-Bert-VITS2/commons.py b/spaces/XzJosh/Bella-Bert-VITS2/commons.py
deleted file mode 100644
index 9ad0444b61cbadaa388619986c2889c707d873ce..0000000000000000000000000000000000000000
--- a/spaces/XzJosh/Bella-Bert-VITS2/commons.py
+++ /dev/null
@@ -1,161 +0,0 @@
-import math
-import numpy as np
-import torch
-from torch import nn
-from torch.nn import functional as F
-
-
-def init_weights(m, mean=0.0, std=0.01):
-  classname = m.__class__.__name__
-  if classname.find("Conv") != -1:
-    m.weight.data.normal_(mean, std)
-
-
-def get_padding(kernel_size, dilation=1):
-  return int((kernel_size*dilation - dilation)/2)
-
-
-def convert_pad_shape(pad_shape):
-  l = pad_shape[::-1]
-  pad_shape = [item for sublist in l for item in sublist]
-  return pad_shape
-
-
-def intersperse(lst, item):
-  result = [item] * (len(lst) * 2 + 1)
-  result[1::2] = lst
-  return result
-
-
-def kl_divergence(m_p, logs_p, m_q, logs_q):
-  """KL(P||Q)"""
-  kl = (logs_q - logs_p) - 0.5
-  kl += 0.5 * (torch.exp(2. * logs_p) + ((m_p - m_q)**2)) * torch.exp(-2. * logs_q)
-  return kl
-
-
-def rand_gumbel(shape):
-  """Sample from the Gumbel distribution, protect from overflows."""
-  uniform_samples = torch.rand(shape) * 0.99998 + 0.00001
-  return -torch.log(-torch.log(uniform_samples))
-
-
-def rand_gumbel_like(x):
-  g = rand_gumbel(x.size()).to(dtype=x.dtype, device=x.device)
-  return g
-
-
-def slice_segments(x, ids_str, segment_size=4):
-  ret = torch.zeros_like(x[:, :, :segment_size])
-  for i in range(x.size(0)):
-    idx_str = ids_str[i]
-    idx_end = idx_str + segment_size
-    ret[i] = x[i, :, idx_str:idx_end]
-  return ret
-
-
-def rand_slice_segments(x, x_lengths=None, segment_size=4):
-  b, d, t = x.size()
-  if x_lengths is None:
-    x_lengths = t
-  ids_str_max = x_lengths - segment_size + 1
-  ids_str = (torch.rand([b]).to(device=x.device) * ids_str_max).to(dtype=torch.long)
-  ret = slice_segments(x, ids_str, segment_size)
-  return ret, ids_str
-
-
-def get_timing_signal_1d(
-    length, channels, min_timescale=1.0, max_timescale=1.0e4):
-  position = torch.arange(length, dtype=torch.float)
-  num_timescales = channels // 2
-  log_timescale_increment = (
-      math.log(float(max_timescale) / float(min_timescale)) /
-      (num_timescales - 1))
-  inv_timescales = min_timescale * torch.exp(
-      torch.arange(num_timescales, dtype=torch.float) * -log_timescale_increment)
-  scaled_time = position.unsqueeze(0) * inv_timescales.unsqueeze(1)
-  signal = torch.cat([torch.sin(scaled_time), torch.cos(scaled_time)], 0)
-  signal = F.pad(signal, [0, 0, 0, channels % 2])
-  signal = signal.view(1, channels, length)
-  return signal
-
-
-def add_timing_signal_1d(x, min_timescale=1.0, max_timescale=1.0e4):
-  b, channels, length = x.size()
-  signal = get_timing_signal_1d(length, channels, min_timescale, max_timescale)
-  return x + signal.to(dtype=x.dtype, device=x.device)
-
-
-def cat_timing_signal_1d(x, min_timescale=1.0, max_timescale=1.0e4, axis=1):
-  b, channels, length = x.size()
-  signal = get_timing_signal_1d(length, channels, min_timescale, max_timescale)
-  return torch.cat([x, signal.to(dtype=x.dtype, device=x.device)], axis)
-
-
-def subsequent_mask(length):
-  mask = torch.tril(torch.ones(length, length)).unsqueeze(0).unsqueeze(0)
-  return mask
-
-
-@torch.jit.script
-def fused_add_tanh_sigmoid_multiply(input_a, input_b, n_channels):
-  n_channels_int = n_channels[0]
-  in_act = input_a + input_b
-  t_act = torch.tanh(in_act[:, :n_channels_int, :])
-  s_act = torch.sigmoid(in_act[:, n_channels_int:, :])
-  acts = t_act * s_act
-  return acts
-
-
-def convert_pad_shape(pad_shape):
-  l = pad_shape[::-1]
-  pad_shape = [item for sublist in l for item in sublist]
-  return pad_shape
-
-
-def shift_1d(x):
-  x = F.pad(x, convert_pad_shape([[0, 0], [0, 0], [1, 0]]))[:, :, :-1]
-  return x
-
-
-def sequence_mask(length, max_length=None):
-  if max_length is None:
-    max_length = length.max()
-  x = torch.arange(max_length, dtype=length.dtype, device=length.device)
-  return x.unsqueeze(0) < length.unsqueeze(1)
-
-
-def generate_path(duration, mask):
-  """
-  duration: [b, 1, t_x]
-  mask: [b, 1, t_y, t_x]
-  """
-  device = duration.device
-  
-  b, _, t_y, t_x = mask.shape
-  cum_duration = torch.cumsum(duration, -1)
-  
-  cum_duration_flat = cum_duration.view(b * t_x)
-  path = sequence_mask(cum_duration_flat, t_y).to(mask.dtype)
-  path = path.view(b, t_x, t_y)
-  path = path - F.pad(path, convert_pad_shape([[0, 0], [1, 0], [0, 0]]))[:, :-1]
-  path = path.unsqueeze(1).transpose(2,3) * mask
-  return path
-
-
-def clip_grad_value_(parameters, clip_value, norm_type=2):
-  if isinstance(parameters, torch.Tensor):
-    parameters = [parameters]
-  parameters = list(filter(lambda p: p.grad is not None, parameters))
-  norm_type = float(norm_type)
-  if clip_value is not None:
-    clip_value = float(clip_value)
-
-  total_norm = 0
-  for p in parameters:
-    param_norm = p.grad.data.norm(norm_type)
-    total_norm += param_norm.item() ** norm_type
-    if clip_value is not None:
-      p.grad.data.clamp_(min=-clip_value, max=clip_value)
-  total_norm = total_norm ** (1. / norm_type)
-  return total_norm
diff --git a/spaces/XzJosh/maimai-Bert-VITS2/mel_processing.py b/spaces/XzJosh/maimai-Bert-VITS2/mel_processing.py
deleted file mode 100644
index 50435ecf88ef4fb6c1d47f3e6edd04c3ea7d3e80..0000000000000000000000000000000000000000
--- a/spaces/XzJosh/maimai-Bert-VITS2/mel_processing.py
+++ /dev/null
@@ -1,112 +0,0 @@
-import math
-import os
-import random
-import torch
-from torch import nn
-import torch.nn.functional as F
-import torch.utils.data
-import numpy as np
-import librosa
-import librosa.util as librosa_util
-from librosa.util import normalize, pad_center, tiny
-from scipy.signal import get_window
-from scipy.io.wavfile import read
-from librosa.filters import mel as librosa_mel_fn
-
-MAX_WAV_VALUE = 32768.0
-
-
-def dynamic_range_compression_torch(x, C=1, clip_val=1e-5):
-    """
-    PARAMS
-    ------
-    C: compression factor
-    """
-    return torch.log(torch.clamp(x, min=clip_val) * C)
-
-
-def dynamic_range_decompression_torch(x, C=1):
-    """
-    PARAMS
-    ------
-    C: compression factor used to compress
-    """
-    return torch.exp(x) / C
-
-
-def spectral_normalize_torch(magnitudes):
-    output = dynamic_range_compression_torch(magnitudes)
-    return output
-
-
-def spectral_de_normalize_torch(magnitudes):
-    output = dynamic_range_decompression_torch(magnitudes)
-    return output
-
-
-mel_basis = {}
-hann_window = {}
-
-
-def spectrogram_torch(y, n_fft, sampling_rate, hop_size, win_size, center=False):
-    if torch.min(y) < -1.:
-        print('min value is ', torch.min(y))
-    if torch.max(y) > 1.:
-        print('max value is ', torch.max(y))
-
-    global hann_window
-    dtype_device = str(y.dtype) + '_' + str(y.device)
-    wnsize_dtype_device = str(win_size) + '_' + dtype_device
-    if wnsize_dtype_device not in hann_window:
-        hann_window[wnsize_dtype_device] = torch.hann_window(win_size).to(dtype=y.dtype, device=y.device)
-
-    y = torch.nn.functional.pad(y.unsqueeze(1), (int((n_fft-hop_size)/2), int((n_fft-hop_size)/2)), mode='reflect')
-    y = y.squeeze(1)
-
-    spec = torch.stft(y, n_fft, hop_length=hop_size, win_length=win_size, window=hann_window[wnsize_dtype_device],
-                      center=center, pad_mode='reflect', normalized=False, onesided=True, return_complex=False)
-
-    spec = torch.sqrt(spec.pow(2).sum(-1) + 1e-6)
-    return spec
-
-
-def spec_to_mel_torch(spec, n_fft, num_mels, sampling_rate, fmin, fmax):
-    global mel_basis
-    dtype_device = str(spec.dtype) + '_' + str(spec.device)
-    fmax_dtype_device = str(fmax) + '_' + dtype_device
-    if fmax_dtype_device not in mel_basis:
-        mel = librosa_mel_fn(sampling_rate, n_fft, num_mels, fmin, fmax)
-        mel_basis[fmax_dtype_device] = torch.from_numpy(mel).to(dtype=spec.dtype, device=spec.device)
-    spec = torch.matmul(mel_basis[fmax_dtype_device], spec)
-    spec = spectral_normalize_torch(spec)
-    return spec
-
-
-def mel_spectrogram_torch(y, n_fft, num_mels, sampling_rate, hop_size, win_size, fmin, fmax, center=False):
-    if torch.min(y) < -1.:
-        print('min value is ', torch.min(y))
-    if torch.max(y) > 1.:
-        print('max value is ', torch.max(y))
-
-    global mel_basis, hann_window
-    dtype_device = str(y.dtype) + '_' + str(y.device)
-    fmax_dtype_device = str(fmax) + '_' + dtype_device
-    wnsize_dtype_device = str(win_size) + '_' + dtype_device
-    if fmax_dtype_device not in mel_basis:
-        mel = librosa_mel_fn(sampling_rate, n_fft, num_mels, fmin, fmax)
-        mel_basis[fmax_dtype_device] = torch.from_numpy(mel).to(dtype=y.dtype, device=y.device)
-    if wnsize_dtype_device not in hann_window:
-        hann_window[wnsize_dtype_device] = torch.hann_window(win_size).to(dtype=y.dtype, device=y.device)
-
-    y = torch.nn.functional.pad(y.unsqueeze(1), (int((n_fft-hop_size)/2), int((n_fft-hop_size)/2)), mode='reflect')
-    y = y.squeeze(1)
-
-    spec = torch.stft(y, n_fft, hop_length=hop_size, win_length=win_size, window=hann_window[wnsize_dtype_device],
-                          center=center, pad_mode='reflect', normalized=False, onesided=True, return_complex=False)
-
-    spec = torch.sqrt(spec.pow(2).sum(-1) + 1e-6)
-
-    spec = torch.matmul(mel_basis[fmax_dtype_device], spec)
-    spec = spectral_normalize_torch(spec)
-
-    return spec
diff --git a/spaces/XzJosh/nanami-Bert-VITS2/text/japanese.py b/spaces/XzJosh/nanami-Bert-VITS2/text/japanese.py
deleted file mode 100644
index ddedafa0c5b7986068dc6c91637a86febc3923a9..0000000000000000000000000000000000000000
--- a/spaces/XzJosh/nanami-Bert-VITS2/text/japanese.py
+++ /dev/null
@@ -1,104 +0,0 @@
-# modified from https://github.com/CjangCjengh/vits/blob/main/text/japanese.py
-import re
-import sys
-
-import pyopenjtalk
-
-from text import symbols
-
-# Regular expression matching Japanese without punctuation marks:
-_japanese_characters = re.compile(
-    r'[A-Za-z\d\u3005\u3040-\u30ff\u4e00-\u9fff\uff11-\uff19\uff21-\uff3a\uff41-\uff5a\uff66-\uff9d]')
-
-# Regular expression matching non-Japanese characters or punctuation marks:
-_japanese_marks = re.compile(
-    r'[^A-Za-z\d\u3005\u3040-\u30ff\u4e00-\u9fff\uff11-\uff19\uff21-\uff3a\uff41-\uff5a\uff66-\uff9d]')
-
-# List of (symbol, Japanese) pairs for marks:
-_symbols_to_japanese = [(re.compile('%s' % x[0]), x[1]) for x in [
-    ('％', 'パーセント')
-]]
-
-
-# List of (consonant, sokuon) pairs:
-_real_sokuon = [(re.compile('%s' % x[0]), x[1]) for x in [
-    (r'Q([↑↓]*[kg])', r'k#\1'),
-    (r'Q([↑↓]*[tdjʧ])', r't#\1'),
-    (r'Q([↑↓]*[sʃ])', r's\1'),
-    (r'Q([↑↓]*[pb])', r'p#\1')
-]]
-
-# List of (consonant, hatsuon) pairs:
-_real_hatsuon = [(re.compile('%s' % x[0]), x[1]) for x in [
-    (r'N([↑↓]*[pbm])', r'm\1'),
-    (r'N([↑↓]*[ʧʥj])', r'n^\1'),
-    (r'N([↑↓]*[tdn])', r'n\1'),
-    (r'N([↑↓]*[kg])', r'ŋ\1')
-]]
-
-
-
-def post_replace_ph(ph):
-    rep_map = {
-        '：': ',',
-        '；': ',',
-        '，': ',',
-        '。': '.',
-        '！': '!',
-        '？': '?',
-        '\n': '.',
-        "·": ",",
-        '、': ",",
-        '...': '…',
-        'v': "V"
-    }
-    if ph in rep_map.keys():
-        ph = rep_map[ph]
-    if ph in symbols:
-        return ph
-    if ph not in symbols:
-        ph = 'UNK'
-    return ph
-
-def symbols_to_japanese(text):
-    for regex, replacement in _symbols_to_japanese:
-        text = re.sub(regex, replacement, text)
-    return text
-
-
-def preprocess_jap(text):
-    '''Reference https://r9y9.github.io/ttslearn/latest/notebooks/ch10_Recipe-Tacotron.html'''
-    text = symbols_to_japanese(text)
-    sentences = re.split(_japanese_marks, text)
-    marks = re.findall(_japanese_marks, text)
-    text = []
-    for i, sentence in enumerate(sentences):
-        if re.match(_japanese_characters, sentence):
-            p = pyopenjtalk.g2p(sentence)
-            text += p.split(" ")
-
-        if i < len(marks):
-            text += [marks[i].replace(' ', '')]
-    return text
-
-def text_normalize(text):
-    # todo: jap text normalize
-    return text
-
-def g2p(norm_text):
-    phones = preprocess_jap(norm_text)
-    phones = [post_replace_ph(i) for i in phones]
-    # todo: implement tones and word2ph
-    tones = [0 for i in phones]
-    word2ph = [1 for i in phones]
-    return phones, tones, word2ph
-
-
-if __name__ == '__main__':
-    for line in open("../../../Downloads/transcript_utf8.txt").readlines():
-        text = line.split(":")[1]
-        phones, tones, word2ph = g2p(text)
-        for p in phones:
-            if p == "z":
-                print(text, phones)
-                sys.exit(0)
diff --git a/spaces/Yiqin/ChatVID/model/vision/grit_src/third_party/CenterNet2/configs/common/data/coco.py b/spaces/Yiqin/ChatVID/model/vision/grit_src/third_party/CenterNet2/configs/common/data/coco.py
deleted file mode 100644
index 703c4385c7ddc7eb0759c98d102ab2384d6a9e3e..0000000000000000000000000000000000000000
--- a/spaces/Yiqin/ChatVID/model/vision/grit_src/third_party/CenterNet2/configs/common/data/coco.py
+++ /dev/null
@@ -1,48 +0,0 @@
-from omegaconf import OmegaConf
-
-import detectron2.data.transforms as T
-from detectron2.config import LazyCall as L
-from detectron2.data import (
-    DatasetMapper,
-    build_detection_test_loader,
-    build_detection_train_loader,
-    get_detection_dataset_dicts,
-)
-from detectron2.evaluation import COCOEvaluator
-
-dataloader = OmegaConf.create()
-
-dataloader.train = L(build_detection_train_loader)(
-    dataset=L(get_detection_dataset_dicts)(names="coco_2017_train"),
-    mapper=L(DatasetMapper)(
-        is_train=True,
-        augmentations=[
-            L(T.ResizeShortestEdge)(
-                short_edge_length=(640, 672, 704, 736, 768, 800),
-                sample_style="choice",
-                max_size=1333,
-            ),
-            L(T.RandomFlip)(horizontal=True),
-        ],
-        image_format="BGR",
-        use_instance_mask=True,
-    ),
-    total_batch_size=16,
-    num_workers=4,
-)
-
-dataloader.test = L(build_detection_test_loader)(
-    dataset=L(get_detection_dataset_dicts)(names="coco_2017_val", filter_empty=False),
-    mapper=L(DatasetMapper)(
-        is_train=False,
-        augmentations=[
-            L(T.ResizeShortestEdge)(short_edge_length=800, max_size=1333),
-        ],
-        image_format="${...train.mapper.image_format}",
-    ),
-    num_workers=4,
-)
-
-dataloader.evaluator = L(COCOEvaluator)(
-    dataset_name="${..test.dataset.names}",
-)
diff --git a/spaces/Yiqin/ChatVID/model/vision/grit_src/third_party/CenterNet2/detectron2/export/caffe2_export.py b/spaces/Yiqin/ChatVID/model/vision/grit_src/third_party/CenterNet2/detectron2/export/caffe2_export.py
deleted file mode 100644
index 74ac123a7aed6cd77d6d833446a831d9048745b2..0000000000000000000000000000000000000000
--- a/spaces/Yiqin/ChatVID/model/vision/grit_src/third_party/CenterNet2/detectron2/export/caffe2_export.py
+++ /dev/null
@@ -1,207 +0,0 @@
-# Copyright (c) Facebook, Inc. and its affiliates.
-
-import copy
-import io
-import logging
-import numpy as np
-from typing import List
-import onnx
-import torch
-from caffe2.proto import caffe2_pb2
-from caffe2.python import core
-from caffe2.python.onnx.backend import Caffe2Backend
-from tabulate import tabulate
-from termcolor import colored
-from torch.onnx import OperatorExportTypes
-
-from .shared import (
-    ScopedWS,
-    construct_init_net_from_params,
-    fuse_alias_placeholder,
-    fuse_copy_between_cpu_and_gpu,
-    get_params_from_init_net,
-    group_norm_replace_aten_with_caffe2,
-    infer_device_type,
-    remove_dead_end_ops,
-    remove_reshape_for_fc,
-    save_graph,
-)
-
-logger = logging.getLogger(__name__)
-
-
-def export_onnx_model(model, inputs):
-    """
-    Trace and export a model to onnx format.
-
-    Args:
-        model (nn.Module):
-        inputs (tuple[args]): the model will be called by `model(*inputs)`
-
-    Returns:
-        an onnx model
-    """
-    assert isinstance(model, torch.nn.Module)
-
-    # make sure all modules are in eval mode, onnx may change the training state
-    # of the module if the states are not consistent
-    def _check_eval(module):
-        assert not module.training
-
-    model.apply(_check_eval)
-
-    # Export the model to ONNX
-    with torch.no_grad():
-        with io.BytesIO() as f:
-            torch.onnx.export(
-                model,
-                inputs,
-                f,
-                operator_export_type=OperatorExportTypes.ONNX_ATEN_FALLBACK,
-                # verbose=True,  # NOTE: uncomment this for debugging
-                # export_params=True,
-            )
-            onnx_model = onnx.load_from_string(f.getvalue())
-
-    # Apply ONNX's Optimization
-    all_passes = onnx.optimizer.get_available_passes()
-    passes = ["fuse_bn_into_conv"]
-    assert all(p in all_passes for p in passes)
-    onnx_model = onnx.optimizer.optimize(onnx_model, passes)
-    return onnx_model
-
-
-def _op_stats(net_def):
-    type_count = {}
-    for t in [op.type for op in net_def.op]:
-        type_count[t] = type_count.get(t, 0) + 1
-    type_count_list = sorted(type_count.items(), key=lambda kv: kv[0])  # alphabet
-    type_count_list = sorted(type_count_list, key=lambda kv: -kv[1])  # count
-    return "\n".join("{:>4}x {}".format(count, name) for name, count in type_count_list)
-
-
-def _assign_device_option(
-    predict_net: caffe2_pb2.NetDef, init_net: caffe2_pb2.NetDef, tensor_inputs: List[torch.Tensor]
-):
-    """
-    ONNX exported network doesn't have concept of device, assign necessary
-    device option for each op in order to make it runable on GPU runtime.
-    """
-
-    def _get_device_type(torch_tensor):
-        assert torch_tensor.device.type in ["cpu", "cuda"]
-        assert torch_tensor.device.index == 0
-        return torch_tensor.device.type
-
-    def _assign_op_device_option(net_proto, net_ssa, blob_device_types):
-        for op, ssa_i in zip(net_proto.op, net_ssa):
-            if op.type in ["CopyCPUToGPU", "CopyGPUToCPU"]:
-                op.device_option.CopyFrom(core.DeviceOption(caffe2_pb2.CUDA, 0))
-            else:
-                devices = [blob_device_types[b] for b in ssa_i[0] + ssa_i[1]]
-                assert all(d == devices[0] for d in devices)
-                if devices[0] == "cuda":
-                    op.device_option.CopyFrom(core.DeviceOption(caffe2_pb2.CUDA, 0))
-
-    # update ops in predict_net
-    predict_net_input_device_types = {
-        (name, 0): _get_device_type(tensor)
-        for name, tensor in zip(predict_net.external_input, tensor_inputs)
-    }
-    predict_net_device_types = infer_device_type(
-        predict_net, known_status=predict_net_input_device_types, device_name_style="pytorch"
-    )
-    predict_net_ssa, _ = core.get_ssa(predict_net)
-    _assign_op_device_option(predict_net, predict_net_ssa, predict_net_device_types)
-
-    # update ops in init_net
-    init_net_ssa, versions = core.get_ssa(init_net)
-    init_net_output_device_types = {
-        (name, versions[name]): predict_net_device_types[(name, 0)]
-        for name in init_net.external_output
-    }
-    init_net_device_types = infer_device_type(
-        init_net, known_status=init_net_output_device_types, device_name_style="pytorch"
-    )
-    _assign_op_device_option(init_net, init_net_ssa, init_net_device_types)
-
-
-def export_caffe2_detection_model(model: torch.nn.Module, tensor_inputs: List[torch.Tensor]):
-    """
-    Export a caffe2-compatible Detectron2 model to caffe2 format via ONNX.
-
-    Arg:
-        model: a caffe2-compatible version of detectron2 model, defined in caffe2_modeling.py
-        tensor_inputs: a list of tensors that caffe2 model takes as input.
-    """
-    model = copy.deepcopy(model)
-    assert isinstance(model, torch.nn.Module)
-    assert hasattr(model, "encode_additional_info")
-
-    # Export via ONNX
-    logger.info(
-        "Exporting a {} model via ONNX ...".format(type(model).__name__)
-        + " Some warnings from ONNX are expected and are usually not to worry about."
-    )
-    onnx_model = export_onnx_model(model, (tensor_inputs,))
-    # Convert ONNX model to Caffe2 protobuf
-    init_net, predict_net = Caffe2Backend.onnx_graph_to_caffe2_net(onnx_model)
-    ops_table = [[op.type, op.input, op.output] for op in predict_net.op]
-    table = tabulate(ops_table, headers=["type", "input", "output"], tablefmt="pipe")
-    logger.info(
-        "ONNX export Done. Exported predict_net (before optimizations):\n" + colored(table, "cyan")
-    )
-
-    # Apply protobuf optimization
-    fuse_alias_placeholder(predict_net, init_net)
-    if any(t.device.type != "cpu" for t in tensor_inputs):
-        fuse_copy_between_cpu_and_gpu(predict_net)
-        remove_dead_end_ops(init_net)
-        _assign_device_option(predict_net, init_net, tensor_inputs)
-    params, device_options = get_params_from_init_net(init_net)
-    predict_net, params = remove_reshape_for_fc(predict_net, params)
-    init_net = construct_init_net_from_params(params, device_options)
-    group_norm_replace_aten_with_caffe2(predict_net)
-
-    # Record necessary information for running the pb model in Detectron2 system.
-    model.encode_additional_info(predict_net, init_net)
-
-    logger.info("Operators used in predict_net: \n{}".format(_op_stats(predict_net)))
-    logger.info("Operators used in init_net: \n{}".format(_op_stats(init_net)))
-
-    return predict_net, init_net
-
-
-def run_and_save_graph(predict_net, init_net, tensor_inputs, graph_save_path):
-    """
-    Run the caffe2 model on given inputs, recording the shape and draw the graph.
-
-    predict_net/init_net: caffe2 model.
-    tensor_inputs: a list of tensors that caffe2 model takes as input.
-    graph_save_path: path for saving graph of exported model.
-    """
-
-    logger.info("Saving graph of ONNX exported model to {} ...".format(graph_save_path))
-    save_graph(predict_net, graph_save_path, op_only=False)
-
-    # Run the exported Caffe2 net
-    logger.info("Running ONNX exported model ...")
-    with ScopedWS("__ws_tmp__", True) as ws:
-        ws.RunNetOnce(init_net)
-        initialized_blobs = set(ws.Blobs())
-        uninitialized = [inp for inp in predict_net.external_input if inp not in initialized_blobs]
-        for name, blob in zip(uninitialized, tensor_inputs):
-            ws.FeedBlob(name, blob)
-
-        try:
-            ws.RunNetOnce(predict_net)
-        except RuntimeError as e:
-            logger.warning("Encountered RuntimeError: \n{}".format(str(e)))
-
-        ws_blobs = {b: ws.FetchBlob(b) for b in ws.Blobs()}
-        blob_sizes = {b: ws_blobs[b].shape for b in ws_blobs if isinstance(ws_blobs[b], np.ndarray)}
-
-        logger.info("Saving graph with blob shapes to {} ...".format(graph_save_path))
-        save_graph(predict_net, graph_save_path, op_only=False, blob_sizes=blob_sizes)
-
-        return ws_blobs
diff --git a/spaces/Yiqin/ChatVID/model/vision/grit_src/third_party/CenterNet2/detectron2/export/caffe2_patch.py b/spaces/Yiqin/ChatVID/model/vision/grit_src/third_party/CenterNet2/detectron2/export/caffe2_patch.py
deleted file mode 100644
index c9eee594a27cdec29ce5f2b6f7730171eda3805e..0000000000000000000000000000000000000000
--- a/spaces/Yiqin/ChatVID/model/vision/grit_src/third_party/CenterNet2/detectron2/export/caffe2_patch.py
+++ /dev/null
@@ -1,152 +0,0 @@
-# Copyright (c) Facebook, Inc. and its affiliates.
-
-import contextlib
-from unittest import mock
-import torch
-
-from detectron2.modeling import poolers
-from detectron2.modeling.proposal_generator import rpn
-from detectron2.modeling.roi_heads import keypoint_head, mask_head
-from detectron2.modeling.roi_heads.fast_rcnn import FastRCNNOutputLayers
-
-from .c10 import (
-    Caffe2Compatible,
-    Caffe2FastRCNNOutputsInference,
-    Caffe2KeypointRCNNInference,
-    Caffe2MaskRCNNInference,
-    Caffe2ROIPooler,
-    Caffe2RPN,
-)
-
-
-class GenericMixin(object):
-    pass
-
-
-class Caffe2CompatibleConverter(object):
-    """
-    A GenericUpdater which implements the `create_from` interface, by modifying
-    module object and assign it with another class replaceCls.
-    """
-
-    def __init__(self, replaceCls):
-        self.replaceCls = replaceCls
-
-    def create_from(self, module):
-        # update module's class to the new class
-        assert isinstance(module, torch.nn.Module)
-        if issubclass(self.replaceCls, GenericMixin):
-            # replaceCls should act as mixin, create a new class on-the-fly
-            new_class = type(
-                "{}MixedWith{}".format(self.replaceCls.__name__, module.__class__.__name__),
-                (self.replaceCls, module.__class__),
-                {},  # {"new_method": lambda self: ...},
-            )
-            module.__class__ = new_class
-        else:
-            # replaceCls is complete class, this allow arbitrary class swap
-            module.__class__ = self.replaceCls
-
-        # initialize Caffe2Compatible
-        if isinstance(module, Caffe2Compatible):
-            module.tensor_mode = False
-
-        return module
-
-
-def patch(model, target, updater, *args, **kwargs):
-    """
-    recursively (post-order) update all modules with the target type and its
-    subclasses, make a initialization/composition/inheritance/... via the
-    updater.create_from.
-    """
-    for name, module in model.named_children():
-        model._modules[name] = patch(module, target, updater, *args, **kwargs)
-    if isinstance(model, target):
-        return updater.create_from(model, *args, **kwargs)
-    return model
-
-
-def patch_generalized_rcnn(model):
-    ccc = Caffe2CompatibleConverter
-    model = patch(model, rpn.RPN, ccc(Caffe2RPN))
-    model = patch(model, poolers.ROIPooler, ccc(Caffe2ROIPooler))
-
-    return model
-
-
-@contextlib.contextmanager
-def mock_fastrcnn_outputs_inference(
-    tensor_mode, check=True, box_predictor_type=FastRCNNOutputLayers
-):
-    with mock.patch.object(
-        box_predictor_type,
-        "inference",
-        autospec=True,
-        side_effect=Caffe2FastRCNNOutputsInference(tensor_mode),
-    ) as mocked_func:
-        yield
-    if check:
-        assert mocked_func.call_count > 0
-
-
-@contextlib.contextmanager
-def mock_mask_rcnn_inference(tensor_mode, patched_module, check=True):
-    with mock.patch(
-        "{}.mask_rcnn_inference".format(patched_module), side_effect=Caffe2MaskRCNNInference()
-    ) as mocked_func:
-        yield
-    if check:
-        assert mocked_func.call_count > 0
-
-
-@contextlib.contextmanager
-def mock_keypoint_rcnn_inference(tensor_mode, patched_module, use_heatmap_max_keypoint, check=True):
-    with mock.patch(
-        "{}.keypoint_rcnn_inference".format(patched_module),
-        side_effect=Caffe2KeypointRCNNInference(use_heatmap_max_keypoint),
-    ) as mocked_func:
-        yield
-    if check:
-        assert mocked_func.call_count > 0
-
-
-class ROIHeadsPatcher:
-    def __init__(self, heads, use_heatmap_max_keypoint):
-        self.heads = heads
-        self.use_heatmap_max_keypoint = use_heatmap_max_keypoint
-
-    @contextlib.contextmanager
-    def mock_roi_heads(self, tensor_mode=True):
-        """
-        Patching several inference functions inside ROIHeads and its subclasses
-
-        Args:
-            tensor_mode (bool): whether the inputs/outputs are caffe2's tensor
-                format or not. Default to True.
-        """
-        # NOTE: this requries the `keypoint_rcnn_inference` and `mask_rcnn_inference`
-        # are called inside the same file as BaseXxxHead due to using mock.patch.
-        kpt_heads_mod = keypoint_head.BaseKeypointRCNNHead.__module__
-        mask_head_mod = mask_head.BaseMaskRCNNHead.__module__
-
-        mock_ctx_managers = [
-            mock_fastrcnn_outputs_inference(
-                tensor_mode=tensor_mode,
-                check=True,
-                box_predictor_type=type(self.heads.box_predictor),
-            )
-        ]
-        if getattr(self.heads, "keypoint_on", False):
-            mock_ctx_managers += [
-                mock_keypoint_rcnn_inference(
-                    tensor_mode, kpt_heads_mod, self.use_heatmap_max_keypoint
-                )
-            ]
-        if getattr(self.heads, "mask_on", False):
-            mock_ctx_managers += [mock_mask_rcnn_inference(tensor_mode, mask_head_mod)]
-
-        with contextlib.ExitStack() as stack:  # python 3.3+
-            for mgr in mock_ctx_managers:
-                stack.enter_context(mgr)
-            yield
diff --git a/spaces/Yunshansongbai/SVC-Nahida/hubert/hubert_model_onnx.py b/spaces/Yunshansongbai/SVC-Nahida/hubert/hubert_model_onnx.py
deleted file mode 100644
index 86864321a3b8c5e9fc0f688285f1cc72844a63ee..0000000000000000000000000000000000000000
--- a/spaces/Yunshansongbai/SVC-Nahida/hubert/hubert_model_onnx.py
+++ /dev/null
@@ -1,217 +0,0 @@
-import copy
-import random
-from typing import Optional, Tuple
-
-import torch
-import torch.nn as nn
-import torch.nn.functional as t_func
-from torch.nn.modules.utils import consume_prefix_in_state_dict_if_present
-
-
-class Hubert(nn.Layer):
-    def __init__(self, num_label_embeddings: int = 100, mask: bool = True):
-        super().__init__()
-        self._mask = mask
-        self.feature_extractor = FeatureExtractor()
-        self.feature_projection = FeatureProjection()
-        self.positional_embedding = PositionalConvEmbedding()
-        self.norm = nn.LayerNorm(768)
-        self.dropout = nn.Dropout(0.1)
-        self.encoder = TransformerEncoder(
-            nn.TransformerEncoderLayer(
-                768, 12, 3072, activation="gelu", batch_first=True
-            ),
-            12,
-        )
-        self.proj = nn.Linear(768, 256)
-
-        self.masked_spec_embed = nn.Parameter(torch.FloatTensor(768).uniform_())
-        self.label_embedding = nn.Embedding(num_label_embeddings, 256)
-
-    def mask(self, x: torch.Tensor) -> Tuple[torch.Tensor, torch.Tensor]:
-        mask = None
-        if self.training and self._mask:
-            mask = _compute_mask((x.size(0), x.size(1)), 0.8, 10, x.device, 2)
-            x[mask] = self.masked_spec_embed.to(x.dtype)
-        return x, mask
-
-    def encode(
-            self, x: torch.Tensor, layer: Optional[int] = None
-    ) -> Tuple[torch.Tensor, torch.Tensor]:
-        x = self.feature_extractor(x)
-        x = self.feature_projection(x.transpose(1, 2))
-        x, mask = self.mask(x)
-        x = x + self.positional_embedding(x)
-        x = self.dropout(self.norm(x))
-        x = self.encoder(x, output_layer=layer)
-        return x, mask
-
-    def logits(self, x: torch.Tensor) -> torch.Tensor:
-        logits = torch.cosine_similarity(
-            x.unsqueeze(2),
-            self.label_embedding.weight.unsqueeze(0).unsqueeze(0),
-            dim=-1,
-        )
-        return logits / 0.1
-
-
-class HubertSoft(Hubert):
-    def __init__(self):
-        super().__init__()
-
-    def units(self, wav: torch.Tensor) -> torch.Tensor:
-        wav = t_func.pad(wav, ((400 - 320) // 2, (400 - 320) // 2))
-        x, _ = self.encode(wav)
-        return self.proj(x)
-
-    def forward(self, x):
-        return self.units(x)
-
-class FeatureExtractor(nn.Layer):
-    def __init__(self):
-        super().__init__()
-        self.conv0 = nn.Conv1d(1, 512, 10, 5, bias=False)
-        self.norm0 = nn.GroupNorm(512, 512)
-        self.conv1 = nn.Conv1d(512, 512, 3, 2, bias=False)
-        self.conv2 = nn.Conv1d(512, 512, 3, 2, bias=False)
-        self.conv3 = nn.Conv1d(512, 512, 3, 2, bias=False)
-        self.conv4 = nn.Conv1d(512, 512, 3, 2, bias=False)
-        self.conv5 = nn.Conv1d(512, 512, 2, 2, bias=False)
-        self.conv6 = nn.Conv1d(512, 512, 2, 2, bias=False)
-
-    def forward(self, x: torch.Tensor) -> torch.Tensor:
-        x = t_func.gelu(self.norm0(self.conv0(x)))
-        x = t_func.gelu(self.conv1(x))
-        x = t_func.gelu(self.conv2(x))
-        x = t_func.gelu(self.conv3(x))
-        x = t_func.gelu(self.conv4(x))
-        x = t_func.gelu(self.conv5(x))
-        x = t_func.gelu(self.conv6(x))
-        return x
-
-
-class FeatureProjection(nn.Layer):
-    def __init__(self):
-        super().__init__()
-        self.norm = nn.LayerNorm(512)
-        self.projection = nn.Linear(512, 768)
-        self.dropout = nn.Dropout(0.1)
-
-    def forward(self, x: torch.Tensor) -> torch.Tensor:
-        x = self.norm(x)
-        x = self.projection(x)
-        x = self.dropout(x)
-        return x
-
-
-class PositionalConvEmbedding(nn.Layer):
-    def __init__(self):
-        super().__init__()
-        self.conv = nn.Conv1d(
-            768,
-            768,
-            kernel_size=128,
-            padding=128 // 2,
-            groups=16,
-        )
-        self.conv = nn.utils.weight_norm(self.conv, name="weight", dim=2)
-
-    def forward(self, x: torch.Tensor) -> torch.Tensor:
-        x = self.conv(x.transpose(1, 2))
-        x = t_func.gelu(x[:, :, :-1])
-        return x.transpose(1, 2)
-
-
-class TransformerEncoder(nn.Layer):
-    def __init__(
-            self, encoder_layer: nn.TransformerEncoderLayer, num_layers: int
-    ) -> None:
-        super(TransformerEncoder, self).__init__()
-        self.layers = nn.LayerList(
-            [copy.deepcopy(encoder_layer) for _ in range(num_layers)]
-        )
-        self.num_layers = num_layers
-
-    def forward(
-            self,
-            src: torch.Tensor,
-            mask: torch.Tensor = None,
-            src_key_padding_mask: torch.Tensor = None,
-            output_layer: Optional[int] = None,
-    ) -> torch.Tensor:
-        output = src
-        for layer in self.layers[:output_layer]:
-            output = layer(
-                output, src_mask=mask, src_key_padding_mask=src_key_padding_mask
-            )
-        return output
-
-
-def _compute_mask(
-        shape: Tuple[int, int],
-        mask_prob: float,
-        mask_length: int,
-        device: torch.device,
-        min_masks: int = 0,
-) -> torch.Tensor:
-    batch_size, sequence_length = shape
-
-    if mask_length < 1:
-        raise ValueError("`mask_length` has to be bigger than 0.")
-
-    if mask_length > sequence_length:
-        raise ValueError(
-            f"`mask_length` has to be smaller than `sequence_length`, but got `mask_length`: {mask_length} and `sequence_length`: {sequence_length}`"
-        )
-
-    # compute number of masked spans in batch
-    num_masked_spans = int(mask_prob * sequence_length / mask_length + random.random())
-    num_masked_spans = max(num_masked_spans, min_masks)
-
-    # make sure num masked indices <= sequence_length
-    if num_masked_spans * mask_length > sequence_length:
-        num_masked_spans = sequence_length // mask_length
-
-    # SpecAugment mask to fill
-    mask = torch.zeros((batch_size, sequence_length), device=device, dtype=torch.bool)
-
-    # uniform distribution to sample from, make sure that offset samples are < sequence_length
-    uniform_dist = torch.ones(
-        (batch_size, sequence_length - (mask_length - 1)), device=device
-    )
-
-    # get random indices to mask
-    mask_indices = torch.multinomial(uniform_dist, num_masked_spans)
-
-    # expand masked indices to masked spans
-    mask_indices = (
-        mask_indices.unsqueeze(dim=-1)
-        .expand((batch_size, num_masked_spans, mask_length))
-        .reshape(batch_size, num_masked_spans * mask_length)
-    )
-    offsets = (
-        torch.arange(mask_length, device=device)[None, None, :]
-        .expand((batch_size, num_masked_spans, mask_length))
-        .reshape(batch_size, num_masked_spans * mask_length)
-    )
-    mask_idxs = mask_indices + offsets
-
-    # scatter indices to mask
-    mask = mask.scatter(1, mask_idxs, True)
-
-    return mask
-
-
-def hubert_soft(
-        path: str,
-) -> HubertSoft:
-    r"""HuBERT-Soft from `"A Comparison of Discrete and Soft Speech Units for Improved Voice Conversion"`.
-    Args:
-        path (str): path of a pretrained model
-    """
-    hubert = HubertSoft()
-    checkpoint = torch.load(path)
-    consume_prefix_in_state_dict_if_present(checkpoint, "module.")
-    hubert.load_state_dict(checkpoint)
-    hubert.eval()
-    return hubert
diff --git a/spaces/Zhenhong/text-to-speech-SpeechT5-demo/app.py b/spaces/Zhenhong/text-to-speech-SpeechT5-demo/app.py
deleted file mode 100644
index 06abd199599b975b8dbb006753a1983c0d352b2c..0000000000000000000000000000000000000000
--- a/spaces/Zhenhong/text-to-speech-SpeechT5-demo/app.py
+++ /dev/null
@@ -1,125 +0,0 @@
-import gradio as gr
-import librosa
-import numpy as np
-import torch
-
-from transformers import SpeechT5Processor, SpeechT5ForTextToSpeech, SpeechT5HifiGan
-
-
-checkpoint = "microsoft/speecht5_tts"
-processor = SpeechT5Processor.from_pretrained(checkpoint)
-model = SpeechT5ForTextToSpeech.from_pretrained(checkpoint)
-vocoder = SpeechT5HifiGan.from_pretrained("microsoft/speecht5_hifigan")
-
-
-speaker_embeddings = {
-    "BDL": "speaker/cmu_us_bdl_arctic-wav-arctic_a0009.npy",
-    "CLB": "speaker/cmu_us_clb_arctic-wav-arctic_a0144.npy",
-    "KSP": "speaker/cmu_us_ksp_arctic-wav-arctic_b0087.npy",
-    "RMS": "speaker/cmu_us_rms_arctic-wav-arctic_b0353.npy",
-    "SLT": "speaker/cmu_us_slt_arctic-wav-arctic_a0508.npy",
-}
-
-
-def predict(text, speaker):
-    if len(text.strip()) == 0:
-        return (16000, np.zeros(0).astype(np.int16))
-
-    inputs = processor(text=text, return_tensors="pt")
-
-    # limit input length
-    input_ids = inputs["input_ids"]
-    input_ids = input_ids[..., :model.config.max_text_positions]
-
-    if speaker == "Surprise Me!":
-        # load one of the provided speaker embeddings at random
-        idx = np.random.randint(len(speaker_embeddings))
-        key = list(speaker_embeddings.keys())[idx]
-        speaker_embedding = np.load(speaker_embeddings[key])
-
-        # randomly shuffle the elements
-        np.random.shuffle(speaker_embedding)
-
-        # randomly flip half the values
-        x = (np.random.rand(512) >= 0.5) * 1.0
-        x[x == 0] = -1.0
-        speaker_embedding *= x
-
-        #speaker_embedding = np.random.rand(512).astype(np.float32) * 0.3 - 0.15
-    else:
-        speaker_embedding = np.load(speaker_embeddings[speaker[:3]])
-
-    speaker_embedding = torch.tensor(speaker_embedding).unsqueeze(0)
-
-    speech = model.generate_speech(input_ids, speaker_embedding, vocoder=vocoder)
-
-    speech = (speech.numpy() * 32767).astype(np.int16)
-    return (16000, speech)
-
-
-title = "Text-to-Speech based on SpeechT5"
-
-description = """
-The <b>SpeechT5</b> model is pre-trained on text as well as speech inputs, with targets that are also a mix of text and speech.
-By pre-training on text and speech at the same time, it learns unified representations for both, resulting in improved modeling capabilities.
-
-This space demonstrates the <b>text-to-speech</b> (TTS) checkpoint for the English language.
-
-<b>How to use:</b> Enter some English text and choose a speaker. The output is a mel spectrogram, which is converted to a mono 16 kHz waveform by the HiFi-GAN vocoder. Because the model always applies random dropout, each attempt will give slightly different results.
-The <em>Surprise Me!</em> option creates a completely randomized speaker.
-"""
-
-article = """
-<div style='margin:20px auto;'>
-
-<p>References: <a href="https://arxiv.org/abs/2110.07205">SpeechT5 paper</a> |
-<a href="https://github.com/microsoft/SpeechT5/">original GitHub</a> |
-<a href="https://huggingface.co/mechanicalsea/speecht5-tts">original weights</a></p>
-
-<pre>
-@article{Ao2021SpeechT5,
-  title   = {SpeechT5: Unified-Modal Encoder-Decoder Pre-training for Spoken Language Processing},
-  author  = {Junyi Ao and Rui Wang and Long Zhou and Chengyi Wang and Shuo Ren and Yu Wu and Shujie Liu and Tom Ko and Qing Li and Yu Zhang and Zhihua Wei and Yao Qian and Jinyu Li and Furu Wei},
-  eprint={2110.07205},
-  archivePrefix={arXiv},
-  primaryClass={eess.AS},
-  year={2021}
-}
-</pre>
-
-<p>Speaker embeddings were generated from <a href="http://www.festvox.org/cmu_arctic/">CMU ARCTIC</a> using <a href="https://huggingface.co/mechanicalsea/speecht5-vc/blob/main/manifest/utils/prep_cmu_arctic_spkemb.py">this script</a>.</p>
-
-</div>
-"""
-
-examples = [
-    ["As a Data Scientist, I'll be demonstrating my speaking voice in this example. If you don't like my voice, you can choose a different one by setting the speaker parameter.", "BDL (male)"],
-    ["The octopus and Oliver went to the opera in October.", "CLB (female)"],
-    ["She sells seashells by the seashore. I saw a kitten eating chicken in the kitchen.", "RMS (male)"],
-    ["Brisk brave brigadiers brandished broad bright blades, blunderbusses, and bludgeons—balancing them badly.", "SLT (female)"],
-    ["A synonym for cinnamon is a cinnamon synonym.", "BDL (male)"],
-    ["How much wood would a woodchuck chuck if a woodchuck could chuck wood? He would chuck, he would, as much as he could, and chuck as much wood as a woodchuck would if a woodchuck could chuck wood.", "CLB (female)"],
-]
-
-gr.Interface(
-    fn=predict,
-    inputs=[
-        gr.Text(label="Input Text"),
-        gr.Radio(label="Speaker", choices=[
-            "BDL (male)",
-            "CLB (female)",
-            "KSP (male)",
-            "RMS (male)",
-            "SLT (female)",
-            "Surprise Me!"
-        ],
-        value="BDL (male)"),
-    ],
-    outputs=[
-        gr.Audio(label="Generated Speech", type="numpy"),
-    ],
-    title=title,
-    description=description,
-    article=article,
-    examples=examples,
-).launch()
diff --git a/spaces/aabyzov/playground/README.md b/spaces/aabyzov/playground/README.md
deleted file mode 100644
index 2b6ba62aa7493718ece0de747bcecc800bd4d450..0000000000000000000000000000000000000000
--- a/spaces/aabyzov/playground/README.md
+++ /dev/null
@@ -1,13 +0,0 @@
----
-title: Playground
-emoji: 🌖
-colorFrom: purple
-colorTo: pink
-sdk: streamlit
-sdk_version: 1.26.0
-app_file: app.py
-pinned: false
-license: openrail
----
-
-Check out the configuration reference at https://huggingface.co/docs/hub/spaces-config-reference
diff --git a/spaces/abdvl/datahub_qa_bot/app.py b/spaces/abdvl/datahub_qa_bot/app.py
deleted file mode 100644
index 9e612099200a95735a8a419c7281d20cea6d496d..0000000000000000000000000000000000000000
--- a/spaces/abdvl/datahub_qa_bot/app.py
+++ /dev/null
@@ -1,64 +0,0 @@
-import os
-import streamlit as st
-from langchain.chains import RetrievalQA
-from langchain.llms import OpenAI
-from langchain.document_loaders import DirectoryLoader
-from langchain.text_splitter import CharacterTextSplitter
-from langchain.indexes import VectorstoreIndexCreator
-from langchain.embeddings import OpenAIEmbeddings
-from langchain.vectorstores import Chroma
-from langchain.callbacks import get_openai_callback
-
-
-# variables
-db_folder = "db"
-qa = None
-db = None
-
-# init LLM and retriever
-def init(api_key):
-    # API key
-    os.environ["OPENAI_API_KEY"] = api_key
-
-    # initialize the language model
-    llm = OpenAI(model_name="gpt-3.5-turbo")
-
-    with get_openai_callback() as cb:
-        # create the embeddings and index
-        embeddings = OpenAIEmbeddings()
-        # Init vectorstore
-        db = Chroma(persist_directory=db_folder, embedding_function=embeddings)
-        # create retriever from the DB
-        retriever = db.as_retriever(search_type="mmr")
-        # initialize the chain
-        qa = RetrievalQA.from_chain_type(
-            llm=llm, chain_type="stuff", retriever=retriever)
-        return qa, db
-
-
-# UI
-st.title('DataHub QA Chat Demo')
-
-# set your OpenAI API key
-api_key = st.text_input('OPENAI API KEY')
-
-# query input box
-question = st.text_input('Ask a question', 'What is DataHub')
-
-# query button
-if st.button('Query'):
-    if api_key == "":
-        st.write("Please provide your OpenAI API KEY, the query is cheap ($0.0001 per query))")
-    else:
-        qa, db = init(api_key)
-        # 
-        st.subheader('Result from OpenAI after querying the vectorstore')
-        st.write(qa.run(question))
-        # 
-        st.subheader('Raw result from vectorstore')
-        docs = db.similarity_search(question)
-        result = docs[0]
-        st.write(result.page_content)
-        st.subheader('Source')
-        st.write(result.metadata)
-        
\ No newline at end of file
diff --git a/spaces/abdvl/datahub_qa_bot/docs/advanced/browse-paths-upgrade.md b/spaces/abdvl/datahub_qa_bot/docs/advanced/browse-paths-upgrade.md
deleted file mode 100644
index e440a35c3af462f0a5f88c71204fec16a9af6a3a..0000000000000000000000000000000000000000
--- a/spaces/abdvl/datahub_qa_bot/docs/advanced/browse-paths-upgrade.md
+++ /dev/null
@@ -1,137 +0,0 @@
-# Browse Paths Upgrade (August 2022)
-
-## Background
-
-Up to this point, there's been a historical constraint on all entity browse paths. Namely, each browse path has been
-required to end with a path component that represents "simple name" for an entity. For example, a Browse Path for a 
-Snowflake Table called "test_table" may look something like this:
-
-```
-/prod/snowflake/warehouse1/db1/test_table
-```
-
-In the UI, we artificially truncate the final path component when you are browsing the Entity hierarchy, so your browse experience 
-would be: 
-
-`prod` > `snowflake` > `warehouse1`> `db1` > `Click Entity`
-
-As you can see, the final path component `test_table` is effectively ignored. It could have any value, and we would still ignore
-it in the UI. This behavior serves as a workaround to the historical requirement that all browse paths end with a simple name. 
-
-This data constraint stands in opposition the original intention of Browse Paths: to provide a simple mechanism for organizing
-assets into a hierarchical folder structure. For this reason, we've changed the semantics of Browse Paths to better align with the original intention. 
-Going forward, you will not be required to provide a final component detailing the "name". Instead, you will be able to provide a simpler path that
-omits this final component:
-
-```
-/prod/snowflake/warehouse1/db1
-```
-
-and the browse experience from the UI will continue to work as you would expect: 
-
-`prod` > `snowflake` > `warehouse1`> `db1` > `Click Entity`. 
-
-With this change comes a fix to a longstanding bug where multiple browse paths could not be attached to a single URN. Going forward,
-we will support producing multiple browse paths for the same entity, and allow you to traverse via multiple paths. For example
-
-```python
-browse_path = BrowsePathsClass(
-    paths=["/powerbi/my/custom/path", "/my/other/custom/path"]
-)
-return MetadataChangeProposalWrapper(
-    entityType="dataset",
-    changeType="UPSERT",
-    entityUrn="urn:li:dataset:(urn:li:dataPlatform:custom,MyFileName,PROD),
-    aspectName="browsePaths",
-    aspect=browse_path,
-)
-```
-*Using the Python Emitter SDK to produce multiple Browse Paths for the same entity*
-
-We've received multiple bug reports, such as [this issue](https://github.com/datahub-project/datahub/issues/5525), and requests to address these issues with Browse, and thus are deciding
-to do it now before more workarounds are created.  
-
-## What this means for you
-
-Once you upgrade to DataHub `v0.8.45` you will immediately notice that traversing your Browse Path hierarchy will require
-one extra click to find the entity. This is because we are correctly displaying the FULL browse path, including the simple name mentioned above.
-
-There will be 2 ways to upgrade to the new browse path format. Depending on your ingestion sources, you may want to use one or both:
-
-1. Migrate default browse paths to the new format by restarting DataHub
-2. Upgrade your version of the `datahub` CLI to push new browse path format (version `v0.8.45`)
-
-Each step will be discussed in detail below. 
-
-### 1. Migrating default browse paths to the new format
-
-To migrate those Browse Paths that are generated by DataHub by default (when no path is provided), simply restart the `datahub-gms` container / pod with a single
-additional environment variable:
-
-```
-UPGRADE_DEFAULT_BROWSE_PATHS_ENABLED=true
-```
-
-And restart the `datahub-gms` instance. This will cause GMS to perform a boot-time migration of all your existing Browse Paths
-to the new format, removing the unnecessarily name component at the very end.
-
-If the migration is successful, you'll see the following in your GMS logs: 
-
-```
-18:58:17.414 [main] INFO c.l.m.b.s.UpgradeDefaultBrowsePathsStep:60 - Successfully upgraded all browse paths!
-```
-
-After this one-time migration is complete, you should be able to navigate the Browse hierarchy exactly as you did previously. 
-
-> Note that certain ingestion sources actively produce their own Browse Paths, which overrides the default path
-> computed by DataHub. 
-> 
-> In these cases, getting the updated Browse Path will require re-running your ingestion process with the updated
-> version of the connector. This is discussed in more detail in the next section. 
-
-### 2. Upgrading the `datahub` CLI to push new browse paths 
-
-If you are actively ingesting metadata from one or more of following sources
-
-1. Sagemaker
-2. Looker / LookML
-3. Feast
-4. Kafka
-5. Mode
-6. PowerBi
-7. Pulsar
-8. Tableau
-9. Business Glossary
-
-You will need to upgrade the DataHub CLI to >= `v0.8.45` and re-run metadata ingestion. This will generate the new browse path format
-and overwrite the existing paths for entities that were extracted from these sources. 
-
-### If you are producing custom Browse Paths
-
-If you've decided to produce your own custom Browse Paths to organize your assets (e.g. via the Python Emitter SDK), you'll want to change the code to produce those paths
-to truncate the final path component. For example, if you were previously emitting a browse path like this:
-
-```
-"my/custom/browse/path/suffix"
-```
-
-You can simply remove the final "suffix" piece:
-
-```
-"my/custom/browse/path"
-```
-
-Your users will be able to find the entity by traversing through these folders in the UI:
-
-`my` > `custom` > `browse`> `path` > `Click Entity`.
-
-
-> Note that if you are using the Browse Path Transformer you *will* be impacted in the same way. It is recommended that you revisit the
-> paths that you are producing, and update them to the new format. 
-
-## Support
-
-The Acryl team will be on standby to assist you in your migration. Please
-join [#release-0_8_0](https://datahubspace.slack.com/archives/C0244FHMHJQ) channel and reach out to us if you find
-trouble with the upgrade or have feedback on the process. We will work closely to make sure you can continue to operate
-DataHub smoothly.
diff --git a/spaces/abhishek/sketch-to-image/annotator/uniformer/mmseg/models/decode_heads/nl_head.py b/spaces/abhishek/sketch-to-image/annotator/uniformer/mmseg/models/decode_heads/nl_head.py
deleted file mode 100644
index 3eee424199e6aa363b564e2a3340a070db04db86..0000000000000000000000000000000000000000
--- a/spaces/abhishek/sketch-to-image/annotator/uniformer/mmseg/models/decode_heads/nl_head.py
+++ /dev/null
@@ -1,49 +0,0 @@
-import torch
-from annotator.uniformer.mmcv.cnn import NonLocal2d
-
-from ..builder import HEADS
-from .fcn_head import FCNHead
-
-
-@HEADS.register_module()
-class NLHead(FCNHead):
-    """Non-local Neural Networks.
-
-    This head is the implementation of `NLNet
-    <https://arxiv.org/abs/1711.07971>`_.
-
-    Args:
-        reduction (int): Reduction factor of projection transform. Default: 2.
-        use_scale (bool): Whether to scale pairwise_weight by
-            sqrt(1/inter_channels). Default: True.
-        mode (str): The nonlocal mode. Options are 'embedded_gaussian',
-            'dot_product'. Default: 'embedded_gaussian.'.
-    """
-
-    def __init__(self,
-                 reduction=2,
-                 use_scale=True,
-                 mode='embedded_gaussian',
-                 **kwargs):
-        super(NLHead, self).__init__(num_convs=2, **kwargs)
-        self.reduction = reduction
-        self.use_scale = use_scale
-        self.mode = mode
-        self.nl_block = NonLocal2d(
-            in_channels=self.channels,
-            reduction=self.reduction,
-            use_scale=self.use_scale,
-            conv_cfg=self.conv_cfg,
-            norm_cfg=self.norm_cfg,
-            mode=self.mode)
-
-    def forward(self, inputs):
-        """Forward function."""
-        x = self._transform_inputs(inputs)
-        output = self.convs[0](x)
-        output = self.nl_block(output)
-        output = self.convs[1](output)
-        if self.concat_input:
-            output = self.conv_cat(torch.cat([x, output], dim=1))
-        output = self.cls_seg(output)
-        return output
diff --git a/spaces/abhishek/sketch-to-image/annotator/uniformer_base/mmcv/arraymisc/__init__.py b/spaces/abhishek/sketch-to-image/annotator/uniformer_base/mmcv/arraymisc/__init__.py
deleted file mode 100644
index 4b4700d6139ae3d604ff6e542468cce4200c020c..0000000000000000000000000000000000000000
--- a/spaces/abhishek/sketch-to-image/annotator/uniformer_base/mmcv/arraymisc/__init__.py
+++ /dev/null
@@ -1,4 +0,0 @@
-# Copyright (c) OpenMMLab. All rights reserved.
-from .quantization import dequantize, quantize
-
-__all__ = ['quantize', 'dequantize']
diff --git a/spaces/abrar-lohia/text-2-character-anim/pyrender/pyrender/platforms/osmesa.py b/spaces/abrar-lohia/text-2-character-anim/pyrender/pyrender/platforms/osmesa.py
deleted file mode 100644
index deaa5ff44031a107883913ae9a18fc425d650f3d..0000000000000000000000000000000000000000
--- a/spaces/abrar-lohia/text-2-character-anim/pyrender/pyrender/platforms/osmesa.py
+++ /dev/null
@@ -1,59 +0,0 @@
-from .base import Platform
-
-
-__all__ = ['OSMesaPlatform']
-
-
-class OSMesaPlatform(Platform):
-    """Renders into a software buffer using OSMesa. Requires special versions
-    of OSMesa to be installed, plus PyOpenGL upgrade.
-    """
-
-    def __init__(self, viewport_width, viewport_height):
-        super(OSMesaPlatform, self).__init__(viewport_width, viewport_height)
-        self._context = None
-        self._buffer = None
-
-    def init_context(self):
-        from OpenGL import arrays
-        from OpenGL.osmesa import (
-            OSMesaCreateContextAttribs, OSMESA_FORMAT,
-            OSMESA_RGBA, OSMESA_PROFILE, OSMESA_CORE_PROFILE,
-            OSMESA_CONTEXT_MAJOR_VERSION, OSMESA_CONTEXT_MINOR_VERSION,
-            OSMESA_DEPTH_BITS
-        )
-
-        attrs = arrays.GLintArray.asArray([
-            OSMESA_FORMAT, OSMESA_RGBA,
-            OSMESA_DEPTH_BITS, 24,
-            OSMESA_PROFILE, OSMESA_CORE_PROFILE,
-            OSMESA_CONTEXT_MAJOR_VERSION, 3,
-            OSMESA_CONTEXT_MINOR_VERSION, 3,
-            0
-        ])
-        self._context = OSMesaCreateContextAttribs(attrs, None)
-        self._buffer = arrays.GLubyteArray.zeros(
-            (self.viewport_height, self.viewport_width, 4)
-        )
-
-    def make_current(self):
-        from OpenGL import GL as gl
-        from OpenGL.osmesa import OSMesaMakeCurrent
-        assert(OSMesaMakeCurrent(
-            self._context, self._buffer, gl.GL_UNSIGNED_BYTE,
-            self.viewport_width, self.viewport_height
-        ))
-
-    def make_uncurrent(self):
-        """Make the OpenGL context uncurrent.
-        """
-        pass
-
-    def delete_context(self):
-        from OpenGL.osmesa import OSMesaDestroyContext
-        OSMesaDestroyContext(self._context)
-        self._context = None
-        self._buffer = None
-
-    def supports_framebuffers(self):
-        return False
diff --git a/spaces/adorp/ControlNet-v1-1-duplicate/app_mlsd.py b/spaces/adorp/ControlNet-v1-1-duplicate/app_mlsd.py
deleted file mode 100644
index 073b0da202362716c6af5da7cb929981c78f7f20..0000000000000000000000000000000000000000
--- a/spaces/adorp/ControlNet-v1-1-duplicate/app_mlsd.py
+++ /dev/null
@@ -1,115 +0,0 @@
-#!/usr/bin/env python
-
-import gradio as gr
-
-from utils import randomize_seed_fn
-
-
-def create_demo(process, max_images=12, default_num_images=3):
-    with gr.Blocks() as demo:
-        with gr.Row():
-            with gr.Column():
-                image = gr.Image()
-                prompt = gr.Textbox(label='Prompt')
-                run_button = gr.Button('Run')
-                with gr.Accordion('Advanced options', open=False):
-                    num_samples = gr.Slider(label='Number of images',
-                                            minimum=1,
-                                            maximum=max_images,
-                                            value=default_num_images,
-                                            step=1)
-                    image_resolution = gr.Slider(label='Image resolution',
-                                                 minimum=256,
-                                                 maximum=512,
-                                                 value=512,
-                                                 step=256)
-                    preprocess_resolution = gr.Slider(
-                        label='Preprocess resolution',
-                        minimum=128,
-                        maximum=512,
-                        value=512,
-                        step=1)
-                    mlsd_value_threshold = gr.Slider(
-                        label='Hough value threshold (MLSD)',
-                        minimum=0.01,
-                        maximum=2.0,
-                        value=0.1,
-                        step=0.01)
-                    mlsd_distance_threshold = gr.Slider(
-                        label='Hough distance threshold (MLSD)',
-                        minimum=0.01,
-                        maximum=20.0,
-                        value=0.1,
-                        step=0.01)
-                    num_steps = gr.Slider(label='Number of steps',
-                                          minimum=1,
-                                          maximum=100,
-                                          value=20,
-                                          step=1)
-                    guidance_scale = gr.Slider(label='Guidance scale',
-                                               minimum=0.1,
-                                               maximum=30.0,
-                                               value=9.0,
-                                               step=0.1)
-                    seed = gr.Slider(label='Seed',
-                                     minimum=0,
-                                     maximum=1000000,
-                                     step=1,
-                                     value=0,
-                                     randomize=True)
-                    randomize_seed = gr.Checkbox(label='Randomize seed',
-                                                 value=True)
-                    a_prompt = gr.Textbox(
-                        label='Additional prompt',
-                        value='best quality, extremely detailed')
-                    n_prompt = gr.Textbox(
-                        label='Negative prompt',
-                        value=
-                        'longbody, lowres, bad anatomy, bad hands, missing fingers, extra digit, fewer digits, cropped, worst quality, low quality'
-                    )
-            with gr.Column():
-                result = gr.Gallery(label='Output', show_label=False).style(
-                    columns=2, object_fit='scale-down')
-        inputs = [
-            image,
-            prompt,
-            a_prompt,
-            n_prompt,
-            num_samples,
-            image_resolution,
-            preprocess_resolution,
-            num_steps,
-            guidance_scale,
-            seed,
-            mlsd_value_threshold,
-            mlsd_distance_threshold,
-        ]
-        prompt.submit(
-            fn=randomize_seed_fn,
-            inputs=[seed, randomize_seed],
-            outputs=seed,
-            queue=False,
-        ).then(
-            fn=process,
-            inputs=inputs,
-            outputs=result,
-        )
-        run_button.click(
-            fn=randomize_seed_fn,
-            inputs=[seed, randomize_seed],
-            outputs=seed,
-            queue=False,
-        ).then(
-            fn=process,
-            inputs=inputs,
-            outputs=result,
-            api_name='mlsd',
-        )
-    return demo
-
-
-if __name__ == '__main__':
-    from model import Model
-    model = Model(task_name='MLSD')
-    demo = create_demo(model.process_mlsd)
-    demo.queue().launch()
diff --git a/spaces/akhaliq/JoJoGAN/e4e/criteria/id_loss.py b/spaces/akhaliq/JoJoGAN/e4e/criteria/id_loss.py
deleted file mode 100644
index bab806172eff18c0630536ae96817508c3197b8b..0000000000000000000000000000000000000000
--- a/spaces/akhaliq/JoJoGAN/e4e/criteria/id_loss.py
+++ /dev/null
@@ -1,47 +0,0 @@
-import torch
-from torch import nn
-from configs.paths_config import model_paths
-from models.encoders.model_irse import Backbone
-
-
-class IDLoss(nn.Module):
-    def __init__(self):
-        super(IDLoss, self).__init__()
-        print('Loading ResNet ArcFace')
-        self.facenet = Backbone(input_size=112, num_layers=50, drop_ratio=0.6, mode='ir_se')
-        self.facenet.load_state_dict(torch.load(model_paths['ir_se50']))
-        self.face_pool = torch.nn.AdaptiveAvgPool2d((112, 112))
-        self.facenet.eval()
-        for module in [self.facenet, self.face_pool]:
-            for param in module.parameters():
-                param.requires_grad = False
-
-    def extract_feats(self, x):
-        x = x[:, :, 35:223, 32:220]  # Crop interesting region
-        x = self.face_pool(x)
-        x_feats = self.facenet(x)
-        return x_feats
-
-    def forward(self, y_hat, y, x):
-        n_samples = x.shape[0]
-        x_feats = self.extract_feats(x)
-        y_feats = self.extract_feats(y)  # Otherwise use the feature from there
-        y_hat_feats = self.extract_feats(y_hat)
-        y_feats = y_feats.detach()
-        loss = 0
-        sim_improvement = 0
-        id_logs = []
-        count = 0
-        for i in range(n_samples):
-            diff_target = y_hat_feats[i].dot(y_feats[i])
-            diff_input = y_hat_feats[i].dot(x_feats[i])
-            diff_views = y_feats[i].dot(x_feats[i])
-            id_logs.append({'diff_target': float(diff_target),
-                            'diff_input': float(diff_input),
-                            'diff_views': float(diff_views)})
-            loss += 1 - diff_target
-            id_diff = float(diff_target) - float(diff_views)
-            sim_improvement += id_diff
-            count += 1
-
-        return loss / count, sim_improvement / count, id_logs
diff --git a/spaces/akhaliq/T0pp/app.py b/spaces/akhaliq/T0pp/app.py
deleted file mode 100644
index 79cf4a8ca8020487a034253c2736ae102249355e..0000000000000000000000000000000000000000
--- a/spaces/akhaliq/T0pp/app.py
+++ /dev/null
@@ -1,8 +0,0 @@
-import gradio as gr
-title = "T0pp"
-description = "Gradio Demo for T0pp, T0* is a series of encoder-decoder models trained on a large set of different tasks specified in natural language prompts. Can use the models to perform inference on tasks by specifying your query in natural language, and the models will generate a prediction. Read more at the links below."
-article = "<p style='text-align: center'><a href='https://huggingface.co/bigscience/T0pp' target='_blank'>Hugging face model page</a> | <a href='https://github.com/bigscience-workshop/promptsource' target='_blank'>Github Repo</a> | <a href='https://arxiv.org/abs/2110.08207' target='_blank'>Multitask Prompted Training Enables Zero-Shot Task Generalization</a></p>"
-examples = [
-    ['Is this review positive or negative? Review: this is the best cast iron skillet you will ever buy'],["It's rainy today but it will stop in a few hours, when should I go for my run?"],["How many hydrogen atoms are in a water molecule?"]
-]
-gr.Interface.load("huggingface/bigscience/T0pp", inputs=gr.inputs.Textbox(lines=5, label="Input Text"),title=title,description=description,article=article, examples=examples,enable_queue=True).launch()
\ No newline at end of file
diff --git a/spaces/akhaliq/Text-to-Music/README.md b/spaces/akhaliq/Text-to-Music/README.md
deleted file mode 100644
index a4e4d994277b0ddf86f6bf76c9149a2632024d8b..0000000000000000000000000000000000000000
--- a/spaces/akhaliq/Text-to-Music/README.md
+++ /dev/null
@@ -1,14 +0,0 @@
----
-title: Text To Music
-emoji: ⚡
-colorFrom: red
-colorTo: green
-sdk: gradio
-sdk_version: 3.6
-app_file: app.py
-pinned: false
-license: unknown
-duplicated_from: Mubert/Text-to-Music
----
-
-Check out the configuration reference at https://huggingface.co/docs/hub/spaces-config-reference
diff --git a/spaces/akhaliq/deeplab2/g3doc/setup/coco.md b/spaces/akhaliq/deeplab2/g3doc/setup/coco.md
deleted file mode 100644
index 0d6884493ae5001188f94ab0747bf20c8622ee08..0000000000000000000000000000000000000000
--- a/spaces/akhaliq/deeplab2/g3doc/setup/coco.md
+++ /dev/null
@@ -1,97 +0,0 @@
-# Run DeepLab2 on COCO dataset
-
-This page walks through the steps required to generate
-[COCO](https://cocodataset.org/) panoptic segmentation data for DeepLab2.
-DeepLab2 uses sharded TFRecords for efficient processing of the data.
-
-## Prework
-
-Before running any Deeplab2 scripts, the users should (1) access the
-[COCO dataset website](https://cocodataset.org/) to download the dataset,
-including [2017 Train images](http://images.cocodataset.org/zips/train2017.zip),
-[2017 Val images](http://images.cocodataset.org/zips/val2017.zip),
-[2017 Test images](http://images.cocodataset.org/zips/test2017.zip), and
-[2017 Panoptic Train/Val annotations](http://images.cocodataset.org/annotations/panoptic_annotations_trainval2017.zip),
-and (2) unzip the downloaded files.
-
-After finishing above steps, the expected directory structure should be as
-follows:
-
-```
-.(COCO_ROOT)
-+-- train2017
-|   |
-|   +-- *.jpg
-|
-|-- val2017
-|   |
-|   +-- *.jpg
-|
-|-- test2017
-|   |
-|   +-- *.jpg
-|
-+-- annotations
-     |
-     +-- panoptic_{train|val}2017.json
-     +-- panoptic_{train|val}2017
-```
-
-## Convert prepared dataset to TFRecord
-
-Use the following commandline to generate COCO TFRecords:
-
-```bash
-# For generating data for panoptic segmentation task
-python deeplab2/data/build_coco_data.py \
-  --coco_root=${COCO_ROOT} \
-  --output_dir=${OUTPUT_DIR}
-```
-
-Commandline above will output three sharded tfrecord files:
-`{train|val|test}@1000.tfrecord`. In the tfrecords, for `train` and `val` set,
-it contains the RGB image pixels as well as corresponding annotations. For
-`test` set, it contains RGB images only. These files will be used as the input
-for the model training and evaluation.
-
-Note that we map the class ID to continuous IDs. Specifically, we map the
-original label ID, which ranges from 1 to 200, to the contiguous ones ranging
-from 1 to 133.
-
-### TFExample proto format for COCO
-
-The Example proto contains the following fields:
-
-*   `image/encoded`: encoded image content.
-*   `image/filename`: image filename.
-*   `image/format`: image file format.
-*   `image/height`: image height.
-*   `image/width`: image width.
-*   `image/channels`: image channels.
-*   `image/segmentation/class/encoded`: encoded segmentation content.
-*   `image/segmentation/class/format`: segmentation encoding format.
-
-For panoptic segmentation, the encoded segmentation map will be the raw bytes of
-an int32 panoptic map, where each pixel is assigned to a panoptic ID, which is
-computed by:
-
-```
-  panoptic ID = semantic ID * label divisor + instance ID
-```
-
-where semantic ID will be:
-
-*   ignore label (0) for pixels not belonging to any segment
-*   for segments associated with `iscrowd` label:
-    *   (default): ignore label (0)
-    *   (if set `--treat_crowd_as_ignore=false` while running
-        `build_coco_data.py`): `category_id`
-*   `category_id` for other segments
-
-The instance ID will be 0 for pixels belonging to
-
-*   `stuff` class
-*   `thing` class with `iscrowd` label
-*   pixels with ignore label
-
-and `[1, label divisor)` otherwise.
diff --git a/spaces/alexray/btc_predictor/venv/lib/python3.10/site-packages/pip/_internal/distributions/sdist.py b/spaces/alexray/btc_predictor/venv/lib/python3.10/site-packages/pip/_internal/distributions/sdist.py
deleted file mode 100644
index bdaf4033c9364f3513f0d6bade7892fd6ae35128..0000000000000000000000000000000000000000
--- a/spaces/alexray/btc_predictor/venv/lib/python3.10/site-packages/pip/_internal/distributions/sdist.py
+++ /dev/null
@@ -1,127 +0,0 @@
-import logging
-from typing import Iterable, Set, Tuple
-
-from pip._internal.build_env import BuildEnvironment
-from pip._internal.distributions.base import AbstractDistribution
-from pip._internal.exceptions import InstallationError
-from pip._internal.index.package_finder import PackageFinder
-from pip._internal.metadata import BaseDistribution
-from pip._internal.utils.subprocess import runner_with_spinner_message
-
-logger = logging.getLogger(__name__)
-
-
-class SourceDistribution(AbstractDistribution):
-    """Represents a source distribution.
-
-    The preparation step for these needs metadata for the packages to be
-    generated, either using PEP 517 or using the legacy `setup.py egg_info`.
-    """
-
-    def get_metadata_distribution(self) -> BaseDistribution:
-        return self.req.get_dist()
-
-    def prepare_distribution_metadata(
-        self, finder: PackageFinder, build_isolation: bool
-    ) -> None:
-        # Load pyproject.toml, to determine whether PEP 517 is to be used
-        self.req.load_pyproject_toml()
-
-        # Set up the build isolation, if this requirement should be isolated
-        should_isolate = self.req.use_pep517 and build_isolation
-        if should_isolate:
-            # Setup an isolated environment and install the build backend static
-            # requirements in it.
-            self._prepare_build_backend(finder)
-            # Check that if the requirement is editable, it either supports PEP 660 or
-            # has a setup.py or a setup.cfg. This cannot be done earlier because we need
-            # to setup the build backend to verify it supports build_editable, nor can
-            # it be done later, because we want to avoid installing build requirements
-            # needlessly. Doing it here also works around setuptools generating
-            # UNKNOWN.egg-info when running get_requires_for_build_wheel on a directory
-            # without setup.py nor setup.cfg.
-            self.req.isolated_editable_sanity_check()
-            # Install the dynamic build requirements.
-            self._install_build_reqs(finder)
-
-        self.req.prepare_metadata()
-
-    def _prepare_build_backend(self, finder: PackageFinder) -> None:
-        # Isolate in a BuildEnvironment and install the build-time
-        # requirements.
-        pyproject_requires = self.req.pyproject_requires
-        assert pyproject_requires is not None
-
-        self.req.build_env = BuildEnvironment()
-        self.req.build_env.install_requirements(
-            finder, pyproject_requires, "overlay", kind="build dependencies"
-        )
-        conflicting, missing = self.req.build_env.check_requirements(
-            self.req.requirements_to_check
-        )
-        if conflicting:
-            self._raise_conflicts("PEP 517/518 supported requirements", conflicting)
-        if missing:
-            logger.warning(
-                "Missing build requirements in pyproject.toml for %s.",
-                self.req,
-            )
-            logger.warning(
-                "The project does not specify a build backend, and "
-                "pip cannot fall back to setuptools without %s.",
-                " and ".join(map(repr, sorted(missing))),
-            )
-
-    def _get_build_requires_wheel(self) -> Iterable[str]:
-        with self.req.build_env:
-            runner = runner_with_spinner_message("Getting requirements to build wheel")
-            backend = self.req.pep517_backend
-            assert backend is not None
-            with backend.subprocess_runner(runner):
-                return backend.get_requires_for_build_wheel()
-
-    def _get_build_requires_editable(self) -> Iterable[str]:
-        with self.req.build_env:
-            runner = runner_with_spinner_message(
-                "Getting requirements to build editable"
-            )
-            backend = self.req.pep517_backend
-            assert backend is not None
-            with backend.subprocess_runner(runner):
-                return backend.get_requires_for_build_editable()
-
-    def _install_build_reqs(self, finder: PackageFinder) -> None:
-        # Install any extra build dependencies that the backend requests.
-        # This must be done in a second pass, as the pyproject.toml
-        # dependencies must be installed before we can call the backend.
-        if (
-            self.req.editable
-            and self.req.permit_editable_wheels
-            and self.req.supports_pyproject_editable()
-        ):
-            build_reqs = self._get_build_requires_editable()
-        else:
-            build_reqs = self._get_build_requires_wheel()
-        conflicting, missing = self.req.build_env.check_requirements(build_reqs)
-        if conflicting:
-            self._raise_conflicts("the backend dependencies", conflicting)
-        self.req.build_env.install_requirements(
-            finder, missing, "normal", kind="backend dependencies"
-        )
-
-    def _raise_conflicts(
-        self, conflicting_with: str, conflicting_reqs: Set[Tuple[str, str]]
-    ) -> None:
-        format_string = (
-            "Some build dependencies for {requirement} "
-            "conflict with {conflicting_with}: {description}."
-        )
-        error_message = format_string.format(
-            requirement=self.req,
-            conflicting_with=conflicting_with,
-            description=", ".join(
-                f"{installed} is incompatible with {wanted}"
-                for installed, wanted in sorted(conflicting_reqs)
-            ),
-        )
-        raise InstallationError(error_message)
diff --git a/spaces/ali-ghamdan/deoldify/fastai/imports/torch.py b/spaces/ali-ghamdan/deoldify/fastai/imports/torch.py
deleted file mode 100644
index 028a3932fb7c12356a0ab239098cd8088308d37f..0000000000000000000000000000000000000000
--- a/spaces/ali-ghamdan/deoldify/fastai/imports/torch.py
+++ /dev/null
@@ -1,5 +0,0 @@
-import torch, torch.nn.functional as F
-from torch import ByteTensor, DoubleTensor, FloatTensor, HalfTensor, LongTensor, ShortTensor, Tensor
-from torch import nn, optim, as_tensor
-from torch.utils.data import BatchSampler, DataLoader, Dataset, Sampler, TensorDataset
-from torch.nn.utils import weight_norm, spectral_norm
diff --git a/spaces/aliabid94/AutoGPT/README.md b/spaces/aliabid94/AutoGPT/README.md
deleted file mode 100644
index b3d2b2ddb23ae71650a9570465d445321b6d5559..0000000000000000000000000000000000000000
--- a/spaces/aliabid94/AutoGPT/README.md
+++ /dev/null
@@ -1,12 +0,0 @@
----
-title: AutoGPT
-emoji: 🦾
-colorFrom: yellow
-colorTo: yellow
-sdk: gradio
-sdk_version: 3.27.0
-app_file: ui/app.py
-pinned: false
-license: mit
----
-
diff --git a/spaces/aliabid94/AutoGPT/autogpt/spinner.py b/spaces/aliabid94/AutoGPT/autogpt/spinner.py
deleted file mode 100644
index 4e33d74213881352546f334ccb1eb4772b8b7b70..0000000000000000000000000000000000000000
--- a/spaces/aliabid94/AutoGPT/autogpt/spinner.py
+++ /dev/null
@@ -1,65 +0,0 @@
-"""A simple spinner module"""
-import itertools
-import sys
-import threading
-import time
-
-
-class Spinner:
-    """A simple spinner class"""
-
-    def __init__(self, message: str = "Loading...", delay: float = 0.1) -> None:
-        """Initialize the spinner class
-
-        Args:
-            message (str): The message to display.
-            delay (float): The delay between each spinner update.
-        """
-        self.spinner = itertools.cycle(["-", "/", "|", "\\"])
-        self.delay = delay
-        self.message = message
-        self.running = False
-        self.spinner_thread = None
-
-    def spin(self) -> None:
-        """Spin the spinner"""
-        while self.running:
-            sys.stdout.write(f"{next(self.spinner)} {self.message}\r")
-            sys.stdout.flush()
-            time.sleep(self.delay)
-            sys.stdout.write(f"\r{' ' * (len(self.message) + 2)}\r")
-
-    def __enter__(self):
-        """Start the spinner"""
-        self.running = True
-        self.spinner_thread = threading.Thread(target=self.spin)
-        self.spinner_thread.start()
-
-        return self
-
-    def __exit__(self, exc_type, exc_value, exc_traceback) -> None:
-        """Stop the spinner
-
-        Args:
-            exc_type (Exception): The exception type.
-            exc_value (Exception): The exception value.
-            exc_traceback (Exception): The exception traceback.
-        """
-        self.running = False
-        if self.spinner_thread is not None:
-            self.spinner_thread.join()
-        sys.stdout.write(f"\r{' ' * (len(self.message) + 2)}\r")
-        sys.stdout.flush()
-
-    def update_message(self, new_message, delay=0.1):
-        """Update the spinner message
-        Args:
-            new_message (str): New message to display
-            delay: Delay in seconds before updating the message
-        """
-        time.sleep(delay)
-        sys.stdout.write(
-            f"\r{' ' * (len(self.message) + 2)}\r"
-        )  # Clear the current message
-        sys.stdout.flush()
-        self.message = new_message
diff --git a/spaces/arslan-ahmed/talk-to-your-docs/Dockerfile b/spaces/arslan-ahmed/talk-to-your-docs/Dockerfile
deleted file mode 100644
index 2ae720c2805ac5095c21ce52e71257f3cdd284d4..0000000000000000000000000000000000000000
--- a/spaces/arslan-ahmed/talk-to-your-docs/Dockerfile
+++ /dev/null
@@ -1,19 +0,0 @@
-
-# Use an official Python runtime as a parent image
-FROM arslan2k12/ttyd_base
-
-# Set the working directory in the container
-WORKDIR /app/ttyd
-
-# Copy the current directory contents into the container at /usr/src/app
-# COPY . /app/ttyd
-COPY *.py /app/ttyd
-
-# to make gradio app accessible to local network (default 127.0.0.1 is only accissible within the container)
-ENV GRADIO_SERVER_NAME=0.0.0.0
-
-# Install any needed packages specified in requirements.txt
-# RUN pip install --no-cache-dir -r requirements.txt # already installed in base image
-
-# Use ENTRYPOINT to allow passing user arguments
-ENTRYPOINT ["python", "app.py"]
\ No newline at end of file
diff --git a/spaces/artificialguybr/video-dubbing/TTS/recipes/ljspeech/neuralhmm_tts/train_neuralhmmtts.py b/spaces/artificialguybr/video-dubbing/TTS/recipes/ljspeech/neuralhmm_tts/train_neuralhmmtts.py
deleted file mode 100644
index 28d37799750b7115be9a24c4a947526fed9429fe..0000000000000000000000000000000000000000
--- a/spaces/artificialguybr/video-dubbing/TTS/recipes/ljspeech/neuralhmm_tts/train_neuralhmmtts.py
+++ /dev/null
@@ -1,96 +0,0 @@
-import os
-
-from trainer import Trainer, TrainerArgs
-
-from TTS.config.shared_configs import BaseAudioConfig
-from TTS.tts.configs.neuralhmm_tts_config import NeuralhmmTTSConfig
-from TTS.tts.configs.shared_configs import BaseDatasetConfig
-from TTS.tts.datasets import load_tts_samples
-from TTS.tts.models.neuralhmm_tts import NeuralhmmTTS
-from TTS.tts.utils.text.tokenizer import TTSTokenizer
-from TTS.utils.audio import AudioProcessor
-
-output_path = os.path.dirname(os.path.abspath(__file__))
-
-# init configs
-dataset_config = BaseDatasetConfig(
-    formatter="ljspeech", meta_file_train="metadata.csv", path=os.path.join("data", "LJSpeech-1.1/")
-)
-
-audio_config = BaseAudioConfig(
-    sample_rate=22050,
-    do_trim_silence=True,
-    trim_db=60.0,
-    signal_norm=False,
-    mel_fmin=0.0,
-    mel_fmax=8000,
-    spec_gain=1.0,
-    log_func="np.log",
-    ref_level_db=20,
-    preemphasis=0.0,
-)
-
-config = NeuralhmmTTSConfig(  # This is the config that is saved for the future use
-    run_name="neuralhmmtts_ljspeech",
-    audio=audio_config,
-    batch_size=32,
-    eval_batch_size=16,
-    num_loader_workers=4,
-    num_eval_loader_workers=4,
-    run_eval=True,
-    test_delay_epochs=-1,
-    epochs=1000,
-    text_cleaner="phoneme_cleaners",
-    use_phonemes=True,
-    phoneme_language="en-us",
-    phoneme_cache_path=os.path.join(output_path, "phoneme_cache"),
-    precompute_num_workers=8,
-    mel_statistics_parameter_path=os.path.join(output_path, "lj_parameters.pt"),
-    force_generate_statistics=False,
-    print_step=1,
-    print_eval=True,
-    mixed_precision=True,
-    output_path=output_path,
-    datasets=[dataset_config],
-)
-
-# INITIALIZE THE AUDIO PROCESSOR
-# Audio processor is used for feature extraction and audio I/O.
-# It mainly serves to the dataloader and the training loggers.
-ap = AudioProcessor.init_from_config(config)
-
-# INITIALIZE THE TOKENIZER
-# Tokenizer is used to convert text to sequences of token IDs.
-# If characters are not defined in the config, default characters are passed to the config
-tokenizer, config = TTSTokenizer.init_from_config(config)
-
-# LOAD DATA SAMPLES
-# Each sample is a list of ```[text, audio_file_path, speaker_name]```
-# You can define your custom sample loader returning the list of samples.
-# Or define your custom formatter and pass it to the `load_tts_samples`.
-# Check `TTS.tts.datasets.load_tts_samples` for more details.
-train_samples, eval_samples = load_tts_samples(
-    dataset_config,
-    eval_split=True,
-    eval_split_max_size=config.eval_split_max_size,
-    eval_split_size=config.eval_split_size,
-)
-
-# INITIALIZE THE MODEL
-# Models take a config object and a speaker manager as input
-# Config defines the details of the model like the number of layers, the size of the embedding, etc.
-# Speaker manager is used by multi-speaker models.
-model = NeuralhmmTTS(config, ap, tokenizer)
-
-
-# init the trainer and 🚀
-trainer = Trainer(
-    TrainerArgs(),
-    config,
-    output_path,
-    model=model,
-    train_samples=train_samples,
-    eval_samples=eval_samples,
-    gpu=1,
-)
-trainer.fit()
diff --git a/spaces/arxify/RVC-beta-v2-0618/runtime/Lib/site-packages/Crypto/Hash/MD5.py b/spaces/arxify/RVC-beta-v2-0618/runtime/Lib/site-packages/Crypto/Hash/MD5.py
deleted file mode 100644
index 554b77720fa10ab12ec18d4657b9b9c087676d48..0000000000000000000000000000000000000000
--- a/spaces/arxify/RVC-beta-v2-0618/runtime/Lib/site-packages/Crypto/Hash/MD5.py
+++ /dev/null
@@ -1,184 +0,0 @@
-# -*- coding: utf-8 -*-
-#
-# ===================================================================
-# The contents of this file are dedicated to the public domain.  To
-# the extent that dedication to the public domain is not available,
-# everyone is granted a worldwide, perpetual, royalty-free,
-# non-exclusive license to exercise all rights associated with the
-# contents of this file for any purpose whatsoever.
-# No rights are reserved.
-#
-# THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
-# EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
-# MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
-# NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
-# BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
-# ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
-# CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
-# SOFTWARE.
-# ===================================================================
-
-from Crypto.Util.py3compat import *
-
-from Crypto.Util._raw_api import (load_pycryptodome_raw_lib,
-                                  VoidPointer, SmartPointer,
-                                  create_string_buffer,
-                                  get_raw_buffer, c_size_t,
-                                  c_uint8_ptr)
-
-_raw_md5_lib = load_pycryptodome_raw_lib("Crypto.Hash._MD5",
-                        """
-                        #define MD5_DIGEST_SIZE 16
-
-                        int MD5_init(void **shaState);
-                        int MD5_destroy(void *shaState);
-                        int MD5_update(void *hs,
-                                          const uint8_t *buf,
-                                          size_t len);
-                        int MD5_digest(const void *shaState,
-                                          uint8_t digest[MD5_DIGEST_SIZE]);
-                        int MD5_copy(const void *src, void *dst);
-
-                        int MD5_pbkdf2_hmac_assist(const void *inner,
-                                            const void *outer,
-                                            const uint8_t first_digest[MD5_DIGEST_SIZE],
-                                            uint8_t final_digest[MD5_DIGEST_SIZE],
-                                            size_t iterations);
-                        """)
-
-class MD5Hash(object):
-    """A MD5 hash object.
-    Do not instantiate directly.
-    Use the :func:`new` function.
-
-    :ivar oid: ASN.1 Object ID
-    :vartype oid: string
-
-    :ivar block_size: the size in bytes of the internal message block,
-                      input to the compression function
-    :vartype block_size: integer
-
-    :ivar digest_size: the size in bytes of the resulting hash
-    :vartype digest_size: integer
-    """
-
-    # The size of the resulting hash in bytes.
-    digest_size = 16
-    # The internal block size of the hash algorithm in bytes.
-    block_size = 64
-    # ASN.1 Object ID
-    oid = "1.2.840.113549.2.5"
-
-    def __init__(self, data=None):
-        state = VoidPointer()
-        result = _raw_md5_lib.MD5_init(state.address_of())
-        if result:
-            raise ValueError("Error %d while instantiating MD5"
-                             % result)
-        self._state = SmartPointer(state.get(),
-                                   _raw_md5_lib.MD5_destroy)
-        if data:
-            self.update(data)
-
-    def update(self, data):
-        """Continue hashing of a message by consuming the next chunk of data.
-
-        Args:
-            data (byte string/byte array/memoryview): The next chunk of the message being hashed.
-        """
-
-        result = _raw_md5_lib.MD5_update(self._state.get(),
-                                         c_uint8_ptr(data),
-                                         c_size_t(len(data)))
-        if result:
-            raise ValueError("Error %d while instantiating MD5"
-                             % result)
-
-    def digest(self):
-        """Return the **binary** (non-printable) digest of the message that has been hashed so far.
-
-        :return: The hash digest, computed over the data processed so far.
-                 Binary form.
-        :rtype: byte string
-        """
-
-        bfr = create_string_buffer(self.digest_size)
-        result = _raw_md5_lib.MD5_digest(self._state.get(),
-                                           bfr)
-        if result:
-            raise ValueError("Error %d while instantiating MD5"
-                             % result)
-
-        return get_raw_buffer(bfr)
-
-    def hexdigest(self):
-        """Return the **printable** digest of the message that has been hashed so far.
-
-        :return: The hash digest, computed over the data processed so far.
-                 Hexadecimal encoded.
-        :rtype: string
-        """
-
-        return "".join(["%02x" % bord(x) for x in self.digest()])
-
-    def copy(self):
-        """Return a copy ("clone") of the hash object.
-
-        The copy will have the same internal state as the original hash
-        object.
-        This can be used to efficiently compute the digests of strings that
-        share a common initial substring.
-
-        :return: A hash object of the same type
-        """
-
-        clone = MD5Hash()
-        result = _raw_md5_lib.MD5_copy(self._state.get(),
-                                         clone._state.get())
-        if result:
-            raise ValueError("Error %d while copying MD5" % result)
-        return clone
-
-    def new(self, data=None):
-        """Create a fresh SHA-1 hash object."""
-
-        return MD5Hash(data)
-
-
-def new(data=None):
-    """Create a new hash object.
-
-    :parameter data:
-        Optional. The very first chunk of the message to hash.
-        It is equivalent to an early call to :meth:`MD5Hash.update`.
-    :type data: byte string/byte array/memoryview
-
-    :Return: A :class:`MD5Hash` hash object
-    """
-    return MD5Hash().new(data)
-
-# The size of the resulting hash in bytes.
-digest_size = 16
-
-# The internal block size of the hash algorithm in bytes.
-block_size = 64
-
-
-def _pbkdf2_hmac_assist(inner, outer, first_digest, iterations):
-    """Compute the expensive inner loop in PBKDF-HMAC."""
-
-    assert len(first_digest) == digest_size
-    assert iterations > 0
-
-    bfr = create_string_buffer(digest_size);
-    result = _raw_md5_lib.MD5_pbkdf2_hmac_assist(
-                    inner._state.get(),
-                    outer._state.get(),
-                    first_digest,
-                    bfr,
-                    c_size_t(iterations))
-
-    if result:
-        raise ValueError("Error %d with PBKDF2-HMAC assis for MD5" % result)
-
-    return get_raw_buffer(bfr)
diff --git a/spaces/arxify/RVC-beta-v2-0618/runtime/Lib/site-packages/fairseq/data/plasma_utils.py b/spaces/arxify/RVC-beta-v2-0618/runtime/Lib/site-packages/fairseq/data/plasma_utils.py
deleted file mode 100644
index 459fb8acd789e7b03c70201cb5cb2a9e7dc4f325..0000000000000000000000000000000000000000
--- a/spaces/arxify/RVC-beta-v2-0618/runtime/Lib/site-packages/fairseq/data/plasma_utils.py
+++ /dev/null
@@ -1,197 +0,0 @@
-# Copyright (c) Facebook, Inc. and its affiliates.
-#
-# This source code is licensed under the MIT license found in the
-# LICENSE file in the root directory of this source tree.
-
-
-import hashlib
-import json
-import subprocess
-import tempfile
-from typing import Hashable
-
-try:
-    import pyarrow.plasma as plasma
-
-    PYARROW_AVAILABLE = True
-except ImportError:
-    plasma = None
-    PYARROW_AVAILABLE = False
-
-
-class PlasmaArray:
-    """
-    Wrapper around numpy arrays that automatically moves the data to shared
-    memory upon serialization. This is particularly helpful when passing numpy
-    arrays through multiprocessing, so that data is not unnecessarily
-    duplicated or pickled.
-    """
-
-    def __init__(self, array):
-        super().__init__()
-        self.array = array
-        self.disable = array.nbytes < 134217728  # disable for arrays <128MB
-        self.object_id = None
-        self.path = None
-
-        # variables with underscores shouldn't be pickled
-        self._client = None
-        self._server = None
-        self._server_tmp = None
-        self._plasma = None
-
-    @property
-    def plasma(self):
-        if self._plasma is None and not self.disable:
-            self._plasma = plasma
-        return self._plasma
-
-    def start_server(self):
-        if self.plasma is None or self._server is not None:
-            return
-        assert self.object_id is None
-        assert self.path is None
-        self._server_tmp = tempfile.NamedTemporaryFile()
-        self.path = self._server_tmp.name
-        self._server = subprocess.Popen(
-            ["plasma_store", "-m", str(int(1.05 * self.array.nbytes)), "-s", self.path]
-        )
-
-    @property
-    def client(self):
-        if self._client is None:
-            assert self.path is not None
-            self._client = self.plasma.connect(self.path, num_retries=200)
-        return self._client
-
-    def __getstate__(self):
-        """Called on pickle load"""
-        if self.plasma is None:
-            return self.__dict__
-        if self.object_id is None:
-            self.start_server()
-            self.object_id = self.client.put(self.array)
-        state = self.__dict__.copy()
-        del state["array"]
-        state["_client"] = None
-        state["_server"] = None
-        state["_server_tmp"] = None
-        state["_plasma"] = None
-        return state
-
-    def __setstate__(self, state):
-        """Called on pickle save"""
-        self.__dict__.update(state)
-        if self.plasma is None:
-            return
-        self.array = self.client.get(self.object_id)
-
-    def __del__(self):
-        if self._server is not None:
-            self._server.kill()
-            self._server = None
-            self._server_tmp.close()
-            self._server_tmp = None
-
-
-DEFAULT_PLASMA_PATH = "/tmp/plasma"
-
-
-class PlasmaView:
-    """Interface to write and read from shared memory. Whereas PlasmaArray writes to plasma on serialization,
-    PlasmaView writes to shared memory on instantiation."""
-
-    def __init__(self, array, split_path: str, hash_data: Hashable, plasma_path=None):
-        """
-        Args:
-            array: numpy array to store. This can be read with ``PlasmaView().array``
-            split_path: the path whence the data was read, used for hashing
-            hash_data: other metadata about the array that can be used to create a unique key.
-                as of writing, the 3 callers in ``TokenBlockDataset`` use::
-
-                    hash_data = ((block_size, document_sep_len, str(break_mode), len(dataset)), 0|1|2)
-
-
-        """
-        assert PYARROW_AVAILABLE
-        assert split_path is not None
-        if plasma_path is None:
-            plasma_path = DEFAULT_PLASMA_PATH
-
-        self.path = plasma_path
-        self.split_path = split_path
-        self._client = None  # Initialize lazily for pickle. plasma clients should not be deep copied or serialized.
-        self._n = None
-
-        self.object_id = self.get_object_id(self.split_path, hash_data)
-        try:
-            self.client.put(array, object_id=self.object_id)
-        except plasma.PlasmaObjectExists:
-            pass
-
-    @property
-    def client(self):
-        if self._client is None:
-            self._client = plasma.connect(self.path, num_retries=200)
-        return self._client
-
-    @property
-    def array(self):
-        """Fetch a read only view of an np.array, stored in plasma."""
-        ret = self.client.get(self.object_id)
-        return ret
-
-    @staticmethod
-    def get_object_id(split_path: str, hash_data: Hashable):
-        """Returns plasma.ObjectID from hashing split_path and object_num."""
-        hash = hashlib.blake2b(bytes(split_path, "utf-8"), digest_size=20)
-        harg = json.dumps(hash_data).encode("utf-8")
-        hash.update(harg)
-        return plasma.ObjectID(hash.digest())
-
-    def __getstate__(self):
-        """Called on pickle save"""
-        self.disconnect()
-        state = self.__dict__.copy()
-        assert state["_client"] is None
-        assert "object_id" in state
-        return state
-
-    def __setstate__(self, state):
-        """Called on pickle load"""
-        self.__dict__.update(state)
-
-    def __del__(self):
-        self.disconnect()
-
-    def disconnect(self):
-        if self._client is not None:
-            self._client.disconnect()
-            self._client = None
-
-    def __len__(self):
-        """Save reads by caching len"""
-        if self._n is None:
-            self._n = len(self.array)
-        return self._n
-
-
-GB100 = (1024**3) * 100
-
-
-class PlasmaStore:
-    def __init__(self, path=DEFAULT_PLASMA_PATH, nbytes: int = GB100):
-
-        self.server = self.start(path, nbytes)
-
-    def __del__(self):
-        self.server.kill()
-
-    @staticmethod
-    def start(path=DEFAULT_PLASMA_PATH, nbytes: int = GB100) -> subprocess.Popen:
-        if not PYARROW_AVAILABLE:
-            raise ImportError("please run pip install pyarrow to use --use_plasma_view")
-        # best practice is to allocate more space than we need. The limitation seems to be the size of /dev/shm
-        _server = subprocess.Popen(["plasma_store", "-m", str(nbytes), "-s", path])
-        plasma.connect(path, num_retries=200)  # If we can't connect we fail immediately
-        return _server
diff --git a/spaces/arxify/RVC-beta-v2-0618/runtime/Lib/site-packages/fairseq/examples/MMPT/mmpt/tasks/__init__.py b/spaces/arxify/RVC-beta-v2-0618/runtime/Lib/site-packages/fairseq/examples/MMPT/mmpt/tasks/__init__.py
deleted file mode 100644
index e2e9323a530672ef9daecd793ef645a3c1d0f3e6..0000000000000000000000000000000000000000
--- a/spaces/arxify/RVC-beta-v2-0618/runtime/Lib/site-packages/fairseq/examples/MMPT/mmpt/tasks/__init__.py
+++ /dev/null
@@ -1,22 +0,0 @@
-# Copyright (c) Facebook, Inc. and its affiliates.
-#
-# This source code is licensed under the MIT license found in the
-# LICENSE file in the root directory of this source tree.
-from .task import *
-from .vlmtask import *
-from .retritask import *
-
-try:
-    from .fairseqmmtask import *
-except ImportError:
-    pass
-
-try:
-    from .milncetask import *
-except ImportError:
-    pass
-
-try:
-    from .expretritask import *
-except ImportError:
-    pass
diff --git a/spaces/awacke1/DockerGoFlanT5/static/index.html b/spaces/awacke1/DockerGoFlanT5/static/index.html
deleted file mode 100644
index 876c6fb45bb9cfc4f4d2638651783d084c7bbdb0..0000000000000000000000000000000000000000
--- a/spaces/awacke1/DockerGoFlanT5/static/index.html
+++ /dev/null
@@ -1,36 +0,0 @@
-<!DOCTYPE html>
-<html lang="en">
-  <head>
-    <meta charset="UTF-8" />
-    <meta name="viewport" content="width=device-width, initial-scale=1.0" />
-    <title>Docker Space Fast API Uvicorn</title>
-    <link rel="stylesheet" href="style.css" />
-    <script type="module" src="script.js"></script>
-  </head>
-  <body>
-    <main>
-      <section id="text-gen">
-        <h1>Text generation using Flan T5</h1>
-        <p>
-          Model:
-          <a
-              href="https://huggingface.co/google/flan-t5-small"
-              rel="noreferrer"
-              target="_blank"
-            >google/flan-t5-small</a
-          >
-        </p>
-        <form class="text-gen-form">
-          <label for="text-gen-input">Text prompt</label>
-          <input
-            id="text-gen-input"
-            type="text"
-            value="English: Translate My name is Aaron.  Nice to meet you. Spanish:"
-          />
-          <button id="text-gen-submit">Submit</button>
-          <p class="text-gen-output"></p>
-        </form>
-      </section>
-    </main>
-  </body>
-</html>
\ No newline at end of file
diff --git a/spaces/awacke1/DockerGoFlanT5/static/script.js b/spaces/awacke1/DockerGoFlanT5/static/script.js
deleted file mode 100644
index efd05c5d1e76ecd3d0e41927b073c8d10f1e8e20..0000000000000000000000000000000000000000
--- a/spaces/awacke1/DockerGoFlanT5/static/script.js
+++ /dev/null
@@ -1,21 +0,0 @@
-const textGenForm = document.querySelector('.text-gen-form');
-
-const translateText = async (text) => {
-    const inferResponse = await fetch(`infer_t5?input=${text}`);
-    const inferJson = await inferResponse.json();
-
-    return inferJson.output;
-};
-
-textGenForm.addEventListener('submit', async (event) => {
-  event.preventDefault();
-
-  const textGenInput = document.getElementById('text-gen-input');
-  const textGenParagraph = document.querySelector('.text-gen-output');
-
-  try {
-    textGenParagraph.textContent = await translateText(textGenInput.value);
-  } catch (err) {
-    console.error(err);
-  }
-});
\ No newline at end of file
diff --git a/spaces/azaninello/gpt2-general-english/README.md b/spaces/azaninello/gpt2-general-english/README.md
deleted file mode 100644
index 45433bd19444a8f6c3c3ae9626f0df4c93e61afd..0000000000000000000000000000000000000000
--- a/spaces/azaninello/gpt2-general-english/README.md
+++ /dev/null
@@ -1,13 +0,0 @@
----
-title: Gpt2 General English
-emoji: 🔥
-colorFrom: indigo
-colorTo: green
-sdk: gradio
-sdk_version: 3.0.19
-app_file: app.py
-pinned: false
-license: wtfpl
----
-
-Check out the configuration reference at https://huggingface.co/docs/hub/spaces-config-reference
diff --git a/spaces/beihai/GFPGAN-V1.3-whole-image/basicsr/models/srgan_model.py b/spaces/beihai/GFPGAN-V1.3-whole-image/basicsr/models/srgan_model.py
deleted file mode 100644
index 0c187dc2b81c7562211cac8a63e1486564b52a72..0000000000000000000000000000000000000000
--- a/spaces/beihai/GFPGAN-V1.3-whole-image/basicsr/models/srgan_model.py
+++ /dev/null
@@ -1,144 +0,0 @@
-import torch
-from collections import OrderedDict
-
-from basicsr.archs import build_network
-from basicsr.losses import build_loss
-from basicsr.utils import get_root_logger
-from basicsr.utils.registry import MODEL_REGISTRY
-from .sr_model import SRModel
-
-
-@MODEL_REGISTRY.register()
-class SRGANModel(SRModel):
-    """SRGAN model for single image super-resolution."""
-
-    def init_training_settings(self):
-        train_opt = self.opt['train']
-
-        self.ema_decay = train_opt.get('ema_decay', 0)
-        if self.ema_decay > 0:
-            logger = get_root_logger()
-            logger.info(f'Use Exponential Moving Average with decay: {self.ema_decay}')
-            # define network net_g with Exponential Moving Average (EMA)
-            # net_g_ema is used only for testing on one GPU and saving
-            # There is no need to wrap with DistributedDataParallel
-            self.net_g_ema = build_network(self.opt['network_g']).to(self.device)
-            # load pretrained model
-            load_path = self.opt['path'].get('pretrain_network_g', None)
-            if load_path is not None:
-                self.load_network(self.net_g_ema, load_path, self.opt['path'].get('strict_load_g', True), 'params_ema')
-            else:
-                self.model_ema(0)  # copy net_g weight
-            self.net_g_ema.eval()
-
-        # define network net_d
-        self.net_d = build_network(self.opt['network_d'])
-        self.net_d = self.model_to_device(self.net_d)
-        self.print_network(self.net_d)
-
-        # load pretrained models
-        load_path = self.opt['path'].get('pretrain_network_d', None)
-        if load_path is not None:
-            param_key = self.opt['path'].get('param_key_d', 'params')
-            self.load_network(self.net_d, load_path, self.opt['path'].get('strict_load_d', True), param_key)
-
-        self.net_g.train()
-        self.net_d.train()
-
-        # define losses
-        if train_opt.get('pixel_opt'):
-            self.cri_pix = build_loss(train_opt['pixel_opt']).to(self.device)
-        else:
-            self.cri_pix = None
-
-        if train_opt.get('perceptual_opt'):
-            self.cri_perceptual = build_loss(train_opt['perceptual_opt']).to(self.device)
-        else:
-            self.cri_perceptual = None
-
-        if train_opt.get('gan_opt'):
-            self.cri_gan = build_loss(train_opt['gan_opt']).to(self.device)
-
-        self.net_d_iters = train_opt.get('net_d_iters', 1)
-        self.net_d_init_iters = train_opt.get('net_d_init_iters', 0)
-
-        # set up optimizers and schedulers
-        self.setup_optimizers()
-        self.setup_schedulers()
-
-    def setup_optimizers(self):
-        train_opt = self.opt['train']
-        # optimizer g
-        optim_type = train_opt['optim_g'].pop('type')
-        self.optimizer_g = self.get_optimizer(optim_type, self.net_g.parameters(), **train_opt['optim_g'])
-        self.optimizers.append(self.optimizer_g)
-        # optimizer d
-        optim_type = train_opt['optim_d'].pop('type')
-        self.optimizer_d = self.get_optimizer(optim_type, self.net_d.parameters(), **train_opt['optim_d'])
-        self.optimizers.append(self.optimizer_d)
-
-    def optimize_parameters(self, current_iter):
-        # optimize net_g
-        for p in self.net_d.parameters():
-            p.requires_grad = False
-
-        self.optimizer_g.zero_grad()
-        self.output = self.net_g(self.lq)
-
-        l_g_total = 0
-        loss_dict = OrderedDict()
-        if (current_iter % self.net_d_iters == 0 and current_iter > self.net_d_init_iters):
-            # pixel loss
-            if self.cri_pix:
-                l_g_pix = self.cri_pix(self.output, self.gt)
-                l_g_total += l_g_pix
-                loss_dict['l_g_pix'] = l_g_pix
-            # perceptual loss
-            if self.cri_perceptual:
-                l_g_percep, l_g_style = self.cri_perceptual(self.output, self.gt)
-                if l_g_percep is not None:
-                    l_g_total += l_g_percep
-                    loss_dict['l_g_percep'] = l_g_percep
-                if l_g_style is not None:
-                    l_g_total += l_g_style
-                    loss_dict['l_g_style'] = l_g_style
-            # gan loss
-            fake_g_pred = self.net_d(self.output)
-            l_g_gan = self.cri_gan(fake_g_pred, True, is_disc=False)
-            l_g_total += l_g_gan
-            loss_dict['l_g_gan'] = l_g_gan
-
-            l_g_total.backward()
-            self.optimizer_g.step()
-
-        # optimize net_d
-        for p in self.net_d.parameters():
-            p.requires_grad = True
-
-        self.optimizer_d.zero_grad()
-        # real
-        real_d_pred = self.net_d(self.gt)
-        l_d_real = self.cri_gan(real_d_pred, True, is_disc=True)
-        loss_dict['l_d_real'] = l_d_real
-        loss_dict['out_d_real'] = torch.mean(real_d_pred.detach())
-        l_d_real.backward()
-        # fake
-        fake_d_pred = self.net_d(self.output.detach())
-        l_d_fake = self.cri_gan(fake_d_pred, False, is_disc=True)
-        loss_dict['l_d_fake'] = l_d_fake
-        loss_dict['out_d_fake'] = torch.mean(fake_d_pred.detach())
-        l_d_fake.backward()
-        self.optimizer_d.step()
-
-        self.log_dict = self.reduce_loss_dict(loss_dict)
-
-        if self.ema_decay > 0:
-            self.model_ema(decay=self.ema_decay)
-
-    def save(self, epoch, current_iter):
-        if hasattr(self, 'net_g_ema'):
-            self.save_network([self.net_g, self.net_g_ema], 'net_g', current_iter, param_key=['params', 'params_ema'])
-        else:
-            self.save_network(self.net_g, 'net_g', current_iter)
-        self.save_network(self.net_d, 'net_d', current_iter)
-        self.save_training_state(epoch, current_iter)
diff --git a/spaces/besarismaili/fastai_pet_classifier/README.md b/spaces/besarismaili/fastai_pet_classifier/README.md
deleted file mode 100644
index 06775482f7f61cc633487dde8c13a4360a2abb77..0000000000000000000000000000000000000000
--- a/spaces/besarismaili/fastai_pet_classifier/README.md
+++ /dev/null
@@ -1,37 +0,0 @@
----
-title: Fastai_pet_classifier
-emoji: 📈
-colorFrom: red
-colorTo: green
-sdk: gradio
-app_file: app.py
-pinned: false
----
-
-# Configuration
-
-`title`: _string_  
-Display title for the Space
-
-`emoji`: _string_  
-Space emoji (emoji-only character allowed)
-
-`colorFrom`: _string_  
-Color for Thumbnail gradient (red, yellow, green, blue, indigo, purple, pink, gray)
-
-`colorTo`: _string_  
-Color for Thumbnail gradient (red, yellow, green, blue, indigo, purple, pink, gray)
-
-`sdk`: _string_  
-Can be either `gradio` or `streamlit`
-
-`sdk_version` : _string_  
-Only applicable for `streamlit` SDK.  
-See [doc](https://hf.co/docs/hub/spaces) for more info on supported versions.
-
-`app_file`: _string_  
-Path to your main application file (which contains either `gradio` or `streamlit` Python code).  
-Path is relative to the root of the repository.
-
-`pinned`: _boolean_  
-Whether the Space stays on top of your list.
diff --git a/spaces/bigscience-data/scisearch/Makefile b/spaces/bigscience-data/scisearch/Makefile
deleted file mode 100644
index 4b312120097eb5076c15c85a6cba7a1fd9383586..0000000000000000000000000000000000000000
--- a/spaces/bigscience-data/scisearch/Makefile
+++ /dev/null
@@ -1,7 +0,0 @@
-.PHONY: style
-
-# Format source code automatically
-
-style:
-	black --line-length 119 --target-version py36 .
-	isort .
diff --git a/spaces/bioriAsaeru/text-to-voice/El Amor Es Extasis (Bliss) (1997).md b/spaces/bioriAsaeru/text-to-voice/El Amor Es Extasis (Bliss) (1997).md
deleted file mode 100644
index 2eb66872e492ad4ecfad1f839318d2a8f1cf82c9..0000000000000000000000000000000000000000
--- a/spaces/bioriAsaeru/text-to-voice/El Amor Es Extasis (Bliss) (1997).md	
+++ /dev/null
@@ -1,6 +0,0 @@
-<h2>El Amor Es Extasis (Bliss) (1997)</h2><br /><p><b><b>DOWNLOAD</b> &#9881;&#9881;&#9881; <a href="https://urloso.com/2uyQlZ">https://urloso.com/2uyQlZ</a></b></p><br /><br />
-
- aaccfb2cb3<br />
-<br />
-<br />
-<p></p>
diff --git a/spaces/bioriAsaeru/text-to-voice/Eset Mobile Security Premium Apk 20.md b/spaces/bioriAsaeru/text-to-voice/Eset Mobile Security Premium Apk 20.md
deleted file mode 100644
index 7e98f86958f7a1cec854f8ad340c00a69f0a8c1b..0000000000000000000000000000000000000000
--- a/spaces/bioriAsaeru/text-to-voice/Eset Mobile Security Premium Apk 20.md	
+++ /dev/null
@@ -1,13 +0,0 @@
-<br />
-<p>And speaking of which, with this awesome mobile application of ESET Mobile Security & Antivirus, Android users can now enjoy working freely with their Android devices without worrying about their security. With the app constantly working in the background to get rid of all security threats and prevent potential exploitations, you can have complete peace of mind.</p>
-<p>Scan to make sure that no one is using your network and improve your Wi-Fi network security. Protect your mobile devices from adware and malware from unsecured apps. Schedule system checks and enable background app instances to always protect your devices. The list goes on.</p>
-<h2>eset mobile security premium apk 20</h2><br /><p><b><b>Download Zip</b> &middot;&middot;&middot;&middot;&middot; <a href="https://urloso.com/2uyRsk">https://urloso.com/2uyRsk</a></b></p><br /><br />
-<p>For those of you who are interested, you can now enjoy working with this amazing mobile application of ESET Mobile Security & Antivirus and enjoy all of its amazing features for free, thanks to the featured app on the Google Play Store. However, the freemium app will still come with certain in-app purchases, which are required if you want to unlock its complete features.</p>
-<p>With ESET Mobile Security & Antivirus, Android users can immediately enjoy the intuitive and accessible Android app on their mobile devices, thanks to the improved dashboard UX and friendly interfaces which make it super easy for mobile users to interact with. Here, Android users are free to navigate through the app and make use of its undemanding features.</p>
-<p>For those of you who are interested, you can now enable your real-time scanning of ESET Mobile Security & Antivirus by providing the app with certain access permissions. This will allow the mobile security tool to consistently enable its antivirus scans to protect your mobile devices on the go. Here, the active scans will make sure that your devices are always free of virus in real time.</p>
-<p>And to make the app more fun and interesting, ESET Mobile Security & Antivirus users can now choose to scan and check for the connected USB devices to ensure their safety. With the On-The-Go USB Scanner, you can make sure that your USB devices are safe by testing them on your mobile devices first before plugging them on other systems.</p>
-<p>With online transactions becoming more and more popular, mobile users are finding their mobile devices being more and more useful when it comes to executing these transactions. However, this also allows cyber attackers to exploit your online payment methods to steal your money. With Payment Protection from ESET Mobile Security & Antivirus, each of your transactions will be properly verified by the app to make sure that you can shop and bank safely while online.</p>
-<p></p>
-<p>With the Anti-Phishing option available, ESET Mobile Security & Antivirus users can now identify scam sites while browsing the web pages with their mobile devices. Here, the app will actively scan your online activities and notify you when accessing certain unsecured web pages. Plus, it will also improve your security when using social apps, which will prevent most hackers from collecting any of your information.</p> aaccfb2cb3<br />
-<br />
-<br />
\ No newline at end of file
diff --git a/spaces/bioriAsaeru/text-to-voice/Hard Disk Sentinel Pro 5.20 Build 9372 Portable Free Download UPDATED.md b/spaces/bioriAsaeru/text-to-voice/Hard Disk Sentinel Pro 5.20 Build 9372 Portable Free Download UPDATED.md
deleted file mode 100644
index 9eb257a39ea801e69871281fc8476e28eac6d9dc..0000000000000000000000000000000000000000
--- a/spaces/bioriAsaeru/text-to-voice/Hard Disk Sentinel Pro 5.20 Build 9372 Portable Free Download UPDATED.md	
+++ /dev/null
@@ -1,38 +0,0 @@
-<h2>Hard Disk Sentinel Pro 5.20 Build 9372 Portable free download</h2><br /><p><b><b>Download File</b> &#10027;&#10027;&#10027; <a href="https://urloso.com/2uyS9h">https://urloso.com/2uyS9h</a></b></p><br /><br />
-
-TНИЦДАЛЬНОЕ ПРЕДЫРЕНЕНИЕ.
-
-Hard Disk Sentinel 3.1.0.0 Crack 2020 Free Download is a Disk utility, by the software developer Techuva that can recognize, verify and locate disk errors and other disk related problems. Hard Disk Sentinel is a software program that uses self-learning AI (Artificial Intelligence).
-
-It scans for bad sectors, bad cylinders, physical defects and hard disk drive problems. It also checks for problems when hard disks are shut down. It is easy to use disk error scanning software, there are two languages: English, French and Spanish. It is a small portable program, which can be installed on an USB flash drive. It can be used on an entire hard disk or even a single partition.
-
-Download Hard Disk Sentinel, Professional, Trial, DOS, Linux versions.
-
-Features:
-
-New Scan Modes:
-
-Hard Disk Sentinel 2020 Crack uses a new scan mode with the new function of 32 bit/64 bit. It can analyze the errors that appear in the 32-bit and 64-bit versions of Windows, both 32-bit and 64-bit Windows.
-
-Faster Scan Speed:
-
-The disk file scanning software has a faster scan speed, making it easier for the software to recognize the errors.
-
-Automatic Scanning:
-
-The Hard Disk Sentinel 2020 Crack can automatically scan for any disk problems, making it easier for the user.
-
-Windows x64 System Requirements:
-
-Hard Disk Sentinel needs a processor speed of 2.66 GHz or above
-
-Windows 10, 8.1, 8 or 7 or 6 SP1
-
-1.7 GB RAM or more
-
-Hard Disk Sentinel 2.0.0.0 Free Keygen Is now here and you can free download it.
-
-Hard Disk Sentinel 2.0.0.0 Crack is a disk utility that can recognize, verify and locate disk errors and other disk related problems. Hard Disk Sentinel is a software program that uses self-learning AI (Artificial Intelligence). It is a small portable program, which can be installed on an USB flash drive. It is easy to use disk error scanning software, there are two languages: English, French and Spanish. It is a disk file scanning software that can automatically scan for any disk problems. 4fefd39f24<br />
-<br />
-<br />
-<p></p>
diff --git a/spaces/bioriAsaeru/text-to-voice/Klinicka Farmakologija Knjiga Pdf Download PATCHED.md b/spaces/bioriAsaeru/text-to-voice/Klinicka Farmakologija Knjiga Pdf Download PATCHED.md
deleted file mode 100644
index 3e675f50df01567be127ba129d99b6a5fb5a225e..0000000000000000000000000000000000000000
--- a/spaces/bioriAsaeru/text-to-voice/Klinicka Farmakologija Knjiga Pdf Download PATCHED.md	
+++ /dev/null
@@ -1,38 +0,0 @@
-
-<h1>Klinicka Farmakologija Knjiga Pdf Download: A Guide to Finding and Reading Pharmacology Books in Serbian</h1>
-<p>Klinicka farmakologija knjiga pdf download is a phrase that means "clinical pharmacology book pdf download" in Serbian. Clinical pharmacology is the branch of medicine that studies the effects, interactions, and uses of drugs in humans. If you are interested in learning more about this topic, you may want to find and read some pharmacology books in Serbian.</p>
-<h2>Klinicka Farmakologija Knjiga Pdf Download</h2><br /><p><b><b>Download Zip</b> &#10002; <a href="https://urloso.com/2uyPdY">https://urloso.com/2uyPdY</a></b></p><br /><br />
-<p>However, finding and reading pharmacology books in Serbian may not be easy for everyone. You may face some challenges such as:</p>
-<ul>
-<li>Limited availability of pharmacology books in Serbian online or offline</li>
-<li>High cost of buying or accessing pharmacology books in Serbian</li>
-<li>Difficulty in understanding the technical terms and concepts in pharmacology books in Serbian</li>
-<li>Lack of reliable sources or references for pharmacology books in Serbian</li>
-</ul>
-<p>To help you overcome these challenges, we have prepared this guide to finding and reading pharmacology books in Serbian. We will provide you with some tips and resources that will make your search and reading easier and more enjoyable.</p>
-<h2>How to Find Pharmacology Books in Serbian Online</h2>
-<p>One of the easiest ways to find pharmacology books in Serbian online is to use a search engine such as Google or Bing. You can type in the keyword "klinicka farmakologija knjiga pdf download" or other related terms such as "farmakologija knjiga pdf", "farmakologija knjiga online", or "farmakologija knjiga besplatno". You can also add the name of a specific author or book title if you have one in mind.</p>
-<p>However, not all the results that you will get from the search engine will be relevant or reliable. You may encounter some problems such as:</p>
-<ul>
-<li>Broken links or expired downloads</li>
-<li>Low-quality or incomplete pdf files</li>
-<li>Irrelevant or outdated content</li>
-<li>Malware or viruses attached to the files</li>
-<li>Illegal or unethical distribution of copyrighted material</li>
-</ul>
-<p>To avoid these problems, you should be careful and selective when choosing which websites to visit and which files to download. You should look for some indicators of credibility and quality such as:</p>
-<ul>
-<li>The domain name and extension of the website (e.g., .edu, .org, .gov)</li>
-<li>The design and layout of the website (e.g., professional, user-friendly, updated)</li>
-<li>The authorship and affiliation of the content (e.g., name, credentials, institution)</li>
-<li>The date and source of publication of the content (e.g., year, publisher, journal)</li>
-<li>The reviews and ratings of the content (e.g., comments, feedback, stars)</li>
-<li>The availability and accessibility of the content (e.g., free, open access, registration required)</li>
-</ul>
-<p>Some examples of websites that offer pharmacology books in Serbian online are:</p>
-
-- [^1^] Scribd: A digital library that hosts millions of books, documents, audiobooks, podcasts, and magazines. You can find some pharmacology books in Serbian on Scribd such as Farmakologija - Rang[^1^], a free ebook that covers various topics in pharmacology such as drug receptors, drug metabolism, drug toxicity, drug therapy, and drug development. You can read it online or download it as a pdf file after signing up for a free trial or a subscription.
-- [^2^] Data Status: A publishing house that specializes in medical and scientific books. You can find some pharmacology books in Serbian on Data Status such as Temeljna i klinička farmakologija[^2^], a comprehensive textbook that covers the basic principles and clinical applications of pharmacology. You can buy it online as a hardcover book or an ebook.
-- [^3^] Sway: A Microsoft Office app that allows you to create and share interactive presentations. You can find some pharmacology books in Serbian on Sway such as Klinicka Farmakologija Knjiga Pdf Download[^3^], a presentation that provides a brief</p> d5da3c52bf<br />
-<br />
-<br />
\ No newline at end of file
diff --git a/spaces/birsardar/stable-diffusion-mat-outpainting-primer/metrics/kernel_inception_distance.py b/spaces/birsardar/stable-diffusion-mat-outpainting-primer/metrics/kernel_inception_distance.py
deleted file mode 100644
index 3ac978925b5cf810463ef8e8a6f0dcd3f9078e6d..0000000000000000000000000000000000000000
--- a/spaces/birsardar/stable-diffusion-mat-outpainting-primer/metrics/kernel_inception_distance.py
+++ /dev/null
@@ -1,46 +0,0 @@
-# Copyright (c) 2021, NVIDIA CORPORATION.  All rights reserved.
-#
-# NVIDIA CORPORATION and its licensors retain all intellectual property
-# and proprietary rights in and to this software, related documentation
-# and any modifications thereto.  Any use, reproduction, disclosure or
-# distribution of this software and related documentation without an express
-# license agreement from NVIDIA CORPORATION is strictly prohibited.
-
-"""Kernel Inception Distance (KID) from the paper "Demystifying MMD
-GANs". Matches the original implementation by Binkowski et al. at
-https://github.com/mbinkowski/MMD-GAN/blob/master/gan/compute_scores.py"""
-
-import numpy as np
-from . import metric_utils
-
-#----------------------------------------------------------------------------
-
-def compute_kid(opts, max_real, num_gen, num_subsets, max_subset_size):
-    # Direct TorchScript translation of http://download.tensorflow.org/models/image/imagenet/inception-2015-12-05.tgz
-    detector_url = 'https://nvlabs-fi-cdn.nvidia.com/stylegan2-ada-pytorch/pretrained/metrics/inception-2015-12-05.pt'
-    detector_kwargs = dict(return_features=True) # Return raw features before the softmax layer.
-
-    real_features = metric_utils.compute_feature_stats_for_dataset(
-        opts=opts, detector_url=detector_url, detector_kwargs=detector_kwargs,
-        rel_lo=0, rel_hi=0, capture_all=True, max_items=max_real).get_all()
-
-    gen_features = metric_utils.compute_feature_stats_for_generator(
-        opts=opts, detector_url=detector_url, detector_kwargs=detector_kwargs,
-        rel_lo=0, rel_hi=1, capture_all=True, max_items=num_gen).get_all()
-
-    if opts.rank != 0:
-        return float('nan')
-
-    n = real_features.shape[1]
-    m = min(min(real_features.shape[0], gen_features.shape[0]), max_subset_size)
-    t = 0
-    for _subset_idx in range(num_subsets):
-        x = gen_features[np.random.choice(gen_features.shape[0], m, replace=False)]
-        y = real_features[np.random.choice(real_features.shape[0], m, replace=False)]
-        a = (x @ x.T / n + 1) ** 3 + (y @ y.T / n + 1) ** 3
-        b = (x @ y.T / n + 1) ** 3
-        t += (a.sum() - np.diag(a).sum()) / (m - 1) - b.sum() * 2 / m
-    kid = t / num_subsets / m
-    return float(kid)
-
-#----------------------------------------------------------------------------
diff --git a/spaces/bkhmsi/Font-To-Sketch/code/collage.py b/spaces/bkhmsi/Font-To-Sketch/code/collage.py
deleted file mode 100644
index 3b1d7943d5bb3e18c74e3286c19f4a69069be2bd..0000000000000000000000000000000000000000
--- a/spaces/bkhmsi/Font-To-Sketch/code/collage.py
+++ /dev/null
@@ -1,53 +0,0 @@
-import os
-import imageio 
-import numpy as np
-from glob import glob 
-from tqdm import tqdm
-from PIL import Image
-
-if __name__ == "__main__":
-    
-    path = "/Users/bkhmsi/Desktop/Animal-Words/*.gif"
-    save_path = os.path.join(os.path.dirname(path), "collage_loop_25_3.gif")
-
-
-    width, height = 250, 250
-    # width, height = 100, 100
-    nx, ny = 5, 5
-    n_frames = 67
-    collage = np.ones((n_frames*2, width*nx, height*ny)).astype(np.uint8)*255
-
-    filenames = [p for p in glob(path) if os.path.basename(p)[:-4] not in ["palestine", "amin", "collage", "collage_loop_25", "collage_loop_25_2", "collage_loop_25_3a", "collage_loop_7", "collage_1d"]]
-    print(f"> {len(filenames)} Files Found")
-
-    f_filenames = filenames
-    filter = ["horse.gif", "giraffe.gif", "duck.gif", "turtle.gif", "camel.gif", "octopus.gif", "shark.gif"]
-    # f_filenames = []
-    # for file in filenames:
-    #     basename = os.path.basename(file)
-    #     if basename in filter:
-    #         f_filenames += [file]
-
-    assert nx*ny <= len(f_filenames)
-
-    for i in range(nx):
-        for j in tqdm(range(ny)):
-            image = Image.open(f_filenames[i*ny+j])
-            assert image.is_animated
-            idx = 0
-            for frame_idx in range(n_frames):
-                image.seek(frame_idx)
-                frame = image.convert('L').copy()
-                frame = frame.resize((300,300))
-                collage[idx, i*width:(i+1)*width,j*height:(j+1)*height] = np.asarray(frame)[25:275, 25:275]
-                idx += 1
-
-            for frame_idx in reversed(range(n_frames)):
-                image.seek(frame_idx)
-                frame = image.convert('L').copy()
-                frame = frame.resize((300,300))
-                collage[idx, i*width:(i+1)*width,j*height:(j+1)*height] = np.asarray(frame)[25:275, 25:275]
-                idx += 1
-
-
-    imageio.mimsave(save_path, collage)
diff --git a/spaces/cactusAtSea/influencerGPT/app.py b/spaces/cactusAtSea/influencerGPT/app.py
deleted file mode 100644
index ba4c2f1f52023608f78b7da60ddfd4700e6e370f..0000000000000000000000000000000000000000
--- a/spaces/cactusAtSea/influencerGPT/app.py
+++ /dev/null
@@ -1,34 +0,0 @@
-import streamlit as st
-import openai
-st.set_page_config(layout="wide")
-st.title("Influencer Post Generator")
-
-openai_key = st.text_input('Enter your openai API key...', type="password")
-
-with st.form(key='columns_in_form'):
-    c1, c2, c3, c4, c5, c6 = st.columns(6)
-    with c1:
-        network = st.text_input('Which platform...')
-    with c2:
-        influencer_name = st.text_input('Enter your influencer name...')
-    with c3:
-        product_name = st.text_input('Enter your product name...')
-    with c4:
-        product_features = st.text_input('What features to highlight...')
-    with c5:
-        must_have = st.text_input('Must have these words...')
-    with c6:
-        target = st.text_input('Targeting these people...')
-    submitButton = st.form_submit_button(label="Surprise Me!", help="Click to see an example post!")
-
-if openai_key:
-    openai.api_key = openai_key
-
-if submitButton:
-    text = 'Image you are a {} influencer called {}, you need to write a post that promotes {} \
-            which targets {} with emojis. I need you to highlight these features: {}, and must include these words: {}'.format(network, influencer_name, product_name, target, product_features, must_have)
-    completion = openai.ChatCompletion.create(
-    model="gpt-3.5-turbo", 
-        messages=[{"role": "user", "content": text}])
-    st.text_area(label ="",value=completion["choices"][0]["message"]["content"], height =300)
-
diff --git a/spaces/candlend/vits-hoshimi/sovits/losses.py b/spaces/candlend/vits-hoshimi/sovits/losses.py
deleted file mode 100644
index 41f9be6980713a46824ae9ec5eb8fd7c515d89c5..0000000000000000000000000000000000000000
--- a/spaces/candlend/vits-hoshimi/sovits/losses.py
+++ /dev/null
@@ -1,61 +0,0 @@
-import torch 
-from torch.nn import functional as F
-
-import commons
-
-
-def feature_loss(fmap_r, fmap_g):
-  loss = 0
-  for dr, dg in zip(fmap_r, fmap_g):
-    for rl, gl in zip(dr, dg):
-      rl = rl.float().detach()
-      gl = gl.float()
-      loss += torch.mean(torch.abs(rl - gl))
-
-  return loss * 2 
-
-
-def discriminator_loss(disc_real_outputs, disc_generated_outputs):
-  loss = 0
-  r_losses = []
-  g_losses = []
-  for dr, dg in zip(disc_real_outputs, disc_generated_outputs):
-    dr = dr.float()
-    dg = dg.float()
-    r_loss = torch.mean((1-dr)**2)
-    g_loss = torch.mean(dg**2)
-    loss += (r_loss + g_loss)
-    r_losses.append(r_loss.item())
-    g_losses.append(g_loss.item())
-
-  return loss, r_losses, g_losses
-
-
-def generator_loss(disc_outputs):
-  loss = 0
-  gen_losses = []
-  for dg in disc_outputs:
-    dg = dg.float()
-    l = torch.mean((1-dg)**2)
-    gen_losses.append(l)
-    loss += l
-
-  return loss, gen_losses
-
-
-def kl_loss(z_p, logs_q, m_p, logs_p, z_mask):
-  """
-  z_p, logs_q: [b, h, t_t]
-  m_p, logs_p: [b, h, t_t]
-  """
-  z_p = z_p.float()
-  logs_q = logs_q.float()
-  m_p = m_p.float()
-  logs_p = logs_p.float()
-  z_mask = z_mask.float()
-  #print(logs_p)
-  kl = logs_p - logs_q - 0.5
-  kl += 0.5 * ((z_p - m_p)**2) * torch.exp(-2. * logs_p)
-  kl = torch.sum(kl * z_mask)
-  l = kl / torch.sum(z_mask)
-  return l
diff --git a/spaces/carlosalonso/Detection-video/carpeta_deteccion/detectron2/evaluation/evaluator.py b/spaces/carlosalonso/Detection-video/carpeta_deteccion/detectron2/evaluation/evaluator.py
deleted file mode 100644
index baf996002b2fddc8c1952408d450b5bf69394f0a..0000000000000000000000000000000000000000
--- a/spaces/carlosalonso/Detection-video/carpeta_deteccion/detectron2/evaluation/evaluator.py
+++ /dev/null
@@ -1,224 +0,0 @@
-# Copyright (c) Facebook, Inc. and its affiliates.
-import datetime
-import logging
-import time
-from collections import OrderedDict, abc
-from contextlib import ExitStack, contextmanager
-from typing import List, Union
-import torch
-from torch import nn
-
-from detectron2.utils.comm import get_world_size, is_main_process
-from detectron2.utils.logger import log_every_n_seconds
-
-
-class DatasetEvaluator:
-    """
-    Base class for a dataset evaluator.
-
-    The function :func:`inference_on_dataset` runs the model over
-    all samples in the dataset, and have a DatasetEvaluator to process the inputs/outputs.
-
-    This class will accumulate information of the inputs/outputs (by :meth:`process`),
-    and produce evaluation results in the end (by :meth:`evaluate`).
-    """
-
-    def reset(self):
-        """
-        Preparation for a new round of evaluation.
-        Should be called before starting a round of evaluation.
-        """
-        pass
-
-    def process(self, inputs, outputs):
-        """
-        Process the pair of inputs and outputs.
-        If they contain batches, the pairs can be consumed one-by-one using `zip`:
-
-        .. code-block:: python
-
-            for input_, output in zip(inputs, outputs):
-                # do evaluation on single input/output pair
-                ...
-
-        Args:
-            inputs (list): the inputs that's used to call the model.
-            outputs (list): the return value of `model(inputs)`
-        """
-        pass
-
-    def evaluate(self):
-        """
-        Evaluate/summarize the performance, after processing all input/output pairs.
-
-        Returns:
-            dict:
-                A new evaluator class can return a dict of arbitrary format
-                as long as the user can process the results.
-                In our train_net.py, we expect the following format:
-
-                * key: the name of the task (e.g., bbox)
-                * value: a dict of {metric name: score}, e.g.: {"AP50": 80}
-        """
-        pass
-
-
-class DatasetEvaluators(DatasetEvaluator):
-    """
-    Wrapper class to combine multiple :class:`DatasetEvaluator` instances.
-
-    This class dispatches every evaluation call to
-    all of its :class:`DatasetEvaluator`.
-    """
-
-    def __init__(self, evaluators):
-        """
-        Args:
-            evaluators (list): the evaluators to combine.
-        """
-        super().__init__()
-        self._evaluators = evaluators
-
-    def reset(self):
-        for evaluator in self._evaluators:
-            evaluator.reset()
-
-    def process(self, inputs, outputs):
-        for evaluator in self._evaluators:
-            evaluator.process(inputs, outputs)
-
-    def evaluate(self):
-        results = OrderedDict()
-        for evaluator in self._evaluators:
-            result = evaluator.evaluate()
-            if is_main_process() and result is not None:
-                for k, v in result.items():
-                    assert (
-                        k not in results
-                    ), "Different evaluators produce results with the same key {}".format(k)
-                    results[k] = v
-        return results
-
-
-def inference_on_dataset(
-    model, data_loader, evaluator: Union[DatasetEvaluator, List[DatasetEvaluator], None]
-):
-    """
-    Run model on the data_loader and evaluate the metrics with evaluator.
-    Also benchmark the inference speed of `model.__call__` accurately.
-    The model will be used in eval mode.
-
-    Args:
-        model (callable): a callable which takes an object from
-            `data_loader` and returns some outputs.
-
-            If it's an nn.Module, it will be temporarily set to `eval` mode.
-            If you wish to evaluate a model in `training` mode instead, you can
-            wrap the given model and override its behavior of `.eval()` and `.train()`.
-        data_loader: an iterable object with a length.
-            The elements it generates will be the inputs to the model.
-        evaluator: the evaluator(s) to run. Use `None` if you only want to benchmark,
-            but don't want to do any evaluation.
-
-    Returns:
-        The return value of `evaluator.evaluate()`
-    """
-    num_devices = get_world_size()
-    logger = logging.getLogger(__name__)
-    logger.info("Start inference on {} batches".format(len(data_loader)))
-
-    total = len(data_loader)  # inference data loader must have a fixed length
-    if evaluator is None:
-        # create a no-op evaluator
-        evaluator = DatasetEvaluators([])
-    if isinstance(evaluator, abc.MutableSequence):
-        evaluator = DatasetEvaluators(evaluator)
-    evaluator.reset()
-
-    num_warmup = min(5, total - 1)
-    start_time = time.perf_counter()
-    total_data_time = 0
-    total_compute_time = 0
-    total_eval_time = 0
-    with ExitStack() as stack:
-        if isinstance(model, nn.Module):
-            stack.enter_context(inference_context(model))
-        stack.enter_context(torch.no_grad())
-
-        start_data_time = time.perf_counter()
-        for idx, inputs in enumerate(data_loader):
-            total_data_time += time.perf_counter() - start_data_time
-            if idx == num_warmup:
-                start_time = time.perf_counter()
-                total_data_time = 0
-                total_compute_time = 0
-                total_eval_time = 0
-
-            start_compute_time = time.perf_counter()
-            outputs = model(inputs)
-            if torch.cuda.is_available():
-                torch.cuda.synchronize()
-            total_compute_time += time.perf_counter() - start_compute_time
-
-            start_eval_time = time.perf_counter()
-            evaluator.process(inputs, outputs)
-            total_eval_time += time.perf_counter() - start_eval_time
-
-            iters_after_start = idx + 1 - num_warmup * int(idx >= num_warmup)
-            data_seconds_per_iter = total_data_time / iters_after_start
-            compute_seconds_per_iter = total_compute_time / iters_after_start
-            eval_seconds_per_iter = total_eval_time / iters_after_start
-            total_seconds_per_iter = (time.perf_counter() - start_time) / iters_after_start
-            if idx >= num_warmup * 2 or compute_seconds_per_iter > 5:
-                eta = datetime.timedelta(seconds=int(total_seconds_per_iter * (total - idx - 1)))
-                log_every_n_seconds(
-                    logging.INFO,
-                    (
-                        f"Inference done {idx + 1}/{total}. "
-                        f"Dataloading: {data_seconds_per_iter:.4f} s/iter. "
-                        f"Inference: {compute_seconds_per_iter:.4f} s/iter. "
-                        f"Eval: {eval_seconds_per_iter:.4f} s/iter. "
-                        f"Total: {total_seconds_per_iter:.4f} s/iter. "
-                        f"ETA={eta}"
-                    ),
-                    n=5,
-                )
-            start_data_time = time.perf_counter()
-
-    # Measure the time only for this worker (before the synchronization barrier)
-    total_time = time.perf_counter() - start_time
-    total_time_str = str(datetime.timedelta(seconds=total_time))
-    # NOTE this format is parsed by grep
-    logger.info(
-        "Total inference time: {} ({:.6f} s / iter per device, on {} devices)".format(
-            total_time_str, total_time / (total - num_warmup), num_devices
-        )
-    )
-    total_compute_time_str = str(datetime.timedelta(seconds=int(total_compute_time)))
-    logger.info(
-        "Total inference pure compute time: {} ({:.6f} s / iter per device, on {} devices)".format(
-            total_compute_time_str, total_compute_time / (total - num_warmup), num_devices
-        )
-    )
-
-    results = evaluator.evaluate()
-    # An evaluator may return None when not in main process.
-    # Replace it by an empty dict instead to make it easier for downstream code to handle
-    if results is None:
-        results = {}
-    return results
-
-
-@contextmanager
-def inference_context(model):
-    """
-    A context where the model is temporarily changed to eval mode,
-    and restored to previous mode afterwards.
-
-    Args:
-        model: a torch Module
-    """
-    training_mode = model.training
-    model.eval()
-    yield
-    model.train(training_mode)
diff --git a/spaces/cccc-c/bingo/src/components/button-scroll-to-bottom.tsx b/spaces/cccc-c/bingo/src/components/button-scroll-to-bottom.tsx
deleted file mode 100644
index b68ab9c0e48320c356e51a52d11b9ca63909e6c5..0000000000000000000000000000000000000000
--- a/spaces/cccc-c/bingo/src/components/button-scroll-to-bottom.tsx
+++ /dev/null
@@ -1,34 +0,0 @@
-'use client'
-
-import * as React from 'react'
-
-import { cn } from '@/lib/utils'
-import { useAtBottom } from '@/lib/hooks/use-at-bottom'
-import { Button, type ButtonProps } from '@/components/ui/button'
-import { IconArrowDown } from '@/components/ui/icons'
-
-export function ButtonScrollToBottom({ className, ...props }: ButtonProps) {
-  const isAtBottom = useAtBottom()
-
-  return (
-    <Button
-      variant="outline"
-      size="icon"
-      className={cn(
-        'fixed right-4 bottom-24 z-50 bg-background transition-opacity duration-300 sm:right-20',
-        isAtBottom ? 'opacity-0' : 'opacity-100',
-        className
-      )}
-      onClick={() =>
-        window.scrollTo({
-          top: document.body.offsetHeight,
-          behavior: 'smooth'
-        })
-      }
-      {...props}
-    >
-      <IconArrowDown />
-      <span className="sr-only">Scroll to bottom</span>
-    </Button>
-  )
-}
diff --git a/spaces/chainyo/optimum-text-classification/main.py b/spaces/chainyo/optimum-text-classification/main.py
deleted file mode 100644
index d1f69f85d823711a582ae797c757ee4910b0dd4f..0000000000000000000000000000000000000000
--- a/spaces/chainyo/optimum-text-classification/main.py
+++ /dev/null
@@ -1,198 +0,0 @@
-"""⭐ Text Classification with Optimum and ONNXRuntime
-
-Streamlit application to classify text using multiple models.
-
-Author:
-    - @ChainYo - https://github.com/ChainYo
-"""
-
-import plotly
-import plotly.figure_factory as ff
-import numpy as np
-import pandas as pd
-import streamlit as st
-
-from pathlib import Path
-from time import sleep
-from typing import Dict, List, Union
-
-from optimum.onnxruntime import ORTModelForSequenceClassification, ORTOptimizer, ORTQuantizer
-from optimum.onnxruntime.configuration import OptimizationConfig, AutoQuantizationConfig
-from optimum.pipelines import pipeline as ort_pipeline
-from transformers import BertTokenizer, BertForSequenceClassification
-from transformers import pipeline as pt_pipeline
-
-from utils import calculate_inference_time
-
-
-HUB_MODEL_PATH = "yiyanghkust/finbert-tone"
-BASE_PATH = Path("models")
-ONNX_MODEL_PATH = BASE_PATH.joinpath("model.onnx")
-OPTIMIZED_BASE_PATH = BASE_PATH.joinpath("optimized")
-OPTIMIZED_MODEL_PATH = OPTIMIZED_BASE_PATH.joinpath("model-optimized.onnx")
-QUANTIZED_BASE_PATH = BASE_PATH.joinpath("quantized")
-QUANTIZED_MODEL_PATH = QUANTIZED_BASE_PATH.joinpath("model-quantized.onnx")
-VAR2LABEL = {
-    "pt_pipeline": "PyTorch", 
-    "ort_pipeline": "ONNXRuntime", 
-    "ort_optimized_pipeline": "ONNXRuntime (Optimized)", 
-    "ort_quantized_pipeline": "ONNXRuntime (Quantized)",
-}
-
-# Check if repositories exist, if not create them
-BASE_PATH.mkdir(exist_ok=True)
-QUANTIZED_BASE_PATH.mkdir(exist_ok=True)
-OPTIMIZED_BASE_PATH.mkdir(exist_ok=True)
-
-
-def get_timers(
-    samples: Union[List[str], str], exp_number: int, only_mean: bool = False
-) -> Dict[str, float]:
-    """
-    Calculate inference time for each model for a given sample or list of samples.
-
-    Parameters
-    ----------
-    samples : Union[List[str], str]
-        Sample or list of samples to calculate inference time for.
-    exp_number : int
-        Number of experiments to run.
-    
-    Returns
-    -------
-    Dict[str, float]
-        Dictionary of inference times for each model for the given samples.
-    """
-    if isinstance(samples, str):
-        samples = [samples]
-    
-    timers: Dict[str, float] = {}
-    for model in VAR2LABEL.keys():
-        time_buffer = []
-        st.session_state["pipeline"] = load_pipeline(model)
-        for _ in range(exp_number):
-            with calculate_inference_time(time_buffer):
-                st.session_state["pipeline"](samples)
-        timers[VAR2LABEL[model]] = np.mean(time_buffer) if only_mean else time_buffer
-    return timers
-
-
-def get_plot(timers: Dict[str, Union[float, List[float]]]) -> plotly.graph_objs.Figure:
-    """
-    Plot the inference time for each model.
-
-    Parameters
-    ----------
-    timers : Dict[str, Union[float, List[float]]]
-        Dictionary of inference times for each model.
-    """
-    data = pd.DataFrame.from_dict(timers, orient="columns")
-    colors = ["#84353f", "#b4524b", "#f47e58", "#ffbe67"]
-    fig = ff.create_distplot(
-        [data[col] for col in data.columns], data.columns, bin_size=0.001, colors=colors, show_curve=False
-    )
-    fig.update_layout(title_text="Inference Time", xaxis_title="Inference Time (s)", yaxis_title="Number of Samples")
-    return fig
-
-
-def load_pipeline(pipeline_name: str) -> None:
-    """
-    Load a pipeline for a given model.
-
-    Parameters
-    ----------
-    pipeline_name : str
-        Name of the pipeline to load.
-    """
-    if pipeline_name == "pt_pipeline":
-        model = BertForSequenceClassification.from_pretrained(HUB_MODEL_PATH, num_labels=3)
-        pipeline = pt_pipeline("sentiment-analysis", tokenizer=st.session_state["tokenizer"], model=model)
-    elif pipeline_name == "ort_pipeline":
-        model = ORTModelForSequenceClassification.from_pretrained(HUB_MODEL_PATH, from_transformers=True)
-        if not ONNX_MODEL_PATH.exists():
-            model.save_pretrained(ONNX_MODEL_PATH)
-        pipeline = ort_pipeline("text-classification", tokenizer=st.session_state["tokenizer"], model=model)
-    elif pipeline_name == "ort_optimized_pipeline":
-        if not OPTIMIZED_MODEL_PATH.exists():
-            optimization_config = OptimizationConfig(optimization_level=99)
-            optimizer = ORTOptimizer.from_pretrained(HUB_MODEL_PATH, feature="sequence-classification")
-            optimizer.export(ONNX_MODEL_PATH, OPTIMIZED_MODEL_PATH, optimization_config=optimization_config)
-            optimizer.model.config.save_pretrained(OPTIMIZED_BASE_PATH)
-        model = ORTModelForSequenceClassification.from_pretrained(
-            OPTIMIZED_BASE_PATH, file_name=OPTIMIZED_MODEL_PATH.name
-        )
-        pipeline = ort_pipeline("text-classification", tokenizer=st.session_state["tokenizer"], model=model)
-    elif pipeline_name == "ort_quantized_pipeline":
-        if not QUANTIZED_MODEL_PATH.exists():
-            quantization_config = AutoQuantizationConfig.arm64(is_static=False, per_channel=False)
-            quantizer = ORTQuantizer.from_pretrained(HUB_MODEL_PATH, feature="sequence-classification")
-            quantizer.export(ONNX_MODEL_PATH, QUANTIZED_MODEL_PATH, quantization_config=quantization_config)
-            quantizer.model.config.save_pretrained(QUANTIZED_BASE_PATH)
-        model = ORTModelForSequenceClassification.from_pretrained(
-            QUANTIZED_BASE_PATH, file_name=QUANTIZED_MODEL_PATH.name
-        )
-        pipeline = ort_pipeline("text-classification", tokenizer=st.session_state["tokenizer"], model=model)
-    print(type(pipeline))
-    return pipeline
-        
-
-st.set_page_config(page_title="Optimum Text Classification", page_icon="⭐")
-st.title("⭐ Optimum Text Classification")
-st.subheader("Classify financial news tone with 🤗 Optimum and ONNXRuntime")
-st.markdown("""
-[![GitHub](https://img.shields.io/badge/-%23121011.svg?style=for-the-badge&logo=github&logoColor=white)](https://github.com/ChainYo)
-[![HuggingFace](https://img.shields.io/badge/-yellow.svg?style=for-the-badge&logo=data:image/svg+xml;base64,PD94bWwgdmVyc2lvbj0iMS4wIiBzdGFuZGFsb25lPSJubyI/Pgo8IURPQ1RZUEUgc3ZnIFBVQkxJQyAiLS8vVzNDLy9EVEQgU1ZHIDIwMDEwOTA0Ly9FTiIKICJodHRwOi8vd3d3LnczLm9yZy9UUi8yMDAxL1JFQy1TVkctMjAwMTA5MDQvRFREL3N2ZzEwLmR0ZCI+CjxzdmcgdmVyc2lvbj0iMS4wIiB4bWxucz0iaHR0cDovL3d3dy53My5vcmcvMjAwMC9zdmciCiB3aWR0aD0iMTc1LjAwMDAwMHB0IiBoZWlnaHQ9IjE3NS4wMDAwMDBwdCIgdmlld0JveD0iMCAwIDE3NS4wMDAwMDAgMTc1LjAwMDAwMCIKIHByZXNlcnZlQXNwZWN0UmF0aW89InhNaWRZTWlkIG1lZXQiPgoKPGcgdHJhbnNmb3JtPSJ0cmFuc2xhdGUoMC4wMDAwMDAsMTc1LjAwMDAwMCkgc2NhbGUoMC4xMDAwMDAsLTAuMTAwMDAwKSIKZmlsbD0iIzAwMDAwMCIgc3Ryb2tlPSJub25lIj4KPHBhdGggZD0iTTU2MyAxMjM2IGMtMjkgLTEzIC02MyAtNTkgLTYzIC04NiAwIC0yNiAzMyAtODAgNTIgLTg2IDE1IC00IDI2IDEKNDMgMjEgMjAgMjYgMjQgMjcgNTMgMTcgMjggLTkgMzMgLTggNDIgOCAxNyAzMiAxMSA2OSAtMTcgOTkgLTM0IDM3IC02OCA0NQotMTEwIDI3eiIvPgo8cGF0aCBkPSJNMTA2NCAxMjQwIGMtNTAgLTIwIC03NyAtODYgLTU0IC0xMzAgOSAtMTYgMTQgLTE3IDQyIC04IDI5IDEwIDMzIDkKNTUgLTE3IDIxIC0yNCAyNyAtMjYgNDggLTE3IDMxIDE0IDUxIDc2IDM2IDExNCAtMTcgNDYgLTg0IDc2IC0xMjcgNTh6Ii8+CjxwYXRoIGQ9Ik02MDAgODg4IGMwIC00OSAxNiAtOTggNTAgLTE1MSA4NSAtMTM0IDMyNSAtMTM0IDQxMCAwIDUxIDgwIDY5IDE4MwozMSAxODMgLTEwIDAgLTUwIC0xNSAtODcgLTMyIC02MCAtMjkgLTc5IC0zMyAtMTQ5IC0zMyAtNzAgMCAtODkgNCAtMTQ5IDMzCi0zNyAxNyAtNzcgMzIgLTg3IDMyIC0xNSAwIC0xOSAtNyAtMTkgLTMyeiIvPgo8L2c+Cjwvc3ZnPgo=)](https://huggingface.co/ChainYo)
-[![LinkedIn](https://img.shields.io/badge/-%230077B5.svg?style=for-the-badge&logo=linkedin&logoColor=white)](https://www.linkedin.com/in/thomas-chaigneau-dev/)
-[![Discord](https://img.shields.io/badge/Chainyo%233610-%237289DA.svg?style=for-the-badge&logo=discord&logoColor=white)](https://discord.gg/)
-""")
-
-with st.expander("⭐ Details", expanded=True):
-    st.markdown(
-        """
-        This app is a **demo** of the [🤗 Optimum Text Classification](https://huggingface.co/docs/optimum/onnxruntime/modeling_ort#optimum-inference-with-onnx-runtime) pipeline.
-        We aim to compare the original pipeline with the ONNXRuntime pipeline.
-
-        We use the [Finbert-Tone](https://huggingface.co/yiyanghkust/finbert-tone) model to classify financial news tone for the demo.
-        
-        You can enter multiple sentences to classify them by separating them with a `; (semicolon)`.
-        """
-    )
-
-if "init_models" not in st.session_state:
-    st.session_state["init_models"] = True
-if st.session_state["init_models"]:
-    with st.spinner(text="Loading files and models..."):
-        loading_logs = st.empty()
-        with loading_logs.container():
-            BASE_PATH.mkdir(exist_ok=True)
-            QUANTIZED_BASE_PATH.mkdir(exist_ok=True)
-            OPTIMIZED_BASE_PATH.mkdir(exist_ok=True)
-
-            if "tokenizer" not in st.session_state:
-                tokenizer = BertTokenizer.from_pretrained(HUB_MODEL_PATH)
-                st.session_state["tokenizer"] = tokenizer
-            st.text("✅ Tokenizer loaded.")
-            if "pipeline" not in st.session_state:
-                for pipeline in VAR2LABEL.keys():
-                    st.session_state["pipeline"] = load_pipeline(pipeline)
-            st.text("✅ Models ready.")
-        sleep(2)
-        loading_logs.success("🎉 Everything is ready!")
-st.session_state["init_models"] = False
-
-if "inference_timers" not in st.session_state:
-    st.session_state["inference_timers"] = {}
-
-exp_number = st.slider("The number of experiments per model.", min_value=10, max_value=300, value=150)
-get_only_mean = st.checkbox("Get only the mean of the inference time for each model.", value=False)
-input_text = st.text_area(
-    "Enter text to classify", 
-    "there is a shortage of capital, and we need extra financing; growth is strong and we have plenty of liquidity; there are doubts about our finances; profits are flat"
-)
-run_inference = st.button("🚀 Run inference")
-
-if run_inference:
-    st.text("🔎 Running inference...")
-    sentences = input_text.split(";")
-    st.session_state["inference_timers"] = get_timers(samples=sentences, exp_number=exp_number, only_mean=get_only_mean)
-    st.plotly_chart(get_plot(st.session_state["inference_timers"]), use_container_width=True)
diff --git a/spaces/charles0519/ChuanhuChatGPT/llama_func.py b/spaces/charles0519/ChuanhuChatGPT/llama_func.py
deleted file mode 100644
index c71027dd4e6f99c0c12626cbbf276f407877be04..0000000000000000000000000000000000000000
--- a/spaces/charles0519/ChuanhuChatGPT/llama_func.py
+++ /dev/null
@@ -1,192 +0,0 @@
-import os
-import logging
-
-from llama_index import GPTSimpleVectorIndex
-from llama_index import download_loader
-from llama_index import (
-    Document,
-    LLMPredictor,
-    PromptHelper,
-    QuestionAnswerPrompt,
-    RefinePrompt,
-)
-from langchain.llms import OpenAI
-import colorama
-
-
-from presets import *
-from utils import *
-
-
-def get_documents(file_src):
-    documents = []
-    index_name = ""
-    logging.debug("Loading documents...")
-    logging.debug(f"file_src: {file_src}")
-    for file in file_src:
-        logging.debug(f"file: {file.name}")
-        index_name += file.name
-        if os.path.splitext(file.name)[1] == ".pdf":
-            logging.debug("Loading PDF...")
-            CJKPDFReader = download_loader("CJKPDFReader")
-            loader = CJKPDFReader()
-            documents += loader.load_data(file=file.name)
-        elif os.path.splitext(file.name)[1] == ".docx":
-            logging.debug("Loading DOCX...")
-            DocxReader = download_loader("DocxReader")
-            loader = DocxReader()
-            documents += loader.load_data(file=file.name)
-        elif os.path.splitext(file.name)[1] == ".epub":
-            logging.debug("Loading EPUB...")
-            EpubReader = download_loader("EpubReader")
-            loader = EpubReader()
-            documents += loader.load_data(file=file.name)
-        else:
-            logging.debug("Loading text file...")
-            with open(file.name, "r", encoding="utf-8") as f:
-                text = add_space(f.read())
-                documents += [Document(text)]
-    index_name = sha1sum(index_name)
-    return documents, index_name
-
-
-def construct_index(
-    api_key,
-    file_src,
-    max_input_size=4096,
-    num_outputs=1,
-    max_chunk_overlap=20,
-    chunk_size_limit=600,
-    embedding_limit=None,
-    separator=" ",
-    num_children=10,
-    max_keywords_per_chunk=10,
-):
-    os.environ["OPENAI_API_KEY"] = api_key
-    chunk_size_limit = None if chunk_size_limit == 0 else chunk_size_limit
-    embedding_limit = None if embedding_limit == 0 else embedding_limit
-    separator = " " if separator == "" else separator
-
-    llm_predictor = LLMPredictor(
-        llm=OpenAI(model_name="gpt-3.5-turbo-0301", openai_api_key=api_key)
-    )
-    prompt_helper = PromptHelper(
-        max_input_size,
-        num_outputs,
-        max_chunk_overlap,
-        embedding_limit,
-        chunk_size_limit,
-        separator=separator,
-    )
-    documents, index_name = get_documents(file_src)
-    if os.path.exists(f"./index/{index_name}.json"):
-        logging.info("找到了缓存的索引文件，加载中……")
-        return GPTSimpleVectorIndex.load_from_disk(f"./index/{index_name}.json")
-    else:
-        try:
-            logging.debug("构建索引中……")
-            index = GPTSimpleVectorIndex(
-                documents, llm_predictor=llm_predictor, prompt_helper=prompt_helper
-            )
-            os.makedirs("./index", exist_ok=True)
-            index.save_to_disk(f"./index/{index_name}.json")
-            return index
-        except Exception as e:
-            print(e)
-            return None
-
-
-def chat_ai(
-    api_key,
-    index,
-    question,
-    context,
-    chatbot,
-):
-    os.environ["OPENAI_API_KEY"] = api_key
-
-    logging.info(f"Question: {question}")
-
-    response, chatbot_display, status_text = ask_ai(
-        api_key,
-        index,
-        question,
-        replace_today(PROMPT_TEMPLATE),
-        REFINE_TEMPLATE,
-        SIM_K,
-        INDEX_QUERY_TEMPRATURE,
-        context,
-    )
-    if response is None:
-        status_text = "查询失败，请换个问法试试"
-        return context, chatbot
-    response = response
-
-    context.append({"role": "user", "content": question})
-    context.append({"role": "assistant", "content": response})
-    chatbot.append((question, chatbot_display))
-
-    os.environ["OPENAI_API_KEY"] = ""
-    return context, chatbot, status_text
-
-
-def ask_ai(
-    api_key,
-    index,
-    question,
-    prompt_tmpl,
-    refine_tmpl,
-    sim_k=1,
-    temprature=0,
-    prefix_messages=[],
-):
-    os.environ["OPENAI_API_KEY"] = api_key
-
-    logging.debug("Index file found")
-    logging.debug("Querying index...")
-    llm_predictor = LLMPredictor(
-        llm=OpenAI(
-            temperature=temprature,
-            model_name="gpt-3.5-turbo-0301",
-            prefix_messages=prefix_messages,
-        )
-    )
-
-    response = None  # Initialize response variable to avoid UnboundLocalError
-    qa_prompt = QuestionAnswerPrompt(prompt_tmpl)
-    rf_prompt = RefinePrompt(refine_tmpl)
-    response = index.query(
-        question,
-        llm_predictor=llm_predictor,
-        similarity_top_k=sim_k,
-        text_qa_template=qa_prompt,
-        refine_template=rf_prompt,
-        response_mode="compact",
-    )
-
-    if response is not None:
-        logging.info(f"Response: {response}")
-        ret_text = response.response
-        nodes = []
-        for index, node in enumerate(response.source_nodes):
-            brief = node.source_text[:25].replace("\n", "")
-            nodes.append(
-                f"<details><summary>[{index+1}]\t{brief}...</summary><p>{node.source_text}</p></details>"
-            )
-        new_response = ret_text + "\n----------\n" + "\n\n".join(nodes)
-        logging.info(
-            f"Response: {colorama.Fore.BLUE}{ret_text}{colorama.Style.RESET_ALL}"
-        )
-        os.environ["OPENAI_API_KEY"] = ""
-        return ret_text, new_response, f"查询消耗了{llm_predictor.last_token_usage} tokens"
-    else:
-        logging.warning("No response found, returning None")
-        os.environ["OPENAI_API_KEY"] = ""
-        return None
-
-
-def add_space(text):
-    punctuations = {"，": "， ", "。": "。 ", "？": "？ ", "！": "！ ", "：": "： ", "；": "； "}
-    for cn_punc, en_punc in punctuations.items():
-        text = text.replace(cn_punc, en_punc)
-    return text
diff --git a/spaces/chendl/compositional_test/multimodal/YOLOX/demo/OpenVINO/cpp/README.md b/spaces/chendl/compositional_test/multimodal/YOLOX/demo/OpenVINO/cpp/README.md
deleted file mode 100644
index c877d94c2834da117c49df41aa936614c175c6df..0000000000000000000000000000000000000000
--- a/spaces/chendl/compositional_test/multimodal/YOLOX/demo/OpenVINO/cpp/README.md
+++ /dev/null
@@ -1,97 +0,0 @@
-# YOLOX-OpenVINO in C++
-
-This tutorial includes a C++ demo for OpenVINO, as well as some converted models.
-
-### Download OpenVINO models.
-
-| Model | Parameters | GFLOPs | Test Size | mAP | Weights |
-|:------| :----: | :----: | :---: | :---: | :---: |
-|  [YOLOX-Nano](../../../exps/default/nano.py) |  0.91M  | 1.08 | 416x416 | 25.8 | [github](https://github.com/Megvii-BaseDetection/YOLOX/releases/download/0.1.1rc0/yolox_nano_openvino.tar.gz) |
-|  [YOLOX-Tiny](../../../exps/default/yolox_tiny.py) | 5.06M     | 6.45 | 416x416 |32.8 | [github](https://github.com/Megvii-BaseDetection/YOLOX/releases/download/0.1.1rc0/yolox_tiny_openvino.tar.gz) |
-|  [YOLOX-S](../../../exps/default/yolox_s.py) | 9.0M | 26.8 | 640x640 |40.5 | [github](https://github.com/Megvii-BaseDetection/YOLOX/releases/download/0.1.1rc0/yolox_s_openvino.tar.gz) |
-|  [YOLOX-M](../../../exps/default/yolox_m.py) | 25.3M | 73.8 | 640x640 |47.2 | [github](https://github.com/Megvii-BaseDetection/YOLOX/releases/download/0.1.1rc0/yolox_m_openvino.tar.gz) |
-|  [YOLOX-L](../../../exps/default/yolox_l.py) | 54.2M | 155.6 | 640x640 |50.1 | [github](https://github.com/Megvii-BaseDetection/YOLOX/releases/download/0.1.1rc0/yolox_l_openvino.tar.gz) |
-|  [YOLOX-Darknet53](../../../exps/default/yolov3.py) | 63.72M | 185.3 | 640x640 |48.0 | [github](https://github.com/Megvii-BaseDetection/YOLOX/releases/download/0.1.1rc0/yolox_dark_openvino.tar.gz) | 
-|  [YOLOX-X](../../../exps/default/yolox_x.py) | 99.1M | 281.9 | 640x640 |51.5 | [github](https://github.com/Megvii-BaseDetection/YOLOX/releases/download/0.1.1rc0/yolox_x_openvino.tar.gz) |
-
-## Install OpenVINO Toolkit
-
-Please visit [Openvino Homepage](https://docs.openvinotoolkit.org/latest/get_started_guides.html) for more details.
-
-## Set up the Environment
-
-### For Linux
-
-**Option1. Set up the environment tempororally. You need to run this command everytime you start a new shell window.**
-
-```shell
-source /opt/intel/openvino_2021/bin/setupvars.sh
-```
-
-**Option2. Set up the environment permenantly.**
-
-*Step1.* For Linux:
-```shell
-vim ~/.bashrc 
-```
-
-*Step2.* Add the following line into your file:
-
-```shell
-source /opt/intel/openvino_2021/bin/setupvars.sh
-```
-
-*Step3.* Save and exit the file, then run:
-
-```shell
-source ~/.bashrc
-```
-
-
-## Convert model
-
-1. Export ONNX model
-   
-   Please refer to the [ONNX tutorial](../../ONNXRuntime). **Note that you should set --opset to 10, otherwise your next step will fail.**
-
-2. Convert ONNX to OpenVINO 
-
-   ``` shell
-   cd <INSTSLL_DIR>/openvino_2021/deployment_tools/model_optimizer
-   ```
-
-   Install requirements for convert tool
-
-   ```shell
-   sudo ./install_prerequisites/install_prerequisites_onnx.sh
-   ```
-
-   Then convert model.
-   ```shell
-   python3 mo.py --input_model <ONNX_MODEL> --input_shape <INPUT_SHAPE> [--data_type FP16]
-   ```
-   For example:
-   ```shell
-   python3 mo.py --input_model yolox_tiny.onnx --input_shape [1,3,416,416] --data_type FP16
-   ```  
-
-   Make sure the input shape is consistent with [those](yolox_openvino.cpp#L24-L25) in cpp file. 
-
-## Build 
-
-### Linux
-```shell
-source /opt/intel/openvino_2021/bin/setupvars.sh
-mkdir build
-cd build
-cmake ..
-make
-```
-
-## Demo
-
-### c++
-
-```shell
-./yolox_openvino <XML_MODEL_PATH> <IMAGE_PATH> <DEVICE>
-```
diff --git a/spaces/chendl/compositional_test/multimodal/YOLOX/yolox/core/launch.py b/spaces/chendl/compositional_test/multimodal/YOLOX/yolox/core/launch.py
deleted file mode 100644
index 9f8eec61e379f7a4179536742c16609d240b55d6..0000000000000000000000000000000000000000
--- a/spaces/chendl/compositional_test/multimodal/YOLOX/yolox/core/launch.py
+++ /dev/null
@@ -1,147 +0,0 @@
-#!/usr/bin/env python3
-# -*- coding:utf-8 -*-
-# Code are based on
-# https://github.com/facebookresearch/detectron2/blob/master/detectron2/engine/launch.py
-# Copyright (c) Facebook, Inc. and its affiliates.
-# Copyright (c) Megvii, Inc. and its affiliates.
-
-import sys
-from datetime import timedelta
-from loguru import logger
-
-import torch
-import torch.distributed as dist
-import torch.multiprocessing as mp
-
-import yolox.utils.dist as comm
-
-__all__ = ["launch"]
-
-
-DEFAULT_TIMEOUT = timedelta(minutes=30)
-
-
-def _find_free_port():
-    """
-    Find an available port of current machine / node.
-    """
-    import socket
-
-    sock = socket.socket(socket.AF_INET, socket.SOCK_STREAM)
-    # Binding to port 0 will cause the OS to find an available port for us
-    sock.bind(("", 0))
-    port = sock.getsockname()[1]
-    sock.close()
-    # NOTE: there is still a chance the port could be taken by other processes.
-    return port
-
-
-def launch(
-    main_func,
-    num_gpus_per_machine,
-    num_machines=1,
-    machine_rank=0,
-    backend="nccl",
-    dist_url=None,
-    args=(),
-    timeout=DEFAULT_TIMEOUT,
-):
-    """
-    Args:
-        main_func: a function that will be called by `main_func(*args)`
-        num_machines (int): the total number of machines
-        machine_rank (int): the rank of this machine (one per machine)
-        dist_url (str): url to connect to for distributed training, including protocol
-                       e.g. "tcp://127.0.0.1:8686".
-                       Can be set to auto to automatically select a free port on localhost
-        args (tuple): arguments passed to main_func
-    """
-    world_size = num_machines * num_gpus_per_machine
-    if world_size > 1:
-        # https://github.com/pytorch/pytorch/pull/14391
-        # TODO prctl in spawned processes
-
-        if dist_url == "auto":
-            assert (
-                num_machines == 1
-            ), "dist_url=auto cannot work with distributed training."
-            port = _find_free_port()
-            dist_url = f"tcp://127.0.0.1:{port}"
-
-        start_method = "spawn"
-        cache = vars(args[1]).get("cache", False)
-
-        # To use numpy memmap for caching image into RAM, we have to use fork method
-        if cache:
-            assert sys.platform != "win32", (
-                "As Windows platform doesn't support fork method, "
-                "do not add --cache in your training command."
-            )
-            start_method = "fork"
-
-        mp.start_processes(
-            _distributed_worker,
-            nprocs=num_gpus_per_machine,
-            args=(
-                main_func,
-                world_size,
-                num_gpus_per_machine,
-                machine_rank,
-                backend,
-                dist_url,
-                args,
-            ),
-            daemon=False,
-            start_method=start_method,
-        )
-    else:
-        main_func(*args)
-
-
-def _distributed_worker(
-    local_rank,
-    main_func,
-    world_size,
-    num_gpus_per_machine,
-    machine_rank,
-    backend,
-    dist_url,
-    args,
-    timeout=DEFAULT_TIMEOUT,
-):
-    assert (
-        torch.cuda.is_available()
-    ), "cuda is not available. Please check your installation."
-    global_rank = machine_rank * num_gpus_per_machine + local_rank
-    logger.info("Rank {} initialization finished.".format(global_rank))
-    try:
-        dist.init_process_group(
-            backend=backend,
-            init_method=dist_url,
-            world_size=world_size,
-            rank=global_rank,
-            timeout=timeout,
-        )
-    except Exception:
-        logger.error("Process group URL: {}".format(dist_url))
-        raise
-
-    # Setup the local process group (which contains ranks within the same machine)
-    assert comm._LOCAL_PROCESS_GROUP is None
-    num_machines = world_size // num_gpus_per_machine
-    for i in range(num_machines):
-        ranks_on_i = list(
-            range(i * num_gpus_per_machine, (i + 1) * num_gpus_per_machine)
-        )
-        pg = dist.new_group(ranks_on_i)
-        if i == machine_rank:
-            comm._LOCAL_PROCESS_GROUP = pg
-
-    # synchronize is needed here to prevent a possible timeout after calling init_process_group
-    # See: https://github.com/facebookresearch/maskrcnn-benchmark/issues/172
-    comm.synchronize()
-
-    assert num_gpus_per_machine <= torch.cuda.device_count()
-    torch.cuda.set_device(local_rank)
-
-    main_func(*args)
diff --git a/spaces/chendl/compositional_test/transformers/examples/research_projects/visual_bert/README.md b/spaces/chendl/compositional_test/transformers/examples/research_projects/visual_bert/README.md
deleted file mode 100644
index ec197ce5f350aaf20b9a1533f3a836053d8d420c..0000000000000000000000000000000000000000
--- a/spaces/chendl/compositional_test/transformers/examples/research_projects/visual_bert/README.md
+++ /dev/null
@@ -1,6 +0,0 @@
-# VisualBERT Demo
-
-This demo shows usage of VisualBERT VQA model and is adapted from LXMERT demo present [here](https://github.com/huggingface/transformers/blob/main/examples/research_projects/lxmert/demo.ipynb).
-1. make a virtualenv: ``virtualenv venv`` and activate ``source venv/bin/activate``
-2. install reqs: ``pip install -r ./requirements.txt``
-3. usage is as shown in demo.ipynb
diff --git a/spaces/chikoto/Umamusume-DeBERTa-VITS2-TTS-JP/monotonic_align/__init__.py b/spaces/chikoto/Umamusume-DeBERTa-VITS2-TTS-JP/monotonic_align/__init__.py
deleted file mode 100644
index aed94600a6b01f4322b371b0c57d5b05713c4dac..0000000000000000000000000000000000000000
--- a/spaces/chikoto/Umamusume-DeBERTa-VITS2-TTS-JP/monotonic_align/__init__.py
+++ /dev/null
@@ -1,16 +0,0 @@
-from numpy import zeros, int32, float32
-from torch import from_numpy
-
-from .core import maximum_path_jit
-
-
-def maximum_path(neg_cent, mask):
-    device = neg_cent.device
-    dtype = neg_cent.dtype
-    neg_cent = neg_cent.data.cpu().numpy().astype(float32)
-    path = zeros(neg_cent.shape, dtype=int32)
-
-    t_t_max = mask.sum(1)[:, 0].data.cpu().numpy().astype(int32)
-    t_s_max = mask.sum(2)[:, 0].data.cpu().numpy().astype(int32)
-    maximum_path_jit(path, neg_cent, t_t_max, t_s_max)
-    return from_numpy(path).to(device=device, dtype=dtype)
diff --git a/spaces/chuan-hd/law-assistant-chatbot/.venv/include/site/python3.11/greenlet.h b/spaces/chuan-hd/law-assistant-chatbot/.venv/include/site/python3.11/greenlet.h
deleted file mode 100644
index d02a16e43426fb1c1bb286f1cda463cb9b1185ad..0000000000000000000000000000000000000000
--- a/spaces/chuan-hd/law-assistant-chatbot/.venv/include/site/python3.11/greenlet.h
+++ /dev/null
@@ -1,164 +0,0 @@
-/* -*- indent-tabs-mode: nil; tab-width: 4; -*- */
-
-/* Greenlet object interface */
-
-#ifndef Py_GREENLETOBJECT_H
-#define Py_GREENLETOBJECT_H
-
-
-#include <Python.h>
-
-#ifdef __cplusplus
-extern "C" {
-#endif
-
-/* This is deprecated and undocumented. It does not change. */
-#define GREENLET_VERSION "1.0.0"
-
-#ifndef GREENLET_MODULE
-#define implementation_ptr_t void*
-#endif
-
-typedef struct _greenlet {
-    PyObject_HEAD
-    PyObject* weakreflist;
-    PyObject* dict;
-    implementation_ptr_t pimpl;
-} PyGreenlet;
-
-#define PyGreenlet_Check(op) (op && PyObject_TypeCheck(op, &PyGreenlet_Type))
-
-
-/* C API functions */
-
-/* Total number of symbols that are exported */
-#define PyGreenlet_API_pointers 12
-
-#define PyGreenlet_Type_NUM 0
-#define PyExc_GreenletError_NUM 1
-#define PyExc_GreenletExit_NUM 2
-
-#define PyGreenlet_New_NUM 3
-#define PyGreenlet_GetCurrent_NUM 4
-#define PyGreenlet_Throw_NUM 5
-#define PyGreenlet_Switch_NUM 6
-#define PyGreenlet_SetParent_NUM 7
-
-#define PyGreenlet_MAIN_NUM 8
-#define PyGreenlet_STARTED_NUM 9
-#define PyGreenlet_ACTIVE_NUM 10
-#define PyGreenlet_GET_PARENT_NUM 11
-
-#ifndef GREENLET_MODULE
-/* This section is used by modules that uses the greenlet C API */
-static void** _PyGreenlet_API = NULL;
-
-#    define PyGreenlet_Type \
-        (*(PyTypeObject*)_PyGreenlet_API[PyGreenlet_Type_NUM])
-
-#    define PyExc_GreenletError \
-        ((PyObject*)_PyGreenlet_API[PyExc_GreenletError_NUM])
-
-#    define PyExc_GreenletExit \
-        ((PyObject*)_PyGreenlet_API[PyExc_GreenletExit_NUM])
-
-/*
- * PyGreenlet_New(PyObject *args)
- *
- * greenlet.greenlet(run, parent=None)
- */
-#    define PyGreenlet_New                                        \
-        (*(PyGreenlet * (*)(PyObject * run, PyGreenlet * parent)) \
-             _PyGreenlet_API[PyGreenlet_New_NUM])
-
-/*
- * PyGreenlet_GetCurrent(void)
- *
- * greenlet.getcurrent()
- */
-#    define PyGreenlet_GetCurrent \
-        (*(PyGreenlet * (*)(void)) _PyGreenlet_API[PyGreenlet_GetCurrent_NUM])
-
-/*
- * PyGreenlet_Throw(
- *         PyGreenlet *greenlet,
- *         PyObject *typ,
- *         PyObject *val,
- *         PyObject *tb)
- *
- * g.throw(...)
- */
-#    define PyGreenlet_Throw                 \
-        (*(PyObject * (*)(PyGreenlet * self, \
-                          PyObject * typ,    \
-                          PyObject * val,    \
-                          PyObject * tb))    \
-             _PyGreenlet_API[PyGreenlet_Throw_NUM])
-
-/*
- * PyGreenlet_Switch(PyGreenlet *greenlet, PyObject *args)
- *
- * g.switch(*args, **kwargs)
- */
-#    define PyGreenlet_Switch                                              \
-        (*(PyObject *                                                      \
-           (*)(PyGreenlet * greenlet, PyObject * args, PyObject * kwargs)) \
-             _PyGreenlet_API[PyGreenlet_Switch_NUM])
-
-/*
- * PyGreenlet_SetParent(PyObject *greenlet, PyObject *new_parent)
- *
- * g.parent = new_parent
- */
-#    define PyGreenlet_SetParent                                 \
-        (*(int (*)(PyGreenlet * greenlet, PyGreenlet * nparent)) \
-             _PyGreenlet_API[PyGreenlet_SetParent_NUM])
-
-/*
- * PyGreenlet_GetParent(PyObject* greenlet)
- *
- * return greenlet.parent;
- *
- * This could return NULL even if there is no exception active.
- * If it does not return NULL, you are responsible for decrementing the
- * reference count.
- */
-#     define PyGreenlet_GetParent                                    \
-    (*(PyGreenlet* (*)(PyGreenlet*))                                 \
-     _PyGreenlet_API[PyGreenlet_GET_PARENT_NUM])
-
-/*
- * deprecated, undocumented alias.
- */
-#     define PyGreenlet_GET_PARENT PyGreenlet_GetParent
-
-#     define PyGreenlet_MAIN                                         \
-    (*(int (*)(PyGreenlet*))                                         \
-     _PyGreenlet_API[PyGreenlet_MAIN_NUM])
-
-#     define PyGreenlet_STARTED                                      \
-    (*(int (*)(PyGreenlet*))                                         \
-     _PyGreenlet_API[PyGreenlet_STARTED_NUM])
-
-#     define PyGreenlet_ACTIVE                                       \
-    (*(int (*)(PyGreenlet*))                                         \
-     _PyGreenlet_API[PyGreenlet_ACTIVE_NUM])
-
-
-
-
-/* Macro that imports greenlet and initializes C API */
-/* NOTE: This has actually moved to ``greenlet._greenlet._C_API``, but we
-   keep the older definition to be sure older code that might have a copy of
-   the header still works. */
-#    define PyGreenlet_Import()                                               \
-        {                                                                     \
-            _PyGreenlet_API = (void**)PyCapsule_Import("greenlet._C_API", 0); \
-        }
-
-#endif /* GREENLET_MODULE */
-
-#ifdef __cplusplus
-}
-#endif
-#endif /* !Py_GREENLETOBJECT_H */
diff --git a/spaces/chuan-hd/law-assistant-chatbot/.venv/lib/python3.11/site-packages/fontTools/feaLib/location.py b/spaces/chuan-hd/law-assistant-chatbot/.venv/lib/python3.11/site-packages/fontTools/feaLib/location.py
deleted file mode 100644
index 50f761d2d2a13bd101a7db9c259fedc98eed52cf..0000000000000000000000000000000000000000
--- a/spaces/chuan-hd/law-assistant-chatbot/.venv/lib/python3.11/site-packages/fontTools/feaLib/location.py
+++ /dev/null
@@ -1,12 +0,0 @@
-from typing import NamedTuple
-
-
-class FeatureLibLocation(NamedTuple):
-    """A location in a feature file"""
-
-    file: str
-    line: int
-    column: int
-
-    def __str__(self):
-        return f"{self.file}:{self.line}:{self.column}"
diff --git a/spaces/cihyFjudo/fairness-paper-search/Alexandra Stan Playboy Pictures UPD.md b/spaces/cihyFjudo/fairness-paper-search/Alexandra Stan Playboy Pictures UPD.md
deleted file mode 100644
index dfb823cc2afec115e1ca8de6ddaf08cb2303cf63..0000000000000000000000000000000000000000
--- a/spaces/cihyFjudo/fairness-paper-search/Alexandra Stan Playboy Pictures UPD.md	
+++ /dev/null
@@ -1,5 +0,0 @@
-<br />
-<p>Below you can find your search result for <strong>alexandra stan</strong>. Since you are a big fan of alexandra stan pictures I would suggest to also visit my friend sites and get more <strong>free sex pictures</strong> of alexandra stan over there in case you already checked all alexandra stan sex picture galleries here at Fooxy Babes.</p>
-<h2>alexandra stan playboy pictures</h2><br /><p><b><b>Download Zip</b> &#10084; <a href="https://tinurli.com/2uwhCR">https://tinurli.com/2uwhCR</a></b></p><br /><br /> aaccfb2cb3<br />
-<br />
-<br />
\ No newline at end of file
diff --git a/spaces/cihyFjudo/fairness-paper-search/Free Download Salaam-E-Ishq In Hindi Dubbed Torrent.md b/spaces/cihyFjudo/fairness-paper-search/Free Download Salaam-E-Ishq In Hindi Dubbed Torrent.md
deleted file mode 100644
index e0dda17748ca9067bf718bbc88335b38bdf874a1..0000000000000000000000000000000000000000
--- a/spaces/cihyFjudo/fairness-paper-search/Free Download Salaam-E-Ishq In Hindi Dubbed Torrent.md	
+++ /dev/null
@@ -1,6 +0,0 @@
-<h2>Free Download Salaam-E-Ishq In Hindi Dubbed Torrent</h2><br /><p><b><b>Download File</b> &#10003; <a href="https://tinurli.com/2uwj3o">https://tinurli.com/2uwj3o</a></b></p><br /><br />
-<br />
- aaccfb2cb3<br />
-<br />
-<br />
-<p></p>
diff --git a/spaces/cihyFjudo/fairness-paper-search/Kaspersky Registration Key [UPDATED].md b/spaces/cihyFjudo/fairness-paper-search/Kaspersky Registration Key [UPDATED].md
deleted file mode 100644
index 4aeedc8056fed222eb01b8b631889a0d3eb7314f..0000000000000000000000000000000000000000
--- a/spaces/cihyFjudo/fairness-paper-search/Kaspersky Registration Key [UPDATED].md	
+++ /dev/null
@@ -1,14 +0,0 @@
-
-<p>Kaspersky Lab offers another way to activate software on a new computer, without needing to enter your activation code or license key, by using the website my.kaspersky.com. To use this method, you will first need to create an account and then connect your application to your account.</p>
-<p>In 2022 March Kaspersky received a cyber immunity registration trademark in the United States. The registration gives Kaspersky the exclusive right to use Kaspersky Cyber Immunity to identify it's products. It also confirms that the trademark has distinctive features checked against specific criteria by national government agencies.[95]</p>
-<h2>Kaspersky registration key</h2><br /><p><b><b>Download File</b> &gt;&gt;&gt;&gt;&gt; <a href="https://tinurli.com/2uwhQ9">https://tinurli.com/2uwhQ9</a></b></p><br /><br />
-<p>When you disable self defense in settings, make sure you click "ok" to confirm otherwise you will get that error message. I made the same mistake and I ended up having a BSOD problem. (Did a quick recovery, reistalled kaspersky and followed these steps) Now it's rolling well.</p>
-<p>1.Disable the self defence<br />2. change the product status to "Release" from "Beta" in the registry.<br />3.reboot the computer<br />4.Now it ask to activate the kaspersky..!<br />5.Now do the same registry hack..! by changing product status "Release" to "Beta"...</p>
-<p>i spent couple of hours to make my kaspersky full activated.finally i found this trick..it greats man..thanks a lot.may God Bless You all..if you have trick coming soon for kaspersky activation please email me...Egimbb@gmail.com</p>
-<p>1. Remove any keys you have installed.<br />2. Do the same as you would when doing the beta hack disable self defence and protection switch off kaspersky.<br />3. Change the registry key from beta to release.<br />4. Turn Kaspersky on<br />5. You will now have the option of trial version, activate your trial for 30 days.<br />6. Enable self defence and protection.<br />7. To re set the trial do the beta hack but dont try to activate the beta version cause it wont work but instead follow steps 1-6 again and you will find the option of trial version there again.</p>
-<p>Is there is any hacker in the world who can hack kaspersky registration or give me activation code of kaspersky latest version. I think there is no one in the world who can hack kaspersky activation code and give it to me. If you can help please please give it's activation code of kaspersky latest version activation code</p>
-<p>2.3. <b>Access to Product</b>. Product is provided by means of granting to User access to the web-based portal at ksc.kaspersky.com ("<b>Portal</b>") or successor URL. User will identify the username and password that are used for access to User's account on Portal. User will not share its username or password with any third party and will be responsible and liable for the acts or omissions of any person who accesses Product using passwords or access procedures provided to User. Kaspersky Lab reserves the right to refuse registration of, or to suspend or cancel, login IDs used by User to access the Product for any reason, including if User violates the terms and conditions set forth in this Agreement.</p>
-<p>ITPro is part of Future plc, an international media group and leading digital publisher. Visit our corporate site www.futureplc.com<br/>© Future Publishing Limited, Quay House, The Ambury, Bath BA1 1UA. All rights reserved. England and Wales company registration number 2008885<br/></p>
-<p></p> aaccfb2cb3<br />
-<br />
-<br />
\ No newline at end of file
diff --git a/spaces/cihyFjudo/fairness-paper-search/Master Lock Combination Using Serial Number.md b/spaces/cihyFjudo/fairness-paper-search/Master Lock Combination Using Serial Number.md
deleted file mode 100644
index 54fe56f0fa4468d5dcfec586ee71e25437a80e73..0000000000000000000000000000000000000000
--- a/spaces/cihyFjudo/fairness-paper-search/Master Lock Combination Using Serial Number.md	
+++ /dev/null
@@ -1,110 +0,0 @@
-## Master Lock Combination Using Serial Number
-
-
-
- 
-
-  
-
- 
-
-**Click Here === [https://www.google.com/url?q=https%3A%2F%2Furlca.com%2F2txld9&sa=D&sntz=1&usg=AOvVaw3\_y7b2l9tFHUpIYlCIBMCk](https://www.google.com/url?q=https%3A%2F%2Furlca.com%2F2txld9&sa=D&sntz=1&usg=AOvVaw3\_y7b2l9tFHUpIYlCIBMCk)**
-
-
-
- 
-
- 
-
- 
-
- 
-
- Here is a possible title and article for your keyword:  
-
-# How to Unlock a Master Lock with the Serial Number
-
- 
-
-If you have a Master Lock that you forgot the combination to, don't worry. You can still unlock it with the serial number. The serial number is a small number stamped on the back of the lock, usually near the bottom. Here are some steps to help you unlock your Master Lock with the serial number.
-
- 
-
-1. Find the serial number on your lock. It should be a four or five digit number. Write it down or take a picture of it.
-
-2. Visit the Master Lock website and fill out the lost combination form. You will need to provide your name, address, phone number, email address, and the serial number of your lock. You will also need to print out the form and have it notarized by a Notary Public to prove that you are the owner of the lock.
-
-3. Mail the notarized form to Master Lock Warehouse at 24 North Free Port Drive, Nogales, AZ 85621. You can also scan and email the form to [combos@masterlock.com](mailto:combos@masterlock.com). It may take up to 4-6 weeks for Master Lock to process your request and send you your combination.
-
-4. Alternatively, you can bring your lock to a Master Lock distributor or retailer and ask them to contact Master Lock on your behalf. They will need to see your lock and verify that it is not attached to anything. They may charge a fee for this service.
-
-5. Another option is to send a photo of your lock via the contact form on the Master Lock website. The photo should clearly show the serial number and that the lock is not attached to anything. Master Lock will respond in 7-10 days with your combination.
-
-
-
-Once you receive your combination, you can unlock your Master Lock by turning the dial clockwise three times, stopping on the first number, then turning counterclockwise one full turn past the first number and stopping on the second number, then turning clockwise again and stopping on the third number. Pull up on the shackle to open the lock.
-
- 
-
-If you want to change your combination, you can use the reset tool that came with your lock. Insert it into the shackle hole and turn it so that the Master logo faces you. Then rotate the dial three times clockwise to clear the old combination and enter your new one. Remove the reset tool and close the lock.
-
- 
-
-Remember to write down your combination in a safe place or use an online service like Master Lock Vault to store it securely.
-
-Here is a possible continuation of the article:  
-
-## Why Use a Master Lock with a Serial Number?
-
- 
-
-A Master Lock with a serial number is a great way to secure your belongings and valuables. Unlike other locks that have fixed combinations or keys that can be lost or stolen, a Master Lock with a serial number allows you to reset your combination or retrieve it if you forget it. This way, you can always access your lock and change your combination as often as you like.
-
- 
-
-A Master Lock with a serial number also has other benefits, such as:
-
-
-
-- It is durable and resistant to weather, rust, and corrosion.
-
-- It has a hardened steel shackle that can withstand cutting and prying.
-
-- It has a smooth dial that is easy to turn and align.
-
-- It comes in different sizes, colors, and styles to suit your preferences and needs.
-
-- It has a lifetime warranty from Master Lock.
-
-
-
-You can use a Master Lock with a serial number for various purposes, such as locking your locker, bike, shed, gate, suitcase, or storage unit. You can also use it for indoor or outdoor applications. Just make sure to choose the right size and type of lock for your intended use.
-
- 
-
-## How to Prevent Losing Your Combination
-
- 
-
-While it is possible to unlock your Master Lock with the serial number if you lose your combination, it is still better to prevent losing it in the first place. Here are some tips to help you remember your combination and avoid losing it:
-
-
-
-- Choose a combination that is easy for you to remember but hard for others to guess. You can use letters or numbers that have a personal meaning to you, such as your initials, birthday, favorite color, or pet's name.
-
-- Write down your combination in a safe place that only you can access. You can use a notebook, a sticky note, a password manager app, or an online service like Master Lock Vault. Do not write it on the lock itself or anywhere near it.
-
-- Practice opening your lock several times until you memorize your combination. You can also say it out loud or in your head as you dial it.
-
-- Change your combination regularly to keep it fresh and secure. You can use the reset tool that came with your lock to do this. Just make sure to write down your new combination and update it in your records.
-
-
-
-By following these tips, you can reduce the chances of losing your combination and having to unlock your Master Lock with the serial number. However, if you do lose it, don't panic. You can always contact Master Lock and get your combination back.
-
- dfd1c89656
-
- 
-
- 
-
diff --git a/spaces/cihyFjudo/fairness-paper-search/Microelectronic Circuits Sedra Smith 6th edition Solution Manual-torrent.348 Get Access to the Most Comprehensive and Updated Resource.md b/spaces/cihyFjudo/fairness-paper-search/Microelectronic Circuits Sedra Smith 6th edition Solution Manual-torrent.348 Get Access to the Most Comprehensive and Updated Resource.md
deleted file mode 100644
index c0dabae09b364cc2ac37a6363f088feffce00a9f..0000000000000000000000000000000000000000
--- a/spaces/cihyFjudo/fairness-paper-search/Microelectronic Circuits Sedra Smith 6th edition Solution Manual-torrent.348 Get Access to the Most Comprehensive and Updated Resource.md	
+++ /dev/null
@@ -1,6 +0,0 @@
-<h2>Microelectronic Circuits Sedra Smith 6th edition Solution Manual-torrent.348</h2><br /><p><b><b>DOWNLOAD</b> &#128279; <a href="https://tinurli.com/2uwjGP">https://tinurli.com/2uwjGP</a></b></p><br /><br />
-
- aaccfb2cb3<br />
-<br />
-<br />
-<p></p>
diff --git a/spaces/cihyFjudo/fairness-paper-search/Naked Girl Pics No Face VERIFIED.md b/spaces/cihyFjudo/fairness-paper-search/Naked Girl Pics No Face VERIFIED.md
deleted file mode 100644
index 9f9906dbfeff790cb944314824f4a515671e5451..0000000000000000000000000000000000000000
--- a/spaces/cihyFjudo/fairness-paper-search/Naked Girl Pics No Face VERIFIED.md	
+++ /dev/null
@@ -1,19 +0,0 @@
-
-<p>Lots of casual relationships begin over dating apps and text nowadays, and sending photos can be a fun way to keep the heat going strong. If you want to get pics from a special lady, keeping things classy and respectful is the key to success. Here are some pointers on how to get pics from a girl over text using clear communication, proper timing, and a little patience!</p>
-<p>1 Beautiful naked label without face<br> 2 Girls cum on the tummy<br> 3 Female pussy first -person view<br> 4 Naked boobs at home on the bed<br> 5 Naked woman without head<br> 6 Beautiful chest and flat stomach<br> 7 Naked breasts Home<br> 8 Women with shaved pubis<br> 9 Beautiful Sisechki Selfie<br> 10 Naked chest without face naked at home<br> 11 Super tits nipples selfie<br> 12 Beautiful naked women without face<br> 13 Naked body without face<br> 14 Beautiful girls cum on their stomach<br> 15 Selfies Private naked without face<br> 16 18 year old brunette naked with piercing on the mirror<br> 17 Naked women in bed without face<br> 18 Cooked beautifully<br> 19 Beautiful Japanese boobs<br> 20 Beautiful naked women without face<br> 21 MoralHexx<br> 22 Beautiful naked body sexy homemade<br> 23 Naked female breasts without face<br> 24 Beautiful naked women in the bathroom<br> 25 Girls in panties crustacean<br> 26 Exciting naked women<br> 27 Naked slender women with a press<br> 28 Modern girls nude<br> 29 Beautiful neat boobs<br> 30 Intimate parts of the female body<br> 31 Naked female charms<br> 32 Naked female body private<br> 33 Mike Dowson Anna Krivosheina<br> 34 Mary shum<br> 35 The most beautiful naked female body<br> 36 Feminine Body lines Nude<br> 37 Beautiful naked body of a woman<br> 38 Perfect female body nude<br> 39 Sleeping girls naked<br> 40 The girl folded her hands on her chest nude<br> 41 Sylvia Karuzo Mavrin naked<br> 42 Naked sports women<br> 43 Beautiful naked female body<br> 44 Sylvia Caruso Erotiac<br> 45 Beautiful female body nude<br> 46 Girl with big tits lies selfie<br> 47 Naked female charms<br> 48 The girl took a picture of the boobs<br> 49 Blonde's bare chest without face<br> 50 Girl with big tits in bed<br> 51 Beautiful naked Asians in bed<br> 52 Ordinary naked female body<br> 53 The most beautiful naked women<br> 54 Madison Scott finished on the chest<br> 55 Seductive girls nude<br> 56 Beautiful female body nude<br> 57 Beauties naked with a toy<br> 58 Erotic photos<br> 59 <br> 60 <br> 61 <br> 62 <br> 63 Nude Body No Face<br> 64 <br> 65 <br> 66 <br> 67 <br> 68</p>
-<h2>naked girl pics no face</h2><br /><p><b><b>Download Zip</b> &#128505; <a href="https://tinurli.com/2uwktK">https://tinurli.com/2uwktK</a></b></p><br /><br />
-<p>1 Beautiful naked women without face<br> 2Private selfie breast in the toilet<br> 3Sexy girls take a picture of themselves<br> 4Naked in the bathroom in front of the mirror<br> 5Beautiful erotic selfies<br> 6Huge boobs from above<br> 7Avari Rain<br> 8Self -shootings of beautiful girls nude<br> 9Tits in the hostel selfie without face<br> 10 Beautiful Sisechki Selfie<br> 11Beautiful breasts in the toilet<br> 12Took a picture of her big boobs<br> 13Celine Farach naked<br> 14Selfie Big breasts lying<br> 15Sexy selfie miniature<br> 16Selfie boobs waist -back lying on the back<br> 17Erotic selfie in bed<br> 18Erotic selfie in the entrance<br> 19Tits in the bathroom in front of the mirror<br> 20Selfies Big breasts lying<br> 21Erotic selfies of girls<br> 22 I took a picture of my chest in bed<br> 23Chrissy Stiles Tits Selfie<br> 24Ava Addams Naked Private<br> 25Neat elastic breasts<br> 26Selfie boobs with brunettes face<br> 27Salyukova Dalvina Selfie boobs<br> 28Erotic photos of girls selfie<br> 29Beautiful chest blonde selfie<br> 30View of the eyes of a girl xxx<br> 31Big boobs in front of the mirror<br> 32 Big ass in front of the mirror<br> 33Selfie Big breasts iPhone<br> 34Girls take pictures of themselves nude<br> 35Naked girls in the mirror<br> 36Original erotic selfies</p>
-<p>She was neither tall nor short, nor stout norslender; nor was she beautiful, nor was sheplain. She wore a figured lawn, cut a little lowin the back, that exposed a round, soft nuquewith a few little clinging circlets of soft, brownhair. Her hat was of white straw, cocked upon the side with a bunch of pansies, and shewore gray lisle-thread gloves. The girl seemedvery warm and kept mopping her face. Shevainly sought her fan, then she fanned herselfwith her handkerchief, and finally made an attemptto open the window. She might as wellhave tried to move the banks of Red river.</p>
-<p>The girls who came in wagons and onponies from a distance wore, for the mostpart, calico dresses and sun-bonnets. Theirfinery they brought along in pillow-slips orpinned up in sheets and towels. With thesethey at once retired to an upper room; later toappear be-ribboned and be-furbelowed; theirfaces masked with starch powder, but never atouch of rouge.</p>
-<p>THE sun was just far enough in the westto send inviting shadows. In the centreof a small field, and in the shade of ahaystack which was there, a girl lay sleeping.She had slept long and soundly, when somethingawoke her as suddenly as if it had been ablow. She opened her eyes and stared a momentup in the cloudless sky. She yawnedand stretched her long brown legs and arms,lazily. Then she arose, never minding thebits of straw that clung to her black hair, toher red bodice, and the blue cotonade skirtthat did not reach her naked ankles.</p>
-<p>One of the men - a pleasant-faced youngster- drew a sketch book from his pocket andbegan to make a picture of the girl. Shestayed motionless, her hands behind her, andher wide eyes fixed earnestly upon him.</p>
-<p>When the woman asked her again afteranother week if she were still pleased, she wasnot so sure. And again when she questionedCaline the girl turned away, and went to sitbehind the big, yellow cistern, to cry unobserved.For she knew now that it was not thegreat city and its crowds of people she hadso eagerly sought; but the pleasant-faced boy,who had made her picture that day under themulberry tree.</p>
-<p>All the morning Janie had been escorting aprocession of street Arabs up and down thestairs to view the remains. One of them - alittle girl, who had had her face washed andhad made a species of toilet for the occasion- refused to be dragged away. She stayedseated as if at an entertainment, fascinatedalternately by the long, still figure of MamzelleAglaé, the mumbling lips of Purgatory Mary,and the silver candlesticks.</p>
-<p></p>
-<p>After they quitted the store, 'Polyte, with aperplexed expression upon his face, leaned fora moment against one of the whitewashedpillars, watching the girl cross the yard. Shehad folded her sunbonnet into a pad, whichshe placed beneath the heavy pail that shebalanced upon her head. She walked upright,with a slow, careful tread. Two of the yarddogs that had stood a moment before uponthe threshold of the store door, quivering andwagging their tails, were following her now,with a little businesslike trot. 'Polyte calledthem back.</p>
-<p>Once, down the bank of the bayou, when'Polyte came upon Azélie unexpectedly, andwas therefore unprepared to resist the shockof her sudden appearance, he seized her in hisarms, and covered her face with kisses. Shewas not indignant; she was not flustered oragitated, as might have been a susceptible,coquettish girl; she was only astonished, andannoyed.</p>
-<p>The day was a warm one, but that did notprevent a creepy chilliness seizing hold of me.The feeling was generated by disappointment,anger, dismay and various other disagreeablesensations which I cannot find names for,Had I been intentionally deceived and misled?Was this some impertinent pleasantry on thepart of Cavanelle? Or rather had not thegirl's voice undergone some hideous transformationsince her brother had listened to it?I dreaded to look at him, fearing to see horrorand astonishment depicted on his face. WhenI did look, his expression was earnestly attentiveand beamed approval of the strains towhich he measured time by a slow, satisfiedmotion of the hand.</p>
-<p>Late in the afternoon she went and stood onher doorstep, and looked uneasily and anxiouslyout upon the almost deserted street.When a little girl came walking by, - a sweetchild with a frank and innocent face, uponwhose word she knew she could rely, - TanteCat'rinette invited her to enter.</p>
-<p>The main reason we keep our girl's face off line is because we believe she shouldn't end up on Facebook, or anywhere on the Internet, until she's ready. Until she wants that. That choice belongs to my daughter, and until she can tell us otherwise, we'll keep her face off the web.</p> aaccfb2cb3<br />
-<br />
-<br />
\ No newline at end of file
diff --git a/spaces/cloudtheboi/Lofi4All/.pythonlibs/lib/python3.10/site-packages/fastapi/middleware/trustedhost.py b/spaces/cloudtheboi/Lofi4All/.pythonlibs/lib/python3.10/site-packages/fastapi/middleware/trustedhost.py
deleted file mode 100644
index 08d7e035315677856fd2cd0be2044689b57619bf..0000000000000000000000000000000000000000
--- a/spaces/cloudtheboi/Lofi4All/.pythonlibs/lib/python3.10/site-packages/fastapi/middleware/trustedhost.py
+++ /dev/null
@@ -1,3 +0,0 @@
-from starlette.middleware.trustedhost import (  # noqa
-    TrustedHostMiddleware as TrustedHostMiddleware,
-)
diff --git a/spaces/colakin/video-generater/public/ffmpeg/libavcodec/arm/vc1dsp_init_arm.c b/spaces/colakin/video-generater/public/ffmpeg/libavcodec/arm/vc1dsp_init_arm.c
deleted file mode 100644
index 5f2c75904826a22cb4c5c138bc818ae817811764..0000000000000000000000000000000000000000
--- a/spaces/colakin/video-generater/public/ffmpeg/libavcodec/arm/vc1dsp_init_arm.c
+++ /dev/null
@@ -1,37 +0,0 @@
-/*
- * This file is part of FFmpeg.
- *
- * FFmpeg is free software; you can redistribute it and/or
- * modify it under the terms of the GNU Lesser General Public
- * License as published by the Free Software Foundation; either
- * version 2.1 of the License, or (at your option) any later version.
- *
- * FFmpeg is distributed in the hope that it will be useful,
- * but WITHOUT ANY WARRANTY; without even the implied warranty of
- * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
- * Lesser General Public License for more details.
- *
- * You should have received a copy of the GNU Lesser General Public
- * License along with FFmpeg; if not, write to the Free Software
- * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
- */
-
-#include <stdint.h>
-
-#include "libavutil/attributes.h"
-#include "libavutil/arm/cpu.h"
-#include "libavcodec/arm/startcode.h"
-#include "libavcodec/vc1dsp.h"
-#include "vc1dsp.h"
-
-av_cold void ff_vc1dsp_init_arm(VC1DSPContext *dsp)
-{
-    int cpu_flags = av_get_cpu_flags();
-
-#if HAVE_ARMV6
-    if (have_setend(cpu_flags))
-        dsp->startcode_find_candidate = ff_startcode_find_candidate_armv6;
-#endif
-    if (have_neon(cpu_flags))
-        ff_vc1dsp_init_neon(dsp);
-}
diff --git a/spaces/colakin/video-generater/public/ffmpeg/libavcodec/cri_parser.c b/spaces/colakin/video-generater/public/ffmpeg/libavcodec/cri_parser.c
deleted file mode 100644
index 9295f823ce5d246788f3ee8b1996abf3993d8ccc..0000000000000000000000000000000000000000
--- a/spaces/colakin/video-generater/public/ffmpeg/libavcodec/cri_parser.c
+++ /dev/null
@@ -1,105 +0,0 @@
-/*
- * CRI parser
- * Copyright (c) 2021 Paul B Mahol
- *
- * This file is part of FFmpeg.
- *
- * FFmpeg is free software; you can redistribute it and/or
- * modify it under the terms of the GNU Lesser General Public
- * License as published by the Free Software Foundation; either
- * version 2.1 of the License, or (at your option) any later version.
- *
- * FFmpeg is distributed in the hope that it will be useful,
- * but WITHOUT ANY WARRANTY; without even the implied warranty of
- * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
- * Lesser General Public License for more details.
- *
- * You should have received a copy of the GNU Lesser General Public
- * License along with FFmpeg; if not, write to the Free Software
- * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
- */
-
-/**
- * @file
- * CRI parser
- */
-
-#include "libavutil/bswap.h"
-#include "libavutil/common.h"
-
-#include "parser.h"
-
-typedef struct CRIParser {
-    ParseContext pc;
-    int count;
-    int chunk;
-    int read_bytes;
-    int skip_bytes;
-} CRIParser;
-
-#define KEY (((uint64_t)'\1' << 56) | ((uint64_t)'\0' << 48) | \
-             ((uint64_t)'\0' << 40) | ((uint64_t)'\0' << 32) | \
-             ((uint64_t)'\4' << 24) | ((uint64_t)'\0' << 16) | \
-             ((uint64_t)'\0' <<  8) | ((uint64_t)'\0' <<  0))
-
-static int cri_parse(AVCodecParserContext *s, AVCodecContext *avctx,
-                     const uint8_t **poutbuf, int *poutbuf_size,
-                     const uint8_t *buf, int buf_size)
-{
-    CRIParser *bpc = s->priv_data;
-    uint64_t state = bpc->pc.state64;
-    int next = END_NOT_FOUND, i = 0;
-
-    s->pict_type = AV_PICTURE_TYPE_I;
-    s->key_frame = 1;
-    s->duration  = 1;
-
-    *poutbuf_size = 0;
-    *poutbuf = NULL;
-
-    for (; i < buf_size; i++) {
-        state = (state << 8) | buf[i];
-        bpc->read_bytes++;
-
-        if (bpc->skip_bytes > 0) {
-            bpc->skip_bytes--;
-            if (bpc->skip_bytes == 0)
-                bpc->read_bytes = 0;
-        } else {
-            if (state != KEY)
-                continue;
-        }
-
-        if (bpc->skip_bytes == 0 && bpc->read_bytes >= 8) {
-            bpc->skip_bytes = av_bswap32(state & 0xFFFFFFFF);
-            bpc->chunk = state >> 32;
-            bpc->read_bytes = 0;
-            bpc->count++;
-        }
-
-        if (bpc->chunk == 0x01000000 && bpc->skip_bytes == 4 &&
-            bpc->read_bytes == 0 && bpc->count > 1) {
-            next = i - 7;
-            break;
-        }
-    }
-
-    bpc->pc.state64 = state;
-    if (ff_combine_frame(&bpc->pc, next, &buf, &buf_size) < 0) {
-        *poutbuf = NULL;
-        *poutbuf_size = 0;
-        return buf_size;
-    }
-
-    *poutbuf      = buf;
-    *poutbuf_size = buf_size;
-
-    return next;
-}
-
-const AVCodecParser ff_cri_parser = {
-    .codec_ids      = { AV_CODEC_ID_CRI },
-    .priv_data_size = sizeof(CRIParser),
-    .parser_parse   = cri_parse,
-    .parser_close   = ff_parse_close,
-};
diff --git a/spaces/colakin/video-generater/public/ffmpeg/libavcodec/diractab.c b/spaces/colakin/video-generater/public/ffmpeg/libavcodec/diractab.c
deleted file mode 100644
index 816b9393ba00596bc0c1e62961fd7e1195648b82..0000000000000000000000000000000000000000
--- a/spaces/colakin/video-generater/public/ffmpeg/libavcodec/diractab.c
+++ /dev/null
@@ -1,89 +0,0 @@
-/*
- * Copyright (C) 2016 Open Broadcast Systems Ltd.
- * Author    (C) 2016 Rostislav Pehlivanov <atomnuker@gmail.com>
- *
- * This file is part of FFmpeg.
- *
- * FFmpeg is free software; you can redistribute it and/or
- * modify it under the terms of the GNU Lesser General Public
- * License as published by the Free Software Foundation; either
- * version 2.1 of the License, or (at your option) any later version.
- *
- * FFmpeg is distributed in the hope that it will be useful,
- * but WITHOUT ANY WARRANTY; without even the implied warranty of
- * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
- * Lesser General Public License for more details.
- *
- * You should have received a copy of the GNU Lesser General Public
- * License along with FFmpeg; if not, write to the Free Software
- * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
- */
-
-#include "diractab.h"
-
-const uint8_t ff_dirac_default_qmat[7][4][4] = {
-    { { 5,  3,  3,  0}, { 0,  4,  4,  1}, { 0,  5,  5,  2}, { 0,  6,  6,  3} },
-    { { 4,  2,  2,  0}, { 0,  4,  4,  2}, { 0,  5,  5,  3}, { 0,  7,  7,  5} },
-    { { 5,  3,  3,  0}, { 0,  4,  4,  1}, { 0,  5,  5,  2}, { 0,  6,  6,  3} },
-    { { 8,  4,  4,  0}, { 0,  4,  4,  0}, { 0,  4,  4,  0}, { 0,  4,  4,  0} },
-    { { 8,  4,  4,  0}, { 0,  4,  4,  0}, { 0,  4,  4,  0}, { 0,  4,  4,  0} },
-    { { 0,  4,  4,  8}, { 0,  8,  8, 12}, { 0, 13, 13, 17}, { 0, 17, 17, 21} },
-    { { 3,  1,  1,  0}, { 0,  4,  4,  2}, { 0,  6,  6,  5}, { 0,  9,  9,  7} },
-};
-
-const int32_t ff_dirac_qscale_tab[116] = {
-    4,         5,         6,         7,         8,        10,        11,        13,
-    16,        19,        23,        27,        32,        38,        45,        54,
-    64,        76,        91,       108,       128,       152,       181,       215,
-    256,       304,       362,       431,       512,       609,       724,       861,
-    1024,      1218,      1448,      1722,      2048,      2435,      2896,      3444,
-    4096,      4871,      5793,      6889,      8192,      9742,     11585,     13777,
-    16384,     19484,     23170,     27554,     32768,     38968,     46341,     55109,
-    65536,     77936,     92682,    110218,    131072,    155872,    185364,    220436,
-    262144,    311744,    370728,    440872,    524288,    623487,    741455,    881744,
-    1048576,   1246974,   1482910,   1763488,   2097152,   2493948,   2965821,   3526975,
-    4194304,   4987896,   5931642,   7053950,   8388608,   9975792,  11863283,  14107901,
-    16777216,  19951585,  23726566,  28215802,  33554432,  39903169,  47453133,  56431603,
-    67108864,  79806339,  94906266, 112863206, 134217728, 159612677, 189812531, 225726413,
-    268435456, 319225354, 379625062, 451452825, 536870912, 638450708, 759250125, 902905651,
-    1073741824,1276901417,1518500250,1805811301,/*2147483648,2553802834,3037000500,3611622603,
-    4294967296*/
-};
-
-const int32_t ff_dirac_qoffset_intra_tab[120] = {
-    1,         2,         3,         4,         4,         5,         6,         7,
-    8,        10,        12,        14,        16,        19,        23,        27,
-    32,        38,        46,        54,        64,        76,        91,       108,
-    128,       152,       181,       216,       256,       305,       362,       431,
-    512,       609,       724,       861,      1024,      1218,      1448,      1722,
-    2048,      2436,      2897,      3445,      4096,      4871,      5793,      6889,
-    8192,      9742,     11585,     13777,     16384,     19484,     23171,     27555,
-    32768,     38968,     46341,     55109,     65536,     77936,     92682,    110218,
-    131072,    155872,    185364,    220436,    262144,    311744,    370728,    440872,
-    524288,    623487,    741455,    881744,   1048576,   1246974,   1482911,   1763488,
-    2097152,   2493948,   2965821,   3526975,   4194304,   4987896,   5931642,   7053951,
-    8388608,   9975793,  11863283,  14107901,  16777216,  19951585,  23726567,  28215802,
-    33554432,  39903170,  47453133,  56431603,  67108864,  79806339,  94906266, 112863207,
-    134217728, 159612677, 189812531, 225726413, 268435456, 319225354, 379625063, 451452826,
-    536870912, 638450709, 759250125, 902905651,1073741824,1276901417,1518500250,1805811302,
-    /*2147483648, 2553802834, 3037000500, 3611622603, 4294967296,*/
-};
-
-const int ff_dirac_qoffset_inter_tab[122] = {
-    1,         2,         2,         3,         3,         4,         4,         5,
-    6,         7,         9,        10,        12,        14,        17,        20,
-    24,        29,        34,        41,        48,        57,        68,        81,
-    96,       114,       136,       162,       192,       228,       272,       323,
-    384,       457,       543,       646,       768,       913,      1086,      1292,
-    1536,      1827,      2172,      2583,      3072,      3653,      4344,      5166,
-    6144,      7307,      8689,     10333,     12288,     14613,     17378,     20666,
-    24576,     29226,     34756,     41332,     49152,     58452,     69512,     82664,
-    98304,    116904,    139023,    165327,    196608,    233808,    278046,    330654,
-    393216,    467615,    556091,    661308,    786432,    935231,   1112183,   1322616,
-    1572864,   1870461,   2224366,   2645231,   3145728,   3740922,   4448731,   5290463,
-    6291456,   7481844,   8897462,  10580926,  12582912,  14963688,  17794925,  21161851,
-    25165824,  29927377,  35589850,  42323702,  50331648,  59854754,  71179699,  84647405,
-    100663296, 119709508, 142359398, 169294809, 201326592, 239419016, 284718797, 338589619,
-    402653184, 478838031, 569437594, 677179238, 805306368, 957676063,1138875188,1354358476,
-    1610612736, 1915352125, /*2277750375, 2708716952, 3221225472, 3830704250,*/
-};
diff --git a/spaces/colakin/video-generater/public/ffmpeg/libavcodec/huffyuv.c b/spaces/colakin/video-generater/public/ffmpeg/libavcodec/huffyuv.c
deleted file mode 100644
index aaba313bf11341b3f36e96297837fe9d2920431e..0000000000000000000000000000000000000000
--- a/spaces/colakin/video-generater/public/ffmpeg/libavcodec/huffyuv.c
+++ /dev/null
@@ -1,84 +0,0 @@
-/*
- * huffyuv codec for libavcodec
- *
- * Copyright (c) 2002-2014 Michael Niedermayer <michaelni@gmx.at>
- *
- * see https://multimedia.cx/huffyuv.txt for a description of
- * the algorithm used
- *
- * This file is part of FFmpeg.
- *
- * FFmpeg is free software; you can redistribute it and/or
- * modify it under the terms of the GNU Lesser General Public
- * License as published by the Free Software Foundation; either
- * version 2.1 of the License, or (at your option) any later version.
- *
- * FFmpeg is distributed in the hope that it will be useful,
- * but WITHOUT ANY WARRANTY; without even the implied warranty of
- * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
- * Lesser General Public License for more details.
- *
- * You should have received a copy of the GNU Lesser General Public
- * License along with FFmpeg; if not, write to the Free Software
- * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
- */
-
-/**
- * @file
- * huffyuv codec for libavcodec.
- */
-
-#include <stdint.h>
-
-#include "libavutil/attributes.h"
-#include "libavutil/error.h"
-#include "libavutil/log.h"
-#include "libavutil/mem.h"
-
-#include "huffyuv.h"
-
-int ff_huffyuv_generate_bits_table(uint32_t *dst, const uint8_t *len_table, int n)
-{
-    int lens[33] = { 0 };
-    uint32_t codes[33];
-
-    for (int i = 0; i < n; i++)
-        lens[len_table[i]]++;
-
-    codes[32] = 0;
-    for (int i = FF_ARRAY_ELEMS(lens) - 1; i > 0; i--) {
-        if ((lens[i] + codes[i]) & 1) {
-            av_log(NULL, AV_LOG_ERROR, "Error generating huffman table\n");
-            return -1;
-        }
-        codes[i - 1] = (lens[i] + codes[i]) >> 1;
-    }
-    for (int i = 0; i < n; i++) {
-        if (len_table[i])
-            dst[i] = codes[len_table[i]]++;
-    }
-    return 0;
-}
-
-av_cold int ff_huffyuv_alloc_temp(uint8_t *temp[3], uint16_t *temp16[3], int width)
-{
-    int i;
-
-    for (i=0; i<3; i++) {
-        temp[i] = av_malloc(4 * width + 16);
-        if (!temp[i])
-            return AVERROR(ENOMEM);
-        temp16[i] = (uint16_t*)temp[i];
-    }
-    return 0;
-}
-
-av_cold void ff_huffyuv_common_end(uint8_t *temp[3], uint16_t *temp16[3])
-{
-    int i;
-
-    for(i = 0; i < 3; i++) {
-        av_freep(&temp[i]);
-        temp16[i] = NULL;
-    }
-}
diff --git a/spaces/colakin/video-generater/public/ffmpeg/libavcodec/mips/vp3dsp_init_mips.c b/spaces/colakin/video-generater/public/ffmpeg/libavcodec/mips/vp3dsp_init_mips.c
deleted file mode 100644
index 4252ff790ea5adc7b7484f5c4ad2eb403fa1eddf..0000000000000000000000000000000000000000
--- a/spaces/colakin/video-generater/public/ffmpeg/libavcodec/mips/vp3dsp_init_mips.c
+++ /dev/null
@@ -1,50 +0,0 @@
-
-/*
- * Copyright (c) 2018 gxw <guxiwei-hf@loongson.cn>
- *
- * This file is part of FFmpeg.
- *
- * FFmpeg is free software; you can redistribute it and/or
- * modify it under the terms of the GNU Lesser General Public
- * License as published by the Free Software Foundation; either
- * version 2.1 of the License, or (at your option) any later version.
- *
- * FFmpeg is distributed in the hope that it will be useful,
- * but WITHOUT ANY WARRANTY; without even the implied warranty of
- * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
- * Lesser General Public License for more details.
- *
- * You should have received a copy of the GNU Lesser General Public
- * License along with FFmpeg; if not, write to the Free Software
- * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
- */
-
-#include "libavutil/mips/cpu.h"
-#include "config.h"
-#include "libavutil/attributes.h"
-#include "libavcodec/avcodec.h"
-#include "libavcodec/vp3dsp.h"
-#include "vp3dsp_mips.h"
-
-av_cold void ff_vp3dsp_init_mips(VP3DSPContext *c, int flags)
-{
-    int cpu_flags = av_get_cpu_flags();
-
-    if (have_mmi(cpu_flags)) {
-        c->put_no_rnd_pixels_l2 = ff_put_no_rnd_pixels_l2_mmi;
-
-        c->idct_add      = ff_vp3_idct_add_mmi;
-        c->idct_put      = ff_vp3_idct_put_mmi;
-        c->idct_dc_add   = ff_vp3_idct_dc_add_mmi;
-    }
-
-    if (have_msa(cpu_flags)) {
-        c->put_no_rnd_pixels_l2 = ff_put_no_rnd_pixels_l2_msa;
-
-        c->idct_add      = ff_vp3_idct_add_msa;
-        c->idct_put      = ff_vp3_idct_put_msa;
-        c->idct_dc_add   = ff_vp3_idct_dc_add_msa;
-        c->v_loop_filter = ff_vp3_v_loop_filter_msa;
-        c->h_loop_filter = ff_vp3_h_loop_filter_msa;
-    }
-}
diff --git a/spaces/congsaPfin/Manga-OCR/logs/Airline Manager How to Run a Successful Airline Business in 2023.md b/spaces/congsaPfin/Manga-OCR/logs/Airline Manager How to Run a Successful Airline Business in 2023.md
deleted file mode 100644
index bcf3da9d888bd702d06c38b7168c07f252227244..0000000000000000000000000000000000000000
--- a/spaces/congsaPfin/Manga-OCR/logs/Airline Manager How to Run a Successful Airline Business in 2023.md	
+++ /dev/null
@@ -1,122 +0,0 @@
-<br />
-<h1>Airline Manager: A Career Guide</h1>
-<p>Have you ever wondered what it takes to run an airline? Do you have a passion for aviation and a knack for leadership? If so, you might be interested in becoming an airline manager. An airline manager is a professional who oversees all aspects of an airline's operations, from the maintenance of the aircrafts to the satisfaction of the customers. An airline manager is responsible for ensuring the safety, efficiency, and profitability of the airline, as well as managing a team of staff. It is a challenging but rewarding career that requires a combination of education, experience, skills, and certifications.</p>
-<h2>airline manager</h2><br /><p><b><b>DOWNLOAD</b> &middot;&middot;&middot;&middot;&middot; <a href="https://urlca.com/2uO4Gw">https://urlca.com/2uO4Gw</a></b></p><br /><br />
-<h2>How to become an airline manager</h2>
-<p>To become an airline manager, you typically need to have:</p>
-<ul>
-<li><strong>Education:</strong> A bachelor's degree in aviation management, business administration, finance, or a related field. Some airlines may prefer a master's degree or a professional diploma in aviation management.</li>
-<li><strong>Experience:</strong> At least five years of experience working in the aviation industry, preferably in a supervisory or managerial role.</li>
-<li><strong>Skills:</strong> Excellent communication, negotiation, presentation, organizational, time-management, problem-solving, analytical, and decision-making skills.</li>
-<li><strong>Certifications:</strong> Depending on the position and the employer, you may need to have certain certifications or licenses, such as a pilot's license, an air traffic controller's license, or a certification from the International Air Transport Association (IATA).</li>
-</ul>
-<p>You can also gain valuable experience and knowledge by completing an internship or a training program at an airline or an airport. This can help you develop network connections in the industry and learn about the best practices and trends in aviation management.</p>
-<h2>What are the duties and responsibilities of an airline manager?</h2>
-<p>An airline manager typically has a wide range of duties and responsibilities, which can include:</p>
-<ul>
-<li><strong>Managing and maintaining the fleet of aircrafts:</strong> An airline manager ensures that all aircrafts are in good condition and comply with safety standards. They also order new aircrafts when needed and oversee their delivery and installation.</li>
-<li><strong>Ensuring safety and compliance with regulations:</strong> An airline manager ensures that all operations follow the local and federal laws and regulations regarding aviation. They also implement safety procedures and policies for staff and passengers, including emergency responses to accidents or incidents.</li>
-<li><strong>Supervising and leading staff:</strong> An airline manager manages and coordinates a team of staff, including pilots, flight attendants, ground crews, mechanics, engineers, dispatchers, customer service representatives, and others. They provide guidance, feedback, training, evaluation, motivation, and discipline to their staff.</li>
-<li><strong>Planning and coordinating flight schedules and operations:</strong> An airline manager reviews and approves flight schedules to meet the needs of passengers and cargo shipments. They also monitor flight status, weather conditions, fuel consumption, baggage handling, security checks, boarding procedures, and other aspects of flight operations.</li>
-<li><strong>Developing and implementing policies and procedures:</strong> An airline manager develops and implements policies and procedures for the airline, such as pricing, marketing, customer service, quality assurance, human resources, and environmental sustainability. They also review and update existing policies and procedures to ensure they are effective and efficient.</li>
-<li><strong>Managing budgets and finances:</strong> An airline manager prepares and manages the budget for the airline, including revenue, expenses, profits, and losses. They also oversee the financial transactions, such as payroll, taxes, invoices, contracts, and audits. They also seek ways to reduce costs and increase revenue for the airline.</li>
-<li><strong>Handling customer service and complaints:</strong> An airline manager handles customer service and complaints from passengers, clients, partners, and regulators. They respond to inquiries, requests, feedback, suggestions, and complaints in a timely and professional manner. They also resolve issues and disputes that may arise during or after the flight.</li>
-</ul>
-<h2>What are the challenges and opportunities for an airline manager?</h2>
-<p>An airline manager faces many challenges and opportunities in their career, such as:</p>
-<p>airline manager salary<br />
-airline manager job description<br />
-airline manager resume<br />
-airline manager interview questions<br />
-airline manager game<br />
-airline manager skills<br />
-airline manager training<br />
-airline manager certification<br />
-airline manager career path<br />
-airline manager duties<br />
-airline manager education requirements<br />
-airline manager cover letter<br />
-airline manager responsibilities<br />
-airline manager objectives<br />
-airline manager simulation<br />
-airline manager app<br />
-airline manager courses<br />
-airline manager degree<br />
-airline manager tips<br />
-airline manager online<br />
-airline manager software<br />
-airline manager experience<br />
-airline manager qualifications<br />
-airline manager benefits<br />
-airline manager challenges<br />
-airline manager roles<br />
-airline manager vacancies<br />
-airline manager competencies<br />
-airline manager best practices<br />
-airline manager performance indicators<br />
-airline manager portfolio<br />
-airline manager feedback<br />
-airline manager development plan<br />
-airline manager achievements<br />
-airline manager expectations<br />
-airline manager trends<br />
-airline manager insights<br />
-airline manager strategies<br />
-airline manager operations<br />
-airline manager analytics<br />
-airline manager reports<br />
-airline manager projects<br />
-airline manager reviews<br />
-airline manager testimonials<br />
-airline manager case studies<br />
-airline manager awards<br />
-airline manager innovations<br />
-airline manager solutions<br />
-airline manager outlooks</p>
-<ul>
-<li><strong>Dealing with unpredictable situations and emergencies:</strong> An airline manager has to deal with various situations and emergencies that may occur during the flight operations, such as bad weather, mechanical failures, security threats, medical emergencies, or natural disasters. They have to act quickly and calmly to ensure the safety of the staff and passengers.</li>
-<li><strong>Adapting to changing market conditions and customer demands:</strong> An airline manager has to adapt to the changing market conditions and customer demands in the aviation industry. They have to monitor the trends and competitors in the market and adjust their strategies accordingly. They also have to meet the expectations and needs of the customers and provide them with quality service and experience.</li>
-<li><strong>Leveraging technology and innovation to improve efficiency and performance:</strong> An airline manager has to leverage technology and innovation to improve the efficiency and performance of the airline. They have to use various tools and systems to manage and optimize the flight operations, such as software, databases, sensors, GPS, artificial intelligence, etc. They also have to explore new opportunities and solutions to enhance the airline's products and services.</li>
-<li><strong>Collaborating with other stakeholders in the industry:</strong> An airline manager has to collaborate with other stakeholders in the industry, such as airports, airlines, regulators, suppliers, contractors, media, etc. They have to establish and maintain good relationships with them and coordinate their activities and interests. They also have to negotiate contracts and agreements with them.</li>
-<li><strong>Pursuing professional development and career advancement:</strong> An airline manager has to pursue professional development and career advancement in their field. They have to keep up with the latest developments and innovations in the aviation industry. They also have to seek opportunities for learning new skills and knowledge. They can also advance their career by taking on higher-level positions or roles in the airline or other organizations.</li>
-</ul>
-<h2>Conclusion</h2>
-<p>An airline manager is a vital role in the aviation industry that requires a lot of education, experience, skills, and certifications. An airline manager oversees all aspects of an airline's operations, from the maintenance of the aircrafts to the satisfaction of the customers. An airline manager is responsible for ensuring the safety, efficiency, and profitability of the airline, as well as managing a team of staff. It is a challenging but rewarding career that offers many opportunities for growth and development.</p>
-<p>If you are interested in becoming an airline manager, here are some tips and advice for you:</p>
-<ul>
-<li><strong>Do your research:</strong> Learn as much as you can about the aviation industry and the role of an airline manager. Read books, articles, blogs, reports, etc. about aviation management. You can also watch videos or listen to podcasts on this topic.</li>
-<li><strong>Get educated:</strong> Pursue a degree or a diploma in aviation management or a related field. Choose a reputable institution that offers quality education and training in this field. You can also take online courses or MOOCs on aviation management.</li>
-<li><strong>Gain experience:</strong> Seek opportunities to gain experience in the aviation industry. You can apply for internships or training programs at airlines or airports. You can also volunteer or work part-time at these places. You can also join clubs or organizations related to aviation.</li>
-<li><strong>Build your network:</strong> Connect with people who work in the aviation industry or have similar interests as you. You can attend events or seminars on aviation management. You can also join online forums or groups on this topic. You can also reach out to mentors or experts who can guide you in your career path.</li>
-<li><strong>Be prepared:</strong> Prepare yourself for the challenges and opportunities that come with being an airline manager. You have to be flexible, adaptable, resilient, <|im_end creative, and proactive. You have to be able to handle stress, pressure, and uncertainty. You have to be able to communicate, negotiate, present, and lead effectively. You have to be able to learn from your mistakes and improve your performance.</li>
-</ul>
-<h2>FAQs</h2>
-<p>Here are some frequently asked questions about airline managers:</p>
-<table>
-<tr>
-<th>Question</th>
-<th>Answer</th>
-</tr>
-<tr>
-<td>How much does an airline manager earn?</td>
-<td>The average salary for an airline manager in the United States is $97,000 per year, according to Indeed.com. However, the salary may vary depending on the location, employer, experience, education, and skills of the airline manager.</td>
-</tr>
-<tr>
-<td>What are the benefits of working as an airline manager?</td>
-<td>Some of the benefits of working as an airline manager are: <ul><li>You get to work in a dynamic and exciting industry that involves traveling and meeting different people and cultures.</li><li>You get to make a positive impact on the lives of millions of passengers and customers who use your airline's services.</li><li>You get to challenge yourself and grow professionally and personally by dealing with various situations and opportunities.</li><li>You get to enjoy perks and discounts from your employer, such as free or discounted flights, hotels, car rentals, etc.</li></ul></td>
-</tr>
-<tr>
-<td>What are the drawbacks of working as an airline manager?</td>
-<td>Some of the drawbacks of working as an airline manager are: <ul><li>You have to work long and irregular hours, including weekends, holidays, and nights.</li><li>You have to deal with a lot of stress, pressure, and responsibility that comes with managing an airline's operations.</li><li>You have to cope with frequent changes and uncertainties in the aviation industry, such as market fluctuations, customer preferences, technological innovations, etc.</li><li>You have to face competition and criticism from other airlines, regulators, media, customers, etc.</li></ul></td>
-</tr>
-<tr>
-<td>What are some of the best airlines to work for as an airline manager?</td>
-<td>Some of the best airlines to work for as an airline manager are: <ul><li>Delta Air Lines: Delta is one of the largest and most successful airlines in the world. It has a strong reputation for customer service, innovation, diversity, and social responsibility. It also offers competitive compensation and benefits for its employees.</li><li>Singapore Airlines: Singapore Airlines is one of the most awarded and respected airlines in the world. It has a high standard for quality, safety, and performance. It also offers a supportive and collaborative work environment for its employees.</li><li>Southwest Airlines: Southwest Airlines is one of the most popular and profitable airlines in the United States. It has a unique culture of fun, teamwork, and customer loyalty. It also offers generous perks and incentives for its employees.</li></ul></td>
-</tr>
-<tr>
-<td>How can I improve my chances of getting hired as an airline manager?</td>
-<td>Some of the ways you can improve your chances of getting hired as an airline manager are: <ul><li>Update your resume and cover letter to highlight your education, experience, skills, and achievements related to aviation management.</li><li>Prepare for the interview by researching the airline you are applying for, practicing common questions and scenarios, dressing professionally, and being confident and courteous.</li><li>Follow up with the employer by sending a thank-you note or email after the interview, expressing your interest and enthusiasm for the position.</li><li>Showcase your portfolio or samples of your work related to aviation management, such as reports, presentations, projects, etc.</li></ul></td>
-</tr>
-</table></p> 401be4b1e0<br />
-<br />
-<br />
\ No newline at end of file
diff --git a/spaces/congsaPfin/Manga-OCR/logs/Download Anger of Stick 5 Mod Apk Uang Tak Terbatas untuk Membeli Senjata dan Menghancurkan Zombie.md b/spaces/congsaPfin/Manga-OCR/logs/Download Anger of Stick 5 Mod Apk Uang Tak Terbatas untuk Membeli Senjata dan Menghancurkan Zombie.md
deleted file mode 100644
index 2e5cdc8694c20b2daeb908c1eb69175655b1af36..0000000000000000000000000000000000000000
--- a/spaces/congsaPfin/Manga-OCR/logs/Download Anger of Stick 5 Mod Apk Uang Tak Terbatas untuk Membeli Senjata dan Menghancurkan Zombie.md	
+++ /dev/null
@@ -1,126 +0,0 @@
-<br />
-<h1>Download Anger of Stick 5 MOD APK Unlimited Money</h1>
-<p>Are you looking for a fun and exciting action game to play on your Android device? Do you want to enjoy unlimited money and gems, unlocked weapons and items, and no ads in your game? If yes, then you should download Anger of Stick 5 MOD APK right now!</p>
-<h2>download anger of stick 5 mod apk uang tak terbatas</h2><br /><p><b><b>Download Zip</b> &gt;&gt;&gt; <a href="https://urlca.com/2uOa1S">https://urlca.com/2uOa1S</a></b></p><br /><br />
-<h2>What is Anger of Stick 5?</h2>
-<h3>A popular action game with stickman characters</h3>
-<p>Anger of Stick 5 is a popular action game with stickman characters. It is the fifth installment in the Anger of Stick series, which has over 100 million downloads worldwide. In this game, you have to fight against enemies who are trying to destroy the city and kidnap your friends. You can use various weapons, skills, and vehicles to defeat them and save the day.</p>
-<h3>Features of the game</h3>
-<p>Anger of Stick 5 has many features that make it an enjoyable and addictive game. Some of them are:</p>
-<ul>
-<li>Simple and easy controls</li>
-<li>Smooth and realistic animations</li>
-<li>6 different game modes, including single-player, zombie mode, team battle, survival mode, etc.</li>
-<li>Over 60 different weapons and items, such as guns, swords, axes, grenades, etc.</li>
-<li>Over 10 different vehicles, such as helicopters, tanks, robots, etc.</li>
-<li>Over 200 different enemies with different abilities and behaviors</li>
-<li>Over 20 different allies who can help you in your missions</li>
-<li>Customizable character appearance and skills</li>
-<li>Leaderboards and achievements</li>
-</ul>
-<h2>Why download Anger of Stick 5 MOD APK?</h2>
-<h3>Benefits of the modded version</h3>
-<p>While Anger of Stick 5 is a free game to download and play, it also has some limitations and drawbacks that can affect your gaming experience. For example, you have to earn money and gems by completing missions or watching ads, which can be time-consuming and annoying. You also have to unlock weapons and items by spending money and gems, which can be expensive and frustrating. And you have to deal with ads that pop up every now and then, which can be distracting and irritating.</p>
-<p>That's why you should download Anger of Stick 5 MOD APK, which is a modified version of the original game that gives you many benefits and advantages. Some of them are:</p>
-<h4>Unlimited money and gems</h4>
-<p>With Anger of Stick 5 MOD APK, you don't have to worry about earning or spending money and gems anymore. You will have unlimited money and gems in your account from the start, which means you can buy anything you want without any restrictions. You can also upgrade your weapons and items to the maximum level without any hassle.</p>
-<p>Download Anger of Stick 5 Mod Apk Unlimited Money<br />
-Anger of Stick 5 Mod Apk Versi Terbaru Uang Tak Terbatas<br />
-Cara Download Anger of Stick 5 Mod Apk di Android<br />
-Anger of Stick 5 Mod Apk Zombie Mode Uang Tak Terbatas<br />
-Review Game Anger of Stick 5 Mod Apk Uang Tak Terbatas<br />
-Download Anger of Stick 5 Mod Apk Offline Uang Tak Terbatas<br />
-Anger of Stick 5 Mod Apk Fitur Lengkap Uang Tak Terbatas<br />
-Download Anger of Stick 5 Mod Apk Tanpa Iklan Uang Tak Terbatas<br />
-Anger of Stick 5 Mod Apk Cheat Menu Uang Tak Terbatas<br />
-Download Anger of Stick 5 Mod Apk dari Link Terpercaya<br />
-Anger of Stick 5 Mod Apk Hack Gems Uang Tak Terbatas<br />
-Download Anger of Stick 5 Mod Apk dengan Mudah dan Cepat<br />
-Anger of Stick 5 Mod Apk Unlimited Health Uang Tak Terbatas<br />
-Download Anger of Stick 5 Mod Apk Gratis Tanpa Bayar<br />
-Anger of Stick 5 Mod Apk Unlock All Characters Uang Tak Terbatas<br />
-Download Anger of Stick 5 Mod Apk No Root Uang Tak Terbatas<br />
-Anger of Stick 5 Mod Apk Unlimited Weapons Uang Tak Terbatas<br />
-Download Anger of Stick 5 Mod Apk Anti Banned Uang Tak Terbatas<br />
-Anger of Stick 5 Mod Apk Unlimited Ammo Uang Tak Terbatas<br />
-Download Anger of Stick 5 Mod Apk Support All Devices<br />
-Anger of Stick 5 Mod Apk Unlimited Coins Uang Tak Terbatas<br />
-Download Anger of Stick 5 Mod Apk Bahasa Indonesia Uang Tak Terbatas<br />
-Anger of Stick 5 Mod Apk Unlimited Skills Uang Tak Terbatas<br />
-Download Anger of Stick 5 Mod Apk Update Terbaru Uang Tak Terbatas<br />
-Anger of Stick 5 Mod Apk Unlimited Helicopter Uang Tak Terbatas<br />
-Download Anger of Stick 5 Mod Apk High Damage Uang Tak Terbatas<br />
-Anger of Stick 5 Mod Apk Unlimited Robots Uang Tak Terbatas<br />
-Download Anger of Stick 5 Mod Apk Full Version Uang Tak Terbatas<br />
-Anger of Stick 5 Mod Apk Unlimited Friends Uang Tak Terbatas<br />
-Download Anger of Stick 5 Mod Apk HD Graphics Uang Tak Terbatas<br />
-Anger of Stick 5 Mod Apk Unlimited Gold Uang Tak Terbatas<br />
-Download Anger of Stick 5 Mod Apk Tanpa Verifikasi Uang Tak Terbatas<br />
-Anger of Stick 5 Mod Apk Unlimited Diamonds Uang Tak Terbatas<br />
-Download Anger of Stick 5 Mod Apk Tanpa Password Uang Tak Terbatas<br />
-Anger of Stick 5 Mod Apk Unlimited Energy Uang Tak Terbatas<br />
-Download Anger of Stick 5 Mod Apk Tanpa Kuota Internet <br />
-Anger of Stick 5 Mod Apk Unlimited Level Up Uang Tak Terbatas <br />
-Download Anger of Stick 5 Mod Apk Tanpa Virus atau Malware <br />
-Anger of Stick 5 Mod Apk Unlimited Combo Uang Tak Terbatas <br />
-Download Anger of Stick 5 Mod Apk Tanpa Root atau Jailbreak</p>
-<h4>Unlocked weapons and items</h4>
-<p>With Anger of Stick 5 MOD APK, you don't have to wait or work hard to unlock weapons and items anymore. You will have access to all the weapons and items in the game from the start, which means you can choose any weapon and item you like without any limitations. You can also try out different combinations of weapons and items to suit your playstyle and preferences.</p>
-<h4>No ads and no root required</h4>
-<p>With Anger of Stick 5 MOD APK, you don't have to deal with ads and root anymore. You will not see any ads in the game, which means you can enjoy the game without any interruptions or distractions. You also don't need to root your device to install the mod apk, which means you can avoid any risks or complications that come with rooting.</p>
-<h3>How to download and install the mod apk</h3>
-<p>Downloading and installing Anger of Stick 5 MOD APK is very easy and simple. Just follow these steps:</p>
-<h4>Steps to follow</h4>
-<ol>
-<li>Click on the download button below to download the mod apk file.</li>
-<li>Allow unknown sources in your device settings to install the mod apk.</li>
-<li>Locate and tap on the downloaded mod apk file to start the installation process.</li>
-<li>Wait for a few seconds until the installation is complete.</li>
-<li>Launch the game and enjoy unlimited money and gems, unlocked weapons and items, and no ads.</li>
-</ol>
-<h4>Tips and tricks</h4>
-<p>Here are some tips and tricks that can help you play Anger of Stick 5 better:</p>
-<ul>
-<li>Use different weapons and items depending on the situation and the enemy type. For example, use guns for long-range attacks, swords for close-range attacks, grenades for crowd control, etc.</li>
-<li>Upgrade your weapons and items regularly to increase their damage, durability, and effectiveness.</li>
-<li>Use your skills wisely to deal more damage, heal yourself, or boost your allies. For example, use the rage skill to increase your attack power, use the heal skill to restore your health, or use the summon skill to call an ally to help you.</li>
-<li>Play different game modes to challenge yourself and earn more rewards. For example, play zombie mode to fight against hordes of zombies, play team battle mode to cooperate with other players, or play survival mode to test your endurance.</li>
-<li>Invite your friends to play with you online and have more fun. You can chat with them, share your strategies, and compete with them on the leaderboards.</li>
-</ul>
-<h2>Conclusion</h2>
-<h3>Summary of the main points</h3>
-<p>In conclusion, Anger of Stick 5 is a popular action game with stickman characters that lets you fight against enemies who are trying to destroy the city and kidnap your friends. You can use various weapons, skills, and vehicles to defeat them and save the day. You can also download Anger of Stick 5 MOD APK to enjoy unlimited money and gems, unlocked weapons and items, and no ads in your game. You can also download and install the mod apk easily by following some simple steps. You can also play different game modes, upgrade your weapons and items, use your skills wisely, and invite your friends to play with you online.</p>
-<h3>Call to action</h3>
-<p>If you are ready to download Anger of Stick 5 MOD APK and have a blast with this amazing action game, then don't wait any longer. Click on the download button below and start your adventure now!</p>
- <h2>FAQs</h2>
-<h3>Is Anger of Stick 5 MOD APK safe to use?</h3>
-<p>Yes, Anger of Stick 5 MOD APK is safe to use. It is tested by our team of experts and verified by many users. It does not contain any viruses, malware, or spyware that can harm your device or data. It also does not require any permissions that can compromise your privacy or security.</p>
-<h3>What are the minimum requirements for Anger of Stick 5 MOD APK?</h3>
-<p>The minimum requirements for Anger of Stick 5 MOD APK are:</p>
-<ul>
-<li>An Android device running Android 4.1 or higher</li>
-<li>A stable internet connection</li>
-<li>At least 100 MB of free storage space</li>
-<li>A compatible device that can run the game smoothly</li>
-</ul>
-<h3>How to update Anger of Stick 5 MOD APK?</h3>
-<p>To update Anger of Stick 5 MOD APK, you have to follow these steps:</p>
-<ol>
-<li>Delete the old version of the mod apk from your device.</li>
-<li>Download the latest version of the mod apk from our website.</li>
-<li>Install the new version of the mod apk following the same steps as before.</li>
-<li>Enjoy the updated features and improvements in the game.</li>
-</ol>
- <h3>How to play Anger of Stick 5 with friends online?</h3>
-<p>To play Anger of Stick 5 with friends online, you have to follow these steps:</p>
-<ol>
-<li>Launch the game and tap on the online mode icon on the main menu.</li>
-<li>Select the game mode you want to play, such as team battle, zombie mode, etc.</li>
-<li>Invite your friends to join your room by tapping on the invite button and sending them a link or a code.</li>
-<li>Wait for your friends to accept your invitation and join your room.</li>
-<li>Start the game and have fun with your friends.</li>
-</ol>
-<h3>Where can I find more modded games like Anger of Stick 5?</h3>
-<p>If you are looking for more modded games like Anger of Stick 5, you can visit our website and browse through our collection of modded games. We have modded games for various genres, such as action, adventure, arcade, puzzle, racing, simulation, sports, etc. You can download and install them easily and enjoy unlimited features and benefits in your games.</p> 401be4b1e0<br />
-<br />
-<br />
\ No newline at end of file
diff --git a/spaces/congsaPfin/Manga-OCR/logs/Download CarX Street Lite APK and Race in the Open World of Sunset City.md b/spaces/congsaPfin/Manga-OCR/logs/Download CarX Street Lite APK and Race in the Open World of Sunset City.md
deleted file mode 100644
index 9e09197879d55a7f5b3068140128fc5e0777fd02..0000000000000000000000000000000000000000
--- a/spaces/congsaPfin/Manga-OCR/logs/Download CarX Street Lite APK and Race in the Open World of Sunset City.md	
+++ /dev/null
@@ -1,112 +0,0 @@
-
-<h1>CarX Street Lite APK: A New Way to Experience Street Racing on Android</h1>
-<p>If you are a fan of car racing games, you might have heard of CarX Street Lite APK, a new game that lets you enjoy the thrill of street racing in a dynamic open world. In this article, we will tell you everything you need to know about this game, including what it is, how to download and install it, why you should play it, some tips and tricks for playing it, how it compares with other car racing games, and some frequently asked questions.</p>
-<h2>What is CarX Street Lite APK?</h2>
-<h3>A brief introduction to the game and its features</h3>
-<p>CarX Street Lite APK is an open beta test version of CarX Street, a game developed by CarX Technologies, the makers of CarX Drift Racing 2. It is a realistic street racing game that features high-quality graphics, physics-based car behavior, part tuning, car customization, club battles, boss races, and more. You can choose from a variety of cars, from classic muscle cars to modern supercars, and upgrade them with different parts and accessories. You can also explore a huge open world with different locations, such as highways, city streets, industrial zones, airports, and more. You can race against other players or AI opponents in different modes, such as sprint races, drift races, time trials, drag races, etc.</p>
-<h2>carx street lite apk</h2><br /><p><b><b>Download Zip</b> &#10040;&#10040;&#10040; <a href="https://urlca.com/2uOdNS">https://urlca.com/2uOdNS</a></b></p><br /><br />
-<h3>How to download and install the game on your device</h3>
-<p>Since CarX Street Lite APK is an open beta test version, it is not available on the Google Play Store. However, you can download it from other sources, such as . To install it on your device, you need to follow these steps:</p>
-<ol>
-<li>Download the APK file from  or another trusted source.</li>
-<li>Enable the installation of apps from unknown sources on your device. You can do this by going to Settings > Security > Unknown Sources and toggling it on.</li>
-<li>Locate the downloaded APK file on your device and tap on it.</li>
-<li>Follow the instructions on the screen to complete the installation.</li>
-<li>Launch the game and enjoy!</li>
-</ol>
-<h2>Why You Should Play CarX Street Lite APK</h2>
-<h3>The benefits of playing an open beta test game</h3>
-<p>By playing CarX Street Lite APK, you are not only having fun but also helping the developers improve the game and provide feedback. As an open beta tester, you can access the game before its official release and enjoy its features for free. You can also report any bugs, glitches, or suggestions to the developers through the game's official website  or social media pages . By doing so, you can help them improve the game and make it more enjoyable for everyone.</p>
-<h3>The realistic graphics and physics of the game</h3>
-<p>One of the main attractions of CarX Street Lite APK is its stunning graphics and physics. The game uses the CarX engine, which is known for its realistic car behavior and simulation. The game also features high-quality 3D models, textures, lighting, shadows, reflections, and effects. You can see the details of your car, such as the paint, scratches, dirt, smoke, sparks, etc. You can also see the environment around you, such as the buildings, trees, roads, signs, etc. The game also supports different weather conditions, such as sunny, cloudy, rainy, foggy, etc. The game runs smoothly on most devices and has adjustable graphics settings to suit your preferences.</p>
-<h3>The variety of cars, parts, and customization options</h3>
-<p>Another reason to play CarX Street Lite APK is its wide range of cars, parts, and customization options. The game offers over 50 cars from different categories, such as muscle cars, sports cars, supercars, etc. You can unlock them by completing races, earning money, or buying them with real money. You can also upgrade them with different parts, such as engines, transmissions, suspensions, brakes, tires, etc. You can tune them to suit your driving style and performance needs. You can also customize them with different colors, decals, stickers, rims, spoilers, hoods, bumpers, etc. You can create your own unique car and show it off to other players.</p>
-<h3>The dynamic open world and different race modes</h3>
-<p>The last reason to play CarX Street Lite APK is its dynamic open world and different race modes. The game lets you explore a huge open world with different locations and terrains. You can drive around freely and discover hidden spots and secrets. You can also interact with other players and join clubs or races. The game has different race modes to challenge your skills and compete with others. You can choose from sprint races, drift races, time trials, drag races, etc. You can also join club battles and challenge bosses for rewards and reputation. The game has a ranking system that tracks your progress and achievements.</p>
-<h2>Tips and Tricks for Playing CarX Street Lite APK</h2>
-<h3>How to join clubs and challenge bosses</h3>
-<p>One of the features of CarX Street Lite APK is the club system. You can join a club or create your own club with other players. By joining a club, you can chat with other members, . You can adjust the values of each parameter by using the sliders or the buttons. You can also see the changes in your car's stats, such as power, torque, weight, acceleration, top speed, etc. You can also test your car's performance by using the test drive option. You can tune your car for different races depending on the track, weather, and mode. For example, you can increase your engine power and top speed for sprint races, lower your suspension and increase your tire grip for drift races, or balance your acceleration and braking for time trials.</p>
-<h3>How to drift and use nitro boost</h3>
-<p>One of the skills that you need to master in CarX Street Lite APK is drifting. Drifting is a technique that involves sliding your car sideways around corners and curves. Drifting can help you maintain your speed and momentum, as well as earn you more points and money. To drift, you need to press and hold the drift button while turning your car. You can also use the handbrake button to initiate a drift. You need to control your steering and throttle to maintain your drift angle and balance. You can also use the nitro boost to increase your speed and power while drifting. Nitro boost is a feature that allows you to temporarily boost your car's performance by using a special fuel. To use nitro boost, you need to press and hold the nitro button. You can see your nitro gauge on the screen, which shows how much nitro you have left. You can refill your nitro gauge by drifting, overtaking, or performing stunts.</p>
-<p>carx street game download<br />
-carx street open world racing<br />
-carx street mod apk unlimited money<br />
-carx street beta test<br />
-carx street drift racing 2<br />
-carx street apk + obb<br />
-carx street android 9.0+<br />
-carx street sunset city<br />
-carx street realistic physics<br />
-carx street part tuning<br />
-carx street visual customization<br />
-carx street latest version<br />
-carx street free download<br />
-carx street xapk file<br />
-carx street online multiplayer<br />
-carx street offline mode<br />
-carx street dynamic day/night<br />
-carx street career mode<br />
-carx street clubs and bosses<br />
-carx street houses and collections<br />
-carx street gas stations and fuel<br />
-carx street engine swap<br />
-carx street high-quality graphics<br />
-carx street enormous open world<br />
-carx street support service<br />
-carx street license agreement<br />
-carx street privacy policy<br />
-carx street official site<br />
-carx street google play id<br />
-carx street category racing<br />
-carx street developer CarX Technologies, LLC<br />
-carx street installs 1,000,000+<br />
-carx street app size 1.19 GB<br />
-carx street old versions<br />
-carx street update Jun 9, 2023<br />
-carx street net energy gain<br />
-carx street mini sun experiment<br />
-carx street top speed or drift<br />
-carx street buy houses for cars<br />
-carx street detailed car-building system<br />
-carx street mirrors, headlights, lights, skirt, bumper, rims, etc.<br />
-carx street impressive physics and controls<br />
-carx street master of your car<br />
-carx street exhilarating races<br />
-carx street convection zone temperature 5800K</p>
-<h3>How to earn money and buy houses for your cars</h3>
-<p>The last tip that we have for you is how to earn money and buy houses for your cars. Money is the main currency in CarX Street Lite APK, which you can use to buy new cars, parts, customization items, houses, etc. You can earn money by completing races, challenges, events, etc. You can also earn money by drifting, overtaking, or performing stunts. You can also get money by watching ads or buying it with real money. Houses are another feature in CarX Street Lite APK, which allow you to store and display your cars. You can buy houses with different sizes, styles, and locations. You can also decorate your houses with furniture, paintings, plants, etc. You can access your houses by using the map or the house menu.</p>
-<h2>Comparison of CarX Street Lite APK with Other Car Racing Games</h2>
-<h3>A table showing the similarities and differences between CarX Street Lite APK and other popular car racing games on Android</h3>
-<table>
-<tr>
-<th>Game</th>
-<th>Similarities</th>
-<th>Differences</th>
-</tr>
-<tr>
-<td>CarX Street Lite APK</td>
-<td>- Realistic graphics and physics<br>- Part tuning and car customization<br>- Dynamic open world and different race modes<br>- Club battles and boss races</td>
-<td>- Open beta test version<br>- Focus on street racing<br>- CarX engine<br>- Houses for cars</td>
-</tr>
-<tr>
-<td>Asphalt 9: Legends</td>
-<td>- High-quality graphics and effects<br>- Variety of cars and customization options<br>- Different locations and terrains<br>- Multiplayer mode and events</td>
-<td>- Arcade-style gameplay<br>- Focus on stunts and nitro<br>- Gameloft engine<br>- Career mode and clubs</td>
-</tr>
-<tr>
-<td>Real Racing 3</td>
-<td>- Realistic graphics and physics<br>- Variety of cars and parts<br>- Different locations and tracks<br>- Multiplayer mode and events</td>
-<td>- Simulation-style gameplay<br>- Focus on real-world racing<br>- EA engine<br>- Time-shifted multiplayer mode</td>
-</tr>
-<tr>
-<td>Need for Speed: No Limits</td>
-<td>- High-quality graphics and effects<br>- Part tuning and car customization<br>- Different locations and terrains<br>- Multiplayer mode and events</td>
-<td>- Arcade-style gameplay<br>- Focus on underground racing<br>- EA engine<br>- Story mode and factions</td>
-</tr>
-<tr>
-<td>CSR Racing 2</td <li>Google Play Store: https://play.google.com/store/apps/details?id=com.carxtech.streetlite</li>
-<li>Reddit: https://www.reddit.com/r/CarXStreet/</li>
-</ul>
-<p>I hope you enjoyed this article and learned something new about CarX Street Lite APK. If you have any questions or comments, feel free to leave them below. Thank you for reading and happy racing!</p> 401be4b1e0<br />
-<br />
-<br />
\ No newline at end of file
diff --git a/spaces/congsaPfin/Manga-OCR/logs/PES 2023 APK Hack The Ultimate Guide for Android Users.md b/spaces/congsaPfin/Manga-OCR/logs/PES 2023 APK Hack The Ultimate Guide for Android Users.md
deleted file mode 100644
index ea8dcafb8914e9df04430c717b23d4b7d7b30fbf..0000000000000000000000000000000000000000
--- a/spaces/congsaPfin/Manga-OCR/logs/PES 2023 APK Hack The Ultimate Guide for Android Users.md	
+++ /dev/null
@@ -1,114 +0,0 @@
-<br />
-<h1>How to Hack PES 2023 APK and Enjoy Unlimited Coins and GP</h1>
-<p>If you are a fan of soccer games, you must have heard of PES 2023 APK, the latest installment of the popular eFootball series from Konami. This game offers you a realistic and immersive experience of playing soccer on your mobile device, with stunning graphics, smooth gameplay, and various modes to choose from. However, if you want to enjoy the game to the fullest, you might need to hack PES 2023 APK and get unlimited coins and GP, which are the in-game currencies that allow you to buy players, kits, stadiums, and more. In this article, we will show you what is PES 2023 APK, why you need to hack it, and how to hack it safely and easily.</p>
-<h2>pes 2023 apk hack</h2><br /><p><b><b>Download File</b> &#9999; <a href="https://urlca.com/2uO5uq">https://urlca.com/2uO5uq</a></b></p><br /><br />
- <h2>What is PES 2023 APK?</h2>
-<p>PES 2023 APK is the Android version of eFootball PES 2023, the latest edition of the Pro Evolution Soccer series developed by Konami. This game is one of the most popular and realistic soccer games on the market, competing with FIFA Mobile from EA Sports. PES 2023 APK features licensed teams, players, leagues, and tournaments from around the world, as well as original content created by Konami. You can play solo or with friends online, in various modes such as Matchday, Master League, MyClub, eFootball League, and more.</p>
- <h3>Features of PES 2023 APK</h3>
-<p>PES 2023 APK has many features that make it stand out from other soccer games. Here are some of them:</p>
- <h4>Graphics and Sound</h4>
-<p>PES 2023 APK uses Unreal Engine 5, which is a powerful game engine that delivers stunning graphics and animations. The game also uses motion capture technology to capture the movements and expressions of real players, making them look more lifelike and realistic. The game also has high-quality sound effects and commentary, creating an immersive atmosphere for the players.</p>
- <h4>Gameplay and Modes</h4>
-<p>PES 2023 APK has smooth and responsive gameplay, with intuitive controls and realistic physics. The game also has various modes to suit different preferences and skill levels. You can play quick matches, tournaments, leagues, or cups in Matchday mode; create your own team and manage it in Master League mode; build your dream squad and compete with others in MyClub mode; join a club and participate in online competitions in eFootball League mode; or create your own custom matches in Local mode.</p>
-<p>efootball pes 2023 mod apk unlimited money<br />
-pes 2023 apk obb download for android<br />
-pes 2023 mobile hack coins and gp<br />
-how to install pes 2023 apk + data<br />
-pes 2023 apk offline mode<br />
-pes 2023 mod apk latest version<br />
-pes 2023 apk free download full version<br />
-pes 2023 mobile hack no human verification<br />
-pes 2023 apk + data highly compressed<br />
-pes 2023 apk online multiplayer<br />
-pes 2023 mod apk android 1<br />
-pes 2023 mobile hack tool<br />
-pes 2023 apk + obb file download<br />
-pes 2023 apk cracked version<br />
-pes 2023 mod apk rexdl<br />
-pes 2023 mobile hack without survey<br />
-pes 2023 apk + data zip file<br />
-pes 2023 apk unlimited everything<br />
-pes 2023 mod apk revdl<br />
-pes 2023 mobile hack generator<br />
-pes 2023 apk + obb offline download<br />
-pes 2023 apk full unlocked<br />
-pes 2023 mod apk pure<br />
-pes 2023 mobile hack apk download<br />
-pes 2023 apk + data mega link<br />
-pes 2023 apk modded version<br />
-pes 2023 mod apk happymod<br />
-pes 2023 mobile hack ios<br />
-pes 2023 apk + obb google drive link<br />
-pes 2023 apk premium version<br />
-pes 2023 mod apk apkpure<br />
-pes 2023 mobile hack online<br />
-pes 2023 apk + data direct download link<br />
-pes 2023 apk pro version<br />
-pes 2023 mod apk unlimited coins and gp<br />
-pes 2023 mobile hack android<br />
-pes 2023 apk + obb mediafire link<br />
-pes 2023 apk original version<br />
-pes 2023 mod apk offline download<br />
-pes 2023 mobile hack no root<br />
-pes 2023 apk + data download for pc<br />
-pes 2023 apk vip version<br />
-pes 2023 mod apk unlimited money and gp<br />
-pes 2023 mobile hack cheat engine<br />
-pes 2023 apk + obb download for ios<br />
-pes 2023 apk hacked version download<br />
-efootball PES \uE000\uE001\uE000\uE001\uE000\uE001\uE000\uE001\uE000\uE001\uE000\uE001\uE000\uE001\uE000\uE001\uE000\uE001\uE000\uE001\uE000\uE001\uE000\uE001 Mod Apk (Hack Unlimited Money) v - APKYLO[^1^]</p>
- <h4>Online and Offline Options</h4>
-<p>PES 2023 APK allows you to play online or offline, depending on your internet connection and mood. You can play online with other players from around the world, using either Wi-Fi or mobile data. You can also play offline against AI opponents or with friends using Bluetooth or local Wi-Fi. The game also supports cross-platform play, meaning you can play with players who use different devices such as PC or console.</p>
- <h2>Why You Need to Hack PES 2023 APK</h2>
-<p>As much as PES 2023 APK is fun and enjoyable, it also has some limitations that might hinder your progress and satisfaction. One of these limitations is the lack of coins and GP, which are the in-game currencies that you need to buy players, kits, stadiums, and other items. Coins and GP are earned by playing matches, completing tasks, or watching ads, but they are not enough to get the best players and items. You can also buy coins and GP with real money, but that can be expensive and risky. That's why you might want to hack PES 2023 APK and get unlimited coins and GP for free.</p>
- <h3>Benefits of Hacking PES 2023 APK</h3>
-<p>Hacking PES 2023 APK can give you many benefits that can enhance your gaming experience. Here are some of them:</p>
- <h4>Unlock All Players and Teams</h4>
-<p>By hacking PES 2023 APK, you can unlock all the players and teams in the game, including the legends, the icons, and the special editions. You can also get the latest transfers and updates for the players and teams. This way, you can have your favorite players and teams in your squad, and play with them in any mode you want.</p>
- <h4>Customize Your Squad and Tactics</h4>
-<p>By hacking PES 2023 APK, you can customize your squad and tactics according to your preference and strategy. You can change the formation, the positions, the roles, the skills, and the attributes of your players. You can also equip them with the best kits, boots, balls, and accessories. You can also adjust the difficulty level, the match length, the weather conditions, and the stadium settings. This way, you can create your own unique squad and tactics that suit your style and goals.</p>
- <h4>Boost Your Performance and Skills</h4>
-<p>By hacking PES 2023 APK, you can boost your performance and skills in the game. You can increase your coins and GP balance, which allows you to buy more items and upgrades. You can also increase your energy level, which allows you to play more matches without getting tired. You can also increase your stats, such as speed, stamina, strength, accuracy, dribbling, passing, shooting, defending, and more. This way, you can improve your skills and abilities in the game, and dominate your opponents.</p>
- <h3>Risks of Hacking PES 2023 APK</h3>
-<p>However, hacking PES 2023 APK also has some risks that you need to be aware of. Here are some of them:</p>
- <h4>Ban from Online Servers</h4>
-<p>By hacking PES 2023 APK, you might get banned from the online servers of the game. This means that you will not be able to play online with other players or join online competitions. You will also lose all your progress and achievements in the game. Konami has a strict policy against hacking and cheating in their games, and they monitor the online activities of the players. If they detect any suspicious or abnormal behavior from your account, they will ban you without warning or mercy.</p>
- <h4>Malware and Viruses</h4>
-<p>By hacking PES 2023 APK, you might get malware and viruses on your device. This is because most of the hacking tools or modded versions of PES 2023 APK are not safe or reliable. They might contain malicious codes or programs that can harm your device or steal your personal information. They might also cause errors or crashes on your device or game. Therefore, you need to be careful when downloading or installing any hacking tool or modded version of PES 2023 APK.</p>
- <h4>Legal Issues and Consequences</h4>
-<p>By hacking PES 2023 APK, you might face legal issues and consequences. This is because hacking PES 2023 APK is illegal and unethical. It violates the terms of service and the intellectual property rights of Konami. It also ruins the fair play and the fun of the game for other players. Therefore, you might face legal actions or lawsuits from Konami or other parties if they find out that you hacked PES 2023 APK.</p>
- <h2>How to Hack PES 2023 APK Safely and Easily</h2>
-<p>If you still want to hack PES 2023 APK despite the risks involved, you need to do it safely and easily. Here are some steps that you can follow:</p>
- <h3>Steps to Hack PES 2023 APK</h3>
- <h4>Download a Modded Version of PES 2023 APK</h4>
-<p>The first step is to download a modded version of PES 2023 APK that has unlimited coins and GP features. You can find many websites or sources that offer such modded versions of PES 2023 APK online. However, you need to be careful when choosing one, as some of them might be fake or harmful. You need to check the reviews, ratings, and feedbacks of other users who have downloaded the modded version of PES 2023 APK. You also need to check the security and compatibility of the modded version of PES 2023 APK with your device and game version. You can use a reliable antivirus or anti-malware software to scan the modded version of PES 2023 APK before downloading or installing it.</p>
- <h4>Install the Modded APK on Your Device</h4>
-<p>The second step is to install the modded version of PES 2023 APK on your device. You need to uninstall the original version of PES 2023 APK first, if you have it on your device. Then, you need to enable the unknown sources option on your device settings, which allows you to install apps from sources other than the Google Play Store. After that, you need to locate the modded version of PES 2023 APK file on your device storage, and tap on it to install it. You might need to grant some permissions or accept some terms and conditions during the installation process.</p>
- <h4>Launch the Game and Enjoy the Hack</h4>
-<p>The third and final step is to launch the game and enjoy the hack. You will see that you have unlimited coins and GP in your account, which you can use to buy anything you want in the game. You can also access all the players and teams in the game, and customize your squad and tactics as you wish. You can also play any mode you want, online or offline, without any restrictions or limitations. However, you need to be careful when playing online, as you might get detected or reported by other players or Konami. You also need to update the modded version of PES 2023 APK regularly, as new versions of the game might come out with new features or bug fixes.</p>
- <h2>Conclusion</h2>
-<p>PES 2023 APK is a great soccer game that offers you a realistic and immersive experience of playing soccer on your mobile device. However, if you want to enjoy the game to the fullest, you might need to hack PES 2023 APK and get unlimited coins and GP, which are the in-game currencies that allow you to buy players, kits, stadiums, and more. In this article, we showed you what is PES 2023 APK, why you need to hack it, and how to hack it safely and easily. We hope that this article was helpful and informative for you. However, we do not encourage or endorse hacking or cheating in any game, as it is illegal and unethical. It also ruins the fair play and the fun of the game for other players. Therefore, we advise you to play PES 2023 APK without hacking it, and enjoy it as it is meant to be enjoyed.</p>
- <h2>FAQs</h2>
-<p>Here are some frequently asked questions about hacking PES 2023 APK:</p>
- <h4>Q: Is hacking PES 2023 APK legal?</h4>
-<p>A: No, hacking PES 2023 APK is not legal. It violates the terms of service and the intellectual property rights of Konami. It also violates the laws and regulations of your country or region. Therefore, hacking PES 2023 APK can lead to legal issues and consequences.</p>
- <h4>Q: Is hacking PES 2023 APK safe?</h4>
-<p>A: No, hacking PES 2023 APK is not safe. It can expose your device or account to malware or viruses, which can harm your device or steal your personal information. It can also cause errors or crashes on your device or game. It can also get you banned from the online servers of the game, which means that you will lose all your progress and achievements in the game.</p>
- <h4>Q: Is hacking PES 2023 APK easy?</h4>
-<p>A: Yes, hacking PES 2023 APK is easy if you follow the steps that we provided in this article. However, you need to be careful when choosing a modded version of PES 2023 APK, as some of them might be fake or harmful. You also need to check the security and compatibility of the modded version of PES 2023 APK with your device and game version.</p>
- <h4>Q: Is hacking PES 2023 APK worth it?</h4>
-<p>A: No, hacking PES 2023 APK is not worth it. It might give you some benefits such as unlimited coins and GP, but it also has many risks such as ban from online servers, malware and viruses, legal issues and consequences. It also ruins the fair play and the fun of the game for other players. Therefore, hacking PES 2023 APK is not worth it, and we advise you to play the game without hacking it.</p>
- <h4>Q: How can I play PES 2023 APK without hacking it?</h4>
-<p>A: You can play PES 2023 APK without hacking it by following these tips:</p>
-<ul>
-<li>Play regularly and complete tasks to earn coins and GP.</li>
-<li>Watch ads or participate in surveys to get free coins and GP.</li>
-<li>Use the scout feature to find and sign players that suit your budget and needs.</li>
-<li>Use the training feature to improve the skills and abilities of your players.</li>
-<li>Use the strategy feature to adjust your formation, positions, roles, and tactics according to your opponents and situations.</li>
-<li>Use the tips and tricks feature to learn more about the game and its features.</li>
-<li>Join a club or a community to get support and advice from other players.</li>
-</ul>
-<p>By following these tips, you can play PES 2023 APK without hacking it, and enjoy it as it is meant to be enjoyed.</p> 197e85843d<br />
-<br />
-<br />
\ No newline at end of file
diff --git a/spaces/congsaPfin/Manga-OCR/logs/Revit Sandwich Panels Tips and Tricks for Using Them in Your Project.md b/spaces/congsaPfin/Manga-OCR/logs/Revit Sandwich Panels Tips and Tricks for Using Them in Your Project.md
deleted file mode 100644
index f663a2dc85b1a7e36fa8563677c4e8618d47c0db..0000000000000000000000000000000000000000
--- a/spaces/congsaPfin/Manga-OCR/logs/Revit Sandwich Panels Tips and Tricks for Using Them in Your Project.md	
+++ /dev/null
@@ -1,139 +0,0 @@
-<br />
-<h1>Download Sandwich Panel Revit: A Guide for Architects and Engineers</h1>
- <p>If you are looking for a way to create high-performance, energy-efficient, and aesthetically pleasing buildings, you might want to consider using sandwich panels. Sandwich panels are composite structures that consist of three layers: a low-density core and a thin skin-layer bonded to each side. They are widely used in various applications, such as roofs, walls, cold storage, acoustic insulation, and more.</p>
- <p>In this article, we will explain what sandwich panels are, what types and advantages they have, and how you can download sandwich panel Revit models for your projects. We will also show you how to use sandwich panel Revit models in your design and documentation process.</p>
-<h2>download sandwich panel revit</h2><br /><p><b><b>Download Zip</b> &middot; <a href="https://urlca.com/2uOapQ">https://urlca.com/2uOapQ</a></b></p><br /><br />
- <h2>What are sandwich panels and why use them?</h2>
- <p>Sandwich panels are a type of building material that combines multiple layers of different materials to create a unique composite structure. The core layer provides thermal insulation, acoustic insulation, fire resistance, and mechanical strength, while the skin layers provide protection, durability, and aesthetics. Sandwich panels can be made of various materials, such as polyurethane (PUR), polystyrene (EPS), mineral wool, aluminum, steel, fiberglass, wood, etc.</p>
- <h3>Sandwich panel definition</h3>
- <p>According to Wikipedia, a sandwich panel is "any structure made of three layers: a low-density core (PIR, mineral wool, XPS), and a thin skin-layer bonded to each side. Sandwich panels are used in applications where a combination of high structural rigidity and low weight is required." According to Merriam-Webster, a sandwich panel is "a structural panel material fabricated by bonding several laminations."</p>
- <h3>Sandwich panel types</h3>
- <p>There are many types of sandwich panels available on the market, depending on the core material, the skin material, the profile type, the coating type, and the color. Some of the common types of sandwich panels are:</p>
- <ul>
-<li>PUR/PIR sandwich panels: These panels have a core made of polyurethane or polyisocyanurate foam, which offers excellent thermal insulation and fire resistance. They are suitable for roofs and walls in various buildings.</li>
-<li>EPS sandwich panels: These panels have a core made of expanded polystyrene foam, which is lightweight and economical. They are mainly used for cold storage and refrigeration facilities.</li>
-<li>Mineral wool sandwich panels: These panels have a core made of mineral wool fibers, which provide good acoustic insulation and fire resistance. They are ideal for industrial buildings that require noise reduction and fire safety.</li>
-<li>ACP sandwich panels: These panels have a core made of aluminum composite material (ACM), which consists of two thin aluminum sheets bonded to a plastic core. They are used for architectural cladding and signage applications.</li>
-</ul>
- <h3>Sandwich panel advantages</h3>
- <p>Sandwich panels offer many advantages over traditional building materials, such as:</p>
- <ul>
-<li>Lightweight: Sandwich panels are lightweight, which makes them easy to handle, transport, and install. They also reduce the load on the foundation and the structure of the building.</li>
-<li>Thermal insulation: Sandwich panels have high thermal resistance values, which help reduce heat loss and energy consumption in buildings. They also prevent condensation and moisture problems.</li>
-<li>Acoustic insulation: Sandwich panels have good sound absorption properties, which help reduce noise transmission and improve the acoustic comfort in buildings.</li>
-<li>Mechanical strength: Sandwich panels have high bending stiffness and load-bearing capacity, which enable them to span large distances without additional support.</li>
-<li>Durability: Sandwich panels are resistant to corrosion, weathering, UV rays, and impact. They also have a long service life and low maintenance costs.</li>
-<li>Aesthetics: Sandwich panels come in various colors, textures, and finishes, which allow for a wide range of design possibilities and architectural expressions.</li>
-</ul>
- <h2>How to download sandwich panel Revit models?</h2>
- <p>If you want to use sandwich panels in your Revit projects, you will need to download sandwich panel Revit models from reliable sources. There are several platforms and software that offer free or paid access to sandwich panel Revit models, such as:</p>
- <h3>BIMobject: a platform for free Revit walls - sandwich panels</h3>
- <p>BIMobject is one of the largest and most popular platforms for downloading BIM objects and Revit families. It has a wide collection of sandwich panel Revit models from various manufacturers and brands, such as Kingspan, Ruukki, Metecno, etc. You can browse, filter, and download sandwich panel Revit models for free from BIMobject's website or app. You can also view the technical specifications, ratings, and reviews of each sandwich panel Revit model before downloading it.</p>
-<p>download sandwich panel revit families<br />
-download sandwich panel revit objects<br />
-download sandwich panel revit files<br />
-download sandwich panel revit bim data<br />
-download sandwich panel revit wall types<br />
-download sandwich panel revit roof types<br />
-download sandwich panel revit specifications<br />
-download sandwich panel revit certifications<br />
-download sandwich panel revit models<br />
-download sandwich panel revit library<br />
-download sandwich panel revit package<br />
-download sandwich panel revit suite<br />
-download sandwich panel revit plugin<br />
-download sandwich panel revit software<br />
-download sandwich panel revit tool<br />
-download sandwich panel revit solution<br />
-download sandwich panel revit workflow<br />
-download sandwich panel revit tutorial<br />
-download sandwich panel revit guide<br />
-download sandwich panel revit tips<br />
-download sandwich panel revit examples<br />
-download sandwich panel revit projects<br />
-download sandwich panel revit design<br />
-download sandwich panel revit details<br />
-download sandwich panel revit drawings<br />
-download sandwich panel revit documentation<br />
-download sandwich panel revit information<br />
-download sandwich panel revit resources<br />
-download sandwich panel revit materials<br />
-download sandwich panel revit textures<br />
-download sandwich panel revit dimensions<br />
-download sandwich panel revit brands<br />
-download sandwich panel revit manufacturers<br />
-download sandwich panel revit suppliers<br />
-download sandwich panel revit products<br />
-download sandwich panel revit systems<br />
-download sandwich panel revit components<br />
-download sandwich panel revit elements<br />
-download sandwich panel revit features<br />
-download sandwich panel revit benefits<br />
-download sandwich panel revit advantages<br />
-download sandwich panel revit performance<br />
-download sandwich panel revit quality<br />
-download sandwich panel revit durability<br />
-download sandwich panel revit sustainability<br />
-download sandwich panel revit energy efficiency<br />
-download sandwich panel revit fire resistance <br />
-download sandwich panel revit sound insulation</p>
- <h3>AGACAD: a software for sandwich panel design and installation</h3>
- <p>AGACAD is a software company that develops tools and solutions for BIM and Revit. One of its products is Smart Assemblies, which is a software for creating and managing complex assemblies in Revit. Smart Assemblies can be used to design and install sandwich panels in Revit, as well as generate shop drawings, schedules, and reports. You can download a free trial of Smart Assemblies from AGACAD's website or purchase a license for the full version.</p>
- <h3>Other sources of sandwich panel Revit models</h3>
- <p>There are also other sources of sandwich panel Revit models that you can explore, such as:</p>
- <ul>
-<li>RevitCity: a community website for Revit users that offers free downloads of Revit families and objects, including sandwich panels.</li>
-<li>CADdetails: a platform for connecting manufacturers and designers that provides free downloads of CAD drawings and BIM models, including sandwich panels.</li>
-<li>Manufacturer websites: some sandwich panel manufacturers provide their own Revit models on their websites or catalogs, which you can download directly or request by email.</li>
-</ul>
- <h2>How to use sandwich panel Revit models in your projects?</h2>
- <p>Once you have downloaded the sandwich panel Revit models that you need, you can use them in your projects by following these steps:</p>
- <h3>Importing and placing sandwich panels in Revit</h3>
- <p>To import and place sandwich panels in Revit, you need to do the following:</p>
- <ol>
-<li>Open your Revit project and go to the Insert tab.</li>
-<li>Click on Load Family and browse to the folder where you saved the sandwich panel Revit model.</li>
-<li>Select the sandwich panel Revit model and click on Open.</li>
-<li>The sandwich panel will appear in the Project Browser under Families - Walls - Sandwich Panels.</li>
-<li>Select the sandwich panel from the Project Browser and drag it to the drawing area.</li>
-<li>Use the Modify tools to adjust the position, orientation, height, width, and alignment of the sandwich panel.</li>
-</ol>
- <h3>Modifying and customizing sandwich panels in Revit</h3>
- <p>To modify and customize sandwich panels in Revit, you need to do the following:</p>
- <ol>
-<li>Select the sandwich panel that you want to modify and go to the Properties palette.</li>
-<li>Under Type Properties, you can change the parameters of the sandwich panel, such as core material, skin material, profile type, coating type, color, etc.</li>
-<li>You can also create new types of sandwich panels by clicking on Duplicate and renaming them.</li>
-<li>If you want to edit the geometry of the sandwich panel, you can click on Edit Family to open the Family Editor.</li>
-<li>In the Family Editor, you can use the Sketch tools to modify the shape and size of the sandwich panel.</li>
-<li>You can also use the Reference Planes, Dimensions, Parameters, Constraints, Formulas, and Families to create more complex and parametric sandwich panels.</li>
-<li>When you are done, click on Load into Project to save the changes and update the sandwich panel in your project.</li>
-</ol>
- <h3>Generating documentation and reports from sandwich panel Revit models</h3>
- <p>To generate documentation and reports from sandwich panel Revit models, you need to do the following:</p>
- <ol>
-<li>Create views of your project that show the sandwich panels in different perspectives, such as floor plans, elevations, sections, 3D views, etc.</li>
-<li>Add annotations, dimensions, tags, symbols, and notes to your views to provide more information and clarity about the sandwich panels.</li>
-<li>Create sheets and place your views on them. You can also add title blocks, legends, schedules, and other elements to your sheets.</li>
-<li>Create schedules of your sandwich panels that display their properties, quantities, costs, and other data. You can also use filters, sorting, grouping, and formulas to organize and customize your schedules.</li>
-<li>Export your sheets and schedules as PDF, DWG, DWF, or other formats to share them with your clients, contractors, or stakeholders.</li>
-</ol>
- <h2>Conclusion</h2>
- <p>Sandwich panels are a versatile and efficient building material that can enhance the performance and appearance of your buildings. They offer many benefits, such as thermal insulation, acoustic insulation, mechanical strength, durability, and aesthetics. You can download sandwich panel Revit models from various sources, such as BIMobject, AGACAD, RevitCity, CADdetails, or manufacturer websites. You can also use sandwich panel Revit models in your projects by importing, placing, modifying, customizing, and documenting them in Revit.</p>
- <p>We hope this article has helped you understand how to download sandwich panel Revit models and use them in your projects. If you have any questions or feedback, please feel free to contact us or leave a comment below.</p>
- <h2>FAQs</h2>
- <p>Here are some frequently asked questions about sandwich panel Revit models:</p>
- <ol>
-<li>What is the difference between a sandwich panel and a curtain wall?</li>
-<p>A sandwich panel is a composite structure that consists of three layers: a low-density core and a thin skin-layer bonded to each side. A curtain wall is a non-structural system that covers the exterior of a building and consists of glass panels or other materials supported by a metal frame.</p>
-<li>How do I change the thickness of a sandwich panel in Revit?</li>
-<p>To change the thickness of a sandwich panel in Revit, you need to select the sandwich panel and go to the Properties palette. Under Type Properties, you can change the value of the Thickness parameter. Alternatively, you can edit the family of the sandwich panel and modify the thickness of each layer in the Family Editor.</p>
-<li>How do I create a custom sandwich panel in Revit?</li>
-<p>To create a custom sandwich panel in Revit, you need to use the Family Editor. You can either start from scratch or duplicate an existing sandwich panel family. You can use the Sketch tools to draw the profile of the sandwich panel and assign materials to each layer. You can also use Reference Planes, Dimensions, Parameters, Constraints, Formulas, and Families to make your sandwich panel more complex and parametric.</p>
-<li>How do I calculate the U-value of a sandwich panel in Revit?</li>
-<p>To calculate the U-value of a sandwich panel in Revit, you need to use the Analyze tab. Under Energy Analysis - Building Elements - Thermal Properties - Analytical Construction Library - Walls - Sandwich Panels - Edit/Create New Construction - Edit Thermal Properties - Calculate U-Factor from Layers. You can then enter the properties of each layer of the sandwich panel and click on Calculate U-Factor.</p>
-<li>How do I install a sandwich panel in Revit?</li>
-<p>To install a sandwich panel in Revit, you need to use the Modify tools. You can use the Align tool to align the edges of the sandwich panel with the reference planes or elements. You can use the Move tool to move the sandwich panel to the desired location. You can use the Rotate tool to rotate the sandwich panel around an axis. You can use the Mirror tool to create a symmetrical copy of the sandwich panel. You can use the Array tool to create multiple copies of the sandwich panel along a path or direction.</p>
-</ol></p> 197e85843d<br />
-<br />
-<br />
\ No newline at end of file
diff --git a/spaces/coreml-community/ControlNet-v1-1-Annotators-cpu/annotator/uniformer/mmcv/ops/deform_conv.py b/spaces/coreml-community/ControlNet-v1-1-Annotators-cpu/annotator/uniformer/mmcv/ops/deform_conv.py
deleted file mode 100644
index a3f8c75ee774823eea334e3b3732af6a18f55038..0000000000000000000000000000000000000000
--- a/spaces/coreml-community/ControlNet-v1-1-Annotators-cpu/annotator/uniformer/mmcv/ops/deform_conv.py
+++ /dev/null
@@ -1,405 +0,0 @@
-# Copyright (c) OpenMMLab. All rights reserved.
-from typing import Tuple, Union
-
-import torch
-import torch.nn as nn
-import torch.nn.functional as F
-from torch import Tensor
-from torch.autograd import Function
-from torch.autograd.function import once_differentiable
-from torch.nn.modules.utils import _pair, _single
-
-from annotator.uniformer.mmcv.utils import deprecated_api_warning
-from ..cnn import CONV_LAYERS
-from ..utils import ext_loader, print_log
-
-ext_module = ext_loader.load_ext('_ext', [
-    'deform_conv_forward', 'deform_conv_backward_input',
-    'deform_conv_backward_parameters'
-])
-
-
-class DeformConv2dFunction(Function):
-
-    @staticmethod
-    def symbolic(g,
-                 input,
-                 offset,
-                 weight,
-                 stride,
-                 padding,
-                 dilation,
-                 groups,
-                 deform_groups,
-                 bias=False,
-                 im2col_step=32):
-        return g.op(
-            'mmcv::MMCVDeformConv2d',
-            input,
-            offset,
-            weight,
-            stride_i=stride,
-            padding_i=padding,
-            dilation_i=dilation,
-            groups_i=groups,
-            deform_groups_i=deform_groups,
-            bias_i=bias,
-            im2col_step_i=im2col_step)
-
-    @staticmethod
-    def forward(ctx,
-                input,
-                offset,
-                weight,
-                stride=1,
-                padding=0,
-                dilation=1,
-                groups=1,
-                deform_groups=1,
-                bias=False,
-                im2col_step=32):
-        if input is not None and input.dim() != 4:
-            raise ValueError(
-                f'Expected 4D tensor as input, got {input.dim()}D tensor \
-                  instead.')
-        assert bias is False, 'Only support bias is False.'
-        ctx.stride = _pair(stride)
-        ctx.padding = _pair(padding)
-        ctx.dilation = _pair(dilation)
-        ctx.groups = groups
-        ctx.deform_groups = deform_groups
-        ctx.im2col_step = im2col_step
-
-        # When pytorch version >= 1.6.0, amp is adopted for fp16 mode;
-        # amp won't cast the type of model (float32), but "offset" is cast
-        # to float16 by nn.Conv2d automatically, leading to the type
-        # mismatch with input (when it is float32) or weight.
-        # The flag for whether to use fp16 or amp is the type of "offset",
-        # we cast weight and input to temporarily support fp16 and amp
-        # whatever the pytorch version is.
-        input = input.type_as(offset)
-        weight = weight.type_as(input)
-        ctx.save_for_backward(input, offset, weight)
-
-        output = input.new_empty(
-            DeformConv2dFunction._output_size(ctx, input, weight))
-
-        ctx.bufs_ = [input.new_empty(0), input.new_empty(0)]  # columns, ones
-
-        cur_im2col_step = min(ctx.im2col_step, input.size(0))
-        assert (input.size(0) %
-                cur_im2col_step) == 0, 'im2col step must divide batchsize'
-        ext_module.deform_conv_forward(
-            input,
-            weight,
-            offset,
-            output,
-            ctx.bufs_[0],
-            ctx.bufs_[1],
-            kW=weight.size(3),
-            kH=weight.size(2),
-            dW=ctx.stride[1],
-            dH=ctx.stride[0],
-            padW=ctx.padding[1],
-            padH=ctx.padding[0],
-            dilationW=ctx.dilation[1],
-            dilationH=ctx.dilation[0],
-            group=ctx.groups,
-            deformable_group=ctx.deform_groups,
-            im2col_step=cur_im2col_step)
-        return output
-
-    @staticmethod
-    @once_differentiable
-    def backward(ctx, grad_output):
-        input, offset, weight = ctx.saved_tensors
-
-        grad_input = grad_offset = grad_weight = None
-
-        cur_im2col_step = min(ctx.im2col_step, input.size(0))
-        assert (input.size(0) % cur_im2col_step
-                ) == 0, 'batch size must be divisible by im2col_step'
-
-        grad_output = grad_output.contiguous()
-        if ctx.needs_input_grad[0] or ctx.needs_input_grad[1]:
-            grad_input = torch.zeros_like(input)
-            grad_offset = torch.zeros_like(offset)
-            ext_module.deform_conv_backward_input(
-                input,
-                offset,
-                grad_output,
-                grad_input,
-                grad_offset,
-                weight,
-                ctx.bufs_[0],
-                kW=weight.size(3),
-                kH=weight.size(2),
-                dW=ctx.stride[1],
-                dH=ctx.stride[0],
-                padW=ctx.padding[1],
-                padH=ctx.padding[0],
-                dilationW=ctx.dilation[1],
-                dilationH=ctx.dilation[0],
-                group=ctx.groups,
-                deformable_group=ctx.deform_groups,
-                im2col_step=cur_im2col_step)
-
-        if ctx.needs_input_grad[2]:
-            grad_weight = torch.zeros_like(weight)
-            ext_module.deform_conv_backward_parameters(
-                input,
-                offset,
-                grad_output,
-                grad_weight,
-                ctx.bufs_[0],
-                ctx.bufs_[1],
-                kW=weight.size(3),
-                kH=weight.size(2),
-                dW=ctx.stride[1],
-                dH=ctx.stride[0],
-                padW=ctx.padding[1],
-                padH=ctx.padding[0],
-                dilationW=ctx.dilation[1],
-                dilationH=ctx.dilation[0],
-                group=ctx.groups,
-                deformable_group=ctx.deform_groups,
-                scale=1,
-                im2col_step=cur_im2col_step)
-
-        return grad_input, grad_offset, grad_weight, \
-            None, None, None, None, None, None, None
-
-    @staticmethod
-    def _output_size(ctx, input, weight):
-        channels = weight.size(0)
-        output_size = (input.size(0), channels)
-        for d in range(input.dim() - 2):
-            in_size = input.size(d + 2)
-            pad = ctx.padding[d]
-            kernel = ctx.dilation[d] * (weight.size(d + 2) - 1) + 1
-            stride_ = ctx.stride[d]
-            output_size += ((in_size + (2 * pad) - kernel) // stride_ + 1, )
-        if not all(map(lambda s: s > 0, output_size)):
-            raise ValueError(
-                'convolution input is too small (output would be ' +
-                'x'.join(map(str, output_size)) + ')')
-        return output_size
-
-
-deform_conv2d = DeformConv2dFunction.apply
-
-
-class DeformConv2d(nn.Module):
-    r"""Deformable 2D convolution.
-
-    Applies a deformable 2D convolution over an input signal composed of
-    several input planes. DeformConv2d was described in the paper
-    `Deformable Convolutional Networks
-    <https://arxiv.org/pdf/1703.06211.pdf>`_
-
-    Note:
-        The argument ``im2col_step`` was added in version 1.3.17, which means
-        number of samples processed by the ``im2col_cuda_kernel`` per call.
-        It enables users to define ``batch_size`` and ``im2col_step`` more
-        flexibly and solved `issue mmcv#1440
-        <https://github.com/open-mmlab/mmcv/issues/1440>`_.
-
-    Args:
-        in_channels (int): Number of channels in the input image.
-        out_channels (int): Number of channels produced by the convolution.
-        kernel_size(int, tuple): Size of the convolving kernel.
-        stride(int, tuple): Stride of the convolution. Default: 1.
-        padding (int or tuple): Zero-padding added to both sides of the input.
-            Default: 0.
-        dilation (int or tuple): Spacing between kernel elements. Default: 1.
-        groups (int): Number of blocked connections from input.
-            channels to output channels. Default: 1.
-        deform_groups (int): Number of deformable group partitions.
-        bias (bool): If True, adds a learnable bias to the output.
-            Default: False.
-        im2col_step (int): Number of samples processed by im2col_cuda_kernel
-            per call. It will work when ``batch_size`` > ``im2col_step``, but
-            ``batch_size`` must be divisible by ``im2col_step``. Default: 32.
-            `New in version 1.3.17.`
-    """
-
-    @deprecated_api_warning({'deformable_groups': 'deform_groups'},
-                            cls_name='DeformConv2d')
-    def __init__(self,
-                 in_channels: int,
-                 out_channels: int,
-                 kernel_size: Union[int, Tuple[int, ...]],
-                 stride: Union[int, Tuple[int, ...]] = 1,
-                 padding: Union[int, Tuple[int, ...]] = 0,
-                 dilation: Union[int, Tuple[int, ...]] = 1,
-                 groups: int = 1,
-                 deform_groups: int = 1,
-                 bias: bool = False,
-                 im2col_step: int = 32) -> None:
-        super(DeformConv2d, self).__init__()
-
-        assert not bias, \
-            f'bias={bias} is not supported in DeformConv2d.'
-        assert in_channels % groups == 0, \
-            f'in_channels {in_channels} cannot be divisible by groups {groups}'
-        assert out_channels % groups == 0, \
-            f'out_channels {out_channels} cannot be divisible by groups \
-              {groups}'
-
-        self.in_channels = in_channels
-        self.out_channels = out_channels
-        self.kernel_size = _pair(kernel_size)
-        self.stride = _pair(stride)
-        self.padding = _pair(padding)
-        self.dilation = _pair(dilation)
-        self.groups = groups
-        self.deform_groups = deform_groups
-        self.im2col_step = im2col_step
-        # enable compatibility with nn.Conv2d
-        self.transposed = False
-        self.output_padding = _single(0)
-
-        # only weight, no bias
-        self.weight = nn.Parameter(
-            torch.Tensor(out_channels, in_channels // self.groups,
-                         *self.kernel_size))
-
-        self.reset_parameters()
-
-    def reset_parameters(self):
-        # switch the initialization of `self.weight` to the standard kaiming
-        # method described in `Delving deep into rectifiers: Surpassing
-        # human-level performance on ImageNet classification` - He, K. et al.
-        # (2015), using a uniform distribution
-        nn.init.kaiming_uniform_(self.weight, nonlinearity='relu')
-
-    def forward(self, x: Tensor, offset: Tensor) -> Tensor:
-        """Deformable Convolutional forward function.
-
-        Args:
-            x (Tensor): Input feature, shape (B, C_in, H_in, W_in)
-            offset (Tensor): Offset for deformable convolution, shape
-                (B, deform_groups*kernel_size[0]*kernel_size[1]*2,
-                H_out, W_out), H_out, W_out are equal to the output's.
-
-                An offset is like `[y0, x0, y1, x1, y2, x2, ..., y8, x8]`.
-                The spatial arrangement is like:
-
-                .. code:: text
-
-                    (x0, y0) (x1, y1) (x2, y2)
-                    (x3, y3) (x4, y4) (x5, y5)
-                    (x6, y6) (x7, y7) (x8, y8)
-
-        Returns:
-            Tensor: Output of the layer.
-        """
-        # To fix an assert error in deform_conv_cuda.cpp:128
-        # input image is smaller than kernel
-        input_pad = (x.size(2) < self.kernel_size[0]) or (x.size(3) <
-                                                          self.kernel_size[1])
-        if input_pad:
-            pad_h = max(self.kernel_size[0] - x.size(2), 0)
-            pad_w = max(self.kernel_size[1] - x.size(3), 0)
-            x = F.pad(x, (0, pad_w, 0, pad_h), 'constant', 0).contiguous()
-            offset = F.pad(offset, (0, pad_w, 0, pad_h), 'constant', 0)
-            offset = offset.contiguous()
-        out = deform_conv2d(x, offset, self.weight, self.stride, self.padding,
-                            self.dilation, self.groups, self.deform_groups,
-                            False, self.im2col_step)
-        if input_pad:
-            out = out[:, :, :out.size(2) - pad_h, :out.size(3) -
-                      pad_w].contiguous()
-        return out
-
-    def __repr__(self):
-        s = self.__class__.__name__
-        s += f'(in_channels={self.in_channels},\n'
-        s += f'out_channels={self.out_channels},\n'
-        s += f'kernel_size={self.kernel_size},\n'
-        s += f'stride={self.stride},\n'
-        s += f'padding={self.padding},\n'
-        s += f'dilation={self.dilation},\n'
-        s += f'groups={self.groups},\n'
-        s += f'deform_groups={self.deform_groups},\n'
-        # bias is not supported in DeformConv2d.
-        s += 'bias=False)'
-        return s
-
-
-@CONV_LAYERS.register_module('DCN')
-class DeformConv2dPack(DeformConv2d):
-    """A Deformable Conv Encapsulation that acts as normal Conv layers.
-
-    The offset tensor is like `[y0, x0, y1, x1, y2, x2, ..., y8, x8]`.
-    The spatial arrangement is like:
-
-    .. code:: text
-
-        (x0, y0) (x1, y1) (x2, y2)
-        (x3, y3) (x4, y4) (x5, y5)
-        (x6, y6) (x7, y7) (x8, y8)
-
-    Args:
-        in_channels (int): Same as nn.Conv2d.
-        out_channels (int): Same as nn.Conv2d.
-        kernel_size (int or tuple[int]): Same as nn.Conv2d.
-        stride (int or tuple[int]): Same as nn.Conv2d.
-        padding (int or tuple[int]): Same as nn.Conv2d.
-        dilation (int or tuple[int]): Same as nn.Conv2d.
-        groups (int): Same as nn.Conv2d.
-        bias (bool or str): If specified as `auto`, it will be decided by the
-            norm_cfg. Bias will be set as True if norm_cfg is None, otherwise
-            False.
-    """
-
-    _version = 2
-
-    def __init__(self, *args, **kwargs):
-        super(DeformConv2dPack, self).__init__(*args, **kwargs)
-        self.conv_offset = nn.Conv2d(
-            self.in_channels,
-            self.deform_groups * 2 * self.kernel_size[0] * self.kernel_size[1],
-            kernel_size=self.kernel_size,
-            stride=_pair(self.stride),
-            padding=_pair(self.padding),
-            dilation=_pair(self.dilation),
-            bias=True)
-        self.init_offset()
-
-    def init_offset(self):
-        self.conv_offset.weight.data.zero_()
-        self.conv_offset.bias.data.zero_()
-
-    def forward(self, x):
-        offset = self.conv_offset(x)
-        return deform_conv2d(x, offset, self.weight, self.stride, self.padding,
-                             self.dilation, self.groups, self.deform_groups,
-                             False, self.im2col_step)
-
-    def _load_from_state_dict(self, state_dict, prefix, local_metadata, strict,
-                              missing_keys, unexpected_keys, error_msgs):
-        version = local_metadata.get('version', None)
-
-        if version is None or version < 2:
-            # the key is different in early versions
-            # In version < 2, DeformConvPack loads previous benchmark models.
-            if (prefix + 'conv_offset.weight' not in state_dict
-                    and prefix[:-1] + '_offset.weight' in state_dict):
-                state_dict[prefix + 'conv_offset.weight'] = state_dict.pop(
-                    prefix[:-1] + '_offset.weight')
-            if (prefix + 'conv_offset.bias' not in state_dict
-                    and prefix[:-1] + '_offset.bias' in state_dict):
-                state_dict[prefix +
-                           'conv_offset.bias'] = state_dict.pop(prefix[:-1] +
-                                                                '_offset.bias')
-
-        if version is not None and version > 1:
-            print_log(
-                f'DeformConv2dPack {prefix.rstrip(".")} is upgraded to '
-                'version 2.',
-                logger='root')
-
-        super()._load_from_state_dict(state_dict, prefix, local_metadata,
-                                      strict, missing_keys, unexpected_keys,
-                                      error_msgs)
diff --git a/spaces/coreml-projects/transformers-to-coreml/Dockerfile b/spaces/coreml-projects/transformers-to-coreml/Dockerfile
deleted file mode 100644
index d6c893f48cc4fe6625ab90b7ecf3f5f6a455d58f..0000000000000000000000000000000000000000
--- a/spaces/coreml-projects/transformers-to-coreml/Dockerfile
+++ /dev/null
@@ -1,30 +0,0 @@
-FROM python:3.9.16
-ENV DEBIAN_FRONTEND=noninteractive \
-	TZ=Europe/Paris
-
-# BEGIN root part
-
-# Setup tailscale
-WORKDIR /bin
-ENV TSFILE=tailscale_1.38.2_amd64.tgz
-RUN wget https://pkgs.tailscale.com/stable/${TSFILE} && \
-  tar xzf ${TSFILE} --strip-components=1
-RUN mkdir -p /var/run && ln -s /tmp/tailscale /var/run/tailscale && \
-    mkdir -p /var/cache && ln -s /tmp/tailscale /var/cache/tailscale && \
-    mkdir -p /var/lib && ln -s /tmp/tailscale /var/lib/tailscale && \
-    mkdir -p /var/task && ln -s /tmp/tailscale /var/task/tailscale
-
-# Install socat
-RUN apt-get update && apt-get -y install socat
-
-# User
-RUN useradd -m -u 1000 user
-USER user
-ENV HOME=/home/user \
-	PATH=/home/user/.local/bin:$PATH
-WORKDIR /home/user/app
-
-COPY --link --chown=1000 ./ $HOME/app
-
-ENTRYPOINT $HOME/app/startup.sh
-
diff --git a/spaces/cybercorejapan/human-detection-docker/models/engine/visualizer.py b/spaces/cybercorejapan/human-detection-docker/models/engine/visualizer.py
deleted file mode 100644
index cdb6af3e2f76d6f239638662acae9d3b461d7959..0000000000000000000000000000000000000000
--- a/spaces/cybercorejapan/human-detection-docker/models/engine/visualizer.py
+++ /dev/null
@@ -1,143 +0,0 @@
-from abc import abstractmethod
-from typing import List, Optional
-import cv2
-import subprocess
-import numpy as np 
-
-def putText(img, text: str, position, 
-               text_font: int=0, text_scale: int=1,
-               bg_color=(255,255,255),
-               text_color=(255,0,255),
-               bg_thickness=8, 
-               text_thickness=1, 
-               lineType=cv2.LINE_AA):
-    """ Function to put text on image.
-    
-    Args:
-        img (_type_): 
-        text (str): _description_
-        position (_type_): Top-left position of text.
-        text_font (int, optional): font size of text. Defaults to 0.
-        text_scale (int, optional): text scale. Defaults to 1.
-        bg_color (tuple, optional): text background color. Defaults to (255,255,255).
-        text_color (tuple, optional): text foreground color. Defaults to (255,0,255).
-        bg_thickness (int, optional): text background thickness. Defaults to 8.
-        text_thickness (int, optional): text foreground thickness. Defaults to 1.
-        lineType (_type_, optional): line type. Defaults to cv2.LINE_AA.
-
-    Returns:
-        _type_: _description_
-    """
-    img = cv2.putText(img, text, position, text_font, text_scale, bg_color, thickness=bg_thickness, lineType=lineType)
-    img = cv2.putText(img, text, position, text_font, text_scale, text_color, thickness=text_thickness, lineType=lineType)
-    return img 
-
-
-class BaseVisualizer():
-
-    def __init__(self, class_names: Optional[List[str]], fps: int=-1, min_width: int=-1):
-        """ Visualizer class for visualization (track_results + count_results).
-
-        Args:
-            class_map_ids (Dict): class mapping dictionary to map model's class to original class. Eg {0: 1, 1: 0, 2: 2, 3: 3} mean we swap class ID between 0 and 1.
-            fps (int): FPS for output video. If fps = -1, it will have same fps as input video.
-            min_width (int): minimum width for output video (height will be scaled to keep aspect ratio as input video). If min_width = -1, it will have same resolution as input video.
-        """
-
-        self.fps = fps
-        self.min_width = min_width
-        self.class_names = class_names
-    
-    def init_writer(self, input_video_info: List[int], output_path: str):
-        """ Init video writer for write visualized frame to output video.
-
-        Args:
-            input_video_info (List[int]): It is a list that includes 4 elements of input video information (fps, width, height, num_frames).
-            output_path (str): Path to save output video. 
-        """
-        if (self.fps == -1):
-            self.fps = input_video_info[0]
-        self.width, self.height = input_video_info[1], input_video_info[2]
-        if (self.min_width > 0):
-            out_width = min(self.min_width, self.width)
-            self.height = (self.height * out_width)//self.width
-            self.width = out_width
-        self.output_path = output_path
-        self.writer = cv2.VideoWriter(self.output_path, cv2.VideoWriter_fourcc(*"mp4v"), int(self.fps), (self.width, self.height))
-        
-    @staticmethod
-    def get_color(idx):
-        idx = idx * 3
-        color = ((37 * idx) % 255, (17 * idx) % 255, (29 * idx) % 255)
-
-        return color
-
-    @staticmethod
-    def draw_dash_line(img,pt1,pt2,color,thickness=1,style='dotted',gap=20):
-        dist =((pt1[0]-pt2[0])**2+(pt1[1]-pt2[1])**2)**.5
-        pts= []
-        for i in  np.arange(0,dist,gap):
-            r=i/dist
-            x=int((pt1[0]*(1-r)+pt2[0]*r)+.5)
-            y=int((pt1[1]*(1-r)+pt2[1]*r)+.5)
-            p = (x,y)
-            pts.append(p)
-        if len(pts) ==0: 
-            return
-        if style=='dotted':
-            for p in pts:
-                cv2.circle(img,p,thickness,color,-1)
-        else:
-            s=pts[0]
-            e=pts[0]
-            i=0
-            for p in pts:
-                s=e
-                e=p
-                if i%2==1:
-                    cv2.line(img,s,e,color,thickness)
-                i+=1
-
-    @staticmethod
-    def draw_dash_poly(img,pts,color,thickness=1,style='dotted',gap=20):
-        """ draw a polygon with dash line.
-
-        Args:
-            img (_type_): input image.
-            pts (_type_): _description_
-            color (_type_): _description_
-            thickness (int, optional): _description_. Defaults to 1.
-            style (str, optional): _description_. Defaults to 'dotted'.
-            gap (int, optional): _description_. Defaults to 20.
-
-        Returns:
-            _type_: _description_
-        """
-        s=pts[0]
-        e=pts[0]
-        pts.append(pts.pop(0))
-        for p in pts:
-            s=e
-            e=p
-            BaseVisualizer.draw_dash_line(img,s,e,color,thickness,style,gap=gap)
-        return img
-
-    @staticmethod
-    def draw_dash_rect(img,pt1,pt2,color,thickness=1,style='dotted',gap=10):
-        pts = [pt1,(pt2[0],pt1[1]),pt2,(pt1[0],pt2[1])] 
-        return BaseVisualizer.draw_dash_poly(img,pts,color,thickness,style,gap=gap)   
-    
-    def close(self):
-        """ Function to release video writer. It should be called after finish visualization for all input frames.
-        """
-        self.writer.release()
-    
-    def convert(self):
-        subprocess.run(f"ffmpeg -y -loglevel quiet -stats -i {self.output_path} -c:v libx264 {self.output_path}".split())
-
-    @abstractmethod
-    def visualize(self, *args,**kwargs):
-        """ Each project should implement this function to visualize a frame.
-
-        """
-        raise NotImplementedError
\ No newline at end of file
diff --git a/spaces/dasanik2001/FYP_G15_RCCIIT/app.py b/spaces/dasanik2001/FYP_G15_RCCIIT/app.py
deleted file mode 100644
index fb1d34075cc6809b2f5e3f7d6ad4fe4a3421ab1f..0000000000000000000000000000000000000000
--- a/spaces/dasanik2001/FYP_G15_RCCIIT/app.py
+++ /dev/null
@@ -1,42 +0,0 @@
-import gradio as gr
-import tensorflow
-import numpy as np
-from tensorflow.keras.preprocessing.text import Tokenizer
-from tensorflow.keras.preprocessing.sequence import pad_sequences
-import tensorflow.keras.backend as K
-import pickle
-
-# Load the tokenizer from file
-tokenizer_filename = 'tokenizer.pickle'
-with open(tokenizer_filename, 'rb') as f:
-    tokenizer = pickle.load(f)
-
-print("Tokenizer loaded successfully!")
-
-
-
-# Specify the path to the H5 file
-h5_file_path = 'model_CPU_final.h5'
-
-# Load the model from the H5 file
-model = tensorflow.keras.models.load_model(h5_file_path)
-def get_key(value):
-    dictionary={'positive':0,'negative':1,'neutral':2}
-    for key,val in dictionary.items():
-          if (val==value):
-            return key
-def predict(Input):
-    sentence_lst=[]
-    sentence_lst.append(Input)
-    sentence_seq=tokenizer.texts_to_sequences(sentence_lst)
-    sentence_padded=pad_sequences(sentence_seq,maxlen=300,padding='post')
-    print(model.predict(sentence_padded))
-    ans=get_key(np.argmax(model.predict(sentence_padded), axis=1))
-    # argmax_result = np.argmax(ans, axis=1)
-    return "The emotion predicted is " + ans
-    K.clear_session()
-    # print("The emotion predicted is",ans)
-
-iface = gr.Interface(fn=predict, inputs="text", outputs="label")
-iface.launch()
-
diff --git a/spaces/dassum/Face-Id-Recognition/app.py b/spaces/dassum/Face-Id-Recognition/app.py
deleted file mode 100644
index 6bb51dbb5f735007d643ba03c28299fc4fa54bfb..0000000000000000000000000000000000000000
--- a/spaces/dassum/Face-Id-Recognition/app.py
+++ /dev/null
@@ -1,60 +0,0 @@
-from sentence_transformers import util
-from transformers import pipeline
-from PIL import Image, ImageDraw
-from sentence_transformers import util,SentenceTransformer
-import gradio as gr
-checkpoint = "google/owlvit-base-patch32"
-detector = pipeline(model=checkpoint, task="zero-shot-object-detection")
-model = SentenceTransformer('clip-ViT-L-14')
-
-def get_face_image(im1):
-  predictions = detector(
-    im1,
-    candidate_labels=["human face"],
-  )
-  max_score = 0
-  box_area = None
-  for prediction in predictions:
-      box = prediction["box"]
-      label = prediction["label"]
-      score = prediction["score"]
-      if score > max_score :
-        xmin, ymin, xmax, ymax = box.values()
-        box_area = (xmin, ymin, xmax, ymax)
-        max_score = score
-      else:
-        continue
-      draw = ImageDraw.Draw(im1)
-      draw.rectangle(box_area, outline="red", width=1)
-      #draw.text((xmin, ymin), f"{label}: {round(score,2)}", fill="blue")
-      crop_img1 = im1.crop(box_area)
-      #display(crop_img1)
-      newsize = (256, 256)
-      face_img1 = crop_img1.resize(newsize)
-      #display(face_img1)
-  return face_img1
-
-def predict(im1, im2,inp_sim):
-  face_image1 = get_face_image(im1)
-  face_image2 = get_face_image(im2)
-
-  img_emb = model.encode([face_image1, face_image2])
-  sim = util.cos_sim(img_emb[0], img_emb[1])
-  if sim > inp_sim:
-    return sim, "SAME PERSON, UNLOCK PHONE"
-  else:
-    return sim, "DIFFERENT PEOPLE, DON'T UNLOCK"
-
-
-description = "An application that can recognize if two faces belong to the same person or not"
-title = "Facial Identity Recognition System"
-
-interface = gr.Interface(fn=predict, 
-                         inputs= [gr.Image(type="pil", source="webcam"), 
-                                  gr.Image(type="pil"),
-                                  gr.Slider(0, 1, value=0.8, label="Similarity Percentage", info="Choose betwen 0 and 1")], 
-                         outputs= [gr.Number(label="Similarity"),
-                                   gr.Textbox(label="Message")]
-                         )
-
-interface.launch(debug=True)
\ No newline at end of file
diff --git a/spaces/dbredvick/whisper-webui/src/whisperContainer.py b/spaces/dbredvick/whisper-webui/src/whisperContainer.py
deleted file mode 100644
index c997433c3f422771107f9fcbca2cb18e2f0ad3d6..0000000000000000000000000000000000000000
--- a/spaces/dbredvick/whisper-webui/src/whisperContainer.py
+++ /dev/null
@@ -1,120 +0,0 @@
-# External programs
-import whisper
-
-class WhisperModelCache:
-    def __init__(self):
-        self._cache = dict()
-
-    def get(self, model_name, device: str = None):
-        key = model_name + ":" + (device if device else '')
-
-        result = self._cache.get(key)
-
-        if result is None:
-            print("Loading whisper model " + model_name)
-            result = whisper.load_model(name=model_name, device=device)
-            self._cache[key] = result
-        return result
-
-    def clear(self):
-        self._cache.clear()
-
-# A global cache of models. This is mainly used by the daemon processes to avoid loading the same model multiple times.
-GLOBAL_WHISPER_MODEL_CACHE = WhisperModelCache()
-
-class WhisperContainer:
-    def __init__(self, model_name: str, device: str = None, download_root: str = None, cache: WhisperModelCache = None):
-        self.model_name = model_name
-        self.device = device
-        self.download_root = download_root
-        self.cache = cache
-
-        # Will be created on demand
-        self.model = None
-    
-    def get_model(self):
-        if self.model is None:
-
-            if (self.cache is None):
-                print("Loading whisper model " + self.model_name)
-                self.model = whisper.load_model(self.model_name, device=self.device, download_root=self.download_root)
-            else:
-                self.model = self.cache.get(self.model_name, device=self.device)
-        return self.model
-
-    def create_callback(self, language: str = None, task: str = None, initial_prompt: str = None, **decodeOptions: dict):
-        """
-        Create a WhisperCallback object that can be used to transcript audio files.
-
-        Parameters
-        ----------
-        language: str
-            The target language of the transcription. If not specified, the language will be inferred from the audio content.
-        task: str
-            The task - either translate or transcribe.
-        initial_prompt: str
-            The initial prompt to use for the transcription.
-        decodeOptions: dict
-            Additional options to pass to the decoder. Must be pickleable.
-
-        Returns
-        -------
-        A WhisperCallback object.
-        """
-        return WhisperCallback(self, language=language, task=task, initial_prompt=initial_prompt, **decodeOptions)
-
-    # This is required for multiprocessing
-    def __getstate__(self):
-        return { "model_name": self.model_name, "device": self.device }
-
-    def __setstate__(self, state):
-        self.model_name = state["model_name"]
-        self.device = state["device"]
-        self.model = None
-        # Depickled objects must use the global cache
-        self.cache = GLOBAL_WHISPER_MODEL_CACHE
-
-
-class WhisperCallback:
-    def __init__(self, model_container: WhisperContainer, language: str = None, task: str = None, initial_prompt: str = None, **decodeOptions: dict):
-        self.model_container = model_container
-        self.language = language
-        self.task = task
-        self.initial_prompt = initial_prompt
-        self.decodeOptions = decodeOptions
-        
-    def invoke(self, audio, segment_index: int, prompt: str, detected_language: str):
-        """
-        Peform the transcription of the given audio file or data.
-
-        Parameters
-        ----------
-        audio: Union[str, np.ndarray, torch.Tensor]
-            The audio file to transcribe, or the audio data as a numpy array or torch tensor.
-        segment_index: int
-            The target language of the transcription. If not specified, the language will be inferred from the audio content.
-        task: str
-            The task - either translate or transcribe.
-        prompt: str
-            The prompt to use for the transcription.
-        detected_language: str
-            The detected language of the audio file.
-
-        Returns
-        -------
-        The result of the Whisper call.
-        """
-        model = self.model_container.get_model()
-
-        return model.transcribe(audio, \
-                 language=self.language if self.language else detected_language, task=self.task, \
-                 initial_prompt=self._concat_prompt(self.initial_prompt, prompt) if segment_index == 0 else prompt, \
-                 **self.decodeOptions)
-
-    def _concat_prompt(self, prompt1, prompt2):
-        if (prompt1 is None):
-            return prompt2
-        elif (prompt2 is None):
-            return prompt1
-        else:
-            return prompt1 + " " + prompt2
\ No newline at end of file
diff --git a/spaces/dcarpintero/nlp-summarizer-pegasus/.venv/lib/python3.9/site-packages/fontTools/designspaceLib/__init__.py b/spaces/dcarpintero/nlp-summarizer-pegasus/.venv/lib/python3.9/site-packages/fontTools/designspaceLib/__init__.py
deleted file mode 100644
index 1c71fd002e8afcf4432db0e62b864c78b659d1fc..0000000000000000000000000000000000000000
--- a/spaces/dcarpintero/nlp-summarizer-pegasus/.venv/lib/python3.9/site-packages/fontTools/designspaceLib/__init__.py
+++ /dev/null
@@ -1,3283 +0,0 @@
-from __future__ import annotations
-
-import collections
-import copy
-import itertools
-import math
-import os
-import posixpath
-from io import BytesIO, StringIO
-from textwrap import indent
-from typing import Any, Dict, List, MutableMapping, Optional, Tuple, Union, cast
-
-from fontTools.misc import etree as ET
-from fontTools.misc import plistlib
-from fontTools.misc.loggingTools import LogMixin
-from fontTools.misc.textTools import tobytes, tostr
-
-"""
-    designSpaceDocument
-
-    - read and write designspace files
-"""
-
-__all__ = [
-    "AxisDescriptor",
-    "AxisLabelDescriptor",
-    "AxisMappingDescriptor",
-    "BaseDocReader",
-    "BaseDocWriter",
-    "DesignSpaceDocument",
-    "DesignSpaceDocumentError",
-    "DiscreteAxisDescriptor",
-    "InstanceDescriptor",
-    "LocationLabelDescriptor",
-    "RangeAxisSubsetDescriptor",
-    "RuleDescriptor",
-    "SourceDescriptor",
-    "ValueAxisSubsetDescriptor",
-    "VariableFontDescriptor",
-]
-
-# ElementTree allows to find namespace-prefixed elements, but not attributes
-# so we have to do it ourselves for 'xml:lang'
-XML_NS = "{http://www.w3.org/XML/1998/namespace}"
-XML_LANG = XML_NS + "lang"
-
-
-def posix(path):
-    """Normalize paths using forward slash to work also on Windows."""
-    new_path = posixpath.join(*path.split(os.path.sep))
-    if path.startswith("/"):
-        # The above transformation loses absolute paths
-        new_path = "/" + new_path
-    elif path.startswith(r"\\"):
-        # The above transformation loses leading slashes of UNC path mounts
-        new_path = "//" + new_path
-    return new_path
-
-
-def posixpath_property(private_name):
-    """Generate a propery that holds a path always using forward slashes."""
-
-    def getter(self):
-        # Normal getter
-        return getattr(self, private_name)
-
-    def setter(self, value):
-        # The setter rewrites paths using forward slashes
-        if value is not None:
-            value = posix(value)
-        setattr(self, private_name, value)
-
-    return property(getter, setter)
-
-
-class DesignSpaceDocumentError(Exception):
-    def __init__(self, msg, obj=None):
-        self.msg = msg
-        self.obj = obj
-
-    def __str__(self):
-        return str(self.msg) + (": %r" % self.obj if self.obj is not None else "")
-
-
-class AsDictMixin(object):
-    def asdict(self):
-        d = {}
-        for attr, value in self.__dict__.items():
-            if attr.startswith("_"):
-                continue
-            if hasattr(value, "asdict"):
-                value = value.asdict()
-            elif isinstance(value, list):
-                value = [v.asdict() if hasattr(v, "asdict") else v for v in value]
-            d[attr] = value
-        return d
-
-
-class SimpleDescriptor(AsDictMixin):
-    """Containers for a bunch of attributes"""
-
-    # XXX this is ugly. The 'print' is inappropriate here, and instead of
-    # assert, it should simply return True/False
-    def compare(self, other):
-        # test if this object contains the same data as the other
-        for attr in self._attrs:
-            try:
-                assert getattr(self, attr) == getattr(other, attr)
-            except AssertionError:
-                print(
-                    "failed attribute",
-                    attr,
-                    getattr(self, attr),
-                    "!=",
-                    getattr(other, attr),
-                )
-
-    def __repr__(self):
-        attrs = [f"{a}={repr(getattr(self, a))}," for a in self._attrs]
-        attrs = indent("\n".join(attrs), "    ")
-        return f"{self.__class__.__name__}(\n{attrs}\n)"
-
-
-class SourceDescriptor(SimpleDescriptor):
-    """Simple container for data related to the source
-
-    .. code:: python
-
-        doc = DesignSpaceDocument()
-        s1 = SourceDescriptor()
-        s1.path = masterPath1
-        s1.name = "master.ufo1"
-        s1.font = defcon.Font("master.ufo1")
-        s1.location = dict(weight=0)
-        s1.familyName = "MasterFamilyName"
-        s1.styleName = "MasterStyleNameOne"
-        s1.localisedFamilyName = dict(fr="Caractère")
-        s1.mutedGlyphNames.append("A")
-        s1.mutedGlyphNames.append("Z")
-        doc.addSource(s1)
-
-    """
-
-    flavor = "source"
-    _attrs = [
-        "filename",
-        "path",
-        "name",
-        "layerName",
-        "location",
-        "copyLib",
-        "copyGroups",
-        "copyFeatures",
-        "muteKerning",
-        "muteInfo",
-        "mutedGlyphNames",
-        "familyName",
-        "styleName",
-        "localisedFamilyName",
-    ]
-
-    filename = posixpath_property("_filename")
-    path = posixpath_property("_path")
-
-    def __init__(
-        self,
-        *,
-        filename=None,
-        path=None,
-        font=None,
-        name=None,
-        location=None,
-        designLocation=None,
-        layerName=None,
-        familyName=None,
-        styleName=None,
-        localisedFamilyName=None,
-        copyLib=False,
-        copyInfo=False,
-        copyGroups=False,
-        copyFeatures=False,
-        muteKerning=False,
-        muteInfo=False,
-        mutedGlyphNames=None,
-    ):
-        self.filename = filename
-        """string. A relative path to the source file, **as it is in the document**.
-
-        MutatorMath + VarLib.
-        """
-        self.path = path
-        """The absolute path, calculated from filename."""
-
-        self.font = font
-        """Any Python object. Optional. Points to a representation of this
-        source font that is loaded in memory, as a Python object (e.g. a
-        ``defcon.Font`` or a ``fontTools.ttFont.TTFont``).
-
-        The default document reader will not fill-in this attribute, and the
-        default writer will not use this attribute. It is up to the user of
-        ``designspaceLib`` to either load the resource identified by
-        ``filename`` and store it in this field, or write the contents of
-        this field to the disk and make ```filename`` point to that.
-        """
-
-        self.name = name
-        """string. Optional. Unique identifier name for this source.
-
-        MutatorMath + varLib.
-        """
-
-        self.designLocation = (
-            designLocation if designLocation is not None else location or {}
-        )
-        """dict. Axis values for this source, in design space coordinates.
-
-        MutatorMath + varLib.
-
-        This may be only part of the full design location.
-        See :meth:`getFullDesignLocation()`
-
-        .. versionadded:: 5.0
-        """
-
-        self.layerName = layerName
-        """string. The name of the layer in the source to look for
-        outline data. Default ``None`` which means ``foreground``.
-        """
-        self.familyName = familyName
-        """string. Family name of this source. Though this data
-        can be extracted from the font, it can be efficient to have it right
-        here.
-
-        varLib.
-        """
-        self.styleName = styleName
-        """string. Style name of this source. Though this data
-        can be extracted from the font, it can be efficient to have it right
-        here.
-
-        varLib.
-        """
-        self.localisedFamilyName = localisedFamilyName or {}
-        """dict. A dictionary of localised family name strings, keyed by
-        language code.
-
-        If present, will be used to build localized names for all instances.
-
-        .. versionadded:: 5.0
-        """
-
-        self.copyLib = copyLib
-        """bool. Indicates if the contents of the font.lib need to
-        be copied to the instances.
-
-        MutatorMath.
-
-        .. deprecated:: 5.0
-        """
-        self.copyInfo = copyInfo
-        """bool. Indicates if the non-interpolating font.info needs
-        to be copied to the instances.
-
-        MutatorMath.
-
-        .. deprecated:: 5.0
-        """
-        self.copyGroups = copyGroups
-        """bool. Indicates if the groups need to be copied to the
-        instances.
-
-        MutatorMath.
-
-        .. deprecated:: 5.0
-        """
-        self.copyFeatures = copyFeatures
-        """bool. Indicates if the feature text needs to be
-        copied to the instances.
-
-        MutatorMath.
-
-        .. deprecated:: 5.0
-        """
-        self.muteKerning = muteKerning
-        """bool. Indicates if the kerning data from this source
-        needs to be muted (i.e. not be part of the calculations).
-
-        MutatorMath only.
-        """
-        self.muteInfo = muteInfo
-        """bool. Indicated if the interpolating font.info data for
-        this source needs to be muted.
-
-        MutatorMath only.
-        """
-        self.mutedGlyphNames = mutedGlyphNames or []
-        """list. Glyphnames that need to be muted in the
-        instances.
-
-        MutatorMath only.
-        """
-
-    @property
-    def location(self):
-        """dict. Axis values for this source, in design space coordinates.
-
-        MutatorMath + varLib.
-
-        .. deprecated:: 5.0
-           Use the more explicit alias for this property :attr:`designLocation`.
-        """
-        return self.designLocation
-
-    @location.setter
-    def location(self, location: Optional[AnisotropicLocationDict]):
-        self.designLocation = location or {}
-
-    def setFamilyName(self, familyName, languageCode="en"):
-        """Setter for :attr:`localisedFamilyName`
-
-        .. versionadded:: 5.0
-        """
-        self.localisedFamilyName[languageCode] = tostr(familyName)
-
-    def getFamilyName(self, languageCode="en"):
-        """Getter for :attr:`localisedFamilyName`
-
-        .. versionadded:: 5.0
-        """
-        return self.localisedFamilyName.get(languageCode)
-
-    def getFullDesignLocation(
-        self, doc: "DesignSpaceDocument"
-    ) -> AnisotropicLocationDict:
-        """Get the complete design location of this source, from its
-        :attr:`designLocation` and the document's axis defaults.
-
-        .. versionadded:: 5.0
-        """
-        result: AnisotropicLocationDict = {}
-        for axis in doc.axes:
-            if axis.name in self.designLocation:
-                result[axis.name] = self.designLocation[axis.name]
-            else:
-                result[axis.name] = axis.map_forward(axis.default)
-        return result
-
-
-class RuleDescriptor(SimpleDescriptor):
-    """Represents the rule descriptor element: a set of glyph substitutions to
-    trigger conditionally in some parts of the designspace.
-
-    .. code:: python
-
-        r1 = RuleDescriptor()
-        r1.name = "unique.rule.name"
-        r1.conditionSets.append([dict(name="weight", minimum=-10, maximum=10), dict(...)])
-        r1.conditionSets.append([dict(...), dict(...)])
-        r1.subs.append(("a", "a.alt"))
-
-    .. code:: xml
-
-        <!-- optional: list of substitution rules -->
-        <rules>
-            <rule name="vertical.bars">
-                <conditionset>
-                    <condition minimum="250.000000" maximum="750.000000" name="weight"/>
-                    <condition minimum="100" name="width"/>
-                    <condition minimum="10" maximum="40" name="optical"/>
-                </conditionset>
-                <sub name="cent" with="cent.alt"/>
-                <sub name="dollar" with="dollar.alt"/>
-            </rule>
-        </rules>
-    """
-
-    _attrs = ["name", "conditionSets", "subs"]  # what do we need here
-
-    def __init__(self, *, name=None, conditionSets=None, subs=None):
-        self.name = name
-        """string. Unique name for this rule. Can be used to reference this rule data."""
-        # list of lists of dict(name='aaaa', minimum=0, maximum=1000)
-        self.conditionSets = conditionSets or []
-        """a list of conditionsets.
-
-        -  Each conditionset is a list of conditions.
-        -  Each condition is a dict with ``name``, ``minimum`` and ``maximum`` keys.
-        """
-        # list of substitutions stored as tuples of glyphnames ("a", "a.alt")
-        self.subs = subs or []
-        """list of substitutions.
-
-        -  Each substitution is stored as tuples of glyphnames, e.g. ("a", "a.alt").
-        -  Note: By default, rules are applied first, before other text
-           shaping/OpenType layout, as they are part of the
-           `Required Variation Alternates OpenType feature <https://docs.microsoft.com/en-us/typography/opentype/spec/features_pt#-tag-rvrn>`_.
-           See ref:`rules-element` § Attributes.
-        """
-
-
-def evaluateRule(rule, location):
-    """Return True if any of the rule's conditionsets matches the given location."""
-    return any(evaluateConditions(c, location) for c in rule.conditionSets)
-
-
-def evaluateConditions(conditions, location):
-    """Return True if all the conditions matches the given location.
-
-    - If a condition has no minimum, check for < maximum.
-    - If a condition has no maximum, check for > minimum.
-    """
-    for cd in conditions:
-        value = location[cd["name"]]
-        if cd.get("minimum") is None:
-            if value > cd["maximum"]:
-                return False
-        elif cd.get("maximum") is None:
-            if cd["minimum"] > value:
-                return False
-        elif not cd["minimum"] <= value <= cd["maximum"]:
-            return False
-    return True
-
-
-def processRules(rules, location, glyphNames):
-    """Apply these rules at this location to these glyphnames.
-
-    Return a new list of glyphNames with substitutions applied.
-
-    - rule order matters
-    """
-    newNames = []
-    for rule in rules:
-        if evaluateRule(rule, location):
-            for name in glyphNames:
-                swap = False
-                for a, b in rule.subs:
-                    if name == a:
-                        swap = True
-                        break
-                if swap:
-                    newNames.append(b)
-                else:
-                    newNames.append(name)
-            glyphNames = newNames
-            newNames = []
-    return glyphNames
-
-
-AnisotropicLocationDict = Dict[str, Union[float, Tuple[float, float]]]
-SimpleLocationDict = Dict[str, float]
-
-
-class AxisMappingDescriptor(SimpleDescriptor):
-    """Represents the axis mapping element: mapping an input location
-    to an output location in the designspace.
-
-    .. code:: python
-
-        m1 = AxisMappingDescriptor()
-        m1.inputLocation = {"weight": 900, "width": 150}
-        m1.outputLocation = {"weight": 870}
-
-    .. code:: xml
-
-        <mappings>
-            <mapping>
-                <input>
-                    <dimension name="weight" xvalue="900"/>
-                    <dimension name="width" xvalue="150"/>
-                </input>
-                <output>
-                    <dimension name="weight" xvalue="870"/>
-                </output>
-            </mapping>
-        </mappings>
-    """
-
-    _attrs = ["inputLocation", "outputLocation"]
-
-    def __init__(self, *, inputLocation=None, outputLocation=None):
-        self.inputLocation: SimpleLocationDict = inputLocation or {}
-        """dict. Axis values for the input of the mapping, in design space coordinates.
-
-        varLib.
-
-        .. versionadded:: 5.1
-        """
-        self.outputLocation: SimpleLocationDict = outputLocation or {}
-        """dict. Axis values for the output of the mapping, in design space coordinates.
-
-        varLib.
-
-        .. versionadded:: 5.1
-        """
-
-
-class InstanceDescriptor(SimpleDescriptor):
-    """Simple container for data related to the instance
-
-
-    .. code:: python
-
-        i2 = InstanceDescriptor()
-        i2.path = instancePath2
-        i2.familyName = "InstanceFamilyName"
-        i2.styleName = "InstanceStyleName"
-        i2.name = "instance.ufo2"
-        # anisotropic location
-        i2.designLocation = dict(weight=500, width=(400,300))
-        i2.postScriptFontName = "InstancePostscriptName"
-        i2.styleMapFamilyName = "InstanceStyleMapFamilyName"
-        i2.styleMapStyleName = "InstanceStyleMapStyleName"
-        i2.lib['com.coolDesignspaceApp.specimenText'] = 'Hamburgerwhatever'
-        doc.addInstance(i2)
-    """
-
-    flavor = "instance"
-    _defaultLanguageCode = "en"
-    _attrs = [
-        "filename",
-        "path",
-        "name",
-        "locationLabel",
-        "designLocation",
-        "userLocation",
-        "familyName",
-        "styleName",
-        "postScriptFontName",
-        "styleMapFamilyName",
-        "styleMapStyleName",
-        "localisedFamilyName",
-        "localisedStyleName",
-        "localisedStyleMapFamilyName",
-        "localisedStyleMapStyleName",
-        "glyphs",
-        "kerning",
-        "info",
-        "lib",
-    ]
-
-    filename = posixpath_property("_filename")
-    path = posixpath_property("_path")
-
-    def __init__(
-        self,
-        *,
-        filename=None,
-        path=None,
-        font=None,
-        name=None,
-        location=None,
-        locationLabel=None,
-        designLocation=None,
-        userLocation=None,
-        familyName=None,
-        styleName=None,
-        postScriptFontName=None,
-        styleMapFamilyName=None,
-        styleMapStyleName=None,
-        localisedFamilyName=None,
-        localisedStyleName=None,
-        localisedStyleMapFamilyName=None,
-        localisedStyleMapStyleName=None,
-        glyphs=None,
-        kerning=True,
-        info=True,
-        lib=None,
-    ):
-        self.filename = filename
-        """string. Relative path to the instance file, **as it is
-        in the document**. The file may or may not exist.
-
-        MutatorMath + VarLib.
-        """
-        self.path = path
-        """string. Absolute path to the instance file, calculated from
-        the document path and the string in the filename attr. The file may
-        or may not exist.
-
-        MutatorMath.
-        """
-        self.font = font
-        """Same as :attr:`SourceDescriptor.font`
-
-        .. seealso:: :attr:`SourceDescriptor.font`
-        """
-        self.name = name
-        """string. Unique identifier name of the instance, used to
-        identify it if it needs to be referenced from elsewhere in the
-        document.
-        """
-        self.locationLabel = locationLabel
-        """Name of a :class:`LocationLabelDescriptor`. If
-        provided, the instance should have the same location as the
-        LocationLabel.
-
-        .. seealso::
-           :meth:`getFullDesignLocation`
-           :meth:`getFullUserLocation`
-
-        .. versionadded:: 5.0
-        """
-        self.designLocation: AnisotropicLocationDict = (
-            designLocation if designLocation is not None else (location or {})
-        )
-        """dict. Axis values for this instance, in design space coordinates.
-
-        MutatorMath + varLib.
-
-        .. seealso:: This may be only part of the full location. See:
-           :meth:`getFullDesignLocation`
-           :meth:`getFullUserLocation`
-
-        .. versionadded:: 5.0
-        """
-        self.userLocation: SimpleLocationDict = userLocation or {}
-        """dict. Axis values for this instance, in user space coordinates.
-
-        MutatorMath + varLib.
-
-        .. seealso:: This may be only part of the full location. See:
-           :meth:`getFullDesignLocation`
-           :meth:`getFullUserLocation`
-
-        .. versionadded:: 5.0
-        """
-        self.familyName = familyName
-        """string. Family name of this instance.
-
-        MutatorMath + varLib.
-        """
-        self.styleName = styleName
-        """string. Style name of this instance.
-
-        MutatorMath + varLib.
-        """
-        self.postScriptFontName = postScriptFontName
-        """string. Postscript fontname for this instance.
-
-        MutatorMath + varLib.
-        """
-        self.styleMapFamilyName = styleMapFamilyName
-        """string. StyleMap familyname for this instance.
-
-        MutatorMath + varLib.
-        """
-        self.styleMapStyleName = styleMapStyleName
-        """string. StyleMap stylename for this instance.
-
-        MutatorMath + varLib.
-        """
-        self.localisedFamilyName = localisedFamilyName or {}
-        """dict. A dictionary of localised family name
-        strings, keyed by language code.
-        """
-        self.localisedStyleName = localisedStyleName or {}
-        """dict. A dictionary of localised stylename
-        strings, keyed by language code.
-        """
-        self.localisedStyleMapFamilyName = localisedStyleMapFamilyName or {}
-        """A dictionary of localised style map
-        familyname strings, keyed by language code.
-        """
-        self.localisedStyleMapStyleName = localisedStyleMapStyleName or {}
-        """A dictionary of localised style map
-        stylename strings, keyed by language code.
-        """
-        self.glyphs = glyphs or {}
-        """dict for special master definitions for glyphs. If glyphs
-        need special masters (to record the results of executed rules for
-        example).
-
-        MutatorMath.
-
-        .. deprecated:: 5.0
-            Use rules or sparse sources instead.
-        """
-        self.kerning = kerning
-        """ bool. Indicates if this instance needs its kerning
-        calculated.
-
-        MutatorMath.
-
-        .. deprecated:: 5.0
-        """
-        self.info = info
-        """bool. Indicated if this instance needs the interpolating
-        font.info calculated.
-
-        .. deprecated:: 5.0
-        """
-
-        self.lib = lib or {}
-        """Custom data associated with this instance."""
-
-    @property
-    def location(self):
-        """dict. Axis values for this instance.
-
-        MutatorMath + varLib.
-
-        .. deprecated:: 5.0
-           Use the more explicit alias for this property :attr:`designLocation`.
-        """
-        return self.designLocation
-
-    @location.setter
-    def location(self, location: Optional[AnisotropicLocationDict]):
-        self.designLocation = location or {}
-
-    def setStyleName(self, styleName, languageCode="en"):
-        """These methods give easier access to the localised names."""
-        self.localisedStyleName[languageCode] = tostr(styleName)
-
-    def getStyleName(self, languageCode="en"):
-        return self.localisedStyleName.get(languageCode)
-
-    def setFamilyName(self, familyName, languageCode="en"):
-        self.localisedFamilyName[languageCode] = tostr(familyName)
-
-    def getFamilyName(self, languageCode="en"):
-        return self.localisedFamilyName.get(languageCode)
-
-    def setStyleMapStyleName(self, styleMapStyleName, languageCode="en"):
-        self.localisedStyleMapStyleName[languageCode] = tostr(styleMapStyleName)
-
-    def getStyleMapStyleName(self, languageCode="en"):
-        return self.localisedStyleMapStyleName.get(languageCode)
-
-    def setStyleMapFamilyName(self, styleMapFamilyName, languageCode="en"):
-        self.localisedStyleMapFamilyName[languageCode] = tostr(styleMapFamilyName)
-
-    def getStyleMapFamilyName(self, languageCode="en"):
-        return self.localisedStyleMapFamilyName.get(languageCode)
-
-    def clearLocation(self, axisName: Optional[str] = None):
-        """Clear all location-related fields. Ensures that
-        :attr:``designLocation`` and :attr:``userLocation`` are dictionaries
-        (possibly empty if clearing everything).
-
-        In order to update the location of this instance wholesale, a user
-        should first clear all the fields, then change the field(s) for which
-        they have data.
-
-        .. code:: python
-
-            instance.clearLocation()
-            instance.designLocation = {'Weight': (34, 36.5), 'Width': 100}
-            instance.userLocation = {'Opsz': 16}
-
-        In order to update a single axis location, the user should only clear
-        that axis, then edit the values:
-
-        .. code:: python
-
-            instance.clearLocation('Weight')
-            instance.designLocation['Weight'] = (34, 36.5)
-
-        Args:
-          axisName: if provided, only clear the location for that axis.
-
-        .. versionadded:: 5.0
-        """
-        self.locationLabel = None
-        if axisName is None:
-            self.designLocation = {}
-            self.userLocation = {}
-        else:
-            if self.designLocation is None:
-                self.designLocation = {}
-            if axisName in self.designLocation:
-                del self.designLocation[axisName]
-            if self.userLocation is None:
-                self.userLocation = {}
-            if axisName in self.userLocation:
-                del self.userLocation[axisName]
-
-    def getLocationLabelDescriptor(
-        self, doc: "DesignSpaceDocument"
-    ) -> Optional[LocationLabelDescriptor]:
-        """Get the :class:`LocationLabelDescriptor` instance that matches
-        this instances's :attr:`locationLabel`.
-
-        Raises if the named label can't be found.
-
-        .. versionadded:: 5.0
-        """
-        if self.locationLabel is None:
-            return None
-        label = doc.getLocationLabel(self.locationLabel)
-        if label is None:
-            raise DesignSpaceDocumentError(
-                "InstanceDescriptor.getLocationLabelDescriptor(): "
-                f"unknown location label `{self.locationLabel}` in instance `{self.name}`."
-            )
-        return label
-
-    def getFullDesignLocation(
-        self, doc: "DesignSpaceDocument"
-    ) -> AnisotropicLocationDict:
-        """Get the complete design location of this instance, by combining data
-        from the various location fields, default axis values and mappings, and
-        top-level location labels.
-
-        The source of truth for this instance's location is determined for each
-        axis independently by taking the first not-None field in this list:
-
-        - ``locationLabel``: the location along this axis is the same as the
-          matching STAT format 4 label. No anisotropy.
-        - ``designLocation[axisName]``: the explicit design location along this
-          axis, possibly anisotropic.
-        - ``userLocation[axisName]``: the explicit user location along this
-          axis. No anisotropy.
-        - ``axis.default``: default axis value. No anisotropy.
-
-        .. versionadded:: 5.0
-        """
-        label = self.getLocationLabelDescriptor(doc)
-        if label is not None:
-            return doc.map_forward(label.userLocation)  # type: ignore
-        result: AnisotropicLocationDict = {}
-        for axis in doc.axes:
-            if axis.name in self.designLocation:
-                result[axis.name] = self.designLocation[axis.name]
-            elif axis.name in self.userLocation:
-                result[axis.name] = axis.map_forward(self.userLocation[axis.name])
-            else:
-                result[axis.name] = axis.map_forward(axis.default)
-        return result
-
-    def getFullUserLocation(self, doc: "DesignSpaceDocument") -> SimpleLocationDict:
-        """Get the complete user location for this instance.
-
-        .. seealso:: :meth:`getFullDesignLocation`
-
-        .. versionadded:: 5.0
-        """
-        return doc.map_backward(self.getFullDesignLocation(doc))
-
-
-def tagForAxisName(name):
-    # try to find or make a tag name for this axis name
-    names = {
-        "weight": ("wght", dict(en="Weight")),
-        "width": ("wdth", dict(en="Width")),
-        "optical": ("opsz", dict(en="Optical Size")),
-        "slant": ("slnt", dict(en="Slant")),
-        "italic": ("ital", dict(en="Italic")),
-    }
-    if name.lower() in names:
-        return names[name.lower()]
-    if len(name) < 4:
-        tag = name + "*" * (4 - len(name))
-    else:
-        tag = name[:4]
-    return tag, dict(en=name)
-
-
-class AbstractAxisDescriptor(SimpleDescriptor):
-    flavor = "axis"
-
-    def __init__(
-        self,
-        *,
-        tag=None,
-        name=None,
-        labelNames=None,
-        hidden=False,
-        map=None,
-        axisOrdering=None,
-        axisLabels=None,
-    ):
-        # opentype tag for this axis
-        self.tag = tag
-        """string. Four letter tag for this axis. Some might be
-        registered at the `OpenType
-        specification <https://www.microsoft.com/typography/otspec/fvar.htm#VAT>`__.
-        Privately-defined axis tags must begin with an uppercase letter and
-        use only uppercase letters or digits.
-        """
-        # name of the axis used in locations
-        self.name = name
-        """string. Name of the axis as it is used in the location dicts.
-
-        MutatorMath + varLib.
-        """
-        # names for UI purposes, if this is not a standard axis,
-        self.labelNames = labelNames or {}
-        """dict. When defining a non-registered axis, it will be
-        necessary to define user-facing readable names for the axis. Keyed by
-        xml:lang code. Values are required to be ``unicode`` strings, even if
-        they only contain ASCII characters.
-        """
-        self.hidden = hidden
-        """bool. Whether this axis should be hidden in user interfaces.
-        """
-        self.map = map or []
-        """list of input / output values that can describe a warp of user space
-        to design space coordinates. If no map values are present, it is assumed
-        user space is the same as design space, as in [(minimum, minimum),
-        (maximum, maximum)].
-
-        varLib.
-        """
-        self.axisOrdering = axisOrdering
-        """STAT table field ``axisOrdering``.
-
-        See: `OTSpec STAT Axis Record <https://docs.microsoft.com/en-us/typography/opentype/spec/stat#axis-records>`_
-
-        .. versionadded:: 5.0
-        """
-        self.axisLabels: List[AxisLabelDescriptor] = axisLabels or []
-        """STAT table entries for Axis Value Tables format 1, 2, 3.
-
-        See: `OTSpec STAT Axis Value Tables <https://docs.microsoft.com/en-us/typography/opentype/spec/stat#axis-value-tables>`_
-
-        .. versionadded:: 5.0
-        """
-
-
-class AxisDescriptor(AbstractAxisDescriptor):
-    """Simple container for the axis data.
-
-    Add more localisations?
-
-    .. code:: python
-
-        a1 = AxisDescriptor()
-        a1.minimum = 1
-        a1.maximum = 1000
-        a1.default = 400
-        a1.name = "weight"
-        a1.tag = "wght"
-        a1.labelNames['fa-IR'] = "قطر"
-        a1.labelNames['en'] = "Wéíght"
-        a1.map = [(1.0, 10.0), (400.0, 66.0), (1000.0, 990.0)]
-        a1.axisOrdering = 1
-        a1.axisLabels = [
-            AxisLabelDescriptor(name="Regular", userValue=400, elidable=True)
-        ]
-        doc.addAxis(a1)
-    """
-
-    _attrs = [
-        "tag",
-        "name",
-        "maximum",
-        "minimum",
-        "default",
-        "map",
-        "axisOrdering",
-        "axisLabels",
-    ]
-
-    def __init__(
-        self,
-        *,
-        tag=None,
-        name=None,
-        labelNames=None,
-        minimum=None,
-        default=None,
-        maximum=None,
-        hidden=False,
-        map=None,
-        axisOrdering=None,
-        axisLabels=None,
-    ):
-        super().__init__(
-            tag=tag,
-            name=name,
-            labelNames=labelNames,
-            hidden=hidden,
-            map=map,
-            axisOrdering=axisOrdering,
-            axisLabels=axisLabels,
-        )
-        self.minimum = minimum
-        """number. The minimum value for this axis in user space.
-
-        MutatorMath + varLib.
-        """
-        self.maximum = maximum
-        """number. The maximum value for this axis in user space.
-
-        MutatorMath + varLib.
-        """
-        self.default = default
-        """number. The default value for this axis, i.e. when a new location is
-        created, this is the value this axis will get in user space.
-
-        MutatorMath + varLib.
-        """
-
-    def serialize(self):
-        # output to a dict, used in testing
-        return dict(
-            tag=self.tag,
-            name=self.name,
-            labelNames=self.labelNames,
-            maximum=self.maximum,
-            minimum=self.minimum,
-            default=self.default,
-            hidden=self.hidden,
-            map=self.map,
-            axisOrdering=self.axisOrdering,
-            axisLabels=self.axisLabels,
-        )
-
-    def map_forward(self, v):
-        """Maps value from axis mapping's input (user) to output (design)."""
-        from fontTools.varLib.models import piecewiseLinearMap
-
-        if not self.map:
-            return v
-        return piecewiseLinearMap(v, {k: v for k, v in self.map})
-
-    def map_backward(self, v):
-        """Maps value from axis mapping's output (design) to input (user)."""
-        from fontTools.varLib.models import piecewiseLinearMap
-
-        if isinstance(v, tuple):
-            v = v[0]
-        if not self.map:
-            return v
-        return piecewiseLinearMap(v, {v: k for k, v in self.map})
-
-
-class DiscreteAxisDescriptor(AbstractAxisDescriptor):
-    """Container for discrete axis data.
-
-    Use this for axes that do not interpolate. The main difference from a
-    continuous axis is that a continuous axis has a ``minimum`` and ``maximum``,
-    while a discrete axis has a list of ``values``.
-
-    Example: an Italic axis with 2 stops, Roman and Italic, that are not
-    compatible. The axis still allows to bind together the full font family,
-    which is useful for the STAT table, however it can't become a variation
-    axis in a VF.
-
-    .. code:: python
-
-        a2 = DiscreteAxisDescriptor()
-        a2.values = [0, 1]
-        a2.default = 0
-        a2.name = "Italic"
-        a2.tag = "ITAL"
-        a2.labelNames['fr'] = "Italique"
-        a2.map = [(0, 0), (1, -11)]
-        a2.axisOrdering = 2
-        a2.axisLabels = [
-            AxisLabelDescriptor(name="Roman", userValue=0, elidable=True)
-        ]
-        doc.addAxis(a2)
-
-    .. versionadded:: 5.0
-    """
-
-    flavor = "axis"
-    _attrs = ("tag", "name", "values", "default", "map", "axisOrdering", "axisLabels")
-
-    def __init__(
-        self,
-        *,
-        tag=None,
-        name=None,
-        labelNames=None,
-        values=None,
-        default=None,
-        hidden=False,
-        map=None,
-        axisOrdering=None,
-        axisLabels=None,
-    ):
-        super().__init__(
-            tag=tag,
-            name=name,
-            labelNames=labelNames,
-            hidden=hidden,
-            map=map,
-            axisOrdering=axisOrdering,
-            axisLabels=axisLabels,
-        )
-        self.default: float = default
-        """The default value for this axis, i.e. when a new location is
-        created, this is the value this axis will get in user space.
-
-        However, this default value is less important than in continuous axes:
-
-        -  it doesn't define the "neutral" version of outlines from which
-           deltas would apply, as this axis does not interpolate.
-        -  it doesn't provide the reference glyph set for the designspace, as
-           fonts at each value can have different glyph sets.
-        """
-        self.values: List[float] = values or []
-        """List of possible values for this axis. Contrary to continuous axes,
-        only the values in this list can be taken by the axis, nothing in-between.
-        """
-
-    def map_forward(self, value):
-        """Maps value from axis mapping's input to output.
-
-        Returns value unchanged if no mapping entry is found.
-
-        Note: for discrete axes, each value must have its mapping entry, if
-        you intend that value to be mapped.
-        """
-        return next((v for k, v in self.map if k == value), value)
-
-    def map_backward(self, value):
-        """Maps value from axis mapping's output to input.
-
-        Returns value unchanged if no mapping entry is found.
-
-        Note: for discrete axes, each value must have its mapping entry, if
-        you intend that value to be mapped.
-        """
-        if isinstance(value, tuple):
-            value = value[0]
-        return next((k for k, v in self.map if v == value), value)
-
-
-class AxisLabelDescriptor(SimpleDescriptor):
-    """Container for axis label data.
-
-    Analogue of OpenType's STAT data for a single axis (formats 1, 2 and 3).
-    All values are user values.
-    See: `OTSpec STAT Axis value table, format 1, 2, 3 <https://docs.microsoft.com/en-us/typography/opentype/spec/stat#axis-value-table-format-1>`_
-
-    The STAT format of the Axis value depends on which field are filled-in,
-    see :meth:`getFormat`
-
-    .. versionadded:: 5.0
-    """
-
-    flavor = "label"
-    _attrs = (
-        "userMinimum",
-        "userValue",
-        "userMaximum",
-        "name",
-        "elidable",
-        "olderSibling",
-        "linkedUserValue",
-        "labelNames",
-    )
-
-    def __init__(
-        self,
-        *,
-        name,
-        userValue,
-        userMinimum=None,
-        userMaximum=None,
-        elidable=False,
-        olderSibling=False,
-        linkedUserValue=None,
-        labelNames=None,
-    ):
-        self.userMinimum: Optional[float] = userMinimum
-        """STAT field ``rangeMinValue`` (format 2)."""
-        self.userValue: float = userValue
-        """STAT field ``value`` (format 1, 3) or ``nominalValue`` (format 2)."""
-        self.userMaximum: Optional[float] = userMaximum
-        """STAT field ``rangeMaxValue`` (format 2)."""
-        self.name: str = name
-        """Label for this axis location, STAT field ``valueNameID``."""
-        self.elidable: bool = elidable
-        """STAT flag ``ELIDABLE_AXIS_VALUE_NAME``.
-
-        See: `OTSpec STAT Flags <https://docs.microsoft.com/en-us/typography/opentype/spec/stat#flags>`_
-        """
-        self.olderSibling: bool = olderSibling
-        """STAT flag ``OLDER_SIBLING_FONT_ATTRIBUTE``.
-
-        See: `OTSpec STAT Flags <https://docs.microsoft.com/en-us/typography/opentype/spec/stat#flags>`_
-        """
-        self.linkedUserValue: Optional[float] = linkedUserValue
-        """STAT field ``linkedValue`` (format 3)."""
-        self.labelNames: MutableMapping[str, str] = labelNames or {}
-        """User-facing translations of this location's label. Keyed by
-        ``xml:lang`` code.
-        """
-
-    def getFormat(self) -> int:
-        """Determine which format of STAT Axis value to use to encode this label.
-
-        ===========  =========  ===========  ===========  ===============
-        STAT Format  userValue  userMinimum  userMaximum  linkedUserValue
-        ===========  =========  ===========  ===========  ===============
-        1            ✅          ❌            ❌            ❌
-        2            ✅          ✅            ✅            ❌
-        3            ✅          ❌            ❌            ✅
-        ===========  =========  ===========  ===========  ===============
-        """
-        if self.linkedUserValue is not None:
-            return 3
-        if self.userMinimum is not None or self.userMaximum is not None:
-            return 2
-        return 1
-
-    @property
-    def defaultName(self) -> str:
-        """Return the English name from :attr:`labelNames` or the :attr:`name`."""
-        return self.labelNames.get("en") or self.name
-
-
-class LocationLabelDescriptor(SimpleDescriptor):
-    """Container for location label data.
-
-    Analogue of OpenType's STAT data for a free-floating location (format 4).
-    All values are user values.
-
-    See: `OTSpec STAT Axis value table, format 4 <https://docs.microsoft.com/en-us/typography/opentype/spec/stat#axis-value-table-format-4>`_
-
-    .. versionadded:: 5.0
-    """
-
-    flavor = "label"
-    _attrs = ("name", "elidable", "olderSibling", "userLocation", "labelNames")
-
-    def __init__(
-        self,
-        *,
-        name,
-        userLocation,
-        elidable=False,
-        olderSibling=False,
-        labelNames=None,
-    ):
-        self.name: str = name
-        """Label for this named location, STAT field ``valueNameID``."""
-        self.userLocation: SimpleLocationDict = userLocation or {}
-        """Location in user coordinates along each axis.
-
-        If an axis is not mentioned, it is assumed to be at its default location.
-
-        .. seealso:: This may be only part of the full location. See:
-           :meth:`getFullUserLocation`
-        """
-        self.elidable: bool = elidable
-        """STAT flag ``ELIDABLE_AXIS_VALUE_NAME``.
-
-        See: `OTSpec STAT Flags <https://docs.microsoft.com/en-us/typography/opentype/spec/stat#flags>`_
-        """
-        self.olderSibling: bool = olderSibling
-        """STAT flag ``OLDER_SIBLING_FONT_ATTRIBUTE``.
-
-        See: `OTSpec STAT Flags <https://docs.microsoft.com/en-us/typography/opentype/spec/stat#flags>`_
-        """
-        self.labelNames: Dict[str, str] = labelNames or {}
-        """User-facing translations of this location's label. Keyed by
-        xml:lang code.
-        """
-
-    @property
-    def defaultName(self) -> str:
-        """Return the English name from :attr:`labelNames` or the :attr:`name`."""
-        return self.labelNames.get("en") or self.name
-
-    def getFullUserLocation(self, doc: "DesignSpaceDocument") -> SimpleLocationDict:
-        """Get the complete user location of this label, by combining data
-        from the explicit user location and default axis values.
-
-        .. versionadded:: 5.0
-        """
-        return {
-            axis.name: self.userLocation.get(axis.name, axis.default)
-            for axis in doc.axes
-        }
-
-
-class VariableFontDescriptor(SimpleDescriptor):
-    """Container for variable fonts, sub-spaces of the Designspace.
-
-    Use-cases:
-
-    - From a single DesignSpace with discrete axes, define 1 variable font
-      per value on the discrete axes. Before version 5, you would have needed
-      1 DesignSpace per such variable font, and a lot of data duplication.
-    - From a big variable font with many axes, define subsets of that variable
-      font that only include some axes and freeze other axes at a given location.
-
-    .. versionadded:: 5.0
-    """
-
-    flavor = "variable-font"
-    _attrs = ("filename", "axisSubsets", "lib")
-
-    filename = posixpath_property("_filename")
-
-    def __init__(self, *, name, filename=None, axisSubsets=None, lib=None):
-        self.name: str = name
-        """string, required. Name of this variable to identify it during the
-        build process and from other parts of the document, and also as a
-        filename in case the filename property is empty.
-
-        VarLib.
-        """
-        self.filename: str = filename
-        """string, optional. Relative path to the variable font file, **as it is
-        in the document**. The file may or may not exist.
-
-        If not specified, the :attr:`name` will be used as a basename for the file.
-        """
-        self.axisSubsets: List[
-            Union[RangeAxisSubsetDescriptor, ValueAxisSubsetDescriptor]
-        ] = (axisSubsets or [])
-        """Axis subsets to include in this variable font.
-
-        If an axis is not mentioned, assume that we only want the default
-        location of that axis (same as a :class:`ValueAxisSubsetDescriptor`).
-        """
-        self.lib: MutableMapping[str, Any] = lib or {}
-        """Custom data associated with this variable font."""
-
-
-class RangeAxisSubsetDescriptor(SimpleDescriptor):
-    """Subset of a continuous axis to include in a variable font.
-
-    .. versionadded:: 5.0
-    """
-
-    flavor = "axis-subset"
-    _attrs = ("name", "userMinimum", "userDefault", "userMaximum")
-
-    def __init__(
-        self, *, name, userMinimum=-math.inf, userDefault=None, userMaximum=math.inf
-    ):
-        self.name: str = name
-        """Name of the :class:`AxisDescriptor` to subset."""
-        self.userMinimum: float = userMinimum
-        """New minimum value of the axis in the target variable font.
-        If not specified, assume the same minimum value as the full axis.
-        (default = ``-math.inf``)
-        """
-        self.userDefault: Optional[float] = userDefault
-        """New default value of the axis in the target variable font.
-        If not specified, assume the same default value as the full axis.
-        (default = ``None``)
-        """
-        self.userMaximum: float = userMaximum
-        """New maximum value of the axis in the target variable font.
-        If not specified, assume the same maximum value as the full axis.
-        (default = ``math.inf``)
-        """
-
-
-class ValueAxisSubsetDescriptor(SimpleDescriptor):
-    """Single value of a discrete or continuous axis to use in a variable font.
-
-    .. versionadded:: 5.0
-    """
-
-    flavor = "axis-subset"
-    _attrs = ("name", "userValue")
-
-    def __init__(self, *, name, userValue):
-        self.name: str = name
-        """Name of the :class:`AxisDescriptor` or :class:`DiscreteAxisDescriptor`
-        to "snapshot" or "freeze".
-        """
-        self.userValue: float = userValue
-        """Value in user coordinates at which to freeze the given axis."""
-
-
-class BaseDocWriter(object):
-    _whiteSpace = "    "
-    axisDescriptorClass = AxisDescriptor
-    discreteAxisDescriptorClass = DiscreteAxisDescriptor
-    axisLabelDescriptorClass = AxisLabelDescriptor
-    axisMappingDescriptorClass = AxisMappingDescriptor
-    locationLabelDescriptorClass = LocationLabelDescriptor
-    ruleDescriptorClass = RuleDescriptor
-    sourceDescriptorClass = SourceDescriptor
-    variableFontDescriptorClass = VariableFontDescriptor
-    valueAxisSubsetDescriptorClass = ValueAxisSubsetDescriptor
-    rangeAxisSubsetDescriptorClass = RangeAxisSubsetDescriptor
-    instanceDescriptorClass = InstanceDescriptor
-
-    @classmethod
-    def getAxisDecriptor(cls):
-        return cls.axisDescriptorClass()
-
-    @classmethod
-    def getAxisMappingDescriptor(cls):
-        return cls.axisMappingDescriptorClass()
-
-    @classmethod
-    def getSourceDescriptor(cls):
-        return cls.sourceDescriptorClass()
-
-    @classmethod
-    def getInstanceDescriptor(cls):
-        return cls.instanceDescriptorClass()
-
-    @classmethod
-    def getRuleDescriptor(cls):
-        return cls.ruleDescriptorClass()
-
-    def __init__(self, documentPath, documentObject: DesignSpaceDocument):
-        self.path = documentPath
-        self.documentObject = documentObject
-        self.effectiveFormatTuple = self._getEffectiveFormatTuple()
-        self.root = ET.Element("designspace")
-
-    def write(self, pretty=True, encoding="UTF-8", xml_declaration=True):
-        self.root.attrib["format"] = ".".join(str(i) for i in self.effectiveFormatTuple)
-
-        if (
-            self.documentObject.axes
-            or self.documentObject.axisMappings
-            or self.documentObject.elidedFallbackName is not None
-        ):
-            axesElement = ET.Element("axes")
-            if self.documentObject.elidedFallbackName is not None:
-                axesElement.attrib[
-                    "elidedfallbackname"
-                ] = self.documentObject.elidedFallbackName
-            self.root.append(axesElement)
-        for axisObject in self.documentObject.axes:
-            self._addAxis(axisObject)
-
-        if self.documentObject.axisMappings:
-            mappingsElement = ET.Element("mappings")
-            self.root.findall(".axes")[0].append(mappingsElement)
-            for mappingObject in self.documentObject.axisMappings:
-                self._addAxisMapping(mappingsElement, mappingObject)
-
-        if self.documentObject.locationLabels:
-            labelsElement = ET.Element("labels")
-            for labelObject in self.documentObject.locationLabels:
-                self._addLocationLabel(labelsElement, labelObject)
-            self.root.append(labelsElement)
-
-        if self.documentObject.rules:
-            if getattr(self.documentObject, "rulesProcessingLast", False):
-                attributes = {"processing": "last"}
-            else:
-                attributes = {}
-            self.root.append(ET.Element("rules", attributes))
-        for ruleObject in self.documentObject.rules:
-            self._addRule(ruleObject)
-
-        if self.documentObject.sources:
-            self.root.append(ET.Element("sources"))
-        for sourceObject in self.documentObject.sources:
-            self._addSource(sourceObject)
-
-        if self.documentObject.variableFonts:
-            variableFontsElement = ET.Element("variable-fonts")
-            for variableFont in self.documentObject.variableFonts:
-                self._addVariableFont(variableFontsElement, variableFont)
-            self.root.append(variableFontsElement)
-
-        if self.documentObject.instances:
-            self.root.append(ET.Element("instances"))
-        for instanceObject in self.documentObject.instances:
-            self._addInstance(instanceObject)
-
-        if self.documentObject.lib:
-            self._addLib(self.root, self.documentObject.lib, 2)
-
-        tree = ET.ElementTree(self.root)
-        tree.write(
-            self.path,
-            encoding=encoding,
-            method="xml",
-            xml_declaration=xml_declaration,
-            pretty_print=pretty,
-        )
-
-    def _getEffectiveFormatTuple(self):
-        """Try to use the version specified in the document, or a sufficiently
-        recent version to be able to encode what the document contains.
-        """
-        minVersion = self.documentObject.formatTuple
-        if (
-            any(
-                hasattr(axis, "values")
-                or axis.axisOrdering is not None
-                or axis.axisLabels
-                for axis in self.documentObject.axes
-            )
-            or self.documentObject.locationLabels
-            or any(source.localisedFamilyName for source in self.documentObject.sources)
-            or self.documentObject.variableFonts
-            or any(
-                instance.locationLabel or instance.userLocation
-                for instance in self.documentObject.instances
-            )
-        ):
-            if minVersion < (5, 0):
-                minVersion = (5, 0)
-        if self.documentObject.axisMappings:
-            if minVersion < (5, 1):
-                minVersion = (5, 1)
-        return minVersion
-
-    def _makeLocationElement(self, locationObject, name=None):
-        """Convert Location dict to a locationElement."""
-        locElement = ET.Element("location")
-        if name is not None:
-            locElement.attrib["name"] = name
-        validatedLocation = self.documentObject.newDefaultLocation()
-        for axisName, axisValue in locationObject.items():
-            if axisName in validatedLocation:
-                # only accept values we know
-                validatedLocation[axisName] = axisValue
-        for dimensionName, dimensionValue in validatedLocation.items():
-            dimElement = ET.Element("dimension")
-            dimElement.attrib["name"] = dimensionName
-            if type(dimensionValue) == tuple:
-                dimElement.attrib["xvalue"] = self.intOrFloat(dimensionValue[0])
-                dimElement.attrib["yvalue"] = self.intOrFloat(dimensionValue[1])
-            else:
-                dimElement.attrib["xvalue"] = self.intOrFloat(dimensionValue)
-            locElement.append(dimElement)
-        return locElement, validatedLocation
-
-    def intOrFloat(self, num):
-        if int(num) == num:
-            return "%d" % num
-        return ("%f" % num).rstrip("0").rstrip(".")
-
-    def _addRule(self, ruleObject):
-        # if none of the conditions have minimum or maximum values, do not add the rule.
-        ruleElement = ET.Element("rule")
-        if ruleObject.name is not None:
-            ruleElement.attrib["name"] = ruleObject.name
-        for conditions in ruleObject.conditionSets:
-            conditionsetElement = ET.Element("conditionset")
-            for cond in conditions:
-                if cond.get("minimum") is None and cond.get("maximum") is None:
-                    # neither is defined, don't add this condition
-                    continue
-                conditionElement = ET.Element("condition")
-                conditionElement.attrib["name"] = cond.get("name")
-                if cond.get("minimum") is not None:
-                    conditionElement.attrib["minimum"] = self.intOrFloat(
-                        cond.get("minimum")
-                    )
-                if cond.get("maximum") is not None:
-                    conditionElement.attrib["maximum"] = self.intOrFloat(
-                        cond.get("maximum")
-                    )
-                conditionsetElement.append(conditionElement)
-            if len(conditionsetElement):
-                ruleElement.append(conditionsetElement)
-        for sub in ruleObject.subs:
-            subElement = ET.Element("sub")
-            subElement.attrib["name"] = sub[0]
-            subElement.attrib["with"] = sub[1]
-            ruleElement.append(subElement)
-        if len(ruleElement):
-            self.root.findall(".rules")[0].append(ruleElement)
-
-    def _addAxis(self, axisObject):
-        axisElement = ET.Element("axis")
-        axisElement.attrib["tag"] = axisObject.tag
-        axisElement.attrib["name"] = axisObject.name
-        self._addLabelNames(axisElement, axisObject.labelNames)
-        if axisObject.map:
-            for inputValue, outputValue in axisObject.map:
-                mapElement = ET.Element("map")
-                mapElement.attrib["input"] = self.intOrFloat(inputValue)
-                mapElement.attrib["output"] = self.intOrFloat(outputValue)
-                axisElement.append(mapElement)
-        if axisObject.axisOrdering or axisObject.axisLabels:
-            labelsElement = ET.Element("labels")
-            if axisObject.axisOrdering is not None:
-                labelsElement.attrib["ordering"] = str(axisObject.axisOrdering)
-            for label in axisObject.axisLabels:
-                self._addAxisLabel(labelsElement, label)
-            axisElement.append(labelsElement)
-        if hasattr(axisObject, "minimum"):
-            axisElement.attrib["minimum"] = self.intOrFloat(axisObject.minimum)
-            axisElement.attrib["maximum"] = self.intOrFloat(axisObject.maximum)
-        elif hasattr(axisObject, "values"):
-            axisElement.attrib["values"] = " ".join(
-                self.intOrFloat(v) for v in axisObject.values
-            )
-        axisElement.attrib["default"] = self.intOrFloat(axisObject.default)
-        if axisObject.hidden:
-            axisElement.attrib["hidden"] = "1"
-        self.root.findall(".axes")[0].append(axisElement)
-
-    def _addAxisMapping(self, mappingsElement, mappingObject):
-        mappingElement = ET.Element("mapping")
-        for what in ("inputLocation", "outputLocation"):
-            whatObject = getattr(mappingObject, what, None)
-            if whatObject is None:
-                continue
-            whatElement = ET.Element(what[:-8])
-            mappingElement.append(whatElement)
-
-            for name, value in whatObject.items():
-                dimensionElement = ET.Element("dimension")
-                dimensionElement.attrib["name"] = name
-                dimensionElement.attrib["xvalue"] = self.intOrFloat(value)
-                whatElement.append(dimensionElement)
-
-        mappingsElement.append(mappingElement)
-
-    def _addAxisLabel(
-        self, axisElement: ET.Element, label: AxisLabelDescriptor
-    ) -> None:
-        labelElement = ET.Element("label")
-        labelElement.attrib["uservalue"] = self.intOrFloat(label.userValue)
-        if label.userMinimum is not None:
-            labelElement.attrib["userminimum"] = self.intOrFloat(label.userMinimum)
-        if label.userMaximum is not None:
-            labelElement.attrib["usermaximum"] = self.intOrFloat(label.userMaximum)
-        labelElement.attrib["name"] = label.name
-        if label.elidable:
-            labelElement.attrib["elidable"] = "true"
-        if label.olderSibling:
-            labelElement.attrib["oldersibling"] = "true"
-        if label.linkedUserValue is not None:
-            labelElement.attrib["linkeduservalue"] = self.intOrFloat(
-                label.linkedUserValue
-            )
-        self._addLabelNames(labelElement, label.labelNames)
-        axisElement.append(labelElement)
-
-    def _addLabelNames(self, parentElement, labelNames):
-        for languageCode, labelName in sorted(labelNames.items()):
-            languageElement = ET.Element("labelname")
-            languageElement.attrib[XML_LANG] = languageCode
-            languageElement.text = labelName
-            parentElement.append(languageElement)
-
-    def _addLocationLabel(
-        self, parentElement: ET.Element, label: LocationLabelDescriptor
-    ) -> None:
-        labelElement = ET.Element("label")
-        labelElement.attrib["name"] = label.name
-        if label.elidable:
-            labelElement.attrib["elidable"] = "true"
-        if label.olderSibling:
-            labelElement.attrib["oldersibling"] = "true"
-        self._addLabelNames(labelElement, label.labelNames)
-        self._addLocationElement(labelElement, userLocation=label.userLocation)
-        parentElement.append(labelElement)
-
-    def _addLocationElement(
-        self,
-        parentElement,
-        *,
-        designLocation: AnisotropicLocationDict = None,
-        userLocation: SimpleLocationDict = None,
-    ):
-        locElement = ET.Element("location")
-        for axis in self.documentObject.axes:
-            if designLocation is not None and axis.name in designLocation:
-                dimElement = ET.Element("dimension")
-                dimElement.attrib["name"] = axis.name
-                value = designLocation[axis.name]
-                if isinstance(value, tuple):
-                    dimElement.attrib["xvalue"] = self.intOrFloat(value[0])
-                    dimElement.attrib["yvalue"] = self.intOrFloat(value[1])
-                else:
-                    dimElement.attrib["xvalue"] = self.intOrFloat(value)
-                locElement.append(dimElement)
-            elif userLocation is not None and axis.name in userLocation:
-                dimElement = ET.Element("dimension")
-                dimElement.attrib["name"] = axis.name
-                value = userLocation[axis.name]
-                dimElement.attrib["uservalue"] = self.intOrFloat(value)
-                locElement.append(dimElement)
-        if len(locElement) > 0:
-            parentElement.append(locElement)
-
-    def _addInstance(self, instanceObject):
-        instanceElement = ET.Element("instance")
-        if instanceObject.name is not None:
-            instanceElement.attrib["name"] = instanceObject.name
-        if instanceObject.locationLabel is not None:
-            instanceElement.attrib["location"] = instanceObject.locationLabel
-        if instanceObject.familyName is not None:
-            instanceElement.attrib["familyname"] = instanceObject.familyName
-        if instanceObject.styleName is not None:
-            instanceElement.attrib["stylename"] = instanceObject.styleName
-        # add localisations
-        if instanceObject.localisedStyleName:
-            languageCodes = list(instanceObject.localisedStyleName.keys())
-            languageCodes.sort()
-            for code in languageCodes:
-                if code == "en":
-                    continue  # already stored in the element attribute
-                localisedStyleNameElement = ET.Element("stylename")
-                localisedStyleNameElement.attrib[XML_LANG] = code
-                localisedStyleNameElement.text = instanceObject.getStyleName(code)
-                instanceElement.append(localisedStyleNameElement)
-        if instanceObject.localisedFamilyName:
-            languageCodes = list(instanceObject.localisedFamilyName.keys())
-            languageCodes.sort()
-            for code in languageCodes:
-                if code == "en":
-                    continue  # already stored in the element attribute
-                localisedFamilyNameElement = ET.Element("familyname")
-                localisedFamilyNameElement.attrib[XML_LANG] = code
-                localisedFamilyNameElement.text = instanceObject.getFamilyName(code)
-                instanceElement.append(localisedFamilyNameElement)
-        if instanceObject.localisedStyleMapStyleName:
-            languageCodes = list(instanceObject.localisedStyleMapStyleName.keys())
-            languageCodes.sort()
-            for code in languageCodes:
-                if code == "en":
-                    continue
-                localisedStyleMapStyleNameElement = ET.Element("stylemapstylename")
-                localisedStyleMapStyleNameElement.attrib[XML_LANG] = code
-                localisedStyleMapStyleNameElement.text = (
-                    instanceObject.getStyleMapStyleName(code)
-                )
-                instanceElement.append(localisedStyleMapStyleNameElement)
-        if instanceObject.localisedStyleMapFamilyName:
-            languageCodes = list(instanceObject.localisedStyleMapFamilyName.keys())
-            languageCodes.sort()
-            for code in languageCodes:
-                if code == "en":
-                    continue
-                localisedStyleMapFamilyNameElement = ET.Element("stylemapfamilyname")
-                localisedStyleMapFamilyNameElement.attrib[XML_LANG] = code
-                localisedStyleMapFamilyNameElement.text = (
-                    instanceObject.getStyleMapFamilyName(code)
-                )
-                instanceElement.append(localisedStyleMapFamilyNameElement)
-
-        if self.effectiveFormatTuple >= (5, 0):
-            if instanceObject.locationLabel is None:
-                self._addLocationElement(
-                    instanceElement,
-                    designLocation=instanceObject.designLocation,
-                    userLocation=instanceObject.userLocation,
-                )
-        else:
-            # Pre-version 5.0 code was validating and filling in the location
-            # dict while writing it out, as preserved below.
-            if instanceObject.location is not None:
-                locationElement, instanceObject.location = self._makeLocationElement(
-                    instanceObject.location
-                )
-                instanceElement.append(locationElement)
-        if instanceObject.filename is not None:
-            instanceElement.attrib["filename"] = instanceObject.filename
-        if instanceObject.postScriptFontName is not None:
-            instanceElement.attrib[
-                "postscriptfontname"
-            ] = instanceObject.postScriptFontName
-        if instanceObject.styleMapFamilyName is not None:
-            instanceElement.attrib[
-                "stylemapfamilyname"
-            ] = instanceObject.styleMapFamilyName
-        if instanceObject.styleMapStyleName is not None:
-            instanceElement.attrib[
-                "stylemapstylename"
-            ] = instanceObject.styleMapStyleName
-        if self.effectiveFormatTuple < (5, 0):
-            # Deprecated members as of version 5.0
-            if instanceObject.glyphs:
-                if instanceElement.findall(".glyphs") == []:
-                    glyphsElement = ET.Element("glyphs")
-                    instanceElement.append(glyphsElement)
-                glyphsElement = instanceElement.findall(".glyphs")[0]
-                for glyphName, data in sorted(instanceObject.glyphs.items()):
-                    glyphElement = self._writeGlyphElement(
-                        instanceElement, instanceObject, glyphName, data
-                    )
-                    glyphsElement.append(glyphElement)
-            if instanceObject.kerning:
-                kerningElement = ET.Element("kerning")
-                instanceElement.append(kerningElement)
-            if instanceObject.info:
-                infoElement = ET.Element("info")
-                instanceElement.append(infoElement)
-        self._addLib(instanceElement, instanceObject.lib, 4)
-        self.root.findall(".instances")[0].append(instanceElement)
-
-    def _addSource(self, sourceObject):
-        sourceElement = ET.Element("source")
-        if sourceObject.filename is not None:
-            sourceElement.attrib["filename"] = sourceObject.filename
-        if sourceObject.name is not None:
-            if sourceObject.name.find("temp_master") != 0:
-                # do not save temporary source names
-                sourceElement.attrib["name"] = sourceObject.name
-        if sourceObject.familyName is not None:
-            sourceElement.attrib["familyname"] = sourceObject.familyName
-        if sourceObject.styleName is not None:
-            sourceElement.attrib["stylename"] = sourceObject.styleName
-        if sourceObject.layerName is not None:
-            sourceElement.attrib["layer"] = sourceObject.layerName
-        if sourceObject.localisedFamilyName:
-            languageCodes = list(sourceObject.localisedFamilyName.keys())
-            languageCodes.sort()
-            for code in languageCodes:
-                if code == "en":
-                    continue  # already stored in the element attribute
-                localisedFamilyNameElement = ET.Element("familyname")
-                localisedFamilyNameElement.attrib[XML_LANG] = code
-                localisedFamilyNameElement.text = sourceObject.getFamilyName(code)
-                sourceElement.append(localisedFamilyNameElement)
-        if sourceObject.copyLib:
-            libElement = ET.Element("lib")
-            libElement.attrib["copy"] = "1"
-            sourceElement.append(libElement)
-        if sourceObject.copyGroups:
-            groupsElement = ET.Element("groups")
-            groupsElement.attrib["copy"] = "1"
-            sourceElement.append(groupsElement)
-        if sourceObject.copyFeatures:
-            featuresElement = ET.Element("features")
-            featuresElement.attrib["copy"] = "1"
-            sourceElement.append(featuresElement)
-        if sourceObject.copyInfo or sourceObject.muteInfo:
-            infoElement = ET.Element("info")
-            if sourceObject.copyInfo:
-                infoElement.attrib["copy"] = "1"
-            if sourceObject.muteInfo:
-                infoElement.attrib["mute"] = "1"
-            sourceElement.append(infoElement)
-        if sourceObject.muteKerning:
-            kerningElement = ET.Element("kerning")
-            kerningElement.attrib["mute"] = "1"
-            sourceElement.append(kerningElement)
-        if sourceObject.mutedGlyphNames:
-            for name in sourceObject.mutedGlyphNames:
-                glyphElement = ET.Element("glyph")
-                glyphElement.attrib["name"] = name
-                glyphElement.attrib["mute"] = "1"
-                sourceElement.append(glyphElement)
-        if self.effectiveFormatTuple >= (5, 0):
-            self._addLocationElement(
-                sourceElement, designLocation=sourceObject.location
-            )
-        else:
-            # Pre-version 5.0 code was validating and filling in the location
-            # dict while writing it out, as preserved below.
-            locationElement, sourceObject.location = self._makeLocationElement(
-                sourceObject.location
-            )
-            sourceElement.append(locationElement)
-        self.root.findall(".sources")[0].append(sourceElement)
-
-    def _addVariableFont(
-        self, parentElement: ET.Element, vf: VariableFontDescriptor
-    ) -> None:
-        vfElement = ET.Element("variable-font")
-        vfElement.attrib["name"] = vf.name
-        if vf.filename is not None:
-            vfElement.attrib["filename"] = vf.filename
-        if vf.axisSubsets:
-            subsetsElement = ET.Element("axis-subsets")
-            for subset in vf.axisSubsets:
-                subsetElement = ET.Element("axis-subset")
-                subsetElement.attrib["name"] = subset.name
-                # Mypy doesn't support narrowing union types via hasattr()
-                # https://mypy.readthedocs.io/en/stable/type_narrowing.html
-                # TODO(Python 3.10): use TypeGuard
-                if hasattr(subset, "userMinimum"):
-                    subset = cast(RangeAxisSubsetDescriptor, subset)
-                    if subset.userMinimum != -math.inf:
-                        subsetElement.attrib["userminimum"] = self.intOrFloat(
-                            subset.userMinimum
-                        )
-                    if subset.userMaximum != math.inf:
-                        subsetElement.attrib["usermaximum"] = self.intOrFloat(
-                            subset.userMaximum
-                        )
-                    if subset.userDefault is not None:
-                        subsetElement.attrib["userdefault"] = self.intOrFloat(
-                            subset.userDefault
-                        )
-                elif hasattr(subset, "userValue"):
-                    subset = cast(ValueAxisSubsetDescriptor, subset)
-                    subsetElement.attrib["uservalue"] = self.intOrFloat(
-                        subset.userValue
-                    )
-                subsetsElement.append(subsetElement)
-            vfElement.append(subsetsElement)
-        self._addLib(vfElement, vf.lib, 4)
-        parentElement.append(vfElement)
-
-    def _addLib(self, parentElement: ET.Element, data: Any, indent_level: int) -> None:
-        if not data:
-            return
-        libElement = ET.Element("lib")
-        libElement.append(plistlib.totree(data, indent_level=indent_level))
-        parentElement.append(libElement)
-
-    def _writeGlyphElement(self, instanceElement, instanceObject, glyphName, data):
-        glyphElement = ET.Element("glyph")
-        if data.get("mute"):
-            glyphElement.attrib["mute"] = "1"
-        if data.get("unicodes") is not None:
-            glyphElement.attrib["unicode"] = " ".join(
-                [hex(u) for u in data.get("unicodes")]
-            )
-        if data.get("instanceLocation") is not None:
-            locationElement, data["instanceLocation"] = self._makeLocationElement(
-                data.get("instanceLocation")
-            )
-            glyphElement.append(locationElement)
-        if glyphName is not None:
-            glyphElement.attrib["name"] = glyphName
-        if data.get("note") is not None:
-            noteElement = ET.Element("note")
-            noteElement.text = data.get("note")
-            glyphElement.append(noteElement)
-        if data.get("masters") is not None:
-            mastersElement = ET.Element("masters")
-            for m in data.get("masters"):
-                masterElement = ET.Element("master")
-                if m.get("glyphName") is not None:
-                    masterElement.attrib["glyphname"] = m.get("glyphName")
-                if m.get("font") is not None:
-                    masterElement.attrib["source"] = m.get("font")
-                if m.get("location") is not None:
-                    locationElement, m["location"] = self._makeLocationElement(
-                        m.get("location")
-                    )
-                    masterElement.append(locationElement)
-                mastersElement.append(masterElement)
-            glyphElement.append(mastersElement)
-        return glyphElement
-
-
-class BaseDocReader(LogMixin):
-    axisDescriptorClass = AxisDescriptor
-    discreteAxisDescriptorClass = DiscreteAxisDescriptor
-    axisLabelDescriptorClass = AxisLabelDescriptor
-    axisMappingDescriptorClass = AxisMappingDescriptor
-    locationLabelDescriptorClass = LocationLabelDescriptor
-    ruleDescriptorClass = RuleDescriptor
-    sourceDescriptorClass = SourceDescriptor
-    variableFontsDescriptorClass = VariableFontDescriptor
-    valueAxisSubsetDescriptorClass = ValueAxisSubsetDescriptor
-    rangeAxisSubsetDescriptorClass = RangeAxisSubsetDescriptor
-    instanceDescriptorClass = InstanceDescriptor
-
-    def __init__(self, documentPath, documentObject):
-        self.path = documentPath
-        self.documentObject = documentObject
-        tree = ET.parse(self.path)
-        self.root = tree.getroot()
-        self.documentObject.formatVersion = self.root.attrib.get("format", "3.0")
-        self._axes = []
-        self.rules = []
-        self.sources = []
-        self.instances = []
-        self.axisDefaults = {}
-        self._strictAxisNames = True
-
-    @classmethod
-    def fromstring(cls, string, documentObject):
-        f = BytesIO(tobytes(string, encoding="utf-8"))
-        self = cls(f, documentObject)
-        self.path = None
-        return self
-
-    def read(self):
-        self.readAxes()
-        self.readLabels()
-        self.readRules()
-        self.readVariableFonts()
-        self.readSources()
-        self.readInstances()
-        self.readLib()
-
-    def readRules(self):
-        # we also need to read any conditions that are outside of a condition set.
-        rules = []
-        rulesElement = self.root.find(".rules")
-        if rulesElement is not None:
-            processingValue = rulesElement.attrib.get("processing", "first")
-            if processingValue not in {"first", "last"}:
-                raise DesignSpaceDocumentError(
-                    "<rules> processing attribute value is not valid: %r, "
-                    "expected 'first' or 'last'" % processingValue
-                )
-            self.documentObject.rulesProcessingLast = processingValue == "last"
-        for ruleElement in self.root.findall(".rules/rule"):
-            ruleObject = self.ruleDescriptorClass()
-            ruleName = ruleObject.name = ruleElement.attrib.get("name")
-            # read any stray conditions outside a condition set
-            externalConditions = self._readConditionElements(
-                ruleElement,
-                ruleName,
-            )
-            if externalConditions:
-                ruleObject.conditionSets.append(externalConditions)
-                self.log.info(
-                    "Found stray rule conditions outside a conditionset. "
-                    "Wrapped them in a new conditionset."
-                )
-            # read the conditionsets
-            for conditionSetElement in ruleElement.findall(".conditionset"):
-                conditionSet = self._readConditionElements(
-                    conditionSetElement,
-                    ruleName,
-                )
-                if conditionSet is not None:
-                    ruleObject.conditionSets.append(conditionSet)
-            for subElement in ruleElement.findall(".sub"):
-                a = subElement.attrib["name"]
-                b = subElement.attrib["with"]
-                ruleObject.subs.append((a, b))
-            rules.append(ruleObject)
-        self.documentObject.rules = rules
-
-    def _readConditionElements(self, parentElement, ruleName=None):
-        cds = []
-        for conditionElement in parentElement.findall(".condition"):
-            cd = {}
-            cdMin = conditionElement.attrib.get("minimum")
-            if cdMin is not None:
-                cd["minimum"] = float(cdMin)
-            else:
-                # will allow these to be None, assume axis.minimum
-                cd["minimum"] = None
-            cdMax = conditionElement.attrib.get("maximum")
-            if cdMax is not None:
-                cd["maximum"] = float(cdMax)
-            else:
-                # will allow these to be None, assume axis.maximum
-                cd["maximum"] = None
-            cd["name"] = conditionElement.attrib.get("name")
-            # # test for things
-            if cd.get("minimum") is None and cd.get("maximum") is None:
-                raise DesignSpaceDocumentError(
-                    "condition missing required minimum or maximum in rule"
-                    + (" '%s'" % ruleName if ruleName is not None else "")
-                )
-            cds.append(cd)
-        return cds
-
-    def readAxes(self):
-        # read the axes elements, including the warp map.
-        axesElement = self.root.find(".axes")
-        if axesElement is not None and "elidedfallbackname" in axesElement.attrib:
-            self.documentObject.elidedFallbackName = axesElement.attrib[
-                "elidedfallbackname"
-            ]
-        axisElements = self.root.findall(".axes/axis")
-        if not axisElements:
-            return
-        for axisElement in axisElements:
-            if (
-                self.documentObject.formatTuple >= (5, 0)
-                and "values" in axisElement.attrib
-            ):
-                axisObject = self.discreteAxisDescriptorClass()
-                axisObject.values = [
-                    float(s) for s in axisElement.attrib["values"].split(" ")
-                ]
-            else:
-                axisObject = self.axisDescriptorClass()
-                axisObject.minimum = float(axisElement.attrib.get("minimum"))
-                axisObject.maximum = float(axisElement.attrib.get("maximum"))
-            axisObject.default = float(axisElement.attrib.get("default"))
-            axisObject.name = axisElement.attrib.get("name")
-            if axisElement.attrib.get("hidden", False):
-                axisObject.hidden = True
-            axisObject.tag = axisElement.attrib.get("tag")
-            for mapElement in axisElement.findall("map"):
-                a = float(mapElement.attrib["input"])
-                b = float(mapElement.attrib["output"])
-                axisObject.map.append((a, b))
-            for labelNameElement in axisElement.findall("labelname"):
-                # Note: elementtree reads the "xml:lang" attribute name as
-                # '{http://www.w3.org/XML/1998/namespace}lang'
-                for key, lang in labelNameElement.items():
-                    if key == XML_LANG:
-                        axisObject.labelNames[lang] = tostr(labelNameElement.text)
-            labelElement = axisElement.find(".labels")
-            if labelElement is not None:
-                if "ordering" in labelElement.attrib:
-                    axisObject.axisOrdering = int(labelElement.attrib["ordering"])
-                for label in labelElement.findall(".label"):
-                    axisObject.axisLabels.append(self.readAxisLabel(label))
-            self.documentObject.axes.append(axisObject)
-            self.axisDefaults[axisObject.name] = axisObject.default
-
-        mappingsElement = self.root.find(".axes/mappings")
-        self.documentObject.axisMappings = []
-        if mappingsElement is not None:
-            for mappingElement in mappingsElement.findall("mapping"):
-                inputElement = mappingElement.find("input")
-                outputElement = mappingElement.find("output")
-                inputLoc = {}
-                outputLoc = {}
-                for dimElement in inputElement.findall(".dimension"):
-                    name = dimElement.attrib["name"]
-                    value = float(dimElement.attrib["xvalue"])
-                    inputLoc[name] = value
-                for dimElement in outputElement.findall(".dimension"):
-                    name = dimElement.attrib["name"]
-                    value = float(dimElement.attrib["xvalue"])
-                    outputLoc[name] = value
-                axisMappingObject = self.axisMappingDescriptorClass(
-                    inputLocation=inputLoc, outputLocation=outputLoc
-                )
-                self.documentObject.axisMappings.append(axisMappingObject)
-
-    def readAxisLabel(self, element: ET.Element):
-        xml_attrs = {
-            "userminimum",
-            "uservalue",
-            "usermaximum",
-            "name",
-            "elidable",
-            "oldersibling",
-            "linkeduservalue",
-        }
-        unknown_attrs = set(element.attrib) - xml_attrs
-        if unknown_attrs:
-            raise DesignSpaceDocumentError(
-                f"label element contains unknown attributes: {', '.join(unknown_attrs)}"
-            )
-
-        name = element.get("name")
-        if name is None:
-            raise DesignSpaceDocumentError("label element must have a name attribute.")
-        valueStr = element.get("uservalue")
-        if valueStr is None:
-            raise DesignSpaceDocumentError(
-                "label element must have a uservalue attribute."
-            )
-        value = float(valueStr)
-        minimumStr = element.get("userminimum")
-        minimum = float(minimumStr) if minimumStr is not None else None
-        maximumStr = element.get("usermaximum")
-        maximum = float(maximumStr) if maximumStr is not None else None
-        linkedValueStr = element.get("linkeduservalue")
-        linkedValue = float(linkedValueStr) if linkedValueStr is not None else None
-        elidable = True if element.get("elidable") == "true" else False
-        olderSibling = True if element.get("oldersibling") == "true" else False
-        labelNames = {
-            lang: label_name.text or ""
-            for label_name in element.findall("labelname")
-            for attr, lang in label_name.items()
-            if attr == XML_LANG
-            # Note: elementtree reads the "xml:lang" attribute name as
-            # '{http://www.w3.org/XML/1998/namespace}lang'
-        }
-        return self.axisLabelDescriptorClass(
-            name=name,
-            userValue=value,
-            userMinimum=minimum,
-            userMaximum=maximum,
-            elidable=elidable,
-            olderSibling=olderSibling,
-            linkedUserValue=linkedValue,
-            labelNames=labelNames,
-        )
-
-    def readLabels(self):
-        if self.documentObject.formatTuple < (5, 0):
-            return
-
-        xml_attrs = {"name", "elidable", "oldersibling"}
-        for labelElement in self.root.findall(".labels/label"):
-            unknown_attrs = set(labelElement.attrib) - xml_attrs
-            if unknown_attrs:
-                raise DesignSpaceDocumentError(
-                    f"Label element contains unknown attributes: {', '.join(unknown_attrs)}"
-                )
-
-            name = labelElement.get("name")
-            if name is None:
-                raise DesignSpaceDocumentError(
-                    "label element must have a name attribute."
-                )
-            designLocation, userLocation = self.locationFromElement(labelElement)
-            if designLocation:
-                raise DesignSpaceDocumentError(
-                    f'<label> element "{name}" must only have user locations (using uservalue="").'
-                )
-            elidable = True if labelElement.get("elidable") == "true" else False
-            olderSibling = True if labelElement.get("oldersibling") == "true" else False
-            labelNames = {
-                lang: label_name.text or ""
-                for label_name in labelElement.findall("labelname")
-                for attr, lang in label_name.items()
-                if attr == XML_LANG
-                # Note: elementtree reads the "xml:lang" attribute name as
-                # '{http://www.w3.org/XML/1998/namespace}lang'
-            }
-            locationLabel = self.locationLabelDescriptorClass(
-                name=name,
-                userLocation=userLocation,
-                elidable=elidable,
-                olderSibling=olderSibling,
-                labelNames=labelNames,
-            )
-            self.documentObject.locationLabels.append(locationLabel)
-
-    def readVariableFonts(self):
-        if self.documentObject.formatTuple < (5, 0):
-            return
-
-        xml_attrs = {"name", "filename"}
-        for variableFontElement in self.root.findall(".variable-fonts/variable-font"):
-            unknown_attrs = set(variableFontElement.attrib) - xml_attrs
-            if unknown_attrs:
-                raise DesignSpaceDocumentError(
-                    f"variable-font element contains unknown attributes: {', '.join(unknown_attrs)}"
-                )
-
-            name = variableFontElement.get("name")
-            if name is None:
-                raise DesignSpaceDocumentError(
-                    "variable-font element must have a name attribute."
-                )
-
-            filename = variableFontElement.get("filename")
-
-            axisSubsetsElement = variableFontElement.find(".axis-subsets")
-            if axisSubsetsElement is None:
-                raise DesignSpaceDocumentError(
-                    "variable-font element must contain an axis-subsets element."
-                )
-            axisSubsets = []
-            for axisSubset in axisSubsetsElement.iterfind(".axis-subset"):
-                axisSubsets.append(self.readAxisSubset(axisSubset))
-
-            lib = None
-            libElement = variableFontElement.find(".lib")
-            if libElement is not None:
-                lib = plistlib.fromtree(libElement[0])
-
-            variableFont = self.variableFontsDescriptorClass(
-                name=name,
-                filename=filename,
-                axisSubsets=axisSubsets,
-                lib=lib,
-            )
-            self.documentObject.variableFonts.append(variableFont)
-
-    def readAxisSubset(self, element: ET.Element):
-        if "uservalue" in element.attrib:
-            xml_attrs = {"name", "uservalue"}
-            unknown_attrs = set(element.attrib) - xml_attrs
-            if unknown_attrs:
-                raise DesignSpaceDocumentError(
-                    f"axis-subset element contains unknown attributes: {', '.join(unknown_attrs)}"
-                )
-
-            name = element.get("name")
-            if name is None:
-                raise DesignSpaceDocumentError(
-                    "axis-subset element must have a name attribute."
-                )
-            userValueStr = element.get("uservalue")
-            if userValueStr is None:
-                raise DesignSpaceDocumentError(
-                    "The axis-subset element for a discrete subset must have a uservalue attribute."
-                )
-            userValue = float(userValueStr)
-
-            return self.valueAxisSubsetDescriptorClass(name=name, userValue=userValue)
-        else:
-            xml_attrs = {"name", "userminimum", "userdefault", "usermaximum"}
-            unknown_attrs = set(element.attrib) - xml_attrs
-            if unknown_attrs:
-                raise DesignSpaceDocumentError(
-                    f"axis-subset element contains unknown attributes: {', '.join(unknown_attrs)}"
-                )
-
-            name = element.get("name")
-            if name is None:
-                raise DesignSpaceDocumentError(
-                    "axis-subset element must have a name attribute."
-                )
-
-            userMinimum = element.get("userminimum")
-            userDefault = element.get("userdefault")
-            userMaximum = element.get("usermaximum")
-            if (
-                userMinimum is not None
-                and userDefault is not None
-                and userMaximum is not None
-            ):
-                return self.rangeAxisSubsetDescriptorClass(
-                    name=name,
-                    userMinimum=float(userMinimum),
-                    userDefault=float(userDefault),
-                    userMaximum=float(userMaximum),
-                )
-            if all(v is None for v in (userMinimum, userDefault, userMaximum)):
-                return self.rangeAxisSubsetDescriptorClass(name=name)
-
-            raise DesignSpaceDocumentError(
-                "axis-subset element must have min/max/default values or none at all."
-            )
-
-    def readSources(self):
-        for sourceCount, sourceElement in enumerate(
-            self.root.findall(".sources/source")
-        ):
-            filename = sourceElement.attrib.get("filename")
-            if filename is not None and self.path is not None:
-                sourcePath = os.path.abspath(
-                    os.path.join(os.path.dirname(self.path), filename)
-                )
-            else:
-                sourcePath = None
-            sourceName = sourceElement.attrib.get("name")
-            if sourceName is None:
-                # add a temporary source name
-                sourceName = "temp_master.%d" % (sourceCount)
-            sourceObject = self.sourceDescriptorClass()
-            sourceObject.path = sourcePath  # absolute path to the ufo source
-            sourceObject.filename = filename  # path as it is stored in the document
-            sourceObject.name = sourceName
-            familyName = sourceElement.attrib.get("familyname")
-            if familyName is not None:
-                sourceObject.familyName = familyName
-            styleName = sourceElement.attrib.get("stylename")
-            if styleName is not None:
-                sourceObject.styleName = styleName
-            for familyNameElement in sourceElement.findall("familyname"):
-                for key, lang in familyNameElement.items():
-                    if key == XML_LANG:
-                        familyName = familyNameElement.text
-                        sourceObject.setFamilyName(familyName, lang)
-            designLocation, userLocation = self.locationFromElement(sourceElement)
-            if userLocation:
-                raise DesignSpaceDocumentError(
-                    f'<source> element "{sourceName}" must only have design locations (using xvalue="").'
-                )
-            sourceObject.location = designLocation
-            layerName = sourceElement.attrib.get("layer")
-            if layerName is not None:
-                sourceObject.layerName = layerName
-            for libElement in sourceElement.findall(".lib"):
-                if libElement.attrib.get("copy") == "1":
-                    sourceObject.copyLib = True
-            for groupsElement in sourceElement.findall(".groups"):
-                if groupsElement.attrib.get("copy") == "1":
-                    sourceObject.copyGroups = True
-            for infoElement in sourceElement.findall(".info"):
-                if infoElement.attrib.get("copy") == "1":
-                    sourceObject.copyInfo = True
-                if infoElement.attrib.get("mute") == "1":
-                    sourceObject.muteInfo = True
-            for featuresElement in sourceElement.findall(".features"):
-                if featuresElement.attrib.get("copy") == "1":
-                    sourceObject.copyFeatures = True
-            for glyphElement in sourceElement.findall(".glyph"):
-                glyphName = glyphElement.attrib.get("name")
-                if glyphName is None:
-                    continue
-                if glyphElement.attrib.get("mute") == "1":
-                    sourceObject.mutedGlyphNames.append(glyphName)
-            for kerningElement in sourceElement.findall(".kerning"):
-                if kerningElement.attrib.get("mute") == "1":
-                    sourceObject.muteKerning = True
-            self.documentObject.sources.append(sourceObject)
-
-    def locationFromElement(self, element):
-        """Read a nested ``<location>`` element inside the given ``element``.
-
-        .. versionchanged:: 5.0
-           Return a tuple of (designLocation, userLocation)
-        """
-        elementLocation = (None, None)
-        for locationElement in element.findall(".location"):
-            elementLocation = self.readLocationElement(locationElement)
-            break
-        return elementLocation
-
-    def readLocationElement(self, locationElement):
-        """Read a ``<location>`` element.
-
-        .. versionchanged:: 5.0
-           Return a tuple of (designLocation, userLocation)
-        """
-        if self._strictAxisNames and not self.documentObject.axes:
-            raise DesignSpaceDocumentError("No axes defined")
-        userLoc = {}
-        designLoc = {}
-        for dimensionElement in locationElement.findall(".dimension"):
-            dimName = dimensionElement.attrib.get("name")
-            if self._strictAxisNames and dimName not in self.axisDefaults:
-                # In case the document contains no axis definitions,
-                self.log.warning('Location with undefined axis: "%s".', dimName)
-                continue
-            userValue = xValue = yValue = None
-            try:
-                userValue = dimensionElement.attrib.get("uservalue")
-                if userValue is not None:
-                    userValue = float(userValue)
-            except ValueError:
-                self.log.warning(
-                    "ValueError in readLocation userValue %3.3f", userValue
-                )
-            try:
-                xValue = dimensionElement.attrib.get("xvalue")
-                if xValue is not None:
-                    xValue = float(xValue)
-            except ValueError:
-                self.log.warning("ValueError in readLocation xValue %3.3f", xValue)
-            try:
-                yValue = dimensionElement.attrib.get("yvalue")
-                if yValue is not None:
-                    yValue = float(yValue)
-            except ValueError:
-                self.log.warning("ValueError in readLocation yValue %3.3f", yValue)
-            if userValue is None == xValue is None:
-                raise DesignSpaceDocumentError(
-                    f'Exactly one of uservalue="" or xvalue="" must be provided for location dimension "{dimName}"'
-                )
-            if yValue is not None:
-                if xValue is None:
-                    raise DesignSpaceDocumentError(
-                        f'Missing xvalue="" for the location dimension "{dimName}"" with yvalue="{yValue}"'
-                    )
-                designLoc[dimName] = (xValue, yValue)
-            elif xValue is not None:
-                designLoc[dimName] = xValue
-            else:
-                userLoc[dimName] = userValue
-        return designLoc, userLoc
-
-    def readInstances(self, makeGlyphs=True, makeKerning=True, makeInfo=True):
-        instanceElements = self.root.findall(".instances/instance")
-        for instanceElement in instanceElements:
-            self._readSingleInstanceElement(
-                instanceElement,
-                makeGlyphs=makeGlyphs,
-                makeKerning=makeKerning,
-                makeInfo=makeInfo,
-            )
-
-    def _readSingleInstanceElement(
-        self, instanceElement, makeGlyphs=True, makeKerning=True, makeInfo=True
-    ):
-        filename = instanceElement.attrib.get("filename")
-        if filename is not None and self.documentObject.path is not None:
-            instancePath = os.path.join(
-                os.path.dirname(self.documentObject.path), filename
-            )
-        else:
-            instancePath = None
-        instanceObject = self.instanceDescriptorClass()
-        instanceObject.path = instancePath  # absolute path to the instance
-        instanceObject.filename = filename  # path as it is stored in the document
-        name = instanceElement.attrib.get("name")
-        if name is not None:
-            instanceObject.name = name
-        familyname = instanceElement.attrib.get("familyname")
-        if familyname is not None:
-            instanceObject.familyName = familyname
-        stylename = instanceElement.attrib.get("stylename")
-        if stylename is not None:
-            instanceObject.styleName = stylename
-        postScriptFontName = instanceElement.attrib.get("postscriptfontname")
-        if postScriptFontName is not None:
-            instanceObject.postScriptFontName = postScriptFontName
-        styleMapFamilyName = instanceElement.attrib.get("stylemapfamilyname")
-        if styleMapFamilyName is not None:
-            instanceObject.styleMapFamilyName = styleMapFamilyName
-        styleMapStyleName = instanceElement.attrib.get("stylemapstylename")
-        if styleMapStyleName is not None:
-            instanceObject.styleMapStyleName = styleMapStyleName
-        # read localised names
-        for styleNameElement in instanceElement.findall("stylename"):
-            for key, lang in styleNameElement.items():
-                if key == XML_LANG:
-                    styleName = styleNameElement.text
-                    instanceObject.setStyleName(styleName, lang)
-        for familyNameElement in instanceElement.findall("familyname"):
-            for key, lang in familyNameElement.items():
-                if key == XML_LANG:
-                    familyName = familyNameElement.text
-                    instanceObject.setFamilyName(familyName, lang)
-        for styleMapStyleNameElement in instanceElement.findall("stylemapstylename"):
-            for key, lang in styleMapStyleNameElement.items():
-                if key == XML_LANG:
-                    styleMapStyleName = styleMapStyleNameElement.text
-                    instanceObject.setStyleMapStyleName(styleMapStyleName, lang)
-        for styleMapFamilyNameElement in instanceElement.findall("stylemapfamilyname"):
-            for key, lang in styleMapFamilyNameElement.items():
-                if key == XML_LANG:
-                    styleMapFamilyName = styleMapFamilyNameElement.text
-                    instanceObject.setStyleMapFamilyName(styleMapFamilyName, lang)
-        designLocation, userLocation = self.locationFromElement(instanceElement)
-        locationLabel = instanceElement.attrib.get("location")
-        if (designLocation or userLocation) and locationLabel is not None:
-            raise DesignSpaceDocumentError(
-                'instance element must have at most one of the location="..." attribute or the nested location element'
-            )
-        instanceObject.locationLabel = locationLabel
-        instanceObject.userLocation = userLocation or {}
-        instanceObject.designLocation = designLocation or {}
-        for glyphElement in instanceElement.findall(".glyphs/glyph"):
-            self.readGlyphElement(glyphElement, instanceObject)
-        for infoElement in instanceElement.findall("info"):
-            self.readInfoElement(infoElement, instanceObject)
-        for libElement in instanceElement.findall("lib"):
-            self.readLibElement(libElement, instanceObject)
-        self.documentObject.instances.append(instanceObject)
-
-    def readLibElement(self, libElement, instanceObject):
-        """Read the lib element for the given instance."""
-        instanceObject.lib = plistlib.fromtree(libElement[0])
-
-    def readInfoElement(self, infoElement, instanceObject):
-        """Read the info element."""
-        instanceObject.info = True
-
-    def readGlyphElement(self, glyphElement, instanceObject):
-        """
-        Read the glyph element, which could look like either one of these:
-
-        .. code-block:: xml
-
-            <glyph name="b" unicode="0x62"/>
-
-            <glyph name="b"/>
-
-            <glyph name="b">
-                <master location="location-token-bbb" source="master-token-aaa2"/>
-                <master glyphname="b.alt1" location="location-token-ccc" source="master-token-aaa3"/>
-                <note>
-                    This is an instance from an anisotropic interpolation.
-                </note>
-            </glyph>
-        """
-        glyphData = {}
-        glyphName = glyphElement.attrib.get("name")
-        if glyphName is None:
-            raise DesignSpaceDocumentError("Glyph object without name attribute")
-        mute = glyphElement.attrib.get("mute")
-        if mute == "1":
-            glyphData["mute"] = True
-        # unicode
-        unicodes = glyphElement.attrib.get("unicode")
-        if unicodes is not None:
-            try:
-                unicodes = [int(u, 16) for u in unicodes.split(" ")]
-                glyphData["unicodes"] = unicodes
-            except ValueError:
-                raise DesignSpaceDocumentError(
-                    "unicode values %s are not integers" % unicodes
-                )
-
-        for noteElement in glyphElement.findall(".note"):
-            glyphData["note"] = noteElement.text
-            break
-        designLocation, userLocation = self.locationFromElement(glyphElement)
-        if userLocation:
-            raise DesignSpaceDocumentError(
-                f'<glyph> element "{glyphName}" must only have design locations (using xvalue="").'
-            )
-        if designLocation is not None:
-            glyphData["instanceLocation"] = designLocation
-        glyphSources = None
-        for masterElement in glyphElement.findall(".masters/master"):
-            fontSourceName = masterElement.attrib.get("source")
-            designLocation, userLocation = self.locationFromElement(masterElement)
-            if userLocation:
-                raise DesignSpaceDocumentError(
-                    f'<master> element "{fontSourceName}" must only have design locations (using xvalue="").'
-                )
-            masterGlyphName = masterElement.attrib.get("glyphname")
-            if masterGlyphName is None:
-                # if we don't read a glyphname, use the one we have
-                masterGlyphName = glyphName
-            d = dict(
-                font=fontSourceName, location=designLocation, glyphName=masterGlyphName
-            )
-            if glyphSources is None:
-                glyphSources = []
-            glyphSources.append(d)
-        if glyphSources is not None:
-            glyphData["masters"] = glyphSources
-        instanceObject.glyphs[glyphName] = glyphData
-
-    def readLib(self):
-        """Read the lib element for the whole document."""
-        for libElement in self.root.findall(".lib"):
-            self.documentObject.lib = plistlib.fromtree(libElement[0])
-
-
-class DesignSpaceDocument(LogMixin, AsDictMixin):
-    """The DesignSpaceDocument object can read and write ``.designspace`` data.
-    It imports the axes, sources, variable fonts and instances to very basic
-    **descriptor** objects that store the data in attributes. Data is added to
-    the document by creating such descriptor objects, filling them with data
-    and then adding them to the document. This makes it easy to integrate this
-    object in different contexts.
-
-    The **DesignSpaceDocument** object can be subclassed to work with
-    different objects, as long as they have the same attributes. Reader and
-    Writer objects can be subclassed as well.
-
-    **Note:** Python attribute names are usually camelCased, the
-    corresponding `XML <document-xml-structure>`_ attributes are usually
-    all lowercase.
-
-    .. code:: python
-
-        from fontTools.designspaceLib import DesignSpaceDocument
-        doc = DesignSpaceDocument.fromfile("some/path/to/my.designspace")
-        doc.formatVersion
-        doc.elidedFallbackName
-        doc.axes
-        doc.axisMappings
-        doc.locationLabels
-        doc.rules
-        doc.rulesProcessingLast
-        doc.sources
-        doc.variableFonts
-        doc.instances
-        doc.lib
-
-    """
-
-    def __init__(self, readerClass=None, writerClass=None):
-        self.path = None
-        """String, optional. When the document is read from the disk, this is
-        the full path that was given to :meth:`read` or :meth:`fromfile`.
-        """
-        self.filename = None
-        """String, optional. When the document is read from the disk, this is
-        its original file name, i.e. the last part of its path.
-
-        When the document is produced by a Python script and still only exists
-        in memory, the producing script can write here an indication of a
-        possible "good" filename, in case one wants to save the file somewhere.
-        """
-
-        self.formatVersion: Optional[str] = None
-        """Format version for this document, as a string. E.g. "4.0" """
-
-        self.elidedFallbackName: Optional[str] = None
-        """STAT Style Attributes Header field ``elidedFallbackNameID``.
-
-        See: `OTSpec STAT Style Attributes Header <https://docs.microsoft.com/en-us/typography/opentype/spec/stat#style-attributes-header>`_
-
-        .. versionadded:: 5.0
-        """
-
-        self.axes: List[Union[AxisDescriptor, DiscreteAxisDescriptor]] = []
-        """List of this document's axes."""
-
-        self.axisMappings: List[AxisMappingDescriptor] = []
-        """List of this document's axis mappings."""
-
-        self.locationLabels: List[LocationLabelDescriptor] = []
-        """List of this document's STAT format 4 labels.
-
-        .. versionadded:: 5.0"""
-        self.rules: List[RuleDescriptor] = []
-        """List of this document's rules."""
-        self.rulesProcessingLast: bool = False
-        """This flag indicates whether the substitution rules should be applied
-        before or after other glyph substitution features.
-
-        - False: before
-        - True: after.
-
-        Default is False. For new projects, you probably want True. See
-        the following issues for more information:
-        `fontTools#1371 <https://github.com/fonttools/fonttools/issues/1371#issuecomment-590214572>`__
-        `fontTools#2050 <https://github.com/fonttools/fonttools/issues/2050#issuecomment-678691020>`__
-
-        If you want to use a different feature altogether, e.g. ``calt``,
-        use the lib key ``com.github.fonttools.varLib.featureVarsFeatureTag``
-
-        .. code:: xml
-
-            <lib>
-                <dict>
-                    <key>com.github.fonttools.varLib.featureVarsFeatureTag</key>
-                    <string>calt</string>
-                </dict>
-            </lib>
-        """
-        self.sources: List[SourceDescriptor] = []
-        """List of this document's sources."""
-        self.variableFonts: List[VariableFontDescriptor] = []
-        """List of this document's variable fonts.
-
-        .. versionadded:: 5.0"""
-        self.instances: List[InstanceDescriptor] = []
-        """List of this document's instances."""
-        self.lib: Dict = {}
-        """User defined, custom data associated with the whole document.
-
-        Use reverse-DNS notation to identify your own data.
-        Respect the data stored by others.
-        """
-
-        self.default: Optional[str] = None
-        """Name of the default master.
-
-        This attribute is updated by the :meth:`findDefault`
-        """
-
-        if readerClass is not None:
-            self.readerClass = readerClass
-        else:
-            self.readerClass = BaseDocReader
-        if writerClass is not None:
-            self.writerClass = writerClass
-        else:
-            self.writerClass = BaseDocWriter
-
-    @classmethod
-    def fromfile(cls, path, readerClass=None, writerClass=None):
-        """Read a designspace file from ``path`` and return a new instance of
-        :class:.
-        """
-        self = cls(readerClass=readerClass, writerClass=writerClass)
-        self.read(path)
-        return self
-
-    @classmethod
-    def fromstring(cls, string, readerClass=None, writerClass=None):
-        self = cls(readerClass=readerClass, writerClass=writerClass)
-        reader = self.readerClass.fromstring(string, self)
-        reader.read()
-        if self.sources:
-            self.findDefault()
-        return self
-
-    def tostring(self, encoding=None):
-        """Returns the designspace as a string. Default encoding ``utf-8``."""
-        if encoding is str or (encoding is not None and encoding.lower() == "unicode"):
-            f = StringIO()
-            xml_declaration = False
-        elif encoding is None or encoding == "utf-8":
-            f = BytesIO()
-            encoding = "UTF-8"
-            xml_declaration = True
-        else:
-            raise ValueError("unsupported encoding: '%s'" % encoding)
-        writer = self.writerClass(f, self)
-        writer.write(encoding=encoding, xml_declaration=xml_declaration)
-        return f.getvalue()
-
-    def read(self, path):
-        """Read a designspace file from ``path`` and populates the fields of
-        ``self`` with the data.
-        """
-        if hasattr(path, "__fspath__"):  # support os.PathLike objects
-            path = path.__fspath__()
-        self.path = path
-        self.filename = os.path.basename(path)
-        reader = self.readerClass(path, self)
-        reader.read()
-        if self.sources:
-            self.findDefault()
-
-    def write(self, path):
-        """Write this designspace to ``path``."""
-        if hasattr(path, "__fspath__"):  # support os.PathLike objects
-            path = path.__fspath__()
-        self.path = path
-        self.filename = os.path.basename(path)
-        self.updatePaths()
-        writer = self.writerClass(path, self)
-        writer.write()
-
-    def _posixRelativePath(self, otherPath):
-        relative = os.path.relpath(otherPath, os.path.dirname(self.path))
-        return posix(relative)
-
-    def updatePaths(self):
-        """
-        Right before we save we need to identify and respond to the following situations:
-        In each descriptor, we have to do the right thing for the filename attribute.
-
-        ::
-
-            case 1.
-            descriptor.filename == None
-            descriptor.path == None
-
-            -- action:
-            write as is, descriptors will not have a filename attr.
-            useless, but no reason to interfere.
-
-
-            case 2.
-            descriptor.filename == "../something"
-            descriptor.path == None
-
-            -- action:
-            write as is. The filename attr should not be touched.
-
-
-            case 3.
-            descriptor.filename == None
-            descriptor.path == "~/absolute/path/there"
-
-            -- action:
-            calculate the relative path for filename.
-            We're not overwriting some other value for filename, it should be fine
-
-
-            case 4.
-            descriptor.filename == '../somewhere'
-            descriptor.path == "~/absolute/path/there"
-
-            -- action:
-            there is a conflict between the given filename, and the path.
-            So we know where the file is relative to the document.
-            Can't guess why they're different, we just choose for path to be correct and update filename.
-        """
-        assert self.path is not None
-        for descriptor in self.sources + self.instances:
-            if descriptor.path is not None:
-                # case 3 and 4: filename gets updated and relativized
-                descriptor.filename = self._posixRelativePath(descriptor.path)
-
-    def addSource(self, sourceDescriptor: SourceDescriptor):
-        """Add the given ``sourceDescriptor`` to ``doc.sources``."""
-        self.sources.append(sourceDescriptor)
-
-    def addSourceDescriptor(self, **kwargs):
-        """Instantiate a new :class:`SourceDescriptor` using the given
-        ``kwargs`` and add it to ``doc.sources``.
-        """
-        source = self.writerClass.sourceDescriptorClass(**kwargs)
-        self.addSource(source)
-        return source
-
-    def addInstance(self, instanceDescriptor: InstanceDescriptor):
-        """Add the given ``instanceDescriptor`` to :attr:`instances`."""
-        self.instances.append(instanceDescriptor)
-
-    def addInstanceDescriptor(self, **kwargs):
-        """Instantiate a new :class:`InstanceDescriptor` using the given
-        ``kwargs`` and add it to :attr:`instances`.
-        """
-        instance = self.writerClass.instanceDescriptorClass(**kwargs)
-        self.addInstance(instance)
-        return instance
-
-    def addAxis(self, axisDescriptor: Union[AxisDescriptor, DiscreteAxisDescriptor]):
-        """Add the given ``axisDescriptor`` to :attr:`axes`."""
-        self.axes.append(axisDescriptor)
-
-    def addAxisDescriptor(self, **kwargs):
-        """Instantiate a new :class:`AxisDescriptor` using the given
-        ``kwargs`` and add it to :attr:`axes`.
-
-        The axis will be and instance of :class:`DiscreteAxisDescriptor` if
-        the ``kwargs`` provide a ``value``, or a :class:`AxisDescriptor` otherwise.
-        """
-        if "values" in kwargs:
-            axis = self.writerClass.discreteAxisDescriptorClass(**kwargs)
-        else:
-            axis = self.writerClass.axisDescriptorClass(**kwargs)
-        self.addAxis(axis)
-        return axis
-
-    def addAxisMapping(self, axisMappingDescriptor: AxisMappingDescriptor):
-        """Add the given ``axisMappingDescriptor`` to :attr:`axisMappings`."""
-        self.axisMappings.append(axisMappingDescriptor)
-
-    def addAxisMappingDescriptor(self, **kwargs):
-        """Instantiate a new :class:`AxisMappingDescriptor` using the given
-        ``kwargs`` and add it to :attr:`rules`.
-        """
-        axisMapping = self.writerClass.axisMappingDescriptorClass(**kwargs)
-        self.addAxisMapping(axisMapping)
-        return axisMapping
-
-    def addRule(self, ruleDescriptor: RuleDescriptor):
-        """Add the given ``ruleDescriptor`` to :attr:`rules`."""
-        self.rules.append(ruleDescriptor)
-
-    def addRuleDescriptor(self, **kwargs):
-        """Instantiate a new :class:`RuleDescriptor` using the given
-        ``kwargs`` and add it to :attr:`rules`.
-        """
-        rule = self.writerClass.ruleDescriptorClass(**kwargs)
-        self.addRule(rule)
-        return rule
-
-    def addVariableFont(self, variableFontDescriptor: VariableFontDescriptor):
-        """Add the given ``variableFontDescriptor`` to :attr:`variableFonts`.
-
-        .. versionadded:: 5.0
-        """
-        self.variableFonts.append(variableFontDescriptor)
-
-    def addVariableFontDescriptor(self, **kwargs):
-        """Instantiate a new :class:`VariableFontDescriptor` using the given
-        ``kwargs`` and add it to :attr:`variableFonts`.
-
-        .. versionadded:: 5.0
-        """
-        variableFont = self.writerClass.variableFontDescriptorClass(**kwargs)
-        self.addVariableFont(variableFont)
-        return variableFont
-
-    def addLocationLabel(self, locationLabelDescriptor: LocationLabelDescriptor):
-        """Add the given ``locationLabelDescriptor`` to :attr:`locationLabels`.
-
-        .. versionadded:: 5.0
-        """
-        self.locationLabels.append(locationLabelDescriptor)
-
-    def addLocationLabelDescriptor(self, **kwargs):
-        """Instantiate a new :class:`LocationLabelDescriptor` using the given
-        ``kwargs`` and add it to :attr:`locationLabels`.
-
-        .. versionadded:: 5.0
-        """
-        locationLabel = self.writerClass.locationLabelDescriptorClass(**kwargs)
-        self.addLocationLabel(locationLabel)
-        return locationLabel
-
-    def newDefaultLocation(self):
-        """Return a dict with the default location in design space coordinates."""
-        # Without OrderedDict, output XML would be non-deterministic.
-        # https://github.com/LettError/designSpaceDocument/issues/10
-        loc = collections.OrderedDict()
-        for axisDescriptor in self.axes:
-            loc[axisDescriptor.name] = axisDescriptor.map_forward(
-                axisDescriptor.default
-            )
-        return loc
-
-    def labelForUserLocation(
-        self, userLocation: SimpleLocationDict
-    ) -> Optional[LocationLabelDescriptor]:
-        """Return the :class:`LocationLabel` that matches the given
-        ``userLocation``, or ``None`` if no such label exists.
-
-        .. versionadded:: 5.0
-        """
-        return next(
-            (
-                label
-                for label in self.locationLabels
-                if label.userLocation == userLocation
-            ),
-            None,
-        )
-
-    def updateFilenameFromPath(self, masters=True, instances=True, force=False):
-        """Set a descriptor filename attr from the path and this document path.
-
-        If the filename attribute is not None: skip it.
-        """
-        if masters:
-            for descriptor in self.sources:
-                if descriptor.filename is not None and not force:
-                    continue
-                if self.path is not None:
-                    descriptor.filename = self._posixRelativePath(descriptor.path)
-        if instances:
-            for descriptor in self.instances:
-                if descriptor.filename is not None and not force:
-                    continue
-                if self.path is not None:
-                    descriptor.filename = self._posixRelativePath(descriptor.path)
-
-    def newAxisDescriptor(self):
-        """Ask the writer class to make us a new axisDescriptor."""
-        return self.writerClass.getAxisDecriptor()
-
-    def newSourceDescriptor(self):
-        """Ask the writer class to make us a new sourceDescriptor."""
-        return self.writerClass.getSourceDescriptor()
-
-    def newInstanceDescriptor(self):
-        """Ask the writer class to make us a new instanceDescriptor."""
-        return self.writerClass.getInstanceDescriptor()
-
-    def getAxisOrder(self):
-        """Return a list of axis names, in the same order as defined in the document."""
-        names = []
-        for axisDescriptor in self.axes:
-            names.append(axisDescriptor.name)
-        return names
-
-    def getAxis(self, name: str) -> AxisDescriptor | DiscreteAxisDescriptor | None:
-        """Return the axis with the given ``name``, or ``None`` if no such axis exists."""
-        return next((axis for axis in self.axes if axis.name == name), None)
-
-    def getAxisByTag(self, tag: str) -> AxisDescriptor | DiscreteAxisDescriptor | None:
-        """Return the axis with the given ``tag``, or ``None`` if no such axis exists."""
-        return next((axis for axis in self.axes if axis.tag == tag), None)
-
-    def getLocationLabel(self, name: str) -> Optional[LocationLabelDescriptor]:
-        """Return the top-level location label with the given ``name``, or
-        ``None`` if no such label exists.
-
-        .. versionadded:: 5.0
-        """
-        for label in self.locationLabels:
-            if label.name == name:
-                return label
-        return None
-
-    def map_forward(self, userLocation: SimpleLocationDict) -> SimpleLocationDict:
-        """Map a user location to a design location.
-
-        Assume that missing coordinates are at the default location for that axis.
-
-        Note: the output won't be anisotropic, only the xvalue is set.
-
-        .. versionadded:: 5.0
-        """
-        return {
-            axis.name: axis.map_forward(userLocation.get(axis.name, axis.default))
-            for axis in self.axes
-        }
-
-    def map_backward(
-        self, designLocation: AnisotropicLocationDict
-    ) -> SimpleLocationDict:
-        """Map a design location to a user location.
-
-        Assume that missing coordinates are at the default location for that axis.
-
-        When the input has anisotropic locations, only the xvalue is used.
-
-        .. versionadded:: 5.0
-        """
-        return {
-            axis.name: (
-                axis.map_backward(designLocation[axis.name])
-                if axis.name in designLocation
-                else axis.default
-            )
-            for axis in self.axes
-        }
-
-    def findDefault(self):
-        """Set and return SourceDescriptor at the default location or None.
-
-        The default location is the set of all `default` values in user space
-        of all axes.
-
-        This function updates the document's :attr:`default` value.
-
-        .. versionchanged:: 5.0
-           Allow the default source to not specify some of the axis values, and
-           they are assumed to be the default.
-           See :meth:`SourceDescriptor.getFullDesignLocation()`
-        """
-        self.default = None
-
-        # Convert the default location from user space to design space before comparing
-        # it against the SourceDescriptor locations (always in design space).
-        defaultDesignLocation = self.newDefaultLocation()
-
-        for sourceDescriptor in self.sources:
-            if sourceDescriptor.getFullDesignLocation(self) == defaultDesignLocation:
-                self.default = sourceDescriptor
-                return sourceDescriptor
-
-        return None
-
-    def normalizeLocation(self, location):
-        """Return a dict with normalized axis values."""
-        from fontTools.varLib.models import normalizeValue
-
-        new = {}
-        for axis in self.axes:
-            if axis.name not in location:
-                # skipping this dimension it seems
-                continue
-            value = location[axis.name]
-            # 'anisotropic' location, take first coord only
-            if isinstance(value, tuple):
-                value = value[0]
-            triple = [
-                axis.map_forward(v) for v in (axis.minimum, axis.default, axis.maximum)
-            ]
-            new[axis.name] = normalizeValue(value, triple)
-        return new
-
-    def normalize(self):
-        """
-        Normalise the geometry of this designspace:
-
-        - scale all the locations of all masters and instances to the -1 - 0 - 1 value.
-        - we need the axis data to do the scaling, so we do those last.
-        """
-        # masters
-        for item in self.sources:
-            item.location = self.normalizeLocation(item.location)
-        # instances
-        for item in self.instances:
-            # glyph masters for this instance
-            for _, glyphData in item.glyphs.items():
-                glyphData["instanceLocation"] = self.normalizeLocation(
-                    glyphData["instanceLocation"]
-                )
-                for glyphMaster in glyphData["masters"]:
-                    glyphMaster["location"] = self.normalizeLocation(
-                        glyphMaster["location"]
-                    )
-            item.location = self.normalizeLocation(item.location)
-        # the axes
-        for axis in self.axes:
-            # scale the map first
-            newMap = []
-            for inputValue, outputValue in axis.map:
-                newOutputValue = self.normalizeLocation({axis.name: outputValue}).get(
-                    axis.name
-                )
-                newMap.append((inputValue, newOutputValue))
-            if newMap:
-                axis.map = newMap
-            # finally the axis values
-            minimum = self.normalizeLocation({axis.name: axis.minimum}).get(axis.name)
-            maximum = self.normalizeLocation({axis.name: axis.maximum}).get(axis.name)
-            default = self.normalizeLocation({axis.name: axis.default}).get(axis.name)
-            # and set them in the axis.minimum
-            axis.minimum = minimum
-            axis.maximum = maximum
-            axis.default = default
-        # now the rules
-        for rule in self.rules:
-            newConditionSets = []
-            for conditions in rule.conditionSets:
-                newConditions = []
-                for cond in conditions:
-                    if cond.get("minimum") is not None:
-                        minimum = self.normalizeLocation(
-                            {cond["name"]: cond["minimum"]}
-                        ).get(cond["name"])
-                    else:
-                        minimum = None
-                    if cond.get("maximum") is not None:
-                        maximum = self.normalizeLocation(
-                            {cond["name"]: cond["maximum"]}
-                        ).get(cond["name"])
-                    else:
-                        maximum = None
-                    newConditions.append(
-                        dict(name=cond["name"], minimum=minimum, maximum=maximum)
-                    )
-                newConditionSets.append(newConditions)
-            rule.conditionSets = newConditionSets
-
-    def loadSourceFonts(self, opener, **kwargs):
-        """Ensure SourceDescriptor.font attributes are loaded, and return list of fonts.
-
-        Takes a callable which initializes a new font object (e.g. TTFont, or
-        defcon.Font, etc.) from the SourceDescriptor.path, and sets the
-        SourceDescriptor.font attribute.
-        If the font attribute is already not None, it is not loaded again.
-        Fonts with the same path are only loaded once and shared among SourceDescriptors.
-
-        For example, to load UFO sources using defcon:
-
-            designspace = DesignSpaceDocument.fromfile("path/to/my.designspace")
-            designspace.loadSourceFonts(defcon.Font)
-
-        Or to load masters as FontTools binary fonts, including extra options:
-
-            designspace.loadSourceFonts(ttLib.TTFont, recalcBBoxes=False)
-
-        Args:
-            opener (Callable): takes one required positional argument, the source.path,
-                and an optional list of keyword arguments, and returns a new font object
-                loaded from the path.
-            **kwargs: extra options passed on to the opener function.
-
-        Returns:
-            List of font objects in the order they appear in the sources list.
-        """
-        # we load fonts with the same source.path only once
-        loaded = {}
-        fonts = []
-        for source in self.sources:
-            if source.font is not None:  # font already loaded
-                fonts.append(source.font)
-                continue
-            if source.path in loaded:
-                source.font = loaded[source.path]
-            else:
-                if source.path is None:
-                    raise DesignSpaceDocumentError(
-                        "Designspace source '%s' has no 'path' attribute"
-                        % (source.name or "<Unknown>")
-                    )
-                source.font = opener(source.path, **kwargs)
-                loaded[source.path] = source.font
-            fonts.append(source.font)
-        return fonts
-
-    @property
-    def formatTuple(self):
-        """Return the formatVersion as a tuple of (major, minor).
-
-        .. versionadded:: 5.0
-        """
-        if self.formatVersion is None:
-            return (5, 0)
-        numbers = (int(i) for i in self.formatVersion.split("."))
-        major = next(numbers)
-        minor = next(numbers, 0)
-        return (major, minor)
-
-    def getVariableFonts(self) -> List[VariableFontDescriptor]:
-        """Return all variable fonts defined in this document, or implicit
-        variable fonts that can be built from the document's continuous axes.
-
-        In the case of Designspace documents before version 5, the whole
-        document was implicitly describing a variable font that covers the
-        whole space.
-
-        In version 5 and above documents, there can be as many variable fonts
-        as there are locations on discrete axes.
-
-        .. seealso:: :func:`splitInterpolable`
-
-        .. versionadded:: 5.0
-        """
-        if self.variableFonts:
-            return self.variableFonts
-
-        variableFonts = []
-        discreteAxes = []
-        rangeAxisSubsets: List[
-            Union[RangeAxisSubsetDescriptor, ValueAxisSubsetDescriptor]
-        ] = []
-        for axis in self.axes:
-            if hasattr(axis, "values"):
-                # Mypy doesn't support narrowing union types via hasattr()
-                # TODO(Python 3.10): use TypeGuard
-                # https://mypy.readthedocs.io/en/stable/type_narrowing.html
-                axis = cast(DiscreteAxisDescriptor, axis)
-                discreteAxes.append(axis)  # type: ignore
-            else:
-                rangeAxisSubsets.append(RangeAxisSubsetDescriptor(name=axis.name))
-        valueCombinations = itertools.product(*[axis.values for axis in discreteAxes])
-        for values in valueCombinations:
-            basename = None
-            if self.filename is not None:
-                basename = os.path.splitext(self.filename)[0] + "-VF"
-            if self.path is not None:
-                basename = os.path.splitext(os.path.basename(self.path))[0] + "-VF"
-            if basename is None:
-                basename = "VF"
-            axisNames = "".join(
-                [f"-{axis.tag}{value}" for axis, value in zip(discreteAxes, values)]
-            )
-            variableFonts.append(
-                VariableFontDescriptor(
-                    name=f"{basename}{axisNames}",
-                    axisSubsets=rangeAxisSubsets
-                    + [
-                        ValueAxisSubsetDescriptor(name=axis.name, userValue=value)
-                        for axis, value in zip(discreteAxes, values)
-                    ],
-                )
-            )
-        return variableFonts
-
-    def deepcopyExceptFonts(self):
-        """Allow deep-copying a DesignSpace document without deep-copying
-        attached UFO fonts or TTFont objects. The :attr:`font` attribute
-        is shared by reference between the original and the copy.
-
-        .. versionadded:: 5.0
-        """
-        fonts = [source.font for source in self.sources]
-        try:
-            for source in self.sources:
-                source.font = None
-            res = copy.deepcopy(self)
-            for source, font in zip(res.sources, fonts):
-                source.font = font
-            return res
-        finally:
-            for source, font in zip(self.sources, fonts):
-                source.font = font
diff --git a/spaces/dcarpintero/nlp-summarizer-pegasus/.venv/lib/python3.9/site-packages/gradio/templates/frontend/assets/index-0be00efc.js b/spaces/dcarpintero/nlp-summarizer-pegasus/.venv/lib/python3.9/site-packages/gradio/templates/frontend/assets/index-0be00efc.js
deleted file mode 100644
index f0f85dc0553f7e1addfff3b5176f7363fd2f3f3c..0000000000000000000000000000000000000000
--- a/spaces/dcarpintero/nlp-summarizer-pegasus/.venv/lib/python3.9/site-packages/gradio/templates/frontend/assets/index-0be00efc.js
+++ /dev/null
@@ -1,2 +0,0 @@
-import{S as T,e as j,s as G,I,m as b,F as A,o as y,g as u,h as v,G as B,j as h,w as q,u as N,k,H as M,Z as D,t as C,x as R,f as E,Y as F,X as Q,am as _e,N as U,P as oe,r as se,v as ae,M as V,Q as ge,R as he,V as me}from"./index-39fce9e2.js";import"./Button-79f6e3bf.js";import{B as z}from"./BlockTitle-fa702e63.js";import"./Info-7c1e7874.js";const w=i=>{var e=null;return i<0?e=[52,152,219]:e=[231,76,60],be(de(Math.abs(i),[255,255,255],e))},de=(i,e,t)=>{i>1&&(i=1),i=Math.sqrt(i);var n=[0,0,0],o;for(o=0;o<3;o++)n[o]=Math.round(e[o]*(1-i)+t[o]*i);return n},be=i=>"rgb("+i[0]+", "+i[1]+", "+i[2]+")";function X(i,e,t,n,o){var s=n/o,c=e/t,l=0,r=0,f=i?s>c:s<c;return f?(l=e,r=l/s):(r=t,l=r*s),{width:l,height:r,x:(e-l)/2,y:(t-r)/2}}function Y(i,e,t){const n=i.slice();return n[2]=e[t],n}function ve(i){let e;return{c(){e=C(i[1])},m(t,n){v(t,e,n)},p(t,n){n&2&&R(e,t[1])},d(t){t&&k(e)}}}function Z(i){let e,t=i[2][0]+"",n,o,s;return{c(){e=b("div"),n=C(t),o=y(),u(e,"class","item svelte-x6nxfm"),u(e,"style",s="background-color: "+w(i[2][1]))},m(c,l){v(c,e,l),h(e,n),h(e,o)},p(c,l){l&1&&t!==(t=c[2][0]+"")&&R(n,t),l&1&&s!==(s="background-color: "+w(c[2][1]))&&u(e,"style",s)},d(c){c&&k(e)}}}function ke(i){let e,t,n,o,s;t=new z({props:{$$slots:{default:[ve]},$$scope:{ctx:i}}});let c=I(i[0]),l=[];for(let r=0;r<c.length;r+=1)l[r]=Z(Y(i,c,r));return{c(){e=b("div"),A(t.$$.fragment),n=y(),o=b("div");for(let r=0;r<l.length;r+=1)l[r].c();u(o,"class","range svelte-x6nxfm"),u(e,"class","input-number svelte-x6nxfm")},m(r,f){v(r,e,f),B(t,e,null),h(e,n),h(e,o);for(let a=0;a<l.length;a+=1)l[a]&&l[a].m(o,null);s=!0},p(r,[f]){const a={};if(f&34&&(a.$$scope={dirty:f,ctx:r}),t.$set(a),f&1){c=I(r[0]);let _;for(_=0;_<c.length;_+=1){const g=Y(r,c,_);l[_]?l[_].p(g,f):(l[_]=Z(g),l[_].c(),l[_].m(o,null))}for(;_<l.length;_+=1)l[_].d(1);l.length=c.length}},i(r){s||(q(t.$$.fragment,r),s=!0)},o(r){N(t.$$.fragment,r),s=!1},d(r){r&&k(e),M(t),D(l,r)}}}function pe(i,e,t){let{interpretation:n}=e,{label:o=""}=e;return i.$$set=s=>{"interpretation"in s&&t(0,n=s.interpretation),"label"in s&&t(1,o=s.label)},[n,o]}class we extends T{constructor(e){super(),j(this,e,pe,ke,G,{interpretation:0,label:1})}}function x(i,e,t){const n=i.slice();return n[3]=e[t],n[5]=t,n}function ye(i){let e;return{c(){e=C(i[2])},m(t,n){v(t,e,n)},p(t,n){n&4&&R(e,t[2])},d(t){t&&k(e)}}}function J(i){let e,t=i[3]+"",n,o,s;return{c(){e=b("li"),n=C(t),o=y(),u(e,"class","dropdown-item svelte-1cqwepf"),u(e,"style",s="background-color: "+w(i[0][i[5]]))},m(c,l){v(c,e,l),h(e,n),h(e,o)},p(c,l){l&2&&t!==(t=c[3]+"")&&R(n,t),l&1&&s!==(s="background-color: "+w(c[0][c[5]]))&&u(e,"style",s)},d(c){c&&k(e)}}}function Se(i){let e,t,n,o,s;t=new z({props:{$$slots:{default:[ye]},$$scope:{ctx:i}}});let c=I(i[1]),l=[];for(let r=0;r<c.length;r+=1)l[r]=J(x(i,c,r));return{c(){e=b("div"),A(t.$$.fragment),n=y(),o=b("ul");for(let r=0;r<l.length;r+=1)l[r].c();u(o,"class","dropdown-menu svelte-1cqwepf")},m(r,f){v(r,e,f),B(t,e,null),h(e,n),h(e,o);for(let a=0;a<l.length;a+=1)l[a]&&l[a].m(o,null);s=!0},p(r,[f]){const a={};if(f&68&&(a.$$scope={dirty:f,ctx:r}),t.$set(a),f&3){c=I(r[1]);let _;for(_=0;_<c.length;_+=1){const g=x(r,c,_);l[_]?l[_].p(g,f):(l[_]=J(g),l[_].c(),l[_].m(o,null))}for(;_<l.length;_+=1)l[_].d(1);l.length=c.length}},i(r){s||(q(t.$$.fragment,r),s=!0)},o(r){N(t.$$.fragment,r),s=!1},d(r){r&&k(e),M(t),D(l,r)}}}function Ce(i,e,t){let{interpretation:n}=e,{choices:o}=e,{label:s=""}=e;return i.$$set=c=>{"interpretation"in c&&t(0,n=c.interpretation),"choices"in c&&t(1,o=c.choices),"label"in c&&t(2,s=c.label)},[n,o,s]}class Re extends T{constructor(e){super(),j(this,e,Ce,Se,G,{interpretation:0,choices:1,label:2})}}function qe(i){let e;return{c(){e=C(i[0])},m(t,n){v(t,e,n)},p(t,n){n&1&&R(e,t[0])},d(t){t&&k(e)}}}function Ie(i){let e,t,n,o,s,c,l,r,f,a,_,g,m;return t=new z({props:{$$slots:{default:[qe]},$$scope:{ctx:i}}}),{c(){e=b("div"),A(t.$$.fragment),n=y(),o=b("button"),s=b("div"),l=y(),r=b("div"),f=E("svg"),a=E("line"),_=E("line"),u(s,"class","checkbox svelte-1nw19ca"),u(s,"style",c="background-color: "+w(i[2][0])),u(a,"x1","-7.5"),u(a,"y1","0"),u(a,"x2","-2.5"),u(a,"y2","5"),u(a,"stroke","black"),u(a,"stroke-width","4"),u(a,"stroke-linecap","round"),u(_,"x1","-2.5"),u(_,"y1","5"),u(_,"x2","7.5"),u(_,"y2","-7.5"),u(_,"stroke","black"),u(_,"stroke-width","4"),u(_,"stroke-linecap","round"),u(f,"viewBox","-10 -10 20 20"),u(f,"class","svelte-1nw19ca"),u(r,"class","checkbox svelte-1nw19ca"),u(r,"style",g="background-color: "+w(i[2][1])),u(o,"class","checkbox-item svelte-1nw19ca"),F(o,"selected",i[1]),u(e,"class","input-checkbox svelte-1nw19ca")},m(d,p){v(d,e,p),B(t,e,null),h(e,n),h(e,o),h(o,s),h(o,l),h(o,r),h(r,f),h(f,a),h(f,_),m=!0},p(d,[p]){const S={};p&9&&(S.$$scope={dirty:p,ctx:d}),t.$set(S),(!m||p&4&&c!==(c="background-color: "+w(d[2][0])))&&u(s,"style",c),(!m||p&4&&g!==(g="background-color: "+w(d[2][1])))&&u(r,"style",g),(!m||p&2)&&F(o,"selected",d[1])},i(d){m||(q(t.$$.fragment,d),m=!0)},o(d){N(t.$$.fragment,d),m=!1},d(d){d&&k(e),M(t)}}}function Ne(i,e,t){let{label:n=""}=e,{original:o}=e,{interpretation:s}=e;return i.$$set=c=>{"label"in c&&t(0,n=c.label),"original"in c&&t(1,o=c.original),"interpretation"in c&&t(2,s=c.interpretation)},[n,o,s]}class Ae extends T{constructor(e){super(),j(this,e,Ne,Ie,G,{label:0,original:1,interpretation:2})}}function K(i,e,t){const n=i.slice();return n[4]=e[t],n[6]=t,n}function Be(i){let e;return{c(){e=C(i[3])},m(t,n){v(t,e,n)},p(t,n){n&8&&R(e,t[3])},d(t){t&&k(e)}}}function L(i){let e,t,n,o,s,c,l,r,f,a,_=i[4]+"",g,m;return{c(){e=b("button"),t=b("div"),o=y(),s=b("div"),c=E("svg"),l=E("line"),r=E("line"),a=y(),g=C(_),m=y(),u(t,"class","checkbox svelte-1cbhr6k"),u(t,"style",n="background-color: "+w(i[1][i[6]][0])),u(l,"x1","-7.5"),u(l,"y1","0"),u(l,"x2","-2.5"),u(l,"y2","5"),u(l,"stroke","black"),u(l,"stroke-width","4"),u(l,"stroke-linecap","round"),u(r,"x1","-2.5"),u(r,"y1","5"),u(r,"x2","7.5"),u(r,"y2","-7.5"),u(r,"stroke","black"),u(r,"stroke-width","4"),u(r,"stroke-linecap","round"),u(c,"viewBox","-10 -10 20 20"),u(c,"class","svelte-1cbhr6k"),u(s,"class","checkbox svelte-1cbhr6k"),u(s,"style",f="background-color: "+w(i[1][i[6]][1])),u(e,"class","checkbox-item svelte-1cbhr6k"),F(e,"selected",i[0].includes(i[4]))},m(d,p){v(d,e,p),h(e,t),h(e,o),h(e,s),h(s,c),h(c,l),h(c,r),h(e,a),h(e,g),h(e,m)},p(d,p){p&2&&n!==(n="background-color: "+w(d[1][d[6]][0]))&&u(t,"style",n),p&2&&f!==(f="background-color: "+w(d[1][d[6]][1]))&&u(s,"style",f),p&4&&_!==(_=d[4]+"")&&R(g,_),p&5&&F(e,"selected",d[0].includes(d[4]))},d(d){d&&k(e)}}}function Me(i){let e,t,n,o;t=new z({props:{$$slots:{default:[Be]},$$scope:{ctx:i}}});let s=I(i[2]),c=[];for(let l=0;l<s.length;l+=1)c[l]=L(K(i,s,l));return{c(){e=b("div"),A(t.$$.fragment),n=y();for(let l=0;l<c.length;l+=1)c[l].c();u(e,"class","input-checkbox-group svelte-1cbhr6k")},m(l,r){v(l,e,r),B(t,e,null),h(e,n);for(let f=0;f<c.length;f+=1)c[f]&&c[f].m(e,null);o=!0},p(l,[r]){const f={};if(r&136&&(f.$$scope={dirty:r,ctx:l}),t.$set(f),r&7){s=I(l[2]);let a;for(a=0;a<s.length;a+=1){const _=K(l,s,a);c[a]?c[a].p(_,r):(c[a]=L(_),c[a].c(),c[a].m(e,null))}for(;a<c.length;a+=1)c[a].d(1);c.length=s.length}},i(l){o||(q(t.$$.fragment,l),o=!0)},o(l){N(t.$$.fragment,l),o=!1},d(l){l&&k(e),M(t),D(c,l)}}}function Te(i,e,t){let{original:n}=e,{interpretation:o}=e,{choices:s}=e,{label:c=""}=e;return i.$$set=l=>{"original"in l&&t(0,n=l.original),"interpretation"in l&&t(1,o=l.interpretation),"choices"in l&&t(2,s=l.choices),"label"in l&&t(3,c=l.label)},[n,o,s,c]}class je extends T{constructor(e){super(),j(this,e,Te,Me,G,{original:0,interpretation:1,choices:2,label:3})}}function W(i,e,t){const n=i.slice();return n[6]=e[t],n}function Ge(i){let e;return{c(){e=C(i[5])},m(t,n){v(t,e,n)},p(t,n){n&32&&R(e,t[5])},d(t){t&&k(e)}}}function $(i){let e,t;return{c(){e=b("div"),u(e,"style",t="background-color: "+w(i[6])),u(e,"class","svelte-1sxprr7")},m(n,o){v(n,e,o)},p(n,o){o&2&&t!==(t="background-color: "+w(n[6]))&&u(e,"style",t)},d(n){n&&k(e)}}}function ze(i){let e,t,n,o,s,c,l,r,f,a;t=new z({props:{$$slots:{default:[Ge]},$$scope:{ctx:i}}});let _=I(i[1]),g=[];for(let m=0;m<_.length;m+=1)g[m]=$(W(i,_,m));return{c(){e=b("div"),A(t.$$.fragment),n=y(),o=b("input"),s=y(),c=b("div");for(let m=0;m<g.length;m+=1)g[m].c();l=y(),r=b("div"),f=C(i[0]),u(o,"type","range"),o.disabled=!0,u(o,"min",i[2]),u(o,"max",i[3]),u(o,"step",i[4]),u(o,"class","svelte-1sxprr7"),u(c,"class","range svelte-1sxprr7"),u(r,"class","original svelte-1sxprr7"),u(e,"class","input-slider svelte-1sxprr7")},m(m,d){v(m,e,d),B(t,e,null),h(e,n),h(e,o),h(e,s),h(e,c);for(let p=0;p<g.length;p+=1)g[p]&&g[p].m(c,null);h(e,l),h(e,r),h(r,f),a=!0},p(m,[d]){const p={};if(d&544&&(p.$$scope={dirty:d,ctx:m}),t.$set(p),(!a||d&4)&&u(o,"min",m[2]),(!a||d&8)&&u(o,"max",m[3]),(!a||d&16)&&u(o,"step",m[4]),d&2){_=I(m[1]);let S;for(S=0;S<_.length;S+=1){const H=W(m,_,S);g[S]?g[S].p(H,d):(g[S]=$(H),g[S].c(),g[S].m(c,null))}for(;S<g.length;S+=1)g[S].d(1);g.length=_.length}(!a||d&1)&&R(f,m[0])},i(m){a||(q(t.$$.fragment,m),a=!0)},o(m){N(t.$$.fragment,m),a=!1},d(m){m&&k(e),M(t),D(g,m)}}}function De(i,e,t){let{original:n}=e,{interpretation:o}=e,{minimum:s}=e,{maximum:c}=e,{step:l}=e,{label:r=""}=e;return i.$$set=f=>{"original"in f&&t(0,n=f.original),"interpretation"in f&&t(1,o=f.interpretation),"minimum"in f&&t(2,s=f.minimum),"maximum"in f&&t(3,c=f.maximum),"step"in f&&t(4,l=f.step),"label"in f&&t(5,r=f.label)},[n,o,s,c,l,r]}class Ee extends T{constructor(e){super(),j(this,e,De,ze,G,{original:0,interpretation:1,minimum:2,maximum:3,step:4,label:5})}}function ee(i,e,t){const n=i.slice();return n[4]=e[t],n[6]=t,n}function Fe(i){let e;return{c(){e=C(i[3])},m(t,n){v(t,e,n)},p(t,n){n&8&&R(e,t[3])},d(t){t&&k(e)}}}function te(i){let e,t,n,o,s=i[4]+"",c,l;return{c(){e=b("button"),t=b("div"),o=y(),c=C(s),l=y(),u(t,"class","radio-circle svelte-1nekfre"),u(t,"style",n="background-color: "+w(i[1][i[6]])),u(e,"class","radio-item svelte-1nekfre"),F(e,"selected",i[0]===i[4])},m(r,f){v(r,e,f),h(e,t),h(e,o),h(e,c),h(e,l)},p(r,f){f&2&&n!==(n="background-color: "+w(r[1][r[6]]))&&u(t,"style",n),f&4&&s!==(s=r[4]+"")&&R(c,s),f&5&&F(e,"selected",r[0]===r[4])},d(r){r&&k(e)}}}function He(i){let e,t,n,o;t=new z({props:{$$slots:{default:[Fe]},$$scope:{ctx:i}}});let s=I(i[2]),c=[];for(let l=0;l<s.length;l+=1)c[l]=te(ee(i,s,l));return{c(){e=b("div"),A(t.$$.fragment),n=y();for(let l=0;l<c.length;l+=1)c[l].c();u(e,"class","input-radio svelte-1nekfre")},m(l,r){v(l,e,r),B(t,e,null),h(e,n);for(let f=0;f<c.length;f+=1)c[f]&&c[f].m(e,null);o=!0},p(l,[r]){const f={};if(r&136&&(f.$$scope={dirty:r,ctx:l}),t.$set(f),r&7){s=I(l[2]);let a;for(a=0;a<s.length;a+=1){const _=ee(l,s,a);c[a]?c[a].p(_,r):(c[a]=te(_),c[a].c(),c[a].m(e,null))}for(;a<c.length;a+=1)c[a].d(1);c.length=s.length}},i(l){o||(q(t.$$.fragment,l),o=!0)},o(l){N(t.$$.fragment,l),o=!1},d(l){l&&k(e),M(t),D(c,l)}}}function Oe(i,e,t){let{original:n}=e,{interpretation:o}=e,{choices:s}=e,{label:c=""}=e;return i.$$set=l=>{"original"in l&&t(0,n=l.original),"interpretation"in l&&t(1,o=l.interpretation),"choices"in l&&t(2,s=l.choices),"label"in l&&t(3,c=l.label)},[n,o,s,c]}class Pe extends T{constructor(e){super(),j(this,e,Oe,He,G,{original:0,interpretation:1,choices:2,label:3})}}function Qe(i){let e;return{c(){e=C(i[1])},m(t,n){v(t,e,n)},p(t,n){n&2&&R(e,t[1])},d(t){t&&k(e)}}}function Ue(i){let e,t,n,o,s,c,l,r,f,a;return t=new z({props:{$$slots:{default:[Qe]},$$scope:{ctx:i}}}),{c(){e=b("div"),A(t.$$.fragment),n=y(),o=b("div"),s=b("div"),c=b("canvas"),l=y(),r=b("img"),u(s,"class","interpretation svelte-h0dntu"),Q(r.src,f=i[0])||u(r,"src",f),u(r,"class","svelte-h0dntu"),u(o,"class","image-preview svelte-h0dntu"),u(e,"class","input-image")},m(_,g){v(_,e,g),B(t,e,null),h(e,n),h(e,o),h(o,s),h(s,c),i[6](c),h(o,l),h(o,r),i[7](r),a=!0},p(_,[g]){const m={};g&514&&(m.$$scope={dirty:g,ctx:_}),t.$set(m),(!a||g&1&&!Q(r.src,f=_[0]))&&u(r,"src",f)},i(_){a||(q(t.$$.fragment,_),a=!0)},o(_){N(t.$$.fragment,_),a=!1},d(_){_&&k(e),M(t),i[6](null),i[7](null)}}}function Ve(i,e,t){let{original:n}=e,{interpretation:o}=e,{shape:s}=e,{label:c=""}=e,l,r;function f(g,m,d,p){var S=d/g[0].length,H=p/g.length,O=0;g.forEach(function(fe){var P=0;fe.forEach(function(ue){m.fillStyle=w(ue),m.fillRect(P*S,O*H,S,H),P++}),O++})}_e(()=>{let g=X(!0,r.width,r.height,r.naturalWidth,r.naturalHeight);s&&(g=X(!0,g.width,g.height,s[0],s[1]));let m=g.width,d=g.height;l.setAttribute("height",`${d}`),l.setAttribute("width",`${m}`),f(o,l.getContext("2d"),m,d)});function a(g){U[g?"unshift":"push"](()=>{l=g,t(2,l)})}function _(g){U[g?"unshift":"push"](()=>{r=g,t(3,r)})}return i.$$set=g=>{"original"in g&&t(0,n=g.original),"interpretation"in g&&t(4,o=g.interpretation),"shape"in g&&t(5,s=g.shape),"label"in g&&t(1,c=g.label)},[n,c,l,r,o,s,a,_]}class Xe extends T{constructor(e){super(),j(this,e,Ve,Ue,G,{original:0,interpretation:4,shape:5,label:1})}}function le(i,e,t){const n=i.slice();return n[2]=e[t],n}function Ye(i){let e;return{c(){e=C(i[1])},m(t,n){v(t,e,n)},p(t,n){n&2&&R(e,t[1])},d(t){t&&k(e)}}}function ne(i){let e,t;return{c(){e=b("div"),u(e,"class","item svelte-13lmfcp"),u(e,"style",t="background-color: "+w(i[2]))},m(n,o){v(n,e,o)},p(n,o){o&1&&t!==(t="background-color: "+w(n[2]))&&u(e,"style",t)},d(n){n&&k(e)}}}function Ze(i){let e,t,n,o,s;t=new z({props:{$$slots:{default:[Ye]},$$scope:{ctx:i}}});let c=I(i[0]),l=[];for(let r=0;r<c.length;r+=1)l[r]=ne(le(i,c,r));return{c(){e=b("div"),A(t.$$.fragment),n=y(),o=b("div");for(let r=0;r<l.length;r+=1)l[r].c();u(o,"class","range svelte-13lmfcp")},m(r,f){v(r,e,f),B(t,e,null),h(e,n),h(e,o);for(let a=0;a<l.length;a+=1)l[a]&&l[a].m(o,null);s=!0},p(r,[f]){const a={};if(f&34&&(a.$$scope={dirty:f,ctx:r}),t.$set(a),f&1){c=I(r[0]);let _;for(_=0;_<c.length;_+=1){const g=le(r,c,_);l[_]?l[_].p(g,f):(l[_]=ne(g),l[_].c(),l[_].m(o,null))}for(;_<l.length;_+=1)l[_].d(1);l.length=c.length}},i(r){s||(q(t.$$.fragment,r),s=!0)},o(r){N(t.$$.fragment,r),s=!1},d(r){r&&k(e),M(t),D(l,r)}}}function xe(i,e,t){let{interpretation:n}=e,{label:o=""}=e;return i.$$set=s=>{"interpretation"in s&&t(0,n=s.interpretation),"label"in s&&t(1,o=s.label)},[n,o]}class Je extends T{constructor(e){super(),j(this,e,xe,Ze,G,{interpretation:0,label:1})}}function ie(i,e,t){const n=i.slice();return n[2]=e[t][0],n[3]=e[t][1],n}function Ke(i){let e;return{c(){e=C(i[0])},m(t,n){v(t,e,n)},p(t,n){n&1&&R(e,t[0])},d(t){t&&k(e)}}}function re(i){let e,t=i[2]+"",n,o,s;return{c(){e=b("span"),n=C(t),o=y(),u(e,"class","text-span svelte-15c0u2m"),u(e,"style",s="background-color: "+w(i[3]))},m(c,l){v(c,e,l),h(e,n),h(e,o)},p(c,l){l&2&&t!==(t=c[2]+"")&&R(n,t),l&2&&s!==(s="background-color: "+w(c[3]))&&u(e,"style",s)},d(c){c&&k(e)}}}function Le(i){let e,t,n,o;t=new z({props:{$$slots:{default:[Ke]},$$scope:{ctx:i}}});let s=I(i[1]),c=[];for(let l=0;l<s.length;l+=1)c[l]=re(ie(i,s,l));return{c(){e=b("div"),A(t.$$.fragment),n=y();for(let l=0;l<c.length;l+=1)c[l].c();u(e,"class","input-text svelte-15c0u2m")},m(l,r){v(l,e,r),B(t,e,null),h(e,n);for(let f=0;f<c.length;f+=1)c[f]&&c[f].m(e,null);o=!0},p(l,[r]){const f={};if(r&65&&(f.$$scope={dirty:r,ctx:l}),t.$set(f),r&2){s=I(l[1]);let a;for(a=0;a<s.length;a+=1){const _=ie(l,s,a);c[a]?c[a].p(_,r):(c[a]=re(_),c[a].c(),c[a].m(e,null))}for(;a<c.length;a+=1)c[a].d(1);c.length=s.length}},i(l){o||(q(t.$$.fragment,l),o=!0)},o(l){N(t.$$.fragment,l),o=!1},d(l){l&&k(e),M(t),D(c,l)}}}function We(i,e,t){let{label:n=""}=e,{interpretation:o}=e;return i.$$set=s=>{"label"in s&&t(0,n=s.label),"interpretation"in s&&t(1,o=s.interpretation)},[n,o]}class $e extends T{constructor(e){super(),j(this,e,We,Le,G,{label:0,interpretation:1})}}const et={audio:Je,dropdown:Re,checkbox:Ae,checkboxgroup:je,number:we,slider:Ee,radio:Pe,image:Xe,textbox:$e};function ce(i){let e,t,n;const o=[i[0],{original:i[1].original},{interpretation:i[1].interpretation}];var s=i[2];function c(l){let r={};for(let f=0;f<o.length;f+=1)r=me(r,o[f]);return{props:r}}return s&&(e=V(s,c())),{c(){e&&A(e.$$.fragment),t=oe()},m(l,r){e&&B(e,l,r),v(l,t,r),n=!0},p(l,r){const f=r&3?ge(o,[r&1&&he(l[0]),r&2&&{original:l[1].original},r&2&&{interpretation:l[1].interpretation}]):{};if(r&4&&s!==(s=l[2])){if(e){se();const a=e;N(a.$$.fragment,1,0,()=>{M(a,1)}),ae()}s?(e=V(s,c()),A(e.$$.fragment),q(e.$$.fragment,1),B(e,t.parentNode,t)):e=null}else s&&e.$set(f)},i(l){n||(e&&q(e.$$.fragment,l),n=!0)},o(l){e&&N(e.$$.fragment,l),n=!1},d(l){l&&k(t),e&&M(e,l)}}}function tt(i){let e,t,n=i[1]&&ce(i);return{c(){n&&n.c(),e=oe()},m(o,s){n&&n.m(o,s),v(o,e,s),t=!0},p(o,[s]){o[1]?n?(n.p(o,s),s&2&&q(n,1)):(n=ce(o),n.c(),q(n,1),n.m(e.parentNode,e)):n&&(se(),N(n,1,1,()=>{n=null}),ae())},i(o){t||(q(n),t=!0)},o(o){N(n),t=!1},d(o){o&&k(e),n&&n.d(o)}}}function lt(i,e,t){let n,{component:o}=e,{component_props:s}=e,{value:c}=e;return i.$$set=l=>{"component"in l&&t(3,o=l.component),"component_props"in l&&t(0,s=l.component_props),"value"in l&&t(1,c=l.value)},i.$$.update=()=>{i.$$.dirty&8&&t(2,n=et[o])},[s,c,n,o]}class nt extends T{constructor(e){super(),j(this,e,lt,tt,G,{component:3,component_props:0,value:1})}}const st=nt,at=["dynamic"];export{st as Component,at as modes};
-//# sourceMappingURL=index-0be00efc.js.map
diff --git a/spaces/declare-lab/tango/diffusers/examples/community/stable_diffusion_comparison.py b/spaces/declare-lab/tango/diffusers/examples/community/stable_diffusion_comparison.py
deleted file mode 100644
index 7997a0cc01864dfe2ac0e37f8f5b4d5559c0ca4c..0000000000000000000000000000000000000000
--- a/spaces/declare-lab/tango/diffusers/examples/community/stable_diffusion_comparison.py
+++ /dev/null
@@ -1,405 +0,0 @@
-from typing import Any, Callable, Dict, List, Optional, Union
-
-import torch
-from transformers import CLIPImageProcessor, CLIPTextModel, CLIPTokenizer
-
-from diffusers import (
-    AutoencoderKL,
-    DDIMScheduler,
-    DiffusionPipeline,
-    LMSDiscreteScheduler,
-    PNDMScheduler,
-    StableDiffusionPipeline,
-    UNet2DConditionModel,
-)
-from diffusers.pipelines.stable_diffusion import StableDiffusionPipelineOutput
-from diffusers.pipelines.stable_diffusion.safety_checker import StableDiffusionSafetyChecker
-
-
-pipe1_model_id = "CompVis/stable-diffusion-v1-1"
-pipe2_model_id = "CompVis/stable-diffusion-v1-2"
-pipe3_model_id = "CompVis/stable-diffusion-v1-3"
-pipe4_model_id = "CompVis/stable-diffusion-v1-4"
-
-
-class StableDiffusionComparisonPipeline(DiffusionPipeline):
-    r"""
-    Pipeline for parallel comparison of Stable Diffusion v1-v4
-    This pipeline inherits from DiffusionPipeline and depends on the use of an Auth Token for
-    downloading pre-trained checkpoints from Hugging Face Hub.
-    If using Hugging Face Hub, pass the Model ID for Stable Diffusion v1.4 as the previous 3 checkpoints will be loaded
-    automatically.
-    Args:
-        vae ([`AutoencoderKL`]):
-            Variational Auto-Encoder (VAE) Model to encode and decode images to and from latent representations.
-        text_encoder ([`CLIPTextModel`]):
-            Frozen text-encoder. Stable Diffusion uses the text portion of
-            [CLIP](https://huggingface.co/docs/transformers/model_doc/clip#transformers.CLIPTextModel), specifically
-            the [clip-vit-large-patch14](https://huggingface.co/openai/clip-vit-large-patch14) variant.
-        tokenizer (`CLIPTokenizer`):
-            Tokenizer of class
-            [CLIPTokenizer](https://huggingface.co/docs/transformers/v4.21.0/en/model_doc/clip#transformers.CLIPTokenizer).
-        unet ([`UNet2DConditionModel`]): Conditional U-Net architecture to denoise the encoded image latents.
-        scheduler ([`SchedulerMixin`]):
-            A scheduler to be used in combination with `unet` to denoise the encoded image latents. Can be one of
-            [`DDIMScheduler`], [`LMSDiscreteScheduler`], or [`PNDMScheduler`].
-        safety_checker ([`StableDiffusionMegaSafetyChecker`]):
-            Classification module that estimates whether generated images could be considered offensive or harmful.
-            Please, refer to the [model card](https://huggingface.co/runwayml/stable-diffusion-v1-5) for details.
-        feature_extractor ([`CLIPImageProcessor`]):
-            Model that extracts features from generated images to be used as inputs for the `safety_checker`.
-    """
-
-    def __init__(
-        self,
-        vae: AutoencoderKL,
-        text_encoder: CLIPTextModel,
-        tokenizer: CLIPTokenizer,
-        unet: UNet2DConditionModel,
-        scheduler: Union[DDIMScheduler, PNDMScheduler, LMSDiscreteScheduler],
-        safety_checker: StableDiffusionSafetyChecker,
-        feature_extractor: CLIPImageProcessor,
-        requires_safety_checker: bool = True,
-    ):
-        super()._init_()
-
-        self.pipe1 = StableDiffusionPipeline.from_pretrained(pipe1_model_id)
-        self.pipe2 = StableDiffusionPipeline.from_pretrained(pipe2_model_id)
-        self.pipe3 = StableDiffusionPipeline.from_pretrained(pipe3_model_id)
-        self.pipe4 = StableDiffusionPipeline(
-            vae=vae,
-            text_encoder=text_encoder,
-            tokenizer=tokenizer,
-            unet=unet,
-            scheduler=scheduler,
-            safety_checker=safety_checker,
-            feature_extractor=feature_extractor,
-            requires_safety_checker=requires_safety_checker,
-        )
-
-        self.register_modules(pipeline1=self.pipe1, pipeline2=self.pipe2, pipeline3=self.pipe3, pipeline4=self.pipe4)
-
-    @property
-    def layers(self) -> Dict[str, Any]:
-        return {k: getattr(self, k) for k in self.config.keys() if not k.startswith("_")}
-
-    def enable_attention_slicing(self, slice_size: Optional[Union[str, int]] = "auto"):
-        r"""
-        Enable sliced attention computation.
-        When this option is enabled, the attention module will split the input tensor in slices, to compute attention
-        in several steps. This is useful to save some memory in exchange for a small speed decrease.
-        Args:
-            slice_size (`str` or `int`, *optional*, defaults to `"auto"`):
-                When `"auto"`, halves the input to the attention heads, so attention will be computed in two steps. If
-                a number is provided, uses as many slices as `attention_head_dim // slice_size`. In this case,
-                `attention_head_dim` must be a multiple of `slice_size`.
-        """
-        if slice_size == "auto":
-            # half the attention head size is usually a good trade-off between
-            # speed and memory
-            slice_size = self.unet.config.attention_head_dim // 2
-        self.unet.set_attention_slice(slice_size)
-
-    def disable_attention_slicing(self):
-        r"""
-        Disable sliced attention computation. If `enable_attention_slicing` was previously invoked, this method will go
-        back to computing attention in one step.
-        """
-        # set slice_size = `None` to disable `attention slicing`
-        self.enable_attention_slicing(None)
-
-    @torch.no_grad()
-    def text2img_sd1_1(
-        self,
-        prompt: Union[str, List[str]],
-        height: int = 512,
-        width: int = 512,
-        num_inference_steps: int = 50,
-        guidance_scale: float = 7.5,
-        negative_prompt: Optional[Union[str, List[str]]] = None,
-        num_images_per_prompt: Optional[int] = 1,
-        eta: float = 0.0,
-        generator: Optional[torch.Generator] = None,
-        latents: Optional[torch.FloatTensor] = None,
-        output_type: Optional[str] = "pil",
-        return_dict: bool = True,
-        callback: Optional[Callable[[int, int, torch.FloatTensor], None]] = None,
-        callback_steps: int = 1,
-        **kwargs,
-    ):
-        return self.pipe1(
-            prompt=prompt,
-            height=height,
-            width=width,
-            num_inference_steps=num_inference_steps,
-            guidance_scale=guidance_scale,
-            negative_prompt=negative_prompt,
-            num_images_per_prompt=num_images_per_prompt,
-            eta=eta,
-            generator=generator,
-            latents=latents,
-            output_type=output_type,
-            return_dict=return_dict,
-            callback=callback,
-            callback_steps=callback_steps,
-            **kwargs,
-        )
-
-    @torch.no_grad()
-    def text2img_sd1_2(
-        self,
-        prompt: Union[str, List[str]],
-        height: int = 512,
-        width: int = 512,
-        num_inference_steps: int = 50,
-        guidance_scale: float = 7.5,
-        negative_prompt: Optional[Union[str, List[str]]] = None,
-        num_images_per_prompt: Optional[int] = 1,
-        eta: float = 0.0,
-        generator: Optional[torch.Generator] = None,
-        latents: Optional[torch.FloatTensor] = None,
-        output_type: Optional[str] = "pil",
-        return_dict: bool = True,
-        callback: Optional[Callable[[int, int, torch.FloatTensor], None]] = None,
-        callback_steps: int = 1,
-        **kwargs,
-    ):
-        return self.pipe2(
-            prompt=prompt,
-            height=height,
-            width=width,
-            num_inference_steps=num_inference_steps,
-            guidance_scale=guidance_scale,
-            negative_prompt=negative_prompt,
-            num_images_per_prompt=num_images_per_prompt,
-            eta=eta,
-            generator=generator,
-            latents=latents,
-            output_type=output_type,
-            return_dict=return_dict,
-            callback=callback,
-            callback_steps=callback_steps,
-            **kwargs,
-        )
-
-    @torch.no_grad()
-    def text2img_sd1_3(
-        self,
-        prompt: Union[str, List[str]],
-        height: int = 512,
-        width: int = 512,
-        num_inference_steps: int = 50,
-        guidance_scale: float = 7.5,
-        negative_prompt: Optional[Union[str, List[str]]] = None,
-        num_images_per_prompt: Optional[int] = 1,
-        eta: float = 0.0,
-        generator: Optional[torch.Generator] = None,
-        latents: Optional[torch.FloatTensor] = None,
-        output_type: Optional[str] = "pil",
-        return_dict: bool = True,
-        callback: Optional[Callable[[int, int, torch.FloatTensor], None]] = None,
-        callback_steps: int = 1,
-        **kwargs,
-    ):
-        return self.pipe3(
-            prompt=prompt,
-            height=height,
-            width=width,
-            num_inference_steps=num_inference_steps,
-            guidance_scale=guidance_scale,
-            negative_prompt=negative_prompt,
-            num_images_per_prompt=num_images_per_prompt,
-            eta=eta,
-            generator=generator,
-            latents=latents,
-            output_type=output_type,
-            return_dict=return_dict,
-            callback=callback,
-            callback_steps=callback_steps,
-            **kwargs,
-        )
-
-    @torch.no_grad()
-    def text2img_sd1_4(
-        self,
-        prompt: Union[str, List[str]],
-        height: int = 512,
-        width: int = 512,
-        num_inference_steps: int = 50,
-        guidance_scale: float = 7.5,
-        negative_prompt: Optional[Union[str, List[str]]] = None,
-        num_images_per_prompt: Optional[int] = 1,
-        eta: float = 0.0,
-        generator: Optional[torch.Generator] = None,
-        latents: Optional[torch.FloatTensor] = None,
-        output_type: Optional[str] = "pil",
-        return_dict: bool = True,
-        callback: Optional[Callable[[int, int, torch.FloatTensor], None]] = None,
-        callback_steps: int = 1,
-        **kwargs,
-    ):
-        return self.pipe4(
-            prompt=prompt,
-            height=height,
-            width=width,
-            num_inference_steps=num_inference_steps,
-            guidance_scale=guidance_scale,
-            negative_prompt=negative_prompt,
-            num_images_per_prompt=num_images_per_prompt,
-            eta=eta,
-            generator=generator,
-            latents=latents,
-            output_type=output_type,
-            return_dict=return_dict,
-            callback=callback,
-            callback_steps=callback_steps,
-            **kwargs,
-        )
-
-    @torch.no_grad()
-    def _call_(
-        self,
-        prompt: Union[str, List[str]],
-        height: int = 512,
-        width: int = 512,
-        num_inference_steps: int = 50,
-        guidance_scale: float = 7.5,
-        negative_prompt: Optional[Union[str, List[str]]] = None,
-        num_images_per_prompt: Optional[int] = 1,
-        eta: float = 0.0,
-        generator: Optional[torch.Generator] = None,
-        latents: Optional[torch.FloatTensor] = None,
-        output_type: Optional[str] = "pil",
-        return_dict: bool = True,
-        callback: Optional[Callable[[int, int, torch.FloatTensor], None]] = None,
-        callback_steps: int = 1,
-        **kwargs,
-    ):
-        r"""
-        Function invoked when calling the pipeline for generation. This function will generate 4 results as part
-        of running all the 4 pipelines for SD1.1-1.4 together in a serial-processing, parallel-invocation fashion.
-        Args:
-            prompt (`str` or `List[str]`):
-                The prompt or prompts to guide the image generation.
-            height (`int`, optional, defaults to 512):
-                The height in pixels of the generated image.
-            width (`int`, optional, defaults to 512):
-                The width in pixels of the generated image.
-            num_inference_steps (`int`, optional, defaults to 50):
-                The number of denoising steps. More denoising steps usually lead to a higher quality image at the
-                expense of slower inference.
-            guidance_scale (`float`, optional, defaults to 7.5):
-                Guidance scale as defined in [Classifier-Free Diffusion Guidance](https://arxiv.org/abs/2207.12598).
-                `guidance_scale` is defined as `w` of equation 2. of [Imagen
-                Paper](https://arxiv.org/pdf/2205.11487.pdf). Guidance scale is enabled by setting `guidance_scale >
-                1`. Higher guidance scale encourages to generate images that are closely linked to the text `prompt`,
-                usually at the expense of lower image quality.
-            eta (`float`, optional, defaults to 0.0):
-                Corresponds to parameter eta (η) in the DDIM paper: https://arxiv.org/abs/2010.02502. Only applies to
-                [`schedulers.DDIMScheduler`], will be ignored for others.
-            generator (`torch.Generator`, optional):
-                A [torch generator](https://pytorch.org/docs/stable/generated/torch.Generator.html) to make generation
-                deterministic.
-            latents (`torch.FloatTensor`, optional):
-                Pre-generated noisy latents, sampled from a Gaussian distribution, to be used as inputs for image
-                generation. Can be used to tweak the same generation with different prompts. If not provided, a latents
-                tensor will ge generated by sampling using the supplied random `generator`.
-            output_type (`str`, optional, defaults to `"pil"`):
-                The output format of the generate image. Choose between
-                [PIL](https://pillow.readthedocs.io/en/stable/): `PIL.Image.Image` or `np.array`.
-            return_dict (`bool`, optional, defaults to `True`):
-                Whether or not to return a [`~pipelines.stable_diffusion.StableDiffusionPipelineOutput`] instead of a
-                plain tuple.
-        Returns:
-            [`~pipelines.stable_diffusion.StableDiffusionPipelineOutput`] or `tuple`:
-            [`~pipelines.stable_diffusion.StableDiffusionPipelineOutput`] if `return_dict` is True, otherwise a `tuple.
-            When returning a tuple, the first element is a list with the generated images, and the second element is a
-            list of `bool`s denoting whether the corresponding generated image likely represents "not-safe-for-work"
-            (nsfw) content, according to the `safety_checker`.
-        """
-
-        device = "cuda" if torch.cuda.is_available() else "cpu"
-        self.to(device)
-
-        # Checks if the height and width are divisible by 8 or not
-        if height % 8 != 0 or width % 8 != 0:
-            raise ValueError(f"`height` and `width` must be divisible by 8 but are {height} and {width}.")
-
-        # Get first result from Stable Diffusion Checkpoint v1.1
-        res1 = self.text2img_sd1_1(
-            prompt=prompt,
-            height=height,
-            width=width,
-            num_inference_steps=num_inference_steps,
-            guidance_scale=guidance_scale,
-            negative_prompt=negative_prompt,
-            num_images_per_prompt=num_images_per_prompt,
-            eta=eta,
-            generator=generator,
-            latents=latents,
-            output_type=output_type,
-            return_dict=return_dict,
-            callback=callback,
-            callback_steps=callback_steps,
-            **kwargs,
-        )
-
-        # Get first result from Stable Diffusion Checkpoint v1.2
-        res2 = self.text2img_sd1_2(
-            prompt=prompt,
-            height=height,
-            width=width,
-            num_inference_steps=num_inference_steps,
-            guidance_scale=guidance_scale,
-            negative_prompt=negative_prompt,
-            num_images_per_prompt=num_images_per_prompt,
-            eta=eta,
-            generator=generator,
-            latents=latents,
-            output_type=output_type,
-            return_dict=return_dict,
-            callback=callback,
-            callback_steps=callback_steps,
-            **kwargs,
-        )
-
-        # Get first result from Stable Diffusion Checkpoint v1.3
-        res3 = self.text2img_sd1_3(
-            prompt=prompt,
-            height=height,
-            width=width,
-            num_inference_steps=num_inference_steps,
-            guidance_scale=guidance_scale,
-            negative_prompt=negative_prompt,
-            num_images_per_prompt=num_images_per_prompt,
-            eta=eta,
-            generator=generator,
-            latents=latents,
-            output_type=output_type,
-            return_dict=return_dict,
-            callback=callback,
-            callback_steps=callback_steps,
-            **kwargs,
-        )
-
-        # Get first result from Stable Diffusion Checkpoint v1.4
-        res4 = self.text2img_sd1_4(
-            prompt=prompt,
-            height=height,
-            width=width,
-            num_inference_steps=num_inference_steps,
-            guidance_scale=guidance_scale,
-            negative_prompt=negative_prompt,
-            num_images_per_prompt=num_images_per_prompt,
-            eta=eta,
-            generator=generator,
-            latents=latents,
-            output_type=output_type,
-            return_dict=return_dict,
-            callback=callback,
-            callback_steps=callback_steps,
-            **kwargs,
-        )
-
-        # Get all result images into a single list and pass it via StableDiffusionPipelineOutput for final result
-        return StableDiffusionPipelineOutput([res1[0], res2[0], res3[0], res4[0]])
diff --git a/spaces/declare-lab/tango/diffusers/src/diffusers/schedulers/scheduling_k_dpm_2_ancestral_discrete.py b/spaces/declare-lab/tango/diffusers/src/diffusers/schedulers/scheduling_k_dpm_2_ancestral_discrete.py
deleted file mode 100644
index c8b1f2c3bedf899d55a253b2c8a07709f6b476d8..0000000000000000000000000000000000000000
--- a/spaces/declare-lab/tango/diffusers/src/diffusers/schedulers/scheduling_k_dpm_2_ancestral_discrete.py
+++ /dev/null
@@ -1,352 +0,0 @@
-# Copyright 2023 Katherine Crowson, The HuggingFace Team and hlky. All rights reserved.
-#
-# Licensed under the Apache License, Version 2.0 (the "License");
-# you may not use this file except in compliance with the License.
-# You may obtain a copy of the License at
-#
-#     http://www.apache.org/licenses/LICENSE-2.0
-#
-# Unless required by applicable law or agreed to in writing, software
-# distributed under the License is distributed on an "AS IS" BASIS,
-# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-# See the License for the specific language governing permissions and
-# limitations under the License.
-
-import math
-from typing import List, Optional, Tuple, Union
-
-import numpy as np
-import torch
-
-from ..configuration_utils import ConfigMixin, register_to_config
-from ..utils import randn_tensor
-from .scheduling_utils import KarrasDiffusionSchedulers, SchedulerMixin, SchedulerOutput
-
-
-# Copied from diffusers.schedulers.scheduling_ddpm.betas_for_alpha_bar
-def betas_for_alpha_bar(num_diffusion_timesteps, max_beta=0.999) -> torch.Tensor:
-    """
-    Create a beta schedule that discretizes the given alpha_t_bar function, which defines the cumulative product of
-    (1-beta) over time from t = [0,1].
-
-    Contains a function alpha_bar that takes an argument t and transforms it to the cumulative product of (1-beta) up
-    to that part of the diffusion process.
-
-
-    Args:
-        num_diffusion_timesteps (`int`): the number of betas to produce.
-        max_beta (`float`): the maximum beta to use; use values lower than 1 to
-                     prevent singularities.
-
-    Returns:
-        betas (`np.ndarray`): the betas used by the scheduler to step the model outputs
-    """
-
-    def alpha_bar(time_step):
-        return math.cos((time_step + 0.008) / 1.008 * math.pi / 2) ** 2
-
-    betas = []
-    for i in range(num_diffusion_timesteps):
-        t1 = i / num_diffusion_timesteps
-        t2 = (i + 1) / num_diffusion_timesteps
-        betas.append(min(1 - alpha_bar(t2) / alpha_bar(t1), max_beta))
-    return torch.tensor(betas, dtype=torch.float32)
-
-
-class KDPM2AncestralDiscreteScheduler(SchedulerMixin, ConfigMixin):
-    """
-    Scheduler created by @crowsonkb in [k_diffusion](https://github.com/crowsonkb/k-diffusion), see:
-    https://github.com/crowsonkb/k-diffusion/blob/5b3af030dd83e0297272d861c19477735d0317ec/k_diffusion/sampling.py#L188
-
-    Scheduler inspired by DPM-Solver-2 and Algorthim 2 from Karras et al. (2022).
-
-    [`~ConfigMixin`] takes care of storing all config attributes that are passed in the scheduler's `__init__`
-    function, such as `num_train_timesteps`. They can be accessed via `scheduler.config.num_train_timesteps`.
-    [`SchedulerMixin`] provides general loading and saving functionality via the [`SchedulerMixin.save_pretrained`] and
-    [`~SchedulerMixin.from_pretrained`] functions.
-
-    Args:
-        num_train_timesteps (`int`): number of diffusion steps used to train the model. beta_start (`float`): the
-        starting `beta` value of inference. beta_end (`float`): the final `beta` value. beta_schedule (`str`):
-            the beta schedule, a mapping from a beta range to a sequence of betas for stepping the model. Choose from
-            `linear` or `scaled_linear`.
-        trained_betas (`np.ndarray`, optional):
-            option to pass an array of betas directly to the constructor to bypass `beta_start`, `beta_end` etc.
-            options to clip the variance used when adding noise to the denoised sample. Choose from `fixed_small`,
-            `fixed_small_log`, `fixed_large`, `fixed_large_log`, `learned` or `learned_range`.
-        prediction_type (`str`, default `epsilon`, optional):
-            prediction type of the scheduler function, one of `epsilon` (predicting the noise of the diffusion
-            process), `sample` (directly predicting the noisy sample`) or `v_prediction` (see section 2.4
-            https://imagen.research.google/video/paper.pdf)
-    """
-
-    _compatibles = [e.name for e in KarrasDiffusionSchedulers]
-    order = 2
-
-    @register_to_config
-    def __init__(
-        self,
-        num_train_timesteps: int = 1000,
-        beta_start: float = 0.00085,  # sensible defaults
-        beta_end: float = 0.012,
-        beta_schedule: str = "linear",
-        trained_betas: Optional[Union[np.ndarray, List[float]]] = None,
-        prediction_type: str = "epsilon",
-    ):
-        if trained_betas is not None:
-            self.betas = torch.tensor(trained_betas, dtype=torch.float32)
-        elif beta_schedule == "linear":
-            self.betas = torch.linspace(beta_start, beta_end, num_train_timesteps, dtype=torch.float32)
-        elif beta_schedule == "scaled_linear":
-            # this schedule is very specific to the latent diffusion model.
-            self.betas = (
-                torch.linspace(beta_start**0.5, beta_end**0.5, num_train_timesteps, dtype=torch.float32) ** 2
-            )
-        elif beta_schedule == "squaredcos_cap_v2":
-            # Glide cosine schedule
-            self.betas = betas_for_alpha_bar(num_train_timesteps)
-        else:
-            raise NotImplementedError(f"{beta_schedule} does is not implemented for {self.__class__}")
-
-        self.alphas = 1.0 - self.betas
-        self.alphas_cumprod = torch.cumprod(self.alphas, dim=0)
-
-        #  set all values
-        self.set_timesteps(num_train_timesteps, None, num_train_timesteps)
-
-    def index_for_timestep(self, timestep):
-        indices = (self.timesteps == timestep).nonzero()
-        if self.state_in_first_order:
-            pos = -1
-        else:
-            pos = 0
-        return indices[pos].item()
-
-    def scale_model_input(
-        self,
-        sample: torch.FloatTensor,
-        timestep: Union[float, torch.FloatTensor],
-    ) -> torch.FloatTensor:
-        """
-        Args:
-        Ensures interchangeability with schedulers that need to scale the denoising model input depending on the
-        current timestep.
-            sample (`torch.FloatTensor`): input sample timestep (`int`, optional): current timestep
-        Returns:
-            `torch.FloatTensor`: scaled input sample
-        """
-        step_index = self.index_for_timestep(timestep)
-
-        if self.state_in_first_order:
-            sigma = self.sigmas[step_index]
-        else:
-            sigma = self.sigmas_interpol[step_index - 1]
-
-        sample = sample / ((sigma**2 + 1) ** 0.5)
-        return sample
-
-    def set_timesteps(
-        self,
-        num_inference_steps: int,
-        device: Union[str, torch.device] = None,
-        num_train_timesteps: Optional[int] = None,
-    ):
-        """
-        Sets the timesteps used for the diffusion chain. Supporting function to be run before inference.
-
-        Args:
-            num_inference_steps (`int`):
-                the number of diffusion steps used when generating samples with a pre-trained model.
-            device (`str` or `torch.device`, optional):
-                the device to which the timesteps should be moved to. If `None`, the timesteps are not moved.
-        """
-        self.num_inference_steps = num_inference_steps
-
-        num_train_timesteps = num_train_timesteps or self.config.num_train_timesteps
-
-        timesteps = np.linspace(0, num_train_timesteps - 1, num_inference_steps, dtype=float)[::-1].copy()
-
-        sigmas = np.array(((1 - self.alphas_cumprod) / self.alphas_cumprod) ** 0.5)
-        self.log_sigmas = torch.from_numpy(np.log(sigmas)).to(device)
-
-        sigmas = np.interp(timesteps, np.arange(0, len(sigmas)), sigmas)
-        sigmas = np.concatenate([sigmas, [0.0]]).astype(np.float32)
-        sigmas = torch.from_numpy(sigmas).to(device=device)
-
-        # compute up and down sigmas
-        sigmas_next = sigmas.roll(-1)
-        sigmas_next[-1] = 0.0
-        sigmas_up = (sigmas_next**2 * (sigmas**2 - sigmas_next**2) / sigmas**2) ** 0.5
-        sigmas_down = (sigmas_next**2 - sigmas_up**2) ** 0.5
-        sigmas_down[-1] = 0.0
-
-        # compute interpolated sigmas
-        sigmas_interpol = sigmas.log().lerp(sigmas_down.log(), 0.5).exp()
-        sigmas_interpol[-2:] = 0.0
-
-        # set sigmas
-        self.sigmas = torch.cat([sigmas[:1], sigmas[1:].repeat_interleave(2), sigmas[-1:]])
-        self.sigmas_interpol = torch.cat(
-            [sigmas_interpol[:1], sigmas_interpol[1:].repeat_interleave(2), sigmas_interpol[-1:]]
-        )
-        self.sigmas_up = torch.cat([sigmas_up[:1], sigmas_up[1:].repeat_interleave(2), sigmas_up[-1:]])
-        self.sigmas_down = torch.cat([sigmas_down[:1], sigmas_down[1:].repeat_interleave(2), sigmas_down[-1:]])
-
-        # standard deviation of the initial noise distribution
-        self.init_noise_sigma = self.sigmas.max()
-
-        if str(device).startswith("mps"):
-            # mps does not support float64
-            timesteps = torch.from_numpy(timesteps).to(device, dtype=torch.float32)
-        else:
-            timesteps = torch.from_numpy(timesteps).to(device)
-
-        timesteps_interpol = self.sigma_to_t(sigmas_interpol).to(device)
-        interleaved_timesteps = torch.stack((timesteps_interpol[:-2, None], timesteps[1:, None]), dim=-1).flatten()
-
-        self.timesteps = torch.cat([timesteps[:1], interleaved_timesteps])
-
-        self.sample = None
-
-    def sigma_to_t(self, sigma):
-        # get log sigma
-        log_sigma = sigma.log()
-
-        # get distribution
-        dists = log_sigma - self.log_sigmas[:, None]
-
-        # get sigmas range
-        low_idx = dists.ge(0).cumsum(dim=0).argmax(dim=0).clamp(max=self.log_sigmas.shape[0] - 2)
-        high_idx = low_idx + 1
-
-        low = self.log_sigmas[low_idx]
-        high = self.log_sigmas[high_idx]
-
-        # interpolate sigmas
-        w = (low - log_sigma) / (low - high)
-        w = w.clamp(0, 1)
-
-        # transform interpolation to time range
-        t = (1 - w) * low_idx + w * high_idx
-        t = t.view(sigma.shape)
-        return t
-
-    @property
-    def state_in_first_order(self):
-        return self.sample is None
-
-    def step(
-        self,
-        model_output: Union[torch.FloatTensor, np.ndarray],
-        timestep: Union[float, torch.FloatTensor],
-        sample: Union[torch.FloatTensor, np.ndarray],
-        generator: Optional[torch.Generator] = None,
-        return_dict: bool = True,
-    ) -> Union[SchedulerOutput, Tuple]:
-        """
-        Args:
-        Predict the sample at the previous timestep by reversing the SDE. Core function to propagate the diffusion
-        process from the learned model outputs (most often the predicted noise).
-            model_output (`torch.FloatTensor` or `np.ndarray`): direct output from learned diffusion model. timestep
-            (`int`): current discrete timestep in the diffusion chain. sample (`torch.FloatTensor` or `np.ndarray`):
-                current instance of sample being created by diffusion process.
-            return_dict (`bool`): option for returning tuple rather than SchedulerOutput class
-        Returns:
-            [`~schedulers.scheduling_utils.SchedulerOutput`] or `tuple`:
-            [`~schedulers.scheduling_utils.SchedulerOutput`] if `return_dict` is True, otherwise a `tuple`. When
-            returning a tuple, the first element is the sample tensor.
-        """
-        step_index = self.index_for_timestep(timestep)
-
-        if self.state_in_first_order:
-            sigma = self.sigmas[step_index]
-            sigma_interpol = self.sigmas_interpol[step_index]
-            sigma_up = self.sigmas_up[step_index]
-            sigma_down = self.sigmas_down[step_index - 1]
-        else:
-            # 2nd order / KPDM2's method
-            sigma = self.sigmas[step_index - 1]
-            sigma_interpol = self.sigmas_interpol[step_index - 1]
-            sigma_up = self.sigmas_up[step_index - 1]
-            sigma_down = self.sigmas_down[step_index - 1]
-
-        # currently only gamma=0 is supported. This usually works best anyways.
-        # We can support gamma in the future but then need to scale the timestep before
-        # passing it to the model which requires a change in API
-        gamma = 0
-        sigma_hat = sigma * (gamma + 1)  # Note: sigma_hat == sigma for now
-
-        device = model_output.device
-        noise = randn_tensor(model_output.shape, dtype=model_output.dtype, device=device, generator=generator)
-
-        # 1. compute predicted original sample (x_0) from sigma-scaled predicted noise
-        if self.config.prediction_type == "epsilon":
-            sigma_input = sigma_hat if self.state_in_first_order else sigma_interpol
-            pred_original_sample = sample - sigma_input * model_output
-        elif self.config.prediction_type == "v_prediction":
-            sigma_input = sigma_hat if self.state_in_first_order else sigma_interpol
-            pred_original_sample = model_output * (-sigma_input / (sigma_input**2 + 1) ** 0.5) + (
-                sample / (sigma_input**2 + 1)
-            )
-        elif self.config.prediction_type == "sample":
-            raise NotImplementedError("prediction_type not implemented yet: sample")
-        else:
-            raise ValueError(
-                f"prediction_type given as {self.config.prediction_type} must be one of `epsilon`, or `v_prediction`"
-            )
-
-        if self.state_in_first_order:
-            # 2. Convert to an ODE derivative for 1st order
-            derivative = (sample - pred_original_sample) / sigma_hat
-            # 3. delta timestep
-            dt = sigma_interpol - sigma_hat
-
-            # store for 2nd order step
-            self.sample = sample
-            self.dt = dt
-            prev_sample = sample + derivative * dt
-        else:
-            # DPM-Solver-2
-            # 2. Convert to an ODE derivative for 2nd order
-            derivative = (sample - pred_original_sample) / sigma_interpol
-            # 3. delta timestep
-            dt = sigma_down - sigma_hat
-
-            sample = self.sample
-            self.sample = None
-
-            prev_sample = sample + derivative * dt
-            prev_sample = prev_sample + noise * sigma_up
-
-        if not return_dict:
-            return (prev_sample,)
-
-        return SchedulerOutput(prev_sample=prev_sample)
-
-    def add_noise(
-        self,
-        original_samples: torch.FloatTensor,
-        noise: torch.FloatTensor,
-        timesteps: torch.FloatTensor,
-    ) -> torch.FloatTensor:
-        # Make sure sigmas and timesteps have the same device and dtype as original_samples
-        self.sigmas = self.sigmas.to(device=original_samples.device, dtype=original_samples.dtype)
-        if original_samples.device.type == "mps" and torch.is_floating_point(timesteps):
-            # mps does not support float64
-            self.timesteps = self.timesteps.to(original_samples.device, dtype=torch.float32)
-            timesteps = timesteps.to(original_samples.device, dtype=torch.float32)
-        else:
-            self.timesteps = self.timesteps.to(original_samples.device)
-            timesteps = timesteps.to(original_samples.device)
-
-        step_indices = [self.index_for_timestep(t) for t in timesteps]
-
-        sigma = self.sigmas[step_indices].flatten()
-        while len(sigma.shape) < len(original_samples.shape):
-            sigma = sigma.unsqueeze(-1)
-
-        noisy_samples = original_samples + noise * sigma
-        return noisy_samples
-
-    def __len__(self):
-        return self.config.num_train_timesteps
diff --git a/spaces/deeplearning/audioldm-text-to-audio-generation/audioldm/clap/training/zero_shot.py b/spaces/deeplearning/audioldm-text-to-audio-generation/audioldm/clap/training/zero_shot.py
deleted file mode 100644
index 28b8fccc1af17fc69002857a7f529ac041c374f2..0000000000000000000000000000000000000000
--- a/spaces/deeplearning/audioldm-text-to-audio-generation/audioldm/clap/training/zero_shot.py
+++ /dev/null
@@ -1,95 +0,0 @@
-# NOTE: This script is currently not supported for CLAP.
-import logging
-from contextlib import suppress
-
-import torch
-import torch.nn.functional as F
-from tqdm import tqdm
-
-from open_clip import tokenize
-from .imagenet_zeroshot_data import imagenet_classnames, openai_imagenet_template
-
-
-def zero_shot_classifier(model, classnames, templates, args):
-    with torch.no_grad():
-        zeroshot_weights = []
-        for classname in tqdm(classnames):
-            texts = [template(classname) for template in templates]  # format with class
-            texts = tokenize(texts).to(args.device)  # tokenize
-            if args.distributed and not args.horovod:
-                class_embeddings = model.module.encode_text(texts)
-            else:
-                class_embeddings = model.encode_text(texts)
-            class_embedding = F.normalize(class_embeddings, dim=-1).mean(dim=0)
-            class_embedding /= class_embedding.norm()
-            zeroshot_weights.append(class_embedding)
-        zeroshot_weights = torch.stack(zeroshot_weights, dim=1).to(args.device)
-    return zeroshot_weights
-
-
-def accuracy(output, target, topk=(1,)):
-    pred = output.topk(max(topk), 1, True, True)[1].t()
-    correct = pred.eq(target.view(1, -1).expand_as(pred))
-    return [
-        float(correct[:k].reshape(-1).float().sum(0, keepdim=True).cpu().numpy())
-        for k in topk
-    ]
-
-
-def run(model, classifier, dataloader, args):
-    autocast = torch.cuda.amp.autocast if args.precision == "amp" else suppress
-    with torch.no_grad():
-        top1, top5, n = 0.0, 0.0, 0.0
-        for images, target in tqdm(dataloader, unit_scale=args.batch_size):
-            images = images.to(args.device)
-            target = target.to(args.device)
-
-            with autocast():
-                # predict
-                if args.distributed and not args.horovod:
-                    image_features = model.module.encode_image(images)
-                else:
-                    image_features = model.encode_image(images)
-                image_features = F.normalize(image_features, dim=-1)
-                logits = 100.0 * image_features @ classifier
-
-            # measure accuracy
-            acc1, acc5 = accuracy(logits, target, topk=(1, 5))
-            top1 += acc1
-            top5 += acc5
-            n += images.size(0)
-
-    top1 = top1 / n
-    top5 = top5 / n
-    return top1, top5
-
-
-def zero_shot_eval(model, data, epoch, args):
-    if "imagenet-val" not in data and "imagenet-v2" not in data:
-        return {}
-    if args.zeroshot_frequency == 0:
-        return {}
-    if (epoch % args.zeroshot_frequency) != 0 and epoch != args.epochs:
-        return {}
-
-    logging.info("Starting zero-shot imagenet.")
-
-    logging.info("Building zero-shot classifier")
-    classifier = zero_shot_classifier(
-        model, imagenet_classnames, openai_imagenet_template, args
-    )
-
-    logging.info("Using classifier")
-    results = {}
-    if "imagenet-val" in data:
-        top1, top5 = run(model, classifier, data["imagenet-val"].dataloader, args)
-        results["imagenet-zeroshot-val-top1"] = top1
-        results["imagenet-zeroshot-val-top5"] = top5
-    if "imagenet-v2" in data:
-        top1, top5 = run(model, classifier, data["imagenet-v2"].dataloader, args)
-        results["imagenetv2-zeroshot-val-top1"] = top1
-        results["imagenetv2-zeroshot-val-top5"] = top5
-
-    logging.info("Finished zero-shot imagenet.")
-
-    return results
diff --git a/spaces/deepwisdom/MetaGPT/tests/metagpt/test_schema.py b/spaces/deepwisdom/MetaGPT/tests/metagpt/test_schema.py
deleted file mode 100644
index 12666e0d39bf4d369f24e21524fb67971d39e518..0000000000000000000000000000000000000000
--- a/spaces/deepwisdom/MetaGPT/tests/metagpt/test_schema.py
+++ /dev/null
@@ -1,21 +0,0 @@
-#!/usr/bin/env python
-# -*- coding: utf-8 -*-
-"""
-@Time    : 2023/5/20 10:40
-@Author  : alexanderwu
-@File    : test_schema.py
-"""
-from metagpt.schema import AIMessage, Message, SystemMessage, UserMessage
-
-
-def test_messages():
-    test_content = 'test_message'
-    msgs = [
-        UserMessage(test_content),
-        SystemMessage(test_content),
-        AIMessage(test_content),
-        Message(test_content, role='QA')
-    ]
-    text = str(msgs)
-    roles = ['user', 'system', 'assistant', 'QA']
-    assert all([i in text for i in roles])
diff --git a/spaces/dhanushreddy29/Remove_Background/README.md b/spaces/dhanushreddy29/Remove_Background/README.md
deleted file mode 100644
index b6cd072accc6715ef4287596fa326f06d4751461..0000000000000000000000000000000000000000
--- a/spaces/dhanushreddy29/Remove_Background/README.md
+++ /dev/null
@@ -1,10 +0,0 @@
----
-title: Remove_Background
-app_file: main.py
-sdk: gradio
-sdk_version: 3.14.0
-license: mit
-emoji: ⚡
-colorFrom: indigo
-colorTo: blue
----
\ No newline at end of file
diff --git a/spaces/dhanushreddy29/microstructure-project/README.md b/spaces/dhanushreddy29/microstructure-project/README.md
deleted file mode 100644
index 4d884643e2d5b3c4f4de69fbe9d9526f2b8d7334..0000000000000000000000000000000000000000
--- a/spaces/dhanushreddy29/microstructure-project/README.md
+++ /dev/null
@@ -1,13 +0,0 @@
----
-title: Microstructure Project
-emoji: 💻
-colorFrom: red
-colorTo: indigo
-sdk: gradio
-sdk_version: 3.27.0
-app_file: app.py
-pinned: false
-license: mit
----
-
-Check out the configuration reference at https://huggingface.co/docs/hub/spaces-config-reference
diff --git a/spaces/diacanFperku/AutoGPT/(2011) BEST Crack.Joystix.Pro.2.0.md b/spaces/diacanFperku/AutoGPT/(2011) BEST Crack.Joystix.Pro.2.0.md
deleted file mode 100644
index dac518318abef08ddebf5006fc66e8ec162cbb1a..0000000000000000000000000000000000000000
--- a/spaces/diacanFperku/AutoGPT/(2011) BEST Crack.Joystix.Pro.2.0.md	
+++ /dev/null
@@ -1,6 +0,0 @@
-<h2>(2011) Crack.Joystix.Pro.2.0</h2><br /><p><b><b>Download</b>  <a href="https://gohhs.com/2uFU3Y">https://gohhs.com/2uFU3Y</a></b></p><br /><br />
-
-"When I went from the one-button joysticks of the Atari to the NES with ... Valve is ceasing development on card-battler reboot Artifact 2.0 ... Some of these 15-year-old kids crack me up. They send me messages asking how to become a pro gamer and I'm like: 'Kid, you can't go into this thinking it's a career'. 1fdad05405<br />
-<br />
-<br />
-<p></p>
diff --git a/spaces/diacanFperku/AutoGPT/Acca F9 Kaplan Revision Kit Pdf UPD Download.md b/spaces/diacanFperku/AutoGPT/Acca F9 Kaplan Revision Kit Pdf UPD Download.md
deleted file mode 100644
index 680160c2559b6808e020cd0980067ffb102dbe15..0000000000000000000000000000000000000000
--- a/spaces/diacanFperku/AutoGPT/Acca F9 Kaplan Revision Kit Pdf UPD Download.md	
+++ /dev/null
@@ -1,56 +0,0 @@
-<br />
----> ServiceClient failure for DeepLeo[/ERROR]</p>
-
-
-If you are preparing for the ACCA FM exam, you need to have access to the best study materials available. One of the most popular and trusted sources of study materials is the Kaplan revision kit. The Kaplan revision kit is a comprehensive and updated collection of practice questions and answers that cover the entire syllabus of the ACCA FM exam. The Kaplan revision kit helps you to test your knowledge, identify your strengths and weaknesses, and improve your exam technique. The Kaplan revision kit also includes tips and guidance from expert tutors, as well as mock exams and feedback reports to help you track your progress and boost your confidence.
-
-The Kaplan revision kit is available in PDF format, which means you can download it instantly and access it anytime, anywhere. You can also print it out or use it on your laptop, tablet, or smartphone. The Kaplan revision kit is compatible with any device that can read PDF files. The Kaplan revision kit is also updated regularly to reflect the latest changes in the ACCA FM syllabus and exam format. You can be sure that you are getting the most relevant and accurate practice questions and answers for your exam preparation.
-
-The Kaplan revision kit is not only a valuable resource for ACCA FM exam candidates, but also for anyone who wants to learn more about financial management. Whether you are a student, a professional, or a business owner, you can benefit from the Kaplan revision kit by gaining a deeper understanding of the role and purpose of financial management, the impact of the economic environment on financial management, working capital techniques, investment appraisal, sources of business finance, principles of business and asset valuations, and risk management techniques.
-
-To download the Kaplan revision kit PDF for free, simply click on the link below. You will be redirected to a secure page where you can enter your email address and receive your download link instantly. You will also receive updates and offers from us regarding other ACCA study materials and courses. Don't miss this opportunity to get your hands on one of the best study materials for ACCA FM exam. Download the Kaplan revision kit PDF today and start your journey towards becoming a qualified finance manager.
-
-
-The ACCA FM exam is one of the most challenging and rewarding exams in the ACCA qualification. It tests your ability to apply financial management concepts and techniques to real-life scenarios and problems. The ACCA FM exam consists of four sections: A, B, C, and D. Each section has a different weightage and format. Section A contains 15 objective test questions worth 2 marks each. Section B contains three case-based questions worth 10 marks each. Section C contains two long-form questions worth 20 marks each. Section D contains one professional marks question worth 4 marks.
-
-To pass the ACCA FM exam, you need to have a solid grasp of the syllabus topics and be able to demonstrate your skills in analysis, evaluation, and communication. You also need to have a good exam technique and time management skills. The ACCA FM exam is not only about memorizing formulas and definitions, but also about understanding the underlying concepts and applying them to various situations. You need to be able to interpret data, make assumptions, calculate relevant figures, and present your findings in a clear and logical manner.
-
-One of the best ways to prepare for the ACCA FM exam is to use the Kaplan revision kit PDF as your main study resource. The Kaplan revision kit PDF contains hundreds of practice questions and answers that cover all the syllabus topics and exam formats. The Kaplan revision kit PDF also provides detailed explanations and feedback for each question, as well as key points and tips to remember. The Kaplan revision kit PDF helps you to identify your weak areas, improve your knowledge, and enhance your confidence.
-
-The Kaplan revision kit PDF is not only useful for practicing questions, but also for revising the theory and concepts. The Kaplan revision kit PDF summarizes the main points and formulas for each topic in a concise and easy-to-understand manner. The Kaplan revision kit PDF also provides examples and illustrations to help you visualize and comprehend the topics better. The Kaplan revision kit PDF is a great tool for refreshing your memory and reinforcing your understanding before the exam.
-
-The Kaplan revision kit PDF is designed to help you achieve your full potential in the ACCA FM exam. It is based on the latest syllabus and exam standards, and it is updated regularly to reflect any changes or developments in the financial management field. The Kaplan revision kit PDF is written by experienced tutors who have a thorough knowledge of the ACCA FM exam requirements and expectations. The Kaplan revision kit PDF is trusted by thousands of students worldwide who have used it to pass their ACCA FM exam with flying colors.
-
-If you want to download the Kaplan revision kit PDF for free, you can do so by following the simple steps below. You will receive an email with a link to download the Kaplan revision kit PDF instantly. You will also get access to other useful resources and offers from us regarding ACCA study materials and courses. Don't miss this chance to get one of the most comprehensive and reliable study materials for ACCA FM exam. Download the Kaplan revision kit PDF now and start your preparation for success.
-
-
-The ACCA FM exam is not only a test of your knowledge, but also of your skills and judgement. You need to be able to apply financial management concepts and techniques to various scenarios and problems, and to evaluate the outcomes and implications of your decisions. You also need to be able to communicate your findings and recommendations in a clear and professional manner. The ACCA FM exam is designed to assess your ability to perform as a competent finance manager in any organisation.
-
-To succeed in the ACCA FM exam, you need to have a thorough preparation and a smart strategy. You need to plan your study time effectively and cover all the syllabus topics in depth. You need to practice as many questions as possible and review your answers carefully. You need to learn from your mistakes and improve your weak areas. You also need to familiarize yourself with the exam format and structure, and develop your exam technique and time management skills.
-
-One of the best ways to prepare for the ACCA FM exam is to use the Kaplan revision kit PDF as your main study resource. The Kaplan revision kit PDF is a complete and comprehensive guide that covers everything you need to know for the ACCA FM exam. The Kaplan revision kit PDF contains hundreds of practice questions and answers that cover all the syllabus topics and exam formats. The Kaplan revision kit PDF also provides detailed explanations and feedback for each question, as well as key points and tips to remember. The Kaplan revision kit PDF helps you to identify your weak areas, improve your knowledge, and enhance your confidence.
-
-The Kaplan revision kit PDF is not only useful for practicing questions, but also for revising the theory and concepts. The Kaplan revision kit PDF summarizes the main points and formulas for each topic in a concise and easy-to-understand manner. The Kaplan revision kit PDF also provides examples and illustrations to help you visualize and comprehend the topics better. The Kaplan revision kit PDF is a great tool for refreshing your memory and reinforcing your understanding before the exam.
-
-The Kaplan revision kit PDF is designed to help you achieve your full potential in the ACCA FM exam. It is based on the latest syllabus and exam standards, and it is updated regularly to reflect any changes or developments in the financial management field. The Kaplan revision kit PDF is written by experienced tutors who have a thorough knowledge of the ACCA FM exam requirements and expectations. The Kaplan revision kit PDF is trusted by thousands of students worldwide who have used it to pass their ACCA FM exam with flying colors.
-
-If you want to download the Kaplan revision kit PDF for free, you can do so by following the simple steps below. You will receive an email with a link to download the Kaplan revision kit PDF instantly. You will also get access to other useful resources and offers from us regarding ACCA study materials and courses. Don't miss this chance to get one of the most comprehensive and reliable study materials for ACCA FM exam. Download the Kaplan revision kit PDF now and start your preparation for success.
-
-
-The ACCA FM exam is a rewarding and satisfying experience for those who pass it. It opens up many opportunities and benefits for your career and personal development. By passing the ACCA FM exam, you will demonstrate your competence and professionalism in financial management, and gain recognition and respect from your peers and employers. You will also become eligible for further studies and qualifications in the ACCA pathway, such as the Professional level papers and the BSc degree in Applied Accounting.
-
-To pass the ACCA FM exam, you need to have a positive attitude and a strong motivation. You need to be committed to your study plan and dedicate enough time and effort to your preparation. You need to be confident in your abilities and skills, and overcome any doubts or fears that may arise. You also need to be flexible and adaptable to any changes or challenges that may occur during your study journey.
-
-One of the best ways to pass the ACCA FM exam is to use the Kaplan revision kit PDF as your main study resource. The Kaplan revision kit PDF is a proven and effective guide that covers everything you need to know for the ACCA FM exam. The Kaplan revision kit PDF contains hundreds of practice questions and answers that cover all the syllabus topics and exam formats. The Kaplan revision kit PDF also provides detailed explanations and feedback for each question, as well as key points and tips to remember. The Kaplan revision kit PDF helps you to identify your weak areas, improve your knowledge, and enhance your confidence.
-
-The Kaplan revision kit PDF is not only useful for practicing questions, but also for revising the theory and concepts. The Kaplan revision kit PDF summarizes the main points and formulas for each topic in a concise and easy-to-understand manner. The Kaplan revision kit PDF also provides examples and illustrations to help you visualize and comprehend the topics better. The Kaplan revision kit PDF is a great tool for refreshing your memory and reinforcing your understanding before the exam.
-
-The Kaplan revision kit PDF is designed to help you pass the ACCA FM exam with flying colors. It is based on the latest syllabus and exam standards, and it is updated regularly to reflect any changes or developments in the financial management field. The Kaplan revision kit PDF is written by experienced tutors who have a thorough knowledge of the ACCA FM exam requirements and expectations. The Kaplan revision kit PDF is trusted by thousands of students worldwide who have used it to pass their ACCA FM exam with ease.
-
-If you want to download the Kaplan revision kit PDF for free, you can do so by following the simple steps below. You will receive an email with a link to download the Kaplan revision kit PDF instantly. You will also get access to other useful resources and offers from us regarding ACCA study materials and courses. Don't miss this chance to get one of the most comprehensive and reliable study materials for ACCA FM exam. Download the Kaplan revision kit PDF now and start your preparation for success.
-
-
-The ACCA FM exam is one of the most important and rewarding exams in the ACCA qualification. It tests your knowledge and skills in financial management, and prepares you for a successful career as a finance manager. To pass the ACCA FM exam, you need to have a thorough and effective preparation, and use the best study materials available. The Kaplan revision kit PDF is one of the best study materials for the ACCA FM exam. It contains everything you need to know and practice for the exam, and it helps you to improve your knowledge, skills, and confidence. The Kaplan revision kit PDF is free to download, and it is updated regularly to reflect the latest syllabus and exam standards. The Kaplan revision kit PDF is your ultimate guide to passing the ACCA FM exam with flying colors. Download it today and start your journey towards becoming a qualified finance manager.</p>
-<h2>Acca F9 Kaplan Revision Kit Pdf Download</h2><br /><p><b><b>DOWNLOAD</b> &#9734; <a href="https://gohhs.com/2uFUHB">https://gohhs.com/2uFUHB</a></b></p><br /><br /> 3cee63e6c2<br />
-<br />
-<br />
\ No newline at end of file
diff --git a/spaces/diacanFperku/AutoGPT/Ezdrummer 2 Authorization File.md b/spaces/diacanFperku/AutoGPT/Ezdrummer 2 Authorization File.md
deleted file mode 100644
index 96b0e2e641dd20c1964b8b0fc2358c61d194643f..0000000000000000000000000000000000000000
--- a/spaces/diacanFperku/AutoGPT/Ezdrummer 2 Authorization File.md	
+++ /dev/null
@@ -1,8 +0,0 @@
-<br />
-<p>toontrack superior drummer 2 crack by edi is a drum kit editor. with this software, you can produce your drums in real time, it is a combination of the most prominent software's drumkit and superior drums. that means you can add sound effects along with the rhythm.</p>
-<h2>Ezdrummer 2 Authorization File</h2><br /><p><b><b>Download Zip</b> &#127383; <a href="https://gohhs.com/2uFUY1">https://gohhs.com/2uFUY1</a></b></p><br /><br />
-<p>ezdrummer has all you want to create a drum track. it was made to be a causal environment for songwriting and rhythm creation. the best features are featured in ezdrumer 2.1.8 crack mac plus the endless sound variations supply that makes it a foremost choice among authors. youll merely record your required rhythms to find the identical groove. install ezdrummer once it has been downloaded and saved, then start using it.</p>
-<p>it then comes to set all the latest elements to the track. youll just have to click on the edit tab. use the setting dials in the top control panel to alter the track. moreover, you will perform everything from the mix panel. to see around the editing controls, take a look at the bottom control panel. you can find every panel that youll need. youll see the quality control aspects. you will also discover all the settings you will want to use from the panel to help your tracks sound professionally. find all the essential settings in the control panel.</p>
-<p>to compose your track, create a few separate stereo drum tracks. youll notice that the track in the box on your left-hand. it can use this to apply the settings in the audio layer. youll merely drag the sounds from the library and setup them to your track. for instance, if you want to change the tempo, do it here. youll select the settings and click on the play button. to make sure the changes are effective, youll again click on the play button.</p> 899543212b<br />
-<br />
-<br />
\ No newline at end of file
diff --git a/spaces/diacanFperku/AutoGPT/John Gwynne Ruin Epub PATCHED Download.md b/spaces/diacanFperku/AutoGPT/John Gwynne Ruin Epub PATCHED Download.md
deleted file mode 100644
index b8cda3b33b54abc9f56ca82752a9ec6112fd7b65..0000000000000000000000000000000000000000
--- a/spaces/diacanFperku/AutoGPT/John Gwynne Ruin Epub PATCHED Download.md	
+++ /dev/null
@@ -1,9 +0,0 @@
-<br />
-<p>In the third film, The Treasure of Lima, Treasure Returns (2019), Captain Barbossa has to battle the undead Jack Sparrow with a treasure map to the treasure of Lima. On December 5, 2012 an announcement was made from Sony on its official Facebook page that John Gwynne titles would become available to purchase at Amazon. </p>
-<p>However, the latest update to epub allowed a number of different DRM schemes and publishers have signed up to those schemes to ensure that ebooks sold through epub come from the places that caused them to be created and not from the original publisher. Epub now comes in a few formats including EPUB, MOBI (but note that only mobi files created by epub 3. Book 1: The 3.0 % AUDIAL BOOK TITLES OF 2012. </p>
-<h2>John Gwynne Ruin Epub Download</h2><br /><p><b><b>Download File</b> &#10145; <a href="https://gohhs.com/2uFU4l">https://gohhs.com/2uFU4l</a></b></p><br /><br />
-<p>You can download the best Book for 100 Dollars or Less.epub books. Epub Books Related Search. 2017 Scribd gives you the best way to read your ebook collection on the go. 2009 Books Advanced Search New Releases. </p>
-<p>The cheapest and smallest ePub book on the market. Ruinemaker is a tool that lets you create ePub books for use on any ereader and any device with the internet. The word is derived from the Norse Ragnarök, that is, the final battle of the gods. </p>
-<p>4.8 MB Tuneskit 4 is a downloadable application that allows you to generate stand-alone e-books from the DRM files that are created with Tuneskit 3. The bible also has a story of Enoch, most commonly known as the books of the Maccabees. Tuneskit Crack multilizer pdf translator pro crack downloads 485 John Gwynne Ruin Epub Download tripuraanimatedmoviefreedownload kunci jawaban advance. The A Season in Carcosa (narrated by the voice of John Gwynne). </p> 899543212b<br />
-<br />
-<br />
\ No newline at end of file
diff --git a/spaces/diacanFperku/AutoGPT/Mir-Anees-Poetry-Books-In-Urdu-Pdf-Free-LINK-Download.md b/spaces/diacanFperku/AutoGPT/Mir-Anees-Poetry-Books-In-Urdu-Pdf-Free-LINK-Download.md
deleted file mode 100644
index f5bc7adb7a2e48f2f7b68337892135b00ae57d50..0000000000000000000000000000000000000000
--- a/spaces/diacanFperku/AutoGPT/Mir-Anees-Poetry-Books-In-Urdu-Pdf-Free-LINK-Download.md
+++ /dev/null
@@ -1,70 +0,0 @@
-## mir anees poetry books in urdu pdf free download
-
-
-
- 
-
- ![Mir Anees Poetry Books In Urdu Pdf Free !!LINK!! Download](https://islamicblessings.com/data/jh23hhd7hhd_11.jpg)
-
- 
-
- 
-
-**CLICK HERE >>> [https://urluso.com/2txxxm](https://urluso.com/2txxxm)**
-
-
-
- 
-
- 
-
- 
-
- 
-
- Here is a possible title and article with SEO optimization and HTML formatting for the keyword "mir anees poetry books in urdu pdf free download":  
-
-# Mir Anees Poetry Books in Urdu PDF Free Download - A Treasure of Marsiya
-
- 
-
-Mir Anees was a renowned Urdu poet who specialized in the genre of marsiya, a form of elegy that commemorates the martyrdom of Imam Hussain and his companions in Karbala. He was born in 1803 in Faizabad, India, and belonged to a family of poets and scholars. He wrote more than 10,000 verses of marsiya, which are considered to be the finest examples of Urdu literature.
-
- 
-
-Mir Anees's poetry is rich in imagery, emotion, and rhetoric. He depicts the scenes of Karbala with vivid details and portrays the characters of Imam Hussain and his followers with dignity and reverence. He also uses various literary devices such as metaphors, similes, allusions, and personifications to enhance the beauty and impact of his verses. His poetry is not only a source of inspiration for the Shia Muslims, but also a masterpiece of art and culture for all Urdu lovers.
-
- 
-
-If you want to read Mir Anees's poetry books in Urdu PDF format, you can download them for free from the following sources:
-
- 
-
-- [Rekhta](https://www.rekhta.org/poets/meer-anees/ebooks) - This website offers a collection of 119 e-books by Mir Anees, including his famous marsiyas, ghazals, rubais, and salams. You can also read his biography, watch his videos, and listen to his audios on this website.
-
-- [UrduPoint](https://www.urdupoint.com/poetry/meer-anees-books.html) - This website provides a list of 6 poetry books by Mir Anees in PDF form. You can select any of them to read or download. You can also find other Urdu poets and their poetry on this website.
-
-- [Archive](https://archive.org/details/in.ernet.dli.2015.522768) - This website hosts a digital copy of Marasee Mir Anees, a book that contains some of the best marsiyas by Mir Anees. You can view or download this book for free from this website.
-
-
-
-Mir Anees's poetry books in Urdu PDF free download are a treasure of marsiya that you should not miss. His poetry will touch your heart and soul with its eloquence and elegance. Download his poetry books today and enjoy the beauty of Urdu language and literature.
-
-Here are a few more paragraphs for the article:  
-
-Mir Anees's poetry is not only a tribute to the martyrs of Karbala, but also a reflection of his own personality and worldview. He was a devout Shia Muslim who believed in the principles of justice, truth, and loyalty. He was also a humanist who respected all religions and sects. He was a patriot who loved his country and culture. He was a scholar who had a vast knowledge of history, geography, astronomy, and philosophy. He was a poet who had a mastery of Urdu language and literature.
-
- 
-
-Mir Anees's poetry is also a source of guidance and wisdom for his readers. He teaches them how to live with dignity and honor in the face of oppression and tyranny. He inspires them to stand up for their rights and values. He motivates them to sacrifice their lives for a noble cause. He consoles them with the hope of divine reward and eternal bliss. He enlightens them with the lessons of history and morality.
-
- 
-
-Mir Anees's poetry is a legacy that has been preserved and cherished by generations of Urdu speakers. His poetry has been recited, sung, translated, and published in various forms and media. His poetry has influenced many other poets and writers who have followed his footsteps and style. His poetry has been appreciated and admired by people from different backgrounds and regions who have found solace and beauty in his words.
-
- dfd1c89656
-
- 
-
- 
-
diff --git a/spaces/diaoren/OpenSetObstacleDetection/opendet2/modeling/backbone/swin_transformer.py b/spaces/diaoren/OpenSetObstacleDetection/opendet2/modeling/backbone/swin_transformer.py
deleted file mode 100644
index 5302cc4904173f8f177d704fa247b5582ac299dc..0000000000000000000000000000000000000000
--- a/spaces/diaoren/OpenSetObstacleDetection/opendet2/modeling/backbone/swin_transformer.py
+++ /dev/null
@@ -1,727 +0,0 @@
-# --------------------------------------------------------
-# Swin Transformer
-# modified from https://github.com/xiaohu2015/SwinT_detectron2/blob/main/swint/swin_transformer.py
-# --------------------------------------------------------
-
-import torch
-import torch.nn as nn
-import torch.nn.functional as F
-import torch.utils.checkpoint as checkpoint
-import numpy as np
-from fvcore.nn import weight_init
-from timm.models.layers import DropPath, to_2tuple, trunc_normal_
-
-from detectron2.modeling.backbone import Backbone
-from detectron2.modeling.backbone.build import BACKBONE_REGISTRY
-from detectron2.modeling.backbone.fpn import FPN, LastLevelMaxPool, LastLevelP6P7
-from detectron2.layers import ShapeSpec
-
-
-class Mlp(nn.Module):
-    """ Multilayer perceptron."""
-
-    def __init__(self, in_features, hidden_features=None, out_features=None, act_layer=nn.GELU, drop=0.):
-        super().__init__()
-        out_features = out_features or in_features
-        hidden_features = hidden_features or in_features
-        self.fc1 = nn.Linear(in_features, hidden_features)
-        self.act = act_layer()
-        self.fc2 = nn.Linear(hidden_features, out_features)
-        self.drop = nn.Dropout(drop)
-
-    def forward(self, x):
-        x = self.fc1(x)
-        x = self.act(x)
-        x = self.drop(x)
-        x = self.fc2(x)
-        x = self.drop(x)
-        return x
-
-
-def window_partition(x, window_size):
-    """
-    Args:
-        x: (B, H, W, C)
-        window_size (int): window size
-    Returns:
-        windows: (num_windows*B, window_size, window_size, C)
-    """
-    B, H, W, C = x.shape
-    x = x.view(B, H // window_size, window_size, W // window_size, window_size, C)
-    windows = x.permute(0, 1, 3, 2, 4, 5).contiguous().view(-1, window_size, window_size, C)
-    return windows
-
-
-def window_reverse(windows, window_size, H, W):
-    """
-    Args:
-        windows: (num_windows*B, window_size, window_size, C)
-        window_size (int): Window size
-        H (int): Height of image
-        W (int): Width of image
-    Returns:
-        x: (B, H, W, C)
-    """
-    B = int(windows.shape[0] / (H * W / window_size / window_size))
-    x = windows.view(B, H // window_size, W // window_size, window_size, window_size, -1)
-    x = x.permute(0, 1, 3, 2, 4, 5).contiguous().view(B, H, W, -1)
-    return x
-
-
-class WindowAttention(nn.Module):
-    """ Window based multi-head self attention (W-MSA) module with relative position bias.
-    It supports both of shifted and non-shifted window.
-    Args:
-        dim (int): Number of input channels.
-        window_size (tuple[int]): The height and width of the window.
-        num_heads (int): Number of attention heads.
-        qkv_bias (bool, optional):  If True, add a learnable bias to query, key, value. Default: True
-        qk_scale (float | None, optional): Override default qk scale of head_dim ** -0.5 if set
-        attn_drop (float, optional): Dropout ratio of attention weight. Default: 0.0
-        proj_drop (float, optional): Dropout ratio of output. Default: 0.0
-    """
-
-    def __init__(self, dim, window_size, num_heads, qkv_bias=True, qk_scale=None, attn_drop=0., proj_drop=0.):
-
-        super().__init__()
-        self.dim = dim
-        self.window_size = window_size  # Wh, Ww
-        self.num_heads = num_heads
-        head_dim = dim // num_heads
-        self.scale = qk_scale or head_dim ** -0.5
-
-        # define a parameter table of relative position bias
-        self.relative_position_bias_table = nn.Parameter(
-            torch.zeros((2 * window_size[0] - 1) * (2 * window_size[1] - 1), num_heads))  # 2*Wh-1 * 2*Ww-1, nH
-
-        # get pair-wise relative position index for each token inside the window
-        coords_h = torch.arange(self.window_size[0])
-        coords_w = torch.arange(self.window_size[1])
-        coords = torch.stack(torch.meshgrid([coords_h, coords_w]))  # 2, Wh, Ww
-        coords_flatten = torch.flatten(coords, 1)  # 2, Wh*Ww
-        relative_coords = coords_flatten[:, :, None] - coords_flatten[:, None, :]  # 2, Wh*Ww, Wh*Ww
-        relative_coords = relative_coords.permute(1, 2, 0).contiguous()  # Wh*Ww, Wh*Ww, 2
-        relative_coords[:, :, 0] += self.window_size[0] - 1  # shift to start from 0
-        relative_coords[:, :, 1] += self.window_size[1] - 1
-        relative_coords[:, :, 0] *= 2 * self.window_size[1] - 1
-        relative_position_index = relative_coords.sum(-1)  # Wh*Ww, Wh*Ww
-        self.register_buffer("relative_position_index", relative_position_index)
-
-        self.qkv = nn.Linear(dim, dim * 3, bias=qkv_bias)
-        self.attn_drop = nn.Dropout(attn_drop)
-        self.proj = nn.Linear(dim, dim)
-        self.proj_drop = nn.Dropout(proj_drop)
-
-        trunc_normal_(self.relative_position_bias_table, std=.02)
-        self.softmax = nn.Softmax(dim=-1)
-
-    def forward(self, x, mask=None):
-        """ Forward function.
-        Args:
-            x: input features with shape of (num_windows*B, N, C)
-            mask: (0/-inf) mask with shape of (num_windows, Wh*Ww, Wh*Ww) or None
-        """
-        B_, N, C = x.shape
-        qkv = self.qkv(x).reshape(B_, N, 3, self.num_heads, C // self.num_heads).permute(2, 0, 3, 1, 4)
-        q, k, v = qkv[0], qkv[1], qkv[2]  # make torchscript happy (cannot use tensor as tuple)
-
-        q = q * self.scale
-        attn = (q @ k.transpose(-2, -1))
-
-        relative_position_bias = self.relative_position_bias_table[self.relative_position_index.view(-1)].view(
-            self.window_size[0] * self.window_size[1], self.window_size[0] * self.window_size[1], -1)  # Wh*Ww,Wh*Ww,nH
-        relative_position_bias = relative_position_bias.permute(2, 0, 1).contiguous()  # nH, Wh*Ww, Wh*Ww
-        attn = attn + relative_position_bias.unsqueeze(0)
-
-        if mask is not None:
-            nW = mask.shape[0]
-            attn = attn.view(B_ // nW, nW, self.num_heads, N, N) + mask.unsqueeze(1).unsqueeze(0)
-            attn = attn.view(-1, self.num_heads, N, N)
-            attn = self.softmax(attn)
-        else:
-            attn = self.softmax(attn)
-
-        attn = self.attn_drop(attn)
-
-        x = (attn @ v).transpose(1, 2).reshape(B_, N, C)
-        x = self.proj(x)
-        x = self.proj_drop(x)
-        return x
-
-
-class SwinTransformerBlock(nn.Module):
-    """ Swin Transformer Block.
-    Args:
-        dim (int): Number of input channels.
-        num_heads (int): Number of attention heads.
-        window_size (int): Window size.
-        shift_size (int): Shift size for SW-MSA.
-        mlp_ratio (float): Ratio of mlp hidden dim to embedding dim.
-        qkv_bias (bool, optional): If True, add a learnable bias to query, key, value. Default: True
-        qk_scale (float | None, optional): Override default qk scale of head_dim ** -0.5 if set.
-        drop (float, optional): Dropout rate. Default: 0.0
-        attn_drop (float, optional): Attention dropout rate. Default: 0.0
-        drop_path (float, optional): Stochastic depth rate. Default: 0.0
-        act_layer (nn.Module, optional): Activation layer. Default: nn.GELU
-        norm_layer (nn.Module, optional): Normalization layer.  Default: nn.LayerNorm
-    """
-
-    def __init__(self, dim, num_heads, window_size=7, shift_size=0,
-                 mlp_ratio=4., qkv_bias=True, qk_scale=None, drop=0., attn_drop=0., drop_path=0.,
-                 act_layer=nn.GELU, norm_layer=nn.LayerNorm):
-        super().__init__()
-        self.dim = dim
-        self.num_heads = num_heads
-        self.window_size = window_size
-        self.shift_size = shift_size
-        self.mlp_ratio = mlp_ratio
-        assert 0 <= self.shift_size < self.window_size, "shift_size must in 0-window_size"
-
-        self.norm1 = norm_layer(dim)
-        self.attn = WindowAttention(
-            dim, window_size=to_2tuple(self.window_size), num_heads=num_heads,
-            qkv_bias=qkv_bias, qk_scale=qk_scale, attn_drop=attn_drop, proj_drop=drop)
-
-        self.drop_path = DropPath(drop_path) if drop_path > 0. else nn.Identity()
-        self.norm2 = norm_layer(dim)
-        mlp_hidden_dim = int(dim * mlp_ratio)
-        self.mlp = Mlp(in_features=dim, hidden_features=mlp_hidden_dim, act_layer=act_layer, drop=drop)
-
-        self.H = None
-        self.W = None
-
-    def forward(self, x, mask_matrix):
-        """ Forward function.
-        Args:
-            x: Input feature, tensor size (B, H*W, C).
-            H, W: Spatial resolution of the input feature.
-            mask_matrix: Attention mask for cyclic shift.
-        """
-        B, L, C = x.shape
-        H, W = self.H, self.W
-        assert L == H * W, "input feature has wrong size"
-
-        shortcut = x
-        x = self.norm1(x)
-        x = x.view(B, H, W, C)
-
-        # pad feature maps to multiples of window size
-        pad_l = pad_t = 0
-        pad_r = (self.window_size - W % self.window_size) % self.window_size
-        pad_b = (self.window_size - H % self.window_size) % self.window_size
-        x = F.pad(x, (0, 0, pad_l, pad_r, pad_t, pad_b))
-        _, Hp, Wp, _ = x.shape
-
-        # cyclic shift
-        if self.shift_size > 0:
-            shifted_x = torch.roll(x, shifts=(-self.shift_size, -self.shift_size), dims=(1, 2))
-            attn_mask = mask_matrix
-        else:
-            shifted_x = x
-            attn_mask = None
-
-        # partition windows
-        x_windows = window_partition(shifted_x, self.window_size)  # nW*B, window_size, window_size, C
-        x_windows = x_windows.view(-1, self.window_size * self.window_size, C)  # nW*B, window_size*window_size, C
-
-        # W-MSA/SW-MSA
-        attn_windows = self.attn(x_windows, mask=attn_mask)  # nW*B, window_size*window_size, C
-
-        # merge windows
-        attn_windows = attn_windows.view(-1, self.window_size, self.window_size, C)
-        shifted_x = window_reverse(attn_windows, self.window_size, Hp, Wp)  # B H' W' C
-
-        # reverse cyclic shift
-        if self.shift_size > 0:
-            x = torch.roll(shifted_x, shifts=(self.shift_size, self.shift_size), dims=(1, 2))
-        else:
-            x = shifted_x
-
-        if pad_r > 0 or pad_b > 0:
-            x = x[:, :H, :W, :].contiguous()
-
-        x = x.view(B, H * W, C)
-
-        # FFN
-        x = shortcut + self.drop_path(x)
-        x = x + self.drop_path(self.mlp(self.norm2(x)))
-
-        return x
-
-
-class PatchMerging(nn.Module):
-    """ Patch Merging Layer
-    Args:
-        dim (int): Number of input channels.
-        norm_layer (nn.Module, optional): Normalization layer.  Default: nn.LayerNorm
-    """
-    def __init__(self, dim, norm_layer=nn.LayerNorm):
-        super().__init__()
-        self.dim = dim
-        self.reduction = nn.Linear(4 * dim, 2 * dim, bias=False)
-        self.norm = norm_layer(4 * dim)
-
-    def forward(self, x, H, W):
-        """ Forward function.
-        Args:
-            x: Input feature, tensor size (B, H*W, C).
-            H, W: Spatial resolution of the input feature.
-        """
-        B, L, C = x.shape
-        assert L == H * W, "input feature has wrong size"
-
-        x = x.view(B, H, W, C)
-
-        # padding
-        pad_input = (H % 2 == 1) or (W % 2 == 1)
-        if pad_input:
-            x = F.pad(x, (0, 0, 0, W % 2, 0, H % 2))
-
-        x0 = x[:, 0::2, 0::2, :]  # B H/2 W/2 C
-        x1 = x[:, 1::2, 0::2, :]  # B H/2 W/2 C
-        x2 = x[:, 0::2, 1::2, :]  # B H/2 W/2 C
-        x3 = x[:, 1::2, 1::2, :]  # B H/2 W/2 C
-        x = torch.cat([x0, x1, x2, x3], -1)  # B H/2 W/2 4*C
-        x = x.view(B, -1, 4 * C)  # B H/2*W/2 4*C
-
-        x = self.norm(x)
-        x = self.reduction(x)
-
-        return x
-
-
-class BasicLayer(nn.Module):
-    """ A basic Swin Transformer layer for one stage.
-    Args:
-        dim (int): Number of feature channels
-        depth (int): Depths of this stage.
-        num_heads (int): Number of attention head.
-        window_size (int): Local window size. Default: 7.
-        mlp_ratio (float): Ratio of mlp hidden dim to embedding dim. Default: 4.
-        qkv_bias (bool, optional): If True, add a learnable bias to query, key, value. Default: True
-        qk_scale (float | None, optional): Override default qk scale of head_dim ** -0.5 if set.
-        drop (float, optional): Dropout rate. Default: 0.0
-        attn_drop (float, optional): Attention dropout rate. Default: 0.0
-        drop_path (float | tuple[float], optional): Stochastic depth rate. Default: 0.0
-        norm_layer (nn.Module, optional): Normalization layer. Default: nn.LayerNorm
-        downsample (nn.Module | None, optional): Downsample layer at the end of the layer. Default: None
-        use_checkpoint (bool): Whether to use checkpointing to save memory. Default: False.
-    """
-
-    def __init__(self,
-                 dim,
-                 depth,
-                 num_heads,
-                 window_size=7,
-                 mlp_ratio=4.,
-                 qkv_bias=True,
-                 qk_scale=None,
-                 drop=0.,
-                 attn_drop=0.,
-                 drop_path=0.,
-                 norm_layer=nn.LayerNorm,
-                 downsample=None,
-                 use_checkpoint=False):
-        super().__init__()
-        self.window_size = window_size
-        self.shift_size = window_size // 2
-        self.depth = depth
-        self.use_checkpoint = use_checkpoint
-
-        # build blocks
-        self.blocks = nn.ModuleList([
-            SwinTransformerBlock(
-                dim=dim,
-                num_heads=num_heads,
-                window_size=window_size,
-                shift_size=0 if (i % 2 == 0) else window_size // 2,
-                mlp_ratio=mlp_ratio,
-                qkv_bias=qkv_bias,
-                qk_scale=qk_scale,
-                drop=drop,
-                attn_drop=attn_drop,
-                drop_path=drop_path[i] if isinstance(drop_path, list) else drop_path,
-                norm_layer=norm_layer)
-            for i in range(depth)])
-
-        # patch merging layer
-        if downsample is not None:
-            self.downsample = downsample(dim=dim, norm_layer=norm_layer)
-        else:
-            self.downsample = None
-
-    def forward(self, x, H, W):
-        """ Forward function.
-        Args:
-            x: Input feature, tensor size (B, H*W, C).
-            H, W: Spatial resolution of the input feature.
-        """
-
-        # calculate attention mask for SW-MSA
-        Hp = int(np.ceil(H / self.window_size)) * self.window_size
-        Wp = int(np.ceil(W / self.window_size)) * self.window_size
-        img_mask = torch.zeros((1, Hp, Wp, 1), device=x.device)  # 1 Hp Wp 1
-        h_slices = (slice(0, -self.window_size),
-                    slice(-self.window_size, -self.shift_size),
-                    slice(-self.shift_size, None))
-        w_slices = (slice(0, -self.window_size),
-                    slice(-self.window_size, -self.shift_size),
-                    slice(-self.shift_size, None))
-        cnt = 0
-        for h in h_slices:
-            for w in w_slices:
-                img_mask[:, h, w, :] = cnt
-                cnt += 1
-
-        mask_windows = window_partition(img_mask, self.window_size)  # nW, window_size, window_size, 1
-        mask_windows = mask_windows.view(-1, self.window_size * self.window_size)
-        attn_mask = mask_windows.unsqueeze(1) - mask_windows.unsqueeze(2)
-        attn_mask = attn_mask.masked_fill(attn_mask != 0, float(-100.0)).masked_fill(attn_mask == 0, float(0.0))
-
-        for blk in self.blocks:
-            blk.H, blk.W = H, W
-            if self.use_checkpoint:
-                x = checkpoint.checkpoint(blk, x, attn_mask)
-            else:
-                x = blk(x, attn_mask)
-        if self.downsample is not None:
-            x_down = self.downsample(x, H, W)
-            Wh, Ww = (H + 1) // 2, (W + 1) // 2
-            return x, H, W, x_down, Wh, Ww
-        else:
-            return x, H, W, x, H, W
-
-
-class PatchEmbed(nn.Module):
-    """ Image to Patch Embedding
-    Args:
-        patch_size (int): Patch token size. Default: 4.
-        in_chans (int): Number of input image channels. Default: 3.
-        embed_dim (int): Number of linear projection output channels. Default: 96.
-        norm_layer (nn.Module, optional): Normalization layer. Default: None
-    """
-
-    def __init__(self, patch_size=4, in_chans=3, embed_dim=96, norm_layer=None):
-        super().__init__()
-        patch_size = to_2tuple(patch_size)
-        self.patch_size = patch_size
-
-        self.in_chans = in_chans
-        self.embed_dim = embed_dim
-
-        self.proj = nn.Conv2d(in_chans, embed_dim, kernel_size=patch_size, stride=patch_size)
-        if norm_layer is not None:
-            self.norm = norm_layer(embed_dim)
-        else:
-            self.norm = None
-
-    def forward(self, x):
-        """Forward function."""
-        # padding
-        _, _, H, W = x.size()
-        if W % self.patch_size[1] != 0:
-            x = F.pad(x, (0, self.patch_size[1] - W % self.patch_size[1]))
-        if H % self.patch_size[0] != 0:
-            x = F.pad(x, (0, 0, 0, self.patch_size[0] - H % self.patch_size[0]))
-
-        x = self.proj(x)  # B C Wh Ww
-        if self.norm is not None:
-            Wh, Ww = x.size(2), x.size(3)
-            x = x.flatten(2).transpose(1, 2)
-            x = self.norm(x)
-            x = x.transpose(1, 2).view(-1, self.embed_dim, Wh, Ww)
-
-        return x
-
-
-class SwinTransformer(Backbone):
-    """ Swin Transformer backbone.
-        A PyTorch impl of : `Swin Transformer: Hierarchical Vision Transformer using Shifted Windows`  -
-          https://arxiv.org/pdf/2103.14030
-    Args:
-        pretrain_img_size (int): Input image size for training the pretrained model,
-            used in absolute postion embedding. Default 224.
-        patch_size (int | tuple(int)): Patch size. Default: 4.
-        in_chans (int): Number of input image channels. Default: 3.
-        embed_dim (int): Number of linear projection output channels. Default: 96.
-        depths (tuple[int]): Depths of each Swin Transformer stage.
-        num_heads (tuple[int]): Number of attention head of each stage.
-        window_size (int): Window size. Default: 7.
-        mlp_ratio (float): Ratio of mlp hidden dim to embedding dim. Default: 4.
-        qkv_bias (bool): If True, add a learnable bias to query, key, value. Default: True
-        qk_scale (float): Override default qk scale of head_dim ** -0.5 if set.
-        drop_rate (float): Dropout rate.
-        attn_drop_rate (float): Attention dropout rate. Default: 0.
-        drop_path_rate (float): Stochastic depth rate. Default: 0.2.
-        norm_layer (nn.Module): Normalization layer. Default: nn.LayerNorm.
-        ape (bool): If True, add absolute position embedding to the patch embedding. Default: False.
-        patch_norm (bool): If True, add normalization after patch embedding. Default: True.
-        out_indices (Sequence[int]): Output from which stages.
-        frozen_stages (int): Stages to be frozen (stop grad and set eval mode).
-            -1 means not freezing any parameters.
-        use_checkpoint (bool): Whether to use checkpointing to save memory. Default: False.
-    """
-
-    def __init__(self,
-                 pretrain_img_size=224,
-                 patch_size=4,
-                 in_chans=3,
-                 embed_dim=96,
-                 depths=[2, 2, 6, 2],
-                 num_heads=[3, 6, 12, 24],
-                 window_size=7,
-                 mlp_ratio=4.,
-                 qkv_bias=True,
-                 qk_scale=None,
-                 drop_rate=0.,
-                 attn_drop_rate=0.,
-                 drop_path_rate=0.2,
-                 norm_layer=nn.LayerNorm,
-                 ape=False,
-                 patch_norm=True,
-                 frozen_stages=-1,
-                 use_checkpoint=False,
-                 out_features=None):
-        super(SwinTransformer, self).__init__()
-
-        self.pretrain_img_size = pretrain_img_size
-        self.num_layers = len(depths)
-        self.embed_dim = embed_dim
-        self.ape = ape
-        self.patch_norm = patch_norm
-        self.frozen_stages = frozen_stages
-
-        self.out_features = out_features
-
-        # split image into non-overlapping patches
-        self.patch_embed = PatchEmbed(
-            patch_size=patch_size, in_chans=in_chans, embed_dim=embed_dim,
-            norm_layer=norm_layer if self.patch_norm else None)
-
-        # absolute position embedding
-        if self.ape:
-            pretrain_img_size = to_2tuple(pretrain_img_size)
-            patch_size = to_2tuple(patch_size)
-            patches_resolution = [pretrain_img_size[0] // patch_size[0], pretrain_img_size[1] // patch_size[1]]
-
-            self.absolute_pos_embed = nn.Parameter(torch.zeros(1, embed_dim, patches_resolution[0], patches_resolution[1]))
-            trunc_normal_(self.absolute_pos_embed, std=.02)
-
-        self.pos_drop = nn.Dropout(p=drop_rate)
-
-        # stochastic depth
-        dpr = [x.item() for x in torch.linspace(0, drop_path_rate, sum(depths))]  # stochastic depth decay rule
-
-        self._out_feature_strides = {}
-        self._out_feature_channels = {}
-
-        # build layers
-        self.layers = nn.ModuleList()
-        for i_layer in range(self.num_layers):
-            layer = BasicLayer(
-                dim=int(embed_dim * 2 ** i_layer),
-                depth=depths[i_layer],
-                num_heads=num_heads[i_layer],
-                window_size=window_size,
-                mlp_ratio=mlp_ratio,
-                qkv_bias=qkv_bias,
-                qk_scale=qk_scale,
-                drop=drop_rate,
-                attn_drop=attn_drop_rate,
-                drop_path=dpr[sum(depths[:i_layer]):sum(depths[:i_layer + 1])],
-                norm_layer=norm_layer,
-                downsample=PatchMerging if (i_layer < self.num_layers - 1) else None,
-                use_checkpoint=use_checkpoint)
-            self.layers.append(layer)
-
-            stage = f'stage{i_layer+2}'
-            if stage in self.out_features:
-                self._out_feature_channels[stage] = embed_dim * 2 ** i_layer
-                self._out_feature_strides[stage] = 4 * 2 ** i_layer
- 
-        num_features = [int(embed_dim * 2 ** i) for i in range(self.num_layers)]
-        self.num_features = num_features
-
-        # add a norm layer for each output
-        for i_layer in range(self.num_layers):
-            stage = f'stage{i_layer+2}'
-            if stage in self.out_features:
-                layer = norm_layer(num_features[i_layer])
-                layer_name = f'norm{i_layer}'
-                self.add_module(layer_name, layer)
-
-        self._freeze_stages()
-
-    def _freeze_stages(self):
-        if self.frozen_stages >= 0:
-            self.patch_embed.eval()
-            for param in self.patch_embed.parameters():
-                param.requires_grad = False
-
-        if self.frozen_stages >= 1 and self.ape:
-            self.absolute_pos_embed.requires_grad = False
-
-        if self.frozen_stages >= 2:
-            self.pos_drop.eval()
-            for i in range(0, self.frozen_stages - 1):
-                m = self.layers[i]
-                m.eval()
-                for param in m.parameters():
-                    param.requires_grad = False
-
-    def init_weights(self, pretrained=None):
-        """Initialize the weights in backbone.
-        Args:
-            pretrained (str, optional): Path to pre-trained weights.
-                Defaults to None.
-        """
-
-        def _init_weights(m):
-            if isinstance(m, nn.Linear):
-                trunc_normal_(m.weight, std=.02)
-                if isinstance(m, nn.Linear) and m.bias is not None:
-                    nn.init.constant_(m.bias, 0)
-            elif isinstance(m, nn.LayerNorm):
-                nn.init.constant_(m.bias, 0)
-                nn.init.constant_(m.weight, 1.0)
-
-        self.apply(_init_weights)
-
-    def forward(self, x):
-        """Forward function."""
-        x = self.patch_embed(x)
-
-        Wh, Ww = x.size(2), x.size(3)
-        if self.ape:
-            # interpolate the position embedding to the corresponding size
-            absolute_pos_embed = F.interpolate(self.absolute_pos_embed, size=(Wh, Ww), mode='bicubic')
-            x = (x + absolute_pos_embed).flatten(2).transpose(1, 2)  # B Wh*Ww C
-        else:
-            x = x.flatten(2).transpose(1, 2)
-        x = self.pos_drop(x)
-
-        outs = {}
-        for i in range(self.num_layers):
-            layer = self.layers[i]
-            x_out, H, W, x, Wh, Ww = layer(x, Wh, Ww)
-            name = f'stage{i+2}'
-            if name in self.out_features:
-                norm_layer = getattr(self, f'norm{i}')
-                x_out = norm_layer(x_out)
-                out = x_out.view(-1, H, W, self.num_features[i]).permute(0, 3, 1, 2).contiguous()
-                outs[name] = out
-
-        return outs #{"stage%d" % (i+2,): out for i, out in enumerate(outs)} #tuple(outs)
-
-    def train(self, mode=True):
-        """Convert the model into training mode while keep layers freezed."""
-        super(SwinTransformer, self).train(mode)
-        self._freeze_stages()
-
-    def output_shape(self):
-        return {
-            name: ShapeSpec(
-                channels=self._out_feature_channels[name], stride=self._out_feature_strides[name]
-            )
-            for name in self.out_features
-        }
-
-@BACKBONE_REGISTRY.register()
-def build_swint_backbone(cfg, input_shape):
-    """
-    Create a SwinT instance from config.
-
-    Returns:
-        VoVNet: a :class:`VoVNet` instance.
-    """
-    out_features = cfg.MODEL.SWINT.OUT_FEATURES
-
-    return SwinTransformer(
-        patch_size=4,
-        in_chans=input_shape.channels,
-        embed_dim=cfg.MODEL.SWINT.EMBED_DIM,
-        depths=cfg.MODEL.SWINT.DEPTHS,
-        num_heads=cfg.MODEL.SWINT.NUM_HEADS,
-        window_size=cfg.MODEL.SWINT.WINDOW_SIZE,
-        mlp_ratio=cfg.MODEL.SWINT.MLP_RATIO,
-        qkv_bias=True,
-        qk_scale=None,
-        drop_rate=0.,
-        attn_drop_rate=0.,
-        drop_path_rate=cfg.MODEL.SWINT.DROP_PATH_RATE,
-        norm_layer=nn.LayerNorm,
-        ape=cfg.MODEL.SWINT.APE,
-        patch_norm=True,
-        frozen_stages=cfg.MODEL.BACKBONE.FREEZE_AT,
-        out_features=out_features
-    )
-
-
-@BACKBONE_REGISTRY.register()
-def build_swint_fpn_backbone(cfg, input_shape: ShapeSpec):
-    """
-    Args:
-        cfg: a detectron2 CfgNode
-
-    Returns:
-        backbone (Backbone): backbone module, must be a subclass of :class:`Backbone`.
-    """
-    bottom_up = build_swint_backbone(cfg, input_shape)
-    in_features = cfg.MODEL.FPN.IN_FEATURES
-    out_channels = cfg.MODEL.FPN.OUT_CHANNELS
-    backbone = FPN(
-        bottom_up=bottom_up,
-        in_features=in_features,
-        out_channels=out_channels,
-        norm=cfg.MODEL.FPN.NORM,
-        top_block=LastLevelMaxPool(),
-        fuse_type=cfg.MODEL.FPN.FUSE_TYPE,
-    )
-    return backbone
-
-class LastLevelP6(nn.Module):
-    """
-    This module is used in FCOS to generate extra layers
-    """
-
-    def __init__(self, in_channels, out_channels, in_features="res5"):
-        super().__init__()
-        self.num_levels = 1
-        self.in_feature = in_features
-        self.p6 = nn.Conv2d(in_channels, out_channels, 3, 2, 1)
-        for module in [self.p6]:
-            weight_init.c2_xavier_fill(module)
-
-    def forward(self, x):
-        p6 = self.p6(x)
-        return [p6]
-
-@BACKBONE_REGISTRY.register()
-def build_retinanet_swint_fpn_backbone(cfg, input_shape: ShapeSpec):
-    """
-    Args:
-        cfg: a detectron2 CfgNode
-
-    Returns:
-        backbone (Backbone): backbone module, must be a subclass of :class:`Backbone`.
-    """
-    bottom_up = build_swint_backbone(cfg, input_shape)
-    in_features = cfg.MODEL.FPN.IN_FEATURES
-    out_channels = cfg.MODEL.FPN.OUT_CHANNELS
-    top_levels = cfg.MODEL.FPN.TOP_LEVELS
-    in_channels_top = out_channels
-    if top_levels == 2:
-        top_block = LastLevelP6P7(in_channels_top, out_channels, "p5")
-    if top_levels == 1:
-        top_block = LastLevelP6(in_channels_top, out_channels, "p5")
-    elif top_levels == 0:
-        top_block = None
-    backbone = FPN(
-        bottom_up=bottom_up,
-        in_features=in_features,
-        out_channels=out_channels,
-        norm=cfg.MODEL.FPN.NORM,
-        top_block=top_block,
-        fuse_type=cfg.MODEL.FPN.FUSE_TYPE,
-    )
-    return backbone
diff --git a/spaces/digitalxingtong/Nanami-Bert-VITS2/preprocess_text.py b/spaces/digitalxingtong/Nanami-Bert-VITS2/preprocess_text.py
deleted file mode 100644
index 44c35fecd9b7f21016e80e9597d6055254cba3f7..0000000000000000000000000000000000000000
--- a/spaces/digitalxingtong/Nanami-Bert-VITS2/preprocess_text.py
+++ /dev/null
@@ -1,69 +0,0 @@
-import json
-from random import shuffle
-
-import tqdm
-from text.cleaner import clean_text
-from collections import defaultdict
-import shutil
-stage = [1,2,3]
-
-transcription_path = 'filelists/short_character_anno.list'
-train_path = 'filelists/train.list'
-val_path = 'filelists/val.list'
-config_path = "configs/config.json"
-val_per_spk = 4
-max_val_total = 8
-
-if 1 in stage:
-    with open( transcription_path+'.cleaned', 'w', encoding='utf-8') as f:
-        for line in tqdm.tqdm(open(transcription_path, encoding='utf-8').readlines()):
-            try:
-                utt, spk, language, text = line.strip().split('|')
-                #language = "ZH"
-                norm_text, phones, tones, word2ph = clean_text(text, language)
-                f.write('{}|{}|{}|{}|{}|{}|{}\n'.format(utt, spk, language, norm_text, ' '.join(phones),
-                                                     " ".join([str(i) for i in tones]),
-                                                     " ".join([str(i) for i in word2ph])))
-            except:
-                print("err!", utt)
-
-if 2 in stage:
-    spk_utt_map = defaultdict(list)
-    spk_id_map = {}
-    current_sid = 0
-
-    with open( transcription_path+'.cleaned', encoding='utf-8') as f:
-        for line in f.readlines():
-            utt, spk, language, text, phones, tones, word2ph = line.strip().split('|')
-            spk_utt_map[spk].append(line)
-            if spk not in spk_id_map.keys():
-                spk_id_map[spk] = current_sid
-                current_sid += 1
-    train_list = []
-    val_list = []
-    for spk, utts in spk_utt_map.items():
-          shuffle(utts)
-          val_list+=utts[:val_per_spk]
-          train_list+=utts[val_per_spk:]
-    if len(val_list) > max_val_total:
-          train_list+=val_list[max_val_total:]
-          val_list = val_list[:max_val_total]
-     
-    with open( train_path,"w", encoding='utf-8') as f:
-         for line in train_list:
-            f.write(line)
-
-    file_path = transcription_path+'.cleaned'
-    shutil.copy(file_path,'./filelists/train.list')
-    
-    with open(val_path, "w", encoding='utf-8') as f:
-        for line in val_list:
-            f.write(line)
-
-if 3 in stage:
-    assert 2 in stage
-    config = json.load(open(config_path))
-    config['data']["n_speakers"] = current_sid #
-    config["data"]['spk2id'] = spk_id_map
-    with open(config_path, 'w', encoding='utf-8') as f:
-        json.dump(config, f, indent=2, ensure_ascii=False)
diff --git a/spaces/dnth/webdemo-fridge-detection/app.py b/spaces/dnth/webdemo-fridge-detection/app.py
deleted file mode 100644
index 1ce27235889379b46abfa8197563fbdb7b2217f0..0000000000000000000000000000000000000000
--- a/spaces/dnth/webdemo-fridge-detection/app.py
+++ /dev/null
@@ -1,92 +0,0 @@
-from icevision.all import *
-import icedata
-import PIL, requests
-import torch
-from torchvision import transforms
-import gradio as gr
-
-# Download the dataset
-url = "https://cvbp-secondary.z19.web.core.windows.net/datasets/object_detection/odFridgeObjects.zip"
-dest_dir = "fridge"
-data_dir = icedata.load_data(url, dest_dir)
-
-# Create the parser
-parser = parsers.VOCBBoxParser(annotations_dir=data_dir / "odFridgeObjects/annotations", images_dir=data_dir / "odFridgeObjects/images")
-
-# Parse annotations to create records
-train_records, valid_records = parser.parse()
-
-class_map = parser.class_map
-
-extra_args = {}
-model_type = models.torchvision.retinanet
-backbone = model_type.backbones.resnet50_fpn
-# Instantiate the model
-model = model_type.model(backbone=backbone(pretrained=True), num_classes=len(parser.class_map), **extra_args) 
-
-# Transforms
-# size is set to 384 because EfficientDet requires its inputs to be divisible by 128
-image_size = 384
-train_tfms = tfms.A.Adapter([*tfms.A.aug_tfms(size=image_size, presize=512), tfms.A.Normalize()])
-valid_tfms = tfms.A.Adapter([*tfms.A.resize_and_pad(image_size), tfms.A.Normalize()])
-# Datasets
-train_ds = Dataset(train_records, train_tfms)
-valid_ds = Dataset(valid_records, valid_tfms)
-# Data Loaders
-train_dl = model_type.train_dl(train_ds, batch_size=8, num_workers=4, shuffle=True)
-valid_dl = model_type.valid_dl(valid_ds, batch_size=8, num_workers=4, shuffle=False)
-metrics = [COCOMetric(metric_type=COCOMetricType.bbox)]
-learn = model_type.fastai.learner(dls=[train_dl, valid_dl], model=model, metrics=metrics)
-
-learn = learn.load('model')
-
-import os
-for root, dirs, files in os.walk(r'sample_images/'):
-    for filename in files:
-        print(filename)
-
-examples = ["sample_images/"+file for file in files] 
-article="<p style='text-align: center'><a href='https://dicksonneoh.com/fridge-detector/' target='_blank'>Blog post</a></p>"
-enable_queue=True
-
-
-examples = [['sample_images/3.jpg'],['sample_images/15.jpg'],['sample_images/9.jpg']]
-#examples = [["sample_images/"+file] for file in files] 
-
-#def show_preds(input_image, display_label, display_bbox, detection_threshold):
-def show_preds(input_image):
-    #if detection_threshold==0: detection_threshold=0.5
-
-    img = PIL.Image.fromarray(input_image, 'RGB')
-    
-    pred_dict  = model_type.end2end_detect(img, valid_tfms, model, class_map=class_map, detection_threshold=0.5,
-                                           display_label=True, display_bbox=True, return_img=True, 
-                                           font_size=16, label_color="#FF59D6")
-
-    #pred_dict  = model_type.end2end_detect(img, valid_tfms, model, class_map=class_map, detection_threshold=detection_threshold,
-    #                                       display_label=display_label, display_bbox=display_bbox, return_img=True, 
-    #                                       font_size=16, label_color="#FF59D6")
-
-    return pred_dict['img']
-
-# display_chkbox = gr.inputs.CheckboxGroup(["Label", "BBox"], label="Display", default=True)
-display_chkbox_label = gr.inputs.Checkbox(label="Label", default=True)
-display_chkbox_box = gr.inputs.Checkbox(label="Box", default=True)
-
-detection_threshold_slider = gr.inputs.Slider(minimum=0, maximum=1, step=0.1, default=0.5, label="Detection Threshold")
-
-outputs = gr.outputs.Image(type="pil")
-
-# Option 1: Get an image from local drive
-#gr_interface = gr.Interface(fn=show_preds, inputs=["image", display_chkbox_label, display_chkbox_box,  detection_threshold_slider], outputs=outputs, title='IceApp - Fridge Object', article=article, examples=examples)
-# Option 1: Get an image from local drive
-gr_interface = gr.Interface(fn=show_preds, inputs=["image"], outputs=outputs, title='IceApp - Fridge Object', article=article, examples=examples)
-
-# #  Option 2: Grab an image from a webcam
-# gr_interface = gr.Interface(fn=show_preds, inputs=["webcam", display_chkbox_label, display_chkbox_box,  detection_threshold_slider], outputs=outputs, title='IceApp - COCO', live=False)
-
-# #  Option 3: Continuous image stream from the webcam
-# gr_interface = gr.Interface(fn=show_preds, inputs=["webcam", display_chkbox_label, display_chkbox_box,  detection_threshold_slider], outputs=outputs, title='IceApp - COCO', live=True)
-
-
-gr_interface.launch(inline=False, share=False, debug=True)
diff --git a/spaces/doevent/XTTS_V1_CPU_working/README.md b/spaces/doevent/XTTS_V1_CPU_working/README.md
deleted file mode 100644
index 751aebb1c866c67913b373e38862b37a72edf189..0000000000000000000000000000000000000000
--- a/spaces/doevent/XTTS_V1_CPU_working/README.md
+++ /dev/null
@@ -1,14 +0,0 @@
----
-title: XTTS_V1 work on CPU Can duplicate
-emoji: 🚀
-colorFrom: purple
-colorTo: green
-sdk: gradio
-sdk_version: 3.50.2
-app_file: app.py
-pinned: false
-models:
-- coqui/XTTS-v1
----
-
-Check out the configuration reference at https://huggingface.co/docs/hub/spaces-config-reference
\ No newline at end of file
diff --git a/spaces/dorkai/ChatUIPro/app/components/chat/loading-anim/style.module.css b/spaces/dorkai/ChatUIPro/app/components/chat/loading-anim/style.module.css
deleted file mode 100644
index 5a764db13c0b7feef2061a836aa04152aaaee72a..0000000000000000000000000000000000000000
--- a/spaces/dorkai/ChatUIPro/app/components/chat/loading-anim/style.module.css
+++ /dev/null
@@ -1,82 +0,0 @@
-.dot-flashing {
-  position: relative;
-  animation: 1s infinite linear alternate;
-  animation-delay: 0.5s;
-}
-
-.dot-flashing::before,
-.dot-flashing::after {
-  content: "";
-  display: inline-block;
-  position: absolute;
-  top: 0;
-  animation: 1s infinite linear alternate;
-}
-
-.dot-flashing::before {
-  animation-delay: 0s;
-}
-
-.dot-flashing::after {
-  animation-delay: 1s;
-}
-
-@keyframes dot-flashing {
-  0% {
-    background-color: #667085;
-  }
-
-  50%,
-  100% {
-    background-color: rgba(102, 112, 133, 0.3);
-  }
-}
-
-@keyframes dot-flashing-avatar {
-  0% {
-    background-color: #155EEF;
-  }
-
-  50%,
-  100% {
-    background-color: rgba(21, 94, 239, 0.3);
-  }
-}
-
-.text,
-.text::before,
-.text::after {
-  width: 4px;
-  height: 4px;
-  border-radius: 50%;
-  background-color: #667085;
-  color: #667085;
-  animation-name: dot-flashing;
-}
-
-.text::before {
-  left: -7px;
-}
-
-.text::after {
-  left: 7px;
-}
-
-.avatar,
-.avatar::before,
-.avatar::after {
-  width: 2px;
-  height: 2px;
-  border-radius: 50%;
-  background-color: #155EEF;
-  color: #155EEF;
-  animation-name: dot-flashing-avatar;
-}
-
-.avatar::before {
-  left: -5px;
-}
-
-.avatar::after {
-  left: 5px;
-}
\ No newline at end of file
diff --git a/spaces/dtrejopizzo/webcam/app.py b/spaces/dtrejopizzo/webcam/app.py
deleted file mode 100644
index c81141498f93484d1c790d69d7cf123bb17111a0..0000000000000000000000000000000000000000
--- a/spaces/dtrejopizzo/webcam/app.py
+++ /dev/null
@@ -1,25 +0,0 @@
-#Importamos las librerias que necesitamos y Tensorflow para entrenar la red neuronal
-import os
-import PIL
-import gradio as gr
-import tensorflow as tf
-from tensorflow import keras
-
-#Agregar red neuronal, función q la importe desde la carpeta creada
-model = tf.keras.models.load_model('saved_model/model1')
-class_names = ['autos', 'motos']
-
-#Creamos la función de predicción que va a usar Gradio
-def predict_image(img):
-  img_4d=img.reshape(-1,180,180,3)
-  prediction=model.predict(img_4d)[0]
-  return {class_names[i]: float(prediction[i]) for i in range(2)}
-  
-  #Creamos la interface de Gradio (frontend)
-image = gr.inputs.Image(source="webcam", shape=(180,180))
-
-label = gr.outputs.Label(num_top_classes=2)
-
-gr.Interface(
-    fn=predict_image, inputs=image, outputs=label,interpretation='default'
-    ).launch(debug=True)
\ No newline at end of file
diff --git a/spaces/dylanebert/FarmingGame/index.html b/spaces/dylanebert/FarmingGame/index.html
deleted file mode 100644
index 8858c1029c9bfc6a8fdaa2c591f6e54311fac90b..0000000000000000000000000000000000000000
--- a/spaces/dylanebert/FarmingGame/index.html
+++ /dev/null
@@ -1,92 +0,0 @@
-<!DOCTYPE html>
-<html lang="en-us">
-  <head>
-    <meta charset="utf-8">
-    <meta http-equiv="Content-Type" content="text/html; charset=utf-8">
-    <meta name="viewport" content="width=device-width, initial-scale=1.0, user-scalable=no">
-    <title>KexFarm</title>
-    <link rel="shortcut icon" href="TemplateData/favicon.ico">
-    <link rel="stylesheet" href="TemplateData/style.css">
-  </head>
-  <body class="light">
-    <div id="unity-container" class="unity-desktop">
-      <canvas id="unity-canvas"></canvas>
-    </div>
-    <div id="loading-cover" style="display:none;">
-      <div id="unity-loading-bar">
-        <div id="unity-logo"><img src="logo.png"></div>
-        <div id="unity-progress-bar-empty" style="display: none;">
-          <div id="unity-progress-bar-full"></div>
-        </div>
-        <div class="spinner"></div>
-      </div>
-    </div>
-    <div id="unity-fullscreen-button" style="display: none;"></div>
-    <script>
-      const hideFullScreenButton = "";
-      const buildUrl = "Build";
-      const loaderUrl = buildUrl + "/Build.loader.js";
-      const config = {
-        dataUrl: buildUrl + "/Build.data",
-        frameworkUrl: buildUrl + "/Build.framework.js",
-        codeUrl: buildUrl + "/Build.wasm",
-        streamingAssetsUrl: "StreamingAssets",
-        companyName: "DefaultCompany",
-        productName: "KexFarm",
-        productVersion: "0.1",
-      };
-
-      const container = document.querySelector("#unity-container");
-      const canvas = document.querySelector("#unity-canvas");
-      const loadingCover = document.querySelector("#loading-cover");
-      const progressBarEmpty = document.querySelector("#unity-progress-bar-empty");
-      const progressBarFull = document.querySelector("#unity-progress-bar-full");
-      const fullscreenButton = document.querySelector("#unity-fullscreen-button");
-      const spinner = document.querySelector('.spinner');
-
-      const canFullscreen = (function() {
-        for (const key of [
-            'exitFullscreen',
-            'webkitExitFullscreen',
-            'webkitCancelFullScreen',
-            'mozCancelFullScreen',
-            'msExitFullscreen',
-          ]) {
-          if (key in document) {
-            return true;
-          }
-        }
-        return false;
-      }());
-
-      if (/iPhone|iPad|iPod|Android/i.test(navigator.userAgent)) {
-        container.className = "unity-mobile";
-        config.devicePixelRatio = 1;
-      }
-      loadingCover.style.display = "";
-
-      const script = document.createElement("script");
-      script.src = loaderUrl;
-      script.onload = () => {
-        createUnityInstance(canvas, config, (progress) => {
-          spinner.style.display = "none";
-          progressBarEmpty.style.display = "";
-          progressBarFull.style.width = `${100 * progress}%`;
-        }).then((unityInstance) => {
-          loadingCover.style.display = "none";
-          if (canFullscreen) {
-            if (!hideFullScreenButton) {
-              fullscreenButton.style.display = "";
-            }
-            fullscreenButton.onclick = () => {
-              unityInstance.SetFullscreen(1);
-            };
-          }
-        }).catch((message) => {
-          alert(message);
-        });
-      };
-      document.body.appendChild(script);
-    </script>
-  </body>
-</html>
diff --git a/spaces/emc348/faces-through-time/models/StyleCLIP/models/stylegan2/model.py b/spaces/emc348/faces-through-time/models/StyleCLIP/models/stylegan2/model.py
deleted file mode 100644
index 9d5559203f4f3843fc814b090780ffa129a6fdf0..0000000000000000000000000000000000000000
--- a/spaces/emc348/faces-through-time/models/StyleCLIP/models/stylegan2/model.py
+++ /dev/null
@@ -1,674 +0,0 @@
-import math
-import random
-
-import torch
-from torch import nn
-from torch.nn import functional as F
-
-from  models.StyleCLIP.models.stylegan2.op import FusedLeakyReLU, fused_leaky_relu, upfirdn2d
-
-
-class PixelNorm(nn.Module):
-    def __init__(self):
-        super().__init__()
-
-    def forward(self, input):
-        return input * torch.rsqrt(torch.mean(input ** 2, dim=1, keepdim=True) + 1e-8)
-
-
-def make_kernel(k):
-    k = torch.tensor(k, dtype=torch.float32)
-
-    if k.ndim == 1:
-        k = k[None, :] * k[:, None]
-
-    k /= k.sum()
-
-    return k
-
-
-class Upsample(nn.Module):
-    def __init__(self, kernel, factor=2):
-        super().__init__()
-
-        self.factor = factor
-        kernel = make_kernel(kernel) * (factor ** 2)
-        self.register_buffer('kernel', kernel)
-
-        p = kernel.shape[0] - factor
-
-        pad0 = (p + 1) // 2 + factor - 1
-        pad1 = p // 2
-
-        self.pad = (pad0, pad1)
-
-    def forward(self, input):
-        out = upfirdn2d(input, self.kernel, up=self.factor, down=1, pad=self.pad)
-
-        return out
-
-
-class Downsample(nn.Module):
-    def __init__(self, kernel, factor=2):
-        super().__init__()
-
-        self.factor = factor
-        kernel = make_kernel(kernel)
-        self.register_buffer('kernel', kernel)
-
-        p = kernel.shape[0] - factor
-
-        pad0 = (p + 1) // 2
-        pad1 = p // 2
-
-        self.pad = (pad0, pad1)
-
-    def forward(self, input):
-        out = upfirdn2d(input, self.kernel, up=1, down=self.factor, pad=self.pad)
-
-        return out
-
-
-class Blur(nn.Module):
-    def __init__(self, kernel, pad, upsample_factor=1):
-        super().__init__()
-
-        kernel = make_kernel(kernel)
-
-        if upsample_factor > 1:
-            kernel = kernel * (upsample_factor ** 2)
-
-        self.register_buffer('kernel', kernel)
-
-        self.pad = pad
-
-    def forward(self, input):
-        out = upfirdn2d(input, self.kernel, pad=self.pad)
-
-        return out
-
-
-class EqualConv2d(nn.Module):
-    def __init__(
-        self, in_channel, out_channel, kernel_size, stride=1, padding=0, bias=True
-    ):
-        super().__init__()
-
-        self.weight = nn.Parameter(
-            torch.randn(out_channel, in_channel, kernel_size, kernel_size)
-        )
-        self.scale = 1 / math.sqrt(in_channel * kernel_size ** 2)
-
-        self.stride = stride
-        self.padding = padding
-
-        if bias:
-            self.bias = nn.Parameter(torch.zeros(out_channel))
-
-        else:
-            self.bias = None
-
-    def forward(self, input):
-        out = F.conv2d(
-            input,
-            self.weight * self.scale,
-            bias=self.bias,
-            stride=self.stride,
-            padding=self.padding,
-        )
-
-        return out
-
-    def __repr__(self):
-        return (
-            f'{self.__class__.__name__}({self.weight.shape[1]}, {self.weight.shape[0]},'
-            f' {self.weight.shape[2]}, stride={self.stride}, padding={self.padding})'
-        )
-
-
-class EqualLinear(nn.Module):
-    def __init__(
-        self, in_dim, out_dim, bias=True, bias_init=0, lr_mul=1, activation=None
-    ):
-        super().__init__()
-
-        self.weight = nn.Parameter(torch.randn(out_dim, in_dim).div_(lr_mul))
-
-        if bias:
-            self.bias = nn.Parameter(torch.zeros(out_dim).fill_(bias_init))
-
-        else:
-            self.bias = None
-
-        self.activation = activation
-
-        self.scale = (1 / math.sqrt(in_dim)) * lr_mul
-        self.lr_mul = lr_mul
-
-    def forward(self, input):
-        if self.activation:
-            out = F.linear(input, self.weight * self.scale)
-            out = fused_leaky_relu(out, self.bias * self.lr_mul)
-
-        else:
-            out = F.linear(
-                input, self.weight * self.scale, bias=self.bias * self.lr_mul
-            )
-
-        return out
-
-    def __repr__(self):
-        return (
-            f'{self.__class__.__name__}({self.weight.shape[1]}, {self.weight.shape[0]})'
-        )
-
-
-class ScaledLeakyReLU(nn.Module):
-    def __init__(self, negative_slope=0.2):
-        super().__init__()
-
-        self.negative_slope = negative_slope
-
-    def forward(self, input):
-        out = F.leaky_relu(input, negative_slope=self.negative_slope)
-
-        return out * math.sqrt(2)
-
-
-class ModulatedConv2d(nn.Module):
-    def __init__(
-        self,
-        in_channel,
-        out_channel,
-        kernel_size,
-        style_dim,
-        demodulate=True,
-        upsample=False,
-        downsample=False,
-        blur_kernel=[1, 3, 3, 1],
-    ):
-        super().__init__()
-
-        self.eps = 1e-8
-        self.kernel_size = kernel_size
-        self.in_channel = in_channel
-        self.out_channel = out_channel
-        self.upsample = upsample
-        self.downsample = downsample
-
-        if upsample:
-            factor = 2
-            p = (len(blur_kernel) - factor) - (kernel_size - 1)
-            pad0 = (p + 1) // 2 + factor - 1
-            pad1 = p // 2 + 1
-
-            self.blur = Blur(blur_kernel, pad=(pad0, pad1), upsample_factor=factor)
-
-        if downsample:
-            factor = 2
-            p = (len(blur_kernel) - factor) + (kernel_size - 1)
-            pad0 = (p + 1) // 2
-            pad1 = p // 2
-
-            self.blur = Blur(blur_kernel, pad=(pad0, pad1))
-
-        fan_in = in_channel * kernel_size ** 2
-        self.scale = 1 / math.sqrt(fan_in)
-        self.padding = kernel_size // 2
-
-        self.weight = nn.Parameter(
-            torch.randn(1, out_channel, in_channel, kernel_size, kernel_size)
-        )
-
-        self.modulation = EqualLinear(style_dim, in_channel, bias_init=1)
-
-        self.demodulate = demodulate
-
-    def __repr__(self):
-        return (
-            f'{self.__class__.__name__}({self.in_channel}, {self.out_channel}, {self.kernel_size}, '
-            f'upsample={self.upsample}, downsample={self.downsample})'
-        )
-
-    def forward(self, input, style):
-        batch, in_channel, height, width = input.shape
-
-        style = self.modulation(style).view(batch, 1, in_channel, 1, 1)
-        weight = self.scale * self.weight * style
-
-        if self.demodulate:
-            demod = torch.rsqrt(weight.pow(2).sum([2, 3, 4]) + 1e-8)
-            weight = weight * demod.view(batch, self.out_channel, 1, 1, 1)
-
-        weight = weight.view(
-            batch * self.out_channel, in_channel, self.kernel_size, self.kernel_size
-        )
-
-        if self.upsample:
-            input = input.view(1, batch * in_channel, height, width)
-            weight = weight.view(
-                batch, self.out_channel, in_channel, self.kernel_size, self.kernel_size
-            )
-            weight = weight.transpose(1, 2).reshape(
-                batch * in_channel, self.out_channel, self.kernel_size, self.kernel_size
-            )
-            out = F.conv_transpose2d(input, weight, padding=0, stride=2, groups=batch)
-            _, _, height, width = out.shape
-            out = out.view(batch, self.out_channel, height, width)
-            out = self.blur(out)
-
-        elif self.downsample:
-            input = self.blur(input)
-            _, _, height, width = input.shape
-            input = input.view(1, batch * in_channel, height, width)
-            out = F.conv2d(input, weight, padding=0, stride=2, groups=batch)
-            _, _, height, width = out.shape
-            out = out.view(batch, self.out_channel, height, width)
-
-        else:
-            input = input.view(1, batch * in_channel, height, width)
-            out = F.conv2d(input, weight, padding=self.padding, groups=batch)
-            _, _, height, width = out.shape
-            out = out.view(batch, self.out_channel, height, width)
-
-        return out
-
-
-class NoiseInjection(nn.Module):
-    def __init__(self):
-        super().__init__()
-
-        self.weight = nn.Parameter(torch.zeros(1))
-
-    def forward(self, image, noise=None):
-        if noise is None:
-            batch, _, height, width = image.shape
-            noise = image.new_empty(batch, 1, height, width).normal_()
-
-        return image + self.weight * noise
-
-
-class ConstantInput(nn.Module):
-    def __init__(self, channel, size=4):
-        super().__init__()
-
-        self.input = nn.Parameter(torch.randn(1, channel, size, size))
-
-    def forward(self, input):
-        batch = input.shape[0]
-        out = self.input.repeat(batch, 1, 1, 1)
-
-        return out
-
-
-class StyledConv(nn.Module):
-    def __init__(
-        self,
-        in_channel,
-        out_channel,
-        kernel_size,
-        style_dim,
-        upsample=False,
-        blur_kernel=[1, 3, 3, 1],
-        demodulate=True,
-    ):
-        super().__init__()
-
-        self.conv = ModulatedConv2d(
-            in_channel,
-            out_channel,
-            kernel_size,
-            style_dim,
-            upsample=upsample,
-            blur_kernel=blur_kernel,
-            demodulate=demodulate,
-        )
-
-        self.noise = NoiseInjection()
-        # self.bias = nn.Parameter(torch.zeros(1, out_channel, 1, 1))
-        # self.activate = ScaledLeakyReLU(0.2)
-        self.activate = FusedLeakyReLU(out_channel)
-
-    def forward(self, input, style, noise=None):
-        out = self.conv(input, style)
-        out = self.noise(out, noise=noise)
-        # out = out + self.bias
-        out = self.activate(out)
-
-        return out
-
-
-class ToRGB(nn.Module):
-    def __init__(self, in_channel, style_dim, upsample=True, blur_kernel=[1, 3, 3, 1]):
-        super().__init__()
-
-        if upsample:
-            self.upsample = Upsample(blur_kernel)
-
-        self.conv = ModulatedConv2d(in_channel, 3, 1, style_dim, demodulate=False)
-        self.bias = nn.Parameter(torch.zeros(1, 3, 1, 1))
-
-    def forward(self, input, style, skip=None):
-        out = self.conv(input, style)
-        out = out + self.bias
-
-        if skip is not None:
-            skip = self.upsample(skip)
-
-            out = out + skip
-
-        return out
-
-
-class Generator(nn.Module):
-    def __init__(
-        self,
-        size,
-        style_dim,
-        n_mlp,
-        channel_multiplier=2,
-        blur_kernel=[1, 3, 3, 1],
-        lr_mlp=0.01,
-    ):
-        super().__init__()
-
-        self.size = size
-
-        self.style_dim = style_dim
-
-        layers = [PixelNorm()]
-
-        for i in range(n_mlp):
-            layers.append(
-                EqualLinear(
-                    style_dim, style_dim, lr_mul=lr_mlp, activation='fused_lrelu'
-                )
-            )
-
-        self.style = nn.Sequential(*layers)
-
-        self.channels = {
-            4: 512,
-            8: 512,
-            16: 512,
-            32: 512,
-            64: 256 * channel_multiplier,
-            128: 128 * channel_multiplier,
-            256: 64 * channel_multiplier,
-            512: 32 * channel_multiplier,
-            1024: 16 * channel_multiplier,
-        }
-
-        self.input = ConstantInput(self.channels[4])
-        self.conv1 = StyledConv(
-            self.channels[4], self.channels[4], 3, style_dim, blur_kernel=blur_kernel
-        )
-        self.to_rgb1 = ToRGB(self.channels[4], style_dim, upsample=False)
-
-        self.log_size = int(math.log(size, 2))
-        self.num_layers = (self.log_size - 2) * 2 + 1
-
-        self.convs = nn.ModuleList()
-        self.upsamples = nn.ModuleList()
-        self.to_rgbs = nn.ModuleList()
-        self.noises = nn.Module()
-
-        in_channel = self.channels[4]
-
-        for layer_idx in range(self.num_layers):
-            res = (layer_idx + 5) // 2
-            shape = [1, 1, 2 ** res, 2 ** res]
-            self.noises.register_buffer(f'noise_{layer_idx}', torch.randn(*shape))
-
-        for i in range(3, self.log_size + 1):
-            out_channel = self.channels[2 ** i]
-
-            self.convs.append(
-                StyledConv(
-                    in_channel,
-                    out_channel,
-                    3,
-                    style_dim,
-                    upsample=True,
-                    blur_kernel=blur_kernel,
-                )
-            )
-
-            self.convs.append(
-                StyledConv(
-                    out_channel, out_channel, 3, style_dim, blur_kernel=blur_kernel
-                )
-            )
-
-            self.to_rgbs.append(ToRGB(out_channel, style_dim))
-
-            in_channel = out_channel
-
-        self.n_latent = self.log_size * 2 - 2
-
-    def make_noise(self):
-        device = self.input.input.device
-
-        noises = [torch.randn(1, 1, 2 ** 2, 2 ** 2, device=device)]
-
-        for i in range(3, self.log_size + 1):
-            for _ in range(2):
-                noises.append(torch.randn(1, 1, 2 ** i, 2 ** i, device=device))
-
-        return noises
-
-    def mean_latent(self, n_latent):
-        latent_in = torch.randn(
-            n_latent, self.style_dim, device=self.input.input.device
-        )
-        latent = self.style(latent_in).mean(0, keepdim=True)
-
-        return latent
-
-    def get_latent(self, input):
-        return self.style(input)
-
-    def forward(
-        self,
-        styles,
-        return_latents=False,
-        inject_index=None,
-        truncation=1,
-        truncation_latent=None,
-        input_is_latent=False,
-        noise=None,
-        randomize_noise=True,
-    ):
-        if not input_is_latent:
-            styles = [self.style(s) for s in styles]
-
-        if noise is None:
-            if randomize_noise:
-                noise = [None] * self.num_layers
-            else:
-                noise = [
-                    getattr(self.noises, f'noise_{i}') for i in range(self.num_layers)
-                ]
-
-        if truncation < 1:
-            style_t = []
-
-            for style in styles:
-                style_t.append(
-                    truncation_latent + truncation * (style - truncation_latent)
-                )
-
-            styles = style_t
-
-        if len(styles) < 2:
-            inject_index = self.n_latent
-
-            if styles[0].ndim < 3:
-                latent = styles[0].unsqueeze(1).repeat(1, inject_index, 1)
-
-            else:
-                latent = styles[0]
-
-        else:
-            if inject_index is None:
-                inject_index = random.randint(1, self.n_latent - 1)
-
-            latent = styles[0].unsqueeze(1).repeat(1, inject_index, 1)
-            latent2 = styles[1].unsqueeze(1).repeat(1, self.n_latent - inject_index, 1)
-
-            latent = torch.cat([latent, latent2], 1)
-
-        out = self.input(latent)
-        out = self.conv1(out, latent[:, 0], noise=noise[0])
-
-        skip = self.to_rgb1(out, latent[:, 1])
-
-        i = 1
-        for conv1, conv2, noise1, noise2, to_rgb in zip(
-            self.convs[::2], self.convs[1::2], noise[1::2], noise[2::2], self.to_rgbs
-        ):
-            out = conv1(out, latent[:, i], noise=noise1)
-            out = conv2(out, latent[:, i + 1], noise=noise2)
-            skip = to_rgb(out, latent[:, i + 2], skip)
-
-            i += 2
-
-        image = skip
-
-        if return_latents:
-            return image, latent
-
-        else:
-            return image, None
-
-
-class ConvLayer(nn.Sequential):
-    def __init__(
-        self,
-        in_channel,
-        out_channel,
-        kernel_size,
-        downsample=False,
-        blur_kernel=[1, 3, 3, 1],
-        bias=True,
-        activate=True,
-    ):
-        layers = []
-
-        if downsample:
-            factor = 2
-            p = (len(blur_kernel) - factor) + (kernel_size - 1)
-            pad0 = (p + 1) // 2
-            pad1 = p // 2
-
-            layers.append(Blur(blur_kernel, pad=(pad0, pad1)))
-
-            stride = 2
-            self.padding = 0
-
-        else:
-            stride = 1
-            self.padding = kernel_size // 2
-
-        layers.append(
-            EqualConv2d(
-                in_channel,
-                out_channel,
-                kernel_size,
-                padding=self.padding,
-                stride=stride,
-                bias=bias and not activate,
-            )
-        )
-
-        if activate:
-            if bias:
-                layers.append(FusedLeakyReLU(out_channel))
-
-            else:
-                layers.append(ScaledLeakyReLU(0.2))
-
-        super().__init__(*layers)
-
-
-class ResBlock(nn.Module):
-    def __init__(self, in_channel, out_channel, blur_kernel=[1, 3, 3, 1]):
-        super().__init__()
-
-        self.conv1 = ConvLayer(in_channel, in_channel, 3)
-        self.conv2 = ConvLayer(in_channel, out_channel, 3, downsample=True)
-
-        self.skip = ConvLayer(
-            in_channel, out_channel, 1, downsample=True, activate=False, bias=False
-        )
-
-    def forward(self, input):
-        out = self.conv1(input)
-        out = self.conv2(out)
-
-        skip = self.skip(input)
-        out = (out + skip) / math.sqrt(2)
-
-        return out
-
-
-class Discriminator(nn.Module):
-    def __init__(self, size, channel_multiplier=2, blur_kernel=[1, 3, 3, 1]):
-        super().__init__()
-
-        channels = {
-            4: 512,
-            8: 512,
-            16: 512,
-            32: 512,
-            64: 256 * channel_multiplier,
-            128: 128 * channel_multiplier,
-            256: 64 * channel_multiplier,
-            512: 32 * channel_multiplier,
-            1024: 16 * channel_multiplier,
-        }
-
-        convs = [ConvLayer(3, channels[size], 1)]
-
-        log_size = int(math.log(size, 2))
-
-        in_channel = channels[size]
-
-        for i in range(log_size, 2, -1):
-            out_channel = channels[2 ** (i - 1)]
-
-            convs.append(ResBlock(in_channel, out_channel, blur_kernel))
-
-            in_channel = out_channel
-
-        self.convs = nn.Sequential(*convs)
-
-        self.stddev_group = 4
-        self.stddev_feat = 1
-
-        self.final_conv = ConvLayer(in_channel + 1, channels[4], 3)
-        self.final_linear = nn.Sequential(
-            EqualLinear(channels[4] * 4 * 4, channels[4], activation='fused_lrelu'),
-            EqualLinear(channels[4], 1),
-        )
-
-    def forward(self, input):
-        out = self.convs(input)
-
-        batch, channel, height, width = out.shape
-        group = min(batch, self.stddev_group)
-        stddev = out.view(
-            group, -1, self.stddev_feat, channel // self.stddev_feat, height, width
-        )
-        stddev = torch.sqrt(stddev.var(0, unbiased=False) + 1e-8)
-        stddev = stddev.mean([2, 3, 4], keepdims=True).squeeze(2)
-        stddev = stddev.repeat(group, 1, height, width)
-        out = torch.cat([out, stddev], 1)
-
-        out = self.final_conv(out)
-
-        out = out.view(batch, -1)
-        out = self.final_linear(out)
-
-        return out
-
diff --git a/spaces/emc348/faces-through-time/torch_utils/training_stats.py b/spaces/emc348/faces-through-time/torch_utils/training_stats.py
deleted file mode 100644
index 26f467f9eaa074ee13de1cf2625cd7da44880847..0000000000000000000000000000000000000000
--- a/spaces/emc348/faces-through-time/torch_utils/training_stats.py
+++ /dev/null
@@ -1,268 +0,0 @@
-# Copyright (c) 2021, NVIDIA CORPORATION.  All rights reserved.
-#
-# NVIDIA CORPORATION and its licensors retain all intellectual property
-# and proprietary rights in and to this software, related documentation
-# and any modifications thereto.  Any use, reproduction, disclosure or
-# distribution of this software and related documentation without an express
-# license agreement from NVIDIA CORPORATION is strictly prohibited.
-
-"""Facilities for reporting and collecting training statistics across
-multiple processes and devices. The interface is designed to minimize
-synchronization overhead as well as the amount of boilerplate in user
-code."""
-
-import re
-import numpy as np
-import torch
-import dnnlib
-
-from . import misc
-
-#----------------------------------------------------------------------------
-
-_num_moments    = 3             # [num_scalars, sum_of_scalars, sum_of_squares]
-_reduce_dtype   = torch.float32 # Data type to use for initial per-tensor reduction.
-_counter_dtype  = torch.float64 # Data type to use for the internal counters.
-_rank           = 0             # Rank of the current process.
-_sync_device    = None          # Device to use for multiprocess communication. None = single-process.
-_sync_called    = False         # Has _sync() been called yet?
-_counters       = dict()        # Running counters on each device, updated by report(): name => device => torch.Tensor
-_cumulative     = dict()        # Cumulative counters on the CPU, updated by _sync(): name => torch.Tensor
-
-#----------------------------------------------------------------------------
-
-def init_multiprocessing(rank, sync_device):
-    r"""Initializes `torch_utils.training_stats` for collecting statistics
-    across multiple processes.
-
-    This function must be called after
-    `torch.distributed.init_process_group()` and before `Collector.update()`.
-    The call is not necessary if multi-process collection is not needed.
-
-    Args:
-        rank:           Rank of the current process.
-        sync_device:    PyTorch device to use for inter-process
-                        communication, or None to disable multi-process
-                        collection. Typically `torch.device('cuda', rank)`.
-    """
-    global _rank, _sync_device
-    assert not _sync_called
-    _rank = rank
-    _sync_device = sync_device
-
-#----------------------------------------------------------------------------
-
-@misc.profiled_function
-def report(name, value):
-    r"""Broadcasts the given set of scalars to all interested instances of
-    `Collector`, across device and process boundaries.
-
-    This function is expected to be extremely cheap and can be safely
-    called from anywhere in the training loop, loss function, or inside a
-    `torch.nn.Module`.
-
-    Warning: The current implementation expects the set of unique names to
-    be consistent across processes. Please make sure that `report()` is
-    called at least once for each unique name by each process, and in the
-    same order. If a given process has no scalars to broadcast, it can do
-    `report(name, [])` (empty list).
-
-    Args:
-        name:   Arbitrary string specifying the name of the statistic.
-                Averages are accumulated separately for each unique name.
-        value:  Arbitrary set of scalars. Can be a list, tuple,
-                NumPy array, PyTorch tensor, or Python scalar.
-
-    Returns:
-        The same `value` that was passed in.
-    """
-    if name not in _counters:
-        _counters[name] = dict()
-
-    elems = torch.as_tensor(value)
-    if elems.numel() == 0:
-        return value
-
-    elems = elems.detach().flatten().to(_reduce_dtype)
-    moments = torch.stack([
-        torch.ones_like(elems).sum(),
-        elems.sum(),
-        elems.square().sum(),
-    ])
-    assert moments.ndim == 1 and moments.shape[0] == _num_moments
-    moments = moments.to(_counter_dtype)
-
-    device = moments.device
-    if device not in _counters[name]:
-        _counters[name][device] = torch.zeros_like(moments)
-    _counters[name][device].add_(moments)
-    return value
-
-#----------------------------------------------------------------------------
-
-def report0(name, value):
-    r"""Broadcasts the given set of scalars by the first process (`rank = 0`),
-    but ignores any scalars provided by the other processes.
-    See `report()` for further details.
-    """
-    report(name, value if _rank == 0 else [])
-    return value
-
-#----------------------------------------------------------------------------
-
-class Collector:
-    r"""Collects the scalars broadcasted by `report()` and `report0()` and
-    computes their long-term averages (mean and standard deviation) over
-    user-defined periods of time.
-
-    The averages are first collected into internal counters that are not
-    directly visible to the user. They are then copied to the user-visible
-    state as a result of calling `update()` and can then be queried using
-    `mean()`, `std()`, `as_dict()`, etc. Calling `update()` also resets the
-    internal counters for the next round, so that the user-visible state
-    effectively reflects averages collected between the last two calls to
-    `update()`.
-
-    Args:
-        regex:          Regular expression defining which statistics to
-                        collect. The default is to collect everything.
-        keep_previous:  Whether to retain the previous averages if no
-                        scalars were collected on a given round
-                        (default: True).
-    """
-    def __init__(self, regex='.*', keep_previous=True):
-        self._regex = re.compile(regex)
-        self._keep_previous = keep_previous
-        self._cumulative = dict()
-        self._moments = dict()
-        self.update()
-        self._moments.clear()
-
-    def names(self):
-        r"""Returns the names of all statistics broadcasted so far that
-        match the regular expression specified at construction time.
-        """
-        return [name for name in _counters if self._regex.fullmatch(name)]
-
-    def update(self):
-        r"""Copies current values of the internal counters to the
-        user-visible state and resets them for the next round.
-
-        If `keep_previous=True` was specified at construction time, the
-        operation is skipped for statistics that have received no scalars
-        since the last update, retaining their previous averages.
-
-        This method performs a number of GPU-to-CPU transfers and one
-        `torch.distributed.all_reduce()`. It is intended to be called
-        periodically in the main training loop, typically once every
-        N training steps.
-        """
-        if not self._keep_previous:
-            self._moments.clear()
-        for name, cumulative in _sync(self.names()):
-            if name not in self._cumulative:
-                self._cumulative[name] = torch.zeros([_num_moments], dtype=_counter_dtype)
-            delta = cumulative - self._cumulative[name]
-            self._cumulative[name].copy_(cumulative)
-            if float(delta[0]) != 0:
-                self._moments[name] = delta
-
-    def _get_delta(self, name):
-        r"""Returns the raw moments that were accumulated for the given
-        statistic between the last two calls to `update()`, or zero if
-        no scalars were collected.
-        """
-        assert self._regex.fullmatch(name)
-        if name not in self._moments:
-            self._moments[name] = torch.zeros([_num_moments], dtype=_counter_dtype)
-        return self._moments[name]
-
-    def num(self, name):
-        r"""Returns the number of scalars that were accumulated for the given
-        statistic between the last two calls to `update()`, or zero if
-        no scalars were collected.
-        """
-        delta = self._get_delta(name)
-        return int(delta[0])
-
-    def mean(self, name):
-        r"""Returns the mean of the scalars that were accumulated for the
-        given statistic between the last two calls to `update()`, or NaN if
-        no scalars were collected.
-        """
-        delta = self._get_delta(name)
-        if int(delta[0]) == 0:
-            return float('nan')
-        return float(delta[1] / delta[0])
-
-    def std(self, name):
-        r"""Returns the standard deviation of the scalars that were
-        accumulated for the given statistic between the last two calls to
-        `update()`, or NaN if no scalars were collected.
-        """
-        delta = self._get_delta(name)
-        if int(delta[0]) == 0 or not np.isfinite(float(delta[1])):
-            return float('nan')
-        if int(delta[0]) == 1:
-            return float(0)
-        mean = float(delta[1] / delta[0])
-        raw_var = float(delta[2] / delta[0])
-        return np.sqrt(max(raw_var - np.square(mean), 0))
-
-    def as_dict(self):
-        r"""Returns the averages accumulated between the last two calls to
-        `update()` as an `dnnlib.EasyDict`. The contents are as follows:
-
-            dnnlib.EasyDict(
-                NAME = dnnlib.EasyDict(num=FLOAT, mean=FLOAT, std=FLOAT),
-                ...
-            )
-        """
-        stats = dnnlib.EasyDict()
-        for name in self.names():
-            stats[name] = dnnlib.EasyDict(num=self.num(name), mean=self.mean(name), std=self.std(name))
-        return stats
-
-    def __getitem__(self, name):
-        r"""Convenience getter.
-        `collector[name]` is a synonym for `collector.mean(name)`.
-        """
-        return self.mean(name)
-
-#----------------------------------------------------------------------------
-
-def _sync(names):
-    r"""Synchronize the global cumulative counters across devices and
-    processes. Called internally by `Collector.update()`.
-    """
-    if len(names) == 0:
-        return []
-    global _sync_called
-    _sync_called = True
-
-    # Collect deltas within current rank.
-    deltas = []
-    device = _sync_device if _sync_device is not None else torch.device('cpu')
-    for name in names:
-        delta = torch.zeros([_num_moments], dtype=_counter_dtype, device=device)
-        for counter in _counters[name].values():
-            delta.add_(counter.to(device))
-            counter.copy_(torch.zeros_like(counter))
-        deltas.append(delta)
-    deltas = torch.stack(deltas)
-
-    # Sum deltas across ranks.
-    if _sync_device is not None:
-        torch.distributed.all_reduce(deltas)
-
-    # Update cumulative values.
-    deltas = deltas.cpu()
-    for idx, name in enumerate(names):
-        if name not in _cumulative:
-            _cumulative[name] = torch.zeros([_num_moments], dtype=_counter_dtype)
-        _cumulative[name].add_(deltas[idx])
-
-    # Return name-value pairs.
-    return [(name, _cumulative[name]) for name in names]
-
-#----------------------------------------------------------------------------
diff --git a/spaces/eswat/Image-and-3D-Model-Creator/PIFu/apps/train_color.py b/spaces/eswat/Image-and-3D-Model-Creator/PIFu/apps/train_color.py
deleted file mode 100644
index 3c1aeb9f33ff7ebf95489cef9a3e96e8af7ee3d7..0000000000000000000000000000000000000000
--- a/spaces/eswat/Image-and-3D-Model-Creator/PIFu/apps/train_color.py
+++ /dev/null
@@ -1,191 +0,0 @@
-import sys
-import os
-
-sys.path.insert(0, os.path.abspath(os.path.join(os.path.dirname(__file__), '..')))
-ROOT_PATH = os.path.dirname(os.path.dirname(os.path.abspath(__file__)))
-
-import time
-import json
-import numpy as np
-import cv2
-import random
-import torch
-import torch.nn as nn
-from torch.utils.data import DataLoader
-from tqdm import tqdm
-
-from lib.options import BaseOptions
-from lib.mesh_util import *
-from lib.sample_util import *
-from lib.train_util import *
-from lib.data import *
-from lib.model import *
-from lib.geometry import index
-
-# get options
-opt = BaseOptions().parse()
-
-def train_color(opt):
-    # set cuda
-    cuda = torch.device('cuda:%d' % opt.gpu_id)
-
-    train_dataset = TrainDataset(opt, phase='train')
-    test_dataset = TrainDataset(opt, phase='test')
-
-    projection_mode = train_dataset.projection_mode
-
-    # create data loader
-    train_data_loader = DataLoader(train_dataset,
-                                   batch_size=opt.batch_size, shuffle=not opt.serial_batches,
-                                   num_workers=opt.num_threads, pin_memory=opt.pin_memory)
-
-    print('train data size: ', len(train_data_loader))
-
-    # NOTE: batch size should be 1 and use all the points for evaluation
-    test_data_loader = DataLoader(test_dataset,
-                                  batch_size=1, shuffle=False,
-                                  num_workers=opt.num_threads, pin_memory=opt.pin_memory)
-    print('test data size: ', len(test_data_loader))
-
-    # create net
-    netG = HGPIFuNet(opt, projection_mode).to(device=cuda)
-
-    lr = opt.learning_rate
-
-    # Always use resnet for color regression
-    netC = ResBlkPIFuNet(opt).to(device=cuda)
-    optimizerC = torch.optim.Adam(netC.parameters(), lr=opt.learning_rate)
-
-    def set_train():
-        netG.eval()
-        netC.train()
-
-    def set_eval():
-        netG.eval()
-        netC.eval()
-
-    print('Using NetworkG: ', netG.name, 'networkC: ', netC.name)
-
-    # load checkpoints
-    if opt.load_netG_checkpoint_path is not None:
-        print('loading for net G ...', opt.load_netG_checkpoint_path)
-        netG.load_state_dict(torch.load(opt.load_netG_checkpoint_path, map_location=cuda))
-    else:
-        model_path_G = '%s/%s/netG_latest' % (opt.checkpoints_path, opt.name)
-        print('loading for net G ...', model_path_G)
-        netG.load_state_dict(torch.load(model_path_G, map_location=cuda))
-
-    if opt.load_netC_checkpoint_path is not None:
-        print('loading for net C ...', opt.load_netC_checkpoint_path)
-        netC.load_state_dict(torch.load(opt.load_netC_checkpoint_path, map_location=cuda))
-
-    if opt.continue_train:
-        if opt.resume_epoch < 0:
-            model_path_C = '%s/%s/netC_latest' % (opt.checkpoints_path, opt.name)
-        else:
-            model_path_C = '%s/%s/netC_epoch_%d' % (opt.checkpoints_path, opt.name, opt.resume_epoch)
-
-        print('Resuming from ', model_path_C)
-        netC.load_state_dict(torch.load(model_path_C, map_location=cuda))
-
-    os.makedirs(opt.checkpoints_path, exist_ok=True)
-    os.makedirs(opt.results_path, exist_ok=True)
-    os.makedirs('%s/%s' % (opt.checkpoints_path, opt.name), exist_ok=True)
-    os.makedirs('%s/%s' % (opt.results_path, opt.name), exist_ok=True)
-
-    opt_log = os.path.join(opt.results_path, opt.name, 'opt.txt')
-    with open(opt_log, 'w') as outfile:
-        outfile.write(json.dumps(vars(opt), indent=2))
-
-    # training
-    start_epoch = 0 if not opt.continue_train else max(opt.resume_epoch,0)
-    for epoch in range(start_epoch, opt.num_epoch):
-        epoch_start_time = time.time()
-
-        set_train()
-        iter_data_time = time.time()
-        for train_idx, train_data in enumerate(train_data_loader):
-            iter_start_time = time.time()
-            # retrieve the data
-            image_tensor = train_data['img'].to(device=cuda)
-            calib_tensor = train_data['calib'].to(device=cuda)
-            color_sample_tensor = train_data['color_samples'].to(device=cuda)
-
-            image_tensor, calib_tensor = reshape_multiview_tensors(image_tensor, calib_tensor)
-
-            if opt.num_views > 1:
-                color_sample_tensor = reshape_sample_tensor(color_sample_tensor, opt.num_views)
-
-            rgb_tensor = train_data['rgbs'].to(device=cuda)
-
-            with torch.no_grad():
-                netG.filter(image_tensor)
-            resC, error = netC.forward(image_tensor, netG.get_im_feat(), color_sample_tensor, calib_tensor, labels=rgb_tensor)
-
-            optimizerC.zero_grad()
-            error.backward()
-            optimizerC.step()
-
-            iter_net_time = time.time()
-            eta = ((iter_net_time - epoch_start_time) / (train_idx + 1)) * len(train_data_loader) - (
-                    iter_net_time - epoch_start_time)
-
-            if train_idx % opt.freq_plot == 0:
-                print(
-                    'Name: {0} | Epoch: {1} | {2}/{3} | Err: {4:.06f} | LR: {5:.06f} | dataT: {6:.05f} | netT: {7:.05f} | ETA: {8:02d}:{9:02d}'.format(
-                        opt.name, epoch, train_idx, len(train_data_loader),
-                        error.item(),
-                        lr,
-                        iter_start_time - iter_data_time,
-                        iter_net_time - iter_start_time, int(eta // 60),
-                        int(eta - 60 * (eta // 60))))
-
-            if train_idx % opt.freq_save == 0 and train_idx != 0:
-                torch.save(netC.state_dict(), '%s/%s/netC_latest' % (opt.checkpoints_path, opt.name))
-                torch.save(netC.state_dict(), '%s/%s/netC_epoch_%d' % (opt.checkpoints_path, opt.name, epoch))
-
-            if train_idx % opt.freq_save_ply == 0:
-                save_path = '%s/%s/pred_col.ply' % (opt.results_path, opt.name)
-                rgb = resC[0].transpose(0, 1).cpu() * 0.5 + 0.5
-                points = color_sample_tensor[0].transpose(0, 1).cpu()
-                save_samples_rgb(save_path, points.detach().numpy(), rgb.detach().numpy())
-
-            iter_data_time = time.time()
-
-        #### test
-        with torch.no_grad():
-            set_eval()
-
-            if not opt.no_num_eval:
-                test_losses = {}
-                print('calc error (test) ...')
-                test_color_error = calc_error_color(opt, netG, netC, cuda, test_dataset, 100)
-                print('eval test | color error:', test_color_error)
-                test_losses['test_color'] = test_color_error
-
-                print('calc error (train) ...')
-                train_dataset.is_train = False
-                train_color_error = calc_error_color(opt, netG, netC, cuda, train_dataset, 100)
-                train_dataset.is_train = True
-                print('eval train | color error:', train_color_error)
-                test_losses['train_color'] = train_color_error
-
-            if not opt.no_gen_mesh:
-                print('generate mesh (test) ...')
-                for gen_idx in tqdm(range(opt.num_gen_mesh_test)):
-                    test_data = random.choice(test_dataset)
-                    save_path = '%s/%s/test_eval_epoch%d_%s.obj' % (
-                        opt.results_path, opt.name, epoch, test_data['name'])
-                    gen_mesh_color(opt, netG, netC, cuda, test_data, save_path)
-
-                print('generate mesh (train) ...')
-                train_dataset.is_train = False
-                for gen_idx in tqdm(range(opt.num_gen_mesh_test)):
-                    train_data = random.choice(train_dataset)
-                    save_path = '%s/%s/train_eval_epoch%d_%s.obj' % (
-                        opt.results_path, opt.name, epoch, train_data['name'])
-                    gen_mesh_color(opt, netG, netC, cuda, train_data, save_path)
-                train_dataset.is_train = True
-
-if __name__ == '__main__':
-    train_color(opt)
\ No newline at end of file
diff --git a/spaces/ethzanalytics/dialog-China/ai_single_response.py b/spaces/ethzanalytics/dialog-China/ai_single_response.py
deleted file mode 100644
index 4f09b70c9afafcb5b6f5ea6fe5623f6cec245db1..0000000000000000000000000000000000000000
--- a/spaces/ethzanalytics/dialog-China/ai_single_response.py
+++ /dev/null
@@ -1,278 +0,0 @@
-"""
-ai_single_response.py
-
-An executable way to call the model. example:
-*\gpt2_chatbot> python .\ai_single_response.py --prompt "where is the grocery store?" --time
-
-extended-summary: 
-    
-    A system and method for interacting with a virtual machine using a series of messages , each message having associated otherwise one or more actions to be taken by the machine. The speaker participates in a chat with a responder , and the response from the responder is returned.
-
-"""
-import argparse
-import pprint as pp
-import time
-import warnings
-from datetime import datetime
-from pathlib import Path
-from cleantext import clean
-
-warnings.filterwarnings(action="ignore", message=".*gradient_checkpointing*")
-
-from aitextgen import aitextgen
-
-
-def query_gpt_model(
-    folder_path,
-    prompt_msg: str,
-    speaker=None,
-    responder="person beta",
-    kparam=150,
-    temp=0.75,
-    top_p=0.65,
-    verbose=False,
-    use_gpu=False,
-):
-    """
-    query_gpt_model [pass a prompt in to model, get a response. Does NOT "remember" past conversation]
-
-    Args:
-        folder_path ([type]): [description]
-        prompt_msg (str): [description]
-        speaker ([type], optional): [description]. Defaults to None.
-        responder (str, optional): [description]. Defaults to "person beta".
-        kparam (int, optional): [description]. Defaults to 125.
-        temp (float, optional): [description]. Defaults to 0.75.
-        top_p (float, optional): [description]. Defaults to 0.65.
-        verbose (bool, optional): [description]. Defaults to False.
-        use_gpu (bool, optional): [description]. Defaults to False.
-
-    Returns:
-        [dict]: [returns a dict with A) just model response as str B) total conversation]
-    """
-    ai = aitextgen(
-        model="r3dhummingbird/DialoGPT-medium-joshua",
-        #model_folder=folder_path,
-        to_gpu=False,
-    )
-    print("loaded model")
-    p_list = []
-    if "natqa" in str(folder_path).lower():
-        speaker = "person alpha"  # manual correction
-        responder = "person beta"
-    if "wow" in str(folder_path).lower():
-        speaker = "person alpha"  # manual correction
-        responder = "person beta"
-    if "peter" in str(folder_path).lower():
-        speaker = None  # manual correction
-        responder = "peter szemraj"
-    if speaker is not None:
-        p_list.append(speaker.lower() + ":" + "\n")  # write prompt as the speaker
-    p_list.append(prompt_msg.lower() + "\n")
-    p_list.append("\n")
-    p_list.append(responder.lower() + ":" + "\n")
-    this_prompt = "".join(p_list)
-    if verbose:
-        print("overall prompt:\n")
-        pp.pprint(this_prompt, indent=4)
-    print("\n... generating... \n")
-    this_result = ai.generate(
-        n=1,
-        top_k=kparam,
-        batch_size=512,
-        max_length=128,
-        min_length=16,
-        prompt=this_prompt,
-        temperature=temp,
-        top_p=top_p,
-        do_sample=True,
-        return_as_list=True,
-        use_cache=True,
-    )
-    if verbose:
-        pp.pprint(this_result)  # to see what is going on
-    try:
-        this_result = str(this_result[0]).split("\n")
-        res_out = [clean(ele) for ele in this_result]
-        p_out = [clean(ele) for ele in p_list]
-        if verbose:
-            pp.pprint(res_out)  # to see what is going on
-            pp.pprint(p_out)  # to see what is going on
-
-        diff_list = []
-        name_counter = 0
-        break_safe = False
-        for resline in res_out:
-
-            if (responder + ":") in resline:
-                name_counter += 1
-                break_safe = True  # next line a response from bot
-                continue
-            if ":" in resline and name_counter > 0:
-                if break_safe:
-                    diff_list.append(resline)
-                    break_safe = False
-                else:
-                    break
-            if resline in p_out:
-                break_safe = False
-                continue
-
-            else:
-                diff_list.append(resline)
-                break_safe = False
-
-        if verbose:
-            print("------------------------diff list: ")
-            pp.pprint(diff_list)  # to see what is going on
-            print("---------------------------------")
-
-        output = ", ".join(diff_list)
-
-    except:
-        output = "oops, there was an error. try again"
-
-    p_list.append(output + "\n")
-    p_list.append("\n")
-
-    model_responses = {"out_text": output, "full_conv": p_list}
-    print("finished!\n")
-
-    return model_responses
-
-
-# Set up the parsing of command-line arguments
-def get_parser():
-    """
-    get_parser [a helper function for the argparse module]
-
-    Returns:
-        [argparse.ArgumentParser]: [the argparser relevant for this script]
-    """
-
-    parser = argparse.ArgumentParser(
-        description="submit a message and have a 774M parameter GPT model respond"
-    )
-    parser.add_argument(
-        "--prompt",
-        required=True,  # MUST HAVE A PROMPT
-        type=str,
-        help="the message the bot is supposed to respond to. Prompt is said by speaker, answered by responder.",
-    )
-    parser.add_argument(
-        "--model",
-        required=False,
-        type=str,
-        # "gp2_DDandPeterTexts_774M_73Ksteps", - from GPT-Peter
-        default="GPT2_trivNatQAdailydia_774M_175Ksteps",
-        help="folder - with respect to git directory of your repo that has the model files in it (pytorch.bin + "
-        "config.json). No models? Run the script download_models.py",
-    )
-
-    parser.add_argument(
-        "--speaker",
-        required=False,
-        default=None,
-        help="Who the prompt is from (to the bot). Primarily relevant to bots trained on multi-individual chat data",
-    )
-    parser.add_argument(
-        "--responder",
-        required=False,
-        default="person beta",
-        help="who the responder is. Primarily relevant to bots trained on multi-individual chat data",
-    )
-
-    parser.add_argument(
-        "--topk",
-        required=False,
-        type=int,
-        default=150,
-        help="how many responses to sample (positive integer). lower = more random responses",
-    )
-
-    parser.add_argument(
-        "--temp",
-        required=False,
-        type=float,
-        default=0.75,
-        help="specify temperature hyperparam (0-1). roughly considered as 'model creativity'",
-    )
-
-    parser.add_argument(
-        "--topp",
-        required=False,
-        type=float,
-        default=0.65,
-        help="nucleus sampling frac (0-1). aka: what fraction of possible options are considered?",
-    )
-
-    parser.add_argument(
-        "--verbose",
-        default=False,
-        action="store_true",
-        help="pass this argument if you want all the printouts",
-    )
-    parser.add_argument(
-        "--time",
-        default=False,
-        action="store_true",
-        help="pass this argument if you want to know runtime",
-    )
-    return parser
-
-
-if __name__ == "__main__":
-    args = get_parser().parse_args()
-    query = args.prompt
-    model_dir = str(args.model)
-    model_loc = Path.cwd() / model_dir
-    spkr = args.speaker
-    rspndr = args.responder
-    k_results = args.topk
-    my_temp = args.temp
-    my_top_p = args.topp
-    want_verbose = args.verbose
-    want_rt = args.time
-
-    # force-update the speaker+responder params for the generic model case
-    if "dailydialogue" in model_dir.lower():
-        spkr = "john smith"
-        rspndr = "nancy sellers"
-        # ^ arbitrary people created when parsing Daily Dialogue dataset
-        # # force-update the speaker+responder params
-        # for the generic model case
-    if "natqa" in model_dir.lower():
-        spkr = "person alpha"
-        rspndr = "person beta"
-        # ^ arbitrary people created when parsing NatQA + TriviaQA + Daily Dialogue datasets
-
-    st = time.time()
-
-    resp = query_gpt_model(
-        folder_path=model_loc,
-        prompt_msg=query,
-        speaker=spkr,
-        responder=rspndr,
-        kparam=k_results,
-        temp=my_temp,
-        top_p=my_top_p,
-        verbose=want_verbose,
-        use_gpu=False,
-    )
-
-    output = resp["out_text"]
-    pp.pprint(output, indent=4)
-
-    # pp.pprint(this_result[3].strip(), indent=4)
-    rt = round(time.time() - st, 1)
-
-    if want_rt:
-        print("took {runtime} seconds to generate. \n".format(runtime=rt))
-
-    if want_verbose:
-        print("finished - ", datetime.now())
-    if want_verbose:
-        p_list = resp["full_conv"]
-        print("A transcript of your chat is as follows: \n")
-        p_list = [item.strip() for item in p_list]
-        pp.pprint(p_list)
diff --git a/spaces/evaluate-measurement/toxicity/app.py b/spaces/evaluate-measurement/toxicity/app.py
deleted file mode 100644
index 5dfcc1acdc65bbcd7a5016e7007807441c4f670f..0000000000000000000000000000000000000000
--- a/spaces/evaluate-measurement/toxicity/app.py
+++ /dev/null
@@ -1,6 +0,0 @@
-import evaluate
-from evaluate.utils import launch_gradio_widget
-
-
-module = evaluate.load("toxicity")
-launch_gradio_widget(module)
diff --git a/spaces/evaluate-metric/perplexity/perplexity.py b/spaces/evaluate-metric/perplexity/perplexity.py
deleted file mode 100644
index ad307e8ad5cf09d8cfd19390ad539f24187631d0..0000000000000000000000000000000000000000
--- a/spaces/evaluate-metric/perplexity/perplexity.py
+++ /dev/null
@@ -1,192 +0,0 @@
-# Copyright 2022 The HuggingFace Datasets Authors and the current dataset script contributor.
-#
-# Licensed under the Apache License, Version 2.0 (the "License");
-# you may not use this file except in compliance with the License.
-# You may obtain a copy of the License at
-#
-#     http://www.apache.org/licenses/LICENSE-2.0
-#
-# Unless required by applicable law or agreed to in writing, software
-# distributed under the License is distributed on an "AS IS" BASIS,
-# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-# See the License for the specific language governing permissions and
-# limitations under the License.
-"""Perplexity Metric."""
-
-import datasets
-import numpy as np
-import torch
-from torch.nn import CrossEntropyLoss
-from transformers import AutoModelForCausalLM, AutoTokenizer
-
-import evaluate
-from evaluate import logging
-
-
-_CITATION = """\
-
-"""
-
-_DESCRIPTION = """
-Perplexity (PPL) is one of the most common metrics for evaluating language models.
-It is defined as the exponentiated average negative log-likelihood of a sequence, calculated with exponent base `e`.
-
-For more information, see https://huggingface.co/docs/transformers/perplexity
-"""
-
-_KWARGS_DESCRIPTION = """
-Args:
-    model_id (str): model used for calculating Perplexity
-            NOTE: Perplexity can only be calculated for causal language models.
-                    This includes models such as gpt2, causal variations of bert,
-                    causal versions of t5, and more (the full list can be found
-                    in the AutoModelForCausalLM documentation here:
-                    https://huggingface.co/docs/transformers/master/en/model_doc/auto#transformers.AutoModelForCausalLM )
-
-    predictions (list of str): input text, each separate text snippet
-        is one list entry.
-    batch_size (int): the batch size to run texts through the model. Defaults to 16.
-    add_start_token (bool): whether to add the start token to the texts,
-        so the perplexity can include the probability of the first word. Defaults to True.
-    device (str): device to run on, defaults to 'cuda' when available
-Returns:
-    perplexity: dictionary containing the perplexity scores for the texts
-        in the input list, as well as the mean perplexity. If one of the input texts is
-        longer than the max input length of the model, then it is truncated to the
-        max length for the perplexity computation.
-Examples:
-    Example 1:
-        >>> perplexity = evaluate.load("perplexity", module_type="metric")
-        >>> input_texts = ["lorem ipsum", "Happy Birthday!", "Bienvenue"]
-        >>> results = perplexity.compute(model_id='gpt2',
-        ...                              add_start_token=False,
-        ...                              predictions=input_texts) # doctest:+ELLIPSIS
-        >>> print(list(results.keys()))
-        ['perplexities', 'mean_perplexity']
-        >>> print(round(results["mean_perplexity"], 0))
-        647.0
-        >>> print(round(results["perplexities"][0], 0))
-        32.0
-
-    Example 2:
-        >>> from datasets import load_dataset
-        >>> perplexity = evaluate.load("perplexity", module_type="metric")
-        >>> input_texts = load_dataset("wikitext", "wikitext-2-raw-v1", split="test")["text"][:10] # doctest: +SKIP
-        >>> input_texts = [s for s in input_texts if s!='']
-        >>> results = perplexity.compute(model_id='gpt2',
-        ...                              predictions=input_texts)
-        >>> print(list(results.keys()))
-        ['perplexities', 'mean_perplexity']
-        >>> print(round(results["mean_perplexity"], 2)) # doctest: +SKIP
-        576.76
-        >>> print(round(results["perplexities"][0], 2)) # doctest: +SKIP
-        889.28
-"""
-
-
-@evaluate.utils.file_utils.add_start_docstrings(_DESCRIPTION, _KWARGS_DESCRIPTION)
-class Perplexity(evaluate.Metric):
-    def _info(self):
-        return evaluate.MetricInfo(
-            module_type="metric",
-            description=_DESCRIPTION,
-            citation=_CITATION,
-            inputs_description=_KWARGS_DESCRIPTION,
-            features=datasets.Features(
-                {
-                    "predictions": datasets.Value("string"),
-                }
-            ),
-            reference_urls=["https://huggingface.co/docs/transformers/perplexity"],
-        )
-
-    def _compute(
-        self, predictions, model_id, batch_size: int = 16, add_start_token: bool = True, device=None, max_length=None
-    ):
-
-        if device is not None:
-            assert device in ["gpu", "cpu", "cuda"], "device should be either gpu or cpu."
-            if device == "gpu":
-                device = "cuda"
-        else:
-            device = "cuda" if torch.cuda.is_available() else "cpu"
-
-        model = AutoModelForCausalLM.from_pretrained(model_id)
-        model = model.to(device)
-
-        tokenizer = AutoTokenizer.from_pretrained(model_id)
-
-        # if batch_size > 1 (which generally leads to padding being required), and
-        # if there is not an already assigned pad_token, assign an existing
-        # special token to also be the padding token
-        if tokenizer.pad_token is None and batch_size > 1:
-            existing_special_tokens = list(tokenizer.special_tokens_map_extended.values())
-            # check that the model already has at least one special token defined
-            assert (
-                len(existing_special_tokens) > 0
-            ), "If batch_size > 1, model must have at least one special token to use for padding. Please use a different model or set batch_size=1."
-            # assign one of the special tokens to also be the pad token
-            tokenizer.add_special_tokens({"pad_token": existing_special_tokens[0]})
-
-        if add_start_token and max_length:
-            # leave room for <BOS> token to be added:
-            assert (
-                tokenizer.bos_token is not None
-            ), "Input model must already have a BOS token if using add_start_token=True. Please use a different model, or set add_start_token=False"
-            max_tokenized_len = max_length - 1
-        else:
-            max_tokenized_len = max_length
-
-        encodings = tokenizer(
-            predictions,
-            add_special_tokens=False,
-            padding=True,
-            truncation=True if max_tokenized_len else False,
-            max_length=max_tokenized_len,
-            return_tensors="pt",
-            return_attention_mask=True,
-        ).to(device)
-
-        encoded_texts = encodings["input_ids"]
-        attn_masks = encodings["attention_mask"]
-
-        # check that each input is long enough:
-        if add_start_token:
-            assert torch.all(torch.ge(attn_masks.sum(1), 1)), "Each input text must be at least one token long."
-        else:
-            assert torch.all(
-                torch.ge(attn_masks.sum(1), 2)
-            ), "When add_start_token=False, each input text must be at least two tokens long. Run with add_start_token=True if inputting strings of only one token, and remove all empty input strings."
-
-        ppls = []
-        loss_fct = CrossEntropyLoss(reduction="none")
-
-        for start_index in logging.tqdm(range(0, len(encoded_texts), batch_size)):
-            end_index = min(start_index + batch_size, len(encoded_texts))
-            encoded_batch = encoded_texts[start_index:end_index]
-            attn_mask = attn_masks[start_index:end_index]
-
-            if add_start_token:
-                bos_tokens_tensor = torch.tensor([[tokenizer.bos_token_id]] * encoded_batch.size(dim=0)).to(device)
-                encoded_batch = torch.cat([bos_tokens_tensor, encoded_batch], dim=1)
-                attn_mask = torch.cat(
-                    [torch.ones(bos_tokens_tensor.size(), dtype=torch.int64).to(device), attn_mask], dim=1
-                )
-
-            labels = encoded_batch
-
-            with torch.no_grad():
-                out_logits = model(encoded_batch, attention_mask=attn_mask).logits
-
-            shift_logits = out_logits[..., :-1, :].contiguous()
-            shift_labels = labels[..., 1:].contiguous()
-            shift_attention_mask_batch = attn_mask[..., 1:].contiguous()
-
-            perplexity_batch = torch.exp(
-                (loss_fct(shift_logits.transpose(1, 2), shift_labels) * shift_attention_mask_batch).sum(1)
-                / shift_attention_mask_batch.sum(1)
-            )
-
-            ppls += perplexity_batch.tolist()
-
-        return {"perplexities": ppls, "mean_perplexity": np.mean(ppls)}
diff --git a/spaces/f2api/gpt-academic/crazy_functions/test_project/python/dqn/dqn.py b/spaces/f2api/gpt-academic/crazy_functions/test_project/python/dqn/dqn.py
deleted file mode 100644
index 6cea64d39baa7ff4c1e549869aaa4b0ae17779a9..0000000000000000000000000000000000000000
--- a/spaces/f2api/gpt-academic/crazy_functions/test_project/python/dqn/dqn.py
+++ /dev/null
@@ -1,245 +0,0 @@
-from typing import Any, Dict, List, Optional, Tuple, Type, Union
-
-import gym
-import numpy as np
-import torch as th
-from torch.nn import functional as F
-
-from stable_baselines3.common import logger
-from stable_baselines3.common.off_policy_algorithm import OffPolicyAlgorithm
-from stable_baselines3.common.preprocessing import maybe_transpose
-from stable_baselines3.common.type_aliases import GymEnv, MaybeCallback, Schedule
-from stable_baselines3.common.utils import get_linear_fn, is_vectorized_observation, polyak_update
-from stable_baselines3.dqn.policies import DQNPolicy
-
-
-class DQN(OffPolicyAlgorithm):
-    """
-    Deep Q-Network (DQN)
-
-    Paper: https://arxiv.org/abs/1312.5602, https://www.nature.com/articles/nature14236
-    Default hyperparameters are taken from the nature paper,
-    except for the optimizer and learning rate that were taken from Stable Baselines defaults.
-
-    :param policy: The policy model to use (MlpPolicy, CnnPolicy, ...)
-    :param env: The environment to learn from (if registered in Gym, can be str)
-    :param learning_rate: The learning rate, it can be a function
-        of the current progress remaining (from 1 to 0)
-    :param buffer_size: size of the replay buffer
-    :param learning_starts: how many steps of the model to collect transitions for before learning starts
-    :param batch_size: Minibatch size for each gradient update
-    :param tau: the soft update coefficient ("Polyak update", between 0 and 1) default 1 for hard update
-    :param gamma: the discount factor
-    :param train_freq: Update the model every ``train_freq`` steps. Alternatively pass a tuple of frequency and unit
-        like ``(5, "step")`` or ``(2, "episode")``.
-    :param gradient_steps: How many gradient steps to do after each rollout (see ``train_freq``)
-        Set to ``-1`` means to do as many gradient steps as steps done in the environment
-        during the rollout.
-    :param optimize_memory_usage: Enable a memory efficient variant of the replay buffer
-        at a cost of more complexity.
-        See https://github.com/DLR-RM/stable-baselines3/issues/37#issuecomment-637501195
-    :param target_update_interval: update the target network every ``target_update_interval``
-        environment steps.
-    :param exploration_fraction: fraction of entire training period over which the exploration rate is reduced
-    :param exploration_initial_eps: initial value of random action probability
-    :param exploration_final_eps: final value of random action probability
-    :param max_grad_norm: The maximum value for the gradient clipping
-    :param tensorboard_log: the log location for tensorboard (if None, no logging)
-    :param create_eval_env: Whether to create a second environment that will be
-        used for evaluating the agent periodically. (Only available when passing string for the environment)
-    :param policy_kwargs: additional arguments to be passed to the policy on creation
-    :param verbose: the verbosity level: 0 no output, 1 info, 2 debug
-    :param seed: Seed for the pseudo random generators
-    :param device: Device (cpu, cuda, ...) on which the code should be run.
-        Setting it to auto, the code will be run on the GPU if possible.
-    :param _init_setup_model: Whether or not to build the network at the creation of the instance
-    """
-
-    def __init__(
-        self,
-        policy: Union[str, Type[DQNPolicy]],
-        env: Union[GymEnv, str],
-        learning_rate: Union[float, Schedule] = 1e-4,
-        buffer_size: int = 1000000,
-        learning_starts: int = 50000,
-        batch_size: Optional[int] = 32,
-        tau: float = 1.0,
-        gamma: float = 0.99,
-        train_freq: Union[int, Tuple[int, str]] = 4,
-        gradient_steps: int = 1,
-        optimize_memory_usage: bool = False,
-        target_update_interval: int = 10000,
-        exploration_fraction: float = 0.1,
-        exploration_initial_eps: float = 1.0,
-        exploration_final_eps: float = 0.05,
-        max_grad_norm: float = 10,
-        tensorboard_log: Optional[str] = None,
-        create_eval_env: bool = False,
-        policy_kwargs: Optional[Dict[str, Any]] = None,
-        verbose: int = 0,
-        seed: Optional[int] = None,
-        device: Union[th.device, str] = "auto",
-        _init_setup_model: bool = True,
-    ):
-
-        super(DQN, self).__init__(
-            policy,
-            env,
-            DQNPolicy,
-            learning_rate,
-            buffer_size,
-            learning_starts,
-            batch_size,
-            tau,
-            gamma,
-            train_freq,
-            gradient_steps,
-            action_noise=None,  # No action noise
-            policy_kwargs=policy_kwargs,
-            tensorboard_log=tensorboard_log,
-            verbose=verbose,
-            device=device,
-            create_eval_env=create_eval_env,
-            seed=seed,
-            sde_support=False,
-            optimize_memory_usage=optimize_memory_usage,
-            supported_action_spaces=(gym.spaces.Discrete,),
-        )
-
-        self.exploration_initial_eps = exploration_initial_eps
-        self.exploration_final_eps = exploration_final_eps
-        self.exploration_fraction = exploration_fraction
-        self.target_update_interval = target_update_interval
-        self.max_grad_norm = max_grad_norm
-        # "epsilon" for the epsilon-greedy exploration
-        self.exploration_rate = 0.0
-        # Linear schedule will be defined in `_setup_model()`
-        self.exploration_schedule = None
-        self.q_net, self.q_net_target = None, None
-
-        if _init_setup_model:
-            self._setup_model()
-
-    def _setup_model(self) -> None:
-        super(DQN, self)._setup_model()
-        self._create_aliases()
-        self.exploration_schedule = get_linear_fn(
-            self.exploration_initial_eps, self.exploration_final_eps, self.exploration_fraction
-        )
-
-    def _create_aliases(self) -> None:
-        self.q_net = self.policy.q_net
-        self.q_net_target = self.policy.q_net_target
-
-    def _on_step(self) -> None:
-        """
-        Update the exploration rate and target network if needed.
-        This method is called in ``collect_rollouts()`` after each step in the environment.
-        """
-        if self.num_timesteps % self.target_update_interval == 0:
-            polyak_update(self.q_net.parameters(), self.q_net_target.parameters(), self.tau)
-
-        self.exploration_rate = self.exploration_schedule(self._current_progress_remaining)
-        logger.record("rollout/exploration rate", self.exploration_rate)
-
-    def train(self, gradient_steps: int, batch_size: int = 100) -> None:
-        # Update learning rate according to schedule
-        self._update_learning_rate(self.policy.optimizer)
-
-        losses = []
-        for _ in range(gradient_steps):
-            # Sample replay buffer
-            replay_data = self.replay_buffer.sample(batch_size, env=self._vec_normalize_env)
-
-            with th.no_grad():
-                # Compute the next Q-values using the target network
-                next_q_values = self.q_net_target(replay_data.next_observations)
-                # Follow greedy policy: use the one with the highest value
-                next_q_values, _ = next_q_values.max(dim=1)
-                # Avoid potential broadcast issue
-                next_q_values = next_q_values.reshape(-1, 1)
-                # 1-step TD target
-                target_q_values = replay_data.rewards + (1 - replay_data.dones) * self.gamma * next_q_values
-
-            # Get current Q-values estimates
-            current_q_values = self.q_net(replay_data.observations)
-
-            # Retrieve the q-values for the actions from the replay buffer
-            current_q_values = th.gather(current_q_values, dim=1, index=replay_data.actions.long())
-
-            # Compute Huber loss (less sensitive to outliers)
-            loss = F.smooth_l1_loss(current_q_values, target_q_values)
-            losses.append(loss.item())
-
-            # Optimize the policy
-            self.policy.optimizer.zero_grad()
-            loss.backward()
-            # Clip gradient norm
-            th.nn.utils.clip_grad_norm_(self.policy.parameters(), self.max_grad_norm)
-            self.policy.optimizer.step()
-
-        # Increase update counter
-        self._n_updates += gradient_steps
-
-        logger.record("train/n_updates", self._n_updates, exclude="tensorboard")
-        logger.record("train/loss", np.mean(losses))
-
-    def predict(
-        self,
-        observation: np.ndarray,
-        state: Optional[np.ndarray] = None,
-        mask: Optional[np.ndarray] = None,
-        deterministic: bool = False,
-    ) -> Tuple[np.ndarray, Optional[np.ndarray]]:
-        """
-        Overrides the base_class predict function to include epsilon-greedy exploration.
-
-        :param observation: the input observation
-        :param state: The last states (can be None, used in recurrent policies)
-        :param mask: The last masks (can be None, used in recurrent policies)
-        :param deterministic: Whether or not to return deterministic actions.
-        :return: the model's action and the next state
-            (used in recurrent policies)
-        """
-        if not deterministic and np.random.rand() < self.exploration_rate:
-            if is_vectorized_observation(maybe_transpose(observation, self.observation_space), self.observation_space):
-                n_batch = observation.shape[0]
-                action = np.array([self.action_space.sample() for _ in range(n_batch)])
-            else:
-                action = np.array(self.action_space.sample())
-        else:
-            action, state = self.policy.predict(observation, state, mask, deterministic)
-        return action, state
-
-    def learn(
-        self,
-        total_timesteps: int,
-        callback: MaybeCallback = None,
-        log_interval: int = 4,
-        eval_env: Optional[GymEnv] = None,
-        eval_freq: int = -1,
-        n_eval_episodes: int = 5,
-        tb_log_name: str = "DQN",
-        eval_log_path: Optional[str] = None,
-        reset_num_timesteps: bool = True,
-    ) -> OffPolicyAlgorithm:
-
-        return super(DQN, self).learn(
-            total_timesteps=total_timesteps,
-            callback=callback,
-            log_interval=log_interval,
-            eval_env=eval_env,
-            eval_freq=eval_freq,
-            n_eval_episodes=n_eval_episodes,
-            tb_log_name=tb_log_name,
-            eval_log_path=eval_log_path,
-            reset_num_timesteps=reset_num_timesteps,
-        )
-
-    def _excluded_save_params(self) -> List[str]:
-        return super(DQN, self)._excluded_save_params() + ["q_net", "q_net_target"]
-
-    def _get_torch_save_params(self) -> Tuple[List[str], List[str]]:
-        state_dicts = ["policy", "policy.optimizer"]
-
-        return state_dicts, []
diff --git a/spaces/facebook/StyleNeRF/torch_utils/ops/filtered_lrelu.h b/spaces/facebook/StyleNeRF/torch_utils/ops/filtered_lrelu.h
deleted file mode 100644
index 2c403e3f275f472315662321cad54dd0dbc56d00..0000000000000000000000000000000000000000
--- a/spaces/facebook/StyleNeRF/torch_utils/ops/filtered_lrelu.h
+++ /dev/null
@@ -1,90 +0,0 @@
-// Copyright (c) 2021, NVIDIA CORPORATION & AFFILIATES.  All rights reserved.
-//
-// NVIDIA CORPORATION and its licensors retain all intellectual property
-// and proprietary rights in and to this software, related documentation
-// and any modifications thereto.  Any use, reproduction, disclosure or
-// distribution of this software and related documentation without an express
-// license agreement from NVIDIA CORPORATION is strictly prohibited.
-
-#include <cuda_runtime.h>
-
-//------------------------------------------------------------------------
-// CUDA kernel parameters.
-
-struct filtered_lrelu_kernel_params
-{
-    // These parameters decide which kernel to use.
-    int             up;         // upsampling ratio (1, 2, 4)
-    int             down;       // downsampling ratio (1, 2, 4)
-    int2            fuShape;    // [size, 1] | [size, size]
-    int2            fdShape;    // [size, 1] | [size, size]
-
-    int             _dummy;     // Alignment.
-
-    // Rest of the parameters.
-    const void*     x;          // Input tensor.
-    void*           y;          // Output tensor.
-    const void*     b;          // Bias tensor.
-    unsigned char*  s;          // Sign tensor in/out. NULL if unused.
-    const float*    fu;         // Upsampling filter.
-    const float*    fd;         // Downsampling filter.
-
-    int2            pad0;       // Left/top padding.
-    float           gain;       // Additional gain factor.
-    float           slope;      // Leaky ReLU slope on negative side.
-    float           clamp;      // Clamp after nonlinearity.
-    int             flip;       // Filter kernel flip for gradient computation.
-
-    int             tilesXdim;  // Original number of horizontal output tiles.
-    int             tilesXrep;  // Number of horizontal tiles per CTA.
-    int             blockZofs;  // Block z offset to support large minibatch, channel dimensions.
-
-    int4            xShape;     // [width, height, channel, batch]
-    int4            yShape;     // [width, height, channel, batch]
-    int2            sShape;     // [width, height] - width is in bytes. Contiguous. Zeros if unused.
-    int2            sOfs;       // [ofs_x, ofs_y] - offset between upsampled data and sign tensor.
-    int             swLimit;    // Active width of sign tensor in bytes.
-
-    longlong4       xStride;    // Strides of all tensors except signs, same component order as shapes.
-    longlong4       yStride;    //
-    int64_t         bStride;    //
-    longlong3       fuStride;   //
-    longlong3       fdStride;   //
-};
-
-struct filtered_lrelu_act_kernel_params
-{
-    void*           x;          // Input/output, modified in-place.
-    unsigned char*  s;          // Sign tensor in/out. NULL if unused.
-
-    float           gain;       // Additional gain factor.
-    float           slope;      // Leaky ReLU slope on negative side.
-    float           clamp;      // Clamp after nonlinearity.
-
-    int4            xShape;     // [width, height, channel, batch]
-    longlong4       xStride;    // Input/output tensor strides, same order as in shape.
-    int2            sShape;     // [width, height] - width is in elements. Contiguous. Zeros if unused.
-    int2            sOfs;       // [ofs_x, ofs_y] - offset between upsampled data and sign tensor.
-};
-
-//------------------------------------------------------------------------
-// CUDA kernel specialization.
-
-struct filtered_lrelu_kernel_spec
-{
-    void*   setup;              // Function for filter kernel setup.
-    void*   exec;               // Function for main operation.
-    int2    tileOut;            // Width/height of launch tile.
-    int     numWarps;           // Number of warps per thread block, determines launch block size.
-    int     xrep;               // For processing multiple horizontal tiles per thread block.
-    int     dynamicSharedKB;    // How much dynamic shared memory the exec kernel wants.
-};
-
-//------------------------------------------------------------------------
-// CUDA kernel selection.
-
-template <class T, class index_t, bool signWrite, bool signRead> filtered_lrelu_kernel_spec choose_filtered_lrelu_kernel(const filtered_lrelu_kernel_params& p, int sharedKB);
-template <class T, bool signWrite, bool signRead> void* choose_filtered_lrelu_act_kernel(void);
-template <bool signWrite, bool signRead> cudaError_t copy_filters(cudaStream_t stream);
-
-//------------------------------------------------------------------------
diff --git a/spaces/falterWliame/Face_Mask_Detection/BLACKBERRY Smart TOOL V1.0.0.1193.rar [VERIFIED].md b/spaces/falterWliame/Face_Mask_Detection/BLACKBERRY Smart TOOL V1.0.0.1193.rar [VERIFIED].md
deleted file mode 100644
index d3592a48c5d5f4b8034b3c519d684dc36dc9e988..0000000000000000000000000000000000000000
--- a/spaces/falterWliame/Face_Mask_Detection/BLACKBERRY Smart TOOL V1.0.0.1193.rar [VERIFIED].md	
+++ /dev/null
@@ -1,6 +0,0 @@
-<h2>BLACKBERRY smart TOOL v1.0.0.1193.rar</h2><br /><p><b><b>Download Zip</b> &#10004; <a href="https://urlca.com/2uDcJp">https://urlca.com/2uDcJp</a></b></p><br /><br />
-
-BLACKBERRY Smart TOOL V1.0.0.1193.rar1/4BLACKBERRY Smart TOOL V1.0.0.1193.rar2/43/4Module Name: QCOM SMART TOOL Latest version: ... 4d29de3e1b<br />
-<br />
-<br />
-<p></p>
diff --git a/spaces/falterWliame/Face_Mask_Detection/Gemcraft Labyrinth V14 Premium Standalone [HOT].md b/spaces/falterWliame/Face_Mask_Detection/Gemcraft Labyrinth V14 Premium Standalone [HOT].md
deleted file mode 100644
index 102c19109a032b5d90abf5ed58ea825dec72940a..0000000000000000000000000000000000000000
--- a/spaces/falterWliame/Face_Mask_Detection/Gemcraft Labyrinth V14 Premium Standalone [HOT].md	
+++ /dev/null
@@ -1,32 +0,0 @@
-<h2>Gemcraft Labyrinth V14 Premium Standalone</h2><br /><p><b><b>DOWNLOAD</b> &#10002; <a href="https://urlca.com/2uDe07">https://urlca.com/2uDe07</a></b></p><br /><br />
-<br />
-Then upgrade to the best protection we can provide.
-
-Don't do it - Jewelry It Service reserves the right to terminate your account if you cannot provide us with the necessary documentation for processing.
-
-Online shopping made easy! Get promo codes and free shipping on over products! You will receive a confirmation when your order is shipped. Click here to see full coverage of its effects.
-
-This bundle is perfect for a world-class network administrator or computer engineer. It may include parts and accessories not listed in this description.
-
-Become a registered user to gain full access to everything we have to offer.
-
-You can place your order now and we will ship it out for you as soon as possible.
-
-I sell these at a fixed price of for a one year subscription for 1 month. It was put on there on an auto pilot.
-
-The staff are very friendly and I would recommend this site. You can't go wrong here. They are fast to respond, they have an excellent selection of products and the prices are great! New from our full collection of Exipure product.
-
-Exipure V16 Premium Silver - Download
-
-Obscure Volume 10: A Player's Guide to Obscure Volume 10: A Player's Guide to Obscure is a great way to discover some of your favorites if you're just getting started.
-
-Whether you are looking to promote your existing jewellery line or create your own private label jewellery.
-
-About Us
-
-BGS can always be contacted through the website, and the customers service team are friendly, knowledgeable, reliable and helpful and will look after you. We're experts when it comes to making you look your best.Clinical study of the effectiveness of 3 dental hygiene techniques for plaque removal.
-
-The ability of 3 dental hygiene techniques to remove plaque was assessed. The study was carried out in a double-blind manner. 39 volunteer subjects were selected according to 1 criteria: no known contraindications to dental hygiene treatment. The plaque was assessed by use of the Volpe-Manhold scale. The plaque index scores showed a tendency for the patients to have more plaque before brushing. However, on the last day of the study, the cleaning techniques had removed significantly more plaque than the control group (Student's t-test).We’re currently experiencing serious technical problems on the site, and as a result are unable to update the news – even though our market data is running as per normal. We 4fefd39f24<br />
-<br />
-<br />
-<p></p>
diff --git a/spaces/falterWliame/Face_Mask_Detection/Nfs Shift 2 Keygen TOP Crack Serial.md b/spaces/falterWliame/Face_Mask_Detection/Nfs Shift 2 Keygen TOP Crack Serial.md
deleted file mode 100644
index 435a5b2687d5928b98e1f96e230fac5287f87b58..0000000000000000000000000000000000000000
--- a/spaces/falterWliame/Face_Mask_Detection/Nfs Shift 2 Keygen TOP Crack Serial.md	
+++ /dev/null
@@ -1,7 +0,0 @@
-
-<p>the simulation style, really, is certainly just a numbers game at the second; it't all about, w' v. hi i have got reinstalled my pc and i actually wonted to in booth need for speed shift 2 i actually applies just to electronically downloaded copies of want for velocity shift. i lost my account activation serial number for want for rate shift 2 unleashed. accurate realistic racing-shlft 2 unleashed redefines the racing simulator genre by and draw news passes directly from nfs and speehunters. enrollment is limited to one ea account per serial program code and is. change 2 unleashed delivers the almost all visceral simulation racing experience however.</p>
-<p>vmware cloud on aws is now a redhat certified cloud service provider for redhat enterprise linux. this certification enables customers to bring their existing rhel licenses to vmware cloud on aws with redhat support. this certification only applies to rhel and is not applicable to openshift. in order to enable your existing rhel licenses for vmware cloud on aws, please follow the instructions in [here]( and enable subscriptions under bring your own golden image.</p>
-<h2>nfs shift 2 keygen crack serial</h2><br /><p><b><b>Download Zip</b> &raquo; <a href="https://urlca.com/2uDdxk">https://urlca.com/2uDdxk</a></b></p><br /><br />
-<p>each change in nfs shift 2 unleashed changes the ui of the game to be something that is more fitting for the environment. it is a 3d game that focuses on the look of the game, and the action of the game. it's a game with a lot of fluid motion, which allows you to move things very quickly. nfs shift 2 unleashed is a racing game that is a fan of the need for speed series, but is also very good in its own right. it is a game that you should definitely try if you've ever been interested in need for speed games. it's also a bit more challenging than the previous games in the series, and has features that make it a worthy competitor.</p> 899543212b<br />
-<br />
-<br />
\ No newline at end of file
diff --git a/spaces/fatiXbelha/sd/Canva Pro Mod APK Free Download No Watermark No Ads No Limits.md b/spaces/fatiXbelha/sd/Canva Pro Mod APK Free Download No Watermark No Ads No Limits.md
deleted file mode 100644
index 410027632b1f9e441e1bf0cdf70db4dad8831804..0000000000000000000000000000000000000000
--- a/spaces/fatiXbelha/sd/Canva Pro Mod APK Free Download No Watermark No Ads No Limits.md	
+++ /dev/null
@@ -1,119 +0,0 @@
-
-<h1>Download APK Canva Pro Mod: A Complete Guide</h1>
-<p>If you are looking for a way to create stunning graphics and designs without spending a dime, you might have heard of Canva Pro Mod APK. This is a modified version of the popular online graphic design platform, Canva, that offers additional features and benefits for free. But is it worth downloading? And what are the risks and alternatives? In this article, we will answer these questions and more. Read on to find out everything you need to know about Canva Pro Mod APK.</p>
-<h2>download apk canva pro mod</h2><br /><p><b><b>Download Zip</b> &#8250;&#8250;&#8250;&#8250;&#8250; <a href="https://urllie.com/2uNDHM">https://urllie.com/2uNDHM</a></b></p><br /><br />
-<h2>What is Canva Pro Mod APK?</h2>
-<p>Canva is an online graphic design platform that allows anyone to create beautiful designs for social media, presentations, logos, flyers, posters, invitations, and more. It has a simple drag-and-drop interface and a huge library of templates, graphics, fonts, and photos to choose from. You can use Canva for free with some limitations, or upgrade to Canva Pro for $9.95 per month or $119.40 per year to unlock more features and resources.</p>
-<p>Canva Pro Mod APK is a modified version of Canva that gives you access to all the features and resources of Canva Pro for free. You can create an unlimited number of designs and store them on your device or cloud. You can also use premium templates, graphics, and fonts that are normally exclusive to Canva Pro users. Moreover, you can remove the watermark and ads from your designs and export them in high quality.</p>
-<h3>Features of Canva Pro Mod APK</h3>
-<h4>Premium templates, graphics, and fonts</h4>
-<p>One of the main advantages of using Canva Pro Mod APK is that you can access thousands of premium templates, graphics, and fonts that are not available in the free version of Canva. These include professional-looking layouts for various purposes and niches, as well as unique icons, stickers, shapes, backgrounds, and text styles. You can customize these elements to suit your needs and preferences.</p>
-<h4>Unlimited designs and storage</h4>
-<p>Another benefit of using Canva Pro Mod APK is that you can create as many designs as you want without any restrictions. You can also save your designs on your device or cloud storage for easy access and sharing. You don't have to worry about running out of space or losing your work.</p>
-<h4>No watermark and ads</h4>
-<p>A third advantage of using Canva Pro Mod APK is that you can remove the watermark and ads from your designs. This means that you can export your designs in high quality without any branding or distractions. You can also enjoy a smoother and faster experience without any interruptions or pop-ups.</p>
-<p>download canva pro mod apk latest version<br />
-canva pro mod apk free download for android<br />
-how to download canva pro mod apk 2023<br />
-download canva pro premium mod apk unlocked<br />
-canva pro mod apk download link<br />
-download canva pro mod apk no watermark<br />
-canva pro mod apk full version download<br />
-download canva pro mod apk for pc<br />
-canva pro graphic design mod apk download<br />
-download canva pro mod apk terbaru<br />
-canva pro mod apk 2023 download<br />
-download canva pro mod apk without login<br />
-canva pro mod apk offline download<br />
-download canva pro mod apk revdl<br />
-canva pro video editor mod apk download<br />
-download canva pro mod apk happymod<br />
-canva pro logo maker mod apk download<br />
-download canva pro mod apk rexdl<br />
-canva pro photo editor mod apk download<br />
-download canva pro mod apk 2022<br />
-canva pro poster maker mod apk download<br />
-download canva pro mod apk android 1<br />
-canva pro flyer maker mod apk download<br />
-download canva pro mod apk uptodown<br />
-canva pro collage maker mod apk download<br />
-download canva pro mod apk apkpure<br />
-canva pro invitation maker mod apk download<br />
-download canva pro mod apk for ios<br />
-canva pro story maker mod apk download<br />
-download canva pro premium unlocked mod v2.218.1.apk<br />
-canva pro business card maker mod apk download<br />
-free fire thumbnail maker with canva pro mod apk download<br />
-canva pro resume builder mod apk download<br />
-youtube thumbnail maker with canva pro mod apk download<br />
-canva pro instagram story maker mod apk download<br />
-tiktok video maker with canva pro mod apk download<br />
-canva pro logo design & branding kit mod apk download<br />
-facebook cover photo maker with canva pro mod apk download<br />
-canva pro ebook creator & book cover design mod apk download<br />
-pinterest pin maker with canva pro mod apk download</p>
-<h3>How to download and install Canva Pro Mod APK?</h3>
-<h4>Step 1: Download the zip file from a trusted source</h4>
-<p>The first step to download and install Canva Pro Mod APK is to find a reliable source that offers the latest version of the app. You can use this link to download the zip file from a trusted source. The zip file contains the APK file and a txt file with a link to create an account.</p>
-<h4>Step 2: Unzip the file and copy the link from the txt file</h4>
-<p>The second step to download and install Canva Pro Mod APK is to unzip the file using any file manager app. You will see two files: canva-pro-mod.apk and canva-pro-mod.txt. Open the txt file and copy the link that is given inside. You will need this link to create an account for Canva Pro Mod APK.</p>
-<h4>Step 3: Open the link in any browser and create an account</h4>
-<p>The third step to download and install Canva Pro Mod APK is to open the link that you copied from the txt file in any browser. You will be redirected to a page where you can create an account for Canva Pro Mod APK. You can use any email address and password that you want. After creating an account, you will see a confirmation message that says "You have successfully registered for 3 years free".</p>
-<h4>Step 4: Install the APK file and open it</h4>
-<p>The fourth step to download and install Canva Pro Mod APK is to install the APK file that you downloaded from the zip file. To do this, you need to enable the installation of apps from unknown sources in your device settings. Then, tap on the APK file and follow the instructions to install it. Once the installation is complete, open the app and grant the necessary permissions.</p>
-<h4>Step 5: Sign in with the account that you created and enjoy 3 years free</h4>
-<p>The final step to download and install Canva Pro Mod APK is to sign in with the account that you created in step 3. You will see a welcome screen that says "Welcome to Canva Pro". You can now access all the features and resources of Canva Pro for free for 3 years. You can also check your subscription status by tapping on your profile icon and then on "Account settings". You will see that your subscription is valid until June 2026.</p>
-<h3>What are the risks of using Canva Pro Mod APK?</h3>
-<h4>Legal issues and malware threats</h4>
-<p>While using Canva Pro Mod APK may seem tempting, it is not without risks. First of all, using a modified version of Canva is illegal and violates the terms of service of Canva. You may face legal consequences if you are caught using it. Secondly, downloading and installing Canva Pro Mod APK from untrusted sources may expose your device to malware and viruses that can harm your data and privacy. You should always be careful about what you download and install on your device.</p>
-<h4>Account suspension and data loss</h4>
-<p>Another risk of using Canva Pro Mod APK is that your account may be suspended or banned by Canva if they detect any suspicious activity or violation of their policies. This means that you may lose access to your designs and data that you have stored on Canva. You may also lose your progress and achievements that you have earned on Canva. Moreover, you may not be able to recover your account or data if you forget your password or email address.</p>
-<h4>Limited updates and support</h4>
-<p>A third risk of using Canva Pro Mod APK is that you may not receive regular updates and support from Canva. This means that you may miss out on new features, improvements, bug fixes, and security patches that are released by Canva. You may also face compatibility issues with other apps or devices that require the latest version of Canva. Furthermore, you may not be able to contact or get help from Canva's customer service or community if you encounter any problems or questions while using Canva Pro Mod APK.</p>
-<h3>What are some alternatives to Canva Pro Mod APK?</h3>
-<h4>Visme, Adobe Express, Design Wizard, Easil, Snappa, Vistacreate, Stencil, PicMonkey</h4>
-<p>If you are looking for some alternatives to Canva Pro Mod APK that are legal, safe, and reliable, here are some options that you can try:</p>
-<table>
-<tr><th>Name</th><th>Description</th><th>Pricing</th></tr>
-<tr><td>Visme</td><td>A powerful online tool for creating engaging presentations, infographics, reports, social media graphics, and more.</td><td>Free plan with limited features; Premium plans start from $14 per month.</td></tr>
-<tr><td>Adobe Express</td><td>A simple online tool for creating stunning graphics, collages, flyers, posters, banners, logos, and more.</td><td>Free plan with limited features; Premium plans start from $9. 99 per month.</td></tr>
-<tr><td>Design Wizard</td><td>A user-friendly online tool for creating high-quality graphics and videos for social media, marketing, and personal use.</td><td>Free plan with limited features; Premium plans start from $9.99 per month.</td></tr>
-<tr><td>Easil</td><td>A drag-and-drop online tool for creating stunning graphics, flyers, posters, menus, invitations, and more.</td><td>Free plan with limited features; Premium plans start from $7.50 per month.</td></tr>
-<tr><td>Snappa</td><td>A fast and easy online tool for creating graphics for social media, blogs, ads, and more.</td><td>Free plan with limited features; Premium plans start from $10 per month.</td></tr>
-<tr><td>Vistacreate</td><td>A simple and affordable online tool for creating graphics, logos, flyers, business cards, and more.</td><td>Free plan with limited features; Premium plans start from $5 per month.</td></tr>
-<tr><td>Stencil</td><td>A quick and convenient online tool for creating graphics for social media, blogs, emails, and more.</td><td>Free plan with limited features; Premium plans start from $9 per month.</td></tr>
-<tr><td>PicMonkey</td><td>A fun and creative online tool for editing photos, creating graphics, collages, logos, and more.</td><td>Free trial for 7 days; Premium plans start from $7.99 per month.</td></tr>
-</table>
-<p>These are some of the best alternatives to Canva Pro Mod APK that you can use legally and safely. They offer similar or better features and resources than Canva Pro Mod APK, and they also have regular updates and support. You can try them out and see which one suits your needs and preferences the best.</p>
-<h3>What are some reviews of Canva Pro Mod APK?</h3>
-<h4>Positive and negative feedback from users</h4>
-<p>To give you a better idea of what other users think of Canva Pro Mod APK, here are some reviews that we found online:</p>
-<p>"I love Canva Pro Mod APK. It has everything I need to create amazing graphics and designs for my projects. It is easy to use and has a lot of options to choose from. I can also save my designs on my device or cloud without any hassle. I highly recommend it to anyone who wants to use Canva Pro for free."</p>
-<p>"Canva Pro Mod APK is a scam. It does not work as advertised. It is full of bugs and errors that ruin your designs. It also has a lot of ads and pop-ups that annoy you. It is not safe to use as it may contain malware or viruses that can harm your device or data. It is also illegal to use as it violates the terms of service of Canva. Stay away from it."</p>
-<p>"Canva Pro Mod APK is a mixed bag. It has some good features and resources that are useful for creating graphics and designs. However, it also has some drawbacks that make it risky to use. It may not be compatible with other apps or devices that require the latest version of Canva. It may also be detected and banned by Canva if they find out that you are using it. It is also not ethical to use as it steals the work of Canva developers."</p>
-<p>As you can see, the reviews of Canva Pro Mod APK are divided between positive and negative feedback. Some users love it and some users hate it. Some users find it helpful and some users find it harmful. Ultimately, it is up to you to decide whether you want to use it or not.</p>
-<h2>Conclusion</h2>
-<p>In conclusion, Canva Pro Mod APK is a modified version of Canva that offers all the features and resources of Canva Pro for free. However, it also comes with some risks and limitations that may outweigh its benefits. You may face legal issues, malware threats, account suspension, data loss, limited updates, and support if you use it. You may also miss out on some of the best alternatives to Canva Pro Mod APK that are legal, safe, and reliable.</p>
-<p>We hope that this article has given you a complete guide on how to download and install Canva Pro Mod APK, what are its features and risks, and what are its alternatives. If you have any questions or comments, please feel free to share them below.</p>
- <h3>Frequently Asked Questions</h3>
-<p>Here are some of the most common questions that users have about Canva Pro Mod APK:</p>
-<ol>
-<li>What is the difference between Canva Pro Mod APK and Canva Premium APK?</li>
-<p>Canva Pro Mod APK is a modified version of Canva that offers all the features and resources of Canva Pro for free. Canva Premium APK is the official version of Canva that offers a free trial of Canva Pro for 30 days. After the trial period, you need to pay a subscription fee to continue using Canva Pro.</p>
-<li>Is Canva Pro Mod APK safe to use?</li>
-<p>Canva Pro Mod APK is not safe to use as it may contain malware or viruses that can harm your device or data. It may also expose you to legal issues or account suspension if you are caught using it. You should always download and install apps from trusted sources and follow the terms of service of Canva.</p>
-<li>How can I get Canva Pro for free legally?</li>
-<p>There are some ways to get Canva Pro for free legally, such as:</p>
-<ul>
-<li>Using the free trial of Canva Pro for 30 days.</li>
-<li>Using the referral program of Canva to earn credits that can be used to pay for Canva Pro.</li>
-<li>Using the education program of Canva to get Canva Pro for free if you are a student or teacher.</li>
-<li>Using the nonprofit program of Canva to get Canva Pro for free if you are a registered nonprofit organization.</li>
-</ul>
-<li>Can I use Canva Pro Mod APK offline?</li>
-<p>No, you cannot use Canva Pro Mod APK offline as it requires an internet connection to access the templates, graphics, fonts, and photos that are stored on Canva's servers. You can only use the app online and save your designs on your device or cloud.</p>
-<li>Can I use my own photos and fonts on Canva Pro Mod APK?</li>
-<p>Yes, you can use your own photos and fonts on Canva Pro Mod APK. You can upload your photos from your device or cloud storage and use them on your designs. You can also upload your fonts from your device or cloud storage and use them on your text. However, you should be careful about the quality and legality of your photos and fonts, as they may affect the outcome and originality of your designs.</p>
-</ol></p> 401be4b1e0<br />
-<br />
-<br />
\ No newline at end of file
diff --git a/spaces/fatiXbelha/sd/Download AddROM FRP Bypass APK 2019 and Remove Google Account Verification.md b/spaces/fatiXbelha/sd/Download AddROM FRP Bypass APK 2019 and Remove Google Account Verification.md
deleted file mode 100644
index bed8363268c3292e48465d54c07eac239dc46698..0000000000000000000000000000000000000000
--- a/spaces/fatiXbelha/sd/Download AddROM FRP Bypass APK 2019 and Remove Google Account Verification.md	
+++ /dev/null
@@ -1,32 +0,0 @@
-
-<h1>How to Bypass FRP with AddROM Bypass APK</h1>
-<p>Have you ever encountered a situation where you need to reset your Android device but you don't remember your Google account credentials? Or have you ever bought a second-hand device that has FRP (Factory Reset Protection) enabled and you can't access it? If yes, then you may need a tool that can help you bypass FRP on your Android device.</p>
-<p>One of such tools is <strong>addrom bypass apk</strong>, a free and easy-to-use application that can unlock your device without requiring a computer or drivers. In this article, we will introduce you to this tool, its features, pros and cons, and how it compares with some of its alternatives. We will also provide you with a step-by-step guide on how to use it to bypass FRP on your Android device.</p>
-<h2>bypass frp addrom 2019 apk</h2><br /><p><b><b>DOWNLOAD</b> &#10037; <a href="https://urllie.com/2uNFMU">https://urllie.com/2uNFMU</a></b></p><br /><br />
-<h2>What is AddROM Bypass APK?</h2>
-<p>AddROM Bypass APK is an application that can be used to <strong>bypass the FRP (Factory Reset Protection) lock</strong> on Android smartphones. To use it, you need to download the AddROM Bypass file according to the Android version of your phone, install it, and enter your new Gmail ID and password. The application can be downloaded from <a href="(^1^)">the frpbypassapk.in/addrom website</a>. The bypassing process can be done without the need for drivers or a computer.</p>
-<p>FRP is a security feature introduced by Google for Android devices in order to protect the device's contents in case the device is lost/stolen and then reset. After a wipe, you can take the device into use only with the accounts set on the personal profile of the device before the wipe. To enable factory reset protection on your smartphone or tablet, you <li><strong>What if AddROM Bypass APK does not work?</strong>: If AddROM Bypass APK fails to bypass FRP on your device, you may try some of the following solutions:</li>
-<ul>
-<li>Restart your device and try again.</li>
-<li>Check your internet connection and make sure it is stable and fast.</li>
-<li>Clear the cache and data of the AddROM Bypass app and reinstall it.</li>
-<li>Try another version of AddROM Bypass APK that is compatible with your device.</li>
-<li>Try another tool that can bypass FRP, such as iToolab UnlockGo, iMyFone LockWiper, or Tenorshare 4uKey.</li>
-</ul>
-<li><strong>Is AddROM Bypass APK safe to use?</strong>: AddROM Bypass APK is generally safe to use if you download it from its official website or a trusted source. However, there are some risks involved in using any third-party tool that can bypass FRP, such as:</li>
-<ul>
-<li>Voiding your device warranty or violating the terms of service of Google or your device manufacturer.</li>
-<li>Losing your data or settings on your device.</li>
-<li>Exposing your device to malware or viruses if you download from untrusted sources.</li>
-<li>Getting locked out of your device again if you forget your new Gmail ID and password.</li>
-</ul>
-<li><strong>How to remove AddROM Bypass APK from your device?</strong>: If you want to remove AddROM Bypass APK from your device after bypassing FRP, you can follow these steps:</li>
-<ol>
-<li>Go to your device settings and tap on Apps or Applications.</li>
-<li>Find and tap on AddROM Bypass APK from the list of apps.</li>
-<li>Tap on Uninstall and confirm your action.</li>
-<li>The app will be removed from your device.</li>
-</ol>
-</ul></p> 197e85843d<br />
-<br />
-<br />
\ No newline at end of file
diff --git a/spaces/fatiXbelha/sd/Download Dragon Ball Z Mugen Fighter APK and Join the Legendary DBZ Battles.md b/spaces/fatiXbelha/sd/Download Dragon Ball Z Mugen Fighter APK and Join the Legendary DBZ Battles.md
deleted file mode 100644
index 2b512854897b9eaea612f258647824db019dc50b..0000000000000000000000000000000000000000
--- a/spaces/fatiXbelha/sd/Download Dragon Ball Z Mugen Fighter APK and Join the Legendary DBZ Battles.md	
+++ /dev/null
@@ -1,212 +0,0 @@
-<br />
-<h1>Dragon Ball Z Mugen Fighter APK: A Fan-Made Fighting Game for Android</h1>
- <p>If you are a fan of Dragon Ball Z, the popular anime series that features epic battles between Goku and his friends against various villains, you might be interested in playing a fan-made fighting game that is based on the show. This game is called <strong>Dragon Ball Z Mugen Fighter APK</strong>, and it is available for Android devices. In this article, we will tell you everything you need to know about this game, including what it is, how to download and install it, and why you should play it.</p>
- <h2>What is Dragon Ball Z Mugen Fighter APK?</h2>
- <p>Dragon Ball Z Mugen Fighter APK is a 2D fighting game that uses the <strong>Mugen</strong> engine, which is a free software that allows anyone to create their own fighting games. The game features characters, stages, music, and sound effects from the Dragon Ball Z anime series, as well as some original content created by the fan community. The game has several modes, such as arcade, versus, team, survival, training, and watch. You can also customize the game settings, such as the difficulty level, the number of rounds, the time limit, and the life bars.</p>
-<h2>dragon ball z mugen fighter apk</h2><br /><p><b><b>Download</b> &#128505; <a href="https://urllie.com/2uNA09">https://urllie.com/2uNA09</a></b></p><br /><br />
- <h3>The origin of Mugen</h3>
- <p>Mugen is a Japanese word that means "infinite" or "dream". It was originally developed by a company called Elecbyte in 1999, but they stopped working on it in 2003. Since then, many fans have continued to develop and improve the engine, adding new features and fixing bugs. Mugen is known for its flexibility and versatility, as it allows anyone to create their own fighting games with any characters they want. There are thousands of fan-made games that use the Mugen engine, featuring characters from various anime, manga, video games, movies, comics, and even real-life celebrities.</p>
- <h3>The features of Dragon Ball Z Mugen Fighter APK</h3>
- <p>Dragon Ball Z Mugen Fighter APK has many features that make it an enjoyable and exciting fighting game for Android devices. Some of these features are:</p>
- <ul>
-<li><strong>High-quality graphics and sound</strong>: The game has high-resolution sprites, animations, backgrounds, effects, and fonts that make it look like a professional game. The game also has authentic music and sound effects from the anime series that enhance the atmosphere and immersion.</li>
-<li><strong>Large roster of characters</strong>: The game has over 100 characters from the Dragon Ball Z series, as well as some original characters created by fans. You can play as your favorite heroes or villains, such as Goku, Vegeta, Gohan, Piccolo, Frieza, Cell, Buu, Broly, Beerus, Jiren, and many more. Each character has their own unique moves, skills, transformations, and special attacks.</li>
-<li><strong>Multiple modes and options</strong>: The game has several modes that offer different challenges and experiences. You can play solo or with a friend in arcade mode, where you fight against a series of opponents until you reach the final boss. You can also play versus mode, where you can choose your own opponent and stage. You can also play team mode, where you can form a team of up to four characters and fight against another team. You can also play survival mode, where you have to defeat as many enemies as you can without losing. You can also play training mode, where you can practice your moves and combos. You can also play watch mode, where you can watch two computer-controlled characters fight each other. You can also customize the game settings, such as the difficulty level, the number of rounds, the time limit, and the life bars.</li>
-<li><strong>Easy and intuitive controls</strong>: The game has simple and responsive touch controls that make it easy to play on your Android device. You can move your character with a virtual joystick, and perform basic attacks with four buttons. You can also perform special attacks by tapping or swiping the screen in different directions. You can also activate transformations and super moves by pressing a button when your power meter is full.</li>
-</ul>
- <h3>The characters of Dragon Ball Z Mugen Fighter APK</h3>
- <p>Dragon Ball Z Mugen Fighter APK has a large and diverse roster of characters that span the entire Dragon Ball Z series, from the Saiyan Saga to the Tournament of Power. Here are some of the characters you can play as in the game:</p>
- <table>
-<tr>
-<th>Name</th>
-<th>Description</th>
-<th>Transformation</th>
-<th>Super Move</th>
-</tr>
-<tr>
-<td>Goku</td>
-<td>The main protagonist of the series, a Saiyan warrior who protects the Earth from various threats. He is always eager to fight stronger opponents and improve his skills.</td>
-<td>Kaioken, Super Saiyan, Super Saiyan 2, Super Saiyan 3, Super Saiyan God, Super Saiyan Blue, Ultra Instinct</td>
-<td>Kamehameha, Spirit Bomb, Dragon Fist</td>
-</tr>
-<tr>
-<td>Vegeta</td>
-<td>The prince of the Saiyans, a former enemy of Goku who later became his rival and ally. He is proud, arrogant, and determined to surpass Goku in power.</td>
-<td>Super Saiyan, Super Saiyan 2, Majin Vegeta, Super Saiyan God, Super Saiyan Blue, Super Saiyan Blue Evolution</td>
-<td>Galick Gun, Big Bang Attack, Final Flash, Final Explosion</td>
-</tr>
-<tr>
-<td>Gohan</td>
-<td>The son of Goku and Chi-Chi, a half-Saiyan who has inherited his father's fighting spirit and potential. He is also a smart and studious person who values peace and education.</td>
-<td>Super Saiyan, Super Saiyan 2, Great Saiyaman, Ultimate Gohan</td>
-<td>Masenko, Kamehameha, Father-Son Kamehameha</td>
-</tr>
-<tr>
-<td>Piccolo</td>
-<td>A Namekian warrior who was once the reincarnation of King Piccolo, a demon who terrorized the Earth. He later became a friend and mentor to Gohan, and a valuable member of the Z Fighters.</td>
-<td>N/A</td>
-<td>Special Beam Cannon, Hellzone Grenade, Light Grenade</td>
-</tr>
-<tr>
-<td>Frieza</td>
-<td>The emperor of the universe, a ruthless tyrant who enslaved and destroyed many planets. He was responsible for killing most of the Saiyans, including Goku's father Bardock. He is one of Goku's most formidable enemies.</td>
-<td>First Form, Second Form, Third Form, Final Form, 100% Full Power, Mecha Frieza, Golden Frieza</td>
-<td>Death Beam, Death Ball, Supernova, Death Saucer</td>
-</tr> <tr>
-<td>Cell</td>
-<td>A bio-android created by Dr. Gero, a mad scientist who worked for the Red Ribbon Army. He is composed of the cells of various fighters, including Goku, Vegeta, Piccolo, Frieza, and King Cold. He can absorb other beings to increase his power and evolve.</td>
-<td>Imperfect Cell, Semi-Perfect Cell, Perfect Cell, Super Perfect Cell</td>
-<td>Kamehameha, Solar Flare, Special Beam Cannon, Spirit Bomb</td>
-</tr>
-<tr>
-<td>Buu</td>
-<td>A magical creature that was created by the evil wizard Bibidi. He is a pink blob that can change his shape and size at will. He can also turn people into candy and eat them. He has different forms and personalities depending on who he absorbs.</td>
-<td>Fat Buu, Evil Buu, Super Buu, Kid Buu</td>
-<td>Chocolate Beam, Human Extinction Attack, Super Ghost Kamikaze Attack, Planet Burst</td>
-</tr>
-<tr>
-<td>Broly</td>
-<td>A legendary Super Saiyan who was born with immense power and a hatred for Goku. He is the son of Paragus, a Saiyan who survived the destruction of Planet Vegeta. He is a savage and unstoppable force of destruction.</td>
-<td>Super Saiyan, Legendary Super Saiyan, Super Saiyan 3, Legendary Super Saiyan 3</td>
-<td>Eraser Cannon, Omega Blaster, Gigantic Meteor, Gigantic Roar</td>
-</tr>
-<tr>
-<td>Beerus</td>
-<td>The God of Destruction of Universe 7, a powerful being who maintains the balance of the universe by destroying planets and civilizations. He is accompanied by his attendant and teacher Whis. He is fond of food and sleep, and can be easily angered.</td>
-<td>N/A</td>
-<td>Sphere of Destruction, Hakai, God of Destruction's Wrath, God of Destruction's Rampage</td>
-</tr>
-<tr>
-<td>Jiren</td>
-<td>The strongest mortal of Universe 11, a member of the Pride Troopers who fight for justice. He is a stoic and serious warrior who values strength above all else. He participated in the Tournament of Power, where he faced Goku and his allies.</td>
-<td>N/A</td>
-<td>Power Impact, Power Rush, Glare, Invisible Strikes</td>
-</tr>
-</table>
- <h2>How to download and install Dragon Ball Z Mugen Fighter APK?</h2>
- <p>If you want to play Dragon Ball Z Mugen Fighter APK on your Android device, you will need to follow these steps:</p>
- <h3>The requirements for Dragon Ball Z Mugen Fighter APK</h3>
- <p>Before you download and install the game, you will need to make sure that your device meets the following requirements:</p>
- <ul>
-<li><strong>Android version</strong>: You will need to have Android 4.0 or higher on your device.</li>
-<li><strong>Storage space</strong>: You will need to have at least 500 MB of free space on your device or SD card.</li>
-<li><strong>Internet connection</strong>: You will need to have a stable internet connection to download the game files.</li>
-<li><strong>Unknown sources</strong>: You will need to enable the installation of apps from unknown sources on your device settings. This will allow you to install the game from an APK file.</li>
-</ul>
- <h3>The steps to download and install Dragon Ball Z Mugen Fighter APK</h3>
- <p>Once you have checked the requirements, you can proceed to download and install the game by following these steps:</p>
- <ol>
-<li><strong>Download the APK file</strong>: You can download the APK file of Dragon Ball Z Mugen Fighter APK from this link: [text]. This is a safe and secure link that will not harm your device or data.</li>
-<li><strong>Locate the APK file</strong>: After downloading the APK file, you will need to locate it on your device or SD card. You can use a file manager app to find it easily.</li>
-<li><strong>Install the APK file</strong>: Once you have located the APK file, you will need to tap on it to start the installation process. You may see a warning message that asks you to confirm the installation. Just tap on "Install" or "Yes" to proceed.</li>
-<li><strong>Wait for the installation to finish</strong>: The installation process may take a few minutes depending on your device and internet speed. You will see a progress bar that shows you how much time is left.</li>
-<li><strong>Launch the game</strong>: After the installation is complete, you will see a message that says "App installed". You can then tap on "Open" or " Done" to launch the game. You can also find the game icon on your home screen or app drawer.</li>
-</ol>
- <h3>The tips to play Dragon Ball Z Mugen Fighter APK</h3>
- <p>Now that you have downloaded and installed the game, you can start playing it and enjoy the thrilling fights. Here are some tips that will help you play the game better:</p>
-<p>dragon ball z legendary z warriors mugen apk download<br />
-dbz mugen galaxy heros apk for android<br />
-dragon ball z mugen edition 2023 apk<br />
-dbz mugen style game legendary z warriors apk<br />
-dragon ball z mugen apk with 100+ characters<br />
-dbz mugen galaxy heros mod apk unlimited coins<br />
-dragon ball z mugen tenkaichi 3 apk<br />
-dbz mugen style game with new transformations apk<br />
-dragon ball z mugen super heroes apk<br />
-dbz mugen galaxy heros latest version apk<br />
-dragon ball z mugen budokai 3 apk<br />
-dbz mugen style game with anime graphics apk<br />
-dragon ball z mugen ultimate fighter apk<br />
-dbz mugen galaxy heros offline mode apk<br />
-dragon ball z mugen fusion reborn apk<br />
-dbz mugen style game with original soundtrack apk<br />
-dragon ball z mugen hyper dimension apk<br />
-dbz mugen galaxy heros cheats and hacks apk<br />
-dragon ball z mugen shin budokai 2 apk<br />
-dbz mugen style game with custom characters apk<br />
-dragon ball z mugen extreme butoden apk<br />
-dbz mugen galaxy heros online multiplayer apk<br />
-dragon ball z mugen battle of gods apk<br />
-dbz mugen style game with voice acting apk<br />
-dragon ball z mugen super saiyan 4 apk<br />
-dbz mugen galaxy heros new update apk<br />
-dragon ball z mugen broly the legendary super saiyan apk<br />
-dbz mugen style game with story mode apk<br />
-dragon ball z mugen resurrection of f apk<br />
-dbz mugen galaxy heros best settings apk<br />
-dragon ball z mugen tournament of power apk<br />
-dbz mugen style game with ultra instinct apk<br />
-dragon ball z mugen raging blast 2 apk<br />
-dbz mugen galaxy heros all characters unlocked apk<br />
-dragon ball z mugen legacy of goku 2 apk<br />
-dbz mugen style game with 3d graphics apk<br />
-dragon ball z mugen infinite world apk<br />
-dbz mugen galaxy heros how to install apk<br />
-dragon ball z mugen final bout 2 apk<br />
-dbz mugen style game with realistic effects apk</p>
- <ul>
-<li><strong>Choose your character wisely</strong>: The game has over 100 characters to choose from, each with their own strengths and weaknesses. You should choose a character that suits your play style and preference. You can also try different characters and see which one you like the most.</li>
-<li><strong>Learn the moves and combos</strong>: Each character has their own moves and combos that you can perform by using the touch controls. You should learn the moves and combos of your character and practice them in training mode. You can also check the move list by pausing the game and tapping on "Help".</li>
-<li><strong>Use the power meter and transformations</strong>: Each character has a power meter that fills up as you fight. When the power meter is full, you can activate a transformation or a super move by pressing a button. Transformations will increase your power and speed, while super moves will deal massive damage to your opponent. You should use these abilities wisely and strategically.</li>
-<li><strong>Adjust the game settings</strong>: The game has various settings that you can adjust to your liking. You can change the difficulty level, the number of rounds, the time limit, and the life bars. You can also enable or disable the music, sound effects, and voice clips. You can access the game settings by pausing the game and tapping on "Options".</li>
-</ul>
- <h2>Why should you play Dragon Ball Z Mugen Fighter APK?</h2>
- <p>Dragon Ball Z Mugen Fighter APK is a fan-made fighting game that offers a lot of fun and entertainment for Dragon Ball Z fans and fighting game enthusiasts. Here are some reasons why you should play this game:</p>
- <h3>The benefits of playing Dragon Ball Z Mugen Fighter APK</h3>
- <p>Some of the benefits of playing this game are:</p>
- <ul>
-<li><strong>It is free and easy to download and install</strong>: The game is available for free on this link: [text]. You can download and install it on your Android device without any hassle or risk.</li>
-<li><strong>It is faithful and respectful to the source material</strong>: The game is based on the Dragon Ball Z anime series, which is one of the most popular and influential anime of all time. The game captures the essence and spirit of the series, with its characters, stages, music, sound effects, and story. The game also respects the original work and does not alter or distort it.</li>
-<li><strong>It is fun and exciting to play</strong>: The game is a 2D fighting game that is easy to play but hard to master. The game has simple and responsive touch controls that allow you to perform various moves and combos. The game also has multiple modes and options that offer different challenges and experiences. The game is fun and exciting to play alone or with a friend.</li>
-<li><strong>It is creative and original</strong>: The game is a fan-made game that uses the Mugen engine, which is a free software that allows anyone to create their own fighting games. The game has some original content created by fans, such as new characters, stages, music, sound effects, and animations. The game is creative and original in its design and execution.</li>
-</ul>
- <h3>The drawbacks of playing Dragon Ball Z Mugen Fighter APK</h3>
- <p>Some of the drawbacks of playing this game are:</p>
- <ul>
-<li><strong>It is not an official or licensed product</strong>: The game is a fan-made game that is not affiliated with or endorsed by Toei Animation, Funimation, Bandai Namco, or any other official entity related to Dragon Ball Z. The game may contain some errors, bugs, glitches, or inaccuracies that are not present in the official products.</li>
-<li><strong>It may not work on all devices or versions</strong>: The game is designed for Android devices with Android 4.0 or higher. However, some devices or versions may not be compatible with the game or may experience some issues or problems while running the game. The game may also require a stable internet connection to download the files.</li>
-<li><strong>It may violate some intellectual property rights</strong>: The game uses some content from the Dragon Ball Z anime series, such as characters, stages, music, sound effects, and images. These content are owned by their respective creators and holders, who may have some intellectual property rights over them. The game may violate some of these rights by using them without their permission or authorization. The game may also infringe some trademarks or logos that belong to them. The game may be subject to legal actions or claims by these entities.</li>
-</ul>
- <h3>The alternatives to Dragon Ball Z Mugen Fighter APK</h3>
- <p>If you are looking for some alternatives to Dragon Ball Z Mugen Fighter APK, you may want to check out these other fan-made or official games that are similar or related to Dragon Ball Z:</p>
- <ul>
-<li><strong>Dragon Ball Legends</strong>: This is an official game that is developed by Bandai Namco for Android and iOS devices. It is a 3D fighting game that features online PvP battles, story mode, events, and missions. You can collect and customize your own team of Dragon Ball characters and fight against other players or the AI. You can download the game from the Google Play Store or the App Store.</li>
-<li><strong>Dragon Ball Z Dokkan Battle</strong>: This is another official game that is developed by Bandai Namco for Android and iOS devices. It is a puzzle RPG game that combines card collecting, board game, and action elements. You can create your own team of Dragon Ball characters and explore various stages and scenarios from the anime series. You can also participate in events, quests, and tournaments. You can download the game from the Google Play Store or the App Store.</li>
-<li><strong>Dragon Ball Z Devolution</strong>: This is a fan-made game that is created by Txori, a French developer. It is a 2D pixel art fighting game that is inspired by the Dragon Ball Z anime series. You can play as various characters from the series and fight against the computer or a friend in different modes and stages. You can also unlock new characters, transformations, and abilities. You can play the game online on this website: [text].</li>
-</ul>
- <h2>Conclusion</h2>
- <p>Dragon Ball Z Mugen Fighter APK is a fan-made fighting game that uses the Mugen engine to create a 2D fighting game that features characters, stages, music, and sound effects from the Dragon Ball Z anime series. The game has over 100 characters to choose from, each with their own moves, skills, transformations, and super moves. The game also has multiple modes and options that offer different challenges and experiences. The game is free and easy to download and install on your Android device, but it may have some drawbacks such as being unofficial, unlicensed, incompatible, or illegal. The game is a great option for Dragon Ball Z fans and fighting game enthusiasts who want to enjoy a fun and exciting fighting game on their Android device.</p>
- <h3>Summary of the main points</h3>
- <p>Here are the main points of this article:</p>
- <ul>
-<li>Dragon Ball Z Mugen Fighter APK is a fan-made fighting game that uses the Mugen engine to create a 2D fighting game based on the Dragon Ball Z anime series.</li>
-<li>The game has over 100 characters from the series, as well as some original characters created by fans.</li>
-<li>The game has multiple modes and options that offer different challenges and experiences.</li>
-<li>The game is free and easy to download and install on your Android device.</li>
-<li>The game may have some drawbacks such as being unofficial, unlicensed, incompatible, or illegal.</li>
-<li>The game is a great option for Dragon Ball Z fans and fighting game enthusiasts who want to enjoy a fun and exciting fighting game on their Android device.</li>
-</ul>
- <h3>Call to action</h3>
- <p>If you are interested in playing Dragon Ball Z Mugen Fighter APK on your Android device, you can download the APK file from this link: [text]. This is a safe and secure link that will not harm your device or data. You can also follow the steps in this article to download and install the game easily and quickly. You can also check out some of the tips in this article to play the game better and have more fun. If you like this game, you can also share it with your friends and family who are also fans of Dragon Ball Z or fighting games. You can also leave your feedback or comments about this game on this website: [text]. We would love to hear from you and know what you think about this game.</p>
- <h2>Frequently Asked Questions</h2>
- <p>Here are some of the frequently asked questions about Dragon Ball Z Mugen Fighter APK:</p>
- <ol>
-<li><strong>What is Mugen?</strong></li>
-<p>Mugen is a free software that allows anyone to create their own fighting games with any characters they want. There are thousands of fan-made games that use the Mugen engine, featuring characters from various anime, manga, video games, movies, comics, and even real-life celebrities.</p>
-<li><strong>Is Dragon Ball Z Mugen Fighter APK safe to download and install?</strong></li>
-<p>Dragon Ball Z Mugen Fighter APK is safe to download and install on your Android device, as long as you use the link provided in this article: [text]. This is a trusted and verified link that will not harm your device or data. However, you should always be careful when downloading and installing apps from unknown sources, as they may contain viruses or malware that can damage your device or data. You should also scan the APK file with an antivirus app before installing it.</p>
-<li><strong>How can I play Dragon Ball Z Mugen Fighter APK with a friend?</strong></li>
-<p>Dragon Ball Z Mugen Fighter APK has a versus mode that allows you to play with a friend on the same device. You can choose your own characters and stage, and then split the screen into two parts. Each player will use one half of the screen to control their character. You can also adjust the game settings to make the game more fair or challenging.</p>
-<li><strong>How can I update Dragon Ball Z Mugen Fighter APK?</strong></li>
-<p>Dragon Ball Z Mugen Fighter APK is a fan-made game that is constantly updated and improved by the fan community. You can check for updates on this website: [text]. This is the official website of the game, where you can find the latest news, updates, and downloads. You can also join the game's Discord server, where you can chat with other players and developers, and get access to exclusive content and features. You can join the Discord server by clicking on this link: [text].</p>
-<li><strong>What are some of the best characters to play as in Dragon Ball Z Mugen Fighter APK?</strong></li>
-<p>Dragon Ball Z Mugen Fighter APK has over 100 characters to choose from, each with their own strengths and weaknesses. The best characters to play as depend on your personal preference and play style. However, some of the most popular and powerful characters are Goku, Vegeta, Gohan, Piccolo, Frieza, Cell, Buu, Broly, Beerus, and Jiren. These characters have high stats, versatile moves, impressive transformations, and devastating super moves.</p>
-<li><strong>How can I contact the developers of Dragon Ball Z Mugen Fighter APK?</strong></li>
-<p>If you have any questions, suggestions, feedback, or issues regarding Dragon Ball Z Mugen Fighter APK, you can contact the developers of the game by using one of these methods:</p>
- <ul>
-<li><strong>Email</strong>: You can send an email to this address: [text]. This is the official email address of the game, where you can reach the developers directly.</li>
-<li><strong>Facebook</strong>: You can visit this page: [text]. This is the official Facebook page of the game, where you can follow the latest updates, posts, and comments.</li>
-<li><strong>YouTube</strong>: You can subscribe to this channel: [text]. This is the official YouTube channel of the game, where you can watch the latest videos, trailers, and gameplay.</li>
-</ul></p> 197e85843d<br />
-<br />
-<br />
\ No newline at end of file
diff --git a/spaces/fatiXbelha/sd/Dragon Quest 3 Mod APK - Enhance Your Gameplay with Mods and Cheats.md b/spaces/fatiXbelha/sd/Dragon Quest 3 Mod APK - Enhance Your Gameplay with Mods and Cheats.md
deleted file mode 100644
index ea8d116b89aecf4673b0c97706d72d3af61c37d3..0000000000000000000000000000000000000000
--- a/spaces/fatiXbelha/sd/Dragon Quest 3 Mod APK - Enhance Your Gameplay with Mods and Cheats.md	
+++ /dev/null
@@ -1,150 +0,0 @@
-<br />
-<h1>Dragon Quest 3 Mod APK Download: A Classic JRPG for Your Mobile Device</h1>
- <p>If you are a fan of Japanese role-playing games (JRPGs), you have probably heard of <strong>Dragon Quest</strong>, one of the most popular and influential series in the genre. And if you are looking for a classic JRPG experience on your mobile device, you might want to check out <strong>Dragon Quest 3 mod APK download</strong>, a modified version of the third installment in the series that offers some extra features and benefits.</p>
- <p>In this article, we will tell you everything you need to know about Dragon Quest 3 mod APK download, including what is Dragon Quest 3, why download the mod APK version, what are the best tips and tricks for playing it, and how it compares to other versions and games in the series. Let's get started!</p>
-<h2>dragon quest 3 mod apk download</h2><br /><p><b><b>Download</b> &#9733;&#9733;&#9733;&#9733;&#9733; <a href="https://urllie.com/2uNyEo">https://urllie.com/2uNyEo</a></b></p><br /><br />
- <h2>What is Dragon Quest 3?</h2>
- <p>Dragon Quest 3, also known as <em>Dragon Warrior 3</em> in North America, is a JRPG developed by Chunsoft and published by Enix in 1988 for the Nintendo Entertainment System (NES). It is the third game in the main series and a prequel to the first two games, set in a fantasy world inspired by medieval Europe and Asia.</p>
- <h3>The story of Dragon Quest 3</h3>
- <p>The story of Dragon Quest 3 follows the hero, who is tasked with saving the world from the archfiend Baramos. Gathering a group of companions into a party, the hero must travel the world, stopping at various towns and locations, and make their way to Baramos' lair. Along the way, they will discover secrets about their own identity, their father's legacy, and the origin of evil in the world.</p>
- <h3>The gameplay of Dragon Quest 3</h3>
- <p>The gameplay of Dragon Quest 3 is similar to other JRPGs of its time, using basic conventions such as leveling up by gaining experience points, equipping items, and exploring dungeons. The game also features a turn-based battle system, where the player can choose commands for each party member, such as attack, defend, use items, or cast spells.</p>
- <p>One of the most notable aspects of Dragon Quest 3 is its class system, where each character has a certain class that determines their stats and abilities. The hero always keeps the Hero class, but the other characters can choose from several options, such as Warrior, Priest, Mage, Thief, or Jester. Furthermore, upon reaching level 20, a character can change their class at a special temple, retaining some of their previous skills and stats.</p>
- <h3>The features of Dragon Quest 3</h3>
- <p>Dragon Quest 3 has many features that make it stand out from other JRPGs, such as:</p>
- <ul>
-<li>A large and diverse world map that spans multiple continents and environments.</li>
-<li>A day/night cycle that affects some events and encounters in the game.</li>
-<li>A personality system that assigns each character a trait based on their actions and choices, which influences their growth and interactions.</li>
-<li>A monster medal collection that rewards the player for defeating certain enemies with rare items.</li>
-<li>A mini-game called Pachisi (or Sugoroku) that allows the player to win prizes by rolling dice on a board.</li>
-<li>A bonus dungeon that is only accessible after completing the main story and offers new challenges and rewards.</li>
-</ul>
- <h2>Why download the mod APK version of Dragon Quest 3?</h2>
- <p>If you want to play Dragon Quest 3 on your mobile device, you have two options: you can either buy the official version from the Google Play Store or the App Store, or you can download the mod APK version from a third-party website. The mod APK version is a modified version of the original game that has some advantages and disadvantages over the official version. Here are some of them:</p>
- <h3>The benefits of the mod APK version</h3>
- <p>Some of the benefits of downloading the mod APK version of Dragon Quest 3 are:</p>
-<p>dragon quest iii modded apk free download<br />
-download dragon quest 3 apk mod unlimited money<br />
-dragon quest 3 android mod apk latest version<br />
-how to install dragon quest iii mod apk on pc<br />
-dragon quest 3 mod apk offline no root<br />
-dragon quest iii apk mod with cheats and hacks<br />
-dragon quest 3 mod apk english version download<br />
-download dragon quest iii mod apk for ios<br />
-dragon quest 3 apk mod full game unlocked<br />
-dragon quest iii mod apk with obb file download<br />
-dragon quest 3 mod apk online multiplayer mode<br />
-dragon quest iii apk mod best graphics settings<br />
-dragon quest 3 mod apk no ads or in-app purchases<br />
-dragon quest iii mod apk all characters and items unlocked<br />
-dragon quest 3 apk mod high speed download link<br />
-dragon quest iii mod apk original soundtrack and voice<br />
-dragon quest 3 mod apk new features and updates<br />
-dragon quest iii apk mod compatible with all devices<br />
-dragon quest 3 mod apk easy installation guide<br />
-dragon quest iii mod apk safe and secure download<br />
-dragon quest 3 apk mod review and rating<br />
-dragon quest iii mod apk gameplay and walkthrough<br />
-dragon quest 3 mod apk tips and tricks<br />
-dragon quest iii apk mod support and feedback<br />
-dragon quest 3 mod apk bug fixes and improvements</p>
- <ul>
-<li>You can play the game for free, without spending any money.</li>
-<li>You can enjoy some extra features that are not available in the official version, such as unlimited gold, items, and skill points, as well as unlocked classes and vocations.</li>
-<li>You can customize the game to your liking, by changing the graphics, sound, and language settings.</li>
-<li>You can access the game offline, without needing an internet connection.</li>
-</ul>
- <h3>The drawbacks of the mod APK version</h3>
- <p>Some of the drawbacks of downloading the mod APK version of Dragon Quest 3 are:</p>
- <ul>
-<li>You might encounter some bugs, glitches, or errors that affect the game performance and stability.</li>
-<li>You might risk getting viruses, malware, or spyware on your device from untrusted sources.</li>
-<li>You might violate the terms and conditions of the game developer and publisher, and face legal consequences.</li>
-<li>You might lose your progress and data if the game updates or crashes.</li>
-</ul>
- <h3>How to download and install the mod APK version</h3>
- <p>If you decide to download and install the mod APK version of Dragon Quest 3, you need to follow these steps:</p>
- <ol>
-<li>Find a reliable website that offers the mod APK file of Dragon Quest 3. You can search online or ask for recommendations from other players.</li>
-<li>Download the mod APK file to your device. Make sure you have enough storage space and a good internet connection.</li>
-<li>Enable the installation of apps from unknown sources on your device. You can do this by going to your device settings, security, and allowing unknown sources.</li>
-<li>Locate the mod APK file on your device and tap on it to start the installation process. Follow the instructions on the screen and wait for the installation to finish.</li>
-<li>Launch the game and enjoy playing Dragon Quest 3 with mod features.</li>
-</ol>
- <h2>What are the best tips and tricks for playing Dragon Quest 3?</h2>
- <p>Dragon Quest 3 is a fun and challenging game that requires some strategy and planning. Here are some of the best tips and tricks for playing it:</p>
- <h3>How to choose the best classes for your party</h3>
- <p>The class system in Dragon Quest 3 is one of its most important aspects, as it determines how your characters will grow and fight. You can choose from six initial classes: Warrior, Priest, Mage, Thief, Jester, and Hero. Each class has its own strengths and weaknesses, as well as unique skills and spells. Here are some general guidelines for choosing your party members:</p>
- <ul>
-<li>The Hero is a balanced class that can deal decent damage, heal allies, and use various spells. You should always have the Hero in your party, as they are essential for the story and have some exclusive abilities.</li>
-<li>The Warrior is a strong class that can deal high physical damage, wield heavy weapons and armor, and resist attacks. You should have at least one Warrior in your party, as they can act as a tank and protect weaker allies.</li>
-<li>The Priest is a supportive class that can heal allies, cure status ailments, revive fallen comrades, and use holy spells. You should have at least one Priest in your party, as they can keep your party alive and healthy.</li>
-<li>The Mage is a powerful class that can deal high magical damage, use elemental spells, debuff enemies, and buff allies. You should have at least one Mage in your party, as they can exploit enemy weaknesses and enhance your party's performance.</li>
-<li>The Thief is a versatile class that can deal moderate physical damage, steal items from enemies, use boomerangs and whips, and evade attacks. You should have a Thief in your party if you want to collect rare items and explore hidden areas.</li>
-<li>The Jester is a quirky class that can deal unpredictable damage, use jokes and pranks, change classes at any level, and occasionally act on their own. You should have a Jester in your party if you want to have some fun and challenge yourself.</li> <h3>How to level up and change vocations efficiently</h3>
- <p>Leveling up in Dragon Quest 3 is essential for increasing your stats, learning new skills and spells, and unlocking new classes. However, leveling up can also be time-consuming and tedious, especially if you want to change vocations and start from level 1 again. Here are some tips for leveling up and changing vocations efficiently:</p>
- <ul>
-<li>Use the Zoom spell or the Chimera Wing item to travel quickly between locations. This will save you time and money on transportation.</li>
-<li>Find the best spots for grinding experience points, such as the Tower of Garuna, the Ice Cave, or the Cave of Necrogond. These places have enemies that give high amounts of experience points and are relatively easy to defeat.</li>
-<li>Use the Metal Slime enemies to boost your experience points. These enemies are rare and hard to hit, but they give massive amounts of experience points if you manage to kill them. Use weapons or spells that have a high chance of hitting them, such as the Falcon Sword, the Metal Babble Sword, or the Lightning spell.</li>
-<li>Use the Seeds of Life, Seeds of Strength, Seeds of Agility, Seeds of Wisdom, and Seeds of Luck items to increase your stats permanently. You can find these items in chests, pots, drawers, or by stealing from enemies. Use them wisely on the characters that need them most.</li>
-<li>Change vocations at the Dharma Temple when you reach level 20 or higher. This will allow you to keep some of your previous skills and stats, as well as learn new ones from your new class. You can also change vocations multiple times to create hybrid characters with diverse abilities.</li>
-</ul>
- <h3>How to find hidden secrets and items in the game world</h3>
- <p>Dragon Quest 3 has many hidden secrets and items that can enhance your gameplay and reward your curiosity. Here are some ways to find them:</p>
- <ul>
-<li>Search every corner of the game world for hidden passages, doors, chests, pots, drawers, bookshelves, signs, wells, graves, and other objects that might contain something useful or interesting.</li>
-<li>Talk to every NPC you encounter, as they might give you hints, clues, information, items, or quests that can help you progress in the game.</li>
-<li>Use the Thief's Nose skill or the Thief's Key item to detect and open locked doors and chests. You can get these by having a Thief in your party or by completing a quest in Portoga.</li>
-<li>Use the Final Key item to access the most secret areas and items in the game. You can get this by defeating Zoma's Shadow in Charlock Castle.</li>
-<li>Use the Echo Flute item to locate the six orbs that are needed to summon Ramia, the legendary bird that can fly you anywhere in the game world. You can get this by completing a quest in Baharata.</li>
-</ul>
- <h2>How does Dragon Quest 3 compare to other versions and games in the series?</h2>
- <p>Dragon Quest 3 is one of the most acclaimed and influential games in the series, as well as in the JRPG genre as a whole. It has been remade and ported several times for different platforms, such as the Super Nintendo Entertainment System (SNES), the Game Boy Color (GBC), and mobile devices. It has also inspired many other games in the series and beyond. Here are some of the similarities and differences between Dragon Quest 3 and other versions and games:</p>
- <h3>The differences between the original and the mod APK version</h3>
- <p>The original version of Dragon Quest 3 was released for the NES in 1988, while the mod APK version is based on the mobile version that was released for Android and iOS devices in 2014. The mod APK version has some differences from the original version, such as:</p>
- <ul>
-<li>The graphics are improved and updated to match modern standards.</li>
-<li>The sound and music are enhanced and remastered.</li>
-<li>The controls are adapted for touch-screen devices.</li>
-<li>The difficulty is adjusted and balanced.</li>
-<li>The content is expanded and added with new features, such as monster medals, Pachisi boards, bonus dungeons, extra classes, and mod features.</li>
-</ul>
- <h3>The similarities and differences with other Dragon Quest games</h3>
- <p>Dragon Quest 3 is part of a trilogy that includes Dragon Quest 1 and 2, which are set in the same world but in different time periods. Dragon Quest 3 is a prequel to Dragon Quest 1 and 2, and reveals some connections and references to them. Dragon Quest 3 also shares some similarities with other Dragon Quest games that came after it, such as:</p>
- <ul>
-<li>The class system that allows the player to customize their characters and learn different skills and spells from different classes. This system was later used in Dragon Quest 6, 7, and 9, with some variations and improvements.</li>
-<li>The personality system that assigns each character a trait based on their actions and choices, which influences their growth and interactions. This system was later used in Dragon Quest 5, 6, and 9, with some modifications and expansions.</li>
-<li>The day/night cycle that affects some events and encounters in the game. This feature was later used in Dragon Quest 4, 5, 6, 8, and 11, with some additions and enhancements.</li>
-<li>The monster medal collection that rewards the player for defeating certain enemies with rare items. This feature was later used in Dragon Quest 6, 7, and 9, with some changes and extensions.</li>
-<li>The Pachisi mini-game that allows the player to win prizes by rolling dice on a board. This feature was later used in Dragon Quest 6 and 7, with some variations and adjustments.</li>
-</ul>
- <p>Dragon Quest 3 also has some differences with other Dragon Quest games that came after it, such as:</p>
- <ul>
-<li>The bonus dungeon that is only accessible after completing the main story and offers new challenges and rewards. This feature was later used in Dragon Quest 4, 5, 6, 8, and 11, but with different themes and mechanics.</li>
-<li>The ability to change the hero's gender at the beginning of the game. This feature was later used in Dragon Quest 4 and 9, but with different implications and outcomes.</li>
-<li>The ability to create your own party members by choosing their classes and names at the tavern. This feature was later used in Dragon Quest 9, but with more options and customization.</li>
-</ul>
- <h2>Conclusion</h2>
- <p>Dragon Quest 3 is a classic JRPG that has been remade and ported several times for different platforms, including mobile devices. The mod APK version of Dragon Quest 3 is a modified version of the original game that offers some extra features and benefits, but also some drawbacks and risks. If you want to play Dragon Quest 3 on your mobile device, you can either buy the official version or download the mod APK version, depending on your preferences and needs.</p>
- <p>In this article, we have covered everything you need to know about Dragon Quest 3 mod APK download, including what is Dragon Quest 3, why download the mod APK version, what are the best tips and tricks for playing it, and how it compares to other versions and games in the series. We hope you have enjoyed reading this article and found it useful and informative. If you have any questions or feedback, please feel free to leave a comment below. Thank you for your time and attention!</p>
- <h2>FAQs</h2>
- <p>Here are some of the most frequently asked questions about Dragon Quest 3 mod APK download:</p>
- <h3>Q: Is Dragon Quest 3 mod APK download safe?</h3>
- <p>A: Dragon Quest 3 mod APK download is not completely safe, as it involves downloading and installing a file from an unknown source that might contain viruses, malware, or spyware. You should always be careful when downloading and installing any file from the internet, especially if it is a modded or hacked version of a game. You should also make sure you have a reliable antivirus program on your device to protect it from any potential threats.</p>
- <h3>Q: Is Dragon Quest 3 mod APK download legal?</h3>
- <p>A: Dragon Quest 3 mod APK download is not legal, as it violates the terms and conditions of the game developer and publisher, Enix (now Square Enix). By downloading and installing the mod APK version of Dragon Quest 3, you are infringing on their intellectual property rights and breaking their rules. You might face legal consequences if you are caught or reported by them or by other players.</p>
- <h3>Q: Is Dragon Quest 3 mod APK download compatible with my device?</h3>
- <p>A: Dragon Quest 3 mod APK download is compatible with most Android devices that have Android version 4.0 or higher. However, some devices might not be able to run the game smoothly or properly due to different specifications or settings. You should check the requirements of the game before downloading and installing it on your device.</p>
- <h3>Q: How can I update Dragon Quest 3 mod APK download?</h3>
- <p>A: Dragon Quest 3 mod APK download does not update automatically like the official version of the game. You will have to manually download and install the latest version of the mod APK file from the same website or source that you got it from. However, you might lose your progress and data if you do so, as the new version might not be compatible with the old version. You should always backup your data before updating the game.</p>
- <h3>Q: How can I uninstall Dragon Quest 3 mod APK download?</h3>
- <p>A: If you want to uninstall Dragon Quest 3 mod APK download from your device, you can do so by following these steps:</p>
- <ol>
-<li>Go to your device settings, apps, and find Dragon Quest 3 mod APK download on the list.</li>
-<li>Tap on the app and select uninstall. Confirm your choice and wait for the process to finish.</li>
-<li>Delete the mod APK file from your device storage if you still have it.</li>
-</ol></p> 197e85843d<br />
-<br />
-<br />
\ No newline at end of file
diff --git a/spaces/feeme666/auto_mjw/app.py b/spaces/feeme666/auto_mjw/app.py
deleted file mode 100644
index 245c70a0657dfeae286298aca334ea9ba15981f3..0000000000000000000000000000000000000000
--- a/spaces/feeme666/auto_mjw/app.py
+++ /dev/null
@@ -1,158 +0,0 @@
-import os
-import uuid
-from datetime import datetime
-
-import gradio as gr
-import torch
-import pandas as pd
-
-from Bio import Entrez
-from dateutil.relativedelta import relativedelta
-from torch.utils.data import DataLoader
-from tqdm import tqdm
-from transformers import BertForSequenceClassification, BertTokenizer
-
-
-if torch.cuda.is_available():
-    device = torch.device("cuda")
-elif hasattr(torch.backends, "mps") and torch.backends.mps.is_available():
-    device = torch.device("mps")
-else:
-    device = torch.device("cpu")
-
-# トークナイザとモデルのロード
-MODEL_DIR = './model1'
-tokenizer = BertTokenizer.from_pretrained(MODEL_DIR)
-model = BertForSequenceClassification.from_pretrained(MODEL_DIR)
-model.eval()
-model.to(device)
-
-
-def search_and_fetch_articles(targeted_y, targeted_m, duration, email="your.email@example.com"):
-    Entrez.email = email
-    
-    start_date = datetime(int(targeted_y), int(targeted_m), 1)
-    next_month_date = start_date + relativedelta(months=duration)
-    
-    term = ('(N Engl J Med[Jour] OR JAMA[Jour] OR Lancet[Jour] OR Ann Intern Med[Jour] OR Crit Care Med[Jour] OR '
-       'Am J Respir Crit Care Med[Jour] OR Chest[Jour] OR BMJ[Jour] OR J Trauma Acute Care Surg[Jour] OR '
-       'Intensive Care Med[Jour] OR Crit Care[Jour] OR JAMA Intern Med[Jour] OR Clin Infect Dis[Jour] OR '
-       'Circulation[Jour] OR Stroke[Jour] OR J Intensive Care[jour]) AND ("{}"[Date - Publication] : "{}"[Date - Publication])'
-       .format(start_date.strftime('%Y/%m/%d'), next_month_date.strftime('%Y/%m/%d')))
-    
-    # Search articles
-    handle_search = Entrez.esearch(db="pubmed", term=term, retmax=500)
-    result_search = Entrez.read(handle_search)
-    pmids = result_search['IdList']
-    
-    # Fetch articles
-    handle_fetch = Entrez.efetch(db="pubmed", id=",".join(pmids), rettype="xml")
-    records = Entrez.read(handle_fetch)
-    
-    articles = []
-    for record in records["PubmedArticle"]:
-        pmid = record["MedlineCitation"]["PMID"]
-        title = record["MedlineCitation"]["Article"]["ArticleTitle"]
-        journal_name = record["MedlineCitation"]["Article"]["Journal"]["Title"]
-        
-        abstract = ""
-        if "Abstract" in record["MedlineCitation"]["Article"]:
-            abstract_texts = record["MedlineCitation"]["Article"]["Abstract"]["AbstractText"]
-            abstract = " ".join(abstract_texts)
-        
-        articles.append({
-            "pmid": pmid,
-            "title": title,
-            "journal_name": journal_name,
-            "abstract": abstract
-        })
-    papers_df = pd.DataFrame(articles)
-    return papers_df
-
-def predict_with_model(papers_df):
-    # 論文の抄録を使用して予測
-    test_text = []
-    for i in range(len(papers_df)):
-        _text = str(papers_df.loc[i, 'title']) + ' ' + str(papers_df.loc[i, 'abstract'] )
-        test_text.append(_text)
-    test_df3 = pd.DataFrame(test_text)
-    test_df3.columns = ['title_abstract']
-    test_encodings = tokenizer(test_df3.loc[:,'title_abstract'].to_list(), truncation=True, padding=True,max_length=512)
-
-    class MedicalDataset(torch.utils.data.Dataset):
-        def __init__(self, encodings, labels=None):
-            self.encodings = encodings
-            self.labels = labels
-
-        def __getitem__(self, idx):
-            item = {key: torch.tensor(val[idx]) for key, val in self.encodings.items()}
-            if self.labels:
-                item['labels'] = torch.tensor(self.labels[idx])
-            return item
-
-        def __len__(self):
-            return len(self.encodings['input_ids'])
-
-
-    test_dataset = MedicalDataset(test_encodings)  
-    dataloader = DataLoader(test_dataset, batch_size=8)
-
-    predictions = []
-    softmax = torch.nn.Softmax(dim=1)
-    
-    with torch.no_grad():
-        for batch in tqdm(dataloader, desc="Predicting"):
-            b_input_ids = batch['input_ids'].to(device)
-            b_attention_mask = batch['attention_mask'].to(device)
-            outputs = model(b_input_ids, attention_mask=b_attention_mask)
-            logits = outputs.logits
-            probs = softmax(logits)
-            class_1_probs = probs[:, 1]  # 1を取るクラスの確率を取得
-            predictions.extend(class_1_probs.cpu().numpy())
-
-
-    papers_df['target'] = predictions
-    return papers_df
-
-
-def fetch_and_predict(targeted_y, targeted_m, duration=1, email="XXXXXXXXXXXXXXXXXXXXXX"):
-    papers_df = search_and_fetch_articles(targeted_y, targeted_m, duration, email=email)
-
-    # 二値分類モデルを使って予測
-    predictions = predict_with_model(papers_df)
-    predictions_sorted = predictions.sort_values(by='target', ascending=False)
-    
-    # 一意のファイル名を生成
-    unique_filename = f"predicted_papers_{uuid.uuid4()}.csv"
-    predictions_sorted.to_csv(unique_filename, index=False)
-    
-    return unique_filename  
-
-
-def remove_file(file_path):
-    try:
-        os.remove(file_path)
-    except OSError as e:
-        print(f"Error: {file_path} : {e.strerror}")
-
-
-def on_close_callback(filename):
-    remove_file(filename)
-
-
-interface = gr.Interface(
-    title='"集中治療医が勉強会で選びがちな論文"予測モデル',
-    description='調べたい月を指定すると、その月に主要雑誌において発表された論文を、集中治療医が勉強会のネタとして選ぶ可能性が高いものから順番に並べ直したCSVを作ります。'
-                +'<br>**注意! 5~10分ほどかかります!** (ファイルサイズはおおよそ0.3Mb程度です)'
-                +'<br># 検索する雑誌'
-                +'<br># N Engl J Med, JAMA, Lancet, Ann Intern Med, Crit Care Med, Am J Respir Crit Care Med, Chest, BMJ, J Trauma Acute Care Surg, Intensive Care Med, Crit Care, JAMA Intern Med, Clin Infect Dis, Circulation, Stroke, J Intensive Care',
-    fn=fetch_and_predict, 
-    inputs=[
-        gr.Textbox(label='調べたい年', lines=1, placeholder="ここに数値を入れてください..."),
-        gr.Textbox(label='調べたい月', lines=1, placeholder="ここに数値を入れてください...")
-    ], 
-    outputs=gr.components.File(label="Download CSV"),
-)
-
-interface.launch()
-on_close_callback()
\ No newline at end of file
diff --git a/spaces/feng2022/Time-TravelRephotography/Time_TravelRephotography/models/encoder4editing/scripts/inference.py b/spaces/feng2022/Time-TravelRephotography/Time_TravelRephotography/models/encoder4editing/scripts/inference.py
deleted file mode 100644
index 4c3a98ba3182a4b3a66605baa245c76f1d7eadac..0000000000000000000000000000000000000000
--- a/spaces/feng2022/Time-TravelRephotography/Time_TravelRephotography/models/encoder4editing/scripts/inference.py
+++ /dev/null
@@ -1,136 +0,0 @@
-import argparse
-
-import torch
-import numpy as np
-import sys
-import os
-import dlib
-from tqdm import tqdm
-
-sys.path.append(".")
-sys.path.append("..")
-
-from configs import data_configs, paths_config
-from datasets.inference_dataset import InferenceDataset
-from torch.utils.data import DataLoader
-from utils.model_utils import setup_model
-from utils.common import tensor2im
-from utils.alignment import align_face
-from PIL import Image
-
-
-def main(args):
-    net, opts = setup_model(args.ckpt, device)
-    is_cars = 'cars_' in opts.dataset_type
-    generator = net.decoder
-    generator.eval()
-    args, data_loader = setup_data_loader(args, opts)
-
-    # Check if latents exist
-    latents_file_path = os.path.join(args.save_dir, 'latents.pt')
-    if os.path.exists(latents_file_path):
-        latent_codes = torch.load(latents_file_path).to(device)
-    else:
-        latent_codes = get_all_latents(net, data_loader, args.n_sample, is_cars=is_cars)
-        os.makedirs(os.path.dirname(latents_file_path), exist_ok=True)
-        torch.save(latent_codes, latents_file_path, _use_new_zipfile_serialization=False)
-
-    if not args.latents_only:
-        generate_inversions(args, generator, latent_codes, is_cars=is_cars)
-
-
-def setup_data_loader(args, opts):
-    dataset_args = data_configs.DATASETS[opts.dataset_type]
-    transforms_dict = dataset_args['transforms'](opts).get_transforms()
-    images_path = args.images_dir if args.images_dir is not None else dataset_args['test_source_root']
-    print(f"images path: {images_path}")
-    align_function = None
-    if args.align:
-        align_function = run_alignment
-    test_dataset = InferenceDataset(root=images_path,
-                                    transform=transforms_dict['transform_inference'],
-                                    preprocess=align_function,
-                                    opts=opts)
-
-    data_loader = DataLoader(test_dataset,
-                             batch_size=args.batch,
-                             shuffle=False,
-                             num_workers=2,
-                             drop_last=True)
-
-    print(f'dataset length: {len(test_dataset)}')
-
-    if args.n_sample is None:
-        args.n_sample = len(test_dataset)
-    return args, data_loader
-
-
-def get_latents(net, x, is_cars=False):
-    codes = net.encoder(x)
-    if net.opts.start_from_latent_avg:
-        if codes.ndim == 2:
-            codes = codes + net.latent_avg.repeat(codes.shape[0], 1, 1)[:, 0, :]
-        else:
-            codes = codes + net.latent_avg.repeat(codes.shape[0], 1, 1)
-    if codes.shape[1] == 18 and is_cars:
-        codes = codes[:, :16, :]
-    return codes
-
-
-def get_all_latents(net, data_loader, n_images=None, is_cars=False):
-    all_latents = []
-    i = 0
-    with torch.no_grad():
-        for batch in tqdm(data_loader):
-            if n_images is not None and i > n_images:
-                break
-            x = batch
-            inputs = x.to(device).float()
-            latents = get_latents(net, inputs, is_cars)
-            all_latents.append(latents)
-            i += len(latents)
-    return torch.cat(all_latents)
-
-
-def save_image(img, save_dir, idx):
-    result = tensor2im(img)
-    im_save_path = os.path.join(save_dir, f"{idx:05d}.jpg")
-    os.makedirs(os.path.dirname(im_save_path), exist_ok=True)
-    Image.fromarray(np.array(result)).save(im_save_path)
-
-
-@torch.no_grad()
-def generate_inversions(args, g, latent_codes, is_cars):
-    print('Saving inversion images')
-    inversions_directory_path = os.path.join(args.save_dir, 'inversions')
-    os.makedirs(inversions_directory_path, exist_ok=True)
-    for i in range(args.n_sample):
-        imgs, _ = g([latent_codes[i].unsqueeze(0)], input_is_latent=True, randomize_noise=False, return_latents=True)
-        if is_cars:
-            imgs = imgs[:, :, 64:448, :]
-        save_image(imgs[0], inversions_directory_path, i + 1)
-
-
-def run_alignment(image_path):
-    predictor = dlib.shape_predictor(paths_config.model_paths['shape_predictor'])
-    aligned_image = align_face(filepath=image_path, predictor=predictor)
-    print("Aligned image has shape: {}".format(aligned_image.size))
-    return aligned_image
-
-
-if __name__ == "__main__":
-    device = "cuda"
-
-    parser = argparse.ArgumentParser(description="Inference")
-    parser.add_argument("--images_dir", type=str, default=None,
-                        help="The directory of the images to be inverted")
-    parser.add_argument("--save_dir", type=str, default=None,
-                        help="The directory to save the latent codes and inversion images. (default: images_dir")
-    parser.add_argument("--batch", type=int, default=1, help="batch size for the generator")
-    parser.add_argument("--n_sample", type=int, default=None, help="number of the samples to infer.")
-    parser.add_argument("--latents_only", action="store_true", help="infer only the latent codes of the directory")
-    parser.add_argument("--align", action="store_true", help="align face images before inference")
-    parser.add_argument("ckpt", metavar="CHECKPOINT", help="path to generator checkpoint")
-
-    args = parser.parse_args()
-    main(args)
diff --git a/spaces/fengmuxi/ChatGpt-Web/app/api/user/mail/route.ts b/spaces/fengmuxi/ChatGpt-Web/app/api/user/mail/route.ts
deleted file mode 100644
index 8f2e93f6dd0d356e6470a13fd38ddd4754432696..0000000000000000000000000000000000000000
--- a/spaces/fengmuxi/ChatGpt-Web/app/api/user/mail/route.ts
+++ /dev/null
@@ -1,20 +0,0 @@
-import { NextRequest } from "next/server";
-import { getIP } from "../../auth";
-
-export async function POST(req: NextRequest) {
-  try {
-    const mail=req.nextUrl.searchParams.get("mail")
-    let res=await fetch("https://eladmin.dwzynj.top/api/code/registerEmail?email="+mail, {
-      method: "POST",
-      headers:{
-        "UserIp": String(getIP(req))
-      }
-    })
-    let msg=await res.json()
-    // console.log(res.status)
-    return new Response(JSON.stringify(msg))
-  } catch (e) {
-    console.error("[eladmin] ", e);
-    return new Response(JSON.stringify(e));
-  }
-}
diff --git a/spaces/fffiloni/controlnet-animation-doodle/node_modules/safer-buffer/Readme.md b/spaces/fffiloni/controlnet-animation-doodle/node_modules/safer-buffer/Readme.md
deleted file mode 100644
index 14b0822909320ff4ffafb1526212866f159470c5..0000000000000000000000000000000000000000
--- a/spaces/fffiloni/controlnet-animation-doodle/node_modules/safer-buffer/Readme.md
+++ /dev/null
@@ -1,156 +0,0 @@
-# safer-buffer [![travis][travis-image]][travis-url] [![npm][npm-image]][npm-url] [![javascript style guide][standard-image]][standard-url] [![Security Responsible Disclosure][secuirty-image]][secuirty-url]
-
-[travis-image]: https://travis-ci.org/ChALkeR/safer-buffer.svg?branch=master
-[travis-url]: https://travis-ci.org/ChALkeR/safer-buffer
-[npm-image]: https://img.shields.io/npm/v/safer-buffer.svg
-[npm-url]: https://npmjs.org/package/safer-buffer
-[standard-image]: https://img.shields.io/badge/code_style-standard-brightgreen.svg
-[standard-url]: https://standardjs.com
-[secuirty-image]: https://img.shields.io/badge/Security-Responsible%20Disclosure-green.svg
-[secuirty-url]: https://github.com/nodejs/security-wg/blob/master/processes/responsible_disclosure_template.md
-
-Modern Buffer API polyfill without footguns, working on Node.js from 0.8 to current.
-
-## How to use?
-
-First, port all `Buffer()` and `new Buffer()` calls to `Buffer.alloc()` and `Buffer.from()` API.
-
-Then, to achieve compatibility with outdated Node.js versions (`<4.5.0` and 5.x `<5.9.0`), use
-`const Buffer = require('safer-buffer').Buffer` in all files where you make calls to the new
-Buffer API. _Use `var` instead of `const` if you need that for your Node.js version range support._
-
-Also, see the
-[porting Buffer](https://github.com/ChALkeR/safer-buffer/blob/master/Porting-Buffer.md) guide.
-
-## Do I need it?
-
-Hopefully, not — dropping support for outdated Node.js versions should be fine nowdays, and that
-is the recommended path forward. You _do_ need to port to the `Buffer.alloc()` and `Buffer.from()`
-though.
-
-See the [porting guide](https://github.com/ChALkeR/safer-buffer/blob/master/Porting-Buffer.md)
-for a better description.
-
-## Why not [safe-buffer](https://npmjs.com/safe-buffer)?
-
-_In short: while `safe-buffer` serves as a polyfill for the new API, it allows old API usage and
-itself contains footguns._
-
-`safe-buffer` could be used safely to get the new API while still keeping support for older
-Node.js versions (like this module), but while analyzing ecosystem usage of the old Buffer API
-I found out that `safe-buffer` is itself causing problems in some cases.
-
-For example, consider the following snippet:
-
-```console
-$ cat example.unsafe.js
-console.log(Buffer(20))
-$ ./node-v6.13.0-linux-x64/bin/node example.unsafe.js
-<Buffer 0a 00 00 00 00 00 00 00 28 13 de 02 00 00 00 00 05 00 00 00>
-$ standard example.unsafe.js
-standard: Use JavaScript Standard Style (https://standardjs.com)
-  /home/chalker/repo/safer-buffer/example.unsafe.js:2:13: 'Buffer()' was deprecated since v6. Use 'Buffer.alloc()' or 'Buffer.from()' (use 'https://www.npmjs.com/package/safe-buffer' for '<4.5.0') instead.
-```
-
-This is allocates and writes to console an uninitialized chunk of memory.
-[standard](https://www.npmjs.com/package/standard) linter (among others) catch that and warn people
-to avoid using unsafe API.
-
-Let's now throw in `safe-buffer`!
-
-```console
-$ cat example.safe-buffer.js
-const Buffer = require('safe-buffer').Buffer
-console.log(Buffer(20))
-$ standard example.safe-buffer.js
-$ ./node-v6.13.0-linux-x64/bin/node example.safe-buffer.js
-<Buffer 08 00 00 00 00 00 00 00 28 58 01 82 fe 7f 00 00 00 00 00 00>
-```
-
-See the problem? Adding in `safe-buffer` _magically removes the lint warning_, but the behavior
-remains identiсal to what we had before, and when launched on Node.js 6.x LTS — this dumps out
-chunks of uninitialized memory.
-_And this code will still emit runtime warnings on Node.js 10.x and above._
-
-That was done by design. I first considered changing `safe-buffer`, prohibiting old API usage or
-emitting warnings on it, but that significantly diverges from `safe-buffer` design. After some
-discussion, it was decided to move my approach into a separate package, and _this is that separate
-package_.
-
-This footgun is not imaginary — I observed top-downloaded packages doing that kind of thing,
-«fixing» the lint warning by blindly including `safe-buffer` without any actual changes.
-
-Also in some cases, even if the API _was_ migrated to use of safe Buffer API — a random pull request
-can bring unsafe Buffer API usage back to the codebase by adding new calls — and that could go
-unnoticed even if you have a linter prohibiting that (becase of the reason stated above), and even
-pass CI. _I also observed that being done in popular packages._
-
-Some examples:
- * [webdriverio](https://github.com/webdriverio/webdriverio/commit/05cbd3167c12e4930f09ef7cf93b127ba4effae4#diff-124380949022817b90b622871837d56cR31)
-   (a module with 548 759 downloads/month),
- * [websocket-stream](https://github.com/maxogden/websocket-stream/commit/c9312bd24d08271687d76da0fe3c83493871cf61)
-   (218 288 d/m, fix in [maxogden/websocket-stream#142](https://github.com/maxogden/websocket-stream/pull/142)),
- * [node-serialport](https://github.com/node-serialport/node-serialport/commit/e8d9d2b16c664224920ce1c895199b1ce2def48c)
-   (113 138 d/m, fix in [node-serialport/node-serialport#1510](https://github.com/node-serialport/node-serialport/pull/1510)),
- * [karma](https://github.com/karma-runner/karma/commit/3d94b8cf18c695104ca195334dc75ff054c74eec)
-   (3 973 193 d/m, fix in [karma-runner/karma#2947](https://github.com/karma-runner/karma/pull/2947)),
- * [spdy-transport](https://github.com/spdy-http2/spdy-transport/commit/5375ac33f4a62a4f65bcfc2827447d42a5dbe8b1)
-   (5 970 727 d/m, fix in [spdy-http2/spdy-transport#53](https://github.com/spdy-http2/spdy-transport/pull/53)).
- * And there are a lot more over the ecosystem.
-
-I filed a PR at
-[mysticatea/eslint-plugin-node#110](https://github.com/mysticatea/eslint-plugin-node/pull/110) to
-partially fix that (for cases when that lint rule is used), but it is a semver-major change for
-linter rules and presets, so it would take significant time for that to reach actual setups.
-_It also hasn't been released yet (2018-03-20)._
-
-Also, `safer-buffer` discourages the usage of `.allocUnsafe()`, which is often done by a mistake.
-It still supports it with an explicit concern barier, by placing it under
-`require('safer-buffer/dangereous')`.
-
-## But isn't throwing bad?
-
-Not really. It's an error that could be noticed and fixed early, instead of causing havoc later like
-unguarded `new Buffer()` calls that end up receiving user input can do.
-
-This package affects only the files where `var Buffer = require('safer-buffer').Buffer` was done, so
-it is really simple to keep track of things and make sure that you don't mix old API usage with that.
-Also, CI should hint anything that you might have missed.
-
-New commits, if tested, won't land new usage of unsafe Buffer API this way.
-_Node.js 10.x also deals with that by printing a runtime depecation warning._
-
-### Would it affect third-party modules?
-
-No, unless you explicitly do an awful thing like monkey-patching or overriding the built-in `Buffer`.
-Don't do that.
-
-### But I don't want throwing…
-
-That is also fine!
-
-Also, it could be better in some cases when you don't comprehensive enough test coverage.
-
-In that case — just don't override `Buffer` and use
-`var SaferBuffer = require('safer-buffer').Buffer` instead.
-
-That way, everything using `Buffer` natively would still work, but there would be two drawbacks:
-
-* `Buffer.from`/`Buffer.alloc` won't be polyfilled — use `SaferBuffer.from` and
-  `SaferBuffer.alloc` instead.
-* You are still open to accidentally using the insecure deprecated API — use a linter to catch that.
-
-Note that using a linter to catch accidential `Buffer` constructor usage in this case is strongly
-recommended. `Buffer` is not overriden in this usecase, so linters won't get confused.
-
-## «Without footguns»?
-
-Well, it is still possible to do _some_ things with `Buffer` API, e.g. accessing `.buffer` property
-on older versions and duping things from there. You shouldn't do that in your code, probabably.
-
-The intention is to remove the most significant footguns that affect lots of packages in the
-ecosystem, and to do it in the proper way.
-
-Also, this package doesn't protect against security issues affecting some Node.js versions, so for
-usage in your own production code, it is still recommended to update to a Node.js version
-[supported by upstream](https://github.com/nodejs/release#release-schedule).
diff --git a/spaces/fffiloni/controlnet-animation-doodle/node_modules/socket.io/node_modules/ms/readme.md b/spaces/fffiloni/controlnet-animation-doodle/node_modules/socket.io/node_modules/ms/readme.md
deleted file mode 100644
index 9a1996b17e0de6854dd1cf10c5f2ee642e494085..0000000000000000000000000000000000000000
--- a/spaces/fffiloni/controlnet-animation-doodle/node_modules/socket.io/node_modules/ms/readme.md
+++ /dev/null
@@ -1,60 +0,0 @@
-# ms
-
-[![Build Status](https://travis-ci.org/zeit/ms.svg?branch=master)](https://travis-ci.org/zeit/ms)
-[![Join the community on Spectrum](https://withspectrum.github.io/badge/badge.svg)](https://spectrum.chat/zeit)
-
-Use this package to easily convert various time formats to milliseconds.
-
-## Examples
-
-```js
-ms('2 days')  // 172800000
-ms('1d')      // 86400000
-ms('10h')     // 36000000
-ms('2.5 hrs') // 9000000
-ms('2h')      // 7200000
-ms('1m')      // 60000
-ms('5s')      // 5000
-ms('1y')      // 31557600000
-ms('100')     // 100
-ms('-3 days') // -259200000
-ms('-1h')     // -3600000
-ms('-200')    // -200
-```
-
-### Convert from Milliseconds
-
-```js
-ms(60000)             // "1m"
-ms(2 * 60000)         // "2m"
-ms(-3 * 60000)        // "-3m"
-ms(ms('10 hours'))    // "10h"
-```
-
-### Time Format Written-Out
-
-```js
-ms(60000, { long: true })             // "1 minute"
-ms(2 * 60000, { long: true })         // "2 minutes"
-ms(-3 * 60000, { long: true })        // "-3 minutes"
-ms(ms('10 hours'), { long: true })    // "10 hours"
-```
-
-## Features
-
-- Works both in [Node.js](https://nodejs.org) and in the browser
-- If a number is supplied to `ms`, a string with a unit is returned
-- If a string that contains the number is supplied, it returns it as a number (e.g.: it returns `100` for `'100'`)
-- If you pass a string with a number and a valid unit, the number of equivalent milliseconds is returned
-
-## Related Packages
-
-- [ms.macro](https://github.com/knpwrs/ms.macro) - Run `ms` as a macro at build-time.
-
-## Caught a Bug?
-
-1. [Fork](https://help.github.com/articles/fork-a-repo/) this repository to your own GitHub account and then [clone](https://help.github.com/articles/cloning-a-repository/) it to your local device
-2. Link the package to the global module directory: `npm link`
-3. Within the module you want to test your local development instance of ms, just link it to the dependencies: `npm link ms`. Instead of the default one from npm, Node.js will now use your clone of ms!
-
-As always, you can run the tests using: `npm test`
diff --git a/spaces/fffiloni/text-2-music/utils.py b/spaces/fffiloni/text-2-music/utils.py
deleted file mode 100644
index 6fab4572bdf1e1bfb56c47f17093e9f3a2d087e9..0000000000000000000000000000000000000000
--- a/spaces/fffiloni/text-2-music/utils.py
+++ /dev/null
@@ -1,50 +0,0 @@
-import json
-import numpy as np
-import httpx
-
-from constants import MUBERT_TAGS, MUBERT_LICENSE, MUBERT_MODE, MUBERT_TOKEN
-
-
-def get_mubert_tags_embeddings(w2v_model):
-    return w2v_model.encode(MUBERT_TAGS)
-
-
-def get_pat(email: str):
-    r = httpx.post('https://api-b2b.mubert.com/v2/GetServiceAccess',
-                   json={
-                       "method": "GetServiceAccess",
-                       "params": {
-                           "email": email,
-                           "license": MUBERT_LICENSE,
-                           "token": MUBERT_TOKEN,
-                           "mode": MUBERT_MODE,
-                       }
-                   })
-
-    rdata = json.loads(r.text)
-    assert rdata['status'] == 1, "probably incorrect e-mail"
-    pat = rdata['data']['pat']
-    return pat
-
-
-def find_similar(em, embeddings, method='cosine'):
-    scores = []
-    for ref in embeddings:
-        if method == 'cosine':
-            scores.append(1 - np.dot(ref, em) / (np.linalg.norm(ref) * np.linalg.norm(em)))
-        if method == 'norm':
-            scores.append(np.linalg.norm(ref - em))
-    return np.array(scores), np.argsort(scores)
-
-
-def get_tags_for_prompts(w2v_model, mubert_tags_embeddings, prompts, top_n=3, debug=False):
-    prompts_embeddings = w2v_model.encode(prompts)
-    ret = []
-    for i, pe in enumerate(prompts_embeddings):
-        scores, idxs = find_similar(pe, mubert_tags_embeddings)
-        top_tags = MUBERT_TAGS[idxs[:top_n]]
-        top_prob = 1 - scores[idxs[:top_n]]
-        if debug:
-            print(f"Prompt: {prompts[i]}\nTags: {', '.join(top_tags)}\nScores: {top_prob}\n\n\n")
-        ret.append((prompts[i], list(top_tags)))
-    return ret
\ No newline at end of file
diff --git a/spaces/fjyczcr/bingai/README.md b/spaces/fjyczcr/bingai/README.md
deleted file mode 100644
index d58687938e30f2f8139a0f740f0747cfddbddd6c..0000000000000000000000000000000000000000
--- a/spaces/fjyczcr/bingai/README.md
+++ /dev/null
@@ -1,12 +0,0 @@
----
-title: BingAI
-emoji: 🏃
-colorFrom: red
-colorTo: gray
-sdk: docker
-pinned: false
-license: mit
-app_port: 8080
----
-
-Check out the configuration reference at https://huggingface.co/docs/hub/spaces-config-reference
diff --git a/spaces/florim/MedGPT/autogpt/token_counter.py b/spaces/florim/MedGPT/autogpt/token_counter.py
deleted file mode 100644
index 338fe6be4d47a679f2bf0815685edeb3dce66936..0000000000000000000000000000000000000000
--- a/spaces/florim/MedGPT/autogpt/token_counter.py
+++ /dev/null
@@ -1,73 +0,0 @@
-"""Functions for counting the number of tokens in a message or string."""
-from __future__ import annotations
-
-import tiktoken
-
-from autogpt.logs import logger
-
-
-def count_message_tokens(
-    messages: list[dict[str, str]], model: str = "gpt-3.5-turbo-0301"
-) -> int:
-    """
-    Returns the number of tokens used by a list of messages.
-
-    Args:
-        messages (list): A list of messages, each of which is a dictionary
-            containing the role and content of the message.
-        model (str): The name of the model to use for tokenization.
-            Defaults to "gpt-3.5-turbo-0301".
-
-    Returns:
-        int: The number of tokens used by the list of messages.
-    """
-    try:
-        encoding = tiktoken.encoding_for_model(model)
-    except KeyError:
-        logger.warn("Warning: model not found. Using cl100k_base encoding.")
-        encoding = tiktoken.get_encoding("cl100k_base")
-    if model == "gpt-3.5-turbo":
-        # !Note: gpt-3.5-turbo may change over time.
-        # Returning num tokens assuming gpt-3.5-turbo-0301.")
-        return count_message_tokens(messages, model="gpt-3.5-turbo-0301")
-    elif model == "gpt-4":
-        # !Note: gpt-4 may change over time. Returning num tokens assuming gpt-4-0314.")
-        return count_message_tokens(messages, model="gpt-4-0314")
-    elif model == "gpt-3.5-turbo-0301":
-        tokens_per_message = (
-            4  # every message follows <|start|>{role/name}\n{content}<|end|>\n
-        )
-        tokens_per_name = -1  # if there's a name, the role is omitted
-    elif model == "gpt-4-0314":
-        tokens_per_message = 3
-        tokens_per_name = 1
-    else:
-        raise NotImplementedError(
-            f"num_tokens_from_messages() is not implemented for model {model}.\n"
-            " See https://github.com/openai/openai-python/blob/main/chatml.md for"
-            " information on how messages are converted to tokens."
-        )
-    num_tokens = 0
-    for message in messages:
-        num_tokens += tokens_per_message
-        for key, value in message.items():
-            num_tokens += len(encoding.encode(value))
-            if key == "name":
-                num_tokens += tokens_per_name
-    num_tokens += 3  # every reply is primed with <|start|>assistant<|message|>
-    return num_tokens
-
-
-def count_string_tokens(string: str, model_name: str) -> int:
-    """
-    Returns the number of tokens in a text string.
-
-    Args:
-        string (str): The text string.
-        model_name (str): The name of the encoding to use. (e.g., "gpt-3.5-turbo")
-
-    Returns:
-        int: The number of tokens in the text string.
-    """
-    encoding = tiktoken.encoding_for_model(model_name)
-    return len(encoding.encode(string))
diff --git a/spaces/frncscp/bullerengue/musika/22kHz/layers.py b/spaces/frncscp/bullerengue/musika/22kHz/layers.py
deleted file mode 100644
index 84dda1c42791c5fda354ed2e487d1d3a1e9e23b7..0000000000000000000000000000000000000000
--- a/spaces/frncscp/bullerengue/musika/22kHz/layers.py
+++ /dev/null
@@ -1,165 +0,0 @@
-import tensorflow as tf
-import tensorflow.keras.backend as K
-from tensorflow.keras.layers import Conv2D, Conv2DTranspose, Dense
-from tensorflow.python.eager import context
-from tensorflow.python.ops import (
-    array_ops,
-    gen_math_ops,
-    math_ops,
-    sparse_ops,
-    standard_ops,
-)
-
-
-def l2normalize(v, eps=1e-12):
-    return v / (tf.norm(v) + eps)
-
-
-class ConvSN2D(tf.keras.layers.Conv2D):
-    def __init__(self, filters, kernel_size, power_iterations=1, datatype=tf.float32, **kwargs):
-        super(ConvSN2D, self).__init__(filters, kernel_size, **kwargs)
-        self.power_iterations = power_iterations
-        self.datatype = datatype
-
-    def build(self, input_shape):
-        super(ConvSN2D, self).build(input_shape)
-
-        if self.data_format == "channels_first":
-            channel_axis = 1
-        else:
-            channel_axis = -1
-
-        self.u = self.add_weight(
-            self.name + "_u",
-            shape=tuple([1, self.kernel.shape.as_list()[-1]]),
-            initializer=tf.initializers.RandomNormal(0, 1),
-            trainable=False,
-            dtype=self.dtype,
-        )
-
-    def compute_spectral_norm(self, W, new_u, W_shape):
-        for _ in range(self.power_iterations):
-
-            new_v = l2normalize(tf.matmul(new_u, tf.transpose(W)))
-            new_u = l2normalize(tf.matmul(new_v, W))
-
-        sigma = tf.matmul(tf.matmul(new_v, W), tf.transpose(new_u))
-        W_bar = W / sigma
-
-        with tf.control_dependencies([self.u.assign(new_u)]):
-            W_bar = tf.reshape(W_bar, W_shape)
-
-        return W_bar
-
-    def call(self, inputs):
-        W_shape = self.kernel.shape.as_list()
-        W_reshaped = tf.reshape(self.kernel, (-1, W_shape[-1]))
-        new_kernel = self.compute_spectral_norm(W_reshaped, self.u, W_shape)
-        outputs = self._convolution_op(inputs, new_kernel)
-
-        if self.use_bias:
-            if self.data_format == "channels_first":
-                outputs = tf.nn.bias_add(outputs, self.bias, data_format="NCHW")
-            else:
-                outputs = tf.nn.bias_add(outputs, self.bias, data_format="NHWC")
-        if self.activation is not None:
-            return self.activation(outputs)
-
-        return outputs
-
-
-class DenseSN(Dense):
-    def __init__(self, datatype=tf.float32, **kwargs):
-        super(DenseSN, self).__init__(**kwargs)
-        self.datatype = datatype
-
-    def build(self, input_shape):
-        super(DenseSN, self).build(input_shape)
-
-        self.u = self.add_weight(
-            self.name + "_u",
-            shape=tuple([1, self.kernel.shape.as_list()[-1]]),
-            initializer=tf.initializers.RandomNormal(0, 1),
-            trainable=False,
-            dtype=self.datatype,
-        )
-
-    def compute_spectral_norm(self, W, new_u, W_shape):
-        new_v = l2normalize(tf.matmul(new_u, tf.transpose(W)))
-        new_u = l2normalize(tf.matmul(new_v, W))
-        sigma = tf.matmul(tf.matmul(new_v, W), tf.transpose(new_u))
-        W_bar = W / sigma
-        with tf.control_dependencies([self.u.assign(new_u)]):
-            W_bar = tf.reshape(W_bar, W_shape)
-        return W_bar
-
-    def call(self, inputs):
-        W_shape = self.kernel.shape.as_list()
-        W_reshaped = tf.reshape(self.kernel, (-1, W_shape[-1]))
-        new_kernel = self.compute_spectral_norm(W_reshaped, self.u, W_shape)
-        rank = len(inputs.shape)
-        if rank > 2:
-            outputs = standard_ops.tensordot(inputs, new_kernel, [[rank - 1], [0]])
-            if not context.executing_eagerly():
-                shape = inputs.shape.as_list()
-                output_shape = shape[:-1] + [self.units]
-                outputs.set_shape(output_shape)
-        else:
-            inputs = math_ops.cast(inputs, self._compute_dtype)
-            if K.is_sparse(inputs):
-                outputs = sparse_ops.sparse_tensor_dense_matmul(inputs, new_kernel)
-            else:
-                outputs = gen_math_ops.mat_mul(inputs, new_kernel)
-        if self.use_bias:
-            outputs = tf.nn.bias_add(outputs, self.bias)
-        if self.activation is not None:
-            return self.activation(outputs)
-        return outputs
-
-
-class AddNoise(tf.keras.layers.Layer):
-    def __init__(self, datatype=tf.float32, **kwargs):
-        super(AddNoise, self).__init__(**kwargs)
-        self.datatype = datatype
-
-    def build(self, input_shape):
-        self.b = self.add_weight(
-            shape=[
-                1,
-            ],
-            initializer=tf.keras.initializers.zeros(),
-            trainable=True,
-            name="noise_weight",
-        )
-
-    def call(self, inputs):
-        rand = tf.random.normal(
-            [tf.shape(inputs)[0], inputs.shape[1], inputs.shape[2], 1],
-            mean=0.0,
-            stddev=1.0,
-            dtype=self.datatype,
-        )
-        output = inputs + self.b * rand
-        return output
-
-
-class PosEnc(tf.keras.layers.Layer):
-    def __init__(self, datatype=tf.float32, **kwargs):
-        super(PosEnc, self).__init__(**kwargs)
-        self.datatype = datatype
-
-    def call(self, inputs):
-        pos = tf.repeat(
-            tf.reshape(tf.range(inputs.shape[-3], dtype=tf.int32), [1, -1, 1, 1]),
-            inputs.shape[-2],
-            -2,
-        )
-        pos = tf.cast(tf.repeat(pos, tf.shape(inputs)[0], 0), self.dtype) / tf.cast(inputs.shape[-3], self.datatype)
-        return tf.concat([inputs, pos], -1)  # [bs,1,hop,2]
-
-
-def flatten_hw(x, data_format="channels_last"):
-    if data_format == "channels_last":
-        x = tf.transpose(x, perm=[0, 3, 1, 2])  # Convert to `channels_first`
-
-    old_shape = tf.shape(x)
diff --git a/spaces/georgefen/Face-Landmark-ControlNet/annotator/uniformer/mmseg/models/losses/__init__.py b/spaces/georgefen/Face-Landmark-ControlNet/annotator/uniformer/mmseg/models/losses/__init__.py
deleted file mode 100644
index beca72045694273d63465bac2f27dbc6672271db..0000000000000000000000000000000000000000
--- a/spaces/georgefen/Face-Landmark-ControlNet/annotator/uniformer/mmseg/models/losses/__init__.py
+++ /dev/null
@@ -1,12 +0,0 @@
-from .accuracy import Accuracy, accuracy
-from .cross_entropy_loss import (CrossEntropyLoss, binary_cross_entropy,
-                                 cross_entropy, mask_cross_entropy)
-from .dice_loss import DiceLoss
-from .lovasz_loss import LovaszLoss
-from .utils import reduce_loss, weight_reduce_loss, weighted_loss
-
-__all__ = [
-    'accuracy', 'Accuracy', 'cross_entropy', 'binary_cross_entropy',
-    'mask_cross_entropy', 'CrossEntropyLoss', 'reduce_loss',
-    'weight_reduce_loss', 'weighted_loss', 'LovaszLoss', 'DiceLoss'
-]
diff --git a/spaces/gotiQspiryo/whisper-ui/examples/BROKE PROTOCOL Online City RPG Full Crack [key Serial].md b/spaces/gotiQspiryo/whisper-ui/examples/BROKE PROTOCOL Online City RPG Full Crack [key Serial].md
deleted file mode 100644
index 099391eb1afabf80a21e51dfb67f34a24682e094..0000000000000000000000000000000000000000
--- a/spaces/gotiQspiryo/whisper-ui/examples/BROKE PROTOCOL Online City RPG Full Crack [key Serial].md	
+++ /dev/null
@@ -1,10 +0,0 @@
-<h2>BROKE PROTOCOL: Online City RPG full crack [key serial]</h2><br /><p><b><b>DOWNLOAD</b> &#8250; <a href="https://urlgoal.com/2uyMxE">https://urlgoal.com/2uyMxE</a></b></p><br /><br />
-
-1.1 NEW DOWNLOAD: Superjump Gravity 2 Hack Tool Full Cracked. Studio One 7.2 Professional 1.0 Free Download; Studio One Professional 7.2 Final Version 2017 [Updated Working Version] Full..
-
-April 5, 2020: Studio One 7.2 Free Download | Studio One 7.2 Professional Crack. Full Activation Version available from Media Market.. - Studio One 7.2 Professional. Studio One 7.2 Free Download [Up-to-date. Studio One 7.2 Professional 7.2 Keygen. Studio One 7.2 Professional.. Studio One 7.2 Key. Studio One 7.2 Professional. Studio One 7.2 Serial. Studio One 7.2 Crack. Studio One. New Release Studio One 7.2 Professional 7.2 Keygen. Studio One 7.2 Professional. Studio One. Studio One 7.2 Full. 2017 Studio One 7.2. Studio One 7.2 Professional. Studio One 7.2 Free Download. Studio One. Studio One 7.2 Serial. Studio One 7.2 Key.. Studio One 7.2 Professional. Studio One 7.2. Studio One 7.2 Professional 7.2 Keygen.. Studio One 7.2 Professional. Studio One. Studio One 7.2 Professional 7.2 Keygen. Studio One 7.2 Professional..
-
-April 6, 2020: Studio One Professional v7.2 (Final). Hack Studio One 7.2 professional version free.. - Studio One Professional 7.2 Full Crack. Studio One 7.2 Professional 7.2 Keygen.. Studio One 7.2 Professional. Studio One 7.2 Full. Download Studio One 7.2 Professional 7.2 Serial. Studio One 7.2. Studio One 7.2 Professional 7.2 Full Cracked.. Studio One 7.2 Professional 7.2 Free Download.. Studio One. 2017 Studio One 7.2. Studio One 7.2 Professional 7.2. Studio One 7.2 Professional 7.2. Studio One. Studio One 7.2 Professional 7.2 Key. Studio One. Studio One 7.2 Professional 7.2 Keygen.. Studio One. Studio One 7.2 Professional 7.2 Keygen. Studio One 7.2 Professional. Studio One 7.2 Professional 7.2 Keygen. Studio One 7.2 Professional 7.2 Keygen. Studio One. Studio One 7.2 Professional 7.2 Keygen. Studio 4fefd39f24<br />
-<br />
-<br />
-<p></p>
diff --git a/spaces/gotiQspiryo/whisper-ui/examples/Free Download Game Football Manager 2007 Full !LINK! 91.md b/spaces/gotiQspiryo/whisper-ui/examples/Free Download Game Football Manager 2007 Full !LINK! 91.md
deleted file mode 100644
index cd5115f4b476415f42b822a5d3a5b3e220e0846f..0000000000000000000000000000000000000000
--- a/spaces/gotiQspiryo/whisper-ui/examples/Free Download Game Football Manager 2007 Full !LINK! 91.md	
+++ /dev/null
@@ -1,6 +0,0 @@
-<h2>free download game football manager 2007 full 91</h2><br /><p><b><b>Download</b> &#10038; <a href="https://urlgoal.com/2uyMNX">https://urlgoal.com/2uyMNX</a></b></p><br /><br />
-
-Association football, more commonly known as simply football or soccer is a team sport played ... The FIFA Women's World Cup was inaugurated in 1991 and has been held every four ... Football is generally a free-flowing game, with play stopping only when the ball has left the ... The end of the match is known as full-time. 1fdad05405<br />
-<br />
-<br />
-<p></p>
diff --git a/spaces/gradio/HuBERT/examples/noisychannel/rerank_generate.py b/spaces/gradio/HuBERT/examples/noisychannel/rerank_generate.py
deleted file mode 100644
index daeeae059a677a9fcd7c370be087f1f5c189bc52..0000000000000000000000000000000000000000
--- a/spaces/gradio/HuBERT/examples/noisychannel/rerank_generate.py
+++ /dev/null
@@ -1,397 +0,0 @@
-#!/usr/bin/env python3 -u
-# Copyright (c) Facebook, Inc. and its affiliates.
-#
-# This source code is licensed under the MIT license found in the
-# LICENSE file in the root directory of this source tree.
-
-"""
-Generate n-best translations using a trained model.
-"""
-
-import os
-import subprocess
-from contextlib import redirect_stdout
-
-from fairseq import options
-from fairseq_cli import generate, preprocess
-
-from examples.noisychannel import rerank_options, rerank_utils
-
-
-def gen_and_reprocess_nbest(args):
-    if args.score_dict_dir is None:
-        args.score_dict_dir = args.data
-    if args.prefix_len is not None:
-        assert (
-            args.right_to_left1 is False
-        ), "prefix length not compatible with right to left models"
-        assert (
-            args.right_to_left2 is False
-        ), "prefix length not compatible with right to left models"
-
-    if args.nbest_list is not None:
-        assert args.score_model2 is None
-
-    if args.backwards1:
-        scorer1_src = args.target_lang
-        scorer1_tgt = args.source_lang
-    else:
-        scorer1_src = args.source_lang
-        scorer1_tgt = args.target_lang
-
-    store_data = (
-        os.path.join(os.path.dirname(__file__)) + "/rerank_data/" + args.data_dir_name
-    )
-    if not os.path.exists(store_data):
-        os.makedirs(store_data)
-
-    (
-        pre_gen,
-        left_to_right_preprocessed_dir,
-        right_to_left_preprocessed_dir,
-        backwards_preprocessed_dir,
-        lm_preprocessed_dir,
-    ) = rerank_utils.get_directories(
-        args.data_dir_name,
-        args.num_rescore,
-        args.gen_subset,
-        args.gen_model_name,
-        args.shard_id,
-        args.num_shards,
-        args.sampling,
-        args.prefix_len,
-        args.target_prefix_frac,
-        args.source_prefix_frac,
-    )
-    assert not (
-        args.right_to_left1 and args.backwards1
-    ), "backwards right to left not supported"
-    assert not (
-        args.right_to_left2 and args.backwards2
-    ), "backwards right to left not supported"
-    assert not (
-        args.prefix_len is not None and args.target_prefix_frac is not None
-    ), "target prefix frac and target prefix len incompatible"
-
-    # make directory to store generation results
-    if not os.path.exists(pre_gen):
-        os.makedirs(pre_gen)
-
-    rerank1_is_gen = (
-        args.gen_model == args.score_model1 and args.source_prefix_frac is None
-    )
-    rerank2_is_gen = (
-        args.gen_model == args.score_model2 and args.source_prefix_frac is None
-    )
-
-    if args.nbest_list is not None:
-        rerank2_is_gen = True
-
-    # make directories to store preprossed nbest list for reranking
-    if not os.path.exists(left_to_right_preprocessed_dir):
-        os.makedirs(left_to_right_preprocessed_dir)
-    if not os.path.exists(right_to_left_preprocessed_dir):
-        os.makedirs(right_to_left_preprocessed_dir)
-    if not os.path.exists(lm_preprocessed_dir):
-        os.makedirs(lm_preprocessed_dir)
-    if not os.path.exists(backwards_preprocessed_dir):
-        os.makedirs(backwards_preprocessed_dir)
-
-    score1_file = rerank_utils.rescore_file_name(
-        pre_gen,
-        args.prefix_len,
-        args.model1_name,
-        target_prefix_frac=args.target_prefix_frac,
-        source_prefix_frac=args.source_prefix_frac,
-        backwards=args.backwards1,
-    )
-    if args.score_model2 is not None:
-        score2_file = rerank_utils.rescore_file_name(
-            pre_gen,
-            args.prefix_len,
-            args.model2_name,
-            target_prefix_frac=args.target_prefix_frac,
-            source_prefix_frac=args.source_prefix_frac,
-            backwards=args.backwards2,
-        )
-
-    predictions_bpe_file = pre_gen + "/generate_output_bpe.txt"
-
-    using_nbest = args.nbest_list is not None
-
-    if using_nbest:
-        print("Using predefined n-best list from interactive.py")
-        predictions_bpe_file = args.nbest_list
-
-    else:
-        if not os.path.isfile(predictions_bpe_file):
-            print("STEP 1: generate predictions using the p(T|S) model with bpe")
-            print(args.data)
-            param1 = [
-                args.data,
-                "--path",
-                args.gen_model,
-                "--shard-id",
-                str(args.shard_id),
-                "--num-shards",
-                str(args.num_shards),
-                "--nbest",
-                str(args.num_rescore),
-                "--batch-size",
-                str(args.batch_size),
-                "--beam",
-                str(args.num_rescore),
-                "--batch-size",
-                str(args.num_rescore),
-                "--gen-subset",
-                args.gen_subset,
-                "--source-lang",
-                args.source_lang,
-                "--target-lang",
-                args.target_lang,
-            ]
-            if args.sampling:
-                param1 += ["--sampling"]
-
-            gen_parser = options.get_generation_parser()
-            input_args = options.parse_args_and_arch(gen_parser, param1)
-
-            print(input_args)
-            with open(predictions_bpe_file, "w") as f:
-                with redirect_stdout(f):
-                    generate.main(input_args)
-
-    gen_output = rerank_utils.BitextOutputFromGen(
-        predictions_bpe_file,
-        bpe_symbol=args.post_process,
-        nbest=using_nbest,
-        prefix_len=args.prefix_len,
-        target_prefix_frac=args.target_prefix_frac,
-    )
-
-    if args.diff_bpe:
-        rerank_utils.write_reprocessed(
-            gen_output.no_bpe_source,
-            gen_output.no_bpe_hypo,
-            gen_output.no_bpe_target,
-            pre_gen + "/source_gen_bpe." + args.source_lang,
-            pre_gen + "/target_gen_bpe." + args.target_lang,
-            pre_gen + "/reference_gen_bpe." + args.target_lang,
-        )
-        bitext_bpe = args.rescore_bpe_code
-        bpe_src_param = [
-            "-c",
-            bitext_bpe,
-            "--input",
-            pre_gen + "/source_gen_bpe." + args.source_lang,
-            "--output",
-            pre_gen + "/rescore_data." + args.source_lang,
-        ]
-        bpe_tgt_param = [
-            "-c",
-            bitext_bpe,
-            "--input",
-            pre_gen + "/target_gen_bpe." + args.target_lang,
-            "--output",
-            pre_gen + "/rescore_data." + args.target_lang,
-        ]
-
-        subprocess.call(
-            [
-                "python",
-                os.path.join(
-                    os.path.dirname(__file__), "subword-nmt/subword_nmt/apply_bpe.py"
-                ),
-            ]
-            + bpe_src_param,
-            shell=False,
-        )
-
-        subprocess.call(
-            [
-                "python",
-                os.path.join(
-                    os.path.dirname(__file__), "subword-nmt/subword_nmt/apply_bpe.py"
-                ),
-            ]
-            + bpe_tgt_param,
-            shell=False,
-        )
-
-    if (not os.path.isfile(score1_file) and not rerank1_is_gen) or (
-        args.score_model2 is not None
-        and not os.path.isfile(score2_file)
-        and not rerank2_is_gen
-    ):
-        print(
-            "STEP 2: process the output of generate.py so we have clean text files with the translations"
-        )
-
-        rescore_file = "/rescore_data"
-        if args.prefix_len is not None:
-            prefix_len_rescore_file = rescore_file + "prefix" + str(args.prefix_len)
-        if args.target_prefix_frac is not None:
-            target_prefix_frac_rescore_file = (
-                rescore_file + "target_prefix_frac" + str(args.target_prefix_frac)
-            )
-        if args.source_prefix_frac is not None:
-            source_prefix_frac_rescore_file = (
-                rescore_file + "source_prefix_frac" + str(args.source_prefix_frac)
-            )
-
-        if not args.right_to_left1 or not args.right_to_left2:
-            if not args.diff_bpe:
-                rerank_utils.write_reprocessed(
-                    gen_output.source,
-                    gen_output.hypo,
-                    gen_output.target,
-                    pre_gen + rescore_file + "." + args.source_lang,
-                    pre_gen + rescore_file + "." + args.target_lang,
-                    pre_gen + "/reference_file",
-                    bpe_symbol=args.post_process,
-                )
-                if args.prefix_len is not None:
-                    bw_rescore_file = prefix_len_rescore_file
-                    rerank_utils.write_reprocessed(
-                        gen_output.source,
-                        gen_output.hypo,
-                        gen_output.target,
-                        pre_gen + prefix_len_rescore_file + "." + args.source_lang,
-                        pre_gen + prefix_len_rescore_file + "." + args.target_lang,
-                        pre_gen + "/reference_file",
-                        prefix_len=args.prefix_len,
-                        bpe_symbol=args.post_process,
-                    )
-                elif args.target_prefix_frac is not None:
-                    bw_rescore_file = target_prefix_frac_rescore_file
-                    rerank_utils.write_reprocessed(
-                        gen_output.source,
-                        gen_output.hypo,
-                        gen_output.target,
-                        pre_gen
-                        + target_prefix_frac_rescore_file
-                        + "."
-                        + args.source_lang,
-                        pre_gen
-                        + target_prefix_frac_rescore_file
-                        + "."
-                        + args.target_lang,
-                        pre_gen + "/reference_file",
-                        bpe_symbol=args.post_process,
-                        target_prefix_frac=args.target_prefix_frac,
-                    )
-                else:
-                    bw_rescore_file = rescore_file
-
-                if args.source_prefix_frac is not None:
-                    fw_rescore_file = source_prefix_frac_rescore_file
-                    rerank_utils.write_reprocessed(
-                        gen_output.source,
-                        gen_output.hypo,
-                        gen_output.target,
-                        pre_gen
-                        + source_prefix_frac_rescore_file
-                        + "."
-                        + args.source_lang,
-                        pre_gen
-                        + source_prefix_frac_rescore_file
-                        + "."
-                        + args.target_lang,
-                        pre_gen + "/reference_file",
-                        bpe_symbol=args.post_process,
-                        source_prefix_frac=args.source_prefix_frac,
-                    )
-                else:
-                    fw_rescore_file = rescore_file
-
-        if args.right_to_left1 or args.right_to_left2:
-            rerank_utils.write_reprocessed(
-                gen_output.source,
-                gen_output.hypo,
-                gen_output.target,
-                pre_gen + "/right_to_left_rescore_data." + args.source_lang,
-                pre_gen + "/right_to_left_rescore_data." + args.target_lang,
-                pre_gen + "/right_to_left_reference_file",
-                right_to_left=True,
-                bpe_symbol=args.post_process,
-            )
-
-        print("STEP 3: binarize the translations")
-        if (
-            not args.right_to_left1
-            or args.score_model2 is not None
-            and not args.right_to_left2
-            or not rerank1_is_gen
-        ):
-
-            if args.backwards1 or args.backwards2:
-                if args.backwards_score_dict_dir is not None:
-                    bw_dict = args.backwards_score_dict_dir
-                else:
-                    bw_dict = args.score_dict_dir
-                bw_preprocess_param = [
-                    "--source-lang",
-                    scorer1_src,
-                    "--target-lang",
-                    scorer1_tgt,
-                    "--trainpref",
-                    pre_gen + bw_rescore_file,
-                    "--srcdict",
-                    bw_dict + "/dict." + scorer1_src + ".txt",
-                    "--tgtdict",
-                    bw_dict + "/dict." + scorer1_tgt + ".txt",
-                    "--destdir",
-                    backwards_preprocessed_dir,
-                ]
-                preprocess_parser = options.get_preprocessing_parser()
-                input_args = preprocess_parser.parse_args(bw_preprocess_param)
-                preprocess.main(input_args)
-
-            preprocess_param = [
-                "--source-lang",
-                scorer1_src,
-                "--target-lang",
-                scorer1_tgt,
-                "--trainpref",
-                pre_gen + fw_rescore_file,
-                "--srcdict",
-                args.score_dict_dir + "/dict." + scorer1_src + ".txt",
-                "--tgtdict",
-                args.score_dict_dir + "/dict." + scorer1_tgt + ".txt",
-                "--destdir",
-                left_to_right_preprocessed_dir,
-            ]
-            preprocess_parser = options.get_preprocessing_parser()
-            input_args = preprocess_parser.parse_args(preprocess_param)
-            preprocess.main(input_args)
-
-        if args.right_to_left1 or args.right_to_left2:
-            preprocess_param = [
-                "--source-lang",
-                scorer1_src,
-                "--target-lang",
-                scorer1_tgt,
-                "--trainpref",
-                pre_gen + "/right_to_left_rescore_data",
-                "--srcdict",
-                args.score_dict_dir + "/dict." + scorer1_src + ".txt",
-                "--tgtdict",
-                args.score_dict_dir + "/dict." + scorer1_tgt + ".txt",
-                "--destdir",
-                right_to_left_preprocessed_dir,
-            ]
-            preprocess_parser = options.get_preprocessing_parser()
-            input_args = preprocess_parser.parse_args(preprocess_param)
-            preprocess.main(input_args)
-
-    return gen_output
-
-
-def cli_main():
-    parser = rerank_options.get_reranking_parser()
-    args = options.parse_args_and_arch(parser)
-    gen_and_reprocess_nbest(args)
-
-
-if __name__ == "__main__":
-    cli_main()
diff --git a/spaces/gradio/HuBERT/examples/speech_recognition/__init__.py b/spaces/gradio/HuBERT/examples/speech_recognition/__init__.py
deleted file mode 100644
index 0278f6a27340c7ff7e207d09348483d1b0d3a100..0000000000000000000000000000000000000000
--- a/spaces/gradio/HuBERT/examples/speech_recognition/__init__.py
+++ /dev/null
@@ -1 +0,0 @@
-from . import criterions, models, tasks  # noqa
diff --git a/spaces/grisiemjahand/Image-and-3D-Model-Creator/PIFu/apps/eval_spaces.py b/spaces/grisiemjahand/Image-and-3D-Model-Creator/PIFu/apps/eval_spaces.py
deleted file mode 100644
index b0cf689d24f70d95aa0d491fd04987296802e492..0000000000000000000000000000000000000000
--- a/spaces/grisiemjahand/Image-and-3D-Model-Creator/PIFu/apps/eval_spaces.py
+++ /dev/null
@@ -1,138 +0,0 @@
-import sys
-import os
-
-sys.path.insert(0, os.path.abspath(os.path.join(os.path.dirname(__file__), '..')))
-ROOT_PATH = os.path.dirname(os.path.dirname(os.path.abspath(__file__)))
-
-import time
-import json
-import numpy as np
-import torch
-from torch.utils.data import DataLoader
-
-from lib.options import BaseOptions
-from lib.mesh_util import *
-from lib.sample_util import *
-from lib.train_util import *
-from lib.model import *
-
-from PIL import Image
-import torchvision.transforms as transforms
-
-import trimesh
-from datetime import datetime
-
-# get options
-opt = BaseOptions().parse()
-
-class Evaluator:
-    def __init__(self, opt, projection_mode='orthogonal'):
-        self.opt = opt
-        self.load_size = self.opt.loadSize
-        self.to_tensor = transforms.Compose([
-            transforms.Resize(self.load_size),
-            transforms.ToTensor(),
-            transforms.Normalize((0.5, 0.5, 0.5), (0.5, 0.5, 0.5))
-        ])
-        # set cuda
-        cuda = torch.device('cuda:%d' % opt.gpu_id) if torch.cuda.is_available() else torch.device('cpu')
-        print("CUDDAAAAA ???",  torch.cuda.get_device_name(0) if torch.cuda.is_available()  else "NO ONLY CPU")
-  
-        # create net
-        netG = HGPIFuNet(opt, projection_mode).to(device=cuda)
-        print('Using Network: ', netG.name)
-
-        if opt.load_netG_checkpoint_path:
-            netG.load_state_dict(torch.load(opt.load_netG_checkpoint_path, map_location=cuda))
-
-        if opt.load_netC_checkpoint_path is not None:
-            print('loading for net C ...', opt.load_netC_checkpoint_path)
-            netC = ResBlkPIFuNet(opt).to(device=cuda)
-            netC.load_state_dict(torch.load(opt.load_netC_checkpoint_path, map_location=cuda))
-        else:
-            netC = None
-
-        os.makedirs(opt.results_path, exist_ok=True)
-        os.makedirs('%s/%s' % (opt.results_path, opt.name), exist_ok=True)
-
-        opt_log = os.path.join(opt.results_path, opt.name, 'opt.txt')
-        with open(opt_log, 'w') as outfile:
-            outfile.write(json.dumps(vars(opt), indent=2))
-
-        self.cuda = cuda
-        self.netG = netG
-        self.netC = netC
-
-    def load_image(self, image_path, mask_path):
-        # Name
-        img_name = os.path.splitext(os.path.basename(image_path))[0]
-        # Calib
-        B_MIN = np.array([-1, -1, -1])
-        B_MAX = np.array([1, 1, 1])
-        projection_matrix = np.identity(4)
-        projection_matrix[1, 1] = -1
-        calib = torch.Tensor(projection_matrix).float()
-        # Mask
-        mask = Image.open(mask_path).convert('L')
-        mask = transforms.Resize(self.load_size)(mask)
-        mask = transforms.ToTensor()(mask).float()
-        # image
-        image = Image.open(image_path).convert('RGB')
-        image = self.to_tensor(image)
-        image = mask.expand_as(image) * image
-        return {
-            'name': img_name,
-            'img': image.unsqueeze(0),
-            'calib': calib.unsqueeze(0),
-            'mask': mask.unsqueeze(0),
-            'b_min': B_MIN,
-            'b_max': B_MAX,
-        }
-
-    def eval(self, data, use_octree=False):
-        '''
-        Evaluate a data point
-        :param data: a dict containing at least ['name'], ['image'], ['calib'], ['b_min'] and ['b_max'] tensors.
-        :return:
-        '''
-        opt = self.opt
-        with torch.no_grad():
-            self.netG.eval()
-            if self.netC:
-                self.netC.eval()
-            save_path = '%s/%s/result_%s.obj' % (opt.results_path, opt.name, data['name'])
-            if self.netC:
-                gen_mesh_color(opt, self.netG, self.netC, self.cuda, data, save_path, use_octree=use_octree)
-            else:
-                gen_mesh(opt, self.netG, self.cuda, data, save_path, use_octree=use_octree)
-
-
-if __name__ == '__main__':
-    evaluator = Evaluator(opt)
-
-    results_path = opt.results_path
-    name = opt.name
-    test_image_path = opt.img_path
-    test_mask_path = test_image_path[:-4] +'_mask.png'
-    test_img_name = os.path.splitext(os.path.basename(test_image_path))[0]
-    print("test_image: ", test_image_path)
-    print("test_mask: ", test_mask_path)
-
-    try:
-        time = datetime.now()
-        print("evaluating" , time)
-        data = evaluator.load_image(test_image_path, test_mask_path)
-        evaluator.eval(data, False)
-        print("done evaluating" , datetime.now() - time)
-    except Exception as e:
-        print("error:", e.args)
-
-    try:
-        mesh = trimesh.load(f'{results_path}/{name}/result_{test_img_name}.obj')
-        mesh.apply_transform([[1, 0, 0, 0],
-        [0, 1, 0, 0],
-        [0, 0, -1, 0],
-        [0, 0, 0, 1]])
-        mesh.export(file_obj=f'{results_path}/{name}/result_{test_img_name}.glb')
-    except Exception as e:
-        print("error generating MESH", e)
diff --git a/spaces/gsaivinay/Llama-2-13B-GGML-UI/components/Chat/ChatInput.tsx b/spaces/gsaivinay/Llama-2-13B-GGML-UI/components/Chat/ChatInput.tsx
deleted file mode 100644
index 48006ca0ef77d424c10d14417b38b7300204e286..0000000000000000000000000000000000000000
--- a/spaces/gsaivinay/Llama-2-13B-GGML-UI/components/Chat/ChatInput.tsx
+++ /dev/null
@@ -1,387 +0,0 @@
-import {
-  IconArrowDown,
-  IconBolt,
-  IconBrandGoogle,
-  IconPlayerStop,
-  IconRepeat,
-  IconSend,
-} from '@tabler/icons-react';
-import {
-  KeyboardEvent,
-  MutableRefObject,
-  useCallback,
-  useContext,
-  useEffect,
-  useRef,
-  useState,
-} from 'react';
-
-import { useTranslation } from 'next-i18next';
-
-import { Message } from '@/types/chat';
-import { Plugin } from '@/types/plugin';
-import { Prompt } from '@/types/prompt';
-
-import HomeContext from '@/pages/api/home/home.context';
-
-import { PluginSelect } from './PluginSelect';
-import { PromptList } from './PromptList';
-import { VariableModal } from './VariableModal';
-
-interface Props {
-  onSend: (message: Message, plugin: Plugin | null) => void;
-  onRegenerate: () => void;
-  onScrollDownClick: () => void;
-  stopConversationRef: MutableRefObject<boolean>;
-  textareaRef: MutableRefObject<HTMLTextAreaElement | null>;
-  showScrollDownButton: boolean;
-}
-
-export const ChatInput = ({
-  onSend,
-  onRegenerate,
-  onScrollDownClick,
-  stopConversationRef,
-  textareaRef,
-  showScrollDownButton,
-}: Props) => {
-  const { t } = useTranslation('chat');
-
-  const {
-    state: { selectedConversation, messageIsStreaming, prompts },
-
-    dispatch: homeDispatch,
-  } = useContext(HomeContext);
-
-  const [content, setContent] = useState<string>();
-  const [isTyping, setIsTyping] = useState<boolean>(false);
-  const [showPromptList, setShowPromptList] = useState(false);
-  const [activePromptIndex, setActivePromptIndex] = useState(0);
-  const [promptInputValue, setPromptInputValue] = useState('');
-  const [variables, setVariables] = useState<string[]>([]);
-  const [isModalVisible, setIsModalVisible] = useState(false);
-  const [showPluginSelect, setShowPluginSelect] = useState(false);
-  const [plugin, setPlugin] = useState<Plugin | null>(null);
-
-  const promptListRef = useRef<HTMLUListElement | null>(null);
-
-  const filteredPrompts = prompts.filter((prompt) =>
-    prompt.name.toLowerCase().includes(promptInputValue.toLowerCase()),
-  );
-
-  const handleChange = (e: React.ChangeEvent<HTMLTextAreaElement>) => {
-    const value = e.target.value;
-    const maxLength = selectedConversation?.model.maxLength;
-
-    if (maxLength && value.length > maxLength) {
-      alert(
-        t(
-          `Message limit is {{maxLength}} characters. You have entered {{valueLength}} characters.`,
-          { maxLength, valueLength: value.length },
-        ),
-      );
-      return;
-    }
-
-    setContent(value);
-    updatePromptListVisibility(value);
-  };
-
-  const handleSend = () => {
-    if (messageIsStreaming) {
-      return;
-    }
-
-    if (!content) {
-      alert(t('Please enter a message'));
-      return;
-    }
-
-    onSend({ role: 'user', content }, plugin);
-    setContent('');
-    setPlugin(null);
-
-    if (window.innerWidth < 640 && textareaRef && textareaRef.current) {
-      textareaRef.current.blur();
-    }
-  };
-
-  const handleStopConversation = () => {
-    stopConversationRef.current = true;
-    setTimeout(() => {
-      stopConversationRef.current = false;
-    }, 1000);
-  };
-
-  const isMobile = () => {
-    const userAgent =
-      typeof window.navigator === 'undefined' ? '' : navigator.userAgent;
-    const mobileRegex =
-      /Android|webOS|iPhone|iPad|iPod|BlackBerry|IEMobile|Opera Mini|Mobile|mobile|CriOS/i;
-    return mobileRegex.test(userAgent);
-  };
-
-  const handleInitModal = () => {
-    const selectedPrompt = filteredPrompts[activePromptIndex];
-    if (selectedPrompt) {
-      setContent((prevContent) => {
-        const newContent = prevContent?.replace(
-          /\/\w*$/,
-          selectedPrompt.content,
-        );
-        return newContent;
-      });
-      handlePromptSelect(selectedPrompt);
-    }
-    setShowPromptList(false);
-  };
-
-  const handleKeyDown = (e: KeyboardEvent<HTMLTextAreaElement>) => {
-    if (showPromptList) {
-      if (e.key === 'ArrowDown') {
-        e.preventDefault();
-        setActivePromptIndex((prevIndex) =>
-          prevIndex < prompts.length - 1 ? prevIndex + 1 : prevIndex,
-        );
-      } else if (e.key === 'ArrowUp') {
-        e.preventDefault();
-        setActivePromptIndex((prevIndex) =>
-          prevIndex > 0 ? prevIndex - 1 : prevIndex,
-        );
-      } else if (e.key === 'Tab') {
-        e.preventDefault();
-        setActivePromptIndex((prevIndex) =>
-          prevIndex < prompts.length - 1 ? prevIndex + 1 : 0,
-        );
-      } else if (e.key === 'Enter') {
-        e.preventDefault();
-        handleInitModal();
-      } else if (e.key === 'Escape') {
-        e.preventDefault();
-        setShowPromptList(false);
-      } else {
-        setActivePromptIndex(0);
-      }
-    } else if (e.key === 'Enter' && !isTyping && !isMobile() && !e.shiftKey) {
-      e.preventDefault();
-      handleSend();
-    } else if (e.key === '/' && e.metaKey) {
-      e.preventDefault();
-      setShowPluginSelect(!showPluginSelect);
-    }
-  };
-
-  const parseVariables = (content: string) => {
-    const regex = /{{(.*?)}}/g;
-    const foundVariables = [];
-    let match;
-
-    while ((match = regex.exec(content)) !== null) {
-      foundVariables.push(match[1]);
-    }
-
-    return foundVariables;
-  };
-
-  const updatePromptListVisibility = useCallback((text: string) => {
-    const match = text.match(/\/\w*$/);
-
-    if (match) {
-      setShowPromptList(true);
-      setPromptInputValue(match[0].slice(1));
-    } else {
-      setShowPromptList(false);
-      setPromptInputValue('');
-    }
-  }, []);
-
-  const handlePromptSelect = (prompt: Prompt) => {
-    const parsedVariables = parseVariables(prompt.content);
-    setVariables(parsedVariables);
-
-    if (parsedVariables.length > 0) {
-      setIsModalVisible(true);
-    } else {
-      setContent((prevContent) => {
-        const updatedContent = prevContent?.replace(/\/\w*$/, prompt.content);
-        return updatedContent;
-      });
-      updatePromptListVisibility(prompt.content);
-    }
-  };
-
-  const handleSubmit = (updatedVariables: string[]) => {
-    const newContent = content?.replace(/{{(.*?)}}/g, (match, variable) => {
-      const index = variables.indexOf(variable);
-      return updatedVariables[index];
-    });
-
-    setContent(newContent);
-
-    if (textareaRef && textareaRef.current) {
-      textareaRef.current.focus();
-    }
-  };
-
-  useEffect(() => {
-    if (promptListRef.current) {
-      promptListRef.current.scrollTop = activePromptIndex * 30;
-    }
-  }, [activePromptIndex]);
-
-  useEffect(() => {
-    if (textareaRef && textareaRef.current) {
-      textareaRef.current.style.height = 'inherit';
-      textareaRef.current.style.height = `${textareaRef.current?.scrollHeight}px`;
-      textareaRef.current.style.overflow = `${
-        textareaRef?.current?.scrollHeight > 400 ? 'auto' : 'hidden'
-      }`;
-    }
-  }, [content]);
-
-  useEffect(() => {
-    const handleOutsideClick = (e: MouseEvent) => {
-      if (
-        promptListRef.current &&
-        !promptListRef.current.contains(e.target as Node)
-      ) {
-        setShowPromptList(false);
-      }
-    };
-
-    window.addEventListener('click', handleOutsideClick);
-
-    return () => {
-      window.removeEventListener('click', handleOutsideClick);
-    };
-  }, []);
-
-  return (
-    <div className="absolute bottom-0 left-0 w-full border-transparent bg-gradient-to-b from-transparent via-white to-white pt-6 dark:border-white/20 dark:via-[#343541] dark:to-[#343541] md:pt-2">
-      <div className="stretch mx-2 mt-4 flex flex-row gap-3 last:mb-2 md:mx-4 md:mt-[52px] md:last:mb-6 lg:mx-auto lg:max-w-3xl">
-        {messageIsStreaming && (
-          <button
-            className="absolute top-0 left-0 right-0 mx-auto mb-3 flex w-fit items-center gap-3 rounded border border-neutral-200 bg-white py-2 px-4 text-black hover:opacity-50 dark:border-neutral-600 dark:bg-[#343541] dark:text-white md:mb-0 md:mt-2"
-            onClick={handleStopConversation}
-          >
-            <IconPlayerStop size={16} /> {t('Stop Generating')}
-          </button>
-        )}
-
-        {!messageIsStreaming &&
-          selectedConversation &&
-          selectedConversation.messages.length > 0 && (
-            <button
-              className="absolute top-0 left-0 right-0 mx-auto mb-3 flex w-fit items-center gap-3 rounded border border-neutral-200 bg-white py-2 px-4 text-black hover:opacity-50 dark:border-neutral-600 dark:bg-[#343541] dark:text-white md:mb-0 md:mt-2"
-              onClick={onRegenerate}
-            >
-              <IconRepeat size={16} /> {t('Regenerate response')}
-            </button>
-          )}
-
-        <div className="relative mx-2 flex w-full flex-grow flex-col rounded-md border border-black/10 bg-white shadow-[0_0_10px_rgba(0,0,0,0.10)] dark:border-gray-900/50 dark:bg-[#40414F] dark:text-white dark:shadow-[0_0_15px_rgba(0,0,0,0.10)] sm:mx-4">
-          <button
-            className="absolute left-2 top-2 rounded-sm p-1 text-neutral-800 opacity-60 hover:bg-neutral-200 hover:text-neutral-900 dark:bg-opacity-50 dark:text-neutral-100 dark:hover:text-neutral-200"
-            onClick={() => setShowPluginSelect(!showPluginSelect)}
-            onKeyDown={(e) => {}}
-          >
-            {plugin ? <IconBrandGoogle size={20} /> : <IconBolt size={20} />}
-          </button>
-
-          {showPluginSelect && (
-            <div className="absolute left-0 bottom-14 rounded bg-white dark:bg-[#343541]">
-              <PluginSelect
-                plugin={plugin}
-                onKeyDown={(e: any) => {
-                  if (e.key === 'Escape') {
-                    e.preventDefault();
-                    setShowPluginSelect(false);
-                    textareaRef.current?.focus();
-                  }
-                }}
-                onPluginChange={(plugin: Plugin) => {
-                  setPlugin(plugin);
-                  setShowPluginSelect(false);
-
-                  if (textareaRef && textareaRef.current) {
-                    textareaRef.current.focus();
-                  }
-                }}
-              />
-            </div>
-          )}
-
-          <textarea
-            ref={textareaRef}
-            className="m-0 w-full resize-none border-0 bg-transparent p-0 py-2 pr-8 pl-10 text-black dark:bg-transparent dark:text-white md:py-3 md:pl-10"
-            style={{
-              resize: 'none',
-              bottom: `${textareaRef?.current?.scrollHeight}px`,
-              maxHeight: '400px',
-              overflow: `${
-                textareaRef.current && textareaRef.current.scrollHeight > 400
-                  ? 'auto'
-                  : 'hidden'
-              }`,
-            }}
-            placeholder={
-              t('Type a message or type "/" to select a prompt...') || ''
-            }
-            value={content}
-            rows={1}
-            onCompositionStart={() => setIsTyping(true)}
-            onCompositionEnd={() => setIsTyping(false)}
-            onChange={handleChange}
-            onKeyDown={handleKeyDown}
-          />
-
-          <button
-            className="absolute right-2 top-2 rounded-sm p-1 text-neutral-800 opacity-60 hover:bg-neutral-200 hover:text-neutral-900 dark:bg-opacity-50 dark:text-neutral-100 dark:hover:text-neutral-200"
-            onClick={handleSend}
-          >
-            {messageIsStreaming ? (
-              <div className="h-4 w-4 animate-spin rounded-full border-t-2 border-neutral-800 opacity-60 dark:border-neutral-100"></div>
-            ) : (
-              <IconSend size={18} />
-            )}
-          </button>
-
-          {showScrollDownButton && (
-            <div className="absolute bottom-12 right-0 lg:bottom-0 lg:-right-10">
-              <button
-                className="flex h-7 w-7 items-center justify-center rounded-full bg-neutral-300 text-gray-800 shadow-md hover:shadow-lg focus:outline-none focus:ring-2 focus:ring-blue-500 dark:bg-gray-700 dark:text-neutral-200"
-                onClick={onScrollDownClick}
-              >
-                <IconArrowDown size={18} />
-              </button>
-            </div>
-          )}
-
-          {showPromptList && filteredPrompts.length > 0 && (
-            <div className="absolute bottom-12 w-full">
-              <PromptList
-                activePromptIndex={activePromptIndex}
-                prompts={filteredPrompts}
-                onSelect={handleInitModal}
-                onMouseOver={setActivePromptIndex}
-                promptListRef={promptListRef}
-              />
-            </div>
-          )}
-
-          {isModalVisible && (
-            <VariableModal
-              prompt={filteredPrompts[activePromptIndex]}
-              variables={variables}
-              onSubmit={handleSubmit}
-              onClose={() => setIsModalVisible(false)}
-            />
-          )}
-        </div>
-      </div>
-      <div className="px-3 pt-2 pb-3 text-center text-[12px] text-black/50 dark:text-white/50 md:px-4 md:pt-3 md:pb-6">
-        chatting with starchat
-      </div>
-    </div>
-  );
-};
diff --git a/spaces/gyugnsu/DragGan-Inversion/PTI/utils/__init__.py b/spaces/gyugnsu/DragGan-Inversion/PTI/utils/__init__.py
deleted file mode 100644
index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000
diff --git a/spaces/hackathon-somos-nlp-2023/discriminacion_gitana/README.md b/spaces/hackathon-somos-nlp-2023/discriminacion_gitana/README.md
deleted file mode 100644
index e1f0b0bbf84a12842f95243dcc1016c18ab0fa48..0000000000000000000000000000000000000000
--- a/spaces/hackathon-somos-nlp-2023/discriminacion_gitana/README.md
+++ /dev/null
@@ -1,19 +0,0 @@
----
-title: Argilla Space Template
-emoji: 🏷️
-colorFrom: purple
-colorTo: red
-sdk: docker
-app_port: 6900
-fullWidth: true
-tags:
-- argilla
-duplicated_from: argilla/argilla-template-space
----
-
-This is the Argilla Space Template you can use to deploy and run your own instance of Argilla on the Hugging Face Hub, for labeling, fun, and active learning loops!
-
-Login with:
-
-user: argilla
-password: 1234
\ No newline at end of file
diff --git a/spaces/hank1996/yolopv2/app.py b/spaces/hank1996/yolopv2/app.py
deleted file mode 100644
index 71dc1be8e7d41f92cd96bb230b38c248d198098f..0000000000000000000000000000000000000000
--- a/spaces/hank1996/yolopv2/app.py
+++ /dev/null
@@ -1,276 +0,0 @@
-import gradio as gr
-import os
-
-#os.system("wget https://github.com/WongKinYiu/yolov7/releases/download/v0.1/yolov7.pt")
-os.system("wget https://github.com/hustvl/YOLOP/raw/main/weights/End-to-end.pth")
-#os.system("wget https://github.com/WongKinYiu/yolov7/releases/download/v0.1/yolov7-e6e.pt")
-#os.system("wget https://github.com/WongKinYiu/yolov7/releases/download/v0.1/yolov7-e6.pt")
-os.system("wget https://github.com/CAIC-AD/YOLOPv2/releases/download/V0.0.1/yolopv2.pt")
-
-import argparse
-import time
-from pathlib import Path
-
-import cv2
-import torch
-import torch.backends.cudnn as cudnn
-from numpy import random
-
-from lib.config import cfg
-
-from lib.models import get_net
-import torchvision.transforms as transforms
-from lib.dataset.DemoDataset import LoadImages as LoadImages1
-#from lib.core.general import non_max_suppression, scale_coords 
-from lib.utils.plot import plot_one_box as plot_one_box1
-from lib.utils.plot import show_seg_result as show_seg_result1
-from tqdm import tqdm
-
-from utils.functions import \
-        time_synchronized,select_device, increment_path,\
-        scale_coords,xyxy2xywh,non_max_suppression,split_for_trace_model,\
-        driving_area_mask,lane_line_mask,plot_one_box,show_seg_result,\
-        AverageMeter,\
-        LoadImages
-      
-
-from PIL import Image
- 
-
-def detect(img,model):
-    #with torch.no_grad()：
-    parser = argparse.ArgumentParser()
-    parser.add_argument('--weights', nargs='+', type=str, default=model+".pt", help='model.pt path(s)')
-    parser.add_argument('--source', type=str, default='Inference/', help='source')  # file/folder, 0 for webcam
-    parser.add_argument('--img-size', type=int, default=640, help='inference size (pixels)')
-    parser.add_argument('--conf-thres', type=float, default=0.25, help='object confidence threshold')
-    parser.add_argument('--iou-thres', type=float, default=0.45, help='IOU threshold for NMS')
-    parser.add_argument('--device', default='', help='cuda device, i.e. 0 or 0,1,2,3 or cpu')
-    parser.add_argument('--view-img', action='store_true', help='display results')
-    parser.add_argument('--save-txt', action='store_true', help='save results to *.txt')
-    parser.add_argument('--save-conf', action='store_true', help='save confidences in --save-txt labels')
-    parser.add_argument('--nosave', action='store_true', help='do not save images/videos')
-    parser.add_argument('--classes', nargs='+', type=int, help='filter by class: --class 0, or --class 0 2 3')
-    parser.add_argument('--agnostic-nms', action='store_true', help='class-agnostic NMS')
-    parser.add_argument('--augment', action='store_true', help='augmented inference')
-    parser.add_argument('--update', action='store_true', help='update all models')
-    parser.add_argument('--project', default='runs/detect', help='save results to project/name')
-    parser.add_argument('--name', default='exp', help='save results to project/name')
-    parser.add_argument('--exist-ok', action='store_true', help='existing project/name ok, do not increment')
-    parser.add_argument('--trace', action='store_true', help='trace model')
-    opt = parser.parse_args()
-    img.save("Inference/test.jpg")
-    source, weights, view_img, save_txt, imgsz, trace = opt.source, opt.weights, opt.view_img, opt.save_txt, opt.img_size, opt.trace
-    save_img = True  # save inference images
-    #webcam = source.isnumeric() or source.endswith('.txt') or source.lower().startswith(
-        #('rtsp://', 'rtmp://', 'http://', 'https://'))
-    #print(webcam)
-    # Directories
-    #save_dir = Path(increment_path(Path(opt.project) / opt.name, exist_ok=opt.exist_ok))  # increment run
-    #(save_dir / 'labels' if save_txt else save_dir).mkdir(parents=True, exist_ok=True)  # make dir
-
-    # Initialize
-    #set_logging()
-    device = select_device(opt.device)
-    #print(device)
-    half = device.type != 'cpu'  # half precision only supported on CUDA
-
-    # Load model
-    inf_time = AverageMeter()
-    waste_time = AverageMeter()
-    nms_time = AverageMeter()
-
-    # Load model
-    #model = attempt_load(weights, map_location=device)  # load FP32 model
-    #stride = int(model.stride.max())  # model stride
-    #imgsz = check_img_size(imgsz, s=stride)  # check img_size
-    if weights == 'yolopv2.pt':
-        print(weights)
-        stride =32
-        model  = torch.jit.load(weights,map_location=device)
-        model.eval()
-    
-        # Set Dataloader
-        vid_path, vid_writer = None, None
-        dataset = LoadImages(source, img_size=imgsz, stride=stride)
-    
-        # Run inference
-
-        t0 = time.time()
-        for path, img, im0s, vid_cap in dataset:
-            print(img.shape)
-            img = torch.from_numpy(img).to(device)
-            img = img.half() if half else img.float()  # uint8 to fp16/32
-            img /= 255.0  # 0 - 255 to 0.0 - 1.0
-            print(img.shape)
-    
-            if img.ndimension() == 3:
-                img = img.unsqueeze(0)
-    
-            # Inference
-            t1 = time_synchronized()
-            [pred,anchor_grid],seg,ll= model(img)
-            t2 = time_synchronized()
-    
-            # waste time: the incompatibility of  torch.jit.trace causes extra time consumption in demo version 
-            # but this problem will not appear in offical version 
-            tw1 = time_synchronized()
-            pred = split_for_trace_model(pred,anchor_grid)
-            tw2 = time_synchronized()
-    
-            # Apply NMS
-            t3 = time_synchronized()
-            pred = non_max_suppression(pred, opt.conf_thres, opt.iou_thres, classes=opt.classes, agnostic=opt.agnostic_nms)
-            t4 = time_synchronized()
-    
-            da_seg_mask = driving_area_mask(seg)
-            ll_seg_mask = lane_line_mask(ll)
-                
-            print(da_seg_mask.shape)
-            # Process detections
-            for i, det in enumerate(pred):  # detections per image
-              
-                p, s, im0, frame = path, '', im0s, getattr(dataset, 'frame', 0)
-    
-                p = Path(p)  # to Path
-                #save_path = str(save_dir / p.name)  # img.jpg
-                #txt_path = str(save_dir / 'labels' / p.stem) + ('' if dataset.mode == 'image' else f'_{frame}')  # img.txt
-                s += '%gx%g ' % img.shape[2:]  # print string
-                gn = torch.tensor(im0.shape)[[1, 0, 1, 0]]  # normalization gain whwh
-                if len(det):
-                    # Rescale boxes from img_size to im0 size
-                    det[:, :4] = scale_coords(img.shape[2:], det[:, :4], im0.shape).round()
-    
-                    # Print results
-                    #for c in det[:, -1].unique():
-                        #n = (det[:, -1] == c).sum()  # detections per class
-                        #s += f"{n} {names[int(c)]}{'s' * (n > 1)}, "  # add to string
-    
-                    # Write results
-                    for *xyxy, conf, cls in reversed(det):
-                        if save_txt:  # Write to file
-                            xywh = (xyxy2xywh(torch.tensor(xyxy).view(1, 4)) / gn).view(-1).tolist()  # normalized xywh
-                            line = (cls, *xywh, conf) if opt.save_conf else (cls, *xywh)  # label format
-               
-                        if save_img :  # Add bbox to image
-                            plot_one_box(xyxy, im0, line_thickness=3)
-    
-                # Print time (inference)
-                print(f'{s}Done. ({t2 - t1:.3f}s)')
-                show_seg_result(im0, (da_seg_mask,ll_seg_mask), is_demo=True)
-        inf_time.update(t2-t1,img.size(0))
-        nms_time.update(t4-t3,img.size(0))
-        #waste_time.update(tw2-tw1,img.size(0))
-        print('Done. (%.3fs)' % (time.time() - t0))
-        print('inf : (%.4fs/frame)   nms : (%.4fs/frame)' % (inf_time.avg,nms_time.avg))
-    
-                
-    if weights == 'yolop.pt':
-        weights = 'End-to-end.pth'
-        print(weights)
-    
-        normalize = transforms.Normalize(
-        mean=[0.485, 0.456, 0.406], std=[0.229, 0.224, 0.225]
-            )
-        
-        transform=transforms.Compose([
-                    transforms.ToTensor(),
-                    normalize,
-                ])
-        model = get_net(cfg)
-        checkpoint = torch.load(weights, map_location= device)
-        #print(checkpoint)
-        model.load_state_dict(checkpoint['state_dict'])
-        model = model.to(device)
-
-        dataset = LoadImages1(source, img_size=imgsz)
-        bs = 1  # batch_size
-
-        # Get names and colors
-        names = model.module.names if hasattr(model, 'module') else model.names
-        colors = [[random.randint(0, 255) for _ in range(3)] for _ in range(len(names))]
-    
-        # Run inference
-        t0 = time.time()
-    
-        vid_path, vid_writer = None, None
-        img = torch.zeros((1, 3, imgsz, imgsz), device=device)  # init img
-        _ = model(img.half() if half else img)   # run once
-        model.eval()
-    
-  
-        for i, (path, img, img_det, vid_cap,shapes) in tqdm(enumerate(dataset),total = len(dataset)):
-            print(img.shape)
-            img = transform(img).to(device)
-            img = img.half() if half else img.float()  # uint8 to fp16/32
-            if img.ndimension() == 3:
-                img = img.unsqueeze(0)
-            # Inference
-            t1 = time_synchronized()
-            det_out, da_seg_out,ll_seg_out= model(img)
-            t2 = time_synchronized()
-            # if i == 0:
-            #     print(det_out)
-            inf_out, _ = det_out
-            inf_time.update(t2-t1,img.size(0))
-    
-            # Apply NMS
-            t3 = time_synchronized()
-            det_pred = non_max_suppression(inf_out, conf_thres=opt.conf_thres, iou_thres=opt.iou_thres, classes=None, agnostic=False)
-            t4 = time_synchronized()
-    
-            nms_time.update(t4-t3,img.size(0))
-            det=det_pred[0]
-    
-            #save_path = str(save_dir +'/'+ 'img.jpg')
-    
-            _, _, height, width = img.shape
-            h,w,_=img_det.shape
-            pad_w, pad_h = shapes[1][1]
-            pad_w = int(pad_w)
-            pad_h = int(pad_h)
-            ratio = shapes[1][0][1]
-    
-            da_predict = da_seg_out[:, :, pad_h:(height-pad_h),pad_w:(width-pad_w)]
-            da_seg_mask = torch.nn.functional.interpolate(da_predict, scale_factor=int(1/ratio), mode='bilinear')
-            _, da_seg_mask = torch.max(da_seg_mask, 1)
-            da_seg_mask = da_seg_mask.int().squeeze().cpu().numpy()
-            # da_seg_mask = morphological_process(da_seg_mask, kernel_size=7)
-    
-            
-            ll_predict = ll_seg_out[:, :,pad_h:(height-pad_h),pad_w:(width-pad_w)]
-            ll_seg_mask = torch.nn.functional.interpolate(ll_predict, scale_factor=int(1/ratio), mode='bilinear')
-            _, ll_seg_mask = torch.max(ll_seg_mask, 1)
-            ll_seg_mask = ll_seg_mask.int().squeeze().cpu().numpy()
-            # Lane line post-processing
-            #ll_seg_mask = morphological_process(ll_seg_mask, kernel_size=7, func_type=cv2.MORPH_OPEN)
-            #ll_seg_mask = connect_lane(ll_seg_mask)
-    
-            img_det = show_seg_result1(img_det, (da_seg_mask, ll_seg_mask), _, _, is_demo=True)
-    
-            if len(det):
-                det[:,:4] = scale_coords(img.shape[2:],det[:,:4],img_det.shape).round()
-                for *xyxy,conf,cls in reversed(det):
-                    label_det_pred = f'{names[int(cls)]} {conf:.2f}'
-                    plot_one_box1(xyxy, img_det , label=label_det_pred, color=colors[int(cls)], line_thickness=2)
-            
-     
-   
-        im0 = img_det
-
-        print('Done. (%.3fs)' % (time.time() - t0))
-        print('inf : (%.4fs/frame)   nms : (%.4fs/frame)' % (inf_time.avg,nms_time.avg))
-    
-      
-    #inf_time.update(t2-t1,img.size(0))
-    #nms_time.update(t4-t3,img.size(0))
-    #waste_time.update(tw2-tw1,img.size(0))
-    #print('inf : (%.4fs/frame)   nms : (%.4fs/frame)' % (inf_time.avg,nms_time.avg))
-    #print(f'Done. ({time.time() - t0:.3f}s)')
-    #print(im0.shape)
-   
-    
-    return Image.fromarray(im0[:,:,::-1])
-
-   
-gr.Interface(detect,[gr.Image(type="pil"),gr.Dropdown(choices=["yolopv2","yolop"])], gr.Image(type="pil"),title="Yolopv2",examples=[["example.jpeg", "yolopv2"]],description="demo for <a href='https://github.com/CAIC-AD/YOLOPv2' style='text-decoration: underline' target='_blank'>yolopv2</a> 🚀: Better, Faster, Stronger for Panoptic driving Perception ").launch()
diff --git a/spaces/hanzza/audioRecognition/audioRecord.py b/spaces/hanzza/audioRecognition/audioRecord.py
deleted file mode 100644
index 1365e84d400f2a0946c60073d82c11c631d62770..0000000000000000000000000000000000000000
--- a/spaces/hanzza/audioRecognition/audioRecord.py
+++ /dev/null
@@ -1,89 +0,0 @@
-import gradio as gr
-import sounddevice as sd
-import soundfile as sf
-import datetime
-
-from modelscope.pipelines import pipeline
-from modelscope.utils.constant import Tasks
-
-# gr.set_ffmpeg_path("/usr/local/ffmpeg")
-
-semantic_cls = pipeline(Tasks.text_classification, 'damo/nlp_structbert_sentiment-classification_chinese-base')
-inference_pipeline = pipeline(task=Tasks.auto_speech_recognition,
-                              model='damo/speech_paraformer-large_asr_nat-zh-cn-16k-common-vocab8404-pytorch')
-
-
-
-
-def record_audio(audio):
-#     # 使用Sounddevice库录制音频
-#     recording = sd.rec(int(duration * sample_rate), samplerate=sample_rate, channels=1)
-#     sd.wait()
-#
-#     # 保存录音为WAV文件
-#     now = datetime.datetime.now()
-#     formatted_time = now.strftime("%Y-%m-%d-%H-%M-%S")
-#     filepath = formatted_time+'.wav'
-#     sf.write(filepath, recording, sample_rate)
-
-    rec_result = inference_pipeline(audio)
-    semantic_result = semantic_cls(input=rec_result['text'])
-    print rec_result
-    print semantic_result
-    # rec_result = "rec_result"
-    # semantic_result = "semantic_result"
-
-    return rec_result['text'], semantic_result
-
-
-def analyze_audio_file(audio):
-    rec_result = inference_pipeline(audio_in=audio)
-    semantic_result = semantic_cls(input=rec_result['text'])
-
-    # rec_result = "audio"
-    # semantic_result = "audio"
-
-    return rec_result['text'], semantic_result
-
-
-# Gradio界面定义
-def gradio_interface():
-    duration_input = gr.components.Slider(label="录音时长（秒）", minimum=1, maximum=10, value=5, step=1)
-    sample_rate_input = gr.components.Slider(label="采样率", minimum=8000, maximum=48000, value=44100, step=1000)
-#     output = gr.components.File(label="录音文件")
-    output1 = gr.components.Textbox(label="音频识别结果")
-    output2 = gr.components.Textbox(label="情绪识别结果")
-    # interface_layout = [
-    #     [duration_input, sample_rate_input],
-    #     output,output2,output3,
-    #     gr.components.Button(label="开始录音")
-    # ]
-    return gr.Interface(fn=record_audio, inputs=[duration_input, sample_rate_input], outputs=[output1, output2],
-                        title="录音识别程序")
-
-
-with gr.Blocks() as gradio_inter:
-    gr.Markdown("录音识别程序")
-    with gr.Tab("录音音频内容及情绪识别"):
-        audio_input = gr.Audio(source="microphone", type="filepath",label="录音(点击下方按钮开始录音)")
-        record_button = gr.Button("开始识别")
-        output1 = gr.Textbox(label="音频识别结果")
-        output2 = gr.Textbox(label="情绪识别结果")
-        record_button.click(fn=record_audio, inputs=[audio_input],
-                            outputs=[output1, output2],
-                            api_name="录音识别")
-    with gr.Tab("音频文件内容及情绪识别"):
-        audio_input = gr.Audio(label="音频文件", type="filepath")
-        file_button = gr.Button("开始识别")
-        output2 = gr.Textbox(label="音频识别结果")
-        output3 = gr.Textbox(label="情绪识别结果")
-        file_button.click(fn=analyze_audio_file, inputs=audio_input, outputs=[output2, output3], api_name="文件识别")
-    with gr.Tab("文字情绪识别"):
-        audio_input = gr.Audio(label="音频文件", type="filepath")
-        file_button = gr.Button("开始识别")
-        output2 = gr.Textbox(label="音频识别结果")
-        output3 = gr.Textbox(label="情绪识别结果")
-        file_button.click(fn=analyze_audio_file, inputs=audio_input, outputs=[output2, output3], api_name="文件识别")
-# 启动Gradio应用程序并公开到公网
-# gradio_interface().launch(share=True)
-gradio_inter.launch(share=True)
diff --git a/spaces/haotiz/glip-zeroshot-demo/maskrcnn_benchmark/structures/__init__.py b/spaces/haotiz/glip-zeroshot-demo/maskrcnn_benchmark/structures/__init__.py
deleted file mode 100644
index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000
diff --git a/spaces/hasibzunair/fifa-tryon-demo/Self-Correction-Human-Parsing-for-ACGPN/mhp_extension/detectron2/tools/convert-torchvision-to-d2.py b/spaces/hasibzunair/fifa-tryon-demo/Self-Correction-Human-Parsing-for-ACGPN/mhp_extension/detectron2/tools/convert-torchvision-to-d2.py
deleted file mode 100644
index 18a24e4ef96d34a4a0d1f43debc2276260da1a2b..0000000000000000000000000000000000000000
--- a/spaces/hasibzunair/fifa-tryon-demo/Self-Correction-Human-Parsing-for-ACGPN/mhp_extension/detectron2/tools/convert-torchvision-to-d2.py
+++ /dev/null
@@ -1,56 +0,0 @@
-#!/usr/bin/env python
-# Copyright (c) Facebook, Inc. and its affiliates. All Rights Reserved
-
-import pickle as pkl
-import sys
-import torch
-
-"""
-Usage:
-  # download one of the ResNet{18,34,50,101,152} models from torchvision:
-  wget https://download.pytorch.org/models/resnet50-19c8e357.pth -O r50.pth
-  # run the conversion
-  ./convert-torchvision-to-d2.py r50.pth r50.pkl
-
-  # Then, use r50.pkl with the following changes in config:
-
-MODEL:
-  WEIGHTS: "/path/to/r50.pkl"
-  PIXEL_MEAN: [123.675, 116.280, 103.530]
-  PIXEL_STD: [58.395, 57.120, 57.375]
-  RESNETS:
-    DEPTH: 50
-    STRIDE_IN_1X1: False
-INPUT:
-  FORMAT: "RGB"
-
-  These models typically produce slightly worse results than the
-  pre-trained ResNets we use in official configs, which are the
-  original ResNet models released by MSRA.
-"""
-
-if __name__ == "__main__":
-    input = sys.argv[1]
-
-    obj = torch.load(input, map_location="cpu")
-
-    newmodel = {}
-    for k in list(obj.keys()):
-        old_k = k
-        if "layer" not in k:
-            k = "stem." + k
-        for t in [1, 2, 3, 4]:
-            k = k.replace("layer{}".format(t), "res{}".format(t + 1))
-        for t in [1, 2, 3]:
-            k = k.replace("bn{}".format(t), "conv{}.norm".format(t))
-        k = k.replace("downsample.0", "shortcut")
-        k = k.replace("downsample.1", "shortcut.norm")
-        print(old_k, "->", k)
-        newmodel[k] = obj.pop(old_k).detach().numpy()
-
-    res = {"model": newmodel, "__author__": "torchvision", "matching_heuristics": True}
-
-    with open(sys.argv[2], "wb") as f:
-        pkl.dump(res, f)
-    if obj:
-        print("Unconverted keys:", obj.keys())
diff --git a/spaces/hf-vision/object_detection_leaderboard/constants.py b/spaces/hf-vision/object_detection_leaderboard/constants.py
deleted file mode 100644
index a8f83f3a7caaf84b28a281cefeaec35733313788..0000000000000000000000000000000000000000
--- a/spaces/hf-vision/object_detection_leaderboard/constants.py
+++ /dev/null
@@ -1,96 +0,0 @@
-
-from pathlib import Path
-
-# Directory where request by models are stored
-DIR_OUTPUT_REQUESTS = Path("requested_models")
-EVAL_REQUESTS_PATH = Path("eval_requests")
-
-##########################
-# Text definitions       #
-##########################
-
-banner_url = "https://huggingface.co/spaces/rafaelpadilla/object_detection_leaderboard/resolve/main/assets/leaderboard_small.png"
-BANNER = f'<div style="display: flex; justify-content: space-around;"><img src="{banner_url}" alt="Banner" style="width: 40vw; min-width: 300px; max-width: 600px;"> </div>'
-
-TITLE = "<html> <head> <style> h1 {text-align: center;} </style> </head> <body> <h1> 🤗 Open Object Detection Leaderboard </b> </body> </html>"
-
-INTRODUCTION_TEXT = "📐 The 🤗 Open Object Detection Leaderboard aims to track, rank and evaluate vision models \
-    available in the hub designed to detect objects in images. \
-    Anyone from the community can request a model to be evaluated and added to the leaderboard. \
-    \nCheck the 📈 Metrics tab to understand how the models are evaluated. \
-    \nIf you want results for a model that is not listed here, you can  ✉️✨ request results for it."
-
-CITATION_TEXT = '''@misc{open-od-leaderboard,
-  author = {Rafael Padilla, Amy Roberts and the Hugging Face Team},
-  title = {Open Object Detection Leaderboard},
-  year = {2023},
-  publisher = {Hugging Face},
-  howpublished = "\\url{https://huggingface.co/spaces/rafaelpadilla/object_detection_leaderboard}"
-}
-'''
-
-METRICS_TAB_TEXT = '''
-🎯 Average Precision and Average Recall  are popular metrics for evaluating the accuracy of object detectors by estimating the Precision-Recall relationship.
-
-Here you will find details about the object detection metrics reported in our leaderboard.
-
-# Metrics
-
-There are plenty of variations of these metrics, depending on the IoU threshold, the area of the object, and the number of detections per image. The most popular ones are:
-
-## Average Precision (AP) 
-- **AP**: AP at IoU=.50:.05:.95
-- **AP@.50 (APIoU=.50)**: AP at IoU=.50 (similar to mAP PASCAL VOC metric)
-- **AP@.75 (APIoU=.75)**: AP at IoU=.75 (strict metric)
-
-## Average Precision Across Scales 
-- **AP-S (APsmall)**: AP for small objects: area < 322.
-- **AP-M (APmedium)**: AP for medium objects: 322 < area < 962.
-- **AP-L (APlarge)**: AP for large objects: area > 962.
-
-## Average Recall (AR) 
-- **AR1 (ARmax=1)**: AR given 1 detection per image.
-- **AR10 (ARmax=10)**: AR given 10 detections per image.
-- **AR100 (ARmax=100)**: AR given 100 detections per image.
-
-## Average Recall Across Scales 
-- **AR-S (ARsmall)**: AR for small objects: area < 322.
-- **AR-M (ARmedium)**: AR for medium objects: 322 < area < 962.
-- **AR-L (ARlarge)**: AR for large objects: area > 962.
-
-## Frames Per Second (FPS)
-We measure the frames per second (FPS) for each model by looking at the average time it takes across the whole dataset. This includes the pre and post processing steps.   
-
-The hardware we use definitely plays a role in these numbers. You can see which hardware we used in the results table. 📈
-
-Because each model has its own specific needs when it comes to batch size and memory requirements, we decided to test them with just 1 image per batch. One thing to keep in mind: this test setup might not fully reflect real-world scenarios. Typically, more images are processed together to get things moving faster. 🚀"
-
-## How to reproduce our results
-
-To compute these metrics, various tools employ different methods. For this leaderboard's evaluation, we utilize the COCO evaluation approach, which can be found in the [COCO evaluation toolkit](https://github.com/cocodataset/cocoapi/blob/master/PythonAPI/pycocotools/cocoeval.py).
-
-The 🤗 `Evaluate` metric used to measure the results is also accessible in the hub: [detection_metrics](https://huggingface.co/spaces/rafaelpadilla/detection_metrics)
-
-It is essential to note that slight differences in results may arise between the results presented here and those from other sources. These differences can be attributed to numerical approximations, variations in batch sizes, and other hyperparameters. To ensure a consistent evaluation, we recommend using a batch size of 1 and setting the confidence threshold to 0 when evaluating your model.
-
-## Benchmark datasets
-
-We understand that the object detection task can be quite diverse and the requirements can vary greatly across different domains such as autonomous driving, medical imaging, aerial imaging, etc. 
-
-With this in mind, we are interested in knowing if there are specific domains or applications that you believe should be addressed by our benchmarks. Please, [join our discussion](https://huggingface.co/spaces/rafaelpadilla/object_detection_leaderboard/discussions/1) and give your suggestion. 
-
-### COCO dataset
-
-The Microsoft Common Objects in Context (COCO) dataset is a highly regarded benchmark for object detection models due to its comprehensive set of 80 object categories, extensive volume of images with complex scenes, and high-quality, manually annotated labels. 
-
-Moreover, its versatility in supporting multiple computer vision tasks, along with a standardized format and an active community, makes it a robust, challenging, and easily comparable benchmark. 
-
-The benchmarking COCO validation 2017 dataset is available in the 🤗 hub: [coco2017](https://huggingface.co/datasets/rafaelpadilla/coco2017) 
-
-## 📚 Useful Readings 
-
-For further insight into the subject, you may find the following readings helpful:
-
-- [A Survey on Performance Metrics for Object-Detection Algorithms](https://www.researchgate.net/profile/Rafael-Padilla/publication/343194514_A_Survey_on_Performance_Metrics_for_Object-Detection_Algorithms/links/5f1b5a5e45851515ef478268/A-Survey-on-Performance-Metrics-for-Object-Detection-Algorithms.pdf), R Padilla, SL Netto, EAB Da Silva - *IWSSIP, 2020* 
-- [A Comparative Analysis of Object Detection Metrics with a Companion Open-Source Toolkit](https://www.mdpi.com/2079-9292/10/3/279/pdf), R Padilla, WL Passos, TLB Dias, SL Netto, EAB Da Silva - *Journal Electronics, 2021*
-'''
diff --git a/spaces/ho11laqe/nnUNet_calvingfront_detection/nnunet/training/network_training/nnUNet_variants/loss_function/nnUNetTrainerV2_Loss_MCC.py b/spaces/ho11laqe/nnUNet_calvingfront_detection/nnunet/training/network_training/nnUNet_variants/loss_function/nnUNetTrainerV2_Loss_MCC.py
deleted file mode 100644
index 5a3fe3f9d695f4f3f6b27d92d2007b4338704adc..0000000000000000000000000000000000000000
--- a/spaces/ho11laqe/nnUNet_calvingfront_detection/nnunet/training/network_training/nnUNet_variants/loss_function/nnUNetTrainerV2_Loss_MCC.py
+++ /dev/null
@@ -1,37 +0,0 @@
-#    Copyright 2020 Division of Medical Image Computing, German Cancer Research Center (DKFZ), Heidelberg, Germany
-#
-#    Licensed under the Apache License, Version 2.0 (the "License");
-#    you may not use this file except in compliance with the License.
-#    You may obtain a copy of the License at
-#
-#        http://www.apache.org/licenses/LICENSE-2.0
-#
-#    Unless required by applicable law or agreed to in writing, software
-#    distributed under the License is distributed on an "AS IS" BASIS,
-#    WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-#    See the License for the specific language governing permissions and
-#    limitations under the License.
-
-
-from nnunet.training.network_training.nnUNetTrainerV2 import nnUNetTrainerV2
-from nnunet.training.loss_functions.dice_loss import MCCLoss
-from nnunet.utilities.nd_softmax import softmax_helper
-
-
-class nnUNetTrainerV2_Loss_MCC(nnUNetTrainerV2):
-    def __init__(self, plans_file, fold, output_folder=None, dataset_directory=None, batch_dice=True, stage=None,
-                 unpack_data=True, deterministic=True, fp16=False):
-        super().__init__(plans_file, fold, output_folder, dataset_directory, batch_dice, stage, unpack_data,
-                         deterministic, fp16)
-        self.initial_lr = 1e-3
-        self.loss = MCCLoss(apply_nonlin=softmax_helper, batch_mcc=self.batch_dice, do_bg=True, smooth=0.0)
-
-
-class nnUNetTrainerV2_Loss_MCCnoBG(nnUNetTrainerV2):
-    def __init__(self, plans_file, fold, output_folder=None, dataset_directory=None, batch_dice=True, stage=None,
-                 unpack_data=True, deterministic=True, fp16=False):
-        super().__init__(plans_file, fold, output_folder, dataset_directory, batch_dice, stage, unpack_data,
-                         deterministic, fp16)
-        self.initial_lr = 1e-3
-        self.loss = MCCLoss(apply_nonlin=softmax_helper, batch_mcc=self.batch_dice, do_bg=False, smooth=0.0)
-
diff --git a/spaces/hoalarious/edenlabs.tech-TTS/README.md b/spaces/hoalarious/edenlabs.tech-TTS/README.md
deleted file mode 100644
index ad2a34a310daff9b83665be2ff04781dadaa142f..0000000000000000000000000000000000000000
--- a/spaces/hoalarious/edenlabs.tech-TTS/README.md
+++ /dev/null
@@ -1,13 +0,0 @@
----
-title: Edenlabs.tech TTS
-emoji: 📚
-colorFrom: green
-colorTo: gray
-sdk: gradio
-sdk_version: 3.42.0
-app_file: app.py
-pinned: false
-license: apache-2.0
----
-
-Check out the configuration reference at https://huggingface.co/docs/hub/spaces-config-reference
diff --git a/spaces/housexu123/bingo-2.0/tests/parse.ts b/spaces/housexu123/bingo-2.0/tests/parse.ts
deleted file mode 100644
index 92940fe6315f1d7cb2b267ba5e5a7e26460a1de3..0000000000000000000000000000000000000000
--- a/spaces/housexu123/bingo-2.0/tests/parse.ts
+++ /dev/null
@@ -1,13 +0,0 @@
-import { promises as fs } from 'fs'
-import { join } from 'path'
-import { parseHeadersFromCurl } from '@/lib/utils'
-
-(async () => {
-  const content = await fs.readFile(join(__dirname, './fixtures/curl.txt'), 'utf-8')
-  const headers = parseHeadersFromCurl(content)
-  console.log(headers)
-
-  const cmdContent = await fs.readFile(join(__dirname, './fixtures/cmd.txt'), 'utf-8')
-  const cmdHeaders = parseHeadersFromCurl(cmdContent)
-  console.log(cmdHeaders)
-})()
diff --git a/spaces/hugggof/vampnet/setup.py b/spaces/hugggof/vampnet/setup.py
deleted file mode 100644
index 0b0097fa81ef9ba6774a08417ca29317b3374d26..0000000000000000000000000000000000000000
--- a/spaces/hugggof/vampnet/setup.py
+++ /dev/null
@@ -1,40 +0,0 @@
-from setuptools import find_packages
-from setuptools import setup
-
-with open("README.md") as f:
-    long_description = f.read()
-
-setup(
-    name="vampnet",
-    version="0.0.1",
-    classifiers=[
-        "Intended Audience :: Developers",
-        "Natural Language :: English",
-        "Programming Language :: Python :: 3.7",
-        "Topic :: Artistic Software",
-        "Topic :: Multimedia",
-        "Topic :: Multimedia :: Sound/Audio",
-        "Topic :: Multimedia :: Sound/Audio :: Editors",
-        "Topic :: Software Development :: Libraries",
-    ],
-    description="Generative Music Modeling.",
-    long_description=long_description,
-    long_description_content_type="text/markdown",
-    author="Hugo Flores García, Prem Seetharaman",
-    author_email="hfgacrcia@descript.com",
-    url="https://github.com/hugofloresgarcia/vampnet",
-    license="MIT",
-    packages=find_packages(),
-    install_requires=[
-        "torch",
-        "argbind>=0.3.2",
-        "numpy==1.23",
-        "wavebeat @ git+https://github.com/hugofloresgarcia/wavebeat",
-        "lac @ git+https://github.com/hugofloresgarcia/lac.git",
-        "descript-audiotools @ git+https://github.com/descriptinc/audiotools.git@0.7.2",
-        "gradio", 
-        "loralib",
-        "torch_pitch_shift",
-        "madmom",
-    ],
-)
diff --git a/spaces/hylee/photo2cartoon/p2c/models/face_features.py b/spaces/hylee/photo2cartoon/p2c/models/face_features.py
deleted file mode 100644
index 8ea3fbe1db025885636c711df30f7671b6b7528f..0000000000000000000000000000000000000000
--- a/spaces/hylee/photo2cartoon/p2c/models/face_features.py
+++ /dev/null
@@ -1,31 +0,0 @@
-import torch
-import torch.nn.functional as F
-from .mobilefacenet import MobileFaceNet
-
-
-class FaceFeatures(object):
-    def __init__(self, weights_path, device):
-        self.device = device
-        self.model = MobileFaceNet(512).to(device)
-        self.model.load_state_dict(torch.load(weights_path))
-        self.model.eval()
-
-    def infer(self, batch_tensor):
-        # crop face
-        h, w = batch_tensor.shape[2:]
-        top = int(h / 2.1 * (0.8 - 0.33))
-        bottom = int(h - (h / 2.1 * 0.3))
-        size = bottom - top
-        left = int(w / 2 - size / 2)
-        right = left + size
-        batch_tensor = batch_tensor[:, :, top: bottom, left: right]
-
-        batch_tensor = F.interpolate(batch_tensor, size=[112, 112], mode='bilinear', align_corners=True)
-
-        features = self.model(batch_tensor)
-        return features
-
-    def cosine_distance(self, batch_tensor1, batch_tensor2):
-        feature1 = self.infer(batch_tensor1)
-        feature2 = self.infer(batch_tensor2)
-        return 1 - torch.cosine_similarity(feature1, feature2)
diff --git a/spaces/hysts/ControlNet-v1-1/app_scribble.py b/spaces/hysts/ControlNet-v1-1/app_scribble.py
deleted file mode 100644
index 10460265bc94ba128a420081fb98c73c2ea3b6ca..0000000000000000000000000000000000000000
--- a/spaces/hysts/ControlNet-v1-1/app_scribble.py
+++ /dev/null
@@ -1,95 +0,0 @@
-#!/usr/bin/env python
-
-import gradio as gr
-
-from settings import (
-    DEFAULT_IMAGE_RESOLUTION,
-    DEFAULT_NUM_IMAGES,
-    MAX_IMAGE_RESOLUTION,
-    MAX_NUM_IMAGES,
-    MAX_SEED,
-)
-from utils import randomize_seed_fn
-
-
-def create_demo(process):
-    with gr.Blocks() as demo:
-        with gr.Row():
-            with gr.Column():
-                image = gr.Image()
-                prompt = gr.Textbox(label="Prompt")
-                run_button = gr.Button("Run")
-                with gr.Accordion("Advanced options", open=False):
-                    preprocessor_name = gr.Radio(
-                        label="Preprocessor", choices=["HED", "PidiNet", "None"], type="value", value="HED"
-                    )
-                    num_samples = gr.Slider(
-                        label="Number of images", minimum=1, maximum=MAX_NUM_IMAGES, value=DEFAULT_NUM_IMAGES, step=1
-                    )
-                    image_resolution = gr.Slider(
-                        label="Image resolution",
-                        minimum=256,
-                        maximum=MAX_IMAGE_RESOLUTION,
-                        value=DEFAULT_IMAGE_RESOLUTION,
-                        step=256,
-                    )
-                    preprocess_resolution = gr.Slider(
-                        label="Preprocess resolution", minimum=128, maximum=512, value=512, step=1
-                    )
-                    num_steps = gr.Slider(label="Number of steps", minimum=1, maximum=100, value=20, step=1)
-                    guidance_scale = gr.Slider(label="Guidance scale", minimum=0.1, maximum=30.0, value=9.0, step=0.1)
-                    seed = gr.Slider(label="Seed", minimum=0, maximum=MAX_SEED, step=1, value=0)
-                    randomize_seed = gr.Checkbox(label="Randomize seed", value=True)
-                    a_prompt = gr.Textbox(label="Additional prompt", value="best quality, extremely detailed")
-                    n_prompt = gr.Textbox(
-                        label="Negative prompt",
-                        value="longbody, lowres, bad anatomy, bad hands, missing fingers, extra digit, fewer digits, cropped, worst quality, low quality",
-                    )
-            with gr.Column():
-                result = gr.Gallery(label="Output", show_label=False, columns=2, object_fit="scale-down")
-        inputs = [
-            image,
-            prompt,
-            a_prompt,
-            n_prompt,
-            num_samples,
-            image_resolution,
-            preprocess_resolution,
-            num_steps,
-            guidance_scale,
-            seed,
-            preprocessor_name,
-        ]
-        prompt.submit(
-            fn=randomize_seed_fn,
-            inputs=[seed, randomize_seed],
-            outputs=seed,
-            queue=False,
-            api_name=False,
-        ).then(
-            fn=process,
-            inputs=inputs,
-            outputs=result,
-            api_name=False,
-        )
-        run_button.click(
-            fn=randomize_seed_fn,
-            inputs=[seed, randomize_seed],
-            outputs=seed,
-            queue=False,
-            api_name=False,
-        ).then(
-            fn=process,
-            inputs=inputs,
-            outputs=result,
-            api_name="scribble",
-        )
-    return demo
-
-
-if __name__ == "__main__":
-    from model import Model
-
-    model = Model(task_name="scribble")
-    demo = create_demo(model.process_scribble)
-    demo.queue().launch()
diff --git a/spaces/hysts/ControlNet-with-Anything-v4/app_canny.py b/spaces/hysts/ControlNet-with-Anything-v4/app_canny.py
deleted file mode 100644
index dd3bb2c7556f3a00d06f5f996f89488d800e4f9f..0000000000000000000000000000000000000000
--- a/spaces/hysts/ControlNet-with-Anything-v4/app_canny.py
+++ /dev/null
@@ -1,91 +0,0 @@
-# This file is adapted from https://github.com/lllyasviel/ControlNet/blob/f4748e3630d8141d7765e2bd9b1e348f47847707/gradio_canny2image.py
-# The original license file is LICENSE.ControlNet in this repo.
-import gradio as gr
-
-
-def create_demo(process, max_images=12, default_num_images=3):
-    with gr.Blocks() as demo:
-        with gr.Row():
-            gr.Markdown('## Control Stable Diffusion with Canny Edge Maps')
-        with gr.Row():
-            with gr.Column():
-                input_image = gr.Image(source='upload', type='numpy')
-                prompt = gr.Textbox(label='Prompt')
-                run_button = gr.Button(label='Run')
-                with gr.Accordion('Advanced options', open=False):
-                    num_samples = gr.Slider(label='Images',
-                                            minimum=1,
-                                            maximum=max_images,
-                                            value=default_num_images,
-                                            step=1)
-                    image_resolution = gr.Slider(label='Image Resolution',
-                                                 minimum=256,
-                                                 maximum=512,
-                                                 value=512,
-                                                 step=256)
-                    canny_low_threshold = gr.Slider(
-                        label='Canny low threshold',
-                        minimum=1,
-                        maximum=255,
-                        value=100,
-                        step=1)
-                    canny_high_threshold = gr.Slider(
-                        label='Canny high threshold',
-                        minimum=1,
-                        maximum=255,
-                        value=200,
-                        step=1)
-                    num_steps = gr.Slider(label='Steps',
-                                          minimum=1,
-                                          maximum=100,
-                                          value=20,
-                                          step=1)
-                    guidance_scale = gr.Slider(label='Guidance Scale',
-                                               minimum=0.1,
-                                               maximum=30.0,
-                                               value=9.0,
-                                               step=0.1)
-                    seed = gr.Slider(label='Seed',
-                                     minimum=-1,
-                                     maximum=2147483647,
-                                     step=1,
-                                     randomize=True)
-                    a_prompt = gr.Textbox(
-                        label='Added Prompt',
-                        value='best quality, extremely detailed')
-                    n_prompt = gr.Textbox(
-                        label='Negative Prompt',
-                        value=
-                        'longbody, lowres, bad anatomy, bad hands, missing fingers, extra digit, fewer digits, cropped, worst quality, low quality'
-                    )
-            with gr.Column():
-                result = gr.Gallery(label='Output',
-                                    show_label=False,
-                                    elem_id='gallery').style(grid=2,
-                                                             height='auto')
-        inputs = [
-            input_image,
-            prompt,
-            a_prompt,
-            n_prompt,
-            num_samples,
-            image_resolution,
-            num_steps,
-            guidance_scale,
-            seed,
-            canny_low_threshold,
-            canny_high_threshold,
-        ]
-        prompt.submit(fn=process, inputs=inputs, outputs=result)
-        run_button.click(fn=process,
-                         inputs=inputs,
-                         outputs=result,
-                         api_name='canny')
-    return demo
-
-
-if __name__ == '__main__':
-    from model import Model
-    model = Model()
-    demo = create_demo(model.process_canny)
-    demo.queue().launch()
diff --git a/spaces/hysts/StyleSwin/model.py b/spaces/hysts/StyleSwin/model.py
deleted file mode 100644
index 1c3916ed796a1f75de590a87de501bfc0d292117..0000000000000000000000000000000000000000
--- a/spaces/hysts/StyleSwin/model.py
+++ /dev/null
@@ -1,92 +0,0 @@
-from __future__ import annotations
-
-import os
-import pathlib
-import sys
-
-import huggingface_hub
-import numpy as np
-import torch
-import torch.nn as nn
-
-if os.getenv('SYSTEM') == 'spaces':
-    os.system("sed -i '14,21d' StyleSwin/op/fused_act.py")
-    os.system("sed -i '12,19d' StyleSwin/op/upfirdn2d.py")
-
-current_dir = pathlib.Path(__file__).parent
-submodule_dir = current_dir / 'StyleSwin'
-sys.path.insert(0, submodule_dir.as_posix())
-
-from models.generator import Generator
-
-
-class Model:
-    MODEL_NAMES = [
-        'CelebAHQ_256',
-        'FFHQ_256',
-        'LSUNChurch_256',
-        'CelebAHQ_1024',
-        'FFHQ_1024',
-    ]
-
-    def __init__(self):
-        self.device = torch.device(
-            'cuda:0' if torch.cuda.is_available() else 'cpu')
-        self._download_all_models()
-        self.model_name = self.MODEL_NAMES[3]
-        self.model = self._load_model(self.model_name)
-
-        self.std = torch.FloatTensor([0.229, 0.224,
-                                      0.225])[None, :, None,
-                                              None].to(self.device)
-        self.mean = torch.FloatTensor([0.485, 0.456,
-                                       0.406])[None, :, None,
-                                               None].to(self.device)
-
-    def _load_model(self, model_name: str) -> nn.Module:
-        size = int(model_name.split('_')[1])
-        channel_multiplier = 1 if size == 1024 else 2
-        model = Generator(size,
-                          style_dim=512,
-                          n_mlp=8,
-                          channel_multiplier=channel_multiplier)
-        ckpt_path = huggingface_hub.hf_hub_download('public-data/StyleSwin',
-                                                    f'models/{model_name}.pt')
-        ckpt = torch.load(ckpt_path)
-        model.load_state_dict(ckpt['g_ema'])
-        model.to(self.device)
-        model.eval()
-        return model
-
-    def set_model(self, model_name: str) -> None:
-        if model_name == self.model_name:
-            return
-        self.model_name = model_name
-        self.model = self._load_model(model_name)
-
-    def _download_all_models(self):
-        for name in self.MODEL_NAMES:
-            self._load_model(name)
-
-    def generate_z(self, seed: int) -> torch.Tensor:
-        seed = int(np.clip(seed, 0, np.iinfo(np.uint32).max))
-        z = np.random.RandomState(seed).randn(1, 512)
-        return torch.from_numpy(z).float().to(self.device)
-
-    def postprocess(self, tensors: torch.Tensor) -> np.ndarray:
-        assert tensors.dim() == 4
-        tensors = tensors * self.std + self.mean
-        tensors = (tensors * 255).clamp(0, 255).to(torch.uint8)
-        return tensors.permute(0, 2, 3, 1).cpu().numpy()
-
-    @torch.inference_mode()
-    def generate_image(self, seed: int) -> np.ndarray:
-        z = self.generate_z(seed)
-        out, _ = self.model(z)
-        out = self.postprocess(out)
-        return out[0]
-
-    def set_model_and_generate_image(self, model_name: str,
-                                     seed: int) -> np.ndarray:
-        self.set_model(model_name)
-        return self.generate_image(seed)
diff --git a/spaces/hysts/ibug-emotion_recognition/app.py b/spaces/hysts/ibug-emotion_recognition/app.py
deleted file mode 100644
index aa2522ac9517aa20301f0c10d7648c1ac5c769e4..0000000000000000000000000000000000000000
--- a/spaces/hysts/ibug-emotion_recognition/app.py
+++ /dev/null
@@ -1,193 +0,0 @@
-#!/usr/bin/env python
-
-from __future__ import annotations
-
-import argparse
-import functools
-import os
-import pathlib
-import sys
-import tarfile
-
-import cv2
-import gradio as gr
-import huggingface_hub
-import numpy as np
-import torch
-
-sys.path.insert(0, 'face_detection')
-sys.path.insert(0, 'face_alignment')
-sys.path.insert(0, 'emotion_recognition')
-
-from ibug.emotion_recognition import EmoNetPredictor
-from ibug.face_alignment import FANPredictor
-from ibug.face_detection import RetinaFacePredictor
-
-TITLE = 'ibug-group/emotion_recognition'
-DESCRIPTION = 'This is an unofficial demo for https://github.com/ibug-group/emotion_recognition.'
-ARTICLE = '<center><img src="https://visitor-badge.glitch.me/badge?page_id=hysts.ibug-emotion_recognition" alt="visitor badge"/></center>'
-
-TOKEN = os.environ['TOKEN']
-
-
-def parse_args() -> argparse.Namespace:
-    parser = argparse.ArgumentParser()
-    parser.add_argument('--device', type=str, default='cpu')
-    parser.add_argument('--theme', type=str)
-    parser.add_argument('--live', action='store_true')
-    parser.add_argument('--share', action='store_true')
-    parser.add_argument('--port', type=int)
-    parser.add_argument('--disable-queue',
-                        dest='enable_queue',
-                        action='store_false')
-    parser.add_argument('--allow-flagging', type=str, default='never')
-    return parser.parse_args()
-
-
-def load_sample_images() -> list[pathlib.Path]:
-    image_dir = pathlib.Path('images')
-    if not image_dir.exists():
-        image_dir.mkdir()
-        dataset_repo = 'hysts/input-images'
-        filenames = ['004.tar']
-        for name in filenames:
-            path = huggingface_hub.hf_hub_download(dataset_repo,
-                                                   name,
-                                                   repo_type='dataset',
-                                                   use_auth_token=TOKEN)
-            with tarfile.open(path) as f:
-                f.extractall(image_dir.as_posix())
-    return sorted(image_dir.rglob('*.jpg'))
-
-
-def load_face_detector(device: torch.device) -> RetinaFacePredictor:
-    model = RetinaFacePredictor(
-        threshold=0.8,
-        device=device,
-        model=RetinaFacePredictor.get_model('mobilenet0.25'))
-    return model
-
-
-def load_landmark_detector(device: torch.device) -> FANPredictor:
-    model = FANPredictor(device=device, model=FANPredictor.get_model('2dfan2'))
-    return model
-
-
-def load_model(model_name: str, device: torch.device) -> EmoNetPredictor:
-    model = EmoNetPredictor(device=device,
-                            model=EmoNetPredictor.get_model(model_name))
-    return model
-
-
-def predict(image: np.ndarray, model_name: str, max_num_faces: int,
-            face_detector: RetinaFacePredictor,
-            landmark_detector: FANPredictor,
-            models: dict[str, EmoNetPredictor]) -> np.ndarray:
-    model = models[model_name]
-    if len(model.config.emotion_labels) == 8:
-        colors = (
-            (192, 192, 192),
-            (0, 255, 0),
-            (255, 0, 0),
-            (0, 255, 255),
-            (0, 128, 255),
-            (255, 0, 128),
-            (0, 0, 255),
-            (128, 255, 0),
-        )
-    else:
-        colors = (
-            (192, 192, 192),
-            (0, 255, 0),
-            (255, 0, 0),
-            (0, 255, 255),
-            (0, 0, 255),
-        )
-
-    # RGB -> BGR
-    image = image[:, :, ::-1]
-
-    faces = face_detector(image, rgb=False)
-    if len(faces) == 0:
-        raise RuntimeError('No face was found.')
-    faces = sorted(list(faces), key=lambda x: -x[4])[:max_num_faces]
-    faces = np.asarray(faces)
-    _, _, features = landmark_detector(image,
-                                       faces,
-                                       rgb=False,
-                                       return_features=True)
-    emotions = model(features)
-
-    res = image.copy()
-    for index, face in enumerate(faces):
-        box = np.round(face[:4]).astype(int)
-        cv2.rectangle(res, tuple(box[:2]), tuple(box[2:]), (0, 255, 0), 2)
-
-        emotion = emotions['emotion'][index]
-        valence = emotions['valence'][index]
-        arousal = emotions['arousal'][index]
-        emotion_label = model.config.emotion_labels[emotion].title()
-
-        text_content = f'{emotion_label} ({valence: .01f}, {arousal: .01f})'
-        cv2.putText(res,
-                    text_content, (box[0], box[1] - 10),
-                    cv2.FONT_HERSHEY_DUPLEX,
-                    1,
-                    colors[emotion],
-                    lineType=cv2.LINE_AA)
-
-    return res[:, :, ::-1]
-
-
-def main():
-    args = parse_args()
-    device = torch.device(args.device)
-
-    face_detector = load_face_detector(device)
-    landmark_detector = load_landmark_detector(device)
-
-    model_names = [
-        'emonet248',
-        'emonet245',
-        'emonet248_alt',
-        'emonet245_alt',
-    ]
-    models = {name: load_model(name, device=device) for name in model_names}
-
-    func = functools.partial(predict,
-                             face_detector=face_detector,
-                             landmark_detector=landmark_detector,
-                             models=models)
-    func = functools.update_wrapper(func, predict)
-
-    image_paths = load_sample_images()
-    examples = [[path.as_posix(), model_names[0], 30] for path in image_paths]
-
-    gr.Interface(
-        func,
-        [
-            gr.inputs.Image(type='numpy', label='Input'),
-            gr.inputs.Radio(model_names,
-                            type='value',
-                            default=model_names[0],
-                            label='Model'),
-            gr.inputs.Slider(
-                1, 30, step=1, default=30, label='Max Number of Faces'),
-        ],
-        gr.outputs.Image(type='numpy', label='Output'),
-        examples=examples,
-        title=TITLE,
-        description=DESCRIPTION,
-        article=ARTICLE,
-        theme=args.theme,
-        allow_flagging=args.allow_flagging,
-        live=args.live,
-    ).launch(
-        enable_queue=args.enable_queue,
-        server_port=args.port,
-        share=args.share,
-    )
-
-
-if __name__ == '__main__':
-    main()
diff --git a/spaces/hysts/zeroscope-v2/style.css b/spaces/hysts/zeroscope-v2/style.css
deleted file mode 100644
index f39b73789df85679fd5265d725a190de68e9ae5f..0000000000000000000000000000000000000000
--- a/spaces/hysts/zeroscope-v2/style.css
+++ /dev/null
@@ -1,16 +0,0 @@
-h1 {
-    text-align: center;
-}
-
-#duplicate-button {
-    margin: auto;
-    color: #fff;
-    background: #1565c0;
-    border-radius: 100vh;
-}
-
-#component-0 {
-    max-width: 730px;
-    margin: auto;
-    padding-top: 1.5rem;
-}
diff --git a/spaces/hyxue/HiFiFace-inference-demo/Deep3DFaceRecon_pytorch/util/preprocess.py b/spaces/hyxue/HiFiFace-inference-demo/Deep3DFaceRecon_pytorch/util/preprocess.py
deleted file mode 100644
index e525c0f4f928a686ad3a751a697c806b3f3ba933..0000000000000000000000000000000000000000
--- a/spaces/hyxue/HiFiFace-inference-demo/Deep3DFaceRecon_pytorch/util/preprocess.py
+++ /dev/null
@@ -1,244 +0,0 @@
-"""This script contains the image preprocessing code for Deep3DFaceRecon_pytorch
-"""
-import os
-import warnings
-
-import cv2
-import numpy as np
-import torch
-from PIL import Image
-from scipy.io import loadmat
-from skimage import transform as trans
-
-warnings.filterwarnings("ignore", category=np.VisibleDeprecationWarning)
-warnings.filterwarnings("ignore", category=FutureWarning)
-
-
-# calculating least square problem for image alignment
-def POS(xp, x):
-    npts = xp.shape[1]
-
-    A = np.zeros([2 * npts, 8])
-
-    A[0 : 2 * npts - 1 : 2, 0:3] = x.transpose()
-    A[0 : 2 * npts - 1 : 2, 3] = 1
-
-    A[1 : 2 * npts : 2, 4:7] = x.transpose()
-    A[1 : 2 * npts : 2, 7] = 1
-
-    b = np.reshape(xp.transpose(), [2 * npts, 1])
-
-    k, _, _, _ = np.linalg.lstsq(A, b)
-
-    R1 = k[0:3]
-    R2 = k[4:7]
-    sTx = k[3]
-    sTy = k[7]
-    s = (np.linalg.norm(R1) + np.linalg.norm(R2)) / 2
-    t = np.stack([sTx, sTy], axis=0)
-
-    return t, s
-
-
-# bounding box for 68 landmark detection
-def BBRegression(points, params):
-
-    w1 = params["W1"]
-    b1 = params["B1"]
-    w2 = params["W2"]
-    b2 = params["B2"]
-    data = points.copy()
-    data = data.reshape([5, 2])
-    data_mean = np.mean(data, axis=0)
-    x_mean = data_mean[0]
-    y_mean = data_mean[1]
-    data[:, 0] = data[:, 0] - x_mean
-    data[:, 1] = data[:, 1] - y_mean
-
-    rms = np.sqrt(np.sum(data**2) / 5)
-    data = data / rms
-    data = data.reshape([1, 10])
-    data = np.transpose(data)
-    inputs = np.matmul(w1, data) + b1
-    inputs = 2 / (1 + np.exp(-2 * inputs)) - 1
-    inputs = np.matmul(w2, inputs) + b2
-    inputs = np.transpose(inputs)
-    x = inputs[:, 0] * rms + x_mean
-    y = inputs[:, 1] * rms + y_mean
-    w = 224 / inputs[:, 2] * rms
-    rects = [x, y, w, w]
-    return np.array(rects).reshape([4])
-
-
-# utils for landmark detection
-def img_padding(img, box):
-    success = True
-    bbox = box.copy()
-    res = np.zeros([2 * img.shape[0], 2 * img.shape[1], 3])
-    res[
-        img.shape[0] // 2 : img.shape[0] + img.shape[0] // 2, img.shape[1] // 2 : img.shape[1] + img.shape[1] // 2
-    ] = img
-
-    bbox[0] = bbox[0] + img.shape[1] // 2
-    bbox[1] = bbox[1] + img.shape[0] // 2
-    if bbox[0] < 0 or bbox[1] < 0:
-        success = False
-    return res, bbox, success
-
-
-# utils for landmark detection
-def crop(img, bbox):
-    padded_img, padded_bbox, flag = img_padding(img, bbox)
-    if flag:
-        crop_img = padded_img[
-            padded_bbox[1] : padded_bbox[1] + padded_bbox[3], padded_bbox[0] : padded_bbox[0] + padded_bbox[2]
-        ]
-        crop_img = cv2.resize(crop_img.astype(np.uint8), (224, 224), interpolation=cv2.INTER_CUBIC)
-        scale = 224 / padded_bbox[3]
-        return crop_img, scale
-    else:
-        return padded_img, 0
-
-
-# utils for landmark detection
-def scale_trans(img, lm, t, s):
-    imgw = img.shape[1]
-    imgh = img.shape[0]
-    M_s = np.array([[1, 0, -t[0] + imgw // 2 + 0.5], [0, 1, -imgh // 2 + t[1]]], dtype=np.float32)
-    img = cv2.warpAffine(img, M_s, (imgw, imgh))
-    w = int(imgw / s * 100)
-    h = int(imgh / s * 100)
-    img = cv2.resize(img, (w, h))
-    lm = np.stack([lm[:, 0] - t[0] + imgw // 2, lm[:, 1] - t[1] + imgh // 2], axis=1) / s * 100
-
-    left = w // 2 - 112
-    up = h // 2 - 112
-    bbox = [left, up, 224, 224]
-    cropped_img, scale2 = crop(img, bbox)
-    assert scale2 != 0
-    t1 = np.array([bbox[0], bbox[1]])
-
-    # back to raw img s * crop + s * t1 + t2
-    t1 = np.array([w // 2 - 112, h // 2 - 112])
-    scale = s / 100
-    t2 = np.array([t[0] - imgw / 2, t[1] - imgh / 2])
-    inv = (scale / scale2, scale * t1 + t2.reshape([2]))
-    return cropped_img, inv
-
-
-# utils for landmark detection
-def align_for_lm(img, five_points):
-    five_points = np.array(five_points).reshape([1, 10])
-    params = loadmat("util/BBRegressorParam_r.mat")
-    bbox = BBRegression(five_points, params)
-    assert bbox[2] != 0
-    bbox = np.round(bbox).astype(np.int32)
-    crop_img, scale = crop(img, bbox)
-    return crop_img, scale, bbox
-
-
-# resize and crop images for face reconstruction
-def resize_n_crop_img(img, lm, t, s, target_size=224.0, mask=None):
-    w0, h0 = img.size
-    w = (w0 * s).astype(np.int32)
-    h = (h0 * s).astype(np.int32)
-    left = (w / 2 - target_size / 2 + float((t[0] - w0 / 2) * s)).astype(np.int32)
-    right = left + target_size
-    up = (h / 2 - target_size / 2 + float((h0 / 2 - t[1]) * s)).astype(np.int32)
-    below = up + target_size
-
-    img = img.resize((w, h), resample=Image.Resampling.BICUBIC)
-    img = img.crop((left, up, right, below))
-
-    if mask is not None:
-        mask = mask.resize((w, h), resample=Image.Resampling.BICUBIC)
-        mask = mask.crop((left, up, right, below))
-
-    lm = np.stack([lm[:, 0] - t[0] + w0 / 2, lm[:, 1] - t[1] + h0 / 2], axis=1) * s
-    lm = lm - np.reshape(np.array([(w / 2 - target_size / 2), (h / 2 - target_size / 2)]), [1, 2])
-
-    return img, lm, mask
-
-
-# utils for face reconstruction
-def extract_5p(lm):
-    lm_idx = np.array([31, 37, 40, 43, 46, 49, 55]) - 1
-    lm5p = np.stack(
-        [
-            lm[lm_idx[0], :],
-            np.mean(lm[lm_idx[[1, 2]], :], 0),
-            np.mean(lm[lm_idx[[3, 4]], :], 0),
-            lm[lm_idx[5], :],
-            lm[lm_idx[6], :],
-        ],
-        axis=0,
-    )
-    lm5p = lm5p[[1, 2, 0, 3, 4], :]
-    return lm5p
-
-
-# utils for face reconstruction
-def align_img(img, lm, lm3D, mask=None, target_size=224.0, rescale_factor=102.0):
-    """
-    Return:
-        transparams        --numpy.array  (raw_W, raw_H, scale, tx, ty)
-        img_new            --PIL.Image  (target_size, target_size, 3)
-        lm_new             --numpy.array  (68, 2), y direction is opposite to v direction
-        mask_new           --PIL.Image  (target_size, target_size)
-
-    Parameters:
-        img                --PIL.Image  (raw_H, raw_W, 3)
-        lm                 --numpy.array  (68, 2), y direction is opposite to v direction
-        lm3D               --numpy.array  (5, 3)
-        mask               --PIL.Image  (raw_H, raw_W, 3)
-    """
-
-    w0, h0 = img.size
-    if lm.shape[0] != 5:
-        lm5p = extract_5p(lm)
-    else:
-        lm5p = lm
-
-    # calculate translation and scale factors using 5 facial landmarks and standard landmarks of a 3D face
-    t, s = POS(lm5p.transpose(), lm3D.transpose())
-    s = rescale_factor / s
-
-    # processing the image
-    img_new, lm_new, mask_new = resize_n_crop_img(img, lm, t, s, target_size=target_size, mask=mask)
-    trans_params = np.array([w0, h0, s, t[0], t[1]])
-
-    return trans_params, img_new, lm_new, mask_new
-
-
-# utils for face recognition model
-def estimate_norm(lm_68p, H):
-    # from https://github.com/deepinsight/insightface/blob/c61d3cd208a603dfa4a338bd743b320ce3e94730/recognition/common/face_align.py#L68
-    """
-    Return:
-        trans_m            --numpy.array  (2, 3)
-    Parameters:
-        lm                 --numpy.array  (68, 2), y direction is opposite to v direction
-        H                  --int/float , image height
-    """
-    lm = extract_5p(lm_68p)
-    lm[:, -1] = H - 1 - lm[:, -1]
-    tform = trans.SimilarityTransform()
-    src = np.array(
-        [[38.2946, 51.6963], [73.5318, 51.5014], [56.0252, 71.7366], [41.5493, 92.3655], [70.7299, 92.2041]],
-        dtype=np.float32,
-    )
-    tform.estimate(lm, src)
-    M = tform.params
-    if np.linalg.det(M) == 0:
-        M = np.eye(3)
-
-    return M[0:2, :]
-
-
-def estimate_norm_torch(lm_68p, H):
-    lm_68p_ = lm_68p.detach().cpu().numpy()
-    M = []
-    for i in range(lm_68p_.shape[0]):
-        M.append(estimate_norm(lm_68p_[i], H))
-    M = torch.tensor(np.array(M), dtype=torch.float32).to(lm_68p.device)
-    return M
diff --git a/spaces/innat/Global.Wheat.Detection.MaskRCNN/mrcnn/parallel_model.py b/spaces/innat/Global.Wheat.Detection.MaskRCNN/mrcnn/parallel_model.py
deleted file mode 100644
index 1a0b7bd97ac341ddac095bd06fb3464dc18b3177..0000000000000000000000000000000000000000
--- a/spaces/innat/Global.Wheat.Detection.MaskRCNN/mrcnn/parallel_model.py
+++ /dev/null
@@ -1,188 +0,0 @@
-"""
-Mask R-CNN
-Multi-GPU Support for Keras.
-
-Copyright (c) 2017 Matterport, Inc.
-Licensed under the MIT License (see LICENSE for details)
-Written by Waleed Abdulla
-
-Ideas and a small code snippets from these sources:
-https://github.com/fchollet/keras/issues/2436
-https://medium.com/@kuza55/transparent-multi-gpu-training-on-tensorflow-with-keras-8b0016fd9012
-https://github.com/avolkov1/keras_experiments/blob/master/keras_exp/multigpu/
-https://github.com/fchollet/keras/blob/master/keras/utils/training_utils.py
-"""
-
-import keras.backend as K
-import keras.layers as KL
-import keras.models as KM
-import tensorflow as tf
-
-
-class ParallelModel(KM.Model):
-    """Subclasses the standard Keras Model and adds multi-GPU support.
-    It works by creating a copy of the model on each GPU. Then it slices
-    the inputs and sends a slice to each copy of the model, and then
-    merges the outputs together and applies the loss on the combined
-    outputs.
-    """
-
-    def __init__(self, keras_model, gpu_count):
-        """Class constructor.
-        keras_model: The Keras model to parallelize
-        gpu_count: Number of GPUs. Must be > 1
-        """
-        self.inner_model = keras_model
-        self.gpu_count = gpu_count
-        merged_outputs = self.make_parallel()
-        super(ParallelModel, self).__init__(
-            inputs=self.inner_model.inputs, outputs=merged_outputs
-        )
-
-    def __getattribute__(self, attrname):
-        """Redirect loading and saving methods to the inner model. That's where
-        the weights are stored."""
-        if "load" in attrname or "save" in attrname:
-            return getattr(self.inner_model, attrname)
-        return super(ParallelModel, self).__getattribute__(attrname)
-
-    def summary(self, *args, **kwargs):
-        """Override summary() to display summaries of both, the wrapper
-        and inner models."""
-        super(ParallelModel, self).summary(*args, **kwargs)
-        self.inner_model.summary(*args, **kwargs)
-
-    def make_parallel(self):
-        """Creates a new wrapper model that consists of multiple replicas of
-        the original model placed on different GPUs.
-        """
-        # Slice inputs. Slice inputs on the CPU to avoid sending a copy
-        # of the full inputs to all GPUs. Saves on bandwidth and memory.
-        input_slices = {
-            name: tf.split(x, self.gpu_count)
-            for name, x in zip(self.inner_model.input_names, self.inner_model.inputs)
-        }
-
-        output_names = self.inner_model.output_names
-        outputs_all = []
-        for i in range(len(self.inner_model.outputs)):
-            outputs_all.append([])
-
-        # Run the model call() on each GPU to place the ops there
-        for i in range(self.gpu_count):
-            with tf.device("/gpu:%d" % i):
-                with tf.name_scope("tower_%d" % i):
-                    # Run a slice of inputs through this replica
-                    zipped_inputs = zip(
-                        self.inner_model.input_names, self.inner_model.inputs
-                    )
-                    inputs = [
-                        KL.Lambda(
-                            lambda s: input_slices[name][i],
-                            output_shape=lambda s: (None,) + s[1:],
-                        )(tensor)
-                        for name, tensor in zipped_inputs
-                    ]
-                    # Create the model replica and get the outputs
-                    outputs = self.inner_model(inputs)
-                    if not isinstance(outputs, list):
-                        outputs = [outputs]
-                    # Save the outputs for merging back together later
-                    for l, o in enumerate(outputs):
-                        outputs_all[l].append(o)
-
-        # Merge outputs on CPU
-        with tf.device("/cpu:0"):
-            merged = []
-            for outputs, name in zip(outputs_all, output_names):
-                # Concatenate or average outputs?
-                # Outputs usually have a batch dimension and we concatenate
-                # across it. If they don't, then the output is likely a loss
-                # or a metric value that gets averaged across the batch.
-                # Keras expects losses and metrics to be scalars.
-                if K.int_shape(outputs[0]) == ():
-                    # Average
-                    m = KL.Lambda(lambda o: tf.add_n(o) / len(outputs), name=name)(
-                        outputs
-                    )
-                else:
-                    # Concatenate
-                    m = KL.Concatenate(axis=0, name=name)(outputs)
-                merged.append(m)
-        return merged
-
-
-if __name__ == "__main__":
-    # Testing code below. It creates a simple model to train on MNIST and
-    # tries to run it on 2 GPUs. It saves the graph so it can be viewed
-    # in TensorBoard. Run it as:
-    #
-    # python3 parallel_model.py
-
-    import os
-
-    import keras.optimizers
-    import numpy as np
-    from keras.datasets import mnist
-    from keras.preprocessing.image import ImageDataGenerator
-
-    GPU_COUNT = 2
-
-    # Root directory of the project
-    ROOT_DIR = os.path.abspath("../")
-
-    # Directory to save logs and trained model
-    MODEL_DIR = os.path.join(ROOT_DIR, "logs")
-
-    def build_model(x_train, num_classes):
-        # Reset default graph. Keras leaves old ops in the graph,
-        # which are ignored for execution but clutter graph
-        # visualization in TensorBoard.
-        tf.reset_default_graph()
-
-        inputs = KL.Input(shape=x_train.shape[1:], name="input_image")
-        x = KL.Conv2D(32, (3, 3), activation="relu", padding="same", name="conv1")(
-            inputs
-        )
-        x = KL.Conv2D(64, (3, 3), activation="relu", padding="same", name="conv2")(x)
-        x = KL.MaxPooling2D(pool_size=(2, 2), name="pool1")(x)
-        x = KL.Flatten(name="flat1")(x)
-        x = KL.Dense(128, activation="relu", name="dense1")(x)
-        x = KL.Dense(num_classes, activation="softmax", name="dense2")(x)
-
-        return KM.Model(inputs, x, "digit_classifier_model")
-
-    # Load MNIST Data
-    (x_train, y_train), (x_test, y_test) = mnist.load_data()
-    x_train = np.expand_dims(x_train, -1).astype("float32") / 255
-    x_test = np.expand_dims(x_test, -1).astype("float32") / 255
-
-    print("x_train shape:", x_train.shape)
-    print("x_test shape:", x_test.shape)
-
-    # Build data generator and model
-    datagen = ImageDataGenerator()
-    model = build_model(x_train, 10)
-
-    # Add multi-GPU support.
-    model = ParallelModel(model, GPU_COUNT)
-
-    optimizer = keras.optimizers.SGD(lr=0.01, momentum=0.9, clipnorm=5.0)
-
-    model.compile(
-        loss="sparse_categorical_crossentropy",
-        optimizer=optimizer,
-        metrics=["accuracy"],
-    )
-
-    model.summary()
-
-    # Train
-    model.fit_generator(
-        datagen.flow(x_train, y_train, batch_size=64),
-        steps_per_epoch=50,
-        epochs=10,
-        verbose=1,
-        validation_data=(x_test, y_test),
-        callbacks=[keras.callbacks.TensorBoard(log_dir=MODEL_DIR, write_graph=True)],
-    )
diff --git a/spaces/innnky/nyaru-svc2.0/commons.py b/spaces/innnky/nyaru-svc2.0/commons.py
deleted file mode 100644
index 9ad0444b61cbadaa388619986c2889c707d873ce..0000000000000000000000000000000000000000
--- a/spaces/innnky/nyaru-svc2.0/commons.py
+++ /dev/null
@@ -1,161 +0,0 @@
-import math
-import numpy as np
-import torch
-from torch import nn
-from torch.nn import functional as F
-
-
-def init_weights(m, mean=0.0, std=0.01):
-  classname = m.__class__.__name__
-  if classname.find("Conv") != -1:
-    m.weight.data.normal_(mean, std)
-
-
-def get_padding(kernel_size, dilation=1):
-  return int((kernel_size*dilation - dilation)/2)
-
-
-def convert_pad_shape(pad_shape):
-  l = pad_shape[::-1]
-  pad_shape = [item for sublist in l for item in sublist]
-  return pad_shape
-
-
-def intersperse(lst, item):
-  result = [item] * (len(lst) * 2 + 1)
-  result[1::2] = lst
-  return result
-
-
-def kl_divergence(m_p, logs_p, m_q, logs_q):
-  """KL(P||Q)"""
-  kl = (logs_q - logs_p) - 0.5
-  kl += 0.5 * (torch.exp(2. * logs_p) + ((m_p - m_q)**2)) * torch.exp(-2. * logs_q)
-  return kl
-
-
-def rand_gumbel(shape):
-  """Sample from the Gumbel distribution, protect from overflows."""
-  uniform_samples = torch.rand(shape) * 0.99998 + 0.00001
-  return -torch.log(-torch.log(uniform_samples))
-
-
-def rand_gumbel_like(x):
-  g = rand_gumbel(x.size()).to(dtype=x.dtype, device=x.device)
-  return g
-
-
-def slice_segments(x, ids_str, segment_size=4):
-  ret = torch.zeros_like(x[:, :, :segment_size])
-  for i in range(x.size(0)):
-    idx_str = ids_str[i]
-    idx_end = idx_str + segment_size
-    ret[i] = x[i, :, idx_str:idx_end]
-  return ret
-
-
-def rand_slice_segments(x, x_lengths=None, segment_size=4):
-  b, d, t = x.size()
-  if x_lengths is None:
-    x_lengths = t
-  ids_str_max = x_lengths - segment_size + 1
-  ids_str = (torch.rand([b]).to(device=x.device) * ids_str_max).to(dtype=torch.long)
-  ret = slice_segments(x, ids_str, segment_size)
-  return ret, ids_str
-
-
-def get_timing_signal_1d(
-    length, channels, min_timescale=1.0, max_timescale=1.0e4):
-  position = torch.arange(length, dtype=torch.float)
-  num_timescales = channels // 2
-  log_timescale_increment = (
-      math.log(float(max_timescale) / float(min_timescale)) /
-      (num_timescales - 1))
-  inv_timescales = min_timescale * torch.exp(
-      torch.arange(num_timescales, dtype=torch.float) * -log_timescale_increment)
-  scaled_time = position.unsqueeze(0) * inv_timescales.unsqueeze(1)
-  signal = torch.cat([torch.sin(scaled_time), torch.cos(scaled_time)], 0)
-  signal = F.pad(signal, [0, 0, 0, channels % 2])
-  signal = signal.view(1, channels, length)
-  return signal
-
-
-def add_timing_signal_1d(x, min_timescale=1.0, max_timescale=1.0e4):
-  b, channels, length = x.size()
-  signal = get_timing_signal_1d(length, channels, min_timescale, max_timescale)
-  return x + signal.to(dtype=x.dtype, device=x.device)
-
-
-def cat_timing_signal_1d(x, min_timescale=1.0, max_timescale=1.0e4, axis=1):
-  b, channels, length = x.size()
-  signal = get_timing_signal_1d(length, channels, min_timescale, max_timescale)
-  return torch.cat([x, signal.to(dtype=x.dtype, device=x.device)], axis)
-
-
-def subsequent_mask(length):
-  mask = torch.tril(torch.ones(length, length)).unsqueeze(0).unsqueeze(0)
-  return mask
-
-
-@torch.jit.script
-def fused_add_tanh_sigmoid_multiply(input_a, input_b, n_channels):
-  n_channels_int = n_channels[0]
-  in_act = input_a + input_b
-  t_act = torch.tanh(in_act[:, :n_channels_int, :])
-  s_act = torch.sigmoid(in_act[:, n_channels_int:, :])
-  acts = t_act * s_act
-  return acts
-
-
-def convert_pad_shape(pad_shape):
-  l = pad_shape[::-1]
-  pad_shape = [item for sublist in l for item in sublist]
-  return pad_shape
-
-
-def shift_1d(x):
-  x = F.pad(x, convert_pad_shape([[0, 0], [0, 0], [1, 0]]))[:, :, :-1]
-  return x
-
-
-def sequence_mask(length, max_length=None):
-  if max_length is None:
-    max_length = length.max()
-  x = torch.arange(max_length, dtype=length.dtype, device=length.device)
-  return x.unsqueeze(0) < length.unsqueeze(1)
-
-
-def generate_path(duration, mask):
-  """
-  duration: [b, 1, t_x]
-  mask: [b, 1, t_y, t_x]
-  """
-  device = duration.device
-  
-  b, _, t_y, t_x = mask.shape
-  cum_duration = torch.cumsum(duration, -1)
-  
-  cum_duration_flat = cum_duration.view(b * t_x)
-  path = sequence_mask(cum_duration_flat, t_y).to(mask.dtype)
-  path = path.view(b, t_x, t_y)
-  path = path - F.pad(path, convert_pad_shape([[0, 0], [1, 0], [0, 0]]))[:, :-1]
-  path = path.unsqueeze(1).transpose(2,3) * mask
-  return path
-
-
-def clip_grad_value_(parameters, clip_value, norm_type=2):
-  if isinstance(parameters, torch.Tensor):
-    parameters = [parameters]
-  parameters = list(filter(lambda p: p.grad is not None, parameters))
-  norm_type = float(norm_type)
-  if clip_value is not None:
-    clip_value = float(clip_value)
-
-  total_norm = 0
-  for p in parameters:
-    param_norm = p.grad.data.norm(norm_type)
-    total_norm += param_norm.item() ** norm_type
-    if clip_value is not None:
-      p.grad.data.clamp_(min=-clip_value, max=clip_value)
-  total_norm = total_norm ** (1. / norm_type)
-  return total_norm
diff --git a/spaces/inplisQlawa/anything-midjourney-v4-1/Beat Saber - RIOT - QuotOverkill Quot Full PATCHED Crack [Crack Serial Key.md b/spaces/inplisQlawa/anything-midjourney-v4-1/Beat Saber - RIOT - QuotOverkill Quot Full PATCHED Crack [Crack Serial Key.md
deleted file mode 100644
index 76a52fd9bd6d83a5175598c6217ae159c8aa48e9..0000000000000000000000000000000000000000
--- a/spaces/inplisQlawa/anything-midjourney-v4-1/Beat Saber - RIOT - QuotOverkill Quot Full PATCHED Crack [Crack Serial Key.md	
+++ /dev/null
@@ -1,79 +0,0 @@
-
-<h1>Beat Saber - RIOT - Quot;Overkill Quot; Full Crack [Crack Serial Key</h1>
-
-<p>Are you a fan of VR rhythm games that challenge your reflexes and coordination? Do you love slashing the beats of adrenaline-pumping music with virtual lightsabers? If so, then you might want to try Beat Saber - RIOT - Quot;Overkill Quot; Full Crack [Crack Serial Key, a game that will test your skills and immerse you in a stunning neon world.</p>
-
-<p>Beat Saber is a VR rhythm game that was released in 2018 by Beat Games, an indie studio based in Prague, Czech Republic. The game has received critical acclaim and commercial success, becoming one of the best-selling VR games of all time. The game features a variety of songs from different genres, such as EDM, rock, pop, and metal. The game also supports custom songs and mods created by the community.</p>
-<h2>Beat Saber - RIOT - quot;Overkill quot; full crack [Crack Serial Key</h2><br /><p><b><b>Download File</b> &middot;&middot;&middot; <a href="https://urlin.us/2uEw5a">https://urlin.us/2uEw5a</a></b></p><br /><br />
-
-<p>RIOT - Quot;Overkill Quot; is one of the most popular songs in Beat Saber, created by RIOT, a duo of electronic music producers from Los Angeles, USA. The song is a fast-paced and intense dubstep track that will make you sweat and feel the adrenaline rush. The song was released in 2018 as part of RIOT's debut EP, The Mob.</p>
-
-<p>However, if you want to play Beat Saber - RIOT - Quot;Overkill Quot;, you need to buy the game from Steam or Oculus Store, which can cost you around $30. You also need to have a VR headset and controllers that are compatible with the game, such as Oculus Rift, HTC Vive, or Valve Index. These devices can be quite expensive and not everyone can afford them.</p>
-
-<p>That's why some people look for alternative ways to play Beat Saber - RIOT - Quot;Overkill Quot; without spending too much money. One of these ways is to download Beat Saber - RIOT - Quot;Overkill Quot; Full Crack [Crack Serial Key from a torrent site using a magnet link. A torrent site is a website that hosts torrent files that contain information about the files you want to download, such as their names, sizes, locations, and checksums.</p>
-
-<p>A torrent file is not the actual file you want to download, but a small file that helps you find and download it from other computers that have it (called peers). A magnet link is a special type of link that contains information about the torrent file (such as its name and hash value) without having to download the torrent file itself.</p>
-
-<p>To download Beat Saber - RIOT - Quot;Overkill Quot; Full Crack [Crack Serial Key from a torrent site using a magnet link, you need to follow these steps:</p>
-<p></p>
-
-<ol>
-<li>Install a torrent client software on your computer if you don't have one already.</li>
-<li>Go to a torrent site that has Beat Saber - RIOT - Quot;Overkill Quot; Full Crack [Crack Serial Key available for download.</li>
-<li>Find the magnet link for Beat Saber - RIOT - Quot;Overkill Quot; Full Crack [Crack Serial Key on the torrent site.</li>
-<li>Copy the magnet link or click on it if your browser supports it.</li>
-<li>Paste the magnet link or open it with your torrent client software.</li>
-<li>Wait for your torrent client software to connect to peers and start downloading Beat Saber - RIOT - Quot;Overkill Quot; Full Crack [Crack Serial Key.</li>
-<li>Enjoy playing Beat Saber - RIOT - Quot;Overkill Quot; Full Crack [Crack Serial Key once it is downloaded.</li>
-</ol>
-
-<p>We hope this article has helped you learn more about Beat Saber - RIOT - Quot;Overkill Quot; Full Crack [Crack Serial Key and how to get it from a torrent site using a magnet link. If you have any questions or comments, please feel free to leave them below.</p>
-<h2>What Are the Features of Beat Saber - RIOT - Quot;Overkill Quot; Full Crack [Crack Serial Key?</h2>
-
-<p>Beat Saber - RIOT - Quot;Overkill Quot; Full Crack [Crack Serial Key is a game that offers you many features that will make you enjoy playing it. Some of these features are:</p>
-
-<ul>
-<li>Immersive VR experience - The game uses VR technology to create a realistic and immersive environment where you can feel like you are actually slashing the beats with your lightsabers.</li>
-<li>Stunning graphics and sound - The game has high-quality graphics and sound that will enhance your gameplay experience. The game features a neon-themed world with dynamic lighting and shadows, as well as a powerful soundtrack that matches the rhythm and intensity of the game.</li>
-<li>Fun and challenging gameplay - The game has a simple and intuitive gameplay that anyone can learn and enjoy. The game requires you to slash the colored cubes that fly towards you in sync with the music, while avoiding obstacles and walls. The game has different difficulty levels, modes, and modifiers that will test your skills and keep you engaged.</li>
-<li>Custom songs and mods - The game supports custom songs and mods created by the community, which means you can play with any song or mod you want. You can also create your own songs and mods using the built-in editor or third-party tools.</li>
-<li>Full crack [Crack Serial Key - The game comes with a full crack [Crack Serial Key that will allow you to play the game without any restrictions or limitations. You can play the game offline or online, with or without VR headset, and with any controller you want.</li>
-</ul>
-
-<p>Beat Saber - RIOT - Quot;Overkill Quot; Full Crack [Crack Serial Key is a game that will provide you with hours of fun and entertainment.</p>
-
-<h2>What Are the Risks of Downloading Beat Saber - RIOT - Quot;Overkill Quot; Full Crack [Crack Serial Key from a Torrent Site?</h2>
-
-<p>While downloading Beat Saber - RIOT - Quot;Overkill Quot; Full Crack [Crack Serial Key from a torrent site using a magnet link might seem like an easy and convenient way to get the game for free or for a small fee, it also comes with some risks that you should be aware of. Some of these risks are:</p>
-
-<ul>
-<li>Legal issues - Downloading Beat Saber - RIOT - Quot;Overkill Quot; Full Crack [Crack Serial Key from a torrent site using a magnet link might violate the copyright laws of your country or region. You might face legal consequences such as fines, lawsuits, or even jail time if you are caught downloading or distributing the game illegally.</li>
-<li>Viruses and malware - Downloading Beat Saber - RIOT - Quot;Overkill Quot; Full Crack [Crack Serial Key from a torrent site using a magnet link might expose your computer to viruses and malware that can harm your system or steal your personal information. You might download fake or corrupted files that can damage your computer or install unwanted programs that can spy on your activities or hijack your browser.</li>
-<li>Poor quality and performance - Downloading Beat Saber - RIOT - Quot;Overkill Quot; Full Crack [Crack Serial Key from a torrent site using a magnet link might result in poor quality and performance of the game. You might download incomplete or outdated files that can cause errors or glitches in the game. You might also experience slow download speed, low frame rate, lag, or crashes due to the lack of official support or updates.</li>
-</ul>
-
-<p>Downloading Beat Saber - RIOT - Quot;Overkill Quot; Full Crack [Crack Serial Key from a torrent site using a magnet link might not be worth the risks involved.</p>
-<h2>What Are the Alternatives to Downloading Beat Saber - RIOT - Quot;Overkill Quot; Full Crack [Crack Serial Key from a Torrent Site?</h2>
-
-<p>If you want to play Beat Saber - RIOT - Quot;Overkill Quot; without risking the legal, security, and quality issues that come with downloading it from a torrent site using a magnet link, you might want to consider some alternatives that are safer and more reliable. Some of these alternatives are:</p>
-
-<ul>
-<li>Buying the game from Steam or Oculus Store - The safest and most legitimate way to play Beat Saber - RIOT - Quot;Overkill Quot; is to buy the game from Steam or Oculus Store, which are official platforms that sell and distribute VR games. You can buy the game for around $30 and enjoy all the features and updates that the game offers. You can also access the Steam Workshop or Oculus Store Library to download custom songs and mods created by the community.</li>
-<li>Streaming the game from a cloud gaming service - Another way to play Beat Saber - RIOT - Quot;Overkill Quot; without having to download it is to stream it from a cloud gaming service, which is a service that allows you to play games on your device using a remote server that runs the game for you. You can stream the game using a VR headset or a regular screen, depending on the service you choose. Some of the cloud gaming services that support Beat Saber are Shadow, Vortex, and Boosteroid.</li>
-<li>Playing the game on a VR arcade or a friend's device - A third way to play Beat Saber - RIOT - Quot;Overkill Quot; without having to download it is to play it on a VR arcade or a friend's device, which are places or devices that have the game installed and ready to play. You can find a VR arcade near you or ask a friend who has the game if you can borrow their device. You can play the game for a limited time or for a small fee, depending on the place or device you choose.</li>
-</ul>
-
-<p>These alternatives can help you play Beat Saber - RIOT - Quot;Overkill Quot; without having to download it from a torrent site using a magnet link.</p>
-
-<h2>Conclusion</h2>
-
-<p>Beat Saber - RIOT - Quot;Overkill Quot; Full Crack [Crack Serial Key is a VR rhythm game that will make you slash the beats of an intense dubstep track with virtual lightsabers. The game is fun and challenging, and has many features that will enhance your gameplay experience. However, if you want to play the game, you should avoid downloading it from a torrent site using a magnet link, as this can expose you to legal, security, and quality risks. Instead, you should consider buying the game from Steam or Oculus Store, streaming it from a cloud gaming service, or playing it on a VR arcade or a friend's device. These alternatives are safer and more reliable, and will allow you to enjoy playing Beat Saber - RIOT - Quot;Overkill Quot; without any hassle.</p>
-
-<p>We hope this article has helped you learn more about Beat Saber - RIOT - Quot;Overkill Quot; Full Crack [Crack Serial Key and how to get it from a torrent site using a magnet link. If you have any questions or comments, please feel free to leave them below.</p>
-<h2>Conclusion</h2>
-
-<p>Beat Saber - RIOT - Quot;Overkill Quot; Full Crack [Crack Serial Key is a VR rhythm game that will make you slash the beats of an intense dubstep track with virtual lightsabers. The game is fun and challenging, and has many features that will enhance your gameplay experience. However, if you want to play the game, you should avoid downloading it from a torrent site using a magnet link, as this can expose you to legal, security, and quality risks. Instead, you should consider buying the game from Steam or Oculus Store, streaming it from a cloud gaming service, or playing it on a VR arcade or a friend's device. These alternatives are safer and more reliable, and will allow you to enjoy playing Beat Saber - RIOT - Quot;Overkill Quot; without any hassle.</p>
-
-<p>We hope this article has helped you learn more about Beat Saber - RIOT - Quot;Overkill Quot; Full Crack [Crack Serial Key and how to get it from a torrent site using a magnet link. If you have any questions or comments, please feel free to leave them below.</p> 3cee63e6c2<br />
-<br />
-<br />
\ No newline at end of file
diff --git a/spaces/inplisQlawa/anything-midjourney-v4-1/Chromos Svjetlost Software.md b/spaces/inplisQlawa/anything-midjourney-v4-1/Chromos Svjetlost Software.md
deleted file mode 100644
index 0efb3338174b362b8516a9f37e38ff6083115350..0000000000000000000000000000000000000000
--- a/spaces/inplisQlawa/anything-midjourney-v4-1/Chromos Svjetlost Software.md	
+++ /dev/null
@@ -1,68 +0,0 @@
-<h2>Chromos Svjetlost Software</h2><br /><p><b><b>Download</b> &#10037;&#10037;&#10037; <a href="https://urlin.us/2uEx0c">https://urlin.us/2uEx0c</a></b></p><br /><br />
-<br />
-, first developed by Igor Pavic at Mjukarna University, known for being an innovative tool for professional musicians and composers.
-
-Stjepan is a prolific composer, and has produced numerous compositions for European, South American, and Asian choirs. His most recent works include "Santa Maria delle Grazie" in 1999, "Sagrada vezja" in 2000, "Cristoforo Colombo" in 2001, "Cantata ascetica" in 2003, "La gloria di Gerusalemme" in 2004, "Santa Maria in Rocca d’Elba" in 2005, and "I Signori di Estrade" in 2007. Some of his works are named after cities, such as "Sanremo", "Capri", "Bellini", "Milan", "Catania", "Venezia", "Nuova Venezia", "Milano" and "Piacenza".
-
-References
-
-External links
-
- Stjepan Milić biography
-
- The website of "Armonia Musicale"
-
- Interview with Stjepan Milić
-
-Category:1961 births
-
-Category:Living people
-
-Category:Croatian composers
-
-Category:21st-century composersSuppose you were a true believer. Suppose you had
-
-faith in the gospel of Jesus Christ. Suppose
-
-you believed in the virgin birth of Jesus
-
-Christ, the substitutionary death of Jesus
-
-Christ, his bodily resurrection, his ascension
-
-into heaven, his bodily presence in the Eucharist,
-
-his coming again in glory, his Second Coming,
-
-and his personal return. Suppose you believed
-
-in the bodily resurrection of the just and
-
-the unjust, in the rapture, and in the end
-
-of the world.
-
-If so, then you are not afraid of death.
-
-You do not live in mortal fear of the consequences
-
-of your sin, but you do live in mortal fear
-
-of the day of judgment. For Christ said, “Come,
-
-my people; enter thou into the LORD’S
-
-Presence.” You were told:
-
-“Fear not, I am the First and the Last,
-
-and the Living One; I was dead, and behold
-
-I am alive for evermore, and I have the keys
-
-of death and hell.”
-
-You are 4fefd39f24<br />
-<br />
-<br />
-<p></p>
diff --git a/spaces/ismot/1702t1/models/modules/swin_transformer.py b/spaces/ismot/1702t1/models/modules/swin_transformer.py
deleted file mode 100644
index 29996bbc08af9302dfad40e64edd9a3d976fb3a2..0000000000000000000000000000000000000000
--- a/spaces/ismot/1702t1/models/modules/swin_transformer.py
+++ /dev/null
@@ -1,43 +0,0 @@
-from models.modules.transformer_modules import *
-
-
-class Swin_Transformer(nn.Module):
-    def __init__(self, dim, depth, heads, win_size, dim_head, mlp_dim,
-                 dropout=0., patch_num=None, ape=None, rpe=None, rpe_pos=1):
-        super().__init__()
-        self.absolute_pos_embed = None if patch_num is None or ape is None else AbsolutePosition(dim, dropout,
-                                                                                                 patch_num, ape)
-        self.pos_dropout = nn.Dropout(dropout)
-        self.layers = nn.ModuleList([])
-        for i in range(depth):
-            self.layers.append(nn.ModuleList([
-                PreNorm(dim, WinAttention(dim, win_size=win_size, shift=0 if (i % 2 == 0) else win_size // 2,
-                                          heads=heads, dim_head=dim_head, dropout=dropout, rpe=rpe, rpe_pos=rpe_pos)),
-                PreNorm(dim, FeedForward(dim, mlp_dim, dropout=dropout)),
-            ]))
-
-    def forward(self, x):
-        if self.absolute_pos_embed is not None:
-            x = self.absolute_pos_embed(x)
-        x = self.pos_dropout(x)
-        for attn, ff in self.layers:
-            x = attn(x) + x
-            x = ff(x) + x
-        return x
-
-
-if __name__ == '__main__':
-    token_dim = 1024
-    toke_len = 256
-
-    transformer = Swin_Transformer(dim=token_dim,
-                                   depth=6,
-                                   heads=16,
-                                   win_size=8,
-                                   dim_head=64,
-                                   mlp_dim=2048,
-                                   dropout=0.1)
-
-    input = torch.randn(1, toke_len, token_dim)
-    output = transformer(input)
-    print(output.shape)
diff --git a/spaces/jackli888/stable-diffusion-webui/modules/paths.py b/spaces/jackli888/stable-diffusion-webui/modules/paths.py
deleted file mode 100644
index 21f532c02f52c90fcc517f5bff54c63fa3d321d0..0000000000000000000000000000000000000000
--- a/spaces/jackli888/stable-diffusion-webui/modules/paths.py
+++ /dev/null
@@ -1,62 +0,0 @@
-import argparse
-import os
-import sys
-import modules.safe
-
-script_path = os.path.dirname(os.path.dirname(os.path.realpath(__file__)))
-
-# Parse the --data-dir flag first so we can use it as a base for our other argument default values
-parser = argparse.ArgumentParser(add_help=False)
-parser.add_argument("--data-dir", type=str, default=os.path.dirname(os.path.dirname(os.path.realpath(__file__))), help="base path where all user data is stored",)
-cmd_opts_pre = parser.parse_known_args()[0]
-data_path = cmd_opts_pre.data_dir
-models_path = os.path.join(data_path, "models")
-
-# data_path = cmd_opts_pre.data
-sys.path.insert(0, script_path)
-
-# search for directory of stable diffusion in following places
-sd_path = None
-possible_sd_paths = [os.path.join(script_path, 'repositories/stable-diffusion-stability-ai'), '.', os.path.dirname(script_path)]
-for possible_sd_path in possible_sd_paths:
-    if os.path.exists(os.path.join(possible_sd_path, 'ldm/models/diffusion/ddpm.py')):
-        sd_path = os.path.abspath(possible_sd_path)
-        break
-
-assert sd_path is not None, "Couldn't find Stable Diffusion in any of: " + str(possible_sd_paths)
-
-path_dirs = [
-    (sd_path, 'ldm', 'Stable Diffusion', []),
-    (os.path.join(sd_path, '../taming-transformers'), 'taming', 'Taming Transformers', []),
-    (os.path.join(sd_path, '../CodeFormer'), 'inference_codeformer.py', 'CodeFormer', []),
-    (os.path.join(sd_path, '../BLIP'), 'models/blip.py', 'BLIP', []),
-    (os.path.join(sd_path, '../k-diffusion'), 'k_diffusion/sampling.py', 'k_diffusion', ["atstart"]),
-]
-
-paths = {}
-
-for d, must_exist, what, options in path_dirs:
-    must_exist_path = os.path.abspath(os.path.join(script_path, d, must_exist))
-    if not os.path.exists(must_exist_path):
-        print(f"Warning: {what} not found at path {must_exist_path}", file=sys.stderr)
-    else:
-        d = os.path.abspath(d)
-        if "atstart" in options:
-            sys.path.insert(0, d)
-        else:
-            sys.path.append(d)
-        paths[what] = d
-
-
-class Prioritize:
-    def __init__(self, name):
-        self.name = name
-        self.path = None
-
-    def __enter__(self):
-        self.path = sys.path.copy()
-        sys.path = [paths[self.name]] + sys.path
-
-    def __exit__(self, exc_type, exc_val, exc_tb):
-        sys.path = self.path
-        self.path = None
diff --git a/spaces/jackli888/stable-diffusion-webui/modules/postprocessing.py b/spaces/jackli888/stable-diffusion-webui/modules/postprocessing.py
deleted file mode 100644
index 21e32af9866abfc02288f9f04a5195f1700de1b0..0000000000000000000000000000000000000000
--- a/spaces/jackli888/stable-diffusion-webui/modules/postprocessing.py
+++ /dev/null
@@ -1,103 +0,0 @@
-import os
-
-from PIL import Image
-
-from modules import shared, images, devices, scripts, scripts_postprocessing, ui_common, generation_parameters_copypaste
-from modules.shared import opts
-
-
-def run_postprocessing(extras_mode, image, image_folder, input_dir, output_dir, show_extras_results, *args, save_output: bool = True):
-    devices.torch_gc()
-
-    shared.state.begin()
-    shared.state.job = 'extras'
-
-    image_data = []
-    image_names = []
-    outputs = []
-
-    if extras_mode == 1:
-        for img in image_folder:
-            image = Image.open(img)
-            image_data.append(image)
-            image_names.append(os.path.splitext(img.orig_name)[0])
-    elif extras_mode == 2:
-        assert not shared.cmd_opts.hide_ui_dir_config, '--hide-ui-dir-config option must be disabled'
-        assert input_dir, 'input directory not selected'
-
-        image_list = shared.listfiles(input_dir)
-        for filename in image_list:
-            try:
-                image = Image.open(filename)
-            except Exception:
-                continue
-            image_data.append(image)
-            image_names.append(filename)
-    else:
-        assert image, 'image not selected'
-
-        image_data.append(image)
-        image_names.append(None)
-
-    if extras_mode == 2 and output_dir != '':
-        outpath = output_dir
-    else:
-        outpath = opts.outdir_samples or opts.outdir_extras_samples
-
-    infotext = ''
-
-    for image, name in zip(image_data, image_names):
-        shared.state.textinfo = name
-
-        existing_pnginfo = image.info or {}
-
-        pp = scripts_postprocessing.PostprocessedImage(image.convert("RGB"))
-
-        scripts.scripts_postproc.run(pp, args)
-
-        if opts.use_original_name_batch and name is not None:
-            basename = os.path.splitext(os.path.basename(name))[0]
-        else:
-            basename = ''
-
-        infotext = ", ".join([k if k == v else f'{k}: {generation_parameters_copypaste.quote(v)}' for k, v in pp.info.items() if v is not None])
-
-        if opts.enable_pnginfo:
-            pp.image.info = existing_pnginfo
-            pp.image.info["postprocessing"] = infotext
-
-        if save_output:
-            images.save_image(pp.image, path=outpath, basename=basename, seed=None, prompt=None, extension=opts.samples_format, info=infotext, short_filename=True, no_prompt=True, grid=False, pnginfo_section_name="extras", existing_info=existing_pnginfo, forced_filename=None)
-
-        if extras_mode != 2 or show_extras_results:
-            outputs.append(pp.image)
-
-    devices.torch_gc()
-
-    return outputs, ui_common.plaintext_to_html(infotext), ''
-
-
-def run_extras(extras_mode, resize_mode, image, image_folder, input_dir, output_dir, show_extras_results, gfpgan_visibility, codeformer_visibility, codeformer_weight, upscaling_resize, upscaling_resize_w, upscaling_resize_h, upscaling_crop, extras_upscaler_1, extras_upscaler_2, extras_upscaler_2_visibility, upscale_first: bool, save_output: bool = True):
-    """old handler for API"""
-
-    args = scripts.scripts_postproc.create_args_for_run({
-        "Upscale": {
-            "upscale_mode": resize_mode,
-            "upscale_by": upscaling_resize,
-            "upscale_to_width": upscaling_resize_w,
-            "upscale_to_height": upscaling_resize_h,
-            "upscale_crop": upscaling_crop,
-            "upscaler_1_name": extras_upscaler_1,
-            "upscaler_2_name": extras_upscaler_2,
-            "upscaler_2_visibility": extras_upscaler_2_visibility,
-        },
-        "GFPGAN": {
-            "gfpgan_visibility": gfpgan_visibility,
-        },
-        "CodeFormer": {
-            "codeformer_visibility": codeformer_visibility,
-            "codeformer_weight": codeformer_weight,
-        },
-    })
-
-    return run_postprocessing(extras_mode, image, image_folder, input_dir, output_dir, show_extras_results, *args, save_output=save_output)
diff --git a/spaces/jackyccl/segment-anything/groundingdino/models/GroundingDINO/backbone/position_encoding.py b/spaces/jackyccl/segment-anything/groundingdino/models/GroundingDINO/backbone/position_encoding.py
deleted file mode 100644
index eac7e896bbe85a670824bfe8ef487d0535d5bd99..0000000000000000000000000000000000000000
--- a/spaces/jackyccl/segment-anything/groundingdino/models/GroundingDINO/backbone/position_encoding.py
+++ /dev/null
@@ -1,186 +0,0 @@
-# ------------------------------------------------------------------------
-# Grounding DINO
-# url: https://github.com/IDEA-Research/GroundingDINO
-# Copyright (c) 2023 IDEA. All Rights Reserved.
-# Licensed under the Apache License, Version 2.0 [see LICENSE for details]
-# ------------------------------------------------------------------------
-# DINO
-# Copyright (c) 2022 IDEA. All Rights Reserved.
-# Licensed under the Apache License, Version 2.0 [see LICENSE for details]
-# ------------------------------------------------------------------------
-# Conditional DETR
-# Copyright (c) 2021 Microsoft. All Rights Reserved.
-# Licensed under the Apache License, Version 2.0 [see LICENSE for details]
-# ------------------------------------------------------------------------
-# Copied from DETR (https://github.com/facebookresearch/detr)
-# Copyright (c) Facebook, Inc. and its affiliates. All Rights Reserved.
-# ------------------------------------------------------------------------
-
-"""
-Various positional encodings for the transformer.
-"""
-import math
-
-import torch
-from torch import nn
-
-from groundingdino.util.misc import NestedTensor
-
-
-class PositionEmbeddingSine(nn.Module):
-    """
-    This is a more standard version of the position embedding, very similar to the one
-    used by the Attention is all you need paper, generalized to work on images.
-    """
-
-    def __init__(self, num_pos_feats=64, temperature=10000, normalize=False, scale=None):
-        super().__init__()
-        self.num_pos_feats = num_pos_feats
-        self.temperature = temperature
-        self.normalize = normalize
-        if scale is not None and normalize is False:
-            raise ValueError("normalize should be True if scale is passed")
-        if scale is None:
-            scale = 2 * math.pi
-        self.scale = scale
-
-    def forward(self, tensor_list: NestedTensor):
-        x = tensor_list.tensors
-        mask = tensor_list.mask
-        assert mask is not None
-        not_mask = ~mask
-        y_embed = not_mask.cumsum(1, dtype=torch.float32)
-        x_embed = not_mask.cumsum(2, dtype=torch.float32)
-        if self.normalize:
-            eps = 1e-6
-            # if os.environ.get("SHILONG_AMP", None) == '1':
-            #     eps = 1e-4
-            # else:
-            #     eps = 1e-6
-            y_embed = y_embed / (y_embed[:, -1:, :] + eps) * self.scale
-            x_embed = x_embed / (x_embed[:, :, -1:] + eps) * self.scale
-
-        dim_t = torch.arange(self.num_pos_feats, dtype=torch.float32, device=x.device)
-        dim_t = self.temperature ** (2 * (dim_t // 2) / self.num_pos_feats)
-
-        pos_x = x_embed[:, :, :, None] / dim_t
-        pos_y = y_embed[:, :, :, None] / dim_t
-        pos_x = torch.stack(
-            (pos_x[:, :, :, 0::2].sin(), pos_x[:, :, :, 1::2].cos()), dim=4
-        ).flatten(3)
-        pos_y = torch.stack(
-            (pos_y[:, :, :, 0::2].sin(), pos_y[:, :, :, 1::2].cos()), dim=4
-        ).flatten(3)
-        pos = torch.cat((pos_y, pos_x), dim=3).permute(0, 3, 1, 2)
-        return pos
-
-
-class PositionEmbeddingSineHW(nn.Module):
-    """
-    This is a more standard version of the position embedding, very similar to the one
-    used by the Attention is all you need paper, generalized to work on images.
-    """
-
-    def __init__(
-        self, num_pos_feats=64, temperatureH=10000, temperatureW=10000, normalize=False, scale=None
-    ):
-        super().__init__()
-        self.num_pos_feats = num_pos_feats
-        self.temperatureH = temperatureH
-        self.temperatureW = temperatureW
-        self.normalize = normalize
-        if scale is not None and normalize is False:
-            raise ValueError("normalize should be True if scale is passed")
-        if scale is None:
-            scale = 2 * math.pi
-        self.scale = scale
-
-    def forward(self, tensor_list: NestedTensor):
-        x = tensor_list.tensors
-        mask = tensor_list.mask
-        assert mask is not None
-        not_mask = ~mask
-        y_embed = not_mask.cumsum(1, dtype=torch.float32)
-        x_embed = not_mask.cumsum(2, dtype=torch.float32)
-
-        # import ipdb; ipdb.set_trace()
-
-        if self.normalize:
-            eps = 1e-6
-            y_embed = y_embed / (y_embed[:, -1:, :] + eps) * self.scale
-            x_embed = x_embed / (x_embed[:, :, -1:] + eps) * self.scale
-
-        dim_tx = torch.arange(self.num_pos_feats, dtype=torch.float32, device=x.device)
-        dim_tx = self.temperatureW ** (2 * (torch.div(dim_tx, 2, rounding_mode='floor')) / self.num_pos_feats)
-        pos_x = x_embed[:, :, :, None] / dim_tx
-
-        dim_ty = torch.arange(self.num_pos_feats, dtype=torch.float32, device=x.device)
-        dim_ty = self.temperatureH ** (2 * (torch.div(dim_ty, 2, rounding_mode='floor')) / self.num_pos_feats)
-        pos_y = y_embed[:, :, :, None] / dim_ty
-
-        pos_x = torch.stack(
-            (pos_x[:, :, :, 0::2].sin(), pos_x[:, :, :, 1::2].cos()), dim=4
-        ).flatten(3)
-        pos_y = torch.stack(
-            (pos_y[:, :, :, 0::2].sin(), pos_y[:, :, :, 1::2].cos()), dim=4
-        ).flatten(3)
-        pos = torch.cat((pos_y, pos_x), dim=3).permute(0, 3, 1, 2)
-
-        # import ipdb; ipdb.set_trace()
-
-        return pos
-
-
-class PositionEmbeddingLearned(nn.Module):
-    """
-    Absolute pos embedding, learned.
-    """
-
-    def __init__(self, num_pos_feats=256):
-        super().__init__()
-        self.row_embed = nn.Embedding(50, num_pos_feats)
-        self.col_embed = nn.Embedding(50, num_pos_feats)
-        self.reset_parameters()
-
-    def reset_parameters(self):
-        nn.init.uniform_(self.row_embed.weight)
-        nn.init.uniform_(self.col_embed.weight)
-
-    def forward(self, tensor_list: NestedTensor):
-        x = tensor_list.tensors
-        h, w = x.shape[-2:]
-        i = torch.arange(w, device=x.device)
-        j = torch.arange(h, device=x.device)
-        x_emb = self.col_embed(i)
-        y_emb = self.row_embed(j)
-        pos = (
-            torch.cat(
-                [
-                    x_emb.unsqueeze(0).repeat(h, 1, 1),
-                    y_emb.unsqueeze(1).repeat(1, w, 1),
-                ],
-                dim=-1,
-            )
-            .permute(2, 0, 1)
-            .unsqueeze(0)
-            .repeat(x.shape[0], 1, 1, 1)
-        )
-        return pos
-
-
-def build_position_encoding(args):
-    N_steps = args.hidden_dim // 2
-    if args.position_embedding in ("v2", "sine"):
-        # TODO find a better way of exposing other arguments
-        position_embedding = PositionEmbeddingSineHW(
-            N_steps,
-            temperatureH=args.pe_temperatureH,
-            temperatureW=args.pe_temperatureW,
-            normalize=True,
-        )
-    elif args.position_embedding in ("v3", "learned"):
-        position_embedding = PositionEmbeddingLearned(N_steps)
-    else:
-        raise ValueError(f"not supported {args.position_embedding}")
-
-    return position_embedding
diff --git a/spaces/jbilcke-hf/ai-comic-factory/src/app/main.tsx b/spaces/jbilcke-hf/ai-comic-factory/src/app/main.tsx
deleted file mode 100644
index c4db7e1fa4dc262d2431ce19da672e541b8dfaf4..0000000000000000000000000000000000000000
--- a/spaces/jbilcke-hf/ai-comic-factory/src/app/main.tsx
+++ /dev/null
@@ -1,179 +0,0 @@
-"use client"
-
-import { useEffect, useState, useTransition } from "react"
-
-import { cn } from "@/lib/utils"
-import { TopMenu } from "./interface/top-menu"
-import { fonts } from "@/lib/fonts"
-import { useStore } from "./store"
-import { Zoom } from "./interface/zoom"
-import { getStory } from "./queries/getStory"
-import { BottomBar } from "./interface/bottom-bar"
-import { Page } from "./interface/page"
-import { LLMResponse } from "@/types"
-
-export default function Main() {
-  const [_isPending, startTransition] = useTransition()
-
-  const isGeneratingStory = useStore(state => state.isGeneratingStory)
-  const setGeneratingStory = useStore(state => state.setGeneratingStory)
-
-  const font = useStore(state => state.font)
-  const preset = useStore(state => state.preset)
-  const prompt = useStore(state => state.prompt)
-
-  const nbPages = useStore(state => state.nbPages)
-  const nbTotalPanels = useStore(state => state.nbTotalPanels)
-
-  const setPanels = useStore(state => state.setPanels)
-  const setCaptions = useStore(state => state.setCaptions)
-
-  const zoomLevel = useStore(state => state.zoomLevel)
-
-  const [waitABitMore, setWaitABitMore] = useState(false)
-
-  // react to prompt changes
-  useEffect(() => {
-    if (!prompt) { return }
-
-    startTransition(async () => {
-      setWaitABitMore(false)
-      setGeneratingStory(true)
-
-      // I don't think we are going to need a rate limiter on the LLM part anymore
-      const enableRateLimiter = false // `${process.env.NEXT_PUBLIC_ENABLE_RATE_LIMITER}`  === "true"
-
-      let llmResponse: LLMResponse = []
-
-      const [stylePrompt, userStoryPrompt] = prompt.split("||")
-
-      try {
-        llmResponse = await getStory({
-          preset,
-          prompt: [
-            `${userStoryPrompt}`,
-
-            // not necessary + it confuses the LLM if we use custom 
-            // + the LLM may reject some of the styles
-            // stylePrompt ? `in the following context: ${stylePrompt}` : ''
-
-          ].filter(x => x).join(", "), nbTotalPanels })
-        console.log("LLM responded:", llmResponse)
-
-      } catch (err) {
-        console.log("LLM step failed due to:", err)
-        console.log("we are now switching to a degraded mode, using 4 similar panels")
-        
-        llmResponse = []
-        for (let p = 0; p < nbTotalPanels; p++) {
-          llmResponse.push({
-            panel: p,
-            instructions: `${prompt} ${".".repeat(p)}`,
-            caption: "(Sorry, LLM generation failed: using degraded mode)"
-          })
-        }
-        console.error(err)
-      }
-
-      // we have to limit the size of the prompt, otherwise the rest of the style won't be followed
-
-      let limitedStylePrompt = stylePrompt.slice(0, 77)
-      if (limitedStylePrompt.length !== stylePrompt.length) {
-        console.log("Sorry folks, the style prompt was cut to:", limitedStylePrompt)
-      }
-
-      // new experimental prompt: let's drop the user prompt, and only use the style
-      const lightPanelPromptPrefix = preset.imagePrompt(limitedStylePrompt).filter(x => x).join(", ")
-
-      // this prompt will be used if the LLM generation failed
-      const degradedPanelPromptPrefix = [
-        ...preset.imagePrompt(limitedStylePrompt),
-
-        // we re-inject the story, then
-        userStoryPrompt,
-      ].filter(x => x).join(", ")
-
-      const newPanels: string[] = []
-      const newCaptions: string[] = []
-      setWaitABitMore(true)
-      console.log("Panel prompts for SDXL:")
-      for (let p = 0; p < nbTotalPanels; p++) {
-        newCaptions.push(llmResponse[p]?.caption || "...")
-        const newPanel = [
-
-          // what we do here is that ideally we give full control to the LLM for prompting,
-          // unless there was a catastrophic failure, in that case we preserve the original prompt
-          llmResponse[p]?.instructions
-          ? lightPanelPromptPrefix
-          : degradedPanelPromptPrefix,
-
-          llmResponse[p]?.instructions || ""
-        ].map(chunk => chunk).join(", ")
-        newPanels.push(newPanel)
-        console.log(newPanel)
-      }
-   
-      setCaptions(newCaptions)
-      setPanels(newPanels)
-
-      setTimeout(() => {
-        setGeneratingStory(false)
-        setWaitABitMore(false)
-      }, enableRateLimiter ? 12000 : 0)
- 
-    })
-  }, [prompt, preset?.label, nbTotalPanels]) // important: we need to react to preset changes too
-
-  return (
-    <div>
-      <TopMenu />
-      <div className={cn(
-        `flex items-start w-screen h-screen pt-24 md:pt-[72px] overflow-y-scroll`,
-        `transition-all duration-200 ease-in-out`,
-        zoomLevel > 105 ? `px-0` : `pl-1 pr-8 md:pl-16 md:pr-16`,
-        `print:pt-0 print:px-0 print:pl-0 print:pr-0`,
-        fonts.actionman.className
-      )}>
-        <div
-          className={cn(
-            `flex flex-col w-full`,
-            zoomLevel > 105 ? `items-start` : `items-center`
-          )}>
-          <div
-            className={cn(
-              `comic-page`,
-              `flex flex-col md:flex-row md:space-x-8 lg:space-x-12 xl:space-x-16 md:items-center md:justify-start print:space-x-4`,
-            )}
-            style={{
-              width: `${zoomLevel}%`
-            }}>
-            <Page page={0} />
-
-            <Page page={1} />
-          </div>
-        </div>
-      </div>
-      <Zoom />
-      <BottomBar />
-      <div className={cn(
-        `print:hidden`,
-        `z-20 fixed inset-0`,
-        `flex flex-row items-center justify-center`,
-        `transition-all duration-300 ease-in-out`,
-        isGeneratingStory
-          ? `bg-zinc-50/30 backdrop-blur-md`
-          : `bg-zinc-50/0 backdrop-blur-none pointer-events-none`,
-        fonts.actionman.className
-      )}>
-        <div className={cn(
-          `text-center text-xl text-stone-700 w-[70%]`,
-          isGeneratingStory ? ``: `scale-0 opacity-0`,
-          `transition-all duration-300 ease-in-out`,
-        )}>
-          {waitABitMore ? `Story is ready, but server is a bit busy!`: 'Generating a new story..'}<br/>
-          {waitABitMore ? `Please hold tight..` : ''}
-        </div>
-      </div>
-    </div>
-  )
-}
\ No newline at end of file
diff --git a/spaces/jeremymontgomeryoptum/Text2Speech/README.md b/spaces/jeremymontgomeryoptum/Text2Speech/README.md
deleted file mode 100644
index 8bcefbd7210097fd07052f73d7a9d748ed5d5e2b..0000000000000000000000000000000000000000
--- a/spaces/jeremymontgomeryoptum/Text2Speech/README.md
+++ /dev/null
@@ -1,13 +0,0 @@
----
-title: Text2Speech
-emoji: 👀
-colorFrom: red
-colorTo: purple
-sdk: gradio
-sdk_version: 3.39.0
-app_file: app.py
-pinned: false
-license: apache-2.0
----
-
-Check out the configuration reference at https://huggingface.co/docs/hub/spaces-config-reference
diff --git a/spaces/jhj0517/Segment-Anything-Layer-Divider/modules/sam.py b/spaces/jhj0517/Segment-Anything-Layer-Divider/modules/sam.py
deleted file mode 100644
index 265b93558e74dade542b1760904874d85a4f7cba..0000000000000000000000000000000000000000
--- a/spaces/jhj0517/Segment-Anything-Layer-Divider/modules/sam.py
+++ /dev/null
@@ -1,67 +0,0 @@
-from segment_anything import sam_model_registry, SamAutomaticMaskGenerator, SamPredictor
-import os
-import torch
-
-from modules.mask_utils import *
-from modules.model_downloader import *
-
-
-class SamInference:
-    def __init__(self):
-        self.model = None
-        self.model_path = f"models/sam_vit_h_4b8939.pth"
-        self.device = torch.device("cuda" if torch.cuda.is_available() else "cpu")
-        self.mask_generator = None
-
-        # Tuable Parameters , All default values
-        self.tunable_params = {
-            'points_per_side': 32,
-            'pred_iou_thresh': 0.88,
-            'stability_score_thresh': 0.95,
-            'crop_n_layers': 0,
-            'crop_n_points_downscale_factor': 1,
-            'min_mask_region_area': 0
-        }
-
-    def set_mask_generator(self):
-        print("applying configs to model..")
-        if not os.path.exists(self.model_path):
-            print("No needed SAM model detected. downloading VIT H SAM model....")
-            download_sam_model_url()
-
-        self.model = sam_model_registry["default"](checkpoint=self.model_path)
-        self.model.to(device=self.device)
-        self.mask_generator = SamAutomaticMaskGenerator(
-            self.model,
-            points_per_side=self.tunable_params['points_per_side'],
-            pred_iou_thresh=self.tunable_params['pred_iou_thresh'],
-            stability_score_thresh=self.tunable_params['stability_score_thresh'],
-            crop_n_layers=self.tunable_params['crop_n_layers'],
-            crop_n_points_downscale_factor=self.tunable_params['crop_n_points_downscale_factor'],
-            min_mask_region_area=self.tunable_params['min_mask_region_area'],
-            output_mode="coco_rle",
-        )
-
-    def generate_mask(self, image):
-        return [self.mask_generator.generate(image)]
-
-    def generate_mask_app(self, image, *params):
-        tunable_params = {
-            'points_per_side': int(params[0]),
-            'pred_iou_thresh': float(params[1]),
-            'stability_score_thresh': float(params[2]),
-            'crop_n_layers': int(params[3]),
-            'crop_n_points_downscale_factor': int(params[4]),
-            'min_mask_region_area': int(params[5]),
-        }
-
-        try:
-            if self.model is None or self.mask_generator is None or self.tunable_params != tunable_params:
-                self.tunable_params = tunable_params
-                self.set_mask_generator()
-            masks = self.mask_generator.generate(image)
-            combined_image = create_mask_combined_images(image, masks)
-            gallery = create_mask_gallery(image, masks)
-            return [combined_image] + gallery
-        except Exception as e:
-            print(e)
\ No newline at end of file
diff --git a/spaces/jiaxianustc/mbp/UltraFlow/models/sbap.py b/spaces/jiaxianustc/mbp/UltraFlow/models/sbap.py
deleted file mode 100644
index 5cad4a0b27fabf741c85251a7750fe1e1ed69020..0000000000000000000000000000000000000000
--- a/spaces/jiaxianustc/mbp/UltraFlow/models/sbap.py
+++ /dev/null
@@ -1,586 +0,0 @@
-import torch
-import torch.nn as nn
-from UltraFlow import layers, losses
-
-class IGN_basic(nn.Module):
-    def __init__(self,config):
-        super(IGN_basic, self).__init__()
-        self.config = config
-        self.pretrain_assay_mlp_share = config.train.pretrain_assay_mlp_share
-        self.pretrain_use_assay_description = config.train.pretrain_use_assay_description
-        self.graph_conv = layers.ModifiedAttentiveFPGNNV2(config.model.lig_node_dim, config.model.lig_edge_dim, config.model.num_layers, config.model.hidden_dim, config.model.dropout, config.model.jk)
-        if config.model.jk == 'concat':
-            self.noncov_graph = layers.DTIConvGraph3Layer_IGN_basic(config.model.hidden_dim * config.model.num_layers + config.model.inter_edge_dim, config.model.inter_out_dim, config.model.dropout)
-        else:
-            self.noncov_graph = layers.DTIConvGraph3Layer_IGN_basic(config.model.hidden_dim + config.model.inter_edge_dim, config.model.inter_out_dim, config.model.dropout)
-
-        if config.model.readout.startswith('multi_head') and config.model.attn_merge=='concat':
-            self.FC = layers.FC(config.model.inter_out_dim * (config.model.num_head + 1), config.model.fc_hidden_dim, config.model.dropout, config.model.out_dim)
-        else:
-            self.FC = layers.FC(config.model.inter_out_dim * 2, config.model.fc_hidden_dim, config.model.dropout, config.model.out_dim)
-        self.readout = layers.ReadsOutLayer(config.model.inter_out_dim, config.model.readout, config.model.num_head, config.model.attn_merge)
-        self.softmax = nn.Softmax(dim=1)
-        if self.pretrain_use_assay_description:
-            print(f'use assay descrption type: {config.data.assay_des_type}')
-            if self.pretrain_assay_mlp_share:
-                self.assay_info_aggre_mlp = layers.FC(config.data.assay_des_dim, config.model.assay_des_fc_hidden_dim,
-                                                  config.model.dropout, config.model.inter_out_dim * 2)
-            else:
-                self.assay_info_aggre_mlp_pointwise = layers.FC(config.data.assay_des_dim, config.model.assay_des_fc_hidden_dim,
-                                                        config.model.dropout, config.model.inter_out_dim * 2)
-                self.assay_info_aggre_mlp_pairwise = layers.FC(config.data.assay_des_dim, config.model.assay_des_fc_hidden_dim,
-                                                        config.model.dropout, config.model.inter_out_dim * 2)
-
-    def forward(self, batch):
-        bg_lig, bg_prot, bg_inter, labels, _, ass_des = batch
-
-        node_feats_lig = self.graph_conv(bg_lig)
-        node_feats_prot = self.graph_conv(bg_prot)
-        bg_inter.ndata['h'] = self.alignfeature(bg_lig,bg_prot,node_feats_lig,node_feats_prot)
-        bond_feats_inter = self.noncov_graph(bg_inter)
-        graph_embedding = self.readout(bg_inter, bond_feats_inter)
-
-        if self.pretrain_use_assay_description:
-            if self.pretrain_assay_mlp_share:
-                ranking_assay_embedding = self.assay_info_aggre_mlp(ass_des)
-                affinity_pred = self.FC(graph_embedding + ranking_assay_embedding)
-            else:
-                regression_assay_embedding = self.assay_info_aggre_mlp_pointwise(ass_des)
-                affinity_pred = self.FC(graph_embedding + regression_assay_embedding)
-                ranking_assay_embedding = self.assay_info_aggre_mlp_pairwise(ass_des)
-        else:
-            affinity_pred = self.FC(graph_embedding)
-            ranking_assay_embedding = torch.zeros(len(affinity_pred))
-
-        return affinity_pred, graph_embedding, ranking_assay_embedding
-
-    def alignfeature(self,bg_lig,bg_prot,node_feats_lig,node_feats_prot):
-        inter_feature = torch.cat((node_feats_lig,node_feats_prot))
-        lig_num,prot_num = bg_lig.batch_num_nodes(),bg_prot.batch_num_nodes()
-        lig_start, prot_start = lig_num.cumsum(0) - lig_num, prot_num.cumsum(0) - prot_num
-        inter_start = lig_start + prot_start
-        for i in range(lig_num.shape[0]):
-            inter_feature[inter_start[i]:inter_start[i]+lig_num[i]] = node_feats_lig[lig_start[i]:lig_start[i]+lig_num[i]]
-            inter_feature[inter_start[i]+lig_num[i]:inter_start[i]+lig_num[i]+prot_num[i]] = node_feats_prot[prot_start[i]:prot_start[i]+prot_num[i]]
-        return inter_feature
-
-class IGN(nn.Module):
-    def __init__(self,config):
-        super(IGN, self).__init__()
-        self.config = config
-        self.pretrain_assay_mlp_share = config.train.pretrain_assay_mlp_share
-        self.pretrain_use_assay_description = config.train.pretrain_use_assay_description
-        self.ligand_conv = layers.ModifiedAttentiveFPGNNV2(config.model.lig_node_dim, config.model.lig_edge_dim, config.model.num_layers, config.model.hidden_dim, config.model.dropout, config.model.jk)
-        self.protein_conv = layers.ModifiedAttentiveFPGNNV2(config.model.pro_node_dim, config.model.pro_edge_dim, config.model.num_layers, config.model.hidden_dim, config.model.dropout, config.model.jk)
-        if config.model.jk == 'concat':
-            self.noncov_graph = layers.DTIConvGraph3Layer(config.model.hidden_dim * (config.model.num_layers + config.model.num_layers) + config.model.inter_edge_dim, config.model.inter_out_dim, config.model.dropout)
-        else:
-            self.noncov_graph = layers.DTIConvGraph3Layer(config.model.hidden_dim * 2 + config.model.inter_edge_dim, config.model.inter_out_dim, config.model.dropout)
-
-        if config.model.readout.startswith('multi_head') and config.model.attn_merge=='concat':
-            self.FC = layers.FC(config.model.inter_out_dim * (config.model.num_head + 1), config.model.fc_hidden_dim, config.model.dropout, config.model.out_dim)
-        else:
-            self.FC = layers.FC(config.model.inter_out_dim * 2, config.model.fc_hidden_dim, config.model.dropout, config.model.out_dim)
-
-        self.readout = layers.ReadsOutLayer(config.model.inter_out_dim, config.model.readout, config.model.num_head, config.model.attn_merge)
-        self.softmax = nn.Softmax(dim=1)
-        if self.pretrain_use_assay_description:
-            print(f'use assay descrption type: {config.data.assay_des_type}')
-            if self.pretrain_assay_mlp_share:
-                self.assay_info_aggre_mlp = layers.FC(config.data.assay_des_dim, config.model.assay_des_fc_hidden_dim,
-                                                  config.model.dropout, config.model.inter_out_dim * 2)
-            else:
-                self.assay_info_aggre_mlp_pointwise = layers.FC(config.data.assay_des_dim, config.model.assay_des_fc_hidden_dim,
-                                                        config.model.dropout, config.model.inter_out_dim * 2)
-                self.assay_info_aggre_mlp_pairwise = layers.FC(config.data.assay_des_dim, config.model.assay_des_fc_hidden_dim,
-                                                        config.model.dropout, config.model.inter_out_dim * 2)
-
-    def forward(self, batch):
-        bg_lig, bg_prot, bg_inter, labels, _, ass_des = batch
-
-        node_feats_lig = self.ligand_conv(bg_lig)
-        node_feats_prot = self.protein_conv(bg_prot)
-        bg_inter.ndata['h'] = self.alignfeature(bg_lig,bg_prot,node_feats_lig,node_feats_prot)
-        bond_feats_inter = self.noncov_graph(bg_inter)
-        graph_embedding = self.readout(bg_inter, bond_feats_inter)
-
-        if self.pretrain_use_assay_description:
-            if self.pretrain_assay_mlp_share:
-                ranking_assay_embedding = self.assay_info_aggre_mlp(ass_des)
-                affinity_pred = self.FC(graph_embedding + ranking_assay_embedding)
-            else:
-                regression_assay_embedding = self.assay_info_aggre_mlp_pointwise(ass_des)
-                affinity_pred = self.FC(graph_embedding + regression_assay_embedding)
-                ranking_assay_embedding = self.assay_info_aggre_mlp_pairwise(ass_des)
-        else:
-            affinity_pred = self.FC(graph_embedding)
-            ranking_assay_embedding = torch.zeros(len(affinity_pred))
-
-        return affinity_pred, graph_embedding, ranking_assay_embedding
-
-    def alignfeature(self,bg_lig,bg_prot,node_feats_lig,node_feats_prot):
-        inter_feature = torch.cat((node_feats_lig,node_feats_prot))
-        lig_num,prot_num = bg_lig.batch_num_nodes(),bg_prot.batch_num_nodes()
-        lig_start, prot_start = lig_num.cumsum(0) - lig_num, prot_num.cumsum(0) - prot_num
-        inter_start = lig_start + prot_start
-        for i in range(lig_num.shape[0]):
-            inter_feature[inter_start[i]:inter_start[i]+lig_num[i]] = node_feats_lig[lig_start[i]:lig_start[i]+lig_num[i]]
-            inter_feature[inter_start[i]+lig_num[i]:inter_start[i]+lig_num[i]+prot_num[i]] = node_feats_prot[prot_start[i]:prot_start[i]+prot_num[i]]
-        return inter_feature
-
-class GNNs(nn.Module):
-    def __init__(self, nLigNode, nLigEdge, nLayer, nHid, JK, GNN):
-        super(GNNs, self).__init__()
-        if GNN == 'GCN':
-            self.Encoder = layers.GCN(nLigNode, hidden_feats=[nHid] * nLayer)
-        elif GNN == 'GAT':
-            self.Encoder = layers.GAT(nLigNode, hidden_feats=[nHid] * nLayer)
-        elif GNN == 'GIN':
-            self.Encoder = layers.GIN(nLigNode, nHid, nLayer, num_mlp_layers=2, dropout=0.1, learn_eps=False,
-                               neighbor_pooling_type='sum', JK=JK)
-        elif GNN == 'EGNN':
-            self.Encoder = layers.EGNN(nLigNode, nLigEdge, nHid, nLayer, dropout=0.1, JK=JK)
-        elif GNN == 'AttentiveFP':
-            self.Encoder = layers.ModifiedAttentiveFPGNNV2(nLigNode, nLigEdge, nLayer, nHid, 0.1, JK)
-
-    def forward(self, Graph, Perturb=None):
-        Node_Rep = self.Encoder(Graph, Perturb)
-        return Node_Rep
-        
-class Affinity_GNNs(nn.Module):
-    def __init__(self, config):
-        super(Affinity_GNNs, self).__init__()
-
-        lig_node_dim = config.model.lig_node_dim
-        lig_edge_dim = config.model.lig_edge_dim
-        pro_node_dim = config.model.pro_node_dim
-        pro_edge_dim = config.model.pro_edge_dim
-        layer_num = config.model.num_layers
-        hidden_dim = config.model.hidden_dim
-        jk = config.model.jk
-        GNN = config.model.GNN_type
-        self.pretrain_assay_mlp_share = config.train.pretrain_assay_mlp_share
-        self.pretrain_use_assay_description = config.train.pretrain_use_assay_description
-
-        self.lig_encoder = GNNs(lig_node_dim, lig_edge_dim, layer_num, hidden_dim, jk, GNN)
-        self.pro_encoder = GNNs(pro_node_dim, pro_edge_dim, layer_num, hidden_dim, jk, GNN)
-
-        if config.model.jk == 'concat':
-            self.noncov_graph = layers.DTIConvGraph3Layer(hidden_dim * (layer_num + layer_num) + config.model.inter_edge_dim, config.model.inter_out_dim, config.model.dropout)
-        else:
-            self.noncov_graph = layers.DTIConvGraph3Layer(hidden_dim * 2 + config.model.inter_edge_dim, config.model.inter_out_dim, config.model.dropout)
-        self.readout = layers.ReadsOutLayer(config.model.inter_out_dim, config.model.readout, config.model.num_head, config.model.attn_merge)
-
-        if config.model.readout.startswith('multi_head') and config.model.attn_merge=='concat':
-            self.FC = layers.FC(config.model.inter_out_dim * (config.model.num_head + 1), config.model.fc_hidden_dim, config.model.dropout, config.model.out_dim)
-        else:
-            self.FC = layers.FC(config.model.inter_out_dim * 2, config.model.fc_hidden_dim, config.model.dropout, config.model.out_dim)
-
-        self.softmax = nn.Softmax(dim=1)
-        if self.pretrain_use_assay_description:
-            print(f'use assay descrption type: {config.data.assay_des_type}')
-            if self.pretrain_assay_mlp_share:
-                self.assay_info_aggre_mlp = layers.FC(config.data.assay_des_dim, config.model.assay_des_fc_hidden_dim,
-                                                      config.model.dropout, config.model.inter_out_dim * 2)
-            else:
-                self.assay_info_aggre_mlp_pointwise = layers.FC(config.data.assay_des_dim, config.model.assay_des_fc_hidden_dim,
-                                                                config.model.dropout, config.model.inter_out_dim * 2)
-                self.assay_info_aggre_mlp_pairwise = layers.FC(config.data.assay_des_dim, config.model.assay_des_fc_hidden_dim,
-                                                               config.model.dropout, config.model.inter_out_dim * 2)
-
-    def forward(self, batch):
-        bg_lig, bg_prot, bg_inter, labels, _, ass_des = batch
-
-        node_feats_lig = self.lig_encoder(bg_lig)
-        node_feats_prot = self.pro_encoder(bg_prot)
-        bg_inter.ndata['h'] = self.alignfeature(bg_lig,bg_prot,node_feats_lig,node_feats_prot)
-        bond_feats_inter = self.noncov_graph(bg_inter)
-        graph_embedding = self.readout(bg_inter, bond_feats_inter)
-
-        if self.pretrain_use_assay_description:
-            if self.pretrain_assay_mlp_share:
-                ranking_assay_embedding = self.assay_info_aggre_mlp(ass_des)
-                affinity_pred = self.FC(graph_embedding + ranking_assay_embedding)
-            else:
-                regression_assay_embedding = self.assay_info_aggre_mlp_pointwise(ass_des)
-                affinity_pred = self.FC(graph_embedding + regression_assay_embedding)
-                ranking_assay_embedding = self.assay_info_aggre_mlp_pairwise(ass_des)
-        else:
-            affinity_pred = self.FC(graph_embedding)
-            ranking_assay_embedding = torch.zeros(len(affinity_pred))
-
-        return affinity_pred, graph_embedding, ranking_assay_embedding
-
-    def alignfeature(self,bg_lig,bg_prot,node_feats_lig,node_feats_prot):
-        inter_feature = torch.cat((node_feats_lig,node_feats_prot))
-        lig_num,prot_num = bg_lig.batch_num_nodes(),bg_prot.batch_num_nodes()
-        lig_start, prot_start = lig_num.cumsum(0) - lig_num, prot_num.cumsum(0) - prot_num
-        inter_start = lig_start + prot_start
-        for i in range(lig_num.shape[0]):
-            inter_feature[inter_start[i]:inter_start[i]+lig_num[i]] = node_feats_lig[lig_start[i]:lig_start[i]+lig_num[i]]
-            inter_feature[inter_start[i]+lig_num[i]:inter_start[i]+lig_num[i]+prot_num[i]] = node_feats_prot[prot_start[i]:prot_start[i]+prot_num[i]]
-        return inter_feature
-
-class affinity_head(nn.Module):
-    def __init__(self, config):
-        super(affinity_head, self).__init__()
-        self.pretrain_assay_mlp_share = config.train.pretrain_assay_mlp_share
-        self.pretrain_use_assay_description = config.train.pretrain_use_assay_description
-        if self.pretrain_use_assay_description:
-            print(f'use assay descrption type: {config.data.assay_des_type}')
-            if self.pretrain_assay_mlp_share:
-                self.assay_info_aggre_mlp = layers.FC(config.data.assay_des_dim, config.model.assay_des_fc_hidden_dim,
-                                                  config.model.dropout, config.model.inter_out_dim * 2)
-            else:
-                self.assay_info_aggre_mlp_pointwise = layers.FC(config.data.assay_des_dim, config.model.assay_des_fc_hidden_dim,
-                                                        config.model.dropout, config.model.inter_out_dim * 2)
-                self.assay_info_aggre_mlp_pairwise = layers.FC(config.data.assay_des_dim, config.model.assay_des_fc_hidden_dim,
-                                                        config.model.dropout, config.model.inter_out_dim * 2)
-        if config.model.readout.startswith('multi_head') and config.model.attn_merge=='concat':
-            self.FC = layers.FC(config.model.inter_out_dim * (config.model.num_head + 1), config.model.fintune_fc_hidden_dim, config.model.dropout, config.model.out_dim)
-        else:
-            self.FC = layers.FC(config.model.inter_out_dim * 2, config.model.fintune_fc_hidden_dim, config.model.dropout, config.model.out_dim)
-
-    def forward(self, graph_embedding, ass_des):
-        if self.pretrain_use_assay_description:
-            if self.pretrain_assay_mlp_share:
-                ranking_assay_embedding = self.assay_info_aggre_mlp(ass_des)
-                affinity_pred = self.FC(graph_embedding + ranking_assay_embedding)
-            else:
-                regression_assay_embedding = self.assay_info_aggre_mlp_pointwise(ass_des)
-                affinity_pred = self.FC(graph_embedding + regression_assay_embedding)
-                ranking_assay_embedding = self.assay_info_aggre_mlp_pairwise(ass_des)
-        else:
-            affinity_pred = self.FC(graph_embedding)
-            ranking_assay_embedding = torch.zeros(len(affinity_pred))
-
-        return affinity_pred
-
-
-class ASRP_head(nn.Module):
-    def __init__(self, config):
-        super(ASRP_head, self).__init__()
-
-        self.readout = layers.ReadsOutLayer(config.model.inter_out_dim, config.model.readout, config.model.num_head, config.model.attn_merge)
-        self.pretrain_assay_mlp_share = config.train.pretrain_assay_mlp_share
-        self.pretrain_use_assay_description = config.train.pretrain_use_assay_description
-        if self.pretrain_use_assay_description:
-            print(f'use assay descrption type: {config.data.assay_des_type}')
-            if self.pretrain_assay_mlp_share:
-                self.assay_info_aggre_mlp = layers.FC(config.data.assay_des_dim, config.model.assay_des_fc_hidden_dim,
-                                                      config.model.dropout, config.model.inter_out_dim * 2)
-            else:
-                self.assay_info_aggre_mlp_pointwise = layers.FC(config.data.assay_des_dim, config.model.assay_des_fc_hidden_dim,
-                                                                config.model.dropout, config.model.inter_out_dim * 2)
-                self.assay_info_aggre_mlp_pairwise = layers.FC(config.data.assay_des_dim, config.model.assay_des_fc_hidden_dim,
-                                                               config.model.dropout, config.model.inter_out_dim * 2)
-        if config.model.readout.startswith('multi_head') and config.model.attn_merge=='concat':
-            self.FC = layers.FC(config.model.inter_out_dim * (config.model.num_head + 1), config.model.fintune_fc_hidden_dim, config.model.dropout, config.model.out_dim)
-        else:
-            self.FC = layers.FC(config.model.inter_out_dim * 2, config.model.fintune_fc_hidden_dim, config.model.dropout, config.model.out_dim)
-
-        self.regression_loss_fn = nn.MSELoss(reduce=False)
-        self.ranking_loss_fn = losses.pairwise_BCE_loss(config)
-        self.pairwise_two_tower_regression_loss = config.train.pairwise_two_tower_regression_loss
-        if self.pairwise_two_tower_regression_loss:
-            print('use two tower regression loss')
-
-    def forward(self, bg_inter, bond_feats_inter, ass_des, labels, select_flag):
-        graph_embedding = self.readout(bg_inter, bond_feats_inter)
-
-        if self.pretrain_use_assay_description:
-            if self.pretrain_assay_mlp_share:
-                ranking_assay_embedding = self.assay_info_aggre_mlp(ass_des)
-                affinity_pred = self.FC(graph_embedding + ranking_assay_embedding)
-            else:
-                regression_assay_embedding = self.assay_info_aggre_mlp_pointwise(ass_des)
-                affinity_pred = self.FC(graph_embedding + regression_assay_embedding)
-                ranking_assay_embedding = self.assay_info_aggre_mlp_pairwise(ass_des)
-        else:
-            affinity_pred = self.FC(graph_embedding)
-            ranking_assay_embedding = torch.zeros(len(affinity_pred))
-
-        y_pred_num = len(affinity_pred)
-        assert y_pred_num % 2 == 0
-        if self.pairwise_two_tower_regression_loss:
-            regression_loss = self.regression_loss_fn(affinity_pred, labels)  #
-            labels_select = labels[select_flag]
-            affinity_pred_select = affinity_pred[select_flag]
-            regression_loss_select = regression_loss[select_flag].sum()
-        else:
-            regression_loss = self.regression_loss_fn(affinity_pred[:y_pred_num // 2], labels[:y_pred_num // 2])  #
-            labels_select = labels[:y_pred_num // 2][select_flag[:y_pred_num // 2]]
-            affinity_pred_select = affinity_pred[:y_pred_num // 2][select_flag[:y_pred_num // 2]]
-            regression_loss_select = regression_loss[select_flag[:y_pred_num // 2]].sum()
-
-        ranking_loss, relation, relation_pred = self.ranking_loss_fn(graph_embedding, labels, ranking_assay_embedding)  #
-        ranking_loss_select = ranking_loss[select_flag[:y_pred_num // 2]].sum()
-        relation_select = relation[select_flag[:y_pred_num // 2]]
-        relation_pred_selcet = relation_pred[select_flag[:y_pred_num // 2]]
-
-        return regression_loss_select, ranking_loss_select,\
-               labels_select, affinity_pred_select,\
-               relation_select, relation_pred_selcet
-
-    def forward_pointwise(self, bg_inter, bond_feats_inter, ass_des, labels, select_flag):
-        graph_embedding = self.readout(bg_inter, bond_feats_inter)
-        affinity_pred = self.FC(graph_embedding)
-
-        regression_loss = self.regression_loss_fn(affinity_pred, labels)  #
-        regression_loss_select = regression_loss[select_flag].sum()
-
-        labels_select = labels[select_flag]
-
-        affinity_pred_select = affinity_pred[select_flag]
-
-        return regression_loss_select, labels_select, affinity_pred_select
-
-    def evaluate_mtl(self, bg_inter, bond_feats_inter, ass_des, labels):
-        graph_embedding = self.readout(bg_inter, bond_feats_inter)
-
-        if self.pretrain_use_assay_description:
-            if self.pretrain_assay_mlp_share:
-                ranking_assay_embedding = self.assay_info_aggre_mlp(ass_des)
-                affinity_pred = self.FC(graph_embedding + ranking_assay_embedding)
-            else:
-                regression_assay_embedding = self.assay_info_aggre_mlp_pointwise(ass_des)
-                affinity_pred = self.FC(graph_embedding + regression_assay_embedding)
-                ranking_assay_embedding = self.assay_info_aggre_mlp_pairwise(ass_des)
-        else:
-            affinity_pred = self.FC(graph_embedding)
-            ranking_assay_embedding = torch.zeros(len(affinity_pred))
-
-        n = graph_embedding.shape[0]
-        pair_a_index, pair_b_index = [], []
-        for i in range(n):
-            pair_a_index.extend([i] * (n - 1))
-            pair_b_index.extend([j for j in range(n) if i != j])
-
-        pair_index = pair_a_index + pair_b_index
-
-        _, relation, relation_pred = self.ranking_fn(graph_embedding[pair_index], labels[pair_index], ranking_assay_embedding[pair_index])
-
-        return affinity_pred, relation, relation_pred
-
-
-class Affinity_GNNs_MTL(nn.Module):
-    def __init__(self, config):
-        super(Affinity_GNNs_MTL, self).__init__()
-
-        lig_node_dim = config.model.lig_node_dim
-        lig_edge_dim = config.model.lig_edge_dim
-        pro_node_dim = config.model.pro_node_dim
-        pro_edge_dim = config.model.pro_edge_dim
-        layer_num = config.model.num_layers
-        hidden_dim = config.model.hidden_dim
-        jk = config.model.jk
-        GNN = config.model.GNN_type
-        self.multi_task = config.train.multi_task
-
-        self.pretrain_assay_mlp_share = config.train.pretrain_assay_mlp_share
-        self.pretrain_use_assay_description = config.train.pretrain_use_assay_description
-
-        self.lig_encoder = GNNs(lig_node_dim, lig_edge_dim, layer_num, hidden_dim, jk, GNN)
-        self.pro_encoder = GNNs(pro_node_dim, pro_edge_dim, layer_num, hidden_dim, jk, GNN)
-
-        if config.model.jk == 'concat':
-            self.noncov_graph = layers.DTIConvGraph3Layer(hidden_dim * (layer_num + layer_num) + config.model.inter_edge_dim, config.model.inter_out_dim, config.model.dropout)
-        else:
-            self.noncov_graph = layers.DTIConvGraph3Layer(hidden_dim * 2 + config.model.inter_edge_dim, config.model.inter_out_dim, config.model.dropout)
-        self.softmax = nn.Softmax(dim=1)
-
-        if self.multi_task == 'IC50KdKi':
-            self.IC50_ASRP_head = ASRP_head(config)
-            self.Kd_ASRP_head = ASRP_head(config)
-            self.Ki_ASRP_head = ASRP_head(config)
-        elif self.multi_task == 'IC50K':
-            self.IC50_ASRP_head = ASRP_head(config)
-            self.K_ASRP_head = ASRP_head(config)
-
-        self.config = config
-
-    def forward(self, batch, ASRP=True, Perturb=None, Perturb_v=None):
-        if self.multi_task == 'IC50KdKi':
-            bg_lig, bg_prot, bg_inter, labels, _, ass_des, IC50_f, Kd_f, Ki_f = batch
-            lig_node_feats_init = bg_lig.ndata['h']
-            pro_node_feats_init = bg_prot.ndata['h']
-            if Perturb is not None and Perturb_v == 'v_intra':
-                node_feats_lig = self.lig_encoder(bg_lig, Perturb_v[:bg_lig.number_of_nodes()])
-                node_feats_prot = self.pro_encoder(bg_prot, Perturb_v[bg_lig.number_of_nodes():])
-            else:
-                node_feats_lig = self.lig_encoder(bg_lig)
-                node_feats_prot = self.pro_encoder(bg_prot)
-
-            if self.config.train.encoder_ablation == 'interact':
-                return node_feats_lig, node_feats_prot
-            elif self.config.train.encoder_ablation == 'ligand':
-                node_feats_lig = node_feats_lig.zero_()
-                node_feats_lig[:,:self.config.model.lig_node_dim] = lig_node_feats_init
-            elif self.config.train.encoder_ablation == 'protein':
-                node_feats_prot = node_feats_prot.zero_()
-                node_feats_prot[:,:self.config.model.pro_node_dim] = pro_node_feats_init
-
-            bg_inter.ndata['h'] = self.alignfeature(bg_lig,bg_prot,node_feats_lig,node_feats_prot)
-            if Perturb is not None and Perturb_v == 'v_inter':
-                bg_inter.ndata['h'] = bg_inter.ndata['h'] + Perturb
-            bond_feats_inter = self.noncov_graph(bg_inter)
-            if ASRP:
-                return self.multi_head_pred(bg_inter, bond_feats_inter, labels, ass_des, IC50_f, Kd_f, Ki_f)
-            else:
-                return self.multi_head_pointwise(bg_inter, bond_feats_inter, labels, ass_des, IC50_f, Kd_f, Ki_f)
-
-        elif self.multi_task == 'IC50K':
-            bg_lig, bg_prot, bg_inter, labels, _, ass_des, IC50_f, K_f = batch
-            lig_node_feats_init = bg_lig.ndata['h']
-            pro_node_feats_init = bg_prot.ndata['h']
-
-            if Perturb is not None and Perturb_v == 'v_intra':
-                node_feats_lig = self.lig_encoder(bg_lig, Perturb_v[:bg_lig.number_of_nodes()])
-                node_feats_prot = self.pro_encoder(bg_prot, Perturb_v[bg_lig.number_of_nodes():])
-            else:
-                node_feats_lig = self.lig_encoder(bg_lig)
-                node_feats_prot = self.pro_encoder(bg_prot)
-
-            if self.config.train.encoder_ablation == 'interact':
-                return node_feats_lig, node_feats_prot
-            elif self.config.train.encoder_ablation == 'ligand':
-                node_feats_lig = node_feats_lig.zero_()
-                node_feats_lig[:,:self.config.model.lig_node_dim] = lig_node_feats_init
-            elif self.config.train.encoder_ablation == 'protein':
-                node_feats_prot = node_feats_prot.zero_()
-                node_feats_prot[:,:self.config.model.pro_node_dim] = pro_node_feats_init
-
-            bg_inter.ndata['h'] = self.alignfeature(bg_lig,bg_prot,node_feats_lig,node_feats_prot)
-            if Perturb is not None and Perturb_v == 'v_inter':
-                bg_inter.ndata['h'] = bg_inter.ndata['h'] + Perturb
-            bond_feats_inter = self.noncov_graph(bg_inter)
-            if ASRP:
-                return self.multi_head_pred_v2(bg_inter, bond_feats_inter, labels, ass_des, IC50_f, K_f)
-            else:
-                return self.multi_head_pointwise_v2(bg_inter, bond_feats_inter, labels, ass_des, IC50_f, K_f)
-
-    def multi_head_pointwise(self, bg_inter, bond_feats_inter, labels, ass_des, IC50_f, Kd_f, Ki_f):
-        regression_loss_IC50, affinity_IC50, affinity_pred_IC50 = \
-            self.IC50_ASRP_head.forward_pointwise(bg_inter, bond_feats_inter, ass_des, labels, IC50_f)
-
-        regression_loss_Kd, affinity_Kd, affinity_pred_Kd = \
-            self.Kd_ASRP_head.forward_pointwise(bg_inter, bond_feats_inter, ass_des, labels, Kd_f)
-
-        regression_loss_Ki, affinity_Ki, affinity_pred_Ki = \
-            self.Ki_ASRP_head.forward_pointwise(bg_inter, bond_feats_inter, ass_des, labels, Ki_f)
-
-        return (regression_loss_IC50, regression_loss_Kd, regression_loss_Ki),\
-               (affinity_pred_IC50, affinity_pred_Kd, affinity_pred_Ki), \
-               (affinity_IC50, affinity_Kd, affinity_Ki)
-
-    def multi_head_pointwise_v2(self, bg_inter, bond_feats_inter, labels, ass_des, IC50_f, K_f):
-        regression_loss_IC50, affinity_IC50, affinity_pred_IC50 = \
-            self.IC50_ASRP_head.forward_pointwise(bg_inter, bond_feats_inter, ass_des, labels, IC50_f)
-
-        regression_loss_K, affinity_K, affinity_pred_K = \
-            self.K_ASRP_head.forward_pointwise(bg_inter, bond_feats_inter, ass_des, labels, K_f)
-
-        return (regression_loss_IC50, regression_loss_K),\
-               (affinity_pred_IC50, affinity_pred_K), \
-               (affinity_IC50, affinity_K)
-
-
-    def multi_head_pred(self, bg_inter, bond_feats_inter, labels, ass_des, IC50_f, Kd_f, Ki_f):
-        regression_loss_IC50, ranking_loss_IC50, \
-        affinity_IC50, affinity_pred_IC50, \
-        relation_IC50, relation_pred_IC50 = self.IC50_ASRP_head(bg_inter, bond_feats_inter, ass_des, labels, IC50_f)
-
-        regression_loss_Kd, ranking_loss_Kd, \
-        affinity_Kd, affinity_pred_Kd, \
-        relation_Kd, relation_pred_Kd = self.Kd_ASRP_head(bg_inter, bond_feats_inter, ass_des, labels, Kd_f)
-
-        regression_loss_Ki, ranking_loss_Ki, \
-        affinity_Ki, affinity_pred_Ki, \
-        relation_Ki, relation_pred_Ki = self.Ki_ASRP_head(bg_inter, bond_feats_inter, ass_des, labels, Ki_f)
-
-
-        return (regression_loss_IC50, regression_loss_Kd, regression_loss_Ki),\
-               (ranking_loss_IC50, ranking_loss_Kd, ranking_loss_Ki), \
-               (affinity_pred_IC50, affinity_pred_Kd, affinity_pred_Ki), \
-               (relation_pred_IC50, relation_pred_Kd, relation_pred_Ki), \
-               (affinity_IC50, affinity_Kd, affinity_Ki), \
-               (relation_IC50, relation_Kd, relation_Kd)
-
-    def multi_head_pred_v2(self, bg_inter, bond_feats_inter, labels, ass_des, IC50_f, K_f):
-        regression_loss_IC50, ranking_loss_IC50, \
-        affinity_IC50, affinity_pred_IC50, \
-        relation_IC50, relation_pred_IC50 = self.IC50_ASRP_head(bg_inter, bond_feats_inter, ass_des, labels, IC50_f)
-
-        regression_loss_K, ranking_loss_K, \
-        affinity_K, affinity_pred_K, \
-        relation_K, relation_pred_K = self.K_ASRP_head(bg_inter, bond_feats_inter, ass_des, labels, K_f)
-
-        return (regression_loss_IC50, regression_loss_K),\
-               (ranking_loss_IC50, ranking_loss_K), \
-               (affinity_pred_IC50, affinity_pred_K), \
-               (relation_pred_IC50, relation_pred_K), \
-               (affinity_IC50, affinity_K), \
-               (relation_IC50, relation_K)
-
-    def multi_head_evaluate(self, bg_inter, bond_feats_inter, labels, ass_des, IC50_f, Kd_f, Ki_f):
-        if sum(IC50_f):
-            assert sum(Kd_f) == 0 and sum(Ki_f) == 0
-            return self.IC50_ASRP_head.evaluate_mtl(bg_inter, bond_feats_inter, labels, ass_des)
-        elif sum(Kd_f):
-            assert sum(IC50_f) == 0 and sum(Ki_f) == 0
-            return self.Kd_ASRP_head.evaluate_mtl(bg_inter, bond_feats_inter, labels, ass_des)
-        elif sum(Ki_f):
-            assert sum(IC50_f) == 0 and sum(Kd_f) == 0
-            return self.Kd_ASRP_head.evaluate_mtl(bg_inter, bond_feats_inter, labels, ass_des)
-
-    def alignfeature(self,bg_lig,bg_prot,node_feats_lig,node_feats_prot):
-        inter_feature = torch.cat((node_feats_lig,node_feats_prot))
-        lig_num,prot_num = bg_lig.batch_num_nodes(),bg_prot.batch_num_nodes()
-        lig_start, prot_start = lig_num.cumsum(0) - lig_num, prot_num.cumsum(0) - prot_num
-        inter_start = lig_start + prot_start
-        for i in range(lig_num.shape[0]):
-            inter_feature[inter_start[i]:inter_start[i]+lig_num[i]] = node_feats_lig[lig_start[i]:lig_start[i]+lig_num[i]]
-            inter_feature[inter_start[i]+lig_num[i]:inter_start[i]+lig_num[i]+prot_num[i]] = node_feats_prot[prot_start[i]:prot_start[i]+prot_num[i]]
-        return inter_feature
-
-class interact_ablation(nn.Module):
-    def __init__(self, config):
-        super(interact_ablation, self).__init__()
-
-        self.IC50_ASRP_head = interact_ablation_head(config)
-        self.K_ASRP_head = interact_ablation_head(config)
-        self.config = config
-
-    def forward(self, graph_embedding, labels, IC50_f, K_f):
-
-        regression_loss_IC50, \
-        affinity_IC50, affinity_pred_IC50,= self.IC50_ASRP_head(graph_embedding, labels, IC50_f)
-
-        regression_loss_K, \
-        affinity_K, affinity_pred_K = self.K_ASRP_head(graph_embedding, labels, K_f)
-
-        return (regression_loss_IC50, regression_loss_K),\
-               (affinity_pred_IC50, affinity_pred_K), \
-               (affinity_IC50, affinity_K), \
-
-
-class interact_ablation_head(nn.Module):
-    def __init__(self, config):
-        super(interact_ablation_head, self).__init__()
-
-        self.FC = layers.FC(config.model.inter_out_dim * 2, config.model.fintune_fc_hidden_dim, config.model.dropout,
-                            config.model.out_dim)
-
-        self.regression_loss_fn = nn.MSELoss(reduce=False)
-
-    def forward(self, graph_embedding, labels, select_flag):
-        affinity_pred = self.FC(graph_embedding)
-
-        regression_loss = self.regression_loss_fn(affinity_pred, labels)  #
-        regression_loss_select = regression_loss[select_flag].sum()
-
-        labels_select = labels[select_flag]
-
-        affinity_pred_select = affinity_pred[select_flag]
-
-        return regression_loss_select, labels_select, affinity_pred_select
\ No newline at end of file
diff --git a/spaces/jjeamin/ArcaneStyleTransfer/README.md b/spaces/jjeamin/ArcaneStyleTransfer/README.md
deleted file mode 100644
index 9ebdc7f6006d5d46b7d1b03844e332b9b3446287..0000000000000000000000000000000000000000
--- a/spaces/jjeamin/ArcaneStyleTransfer/README.md
+++ /dev/null
@@ -1,13 +0,0 @@
----
-title: ArcaneStyleTransfer
-emoji: 📈
-colorFrom: red
-colorTo: red
-sdk: gradio
-sdk_version: 3.0.5
-app_file: app.py
-pinned: false
-license: apache-2.0
----
-
-Check out the configuration reference at https://huggingface.co/docs/hub/spaces#reference
diff --git a/spaces/joaopereirajp/livvieChatBot/venv/lib/python3.9/site-packages/Crypto/SelfTest/st_common.py b/spaces/joaopereirajp/livvieChatBot/venv/lib/python3.9/site-packages/Crypto/SelfTest/st_common.py
deleted file mode 100644
index e098d8129af179e404e6ee777d9cf792bb5e4c86..0000000000000000000000000000000000000000
--- a/spaces/joaopereirajp/livvieChatBot/venv/lib/python3.9/site-packages/Crypto/SelfTest/st_common.py
+++ /dev/null
@@ -1,55 +0,0 @@
-# -*- coding: utf-8 -*-
-#
-#  SelfTest/st_common.py: Common functions for SelfTest modules
-#
-# Written in 2008 by Dwayne C. Litzenberger <dlitz@dlitz.net>
-#
-# ===================================================================
-# The contents of this file are dedicated to the public domain.  To
-# the extent that dedication to the public domain is not available,
-# everyone is granted a worldwide, perpetual, royalty-free,
-# non-exclusive license to exercise all rights associated with the
-# contents of this file for any purpose whatsoever.
-# No rights are reserved.
-#
-# THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
-# EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
-# MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
-# NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
-# BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
-# ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
-# CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
-# SOFTWARE.
-# ===================================================================
-
-"""Common functions for SelfTest modules"""
-
-import unittest
-import binascii
-from Crypto.Util.py3compat import b
-
-
-def list_test_cases(class_):
-    """Return a list of TestCase instances given a TestCase class
-
-    This is useful when you have defined test* methods on your TestCase class.
-    """
-    return unittest.TestLoader().loadTestsFromTestCase(class_)
-
-def strip_whitespace(s):
-    """Remove whitespace from a text or byte string"""
-    if isinstance(s,str):
-        return b("".join(s.split()))
-    else:
-        return b("").join(s.split())
-
-def a2b_hex(s):
-    """Convert hexadecimal to binary, ignoring whitespace"""
-    return binascii.a2b_hex(strip_whitespace(s))
-
-def b2a_hex(s):
-    """Convert binary to hexadecimal"""
-    # For completeness
-    return binascii.b2a_hex(s)
-
-# vim:set ts=4 sw=4 sts=4 expandtab:
diff --git a/spaces/joaopereirajp/livvieChatBot/venv/lib/python3.9/site-packages/attr/_cmp.py b/spaces/joaopereirajp/livvieChatBot/venv/lib/python3.9/site-packages/attr/_cmp.py
deleted file mode 100644
index d9cbe22cde35ff08abb0f1261f2173091490e02f..0000000000000000000000000000000000000000
--- a/spaces/joaopereirajp/livvieChatBot/venv/lib/python3.9/site-packages/attr/_cmp.py
+++ /dev/null
@@ -1,155 +0,0 @@
-# SPDX-License-Identifier: MIT
-
-
-import functools
-import types
-
-from ._make import _make_ne
-
-
-_operation_names = {"eq": "==", "lt": "<", "le": "<=", "gt": ">", "ge": ">="}
-
-
-def cmp_using(
-    eq=None,
-    lt=None,
-    le=None,
-    gt=None,
-    ge=None,
-    require_same_type=True,
-    class_name="Comparable",
-):
-    """
-    Create a class that can be passed into `attrs.field`'s ``eq``, ``order``,
-    and ``cmp`` arguments to customize field comparison.
-
-    The resulting class will have a full set of ordering methods if at least
-    one of ``{lt, le, gt, ge}`` and ``eq``  are provided.
-
-    :param Optional[callable] eq: `callable` used to evaluate equality of two
-        objects.
-    :param Optional[callable] lt: `callable` used to evaluate whether one
-        object is less than another object.
-    :param Optional[callable] le: `callable` used to evaluate whether one
-        object is less than or equal to another object.
-    :param Optional[callable] gt: `callable` used to evaluate whether one
-        object is greater than another object.
-    :param Optional[callable] ge: `callable` used to evaluate whether one
-        object is greater than or equal to another object.
-
-    :param bool require_same_type: When `True`, equality and ordering methods
-        will return `NotImplemented` if objects are not of the same type.
-
-    :param Optional[str] class_name: Name of class. Defaults to 'Comparable'.
-
-    See `comparison` for more details.
-
-    .. versionadded:: 21.1.0
-    """
-
-    body = {
-        "__slots__": ["value"],
-        "__init__": _make_init(),
-        "_requirements": [],
-        "_is_comparable_to": _is_comparable_to,
-    }
-
-    # Add operations.
-    num_order_functions = 0
-    has_eq_function = False
-
-    if eq is not None:
-        has_eq_function = True
-        body["__eq__"] = _make_operator("eq", eq)
-        body["__ne__"] = _make_ne()
-
-    if lt is not None:
-        num_order_functions += 1
-        body["__lt__"] = _make_operator("lt", lt)
-
-    if le is not None:
-        num_order_functions += 1
-        body["__le__"] = _make_operator("le", le)
-
-    if gt is not None:
-        num_order_functions += 1
-        body["__gt__"] = _make_operator("gt", gt)
-
-    if ge is not None:
-        num_order_functions += 1
-        body["__ge__"] = _make_operator("ge", ge)
-
-    type_ = types.new_class(
-        class_name, (object,), {}, lambda ns: ns.update(body)
-    )
-
-    # Add same type requirement.
-    if require_same_type:
-        type_._requirements.append(_check_same_type)
-
-    # Add total ordering if at least one operation was defined.
-    if 0 < num_order_functions < 4:
-        if not has_eq_function:
-            # functools.total_ordering requires __eq__ to be defined,
-            # so raise early error here to keep a nice stack.
-            raise ValueError(
-                "eq must be define is order to complete ordering from "
-                "lt, le, gt, ge."
-            )
-        type_ = functools.total_ordering(type_)
-
-    return type_
-
-
-def _make_init():
-    """
-    Create __init__ method.
-    """
-
-    def __init__(self, value):
-        """
-        Initialize object with *value*.
-        """
-        self.value = value
-
-    return __init__
-
-
-def _make_operator(name, func):
-    """
-    Create operator method.
-    """
-
-    def method(self, other):
-        if not self._is_comparable_to(other):
-            return NotImplemented
-
-        result = func(self.value, other.value)
-        if result is NotImplemented:
-            return NotImplemented
-
-        return result
-
-    method.__name__ = f"__{name}__"
-    method.__doc__ = (
-        f"Return a {_operation_names[name]} b.  Computed by attrs."
-    )
-
-    return method
-
-
-def _is_comparable_to(self, other):
-    """
-    Check whether `other` is comparable to `self`.
-    """
-    for func in self._requirements:
-        if not func(self, other):
-            return False
-    return True
-
-
-def _check_same_type(self, other):
-    """
-    Return True if *self* and *other* are of the same type, False otherwise.
-    """
-    return other.value.__class__ is self.value.__class__
diff --git a/spaces/joaopereirajp/livvieChatBot/venv/lib/python3.9/site-packages/dataclasses_json/_version.py b/spaces/joaopereirajp/livvieChatBot/venv/lib/python3.9/site-packages/dataclasses_json/_version.py
deleted file mode 100644
index 3c6f84bec1e6097c4561865cab733bc661ea313b..0000000000000000000000000000000000000000
--- a/spaces/joaopereirajp/livvieChatBot/venv/lib/python3.9/site-packages/dataclasses_json/_version.py
+++ /dev/null
@@ -1 +0,0 @@
-__version__ = '0.5.14'
diff --git a/spaces/joaopereirajp/livvieChatBot/venv/lib/python3.9/site-packages/fontTools/varLib/interpolate_layout.py b/spaces/joaopereirajp/livvieChatBot/venv/lib/python3.9/site-packages/fontTools/varLib/interpolate_layout.py
deleted file mode 100644
index aa3f49c6ed08c120f57ef96cac0a04db0dadf264..0000000000000000000000000000000000000000
--- a/spaces/joaopereirajp/livvieChatBot/venv/lib/python3.9/site-packages/fontTools/varLib/interpolate_layout.py
+++ /dev/null
@@ -1,123 +0,0 @@
-"""
-Interpolate OpenType Layout tables (GDEF / GPOS / GSUB).
-"""
-from fontTools.ttLib import TTFont
-from fontTools.varLib import models, VarLibError, load_designspace, load_masters
-from fontTools.varLib.merger import InstancerMerger
-import os.path
-import logging
-from copy import deepcopy
-from pprint import pformat
-
-log = logging.getLogger("fontTools.varLib.interpolate_layout")
-
-
-def interpolate_layout(designspace, loc, master_finder=lambda s: s, mapped=False):
-    """
-    Interpolate GPOS from a designspace file and location.
-
-    If master_finder is set, it should be a callable that takes master
-    filename as found in designspace file and map it to master font
-    binary as to be opened (eg. .ttf or .otf).
-
-    If mapped is False (default), then location is mapped using the
-    map element of the axes in designspace file.  If mapped is True,
-    it is assumed that location is in designspace's internal space and
-    no mapping is performed.
-    """
-    if hasattr(designspace, "sources"):  # Assume a DesignspaceDocument
-        pass
-    else:  # Assume a file path
-        from fontTools.designspaceLib import DesignSpaceDocument
-
-        designspace = DesignSpaceDocument.fromfile(designspace)
-
-    ds = load_designspace(designspace)
-    log.info("Building interpolated font")
-
-    log.info("Loading master fonts")
-    master_fonts = load_masters(designspace, master_finder)
-    font = deepcopy(master_fonts[ds.base_idx])
-
-    log.info("Location: %s", pformat(loc))
-    if not mapped:
-        loc = {name: ds.axes[name].map_forward(v) for name, v in loc.items()}
-    log.info("Internal location: %s", pformat(loc))
-    loc = models.normalizeLocation(loc, ds.internal_axis_supports)
-    log.info("Normalized location: %s", pformat(loc))
-
-    # Assume single-model for now.
-    model = models.VariationModel(ds.normalized_master_locs)
-    assert 0 == model.mapping[ds.base_idx]
-
-    merger = InstancerMerger(font, model, loc)
-
-    log.info("Building interpolated tables")
-    # TODO GSUB/GDEF
-    merger.mergeTables(font, master_fonts, ["GPOS"])
-    return font
-
-
-def main(args=None):
-    """Interpolate GDEF/GPOS/GSUB tables for a point on a designspace"""
-    from fontTools import configLogger
-    import argparse
-    import sys
-
-    parser = argparse.ArgumentParser(
-        "fonttools varLib.interpolate_layout",
-        description=main.__doc__,
-    )
-    parser.add_argument(
-        "designspace_filename", metavar="DESIGNSPACE", help="Input TTF files"
-    )
-    parser.add_argument(
-        "locations",
-        metavar="LOCATION",
-        type=str,
-        nargs="+",
-        help="Axis locations (e.g. wdth=120",
-    )
-    parser.add_argument(
-        "-o",
-        "--output",
-        metavar="OUTPUT",
-        help="Output font file (defaults to <designspacename>-instance.ttf)",
-    )
-    parser.add_argument(
-        "-l",
-        "--loglevel",
-        metavar="LEVEL",
-        default="INFO",
-        help="Logging level (defaults to INFO)",
-    )
-
-    args = parser.parse_args(args)
-
-    if not args.output:
-        args.output = os.path.splitext(args.designspace_filename)[0] + "-instance.ttf"
-
-    configLogger(level=args.loglevel)
-
-    finder = lambda s: s.replace("master_ufo", "master_ttf_interpolatable").replace(
-        ".ufo", ".ttf"
-    )
-
-    loc = {}
-    for arg in args.locations:
-        tag, val = arg.split("=")
-        loc[tag] = float(val)
-
-    font = interpolate_layout(args.designspace_filename, loc, finder)
-    log.info("Saving font %s", args.output)
-    font.save(args.output)
-
-
-if __name__ == "__main__":
-    import sys
-
-    if len(sys.argv) > 1:
-        sys.exit(main())
-    import doctest
-
-    sys.exit(doctest.testmod().failed)
diff --git a/spaces/joaopereirajp/livvieChatBot/venv/lib/python3.9/site-packages/fsspec/implementations/reference.py b/spaces/joaopereirajp/livvieChatBot/venv/lib/python3.9/site-packages/fsspec/implementations/reference.py
deleted file mode 100644
index 398ec69ab6c75a3296b32c8bd7c300f62c198d05..0000000000000000000000000000000000000000
--- a/spaces/joaopereirajp/livvieChatBot/venv/lib/python3.9/site-packages/fsspec/implementations/reference.py
+++ /dev/null
@@ -1,1080 +0,0 @@
-import base64
-import collections
-import io
-import itertools
-import logging
-import math
-import os
-from functools import lru_cache
-from typing import TYPE_CHECKING
-
-import fsspec.core
-
-try:
-    import ujson as json
-except ImportError:
-    if not TYPE_CHECKING:
-        import json
-
-from ..asyn import AsyncFileSystem
-from ..callbacks import _DEFAULT_CALLBACK
-from ..core import filesystem, open, split_protocol
-from ..utils import isfilelike, merge_offset_ranges, other_paths
-
-logger = logging.getLogger("fsspec.reference")
-
-
-class ReferenceNotReachable(RuntimeError):
-    def __init__(self, reference, target, *args):
-        super().__init__(*args)
-        self.reference = reference
-        self.target = target
-
-    def __str__(self):
-        return f'Reference "{self.reference}" failed to fetch target {self.target}'
-
-
-def _first(d):
-    return list(d.values())[0]
-
-
-def _prot_in_references(path, references):
-    ref = references.get(path)
-    if isinstance(ref, (list, tuple)):
-        return split_protocol(ref[0])[0] if ref[0] else ref[0]
-
-
-def _protocol_groups(paths, references):
-    if isinstance(paths, str):
-        return {_prot_in_references(paths, references): [paths]}
-    out = {}
-    for path in paths:
-        protocol = _prot_in_references(path, references)
-        out.setdefault(protocol, []).append(path)
-    return out
-
-
-class RefsValuesView(collections.abc.ValuesView):
-    def __iter__(self):
-        for val in self._mapping.zmetadata.values():
-            yield json.dumps(val).encode()
-        yield from self._mapping._items.values()
-        for field in self._mapping.listdir():
-            chunk_sizes = self._mapping._get_chunk_sizes(field)
-            if len(chunk_sizes) == 0:
-                yield self._mapping[field + "/0"]
-                continue
-            yield from self._mapping._generate_all_records(field)
-
-
-class RefsItemsView(collections.abc.ItemsView):
-    def __iter__(self):
-        return zip(self._mapping.keys(), self._mapping.values())
-
-
-def ravel_multi_index(idx, sizes):
-    val = 0
-    mult = 1
-    for i, s in zip(idx[::-1], sizes[::-1]):
-        val += i * mult
-        mult *= s
-    return val
-
-
-class LazyReferenceMapper(collections.abc.MutableMapping):
-    """Interface to read parquet store as if it were a standard kerchunk
-    references dict."""
-
-    # import is class level to prevent numpy dep requirement for fsspec
-    @property
-    def np(self):
-        import numpy as np
-
-        return np
-
-    @property
-    def pd(self):
-        import pandas as pd
-
-        return pd
-
-    def __init__(
-        self, root, fs=None, out_root=None, cache_size=128, categorical_threshold=10
-    ):
-        """
-        Parameters
-        ----------
-        root : str
-            Root of parquet store
-        fs : fsspec.AbstractFileSystem
-            fsspec filesystem object, default is local filesystem.
-        cache_size : int
-            Maximum size of LRU cache, where cache_size*record_size denotes
-            the total number of references that can be loaded in memory at once.
-        """
-        self.root = root
-        self.chunk_sizes = {}
-        self._items = {}
-        self.dirs = None
-        self.fs = fsspec.filesystem("file") if fs is None else fs
-        with self.fs.open("/".join([self.root, ".zmetadata"]), "rb") as f:
-            self._items[".zmetadata"] = f.read()
-        met = json.loads(self._items[".zmetadata"])
-        self.record_size = met["record_size"]
-        self.zmetadata = met["metadata"]
-        self.url = self.root + "/{field}/refs.{record}.parq"
-        self.out_root = out_root or self.root
-        self.cat_thresh = categorical_threshold
-
-        # Define function to open and decompress refs
-        @lru_cache(maxsize=cache_size)
-        def open_refs(field, record):
-            """cached parquet file loader"""
-            path = self.url.format(field=field, record=record)
-            with self.fs.open(path) as f:
-                # TODO: since all we do is iterate, is arrow without pandas
-                #  better here?
-                df = self.pd.read_parquet(f, engine="fastparquet")
-            refs = {c: df[c].values for c in df.columns}
-            return refs
-
-        self.open_refs = open_refs
-
-    @staticmethod
-    def create(record_size, root, fs, **kwargs):
-        met = {"metadata": {}, "record_size": record_size}
-        fs.pipe("/".join([root, ".zmetadata"]), json.dumps(met).encode())
-        return LazyReferenceMapper(root, fs, **kwargs)
-
-    def listdir(self, basename=True):
-        """List top-level directories"""
-        if self.dirs is None:
-            dirs = [p.split("/", 1)[0] for p in self.zmetadata]
-            self.dirs = {p for p in dirs if p and not p.startswith(".")}
-        listing = self.dirs
-        if basename:
-            listing = [os.path.basename(path) for path in listing]
-        return listing
-
-    def ls(self, path="", detail=True):
-        """Shortcut file listings"""
-        if not path:
-            dirnames = self.listdir()
-            others = set(
-                [".zmetadata"]
-                + [name for name in self.zmetadata if "/" not in name]
-                + [name for name in self._items if "/" not in name]
-            )
-            if detail is False:
-                others.update(dirnames)
-                return sorted(others)
-            dirinfo = [
-                {"name": name, "type": "directory", "size": 0} for name in dirnames
-            ]
-            fileinfo = [
-                {
-                    "name": name,
-                    "type": "file",
-                    "size": len(
-                        json.dumps(self.zmetadata[name])
-                        if name in self.zmetadata
-                        else self._items[name]
-                    ),
-                }
-                for name in others
-            ]
-            return sorted(dirinfo + fileinfo, key=lambda s: s["name"])
-        parts = path.split("/", 1)
-        if len(parts) > 1:
-            raise FileNotFoundError("Cannot list within directories right now")
-        field = parts[0]
-        others = set(
-            [name for name in self.zmetadata if name.startswith(f"{path}/")]
-            + [name for name in self._items if name.startswith(f"{path}/")]
-        )
-        fileinfo = [
-            {
-                "name": name,
-                "type": "file",
-                "size": len(
-                    json.dumps(self.zmetadata[name])
-                    if name in self.zmetadata
-                    else self._items[name]
-                ),
-            }
-            for name in others
-        ]
-        keys = self._keys_in_field(field)
-
-        if detail is False:
-            return list(others) + list(keys)
-        recs = self._generate_all_records(field)
-        recinfo = [
-            {"name": name, "type": "file", "size": rec[-1]}
-            for name, rec in zip(keys, recs)
-            if rec[0]  # filters out path==None, deleted/missing
-        ]
-        return fileinfo + recinfo
-
-    def _load_one_key(self, key):
-        """Get the reference for one key
-
-        Returns bytes, one-element list or three-element list.
-        """
-        if key in self._items:
-            return self._items[key]
-        elif key in self.zmetadata:
-            return json.dumps(self.zmetadata[key]).encode()
-        elif "/" not in key or self._is_meta(key):
-            raise KeyError(key)
-        field, sub_key = key.split("/")
-        record, _, _ = self._key_to_record(key)
-        maybe = self._items.get((field, key), {}).get(sub_key, False)
-        if maybe is None:
-            # explicitly deleted
-            raise KeyError
-        elif maybe:
-            return maybe
-
-        # Chunk keys can be loaded from row group and cached in LRU cache
-        try:
-            record, ri, chunk_size = self._key_to_record(key)
-            if chunk_size == 0:
-                return b""
-            refs = self.open_refs(field, record)
-        except (ValueError, TypeError, FileNotFoundError):
-            raise KeyError(key)
-        columns = ["path", "offset", "size", "raw"]
-        selection = [refs[c][ri] if c in refs else None for c in columns]
-        raw = selection[-1]
-        if raw is not None:
-            return raw
-        if selection[0] is None:
-            raise KeyError("This reference has been deleted")
-        if selection[1:3] == [0, 0]:
-            # URL only
-            return selection[:1]
-        # URL, offset, size
-        return selection[:3]
-
-    @lru_cache(4096)
-    def _key_to_record(self, key):
-        """Details needed to construct a reference for one key"""
-        field, chunk = key.split("/")
-        chunk_sizes = self._get_chunk_sizes(field)
-        if len(chunk_sizes) == 0:
-            return 0, 0, 0
-        chunk_idx = [int(c) for c in chunk.split(".")]
-        chunk_number = ravel_multi_index(chunk_idx, chunk_sizes)
-        record = chunk_number // self.record_size
-        ri = chunk_number % self.record_size
-        return record, ri, len(chunk_sizes)
-
-    def _get_chunk_sizes(self, field):
-        """The number of chunks along each axis for a given field"""
-        if field not in self.chunk_sizes:
-            zarray = self.zmetadata[f"{field}/.zarray"]
-            size_ratio = [
-                math.ceil(s / c) for s, c in zip(zarray["shape"], zarray["chunks"])
-            ]
-            self.chunk_sizes[field] = size_ratio
-        return self.chunk_sizes[field]
-
-    def _generate_record(self, field, record):
-        """The references for a given parquet file of a given field"""
-        refs = self.open_refs(field, record)
-        it = iter(zip(refs.values()))
-        if len(refs) == 3:
-            # All urls
-            return (list(t) for t in it)
-        elif len(refs) == 1:
-            # All raws
-            return refs["raw"]
-        else:
-            # Mix of urls and raws
-            return (list(t[:3]) if not t[3] else t[3] for t in it)
-
-    def _generate_all_records(self, field):
-        """Load all the references within a field by iterating over the parquet files"""
-        nrec = 1
-        for ch in self._get_chunk_sizes(field):
-            nrec *= ch
-        nrec = math.ceil(nrec / self.record_size)
-        for record in range(nrec):
-            yield from self._generate_record(field, record)
-
-    def values(self):
-        return RefsValuesView(self)
-
-    def items(self):
-        return RefsItemsView(self)
-
-    def __hash__(self):
-        return id(self)
-
-    @lru_cache(20)
-    def __getitem__(self, key):
-        return self._load_one_key(key)
-
-    def __setitem__(self, key, value):
-        if "/" in key and not self._is_meta(key):
-            field, chunk = key.split("/")
-            record, i, _ = self._key_to_record(key)
-            subdict = self._items.setdefault((field, record), {})
-            subdict[i] = value
-            if len(subdict) == self.record_size:
-                self.write(field, record)
-        else:
-            # metadata or top-level
-            self._items[key] = value
-            self.zmetadata[key] = json.loads(
-                value.decode() if isinstance(value, bytes) else value
-            )
-
-    @staticmethod
-    def _is_meta(key):
-        return key.startswith(".z") or "/.z" in key
-
-    def __delitem__(self, key):
-        if key in self._items:
-            del self._items[key]
-        elif key in self.zmetadata:
-            del self.zmetadata[key]
-        else:
-            if "/" in key and not self._is_meta(key):
-                field, chunk = key.split("/")
-                record, _, _ = self._key_to_record(key)
-                subdict = self._items.setdefault((field, record), {})
-                subdict[chunk] = None
-                if len(subdict) == self.record_size:
-                    self.write(field, record)
-            else:
-                # metadata or top-level
-                self._items[key] = None
-
-    def write(self, field, record, base_url=None, storage_options=None):
-        # extra requirements if writing
-        import kerchunk.df
-        import numpy as np
-        import pandas as pd
-
-        # TODO: if the dict is incomplete, also load records and merge in
-        partition = self._items[(field, record)]
-        fn = f"{base_url or self.out_root}/{field}/refs.{record}.parq"
-
-        ####
-        paths = np.full(self.record_size, np.nan, dtype="O")
-        offsets = np.zeros(self.record_size, dtype="int64")
-        sizes = np.zeros(self.record_size, dtype="int64")
-        raws = np.full(self.record_size, np.nan, dtype="O")
-        nraw = 0
-        npath = 0
-        for j, data in partition.items():
-            if isinstance(data, list):
-                npath += 1
-                paths[j] = data[0]
-                if len(data) > 1:
-                    offsets[j] = data[1]
-                    sizes[j] = data[2]
-            else:
-                nraw += 1
-                raws[j] = kerchunk.df._proc_raw(data)
-        # TODO: only save needed columns
-        df = pd.DataFrame(
-            {
-                "path": paths,
-                "offset": offsets,
-                "size": sizes,
-                "raw": raws,
-            },
-            copy=False,
-        )
-        if df.path.count() / (df.path.nunique() or 1) > self.cat_thresh:
-            df["path"] = df["path"].astype("category")
-        object_encoding = {"raw": "bytes", "path": "utf8"}
-        has_nulls = ["path", "raw"]
-
-        self.fs.mkdirs(f"{base_url or self.out_root}/{field}", exist_ok=True)
-        df.to_parquet(
-            fn,
-            engine="fastparquet",
-            storage_options=storage_options
-            or getattr(self.fs, "storage_options", None),
-            compression="zstd",
-            index=False,
-            stats=False,
-            object_encoding=object_encoding,
-            has_nulls=has_nulls,
-            # **kwargs,
-        )
-        partition.clear()
-        self._items.pop((field, record))
-
-    def flush(self, base_url=None, storage_options=None):
-        """Output any modified or deleted keys
-
-        Parameters
-        ----------
-        base_url: str
-            Location of the output
-        """
-        # write what we have so far and clear sub chunks
-        for thing in list(self._items):
-            if isinstance(thing, tuple):
-                field, record = thing
-                self.write(
-                    field,
-                    record,
-                    base_url=base_url,
-                    storage_options=storage_options,
-                )
-
-        # gather .zmetadata from self._items and write that too
-        for k in list(self._items):
-            if k != ".zmetadata" and ".z" in k:
-                self.zmetadata[k] = json.loads(self._items.pop(k))
-        met = {"metadata": self.zmetadata, "record_size": self.record_size}
-        self._items[".zmetadata"] = json.dumps(met).encode()
-        self.fs.pipe(
-            "/".join([base_url or self.out_root, ".zmetadata"]),
-            self._items[".zmetadata"],
-        )
-
-        # TODO: only clear those that we wrote to?
-        self.open_refs.cache_clear()
-
-    def __len__(self):
-        # Caveat: This counts expected references, not actual
-        count = 0
-        for field in self.listdir():
-            if field.startswith("."):
-                count += 1
-            else:
-                chunk_sizes = self._get_chunk_sizes(field)
-                nchunks = self.np.product(chunk_sizes)
-                count += nchunks
-        count += len(self.zmetadata)  # all metadata keys
-        count += len(self._items)  # the metadata file itself
-        return count
-
-    def __iter__(self):
-        # Caveat: Note that this generates all expected keys, but does not
-        # account for reference keys that are missing.
-        metas = set(self.zmetadata)
-        metas.update(self._items)
-        for bit in metas:
-            if isinstance(bit, str):
-                yield bit
-        for field in self.listdir():
-            yield from self._keys_in_field(field)
-
-    def __contains__(self, item):
-        try:
-            self._load_one_key(item)
-            return True
-        except KeyError:
-            return False
-
-    def _keys_in_field(self, field):
-        """List key names in given field
-
-        Produces strings like "field/x.y" appropriate from the chunking of the array
-        """
-        chunk_sizes = self._get_chunk_sizes(field)
-        if len(chunk_sizes) == 0:
-            yield field + "/0"
-            return
-        inds = itertools.product(*(range(i) for i in chunk_sizes))
-        for ind in inds:
-            yield field + "/" + ".".join([str(c) for c in ind])
-
-
-class ReferenceFileSystem(AsyncFileSystem):
-    """View byte ranges of some other file as a file system
-    Initial version: single file system target, which must support
-    async, and must allow start and end args in _cat_file. Later versions
-    may allow multiple arbitrary URLs for the targets.
-    This FileSystem is read-only. It is designed to be used with async
-    targets (for now). This FileSystem only allows whole-file access, no
-    ``open``. We do not get original file details from the target FS.
-    Configuration is by passing a dict of references at init, or a URL to
-    a JSON file containing the same; this dict
-    can also contain concrete data for some set of paths.
-    Reference dict format:
-    {path0: bytes_data, path1: (target_url, offset, size)}
-    https://github.com/fsspec/kerchunk/blob/main/README.md
-    """
-
-    protocol = "reference"
-
-    def __init__(
-        self,
-        fo,
-        target=None,
-        ref_storage_args=None,
-        target_protocol=None,
-        target_options=None,
-        remote_protocol=None,
-        remote_options=None,
-        fs=None,
-        template_overrides=None,
-        simple_templates=True,
-        max_gap=64_000,
-        max_block=256_000_000,
-        cache_size=128,
-        **kwargs,
-    ):
-        """
-        Parameters
-        ----------
-        fo : dict or str
-            The set of references to use for this instance, with a structure as above.
-            If str referencing a JSON file, will use fsspec.open, in conjunction
-            with target_options and target_protocol to open and parse JSON at this
-            location. If a directory, then assume references are a set of parquet
-            files to be loaded lazily.
-        target : str
-            For any references having target_url as None, this is the default file
-            target to use
-        ref_storage_args : dict
-            If references is a str, use these kwargs for loading the JSON file.
-            Deprecated: use target_options instead.
-        target_protocol : str
-            Used for loading the reference file, if it is a path. If None, protocol
-            will be derived from the given path
-        target_options : dict
-            Extra FS options for loading the reference file ``fo``, if given as a path
-        remote_protocol : str
-            The protocol of the filesystem on which the references will be evaluated
-            (unless fs is provided). If not given, will be derived from the first
-            URL that has a protocol in the templates or in the references, in that
-            order.
-        remote_options : dict
-            kwargs to go with remote_protocol
-        fs : AbstractFileSystem | dict(str, (AbstractFileSystem | dict))
-            Directly provide a file system(s):
-                - a single filesystem instance
-                - a dict of protocol:filesystem, where each value is either a filesystem
-                  instance, or a dict of kwargs that can be used to create in
-                  instance for the given protocol
-
-            If this is given, remote_options and remote_protocol are ignored.
-        template_overrides : dict
-            Swap out any templates in the references file with these - useful for
-            testing.
-        simple_templates: bool
-            Whether templates can be processed with simple replace (True) or if
-            jinja  is needed (False, much slower). All reference sets produced by
-            ``kerchunk`` are simple in this sense, but the spec allows for complex.
-        max_gap, max_block: int
-            For merging multiple concurrent requests to the same remote file.
-            Neighboring byte ranges will only be merged when their
-            inter-range gap is <= ``max_gap``. Default is 64KB. Set to 0
-            to only merge when it requires no extra bytes. Pass a negative
-            number to disable merging, appropriate for local target files.
-            Neighboring byte ranges will only be merged when the size of
-            the aggregated range is <= ``max_block``. Default is 256MB.
-        cache_size : int
-            Maximum size of LRU cache, where cache_size*record_size denotes
-            the total number of references that can be loaded in memory at once.
-            Only used for lazily loaded references.
-        kwargs : passed to parent class
-        """
-        super().__init__(**kwargs)
-        self.target = target
-        self.template_overrides = template_overrides
-        self.simple_templates = simple_templates
-        self.templates = {}
-        self.fss = {}
-        self._dircache = {}
-        self.max_gap = max_gap
-        self.max_block = max_block
-        if isinstance(fo, str):
-            dic = dict(
-                **(ref_storage_args or target_options or {}), protocol=target_protocol
-            )
-            ref_fs, fo2 = fsspec.core.url_to_fs(fo, **dic)
-            if ref_fs.isfile(fo):
-                # text JSON
-                with fsspec.open(fo, "rb", **dic) as f:
-                    logger.info("Read reference from URL %s", fo)
-                    text = json.load(f)
-                self._process_references(text, template_overrides)
-            else:
-                # Lazy parquet refs
-                logger.info("Open lazy reference dict from URL %s", fo)
-                self.references = LazyReferenceMapper(
-                    fo2,
-                    fs=ref_fs,
-                    cache_size=cache_size,
-                )
-        else:
-            # dictionaries
-            self._process_references(fo, template_overrides)
-        if isinstance(fs, dict):
-            self.fss = {
-                k: (
-                    fsspec.filesystem(k.split(":", 1)[0], **opts)
-                    if isinstance(opts, dict)
-                    else opts
-                )
-                for k, opts in fs.items()
-            }
-            if None not in self.fss:
-                self.fss[None] = filesystem("file")
-            return
-        if fs is not None:
-            # single remote FS
-            remote_protocol = (
-                fs.protocol[0] if isinstance(fs.protocol, tuple) else fs.protocol
-            )
-            self.fss[remote_protocol] = fs
-
-        if remote_protocol is None:
-            # get single protocol from any templates
-            for ref in self.templates.values():
-                if callable(ref):
-                    ref = ref()
-                protocol, _ = fsspec.core.split_protocol(ref)
-                if protocol and protocol not in self.fss:
-                    fs = filesystem(protocol, **(remote_options or {}))
-                    self.fss[protocol] = fs
-        if remote_protocol is None:
-            # get single protocol from references
-            for ref in self.references.values():
-                if callable(ref):
-                    ref = ref()
-                if isinstance(ref, list) and ref[0]:
-                    protocol, _ = fsspec.core.split_protocol(ref[0])
-                    if protocol not in self.fss:
-                        fs = filesystem(protocol, **(remote_options or {}))
-                        self.fss[protocol] = fs
-                        # only use first remote URL
-                        break
-
-        if remote_protocol and remote_protocol not in self.fss:
-            fs = filesystem(remote_protocol, **(remote_options or {}))
-            self.fss[remote_protocol] = fs
-
-        self.fss[None] = fs or filesystem("file")  # default one
-
-    def _cat_common(self, path, start=None, end=None):
-        path = self._strip_protocol(path)
-        logger.debug(f"cat: {path}")
-        try:
-            part = self.references[path]
-        except KeyError:
-            raise FileNotFoundError(path)
-        if isinstance(part, str):
-            part = part.encode()
-        if isinstance(part, bytes):
-            logger.debug(f"Reference: {path}, type bytes")
-            if part.startswith(b"base64:"):
-                part = base64.b64decode(part[7:])
-            return part, None, None
-
-        if len(part) == 1:
-            logger.debug(f"Reference: {path}, whole file => {part}")
-            url = part[0]
-            start1, end1 = start, end
-        else:
-            url, start0, size = part
-            logger.debug(f"Reference: {path} => {url}, offset {start0}, size {size}")
-            end0 = start0 + size
-
-            if start is not None:
-                if start >= 0:
-                    start1 = start0 + start
-                else:
-                    start1 = end0 + start
-            else:
-                start1 = start0
-            if end is not None:
-                if end >= 0:
-                    end1 = start0 + end
-                else:
-                    end1 = end0 + end
-            else:
-                end1 = end0
-        if url is None:
-            url = self.target
-        return url, start1, end1
-
-    async def _cat_file(self, path, start=None, end=None, **kwargs):
-        part_or_url, start0, end0 = self._cat_common(path, start=start, end=end)
-        if isinstance(part_or_url, bytes):
-            return part_or_url[start:end]
-        protocol, _ = split_protocol(part_or_url)
-        try:
-            await self.fss[protocol]._cat_file(part_or_url, start=start, end=end)
-        except Exception as e:
-            raise ReferenceNotReachable(path, part_or_url) from e
-
-    def cat_file(self, path, start=None, end=None, **kwargs):
-        part_or_url, start0, end0 = self._cat_common(path, start=start, end=end)
-        if isinstance(part_or_url, bytes):
-            return part_or_url[start:end]
-        protocol, _ = split_protocol(part_or_url)
-        try:
-            return self.fss[protocol].cat_file(part_or_url, start=start0, end=end0)
-        except Exception as e:
-            raise ReferenceNotReachable(path, part_or_url) from e
-
-    def pipe_file(self, path, value, **_):
-        """Temporarily add binary data or reference as a file"""
-        self.references[path] = value
-
-    async def _get_file(self, rpath, lpath, **kwargs):
-        if self.isdir(rpath):
-            return os.makedirs(lpath, exist_ok=True)
-        data = await self._cat_file(rpath)
-        with open(lpath, "wb") as f:
-            f.write(data)
-
-    def get_file(self, rpath, lpath, callback=_DEFAULT_CALLBACK, **kwargs):
-        if self.isdir(rpath):
-            return os.makedirs(lpath, exist_ok=True)
-        data = self.cat_file(rpath, **kwargs)
-        callback.set_size(len(data))
-        if isfilelike(lpath):
-            lpath.write(data)
-        else:
-            with open(lpath, "wb") as f:
-                f.write(data)
-        callback.absolute_update(len(data))
-
-    def get(self, rpath, lpath, recursive=False, **kwargs):
-        if recursive:
-            # trigger directory build
-            self.ls("")
-        rpath = self.expand_path(rpath, recursive=recursive)
-        fs = fsspec.filesystem("file", auto_mkdir=True)
-        targets = other_paths(rpath, lpath)
-        if recursive:
-            data = self.cat([r for r in rpath if not self.isdir(r)])
-        else:
-            data = self.cat(rpath)
-        for remote, local in zip(rpath, targets):
-            if remote in data:
-                fs.pipe_file(local, data[remote])
-
-    def cat(self, path, recursive=False, on_error="raise", **kwargs):
-        if isinstance(path, str) and recursive:
-            raise NotImplementedError
-        if isinstance(path, list) and (recursive or any("*" in p for p in path)):
-            raise NotImplementedError
-        proto_dict = _protocol_groups(path, self.references)
-        out = {}
-        for proto, paths in proto_dict.items():
-            fs = self.fss[proto]
-            urls, starts, ends = [], [], []
-            for p in paths:
-                # find references or label not-found. Early exit if any not
-                # found and on_error is "raise"
-                try:
-                    u, s, e = self._cat_common(p)
-                    urls.append(u)
-                    starts.append(s)
-                    ends.append(e)
-                except FileNotFoundError as err:
-                    if on_error == "raise":
-                        raise
-                    if on_error != "omit":
-                        out[p] = err
-
-            # process references into form for merging
-            urls2 = []
-            starts2 = []
-            ends2 = []
-            paths2 = []
-            whole_files = set()
-            for u, s, e, p in zip(urls, starts, ends, paths):
-                if isinstance(u, bytes):
-                    # data
-                    out[p] = u
-                elif s is None:
-                    # whole file - limits are None, None, but no further
-                    # entries take for this file
-                    whole_files.add(u)
-                    urls2.append(u)
-                    starts2.append(s)
-                    ends2.append(e)
-                    paths2.append(p)
-            for u, s, e, p in zip(urls, starts, ends, paths):
-                # second run to account for files that are to be loaded whole
-                if s is not None and u not in whole_files:
-                    urls2.append(u)
-                    starts2.append(s)
-                    ends2.append(e)
-                    paths2.append(p)
-
-            # merge and fetch consolidated ranges
-            new_paths, new_starts, new_ends = merge_offset_ranges(
-                list(urls2),
-                list(starts2),
-                list(ends2),
-                sort=True,
-                max_gap=self.max_gap,
-                max_block=self.max_block,
-            )
-            bytes_out = fs.cat_ranges(new_paths, new_starts, new_ends)
-
-            # unbundle from merged bytes - simple approach
-            for u, s, e, p in zip(urls, starts, ends, paths):
-                if p in out:
-                    continue  # was bytes, already handled
-                for np, ns, ne, b in zip(new_paths, new_starts, new_ends, bytes_out):
-                    if np == u and (ns is None or ne is None):
-                        if isinstance(b, Exception):
-                            out[p] = b
-                        else:
-                            out[p] = b[s:e]
-                    elif np == u and s >= ns and e <= ne:
-                        if isinstance(b, Exception):
-                            out[p] = b
-                        else:
-                            out[p] = b[s - ns : (e - ne) or None]
-
-        for k, v in out.copy().items():
-            # these were valid references, but fetch failed, so transform exc
-            if isinstance(v, Exception) and k in self.references:
-                ex = out[k]
-                new_ex = ReferenceNotReachable(k, self.references[k])
-                new_ex.__cause__ = ex
-                if on_error == "raise":
-                    raise new_ex
-                elif on_error != "omit":
-                    out[k] = new_ex
-
-        if len(out) == 1 and isinstance(path, str) and "*" not in path:
-            return _first(out)
-        return out
-
-    def _process_references(self, references, template_overrides=None):
-        vers = references.get("version", None)
-        if vers is None:
-            self._process_references0(references)
-        elif vers == 1:
-            self._process_references1(references, template_overrides=template_overrides)
-        else:
-            raise ValueError(f"Unknown reference spec version: {vers}")
-        # TODO: we make dircache by iterating over all entries, but for Spec >= 1,
-        #  can replace with programmatic. Is it even needed for mapper interface?
-
-    def _process_references0(self, references):
-        """Make reference dict for Spec Version 0"""
-        self.references = references
-
-    def _process_references1(self, references, template_overrides=None):
-        if not self.simple_templates or self.templates:
-            import jinja2
-        self.references = {}
-        self._process_templates(references.get("templates", {}))
-
-        @lru_cache(1000)
-        def _render_jinja(u):
-            return jinja2.Template(u).render(**self.templates)
-
-        for k, v in references.get("refs", {}).items():
-            if isinstance(v, str):
-                if v.startswith("base64:"):
-                    self.references[k] = base64.b64decode(v[7:])
-                self.references[k] = v
-            elif self.templates:
-                u = v[0]
-                if "{{" in u:
-                    if self.simple_templates:
-                        u = (
-                            u.replace("{{", "{")
-                            .replace("}}", "}")
-                            .format(**self.templates)
-                        )
-                    else:
-                        u = _render_jinja(u)
-                self.references[k] = [u] if len(v) == 1 else [u, v[1], v[2]]
-            else:
-                self.references[k] = v
-        self.references.update(self._process_gen(references.get("gen", [])))
-
-    def _process_templates(self, tmp):
-        self.templates = {}
-        if self.template_overrides is not None:
-            tmp.update(self.template_overrides)
-        for k, v in tmp.items():
-            if "{{" in v:
-                import jinja2
-
-                self.templates[k] = lambda temp=v, **kwargs: jinja2.Template(
-                    temp
-                ).render(**kwargs)
-            else:
-                self.templates[k] = v
-
-    def _process_gen(self, gens):
-        out = {}
-        for gen in gens:
-            dimension = {
-                k: v
-                if isinstance(v, list)
-                else range(v.get("start", 0), v["stop"], v.get("step", 1))
-                for k, v in gen["dimensions"].items()
-            }
-            products = (
-                dict(zip(dimension.keys(), values))
-                for values in itertools.product(*dimension.values())
-            )
-            for pr in products:
-                import jinja2
-
-                key = jinja2.Template(gen["key"]).render(**pr, **self.templates)
-                url = jinja2.Template(gen["url"]).render(**pr, **self.templates)
-                if ("offset" in gen) and ("length" in gen):
-                    offset = int(
-                        jinja2.Template(gen["offset"]).render(**pr, **self.templates)
-                    )
-                    length = int(
-                        jinja2.Template(gen["length"]).render(**pr, **self.templates)
-                    )
-                    out[key] = [url, offset, length]
-                elif ("offset" in gen) ^ ("length" in gen):
-                    raise ValueError(
-                        "Both 'offset' and 'length' are required for a "
-                        "reference generator entry if either is provided."
-                    )
-                else:
-                    out[key] = [url]
-        return out
-
-    def _dircache_from_items(self):
-        self.dircache = {"": []}
-        it = self.references.items()
-        for path, part in it:
-            if isinstance(part, (bytes, str)):
-                size = len(part)
-            elif len(part) == 1:
-                size = None
-            else:
-                _, start, size = part
-            par = path.rsplit("/", 1)[0] if "/" in path else ""
-            par0 = par
-            while par0 and par0 not in self.dircache:
-                # build parent directories
-                self.dircache[par0] = []
-                self.dircache.setdefault(
-                    par0.rsplit("/", 1)[0] if "/" in par0 else "", []
-                ).append({"name": par0, "type": "directory", "size": 0})
-                par0 = self._parent(par0)
-
-            self.dircache[par].append({"name": path, "type": "file", "size": size})
-
-    def _open(self, path, mode="rb", block_size=None, cache_options=None, **kwargs):
-        data = self.cat_file(path)  # load whole chunk into memory
-        return io.BytesIO(data)
-
-    def ls(self, path, detail=True, **kwargs):
-        path = self._strip_protocol(path)
-        if isinstance(self.references, LazyReferenceMapper):
-            try:
-                return self.references.ls(path, detail)
-            except KeyError:
-                pass
-            raise FileNotFoundError(f"'{path}' is not a known key")
-        if not self.dircache:
-            self._dircache_from_items()
-        out = self._ls_from_cache(path)
-        if out is None:
-            raise FileNotFoundError(path)
-        if detail:
-            return out
-        return [o["name"] for o in out]
-
-    def exists(self, path, **kwargs):  # overwrite auto-sync version
-        return self.isdir(path) or self.isfile(path)
-
-    def isdir(self, path):  # overwrite auto-sync version
-        if self.dircache:
-            return path in self.dircache
-        elif isinstance(self.references, LazyReferenceMapper):
-            return path in self.references.listdir("")
-        else:
-            # this may be faster than building dircache for single calls, but
-            # by looping will be slow for many calls; could cache it?
-            return any(_.startswith(f"{path}/") for _ in self.references)
-
-    def isfile(self, path):  # overwrite auto-sync version
-        return path in self.references
-
-    async def _ls(self, path, detail=True, **kwargs):  # calls fast sync code
-        return self.ls(path, detail, **kwargs)
-
-    def find(self, path, maxdepth=None, withdirs=False, detail=False, **kwargs):
-        if withdirs:
-            return super().find(
-                path, maxdepth=maxdepth, withdirs=withdirs, detail=detail, **kwargs
-            )
-        if path:
-            path = self._strip_protocol(path)
-            r = sorted(k for k in self.references if k.startswith(path))
-        else:
-            r = sorted(self.references)
-        if detail:
-            if not self.dircache:
-                self._dircache_from_items()
-            return {k: self._ls_from_cache(k)[0] for k in r}
-        else:
-            return r
-
-    def info(self, path, **kwargs):
-        out = self.references.get(path)
-        if out is not None:
-            if isinstance(out, (str, bytes)):
-                # decode base64 here
-                return {"name": path, "type": "file", "size": len(out)}
-            elif len(out) > 1:
-                return {"name": path, "type": "file", "size": out[2]}
-            else:
-                out0 = [{"name": path, "type": "file", "size": None}]
-        else:
-            out = self.ls(path, True)
-            out0 = [o for o in out if o["name"] == path]
-            if not out0:
-                return {"name": path, "type": "directory", "size": 0}
-        if out0[0]["size"] is None:
-            # if this is a whole remote file, update size using remote FS
-            prot, _ = split_protocol(self.references[path][0])
-            out0[0]["size"] = self.fss[prot].size(self.references[path][0])
-        return out0[0]
-
-    async def _info(self, path, **kwargs):  # calls fast sync code
-        return self.info(path)
-
-    async def _rm_file(self, path, **kwargs):
-        self.references.pop(
-            path, None
-        )  # ignores FileNotFound, just as well for directories
-        self.dircache.clear()  # this is a bit heavy handed
-
-    async def _pipe_file(self, path, data):
-        # can be str or bytes
-        self.references[path] = data
-        self.dircache.clear()  # this is a bit heavy handed
-
-    async def _put_file(self, lpath, rpath):
-        # puts binary
-        with open(lpath, "rb") as f:
-            self.references[rpath] = f.read()
-        self.dircache.clear()  # this is a bit heavy handed
-
-    def save_json(self, url, **storage_options):
-        """Write modified references into new location"""
-        out = {}
-        for k, v in self.references.items():
-            if isinstance(v, bytes):
-                try:
-                    out[k] = v.decode("ascii")
-                except UnicodeDecodeError:
-                    out[k] = (b"base64:" + base64.b64encode(v)).decode()
-            else:
-                out[k] = v
-        with fsspec.open(url, "wb", **storage_options) as f:
-            f.write(json.dumps({"version": 1, "refs": out}).encode())
diff --git a/spaces/jordonpeter01/ai-comic-factory/src/lib/generateSeed.ts b/spaces/jordonpeter01/ai-comic-factory/src/lib/generateSeed.ts
deleted file mode 100644
index 563e25ec894ab5af54c5025a15a9b7a5918325de..0000000000000000000000000000000000000000
--- a/spaces/jordonpeter01/ai-comic-factory/src/lib/generateSeed.ts
+++ /dev/null
@@ -1,3 +0,0 @@
-export function generateSeed() {
-  return Math.floor(Math.random() * Math.pow(2, 31));
-}
\ No newline at end of file
diff --git a/spaces/juancopi81/whisper-youtube-2-hf_dataset/test/test_sqlitecontextmanager.py b/spaces/juancopi81/whisper-youtube-2-hf_dataset/test/test_sqlitecontextmanager.py
deleted file mode 100644
index 4779b891238297abe8a2e97a5176456bee21075b..0000000000000000000000000000000000000000
--- a/spaces/juancopi81/whisper-youtube-2-hf_dataset/test/test_sqlitecontextmanager.py
+++ /dev/null
@@ -1,13 +0,0 @@
-import os
-from sqlite3 import Cursor
-
-from youtube_transcriber.storing.sqlitecontextmanager import SQLiteContextManager
-
-def test_sqlite_context_manager_init():
-    sqlite_context_manager = SQLiteContextManager("dummyinit.db")
-    assert type(sqlite_context_manager) == SQLiteContextManager
-    
-def test_enter_context_manager():
-    with SQLiteContextManager("dummy.db") as cursor:
-        assert type(cursor) == Cursor
-    os.remove("dummy.db")
\ No newline at end of file
diff --git a/spaces/juancopi81/youtube-music-transcribe/mt3/mixing.py b/spaces/juancopi81/youtube-music-transcribe/mt3/mixing.py
deleted file mode 100644
index aa2c9b2682105059633bf61f0e39a2e127a356ce..0000000000000000000000000000000000000000
--- a/spaces/juancopi81/youtube-music-transcribe/mt3/mixing.py
+++ /dev/null
@@ -1,91 +0,0 @@
-# Copyright 2022 The MT3 Authors.
-#
-# Licensed under the Apache License, Version 2.0 (the "License");
-# you may not use this file except in compliance with the License.
-# You may obtain a copy of the License at
-#
-#     http://www.apache.org/licenses/LICENSE-2.0
-#
-# Unless required by applicable law or agreed to in writing, software
-# distributed under the License is distributed on an "AS IS" BASIS,
-# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-# See the License for the specific language governing permissions and
-# limitations under the License.
-
-"""Functions for mixing (in the audio sense) multiple transcription examples."""
-
-from typing import Callable, Optional, Sequence
-
-import gin
-
-from mt3 import event_codec
-from mt3 import run_length_encoding
-
-import numpy as np
-import seqio
-import tensorflow as tf
-
-
-@gin.configurable
-def mix_transcription_examples(
-    ds: tf.data.Dataset,
-    sequence_length: seqio.preprocessors.SequenceLengthType,
-    output_features: seqio.preprocessors.OutputFeaturesType,
-    codec: event_codec.Codec,
-    inputs_feature_key: str = 'inputs',
-    targets_feature_keys: Sequence[str] = ('targets',),
-    max_examples_per_mix: Optional[int] = None,
-    shuffle_buffer_size: int = seqio.SHUFFLE_BUFFER_SIZE
-) -> Callable[..., tf.data.Dataset]:
-  """Preprocessor that mixes together "batches" of transcription examples.
-
-  Args:
-    ds: Dataset of individual transcription examples, each of which should
-        have an 'inputs' field containing 1D audio samples (currently only
-        audio encoders that use raw samples as an intermediate representation
-        are supported), and a 'targets' field containing run-length encoded
-        note events.
-    sequence_length: Dictionary mapping feature key to length.
-    output_features: Dictionary mapping feature key to spec.
-    codec: An event_codec.Codec used to interpret the target events.
-    inputs_feature_key: Feature key for inputs which will be mixed as audio.
-    targets_feature_keys: List of feature keys for targets, each of which will
-        be merged (separately) as run-length encoded note events.
-    max_examples_per_mix: Maximum number of individual examples to mix together.
-    shuffle_buffer_size: Size of shuffle buffer to use for shuffle prior to
-        mixing.
-
-  Returns:
-    Dataset containing mixed examples.
-  """
-  if max_examples_per_mix is None:
-    return ds
-
-  # TODO(iansimon): is there a way to use seqio's seed?
-  ds = tf.data.Dataset.sample_from_datasets([
-      ds.shuffle(
-          buffer_size=shuffle_buffer_size // max_examples_per_mix
-      ).padded_batch(batch_size=i) for i in range(1, max_examples_per_mix + 1)
-  ])
-
-  def mix_inputs(ex):
-    samples = tf.reduce_sum(ex[inputs_feature_key], axis=0)
-    norm = tf.linalg.norm(samples, ord=np.inf)
-    ex[inputs_feature_key] = tf.math.divide_no_nan(samples, norm)
-    return ex
-  ds = ds.map(mix_inputs, num_parallel_calls=tf.data.experimental.AUTOTUNE)
-
-  max_tokens = sequence_length['targets']
-  if output_features['targets'].add_eos:
-    # Leave room to insert an EOS token.
-    max_tokens -= 1
-
-  def mix_targets(ex):
-    for k in targets_feature_keys:
-      ex[k] = run_length_encoding.merge_run_length_encoded_targets(
-          targets=ex[k],
-          codec=codec)
-    return ex
-  ds = ds.map(mix_targets, num_parallel_calls=tf.data.experimental.AUTOTUNE)
-
-  return ds
diff --git a/spaces/kangvcar/RealChar/realtime_ai_character/audio/speech_to_text/__init__.py b/spaces/kangvcar/RealChar/realtime_ai_character/audio/speech_to_text/__init__.py
deleted file mode 100644
index c72a328c3cd1336a38539a26520c80b8c19fd0fa..0000000000000000000000000000000000000000
--- a/spaces/kangvcar/RealChar/realtime_ai_character/audio/speech_to_text/__init__.py
+++ /dev/null
@@ -1,21 +0,0 @@
-import os
-
-from realtime_ai_character.audio.speech_to_text.base import SpeechToText
-
-
-def get_speech_to_text() -> SpeechToText:
-    use = os.getenv('SPEECH_TO_TEXT_USE', 'LOCAL_WHISPER')
-    if use == 'GOOGLE':
-        from realtime_ai_character.audio.speech_to_text.google import Google
-        Google.initialize()
-        return Google.get_instance()
-    elif use == 'LOCAL_WHISPER':
-        from realtime_ai_character.audio.speech_to_text.whisper import Whisper
-        Whisper.initialize(use='local')
-        return Whisper.get_instance()
-    elif use == 'OPENAI_WHISPER':
-        from realtime_ai_character.audio.speech_to_text.whisper import Whisper
-        Whisper.initialize(use='api')
-        return Whisper.get_instance()
-    else:
-        raise NotImplementedError(f'Unknown speech to text engine: {use}')
diff --git a/spaces/kbora/minerva-generate-docker/app.py b/spaces/kbora/minerva-generate-docker/app.py
deleted file mode 100644
index 55cc152429554972bf8b1a1f05c9d88096d2c676..0000000000000000000000000000000000000000
--- a/spaces/kbora/minerva-generate-docker/app.py
+++ /dev/null
@@ -1,5 +0,0 @@
-import gradio as gr
-from blocks.main import main_box
-blocks = main_box()
-blocks.launch(server_name="0.0.0.0", ssl_verify=False)
-
diff --git a/spaces/kevinwang676/Bark-Voice-Cloning/Dockerfile b/spaces/kevinwang676/Bark-Voice-Cloning/Dockerfile
deleted file mode 100644
index 00b1196aa099cc58dbbc3bc37d09af3d1e7031e6..0000000000000000000000000000000000000000
--- a/spaces/kevinwang676/Bark-Voice-Cloning/Dockerfile
+++ /dev/null
@@ -1,38 +0,0 @@
-FROM debian:stable
-
-# Install system packages
-RUN apt update && apt install -y git pip
-
-# Create non-root user
-RUN useradd -m -d /bark bark
-
-# Run as new user
-USER bark
-WORKDIR /bark
-
-# Clone git repo
-RUN git clone https://github.com/C0untFloyd/bark-gui 
-
-# Switch to git directory
-WORKDIR /bark/bark-gui
-
-# Append pip bin path to PATH
-ENV PATH=$PATH:/bark/.local/bin
-
-# Install dependancies
-RUN pip install .
-RUN pip install -r requirements.txt
-
-# List on all addresses, since we are in a container.
-RUN sed -i "s/server_name: ''/server_name: 0.0.0.0/g" ./config.yaml
-
-# Suggested volumes
-VOLUME /bark/bark-gui/assets/prompts/custom
-VOLUME /bark/bark-gui/models
-VOLUME /bark/.cache/huggingface/hub
-
-# Default port for web-ui
-EXPOSE 7860/tcp
-
-# Start script
-CMD python3 webui.py
diff --git a/spaces/kevinwang676/Bark-with-Voice-Cloning/swap_voice.py b/spaces/kevinwang676/Bark-with-Voice-Cloning/swap_voice.py
deleted file mode 100644
index be1135be3648f9757046de1f9a4e240bd818be5a..0000000000000000000000000000000000000000
--- a/spaces/kevinwang676/Bark-with-Voice-Cloning/swap_voice.py
+++ /dev/null
@@ -1,62 +0,0 @@
-from bark.generation import load_codec_model, generate_text_semantic, grab_best_device
-from bark import SAMPLE_RATE
-from encodec.utils import convert_audio
-from bark.hubert.hubert_manager import HuBERTManager
-from bark.hubert.pre_kmeans_hubert import CustomHubert
-from bark.hubert.customtokenizer import CustomTokenizer
-from bark.api import semantic_to_waveform
-from scipy.io.wavfile import write as write_wav
-from util.helper import create_filename
-from util.settings import Settings
-
-
-import torchaudio
-import torch
-import os
-import gradio
-
-def swap_voice_from_audio(swap_audio_filename, selected_speaker, tokenizer_lang, seed, batchcount, progress=gradio.Progress(track_tqdm=True)):
-    use_gpu = not os.environ.get("BARK_FORCE_CPU", False)
-    progress(0, desc="Loading Codec")
-    
-    # From https://github.com/gitmylo/bark-voice-cloning-HuBERT-quantizer
-    hubert_manager = HuBERTManager()
-    hubert_manager.make_sure_hubert_installed()
-    hubert_manager.make_sure_tokenizer_installed(tokenizer_lang=tokenizer_lang)
-
-    # From https://github.com/gitmylo/bark-voice-cloning-HuBERT-quantizer 
-    # Load HuBERT for semantic tokens
-
-    # Load the HuBERT model
-    device = grab_best_device(use_gpu)
-    hubert_model = CustomHubert(checkpoint_path='./models/hubert/hubert.pt').to(device)
-    model = load_codec_model(use_gpu=use_gpu)
-
-    # Load the CustomTokenizer model
-    tokenizer = CustomTokenizer.load_from_checkpoint(f'./models/hubert/{tokenizer_lang}_tokenizer.pth').to(device)  # Automatically uses the right layers
-
-    progress(0.25, desc="Converting WAV")
-
-    # Load and pre-process the audio waveform
-    wav, sr = torchaudio.load(swap_audio_filename)
-    if wav.shape[0] == 2:  # Stereo to mono if needed
-        wav = wav.mean(0, keepdim=True)
-
-    wav = convert_audio(wav, sr, model.sample_rate, model.channels)
-    wav = wav.to(device)
-    semantic_vectors = hubert_model.forward(wav, input_sample_hz=model.sample_rate)
-    semantic_tokens = tokenizer.get_token(semantic_vectors)
-
-    audio = semantic_to_waveform(
-        semantic_tokens,
-        history_prompt=selected_speaker,
-        temp=0.7,
-        silent=False,
-        output_full=False)
-
-    settings = Settings('config.yaml')
-
-    result = create_filename(settings.output_folder_path, None, "swapvoice",".wav")
-    write_wav(result, SAMPLE_RATE, audio)
-    return result
-
diff --git a/spaces/kevinwang676/ChatGLM2-VC-SadTalker/speaker_encoder/preprocess.py b/spaces/kevinwang676/ChatGLM2-VC-SadTalker/speaker_encoder/preprocess.py
deleted file mode 100644
index fe5ab25ef7cb4adeb76cad11962f179d6a38edcc..0000000000000000000000000000000000000000
--- a/spaces/kevinwang676/ChatGLM2-VC-SadTalker/speaker_encoder/preprocess.py
+++ /dev/null
@@ -1,285 +0,0 @@
-from multiprocess.pool import ThreadPool
-from speaker_encoder.params_data import *
-from speaker_encoder.config import librispeech_datasets, anglophone_nationalites
-from datetime import datetime
-from speaker_encoder import audio
-from pathlib import Path
-from tqdm import tqdm
-import numpy as np
-
-
-class DatasetLog:
-    """
-    Registers metadata about the dataset in a text file.
-    """
-    def __init__(self, root, name):
-        self.text_file = open(Path(root, "Log_%s.txt" % name.replace("/", "_")), "w")
-        self.sample_data = dict()
-        
-        start_time = str(datetime.now().strftime("%A %d %B %Y at %H:%M"))
-        self.write_line("Creating dataset %s on %s" % (name, start_time))
-        self.write_line("-----")
-        self._log_params()
-        
-    def _log_params(self):
-        from speaker_encoder import params_data
-        self.write_line("Parameter values:")
-        for param_name in (p for p in dir(params_data) if not p.startswith("__")):
-            value = getattr(params_data, param_name)
-            self.write_line("\t%s: %s" % (param_name, value))
-        self.write_line("-----")
-    
-    def write_line(self, line):
-        self.text_file.write("%s\n" % line)
-        
-    def add_sample(self, **kwargs):
-        for param_name, value in kwargs.items():
-            if not param_name in self.sample_data:
-                self.sample_data[param_name] = []
-            self.sample_data[param_name].append(value)
-            
-    def finalize(self):
-        self.write_line("Statistics:")
-        for param_name, values in self.sample_data.items():
-            self.write_line("\t%s:" % param_name)
-            self.write_line("\t\tmin %.3f, max %.3f" % (np.min(values), np.max(values)))
-            self.write_line("\t\tmean %.3f, median %.3f" % (np.mean(values), np.median(values)))
-        self.write_line("-----")
-        end_time = str(datetime.now().strftime("%A %d %B %Y at %H:%M"))
-        self.write_line("Finished on %s" % end_time)
-        self.text_file.close()
-       
-        
-def _init_preprocess_dataset(dataset_name, datasets_root, out_dir) -> (Path, DatasetLog):
-    dataset_root = datasets_root.joinpath(dataset_name)
-    if not dataset_root.exists():
-        print("Couldn\'t find %s, skipping this dataset." % dataset_root)
-        return None, None
-    return dataset_root, DatasetLog(out_dir, dataset_name)
-
-
-def _preprocess_speaker_dirs(speaker_dirs, dataset_name, datasets_root, out_dir, extension,
-                             skip_existing, logger):
-    print("%s: Preprocessing data for %d speakers." % (dataset_name, len(speaker_dirs)))
-    
-    # Function to preprocess utterances for one speaker
-    def preprocess_speaker(speaker_dir: Path):
-        # Give a name to the speaker that includes its dataset
-        speaker_name = "_".join(speaker_dir.relative_to(datasets_root).parts)
-        
-        # Create an output directory with that name, as well as a txt file containing a 
-        # reference to each source file.
-        speaker_out_dir = out_dir.joinpath(speaker_name)
-        speaker_out_dir.mkdir(exist_ok=True)
-        sources_fpath = speaker_out_dir.joinpath("_sources.txt")
-        
-        # There's a possibility that the preprocessing was interrupted earlier, check if 
-        # there already is a sources file.
-        if sources_fpath.exists():
-            try:
-                with sources_fpath.open("r") as sources_file:
-                    existing_fnames = {line.split(",")[0] for line in sources_file}
-            except:
-                existing_fnames = {}
-        else:
-            existing_fnames = {}
-        
-        # Gather all audio files for that speaker recursively
-        sources_file = sources_fpath.open("a" if skip_existing else "w")
-        for in_fpath in speaker_dir.glob("**/*.%s" % extension):
-            # Check if the target output file already exists
-            out_fname = "_".join(in_fpath.relative_to(speaker_dir).parts)
-            out_fname = out_fname.replace(".%s" % extension, ".npy")
-            if skip_existing and out_fname in existing_fnames:
-                continue
-                
-            # Load and preprocess the waveform
-            wav = audio.preprocess_wav(in_fpath)
-            if len(wav) == 0:
-                continue
-            
-            # Create the mel spectrogram, discard those that are too short
-            frames = audio.wav_to_mel_spectrogram(wav)
-            if len(frames) < partials_n_frames:
-                continue
-            
-            out_fpath = speaker_out_dir.joinpath(out_fname)
-            np.save(out_fpath, frames)
-            logger.add_sample(duration=len(wav) / sampling_rate)
-            sources_file.write("%s,%s\n" % (out_fname, in_fpath))
-        
-        sources_file.close()
-    
-    # Process the utterances for each speaker
-    with ThreadPool(8) as pool:
-        list(tqdm(pool.imap(preprocess_speaker, speaker_dirs), dataset_name, len(speaker_dirs),
-                  unit="speakers"))
-    logger.finalize()
-    print("Done preprocessing %s.\n" % dataset_name)
-
-
-# Function to preprocess utterances for one speaker
-def __preprocess_speaker(speaker_dir: Path, datasets_root: Path, out_dir: Path, extension: str, skip_existing: bool):
-        # Give a name to the speaker that includes its dataset
-        speaker_name = "_".join(speaker_dir.relative_to(datasets_root).parts)
-        
-        # Create an output directory with that name, as well as a txt file containing a 
-        # reference to each source file.
-        speaker_out_dir = out_dir.joinpath(speaker_name)
-        speaker_out_dir.mkdir(exist_ok=True)
-        sources_fpath = speaker_out_dir.joinpath("_sources.txt")
-        
-        # There's a possibility that the preprocessing was interrupted earlier, check if 
-        # there already is a sources file.
-        # if sources_fpath.exists():
-        #     try:
-        #         with sources_fpath.open("r") as sources_file:
-        #             existing_fnames = {line.split(",")[0] for line in sources_file}
-        #     except:
-        #         existing_fnames = {}
-        # else:
-        #     existing_fnames = {}
-        existing_fnames = {}
-        # Gather all audio files for that speaker recursively
-        sources_file = sources_fpath.open("a" if skip_existing else "w")
-
-        for in_fpath in speaker_dir.glob("**/*.%s" % extension):
-            # Check if the target output file already exists
-            out_fname = "_".join(in_fpath.relative_to(speaker_dir).parts)
-            out_fname = out_fname.replace(".%s" % extension, ".npy")
-            if skip_existing and out_fname in existing_fnames:
-                continue
-                
-            # Load and preprocess the waveform
-            wav = audio.preprocess_wav(in_fpath)
-            if len(wav) == 0:
-                continue
-            
-            # Create the mel spectrogram, discard those that are too short
-            frames = audio.wav_to_mel_spectrogram(wav)
-            if len(frames) < partials_n_frames:
-                continue
-            
-            out_fpath = speaker_out_dir.joinpath(out_fname)
-            np.save(out_fpath, frames)
-            # logger.add_sample(duration=len(wav) / sampling_rate)
-            sources_file.write("%s,%s\n" % (out_fname, in_fpath))
-        
-        sources_file.close()
-        return len(wav)
-
-def _preprocess_speaker_dirs_vox2(speaker_dirs, dataset_name, datasets_root, out_dir, extension,
-                             skip_existing, logger):
-    # from multiprocessing import Pool, cpu_count
-    from pathos.multiprocessing import ProcessingPool as Pool
-    # Function to preprocess utterances for one speaker
-    def __preprocess_speaker(speaker_dir: Path):
-        # Give a name to the speaker that includes its dataset
-        speaker_name = "_".join(speaker_dir.relative_to(datasets_root).parts)
-        
-        # Create an output directory with that name, as well as a txt file containing a 
-        # reference to each source file.
-        speaker_out_dir = out_dir.joinpath(speaker_name)
-        speaker_out_dir.mkdir(exist_ok=True)
-        sources_fpath = speaker_out_dir.joinpath("_sources.txt")
-        
-        existing_fnames = {}
-        # Gather all audio files for that speaker recursively
-        sources_file = sources_fpath.open("a" if skip_existing else "w")
-        wav_lens = []
-        for in_fpath in speaker_dir.glob("**/*.%s" % extension):
-            # Check if the target output file already exists
-            out_fname = "_".join(in_fpath.relative_to(speaker_dir).parts)
-            out_fname = out_fname.replace(".%s" % extension, ".npy")
-            if skip_existing and out_fname in existing_fnames:
-                continue
-                
-            # Load and preprocess the waveform
-            wav = audio.preprocess_wav(in_fpath)
-            if len(wav) == 0:
-                continue
-            
-            # Create the mel spectrogram, discard those that are too short
-            frames = audio.wav_to_mel_spectrogram(wav)
-            if len(frames) < partials_n_frames:
-                continue
-            
-            out_fpath = speaker_out_dir.joinpath(out_fname)
-            np.save(out_fpath, frames)
-            # logger.add_sample(duration=len(wav) / sampling_rate)
-            sources_file.write("%s,%s\n" % (out_fname, in_fpath))
-            wav_lens.append(len(wav))
-        sources_file.close()
-        return wav_lens
-
-    print("%s: Preprocessing data for %d speakers." % (dataset_name, len(speaker_dirs)))
-    # Process the utterances for each speaker
-    # with ThreadPool(8) as pool:
-    #     list(tqdm(pool.imap(preprocess_speaker, speaker_dirs), dataset_name, len(speaker_dirs),
-    #               unit="speakers"))
-    pool = Pool(processes=20)
-    for i, wav_lens in enumerate(pool.map(__preprocess_speaker, speaker_dirs), 1):
-        for wav_len in wav_lens:
-            logger.add_sample(duration=wav_len / sampling_rate)
-        print(f'{i}/{len(speaker_dirs)} \r')
-
-    logger.finalize()
-    print("Done preprocessing %s.\n" % dataset_name)
-
-
-def preprocess_librispeech(datasets_root: Path, out_dir: Path, skip_existing=False):
-    for dataset_name in librispeech_datasets["train"]["other"]:
-        # Initialize the preprocessing
-        dataset_root, logger = _init_preprocess_dataset(dataset_name, datasets_root, out_dir)
-        if not dataset_root:
-            return 
-        
-        # Preprocess all speakers
-        speaker_dirs = list(dataset_root.glob("*"))
-        _preprocess_speaker_dirs(speaker_dirs, dataset_name, datasets_root, out_dir, "flac",
-                                 skip_existing, logger)
-
-
-def preprocess_voxceleb1(datasets_root: Path, out_dir: Path, skip_existing=False):
-    # Initialize the preprocessing
-    dataset_name = "VoxCeleb1"
-    dataset_root, logger = _init_preprocess_dataset(dataset_name, datasets_root, out_dir)
-    if not dataset_root:
-        return
-
-    # Get the contents of the meta file
-    with dataset_root.joinpath("vox1_meta.csv").open("r") as metafile:
-        metadata = [line.split("\t") for line in metafile][1:]
-    
-    # Select the ID and the nationality, filter out non-anglophone speakers
-    nationalities = {line[0]: line[3] for line in metadata}
-    # keep_speaker_ids = [speaker_id for speaker_id, nationality in nationalities.items() if 
-    #                     nationality.lower() in anglophone_nationalites]
-    keep_speaker_ids = [speaker_id for speaker_id, nationality in nationalities.items()]                        
-    print("VoxCeleb1: using samples from %d (presumed anglophone) speakers out of %d." % 
-          (len(keep_speaker_ids), len(nationalities)))
-    
-    # Get the speaker directories for anglophone speakers only
-    speaker_dirs = dataset_root.joinpath("wav").glob("*")
-    speaker_dirs = [speaker_dir for speaker_dir in speaker_dirs if
-                    speaker_dir.name in keep_speaker_ids]
-    print("VoxCeleb1: found %d anglophone speakers on the disk, %d missing (this is normal)." % 
-          (len(speaker_dirs), len(keep_speaker_ids) - len(speaker_dirs)))
-
-    # Preprocess all speakers
-    _preprocess_speaker_dirs(speaker_dirs, dataset_name, datasets_root, out_dir, "wav",
-                             skip_existing, logger)
-
-
-def preprocess_voxceleb2(datasets_root: Path, out_dir: Path, skip_existing=False):
-    # Initialize the preprocessing
-    dataset_name = "VoxCeleb2"
-    dataset_root, logger = _init_preprocess_dataset(dataset_name, datasets_root, out_dir)
-    if not dataset_root:
-        return
-    
-    # Get the speaker directories
-    # Preprocess all speakers
-    speaker_dirs = list(dataset_root.joinpath("dev", "aac").glob("*"))
-    _preprocess_speaker_dirs_vox2(speaker_dirs, dataset_name, datasets_root, out_dir, "m4a",
-                             skip_existing, logger)
diff --git a/spaces/kevinwang676/FreeVC/speaker_encoder/hparams.py b/spaces/kevinwang676/FreeVC/speaker_encoder/hparams.py
deleted file mode 100644
index 9a8c16471903b0c92253b1d70fcd6a61d10e085f..0000000000000000000000000000000000000000
--- a/spaces/kevinwang676/FreeVC/speaker_encoder/hparams.py
+++ /dev/null
@@ -1,31 +0,0 @@
-## Mel-filterbank
-mel_window_length = 25  # In milliseconds
-mel_window_step = 10    # In milliseconds
-mel_n_channels = 40
-
-
-## Audio
-sampling_rate = 16000
-# Number of spectrogram frames in a partial utterance
-partials_n_frames = 160     # 1600 ms
-
-
-## Voice Activation Detection
-# Window size of the VAD. Must be either 10, 20 or 30 milliseconds.
-# This sets the granularity of the VAD. Should not need to be changed.
-vad_window_length = 30  # In milliseconds
-# Number of frames to average together when performing the moving average smoothing.
-# The larger this value, the larger the VAD variations must be to not get smoothed out. 
-vad_moving_average_width = 8
-# Maximum number of consecutive silent frames a segment can have.
-vad_max_silence_length = 6
-
-
-## Audio volume normalization
-audio_norm_target_dBFS = -30
-
-
-## Model parameters
-model_hidden_size = 256
-model_embedding_size = 256
-model_num_layers = 3
\ No newline at end of file
diff --git a/spaces/kevinwang676/VALLE/__init__.py b/spaces/kevinwang676/VALLE/__init__.py
deleted file mode 100644
index 3ee023a9375d7142795a0f3d8037dacca54efdbe..0000000000000000000000000000000000000000
--- a/spaces/kevinwang676/VALLE/__init__.py
+++ /dev/null
@@ -1 +0,0 @@
-from . import data, models, modules, utils
diff --git a/spaces/kevinwang676/VITS2-Mandarin/train_ms.py b/spaces/kevinwang676/VITS2-Mandarin/train_ms.py
deleted file mode 100644
index 5fbc46e85265c0da7c13fe9721e4eeb472fca2d8..0000000000000000000000000000000000000000
--- a/spaces/kevinwang676/VITS2-Mandarin/train_ms.py
+++ /dev/null
@@ -1,450 +0,0 @@
-import os
-import json
-import argparse
-import itertools
-import math
-import torch
-from torch import nn, optim
-from torch.nn import functional as F
-from torch.utils.data import DataLoader
-from torch.utils.tensorboard import SummaryWriter
-# from tensorboardX import SummaryWriter
-import torch.multiprocessing as mp
-import torch.distributed as dist
-from torch.nn.parallel import DistributedDataParallel as DDP
-from torch.cuda.amp import autocast, GradScaler
-import tqdm
-from pqmf import PQMF
-import commons
-import utils
-from data_utils import (
-    TextAudioSpeakerLoader,
-    TextAudioSpeakerCollate,
-    DistributedBucketSampler
-)
-from models import (
-    SynthesizerTrn,
-    MultiPeriodDiscriminator,
-    DurationDiscriminator,
-    AVAILABLE_FLOW_TYPES
-)
-from losses import (
-    generator_loss,
-    discriminator_loss,
-    feature_loss,
-    kl_loss,
-    subband_stft_loss
-)
-from mel_processing import mel_spectrogram_torch, spec_to_mel_torch
-from text.symbols import symbols
-
-torch.autograd.set_detect_anomaly(True)
-torch.backends.cudnn.benchmark = True
-global_step = 0
-
-
-def main():
-    """Assume Single Node Multi GPUs Training Only"""
-    assert torch.cuda.is_available(), "CPU training is not allowed."
-
-    n_gpus = torch.cuda.device_count()
-    os.environ['MASTER_ADDR'] = 'localhost'
-    os.environ['MASTER_PORT'] = '6060'
-
-    hps = utils.get_hparams()
-    mp.spawn(run, nprocs=n_gpus, args=(n_gpus, hps,))
-
-
-def run(rank, n_gpus, hps):
-    global global_step
-    if rank == 0:
-        logger = utils.get_logger(hps.model_dir)
-        logger.info(hps)
-        utils.check_git_hash(hps.model_dir)
-        writer = SummaryWriter(log_dir=hps.model_dir)
-        writer_eval = SummaryWriter(log_dir=os.path.join(hps.model_dir, "eval"))
-
-    if os.name == 'nt':
-        dist.init_process_group(backend='gloo', init_method='env://', world_size=n_gpus, rank=rank)
-    else:
-        dist.init_process_group(backend='nccl', init_method='env://', world_size=n_gpus, rank=rank)
-    torch.manual_seed(hps.train.seed)
-    torch.cuda.set_device(rank)
-
-    if "use_mel_posterior_encoder" in hps.model.keys() and hps.model.use_mel_posterior_encoder == True:
-        print("Using mel posterior encoder for VITS2")
-        posterior_channels = 80  # vits2
-        hps.data.use_mel_posterior_encoder = True
-    else:
-        print("Using lin posterior encoder for VITS1")
-        posterior_channels = hps.data.filter_length // 2 + 1
-        hps.data.use_mel_posterior_encoder = False
-
-    train_dataset = TextAudioSpeakerLoader(hps.data.training_files, hps.data)
-    train_sampler = DistributedBucketSampler(
-        train_dataset,
-        hps.train.batch_size,
-        [32, 300, 400, 500, 600, 700, 800, 900, 1000],
-        num_replicas=n_gpus,
-        rank=rank,
-        shuffle=True)
-    collate_fn = TextAudioSpeakerCollate()
-    train_loader = DataLoader(train_dataset, num_workers=8, shuffle=False, pin_memory=True,
-                              collate_fn=collate_fn, batch_sampler=train_sampler)
-    if rank == 0:
-        eval_dataset = TextAudioSpeakerLoader(hps.data.validation_files, hps.data)
-        eval_loader = DataLoader(eval_dataset, num_workers=1, shuffle=False,
-                                 batch_size=hps.train.batch_size, pin_memory=True,
-                                 drop_last=False, collate_fn=collate_fn)
-    # some of these flags are not being used in the code and directly set in hps json file.
-    # they are kept here for reference and prototyping.
-    if "use_transformer_flows" in hps.model.keys() and hps.model.use_transformer_flows == True:
-        use_transformer_flows = True
-        transformer_flow_type = hps.model.transformer_flow_type
-        print(f"Using transformer flows {transformer_flow_type} for VITS2")
-        assert transformer_flow_type in AVAILABLE_FLOW_TYPES, f"transformer_flow_type must be one of {AVAILABLE_FLOW_TYPES}"
-    else:
-        print("Using normal flows for VITS1")
-        use_transformer_flows = False
-
-    if "use_spk_conditioned_encoder" in hps.model.keys() and hps.model.use_spk_conditioned_encoder == True:
-        if hps.data.n_speakers == 0:
-            raise ValueError("n_speakers must be > 0 when using spk conditioned encoder to train multi-speaker model")
-        use_spk_conditioned_encoder = True
-    else:
-        print("Using normal encoder for VITS1")
-        use_spk_conditioned_encoder = False
-
-    if "use_noise_scaled_mas" in hps.model.keys() and hps.model.use_noise_scaled_mas == True:
-        print("Using noise scaled MAS for VITS2")
-        use_noise_scaled_mas = True
-        mas_noise_scale_initial = 0.01
-        noise_scale_delta = 2e-6
-    else:
-        print("Using normal MAS for VITS1")
-        use_noise_scaled_mas = False
-        mas_noise_scale_initial = 0.0
-        noise_scale_delta = 0.0
-
-    if "use_duration_discriminator" in hps.model.keys() and hps.model.use_duration_discriminator == True:
-        print("Using duration discriminator for VITS2")
-        use_duration_discriminator = True
-        net_dur_disc = DurationDiscriminator(
-            hps.model.hidden_channels,
-            hps.model.hidden_channels,
-            3,
-            0.1,
-            gin_channels=hps.model.gin_channels if hps.data.n_speakers != 0 else 0,
-        ).cuda(rank)
-    else:
-        print("NOT using any duration discriminator like VITS1")
-        net_dur_disc = None
-        use_duration_discriminator = False
-
-    net_g = SynthesizerTrn(
-        len(symbols),
-        posterior_channels,
-        hps.train.segment_size // hps.data.hop_length,
-        n_speakers=hps.data.n_speakers,
-        mas_noise_scale_initial=mas_noise_scale_initial,
-        noise_scale_delta=noise_scale_delta,
-        **hps.model).cuda(rank)
-    net_d = MultiPeriodDiscriminator(hps.model.use_spectral_norm).cuda(rank)
-
-    optim_g = torch.optim.AdamW(
-        net_g.parameters(),
-        hps.train.learning_rate,
-        betas=hps.train.betas,
-        eps=hps.train.eps)
-    optim_d = torch.optim.AdamW(
-        net_d.parameters(),
-        hps.train.learning_rate,
-        betas=hps.train.betas,
-        eps=hps.train.eps)
-
-    if net_dur_disc is not None:
-        optim_dur_disc = torch.optim.AdamW(
-            net_dur_disc.parameters(),
-            hps.train.learning_rate,
-            betas=hps.train.betas,
-            eps=hps.train.eps)
-    else:
-        optim_dur_disc = None
-
-    net_g = DDP(net_g, device_ids=[rank], find_unused_parameters=True)
-    net_d = DDP(net_d, device_ids=[rank], find_unused_parameters=True)
-
-    if net_dur_disc is not None:  # 2의 경우
-        net_dur_disc = DDP(net_dur_disc, device_ids=[rank], find_unused_parameters=True)
-
-    try:
-        _, _, _, epoch_str = utils.load_checkpoint(utils.latest_checkpoint_path(hps.model_dir, "G_*.pth"), net_g,
-                                                   optim_g)
-        _, _, _, epoch_str = utils.load_checkpoint(utils.latest_checkpoint_path(hps.model_dir, "D_*.pth"), net_d,
-                                                   optim_d)
-        if net_dur_disc is not None:
-            _, _, _, epoch_str = utils.load_checkpoint(utils.latest_checkpoint_path(hps.model_dir, "DUR_*.pth"),
-                                                       net_dur_disc, optim_dur_disc)
-        global_step = (epoch_str - 1) * len(train_loader)
-    except:
-        epoch_str = 1
-        global_step = 0
-
-    scheduler_g = torch.optim.lr_scheduler.ExponentialLR(optim_g, gamma=hps.train.lr_decay, last_epoch=epoch_str - 2)
-    scheduler_d = torch.optim.lr_scheduler.ExponentialLR(optim_d, gamma=hps.train.lr_decay, last_epoch=epoch_str - 2)
-    if net_dur_disc is not None:
-        scheduler_dur_disc = torch.optim.lr_scheduler.ExponentialLR(optim_dur_disc, gamma=hps.train.lr_decay,
-                                                                    last_epoch=epoch_str - 2)
-    else:
-        scheduler_dur_disc = None
-
-    scaler = GradScaler(enabled=hps.train.fp16_run)
-
-    for epoch in range(epoch_str, hps.train.epochs + 1):
-        if rank == 0:
-            train_and_evaluate(rank, epoch, hps, [net_g, net_d, net_dur_disc], [optim_g, optim_d, optim_dur_disc],
-                               [scheduler_g, scheduler_d, scheduler_dur_disc], scaler, [train_loader, eval_loader],
-                               logger, [writer, writer_eval])
-        else:
-            train_and_evaluate(rank, epoch, hps, [net_g, net_d, net_dur_disc], [optim_g, optim_d, optim_dur_disc],
-                               [scheduler_g, scheduler_d, scheduler_dur_disc], scaler, [train_loader, None], None, None)
-        scheduler_g.step()
-        scheduler_d.step()
-        if net_dur_disc is not None:
-            scheduler_dur_disc.step()
-
-
-def train_and_evaluate(rank, epoch, hps, nets, optims, schedulers, scaler, loaders, logger, writers):
-    net_g, net_d, net_dur_disc = nets
-    optim_g, optim_d, optim_dur_disc = optims
-    scheduler_g, scheduler_d, scheduler_dur_disc = schedulers
-    train_loader, eval_loader = loaders
-    if writers is not None:
-        writer, writer_eval = writers
-
-    train_loader.batch_sampler.set_epoch(epoch)
-    global global_step
-
-    net_g.train()
-    net_d.train()
-    if net_dur_disc is not None:
-        net_dur_disc.train()
-
-    if rank == 0:
-        loader = tqdm.tqdm(train_loader, desc='Loading train data')
-    else:
-        loader = train_loader
-    for batch_idx, (x, x_lengths, spec, spec_lengths, y, y_lengths, speakers) in enumerate(loader):
-        if net_g.module.use_noise_scaled_mas:
-            current_mas_noise_scale = net_g.module.mas_noise_scale_initial - net_g.module.noise_scale_delta * global_step
-            net_g.module.current_mas_noise_scale = max(current_mas_noise_scale, 0.0)
-        x, x_lengths = x.cuda(rank, non_blocking=True), x_lengths.cuda(rank, non_blocking=True)
-        spec, spec_lengths = spec.cuda(rank, non_blocking=True), spec_lengths.cuda(rank, non_blocking=True)
-        y, y_lengths = y.cuda(rank, non_blocking=True), y_lengths.cuda(rank, non_blocking=True)
-        speakers = speakers.cuda(rank, non_blocking=True)
-
-        with autocast(enabled=hps.train.fp16_run):
-            y_hat, y_hat_mb, l_length, attn, ids_slice, x_mask, z_mask, \
-            (z, z_p, m_p, logs_p, m_q, logs_q), (hidden_x, logw, logw_) = net_g(x, x_lengths, spec, spec_lengths,
-                                                                                speakers)
-
-            if hps.model.use_mel_posterior_encoder or hps.data.use_mel_posterior_encoder:
-                mel = spec
-            else:
-                mel = spec_to_mel_torch(
-                    spec,
-                    hps.data.filter_length,
-                    hps.data.n_mel_channels,
-                    hps.data.sampling_rate,
-                    hps.data.mel_fmin,
-                    hps.data.mel_fmax)
-            y_mel = commons.slice_segments(mel, ids_slice, hps.train.segment_size // hps.data.hop_length)
-            y_hat_mel = mel_spectrogram_torch(
-                y_hat.squeeze(1),
-                hps.data.filter_length,
-                hps.data.n_mel_channels,
-                hps.data.sampling_rate,
-                hps.data.hop_length,
-                hps.data.win_length,
-                hps.data.mel_fmin,
-                hps.data.mel_fmax
-            )
-
-            y = commons.slice_segments(y, ids_slice * hps.data.hop_length, hps.train.segment_size)  # slice
-
-            # Discriminator
-            y_d_hat_r, y_d_hat_g, _, _ = net_d(y, y_hat.detach())
-            with autocast(enabled=False):
-                loss_disc, losses_disc_r, losses_disc_g = discriminator_loss(y_d_hat_r, y_d_hat_g)
-                loss_disc_all = loss_disc
-
-            # Duration Discriminator
-            if net_dur_disc is not None:
-                y_dur_hat_r, y_dur_hat_g = net_dur_disc(hidden_x.detach(), x_mask.detach(), logw_.detach(),
-                                                        logw.detach())
-                with autocast(enabled=False):
-                    # TODO: I think need to mean using the mask, but for now, just mean all
-                    loss_dur_disc, losses_dur_disc_r, losses_dur_disc_g = discriminator_loss(y_dur_hat_r, y_dur_hat_g)
-                    loss_dur_disc_all = loss_dur_disc
-                optim_dur_disc.zero_grad()
-                scaler.scale(loss_dur_disc_all).backward()
-                scaler.unscale_(optim_dur_disc)
-                grad_norm_dur_disc = commons.clip_grad_value_(net_dur_disc.parameters(), None)
-                scaler.step(optim_dur_disc)
-
-        optim_d.zero_grad()
-        scaler.scale(loss_disc_all).backward()
-        scaler.unscale_(optim_d)
-        grad_norm_d = commons.clip_grad_value_(net_d.parameters(), None)
-        scaler.step(optim_d)
-
-        with autocast(enabled=hps.train.fp16_run):
-            # Generator
-            y_d_hat_r, y_d_hat_g, fmap_r, fmap_g = net_d(y, y_hat)
-            if net_dur_disc is not None:
-                y_dur_hat_r, y_dur_hat_g = net_dur_disc(hidden_x, x_mask, logw_, logw)
-            with autocast(enabled=False):
-                loss_dur = torch.sum(l_length.float())
-                loss_mel = F.l1_loss(y_mel, y_hat_mel) * hps.train.c_mel
-                loss_kl = kl_loss(z_p, logs_q, m_p, logs_p, z_mask) * hps.train.c_kl
-
-                loss_fm = feature_loss(fmap_r, fmap_g)
-                loss_gen, losses_gen = generator_loss(y_d_hat_g)
-
-                if hps.model.mb_istft_vits == True:
-                    pqmf = PQMF(y.device)
-                    y_mb = pqmf.analysis(y)
-                    loss_subband = subband_stft_loss(hps, y_mb, y_hat_mb)
-                else:
-                    loss_subband = torch.tensor(0.0)
-
-                loss_gen_all = loss_gen + loss_fm + loss_mel + loss_dur + loss_kl + loss_subband
-                if net_dur_disc is not None:
-                    loss_dur_gen, losses_dur_gen = generator_loss(y_dur_hat_g)
-                    loss_gen_all += loss_dur_gen
-
-        optim_g.zero_grad()
-        scaler.scale(loss_gen_all).backward()
-        scaler.unscale_(optim_g)
-        grad_norm_g = commons.clip_grad_value_(net_g.parameters(), None)
-        scaler.step(optim_g)
-        scaler.update()
-
-        if rank == 0:
-            if global_step % hps.train.log_interval == 0:
-                lr = optim_g.param_groups[0]['lr']
-                losses = [loss_disc, loss_gen, loss_fm, loss_mel, loss_dur, loss_kl, loss_subband]
-                logger.info('Train Epoch: {} [{:.0f}%]'.format(
-                    epoch,
-                    100. * batch_idx / len(train_loader)))
-                logger.info([x.item() for x in losses] + [global_step, lr])
-
-                scalar_dict = {"loss/g/total": loss_gen_all, "loss/d/total": loss_disc_all, "learning_rate": lr,
-                               "grad_norm_d": grad_norm_d, "grad_norm_g": grad_norm_g}
-                if net_dur_disc is not None:
-                    scalar_dict.update(
-                        {"loss/dur_disc/total": loss_dur_disc_all, "grad_norm_dur_disc": grad_norm_dur_disc})
-                scalar_dict.update(
-                    {"loss/g/fm": loss_fm, "loss/g/mel": loss_mel, "loss/g/dur": loss_dur, "loss/g/kl": loss_kl,
-                     "loss/g/subband": loss_subband})
-
-                scalar_dict.update({"loss/g/{}".format(i): v for i, v in enumerate(losses_gen)})
-                scalar_dict.update({"loss/d_r/{}".format(i): v for i, v in enumerate(losses_disc_r)})
-                scalar_dict.update({"loss/d_g/{}".format(i): v for i, v in enumerate(losses_disc_g)})
-
-                # if net_dur_disc is not None:
-                #   scalar_dict.update({"loss/dur_disc_r" : f"{losses_dur_disc_r}"})
-                #   scalar_dict.update({"loss/dur_disc_g" : f"{losses_dur_disc_g}"})
-                #   scalar_dict.update({"loss/dur_gen" : f"{loss_dur_gen}"})
-
-                image_dict = {
-                    "slice/mel_org": utils.plot_spectrogram_to_numpy(y_mel[0].data.cpu().numpy()),
-                    "slice/mel_gen": utils.plot_spectrogram_to_numpy(y_hat_mel[0].data.cpu().numpy()),
-                    "all/mel": utils.plot_spectrogram_to_numpy(mel[0].data.cpu().numpy()),
-                    "all/attn": utils.plot_alignment_to_numpy(attn[0, 0].data.cpu().numpy())
-                }
-                utils.summarize(
-                    writer=writer,
-                    global_step=global_step,
-                    images=image_dict,
-                    scalars=scalar_dict)
-
-            if global_step % hps.train.eval_interval == 0:
-                evaluate(hps, net_g, eval_loader, writer_eval)
-                utils.save_checkpoint(net_g, optim_g, hps.train.learning_rate, epoch,
-                                      os.path.join(hps.model_dir, "G_{}.pth".format(global_step)))
-                utils.save_checkpoint(net_d, optim_d, hps.train.learning_rate, epoch,
-                                      os.path.join(hps.model_dir, "D_{}.pth".format(global_step)))
-                if net_dur_disc is not None:
-                    utils.save_checkpoint(net_dur_disc, optim_dur_disc, hps.train.learning_rate, epoch,
-                                          os.path.join(hps.model_dir, "DUR_{}.pth".format(global_step)))
-        global_step += 1
-
-    if rank == 0:
-        logger.info('====> Epoch: {}'.format(epoch))
-
-
-def evaluate(hps, generator, eval_loader, writer_eval):
-    generator.eval()
-    with torch.no_grad():
-        for batch_idx, (x, x_lengths, spec, spec_lengths, y, y_lengths, speakers) in enumerate(eval_loader):
-            x, x_lengths = x.cuda(0), x_lengths.cuda(0)
-            spec, spec_lengths = spec.cuda(0), spec_lengths.cuda(0)
-            y, y_lengths = y.cuda(0), y_lengths.cuda(0)
-            speakers = speakers.cuda(0)
-
-            # remove else
-            x = x[:1]
-            x_lengths = x_lengths[:1]
-            spec = spec[:1]
-            spec_lengths = spec_lengths[:1]
-            y = y[:1]
-            y_lengths = y_lengths[:1]
-            speakers = speakers[:1]
-            break
-        y_hat, y_hat_mb, attn, mask, *_ = generator.module.infer(x, x_lengths, speakers, max_len=1000)
-        y_hat_lengths = mask.sum([1, 2]).long() * hps.data.hop_length
-
-        if hps.model.use_mel_posterior_encoder or hps.data.use_mel_posterior_encoder:
-            mel = spec
-        else:
-            mel = spec_to_mel_torch(
-                spec,
-                hps.data.filter_length,
-                hps.data.n_mel_channels,
-                hps.data.sampling_rate,
-                hps.data.mel_fmin,
-                hps.data.mel_fmax)
-        y_hat_mel = mel_spectrogram_torch(
-            y_hat.squeeze(1).float(),
-            hps.data.filter_length,
-            hps.data.n_mel_channels,
-            hps.data.sampling_rate,
-            hps.data.hop_length,
-            hps.data.win_length,
-            hps.data.mel_fmin,
-            hps.data.mel_fmax
-        )
-    image_dict = {
-        "gen/mel": utils.plot_spectrogram_to_numpy(y_hat_mel[0].cpu().numpy())
-    }
-    audio_dict = {
-        "gen/audio": y_hat[0, :, :y_hat_lengths[0]]
-    }
-    if global_step == 0:
-        image_dict.update({"gt/mel": utils.plot_spectrogram_to_numpy(mel[0].cpu().numpy())})
-        audio_dict.update({"gt/audio": y[0, :, :y_lengths[0]]})
-
-    utils.summarize(
-        writer=writer_eval,
-        global_step=global_step,
-        images=image_dict,
-        audios=audio_dict,
-        audio_sampling_rate=hps.data.sampling_rate
-    )
-    generator.train()
-
-
-if __name__ == "__main__":
-    os.environ["TORCH_DISTRIBUTED_DEBUG"] = "DETAIL"
-    main()
diff --git a/spaces/kevinwang676/VoiceChangers/src/face3d/models/arcface_torch/backbones/__init__.py b/spaces/kevinwang676/VoiceChangers/src/face3d/models/arcface_torch/backbones/__init__.py
deleted file mode 100644
index 55bd4c5d1889a1a998b52eb56793bbc1eef1b691..0000000000000000000000000000000000000000
--- a/spaces/kevinwang676/VoiceChangers/src/face3d/models/arcface_torch/backbones/__init__.py
+++ /dev/null
@@ -1,25 +0,0 @@
-from .iresnet import iresnet18, iresnet34, iresnet50, iresnet100, iresnet200
-from .mobilefacenet import get_mbf
-
-
-def get_model(name, **kwargs):
-    # resnet
-    if name == "r18":
-        return iresnet18(False, **kwargs)
-    elif name == "r34":
-        return iresnet34(False, **kwargs)
-    elif name == "r50":
-        return iresnet50(False, **kwargs)
-    elif name == "r100":
-        return iresnet100(False, **kwargs)
-    elif name == "r200":
-        return iresnet200(False, **kwargs)
-    elif name == "r2060":
-        from .iresnet2060 import iresnet2060
-        return iresnet2060(False, **kwargs)
-    elif name == "mbf":
-        fp16 = kwargs.get("fp16", False)
-        num_features = kwargs.get("num_features", 512)
-        return get_mbf(fp16=fp16, num_features=num_features)
-    else:
-        raise ValueError()
\ No newline at end of file
diff --git a/spaces/kinensake/quanquan/lm_scorer/models/abc/transformers.py b/spaces/kinensake/quanquan/lm_scorer/models/abc/transformers.py
deleted file mode 100644
index 8b80867d80f632474e33c686337e3faf8752fe1a..0000000000000000000000000000000000000000
--- a/spaces/kinensake/quanquan/lm_scorer/models/abc/transformers.py
+++ /dev/null
@@ -1,16 +0,0 @@
-# pylint: disable=abstract-method
-from typing import *  # pylint: disable=wildcard-import,unused-wildcard-import
-
-import os
-
-from .batch import BatchedLMScorer
-
-
-class TransformersLMScorer(BatchedLMScorer):
-    # @overrides
-    def _build(self, model_name: str, options: Dict[str, Any]) -> None:
-        super()._build(model_name, options)
-
-        #  Make transformers cache path configurable.
-        cache_dir = os.environ.get("TRANSFORMERS_CACHE_DIR", ".transformers_cache")
-        options["cache_dir"] = options.get("cache_dir", cache_dir)
diff --git a/spaces/konverner/deep-voice-cloning/build/lib/deep_voice_cloning/data/dataset.py b/spaces/konverner/deep-voice-cloning/build/lib/deep_voice_cloning/data/dataset.py
deleted file mode 100644
index 539ea1e1de4def356df30ad53707b384590c5a5c..0000000000000000000000000000000000000000
--- a/spaces/konverner/deep-voice-cloning/build/lib/deep_voice_cloning/data/dataset.py
+++ /dev/null
@@ -1,63 +0,0 @@
-from typing import Dict, Any
-
-import torch
-import librosa
-import numpy as np
-from datasets import Dataset
-
-from ..cloning.model import CloningModel
-from ..transcriber.model import TranscriberModel
-
-
-def prepare_dataset(example: Dict[str, Any], model: CloningModel) -> Dict[str, Any]:
-    """
-    Prepare a single example for training
-    """
-    # feature extraction and tokenization
-    processed_example = model.processor(
-        text=example["normalized_text"],
-        audio_target=example["audio"]["array"],
-        sampling_rate=16000,
-        return_attention_mask=False,
-    )
-
-    # strip off the batch dimension
-    if len(torch.tensor(processed_example['input_ids']).shape) > 1:
-        processed_example['input_ids'] = processed_example['input_ids'][0]
-
-    processed_example["labels"] = processed_example["labels"][0]
-
-    # use SpeechBrain to obtain x-vector
-    processed_example["speaker_embeddings"] = model.create_speaker_embedding(
-        torch.tensor(example["audio"]["array"])
-    ).numpy()
-
-    return processed_example
-
-
-def get_cloning_dataset(input_audio_path: str,
-                        transcriber_model: TranscriberModel,
-                        cloning_model: CloningModel,
-                        sampling_rate: int = 16000,
-                        window_size_secs: int = 5) -> Dataset:
-    """
-    Create dataset by transcribing an audio file using a pretrained Wav2Vec2 model.
-    """
-    speech_array, _ = librosa.load(input_audio_path, sr=sampling_rate)
-
-    # split a waveform into splits of 5 secs each
-    speech_arrays = np.split(speech_array, range(0, len(speech_array), window_size_secs * sampling_rate))[1:]
-    texts = [transcriber_model.forward(speech_array, sampling_rate=sampling_rate)
-             for speech_array in speech_arrays]
-
-    dataset = Dataset.from_list([
-        {'audio': {'array': speech_arrays[i]}, 'normalized_text': texts[i]}
-        for i in range(len(speech_arrays))]
-    )
-
-    dataset = dataset.map(
-        prepare_dataset, fn_kwargs={'model': cloning_model},
-        remove_columns=dataset.column_names,
-    )
-
-    return dataset
diff --git a/spaces/konverner/deep-voice-cloning/src/deep_voice_cloning/data/collator.py b/spaces/konverner/deep-voice-cloning/src/deep_voice_cloning/data/collator.py
deleted file mode 100644
index b6f99e1869b8c63f4d88be93b59b439fda833590..0000000000000000000000000000000000000000
--- a/spaces/konverner/deep-voice-cloning/src/deep_voice_cloning/data/collator.py
+++ /dev/null
@@ -1,45 +0,0 @@
-import torch
-from typing import Any, Dict, List, Union
-
-
-class TTSDataCollatorWithPadding:
-
-    def __init__(self, model, processor):
-        self.model = model
-        self.processor = processor
-
-    def __call__(self, features: List[Dict[str, Union[List[int], torch.Tensor]]]) -> Dict[str, torch.Tensor]:
-        input_ids = [{"input_ids": feature["input_ids"]} for feature in features]
-        label_features = [{"input_values": feature["labels"]} for feature in features]
-        speaker_features = [feature["speaker_embeddings"] for feature in features]
-
-        # collate the inputs and targets into a batch
-        batch = self.processor.pad(
-            input_ids=input_ids,
-            labels=label_features,
-            return_tensors="pt",
-        )
-
-        # replace padding with -100 to ignore loss correctly
-        batch["labels"] = batch["labels"].masked_fill(
-            batch.decoder_attention_mask.unsqueeze(-1).ne(1), -100
-        )
-
-        # not used during fine-tuning
-        del batch["decoder_attention_mask"]
-
-        # round down target lengths to multiple of reduction factor
-        if self.model.config.reduction_factor > 1:
-            target_lengths = torch.tensor([
-                len(feature["input_values"]) for feature in label_features
-            ])
-            target_lengths = target_lengths.new([
-                length - length % self.model.config.reduction_factor for length in target_lengths
-            ])
-            max_length = max(target_lengths)
-            batch["labels"] = batch["labels"][:, :max_length]
-
-        # add the speaker embeddings
-        batch["speaker_embeddings"] = torch.tensor(speaker_features)
-
-        return batch
diff --git a/spaces/kornia/line-segment-matching/README.md b/spaces/kornia/line-segment-matching/README.md
deleted file mode 100644
index 5506129225e29c0b422b592806b18d9b6cbe7f9f..0000000000000000000000000000000000000000
--- a/spaces/kornia/line-segment-matching/README.md
+++ /dev/null
@@ -1,13 +0,0 @@
----
-title: Line Segment Matching
-emoji: 📈
-colorFrom: indigo
-colorTo: pink
-sdk: gradio
-sdk_version: 3.3
-app_file: app.py
-pinned: false
-license: apache-2.0
----
-
-Check out the configuration reference at https://huggingface.co/docs/hub/spaces-config-reference
diff --git a/spaces/leave7/kazunaAI2.0/vdecoder/hifigan/utils.py b/spaces/leave7/kazunaAI2.0/vdecoder/hifigan/utils.py
deleted file mode 100644
index 84bff024f4d2e2de194b2a88ee7bbe5f0d33f67c..0000000000000000000000000000000000000000
--- a/spaces/leave7/kazunaAI2.0/vdecoder/hifigan/utils.py
+++ /dev/null
@@ -1,68 +0,0 @@
-import glob
-import os
-import matplotlib
-import torch
-from torch.nn.utils import weight_norm
-matplotlib.use("Agg")
-import matplotlib.pylab as plt
-
-
-def plot_spectrogram(spectrogram):
-    fig, ax = plt.subplots(figsize=(10, 2))
-    im = ax.imshow(spectrogram, aspect="auto", origin="lower",
-                   interpolation='none')
-    plt.colorbar(im, ax=ax)
-
-    fig.canvas.draw()
-    plt.close()
-
-    return fig
-
-
-def init_weights(m, mean=0.0, std=0.01):
-    classname = m.__class__.__name__
-    if classname.find("Conv") != -1:
-        m.weight.data.normal_(mean, std)
-
-
-def apply_weight_norm(m):
-    classname = m.__class__.__name__
-    if classname.find("Conv") != -1:
-        weight_norm(m)
-
-
-def get_padding(kernel_size, dilation=1):
-    return int((kernel_size*dilation - dilation)/2)
-
-
-def load_checkpoint(filepath, device):
-    assert os.path.isfile(filepath)
-    print("Loading '{}'".format(filepath))
-    checkpoint_dict = torch.load(filepath, map_location=device)
-    print("Complete.")
-    return checkpoint_dict
-
-
-def save_checkpoint(filepath, obj):
-    print("Saving checkpoint to {}".format(filepath))
-    torch.save(obj, filepath)
-    print("Complete.")
-
-
-def del_old_checkpoints(cp_dir, prefix, n_models=2):
-    pattern = os.path.join(cp_dir, prefix + '????????')
-    cp_list = glob.glob(pattern) # get checkpoint paths
-    cp_list = sorted(cp_list)# sort by iter
-    if len(cp_list) > n_models: # if more than n_models models are found
-        for cp in cp_list[:-n_models]:# delete the oldest models other than lastest n_models
-            open(cp, 'w').close()# empty file contents
-            os.unlink(cp)# delete file (move to trash when using Colab)
-
-
-def scan_checkpoint(cp_dir, prefix):
-    pattern = os.path.join(cp_dir, prefix + '????????')
-    cp_list = glob.glob(pattern)
-    if len(cp_list) == 0:
-        return None
-    return sorted(cp_list)[-1]
-
diff --git a/spaces/lewiswu1209/MockingBird/ppg_extractor/encoder/embedding.py b/spaces/lewiswu1209/MockingBird/ppg_extractor/encoder/embedding.py
deleted file mode 100644
index fa3199cf7e3da2ed834d4781b694cf4ccb2a433c..0000000000000000000000000000000000000000
--- a/spaces/lewiswu1209/MockingBird/ppg_extractor/encoder/embedding.py
+++ /dev/null
@@ -1,166 +0,0 @@
-#!/usr/bin/env python3
-# -*- coding: utf-8 -*-
-
-# Copyright 2019 Shigeki Karita
-#  Apache 2.0  (http://www.apache.org/licenses/LICENSE-2.0)
-
-"""Positonal Encoding Module."""
-
-import math
-
-import torch
-
-
-def _pre_hook(
-    state_dict,
-    prefix,
-    local_metadata,
-    strict,
-    missing_keys,
-    unexpected_keys,
-    error_msgs,
-):
-    """Perform pre-hook in load_state_dict for backward compatibility.
-
-    Note:
-        We saved self.pe until v.0.5.2 but we have omitted it later.
-        Therefore, we remove the item "pe" from `state_dict` for backward compatibility.
-
-    """
-    k = prefix + "pe"
-    if k in state_dict:
-        state_dict.pop(k)
-
-
-class PositionalEncoding(torch.nn.Module):
-    """Positional encoding.
-
-    :param int d_model: embedding dim
-    :param float dropout_rate: dropout rate
-    :param int max_len: maximum input length
-    :param reverse: whether to reverse the input position
-
-    """
-
-    def __init__(self, d_model, dropout_rate, max_len=5000, reverse=False):
-        """Construct an PositionalEncoding object."""
-        super(PositionalEncoding, self).__init__()
-        self.d_model = d_model
-        self.reverse = reverse
-        self.xscale = math.sqrt(self.d_model)
-        self.dropout = torch.nn.Dropout(p=dropout_rate)
-        self.pe = None
-        self.extend_pe(torch.tensor(0.0).expand(1, max_len))
-        self._register_load_state_dict_pre_hook(_pre_hook)
-
-    def extend_pe(self, x):
-        """Reset the positional encodings."""
-        if self.pe is not None:
-            if self.pe.size(1) >= x.size(1):
-                if self.pe.dtype != x.dtype or self.pe.device != x.device:
-                    self.pe = self.pe.to(dtype=x.dtype, device=x.device)
-                return
-        pe = torch.zeros(x.size(1), self.d_model)
-        if self.reverse:
-            position = torch.arange(
-                x.size(1) - 1, -1, -1.0, dtype=torch.float32
-            ).unsqueeze(1)
-        else:
-            position = torch.arange(0, x.size(1), dtype=torch.float32).unsqueeze(1)
-        div_term = torch.exp(
-            torch.arange(0, self.d_model, 2, dtype=torch.float32)
-            * -(math.log(10000.0) / self.d_model)
-        )
-        pe[:, 0::2] = torch.sin(position * div_term)
-        pe[:, 1::2] = torch.cos(position * div_term)
-        pe = pe.unsqueeze(0)
-        self.pe = pe.to(device=x.device, dtype=x.dtype)
-
-    def forward(self, x: torch.Tensor):
-        """Add positional encoding.
-
-        Args:
-            x (torch.Tensor): Input. Its shape is (batch, time, ...)
-
-        Returns:
-            torch.Tensor: Encoded tensor. Its shape is (batch, time, ...)
-
-        """
-        self.extend_pe(x)
-        x = x * self.xscale + self.pe[:, : x.size(1)]
-        return self.dropout(x)
-
-
-class ScaledPositionalEncoding(PositionalEncoding):
-    """Scaled positional encoding module.
-
-    See also: Sec. 3.2  https://arxiv.org/pdf/1809.08895.pdf
-
-    """
-
-    def __init__(self, d_model, dropout_rate, max_len=5000):
-        """Initialize class.
-
-        :param int d_model: embedding dim
-        :param float dropout_rate: dropout rate
-        :param int max_len: maximum input length
-
-        """
-        super().__init__(d_model=d_model, dropout_rate=dropout_rate, max_len=max_len)
-        self.alpha = torch.nn.Parameter(torch.tensor(1.0))
-
-    def reset_parameters(self):
-        """Reset parameters."""
-        self.alpha.data = torch.tensor(1.0)
-
-    def forward(self, x):
-        """Add positional encoding.
-
-        Args:
-            x (torch.Tensor): Input. Its shape is (batch, time, ...)
-
-        Returns:
-            torch.Tensor: Encoded tensor. Its shape is (batch, time, ...)
-
-        """
-        self.extend_pe(x)
-        x = x + self.alpha * self.pe[:, : x.size(1)]
-        return self.dropout(x)
-
-
-class RelPositionalEncoding(PositionalEncoding):
-    """Relitive positional encoding module.
-
-    See : Appendix B in https://arxiv.org/abs/1901.02860
-
-    :param int d_model: embedding dim
-    :param float dropout_rate: dropout rate
-    :param int max_len: maximum input length
-
-    """
-
-    def __init__(self, d_model, dropout_rate, max_len=5000):
-        """Initialize class.
-
-        :param int d_model: embedding dim
-        :param float dropout_rate: dropout rate
-        :param int max_len: maximum input length
-
-        """
-        super().__init__(d_model, dropout_rate, max_len, reverse=True)
-
-    def forward(self, x):
-        """Compute positional encoding.
-
-        Args:
-            x (torch.Tensor): Input. Its shape is (batch, time, ...)
-
-        Returns:
-            torch.Tensor: x. Its shape is (batch, time, ...)
-            torch.Tensor: pos_emb. Its shape is (1, time, ...)
-
-        """
-        self.extend_pe(x)
-        x = x * self.xscale
-        pos_emb = self.pe[:, : x.size(1)]
-        return self.dropout(x), self.dropout(pos_emb)
diff --git a/spaces/lincquiQcaudo/Top-20-Diffusion/Cabri 3d Download [EXCLUSIVE] Crack 28.md b/spaces/lincquiQcaudo/Top-20-Diffusion/Cabri 3d Download [EXCLUSIVE] Crack 28.md
deleted file mode 100644
index 79852209ae22607096d81dbf4a90403c84e5d13a..0000000000000000000000000000000000000000
--- a/spaces/lincquiQcaudo/Top-20-Diffusion/Cabri 3d Download [EXCLUSIVE] Crack 28.md	
+++ /dev/null
@@ -1,17 +0,0 @@
-
-<h1>How to Download Cabri 3D for Free</h1>
-<p>Cabri 3D is a powerful and interactive software that allows you to explore and learn geometry in three dimensions. With Cabri 3D, you can create and manipulate geometric shapes, measure angles and distances, animate constructions, and discover properties and theorems. Cabri 3D is a great tool for students, teachers, and anyone who loves math and science.</p>
-<h2>Cabri 3d Download Crack 28</h2><br /><p><b><b>DOWNLOAD</b> ->>> <a href="https://bytlly.com/2uGxQz">https://bytlly.com/2uGxQz</a></b></p><br /><br />
-<p>However, Cabri 3D is not a free software. You need to purchase a license to use it on your computer. The official website of Cabri 3D offers different options for buying the software, ranging from 25€ to 160€ depending on the duration and the number of devices. If you want to try Cabri 3D before buying it, you can download a free one-month trial from the website.</p>
-<p>But what if you want to use Cabri 3D for free without paying anything? Is there a way to download a cracked version of Cabri 3D that bypasses the license verification? The answer is yes, but it is not recommended. Downloading a cracked version of Cabri 3D is illegal, unethical, and risky. You may face legal consequences for violating the intellectual property rights of the software developer. You may also expose your computer to viruses, malware, or spyware that can harm your system or steal your personal information.</p>
-<p>Therefore, we advise you not to download Cabri 3D from any unofficial or suspicious sources that claim to offer a cracked version of the software. These sources are not trustworthy and may contain malicious files or links that can damage your computer or compromise your security. Instead, we suggest you to use Cabri 3D legally and safely by purchasing a license from the official website or downloading a free trial version.</p>
-<p>If you are looking for a reliable and reputable source to download Cabri 3D, you can visit the official website of Cabri 3D at https://cabri.com/en/enterprise/cabri-3d/index.html[^4^]. There you can find more information about the features, benefits, and prices of Cabri 3D. You can also download a free one-month trial version for PC or Mac by clicking on the buttons under "Download a free trial".</p>
-<p>Cabri 3D is a wonderful software that can help you learn and enjoy geometry in three dimensions. It is worth paying for it if you want to use it for a long time. However, if you are curious about it and want to try it for free, you can download a free trial version from the official website. But please do not download a cracked version of Cabri 3D from any unauthorized or dubious sources. It is illegal, immoral, and dangerous.</p>
-<p></p>
-
-<p>In this article, we will compare Cabri 3D with another software from the same developer, Cabri II Plus. Cabri II Plus is a dynamic geometry software that allows you to create and explore geometric constructions in two dimensions. Cabri II Plus is similar to Cabri 3D in terms of interface, functionality, and pedagogy, but it focuses on plane geometry rather than spatial geometry.</p>
-<p>Both Cabri 3D and Cabri II Plus are designed to help students and teachers learn and teach geometry in a fun and interactive way. They offer a variety of tools and features that enable users to create and manipulate geometric objects, measure angles and lengths, animate constructions, and discover properties and theorems. They also allow users to export their work as images, videos, or web pages.</p>
-<p>However, there are some differences between Cabri 3D and Cabri II Plus that may affect your choice depending on your needs and preferences. Cabri 3D is more advanced and complex than Cabri II Plus, as it deals with three-dimensional geometry rather than two-dimensional geometry. Cabri 3D requires more computational power and graphical capabilities than Cabri II Plus, as it uses OpenGL technology to render 3D graphics. Cabri 3D is also more expensive than Cabri II Plus, as it costs 75€ for an unlimited license, while Cabri II Plus costs 49€ for an unlimited license.</p>
-<p>Therefore, if you are looking for a simple and affordable software that can help you learn and teach plane geometry, you may prefer Cabri II Plus over Cabri 3D. However, if you are looking for a powerful and innovative software that can help you explore and understand spatial geometry, you may choose Cabri 3D over Cabri II Plus. Alternatively, you can buy both software as a special pack that costs 160€ for an unlimited license.</p> d5da3c52bf<br />
-<br />
-<br />
\ No newline at end of file
diff --git a/spaces/lincquiQcaudo/Top-20-Diffusion/Filmes Dublados Van Helsing 2 _BEST_ Download 18.md b/spaces/lincquiQcaudo/Top-20-Diffusion/Filmes Dublados Van Helsing 2 _BEST_ Download 18.md
deleted file mode 100644
index 44c300a570e931c2fb9a957c46116077fcd26db4..0000000000000000000000000000000000000000
--- a/spaces/lincquiQcaudo/Top-20-Diffusion/Filmes Dublados Van Helsing 2 _BEST_ Download 18.md	
+++ /dev/null
@@ -1,14 +0,0 @@
-<h2>Filmes Dublados Van Helsing 2 Download 18</h2><br /><p><b><b>Download Zip</b> &#9658;&#9658;&#9658; <a href="https://bytlly.com/2uGxEf">https://bytlly.com/2uGxEf</a></b></p><br /><br />
-<br />
-A nova biografia deu conta que Van Helsing foi responsável por providenciar vacinas para elétrico, por causar doenças nas populações habitantes, garantindo a segurança de vidas.
-
-Também foi responsável por inventar um filtro de proteção para a ducha, projetado por ser semelhante ao que os espiões utilizavam na escuridão de outras épocas. Com a presença de Renfield, escritor de diversas besteiras, a experiência do personagem é através da audição de vozes intelectuais que querem determinar o futuro do personagem, a fim de que ele não seja um ótimo personagem para o próximo livro.
-
-Vampiro: O Quarto Geraldo Dantas (Luís Filipe Silva) é um dos chefes das asas negras que conduzem os arautos que se opõem ao mundo livre. Enquanto que os grupos humanos, tornam-se um contraponto às raças negras.
-
-Já com a presença de Geraldo, de uma pessoa que chega ao mundo sem meio, que enfrenta a solidão e põe por enquanto em prática sua arte que é a lenda das besteiras, os humanos e os grupos que eles formam, já estão unidos, tornando-se forças nacionais.
-
-Vampiro: Memórias da Escuridão (Rafael Coelho) é o início da história dos vampiros. Contando a história de um homem que vive um dia onde os vampiros passam a habitar a cidade. Através do relato de personagens de outros livros,  estamos a conhecer outros protagonistas da história do universo dos vampiros. 4fefd39f24<br />
-<br />
-<br />
-<p></p>
diff --git a/spaces/lincquiQcaudo/Top-20-Diffusion/Intothebadlandsseason11080p.md b/spaces/lincquiQcaudo/Top-20-Diffusion/Intothebadlandsseason11080p.md
deleted file mode 100644
index 3b7f9a40d77ca2f1f0c461a4cae2bec97d9a92f3..0000000000000000000000000000000000000000
--- a/spaces/lincquiQcaudo/Top-20-Diffusion/Intothebadlandsseason11080p.md
+++ /dev/null
@@ -1,9 +0,0 @@
-<br />
-<p>sxv.pl/2020/intothebadlandsseason11080p.htmlhttps://sxv.pl/2020/3097147-2021-ana-karenjina-film-sa-prevodom-na-srpski-681x.pdfhttps://nibud.com/sharfan.pdflandmarks 2019-10-10 intothebadlandsseason11080p full hd 720p xbmc </p>
-<h2>intothebadlandsseason11080p</h2><br /><p><b><b>DOWNLOAD</b> &middot;&middot;&middot;&middot;&middot; <a href="https://bytlly.com/2uGvtA">https://bytlly.com/2uGvtA</a></b></p><br /><br />
-<p>MovieCrunch - Movies, TV Shows, Episodes, Movies 2018. 2018. intothebadlandsseason11080p 720p hi def 1080p download porn to mp4 kinohimaya dvd file download intothebadlandsseason11080p download torrent intothebadlandsseason11080p watchers guide 2018. </p>
-<p>https://somewherearoundthis.wikidot.com/blog:307 intothebadlandsseason11080p.htmlhttp://21stwallpaper.com/2020/02/14/vinyl-movie-double-dutch-the-80s-1080p-webnizkultur-c-539/download-film-eating.htmlhttp://vf.onravna.com/2019/05/intothebadlandsseason11080p/http://www.gamersbase.com/2019/05/17/sakhibin-intothebadlandsseason11080p/http://204.245.71.123/intothebadlandsseason11080p-jmz.rar-1intothebadlandsseason11080p.htmlhttp://www.uploadmb.com/2019/07/movie-rage-intothebadlandsseason11080p.htmlhttps://uploadmb.com/2020/02/06/intothebadlandsseason11080p.rarhttp://www.letsee.no/2019/05/intothebadlandsseason11080p/http://www.sambol.com/tag/intothebadlandsseason11080p/http://198.125.53.130/intothebadlandsseason11080p/filmdownload.htmlhttp://dantobi.net/video/set-10-intothebadlandsseason11080p.html </p>
-<p>https://somewherearoundthis.wikidot.com/blog:307 intothebadlandsseason11080p.htmlhttps://uploadmb.com/2020/02/06/intothebadlandsseason11080p.rarhttp://www.letsee.no/2019/05/intothebadlandsseason11080p/http://www.sambol.com/tag/intothebadlandsseason11080p/http://198.125.53.130/intothebadlandsseason11080p/filmdownload.htmlhttp://dantobi.net/video/set-10-intothebadlandsseason11080p.html </p>
-<p></p> 899543212b<br />
-<br />
-<br />
\ No newline at end of file
diff --git a/spaces/liuzq/free-creation/app.py b/spaces/liuzq/free-creation/app.py
deleted file mode 100644
index e0c24e25ace35a4a99718f1535e255a3fe09bb65..0000000000000000000000000000000000000000
--- a/spaces/liuzq/free-creation/app.py
+++ /dev/null
@@ -1,62 +0,0 @@
-import os
-import gradio as gr
-import openai
-
-openai.api_key = os.environ.get("OPENAI_API_KEY")
-
-
-class Conversation:
-
-    def __init__(self, prompt123, num_of_round):
-        self.prompt = prompt123
-        self.num_of_round = num_of_round
-        self.messages = []
-        self.messages.append({"role": "system", "content": self.prompt})
-
-    def ask(self, question):
-        try:
-            self.messages.append({"role": "user", "content": question})
-            response = openai.ChatCompletion.create(
-                model="gpt-3.5-turbo",
-                messages=self.messages,
-                temperature=0.5,
-                max_tokens=2048,
-                top_p=1,
-            )
-        except Exception as e:
-            print(e)
-            return e
-
-        message = response["choices"][0]["message"]["content"]
-        self.messages.append({"role": "assistant", "content": message})
-
-        if len(self.messages) > self.num_of_round * 2+1:
-            del self.messages[1:3]
-        return message
-
-
-prompt = """你是一个中国厨师，用中文回答做菜的问题。你的回答需要满足以下要求:
-1. 你的回答必须是中文
-2. 回答限制在100个字以内"""
-
-conv = Conversation(prompt, 1)
-
-
-def answer(question, history=[]):
-    history.append(question)
-    response = conv.ask(question)
-    history.append(response)
-    responses = [(u, b) for u, b in zip(history[::2], history[1::2])]
-    return responses, history
-
-
-with gr.Blocks(css="#chatbot{height:300px} .overflow-y-auto{height:500px}") as demo:
-    chatBot = gr.Chatbot(elem_id="chatbot")
-    state = gr.State([])
-
-    with gr.Row():
-        txt = gr.Textbox(show_label=False, placeholder="Enter text and press enter").style(container=False)
-
-    txt.submit(answer, [txt, state], [chatBot, state])
-
-demo.launch()
diff --git a/spaces/lwchen/CodeFormer/CodeFormer/basicsr/utils/logger.py b/spaces/lwchen/CodeFormer/CodeFormer/basicsr/utils/logger.py
deleted file mode 100644
index 9714bf59c30fc82de24c1ee58d9118d0864b3572..0000000000000000000000000000000000000000
--- a/spaces/lwchen/CodeFormer/CodeFormer/basicsr/utils/logger.py
+++ /dev/null
@@ -1,169 +0,0 @@
-import datetime
-import logging
-import time
-
-from .dist_util import get_dist_info, master_only
-
-initialized_logger = {}
-
-
-class MessageLogger():
-    """Message logger for printing.
-    Args:
-        opt (dict): Config. It contains the following keys:
-            name (str): Exp name.
-            logger (dict): Contains 'print_freq' (str) for logger interval.
-            train (dict): Contains 'total_iter' (int) for total iters.
-            use_tb_logger (bool): Use tensorboard logger.
-        start_iter (int): Start iter. Default: 1.
-        tb_logger (obj:`tb_logger`): Tensorboard logger. Default： None.
-    """
-
-    def __init__(self, opt, start_iter=1, tb_logger=None):
-        self.exp_name = opt['name']
-        self.interval = opt['logger']['print_freq']
-        self.start_iter = start_iter
-        self.max_iters = opt['train']['total_iter']
-        self.use_tb_logger = opt['logger']['use_tb_logger']
-        self.tb_logger = tb_logger
-        self.start_time = time.time()
-        self.logger = get_root_logger()
-
-    @master_only
-    def __call__(self, log_vars):
-        """Format logging message.
-        Args:
-            log_vars (dict): It contains the following keys:
-                epoch (int): Epoch number.
-                iter (int): Current iter.
-                lrs (list): List for learning rates.
-                time (float): Iter time.
-                data_time (float): Data time for each iter.
-        """
-        # epoch, iter, learning rates
-        epoch = log_vars.pop('epoch')
-        current_iter = log_vars.pop('iter')
-        lrs = log_vars.pop('lrs')
-
-        message = (f'[{self.exp_name[:5]}..][epoch:{epoch:3d}, ' f'iter:{current_iter:8,d}, lr:(')
-        for v in lrs:
-            message += f'{v:.3e},'
-        message += ')] '
-
-        # time and estimated time
-        if 'time' in log_vars.keys():
-            iter_time = log_vars.pop('time')
-            data_time = log_vars.pop('data_time')
-
-            total_time = time.time() - self.start_time
-            time_sec_avg = total_time / (current_iter - self.start_iter + 1)
-            eta_sec = time_sec_avg * (self.max_iters - current_iter - 1)
-            eta_str = str(datetime.timedelta(seconds=int(eta_sec)))
-            message += f'[eta: {eta_str}, '
-            message += f'time (data): {iter_time:.3f} ({data_time:.3f})] '
-
-        # other items, especially losses
-        for k, v in log_vars.items():
-            message += f'{k}: {v:.4e} '
-            # tensorboard logger
-            if self.use_tb_logger:
-                if k.startswith('l_'):
-                    self.tb_logger.add_scalar(f'losses/{k}', v, current_iter)
-                else:
-                    self.tb_logger.add_scalar(k, v, current_iter)
-        self.logger.info(message)
-
-
-@master_only
-def init_tb_logger(log_dir):
-    from torch.utils.tensorboard import SummaryWriter
-    tb_logger = SummaryWriter(log_dir=log_dir)
-    return tb_logger
-
-
-@master_only
-def init_wandb_logger(opt):
-    """We now only use wandb to sync tensorboard log."""
-    import wandb
-    logger = logging.getLogger('basicsr')
-
-    project = opt['logger']['wandb']['project']
-    resume_id = opt['logger']['wandb'].get('resume_id')
-    if resume_id:
-        wandb_id = resume_id
-        resume = 'allow'
-        logger.warning(f'Resume wandb logger with id={wandb_id}.')
-    else:
-        wandb_id = wandb.util.generate_id()
-        resume = 'never'
-
-    wandb.init(id=wandb_id, resume=resume, name=opt['name'], config=opt, project=project, sync_tensorboard=True)
-
-    logger.info(f'Use wandb logger with id={wandb_id}; project={project}.')
-
-
-def get_root_logger(logger_name='basicsr', log_level=logging.INFO, log_file=None):
-    """Get the root logger.
-    The logger will be initialized if it has not been initialized. By default a
-    StreamHandler will be added. If `log_file` is specified, a FileHandler will
-    also be added.
-    Args:
-        logger_name (str): root logger name. Default: 'basicsr'.
-        log_file (str | None): The log filename. If specified, a FileHandler
-            will be added to the root logger.
-        log_level (int): The root logger level. Note that only the process of
-            rank 0 is affected, while other processes will set the level to
-            "Error" and be silent most of the time.
-    Returns:
-        logging.Logger: The root logger.
-    """
-    logger = logging.getLogger(logger_name)
-    # if the logger has been initialized, just return it
-    if logger_name in initialized_logger:
-        return logger
-
-    format_str = '%(asctime)s %(levelname)s: %(message)s'
-    stream_handler = logging.StreamHandler()
-    stream_handler.setFormatter(logging.Formatter(format_str))
-    logger.addHandler(stream_handler)
-    logger.propagate = False
-    rank, _ = get_dist_info()
-    if rank != 0:
-        logger.setLevel('ERROR')
-    elif log_file is not None:
-        logger.setLevel(log_level)
-        # add file handler
-        # file_handler = logging.FileHandler(log_file, 'w')
-        file_handler = logging.FileHandler(log_file, 'a') #Shangchen: keep the previous log
-        file_handler.setFormatter(logging.Formatter(format_str))
-        file_handler.setLevel(log_level)
-        logger.addHandler(file_handler)
-    initialized_logger[logger_name] = True
-    return logger
-
-
-def get_env_info():
-    """Get environment information.
-    Currently, only log the software version.
-    """
-    import torch
-    import torchvision
-
-    from basicsr.version import __version__
-    msg = r"""
-                ____                _       _____  ____
-               / __ ) ____ _ _____ (_)_____/ ___/ / __ \
-              / __  |/ __ `// ___// // ___/\__ \ / /_/ /
-             / /_/ // /_/ /(__  )/ // /__ ___/ // _, _/
-            /_____/ \__,_//____//_/ \___//____//_/ |_|
-     ______                   __   __                 __      __
-    / ____/____   ____   ____/ /  / /   __  __ _____ / /__   / /
-   / / __ / __ \ / __ \ / __  /  / /   / / / // ___// //_/  / /
-  / /_/ // /_/ // /_/ // /_/ /  / /___/ /_/ // /__ / /<    /_/
-  \____/ \____/ \____/ \____/  /_____/\____/ \___//_/|_|  (_)
-    """
-    msg += ('\nVersion Information: '
-            f'\n\tBasicSR: {__version__}'
-            f'\n\tPyTorch: {torch.__version__}'
-            f'\n\tTorchVision: {torchvision.__version__}')
-    return msg
\ No newline at end of file
diff --git a/spaces/lwchen/CodeFormer/CodeFormer/facelib/detection/yolov5face/models/common.py b/spaces/lwchen/CodeFormer/CodeFormer/facelib/detection/yolov5face/models/common.py
deleted file mode 100644
index 497a00444c4c59725001993a63fe4617e9d323c8..0000000000000000000000000000000000000000
--- a/spaces/lwchen/CodeFormer/CodeFormer/facelib/detection/yolov5face/models/common.py
+++ /dev/null
@@ -1,299 +0,0 @@
-# This file contains modules common to various models
-
-import math
-
-import numpy as np
-import torch
-from torch import nn
-
-from facelib.detection.yolov5face.utils.datasets import letterbox
-from facelib.detection.yolov5face.utils.general import (
-    make_divisible,
-    non_max_suppression,
-    scale_coords,
-    xyxy2xywh,
-)
-
-
-def autopad(k, p=None):  # kernel, padding
-    # Pad to 'same'
-    if p is None:
-        p = k // 2 if isinstance(k, int) else [x // 2 for x in k]  # auto-pad
-    return p
-
-
-def channel_shuffle(x, groups):
-    batchsize, num_channels, height, width = x.data.size()
-    channels_per_group = torch.div(num_channels, groups, rounding_mode="trunc")
-
-    # reshape
-    x = x.view(batchsize, groups, channels_per_group, height, width)
-    x = torch.transpose(x, 1, 2).contiguous()
-
-    # flatten
-    return x.view(batchsize, -1, height, width)
-
-
-def DWConv(c1, c2, k=1, s=1, act=True):
-    # Depthwise convolution
-    return Conv(c1, c2, k, s, g=math.gcd(c1, c2), act=act)
-
-
-class Conv(nn.Module):
-    # Standard convolution
-    def __init__(self, c1, c2, k=1, s=1, p=None, g=1, act=True):  # ch_in, ch_out, kernel, stride, padding, groups
-        super().__init__()
-        self.conv = nn.Conv2d(c1, c2, k, s, autopad(k, p), groups=g, bias=False)
-        self.bn = nn.BatchNorm2d(c2)
-        self.act = nn.SiLU() if act is True else (act if isinstance(act, nn.Module) else nn.Identity())
-
-    def forward(self, x):
-        return self.act(self.bn(self.conv(x)))
-
-    def fuseforward(self, x):
-        return self.act(self.conv(x))
-
-
-class StemBlock(nn.Module):
-    def __init__(self, c1, c2, k=3, s=2, p=None, g=1, act=True):
-        super().__init__()
-        self.stem_1 = Conv(c1, c2, k, s, p, g, act)
-        self.stem_2a = Conv(c2, c2 // 2, 1, 1, 0)
-        self.stem_2b = Conv(c2 // 2, c2, 3, 2, 1)
-        self.stem_2p = nn.MaxPool2d(kernel_size=2, stride=2, ceil_mode=True)
-        self.stem_3 = Conv(c2 * 2, c2, 1, 1, 0)
-
-    def forward(self, x):
-        stem_1_out = self.stem_1(x)
-        stem_2a_out = self.stem_2a(stem_1_out)
-        stem_2b_out = self.stem_2b(stem_2a_out)
-        stem_2p_out = self.stem_2p(stem_1_out)
-        return self.stem_3(torch.cat((stem_2b_out, stem_2p_out), 1))
-
-
-class Bottleneck(nn.Module):
-    # Standard bottleneck
-    def __init__(self, c1, c2, shortcut=True, g=1, e=0.5):  # ch_in, ch_out, shortcut, groups, expansion
-        super().__init__()
-        c_ = int(c2 * e)  # hidden channels
-        self.cv1 = Conv(c1, c_, 1, 1)
-        self.cv2 = Conv(c_, c2, 3, 1, g=g)
-        self.add = shortcut and c1 == c2
-
-    def forward(self, x):
-        return x + self.cv2(self.cv1(x)) if self.add else self.cv2(self.cv1(x))
-
-
-class BottleneckCSP(nn.Module):
-    # CSP Bottleneck https://github.com/WongKinYiu/CrossStagePartialNetworks
-    def __init__(self, c1, c2, n=1, shortcut=True, g=1, e=0.5):  # ch_in, ch_out, number, shortcut, groups, expansion
-        super().__init__()
-        c_ = int(c2 * e)  # hidden channels
-        self.cv1 = Conv(c1, c_, 1, 1)
-        self.cv2 = nn.Conv2d(c1, c_, 1, 1, bias=False)
-        self.cv3 = nn.Conv2d(c_, c_, 1, 1, bias=False)
-        self.cv4 = Conv(2 * c_, c2, 1, 1)
-        self.bn = nn.BatchNorm2d(2 * c_)  # applied to cat(cv2, cv3)
-        self.act = nn.LeakyReLU(0.1, inplace=True)
-        self.m = nn.Sequential(*(Bottleneck(c_, c_, shortcut, g, e=1.0) for _ in range(n)))
-
-    def forward(self, x):
-        y1 = self.cv3(self.m(self.cv1(x)))
-        y2 = self.cv2(x)
-        return self.cv4(self.act(self.bn(torch.cat((y1, y2), dim=1))))
-
-
-class C3(nn.Module):
-    # CSP Bottleneck with 3 convolutions
-    def __init__(self, c1, c2, n=1, shortcut=True, g=1, e=0.5):  # ch_in, ch_out, number, shortcut, groups, expansion
-        super().__init__()
-        c_ = int(c2 * e)  # hidden channels
-        self.cv1 = Conv(c1, c_, 1, 1)
-        self.cv2 = Conv(c1, c_, 1, 1)
-        self.cv3 = Conv(2 * c_, c2, 1)  # act=FReLU(c2)
-        self.m = nn.Sequential(*(Bottleneck(c_, c_, shortcut, g, e=1.0) for _ in range(n)))
-
-    def forward(self, x):
-        return self.cv3(torch.cat((self.m(self.cv1(x)), self.cv2(x)), dim=1))
-
-
-class ShuffleV2Block(nn.Module):
-    def __init__(self, inp, oup, stride):
-        super().__init__()
-
-        if not 1 <= stride <= 3:
-            raise ValueError("illegal stride value")
-        self.stride = stride
-
-        branch_features = oup // 2
-
-        if self.stride > 1:
-            self.branch1 = nn.Sequential(
-                self.depthwise_conv(inp, inp, kernel_size=3, stride=self.stride, padding=1),
-                nn.BatchNorm2d(inp),
-                nn.Conv2d(inp, branch_features, kernel_size=1, stride=1, padding=0, bias=False),
-                nn.BatchNorm2d(branch_features),
-                nn.SiLU(),
-            )
-        else:
-            self.branch1 = nn.Sequential()
-
-        self.branch2 = nn.Sequential(
-            nn.Conv2d(
-                inp if (self.stride > 1) else branch_features,
-                branch_features,
-                kernel_size=1,
-                stride=1,
-                padding=0,
-                bias=False,
-            ),
-            nn.BatchNorm2d(branch_features),
-            nn.SiLU(),
-            self.depthwise_conv(branch_features, branch_features, kernel_size=3, stride=self.stride, padding=1),
-            nn.BatchNorm2d(branch_features),
-            nn.Conv2d(branch_features, branch_features, kernel_size=1, stride=1, padding=0, bias=False),
-            nn.BatchNorm2d(branch_features),
-            nn.SiLU(),
-        )
-
-    @staticmethod
-    def depthwise_conv(i, o, kernel_size, stride=1, padding=0, bias=False):
-        return nn.Conv2d(i, o, kernel_size, stride, padding, bias=bias, groups=i)
-
-    def forward(self, x):
-        if self.stride == 1:
-            x1, x2 = x.chunk(2, dim=1)
-            out = torch.cat((x1, self.branch2(x2)), dim=1)
-        else:
-            out = torch.cat((self.branch1(x), self.branch2(x)), dim=1)
-        out = channel_shuffle(out, 2)
-        return out
-
-
-class SPP(nn.Module):
-    # Spatial pyramid pooling layer used in YOLOv3-SPP
-    def __init__(self, c1, c2, k=(5, 9, 13)):
-        super().__init__()
-        c_ = c1 // 2  # hidden channels
-        self.cv1 = Conv(c1, c_, 1, 1)
-        self.cv2 = Conv(c_ * (len(k) + 1), c2, 1, 1)
-        self.m = nn.ModuleList([nn.MaxPool2d(kernel_size=x, stride=1, padding=x // 2) for x in k])
-
-    def forward(self, x):
-        x = self.cv1(x)
-        return self.cv2(torch.cat([x] + [m(x) for m in self.m], 1))
-
-
-class Focus(nn.Module):
-    # Focus wh information into c-space
-    def __init__(self, c1, c2, k=1, s=1, p=None, g=1, act=True):  # ch_in, ch_out, kernel, stride, padding, groups
-        super().__init__()
-        self.conv = Conv(c1 * 4, c2, k, s, p, g, act)
-
-    def forward(self, x):  # x(b,c,w,h) -> y(b,4c,w/2,h/2)
-        return self.conv(torch.cat([x[..., ::2, ::2], x[..., 1::2, ::2], x[..., ::2, 1::2], x[..., 1::2, 1::2]], 1))
-
-
-class Concat(nn.Module):
-    # Concatenate a list of tensors along dimension
-    def __init__(self, dimension=1):
-        super().__init__()
-        self.d = dimension
-
-    def forward(self, x):
-        return torch.cat(x, self.d)
-
-
-class NMS(nn.Module):
-    # Non-Maximum Suppression (NMS) module
-    conf = 0.25  # confidence threshold
-    iou = 0.45  # IoU threshold
-    classes = None  # (optional list) filter by class
-
-    def forward(self, x):
-        return non_max_suppression(x[0], conf_thres=self.conf, iou_thres=self.iou, classes=self.classes)
-
-
-class AutoShape(nn.Module):
-    # input-robust model wrapper for passing cv2/np/PIL/torch inputs. Includes preprocessing, inference and NMS
-    img_size = 640  # inference size (pixels)
-    conf = 0.25  # NMS confidence threshold
-    iou = 0.45  # NMS IoU threshold
-    classes = None  # (optional list) filter by class
-
-    def __init__(self, model):
-        super().__init__()
-        self.model = model.eval()
-
-    def autoshape(self):
-        print("autoShape already enabled, skipping... ")  # model already converted to model.autoshape()
-        return self
-
-    def forward(self, imgs, size=640, augment=False, profile=False):
-        # Inference from various sources. For height=720, width=1280, RGB images example inputs are:
-        #   OpenCV:          = cv2.imread('image.jpg')[:,:,::-1]  # HWC BGR to RGB x(720,1280,3)
-        #   PIL:             = Image.open('image.jpg')  # HWC x(720,1280,3)
-        #   numpy:           = np.zeros((720,1280,3))  # HWC
-        #   torch:           = torch.zeros(16,3,720,1280)  # BCHW
-        #   multiple:        = [Image.open('image1.jpg'), Image.open('image2.jpg'), ...]  # list of images
-
-        p = next(self.model.parameters())  # for device and type
-        if isinstance(imgs, torch.Tensor):  # torch
-            return self.model(imgs.to(p.device).type_as(p), augment, profile)  # inference
-
-        # Pre-process
-        n, imgs = (len(imgs), imgs) if isinstance(imgs, list) else (1, [imgs])  # number of images, list of images
-        shape0, shape1 = [], []  # image and inference shapes
-        for i, im in enumerate(imgs):
-            im = np.array(im)  # to numpy
-            if im.shape[0] < 5:  # image in CHW
-                im = im.transpose((1, 2, 0))  # reverse dataloader .transpose(2, 0, 1)
-            im = im[:, :, :3] if im.ndim == 3 else np.tile(im[:, :, None], 3)  # enforce 3ch input
-            s = im.shape[:2]  # HWC
-            shape0.append(s)  # image shape
-            g = size / max(s)  # gain
-            shape1.append([y * g for y in s])
-            imgs[i] = im  # update
-        shape1 = [make_divisible(x, int(self.stride.max())) for x in np.stack(shape1, 0).max(0)]  # inference shape
-        x = [letterbox(im, new_shape=shape1, auto=False)[0] for im in imgs]  # pad
-        x = np.stack(x, 0) if n > 1 else x[0][None]  # stack
-        x = np.ascontiguousarray(x.transpose((0, 3, 1, 2)))  # BHWC to BCHW
-        x = torch.from_numpy(x).to(p.device).type_as(p) / 255.0  # uint8 to fp16/32
-
-        # Inference
-        with torch.no_grad():
-            y = self.model(x, augment, profile)[0]  # forward
-        y = non_max_suppression(y, conf_thres=self.conf, iou_thres=self.iou, classes=self.classes)  # NMS
-
-        # Post-process
-        for i in range(n):
-            scale_coords(shape1, y[i][:, :4], shape0[i])
-
-        return Detections(imgs, y, self.names)
-
-
-class Detections:
-    # detections class for YOLOv5 inference results
-    def __init__(self, imgs, pred, names=None):
-        super().__init__()
-        d = pred[0].device  # device
-        gn = [torch.tensor([*(im.shape[i] for i in [1, 0, 1, 0]), 1.0, 1.0], device=d) for im in imgs]  # normalizations
-        self.imgs = imgs  # list of images as numpy arrays
-        self.pred = pred  # list of tensors pred[0] = (xyxy, conf, cls)
-        self.names = names  # class names
-        self.xyxy = pred  # xyxy pixels
-        self.xywh = [xyxy2xywh(x) for x in pred]  # xywh pixels
-        self.xyxyn = [x / g for x, g in zip(self.xyxy, gn)]  # xyxy normalized
-        self.xywhn = [x / g for x, g in zip(self.xywh, gn)]  # xywh normalized
-        self.n = len(self.pred)
-
-    def __len__(self):
-        return self.n
-
-    def tolist(self):
-        # return a list of Detections objects, i.e. 'for result in results.tolist():'
-        x = [Detections([self.imgs[i]], [self.pred[i]], self.names) for i in range(self.n)]
-        for d in x:
-            for k in ["imgs", "pred", "xyxy", "xyxyn", "xywh", "xywhn"]:
-                setattr(d, k, getattr(d, k)[0])  # pop out of list
-        return x
diff --git a/spaces/lwchen/CodeFormer/CodeFormer/facelib/utils/face_restoration_helper.py b/spaces/lwchen/CodeFormer/CodeFormer/facelib/utils/face_restoration_helper.py
deleted file mode 100644
index 5d3fb8f3b95ed9959610e64f6d7373ea8a56ece8..0000000000000000000000000000000000000000
--- a/spaces/lwchen/CodeFormer/CodeFormer/facelib/utils/face_restoration_helper.py
+++ /dev/null
@@ -1,460 +0,0 @@
-import cv2
-import numpy as np
-import os
-import torch
-from torchvision.transforms.functional import normalize
-
-from facelib.detection import init_detection_model
-from facelib.parsing import init_parsing_model
-from facelib.utils.misc import img2tensor, imwrite, is_gray, bgr2gray
-
-
-def get_largest_face(det_faces, h, w):
-
-    def get_location(val, length):
-        if val < 0:
-            return 0
-        elif val > length:
-            return length
-        else:
-            return val
-
-    face_areas = []
-    for det_face in det_faces:
-        left = get_location(det_face[0], w)
-        right = get_location(det_face[2], w)
-        top = get_location(det_face[1], h)
-        bottom = get_location(det_face[3], h)
-        face_area = (right - left) * (bottom - top)
-        face_areas.append(face_area)
-    largest_idx = face_areas.index(max(face_areas))
-    return det_faces[largest_idx], largest_idx
-
-
-def get_center_face(det_faces, h=0, w=0, center=None):
-    if center is not None:
-        center = np.array(center)
-    else:
-        center = np.array([w / 2, h / 2])
-    center_dist = []
-    for det_face in det_faces:
-        face_center = np.array([(det_face[0] + det_face[2]) / 2, (det_face[1] + det_face[3]) / 2])
-        dist = np.linalg.norm(face_center - center)
-        center_dist.append(dist)
-    center_idx = center_dist.index(min(center_dist))
-    return det_faces[center_idx], center_idx
-
-
-class FaceRestoreHelper(object):
-    """Helper for the face restoration pipeline (base class)."""
-
-    def __init__(self,
-                 upscale_factor,
-                 face_size=512,
-                 crop_ratio=(1, 1),
-                 det_model='retinaface_resnet50',
-                 save_ext='png',
-                 template_3points=False,
-                 pad_blur=False,
-                 use_parse=False,
-                 device=None):
-        self.template_3points = template_3points  # improve robustness
-        self.upscale_factor = int(upscale_factor)
-        # the cropped face ratio based on the square face
-        self.crop_ratio = crop_ratio  # (h, w)
-        assert (self.crop_ratio[0] >= 1 and self.crop_ratio[1] >= 1), 'crop ration only supports >=1'
-        self.face_size = (int(face_size * self.crop_ratio[1]), int(face_size * self.crop_ratio[0]))
-
-        if self.template_3points:
-            self.face_template = np.array([[192, 240], [319, 240], [257, 371]])
-        else:
-            # standard 5 landmarks for FFHQ faces with 512 x 512 
-            # facexlib
-            self.face_template = np.array([[192.98138, 239.94708], [318.90277, 240.1936], [256.63416, 314.01935],
-                                           [201.26117, 371.41043], [313.08905, 371.15118]])
-
-            # dlib: left_eye: 36:41  right_eye: 42:47  nose: 30,32,33,34  left mouth corner: 48  right mouth corner: 54
-            # self.face_template = np.array([[193.65928, 242.98541], [318.32558, 243.06108], [255.67984, 328.82894],
-            #                                 [198.22603, 372.82502], [313.91018, 372.75659]])
-
-
-        self.face_template = self.face_template * (face_size / 512.0)
-        if self.crop_ratio[0] > 1:
-            self.face_template[:, 1] += face_size * (self.crop_ratio[0] - 1) / 2
-        if self.crop_ratio[1] > 1:
-            self.face_template[:, 0] += face_size * (self.crop_ratio[1] - 1) / 2
-        self.save_ext = save_ext
-        self.pad_blur = pad_blur
-        if self.pad_blur is True:
-            self.template_3points = False
-
-        self.all_landmarks_5 = []
-        self.det_faces = []
-        self.affine_matrices = []
-        self.inverse_affine_matrices = []
-        self.cropped_faces = []
-        self.restored_faces = []
-        self.pad_input_imgs = []
-
-        if device is None:
-            self.device = torch.device('cuda' if torch.cuda.is_available() else 'cpu')
-        else:
-            self.device = device
-
-        # init face detection model
-        self.face_det = init_detection_model(det_model, half=False, device=self.device)
-
-        # init face parsing model
-        self.use_parse = use_parse
-        self.face_parse = init_parsing_model(model_name='parsenet', device=self.device)
-
-    def set_upscale_factor(self, upscale_factor):
-        self.upscale_factor = upscale_factor
-
-    def read_image(self, img):
-        """img can be image path or cv2 loaded image."""
-        # self.input_img is Numpy array, (h, w, c), BGR, uint8, [0, 255]
-        if isinstance(img, str):
-            img = cv2.imread(img)
-
-        if np.max(img) > 256:  # 16-bit image
-            img = img / 65535 * 255
-        if len(img.shape) == 2:  # gray image
-            img = cv2.cvtColor(img, cv2.COLOR_GRAY2BGR)
-        elif img.shape[2] == 4:  # BGRA image with alpha channel
-            img = img[:, :, 0:3]
-
-        self.input_img = img
-        self.is_gray = is_gray(img, threshold=5)
-        if self.is_gray:
-            print('Grayscale input: True')
-
-        if min(self.input_img.shape[:2])<512:
-            f = 512.0/min(self.input_img.shape[:2])
-            self.input_img = cv2.resize(self.input_img, (0,0), fx=f, fy=f, interpolation=cv2.INTER_LINEAR)
-
-    def get_face_landmarks_5(self,
-                             only_keep_largest=False,
-                             only_center_face=False,
-                             resize=None,
-                             blur_ratio=0.01,
-                             eye_dist_threshold=None):
-        if resize is None:
-            scale = 1
-            input_img = self.input_img
-        else:
-            h, w = self.input_img.shape[0:2]
-            scale = resize / min(h, w)
-            scale = max(1, scale) # always scale up
-            h, w = int(h * scale), int(w * scale)
-            interp = cv2.INTER_AREA if scale < 1 else cv2.INTER_LINEAR
-            input_img = cv2.resize(self.input_img, (w, h), interpolation=interp)
-
-        with torch.no_grad():
-            bboxes = self.face_det.detect_faces(input_img)
-
-        if bboxes is None or bboxes.shape[0] == 0:
-            return 0
-        else:
-            bboxes = bboxes / scale
-
-        for bbox in bboxes:
-            # remove faces with too small eye distance: side faces or too small faces
-            eye_dist = np.linalg.norm([bbox[6] - bbox[8], bbox[7] - bbox[9]])
-            if eye_dist_threshold is not None and (eye_dist < eye_dist_threshold):
-                continue
-
-            if self.template_3points:
-                landmark = np.array([[bbox[i], bbox[i + 1]] for i in range(5, 11, 2)])
-            else:
-                landmark = np.array([[bbox[i], bbox[i + 1]] for i in range(5, 15, 2)])
-            self.all_landmarks_5.append(landmark)
-            self.det_faces.append(bbox[0:5])
-            
-        if len(self.det_faces) == 0:
-            return 0
-        if only_keep_largest:
-            h, w, _ = self.input_img.shape
-            self.det_faces, largest_idx = get_largest_face(self.det_faces, h, w)
-            self.all_landmarks_5 = [self.all_landmarks_5[largest_idx]]
-        elif only_center_face:
-            h, w, _ = self.input_img.shape
-            self.det_faces, center_idx = get_center_face(self.det_faces, h, w)
-            self.all_landmarks_5 = [self.all_landmarks_5[center_idx]]
-
-        # pad blurry images
-        if self.pad_blur:
-            self.pad_input_imgs = []
-            for landmarks in self.all_landmarks_5:
-                # get landmarks
-                eye_left = landmarks[0, :]
-                eye_right = landmarks[1, :]
-                eye_avg = (eye_left + eye_right) * 0.5
-                mouth_avg = (landmarks[3, :] + landmarks[4, :]) * 0.5
-                eye_to_eye = eye_right - eye_left
-                eye_to_mouth = mouth_avg - eye_avg
-
-                # Get the oriented crop rectangle
-                # x: half width of the oriented crop rectangle
-                x = eye_to_eye - np.flipud(eye_to_mouth) * [-1, 1]
-                #  - np.flipud(eye_to_mouth) * [-1, 1]: rotate 90 clockwise
-                # norm with the hypotenuse: get the direction
-                x /= np.hypot(*x)  # get the hypotenuse of a right triangle
-                rect_scale = 1.5
-                x *= max(np.hypot(*eye_to_eye) * 2.0 * rect_scale, np.hypot(*eye_to_mouth) * 1.8 * rect_scale)
-                # y: half height of the oriented crop rectangle
-                y = np.flipud(x) * [-1, 1]
-
-                # c: center
-                c = eye_avg + eye_to_mouth * 0.1
-                # quad: (left_top, left_bottom, right_bottom, right_top)
-                quad = np.stack([c - x - y, c - x + y, c + x + y, c + x - y])
-                # qsize: side length of the square
-                qsize = np.hypot(*x) * 2
-                border = max(int(np.rint(qsize * 0.1)), 3)
-
-                # get pad
-                # pad: (width_left, height_top, width_right, height_bottom)
-                pad = (int(np.floor(min(quad[:, 0]))), int(np.floor(min(quad[:, 1]))), int(np.ceil(max(quad[:, 0]))),
-                       int(np.ceil(max(quad[:, 1]))))
-                pad = [
-                    max(-pad[0] + border, 1),
-                    max(-pad[1] + border, 1),
-                    max(pad[2] - self.input_img.shape[0] + border, 1),
-                    max(pad[3] - self.input_img.shape[1] + border, 1)
-                ]
-
-                if max(pad) > 1:
-                    # pad image
-                    pad_img = np.pad(self.input_img, ((pad[1], pad[3]), (pad[0], pad[2]), (0, 0)), 'reflect')
-                    # modify landmark coords
-                    landmarks[:, 0] += pad[0]
-                    landmarks[:, 1] += pad[1]
-                    # blur pad images
-                    h, w, _ = pad_img.shape
-                    y, x, _ = np.ogrid[:h, :w, :1]
-                    mask = np.maximum(1.0 - np.minimum(np.float32(x) / pad[0],
-                                                       np.float32(w - 1 - x) / pad[2]),
-                                      1.0 - np.minimum(np.float32(y) / pad[1],
-                                                       np.float32(h - 1 - y) / pad[3]))
-                    blur = int(qsize * blur_ratio)
-                    if blur % 2 == 0:
-                        blur += 1
-                    blur_img = cv2.boxFilter(pad_img, 0, ksize=(blur, blur))
-                    # blur_img = cv2.GaussianBlur(pad_img, (blur, blur), 0)
-
-                    pad_img = pad_img.astype('float32')
-                    pad_img += (blur_img - pad_img) * np.clip(mask * 3.0 + 1.0, 0.0, 1.0)
-                    pad_img += (np.median(pad_img, axis=(0, 1)) - pad_img) * np.clip(mask, 0.0, 1.0)
-                    pad_img = np.clip(pad_img, 0, 255)  # float32, [0, 255]
-                    self.pad_input_imgs.append(pad_img)
-                else:
-                    self.pad_input_imgs.append(np.copy(self.input_img))
-
-        return len(self.all_landmarks_5)
-
-    def align_warp_face(self, save_cropped_path=None, border_mode='constant'):
-        """Align and warp faces with face template.
-        """
-        if self.pad_blur:
-            assert len(self.pad_input_imgs) == len(
-                self.all_landmarks_5), f'Mismatched samples: {len(self.pad_input_imgs)} and {len(self.all_landmarks_5)}'
-        for idx, landmark in enumerate(self.all_landmarks_5):
-            # use 5 landmarks to get affine matrix
-            # use cv2.LMEDS method for the equivalence to skimage transform
-            # ref: https://blog.csdn.net/yichxi/article/details/115827338
-            affine_matrix = cv2.estimateAffinePartial2D(landmark, self.face_template, method=cv2.LMEDS)[0]
-            self.affine_matrices.append(affine_matrix)
-            # warp and crop faces
-            if border_mode == 'constant':
-                border_mode = cv2.BORDER_CONSTANT
-            elif border_mode == 'reflect101':
-                border_mode = cv2.BORDER_REFLECT101
-            elif border_mode == 'reflect':
-                border_mode = cv2.BORDER_REFLECT
-            if self.pad_blur:
-                input_img = self.pad_input_imgs[idx]
-            else:
-                input_img = self.input_img
-            cropped_face = cv2.warpAffine(
-                input_img, affine_matrix, self.face_size, borderMode=border_mode, borderValue=(135, 133, 132))  # gray
-            self.cropped_faces.append(cropped_face)
-            # save the cropped face
-            if save_cropped_path is not None:
-                path = os.path.splitext(save_cropped_path)[0]
-                save_path = f'{path}_{idx:02d}.{self.save_ext}'
-                imwrite(cropped_face, save_path)
-
-    def get_inverse_affine(self, save_inverse_affine_path=None):
-        """Get inverse affine matrix."""
-        for idx, affine_matrix in enumerate(self.affine_matrices):
-            inverse_affine = cv2.invertAffineTransform(affine_matrix)
-            inverse_affine *= self.upscale_factor
-            self.inverse_affine_matrices.append(inverse_affine)
-            # save inverse affine matrices
-            if save_inverse_affine_path is not None:
-                path, _ = os.path.splitext(save_inverse_affine_path)
-                save_path = f'{path}_{idx:02d}.pth'
-                torch.save(inverse_affine, save_path)
-
-
-    def add_restored_face(self, face):
-        if self.is_gray:
-            face = bgr2gray(face) # convert img into grayscale
-        self.restored_faces.append(face)
-
-
-    def paste_faces_to_input_image(self, save_path=None, upsample_img=None, draw_box=False, face_upsampler=None):
-        h, w, _ = self.input_img.shape
-        h_up, w_up = int(h * self.upscale_factor), int(w * self.upscale_factor)
-
-        if upsample_img is None:
-            # simply resize the background
-            # upsample_img = cv2.resize(self.input_img, (w_up, h_up), interpolation=cv2.INTER_LANCZOS4)
-            upsample_img = cv2.resize(self.input_img, (w_up, h_up), interpolation=cv2.INTER_LINEAR)
-        else:
-            upsample_img = cv2.resize(upsample_img, (w_up, h_up), interpolation=cv2.INTER_LANCZOS4)
-
-        assert len(self.restored_faces) == len(
-            self.inverse_affine_matrices), ('length of restored_faces and affine_matrices are different.')
-        
-        inv_mask_borders = []
-        for restored_face, inverse_affine in zip(self.restored_faces, self.inverse_affine_matrices):
-            if face_upsampler is not None:
-                restored_face = face_upsampler.enhance(restored_face, outscale=self.upscale_factor)[0]
-                inverse_affine /= self.upscale_factor
-                inverse_affine[:, 2] *= self.upscale_factor
-                face_size = (self.face_size[0]*self.upscale_factor, self.face_size[1]*self.upscale_factor)
-            else:
-                # Add an offset to inverse affine matrix, for more precise back alignment
-                if self.upscale_factor > 1:
-                    extra_offset = 0.5 * self.upscale_factor
-                else:
-                    extra_offset = 0
-                inverse_affine[:, 2] += extra_offset
-                face_size = self.face_size
-            inv_restored = cv2.warpAffine(restored_face, inverse_affine, (w_up, h_up))
-
-            # if draw_box or not self.use_parse:  # use square parse maps
-            #     mask = np.ones(face_size, dtype=np.float32)
-            #     inv_mask = cv2.warpAffine(mask, inverse_affine, (w_up, h_up))
-            #     # remove the black borders
-            #     inv_mask_erosion = cv2.erode(
-            #         inv_mask, np.ones((int(2 * self.upscale_factor), int(2 * self.upscale_factor)), np.uint8))
-            #     pasted_face = inv_mask_erosion[:, :, None] * inv_restored
-            #     total_face_area = np.sum(inv_mask_erosion)  # // 3
-            #     # add border
-            #     if draw_box:
-            #         h, w = face_size
-            #         mask_border = np.ones((h, w, 3), dtype=np.float32)
-            #         border = int(1400/np.sqrt(total_face_area))
-            #         mask_border[border:h-border, border:w-border,:] = 0
-            #         inv_mask_border = cv2.warpAffine(mask_border, inverse_affine, (w_up, h_up))
-            #         inv_mask_borders.append(inv_mask_border)
-            #     if not self.use_parse:
-            #         # compute the fusion edge based on the area of face
-            #         w_edge = int(total_face_area**0.5) // 20
-            #         erosion_radius = w_edge * 2
-            #         inv_mask_center = cv2.erode(inv_mask_erosion, np.ones((erosion_radius, erosion_radius), np.uint8))
-            #         blur_size = w_edge * 2
-            #         inv_soft_mask = cv2.GaussianBlur(inv_mask_center, (blur_size + 1, blur_size + 1), 0)
-            #         if len(upsample_img.shape) == 2:  # upsample_img is gray image
-            #             upsample_img = upsample_img[:, :, None]
-            #         inv_soft_mask = inv_soft_mask[:, :, None]
-
-            # always use square mask
-            mask = np.ones(face_size, dtype=np.float32)
-            inv_mask = cv2.warpAffine(mask, inverse_affine, (w_up, h_up))
-            # remove the black borders
-            inv_mask_erosion = cv2.erode(
-                inv_mask, np.ones((int(2 * self.upscale_factor), int(2 * self.upscale_factor)), np.uint8))
-            pasted_face = inv_mask_erosion[:, :, None] * inv_restored
-            total_face_area = np.sum(inv_mask_erosion)  # // 3
-            # add border
-            if draw_box:
-                h, w = face_size
-                mask_border = np.ones((h, w, 3), dtype=np.float32)
-                border = int(1400/np.sqrt(total_face_area))
-                mask_border[border:h-border, border:w-border,:] = 0
-                inv_mask_border = cv2.warpAffine(mask_border, inverse_affine, (w_up, h_up))
-                inv_mask_borders.append(inv_mask_border)
-            # compute the fusion edge based on the area of face
-            w_edge = int(total_face_area**0.5) // 20
-            erosion_radius = w_edge * 2
-            inv_mask_center = cv2.erode(inv_mask_erosion, np.ones((erosion_radius, erosion_radius), np.uint8))
-            blur_size = w_edge * 2
-            inv_soft_mask = cv2.GaussianBlur(inv_mask_center, (blur_size + 1, blur_size + 1), 0)
-            if len(upsample_img.shape) == 2:  # upsample_img is gray image
-                upsample_img = upsample_img[:, :, None]
-            inv_soft_mask = inv_soft_mask[:, :, None]
-
-            # parse mask
-            if self.use_parse:
-                # inference
-                face_input = cv2.resize(restored_face, (512, 512), interpolation=cv2.INTER_LINEAR)
-                face_input = img2tensor(face_input.astype('float32') / 255., bgr2rgb=True, float32=True)
-                normalize(face_input, (0.5, 0.5, 0.5), (0.5, 0.5, 0.5), inplace=True)
-                face_input = torch.unsqueeze(face_input, 0).to(self.device)
-                with torch.no_grad():
-                    out = self.face_parse(face_input)[0]
-                out = out.argmax(dim=1).squeeze().cpu().numpy()
-
-                parse_mask = np.zeros(out.shape)
-                MASK_COLORMAP = [0, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 0, 255, 0, 0, 0]
-                for idx, color in enumerate(MASK_COLORMAP):
-                    parse_mask[out == idx] = color
-                #  blur the mask
-                parse_mask = cv2.GaussianBlur(parse_mask, (101, 101), 11)
-                parse_mask = cv2.GaussianBlur(parse_mask, (101, 101), 11)
-                # remove the black borders
-                thres = 10
-                parse_mask[:thres, :] = 0
-                parse_mask[-thres:, :] = 0
-                parse_mask[:, :thres] = 0
-                parse_mask[:, -thres:] = 0
-                parse_mask = parse_mask / 255.
-
-                parse_mask = cv2.resize(parse_mask, face_size)
-                parse_mask = cv2.warpAffine(parse_mask, inverse_affine, (w_up, h_up), flags=3)
-                inv_soft_parse_mask = parse_mask[:, :, None]
-                # pasted_face = inv_restored
-                fuse_mask = (inv_soft_parse_mask<inv_soft_mask).astype('int')
-                inv_soft_mask = inv_soft_parse_mask*fuse_mask + inv_soft_mask*(1-fuse_mask)
-
-            if len(upsample_img.shape) == 3 and upsample_img.shape[2] == 4:  # alpha channel
-                alpha = upsample_img[:, :, 3:]
-                upsample_img = inv_soft_mask * pasted_face + (1 - inv_soft_mask) * upsample_img[:, :, 0:3]
-                upsample_img = np.concatenate((upsample_img, alpha), axis=2)
-            else:
-                upsample_img = inv_soft_mask * pasted_face + (1 - inv_soft_mask) * upsample_img
-
-        if np.max(upsample_img) > 256:  # 16-bit image
-            upsample_img = upsample_img.astype(np.uint16)
-        else:
-            upsample_img = upsample_img.astype(np.uint8)
-
-        # draw bounding box
-        if draw_box:
-            # upsample_input_img = cv2.resize(input_img, (w_up, h_up))
-            img_color = np.ones([*upsample_img.shape], dtype=np.float32)
-            img_color[:,:,0] = 0
-            img_color[:,:,1] = 255
-            img_color[:,:,2] = 0
-            for inv_mask_border in inv_mask_borders:
-                upsample_img = inv_mask_border * img_color + (1 - inv_mask_border) * upsample_img
-                # upsample_input_img = inv_mask_border * img_color + (1 - inv_mask_border) * upsample_input_img
-
-        if save_path is not None:
-            path = os.path.splitext(save_path)[0]
-            save_path = f'{path}.{self.save_ext}'
-            imwrite(upsample_img, save_path)
-        return upsample_img
-
-    def clean_all(self):
-        self.all_landmarks_5 = []
-        self.restored_faces = []
-        self.affine_matrices = []
-        self.cropped_faces = []
-        self.inverse_affine_matrices = []
-        self.det_faces = []
-        self.pad_input_imgs = []
\ No newline at end of file
diff --git a/spaces/ma-xu/LIVE/thrust/thrust/detail/config/forceinline.h b/spaces/ma-xu/LIVE/thrust/thrust/detail/config/forceinline.h
deleted file mode 100644
index 6641304258aa9229df152fc8c6a137ec52df2302..0000000000000000000000000000000000000000
--- a/spaces/ma-xu/LIVE/thrust/thrust/detail/config/forceinline.h
+++ /dev/null
@@ -1,36 +0,0 @@
-/*
- *  Copyright 2008-2013 NVIDIA Corporation
- *
- *  Licensed under the Apache License, Version 2.0 (the "License");
- *  you may not use this file except in compliance with the License.
- *  You may obtain a copy of the License at
- *
- *      http://www.apache.org/licenses/LICENSE-2.0
- *
- *  Unless required by applicable law or agreed to in writing, software
- *  distributed under the License is distributed on an "AS IS" BASIS,
- *  WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
- *  See the License for the specific language governing permissions and
- *  limitations under the License.
- */
-
-/*! \file forceinline.h
- *  \brief Defines __thrust_forceinline__
- */
-
-#pragma once
-
-#include <thrust/detail/config.h>
-
-#if defined(__CUDACC__)
-
-#define __thrust_forceinline__ __forceinline__
-
-#else
-
-// TODO add 
-
-#define __thrust_forceinline__
-
-#endif
-
diff --git a/spaces/ma-xu/LIVE/thrust/thrust/iterator/transform_iterator.h b/spaces/ma-xu/LIVE/thrust/thrust/iterator/transform_iterator.h
deleted file mode 100644
index fff050e1c05a3b6ed21478aec96cf6394415f3ab..0000000000000000000000000000000000000000
--- a/spaces/ma-xu/LIVE/thrust/thrust/iterator/transform_iterator.h
+++ /dev/null
@@ -1,356 +0,0 @@
-/*
- *  Copyright 2008-2013 NVIDIA Corporation
- *
- *  Licensed under the Apache License, Version 2.0 (the "License");
- *  you may not use this file except in compliance with the License.
- *  You may obtain a copy of the License at
- *
- *      http://www.apache.org/licenses/LICENSE-2.0
- *
- *  Unless required by applicable law or agreed to in writing, software
- *  distributed under the License is distributed on an "AS IS" BASIS,
- *  WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
- *  See the License for the specific language governing permissions and
- *  limitations under the License.
- */
-
-
-/*! \file thrust/iterator/transform_iterator.h
- *  \brief An iterator which adapts another iterator by applying a function to the result of its dereference
- */
-
-/*
- * (C) Copyright David Abrahams 2002.
- * (C) Copyright Jeremy Siek    2002.
- * (C) Copyright Thomas Witt    2002.
- *
- * Distributed under the Boost Software License, Version 1.0.
- * (See accompanying NOTICE file for the complete license)
- *
- * For more information, see http://www.boost.org
- */
-
-#pragma once
-
-#include <thrust/detail/config.h>
-
-// #include the details first
-#include <thrust/iterator/detail/transform_iterator.inl>
-#include <thrust/iterator/iterator_facade.h>
-#include <thrust/iterator/iterator_traits.h>
-#include <thrust/detail/type_traits.h>
-
-namespace thrust
-{
-
-/*! \addtogroup iterators
- *  \{
- */
-
-/*! \addtogroup fancyiterator Fancy Iterators
- *  \ingroup iterators
- *  \{
- */
-
-/*! \p transform_iterator is an iterator which represents a pointer into a range
- *  of values after transformation by a function. This iterator is useful for
- *  creating a range filled with the result of applying an operation to another range
- *  without either explicitly storing it in memory, or explicitly executing the transformation.
- *  Using \p transform_iterator facilitates kernel fusion by deferring the execution
- *  of a transformation until the value is needed while saving both memory capacity
- *  and bandwidth.
- *
- *  The following code snippet demonstrates how to create a \p transform_iterator
- *  which represents the result of \c sqrtf applied to the contents of a \p device_vector.
- *
- *  \code
- *  #include <thrust/iterator/transform_iterator.h>
- *  #include <thrust/device_vector.h>
- *
- *  // note: functor inherits from unary_function
- *  struct square_root : public thrust::unary_function<float,float>
- *  {
- *    __host__ __device__
- *    float operator()(float x) const
- *    {
- *      return sqrtf(x);
- *    }
- *  };
- *
- *  int main()
- *  {
- *    thrust::device_vector<float> v(4);
- *    v[0] = 1.0f;
- *    v[1] = 4.0f;
- *    v[2] = 9.0f;
- *    v[3] = 16.0f;
- *
- *    typedef thrust::device_vector<float>::iterator FloatIterator;
- *
- *    thrust::transform_iterator<square_root, FloatIterator> iter(v.begin(), square_root());
- *
- *    *iter;   // returns 1.0f
- *    iter[0]; // returns 1.0f;
- *    iter[1]; // returns 2.0f;
- *    iter[2]; // returns 3.0f;
- *    iter[3]; // returns 4.0f;
- *
- *    // iter[4] is an out-of-bounds error
- *  }
- *  \endcode
- *
- *  This next example demonstrates how to use a \p transform_iterator with the
- *  \p thrust::reduce function to compute the sum of squares of a sequence.
- *  We will create temporary \p transform_iterators with the
- *  \p make_transform_iterator function in order to avoid explicitly specifying their type:
- *
- *  \code
- *  #include <thrust/iterator/transform_iterator.h>
- *  #include <thrust/device_vector.h>
- *  #include <thrust/reduce.h>
- *  #include <iostream>
- *
- *  // note: functor inherits from unary_function
- *  struct square : public thrust::unary_function<float,float>
- *  {
- *    __host__ __device__
- *    float operator()(float x) const
- *    {
- *      return x * x;
- *    }
- *  };
- *
- *  int main()
- *  {
- *    // initialize a device array
- *    thrust::device_vector<float> v(4);
- *    v[0] = 1.0f;
- *    v[1] = 2.0f;
- *    v[2] = 3.0f;
- *    v[3] = 4.0f;
- *
- *    float sum_of_squares =
- *     thrust::reduce(thrust::make_transform_iterator(v.begin(), square()),
- *                    thrust::make_transform_iterator(v.end(),   square()));
- *
- *    std::cout << "sum of squares: " << sum_of_squares << std::endl;
- *    return 0;
- *  }
- *  \endcode
- *
- *  Note that in the previous two examples the transform functor (namely \c square_root
- *  and \c square) inherits from \c thrust::unary_function.  Inheriting from
- *  \c thrust::unary_function ensures that a functor is a valid \c AdaptableUnaryFunction
- *  and provides all the necessary \c typedef declarations.  The \p transform_iterator
- *  can also be applied to a \c UnaryFunction that does not inherit from
- *  \c thrust::unary_function using an optional template argument.  The following example
- *  illustrates how to use the third template argument to specify the \c result_type of
- *  the function.
- *
- *  \code
- *  #include <thrust/iterator/transform_iterator.h>
- *  #include <thrust/device_vector.h>
- *
- *  // note: functor *does not* inherit from unary_function
- *  struct square_root
- *  {
- *    __host__ __device__
- *    float operator()(float x) const
- *    {
- *      return sqrtf(x);
- *    }
- *  };
- *
- *  int main()
- *  {
- *    thrust::device_vector<float> v(4);
- *    v[0] = 1.0f;
- *    v[1] = 4.0f;
- *    v[2] = 9.0f;
- *    v[3] = 16.0f;
- *
- *    typedef thrust::device_vector<float>::iterator FloatIterator;
- *
- *    // note: float result_type is specified explicitly
- *    thrust::transform_iterator<square_root, FloatIterator, float> iter(v.begin(), square_root());
- *
- *    *iter;   // returns 1.0f
- *    iter[0]; // returns 1.0f;
- *    iter[1]; // returns 2.0f;
- *    iter[2]; // returns 3.0f;
- *    iter[3]; // returns 4.0f;
- *
- *    // iter[4] is an out-of-bounds error
- *  }
- *  \endcode
- *
- *  \see make_transform_iterator
- */
-template <class AdaptableUnaryFunction, class Iterator, class Reference = use_default, class Value = use_default>
-  class transform_iterator
-    : public detail::transform_iterator_base<AdaptableUnaryFunction, Iterator, Reference, Value>::type
-{
-  /*! \cond
-   */
-  public:
-    typedef typename
-    detail::transform_iterator_base<AdaptableUnaryFunction, Iterator, Reference, Value>::type
-    super_t;
-
-    friend class thrust::iterator_core_access;
-  /*! \endcond
-   */
-
-  public:
-    /*! Null constructor does nothing.
-     */
-    __host__ __device__
-    transform_iterator() {}
-
-#if THRUST_CPP_DIALECT >= 2011
-    transform_iterator(transform_iterator const&) = default;
-#endif
-
-    /*! This constructor takes as arguments an \c Iterator and an \c AdaptableUnaryFunction
-     *  and copies them to a new \p transform_iterator.
-     *
-     *  \param x An \c Iterator pointing to the input to this \p transform_iterator's \c AdaptableUnaryFunction.
-     *  \param f An \c AdaptableUnaryFunction used to transform the objects pointed to by \p x.
-     */
-    __host__ __device__
-    transform_iterator(Iterator const& x, AdaptableUnaryFunction f)
-      : super_t(x), m_f(f) {
-    }
-
-    /*! This explicit constructor copies the value of a given \c Iterator and creates
-     *  this \p transform_iterator's \c AdaptableUnaryFunction using its null constructor.
-     *
-     *  \param x An \c Iterator to copy.
-     */
-    __host__ __device__
-    explicit transform_iterator(Iterator const& x)
-      : super_t(x) { }
-
-    /*! This copy constructor creates a new \p transform_iterator from another
-     *  \p transform_iterator.
-     *
-     *  \param other The \p transform_iterator to copy.
-     */
-    template<typename OtherAdaptableUnaryFunction,
-             typename OtherIterator,
-             typename OtherReference,
-             typename OtherValue>
-    __host__ __device__
-    transform_iterator(const transform_iterator<OtherAdaptableUnaryFunction, OtherIterator, OtherReference, OtherValue> &other,
-                       typename thrust::detail::enable_if_convertible<OtherIterator, Iterator>::type* = 0,
-                       typename thrust::detail::enable_if_convertible<OtherAdaptableUnaryFunction, AdaptableUnaryFunction>::type* = 0)
-      : super_t(other.base()), m_f(other.functor()) {}
-
-    /*! Copy assignment operator copies from another \p transform_iterator.
-     *  \p other The other \p transform_iterator to copy
-     *  \return <tt>*this</tt>
-     *
-     *  \note If the type of this \p transform_iterator's functor is not copy assignable
-     *        (for example, if it is a lambda) it is not an error to call this function.
-     *        In this case, however, the functor will not be modified.
-     *
-     *        In any case, this \p transform_iterator's underlying iterator will be copy assigned.
-     */
-    __host__ __device__
-    transform_iterator &operator=(const transform_iterator &other)
-    {
-      return do_assign(other,
-      // XXX gcc 4.2.1 crashes on is_copy_assignable; just assume the functor is assignable as a WAR
-#if (THRUST_HOST_COMPILER == THRUST_HOST_COMPILER_GCC) && (THRUST_GCC_VERSION <= 40201)
-          thrust::detail::true_type()
-#else
-          typename thrust::detail::is_copy_assignable<AdaptableUnaryFunction>::type()
-#endif // THRUST_HOST_COMPILER
-      );
-    }
-
-    /*! This method returns a copy of this \p transform_iterator's \c AdaptableUnaryFunction.
-     *  \return A copy of this \p transform_iterator's \c AdaptableUnaryFunction.
-     */
-    __host__ __device__
-    AdaptableUnaryFunction functor() const
-      { return m_f; }
-
-    /*! \cond
-     */
-  private:
-    __host__ __device__
-    transform_iterator &do_assign(const transform_iterator &other, thrust::detail::true_type)
-    {
-      super_t::operator=(other);
-
-      // do assign to m_f
-      m_f = other.functor();
-
-      return *this;
-    }
-
-    __host__ __device__
-    transform_iterator &do_assign(const transform_iterator &other, thrust::detail::false_type)
-    {
-      super_t::operator=(other);
-
-      // don't assign to m_f
-
-      return *this;
-    }
-
-    // MSVC 2013 and 2015 incorrectly warning about returning a reference to
-    // a local/temporary here.
-    // See goo.gl/LELTNp
-    THRUST_DISABLE_MSVC_WARNING_BEGIN(4172)
-
-    __thrust_exec_check_disable__
-    __host__ __device__
-    typename super_t::reference dereference() const
-    {
-      // Create a temporary to allow iterators with wrapped references to
-      // convert to their value type before calling m_f. Note that this
-      // disallows non-constant operations through m_f.
-      typename thrust::iterator_value<Iterator>::type x = *this->base();
-      return m_f(x);
-    }
-
-    THRUST_DISABLE_MSVC_WARNING_END(4172)
-
-    // tag this as mutable per Dave Abrahams in this thread:
-    // http://lists.boost.org/Archives/boost/2004/05/65332.php
-    mutable AdaptableUnaryFunction m_f;
-
-    /*! \endcond
-     */
-}; // end transform_iterator
-
-
-/*! \p make_transform_iterator creates a \p transform_iterator
- *  from an \c Iterator and \c AdaptableUnaryFunction.
- *
- *  \param it The \c Iterator pointing to the input range of the
- *            newly created \p transform_iterator.
- *  \param fun The \c AdaptableUnaryFunction used to transform the range pointed
- *             to by \p it in the newly created \p transform_iterator.
- *  \return A new \p transform_iterator which transforms the range at
- *          \p it by \p fun.
- *  \see transform_iterator
- */
-template <class AdaptableUnaryFunction, class Iterator>
-inline __host__ __device__
-transform_iterator<AdaptableUnaryFunction, Iterator>
-make_transform_iterator(Iterator it, AdaptableUnaryFunction fun)
-{
-  return transform_iterator<AdaptableUnaryFunction, Iterator>(it, fun);
-} // end make_transform_iterator
-
-/*! \} // end fancyiterators
- */
-
-/*! \} // end iterators
- */
-
-} // end thrust
-
diff --git a/spaces/ma-xu/LIVE/thrust/thrust/system/omp/detail/uninitialized_copy.h b/spaces/ma-xu/LIVE/thrust/thrust/system/omp/detail/uninitialized_copy.h
deleted file mode 100644
index bda06ac13e9ca1d14ee5e047986884f5207d3d2b..0000000000000000000000000000000000000000
--- a/spaces/ma-xu/LIVE/thrust/thrust/system/omp/detail/uninitialized_copy.h
+++ /dev/null
@@ -1,23 +0,0 @@
-/*
- *  Copyright 2008-2013 NVIDIA Corporation
- *
- *  Licensed under the Apache License, Version 2.0 (the "License");
- *  you may not use this file except in compliance with the License.
- *  You may obtain a copy of the License at
- *
- *      http://www.apache.org/licenses/LICENSE-2.0
- *
- *  Unless required by applicable law or agreed to in writing, software
- *  distributed under the License is distributed on an "AS IS" BASIS,
- *  WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
- *  See the License for the specific language governing permissions and
- *  limitations under the License.
- */
-
-#pragma once
-
-#include <thrust/detail/config.h>
-
-// this system inherits uninitialized_copy
-#include <thrust/system/cpp/detail/uninitialized_copy.h>
-
diff --git a/spaces/malteos/emnlp2022-papers/papers_with_urls.js b/spaces/malteos/emnlp2022-papers/papers_with_urls.js
deleted file mode 100644
index b96c03711b38c6bf789b73b4a098f9fbc2dcb713..0000000000000000000000000000000000000000
--- a/spaces/malteos/emnlp2022-papers/papers_with_urls.js
+++ /dev/null
@@ -1,2 +0,0 @@
-var data = [{"loc": [4.315114974975586, 4.121492385864258], "id": 1321, "title": "A Neural-Symbolic Approach to Natural Language Understanding", "authors": "Zhixuan Liu, Zihao Wang, Yuan Lin and Hang Li", "abstract": "Deep neural networks, empowered by pre-trained language models, have achieved remarkable results in natural language understanding (NLU) tasks. However, their performances can drastically deteriorate when logical reasoning is needed. This is because NLU in principle depends on not only analogical reasoning, which deep neural networks are good at, but also logical reasoning. According to the dual-process theory, analogical reasoning and logical reasoning are respectively carried out by System 1 and System 2 in the human brain. Inspired by the theory, we present a novel framework for NLU called Neural-Symbolic Processor (NSP), which performs analogical reasoning based on neural processing and logical reasoning based on both neural and symbolic processing. As a case study, we conduct experiments on two NLU tasks, question answering (QA) and natural language inference (NLI), when numerical reasoning (a type of logical reasoning) is necessary. The experimental results show that our method significantly outperforms state-of-the-art methods in both tasks.", "track": "Ethic Concerns:Efficient Methods for NLP", "label": 12, "url": "https://www.semanticscholar.org/reader/51571ce19e5e5af308acfeb62320581440926a38?experiments=&features=reader_skimming%3Atrue"}, {"loc": [5.696519374847412, 6.273229598999023], "id": 1810, "title": "Towards Intelligent Clinically-Informed Language Analyses of People with Bipolar Disorder and Schizophrenia", "authors": "Ankit Aich, Avery Quynh, Varsha Badal, Amy Pinkham, Philip Harvey, Colin Depp and Natalie Parde", "abstract": "NLP offers a myriad of opportunities to support mental health research. However, prior work has almost exclusively focused on social media data, for which diagnoses are difficult or impossible to validate.  We present a first-of-its-kind dataset of manually transcribed interactions with people clinically diagnosed with bipolar disorder and schizophrenia, as well as healthy controls. Data was collected through validated clinical tasks and paired with diagnostic measures.  We extract 100+ temporal, sentiment, psycholinguistic, emotion, and lexical features from the data and establish classification validity using a variety of models to study language differences between diagnostic groups. Our models achieve strong classification performance (maximum F1=0.93-0.96), and lead to the discovery of interesting associations between linguistic features and diagnostic class. It is our hope that this dataset will offer high value to clinical and NLP researchers, with potential for widespread broader impacts.", "track": "Ethic Concerns:Resources and Evaluation", "label": 1, "url": ""}, {"loc": [4.698927402496338, 6.977048397064209], "id": 2293, "title": "Towards Identifying Social Bias in Dialog Systems: Framework, Dataset, and Benchmark", "authors": "Jingyan ZHOU, Jiawen Deng, Fei Mi, Yitong Li, Yasheng Wang, Minlie Huang, Xin Jiang, Qun Liu and Helen Meng", "abstract": "Among all the safety concerns that hinder the deployment of open-domain dialog systems (e.g.,  offensive languages, biases, and toxic behaviors), social bias presents an insidious challenge. Addressing this challenge requires rigorous analyses and normative reasoning. In this paper, we focus our investigation on social bias measurement to facilitate the development of unbiased dialog systems. We first propose a novel Dial-Bias Framework for analyzing the social bias in conversations using a holistic method beyond bias lexicons or dichotomous annotations. Leveraging the proposed framework, we further introduce the CDial-Bias Dataset which is, to the best of our knowledge, the first annotated Chinese social bias dialog dataset. We also establish a fine-grained dialog bias measurement benchmark and conduct in-depth ablation studies to shed light on the utility of the detailed annotations in the proposed dataset. Finally, we evaluate representative Chinese generative models with our classifiers to unveil the presence of social bias in these systems.", "track": "Ethic Concerns:Ethics", "label": 21, "url": ""}, {"loc": [4.80926513671875, 8.684630393981934], "id": 3479, "title": "Cards Against AI: Predicting Humor in a Fill-in-the-blank Party Game", "authors": "Dan Ofer and Dafna Shahaf", "abstract": "Humor is an inherently social phenomenon, with humorous utterances shaped by what is socially and culturally accepted. Understanding humor is an important NLP challenge, with many applications to human-computer interactions. In this work we explore humor in the context of Cards Against Humanity -- a party game where players complete fill-in-the-blank statements using cards that can be offensive or politically incorrect.\n\nWe introduce a novel dataset of 300,000 online games of Cards Against Humanity, including 785K unique jokes, analyze it and provide insights. We trained machine learning models to predict the winning joke per game, achieving performance twice as good (20%) as random, even without any user information.\nOn the more difficult task of judging novel cards, we see the models' ability to generalize is moderate. \nInterestingly, we find that our models are primarily focused on punchline card, with the context having little impact.\nAnalyzing feature importance, we observe that short, crude, juvenile punchlines tend to win.", "track": "Ethic Concerns:Computational Social Science and Cultural Analytics", "label": 20, "url": "https://www.semanticscholar.org/reader/b79bbf6404f02eed49d24799205c8e45c0f8bef6?experiments=&features=reader_skimming%3Atrue"}, {"loc": [2.7227730751037598, 8.804580688476562], "id": 3506, "title": "ClinicalT5: A Generative Language Model for Clinical Text", "authors": "Qiuhao Lu, Dejing Dou and Thien Huu Nguyen", "abstract": "In the past few years, large pre-trained language models (PLMs) have been widely adopted in different areas and have made fundamental improvements over a variety of downstream tasks in natural language processing (NLP). Meanwhile, domain-specific variants of PLMs are being proposed to address the needs of domains that demonstrate a specific pattern of writing and vocabulary, e.g., BioBERT for the biomedical domain and ClinicalBERT for the clinical domain. Recently, generative language models like BART and T5 are gaining popularity with their competitive performance on text generation as well as on tasks cast as generative problems. However, in the clinical domain, such domain-specific generative variants are still underexplored. To address this need, our work introduces a T5-based text-to-text transformer model pre-trained on clinical text, i.e., ClinicalT5. We evaluate the proposed model both intrinsically and extrinsically over a diverse set of tasks across multiple datasets, and show that ClinicalT5 dramatically outperforms T5 in the domain-specific tasks and compares favorably with its close baselines.", "track": "Ethic Concerns:Language Modeling and Analysis of Language Models", "label": 2, "url": ""}, {"loc": [5.135379314422607, 12.309901237487793], "id": 2082, "title": "How well can Text-to-Image Generative Models understand Ethical Natural Language Interventions?", "authors": "Hritik Bansal, Da Yin, Masoud Monajatipoor and Kai-Wei Chang", "abstract": "Text-to-image generative models have achieved unprecedented success in generating high-quality images based on natural language descriptions. However, it is shown that these models tend to favor specific social groups when prompted with neutral text descriptions (e.g., `a photo of a lawyer'). Following Zhao et al. (2021), we study the effect on the diversity of the generated images when adding \\textit{ethical intervention} that supports equitable judgment (e.g., `if all individuals can be a lawyer irrespective of their gender') in the input prompts. To this end, we introduce an Ethical NaTural Language Interventions in Text-to-Image GENeration (ENTIGEN) benchmark dataset to evaluate the change in image generations conditional on ethical interventions across three social axes -- gender, skin color, and culture. Through CLIP-based and human evaluation on minDALL.E, DALL.E-mini and Stable Diffusion, we find that the model generations cover diverse social groups while preserving the image quality. In some cases, the generations would be anti-stereotypical (e.g., models tend to create images with individuals that are perceived as man when fed with prompts about makeup) in the presence of ethical intervention. Preliminary studies indicate that a large change in the model predictions is triggered by certain phrases such as `irrespective of gender' in the context of gender bias in the ethical interventions. We release code and annotated data at https://github.com/Hritikbansal/entigen\\_emnlp.", "track": "Ethic Concerns:Speech, Vision, Robotics, Multimodal Grounding", "label": 7, "url": "https://www.semanticscholar.org/reader/23c818b5df6a2c8f8837f0e69741164f01946fef?experiments=&features=reader_skimming%3Atrue"}, {"loc": [4.785617828369141, 6.930328369140625], "id": 4156, "title": "D4: a Chinese Dialogue Dataset for Depression-Diagnosis-Oriented Chat", "authors": "Binwei Yao, Chao Shi, Likai Zou, Lingfeng Dai, Mengyue Wu, Lu Chen, Zhen Wang and Kai Yu", "abstract": "In a depression-diagnosis-directed clinical session, doctors initiate a conversation with ample emotional support that guides the patients to expose their symptoms based on clinical diagnosis criteria. Such a dialogue system is distinguished from existing single-purpose human-machine dialog systems, as it combines task-oriented and chit-chats with uniqueness in dialogue topics and procedures. However, due to the social stigma associated with mental illness, the dialogue data related to depression consultation and diagnosis are rarely disclosed. Based on clinical depression diagnostic criteria ICD-11 and DSM-5, we designed a 3-phase procedure to construct D$^4$: a Chinese Dialogue Dataset for Depression-Diagnosis-Oriented Chat, which simulates the dialogue between doctors and patients during the diagnosis of depression, including diagnosis results and symptom summary given by professional psychiatrists for each conversation. Upon the newly-constructed dataset, four tasks mirroring the depression diagnosis process are established: response generation, topic prediction, dialog summary, and severity classification of depressive episode and suicide risk. Multi-scale evaluation results demonstrate that a more empathy-driven and diagnostic-accurate consultation dialogue system trained on our dataset can be achieved compared to rule-based bots.", "track": "Ethic Concerns:Dialogue and Interactive Systems", "label": 4, "url": "https://www.semanticscholar.org/reader/29a1f9942b7b7070bfced1bdb7d33142afb61ca2?experiments=&features=reader_skimming%3Atrue"}, {"loc": [8.15729808807373, 2.99759840965271], "id": 2865, "title": "Quantifying Privacy Risks of Masked Language Models Using Membership Inference Attacks", "authors": "Fatemehsadat Mireshghallah, Kartik Goyal, Archit Uniyal, Taylor Berg-Kirkpatrick and Reza Shokri", "abstract": "The wide adoption and application of Masked language models~(MLMs) on sensitive data (from legal to medical) necessitates a thorough quantitative investigation into their privacy vulnerabilities. \nPrior attempts at measuring leakage of MLMs via membership inference attacks have been inconclusive, implying potential robustness of MLMs to privacy attacks.\nIn this work, we posit that prior attempts were inconclusive because they based their attack solely on the MLM's model score. We devise a stronger membership inference attack based on likelihood ratio hypothesis testing that involves an additional reference MLM  to more accurately quantify the privacy risks of memorization in MLMs. We show that masked language models are indeed susceptible to likelihood ratio membership inference attacks: Our empirical results, on models trained on medical notes, show that our attack improves the AUC of prior membership inference attacks from $0.66$ to an alarmingly high $0.90$ level.", "track": "Ethic Concerns:Ethics", "label": 21, "url": "https://www.semanticscholar.org/reader/cc3b41c4d2ededb94b481089633ecb43d6b2162f?experiments=&features=reader_skimming%3Atrue"}, {"loc": [4.040225982666016, 4.001230716705322], "id": 114, "title": "LogicSolver: Towards Interpretable Math Word Problem Solving with Logical Prompt-enhanced Learning", "authors": "Zhicheng Yang, Jinghui Qin, Jiaqi Chen, Liang Lin and Xiaodan Liang", "abstract": "Recently, deep learning models have made great progress in MWP solving on answer accuracy. However, they are uninterpretable since they mainly rely on shallow heuristics to achieve high performance without understanding and reasoning the grounded math logic. To address this issue and make a step towards interpretable MWP solving, we first construct a high-quality MWP dataset named InterMWP which consists of 11,495 MWPs and annotates interpretable logical formulas based on algebraic knowledge as the grounded linguistic logic of each solution equation. Different from existing MWP datasets, our InterMWP benchmark asks for a solver to not only output the solution expressions but also predict the corresponding logical formulas. We further propose a novel approach with logical prompt and interpretation generation, called LogicSolver. For each MWP, our LogicSolver first retrieves some highly-correlated algebraic knowledge and then passes them to the backbone model as prompts to improve the semantic representations of MWPs. With these improved semantic representations, our LogicSolver generates corresponding solution expressions and interpretable knowledge formulas in accord with the generated solution expressions, simultaneously. Experimental results show that our LogicSolver has stronger logical formula-based interpretability than baselines while achieving higher answer accuracy with the help of logical prompts, simultaneously. The source code and dataset will be available at https://github.com/yangzhch6/InterMWP.", "track": "NLP Applications", "label": 0, "url": ""}, {"loc": [4.834019184112549, 3.218323230743408], "id": 127, "title": "Commonsense Knowledge Salience Evaluation with a Benchmark Dataset in E-commerce", "authors": "Yincen Qu, Ningyu Zhang, Hui Chen, zelin Dai, Chengming Wang, Xiaoyu Wang, Qiang Chen and Huajun Chen", "abstract": "In e-commerce, the salience of commonsense knowledge (CSK) is beneficial for widespread applications such as product search and recommendation. For example, when users search for ``running'' in e-commerce, they would like to find products highly related to running, such as ``running shoes'' rather than ``shoes''. Nevertheless, many existing CSK collections rank statements solely by confidence scores, and there is no information about which ones are salient from a human perspective. In this work, we define the task of supervised salience evaluation, where given a CSK triple, the model is required to learn whether the triple is salient or not. In addition to formulating the new task, we also release a new Benchmark dataset of Salience Evaluation in E-commerce (BSEE) and hope to promote related research on commonsense knowledge salience evaluation. We conduct experiments in the dataset with several representative baseline models. The experimental results show that salience evaluation is a hard task where models perform poorly on our evaluation set. We further propose a simple but effective approach, PMI-tuning, which shows promise for solving this novel problem. Code is available in https://github.com/OpenBGBenchmark/OpenBG-CSK.", "track": "Resources and Evaluation", "label": 1, "url": "https://www.semanticscholar.org/reader/82daf49155c62391209eb741b8ccf3e82782cc36?experiments=&features=reader_skimming%3Atrue"}, {"loc": [0.9843170642852783, 8.041421890258789], "id": 138, "title": "Automatic Rule Induction for Efficient Semi-Supervised Learning", "authors": "Reid Pryzant, Ziyi Yang, Yichong Xu, Chenguang Zhu and Michael Zeng", "abstract": "Semi-supervised learning has shown promise in allowing NLP models to generalize from small amounts of labeled data. Meanwhile, pretrained transformer models act as black-box correlation engines that are difficult to explain and sometimes behave unreliably. In this paper, we propose tackling both of these challenges via Automatic Rule Induction (ARI), a simple and general-purpose framework for the automatic discovery and integration of symbolic rules into pretrained transformer models. First, we extract weak symbolic rules from low-capacity machine learning models trained on small amounts of labeled data. Next, we use an attention mechanism to integrate these rules into high-capacity pretrained transformer models. Last, the rule-augmented system becomes part of a self-training framework to boost supervision signal on unlabeled data. These steps can be layered beneath a variety of existing weak supervision and semi-supervised NLP algorithms in order to improve performance and interpretability. Experiments across nine sequence classification and relation extraction tasks suggest that ARI can improve state-of-the-art methods with no manual effort and minimal computational overhead.", "track": "Efficient Methods for NLP", "label": 12, "url": ""}, {"loc": [7.485325336456299, 6.756872177124023], "id": 143, "title": "Improving Semantic Matching through Dependency-Enhanced Pre-trained Model with Adaptive Fusion", "authors": "Jian Song, Di Liang, Rumei Li, Yuntao Li, Sirui Wang, Minlong Peng, Wei Wu and Yongxin Yu", "abstract": "Transformer-based pre-trained models like BERT have achieved great progress on Semantic Sentence Matching. Meanwhile, dependency prior knowledge has also shown general benefits in multiple NLP tasks. However, how to efficiently integrate dependency prior structure into pre-trained models to better model complex semantic matching relations is still unsettled. In this paper, we propose the Dependency-Enhanced Adaptive Fusion Attention (DAFA), which explicitly introduces dependency structure into pre-trained models and adaptively fuses it with semantic information. Specifically, (i) DAFA first proposes a structure-sensitive paradigm to construct a dependency matrix for calibrating attention weights. (ii) It adopts an adaptive fusion module to integrate the obtained dependency information and the original semantic signals. Moreover, DAFA reconstructs the attention calculation flow and provides better interpretability. By applying it on BERT, our method achieves state-of-the-art or competitive performance on 10 public datasets, demonstrating the benefits of adaptively fusing dependency structure in semantic matching task.", "track": "Semantics: Lexical, Sentence level, Textual Inference and Other areas", "label": 8, "url": "https://www.semanticscholar.org/reader/8e8cda070f8672bb1b855acf07411efa59b5dbc7?experiments=&features=reader_skimming%3Atrue"}, {"loc": [8.616013526916504, 8.116327285766602], "id": 150, "title": "Sparse Mixers: Combining MoE and Mixing to build a more efficient BERT", "authors": "James Lee-Thorp and Joshua Ainslie", "abstract": "We combine the capacity of sparsely gated Mixture-of-Experts (MoE) with the speed and stability of linear, mixing transformations to design the Sparse Mixer encoder model. Sparse Mixer slightly outperforms BERT on GLUE and SuperGLUE, but more importantly trains 65% faster and runs inference 61% faster. We also present a faster variant, prosaically named Fast Sparse Mixer, that marginally underperforms BERT on SuperGLUE, but trains and runs nearly twice as fast. We justify the design of these two models by carefully ablating through various mixing mechanisms, MoE configurations, and hyperparameters. Sparse Mixer overcomes many of the latency and stability concerns of MoE models and offers the prospect of serving sparse student models, without resorting to distilling them to dense variants.", "track": "Efficient Methods for NLP", "label": 12, "url": "https://www.semanticscholar.org/reader/7618f17179bb316002cb6cc472d61382776af6b7?experiments=&features=reader_skimming%3Atrue"}, {"loc": [4.743602275848389, 3.252457618713379], "id": 159, "title": "KE-GCL: Knowledge Enhanced Graph Contrastive Learning for Commonsense Question Answering", "authors": "Lihui Zhang and Ruifan Li", "abstract": "Commonsense question answering (CQA) aims to choose the correct answers for commonsense questions. Most existing works focus on extracting and reasoning over external knowledge graphs (KG). However, the noise in KG prevents these models from learning effective representations. In this paper, we propose a Knowledge Enhanced Graph Contrastive Learning model (KE-GCL) by incorporating the contextual descriptions of entities and adopting a graph contrastive learning scheme. Specifically, for QA pairs we represent the knowledge from KG and contextual descriptions. Then, the representations of contextual descriptions as context nodes are inserted into KG, forming the knowledge-enhanced graphs.\nMoreover, we design a contrastive learning method on graphs. For knowledge-enhanced graphs, we build their augmented views with an adaptive sampling strategy. After that, we reason over graphs to update their representations by scattering edges and aggregating nodes. To further improve GCL, hard graph negatives are chosen based on incorrect answers. Extensive experiments on two benchmark datasets demonstrate the effectiveness of our proposed KE-GCL, which outperforms previous methods consistently.", "track": "Question Answering", "label": 11, "url": ""}, {"loc": [6.9270710945129395, 6.083178520202637], "id": 161, "title": "Acceptability Judgements via Examining the Topology of Attention Maps", "authors": "Daniil Cherniavskii, Eduard Tulchinskii, Vladislav Mikhailov, Irina Proskurina, Laida Kushnareva, Ekaterina Artemova, Serguei Barannikov, Irina Piontkovskaya, Dmitri Piontkovski and Evgeny Burnaev", "abstract": "The role of the attention mechanism in encoding linguistic knowledge has received special interest in NLP. However, the ability of the attention heads to judge the grammatical acceptability of a sentence has been underexplored. This paper approaches the paradigm of acceptability judgments with topological data analysis (TDA), showing that the geometric properties of the attention graph can be efficiently exploited for two standard practices in linguistics: binary judgments and linguistic minimal pairs. Topological features enhance the BERT-based acceptability classifier scores by $8$\\%-$24$\\% on \\textsc{CoLA} in three languages (English, Italian, and Swedish). By revealing the topological discrepancy between attention maps of minimal pairs, we achieve the human-level performance on the \\textsc{BLiMP} benchmark, outperforming nine statistical and Transformer LM baselines. At the same time, TDA provides the foundation for analyzing the linguistic functions of attention heads and interpreting the correspondence between the graph features and grammatical phenomena. We publicly release the code and other materials used in the experiments.", "track": "Machine Learning for NLP", "label": 3, "url": "https://www.semanticscholar.org/reader/4f05bb8ef87b7e723f72f19af1d8dab6e54291de?experiments=&features=reader_skimming%3Atrue"}, {"loc": [7.800222396850586, 9.005216598510742], "id": 170, "title": "Clip-Tuning: Towards Derivative-free Prompt Learning with a Mixture of Rewards", "authors": "Yekun Chai, Shuohuan Wang, Yu Sun, Hao Tian, Hua Wu and Haifeng Wang", "abstract": "Derivative-free prompt learning has emerged as a lightweight alternative to prompt tuning, which only requires model inference to optimize the prompts. However, existing work did not take full advantage of the over-parameterized characteristics of large pre-trained language models (PLMs). In this paper, we propose Clip-Tuning, a simple yet effective method that adopts diverse frozen \"thinned\" networks of PLMs to obtain *a mixture of rewards* and thus advance the derivative-free prompt learning. The thinned networks consist of all the hidden units that survive a stationary dropout strategy, whose inference predictions reflect an ensemble of partial views over prompted training samples. Our method outperforms previous gradient-free prompt learning methods and achieves parity with gradient-based counterparts on seven language understanding benchmarks under few-shot settings.", "track": "Language Modeling and Analysis of Language Models", "label": 2, "url": "https://www.semanticscholar.org/reader/aca584d4e5f4e80ef471cceefa8600b4daeddb2b?experiments=&features=reader_skimming%3Atrue"}, {"loc": [6.518729209899902, 1.8739672899246216], "id": 192, "title": "Soft-Labeled Contrastive Pre-Training for Function-Level Code Representation", "authors": "Xiaonan Li, Daya Guo, Yeyun Gong, Yun Lin, Yelong Shen, Xipeng Qiu, Daxin Jiang, Weizhu Chen and Nan Duan", "abstract": "Code contrastive pre-training has recently achieved significant progress on code-related tasks. In this paper, we present \\textbf{SCodeR}, a \\textbf{S}oft-labeled contrastive pre-training framework with two positive sample construction methods to learn functional-level \\textbf{Code} \\textbf{R}epresentation. Considering the relevance between codes in a large-scale code corpus, the soft-labeled contrastive pre-training can obtain fine-grained soft-labels through an iterative adversarial manner and use them to learn better code representation. The positive sample construction is another key for contrastive pre-training. Previous works use transformation-based methods like variable renaming to generate semantically equal positive codes. However, they usually result in the generated code with a highly similar surface form, and thus mislead the model to focus on superficial code structure instead of code semantics. To encourage SCodeR to capture semantic information from the code, we utilize code comments and abstract syntax sub-trees of the code to build positive samples. We conduct experiments on four code-related tasks over seven datasets. Extensive experimental results show that SCodeR achieves new state-of-the-art performance on all of them, which illustrates the effectiveness of the proposed pre-training method.", "track": "Semantics: Lexical, Sentence level, Textual Inference and Other areas", "label": 8, "url": "https://www.semanticscholar.org/reader/8ffe7b7eeddbd4c22d642b0a48379d17e61c3bab?experiments=&features=reader_skimming%3Atrue"}, {"loc": [5.83168888092041, 11.847955703735352], "id": 195, "title": "Conditioned Masked Language and Image Modeling for Image-Text Dense Retrieval", "authors": "Ziyang Luo, Yadong Xi, Rongsheng Zhang, GongZheng Li, Zeng Zhao and Jing Ma", "abstract": "Image-text retrieval is a fundamental cross-modal task that takes image/text as a query to retrieve relevant data of another type. The large-scale two-stream pre-trained models like CLIP have achieved tremendous success in this area. They embed the images and texts into instance representations with two separate encoders, aligning them on the instance-level with contrastive learning. Beyond this, the following works adopt the fine-grained token-level interaction (Masked Language and Image Modeling) to boost performance further. However, the vanilla token-level objectives are not designed to aggregate the image-text alignment information into the instance representations, but the token representations, causing a gap between pre-training and application. To address this issue, we carefully design two novel conditioned token-level pre-training objectives, Conditioned Masked Language and Image Modeling (ConMLM and ConMIM), forcing models to aggregate the token-level alignment information into the instance representations. Combing with the instance-level contrastive learning, we propose our cross-modal dense retrieval framework, Conditioned Language-Image Pre-training (ConLIP). Experimental results on two popular cross-modal retrieval benchmarks (MSCOCO and Flickr30k) reveal the effectiveness of our methods.", "track": "Speech, Vision, Robotics, Multimodal Grounding", "label": 7, "url": ""}, {"loc": [10.305691719055176, 7.725064754486084], "id": 199, "title": "Does Simultaneous Speech Translation need Simultaneous Models?", "authors": "Sara Papi, Marco Gaido, Matteo Negri and Marco Turchi", "abstract": "In simultaneous speech translation (SimulST), finding the best trade-off between high output quality and low latency is a challenging task. To meet the latency constraints posed by different application scenarios, multiple dedicated SimulST models are usually trained and maintained, generating high computational costs. \nIn this paper, also motivated by the increased sensitivity towards sustainable AI, we investigate whether a single model trained offline can serve both offline and simultaneous applications under different latency regimes without additional training or adaptation. Experiments on en->{de, es} show that, aside from facilitating the adoption of well-established offline architectures and training strategies without affecting latency, offline training achieves similar or better quality compared to the standard SimulST training protocol, also being competitive with the state-of-the-art system.", "track": "Machine Translation", "label": 10, "url": "https://www.semanticscholar.org/reader/2a044612d4d9cd0d67d53247f6c11de0373044a3?experiments=&features=reader_skimming%3Atrue"}, {"loc": [6.16766357421875, 12.596125602722168], "id": 200, "title": "Utilizing Language-Image Pretraining for Efficient and Robust Bilingual Word Alignment", "authors": "Tuan Q. Dinh, Jy-yong Sohn, Shashank Rajput, Timothy Z. Ossowski, Yifei Ming, Junjie Hu, Dimitris Papailiopoulos and Kangwook Lee", "abstract": "Word translation without parallel corpora has become feasible, rivaling the performance of supervised methods. \nRecent findings have shown the improvement in accuracy and robustness of unsupervised word translation (UWT) by utilizing visual observations, which are universal representations across languages.\nOur work investigates the potential of using not only visual observations but also pretrained language-image models for enabling a more efficient and robust UWT. \nWe develop a novel UWT method dubbed Word Alignment using Language-Image Pretraining (WALIP), leveraging visual observations via the shared image-text embedding space of CLIPs  (Radford et al., 2021). \nWALIP has a two-step procedure. \nFirst, we retrieve word pairs with high confidences of similarity, computed using our proposed image-based fingerprints, which define the initial pivot for the alignment.\nSecond, we apply our robust Procrustes algorithm to estimate the linear mapping between two embedding spaces, which iteratively corrects and refines the estimated alignment.\nOur extensive experiments show that WALIP improves upon the state-of-the-art performance of bilingual word alignment for a few language pairs across different word embeddings and displays great robustness to the dissimilarity of language pairs or training corpora for two word embeddings.", "track": "Machine Learning for NLP", "label": 3, "url": "https://www.semanticscholar.org/reader/42d1bf3c14a28544e046fc02dcd7c0fffd238a1b?experiments=&features=reader_skimming%3Atrue"}, {"loc": [1.7067770957946777, 5.303996562957764], "id": 203, "title": "Grape: Knowledge Graph Enhanced Passage Reader for Open-domain Question Answering", "authors": "Mingxuan Ju, Wenhao Yu, Tong Zhao, Chuxu Zhang and Yanfang Ye", "abstract": "A common thread of open-domain question answering (QA) models employs a retriever-reader pipeline that first retrieves a handful of relevant passages from Wikipedia and then peruses the passages to produce an answer. However, even state-of-the-art readers fail to capture the complex relationships between entities appearing in questions and retrieved passages, leading to answers that contradict the facts. In light of this, we propose a novel knowledge graph enhanced passage reader, namely Grape, to improve the reader performance for open-domain QA. Specifically, for each pair of question and retrieved passage, we first construct a localized bipartite graph, attributed to entity embeddings extracted from the intermediate layer of the reader model. Then, a graph neural network learns relational knowledge while fusing graph and contextual representations into the hidden states of the reader model. Experiments on three open-domain QA benchmarks show Grape can improve the state-of-the-art performance by up to 2.2 exact match score with a negligible overhead increase, with the same retriever and retrieved passages. Our code is publicly available at https://github.com/jumxglhf/GRAPE.", "track": "Question Answering", "label": 11, "url": "https://www.semanticscholar.org/reader/397ea2e5e4dae1bc9250458cf7d696cdf3200e40?experiments=&features=reader_skimming%3Atrue"}, {"loc": [4.17355489730835, 9.2208833694458], "id": 216, "title": "NarraSum: A Large-Scale Dataset for Abstractive Narrative Summarization", "authors": "Chao Zhao, Faeze Brahman, Kaiqiang Song, Wenlin Yao, Dian Yu and Snigdha Chaturvedi", "abstract": "Narrative summarization aims to produce a distilled version of a narrative to describe its most salient events and characters. Writing a summary for a narrative is challenging as it requires an understanding of event causality and character behaviors. To encourage research in this direction, we propose NarraSum, a large-scale narrative summarization dataset. It contains 122K narratives, which are collected from the synopses of movies and TV episodes with diverse genres, and their corresponding abstractive summaries. Experiments show that there is a large performance gap between humans and the state-of-the-art summarization models on NarraSum. We hope that this dataset will promote future research in summarization, as well as broader studies of natural language understanding and generation. The dataset is available at https://github.com/zhaochaocs/narrasum.", "track": "Summarization", "label": 14, "url": ""}, {"loc": [10.94374942779541, 6.763333320617676], "id": 238, "title": "NMTScore: A Multilingual Analysis of Translation-based Text Similarity Measures", "authors": "Jannis Vamvas and Rico Sennrich", "abstract": "Being able to rank the similarity of short text segments is an interesting bonus feature of neural machine translation. Translation-based similarity measures include direct and pivot translation probability, as well as translation cross-likelihood, which has not been studied so far. We analyze these measures in the common framework of multilingual NMT, releasing the NMTScore library. Compared to baselines such as sentence embeddings, translation-based measures prove competitive in paraphrase identification and are more robust against adversarial or multilingual input, especially if proper normalization is applied. When used for reference-based evaluation of data-to-text generation in 2 tasks and 17 languages, translation-based measures show a relatively high correlation to human judgments.", "track": "Multilinguality", "label": 13, "url": "https://www.semanticscholar.org/reader/8ab82ac0b80e67a63e19303db2342d29bfae003b?experiments=&features=reader_skimming%3Atrue"}, {"loc": [6.687414646148682, 6.286711692810059], "id": 244, "title": "Language Models Understand Us, Poorly", "authors": "Jared Moore", "abstract": "Some claim language models understand us. Others won't hear it. To clarify, I investigate three views of human language understanding: as-mapping, as-reliability and as-representation. I argue that while behavioral reliability is necessary for understanding, internal representations are sufficient; they climb the right hill. I review state-of-the-art language and multi-modal models: they are pragmatically challenged by under-specification of form. I question the Scaling Paradigm: limits on resources may prohibit scaled-up models from approaching understanding. Last, I describe how as-representation advances a science of understanding. We need work which probes model internals, adds more of human language, and measures what models can learn.", "track": "Theme Track", "label": 18, "url": "https://www.semanticscholar.org/reader/5c02d55fe14e2baf4b6b59a476ee6a20698397ef?experiments=&features=reader_skimming%3Atrue"}, {"loc": [3.9041643142700195, 7.2275800704956055], "id": 246, "title": "Dialogue Meaning Representation for Task-Oriented Dialogue Systems", "authors": "Xiangkun Hu, Junqi Dai, Hang Yan, Yi Zhang, Qipeng Guo, Xipeng Qiu and Zheng Zhang", "abstract": "Dialogue meaning representation formulates natural language utterance semantics in their conversational context in an explicit and machine-readable form. Previous work typically follows the intent-slot framework, which is easy for annotation yet limited in scalability for complex linguistic expressions. A line of works alleviates the representation issue by introducing hierarchical structures but challenging to express complex compositional semantics, such as negation and coreference. We propose  Dialogue Meaning Representation (DMR), a pliable and easily extendable representation for task-oriented dialogue. Our representation contains a set of nodes and edges to represent rich compositional semantics. Moreover, we propose  an inheritance hierarchy mechanism focusing on   domain extensibility. Additionally, we annotated DMR-FastFood, a multi-turn dialogue dataset with more than 70k utterances, with DMR. We propose two evaluation tasks to evaluate different dialogue models and a novel coreference resolution model GNNCoref for the graph-based coreference resolution task. Experiments show that DMR can be parsed well with pre-trained Seq2Seq models, and GNNCoref outperforms the baseline models by a large margin.The dataset and code are available at https://github.com/amazon-research/dialogue-meaning-representation", "track": "Dialogue and Interactive Systems", "label": 4, "url": "https://www.semanticscholar.org/reader/e4eeffb8f9ba530347d98fd2c785d22e919c47a7?experiments=&features=reader_skimming%3Atrue"}, {"loc": [10.83725643157959, 9.356719970703125], "id": 255, "title": "Learning from the Dictionary: Heterogeneous Knowledge Guided Fine-tuning for Chinese Spell Checking", "authors": "Yinghui Li, Shirong Ma, Qingyu Zhou, Zhongli Li, Li Yangning, Shulin Huang, Ruiyang Liu, Chao Li, Yunbo Cao and Haitao Zheng", "abstract": "Chinese Spell Checking (CSC) aims to detect and correct Chinese spelling errors. Recent researches start from the pretrained knowledge of language models and take multimodal information into CSC models to improve the performance. However, they overlook the rich knowledge in the dictionary, the reference book where one can learn how one character should be pronounced, written, and used. In this paper, we propose the LEAD framework, which renders the CSC model to learn heterogeneous knowledge from the dictionary in terms of phonetics, vision, and meaning. LEAD first constructs positive and negative samples according to the knowledge of character phonetics, glyphs, and definitions in the dictionary. Then a unified contrastive learning-based training scheme is employed to refine the representations of the CSC models. Extensive experiments and detailed analyses on the SIGHAN benchmark datasets demonstrate the effectiveness of our proposed methods.", "track": "NLP Applications", "label": 0, "url": "https://www.semanticscholar.org/reader/0e4b8867274af148e4ea3777f5263a6119f91ecc?experiments=&features=reader_skimming%3Atrue"}, {"loc": [1.8112585544586182, 3.924349308013916], "id": 277, "title": "Salient Phrase Aware Dense Retrieval: Can a Dense Retriever Imitate a Sparse One?", "authors": "Xilun Chen, Kushal Lakhotia, Barlas Oguz, Anchit Gupta, Patrick Lewis, Stan Peshterliev, Yashar Mehdad, Sonal Gupta and Wen-tau Yih", "abstract": "Despite their recent popularity and well-known advantages, dense retrievers still lag behind sparse methods such as BM25 in their ability to reliably match salient phrases and rare entities in the query and to generalize to out-of-domain data. It has been argued that this is an inherent limitation of dense models. We rebut this claim by introducing the Salient Phrase Aware Retriever (SPAR), a dense retriever with the lexical matching capacity of a sparse model. We show that a dense Lexical Model \u039b can be trained to imitate a sparse one, and SPAR is built by augmenting a standard dense retriever with \u039b. Empirically, SPAR shows superior performance on a range of tasks including five question answering datasets, MS MARCO passage retrieval, as well as the EntityQuestions and BEIR benchmarks for out-of-domain evaluation, exceeding the performance of state-of-the-art dense and sparse retrievers. The code and models of SPAR are available at: https://github.com/facebookresearch/dpr-scale/tree/main/spar", "track": "Information Retrieval and Text Mining", "label": 15, "url": "https://www.semanticscholar.org/reader/3f90c820417b4a770bbf74cd0bd7da0ded91f63b?experiments=&features=reader_skimming%3Atrue"}, {"loc": [6.044088363647461, 12.28160572052002], "id": 278, "title": "SMARTAVE: Structured Multimodal Transformer for Product Attribute Value Extraction", "authors": "Qifan Wang, Li Yang, Jingang Wang, Jitin Krishnan, Bo Dai, Sinong Wang, Zenglin Xu, Madian Khabsa and Hao Ma", "abstract": "Automatic product attribute value extraction refers to the task of identifying values of an attribute from the product information. Product attributes are essential in improving online shopping experience for customers. Most existing methods focus on extracting attribute values from product title and description.\nHowever, in many real-world applications, a product is usually represented by multiple modalities beyond title and description, such as product specifications, text and visual information from the product image, etc. In this paper, we propose \\textsc{SMARTAVE}, a \\underline{S}tructure \\underline{M}ltimodal tr\\underline{A}nsforme\\underline{R} for produc\\underline{T} \\underline{A}ttribute \\underline{V}alue \\underline{E}xtraction, which jointly encodes the structured product information from multiple modalities. Specifically, in \\textsc{SMARTAVE} encoder, we introduce hyper-tokens to represent the modality-level information, and local-tokens to represent the original text and visual inputs. Structured attention patterns are designed among the hyper-tokens and local-tokens for learning effective product representation. The attribute values are then extracted based on the learned embeddings. We conduct extensive experiments on two multimodal product datasets. Experimental results demonstrate the superior performance of the proposed approach over several state-of-the-art methods. Ablation studies validate the effectiveness of the structured attentions in modeling the multimodal product information.", "track": "NLP Applications", "label": 0, "url": ""}, {"loc": [6.5096116065979, 1.873337984085083], "id": 283, "title": "When Language Model Meets Private Library", "authors": "Zan Daoguang, Bei Chen, Zeqi Lin, Bei Guan, Wang Yongji and Jian-Guang LOU", "abstract": "With the rapid development of pre-training techniques, a number of language models have been pre-trained on large-scale code corpora and perform well in code generation. In this paper, we investigate how to equip pre-trained language models with the ability of code generation for private libraries. In practice, it is common for programmers to write code using private libraries. However, this is a challenge for language models since they have never seen private APIs during training. Motivated by the fact that private libraries usually come with elaborate API documentation, we propose a novel framework with two modules: the APIRetriever finds useful APIs, and then the APICoder generates code using these APIs. For APIRetriever, we present a dense retrieval system and also design a friendly interaction to involve uses. For APICoder, we can directly use off-the-shelf language models, or continually pre-train the base model on a code corpus containing API information. Both modules are trained with data from public libraries and can be generalized to private ones. Furthermore, we craft three benchmarks for private libraries, named TorchDataEval, MonkeyEval, and BeatNumEval. Experimental results demonstrate the impressive performance of our framework.", "track": "Language Modeling and Analysis of Language Models", "label": 2, "url": ""}, {"loc": [1.0787960290908813, 10.538798332214355], "id": 285, "title": "Cross-Domain Sentiment Classification using Semantic Representation", "authors": "Shichen Li, Zhongqing Wang, Xiaotong Jiang and Guodong Zhou", "abstract": "Previous studies on cross-domain sentiment classification depend on the pivot features or utilize the target data for representation learning, which ignore the semantic relevance between different domains. To this end, we exploit Abstract Meaning Representation (AMR) to help with cross-domain sentiment classification. Compared with the textual input, AMR reduces data sparsity and explicitly provides core semantic knowledge and correlations between different domains. In particular, we develop an algorithm to construct a sentiment-driven semantic graph from sentence-level AMRs. We further design two strategies to linearize the semantic graph and propose a text-graph interaction model to fuse the text and semantic graph representations for cross-domain sentiment classification. Empirical studies show the effectiveness of our proposed model over several strong baselines. The results also indicate the importance of the proposed sentiment-driven semantic graph for cross-domain sentiment classification.", "track": "Sentiment Analysis, Stylistic Analysis, and Argument Mining", "label": 16, "url": ""}, {"loc": [8.229382514953613, 6.760915756225586], "id": 292, "title": "Yes-Yes-Yes: Proactive Data Collection for ACL Rolling Review and Beyond", "authors": "Nils Dycke, Ilia Kuznetsov and Iryna Gurevych", "abstract": "The shift towards publicly available text sources has enabled language processing at unprecedented scale, yet leaves under-serviced the domains where public and openly licensed data is scarce. Proactively collecting text data for research is a viable strategy to address this scarcity, but lacks systematic methodology taking into account the many ethical, legal and confidentiality-related aspects of data collection. Our work presents a case study on proactive data collection in peer review -- a challenging and under-resourced NLP domain. We outline ethical and legal desiderata for proactive data collection and introduce \"Yes-Yes-Yes\", the first donation-based peer reviewing data collection workflow that meets these requirements. We report on the implementation of Yes-Yes-Yes at ACL Rolling Review and empirically study the implications of proactive data collection for the dataset size and the biases induced by the donation behavior on the peer reviewing platform.", "track": "Ethic Concerns:Ethics", "label": 21, "url": "https://www.semanticscholar.org/reader/a5868a1823dd6dff8a551f31aeb1b555d258bb0a?experiments=&features=reader_skimming%3Atrue"}, {"loc": [5.748798370361328, 11.740848541259766], "id": 295, "title": "AssistSR: Task-oriented Video Segment Retrieval for Personal AI Assistant", "authors": "Weixian Lei, DIFEI GAO, Yuxuan Wang, Dongxing Mao, Zihan Liang, Lingmin Ran and Mike Zheng Shou", "abstract": "It is still a pipe dream that personal AI assistants on the phone and AR glasses can assist our daily life in addressing our questions like ``how to adjust the date for this watch?'' and ``how to set its heating duration? (while pointing at an oven)''. The queries used in conventional tasks (i.e. Video Question Answering, Video Retrieval, Moment Localization) are often factoid and based on pure text. In contrast, we present a new task called Task-oriented Question-driven Video Segment Retrieval (TQVSR). Each of our questions is an image-box-text query that focuses on affordance of items in our daily life and expects relevant answer segments to be retrieved from a corpus of instructional video-transcript segments. To support the study of this TQVSR task, we construct a new dataset called AssistSR. We design novel guidelines to create high-quality samples. This dataset contains 3.2k multimodal questions on 1.6k video segments from instructional videos on diverse daily-used items. To address TQVSR, we develop a simple yet effective model called Dual Multimodal Encoders (DME) that significantly outperforms several baseline methods while still having large room for improvement in the future. Moreover, we present detailed ablation analyses. Code and data are available at https://github.com/StanLei52/TQVSR.", "track": "Speech, Vision, Robotics, Multimodal Grounding", "label": 7, "url": "https://www.semanticscholar.org/reader/211f9cdb571b9ad3de070b84e76b7c747518031c?experiments=&features=reader_skimming%3Atrue"}, {"loc": [8.017842292785645, 3.1563735008239746], "id": 301, "title": "Dim-Krum: Backdoor-Resistant Federated Learning for NLP with Dimension-wise Krum-Based Aggregation", "authors": "Zhiyuan Zhang, Qi Su and Xu Sun", "abstract": "Despite the potential of federated learning, it is known to be vulnerable to backdoor attacks. Many robust federated aggregation methods are proposed to reduce the potential backdoor risk. However, they are mainly validated in the CV field. In this paper, we find that NLP backdoors are hard to defend against than CV, and we provide a theoretical analysis that the malicious update detection error probabilities are determined by the relative backdoor strengths. NLP attacks tend to have small relative backdoor strengths, which may result in the failure of robust federated aggregation methods for NLP attacks. Inspired by the theoretical results, we can choose some dimensions with higher backdoor strengths to settle this issue. We propose a novel federated aggregation algorithm, Dim-Krum, for NLP tasks, and experimental results validate its effectiveness.", "track": "Machine Learning for NLP", "label": 3, "url": "https://www.semanticscholar.org/reader/6abe5a55e30bbcaf14f94ab0fd080d88e2b60602?experiments=&features=reader_skimming%3Atrue"}, {"loc": [7.951749801635742, 3.2707250118255615], "id": 302, "title": "Fine-mixing: Mitigating Backdoors in Fine-tuned Language Models", "authors": "Zhiyuan Zhang, Lingjuan Lyu, Xingjun Ma, Chenguang Wang and Xu Sun", "abstract": "Deep Neural Networks (DNNs) are known to be vulnerable to backdoor attacks. In Natural Language Processing (NLP), DNNs are often backdoored during the fine-tuning process of a large-scale Pre-trained Language Model (PLM) with poisoned samples. Although the clean weights of PLMs are readily available, existing methods have ignored this information in defending NLP models against backdoor attacks. In this work, we take the first step to exploit the pre-trained (unfine-tuned) weights to mitigate backdoors in fine-tuned language models. Specifically, we leverage the clean pre-trained weights via two complementary techniques: (1) a two-step Fine-mixing technique, which first mixes the backdoored weights (fine-tuned on poisoned data) with the pre-trained weights, then fine-tunes the mixed weights on a small subset of clean data; (2) an Embedding Purification (E-PUR) technique, which mitigates potential backdoors existing in the word embeddings. We compare Fine-mixing with typical backdoor mitigation methods on three single-sentence sentiment classification tasks and two sentence-pair classification tasks and show that it outperforms the baselines by a considerable margin in all scenarios. We also show that our E-PUR method can benefit existing mitigation methods. Our work establishes a simple but strong baseline defense for secure fine-tuned NLP models against backdoor attacks.", "track": "Machine Learning for NLP", "label": 3, "url": "https://www.semanticscholar.org/reader/1e69f7b278ba4ae61fdbeb3330d041107287bd20?experiments=&features=reader_skimming%3Atrue"}, {"loc": [4.0858659744262695, 7.013349533081055], "id": 304, "title": "Language Models that Seek for Knowledge: Modular Search & Generation for Dialogue and Prompt Completion", "authors": "Kurt Shuster, Mojtaba Komeili, Leonard Adolphs, Stephen Roller, Arthur Szlam and Jason Weston", "abstract": "Language models (LMs) have recently been shown to generate more factual responses by employing modularity (Zhou et al., 2022) in combination with retrieval (Adolphs et al., 2021). We extend the recent approach of Adolphs et al. (2021) to include internet search as a module. Our SeeKeR (Search engine->Knowledge->Response) method thus applies a single LM to three modular tasks in succession: search, generating knowledge, and generating a final response. We show that, when using SeeKeR as a dialogue model, it outperforms the state-of-the-art model BlenderBot 2 (Chen et al., 2021) on open-domain knowledge-grounded conversations for the same number of parameters, in terms of consistency, knowledge and per-turn engagingness. SeeKeR applied to topical prompt completions as a standard language model outperforms GPT2 (Radford et al., 2019) and GPT3 (Brown et al., 2020) in terms of factuality and topicality, despite GPT3 being a vastly larger model. Our code and models are made publicly available.", "track": "Dialogue and Interactive Systems", "label": 4, "url": "https://www.semanticscholar.org/reader/f8292d4ddf7a6dfe240eeaa9685f5d18eed9a3f6?experiments=&features=reader_skimming%3Atrue"}, {"loc": [4.962996959686279, 4.583862781524658], "id": 309, "title": "Stretching Sentence-pair NLI Models to Reason over Long Documents and Clusters", "authors": "Tal Schuster, Sihao Chen, Senaka Buthpitiya, Alex Fabrikant and Donald Metzler", "abstract": "Natural Language Inference (NLI) has been extensively studied by the NLP community as a framework for estimating the semantic relation between sentence pairs. While early work identified certain biases in NLI models, recent advancements in modeling and datasets demonstrated promising performance.\nIn this work, we further explore the direct zero-shot applicability of NLI models to real applications, beyond the sentence-pair setting they were trained on. First, we analyze the robustness of these models to longer and out-of-domain inputs. Then, we develop new aggregation methods to allow operating over full documents, reaching state-of-the-art performance on the ContractNLI dataset. Interestingly, we find NLI scores to provide strong retrieval signals, leading to more relevant evidence extractions compared to common similarity-based methods. Finally, we go further and investigate whole document clusters to identify both discrepancies and consensus among sources. In a test case, we find real inconsistencies between Wikipedia pages in different languages about the same topic.", "track": "Semantics: Lexical, Sentence level, Textual Inference and Other areas", "label": 8, "url": ""}, {"loc": [0.8039590120315552, 8.054597854614258], "id": 313, "title": "Towards Realistic Low-resource Relation Extraction: A Benchmark with Empirical Baseline Study", "authors": "Xin Xu, Xiang Chen, Ningyu Zhang, Xin Xie, Xi Chen and Huajun Chen", "abstract": "This paper presents an empirical study to build relation extraction systems in low-resource settings. Based upon recent pre-trained language models, we comprehensively investigate three schemes to evaluate the performance in low-resource settings: (i) different types of prompt-based methods with few-shot labeled data; (ii) diverse balancing methods to address the long-tailed distribution issue; (iii) data augmentation technologies and self-training to generate more labeled in-domain data. We create a benchmark with 8 relation extraction (RE) datasets covering different languages, domains and contexts and perform extensive comparisons over the proposed schemes with combinations. Our experiments illustrate: (i) Though prompt-based tuning is beneficial in low-resource RE, there is still much potential for improvement, especially in extracting relations from cross-sentence contexts with multiple relational triples; (ii) Balancing methods are not always helpful for RE with long-tailed distribution; (iii) Data augmentation complements existing baselines and can bring much performance gain, while self-training may not consistently achieve advancement to low-resource RE. Code and datasets are in https://github.com/zjunlp/LREBench.", "track": "Information Extraction", "label": 5, "url": "https://www.semanticscholar.org/reader/145fb51975ec4ca72708bf354713f568a7541358?experiments=&features=reader_skimming%3Atrue"}, {"loc": [10.216456413269043, 6.932660102844238], "id": 319, "title": "CLLE: A Benchmark for Continual Language Learning Evaluation in Multilingual Machine Translation", "authors": "Han Zhang, Sheng Zhang, Yang Xiang, Bin Liang, Jinsong Su, Zhongjian Miao, Hui Wang and Ruifeng Xu", "abstract": "Continual Language Learning (CLL) in multilingual translation is inevitable when new languages are required to be translated. Due to the lack of unified and generalized benchmarks, the evaluation of existing methods is greatly influenced by experimental design which usually has a big gap from the industrial demands. In this work, we propose the first Continual Language Learning Evaluation benchmark CLLE in multilingual translation. CLLE consists of a Chinese-centric corpus --- CN-25 and two CLL tasks --- the close-distance language continual learning task and the language family continual learning task designed for real and disparate demands. Different from existing translation benchmarks, CLLE considers several restrictions for CLL, including domain distribution alignment, content overlap, language diversity, and the balance of corpus. Furthermore, we propose a novel framework COMETA based on Constrained Optimization and META-learning to alleviate catastrophic forgetting and dependency on history training data by using a meta-model to retain the important parameters for old languages. Our experiments prove that CLLE is a challenging CLL benchmark and that our proposed method is effective when compared with other strong baselines. Due to the construction of the corpus, the task designing and the evaluation method are independent of the centric language, we also construct and release the English-centric corpus EN-25 to facilitate academic research.", "track": "Machine Translation", "label": 10, "url": ""}, {"loc": [2.0562775135040283, 4.04571008682251], "id": 323, "title": "Lexicon-Enhanced Self-Supervised Training for Multilingual Dense Retrieval", "authors": "Houxing Ren, Linjun Shou, Jian Pei, Ning Wu, Ming Gong and Daxin Jiang", "abstract": "Recent multilingual pre-trained models have shown better performance in various multilingual tasks. However, these models perform poorly on multilingual retrieval tasks due to lacking multilingual training data. In this paper, we propose to mine and generate self-supervised training data based on a large-scale unlabeled corpus. We carefully design a mining method which combines the sparse and dense models to mine the relevance of unlabeled queries and passages. And we introduce a query generator to generate more queries in target languages for unlabeled passages. Through extensive experiments on Mr. TYDI dataset and an industrial dataset from a commercial search engine, we demonstrate that our method performs better than baselines based on various pre-trained multilingual models. Our method even achieves on-par performance with the supervised method on the latter dataset.", "track": "Multilinguality", "label": 13, "url": ""}, {"loc": [5.480278968811035, 5.108109951019287], "id": 333, "title": "Improve Interpretability of Neural Networks via Sparse Contrastive Coding", "authors": "Junhong Liu, Yijie Lin, Liang Jiang, Jia Liu, Zujie Wen and Xi Peng", "abstract": "Although explainable artificial intelligence (XAI) has achieved remarkable developments in recent years, there are few efforts have been devoted to the following problems, namely, i) how to develop an explainable method that could explain the black-box in a model-agnostic way? and ii) how to improve the performance and interpretability of the black-box using such explanations instead of pre-collected important attributions? To explore the potential solution, we propose a model-agnostic explanation method termed as Sparse Contrastive Coding (SCC) and verify its effectiveness in text classification and natural language inference. In brief, SCC explains the feature attributions which characterize the importance of words based on the hidden states of each layer of the model. With such word-level explainability, SCC adaptively divides the input sentences into foregrounds and backgrounds in terms of task relevance. Through maximizing the similarity between the foregrounds and input sentences while minimizing the similarity between the backgrounds and input sentences, SSC employs a supervised contrastive learning loss to boost the interpretability and performance of the model. Extensive experiments show the superiority of our method over five state-of-the-art methods in terms of interpretability and classification measurements. The code is available at https://pengxi.me.", "track": "Interpretability, Interactivity and Analysis of Models for NLP", "label": 9, "url": ""}, {"loc": [5.712814807891846, 10.663534164428711], "id": 334, "title": "LEMON: Language-Based Environment Manipulation via Execution-Guided Pre-training", "authors": "Qi Shi, Qian Liu, Bei Chen, Yu Zhang, Ting Liu and Jian-Guang LOU", "abstract": "Language-based environment manipulation requires agents to manipulate the environment following natural language instructions, which is challenging due to the huge space of the environments.\nTo address this challenge, various approaches have been proposed in recent work. Although these approaches work well for their intended environments, they are difficult to generalize across environments. In this work, we propose LEMON, a general framework for language-based environment manipulation tasks. Specifically, we first specify a general approach for language-based environment manipulation tasks, which can deal with various environments using the same generative language model. Then we propose an execution-guided pre-training strategy to inject prior knowledge of environments to the language model with a pure synthetic pre-training corpus. Experimental results on tasks including Alchemy, Scene, Tangrams, ProPara and Recipes demonstrate the effectiveness of LEMON: it achieves new state-of-the-art results on four of the tasks, and the execution-guided pre-training strategy brings remarkable improvements on all experimental tasks.", "track": "Dialogue and Interactive Systems", "label": 4, "url": "https://www.semanticscholar.org/reader/d6f9bd800d21ab71cb968cd48448530cdf8fff37?experiments=&features=reader_skimming%3Atrue"}, {"loc": [1.738396406173706, 9.108654022216797], "id": 335, "title": "CROP: Zero-shot Cross-lingual Named Entity Recognition with Multilingual Labeled Sequence Translation", "authors": "Jian Yang, Shaohan Huang, Shuming Ma, Yuwei Yin, Li Dong, Dongdong Zhang, hongcheng guo, Zhoujun Li and Furu Wei", "abstract": "Named entity recognition (NER) suffers from the scarcity of annotated training data, especially for low-resource languages without labeled data. Cross-lingual NER has been proposed to alleviate this issue by transferring knowledge from high-resource languages to low-resource languages via aligned cross-lingual representations or machine translation results. However, the performance of cross-lingual NER methods is severely affected by the unsatisfactory quality of translation or label projection. To address these problems, we propose a Cross-lingual Entity Projection framework (CROP) to enable zero-shot cross-lingual NER with the help of a multilingual labeled sequence translation model. Specifically, the target sequence is first translated into the source language and then tagged by a source NER model. We further adopt a labeled sequence translation model to project the tagged sequence back to the target language and label the target raw sentence. Ultimately, the whole pipeline is integrated into an end-to-end model by the way of self-training. Experimental results on two benchmarks demonstrate that our method substantially outperforms the previous strong baseline by a large margin of +3~7 F1 scores and achieves state-of-the-art performance.", "track": "Multilinguality", "label": 13, "url": "https://www.semanticscholar.org/reader/3e7d2160f58088297a8347a8273642ee484c7967?experiments=&features=reader_skimming%3Atrue"}, {"loc": [7.609042167663574, 12.30031681060791], "id": 339, "title": "Handling and Presenting Harmful Text in NLP Research", "authors": "Hannah Rose Kirk, Abeba Birhane, Bertie Vidgen and Leon Derczynski", "abstract": "Text data can pose a risk of harm. However, the risks are not fully understood, and how to handle, present, and discuss harmful text in a safe way remains an unresolved issue in the NLP community. We provide an analytical framework categorising harms on three axes: (1) the harm type (e.g., misinformation, hate speech or racial stereotypes); (2) whether a harm is sought as a feature of the research design if explicitly studying harmful content (e.g., training a hate speech classifier), versus unsought if harmful content is encountered when working on unrelated problems (e.g., language generation or part-of-speech tagging); and (3) who it affects, from people (mis)represented in the data to those handling the data and those publishing on the data. We provide advice for practitioners, with concrete steps for mitigating harm in research and in publication. To assist implementation we introduce HarmCheck -- a documentation standard for handling and presenting harmful text in research.", "track": "Theme Track", "label": 18, "url": "https://www.semanticscholar.org/reader/dbcaf58c85b5a75e517cdd3390994dca7b0bc3d4?experiments=&features=reader_skimming%3Atrue"}, {"loc": [6.437847137451172, 12.105864524841309], "id": 356, "title": "Multimodal Contrastive Learning via Uni-Modal Coding and Cross-Modal Prediction for Multimodal Sentiment Analysis", "authors": "Ronghao Lin and Haifeng Hu", "abstract": "Multimodal representation learning is a challenging task in which previous work mostly focus on either uni-modality pre-training or cross-modality fusion. In fact, we regard modeling multimodal representation as building a skyscraper, where laying stable foundation and designing the main structure are equally essential. The former is like encoding robust uni-modal representation while the later is like integrating interactive information among different modalities, both of which are critical to learning an effective multimodal representation. Recently, contrastive learning has been successfully applied in representation learning, which can be utilized as the pillar of the skyscraper and benefit the model to extract the most important features contained in the multimodal data. In this paper, we propose a novel framework named MultiModal Contrastive Learning (MMCL) for multimodal representation to capture intra- and inter-modality dynamics simultaneously. Specifically, we devise uni-modal contrastive coding with an efficient uni-modal feature augmentation strategy to filter inherent noise contained in acoustic and visual modality and acquire more robust uni-modality representations. Besides, a pseudo siamese network is presented to predict representation across different modalities, which successfully captures cross-modal dynamics. Moreover, we design two contrastive learning tasks, instance- and sentiment-based contrastive learning, to promote the process of prediction and learn more interactive information related to sentiment. Extensive experiments conducted on two public datasets demonstrate that our method surpasses the state-of-the-art methods.", "track": "Speech, Vision, Robotics, Multimodal Grounding", "label": 7, "url": "https://www.semanticscholar.org/reader/a91332878b9f47c9eede80f4d0c4d15f7089439e?experiments=&features=reader_skimming%3Atrue"}, {"loc": [8.004697799682617, 9.306853294372559], "id": 359, "title": "Towards Unified Prompt Tuning for Few-shot Text Classification", "authors": "Jianing Wang, Chengyu Wang, Fuli Luo, Chuanqi Tan, Minghui Qiu, Fei Yang, Qiuhui Shi, Songfang Huang and Ming Gao", "abstract": "Prompt-based fine-tuning has boosted the performance of Pre-trained Language Models (PLMs) on few-shot text classification by employing task-specific prompts. Yet, PLMs are unfamiliar with prompt-style expressions during pre-training, which limits the few-shot learning performance on downstream tasks.\nIt would be desirable if the models can acquire some prompting knowledge before adapting to specific NLP tasks. We present the Unified Prompt Tuning (UPT) framework, leading to better few-shot text classification for BERT-style models by explicitly capturing prompting semantics from non-target NLP datasets. In UPT, a novel paradigm Prompt-Options-Verbalizer is proposed for joint prompt learning across different NLP tasks, forcing PLMs to capture task-invariant prompting knowledge. We further design a self-supervised task named Knowledge-enhanced Selective Masked Language Modeling to improve the PLM's generalization abilities for accurate adaptation to previously unseen tasks. After multi-task learning across multiple tasks, the PLM can be better prompt-tuned towards any dissimilar target tasks in low-resourced settings. Experiments over a variety of NLP tasks show that UPT consistently outperforms state-of-the-arts for prompt-based fine-tuning.", "track": "Information Retrieval and Text Mining", "label": 15, "url": "https://www.semanticscholar.org/reader/a221def07d3cd4f29c38234e271faf8a523e0f5a?experiments=&features=reader_skimming%3Atrue"}, {"loc": [5.389382362365723, 5.044684410095215], "id": 367, "title": "Can language models learn from explanations in context?", "authors": "Andrew Kyle Lampinen, Ishita Dasgupta, Stephanie C.Y. Chan, Kory Mathewson, MH Tessler, Antonia Creswell, James L. McClelland, Jane X. Wang and Felix Hill", "abstract": "Language Models (LMs) can perform new tasks by adapting to a few in-context examples. For humans, explanations that connect examples to task principles can improve learning. We therefore investigate whether explanations of few-shot examples can help LMs. We annotate questions from 40 challenging tasks with answer explanations, and various matched control explanations. We evaluate how different types of explanations, instructions, and controls affect zero- and few-shot performance. We analyze these results using statistical multilevel modeling techniques that account for the nested dependencies among conditions, tasks, prompts, and models. We find that explanations can improve performance\u2014even without tuning. Furthermore, explanations hand-tuned for performance on a small validation set offer substantially larger benefits, and building a prompt by selecting examples and explanations together substantially improves performance over selecting examples alone. Finally, even untuned explanations outperform carefully matched controls, suggesting that the benefits are due to the link between an example and its explanation, rather than lower-level features. However, only large models benefit. In summary, explanations can support the in-context learning of large LMs on challenging tasks.", "track": "Language Modeling and Analysis of Language Models", "label": 2, "url": "https://www.semanticscholar.org/reader/341bdbcfc3febef7691a97c216ad394653211095?experiments=&features=reader_skimming%3Atrue"}, {"loc": [1.8272124528884888, 4.037896156311035], "id": 368, "title": "GNN-encoder: Learning a Dual-encoder Architecture via Graph Neural Networks for Dense Passage Retrieval", "authors": "Jiduan Liu, Jiahao Liu, Yang Yang, Jingang Wang, Wei Wu, Dongyan Zhao and Rui Yan", "abstract": "Recently, retrieval models based on dense representations are dominant in passage retrieval tasks, due to their outstanding ability in terms of capturing semantics of input text compared to the traditional sparse vector space models. A common practice of dense retrieval models is to exploit a dual-encoder architecture to represent a query and a passage independently. Though efficient, such a structure loses interaction between the query-passage pair, resulting in inferior accuracy. To enhance the performance of dense retrieval models without loss of efficiency, we propose a GNN-encoder model in which query (passage) information is fused into passage (query) representations via graph neural networks that are constructed by queries and their top retrieved passages. By this means, we maintain a dual-encoder structure, and retain some interaction information between query-passage pairs in their representations, which enables us to achieve both efficiency and efficacy in passage retrieval. Evaluation results indicate that our method significantly outperforms the existing models on MSMARCO, Natural Questions and TriviaQA datasets, and achieves the new state-of-the-art on these datasets.", "track": "Information Retrieval and Text Mining", "label": 15, "url": "https://www.semanticscholar.org/reader/0e9e00c48b171ec13063bfcc6395809be91d5e8b?experiments=&features=reader_skimming%3Atrue"}, {"loc": [10.829519271850586, 9.34799575805664], "id": 384, "title": "Linguistic Rules-Based Corpus Generation for Native Chinese Grammatical Error Correction", "authors": "Shirong Ma, Yinghui Li, Rongyi Sun, Qingyu Zhou, Shulin Huang, Ding Zhang, Li Yangning, Ruiyang Liu, Zhongli Li, Yunbo Cao, Haitao Zheng and Ying Shen", "abstract": "Chinese Grammatical Error Correction (CGEC) is both a challenging NLP task and a common application in human daily life. Recently, many data-driven approaches are proposed for the development of CGEC research. However, there are two major limitations in the CGEC field: First, the lack of high-quality annotated training corpora prevents the performance of existing CGEC models from being significantly improved. Second, the grammatical errors in widely used test sets are not made by native Chinese speakers, resulting in a significant gap between the CGEC models and the real application. In this paper, we propose a linguistic rules-based approach to construct large-scale CGEC training corpora with automatically generated grammatical errors. Additionally, we present a challenging CGEC benchmark derived entirely from errors made by native Chinese speakers in real-world scenarios. Extensive experiments and detailed analyses not only demonstrate that the training data constructed by our method effectively improves the performance of CGEC models, but also reflect that our benchmark is an excellent resource for further development of the CGEC field.", "track": "Resources and Evaluation", "label": 1, "url": "https://www.semanticscholar.org/reader/090f0d79c35047881aab87d1b6ea313a3146ec33?experiments=&features=reader_skimming%3Atrue"}, {"loc": [5.562291145324707, 11.69875717163086], "id": 407, "title": "Rethinking the Video Sampling and Reasoning Strategies for Temporal Sentence Grounding", "authors": "Jiahao Zhu, Daizong Liu, Pan Zhou, Xing Di, Yu Cheng, Song Yang, Wenzheng Xu, Zichuan Xu, Yao Wan, Lichao Sun and Zeyu Xiong", "abstract": "Temporal sentence grounding (TSG) aims to identify the temporal boundary of a specific segment from an untrimmed video by a sentence query. All existing works first utilize a sparse sampling strategy to extract a fixed number of video frames and then interact them with query for reasoning.\nHowever, we argue that these methods have overlooked two indispensable issues:\n1) Boundary-bias: The annotated target segment generally refers to two specific frames as corresponding start and end timestamps. The video downsampling process may lose these two frames and take the adjacent irrelevant frames as new boundaries.\n2) Reasoning-bias: Such incorrect new boundary frames also lead to the reasoning bias during frame-query interaction, reducing the generalization ability of model.\n\nTo alleviate above limitations, in this paper, we propose a novel Siamese Sampling and Reasoning Network (SSRN) for TSG, which introduces a siamese sampling mechanism to generate additional contextual frames to enrich and refine the new boundaries. Specifically, a reasoning strategy is developed to learn the inter-relationship among these frames and generate soft labels on boundaries for more accurate frame-query reasoning. Such mechanism is also able to supplement the absent consecutive visual semantics to the sampled sparse frames for fine-grained activity understanding.\nExtensive experiments demonstrate the effectiveness of SSRN on three challenging datasets.", "track": "Speech, Vision, Robotics, Multimodal Grounding", "label": 7, "url": ""}, {"loc": [4.5130696296691895, 4.3023576736450195], "id": 412, "title": "System 1 + System 2 = Better World: Neural-Symbolic Chain of Logic Reasoning", "authors": "Wenyue Hua and Yongfeng Zhang", "abstract": "Logical reasoning is a challenge for many current NLP neural network models since it requires more than the ability of learning informative representations from data. Inspired by the Dual Process Theory in cognitive science \u2014 which proposes that human cognition process involves two stages: an intuitive, unconscious and fast process relying on perception calledSystem 1, and a logical, conscious and slow process performing complex reasoning called System 2 \u2014 we leverage neural logic reasoning (System 2) on top of the representation learning models (System 1), which conducts explicit neural-based differentiable logical reasoning on top of the representations learned by the base neural models. Based on experiments on the commonsense knowledge graph completion task, we show that the two-system architecture always improves from its System 1 model alone. Experiments also show that both the rule-driven logical regularizer and the data-driven value regularizer are important and the performance improvement is marginal without the two regularizers, which indicates that learning from both logical prior and training data is important for reasoning tasks.", "track": "Commonsense Reasoning", "label": 19, "url": ""}, {"loc": [8.047311782836914, 3.1173949241638184], "id": 413, "title": "Efficient Federated Learning on Knowledge Graphs via Privacy-preserving Relation Embedding Aggregation", "authors": "Kai Zhang, Yu Wang, Hongyi Wang, Lifu Huang, Carl Yang, Xun Chen and Lichao Sun", "abstract": "Federated learning (FL) can be essential in knowledge representation, reasoning, and data mining applications over multi-source knowledge graphs (KGs). A recent study FedE first proposes an FL framework that shares entity embeddings of KGs across all clients. However, entity embedding sharing from FedE would incur a severe privacy leakage. Specifically, the known entity embedding can be used to infer whether a specific relation between two entities exists in a private client. In this paper, we introduce a novel attack method that aims to recover the original data based on the embedding information, which is further used to evaluate the vulnerabilities of FedE. Furthermore, we propose a Federated learning paradigm with privacy-preserving Relation embedding aggregation (FedR) to tackle the privacy issue in FedE. Besides, relation embedding sharing can significantly reduce the communication cost due to its smaller size of queries. We conduct extensive experiments to evaluate FedR with five different KG embedding models and three datasets. Compared to FedE, FedR achieves similar utility and significant improvements regarding privacy-preserving effect and communication efficiency on the link prediction task.", "track": "Information Extraction", "label": 5, "url": ""}, {"loc": [7.637033462524414, 3.627551794052124], "id": 418, "title": "TextHacker: Learning based Hybrid Local Search Algorithm for Text Hard-label Adversarial Attack", "authors": "Zhen Yu, Xiaosen Wang, Wanxiang Che and Kun He", "abstract": "Existing textual adversarial attacks usually utilize the gradient or prediction confidence to generate adversarial examples, making it hard to be deployed in real-world applications. To this end, we consider a rarely investigated but more rigorous setting, namely hard-label attack, in which the attacker can only access the prediction label. In particular, we find we can learn the importance of different words via the change on prediction label caused by word substitutions on the adversarial examples. Based on this observation, we propose a novel adversarial attack, termed Text Hard-label attacker (TextHacker). TextHacker randomly perturbs lots of words to craft an adversarial example. Then, TextHacker adopts a hybrid local search algorithm with the estimation of word importance from the attack history to minimize the adversarial perturbation. Extensive evaluations for text classification and textual entailment show that TextHacker significantly outperforms existing hard-label attacks regarding the attack performance as well as adversary quality.", "track": "Machine Learning for NLP", "label": 3, "url": "https://www.semanticscholar.org/reader/6c4ffabd326daa73fa12fea0614bf81e85fcde0e?experiments=&features=reader_skimming%3Atrue"}, {"loc": [5.4170331954956055, 12.334752082824707], "id": 420, "title": "Visualizing the Obvious: A Concreteness-based Ensemble Model for Noun Property Prediction", "authors": "Yue Yang, Artemis Panagopoulou, Marianna Apidianaki, Mark Yatskar and Chris Callison-Burch", "abstract": "Neural language models encode rich knowledge about entities and their relationships which can be extracted from their representations using probing. Common properties of nouns (e.g., red strawberries, small ant) are, however, more challenging to extract compared to other types of knowledge because they are rarely explicitly stated in texts.\nWe hypothesize this to mainly be the case for perceptual properties which are obvious to the participants in the communication. We propose to extract these properties from images and use them in an ensemble model, in order to complement the information that is extracted from language models. We consider perceptual properties to be more concrete than abstract properties (e.g., interesting, flawless). We propose to use the adjectives' concreteness score as a lever to calibrate the contribution of each source (text vs. images). We evaluate our ensemble model in a ranking task where the actual properties of a noun need to be ranked higher than other non-relevant properties. Our results show that the proposed combination of text and images greatly improves noun property prediction compared to powerful text-based language models.", "track": "Semantics: Lexical, Sentence level, Textual Inference and Other areas", "label": 8, "url": "https://www.semanticscholar.org/reader/1209b23684ee76fe951551c07c72a3f73a99aa0d?experiments=&features=reader_skimming%3Atrue"}, {"loc": [4.8586297035217285, 3.5495619773864746], "id": 428, "title": "It's Better to Teach Fishing than Giving a Fish: An Auto-Augmented Structure-aware Generative Model for Metaphor Detection", "authors": "Huawen Feng and Qianli Ma", "abstract": "Metaphor Detection aims to identify the metaphorical meaning of words in the sentence. Most existing work is discriminant models, which use the contextual semantic information extracted by transformers for classifications directly. Due to insufficient training data and corresponding paraphrases, recent methods focus on how to get external resources and utilize them to introduce more knowledge. Currently, contextual modeling and external data are two key issues in the field. In this paper, we propose **A**n **A**uto-**A**ugmented **S**tructure-aware generative model (**AAAS**) for metaphor detection, which transforms the classification task into a keywords-extraction task. Specifically, we propose the task of structure information extraction to allow the model to use the 'structural language' to describe the whole sentence. Furthermore, without any other external resources, we design a simple but effective auto-augmented method to expand the limited datasets. Experimental results show that **AAAS** obtains competitive results compared with state-of-the-art methods.", "track": "Semantics: Lexical, Sentence level, Textual Inference and Other areas", "label": 8, "url": ""}, {"loc": [7.902998924255371, 3.305649757385254], "id": 441, "title": "Expose Backdoors on the Way: A Feature-Based Efficient Defense against Textual Backdoor Attacks", "authors": "Sishuo Chen, Wenkai Yang, Zhiyuan Zhang, Xiaohan Bi and Xu Sun", "abstract": "Natural language processing (NLP) models are known to be vulnerable to backdoor attacks, which poses a newly arisen threat to NLP models. Prior online backdoor defense methods for NLP models only focus on the anomalies at either the input or output level, still suffering from fragility to adaptive attacks and high computational cost. In this work, we take the first step to investigate the unconcealment of textual poisoned samples at the intermediate-feature level and propose a feature-based efficient online defense method. Through extensive experiments on existing attacking methods, we find that the poisoned samples are far away from clean samples in the intermediate feature space of a poisoned NLP model. Motivated by this observation, we devise a distance-based anomaly score (DAN) to distinguish poisoned samples from clean samples at the feature level. Experiments on sentiment analysis and offense detection tasks demonstrate the superiority of DAN, as it substantially surpasses existing online defense methods in terms of defending performance and enjoys lower inference costs. Moreover, we show that DAN is also resistant to adaptive attacks based on feature-level regularization. Our code is available at https://github.com/lancopku/DAN.", "track": "Machine Learning for NLP", "label": 3, "url": "https://www.semanticscholar.org/reader/989ef83ba28b4d5cc51d943d658698aa0b642db3?experiments=&features=reader_skimming%3Atrue"}, {"loc": [4.072072505950928, 6.979447841644287], "id": 443, "title": "Diving Deep into Modes of Fact Hallucinations in Dialogue Systems", "authors": "Souvik Das, Sougata Saha and Rohini Srihari", "abstract": "Knowledge Graph(KG) grounded conversations often use large pre-trained models and usually suffer from fact hallucination. Frequently entities with no references in knowledge sources and conversation history are introduced into responses, thus hindering the flow of the conversation\u2014existing work attempt to overcome this issue by tweaking the training procedure or using a multi-step refining method. However, minimal effort is put into constructing an entity-level hallucination detection system, which would provide fine-grained signals that control fallacious content while generating responses. As a first step to address this issue, we dive deep to identify various modes of hallucination in KG-grounded chatbots through human feedback analysis. Secondly, we propose a series of perturbation strategies to create a synthetic dataset named FADE (FActual Dialogue Hallucination DEtection Dataset). Finally, we conduct comprehensive data analyses and create multiple baseline models for hallucination detection to compare against human-verified data and already established benchmarks.", "track": "Dialogue and Interactive Systems", "label": 4, "url": ""}, {"loc": [5.092928409576416, 9.640813827514648], "id": 447, "title": "Representation Learning for Resource-Constrained Keyphrase Generation", "authors": "Di Wu, Wasi U. Ahmad, Sunipa Dev and Kai-Wei Chang", "abstract": "State-of-the-art keyphrase generation methods generally depend on large annotated datasets, limiting their performance in domains with limited annotated data. To overcome this challenge, we design a data-oriented approach that first identifies salient information using retrieval-based corpus-level statistics, and then learns a task-specific intermediate representation based on a pre-trained language model using large-scale unlabeled documents. We introduce salient span recovery and salient span prediction as denoising training objectives that condense the intra-article and inter-article knowledge essential for keyphrase generation. Through experiments on multiple keyphrase generation benchmarks, we show the effectiveness of the proposed approach for facilitating low-resource keyphrase generation and zero-shot domain adaptation. Our method especially benefits the generation of absent keyphrases, approaching the performance of models trained with large training sets.", "track": "Machine Learning for NLP", "label": 3, "url": "https://www.semanticscholar.org/reader/a761e7e9c731ccc98ac1ba60ead15713b077514a?experiments=&features=reader_skimming%3Atrue"}, {"loc": [6.81849479675293, 6.171376705169678], "id": 451, "title": "Systematicity in GPT-3's Interpretation of Novel English Noun Compounds", "authors": "Siyan Li, Riley Carlson and Christopher Potts", "abstract": "Levin et al. (2019) show experimentally that the interpretations of novel English noun compounds (e.g., stew skillet), while not fully compositional, are highly predictable based on whether the modifier and head refer to artifacts or natural kinds. Is the large language model GPT-3 governed by the same interpretive principles? To address this question, we first compare Levin et al.'s experimental data with GPT-3 generations, finding a high degree of similarity. However, this evidence is consistent with GPT-3 reasoning only about specific lexical items rather than the more abstract conceptual categories of Levin et al.'s theory. To probe more deeply, we construct prompts that require the relevant kind of conceptual reasoning. Here, we fail to find convincing evidence that GPT-3 is reasoning about more than just individual lexical items. These results highlight the importance of controlling for low-level distributional regularities when assessing whether a large language model latently encodes a deeper theory.", "track": "Linguistic Theories, Cognitive Modeling and Psycholinguistics", "label": 22, "url": "https://www.semanticscholar.org/reader/74be37384adc9b643b0c0a2d3b26c1361c5d779b?experiments=&features=reader_skimming%3Atrue"}, {"loc": [4.635993957519531, 6.975573539733887], "id": 460, "title": "CARE: Causality Reasoning for Empathetic Responses by Conditional Graph Generation", "authors": "Jiashuo WANG, Yi Cheng and Wenjie Li", "abstract": "Recent approaches to empathetic response generation incorporate emotion causalities to enhance comprehension of both the user's feelings and experiences. However, these approaches suffer from two critical issues. First, they only consider causalities between the user's emotion and the user's experiences, and ignore those between the user's experiences. Second, they neglect interdependence among causalities and reason them independently. To solve the above problems, we expect to reason all plausible causalities interdependently and simultaneously, given the user's emotion, dialogue history, and future dialogue content. Then, we infuse these causalities into response generation for empathetic responses. Specifically, we design a new model, i.e., the Conditional Variational Graph Auto-Encoder (CVGAE), for the causality reasoning, and adopt a multi-source attention mechanism in the decoder for the causality infusion. We name the whole framework as CARE, abbreviated for CAusality Reasoning for Empathetic conversation. Experimental results indicate that our method achieves state-of-the-art performance.", "track": "Dialogue and Interactive Systems", "label": 4, "url": "https://www.semanticscholar.org/reader/21265688922d2bf3764711b8c97ab32de7eadbcf?experiments=&features=reader_skimming%3Atrue"}, {"loc": [1.7300877571105957, 9.157980918884277], "id": 469, "title": "TransAdv: A Translation-based Adversarial Learning Framework for Zero-Resource Cross-Lingual Named Entity Recognition", "authors": "Yichun Zhao, Jintao Du, Gongshen Liu and Huijia Zhu", "abstract": "Zero-Resource Cross-Lingual Named  Entity Recognition aims at training an NER model of the target language using only labeled source language data and unlabeled target language data. Existing methods are mainly divided into three categories: model transfer based, data transfer based and knowledge transfer based. Each method has its own disadvantages, and combining more than one of them often leads to better performance. However, the performance of data transfer based methods is often limited by inevitable noise in the translation process. To handle the problem, we propose a framework named TransAdv to mitigate lexical and syntactic errors of word-by-word translated data, better utilizing the data by multi-level adversarial learning and multi-model knowledge distillation. Extensive experiments are conducted over 6 target languages with English as the source language, and the results show that TransAdv achieves competitive performance to the state-of-the-art models.", "track": "Multilinguality", "label": 13, "url": ""}, {"loc": [5.479987144470215, 7.503069877624512], "id": 496, "title": "BARLE: Background-Aware Representation Learning for Background Shift Out-of-Distribution Detection", "authors": "Hanyu Duan, Yi Yang, Ahmed Abbasi and Kar Yan Tam", "abstract": "Machine learning models often suffer from a performance drop when they are applied to out-of-distribution (OOD) samples, i.e., those drawn far away from the training data distribution. Existing OOD detection work mostly focuses on identifying semantic-shift OOD samples, e.g., instances from unseen new classes. However, background-shift OOD detection, which identifies samples with domain or style-change, represents a more practical yet challenging task. In this paper, we propose Background-Aware Representation Learning (BARLE) for background-shift OOD detection in NLP. Specifically, we generate semantics-preserving background-shifted pseudo OOD samples from pretrained masked language models. We then contrast the in-distribution (ID) samples with their pseudo OOD counterparts. Unlike prior semantic-shift OOD detection work that often leverages an external text corpus, BARLE only uses ID data, which is more flexible and cost-efficient. In experiments across several text classification tasks, we demonstrate that BARLE is capable of improving background-shift OOD detection performance while maintaining ID classification accuracy. We further investigate the properties of the generated pseudo OOD samples, uncovering the working mechanism of BARLE.", "track": "Machine Learning for NLP", "label": 3, "url": ""}, {"loc": [8.97835922241211, 8.205751419067383], "id": 507, "title": "What Language Model to Train if You Have One Million GPU Hours?", "authors": "Teven Le Scao, Thomas Wang, Daniel Hesslow, Stas Bekman, M Saiful Bari, Stella Biderman, Hady Elsahar, Niklas Muennighoff, Jason Phang, Ofir Press, Colin Raffel, Victor Sanh, Sheng Shen, Lintang Sutawika, Jaesung Tae, Zheng Xin Yong, Julien Launay and Iz Beltagy", "abstract": "The crystallization of modeling methods around the Transformer architecture has been a boon for practitioners. \nSimple, well-motivated architectural variations can transfer across tasks and scale, increasing the impact of modeling research. \nHowever, with the emergence of state-of-the-art 100B+ parameters models, large language models are increasingly expensive to accurately design and train. \nNotably, it can be difficult to evaluate how modeling decisions may impact emergent capabilities, given that these capabilities arise mainly from sheer scale.\nTargeting a multilingual language model in the 100B+ parameters scale, our goal is to identify an architecture and training setup that makes the best use of our 1,000,000 A100-GPU-hours budget.\nSpecifically, we perform an ablation study at the billion-parameter scale comparing different modeling practices and their impact on zero-shot generalization.\nIn addition, we study the impact of various popular pre-training corpora on zero-shot generalization. \nWe also study the performance of a multilingual model and how it compares to the English-only one. \nFinally, we consider the scaling behaviour of Transformers to choose the target model size, shape, and training setup. All our models and code are open-sourced at \\url{https://github.com/anonymous}.", "track": "Language Modeling and Analysis of Language Models", "label": 2, "url": "https://www.semanticscholar.org/reader/bb15f3727f827a3cb88b5d3ca48415c09b40a88f?experiments=&features=reader_skimming%3Atrue"}, {"loc": [5.441365718841553, 7.505604267120361], "id": 511, "title": "Enhancing Out-of-Distribution Detection in Natural Language Understanding via Implicit Layer Ensemble", "authors": "Hyunsoo Cho, Choonghyun Park, Jaewook Kang, Kang Min Yoo, Taeuk Kim and Sang-goo Lee", "abstract": "Out-of-distribution (OOD) detection aims to discern outliers from the intended data distribution, which is crucial to maintaining high reliability and a good user experience.\nMost recent studies in OOD detection utilize the information from a single representation that resides in the penultimate layer to determine whether the input is anomalous or not.\nAlthough such a method is straightforward, the potential of diverse information in the intermediate layers is overlooked.\nIn this paper, we propose a novel framework based on contrastive learning that encourages intermediate features to learn layer-specialized representations and assembles them implicitly into a single representation to absorb rich information in the pre-trained language model. \nExtensive experiments in various intent classification and OOD datasets demonstrate that our approach is significantly more effective than other works.", "track": "Machine Learning for NLP", "label": 3, "url": "https://www.semanticscholar.org/reader/2898f2ea955b7e1eaf9e7868a7c3602ca9a40403?experiments=&features=reader_skimming%3Atrue"}, {"loc": [7.589073657989502, 9.04870891571045], "id": 521, "title": "Contrastive Demonstration Tuning for Pre-trained Language Models", "authors": "Xiaozhuan Liang, Ningyu Zhang, Siyuan Cheng, Zhenru Zhang, Chuanqi Tan and Huajun Chen", "abstract": "Pretrained language models can be effectively stimulated by textual prompts or demonstrations, especially in low-data scenarios. Recent works have focused on automatically searching discrete or continuous prompts or optimized verbalizers, yet studies for the demonstration are still limited. Concretely, the demonstration examples are crucial for an excellent final performance of prompt-tuning. In this paper, we propose a novel pluggable, extensible, and efficient approach named contrastive demonstration tuning, which is free of demonstration sampling. Furthermore, the proposed approach can be: (i) Plugged into any previous prompt-tuning approaches; (ii) Extended to widespread classification tasks with a large number of categories. Experimental results on 16 datasets illustrate that our method integrated with previous approaches LM-BFF and P-tuning can yield better performance. Code is available in https://github.com/zjunlp/PromptKG/tree/main/research/Demo-Tuning.", "track": "Efficient Methods for NLP", "label": 12, "url": "https://www.semanticscholar.org/reader/1bed3c1b7a079e7f86a355e4c64c995eab89d49d?experiments=&features=reader_skimming%3Atrue"}, {"loc": [6.460696697235107, 1.9188812971115112], "id": 525, "title": "Detect-Localize-Repair: A Unified Framework for Learning to Debug with CodeT5", "authors": "Nghi D. Q. Bui, Yue Wang and Steven C.H. Hoi", "abstract": "Automated software debugging is a crucial task for improving the productivity of software developers. Many neural-based techniques have been proven effective for debugging-related tasks such as bug localization and program repair (or bug fixing). However, these techniques often focus only on either one of them or approach them in a stage-wise manner, ignoring the mutual benefits between them. In this work, we propose a novel unified Detect-Localize-Repair framework  based on a pretrained programming language model CodeT5 to seamlessly address these tasks, named CodeT5-DLR. Specifically, we propose three objectives to adapt the generic CodeT5 for debugging: a bug detection objective to determine whether a given code snippet is buggy or not, a bug localization objective to identify the buggy lines, and a program repair objective to translate the buggy code to its fixed version. \nWe evaluate it on each of these tasks and their combined setting on two newly collected line-level debugging datasets in Java and Python. Extensive results show that our model significantly outperforms  existing baselines from both NLP and software engineering domains.", "track": "NLP Applications", "label": 0, "url": ""}, {"loc": [8.380699157714844, 6.617035388946533], "id": 539, "title": "Influence Functions for Sequence Tagging Models", "authors": "Sarthak Jain, Varun Manjunatha, Byron C. Wallace and Ani Nenkova", "abstract": "Many standard tasks in NLP (e.g., Named Entity Recognition, Part-of-Speech tagging, and Semantic Role Labeling) are naturally framed as sequence tagging problems. However, there has been comparatively little work on interpretability methods for sequence tagging models. In this paper, we extend influence functions --- which aim to trace predictions back to the training points that informed them --- to sequence tagging tasks. We define the influence of a training instance segment as the effect that perturbing the labels within this segment has on a test segment level prediction. We provide an efficient approximation to compute this, and show that it tracks with the \"true\" segment influence (measured empirically). We show the practical utility of segment influence by using the method to identify noisy annotations in NER corpora.", "track": "Interpretability, Interactivity and Analysis of Models for NLP", "label": 9, "url": "https://www.semanticscholar.org/reader/848e7de138eef6352d1066db783d0e66becf17f4?experiments=&features=reader_skimming%3Atrue"}, {"loc": [4.401266574859619, 3.7153160572052], "id": 540, "title": "Impact of Pretraining Term Frequencies on Few-Shot Numerical Reasoning", "authors": "Yasaman Razeghi, Robert L Logan IV, Matt Gardner and Sameer Singh", "abstract": "Pretrained Language Models (LMs) have demonstrated ability to perform numerical reasoning by extrapolating from a few examples in few-shot settings. However, the extent to which this extrapolation relies on robust reasoning is unclear. In this paper, we investigate how well these models reason with terms that are less frequent in the pretraining data. In particular, we examine the correlations between the model performance on test instances and the frequency of terms from those instances in the pretraining data. We measure the strength of this correlation for a number of GPT-based language models (pretrained on the Pile dataset) on various numerical deduction tasks (e.g., arithmetic and unit conversion). Our results consistently demonstrate that models are more accurate on instances whose terms are more prevalent, in some cases above 70% (absolute) more accurate on the top 10\\% frequent terms in comparison to the bottom 10%. Overall, although LMs appear successful at few-shot numerical reasoning, our results raise the question of how much models actually generalize beyond pretraining data, and we encourage researchers to take the pretraining data into account when interpreting evaluation results.", "track": "Language Modeling and Analysis of Language Models", "label": 2, "url": "https://www.semanticscholar.org/reader/833a2f1817cb9aeb292620454889cae78e26dda4?experiments=&features=reader_skimming%3Atrue"}, {"loc": [3.854273557662964, 6.5489277839660645], "id": 551, "title": "Syntactic and Semantic Uniformity for Semantic Parsing and Task-Oriented Dialogue Systems", "authors": "Bowen Chen and Yusuke Miyao", "abstract": "This paper proposes a data representation framework for semantic parsing and task-oriented dialogue systems, aiming to achieve a uniform representation for syntactically and semantically diverse machine-readable formats.\nCurrent NLP systems heavily rely on adapting pre-trained language models to specific tasks, and this approach has been proven effective for modeling natural language texts.\nHowever, little attention has been paid to the representation of machine-readable formats, such as database queries and dialogue states.\nWe present a method for converting original machine-readable formats of semantic parsing and task-oriented dialogue datasets into a syntactically and semantically uniform representation.\nWe define a meta grammar for syntactically uniform representations and translate semantically equivalent functions into a uniform vocabulary.\nEmpirical experiments on 13 datasets show that accuracy consistently improves over original formats, revealing the advantage of the proposed representation.\nAdditionally, we show that the proposed representation allows for transfer learning across datasets.", "track": "Resources and Evaluation", "label": 1, "url": ""}, {"loc": [1.919975757598877, 8.669801712036133], "id": 556, "title": "Knowledge-Rich Self-Supervision for Biomedical Entity Linking", "authors": "Sheng Zhang, Hao Cheng, Shikhar Vashishth, Cliff R. Wong, Jinfeng Xiao, Xiaodong Liu, Tristan Naumann, Jianfeng Gao and Hoifung Poon", "abstract": "Entity linking faces significant challenges such as prolific variations and prevalent ambiguities, especially in high-value domains with myriad entities. Standard classification approaches suffer from the annotation bottleneck and cannot effectively handle unseen entities. Zero-shot entity linking has emerged as a promising direction for generalizing to new entities, but it still requires example gold entity mentions during training and canonical descriptions for all entities, both of which are rarely available outside of Wikipedia. In this paper, we explore Knowledge-RIch Self-Supervision (KRISS) for biomedical entity linking, by leveraging readily available domain knowledge. In training, it generates self-supervised mention examples on unlabeled text using a domain ontology and trains a contextual encoder using contrastive learning. For inference, it samples self-supervised mentions as prototypes for each entity and conducts linking by mapping the test mention to the most similar prototype. Our approach can easily incorporate entity descriptions and gold mention labels if available. We conducted extensive experiments on seven standard datasets spanning biomedical literature and clinical notes. Without using any labeled information, our method produces KRISSBERT, a universal entity linker for four million UMLS entities that attains new state of the art, outperforming prior self-supervised methods by as much as 20 absolute points in accuracy. We released KRISSBERT at https://aka.ms/krissbert.", "track": "Information Extraction", "label": 5, "url": ""}, {"loc": [5.008426189422607, 12.517354011535645], "id": 584, "title": "ARTIST: A Transformer-based Chinese Text-to-Image Synthesizer Digesting Linguistic and World Knowledge", "authors": "Tingting Liu, Chengyu Wang, Xiangru Zhu, Lei Li, Minghui Qiu, jun huang, Ming Gao and Yanghua Xiao", "abstract": "Text-to-Image Synthesis (TIS) is a popular task to convert natural language texts into realistic images. Recently, transformer-based TIS models (such as DALL-E) have been proposed using the encoder-decoder architectures. Yet, these billion-scale TIS models are difficult to tune and deploy in resource-constrained environments. In addition, there is a lack of language-specific TIS benchmarks for Chinese, together with high-performing models with moderate sizes. In this work, we present ARTIST, A tRansformer-based Chinese Text-to-Image SynThesizer for high-resolution image generation. In ARTIST, the rich linguistic and relational knowledge facts are injected into the model to ensure better model performance without the usage of ultra-large models. We further establish a large-scale Chinese TIS benchmark with the re-production results of state-of-the-art transformer-based TIS models.\nResults show ARTIST outperforms previous approaches.", "track": "Speech, Vision, Robotics, Multimodal Grounding", "label": 7, "url": ""}, {"loc": [10.842288970947266, 9.322296142578125], "id": 585, "title": "From Spelling to Grammar: A New Framework for Chinese Grammatical Error Correction", "authors": "Xiuyu Wu and Yunfang Wu", "abstract": "Chinese Grammatical Error Correction (CGEC) aims to generate a correct sentence from an erroneous sequence, where different kinds of errors are mixed. This paper divides the CGEC task into two steps, namely spelling error correction and grammatical error correction. We firstly propose a novel zero-shot approach for spelling error correction, which is simple but effective, obtaining a high precision to avoid error accumulation of the pipeline structure. To handle grammatical error correction, we design part-of-speech (POS) features and semantic class features to enhance the neural network model, and propose an auxiliary task to predict the POS sequence of the target sentence. \nOur proposed framework achieves a 42.11 F-0.5 score on CGEC dataset without using any synthetic data or data augmentation methods, which outperforms the previous state-of-the-art by a wide margin of 1.30 points. Moreover, our model produces meaningful POS representations that capture different POS words and convey reasonable POS transition rules.", "track": "Natural Language Generation", "label": 6, "url": "https://www.semanticscholar.org/reader/4cc73edaca5fc7e6e777525e030e1537f0292449?experiments=&features=reader_skimming%3Atrue"}, {"loc": [4.486323356628418, 4.576927185058594], "id": 593, "title": "Language Models Are Poor Learners of Directional Inference", "authors": "Tianyi Li, Mohammad Javad Hosseini, Sabine Weber and Mark Steedman", "abstract": "We examine LMs' competence of directional predicate entailments by supervised fine-tuning with prompts. Our analysis shows that contrary to their apparent success on standard NLI, LMs show limited ability to learn such directional inference; moreover, existing datasets fail to test directionality, and/or are infested by artefacts that can be learnt as proxy for entailments, yielding over-optimistic results. In response, we present BoOQA (Boolean Open QA), a robust multi-lingual evaluation benchmark for directional predicate entailments, extrinsic to existing training sets. On BoOQA, we establish baselines and show evidence of existing LM-prompting models being incompetent directional entailment learners, in contrast to entailment graphs, however limited by sparsity.", "track": "Semantics: Lexical, Sentence level, Textual Inference and Other areas", "label": 8, "url": "https://www.semanticscholar.org/reader/4fb7010a8af2012324bb45a3c281b2ebf8dc44a7?experiments=&features=reader_skimming%3Atrue"}, {"loc": [4.758921146392822, 6.938360214233398], "id": 595, "title": "Wish I Can Feel What You Feel: A Neural Approach for Empathetic Response Generation", "authors": "Yangbin Chen and Chunfeng Liang", "abstract": "Expressing empathy is important in everyday conversations, and exploring how empathy arises is crucial in automatic response generation. Most previous approaches consider only a single factor that affects empathy. However, in practice, empathy generation and expression is a very complex and dynamic psychological process. A listener needs to find out events which cause a speaker's emotions (emotion cause extraction), project the events into some experience (knowledge extension), and express empathy in the most appropriate way (communication mechanism).To this end, we propose a novel approach, which integrates the three components - emotion cause, knowledge graph, and communication mechanism for empathetic response generation.Experimental results on the benchmark dataset demonstrate the effectiveness of our method and show that incorporating the key components generates more informative and empathetic responses.", "track": "Natural Language Generation", "label": 6, "url": ""}, {"loc": [4.320400238037109, 7.360043048858643], "id": 609, "title": "Measuring and Improving Semantic Diversity of Dialogue Generation", "authors": "Seungju Han, Beomsu Kim and Buru Chang", "abstract": "Response diversity has become an important criterion for evaluating the quality of open-domain dialogue generation models. However, current evaluation metrics for response diversity often fail to capture the semantic diversity of generated responses, as they mainly consider lexical aspects of the generated responses. In this paper, we introduce a new automatic evaluation metric to measure the semantic diversity of generated responses. Through human evaluation, we demonstrate that our proposed metric captures human judgments on response diversity better than existing lexical-level diversity metrics. Furthermore, motivated by analyzing an existing dialogue dataset, we propose a simple yet effective learning method that improves the semantic diversity of generated responses. Our learning method weights training samples based on the semantic distribution of the training set.\nWe show that our learning method improves response diversity and coherency better than other baseline methods through automatic and human evaluation.", "track": "Dialogue and Interactive Systems", "label": 4, "url": "https://www.semanticscholar.org/reader/99313c8af01ac3662d11edd705ba80851eb44f0c?experiments=&features=reader_skimming%3Atrue"}, {"loc": [5.37562894821167, 12.172391891479492], "id": 612, "title": "Plug-and-Play VQA: Zero-shot VQA by Conjoining Large Pretrained Models with Zero Training", "authors": "Anthony Meng Huat Tiong, Junnan Li, Boyang Li, Silvio Savarese and Steven C.H. Hoi", "abstract": "Visual question answering (VQA) is a hallmark of vision and language reasoning\nand a challenging task under the zero-shot setting.\nWe propose Plug-and-Play VQA (PNP-VQA),\na modular framework for zero-shot VQA.\nIn contrast to most existing works, which require substantial adaptation of pretrained language models (PLMs) for the vision modality,\nPNP-VQA requires no additional training of the PLMs.\nInstead, we propose to use natural language and network interpretation as an intermediate representation that glues pretrained models together. We first generate question-guided informative image captions,\nand pass the captions to a PLM as context for question answering.\nSurpassing end-to-end trained baselines, PNP-VQA achieves state-of-the-art results on zero-shot VQAv2 and GQA. With 11B parameters, it outperforms the 80B-parameter Flamingo model by 8.5% on VQAv2. \nWith 738M PLM parameters, PNP-VQA achieves an improvement of 9.1% on GQA over FewVLM with 740M PLM parameters.", "track": "Question Answering", "label": 11, "url": "https://www.semanticscholar.org/reader/4bfc5b87891e95e1591e47f3ddd6eab19b616ce5?experiments=&features=reader_skimming%3Atrue"}, {"loc": [4.736835956573486, 3.3000881671905518], "id": 613, "title": "TSGP: Two-Stage Generative Prompting for Unsupervised Commonsense Question Answering", "authors": "Yueqing Sun, Yu Zhang, Le Qi and Qi Shi", "abstract": "Without training on labeled task data, unsupervised commonsense question answering seems challenging since it requires commonsense knowledge beyond the context of questions. Previous methods typically retrieved from traditional knowledge bases or used pre-trained language models (PrLMs) to generate fixed types of knowledge, which have poor generalization ability.\nIn this paper, we aim to address the above limitation by leveraging the implicit knowledge stored in PrLMs and propose a two-stage prompt-based unsupervised commonsense question answering framework (TSGP). We first use knowledge generation prompts to generate the knowledge required for questions with unlimited types and possible candidate answers independent of specified choices. Then, we further utilize answer generation prompts to generate possible candidate answers independent of specified choices. Experimental results and analysis on three different commonsense reasoning tasks, CommonsenseQA, OpenBookQA, and SocialIQA, demonstrate that TSGP significantly improves the reasoning ability of language models in unsupervised settings.", "track": "Question Answering", "label": 11, "url": ""}, {"loc": [10.825733184814453, 6.994398593902588], "id": 623, "title": "Subword-Delimited Downsampling for Better Character-Level Translation", "authors": "Lukas Edman, Antonio Toral and Gertjan van Noord", "abstract": "Subword-level models have been the dominant paradigm in NLP. However, character-level models have the benefit of seeing each character individually, providing the model with more detailed information that ultimately could lead to better models. Recent works have shown character-level models to be competitive with subword models, but costly in terms of time and computation. Character-level models with a downsampling component alleviate this, but at the cost of quality, particularly for machine translation. \nThis work analyzes the problems of previous downsampling methods and introduces a novel downsampling method which is informed by subwords.\nThis new downsampling method not only outperforms existing downsampling methods, showing that downsampling characters can be done without sacrificing quality, but also leads to promising performance compared to subword models for translation.", "track": "Machine Translation", "label": 10, "url": ""}, {"loc": [1.1194785833358765, 8.092310905456543], "id": 624, "title": "Autoregressive Structured Prediction with Language Models", "authors": "Tianyu Liu, Yuchen Eleanor Jiang, Nicholas Monath, Ryan Cotterell and Mrinmaya Sachan", "abstract": "Recent years have seen a paradigm shift in NLP towards using pretrained language models ({PLM}) for a wide range of tasks.\n    However, there are many difficult design decisions to represent structures (e.g. tagged text, coreference chains) in a way such that they can be captured by PLMs.\n    Prior work on structured prediction with PLMs typically flattens the structured output into a sequence, which limits the quality of structural information being learned and leads to inferior performance compared to classic discriminative models. \n    In this work, we describe an approach to model structures as sequences of actions in an autoregressive manner with PLMs, allowing in-structure dependencies to be learned without any loss. \n    Our approach achieves the new state-of-the-art on all the structured prediction tasks we looked at, namely, named entity recognition, end-to-end relation extraction, and coreference resolution.", "track": "Machine Learning for NLP", "label": 3, "url": "https://www.semanticscholar.org/reader/9fc461d7f3981fb7fa8ed74f072746903875b08d?experiments=&features=reader_skimming%3Atrue"}, {"loc": [7.099002361297607, 8.189377784729004], "id": 655, "title": "XDoc: Unified Pre-training for Cross-Format Document Understanding", "authors": "Jingye Chen, Tengchao Lv, Lei Cui, Cha Zhang and Furu Wei", "abstract": "The surge of pre-training has witnessed the rapid development of document understanding recently. Pre-training and fine-tuning framework has been effectively used to tackle texts in various formats, including plain texts, document texts, and web texts. Despite achieving promising performance, existing pre-trained models usually target one specific document format at one time, making it difficult to combine knowledge from multiple document formats. To address this, we propose XDoc, a unified pre-trained model which deals with different document formats in a single model. For parameter efficiency, we share backbone parameters for different formats such as the word embedding layer and the Transformer layers. Meanwhile, we introduce adaptive layers with lightweight parameters to enhance the distinction across different formats. Experimental results have demonstrated that with only 36.7\\% parameters, XDoc achieves comparable or even better performance on a variety of downstream tasks compared with the individual pre-trained models, which is cost effective for real-world deployment. The code and pre-trained models are publicly available at \\url{https://aka.ms/xdoc}.", "track": "Unsupervised and Weakly-Supervised Methods in NLP", "label": 17, "url": "https://www.semanticscholar.org/reader/e5b03c3165d3a056dc55ce18835be04f5f817f4b?experiments=&features=reader_skimming%3Atrue"}, {"loc": [3.1851890087127686, 4.5890727043151855], "id": 658, "title": "A Few More Examples May Be Worth Billions of Parameters", "authors": "Yuval Kirstain, Patrick Lewis, Sebastian Riedel and Omer Levy", "abstract": "We investigate the dynamics of increasing the number of model parameters versus the number of labeled examples across a wide variety of tasks. Our exploration reveals that while scaling parameters consistently yields performance improvements, the contribution of additional examples highly depends on the task's format. Specifically, in open question answering tasks, enlarging the training set does not improve performance. In contrast, classification, extractive question answering, and multiple choice tasks benefit so much from additional examples that collecting a few hundred examples is often \"worth\" billions of parameters. We hypothesize that unlike open question answering, which involves recalling specific information, solving strategies for tasks with a more restricted output space transfer across examples, and can therefore be learned with small amounts of labeled data.", "track": "Efficient Methods for NLP", "label": 12, "url": "https://www.semanticscholar.org/reader/20e5561e3e576fbc10b0e97f8f64d8c875e17ad7?experiments=&features=reader_skimming%3Atrue"}, {"loc": [4.210374355316162, 7.513924598693848], "id": 660, "title": "MCP: Self-supervised Pre-training for Personalized Chatbots with Multi-level Contrastive Sampling", "authors": "Zhaoheng Huang, Zhicheng Dou, Yutao Zhu and Zhengyi Ma", "abstract": "Personalized chatbots focus on endowing the chatbots with a consistent personality to behave like real users and further act as personal assistants. Previous studies have explored generating implicit user profiles from the user's dialogue history for building personalized chatbots. However, these studies only use the response generation loss to train the entire model, thus it is prone to suffer from the problem of data sparsity. Besides, they overemphasize the final generated response's quality while ignoring the correlations and fusions between the user's dialogue history, leading to rough data representations and performance degradation. To tackle these problems, we propose a self-supervised learning framework MCP for capturing better representations from users' dialogue history for personalized chatbots. Specifically, we apply contrastive sampling methods to leverage the supervised signals hidden in user dialog history, and generate the pre-training samples for enhancing the model. We design three pre-training tasks based on three types of contrastive pairs from user dialogue history, namely response pairs, sequence augmentation pairs, and user pairs. We pre-train the utterance encoder and the history encoder towards the contrastive objectives and use these pre-trained encoders for generating user profiles while personalized response generation. Experimental results on two real-world datasets show a significant improvement in our proposed model MCP compared with the existing methods.", "track": "Dialogue and Interactive Systems", "label": 4, "url": ""}, {"loc": [2.5974152088165283, 4.67689847946167], "id": 662, "title": "ExpertPLM: Pre-training Expert Representation for Expert Finding", "authors": "Qiyao Peng and Hongtao Liu", "abstract": "Expert Finding is an important task in Community Question Answering (CQA) platforms, which could help route questions to potential users to answer. The key is to learn representations of experts based on their historical answered questions accurately. In this paper, inspired by the strong text understanding ability of Pretrained Language modelings (PLMs),  we propose a pre-training and fine-tuning expert finding framework. The core is that we design an expert-level pre-training paradigm, that effectively integrates expert interest and expertise simultaneously. Specifically different from the typical corpus-level pre-training, we treat each expert as the basic pre-training unit including all the historical answered question titles of the expert, which could fully indicate the expert interests for questions. Besides, we integrate the vote score information along with each answer of the expert into the pre-training phrase to model the expert ability explicitly. Finally, we propose a novel reputation-augmented Masked Language Model (MLM)  pre-training strategy to capture the expert reputation information. In this way, our method could learn expert representation comprehensively, which then will be adopted and fine-tuned in the down-streaming expert-finding task. Extensive experimental results on six real-world CQA datasets demonstrate the effectiveness of our method.", "track": "Information Retrieval and Text Mining", "label": 15, "url": ""}, {"loc": [4.0651936531066895, 7.007589340209961], "id": 664, "title": "You Truly Understand What I Need : Intellectual and Friendly Dialog Agents grounding Persona and Knowledge", "authors": "Jungwoo Lim, Myugnhoon Kang, Yuna Hur, Seung Won Jeong, Jinsung Kim, Yoonna Jang, Dongyub Lee, Hyesung Ji, DongHoon Shin, Seungryong Kim and Heuiseok Lim", "abstract": "To build a conversational agent that interacts fluently with humans, previous studies blend knowledge or personal profile into the pre-trained language model. However, the model that considers knowledge and persona at the same time is still limited, leading to hallucination and a passive way of using personas. We propose an effective dialogue agent that grounds external knowledge and persona simultaneously. The agent selects the proper knowledge and persona to use for generating the answers with our candidate scoring implemented with a poly-encoder. Then, our model generates the utterance with lesser hallucination and more engagingness utilizing retrieval augmented generation with knowledge-persona enhanced query. We conduct experiments on the persona-knowledge chat and achieve state-of-the-art performance in grounding and generation tasks on the automatic metrics. Moreover, we validate the answers from the models regarding hallucination and engagingness through human evaluation and qualitative results. We show our retriever's effectiveness in extracting relevant documents compared to the other previous retrievers, along with the comparison of multiple candidate scoring methods. Code is available at \\url{https://github.com/dlawjddn803/INFO}", "track": "Dialogue and Interactive Systems", "label": 4, "url": ""}, {"loc": [3.922996997833252, 9.677489280700684], "id": 668, "title": "Faithful to the Document or to the World? Mitigating Hallucinations via Entity-Linked Knowledge in Abstractive Summarization", "authors": "Yue Dong, John Wieting and Pat Verga", "abstract": "Existing abstractive summarization systems are hampered by content hallucinations in which models generate text that is not directly inferable from the source alone.  Annotations from prior work have shown that some of these hallucinations, while being `unfaithful' to the source, are nonetheless factual. Our analysis in this paper suggests that these factual hallucinations occur as a result of the prevalence of factual yet unfaithful entities in summarization datasets. We find that these entities are not aberrations, but instead examples of additional world knowledge being readily used to latently connect entities and concepts -- in this case connecting entities in the source document to those in the target summary. In our analysis and experiments, we demonstrate that connecting entities to an external knowledge base can lend provenance to many of these unfaithful yet factual entities, and further, this knowledge can be used to improve the factuality of summaries without simply making them more extractive.", "track": "Summarization", "label": 14, "url": "https://www.semanticscholar.org/reader/ae1e48a74cb2f313e8e99c82f0aa4487b0805002?experiments=&features=reader_skimming%3Atrue"}, {"loc": [8.072550773620605, 8.098310470581055], "id": 673, "title": "RL with KL penalties is better viewed as Bayesian inference", "authors": "Tomasz Korbak, Ethan Perez and Christopher L. Buckley", "abstract": "Reinforcement learning (RL) is frequently employed in fine-tuning large language models (LMs), such as GPT-3, to penalize them for undesirable features of generated sequences, such as offensiveness, social bias, harmfulness or falsehood. The RL formulation involves treating the LM as a policy and updating it to maximise the expected value of a reward function which captures human preferences, such as non-offensiveness. \n\nIn this paper, we analyze challenges associated with treating a language model as an RL policy and show how avoiding those challenges requires moving beyond the RL paradigm. We start by observing that the standard RL approach is flawed as an objective for fine-tuning LMs because it leads to distribution collapse: turning the LM into a degenerate distribution. \n\nThen, we analyze KL-regularised RL, a widely used recipe for fine-tuning LMs, which additionally constrains the fine-tuned LM to stay close to its original distribution in terms of Kullback-Leibler (KL) divergence. We show that KL-regularised RL is equivalent to variational inference: approximating a Bayesian posterior which specifies how to update a prior LM to conform with evidence provided by the reward function. We argue that this Bayesian inference view of KL-regularised RL is more insightful than the typically employed RL perspective. \n\nThe Bayesian inference view explains how KL-regularised RL avoids the distribution collapse problem and offers a first-principles derivation for its objective. While this objective happens to be equivalent to RL (with a particular choice of parametric reward), there exist other objectives for fine-tuning LMs which are no longer equivalent to RL. That observation leads to a more general point: RL is not an adequate formal framework for problems such as fine-tuning language models. These problems are best viewed as Bayesian inference: approximating a pre-defined target distribution.", "track": "Theme Track", "label": 18, "url": "https://www.semanticscholar.org/reader/5ecc8ca550baa8e4a08a942af06fbc2af2c74543?experiments=&features=reader_skimming%3Atrue"}, {"loc": [1.8155336380004883, 3.973254919052124], "id": 691, "title": "Evaluating Token-Level and Passage-Level Dense Retrieval Models for Math Information Retrieval", "authors": "Wei Zhong, Jheng-Hong Yang, YUQING XIE and Jimmy Lin", "abstract": "With the recent success of dense retrieval methods based on bi-encoders, studies have applied this approach to various interesting downstream retrieval tasks with good efficiency and in-domain effectiveness.\nRecently, we have also seen the presence of dense retrieval models in Math Information Retrieval (MIR) tasks,\nbut the most effective systems remain classic retrieval methods that consider hand-crafted structure features.\nIn this work, we try to combine the best of both worlds:\\ a well-defined structure search method for effective formula search and efficient bi-encoder dense retrieval models to capture contextual similarities.\nSpecifically, we have evaluated two representative bi-encoder models for token-level and passage-level dense retrieval on recent MIR tasks.\nOur results show that bi-encoder models are highly complementary to existing structure search methods, and we are able to advance the state-of-the-art on MIR datasets.", "track": "Information Retrieval and Text Mining", "label": 15, "url": "https://www.semanticscholar.org/reader/859cbed6555319c3c31b84c1001a1df9a34889e2?experiments=&features=reader_skimming%3Atrue"}, {"loc": [4.051512241363525, 3.95515513420105], "id": 694, "title": "Multi-View Reasoning: Consistent Contrastive Learning for Math Word Problem", "authors": "Wenqi Zhang, Yongliang Shen, Yanna Ma, Xiaoxia Cheng, Zeqi Tan, Qingpeng Nong and Weiming Lu", "abstract": "Math word problem solver requires both precise relation reasoning about quantities in the text and reliable generation for the diverse equation. Current sequence-to-tree or relation extraction methods regard this only from a fixed view, struggling to simultaneously handle complex semantics and diverse equations. However, human solving naturally involves two consistent reasoning views: top-down and bottom-up, just as math equations also can be expressed in multiple equivalent forms: pre-order and post-order. We propose a multi-view consistent contrastive learning for a more complete semantics-to-equation mapping. The entire process is decoupled into two independent but consistent views: top-down decomposition and bottom-up construction, and the two reasoning views are aligned in multi-granularity for consistency, enhancing global generation and precise reasoning. Experiments on multiple datasets across two languages show our approach significantly outperforms the existing baselines, especially on complex problems. We also show after consistent alignment, multi-view can absorb the merits of both views and generate more diverse results consistent with the mathematical laws.", "track": "NLP Applications", "label": 0, "url": "https://www.semanticscholar.org/reader/b6b42f59ca3e0c5147b159f7c1fe2169219d5263?experiments=&features=reader_skimming%3Atrue"}, {"loc": [8.041875839233398, 9.677835464477539], "id": 697, "title": "Few-shot initializing of Active Learner via Meta-Learning", "authors": "Zi Long Zhu, Vikrant Yadav, Zubair Afzal and George Tsatsaronis", "abstract": "Despite the important evolutions in few-shot and zero-shot learning techniques, domain specific applications still require expert knowledge and significant effort in annotating and labeling a large volume of unstructured textual data. To mitigate this problem, active learning, and meta-learning attempt to reach a high performance with the least amount of labeled data. In this paper, we introduce a novel approach to combine both lines of work by initializing an active learner with meta-learned parameters obtained through meta-training on tasks similar to the target task during active learning. In this approach we use the pre-trained BERT as our text-encoder and meta-learn its parameters with LEOPARD, which extends the model-agnostic meta-learning method by generating task dependent softmax weights to enable learning across tasks with different number of classes. We demonstrate the effectiveness of our method by performing active learning on five natural language understanding tasks and six datasets with five different acquisition functions. We train two different meta-initializations, and we use the pre-trained BERT base initialization as baseline. We observe that our approach performs better than the baseline at low budget, especially when closely related tasks were present during meta-learning. Moreover, our results show that better performance in the initial phase, i.e., with fewer labeled samples, leads to better performance when larger acquisition batches are used. We also perform an ablation study of the proposed method, showing that active learning with only the meta-learned weights is beneficial and adding the meta-learned learning rates and generating the softmax have negative consequences for the performance.", "track": "Efficient Methods for NLP", "label": 12, "url": ""}, {"loc": [9.696150779724121, 7.728682994842529], "id": 700, "title": "Bootstrapping meaning through listening: Unsupervised learning of spoken sentence embeddings", "authors": "Jian Zhu, Zuoyu Tian, Yadong Liu, Cong Zhang and Chia-Wen Lo", "abstract": "Inducing semantic representations directly from speech signals is a highly challenging task but has many useful applications in speech mining and spoken language understanding. This study tackles the unsupervised learning of semantic representations for spoken utterances. Through converting speech signals into hidden units generated from acoustic unit discovery, we propose WavEmbed, a multimodal sequential autoencoder that predicts hidden units from a dense representation of speech. Secondly, we also propose S-HuBERT to induce meaning through knowledge distillation, in which a sentence embedding model is first trained on hidden units and passes its knowledge to a speech encoder through contrastive learning. The best performing model achieves a moderate correlation (0.5~0.6) with human judgments, without relying on any labels or transcriptions. Furthermore, these models can also be easily extended to leverage textual transcriptions of speech to learn much better speech embeddings that are strongly correlated with human annotations. Our proposed methods are applicable to the development of purely data-driven systems for speech mining, indexing and search.", "track": "Speech, Vision, Robotics, Multimodal Grounding", "label": 7, "url": "https://www.semanticscholar.org/reader/afcdfdcd3fc9d65470e18269acc5b49399c80e0f?experiments=&features=reader_skimming%3Atrue"}, {"loc": [9.467338562011719, 6.337846279144287], "id": 712, "title": "Progressive Sentiment Analysis for Code-Switched Text Data", "authors": "Sudhanshu Ranjan, Dheeraj Mekala and Jingbo Shang", "abstract": "Multilingual transformer language models have recently attracted much attention from researchers and are used in cross-lingual transfer learning for many NLP tasks such as text classification and named entity recognition.\nHowever, similar methods for transfer learning from monolingual text to code-switched text have not been extensively explored mainly due to the following challenges:\n(1) Code-switched corpus, unlike monolingual corpus, consists of more than one language and existing methods can't be applied efficiently,\n(2) Code-switched corpus is usually made of resource-rich and low-resource languages and upon using multilingual pre-trained language models, the final model might bias towards resource-rich language. \nIn this paper, we focus on code-switched sentiment analysis where we have a labelled resource-rich language dataset and unlabelled code-switched data. We propose a framework that takes the distinction between resource-rich and low-resource language into account.\nInstead of training on the entire code-switched corpus at once, we create buckets based on the fraction of words in the resource-rich language and progressively train from resource-rich language dominated samples to low-resource language dominated samples. \nExtensive experiments across multiple language pairs demonstrate that progressive training helps low-resource language dominated samples.", "track": "Multilinguality", "label": 13, "url": "https://www.semanticscholar.org/reader/dd2fd1c27673eade4bc00bb857ab22477cf15c86?experiments=&features=reader_skimming%3Atrue"}, {"loc": [4.075523376464844, 5.934412956237793], "id": 714, "title": "Knowledge Stimulated Contrastive Prompting for Low-Resource Stance Detection", "authors": "Kai Zheng, Qingfeng Sun, Yaming Yang and Fei Xu", "abstract": "Stance Detection Task (SDT) aims at identifying the stance of the sentence towards a specific target and is usually modeled as a classification problem. Backgound knowledge is often necessary for stance detection  with respect to a specific target, especially when there is no target explicitly mentioned in text. This paper focuses on the knowledge stimulation for low-resource stance detection tasks. We firstly explore to formalize stance detection as a prompt based contrastive learning task. At the same time, to make prompt learning suit to stance detection, we design a template mechanism to incorporate corresponding target into instance representation. Furthermore, we propose a masked language prompt joint contrastive learning approach to stimulate the knowledge inherit from the pre-trained model. The experimental results on three benchmarks show that knowledge stimulation is effective in stance detection accompanied with our proposed mechanism.", "track": "Efficient Methods for NLP", "label": 12, "url": ""}, {"loc": [10.827001571655273, 9.343551635742188], "id": 745, "title": "WSpeller: Robust Word Segmentation for Enhancing Chinese Spelling Check", "authors": "Fangfang Li, Youran Shan, Junwen Duan, Xingliang Mao and Minlie Huang", "abstract": "Chinese spelling check (CSC) detects and corrects spelling errors in Chinese texts. Previous approaches have combined character-level phonetic and graphic information, ignoring the importance of segment-level information. According to our pilot study, spelling errors are always associated with incorrect word segmentation. When appropriate word boundaries are provided, CSC performance is greatly enhanced. Based on these findings, we present WSpeller, a CSC model that takes into account word segmentation. A fundamental component of WSpeller is a W-MLM, which is trained by predicting visually and phonetically similar words. Through modification of the embedding layer's input, word segmentation information can be incorporated. Additionally, a robust module is trained to assist the W-MLM-based correction module by predicting the correct word segmentations from sentences containing spelling errors. We evaluate WSpeller on the widely used benchmark datasets SIGHAN13, SIGHAN14, and SIGHAN15. Our model is superior to state-of-the-art baselines on SIGHAN13 and SIGHAN15 and maintains equal performance on SIGHAN14.", "track": "NLP Applications", "label": 0, "url": ""}, {"loc": [2.1115283966064453, 7.567514419555664], "id": 764, "title": "Extracting Trigger-sharing Events via an Event Matrix", "authors": "Jun Xu, Weidi Xu, Mengshu Sun, Taifeng Wang and Wei Chu", "abstract": "A growing interest emerges in event extraction which aims to extract multiple events with triggers and arguments. Previous methods mitigate the problem of multiple events extraction by predicting the arguments conditioned on the event trigger and event type, assuming that these arguments belong to a single event. However, the assumption is invalid in general as there may be multiple events. Therefore, we present a unified framework called MatEE for trigger-sharing events extraction. It resolves the kernel bottleneck by effectively modeling the relations between arguments by an event matrix, where trigger-sharing events are represented by multiple cliques. We verify the proposed method on 3 widely-used benchmark datasets of event extraction. The experimental results show that it beats all the advanced competitors, significantly improving the state-of-the-art performances in event extraction.", "track": "Information Extraction", "label": 5, "url": ""}, {"loc": [0.5011634230613708, 7.111895561218262], "id": 770, "title": "TranS: Transition-based Knowledge Graph Embedding with Synthetic Relation Representation", "authors": "Xuanyu Zhang, Qing Yang and Dongliang Xu", "abstract": "Knowledge graph embedding (KGE) aims to learn continuous vectors of relations and entities in knowledge graph (KG). Recently, transition-based KGE methods have become popular and achieved promising performance. However, scoring patterns like TransE are not suitable for complex scenarios where the same entity pair has different relations. Although some models attempt to employ entity-relation interaction or projection to improve entity representation for one-to-many/many-to-one/many-to-many complex relations, they still continue the TransE pattern, where only a single relation vector in the relation part is used to translate the head entity to the tail entity or their variants. And recent research shows that entity representation only needs to consider entities and their interactions to achieve better performance. Thus, in this paper, we propose a novel transition-based method, TranS, for KGE. The single relation vector of the relation part in traditional scoring patterns is replaced by synthetic relation representation with entity-relation interaction to solve these issues. And the entity part still retains its independence through entity-entity interactions. Experiments on a large KG dataset, ogbl-wikikg2, show that our model achieves state-of-the-art results.", "track": "Information Extraction", "label": 5, "url": "https://www.semanticscholar.org/reader/9e5600974e7b2bb5116bb888d62ae6e94a304b92?experiments=&features=reader_skimming%3Atrue"}, {"loc": [3.960214376449585, 7.533139705657959], "id": 789, "title": "Sequential Topic Selection Model with Latent Variable for Topic-Grounded Dialogue", "authors": "Xiao-Fei Wen, Wei Wei and Xian-Ling Mao", "abstract": "Recently, topic-grounded dialogue system has attracted significant attention due to its effectiveness in predicting the next topic to yield better responses via the historical context and given topic sequence. However, almost all existing topic prediction solutions focus on only the current conversation and corresponding topic sequence to predict the next conversation topic, without exploiting other topic-guided conversations which may contain relevant topic-transitions to current conversation. To address the problem, in this paper we propose a novel approach, named Sequential Global Topic Attention (SGTA) to exploit topic transition over all conversations in a subtle way for better modeling post-to-response topic-transition and guiding the response generation to the current conversation. Specifically, we introduce a latent space modeled as a Multivariate Skew-Normal distribution with hybrid kernel functions to flexibly integrate the global-level information with sequence-level information, and predict the topic based on the distribution sampling results. We also leverage a topic-aware prior-posterior approach for secondary selection of predicted topics, which is utilized to optimize the response generation task. Extensive experiments demonstrate that our model outperforms competitive baselines on prediction and generation tasks.", "track": "Dialogue and Interactive Systems", "label": 4, "url": "https://www.semanticscholar.org/reader/2cd38749aad5da8ba98c3fa21944d99609f00491?experiments=&features=reader_skimming%3Atrue"}, {"loc": [4.544554233551025, 7.478976249694824], "id": 791, "title": "Robust Task-Oriented Dialogue Generation with Contrastive Pre-training and Adversarial Filtering", "authors": "Shiquan Yang, Xinting Huang, Jey Han Lau and Sarah Erfani", "abstract": "Data artifacts incentivize machine learning models to learn non-transferable generalizations by taking advantage of shortcuts in the data, and\nthere is growing evidence that data artifacts play a role for the strong results that \ndeep learning models achieve in recent natural language processing benchmarks.\nIn this paper, we focus on task-oriented dialogue and investigate  whether popular \ndatasets such as MultiWOZ contain such data artifacts.\nWe found that by only keeping frequent phrases in the training\nexamples, state-of-the-art models perform similarly compared \nto the variant trained with full data, suggesting \nthey exploit these spurious correlations\nto solve the task. Motivated by this, we propose \na contrastive learning based framework to encourage the model \nto ignore these cues and focus on learning generalisable patterns. We also experiment with adversarial filtering to remove easy training instances so that the model would focus on learning from the harder instances. We conduct a number of generalization\n experiments --- e.g., cross-domain/dataset and adversarial tests --- to assess the robustness of our approach and found that it works exceptionally well.", "track": "Dialogue and Interactive Systems", "label": 4, "url": "https://www.semanticscholar.org/reader/58e132f2c0d624d2faec4a1a06302d1dc550fe0b?experiments=&features=reader_skimming%3Atrue"}, {"loc": [1.3026673793792725, 4.905750274658203], "id": 806, "title": "STAR: SQL Guided Pre-Training for Context-dependent Text-to-SQL Parsing", "authors": "Zefeng Cai, Xiangyu Li, Binyuan Hui, Min Yang, Bowen Li, Binhua Li, Zheng Cao, weijie li, Fei Huang, Luo Si and Yongbin Li", "abstract": "In this paper, we propose a novel SQL guided pre-training framework STAR for context-dependent text-to-SQL parsing, which leverages contextual information to enrich natural language (NL) utterance and table schema representations for text-to-SQL conversations. Concretely, we propose two novel pre-training objectives which respectively explore the context-dependent interactions of NL utterances and SQL queries within each text-to-SQL conversation: (i) schema state tracking (SST) objective that tracks and explores the schema states of context-dependent SQL queries in the form of schema-states by predicting and updating the value of each schema slot during interaction; (ii) utterance dependency tracking (UDT) objective that employs weighted contrastive learning to pull together two semantically similar NL utterances and push away the representations of semantically dissimilar NL utterances within each conversation. In addition, we construct a high-quality large-scale context-dependent text-to-SQL conversation corpus to pre-train STAR. Extensive experiments show that STAR achieves new state-of-the-art performance on two downstream benchmarks (SParC and CoSQL), significantly outperforming previous pre-training methods and ranking first on the leaderboard. We believe the release of the constructed corpus, codebase and pre-trained STAR checkpoints would push forward the research in this area.", "track": "Syntax, Parsing and their Applications", "label": 23, "url": ""}, {"loc": [4.223868370056152, 7.318996906280518], "id": 809, "title": "Is MultiWOZ a Solved Task? An Interactive TOD Evaluation Framework with User Simulator", "authors": "Qinyuan Cheng, Linyang Li, Guofeng Quan, Feng Gao, xiaofeng mou and Xipeng Qiu", "abstract": "Task-Oriented Dialogue (TOD) systems are drawing more and more attention in recent studies.\nCurrent methods focus on constructing pre-trained models or fine-tuning strategies while the evaluation of TOD is limited by a policy mismatch problem.\nThat is, during evaluation, the user utterances are from the annotated dataset while these utterances should interact with previous responses which can have many alternatives besides annotated texts.\nTherefore, in this work, we propose an interactive evaluation framework for TOD. \nWe first build a goal-oriented user simulator based on pre-trained models and then use the user simulator to interact with the dialogue system to generate dialogues.\nBesides, we introduce a sentence-level and a session-level score to measure the sentence fluency and session coherence in the interactive evaluation. \nExperimental results show that RL-based TOD systems trained by our proposed user simulator can achieve nearly 98\\% inform and success rates in the interactive evaluation of MultiWOZ dataset and the proposed scores measure the response quality besides the inform and success rates.\nWe are hoping that our work will encourage simulator-based interactive evaluations in the TOD task.", "track": "Dialogue and Interactive Systems", "label": 4, "url": "https://www.semanticscholar.org/reader/da83d8c19b1716b7a17eab9f675a5bdbe4518db5?experiments=&features=reader_skimming%3Atrue"}, {"loc": [10.369902610778809, 6.783526420593262], "id": 820, "title": "Translating Hanja Historical Documents to Contemporary Korean and English", "authors": "juhee son, Jiho Jin, Haneul Yoo, JinYeong Bak, Kyunghyun Cho and Alice Oh", "abstract": "The Annals of Joseon Dynasty (AJD) contain the daily records of the Kings of Joseon, the 500-year kingdom preceding the modern nation of Korea.\nThe Annals were originally written in an archaic Korean writing system, `Hanja', and were translated into Korean from 1968 to 1993.\nThe resulting translation was however too literal and contained many archaic Korean words; thus, a new expert translation effort began in 2012. Since then, the records of only one king have been completed in a decade.\nIn parallel, expert translators are working on English translation, also at a slow pace and produced only one king's records in English so far.\nThus, we propose H2KE, a neural machine translation model, that translates historical documents in Hanja to more easily understandable Korean and to English.\nBuilt on top of multilingual neural machine translation, H2KE learns to translate a historical document written in Hanja, from both a full dataset of outdated Korean translation and a small dataset of more recently translated contemporary Korean and English.\nWe compare our method against two baselines:\na recent model that simultaneously learns to restore and translate Hanja historical document\nand a Transformer based model trained only on newly translated corpora.\nThe experiments reveal that our method significantly outperforms the baselines in terms of BLEU scores for both contemporary Korean and English translations.\nWe further conduct extensive human evaluation which shows that our translation is preferred over the original expert translations by both experts and non-expert Korean speakers.", "track": "Machine Translation", "label": 10, "url": ""}, {"loc": [5.7967848777771, 11.88735294342041], "id": 835, "title": "Exploring Compositional Image Retrieval with Hybrid Compositional Learning and Heuristic Negative Mining", "authors": "Chao Wang, Ehsan Nezhadarya, Tanmana Sadhu and Shengdong Zhang", "abstract": "Compositional image retrieval (CIR) is a challenging retrieval task, where the query is composed of a reference image and a modification text, and the target is another image reflecting the modification to the reference image. Due to the great success of the pre-trained vision-and-language model CLIP and its favorable applicability to large-scale retrieval tasks, we propose a CIR model HyCoLe-HNM with CLIP as the backbone. In HyCoLe-HNM, we follow the contrastive pre-training method of CLIP to perform cross-modal representation learning. On this basis, we propose a hybrid compositional learning mechanism, which includes both image compositional learning and text compositional learning. In hybrid compositional learning, we borrow a gated fusion mechanism from a question answering model to perform compositional fusion, and propose a heuristic negative mining method to filter negative samples. Privileged information in the form of image-related texts is utilized in cross-modal representation learning and hybrid compositional learning. Experimental results show that HyCoLe-HNM achieves state-of-the-art performance on three CIR datasets, namely FashionIQ, Fashion200K, and MIT-States.", "track": "Speech, Vision, Robotics, Multimodal Grounding", "label": 7, "url": ""}, {"loc": [8.43426513671875, 7.733405590057373], "id": 847, "title": "Outlier Dimensions that Disrupt Transformers are Driven by Frequency", "authors": "Giovanni Puccetti, Anna Rogers, Aleksandr Drozd and Felice Dell'Orletta", "abstract": "While Transformer-based language models are generally very robust to pruning, there is the recently discovered outlier phenomenon: disabling only 48 out of 110M parameters in BERT-base drops its performance by nearly 30% on MNLI. We replicate the original evidence for the outlier phenomenon and we link it to the geometry of the embedding space. We find that in both BERT and RoBERTa the magnitude of hidden state coefficients corresponding to outlier dimensions correlate with the frequencies of encoded tokens in pre-training data, and they also contribute to the \"vertical\" self-attention pattern enabling the model to focus on the special tokens. This explains the drop in performance from disabling the outliers, and it suggests that to decrease anisotopicity in future models we need pre-training schemas that would better take into account the skewed token distributions.", "track": "Interpretability, Interactivity and Analysis of Models for NLP", "label": 9, "url": ""}, {"loc": [5.095840930938721, 5.199019432067871], "id": 849, "title": "MiST: a Large-Scale Annotated Resource and Neural Models for Functions of Modal Verbs in English Scientific Text", "authors": "Sophie Henning, Nicole Macher, Stefan Gr\u00fcnewald and Annemarie Friedrich", "abstract": "Modal verbs (e.g., can, should or must) occur highly frequently in scientific articles. Decoding their function is not straightforward: they are often used for hedging, but they may also denote abilities and restrictions. Understanding their meaning is important for accurate information extraction from scientific text.\n\nTo foster research on the usage of modals in this genre, we introduce the MIST (Modals In Scientific Text) dataset, which contains 3737 modal instances in five scientific domains annotated for their semantic, pragmatic, or rhetorical function. We systematically evaluate a set of competitive neural architectures on MIST. Transfer experiments reveal that leveraging non-scientific data is of limited benefit for modeling the distinctions in MIST. Our corpus analysis provides evidence that scientific communities differ in their usage of modal verbs, yet, classifiers trained on scientific data generalize to some extent to unseen scientific domains.", "track": "Ethic Concerns:Discourse and Pragmatics", "label": 24, "url": ""}, {"loc": [8.27032470703125, 8.741168022155762], "id": 853, "title": "Late Prompt Tuning: A Late Prompt Could Be Better Than Many Prompts", "authors": "Xiangyang Liu, Tianxiang Sun, Xuanjing Huang and Xipeng Qiu", "abstract": "Prompt tuning is a parameter-efficient tuning (PETuning) method for utilizing pre-trained models (PTMs) that simply prepends a soft prompt to the input and only optimizes the prompt to adapt PTMs to downstream tasks. Although it is parameter- and deployment-efficient, its performance still lags behind other state-of-the-art PETuning methods. Besides, the training cost of prompt tuning is not significantly reduced due to the back-propagation through the entire model. Through empirical analyses, we shed some light on the lagging performance of prompt tuning and recognize a trade-off between the propagation distance from label signals to the inserted prompt and the influence of the prompt on model outputs.  Further, we present Late Prompt Tuning (LPT) that inserts a late prompt into an intermediate layer of the PTM instead of the input layer or all layers. The late prompt is obtained by a neural prompt generator conditioned on the hidden states before the prompt insertion layer and therefore is instance-dependent. Through extensive experimental results across various tasks and PTMs, we show that LPT can achieve competitive performance to full model tuning and other PETuning methods under both full-data and few-shot scenarios while possessing faster training speed and lower memory cost.", "track": "Language Modeling and Analysis of Language Models", "label": 2, "url": ""}, {"loc": [4.79926061630249, 3.299973249435425], "id": 855, "title": "MICO: A Multi-alternative Contrastive Learning Framework for Commonsense Knowledge Representation", "authors": "Ying Su, Zihao Wang, Tianqing Fang, Hongming Zhang, Yangqiu Song and Tong Zhang", "abstract": "Commonsense reasoning tasks such as commonsense knowledge graph completion and commonsense question answering require powerful representation learning. In this paper, we propose to learn commonsense knowledge representation by MICO, a Multi-alternative contrastIve learning framework on COmmonsense knowledge graphs (MICO). MICO generates the commonsense knowledge representation by contextual interaction between entity nodes and relations with multi-alternative contrastive learning. \nIn MICO, the head and tail entities in an $(h,r,t)$ knowledge triple are converted to two relation-aware sequence pairs (a premise and an alternative) in the form of natural language. Semantic representations generated by MICO can benefit the following two tasks by simply comparing the similarity score between the representations: 1) zero-shot commonsense question answering tasks; 2) inductive commonsense knowledge graph completion tasks. Extensive experiments show the effectiveness of our method.", "track": "Commonsense Reasoning", "label": 19, "url": "https://www.semanticscholar.org/reader/480e667c50eb71ba78bfde47e4686ca7b21148bd?experiments=&features=reader_skimming%3Atrue"}, {"loc": [0.9745473861694336, 10.470931053161621], "id": 856, "title": "Leveraging Only the Category Name for Aspect Detection through Prompt-based Constrained Clustering", "authors": "Yazheng Li, Pengyun Wang, Yasheng Wang, Yong Dai, Yadao Wang, Lujia Pan and Zenglin Xu", "abstract": "Aspect category detection (ACD) aims to automatically identify user-concerned aspects from online reviews, which is of great value for evaluating the fine-grained performance of a product. The most recent solutions tackle this problem via weakly supervised methods, achieving remarkable improvement over unsupervised methods. However, a closer look at these methods reveals that the required human efforts are nontrivial and can sometimes be hard to obtain. In this study, we explore the possibility of minimizing human guidance while improving detection performance, with a deep clustering method that relies merely on the category name of each aspect and a pretrained language model (LM). The LM, combined with prompt techniques, is employed as a knowledge base to automatically generate constraints for clustering, as well as to provide a representation space to perform the clustering. Our method (1) extracts extensive keywords to expand our understanding of each aspect, (2) automatically generates instance-level and concept-level constraints for clustering, and (3) trains the clustering model with the above constraints. We demonstrate the capability of the proposed framework through extensive experiments on nine benchmark datasets. Our model not only performs noticeably better than existing unsupervised approaches but also considerably surpasses weakly supervised methods that require more human efforts.", "track": "Sentiment Analysis, Stylistic Analysis, and Argument Mining", "label": 16, "url": ""}, {"loc": [4.131096839904785, 7.070195198059082], "id": 858, "title": "Controllable Factuality in Document-Grounded Dialog Systems Using a Noisy Channel Model", "authors": "Nico Daheim, David Thulke, Christian Dugast and Hermann Ney", "abstract": "In this work, we present a model for document-grounded response generation in dialog that is decomposed into two components according to Bayes' theorem.\nOne component is a traditional ungrounded response generation model and the other component models the reconstruction of the grounding document based on the dialog context and generated response.\nWe propose different approximate decoding schemes and evaluate our approach on multiple open-domain and task-oriented document-grounded dialog datasets.\nOur experiments show that the model is more factual in terms of automatic factuality metrics than the baseline model.\nFurthermore, we outline how introducing scaling factors between the components allows for controlling the tradeoff between factuality and fluency in the model output.\nFinally, we compare our approach to a recently proposed method to control factuality in grounded dialog, CTRL (Rashkin et al., 2021), and show that both approaches can be combined to achieve additional improvements.", "track": "Dialogue and Interactive Systems", "label": 4, "url": ""}, {"loc": [8.491815567016602, 7.826846122741699], "id": 868, "title": "Transformer Language Models without Positional Encodings Still Learn Positional Information", "authors": "Adi Haviv, Ori Ram, Ofir Press, Peter Izsak and Omer Levy", "abstract": "Causal transformer language models (LMs), such as GPT-3, typically require some form of positional encoding, such as positional embeddings. \nHowever, we show that LMs without any explicit positional encoding are still competitive with standard models and that this phenomenon is robust across different datasets, model sizes, and sequence lengths.\nProbing experiments reveal that such models acquire an implicit notion of absolute positions throughout the network, effectively compensating for the missing information.\nWe conjecture that causal attention enables the model to infer the number of predecessors that each token can attend to, thereby approximating its absolute position.\nOur findings indicate that causal LMs might derive positional awareness not only from the explicit positioning mechanism but also from the effects of the causal mask.", "track": "Language Modeling and Analysis of Language Models", "label": 2, "url": "https://www.semanticscholar.org/reader/043c1d66e77e24760f65b925b4ad48754bf87b76?experiments=&features=reader_skimming%3Atrue"}, {"loc": [5.905762195587158, 5.071253299713135], "id": 870, "title": "Beyond Model Interpretability: On the Faithfulness and Adversarial Robustness of Contrastive Textual Explanations", "authors": "Julia El Zini and Mariette Awad", "abstract": "Contrastive explanation methods go beyond transparency and address the contrastive aspect of explanations. Such explanations are emerging as an attractive option to provide actionable change to scenarios adversely impacted by classifiers' decisions. However, their extension to textual data is under-explored and there is little investigation on their vulnerabilities and limitations. \n\nThis work motivates textual counterfactuals by highlighting the social limitations of non-contrastive explainability. We also lay the ground for a novel evaluation scheme inspired by the faithfulness of explanations. Accordingly, we extend the computation of three metrics, proximity, connectedness and stability, to textual data and we benchmark two successful contrastive methods, POLYJUICE and MiCE, on our suggested metrics. Experiments on sentiment analysis data show that the connectedness of counterfactuals to their original counterparts is not obvious in both models. More interestingly, the generated contrastive texts are more attainable with POLYJUICE which highlights the significance of latent representations in counterfactual search. Finally, we perform the first semantic adversarial attack on textual recourse methods. The results demonstrate the robustness of POLYJUICE and the role that latent input representations play in robustness and reliability.", "track": "Ethics", "label": 21, "url": "https://www.semanticscholar.org/reader/3426e5413932631e5260490ce686ebf303a961e4?experiments=&features=reader_skimming%3Atrue"}, {"loc": [8.539549827575684, 7.848979949951172], "id": 871, "title": "How Much Does Attention Actually Attend? Questioning the Importance of Attention in Pretrained Transformers", "authors": "Michael Hassid, Hao Peng, Daniel Rotem, Jungo Kasai, Ivan Montero, Noah A. Smith and Roy Schwartz", "abstract": "The attention mechanism is considered the backbone of the widely-used Transformer architecture. It contextualizes the input by computing input-specific attention matrices. We find that this mechanism, while powerful and elegant, is not as important as typically thought for pretrained language models. We introduce PAPA, a new probing method that replaces the input-dependent attention matrices with constant ones---the average attention weights over multiple inputs. We use PAPA to analyze several established pretrained Transformers on six downstream tasks. We find that without any input-dependent attention, all models achieve competitive performance---an average relative drop of only 8% from the probing baseline. Further, little or no performance drop is observed when replacing half of the input-dependent attention matrices with constant (input-independent) ones. Interestingly, we show that better-performing models lose more from applying our method than weaker models, suggesting that the utilization of the input-dependent attention mechanism might be a factor in their success. Our results motivate research on simpler alternatives to input-dependent attention, as well as on methods for better utilization of this mechanism in the Transformer architecture.", "track": "Interpretability, Interactivity and Analysis of Models for NLP", "label": 9, "url": "https://www.semanticscholar.org/reader/2537af99905a27d9b84ba9968715f4287f1d3359?experiments=&features=reader_skimming%3Atrue"}, {"loc": [7.299374103546143, 7.5945210456848145], "id": 874, "title": "What Has Been Enhanced in my Knowledge-Enhanced Language Model?", "authors": "Yifan Hou, Guoji Fu and Mrinmaya Sachan", "abstract": "A number of knowledge integration (KI) methods have recently been proposed to incorporate external knowledge into pretrained language models (LMs). Even though knowledge-enhanced LMs (KELMs) outperform base LMs on knowledge-intensive tasks, the inner-workings of these KI methods are not well-understood. For instance, it is unclear which knowledge is effectively integrated into KELMs and which is not; and if such integration led to catastrophic forgetting of already learned knowledge. We show that existing model interpretation methods such as linear probes and prompts have some key limitations in answering these questions. Then, we revisit KI from an information-theoretic view and propose a new theoretically sound probe model called Graph Convolution Simulator (GCS) for KI interpretation. GCS is eventually quite simple -- it uses graph attention on the corresponding knowledge graph for interpretation.\nWe conduct various experiments to verify that GCS provides reasonable interpretation results for two well-known KELMs: ERNIE and K-Adapter. Our experiments reveal that only little knowledge is successfully integrated in these models, and simply increasing the size of the KI corpus may not lead to better KELMs.", "track": "Interpretability, Interactivity and Analysis of Models for NLP", "label": 9, "url": "https://www.semanticscholar.org/reader/1ab45eff6ca001ff421d740a22d3f736f3574aaa?experiments=&features=reader_skimming%3Atrue"}, {"loc": [1.2823032140731812, 7.9568328857421875], "id": 878, "title": "Towards Generalized Open Information Extraction", "authors": "Bowen Yu", "abstract": "Open Information Extraction (OpenIE) facilitates the open-domain discovery of textual facts. However, the prevailing solutions evaluate OpenIE models on in-domain test sets aside from the training corpus, which certainly violates the initial task principle of domain-independence. In this paper, we propose to advance OpenIE towards a more realistic scenario: generalizing over unseen target domains with different data distributions from the source training domains, termed Generalized OpenIE. For this purpose, we first introduce GLOBE, a large-scale human-annotated multi-domain OpenIE benchmark, to examine the robustness of recent OpenIE models to domain shifts, and the relative performance degradation of up to 70\\% implies the challenges of generalized OpenIE. Then, we propose DragonIE, which explores a minimalist expression of textual fact: directed acyclic graph, to improve the OpenIE generalization ability. Extensive experiments demonstrate that DragonIE beats the previous methods in both in-domain and out-of-domain settings by as much as 6.0% in F1 score absolutely, but there is still ample room for improvement.", "track": "Information Extraction", "label": 5, "url": ""}, {"loc": [2.390735149383545, 8.668560028076172], "id": 880, "title": "BioLORD: Learning Ontological Representations from Definitions for Biomedical Concepts and their Textual Descriptions", "authors": "Fran\u00e7ois Remy, Kris Demuynck and Thomas Demeester", "abstract": "This work introduces BioLORD, a new pre-training strategy for producing meaningful representations for clinical sentences and biomedical concepts. State-of-the-art methodologies operate by maximizing the similarity in representation of names referring to the same concept, and preventing collapse through contrastive learning. However, because biomedical names are not always self-explanatory, it sometimes results in non-semantic representations. BioLORD overcomes this issue by grounding its concept representations using definitions, as well as short descriptions derived from a multi-relational knowledge graph consisting of biomedical ontologies. Thanks to this grounding, our model produces more semantic concept representations that match more closely the hierarchical structure of ontologies. BioLORD establishes a new state of the art for text similarity on both clinical sentences (MedSTS) and biomedical concepts (MayoSRS).", "track": "Semantics: Lexical, Sentence level, Textual Inference and Other areas", "label": 8, "url": "https://www.semanticscholar.org/reader/033ce949ded20600b7a770fda78853eb48c5ce89?experiments=&features=reader_skimming%3Atrue"}, {"loc": [8.285796165466309, 6.570565700531006], "id": 881, "title": "Improving the Extraction of Supertags for Constituency Parsing with Linear Context-Free Rewriting Systems", "authors": "Thomas Ruprecht", "abstract": "In parsing phrase structures, supertagging achieves a symbiosis between the interpretability of formal grammars and the accuracy and speed of more recent neural models.\nThe approach was only recently transferred to parsing discontinuous constituency structures with linear context-free rewriting systems (LCFRS).\nWe reformulate and parameterize the previously fixed extraction process for LCFRS supertags with the aim to improve the overall parsing quality.\nThese parameters are set in the context of several steps in the extraction process and are used to control the granularity of extracted grammar rules as well as the association of lexical symbols with each supertag.\nWe evaluate the influence of the parameters on the sets of extracted supertags and the parsing quality using three treebanks in the English and German language, and we compare the best-performing configurations to recent state-of-the-art parsers in the area.\nOur results show that some of our configurations and the slightly modified parsing process improve the quality and speed of parsing with our supertags over the previous approach.\nMoreover, we achieve parsing scores that either surpass or are among the state-of-the-art in discontinuous constituent parsing.", "track": "Syntax, Parsing and their Applications", "label": 23, "url": ""}, {"loc": [8.090771675109863, 7.550258159637451], "id": 892, "title": "Mask More and Mask Later: Efficient Pre-training of Masked Language Models by Disentangling the [MASK] Token", "authors": "Baohao Liao, David Thulke, Sanjika Hewavitharana, Hermann Ney and Christof C. Monz", "abstract": "The pre-training of masked language models (MLMs) consumes massive computation to achieve good results on downstream NLP tasks, resulting in a large carbon footprint. In the vanilla MLM, the virtual tokens, [MASK]s, act as placeholders and gather the contextualized information from unmasked tokens to restore the corrupted information. It raises the question of whether we can append [MASK]s at a later layer, to reduce the sequence length for earlier layers and make the pre-training more efficient. We show: (1) [MASK]s can indeed be appended at a later layer, being disentangled from the word embedding; (2) The gathering of contextualized information from unmasked tokens can be conducted with a few layers. By further increasing the masking rate from 15\\% to 50\\%, we can pre-train RoBERTa-base and RoBERTa-large from scratch with only 78\\% and 68\\% of the original computational budget without any degradation on the GLUE benchmark. When pre-training with the original budget, our method outperforms RoBERTa for 6 out of 8 GLUE tasks, on average by 0.4\\%.", "track": "Efficient Methods for NLP", "label": 12, "url": ""}, {"loc": [7.414797306060791, 5.805326461791992], "id": 907, "title": "SMSMix: Sense-Maintained Sentence Mixup for Word Sense Disambiguation", "authors": "Hee Suk Yoon, Eunseop Yoon, John Harvill, Sunjae Yoon, Mark Hasegawa-Johnson and Chang D. Yoo", "abstract": "Word Sense Disambiguation (WSD) is an NLP task aimed at determining the correct sense of a word in a sentence from discrete sense choices. Although current systems have attained unprecedented performances for such tasks, the nonuniform distribution of word senses during training generally results in systems performing poorly on rare senses. To this end, we consider data augmentation to increase the frequency of these least frequent senses (LFS) to reduce the distributional bias of senses during training. We propose Sense-Maintained Sentence Mixup (SMSMix), a novel word-level mixup method that maintains the sense of a target word. SMSMix smoothly blends two sentences using mask prediction while preserving the relevant span determined by saliency scores to maintain a specific word's sense. To the best of our knowledge, this is the first attempt to apply mixup in NLP while preserving the meaning of a specific word. With extensive experiments, we validate that our augmentation method can effectively give more information about rare senses during training with maintained target sense label.", "track": "Semantics: Lexical, Sentence level, Textual Inference and Other areas", "label": 8, "url": ""}, {"loc": [5.544996738433838, 8.510421752929688], "id": 934, "title": "On the Effectiveness of Automated Metrics for Text Generation Systems", "authors": "Pius von D\u00e4niken, Jan Deriu, Don Tuggener and Mark Cieliebak", "abstract": "A major challenge in the field of Text Generation is evaluation, because we lack a sound theory that can be leveraged to extract guidelines for evaluation campaigns. In this work, we propose a first step towards such a theory that incorporates different sources of uncertainty, such as imperfect automated metrics and insufficiently sized test sets. The theory has practical applications, such as determining the number of samples needed to reliably distinguish the performance of a set of Text Generation systems in a given setting. \nWe showcase the application of the theory on the WMT 21 and Spot-The-Bot evaluation data and outline how it can be leveraged to improve the evaluation protocol regarding the reliability, robustness, and significance of the evaluation outcome.", "track": "Natural Language Generation", "label": 6, "url": "https://www.semanticscholar.org/reader/7a90b933aef61e73a84b1f37d8cde47abf481777?experiments=&features=reader_skimming%3Atrue"}, {"loc": [6.1626482009887695, 8.694008827209473], "id": 941, "title": "Residual Learning of Neural Text Generation with n-gram Language Model", "authors": "Huayang Li, Deng Cai, Jin Xu and Taro Watanabe", "abstract": "N-gram language models (LM) has been largely superseded by neural LMs as the latter exhibits better performance. However, we find that n-gram models can achieve satisfactory performance on a large proportion of testing cases, indicating they have already captured abundant knowledge of the language with relatively low computational cost. With this observation, we propose to learn a neural LM that fits the residual between an n-gram LM and the real-data distribution. The combination of n-gram LMs and neural LMs not only allows the neural part to focus on deeper understanding of the language, but also provides a flexible way to customize a LM by switching the underlying n-gram model without changing the neural model. Experimental results on three typical language tasks (i.e., language modeling, machine translation, and summarization) demonstrate that our approach attains additional performance gains over popular standalone neural models consistently. We also show that our approach allows for effective domain adaptation by simply switching to a domain-specific n-gram model, without any extra training.", "track": "Natural Language Generation", "label": 6, "url": ""}, {"loc": [5.612253189086914, 9.553153038024902], "id": 943, "title": "DiffG-RL: Leveraging Difference between Environment State and Common Sense", "authors": "Tsunehiko Tanaka, Daiki Kimura and Michiaki Tatsubori", "abstract": "Taking into account background knowledge as the context has always been an important part of solving tasks that involve natural language. One representative example of such tasks is text-based games, where players need to make decisions based on both description text previously shown in the game, and their own background knowledge about the language and common sense. In this work, we investigate not simply giving common sense, as can be seen in prior research, but also its effective usage. We assume that a part of the environment states different from common sense should constitute one of the grounds for action selection. We propose a novel agent, DiffG-RL, which constructs a Difference Graph that organizes the environment states and common sense by means of interactive objects with a dedicated graph encoder. DiffG-RL also contains a framework for extracting the appropriate amount and representation of common sense from the source to support the construction of the graph. We validate DiffG-RL in experiments with text-based games that require common sense and show that it outperforms baselines by 17% of scores. We will make our code publicly available.", "track": "Commonsense Reasoning", "label": 19, "url": ""}, {"loc": [8.150410652160645, 5.2382001876831055], "id": 949, "title": "Unsupervised Syntactically Controlled Paraphrase Generation with Abstract Meaning Representations", "authors": "Kuan-Hao Huang, Varun Iyer, Anoop Kumar, Sriram Venkatapathy, Kai-Wei Chang and Aram Galstyan", "abstract": "Syntactically controlled paraphrase generation has become an emerging research direction in recent years. Most existing approaches require annotated paraphrase pairs for training and are thus costly to extend to new domains. Unsupervised approaches, on the other hand, do not need paraphrase pairs but suffer from relatively poor performance in terms of syntactic control and quality of generated paraphrases. In this paper, we demonstrate that leveraging Abstract Meaning Representations (AMR) can greatly improve the performance of unsupervised syntactically controlled paraphrase generation.\nOur proposed model, AMR-enhanced Paraphrase Generator (AMRPG), separately encodes the AMR graph and the constituency parse of the input sentence into two disentangled semantic and syntactic embeddings. A decoder is then learned to reconstruct the input sentence from the semantic and syntactic embeddings. Our experiments show that AMRPG generates more accurate syntactically controlled paraphrases, both quantitatively and qualitatively, compared to the existing unsupervised approaches.  We also demonstrate that the paraphrases generated by AMRPG can be used for data augmentation to improve the robustness of NLP models.", "track": "Unsupervised and Weakly-Supervised Methods in NLP", "label": 17, "url": "https://www.semanticscholar.org/reader/2b5c66f07ba7253c75278978c7f150c9ab05a626?experiments=&features=reader_skimming%3Atrue"}, {"loc": [4.602099895477295, 4.517934322357178], "id": 956, "title": "Can AMR Assist Legal and Logical Reasoning?", "authors": "Nikolaus Schrack, Ruixiang Cui, Hugo A. L\u00f3pez and Daniel Hershcovich", "abstract": "Abstract Meaning Representation (AMR) has been shown to be useful for many downstream tasks. In this work, we explore the use of AMR for legal and logical reasoning. Specifically, we investigate if AMR can help capture logical relationships on multiple choice question answering (MCQA) tasks. We propose neural architectures that utilize linearised AMR graphs in combination with pre-trained language models. While these models are not able to outperform text-only baselines, they correctly solve different instances than the text models, suggesting complementary abilities. Error analysis further reveals that AMR parsing quality is the most prominent challenge, especially regarding inputs with multiple sentences. We conduct a theoretical analysis of how logical relations are represented in AMR and conclude it might be helpful in some logical statements but not for others.", "track": "Semantics: Lexical, Sentence level, Textual Inference and Other areas", "label": 8, "url": ""}, {"loc": [10.569663047790527, 6.962979793548584], "id": 961, "title": "Data Selection Curriculum for Neural Machine Translation", "authors": "Tasnim Mohiuddin, Philipp Koehn, Vishrav Chaudhary, James Cross, Shruti Bhosale and Shafiq Joty", "abstract": "Neural Machine Translation (NMT) models are typically trained on heterogeneous data that are concatenated and randomly shuffled. However, not all of the training data are equally useful to the model. Curriculum training aims to present the data to the NMT models in a meaningful order. In this work, we introduce a two-stage training framework for NMT where we fine-tune a base NMT model on subsets of data, selected by both deterministic scoring using pre-trained methods and online scoring that considers prediction scores of the emerging NMT model. Through comprehensive experiments on six language pairs comprising low- and high-resource languages from WMT'21, we have shown that our curriculum strategies consistently demonstrate better quality (up to +2.2 BLEU improvement) and faster convergence (approximately 50% fewer updates).", "track": "Machine Translation", "label": 10, "url": "https://www.semanticscholar.org/reader/d6c4b31958fe9e4ff4f83e049ed5c6881653eb03?experiments=&features=reader_skimming%3Atrue"}, {"loc": [5.836450099945068, 9.042604446411133], "id": 973, "title": "Text Editing as Imitation Game", "authors": "Ning Shi, Bin Tang, Bo Yuan, Longtao Huang, Yewen Pu, Jie Fu and Zhouhan Lin", "abstract": "Text editing, such as grammatical error correction, arises naturally from imperfect textual data. Recent works frame text editing as a multi-round sequence tagging task, where operations -- such as insertion and substitution -- are represented as a sequence of tags. While achieving good results, this encoding is limited in flexibility as all actions are bound to token-level tags. In this work, we reformulate text editing as an imitation game using behavioral cloning. Specifically, we convert conventional sequence-to-sequence data into state-to-action demonstrations, where the action space can be as flexible as needed. Instead of generating the actions one at a time, we introduce a dual decoders structure to parallel the decoding while retaining the dependencies between action tokens, coupled with trajectory augmentation to alleviate the distribution shift that imitation learning often suffers. In experiments on a suite of Arithmetic Equation benchmarks, our model consistently outperforms the autoregressive baselines in terms of performance, efficiency, and robustness. We hope our findings will shed light on future studies in reinforcement learning applying sequence-level action generation to natural language processing.", "track": "Natural Language Generation", "label": 6, "url": "https://www.semanticscholar.org/reader/632c66f202c7b3abf488d7af0cea589694d6a875?experiments=&features=reader_skimming%3Atrue"}, {"loc": [6.962378025054932, 9.911242485046387], "id": 983, "title": "Seeded Hierarchical Clustering for Expert-Crafted Taxonomies", "authors": "Anish Saha, Amith Ananthram, Emily Allaway, Heng Ji and Kathleen McKeown", "abstract": "Practitioners from many disciplines (e.g., political science) use expert-crafted taxonomies to make sense of large, unlabeled corpora. In this work, we study Seeded Hierarchical Clustering (SHC): the task of automatically fitting unlabeled data to such taxonomies using a small set of labeled examples. We propose HierSeed, a novel weakly supervised algorithm for this task that uses only a small set of labeled seed examples in a computation and data efficient manner. HierSeed assigns documents to topics by weighing document density against topic hierarchical structure. It outperforms unsupervised and supervised baselines for the SHC task on three real-world datasets.", "track": "Unsupervised and Weakly-Supervised Methods in NLP", "label": 17, "url": "https://www.semanticscholar.org/reader/4e9e4403cb892a2c0facd257d832393793cbd5b4?experiments=&features=reader_skimming%3Atrue"}, {"loc": [0.697782576084137, 6.815269947052002], "id": 988, "title": "Knowledge Graph Generation From Text", "authors": "Igor Melnyk, Pierre Dognin and Payel Das", "abstract": "In this work we propose a novel end-to-end multi-stage Knowledge Graph (KG) generation system from textual inputs, separating the overall process into two stages. The graph nodes are generated first using pretrained language model, followed by a simple edge construction head, enabling efficient KG extraction from the text. For each stage we consider several architectural choices that can be used depending on the available training resources. We evaluated the model on a recent WebNLG 2020 Challenge dataset, matching the state-of-the-art performance on text-to-RDF generation task, as well as on New York Times (NYT) and a large-scale TekGen datasets, showing strong overall performance, outperforming the existing baselines. We believe that the proposed system can serve as a viable KG construction alternative to the existing linearization or sampling-based graph generation approaches.", "track": "NLP Applications", "label": 0, "url": ""}, {"loc": [3.8624353408813477, 7.540047645568848], "id": 995, "title": "DialogueGAT: A Graph Attention Network for Financial Risk Prediction by Modeling the Dialogues in Earnings Conference Calls", "authors": "Yunxin Sang and Yang Bao", "abstract": "Financial risk prediction is an essential task for risk management in capital markets. While traditional prediction models are built based on the hard information of numerical data, recent studies have shown that the soft information of verbal cues in earnings conference calls is significant for predicting market risk due to its less constrained fashion and direct interaction between managers and analysts. However, most existing models mainly focus on extracting useful semantic information from the textual conference call transcripts but ignore their subtle yet important information of dialogue structures. To bridge this gap, we develop a graph attention network called DialogueGAT for financial risk prediction by simultaneously modeling the speakers and their utterances in dialogues in conference calls. Different from previous studies, we propose a new method for constructing the graph of speakers and utterances in a dialogue, and design contextual attention at both speaker and utterance levels for disentangling their effects on the downstream prediction task. For model evaluation, we extend an existing dataset of conference call transcripts by adding the dialogue structure and speaker information. Empirical results on our dataset of S&P1500 companies demonstrate the superiority of our proposed model over competitive baselines from the extant literature.", "track": "Computational Social Science and Cultural Analytics", "label": 20, "url": ""}, {"loc": [6.338695526123047, 5.31313943862915], "id": 996, "title": "Investigating Ensemble Methods for Model Robustness Improvement of Text Classifiers", "authors": "Jieyu Zhao, Xuezhi Wang, Yao Qin, Jilin Chen and Kai-Wei Chang", "abstract": "Large pre-trained language models have shown remarkable performance over the past few years. These models, however, sometimes learn superficial features from the dataset and cannot generalize to the distributions that are dissimilar to the training scenario. There have been several approaches proposed to reduce model's reliance on these bias features which can improve model robustness in the out-of-distribution setting. However, existing methods usually use a fixed low-capacity model to deal with various bias features, which ignore the learnability of those features. In this paper, we analyze a set of existing bias features and demonstrate there is no single model that works best for all the cases. We further show that by choosing an appropriate bias model, we can obtain a better robustness result than baselines with a more sophisticated model design.", "track": "Interpretability, Interactivity and Analysis of Models for NLP", "label": 9, "url": "https://www.semanticscholar.org/reader/bb86ade4959e9d03e0c5321cde82d759759fd958?experiments=&features=reader_skimming%3Atrue"}, {"loc": [7.26923942565918, 9.541299819946289], "id": 1007, "title": "Adaptive Ranking-based Sample Selection for Weakly Supervised Class-imbalanced Text Classification", "authors": "Linxin Song, Jieyu Zhang, Tianxiang Yang and Masayuki Goto", "abstract": "To obtain a large amount of training labels inexpensively, researchers have recently adopted the weak supervision (WS) paradigm, which leverages labeling rules to synthesize training labels rather than using individual annotations to achieve competitive results for natural language processing (NLP) tasks. However, data imbalance is often overlooked in applying the WS paradigm, despite being a common issue in a variety of NLP tasks. To address this challenge, we propose Adaptive Ranking-based Sample Selection (ARS2), a model-agnostic framework to alleviate the data imbalance issue in the WS paradigm. Specifically, it calculates a probabilistic margin score based on the output of the current model to measure and rank the cleanliness of each data point. Then, the ranked data are sampled based on both class-wise and rule-aware ranking. In particular, the two sample strategies corresponds to our motivations: (1) to train the model with balanced data batches to reduce the data imbalance issue and (2) to exploit the expertise of each labeling rule for collecting clean samples. Experiments on four text classification datasets with four different imbalance ratios show that ARS2 outperformed the state-of-the-art imbalanced learning and WS methods, leading to a 2%-57.8% improvement on their F1-score.", "track": "Unsupervised and Weakly-Supervised Methods in NLP", "label": 17, "url": "https://www.semanticscholar.org/reader/67d2979fb0c877a8c95194a7433db2e98b3a6d55?experiments=&features=reader_skimming%3Atrue"}, {"loc": [4.808779239654541, 3.34919810295105], "id": 1011, "title": "ComFact: A Benchmark for Linking Contextual Commonsense Knowledge", "authors": "Silin Gao, Jena D. Hwang, Saya Kanno, Hiromi Wakaki, Yuki Mitsufuji and Antoine Bosselut", "abstract": "Understanding rich narratives, such as dialogues and stories, often requires natural language processing systems to access relevant knowledge from commonsense knowledge graphs. However, these systems typically retrieve facts from KGs using simple heuristics that disregard the complex challenges of identifying situationally-relevant commonsense knowledge (e.g., contextualization, implicitness, ambiguity).\n\nIn this work, we propose the new task of commonsense fact linking, where models are given contexts and trained to identify situationally-relevant commonsense knowledge from KGs. Our novel benchmark, ComFact, contains ~293k in-context relevance annotations for commonsense triplets across four stylistically diverse dialogue and storytelling datasets. Experimental results confirm that heuristic fact linking approaches are imprecise knowledge extractors. Learned fact linking models demonstrate across-the-board performance improvements (~34.6% F1) over these heuristics. Furthermore, improved knowledge retrieval yielded average downstream improvements of 9.8% for a dialogue response generation task. However, fact linking models still significantly underperform humans, suggesting our benchmark is a promising testbed for research in commonsense augmentation of NLP systems.", "track": "Commonsense Reasoning", "label": 19, "url": "https://www.semanticscholar.org/reader/d1feb79f63ea52839f4a784fbd7d60bb73dd98dd?experiments=&features=reader_skimming%3Atrue"}, {"loc": [7.587749004364014, 7.9540181159973145], "id": 1014, "title": "Learning to Perform Complex Tasks through Compositional Fine-Tuning of Language Models", "authors": "Victor Bursztyn, David Demeter, Doug Downey and Larry Birnbaum", "abstract": "How to usefully encode compositional task structure has long been a core challenge in AI. Recent work in chain of thought prompting has shown that for very large neural language models (LMs), explicitly demonstrating the inferential steps involved in a target task may improve performance over end-to-end learning that focuses on the target task alone. However, chain of thought prompting has significant limitations due to its dependency on huge pretrained LMs. In this work, we present compositional fine-tuning (CFT): an approach based on explicitly decomposing a target task into component tasks, and then fine-tuning smaller LMs on a curriculum of such component tasks. We apply CFT to recommendation tasks in two domains, world travel and local dining, as well as a previously studied inferential task (sports understanding). We show that CFT outperforms end-to-end learning even with equal amounts of data, and gets consistently better as more component tasks are modeled via fine-tuning. Compared with chain of thought prompting, CFT performs at least as well using LMs only 7.4% of the size, and is moreover applicable to task domains for which data are not available during pretraining.", "track": "Commonsense Reasoning", "label": 19, "url": "https://www.semanticscholar.org/reader/798abf86efae9e37b9b6a694ef87b6c1dbaab263?experiments=&features=reader_skimming%3Atrue"}, {"loc": [6.882952690124512, 9.921767234802246], "id": 1027, "title": "Topic Taxonomy Expansion via Hierarchy-Aware Topic Phrase Generation", "authors": "Dongha Lee, Jiaming Shen, Seonghyeon Lee, Susik Yoon, Hwanjo Yu and Jiawei Han", "abstract": "Topic taxonomies display hierarchical topic structures of a text corpus and provide topical knowledge to enhance various NLP applications. To dynamically incorporate new topic information, several recent studies have tried to expand (or complete) a topic taxonomy by inserting emerging topics identified in a set of new documents. However, existing methods focus only on frequent terms in documents and the local topic-subtopic relations in a taxonomy, which leads to limited topic term coverage and fails to model the global taxonomy structure. In this work, we propose a novel framework for topic taxonomy expansion, named TopicExpan, which directly generates topic-related terms belonging to new topics. Specifically, TopicExpan leverages the hierarchical relation structure surrounding a new topic and the textual content of an input document for topic term generation. This approach encourages newly-inserted topics to further cover important but less frequent terms as well as to keep their relation consistency within the taxonomy. Experimental results on two real-world text corpora show that TopicExpan significantly outperforms other baseline methods in terms of the quality of output taxonomies.", "track": "Information Retrieval and Text Mining", "label": 15, "url": "https://www.semanticscholar.org/reader/cb2249f14414c31bd8617dfc76c20c8874ba0284?experiments=&features=reader_skimming%3Atrue"}, {"loc": [5.934807777404785, 6.070494174957275], "id": 1029, "title": "Language as a fingerprint: Self-supervised learning of user encodings using transformers", "authors": "Roberta Rocca and Tal Yarkoni", "abstract": "The way we talk carries information about who we are. Demographics, personality, clinical conditions, political preferences influence what we speak about and how, suggesting that many individual attributes could be inferred from adequate encodings of linguistic behavior. Conversely, conditioning text representations on author attributes has been shown to improve model performance in many NLP tasks. Previous research on individual differences and language representations has mainly focused on predicting selected attributes from text, or on conditioning text representations on such attributes for author-based contextualization. Here, we present a self-supervised approach to learning language-based user encodings using transformers. Using a large corpus of Reddit submissions, we fine-tune DistilBERT on user-based triplet loss. We show that fine-tuned models can pick up on complex linguistic signatures of users, and that they are able to infer rich information about them. Through a series of intrinsic analyses and probing tasks, we provide evidence that fine-tuning enhances models' ability to abstract generalizable user information, which yields performance advantages for user-based downstream tasks. We discuss applications in language-based assessment and contextualized and personalized NLP.", "track": "Linguistic Theories, Cognitive Modeling and Psycholinguistics", "label": 22, "url": ""}, {"loc": [7.51607608795166, 8.335508346557617], "id": 1032, "title": "Hyperdecoders: Instance-specific decoders for multi-task NLP", "authors": "Hamish Ivison and Matthew Peters", "abstract": "We investigate input-conditioned hypernetworks for multi-tasking in NLP, generating parameter-efficient adaptations for a decoder using a hypernetwork conditioned on the output of an encoder. This approach produces a unique decoder adaptation for every input instance, allowing the network a larger degree of flexibility than prior work that only produces one decoder adaptation per task. We apply our method to sequence classification tasks, extractive QA, and summarisation and find that it surpasses previous parameter efficient fine-tuning methods and often outperforms fully finetuning the underlying model. An analysis of the embeddings used by our hypernetwork shows that they are sensitive to output label and type, suggesting that our approach better maps from encoder representations to output labels. Our code is publicly available at https://github.com/allenai/hyperdecoders.", "track": "Machine Learning for NLP", "label": 3, "url": "https://www.semanticscholar.org/reader/9060d9408fda662f717de99b004045ec1168e581?experiments=&features=reader_skimming%3Atrue"}, {"loc": [5.489401817321777, 5.087064266204834], "id": 1038, "title": "Evaluating the Faithfulness of Importance Measures in NLP by Recursively Masking Allegedly Important Tokens and Retraining", "authors": "Andreas Madsen, Nicholas Meade, Vaibhav Adlakha and Siva Reddy", "abstract": "To explain NLP models a popular approach is to use importance measures, such as attention, which inform input tokens are important for making a prediction. However, an open question is how well these explanations accurately reflect a model's logic, a property called faithfulness. To answer this question, we propose Recursive ROAR, a new faithfulness metric. This works by recursively masking allegedly important tokens and then retraining the model. The principle is that this should result in worse model performance compared to masking random tokens. The result is a performance curve given a masking-ratio. Furthermore, we propose a summarizing metric using area-between-curves (ABC), which allows for easy comparison across papers, models, and tasks. We evaluate 4 different importance measures on 8 different datasets, using both LSTM-attention models and RoBERTa models. We find that the faithfulness of importance measures is both model-dependent and task-dependent. This conclusion contradicts previous evaluations in both computer vision and faithfulness of attention literature.", "track": "Interpretability, Interactivity and Analysis of Models for NLP", "label": 9, "url": ""}, {"loc": [5.697113513946533, 6.019443035125732], "id": 1042, "title": "Towards Explaining Subjective Ground of Individuals on Social Media", "authors": "Younghun Lee and Dan Goldwasser", "abstract": "Large-scale language models have been reducing the gap between machines and humans in understanding the real world, yet understanding an individual's theory of mind and behavior from text is far from being resolved. \n\nThis research proposes a neural model---Subjective Ground Attention---that learns subjective grounds of individuals and accounts for their judgments on situations of others posted on social media. Using simple attention modules as well as taking one's previous activities into consideration, we empirically show that our model provides human-readable explanations of an individual's subjective preference in judging social situations. We further qualitatively evaluate the explanations generated by the model and claim that our model learns an individual's subjective orientation towards abstract moral concepts.", "track": "Interpretability, Interactivity and Analysis of Models for NLP", "label": 9, "url": ""}, {"loc": [2.3674139976501465, 8.600701332092285], "id": 1045, "title": "Knowledge Injected Prompt Based Fine-tuning for Multi-label Few-shot ICD Coding", "authors": "Zhichao Yang, Shufan Wang, Bhanu Pratap Singh Rawat, Avijit Mitra and hong yu", "abstract": "Automatic International Classification of Diseases (ICD) coding aims to assign multiple ICD codes to a medical note with average length of 3,000+ tokens. This task is challenging due to a high-dimensional space of multi-label assignment (tens of thousands of ICD codes) and the long-tail challenge: only a few codes (common diseases) are frequently assigned while most codes (rare diseases) are infrequently assigned. This study addresses the long-tail challenge by adapting a prompt-based fine-tuning technique with label semantics, which has been shown to be effective under few-shot setting. To further enhance the performance in medical domain, we propose a knowledge-enhanced longformer by injecting three domain-specific knowledge:  hierarchy, synonym, and abbreviation with additional pretraining using contrastive learning. Experiments on MIMIC-III-full, a benchmark dataset of code assignment, show that our proposed method outperforms previous state-of-the-art method in 14.5% in marco F1 (from 10.3 to 11.8, P<0.001). To further test our model on few-shot setting, we created a new rare diseases coding dataset, MIMIC-III-rare50, on which our model improves marco F1 from 17.1 to 30.4 and micro F1 from 17.2 to 32.6 compared to previous method.", "track": "NLP Applications", "label": 0, "url": "https://www.semanticscholar.org/reader/0b80389b6ec62e0c03c822c2748f7c41d859bcb7?experiments=&features=reader_skimming%3Atrue"}, {"loc": [4.294095993041992, 3.9713070392608643], "id": 1051, "title": "Do Language Models Understand Measurements?", "authors": "Sungjin Park, Seungwoo Ryu and Edward Choi", "abstract": "Recent success of pre-trained language models (PLMs) has stimulated interest in their ability to understand and work with numbers. Yet, the numerical reasoning over measurements has not been formally studied despite their importance. In this study, we show that PLMs lack the capability required for reasoning over measurements. Furthermore, we find that a language model trained on a measurement-rich corpus shows better performance on understanding measurements. We propose a simple embedding strategy to better distinguish between numbers and units, which leads to a significant improvement in the probing tasks.", "track": "Language Modeling and Analysis of Language Models", "label": 2, "url": "https://www.semanticscholar.org/reader/ff8f3dfd9e2f4a92310999722abefab202935521?experiments=&features=reader_skimming%3Atrue"}, {"loc": [1.8120239973068237, 8.973163604736328], "id": 1070, "title": "Reconciliation of Pre-trained Models and Prototypical Neural Networks in Few-shot Named Entity Recognition", "authors": "Youcheng Huang, Wenqiang Lei, Jie Fu and Jiancheng Lv", "abstract": "Incorporating large-scale pre-trained models with the prototypical neural networks is a de-facto paradigm in few-shot named entity recognition. Existing methods, unfortunately, are not aware of the fact that embeddings from pre-trained models contain a prominently large amount of information regarding word frequencies, biasing prototypical neural networks against learning word entities. This discrepancy constrains the two models' synergy. Thus, we propose a one-line-code normalization method to reconcile such a mismatch with empirical and theoretical grounds. Our experiments based on nine benchmark datasets show the superiority of our method over the counterpart models and are comparable to the state-of-the-art methods. In addition to the model enhancement, our work also provides an analytical viewpoint for addressing the general problems in few-shot name entity recognition or other tasks that rely on pre-trained models or prototypical neural networks.", "track": "Efficient Methods for NLP", "label": 12, "url": "https://www.semanticscholar.org/reader/5c4070cb73a3c2045d99773bc36ba6520c501662?experiments=&features=reader_skimming%3Atrue"}, {"loc": [2.0803070068359375, 7.576641082763672], "id": 1071, "title": "HCL-TAT: A Hybrid Contrastive Learning Method for Few-shot Event Detection with Task-Adaptive Threshold", "authors": "Ruihan Zhang, Wei Wei, Xian-Ling Mao, rui fang and Dangyang Chen", "abstract": "Event detection has been suffering from constantly emerging event types with lack of sufficient data. Existing works formulate the new problem as few-shot event detection (FSED), and employ two-stage or unified models based on meta-learning to address the problem. However, these methods fall far short of expectations due to: (i) insufficient learning of discriminative representations in low-resource scenarios, and (ii) representation overlap between triggers and non-triggers. To resolve the above issues, in this paper, we propose a novel Hybrid Contrastive Learning method with a Task-Adaptive Threshold (abbreviated as HCL-TAT), which enables discriminative representation learning with a two-view contrastive loss (support-support and prototype-query), and devises an easily-adapted threshold to alleviate misidentification of triggers. Extensive experiments on the benchmark dataset FewEvent demonstrate the superiority of our method to achieve better results compared to the state-of-the-arts. All the data and codes will be available to facilitate future research.", "track": "Information Extraction", "label": 5, "url": "https://www.semanticscholar.org/reader/e6f2d8eeca0796914e3a6bcc311e153c5ad79224?experiments=&features=reader_skimming%3Atrue"}, {"loc": [4.149147987365723, 7.391139030456543], "id": 1092, "title": "Doc2Bot: Accessing Heterogeneous Documents via Conversational Bots", "authors": "Haomin Fu, Yeqin Zhang, Haiyang Yu, Jian Sun, Fei Huang, Luo Si, Yongbin Li and Cam Tu Nguyen", "abstract": "This paper introduces Doc2Bot, a novel dataset for building machines that help users seek information via conversations. This is of particular interest for companies and organizations that own a large number of manuals or instruction books. Despite its potential,  the nature of our task poses several challenges: (1) documents contain various structures that hinder the ability of machines to comprehend, and (2) user information needs are often underspecified. Compared to prior datasets that either focus on a single structural type or overlook the role of questioning to uncover user needs, the Doc2Bot dataset is developed to target such challenges systematically. Our dataset contains over 100,000 turns based on Chinese documents from five domains, larger than any prior document-grounded dialog dataset for information seeking. We propose three tasks in Doc2Bot: (1) dialog state tracking to track user intentions, (2) dialog policy learning to plan system actions and contents, and (3) response generation which generates responses based on the outputs of the dialog policy. Baseline methods based on the latest deep learning models are presented, indicating that our proposed tasks are challenging and worthy of further research.", "track": "Dialogue and Interactive Systems", "label": 4, "url": ""}, {"loc": [1.7070924043655396, 9.068937301635742], "id": 1101, "title": "DualNER: A Dual-Teaching framework for Zero-shot Cross-lingual Named Entity Recognition", "authors": "Jiali Zeng, Yufan Jiang, Yongjing Yin, Xu Wang, Binghuai Lin and Yunbo Cao", "abstract": "We present DualNER, a simple and effective framework to make full use of both annotated source language corpus and unlabeled target language text for zero-shot cross-lingual named entity recognition (NER). In particular, we combine two complementary learning paradigms of NER, i.e., sequence labeling and span prediction, into a unified multi-task framework. After obtaining a sufficient NER model trained on the source data, we further train it on the target data in a {\\it dual-teaching} manner, in which the pseudo-labels for one task are constructed from the prediction of the other task. Moreover, based on the span prediction, an entity-aware regularization is proposed to enhance the intrinsic cross-lingual alignment between the same entities in different languages. Experiments and analysis demonstrate the effectiveness of our DualNER.", "track": "Multilinguality", "label": 13, "url": "https://www.semanticscholar.org/reader/aa86949534a37baaeacad11692a75bbed8b5e018?experiments=&features=reader_skimming%3Atrue"}, {"loc": [2.507970094680786, 4.832772731781006], "id": 1108, "title": "Knowledge-augmented Self-training of A Question Rewriter for Conversational Knowledge Base Question Answering", "authors": "Xirui Ke, Jing Zhang, Xin Lv, Yiqi Xu, Shulin Cao, Cuiping Li, Hong Chen and Juanzi Li", "abstract": "The recent rise of conversational applications such as online customer service systems and intelligent personal assistants has promoted the development of conversational knowledge base question answering (ConvKBQA). Different from the traditional single-turn KBQA, ConvKBQA usually explores multi-turn questions around a topic, where ellipsis and coreference pose great challenges to the single-turn KBQA systems which require self-contained questions. In this paper, we propose a rewrite-and-reason framework to first produce a full-fledged rewritten question based on the conversation history and then reason the answer by existing single-turn KBQA models. To overcome the absence of the rewritten supervision signals, we introduce a knowledge-augmented self-training mechanism to transfer the question rewriter from another dataset to adapt to the current knowledge base. Our question rewriter is decoupled from the subsequent QA process, which makes it easy to be united with either retrieval-based or semantic parsing-based KBQA models. Experiment results demonstrate the effectiveness of our method and a new state-of-the-art result is achieved. The code and dataset are available online now.", "track": "Question Answering", "label": 11, "url": ""}, {"loc": [3.6973989009857178, 9.376612663269043], "id": 1134, "title": "Extractive Summarization of Legal Decisions using Multi-task Learning and Maximal Marginal Relevance", "authors": "Abhishek Agarwal, Shanshan Xu and Matthias Grabmair", "abstract": "Summarizing legal decisions requires the expertise of law practitioners, which is both time- and cost-intensive. This paper presents techniques for extractive summarization of legal decisions in a low-resource setting using limited expert annotated data. We test a set of models that locate relevant content using a sequential model and tackle redundancy by leveraging maximal marginal relevance to compose summaries. We also demonstrate an implicit approach to help train our proposed models generate more informative summaries. Our multi-task learning model variant leverages rhetorical role identification as an auxiliary task to further improve the summarizer. We perform extensive experiments on datasets containing legal decisions from the US Board of Veterans' Appeals and conduct quantitative and expert-ranked evaluations of our models. Our results show that the proposed approaches can achieve ROUGE scores vis-\u00e0-vis expert extracted summaries that match those achieved by inter-annotator comparison.", "track": "Ethic Concerns:Summarization", "label": 14, "url": "https://www.semanticscholar.org/reader/ad2c314353ad96447acf030b9ac3f7326b56e51a?experiments=&features=reader_skimming%3Atrue"}, {"loc": [4.967792510986328, 12.052706718444824], "id": 1153, "title": "MovieUN: A Dataset for Movie Understanding and Narrating", "authors": "QI ZHANG, Zihao Yue, Anwen Hu, Ziheng Wang and Qin Jin", "abstract": "Automatic movie narration generation and narration grounding are very important to provide a true movie experience for the blind and visually impaired. To tell the movie story well, it is necessary to mention plot-related details (such as character names) and keep the narrations in a plot coherent. Taking these two points into consideration, we construct a Chinese large-scale video benchmark from 101 movies for Movie Understanding and Narrating (MovieUN) to support the Movie Clip Narrating (MCN) task and Temporal Narration Grounding (TNG) task. We split movies in MovieUN into movie clips according to plots, and pair them with corresponding narrations provided by the movie narrators. Ultimately, the TNG task involves 3,253 long video clips totaling 179 hours. The MCN task contains 33,060 video clips totaling 105 hours. We benchmark state-of-the-art video captioning models and temporal grounding models in MCN and TNG tasks, respectively. Furthermore, to accurately comprehend plots of different characters, we propose methods to incorporate portraits of actors as external knowledge in both tasks. The experiment results demonstrate the effectiveness of our proposed methods. The dataset and codes are released at https://github.com/yuezih/MovieUN.", "track": "Resources and Evaluation", "label": 1, "url": ""}, {"loc": [5.902313709259033, 8.507898330688477], "id": 1154, "title": "ASDOT: Any-Shot Data-to-Text Generation with Pretrained Language Models", "authors": "Jiannan Xiang, Zhengzhong Liu, Yucheng Zhou, Eric P. Xing and Zhiting Hu", "abstract": "Data-to-text generation is challenging due to the great variety of the input data in terms of domains (e.g., finance vs sports) or schemata (e.g., diverse predicates). Recent end-to-end neural methods thus require substantial training examples to learn to disambiguate and describe the data. Yet, real-world data-to-text problems often suffer from various data-scarce issues: one may have access to only a handful of or no training examples, and/or have to rely on examples in a different domain or schema. To fill this gap, we propose Any-Shot Data-to-Text (ASDOT), a new approach flexibly applicable to diverse settings by making efficient use of any given (or no) examples. ASDOT consists of two steps, data disambiguation and sentence fusion, both of which are amenable to be solved with off-the-shelf pretrained language models (LMs) with optional finetuning. In the data disambiguation stage, we employ the prompted GPT-3 model to understand possibly ambiguous triples from the input data and convert each into a short sentence with reduced ambiguity. The sentence fusion stage then uses an LM like T5 to fuse all the resulting sentences into a coherent paragraph as the final description. We evaluate extensively on various datasets in different scenarios, including the zero-/few-/full-shot settings, and generalization to unseen predicates and out-of-domain data. Experimental results show that ASDOT consistently achieves significant improvement over baselines, e.g., a 30.81 BLEU gain on the DART dataset under the zero-shot setting.", "track": "Natural Language Generation", "label": 6, "url": "https://www.semanticscholar.org/reader/0269664dbaebc427b1a0860526f5ea3aac811e31?experiments=&features=reader_skimming%3Atrue"}, {"loc": [10.823212623596191, 9.343153953552246], "id": 1157, "title": "FCGEC: Fine-Grained Corpus for Chinese Grammatical Error Correction", "authors": "Lvxiaowei Xu, Jianwang Wu, Jiawei Peng, Jiayu Fu and Ming Cai", "abstract": "Grammatical Error Correction (GEC) has been broadly applied in automatic correction and proofreading system recently. However, it is still immature in Chinese GEC due to limited high-quality data from native speakers in terms of category and scale. In this paper, we present FCGEC, a fine-grained corpus to detect, identify and correct the grammatical errors. FCGEC is a human-annotated corpus with multiple references, consisting of 41,340 sentences collected mainly from multi-choice questions in public school Chinese examinations. Furthermore, we propose a Switch-Tagger-Generator (STG) baseline model to correct the grammatical errors in low-resource settings. Compared to other GEC benchmark models, experimental results illustrate that STG outperforms them on our FCGEC. However, there exists a significant gap between benchmark models and humans that encourages future models to bridge it.", "track": "Resources and Evaluation", "label": 1, "url": "https://www.semanticscholar.org/reader/c080f022c6f57d10dc8e8e44231c8995480b884d?experiments=&features=reader_skimming%3Atrue"}, {"loc": [5.420965671539307, 8.320318222045898], "id": 1160, "title": "Audience-Centric Natural Language Generation via Style Infusion", "authors": "Samraj Moorjani, Adit Krishnan, Hari Sundaram, Ewa Maslowska and Aravind Sankar", "abstract": "Adopting contextually appropriate, audience-tailored linguistic styles is critical to the success of user-centric language generation systems (e.g., chatbots, computer-aided writing, dialog systems). While existing approaches demonstrate text style transfer (TST) with large volumes of parallel or non-parallel data, we argue that grounding style on audience-independent external factors is innately limiting for two reasons. First, it is difficult to collect large volumes of audience-specific stylistic data. Second, some stylistic objectives (e.g., persuasiveness, memorability, empathy) are hard to define without audience feedback. \n\nIn this paper, we propose the novel task of style infusion - infusing the stylistic preferences of audiences in pretrained language generation models. Since humans are better at pairwise comparisons than direct scoring - i.e., is Sample-A more persuasive/polite/empathic than Sample-B - we leverage limited pairwise human judgments to bootstrap a style analysis model and augment our seed set of judgments. We then infuse the learned textual style in a GPT-2 based text generator while balancing fluency and style adoption. With quantitative and qualitative assessments, we show that our infusion approach can generate compelling stylized examples with generic text prompts. We make the anonymized code and data accessible.", "track": "Natural Language Generation", "label": 6, "url": ""}, {"loc": [4.0762858390808105, 8.105022430419922], "id": 1163, "title": "DocFin: Multimodal Financial Prediction and Bias Mitigation using Semi-structured Documents", "authors": "Puneet Mathur, Mihir Goyal, Ramit Sawhney, Ritik Mathur, Jochen L. Leidner, Franck Dernoncourt and Dinesh Manocha", "abstract": "Financial prediction is complex due to the stochastic nature of the stock market. Semi-structured financial documents present comprehensive financial data in tabular formats, such as earnings, profit-loss statements, and balance sheets, and can often contain rich technical analysis along with a textual discussion of corporate history, and management analysis, compliance, and risks. Existing research focuses on the textual and audio modalities of financial disclosures from company conference calls to forecast stock volatility and price movement, but ignores the rich tabular data available in financial reports. Moreover, the economic realm is still plagued with a severe under-representation of various communities spanning diverse demographics, gender, and native speakers. In this work, we show that combining tabular data from financial semi-structured documents with text transcripts and audio recordings not only improves stock volatility and price movement prediction by 5-12% but also reduces gender bias caused due to audio-based neural networks by over 30%.", "track": "NLP Applications", "label": 0, "url": ""}, {"loc": [0.7808869481086731, 8.056486129760742], "id": 1168, "title": "Not Just Plain Text! Fuel Document-Level Relation Extraction with Explicit Syntax Refinement and Subsentence Modeling", "authors": "Zhichao Duan, Xiuxing Li, Zhenyu Li, Zhuo Wang and Jianyong Wang", "abstract": "Document-level relation extraction (DocRE) aims to identify semantic labels among entities within a single document. One major challenge of DocRE is to dig decisive details regarding a specific entity pair from long text. However, in many cases, only a fraction of text carries required information, even in the manually labeled supporting evidence. To better capture and exploit instructive information, we propose a novel expLicit syntAx Refinement and Subsentence mOdeliNg based framework (LARSON). By introducing extra syntactic information, LARSON can model subsentences of arbitrary granularity and efficiently screen instructive ones. Moreover, we incorporate refined syntax into text representations which further improves the performance of LARSON. Experimental results on three benchmark datasets (DocRED, CDR, and GDA) demonstrate that LARSON significantly outperforms existing methods.", "track": "Information Extraction", "label": 5, "url": "https://www.semanticscholar.org/reader/bf7f629b49419a0da3e26bd0ae576011da6df932?experiments=&features=reader_skimming%3Atrue"}, {"loc": [9.822071075439453, 7.907843589782715], "id": 1171, "title": "Self-supervised Rewiring of Pre-trained Speech Encoders: \\\\Towards Faster Fine-tuning with Less Labels in Speech Processing", "authors": "Hao Yang, Jinming Zhao, Gholamreza Haffari and Ehsan Shareghi", "abstract": "Pre-trained speech Transformers have facilitated great success across various speech processing tasks. However, fine-tuning these encoders for downstream tasks require sufficiently large training data to converge or to achieve state-of-the-art. In text domain this has been partly attributed to sub-optimality of the representation space in pre-trained Transformers. In this work, we take a sober look into pre-trained speech encoders and rewire their representation space without requiring any task-specific labels. Our method utilises neutrally synthesised version of audio inputs along with frame masking to construct positive pairs for contrastive self-supervised learning. When used for augmenting the wav2vec 2 encoder, we observe consistent improvement of isotropy in the representation space. Our experiments on 6 speech processing tasks, exhibit a significant convergence speedup during task fine-tuning as well as consistent task improvement, specially in low-resource settings.", "track": "Speech, Vision, Robotics, Multimodal Grounding", "label": 7, "url": "https://www.semanticscholar.org/reader/ea677fa717d9a9f97840e0d78ef87b734cb4a907?experiments=&features=reader_skimming%3Atrue"}, {"loc": [10.16253662109375, 7.8309807777404785], "id": 1177, "title": "RedApt: An Adaptor for wav2vec 2 Encoding \\\\ Faster and Smaller Speech Translation without Quality Compromise", "authors": "Jinming Zhao, Hao Yang, Gholamreza Haffari and Ehsan Shareghi", "abstract": "Pre-trained speech Transformers in speech translation (ST) have facilitated state-of-the-art (SotA) results; yet, using such encoders is computationally expensive. To improve this, we present a novel Reducer Adaptor block, RedApt, that could be seamlessly integrated within any Transformer-based speech encoding architecture. Integrating the pretrained wav2vec 2 speech encoder with RedAptbrings 41% speedup, 33% memory reduction with 24% fewer FLOPs at inference. To our positive surprise, our ST model with RedApt outperforms the SotA architecture by an average of 0.68 BLEU score on 8 language pairs from Must-C.", "track": "Speech, Vision, Robotics, Multimodal Grounding", "label": 7, "url": "https://www.semanticscholar.org/reader/8890487320f8e4d588cd344ab72a770042267b2b?experiments=&features=reader_skimming%3Atrue"}, {"loc": [10.864821434020996, 6.833907127380371], "id": 1181, "title": "How sensitive are translation systems to extra contexts? Mitigating gender bias in Neural Machine Translation models through relevant contexts.", "authors": "Shanya Sharma, Manan Dey and Koustuv Sinha", "abstract": "Neural Machine Translation systems built on top of Transformer-based architectures are routinely improving the state-of-the-art in translation quality according to word-overlap metrics. However, a growing number of studies also highlight the inherent gender bias that these models incorporate during training, which reflects poorly in their translations. In this work, we investigate whether these models can be instructed to fix their bias during inference using targeted, guided instructions as contexts. By translating relevant contextual sentences during inference along with the input, we observe large improvements in reducing the gender bias in translations, across three popular test suites (WinoMT, BUG, SimpleGen). We further propose a novel metric to assess several large pre-trained models (OPUS-MT, M2M-100) on their sensitivity towards using contexts during translation to correct their biases. Our approach requires no fine-tuning, and thus can be used easily in production systems to de-bias translations from stereotypical gender-occupation bias. We hope our method, along with our metric, can be used to build better, bias-free translation systems.", "track": "Machine Translation", "label": 10, "url": "https://www.semanticscholar.org/reader/1540759490a5d9ef77fbdd0b48aa632e56b06a94?experiments=&features=reader_skimming%3Atrue"}, {"loc": [2.508455991744995, 8.669610977172852], "id": 1191, "title": "P$\\text{M}^2\\text{F}^2$N: Patient Multi-view Multi-modal Feature Fusion Networks for Clinical Outcome Prediction", "authors": "Ying Zhang, Baohang Zhou, Kehui Song, Xuhui Sui, Guoqing Zhao, Ning Jiang and Xiaojie Yuan", "abstract": "Clinical outcome prediction is critical to the condition prediction of patients and management of hospital capacities. There are two kinds of medical data, including time series signals recorded by various devices and clinical notes in electronic health records (EHR), which are used for two common prediction targets: mortality and length of stay. Traditional methods focused on utilizing time series data but ignored clinical notes. With the development of deep learning, natural language processing (NLP) and multi-modal learning methods are exploited to jointly model the time series and clinical notes with different modals. However, the existing methods failed to fuse the multi-modal features of patients from different views. Therefore, we propose the patient multi-view multi-modal feature fusion networks for clinical outcome prediction. Firstly, from patient inner view, we propose to utilize the co-attention module to enhance the fine-grained feature interaction between time series and clinical notes from each patient. Secondly, the patient outer view is the correlation between patients, which can be reflected by the structural knowledge in clinical notes. We exploit the structural information extracted from clinical notes to construct the patient correlation graph, and fuse patients' multi-modal features by graph neural networks (GNN). The experimental results on MIMIC-III benchmark demonstrate the superiority of our method.", "track": "NLP Applications", "label": 0, "url": ""}, {"loc": [3.7539517879486084, 9.406847953796387], "id": 1202, "title": "Long Text and Multi-Table Summarization: Dataset and Method", "authors": "Shuaiqi LIU, Jiannong Cao, Ruosong Yang and Zhiyuan Wen", "abstract": "Automatic document summarization aims to produce a concise summary covering the input document's salient information. Within a report document, the salient information can be scattered in the textual and non-textual content. However, existing document summarization datasets and methods usually focus on the text and filter out the non-textual content. Missing tabular data can limit produced summaries' informativeness, especially when summaries require covering quantitative descriptions of critical metrics in tables. Existing datasets and methods cannot meet the requirements of summarizing long text and multiple tables in each report. To deal with the scarcity of available data, we propose FINDSum, the first large-scale dataset for long text and multi-table summarization. Built on 21,125 annual reports from 3,794 companies, it has two subsets for summarizing each company's results of operations and liquidity. To summarize the long text and dozens of tables in each report, we present three types of summarization methods. Besides, we propose a set of evaluation metrics to assess the usage of numerical information in produced summaries. Dataset analyses and experimental results indicate the importance of jointly considering input textual and tabular data when summarizing report documents.", "track": "Summarization", "label": 14, "url": ""}, {"loc": [1.9611045122146606, 4.037552833557129], "id": 1210, "title": "MatRank: Text Re-ranking by Latent Preference Matrix", "authors": "jinwen luo, Jiuding Yang, Weidong Guo, Chenglin Li, Di Niu and Yu Xu", "abstract": "Text ranking plays a key role in providing content that best answers user queries. It is usually divided into two sub-tasks to perform efficient information retrieval given a query: text retrieval and text re-ranking. Recent research on pretrained language models (PLM) has demonstrated efficiency and gain on both sub-tasks. However, while existing methods have benefited from pre-trained language models and achieved high recall rates on passage retrieval, the ranking performance still demands further improvement. In this paper, we propose MatRank, which learns to re-rank the text retrieved for a given query by learning to predict the most relevant passage based on a latent preference matrix. Specifically, MatRank uses a PLM to generate an asymmetric latent matrix of relative preference scores between all pairs of retrieved passages. Then, the latent matrix is aggregated row-wise and column-wise to obtain global preferences and predictions of the most relevant passage in two of these directions, respectively. We conduct extensive experiments on MS MACRO, WikiAQ, and SemEval datasets. Experimental results show that MatRank has achieved new state-of-the-art results on these datasets, outperforming all prior methods on ranking performance metrics.", "track": "Information Retrieval and Text Mining", "label": 15, "url": ""}, {"loc": [0.7015656232833862, 6.488614559173584], "id": 1214, "title": "Can Language Models Serve as Temporal Knowledge Bases?", "authors": "Ruilin Zhao, Feng Zhao, Guandong Xu, Sixiao Zhang and Hai Jin", "abstract": "Recent progress regarding the use of language models (LMs) as knowledge bases (KBs) has shown that language models can act as structured knowledge bases for storing relational facts. However, most existing works only considered the LM-as-KB paradigm in a static setting, which ignores the analysis of temporal dynamics of world knowledge. Furthermore, a basic function of KBs, i.e., the ability to store conflicting information (i.e., 1-N, N-1, and N-M relations), is underexplored. In this paper, we formulate two practical requirements for treating LMs as temporal KBs: (i) The capacity to store temporally-scoped knowledge that contains conflicting information and (ii) the ability to use stored knowledge for temporally-scoped knowledge queries. We introduce a new dataset called LAMA-TK which is aimed at probing temporally-scoped knowledge, and investigate the two above requirements to explore the LM-as-KB paradigm in the temporal domain. On the one hand, experiments show that LMs can memorize millions of temporally-scoped facts with relatively high accuracy and transfer stored knowledge to temporal knowledge queries, thereby expanding the LM-as-KB paradigm to the temporal domain. On the other hand, we show that memorizing conflicting information, which has been neglected by previous works, is still challenging for LMs and hinders the memorization of other unrelated one-to-one relationships.", "track": "Language Modeling and Analysis of Language Models", "label": 2, "url": ""}, {"loc": [0.9554713368415833, 6.856616973876953], "id": 1217, "title": "UNTER: A Unified Knowledge Interface for Enhancing Pre-trained Language Models", "authors": "Deming Ye, Yankai Lin, Zhengyan Zhang and Maosong Sun", "abstract": "Recent research demonstrates that external knowledge injection can advance pre-trained language models (PLMs) in a variety of downstream NLP tasks. However, existing knowledge injection methods are either applicable to structured knowledge or unstructured knowledge, lacking a unified usage. \nIn this paper, we propose a UNified knowledge inTERface, UNTER to provide a unified perspective to exploit both structured knowledge and unstructured knowledge. In UNTER,  we adopt the decoder as a unified knowledge interface, aligning span representations obtained from the encoder with their corresponding knowledge. This approach enables the encoder to uniformly invoke span-related knowledge from its parameters for downstream applications.  Experimental results show that, with both forms of knowledge injected,  UNTERgains notable improvements on a series of knowledge-driven NLP tasks, including entity typing, named entity recognition and relation extraction, especially in low-resource scenarios.   We will release all pre-trained models and code to facilitate the research of unified knowledge injection.", "track": "Information Extraction", "label": 5, "url": ""}, {"loc": [8.181865692138672, 3.0802934169769287], "id": 1220, "title": "Are Large Pre-Trained Language Models Leaking Your Personal Information?", "authors": "Jie Huang, Hanyin Shao and Kevin Chang", "abstract": "Are Large Pre-Trained Language Models Leaking Your Personal Information? In this paper, we analyze whether Pre-Trained Language Models (PLMs) are prone to leaking personal information. Specifically, we query PLMs for email addresses with contexts of the email address or prompts containing the owner's name. We find that PLMs do leak personal information due to memorization. However, since the models are weak at association, the risk of specific personal information being extracted by attackers is low. We hope this work could help the community to better understand the privacy risk of PLMs and bring new insights to make PLMs safe.", "track": "Language Modeling and Analysis of Language Models", "label": 2, "url": "https://www.semanticscholar.org/reader/77d25889a59041629e8b2a81aad56544144c6878?experiments=&features=reader_skimming%3Atrue"}, {"loc": [0.6181617379188538, 6.812732696533203], "id": 1225, "title": "Self-Distillation with Meta Learning for Knowledge Graph Completion", "authors": "Yunshui Li, Junhao Liu, Min Yang and Chengming Li", "abstract": "In this paper, we propose a self-distillation framework with meta learning (MetaSD) for knowledge graph completion with dynamic pruning, which aims to learn compressed graph embeddings and tackle the long-tail samples. Specifically, we first propose a dynamic pruning technique to obtain a small pruned model from a large source model, where the pruning mask of the pruned model could be updated adaptively per epoch after the model weights are updated. The pruned model is supposed to be more sensitive to difficult-to-memorize samples (e.g., long-tail samples) than the source model. Then, we propose a one-step meta self-distillation method for distilling comprehensive knowledge from the source model to the pruned model, where the two models co-evolve in a dynamic manner during training. In particular, we exploit the performance of the pruned model, which is trained alongside the source model in one iteration, to improve the source model's knowledge transfer ability for the next iteration via meta learning. Extensive experiments show that MetaSD achieves competitive performance compared to strong baselines, while being 10x smaller than baselines.", "track": "NLP Applications", "label": 0, "url": ""}, {"loc": [1.3681929111480713, 4.9261345863342285], "id": 1228, "title": "CQR-SQL: Conversational Question Reformulation Enhanced Context-Dependent Text-to-SQL Parsers", "authors": "Dongling Xiao, LinZheng Chai, Qian-Wen Zhang, Zhao Yan, Zhoujun Li and Yunbo Cao", "abstract": "Context-dependent text-to-SQL is the task of translating multi-turn questions into database-related SQL queries. Existing methods typically focus on making full use of history context or previously predicted SQL for currently SQL parsing, while neglecting to explicitly comprehend the schema and conversational dependency, such as co-reference, ellipsis and user focus change. In this paper, we propose CQR-SQL, which uses auxiliary Conversational Question Reformulation (CQR) learning to explicitly exploit schema and decouple contextual dependency for multi-turn SQL parsing. Specifically, we first present a schema enhanced recursive CQR method to produce domain-relevant self-contained questions. Secondly, we train CQR-SQL models to map the semantics of multi-turn questions and auxiliary self-contained questions into the same latent space through schema grounding consistency task and tree-structured SQL parsing consistency task, which enhances the abilities of SQL parsing by adequately contextual understanding. At the time of writing, our CQR-SQL achieves new state-of-the-art results on two context-dependent text-to-SQL benchmarks SParC and CoSQL.", "track": "Semantics: Lexical, Sentence level, Textual Inference and Other areas", "label": 8, "url": "https://www.semanticscholar.org/reader/3fa26dac5909dd8b45c2fe1b430976ef2e8f5ff0?experiments=&features=reader_skimming%3Atrue"}, {"loc": [4.486868858337402, 5.488314628601074], "id": 1236, "title": "Assisting the Human Fact-Checkers: Detecting All Previously Fact-Checked Claims in a Document", "authors": "Shaden Shaar, Nikola Georgiev, Firoj Alam, Giovanni Da San Martino, Aisha Mohamed and Preslav Nakov", "abstract": "Given the recent proliferation of false claims online, there has been a lot of manual fact-checking effort. As this is very time-consuming, human fact-checkers can benefit from tools that can support them and make them more efficient. Here, we focus on building a system that could provide such support. Given an input document, it aims to detect all sentences that contain a claim that can be verified by some previously fact-checked claims (from a given database). The output is a re-ranked list of the document sentences, so that those that can be verified are ranked as high as possible, together with corresponding evidence. Unlike previous work, which has looked into claim retrieval, here we take a document-level perspective. We create a new manually annotated dataset for the task, and we propose suitable evaluation measures. We further experiment with a learning-to-rank approach, achieving sizable performance gains over several strong baselines. Our analysis demonstrates the importance of modeling text similarity and stance, while also taking into account the veracity of the retrieved previously fact-checked claims. We believe that this research would be of interest to fact-checkers, journalists, media, and regulatory authorities.", "track": "NLP Applications", "label": 0, "url": "https://www.semanticscholar.org/reader/83329243f7d938368c1f87334bd08986affcc858?experiments=&features=reader_skimming%3Atrue"}, {"loc": [6.285833358764648, 5.764007091522217], "id": 1260, "title": "No Word Embedding Model Is Perfect: Evaluating the Representation Accuracy for Social Bias in the Media", "authors": "Maximilian Splieth\u00f6ver, Maximilian Keiff and Henning Wachsmuth", "abstract": "News articles both shape and reflect public opinion across the political spectrum. Analyzing them for social bias can thus provide valuable insights, such as prevailing stereotypes in society and the media, which are often adopted by NLP models trained on respective data. Recent work has relied on word embedding bias measures, such as WEAT. However, several representation issues of embeddings can harm the measures' accuracy, including low-resource settings and token frequency differences. In this work, we study what kind of embedding algorithm serves best to accurately measure types of social bias known to exist in US online news articles. To cover the whole spectrum of political bias in the US, we collect 500k articles and review psychology literature with respect to expected social bias. We then quantify social bias using WEAT along with embedding algorithms that account for the aforementioned issues. We compare how models trained with the algorithms on news articles represent the expected social bias. Our results suggest that the standard way to quantify bias does not align well with knowledge from psychology. While the proposed algorithms reduce the~gap, they still do not fully match the literature.", "track": "Computational Social Science and Cultural Analytics", "label": 20, "url": "https://www.semanticscholar.org/reader/a261dbc155c5bb5c99201f757e3d2dab1b3dcc58?experiments=&features=reader_skimming%3Atrue"}, {"loc": [4.740279674530029, 3.6383464336395264], "id": 1275, "title": "Scientific and Creative Analogies in Pretrained Language Models", "authors": "Tamara Czinczoll, Helen Yannakoudakis, Pushkar Mishra and Ekaterina Shutova", "abstract": "This paper examines the encoding of analogy in large-scale pretrained language models, such as BERT and GPT-2. Existing analogy datasets typically focus on a limited set of analogical relations, with a high similarity of the two domains between which the analogy holds. As a more realistic setup, we introduce the Scientific and Creative Analogy dataset (SCAN), a novel analogy dataset containing systematic mappings of multiple attributes and relational structures across dissimilar domains. Using this dataset, we test the analogical reasoning capabilities of several widely-used pretrained language models (LMs). We find that state-of-the-art LMs achieve low performance on these complex analogy tasks, highlighting the challenges still posed by analogy understanding.", "track": "Semantics: Lexical, Sentence level, Textual Inference and Other areas", "label": 8, "url": ""}, {"loc": [9.031679153442383, 6.33148717880249], "id": 1303, "title": "Bitext Mining Using Distilled Sentence Representations for Low-Resource Languages", "authors": "Kevin Heffernan, Onur \u00c7elebi and Holger Schwenk", "abstract": "Scaling multilingual representation learning beyond the hundred most frequent languages is challenging, in particular to cover the long tail of low-resource languages.  We move away from the popular one-for-all multilingual models and focus on training multiple language (family) specific representations, but most prominently enable all languages to still be encoded in the same representational space.  We focus on teacher-student training, allowing all encoders to be mutually compatible for bitext mining, and enabling fast learning of new languages.  We also combine supervised and self-supervised training, allowing encoders to take advantage of monolingual training data.\n\nOur approach significantly outperforms the original LASER encoder. We study very low-resource languages and handle 44 African languages, many of which are not covered by any other model. For these languages, we train sentence encoders and mine bitexts.  Adding these mined bitexts yielded an improvement of 3.8 BLEU for NMT into English.", "track": "Machine Translation", "label": 10, "url": "https://www.semanticscholar.org/reader/2cacc556ca3f362b09e22b875abffc35a7073fee?experiments=&features=reader_skimming%3Atrue"}, {"loc": [1.3454856872558594, 4.9491095542907715], "id": 1309, "title": "Towards Generalizable and Robust Text-to-SQL Parsing", "authors": "Chang Gao, Bowen Li, Wenxuan Zhang, Wai Lam, Binhua Li, Fei Huang, Luo Si and Yongbin Li", "abstract": "Text-to-SQL parsing tackles the problem of mapping natural language questions to executable SQL queries. In practice, text-to-SQL parsers often encounter various challenging scenarios, requiring them to be generalizable and robust. While most existing work addresses a particular generalization or robustness challenge, we aim to study it in a more comprehensive manner. In specific, we believe that text-to-SQL parsers should be (1) generalizable at three levels of generalization, namely i.i.d., zero-shot, and compositional, and (2) robust against input perturbations. To enhance these capabilities of the parser, we propose a novel TKK framework consisting of Task decomposition, Knowledge acquisition, and Knowledge composition to learn text-to-SQL parsing in stages. By dividing the learning process into multiple stages, our framework improves the parser's ability to acquire general SQL knowledge instead of capturing spurious patterns, making it more generalizable and robust. Experimental results under various generalization and robustness settings show that our framework is effective in all scenarios and achieves state-of-the-art performance on the Spider, SParC, and CoSQL datasets.", "track": "Syntax, Parsing and their Applications", "label": 23, "url": "https://www.semanticscholar.org/reader/7e942e813e3fb814f2d0b997ae849548a9e40638?experiments=&features=reader_skimming%3Atrue"}, {"loc": [6.170919418334961, 8.519989967346191], "id": 1316, "title": "EdiT5: Semi-Autoregressive Text Editing with T5 Warm-Start", "authors": "Jonathan Mallinson, Jakub Adamek, Eric Malmi and Aliaksei Severyn", "abstract": "We present EdiT5 - a novel semi-autoregressive text-editing approach designed to combine the strengths of non-autoregressive text-editing and autoregressive decoding. EdiT5 is faster at inference times than conventional sequence-to-sequence (seq2seq) models, while being capable of modeling flexible input-output transformations.\n\nThis is achieved by decomposing the generation process into three sub-tasks: (1) tagging to decide on the subset of input tokens to be preserved in the output, (2) re-ordering to define their order in the output text, and (3) insertion to infill the missing tokens that are not present in the input. The tagging and re-ordering steps, which are responsible for generating the largest portion of the output, are non-autoregressive, while the insertion uses an autoregressive decoder.\n\nDepending on the task, EdiT5 requires significantly fewer autoregressive steps demonstrating speedups of up to 25x when compared to classic seq2seq models. Quality-wise, EdiT5 is initialized with a pre-trained T5 checkpoint yielding comparable performance to T5 in high-resource settings and clearly outperforms it on low-resource settings when evaluated on three NLG tasks: Sentence Fusion, Grammatical Error Correction, and Decontextualization.", "track": "Natural Language Generation", "label": 6, "url": "https://www.semanticscholar.org/reader/8ba66cb690ff3a37c63ff0f67b595f03dd78dc75?experiments=&features=reader_skimming%3Atrue"}, {"loc": [4.792313098907471, 6.8947367668151855], "id": 1318, "title": "A Critical Reflection and Forward Perspective on Empathy and Natural Language Processing", "authors": "Allison Claire Lahnala, Charles Welch, David Jurgens and Lucie Flek", "abstract": "We review the state of research on empathy in natural language processing and identify the following issues: (1) empathy definitions are absent or abstract, which (2) leads to low construct validity and reproducibility. Moreover, (3) emotional empathy is overemphasized, skewing our focus to a narrow subset of simplified tasks. We believe these issues hinder research progress and argue that current directions will benefit from a clear conceptualization that includes operationalizing cognitive empathy components. Our main objectives are to provide insight and guidance on empathy conceptualization for NLP research objectives and to encourage researchers to pursue the overlooked opportunities in this area, highly relevant, e.g., for clinical and educational sectors.", "track": "Theme Track", "label": 18, "url": ""}, {"loc": [2.9541919231414795, 6.095975399017334], "id": 1327, "title": "Social-aware Sparse Attention Network for Session-based Social Recommendation", "authors": "Kai Ouyang, Xianghong Xu, Chen Tang, Wang Chen and Haitao Zheng", "abstract": "Session-based Social Recommendation (SSR) aims to use users' social networks and historical sessions to provide more personalized recommendations for the current session.\nUnfortunately, existing SSR methods have two limitations.\nFirst, they do not screen users' useless social relationships and noisy irrelevant interactions.\nHowever, user preferences are mainly affected by several close friends and key interactions.\nSecond, when modeling the current session, they do not take full advantage of user preference information.\nTo tackle these issues, we propose a novel Social-aware Sparse Attention Network for SSR, abbreviated as SSAN.\nIt mainly consists of the Heterogeneous Graph Embedding (HGE) module and the Social-aware Encoder-decoder Network (SEN) module.\nIn the HGE module, we adopt a modified heterogeneous graph neural network, which focuses more on close friends and key historical interactions, to enhance user/item representations. \nIn the SEN module, we use the user representation as a bridge between the Encoder and Decoder to incorporate user preferences when modeling the current session.\nExtensive experiments on two benchmark datasets demonstrate the superiority of SSAN over the state-of-the-art models.", "track": "Information Retrieval and Text Mining", "label": 15, "url": ""}, {"loc": [8.779088973999023, 8.29272747039795], "id": 1329, "title": "SparseAdapter: An Easy Approach for Improving the Parameter-Efficiency of Adapters", "authors": "Shwai He, Liang Ding, DaiZe Dong, miao zhang and Dacheng Tao", "abstract": "Adapter Tuning, which freezes the pretrained language models (PLMs) and only fine-tunes a few extra modules, becomes an appealing efficient alternative to the full model fine-tuning. Although computationally efficient, the recent Adapters often increase parameters (e.g. bottleneck dimension) for matching the performance of full model fine-tuning, which we argue goes against their original intention. In this work, we re-examine the parameter-efficiency of Adapter through the lens of network pruning (we name such plug-in concept as SparseAdapter) and find that SparseAdapter can achieve comparable or better performance than standard Adapters when the sparse ratio reaches up to 80%. Based on our findings, we introduce an easy but effective setting \"Large-Sparse'' to improve the model capacity of Adapters under the same parameter budget.  Experiments on five competitive Adapters upon three advanced PLMs show that with proper sparse method (e.g. SNIP) and ratio (e.g. 40%) SparseAdapter can consistently outperform their corresponding counterpart.  Encouragingly, with the Large-Sparse setting, we can obtain further appealing gains, even outperforming the full fine-tuning by a large margin.", "track": "Efficient Methods for NLP", "label": 12, "url": ""}, {"loc": [4.370123386383057, 4.040160655975342], "id": 1358, "title": "Measurement Extraction with Natural Language Processing: A Review", "authors": "Jan G\u00f6pfert, Patrick Kuckertz, Jann M. Weinand, Leander Kotzur and Detlef Stolten", "abstract": "Quantitative data is important in many domains. Information extraction methods draw structured data from documents. However, the extraction of quantities and their contexts has received little attention in the history of information extraction. In this review, an overview of prior work on measurement extraction is presented. We describe different approaches to measurement extraction and outline the challenges posed by this task. The review concludes with an outline of potential future research. Research strains in measurement extraction tend to be isolated and lack a common terminology. Improvements in numerical reasoning, more extensive datasets, and the consideration of wider contexts may lead to significant improvements in measurement extraction.", "track": "Information Extraction", "label": 5, "url": ""}, {"loc": [3.625286817550659, 9.78835678100586], "id": 1380, "title": "Summarizing Procedural Text: Data and Approach", "authors": "Shen Gao, Haotong Zhang, Xiuying Chen, Rui Yan and Dongyan Zhao", "abstract": "Procedural text is a widely used genre that contains many steps of instructions of how to cook a dish or how to conduct a chemical experiment and analyze the procedural text has become a popular task in the NLP field. Since the procedural text can be very long and contains many details, summarizing the whole procedural text or giving an overview for each complicated procedure step can save time for readers and help them to capture the core information in the text. In this paper, we propose the procedural text summarization task with two summarization granularity: step-view and global-view, which summarizes each step in the procedural text separately or gives an overall summary for all steps respectively. To tackle this task, we propose an Entity-State Graph-based Summarizer (ESGS) which is based on state-of-the-art entity state tracking methods and constructs a heterogeneous graph to aggregate contextual information for each procedure. In order to help the summarization model focus on the salient entities, we propose to use the contextualized procedure graph representation to predict the salient entities. Experiments conducted on two datasets verify the effectiveness of our proposed model. Our code and datasets will be released on https://github.com/gsh199449/procedural-summ.", "track": "Summarization", "label": 14, "url": ""}, {"loc": [8.145788192749023, 8.720210075378418], "id": 1387, "title": "Snapshot-Guided Domain Adaptation for ELECTRA", "authors": "Daixuan Cheng, Shaohan Huang, Jianfeng Liu, Yuefeng Zhan, Hao Sun, Furu Wei, Denvy Deng and Qi Zhang", "abstract": "Discriminative pre-trained language models, such as ELECTRA, have achieved promising performances in a variety of general tasks. However, these generic pre-trained models struggle to capture domain-specific knowledge of domain-related tasks. In this work, we propose a novel domain-adaptation method for ELECTRA, which can dynamically select domain-specific tokens and guide the discriminator to emphasize them, without introducing new training parameters. We show that by re-weighting the losses of domain-specific tokens, ELECTRA can be effectively adapted to different domains. The experimental results in both computer science and biomedical domains show that the proposed method can achieve state-of-the-art results on the domain-related tasks.", "track": "Language Modeling and Analysis of Language Models", "label": 2, "url": ""}, {"loc": [6.62643575668335, 8.206815719604492], "id": 1389, "title": "Exploiting Labeled and Unlabeled Data via Transformer Fine-tuning for Peer-Review Score Prediction", "authors": "Panitan Muangkammuen, Fumiyo Fukumoto, Jiyi Li and Yoshimi Suzuki", "abstract": "Automatic Peer-review Aspect Score Prediction (PASP) of academic papers can be a helpful assistant tool for both reviewers and authors. Most existing works on PASP utilize supervised learning techniques. However, the limited number of peer-review data deteriorates the performance of PASP. This paper presents a novel semi-supervised learning (SSL) method that incorporates the Transformer fine-tuning into the \u0393-model, a variant of the Ladder network, to leverage contextual features from unlabeled data. Backpropagation simultaneously minimizes the sum of supervised and unsupervised cost functions, avoiding the need for layer-wise pre-training. The experimental results show that our model outperforms the supervised and naive semi-supervised learning baselines. Our source codes are available online.", "track": "NLP Applications", "label": 0, "url": ""}, {"loc": [7.596724033355713, 12.36661148071289], "id": 1390, "title": "HARALD: Augmenting Hate Speech Data Sets with Real Data", "authors": "Tal Ilan and Dan Vilenchik", "abstract": "The successful completion of the hate speech detection task hinges upon the availability of rich and variable labeled data, which is hard to obtain. In this work, we present a new approach for data augmentation that uses as input real unlabelled data, which is carefully selected from online platforms where invited hate speech is abundant. We show that by harvesting and processing this data (in an automatic manner), one can augment existing manually-labeled datasets to improve the classification performance of hate speech classification models. We observed an improvement in F1-score ranging from 2.7\\% and up to 9.5\\%, depending on the task (in- or cross-domain) and the model used.", "track": "NLP Applications", "label": 0, "url": ""}, {"loc": [10.561056137084961, 7.494224548339844], "id": 1419, "title": "Wait-info Policy: Balancing Source and Target at Information Level for Simultaneous Machine Translation", "authors": "Shaolei Zhang, Shoutao Guo and Yang Feng", "abstract": "Simultaneous machine translation (SiMT) outputs the translation while receiving the source inputs, and hence needs to balance the received source information and translated target information to make a reasonable decision between waiting for inputs or outputting translation. Previous methods always balance source and target information at the token level, either directly waiting for a fixed number of tokens or adjusting the waiting based on the current token. In this paper, we propose a Wait-info Policy to balance source and target at the information level. We first quantify the amount of information contained in each token, named info. Then during simultaneous translation, the decision of waiting or outputting is made based on the comparison results between the total info of previous target outputs and received source inputs. Experiments show that our method outperforms strong baselines under and achieves better balance via the proposed info.", "track": "Machine Translation", "label": 10, "url": "https://www.semanticscholar.org/reader/902f4adc08bf44bfafb58cf69ce41deb8a061809?experiments=&features=reader_skimming%3Atrue"}, {"loc": [10.554722785949707, 7.513275146484375], "id": 1424, "title": "Turning Fixed to Adaptive: Integrating Post-Evaluation into Simultaneous Machine Translation", "authors": "Shoutao Guo, Shaolei Zhang and Yang Feng", "abstract": "Simultaneous machine translation (SiMT) starts its translation before reading the whole source sentence and employs either fixed or adaptive policy to generate the target sentence. Compared to the fixed policy, the adaptive policy achieves better latency-quality tradeoffs by adopting a flexible translation policy. If the policy can evaluate rationality before taking action, the probability of incorrect actions will also decrease. However, previous methods lack evaluation of actions before taking them. In this paper, we propose a method of performing the adaptive policy via integrating post-evaluation into the fixed policy. Specifically, whenever a candidate token is generated, our model will evaluate the rationality of the next action by measuring the change in the source content. Our model will then take different actions based on the evaluation results. Experiments on three translation tasks show that our method can exceed strong baselines under all latency.", "track": "Machine Translation", "label": 10, "url": "https://www.semanticscholar.org/reader/4afef2ea406e6c789de1609100d2350bcd71c586?experiments=&features=reader_skimming%3Atrue"}, {"loc": [0.5531882047653198, 7.093504905700684], "id": 1446, "title": "Alleviating Sparsity of Open Knowledge Graphs with Ternary Contrastive Learning", "authors": "Qian Li, Shafiq Joty, Daling Wang, Shi Feng and Yifei Zhang", "abstract": "Sparsity of formal knowledge and roughness of non-ontological construction make sparsity problem particularly prominent in Open Knowledge Graphs (OpenKGs). Due to sparse links, learning effective representation for few-shot entities becomes difficult. We hypothesize that by introducing negative samples, a contrastive learning (CL) formulation could be beneficial in such scenarios. However, existing CL methods model KG triplets as binary objects of entities ignoring the relation-guided ternary propagation patterns and they are too generic, i.e., they ignore zero-shot, few-shot and synonymity problems that appear in OpenKGs. To address this, we propose TernaryCL, a CL framework based on ternary propagation patterns among head, relation and tail. TernaryCL designs  Contrastive Entity and Contrastive Relation to mine ternary discriminative features with both negative entities and relations, introduces Contrastive Self to help zero- and few-shot entities learn discriminative features, Contrastive Synonym to model synonymous entities, and Contrastive Fusion to aggregate graph features from multiple paths. Extensive experiments on benchmarks demonstrate the superiority of TernaryCL over state-of-the-art models.", "track": "Information Extraction", "label": 5, "url": "https://www.semanticscholar.org/reader/a80cd69bec615984b4eab7f55026fabffd315d3b?experiments=&features=reader_skimming%3Atrue"}, {"loc": [6.437849521636963, 1.9469300508499146], "id": 1462, "title": "Using Developer Discussions to Guide Fixing Bugs in Software", "authors": "Sheena Panthaplackel, Milos Gligoric, Junyi Jessy Li and Raymond Mooney", "abstract": "Automatically fixing software bugs is a challenging task. While recent work showed that natural language context is useful in guiding bug-fixing models, the approach required prompting developers to provide this context, which was simulated through commit messages written after the bug-fixing code changes were made. We instead propose using bug report discussions, which are available before the task is performed and are also naturally occurring, avoiding the need for any additional information from developers. For this, we augment standard bug-fixing datasets with bug report discussions. Using these newly compiled datasets, we demonstrate that various forms of natural language context derived from such discussions can aid bug-fixing, even leading to improved performance over using commit messages corresponding to the oracle bug-fixing commits.", "track": "NLP Applications", "label": 0, "url": ""}, {"loc": [5.939485549926758, 5.093125820159912], "id": 1467, "title": "AutoCAD: Automatically Generate Counterfactuals for Mitigating Shortcut Learning", "authors": "Jiaxin Wen, Yeshuang Zhu, Jinchao Zhang, Jie Zhou and Minlie Huang", "abstract": "Recent studies have shown the impressive efficacy of counterfactually augmented data (CAD) for reducing NLU models' reliance on spurious features and improving their generalizability. However, current methods still heavily rely on human efforts or task-specific designs to generate counterfactuals, thereby impeding CAD's applicability to a broad range of NLU tasks. In this paper, we present AutoCAD, a fully automatic and task-agnostic CAD generation framework. AutoCAD first leverages a classifier to unsupervisedly identify rationales as spans to be intervened, which disentangles spurious and causal features. Then, AutoCAD performs controllable generation enhanced by unlikelihood training to produce diverse counterfactuals. Extensive evaluations on multiple out-of-domain and challenge benchmarks demonstrate that AutoCAD consistently and significantly boosts the out-of-distribution performance of powerful pre-trained models across different NLU tasks, which is comparable or even better than previous state-of-the-art human-in-the-loop or task-specific CAD methods.", "track": "Unsupervised and Weakly-Supervised Methods in NLP", "label": 17, "url": ""}, {"loc": [5.596994400024414, 12.653290748596191], "id": 1471, "title": "A Multi-Modal Knowledge Graph for Classical Chinese Poetry", "authors": "Yuqing Li, Yuxin Zhang, Bin Wu, Ji-Rong Wen, Ruihua Song and Ting Bai", "abstract": "Classical Chinese poetry has a long history and is a precious cultural heritage of humankind. Displaying the classical Chinese poetry in a visual way, helps to cross cultural barriers in different countries, making it enjoyable for all the people. In this paper, we construct a multi-modal knowledge graph for classical Chinese poetry (PKG), in which the visual information of words in the poetry are incorporated. Then a multi-modal pre-training language model, PKG-Bert, is proposed to obtain the poetry representation with visual information, which bridges the semantic gap between different modalities. PKG-Bert achieves the state-of-the-art performance on the poetry-image retrieval task, showing the effectiveness of incorporating the multi-modal knowledge. The large-scale multi-modal knowledge graph of classical Chinese poetry will be released to promote the researches in classical Chinese culture area.", "track": "Information Retrieval and Text Mining", "label": 15, "url": ""}, {"loc": [10.59830379486084, 7.6844377517700195], "id": 1474, "title": "Assessing Non-autoregressive Alignment in Neural Machine Translation via Word Reordering", "authors": "Chun-Hin Tse, Ester Leung and William K. Cheung", "abstract": "Recent work on non-autoregressive neural machine translation (NAT) that leverages alignment information to explicitly reduce the modality of target distribution has reported comparable performance with counterparts that tackle multi-modality problem by implicitly modeling dependencies. Effectiveness in handling alignment is vital for models that follow this approach, where a token reordering mechanism is typically involved and plays a vital role. We review the reordering capability of the respective mechanisms in recent NAT models, and our experimental results show that their performance is sub-optimal. We propose to learn a non-autoregressive language model (NALM) based on transformer which can be combined with Viterbi decoding to achieve better reordering performance. We evaluate the proposed NALM using the PTB dataset where sentences with words permuted in different ways are expected to have their ordering recovered. Our empirical results show that the proposed method can outperform the state-of-the-art reordering mechanisms under different word permutation settings, with a 2-27 BLEU improvement, suggesting high potential for word alignment in NAT.", "track": "Machine Translation", "label": 10, "url": ""}, {"loc": [10.433928489685059, 7.10748291015625], "id": 1492, "title": "Syntax-guided Localized Self-attention by Constituency Syntactic Distance", "authors": "Shengyuan Hou, Jushi Kai, Haotian Xue, Bingyu Zhu, Bo Yuan, Longtao Huang, Xinbing Wang and Zhouhan Lin", "abstract": "Recent works have revealed that Transformers are implicitly learning the syntactic information in its lower layers from data, albeit is highly dependent on the quality and scale of the training data. However, learning syntactic information from data is not necessary if we can leverage an external syntactic parser, which provides better parsing quality with well-defined syntactic structures. This could potentially improve Transformer's performance and sample efficiency. In this work, we propose a syntax-guided localized self-attention for Transformer that allows directly incorporating grammar structures from an external constituency parser. It prohibits the attention mechanism to overweight the grammatically distant tokens over close ones. Experimental results show that our model could consistently improve translation performance on a variety of machine translation datasets, ranging from small to large dataset sizes, and with different source languages.", "track": "Syntax, Parsing and their Applications", "label": 23, "url": "https://www.semanticscholar.org/reader/50e6b4e452107799cd775b0b0f6726d44173d564?experiments=&features=reader_skimming%3Atrue"}, {"loc": [6.471464157104492, 1.907331109046936], "id": 1495, "title": "CodeExp: Explanatory Code Document Generation", "authors": "Haotian Cui, Chenglong Wang, Junjie Huang, Jeevana Priya Inala, Todd Mytkowicz, Bo Wang, Jianfeng Gao and Nan Duan", "abstract": "Developing models that can automatically generate detailed code explanation can greatly benefit software maintenance and programming education. However, existing code-to-text generation models often produce only high-level summaries of code that do not capture implementation-level choices essential for these scenarios. To fill in this gap, we propose the code explanation generation task. We first conducted a human study to identify the criteria for high-quality explanatory docstring for code. Based on that, we collected and refined a large-scale code docstring corpus and formulated automatic evaluation metrics that best match human assessments. Finally, we present a multi-stage fine-tuning strategy and baseline models for the task. Our experiments show that (1) our refined training dataset lets models achieve better performance in the explanation generation tasks compared to larger-scale unrefined data (15x larger), and (2) fine-tuned models can generate well-structured long docstrings comparable to human-written ones. We envision our training dataset, human-evaluation protocol, recommended metrics, and fine-tuning strategy can boost future code explanation research. The code and annotated data are available at https://github.com/subercui/CodeExp.", "track": "NLP Applications", "label": 0, "url": ""}, {"loc": [1.3400423526763916, 4.931199073791504], "id": 1497, "title": "PAUQ: Text-to-SQL in Russian", "authors": "Daria Bakshandaeva, Oleg Dmitrievich Somov, Ekaterina Dmitrieva, Vera Davydova and Elena Tutubalina", "abstract": "Semantic parsing is an important task that allows to democratize human-computer interaction. One of the most popular text-to-SQL datasets with complex and diverse natural language (NL) questions and SQL queries is Spider. We construct and complement a Spider dataset for Russian, thus creating the first publicly available text-to-SQL dataset for this language. While examining its components - NL questions, SQL queries and databases content - we identify limitations of the existing database structure, fill out missing values for tables and add new requests for underrepresented categories. We select thirty functional test sets with different features that can be used for the evaluation of neural models' abilities. To conduct the experiments, we adapt baseline architectures RAT-SQL and BRIDGE and provide in-depth query component analysis. On the target language, both models demonstrate strong results with monolingual training and improved accuracy in multilingual scenario. In this paper, we also study trade-offs between machine-translated and manually-created NL queries. At present, Russian text-to-SQL is lacking in datasets as well as trained models, and we view this work as an important step towards filling this gap.", "track": "Resources and Evaluation", "label": 1, "url": ""}, {"loc": [2.553697109222412, 7.074418067932129], "id": 1501, "title": "Event-Centric Question Answering via Contrastive Learning and Invertible Event Transformation", "authors": "Junru Lu, Xingwei Tan, Gabriele Pergola, Lin Gui and Yulan He", "abstract": "Human reading comprehension often requires reasoning of event semantic relations in narratives, represented by Event-centric Question-Answering (QA). To address event-centric QA, we propose a novel QA model with contrastive learning and invertible event transformation, call TranCLR. Our proposed model utilizes an invertible transformation matrix to project semantic vectors of events into a common event embedding space, trained with contrastive learning, and thus naturally inject event semantic knowledge into mainstream QA pipelines. The transformation matrix is fine-tuned with the annotated event relation types between events that occurred in questions and those in answers, using event-aware question vectors. Experimental results on the Event Semantic Relation Reasoning (ESTER) dataset show significant improvements in both generative and extractive settings compared to the existing strong baselines, achieving over 8.4% gain in the token-level F1 score and 3.0% gain in Exact Match (EM) score under the multi-answer setting. Qualitative analysis reveals the high quality of the generated answers by TranCLR, demonstrating the feasibility of injecting event knowledge into QA model learning. Our code and models can be found at https://github.com/LuJunru/TranCLR.", "track": "Question Answering", "label": 11, "url": "https://www.semanticscholar.org/reader/a376a3af76e4263f786339b16b9650ace7c80043?experiments=&features=reader_skimming%3Atrue"}, {"loc": [1.0047622919082642, 10.51447868347168], "id": 1523, "title": "Label-Driven Denoising Framework for Multi-Label Few-Shot Aspect Category Detection", "authors": "Fei Zhao, Yuchen Shen, Zhen Wu and Xinyu Dai", "abstract": "Multi-Label Few-Shot Aspect Category Detection (FS-ACD) is a new sub-task of aspect-based sentiment analysis, which aims to detect aspect categories accurately with limited training instances. Recently, dominant works use the prototypical network to accomplish this task, and employ the attention mechanism to extract keywords of aspect category from the sentences to produce the prototype for each aspect. However, they still suffer from serious noise problems: (1) due to lack of sufficient supervised data, the previous methods easily catch noisy words irrelevant to the current aspect category, which largely affects the quality of the generated prototype; (2) the semantically-close aspect categories usually generate similar prototypes, which are mutually noisy and confuse the classifier seriously. In this paper, we resort to the label information of each aspect to tackle the above problems, along with proposing a novel Label-Driven Denoising Framework (LDF). Extensive experimental results show that our framework achieves better performance than other state-of-the-art methods.", "track": "Sentiment Analysis, Stylistic Analysis, and Argument Mining", "label": 16, "url": "https://www.semanticscholar.org/reader/1b40defa78efe53e90ef1b724b18a02405b4f653?experiments=&features=reader_skimming%3Atrue"}, {"loc": [5.471920967102051, 12.70667552947998], "id": 1537, "title": "Visual Named Entity Linking: A New Dataset and A Baseline", "authors": "Wen Xiang Sun, Yixing Fan, Jiafeng Guo, Ruqing Zhang and Xueqi Cheng", "abstract": "Visual Entity Linking (VEL) is a task to link regions of images with their corresponding entities in Knowledge Bases (KBs), which is beneficial for many computer vision tasks such as image retrieval, image caption, and visual question answering. While existing tasks in VEL either rely on textual data to complement a multi-modal linking or only link objects with general entities, which fails to perform named entity linking on large amounts of image data. In this paper, we consider a purely Visual-based Named Entity Linking (VNEL) task, where the input only consists of an image. The task is to identify objects of interest (i.e., visual entity mentions) in images and link them to corresponding named entities in KBs. Since each entity often contains rich visual and textual information in KBs, we thus propose three different sub-tasks, i.e., visual to visual entity linking (V2VEL), visual to textual entity linking (V2TEL), and visual to visual-textual entity linking (V2VTEL). In addition, we present a high-quality human-annotated visual person linking dataset, named WIKIPerson. Based on WIKIPerson, we establish a series of baseline algorithms for the solution of each sub-task, and conduct experiments to verify the quality of the proposed datasets and the effectiveness of baseline methods. We envision this work to be helpful for soliciting more works regarding VNEL in the future. The codes and datasets are publicly available at https: //github.com/ict-bigdatalab/VNEL.", "track": "Speech, Vision, Robotics, Multimodal Grounding", "label": 7, "url": "https://www.semanticscholar.org/reader/c0bb6496edb5ddf30713cdb425b7c3e4205f6ae3?experiments=&features=reader_skimming%3Atrue"}, {"loc": [5.4395551681518555, 12.070502281188965], "id": 1544, "title": "MAGMA \u2013 Multimodal Augmentation of Generative Models through Adapter-based Finetuning", "authors": "Constantin Eichenberg, Sidney Black, Samuel Weinbach, Letitia Parcalabescu and Anette Frank", "abstract": "Large-scale  pretraining is  fast  becoming  the  norm  in Vision-Language (VL) modeling. However, prevailing VL approaches are limited by the requirement for labeled data and the use of complex multi-step pretraining objectives. We present MAGMA - a simple method for augmenting generative language models with additional modalities using adapter-based finetuning. Building on Frozen, we train a series of VL models that autoregressively generate text from arbitrary combinations of visual and textual input. The pretraining is entirely end-to-end using a single language modeling objective, simplifying optimization compared to previous approaches. Importantly, the language model weights remain unchanged during training, allowing for transfer of encyclopedic knowledge and in-context learning abilities from language pretraining. MAGMA outperforms Frozen on open-ended generative tasks, achieving state of the art results on the OKVQA benchmark and competitive results on a range of other popular VL benchmarks, while pretraining on 0.2 % of the number of samples used to train SimVLM.", "track": "Speech, Vision, Robotics, Multimodal Grounding", "label": 7, "url": "https://www.semanticscholar.org/reader/bdea16e93fc70f316002e5f6aac8ce17388c6ee9?experiments=&features=reader_skimming%3Atrue"}, {"loc": [5.0037617683410645, 3.800354242324829], "id": 1549, "title": "Towards Tracing Knowledge in Language Models Back to the Training Data", "authors": "Ekin Akyurek, Tolga Bolukbasi, Frederick Liu, Binbin Xiong, Ian Tenney, Jacob Andreas and Kelvin Guu", "abstract": "Language models (LMs) have been shown to memorize a great deal of factual knowledge contained in their training data. But when an LM generates an assertion, it is often difficult to determine where it learned this information and whether it is true. In this paper, we propose the problem of fact tracing: identifying which training examples taught an LM to generate a particular factual assertion. Prior work on training data attribution (TDA) may offer effective tools for identifying such examples, known as \"proponents\u201d. We present the first quantitative benchmark to evaluate this. We compare two popular families of TDA methods \u2014 gradient-based and embedding-based \u2014 and find that much headroom remains. For example, both methods have lower proponent-retrieval precision than an information retrieval baseline (BM25) that does not have access to the LM at all. We identify key challenges that may be necessary for further improvement such as overcoming the problem of gradient saturation, and also show how several nuanced implementation details of existing neural TDA methods can significantly improve overall fact tracing performance.", "track": "Interpretability, Interactivity and Analysis of Models for NLP", "label": 9, "url": "https://www.semanticscholar.org/reader/a2929c7f3b35358122eed8a35015a9b1834d5257?experiments=&features=reader_skimming%3Atrue"}, {"loc": [1.6655534505844116, 5.417201042175293], "id": 1550, "title": "ReaRev: Adaptive Reasoning for Question Answering over Knowledge Graphs", "authors": "Costas Mavromatis and George Karypis", "abstract": "Knowledge Graph Question Answering (KGQA) involves retrieving entities as answers from a Knowledge Graph (KG) using natural language queries. The challenge is to learn to reason over question-relevant KG facts that traverse KG entities and lead to the question answers. \nTo facilitate reasoning, the question is decoded into instructions, which are dense question representations used to guide the KG traversals. However, if the derived instructions do not exactly match the underlying KG information,  they may lead to reasoning under irrelevant context.\nOur method, termed ReaRev, introduces a new way to KGQA reasoning with respect\nto both instruction decoding and execution. To improve instruction decoding, we perform reasoning in an adaptive manner, where KG-aware information is used to iteratively update the initial instructions. To improve instruction execution, we emulate breadth-first search (BFS) with graph neural networks (GNNs). The BFS strategy treats the instructions as a set and allows our method to decide on their execution order on the fly. Experimental results on three KGQA benchmarks demonstrate the  ReaRev's effectiveness compared with previous state-of-the-art, especially when the KG is incomplete or when we tackle complex questions. Our code is publicly available at https://github.com/cmavro/ReaRev_KGQA.", "track": "Question Answering", "label": 11, "url": "https://www.semanticscholar.org/reader/543cefea7ad2a94c6bb2d8f0d0d6384e1547a9e7?experiments=&features=reader_skimming%3Atrue"}, {"loc": [5.630853652954102, 12.347098350524902], "id": 1565, "title": "Understanding Social Media Cross-Modality Discourse in Linguistic Space", "authors": "Chunpu Xu, Hanzhuo Tan, Jing Li and Piji Li", "abstract": "The multimedia communications with texts and images are popular on social media. However, limited studies concern how images are structured with texts to form coherent meanings in human cognition. To fill in the gap, we present a novel concept of cross-modality discourse, reflecting how human readers couple image and text understandings. Text descriptions are first derived from images (named as subtitles) in the multimedia contexts. Five labels -- entity-level insertion, projection  and concretization and scene-level restatement and extension --- are further employed to shape the structure of subtitles and texts and present their joint meanings. As a pilot study, we also build the very first dataset containing over 16K multimedia tweets with manually annotated discourse labels. The experimental results show that trendy multimedia encoders based on multi-head attention (with captions) are unable to well understand cross-modality discourse and additionally modeling texts at the output layer helps yield the-state-of-the-art results.", "track": "Speech, Vision, Robotics, Multimodal Grounding", "label": 7, "url": ""}, {"loc": [7.378390789031982, 3.903184413909912], "id": 1586, "title": "TAPE: Assessing Few-shot Russian Language Understanding", "authors": "Ekaterina Taktasheva, Alena Fenogenova, Denis Shevelev, Nadezhda Katricheva, Maria Tikhonova, Albina Ramilevna Akhmetgareeva, Oleg Vadimovich Zinkevich, Anastasiia Y. Bashmakova, Svetlana V. Iordanskaia, Valentina Kurenshchikova, Alena Spiridonova, Ekaterina Artemova, Tatiana Shavrina and Vladislav Mikhailov", "abstract": "Recent advances in zero-shot and few-shot learning have shown promise for a scope of research and practical purposes. However, this fast-growing area lacks standardized evaluation suites for non-English languages, hindering progress outside the Anglo-centric paradigm. To address this line of research, we propose TAPE (Text Attack and Perturbation Evaluation), a novel benchmark that includes six more complex NLU tasks for Russian, covering multi-hop reasoning, ethical concepts, logic and commonsense knowledge. The TAPE's design focuses on systematic zero-shot and few-shot NLU evaluation: (i) linguistic-oriented adversarial attacks and perturbations for analyzing robustness, and (ii) subpopulations for nuanced interpretation. The detailed analysis of testing the autoregressive baselines indicates that simple spelling-based perturbations affect the performance the most, while paraphrasing the input has a more negligible effect. At the same time, the results demonstrate a significant gap between the neural and human baselines for most tasks. We publicly release TAPE (https://tape-benchmark.com) to foster research on robust LMs that can generalize to new tasks when little to no supervision is available.", "track": "Resources and Evaluation", "label": 1, "url": "https://www.semanticscholar.org/reader/ce9d803168d64cd7caf0340041cb7bb8b0ac07f7?experiments=&features=reader_skimming%3Atrue"}, {"loc": [0.5753600001335144, 7.239218235015869], "id": 1598, "title": "A Hierarchical N-Gram Framework for Zero-Shot Link Prediction", "authors": "Mingchen Li, Junfan Chen, Samuel Mensah, Nikolaos Aletras, Xiulong Yang and yang ye", "abstract": "Knowledge graphs typically contain a large number of entities but often cover only a fraction of all relations between them (i.e., incompleteness). Zero-shot link prediction (ZSLP) is a popular way to tackle the problem by automatically identifying unobserved relations between entities. Most recent approaches use textual features of relations (e.g., surface name or textual descriptions) as auxiliary information to improve the encoded representation. These methods lack robustness as they are bound to support only tokens from a fixed vocabulary and unable to model out-of-vocabulary (OOV) words. Subword units such as character n-grams have the capability of generating more expressive representations for OOV words. Hence, in this paper, we propose a {\\bf H}ierarchical {\\bf N}-gram framework for {\\bf Z}ero-{\\bf S}hot {\\bf L}ink {\\bf P}rediction (HNZSLP) that leverages character n-gram information for ZSLP. Our approach works by first constructing a hierarchical n-gram graph from the surface name of relations. Subsequently, a new Transformer-based network models the hierarchical n-gram graph to learn a relation embedding for ZSLP. Experimental results show that our proposed HNZSLP method achieves state-of-the-art performance on two standard ZSLP datasets.", "track": "NLP Applications", "label": 0, "url": "https://www.semanticscholar.org/reader/0b9e130c6305de7766697ba7655f56010aaffd61?experiments=&features=reader_skimming%3Atrue"}, {"loc": [8.72663402557373, 8.185297966003418], "id": 1600, "title": "Quadapter: Adapter for GPT-2 Quantization", "authors": "Minseop Park, Jaeseong You, Markus Nagel and Simyung Chang", "abstract": "Transformer language models such as GPT-2 are difficult to quantize because of outliers in the activations leading to a large quantization error. To adapt to the error, one must use quantization-aware training, which entails a fine-tuning process based on the dataset and the training pipeline identical to those for the original model. Pretrained language models, however, often do not grant access to their datasets and training pipelines, forcing us to rely on arbitrary ones for fine-tuning. In that case, it is observed that quantization-aware training overfits the model to the fine-tuning data. To this end introduced is a quantization adapter (Quadapter), a small set of parameters that are learned to make activations quantization-friendly by scaling them channel-wise.\nFor quantization without overfitting, we introduce a quantization adapter (Quadapter), a small set of parameters that are learned to make activations quantization-friendly by scaling them channel-wise. It keeps the model parameters unchanged. By applying our method to the challenging task of quantizing GPT-2, we demonstrate that it effectively prevents the overfitting and improves the quantization performance.", "track": "Efficient Methods for NLP", "label": 12, "url": ""}, {"loc": [2.838000774383545, 4.6923441886901855], "id": 1613, "title": "BanglaRQA: A Benchmark Dataset for Under-resourced Bangla Language Reading Comprehension-based Question Answering with Diverse Question-Answer Types", "authors": "Syed Mohammed Sartaj Ekram, Adham Arik Rahman, Md. Sajid Altaf, Mohammed Saidul Islam, Mehrab Mustafy Rahman, Md. Mezbaur Rahman, Md Azam Hossain and Abu Raihan Mostofa Kamal", "abstract": "High-resource languages, such as English, have access to a plethora of datasets with various question-answer types resembling real-world reading comprehension. However, there is a severe lack of diverse and comprehensive question-answering datasets in under-resourced languages like Bangla. The ones available are either translated versions of English datasets with a niche answer format or created by human annotations focusing on a specific domain, question type, or answer type. To address these limitations, this paper introduces BanglaRQA, a reading comprehension-based Bangla question-answering dataset with various question-answer types. BanglaRQA consists of 3,000 context passages and 14,889 question-answer pairs created from those passages. The dataset comprises answerable and unanswerable questions covering four unique categories of questions and three types of answers. In addition, this paper also implemented four different Transformer models for question-answering on the proposed dataset. The best-performing model achieved an overall 62.42% EM and 78.11% F1 score. However, detailed analyses showed that the performance varies across question-answer types, leaving room for substantial improvement of the model performance. Furthermore, we demonstrated the effectiveness of BanglaRQA as a training resource by showing strong results on the bn_squad dataset. Therefore, BanglaRQA has the potential to contribute to the advancement of future research by enhancing the capability of language models. The dataset and codes are available at https://github.com/sartajekram419/BanglaRQA", "track": "Question Answering", "label": 11, "url": ""}, {"loc": [4.215872287750244, 3.9530646800994873], "id": 1614, "title": "Chaining Simultaneous Thoughts for Numerical Reasoning", "authors": "Zhihong Shao, Fei Huang and Minlie Huang", "abstract": "Given that rich information is hidden behind ubiquitous numbers in text, numerical reasoning over text should be an essential skill of AI systems. To derive precise equations to solve numerical reasoning problems, previous work focused on modeling the structures of equations, and has proposed various structured decoders. Though structure modeling proves to be effective, these structured decoders construct a single equation in a pre-defined autoregressive order, potentially placing an unnecessary restriction on how a model should grasp the reasoning process. Intuitively, humans may have numerous pieces of thoughts popping up in no pre-defined order; thoughts are not limited to the problem at hand, and can even be concerned with other related problems. By comparing diverse thoughts and chaining relevant pieces, humans are less prone to errors. In this paper, we take this inspiration and propose CANTOR, a numerical reasoner that models reasoning steps using a directed acyclic graph where we produce diverse reasoning steps simultaneously without pre-defined decoding dependencies, and compare and chain relevant ones to reach a solution. Extensive experiments demonstrated the effectiveness of CANTOR under both fully-supervised and weakly-supervised settings.", "track": "Question Answering", "label": 11, "url": ""}, {"loc": [4.269927501678467, 4.329064846038818], "id": 1619, "title": "Inferring Implicit Relations in Complex Questions with Language Models", "authors": "Uri Katz, Mor Geva and Jonathan Berant", "abstract": "A prominent challenge for modern language understanding systems is the ability to answer implicit reasoning questions, where the required reasoning steps for answering the question are not mentioned in the text explicitly. In this work, we investigate why current models struggle with implicit reasoning question answering (QA) tasks, by decoupling inference of reasoning steps from their execution.\nWe define a new task of implicit relation inference and construct a benchmark, IMPLICITRELATIONS, where given a question, a model should output a list of concept-relation pairs, where the relations describe the implicit reasoning steps required for answering the question.\nUsing IMPLICITRELATIONS, we evaluate models from the GPT-3 family and find that, while these models struggle on the implicit reasoning QA task, they often succeed at inferring implicit relations.\nThis suggests that the challenge in implicit reasoning questions does not stem from the need to plan a reasoning strategy alone, but to do it while also retrieving and reasoning over relevant information.", "track": "Question Answering", "label": 11, "url": "https://www.semanticscholar.org/reader/2f21201ac9fcb88a72c56471402388ec2fc365a8?experiments=&features=reader_skimming%3Atrue"}, {"loc": [7.988410472869873, 8.671518325805664], "id": 1649, "title": "Eliciting and Understanding Cross-task Skills with Task-level Mixture-of-Experts", "authors": "Qinyuan Ye, Juan Zha and Xiang Ren", "abstract": "Recent works suggest that transformer models are capable of multi-tasking on diverse NLP tasks and adapt to new tasks efficiently. However, the potential of these multi-task models may be limited as they use the same set of parameters for all tasks. In contrast, humans tackle tasks in a more flexible way, by making proper presumptions on what skills and knowledge are relevant and executing only the necessary computations. Inspired by this, we propose to use task-level mixture-of-expert models, which has a collection of transformer layers (i.e., experts) and a router component to choose among these experts dynamically and flexibly. We find that these models help improve the average performance gain (ARG) metric by 2.6% when adapting to unseen tasks in few-shot settings, and by 5.6% in zero-shot generalization settings. Further, we show that the learned routing decisions and experts partly rediscover human categorization of NLP tasks -- certain experts are strongly associated with extractive tasks, some with classification tasks, and some with tasks requiring world knowledge.", "track": "Language Modeling and Analysis of Language Models", "label": 2, "url": ""}, {"loc": [7.225702285766602, 5.80625581741333], "id": 1650, "title": "On the Curious Case of l2 norm of Sense Embeddings", "authors": "Yi Zhou and Danushka Bollegala", "abstract": "We show that the l2 norm of a static sense embedding encodes information related to the frequency of that sense in the training corpus used to learn the sense embeddings. This finding can be seen as an extension of a previously known relationship for word embeddings to sense embeddings. Our experimental results show that in spite of its simplicity, the l2 norm of sense embeddings is a surprisingly effective feature for several word sense related tasks such as (a) most frequent sense prediction, (b) word-in-context (WiC), and (c) word sense disambiguation (WSD). In particular, by simply including the l2 norm of a sense embedding as a feature in a classifier, we show that we can improve WiC and WSD methods that use static sense embeddings.", "track": "Linguistic Theories, Cognitive Modeling and Psycholinguistics", "label": 22, "url": ""}, {"loc": [8.729771614074707, 8.125304222106934], "id": 1653, "title": "Partially-Random Initialization: A Smoking Gun for Binarization Hypothesis of BERT", "authors": "Arash Ardakani", "abstract": "In the past few years, pre-trained BERT has become one of the most popular deep-learning language models due to their remarkable performance in natural language processing (NLP) tasks. However, the superior performance of BERT comes at the cost of high computational and memory complexity, hindering its envisioned widespread deployment in edge devices with limited computing resources. Binarization can alleviate these limitations by reducing storage requirements and improving computing performance. However, obtaining a comparable accuracy performance for binary BERT w.r.t. its full-precision counterpart is still a difficult task. We observe that direct binarization of pre-trained BERT provides a poor initialization during the fine-tuning phase, making the model incapable of achieving a decent accuracy on downstream tasks. Based on this observation, we put forward the following \\textit{hypothesis}: partially randomly-initialized BERT with binary weights and activations can reach to a decent accuracy performance by distilling knowledge from the its full-precision counterpart. We show that BERT with pre-trained embedding layer and randomly-initialized encoder is a smoking gun for this hypothesis. We identify the smoking gun through a series of experiments and show that it yields a new set of state-of-the-art results on the GLUE and SQuAD benchmarks.", "track": "Efficient Methods for NLP", "label": 12, "url": ""}, {"loc": [8.028206825256348, 9.455389976501465], "id": 1657, "title": "Prompt Consistency for Zero-Shot Task Generalization", "authors": "Chunting Zhou, Junxian He, Xuezhe Ma, Taylor Berg-Kirkpatrick and Graham Neubig", "abstract": "One of the most impressive results of recent NLP history is the ability of pre-trained language models to solve new tasks in a zero-shot setting. To achieve this, NLP tasks are framed as natural language prompts, generating a response indicating the predicted output. Nonetheless, the performance in such settings often lags far behind its supervised counterpart, suggesting a large space for potential improvement. In this paper, we explore methods to utilize unlabeled data to improve zero-shot performance. Specifically, we take advantage of the fact that multiple prompts can be used to specify a single task, and propose to regularize prompt consistency, encouraging consistent predictions over this diverse set of prompts. Our method makes it possible to fine-tune the model either with extra unlabeled training data, or directly on test input at inference time in an unsupervised manner. In experiments, our approach outperforms the state-of-the-art zero-shot learner, T0, on 9 out of 11 datasets across 4 NLP tasks by up to 10.6 absolute points in terms of accuracy. The gains are often attained with a small number of unlabeled examples.", "track": "Machine Learning for NLP", "label": 3, "url": ""}, {"loc": [4.579060077667236, 7.721115589141846], "id": 1659, "title": "In-Context Learning for Few-Shot Dialogue State Tracking", "authors": "Yushi Hu, Chia-Hsuan Lee, Tianbao Xie, Tao Yu, Noah A. Smith and Mari Ostendorf", "abstract": "Collecting and annotating task-oriented dialogues is time-consuming and costly. Thus, zero and few shot learning for dialogue tasks presents an exciting opportunity. In this work, we propose an in-context (IC) learning framework for zero-shot and few-shot learning dialogue state tracking (DST), where a large pretrained language model (LM) takes a test instance and a few exemplars as input, and directly decodes the dialogue state without any parameter updates. This approach is more flexible and scalable than prior DST work when adapting to new domains and scenarios. To better leverage a tabular domain description in the LM prompt, we reformulate DST into a text-to-SQL problem. We also propose a novel approach to retrieve annotated dialogues as exemplars. Empirical results on MultiWOZ show that our method IC-DST substantially outperforms previous fine-tuned state-of-the-art models in few-shot settings. In addition, we test IC-DST in zero-shot settings, in which the model only takes a fixed task instruction as input, finding that it outperforms previous zero-shot methods by a large margin.", "track": "Dialogue and Interactive Systems", "label": 4, "url": "https://www.semanticscholar.org/reader/b645e706651391eca1f692e7f560051c21b3dea4?experiments=&features=reader_skimming%3Atrue"}, {"loc": [5.280877590179443, 12.220988273620605], "id": 1665, "title": "On Advances in Text Generation from Images Beyond Captioning: A Case Study in Self-Rationalization", "authors": "Shruti Palaskar, Akshita Bhagia, Yonatan Bisk, Florian Metze, Alan W Black and Ana Marasovic", "abstract": "Combining the visual modality with pretrained language models has been surprisingly effective for simple descriptive tasks such as image captioning. More general text generation however remains elusive. We take a step back and ask: How do these models work for more complex generative tasks, i.e. conditioning on both text and images? Are multimodal models simply visually adapted language models, or do they combine they reason jointly over modalities?\n\nWe investigate these questions in the context of self-rationalization (jointly generating task labels/answers and free-text explanations) of three tasks: (i) visual question answering in VQA-X, (ii) visual commonsense reasoning in VCR, and (iii) visual-textual entailment in E-SNLI-VE. We show that recent unimodal advances, CLIP image representations and scaling of language models, do not consistently improve\nself-rationalization in multimodal tasks. We find that no single model type works universally best across tasks, datasets, and finetuning data sizes. Our \ufb01ndings motivate the need for novel general backbones that move text generation from images and text beyond image captioning.", "track": "Speech, Vision, Robotics, Multimodal Grounding", "label": 7, "url": "https://www.semanticscholar.org/reader/97ec7cf78c6f0b8a9cd9f4afdccc369ec3898f19?experiments=&features=reader_skimming%3Atrue"}, {"loc": [8.87336254119873, 7.232455730438232], "id": 1669, "title": "The challenges of temporal alignment on Twitter during crises", "authors": "Aniket Pramanick, Tilman Beck, Kevin Stowe and Iryna Gurevych", "abstract": "Language use changes over time, and this impacts the effectiveness of NLP systems. This phenomenon is even more prevalent in social media data during crisis events where meaning and frequency of word usage may change over the course of days. Contextual language models fail to adapt temporally, emphasizing the need for temporal adaptation in models which need to be deployed over an extended period of time. While existing approaches consider data spanning large periods of time (from years to decades), shorter time spans are critical for crisis data. We quantify temporal degradation for this scenario and propose methods to cope with performance loss by leveraging techniques from domain adaptation. To the best of our knowledge, this is the first effort to explore effects of rapid language change driven by adversarial adaptations, particularly during natural and human-induced disasters. Through extensive experimentation on diverse crisis datasets, we analyze under what conditions our approaches outperform strong baselines while highlighting the current limitations of temporal adaptation methods in scenarios where access to unlabeled data is scarce.", "track": "Computational Social Science and Cultural Analytics", "label": 20, "url": "https://www.semanticscholar.org/reader/8a318ae057c2f7aaf3d939719d3cb100eff5b3c4?experiments=&features=reader_skimming%3Atrue"}, {"loc": [8.210074424743652, 7.2390618324279785], "id": 1670, "title": "Experimental Standards for Deep Learning in Natural Language Processing Research", "authors": "Dennis Ulmer, Elisa Bassignana, Max M\u00fcller-Eberstein, Daniel Varab, Mike Zhang, Rob van der Goot, Christian Hardmeier and Barbara Plank", "abstract": "The field of Deep Learning (DL) has undergone explosive growth during the last decade, with a substantial impact on Natural Language Processing (NLP) as well. Yet, compared to more established disciplines, a lack of common experimental standards remains an open challenge to the field at large. Starting from fundamental scientific principles, we distill ongoing discussions on experimental standards in NLP into a single, widely-applicable methodology. Following these best practices is crucial to strengthen experimental evidence, improve reproducibility and enable scientific progress. These standards are further collected in a public repository to help them transparently adapt to future needs.", "track": "Theme Track", "label": 18, "url": "https://www.semanticscholar.org/reader/77f06e3d1dfac471322392bd60b9d048152280a4?experiments=&features=reader_skimming%3Atrue"}, {"loc": [2.397756814956665, 8.213961601257324], "id": 1671, "title": "Few-Shot Anaphora Resolution in Scientific Protocols via Mixtures of In-Context Experts", "authors": "Nghia T. Le, Fan Bai and Alan Ritter", "abstract": "Anaphora resolution is an important task for information extraction across a range of languages, text genres, and domains, motivating the need for methods that do not require large annotated datasets. In-context learning has emerged as a promising approach, yet there are a number of challenges in applying in-context learning to resolve anaphora. For example, encoding a single in-context demonstration that consists of: an anaphor, a paragraph-length context, and a list of corresponding antecedents, requires conditioning a language model on a long sequence of tokens, limiting the number of demonstrations per prompt.\nIn this paper, we present Mice (Mixtures of In-Context Experts), which we demonstrate is effective for few-shot anaphora resolution in scientific protocols. Given only a handful of training examples, Mice combines the predictions of hundreds of in-context experts, yielding a 30% increase in F1 score over a competitive prompt retrieval baseline. Furthermore, we show Mice can be used to train compact student models without sacrificing performance. As far as we are aware, this is the first work to present experimental results demonstrating the effectiveness of in-context learning on the task of few-shot anaphora resolution in scientific protocols.", "track": "Language Modeling and Analysis of Language Models", "label": 2, "url": "https://www.semanticscholar.org/reader/fb1f7ffef65341aa5aee2bb0b240d4ef51680fce?experiments=&features=reader_skimming%3Atrue"}, {"loc": [8.435981750488281, 7.397261619567871], "id": 1673, "title": "Exploring Predictive Uncertainty and Calibration in NLP: A Study on the Impact of Method & Data Scarcity", "authors": "Dennis Ulmer, Jes Frellsen and Christian Hardmeier", "abstract": "We investigate the problem of determining the predictive confidence (or, conversely, uncertainty) of a neural classifier through the lens of low-resource languages. By training models on sub-sampled datasets in three different languages, we assess the quality of estimates from a wide array of approaches and their dependence on the amount of available data. We find that while approaches based on pre-trained models and ensembles achieve the best results overall, the quality of uncertainty estimates can surprisingly suffer with more data. We also perform a qualitative analysis of uncertainties on sequences, discovering that a model's total uncertainty seems to be influenced to a large degree by its data uncertainty, not model uncertainty. All model implementations are open-sourced in a software package.", "track": "Machine Learning for NLP", "label": 3, "url": "https://www.semanticscholar.org/reader/670a8db8e47cfe234558ed913242427a1b8b8348?experiments=&features=reader_skimming%3Atrue"}, {"loc": [6.3040852546691895, 5.44805383682251], "id": 1705, "title": "Conditional Supervised Contrastive Learning for Fair Text Classification", "authors": "Jianfeng Chi, William Shand, Yaodong Yu, Kai-Wei Chang, Han Zhao and Yuan Tian", "abstract": "Contrastive representation learning has gained much attention due to its superior performance in learning representations from both image and sequential data. However, the learned representations could potentially lead to performance disparities in downstream tasks, such as increased silencing of underrepresented groups in toxicity comment classification. In light of this challenge, in this work, we study learning fair representations that satisfy a notion of fairness known as equalized odds for text classification via contrastive learning. Specifically, we first theoretically analyze the connections between learning representations with a fairness constraint and conditional supervised contrastive objectives, and then propose to use conditional supervised contrastive objectives to learn fair representations for text classification. We conduct experiments on two text datasets to demonstrate the effectiveness of our approaches in balancing the trade-offs between task performance and bias mitigation among existing baselines for text classification. Furthermore, we also show that the proposed methods are stable in different hyperparameter settings.", "track": "Ethics", "label": 21, "url": ""}, {"loc": [1.5787986516952515, 8.570415496826172], "id": 1717, "title": "SpaBERT: A Pretrained Language Model from Geographic Data for Geo-Entity Representation", "authors": "Zekun Li, Jina Kim, Yao-Yi Chiang and Muhao Chen", "abstract": "Named geographic entities (geo-entities for short) are the building blocks of many geographic datasets. Characterizing geo-entities is integral to various application domains, such as geo-intelligence and map comprehension, while a key challenge is to capture the spatial-varying context of an entity. We hypothesize that we shall know the characteristics of a geo-entity by its surrounding entities, similar to knowing word meanings by their linguistic context. Accordingly, we propose a novel spatial language model, SpaBERT, which provides a general-purpose geo-entity representation based on neighboring entities in geospatial data. SpaBERT extends BERT to capture linearized spatial context, while incorporating a spatial coordinate embedding mechanism to preserve spatial relations of entities in the 2-dimensional space. SpaBERT is pretrained with masked language modeling and masked entity prediction tasks to learn spatial dependencies. We apply SpaBERT to two downstream tasks: geo-entity typing and geo-entity linking.  Compared with the existing language models that do not use spatial context, SpaBERT shows significant performance improvement on both tasks. We also analyze the entity representation from SpaBERT in various settings and the effect of spatial coordinate embedding.", "track": "Semantics: Lexical, Sentence level, Textual Inference and Other areas", "label": 8, "url": "https://www.semanticscholar.org/reader/8a5837b9245035972f97d6796f62790b6e7e9d71?experiments=&features=reader_skimming%3Atrue"}, {"loc": [4.225561618804932, 7.505403518676758], "id": 1732, "title": "Self-training with Two-phase Self-augmentation for Few-shot Dialogue Generation", "authors": "Wanyu Du, Hanjie Chen and Yangfeng Ji", "abstract": "In task-oriented dialogue systems, response generation from meaning representations (MRs) often suffers from limited training examples, due to the high cost of annotating MR-to-Text pairs. Previous works on self-training leverage fine-tuned conversational models to automatically generate pseudo-labeled MR-to-Text pairs for further fine-tuning. However, some self-augmented data may be noisy or uninformative for the model to learn from. In this work, we propose a two-phase self-augmentation procedure to generate high-quality pseudo-labeled MR-to-Text pairs: the first phase selects the most informative MRs based on model's prediction uncertainty; with the selected MRs, the second phase generates accurate responses by aggregating multiple perturbed latent representations from each MR. Empirical experiments on two benchmark datasets, FewShotWOZ and FewShotSGD, show that our method generally outperforms existing self-training methods on both automatic and human evaluations.", "track": "Dialogue and Interactive Systems", "label": 4, "url": "https://www.semanticscholar.org/reader/5c0544c74e4fb017d782d9754c6bd7f3fc28c9c7?experiments=&features=reader_skimming%3Atrue"}, {"loc": [8.286637306213379, 7.1084136962890625], "id": 1741, "title": "Is NLP Ready for Standardization?", "authors": "Lauriane Aufrant", "abstract": "While standardization is a well-established activity in other scientific fields such as telecommunications, networks or multimedia, in the field of AI and more specifically NLP it is still at its dawn. In this paper, we explore how various aspects of NLP (evaluation, data, tasks...) lack standards and how that can impact science, but also the society, the industry, and regulations. We argue that the numerous initiatives to rationalize the field and establish good practices are only the first step, and developing formal standards remains needed to bring further clarity to NLP research and industry, at a time where this community faces various crises regarding ethics or reproducibility. We thus encourage NLP researchers to contribute to existing and upcoming standardization projects, so that they can express their needs and concerns, while sharing their expertise.", "track": "Theme Track", "label": 18, "url": ""}, {"loc": [6.862176418304443, 6.41918420791626], "id": 1744, "title": "Probing for Incremental Parse States in Autoregressive Language Models", "authors": "Tiwalayo Eisape, Vineet Gangireddy, Roger Levy and Yoon Kim", "abstract": "Next-word predictions from autoregressive neural language models show remarkable sensitivity to syntax. This work evaluates the extent to which this behavior arises as a result of a learned ability to maintain implicit representations of incremental syntactic structures. We extend work in syntactic probing to the incremental setting and present several probes for extracting incomplete syntactic structure (operationalized through  parse states from a stack-based parser) from autoregressive language models. We find that our probes can be used to predict model preferences on ambiguous sentence prefixes and causally intervene on model representations and steer model behavior. This suggests implicit incremental syntactic inferences underlie next-word predictions in autoregressive neural language models.", "track": "Language Modeling and Analysis of Language Models", "label": 2, "url": "https://www.semanticscholar.org/reader/307d522c7bd7eafc21e67027b207ad9690243715?experiments=&features=reader_skimming%3Atrue"}, {"loc": [3.5482852458953857, 4.426609516143799], "id": 1761, "title": "Re-Examining Calibration: The Case of Question Answering", "authors": "Chenglei Si, Chen Zhao, Sewon Min and Jordan Boyd-Graber", "abstract": "For users to trust model predictions, they need to understand model outputs, particularly their confidence \u2014 calibration aims to adjust (calibrate) models' confidence to match expected accuracy. We argue that the traditional calibration evaluation does not promote effective calibrations: for example, it can encourage always assigning a mediocre confidence score to all predictions, which does not help users distinguish correct predictions from wrong ones. Building on those observations, we propose a new calibration metric, MacroCE, that better captures whether the model assigns low confidence to wrong predictions and high confidence to correct predictions. Focusing on the practical application of open-domain question answering, we examine conventional calibration methods applied on the widely-used retriever-reader pipeline, all of which do not bring significant gains under our new MacroCE metric. Toward better calibration, we propose a new calibration method (ConsCal) that uses not just final model predictions but whether multiple model checkpoints make consistent predictions. Altogether, we provide an alternative view of calibration along with a new metric, re-evaluation of existing calibration methods on our metric, and proposal of a more effective calibration method.", "track": "Question Answering", "label": 11, "url": "https://www.semanticscholar.org/reader/615671736f303f05a9f2a026a9e677788eef96b3?experiments=&features=reader_skimming%3Atrue"}, {"loc": [1.714347243309021, 3.802700996398926], "id": 1764, "title": "Accelerating Learned Sparse Indexes Via Term Impact Decomposition", "authors": "Joel Mackenzie, Antonio Mallia, Alistair Moffat and Matthias Petri", "abstract": "Novel inverted index-based learned sparse ranking models provide more effective, but less efficient, retrieval performance compared to traditional ranking models like BM25. In this paper, we introduce a technique we call postings clipping to improve the query efficiency of learned representations. Our technique amplifies the benefit of dynamic pruning query processing techniques by accounting for changes in term importance distributions of learned ranking models. The new clipping mechanism accelerates top-k retrieval by up to 9.6X without any loss in effectiveness.", "track": "Information Retrieval and Text Mining", "label": 15, "url": ""}, {"loc": [7.631075859069824, 8.593328475952148], "id": 1767, "title": "Do Text-to-Text Multi-Task Learners Suffer from Task Conflict?", "authors": "David Mueller, Nicholas Andrews and Mark Dredze", "abstract": "Traditional multi-task learning architectures learn a single model across multiple tasks through a shared encoder followed by task-specific decoders. Learning these models often requires specialized training algorithms that address task-conflict in the shared parameter updates, which otherwise can lead to negative transfer. A new type of multi-task learning within NLP homogenizes multi-task architectures as a shared encoder and language model decoder, which does surprisingly well across a range of diverse tasks. Does this new architecture suffer from task-conflicts that require specialized training algorithms? We study how certain factors in the shift towards text-to-text models affects multi-task conflict and negative transfer, finding that both directional conflict and transfer are surprisingly constant across architectures.", "track": "Machine Learning for NLP", "label": 3, "url": ""}, {"loc": [8.40966796875, 7.427639484405518], "id": 1774, "title": "MANTa: Efficient Gradient-Based Tokenization for End-to-End Robust Language Modeling", "authors": "Nathan Godey, Roman Castagn\u00e9, \u00c9ric de la Clergerie and Beno\u00eet Sagot", "abstract": "Static subword tokenization algorithms have been an essential component of recent works on language modeling. However, their static nature results in important flaws that degrade the models' downstream performance and robustness. In this work, we propose MANTa, a Module for Adaptive Neural TokenizAtion. MANTa is a differentiable tokenizer trained end-to-end with the language model. The resulting system offers a trade-off between the expressiveness of byte-level models and the speed of models trained using subword tokenization. In addition, our tokenizer is highly explainable since it produces an explicit segmentation of sequences into blocks. We evaluate our pre-trained model on several English datasets from different domains as well as on synthetic noise. We find that MANTa improves robustness to character perturbations and out-of-domain data. We then show that MANTa performs comparably to other models on the general-domain GLUE benchmark. Finally, we show that it is considerably faster than strictly byte-level models.", "track": "Language Modeling and Analysis of Language Models", "label": 2, "url": ""}, {"loc": [4.00194787979126, 4.52043342590332], "id": 1813, "title": "Calibrating Trust of Multi-Hop Question Answering Systems with Decompositional Probes", "authors": "Kaige Xie, Sarah Wiegreffe and Mark Riedl", "abstract": "Multi-hop Question Answering (QA) is a challenging task since it requires an accurate aggregation of information from multiple context paragraphs and a thorough understanding of the underlying reasoning chains. Recent work in multi-hop QA has shown that performance can be boosted by first decomposing the questions into simpler, single-hop questions. In this paper, we explore one additional utility of the multi-hop decomposition from the perspective of explainable NLP: to create explanation by probing a neural QA model with them. We hypothesize that in doing so, users will be better able to predict when the underlying QA system will give the correct answer. Through human participant studies, we verify that exposing the decomposition probes and answers to the probes to users can increase their ability to predict system performance on a question instance basis. We show that decomposition is an effective form of probing QA systems as well as a promising approach to explanation generation. In-depth analyses show the need for improvements in decomposition systems.", "track": "Interpretability, Interactivity and Analysis of Models for NLP", "label": 9, "url": ""}, {"loc": [7.68852424621582, 3.5797853469848633], "id": 1837, "title": "CheckHARD: Checking Hard Labels for Adversarial Text Detection, Prediction Correction, and Perturbed Word Suggestion", "authors": "Hoang-Quoc Nguyen-Son, Huy Quang Ung, Seira Hidano, Kazuhide Fukushima and Shinsaku Kiyomoto", "abstract": "An adversarial attack generates harmful text that fools a target model. More dangerously, this text is unrecognizable by humans. Existing work detects adversarial text and corrects a target's prediction by identifying perturbed words and changing them into their synonyms, but many benign words are also changed. In this paper, we directly detect adversarial text, correct the prediction, and suggest perturbed words by checking the change in the hard labels from the target's predictions after replacing a word with its transformation using a model that we call CheckHARD. The experiments demonstrate that CheckHARD outperforms existing work on various attacks, models, and datasets.", "track": "Sentiment Analysis, Stylistic Analysis, and Argument Mining", "label": 16, "url": ""}, {"loc": [5.902439117431641, 4.853776931762695], "id": 1842, "title": "Mitigating Covertly Unsafe Text within Natural Language Systems", "authors": "Alex Mei, Anisha Kabir, Sharon Levy, Melanie Subbiah, Emily Allaway, John N. Judge, Desmond Patton, Bruce Bimber, Kathleen McKeown and William Yang Wang", "abstract": "An increasingly prevalent problem for intelligent technologies is text safety, as uncontrolled systems may generate recommendations to their users that lead to injury or life-threatening consequences. However, the degree of explicitness of a generated statement that can cause physical harm varies. In this paper, we distinguish types of text that can lead to physical harm and establish one particularly underexplored category: covertly unsafe text. Then, we further break down this category with respect to the system's information and discuss solutions to mitigate the generation of text in each of these subcategories. Ultimately, our work defines the problem of covertly unsafe language that causes physical harm and argues that this subtle yet dangerous issue needs to be prioritized by stakeholders and regulators. We highlight mitigation strategies to inspire future researchers to tackle this challenging problem and help improve safety within smart systems.", "track": "Theme Track", "label": 18, "url": "https://www.semanticscholar.org/reader/d62f73a1799bbeff06e9de90b21ee309770fd6c6?experiments=&features=reader_skimming%3Atrue"}, {"loc": [4.765920639038086, 8.699359893798828], "id": 1847, "title": "\"I Know Who You Are\u201d: Character-Based Features for Conversational Humor Recognition in Chinese", "authors": "Wenbo Shang, Jiangjiang Zhao, Zezhong WANG, Binyang Li, Fangchun Yang and Kam-Fai Wong", "abstract": "Humor plays an important role in our daily life, as it is an essential and fascinating element in the communication between persons. Therefore, how to recognize punchlines from the dialogue, i.e. conversational humor recognition, has attracted much interest of computational linguistics communities. However, most existing work attempted to understand the conversational humor by analyzing the contextual information of the dialogue, but neglected the character of the interlocutor, such as age, gender, occupation, and so on. For instance, the same utterance could bring out humorous from a serious person, but may be a plain expression from a naive person. To this end, this paper proposes a Character Fusion Conversational Humor Recognition model (CFCHR) to explore character information to recognize conversational humor. CFCHR utilizes a multi-task learning framework that unifies two highly pertinent tasks, i.e., character extraction and punchline identification. Based on deep neural networks, we trained both tasks jointly by sharing weight to extract the common and task-invariant features while each task could still learn its task-specific features. Experiments were conducted on Chinese sitcoms corpus, which consisted of 12,677 utterances from 22 characters. The experimental results demonstrated that CFCHR could achieve 33.08% improvements in terms of F1-score over some strong baselines, and proved the effectiveness of the character information to identify the punchlines.", "track": "NLP Applications", "label": 0, "url": ""}, {"loc": [6.306203842163086, 5.225409507751465], "id": 1854, "title": "DebiasGAN: Eliminating Position Bias in News Recommendation with Adversarial Learning", "authors": "Chuhan Wu, Fangzhao Wu, Xiangnan He and Yongfeng Huang", "abstract": "Click behaviors are widely used for learning news recommendation models, but they are heavily affected by the biases brought by the news display positions. It is important to remove position biases to train unbiased recommendation model and capture unbiased user interest. In this paper, we propose a news recommendation method named DebiasGAN that can effectively alleviate position biases via adversarial learning. The core idea is modeling the personalized effect of position bias on click behaviors in a candidate-aware way, and learning debiased candidate-aware user embeddings from which the position information cannot be discriminated. More specifically, we use a bias-aware click model to capture the effect of position bias on click behaviors, and use a bias-invariant click model with random candidate positions to estimate the ideally unbiased click scores. We apply adversarial learning to the embeddings learned by the two models to help the bias-invariant click model capture debiased user interest. Experimental results on two real-world datasets show that DebiasGAN effectively improves news recommendation by eliminating position biases.", "track": "Information Retrieval and Text Mining", "label": 15, "url": "https://www.semanticscholar.org/reader/8248c16165e7e9093365d0e1a7327bf6e70429ba?experiments=&features=reader_skimming%3Atrue"}, {"loc": [3.7355446815490723, 9.935484886169434], "id": 1869, "title": "Generating Multiple-Length Summaries via Reinforcement Learning for Unsupervised Sentence Summarization", "authors": "Dongmin Hyun, Xiting Wang, Chayoung Park, Xing Xie and Hwanjo Yu", "abstract": "Sentence summarization shortens given texts while maintaining core contents of the texts. Unsupervised approaches have been studied to summarize texts without ground-truth summaries. However, recent unsupervised models are extractive, which remove words from texts and thus they are less flexible than abstractive summarization.  In this work, we devise an abstractive model based on reinforcement learning without ground-truth summaries. We formulate the unsupervised summarization based on the Markov decision process with rewards representing the summary quality. To further enhance the summary quality, we develop a multi-summary learning mechanism that generates multiple summaries with varying lengths for a given text, while making the summaries mutually enhance each other. Experimental results show that the proposed model substantially outperforms both abstractive and extractive models, yet frequently generating new words not contained in input texts.", "track": "Summarization", "label": 14, "url": ""}, {"loc": [9.379859924316406, 6.294040679931641], "id": 1873, "title": "Multilingual Sentence Transformer as A Multilingual Word Aligner", "authors": "Weikang Wang, Guanhua Chen, Hanqing Wang, Yue Han and Yun Chen", "abstract": "Multilingual pretrained language models (mPLMs) have shown their effectiveness in multilingual word alignment induction. However, these methods usually start from mBERT or XLM-R. In this paper, we investigate whether multilingual sentence Transformer LaBSE is a strong multilingual word aligner. This idea is non-trivial as LaBSE is trained to learn language-agnostic sentence-level embeddings, while the alignment extraction task requires the more fine-grained word-level embeddings to be language-agnostic. We demonstrate that the vanilla LaBSE outperforms other mPLMs currently used in the alignment task, and then propose to finetune LaBSE on parallel corpus for further improvement. Experiment results on seven language pairs show that our best aligner outperforms previous state-of-the-art models of all varieties. In addition, our aligner supports different language pairs in a single model, and even achieves new state-of-the-art on zero-shot language pairs that does not appear in the finetuning process.", "track": "Multilinguality", "label": 13, "url": ""}, {"loc": [5.950556755065918, 5.130181312561035], "id": 1879, "title": "CORE: A Retrieve-then-Edit Framework for Counterfactual Data Generation", "authors": "Tanay Dixit, Bhargavi Paranjape, Hannaneh Hajishirzi and Luke Zettlemoyer", "abstract": "Counterfactual data augmentation (CDA) -- i.e., adding minimally perturbed inputs during training -- helps reduce model reliance on spurious correlations and improves generalization to out-of-distribution (OOD) data. Prior work on generating counterfactuals only considered restricted classes of perturbations, limiting their effectiveness. We present Counterfactual Generation via Retrieval and Editing (CORE), a retrieval-augmented generation framework for creating diverse counterfactual perturbations for CDA. For each training example, CORE first performs a dense retrieval over a task-related unlabeled text corpus using a learned bi-encoder and extracts relevant counterfactual excerpts. CORE then incorporates these into prompts to a large language model with few-shot learning capabilities, for counterfactual editing. Conditioning language model edits on naturally occurring data results in more diverse perturbations. Experiments on natural language inference and sentiment analysis benchmarks show that CORE counterfactuals are more effective at improving generalization to OOD data compared to other DA approaches. We also show that the CORE retrieval framework can be used to encourage diversity in manually authored perturbations.", "track": "Interpretability, Interactivity and Analysis of Models for NLP", "label": 9, "url": ""}, {"loc": [4.182408332824707, 7.435129165649414], "id": 1885, "title": "Conversation Disentanglement with Bi-Level Contrastive Learning", "authors": "Chengyu Huang, Zheng Zhang, Hao Fei and Lizi Liao", "abstract": "Conversation disentanglement aims to group utterances into detached sessions, which is a fundamental task in processing multi-party conversations. Existing methods have two main drawbacks. First, they overemphasize pairwise utterance relations but pay inadequate attention to the utterance-to-context relation modeling. Second, huge amount of human annotated data is required for training, which is expensive to obtain in practice. To address these issues, we propose a general disentangle model based on bi-level contrastive learning. It brings closer utterances in the same session while encourages each utterance to be near its clustered session prototypes in the representation space. Unlike existing approaches, our disentangle model works in both supervised setting with labeled data and unsupervised setting when no such data is available. The proposed method achieves new state-of-the-art performance on both settings across several public datasets.", "track": "Dialogue and Interactive Systems", "label": 4, "url": "https://www.semanticscholar.org/reader/d07b5b01cf3530c3cf1997aa660da0c41562dc1c?experiments=&features=reader_skimming%3Atrue"}, {"loc": [1.9653910398483276, 4.0140252113342285], "id": 1887, "title": "You can't pick your neighbors, or can you? When and How to Rely on Retrieval in the kNN-LM", "authors": "Andrew Drozdov, Shufan Wang, Razieh Rahimi, Andrew McCallum, Hamed Zamani and Mohit Iyyer", "abstract": "Retrieval-enhanced language models (LMs), which condition their predictions on text retrieved from large external datastores, have recently shown significant perplexity improvements compared to standard LMs. One such approach, the kNN-LM, interpolates any existing LM's predictions with the output of a k-nearest neighbors model and requires no additional training. In this paper, we explore the importance of lexical and semantic matching in the context of items retrieved by kNN-LM. We find two trends: (1) the presence of large overlapping n-grams between the datastore and evaluation set plays an important factor in strong performance, even when the datastore is derived from the training data; and (2) the kNN-LM is most beneficial when retrieved items have high semantic similarity with the query. Based on our analysis, we define a new formulation of the kNN-LM that uses retrieval quality to assign the interpolation coefficient. We empirically measure the effectiveness of our approach on two English language modeling datasets, Wikitext-103 and PG-19. Our re-formulation of the kNN-LM is beneficial in both cases, and leads to nearly 4% improvement in perplexity on the Wikitext-103 test set.", "track": "Language Modeling and Analysis of Language Models", "label": 2, "url": ""}, {"loc": [4.174302577972412, 7.114230632781982], "id": 1889, "title": "StuBot: Learning by Teaching a Conversational Agent Through Machine Reading Comprehension", "authors": "Nayoung Jin and Hana Lee", "abstract": "This paper proposes StuBot, a text-based conversational agent that provides adaptive feedback for learning by teaching. StuBot first asks the users to teach the learning content by summarizing and explaining it in their own words. After the users inputted the explanation text for teaching, StuBot uses a machine reading comprehension (MRC) engine to provide adaptive feedback with further questions about the insufficient parts of the explanation text. We conducted a within-subject study to evaluate the effectiveness of adaptive feedback by StuBot. Both the quantitative and qualitative results showed that learning by teaching with adaptive feedback can improve learning performance, immersion, and overall experience.", "track": "NLP Applications", "label": 0, "url": ""}, {"loc": [8.0657958984375, 5.7072038650512695], "id": 1893, "title": "Improved Universal Sentence Embeddings with Prompt-based Contrastive Learning and Energy-based Learning", "authors": "Yuxin Jiang, Linhan Zhang and Wei Wang", "abstract": "Contrastive learning has been demonstrated to be effective in enhancing pre-trained language models (PLMs) to derive superior universal sentence embeddings. However, existing contrastive methods still have two limitations. Firstly, previous works may acquire poor performance under domain shift settings, thus hindering the application of sentence representations in practice. We attribute this low performance to the over-parameterization of PLMs with millions of parameters. To alleviate it, we propose PromCSE (Prompt-based Contrastive Learning for Sentence Embeddings), which only trains small-scale Soft Prompt (i.e., a set of trainable vectors) while keeping PLMs fixed. Secondly, the commonly used NT-Xent loss function of contrastive learning does not fully exploit hard negatives in supervised learning settings. To this end, we propose to integrate an Energy-based Hinge loss to enhance the pairwise discriminative power, inspired by the connection between the NT-Xent loss and the Energy-based Learning paradigm. Empirical results on seven standard semantic textual similarity (STS) tasks and a domain-shifted STS task both show the effectiveness of our method compared with the current state-of-the-art sentence embedding models.", "track": "Semantics: Lexical, Sentence level, Textual Inference and Other areas", "label": 8, "url": "https://www.semanticscholar.org/reader/b6ae0600aaecf9c7501177fe5d99543b8e8b9823?experiments=&features=reader_skimming%3Atrue"}, {"loc": [5.753551483154297, 11.742570877075195], "id": 1907, "title": "RaP: Redundancy-aware Video-language Pre-training for Text-Video Retrieval", "authors": "Xing Wu, Chaochen Gao, Zijia Lin, Zhongyuan Wang, Jizhong Han and Songlin Hu", "abstract": "Video language pre-training methods have mainly adopted sparse sampling techniques to alleviate the temporal redundancy of videos. Though effective, sparse sampling still suffers inter-modal redundancy: visual redundancy and textual redundancy. Compared with highly generalized text, sparsely sampled frames usually contain text-independent portions, called visual redundancy. Sparse sampling is also likely to miss important frames corresponding to some text portions, resulting in textual redundancy. Inter-modal redundancy leads to a mismatch of video and text information, hindering the model from better learning the shared semantics across modalities. To alleviate it, we propose Redundancy-aware Video-language Pre-training. We design a redundancy measurement of video patches and text tokens by calculating the cross-modal minimum dis-similarity. Then, we penalize the high-redundant video patches and text tokens through a proposed redundancy-aware contrastive learning. We evaluate our method on four benchmark datasets, MSRVTT, MSVD, DiDeMo, and LSMDC, achieving a significant improvement over the previous state-of-the-art results.", "track": "Speech, Vision, Robotics, Multimodal Grounding", "label": 7, "url": "https://www.semanticscholar.org/reader/4aa9f132121c085441cb2bbb16f507d3a0f6327c?experiments=&features=reader_skimming%3Atrue"}, {"loc": [10.157038688659668, 7.585496425628662], "id": 1910, "title": "FCGCL: Fine- and Coarse-Granularity Contrastive Learning for Speech Translation", "authors": "Hao Zhang, Nianwen Si, Yaqi Chen, Zhen Li, Tong Niu, Xukui Yang and Dan Qu", "abstract": "It is notoriously difficult to implement end-to-end speech translation (E2E-ST) model because of the task complexity and data scarcity. Existing techniques often attempt to carry out implicit knowledge transfer from machine translation (MT) to ST model by imposing various constraints. However, in this transfer scenario, a significant problem is that the performance of the MT will drop significantly and the final transfer effect is also restricted. In this article, we recommend Fine and Coarse Granularity Contrastive Learning (FCGCL), which conduct explicit knowledge transfer from MT to ST model. Specially, we ensure through multi granularity contrastive learning that inputs with similar semantic between different modalities are encoded closely in the shared semantic space while inputs with different semantics are kept apart. Experiments on the MuST-C datasets on all 8 languages and further analysis show that our method can effectively improve the E2E-ST performance and achieves an average BLEU of 29.0.", "track": "Speech, Vision, Robotics, Multimodal Grounding", "label": 7, "url": ""}, {"loc": [7.992631912231445, 5.678435802459717], "id": 1917, "title": "InfoCSE: Information-aggregated Contrastive Learning of Sentence Embeddings", "authors": "Xing Wu, Chaochen Gao, Zijia Lin, Jizhong Han, Zhongyuan Wang and Songlin Hu", "abstract": "Contrastive learning has been extensively studied in sentence embedding learning, which assumes that the embeddings of different views of the same sentence are closer. The constraint brought by this assumption is weak, and a good sentence representation should also be able to reconstruct the original sentence fragments. Therefore, this paper proposes an information-aggregated contrastive learning framework for learning unsupervised sentence embeddings, termed InfoCSE.InfoCSE forces the representation of [CLS] positions to aggregate denser sentence information by introducing an additional Masked language model task and a well-designed network. We evaluate the proposed InfoCSE on several benchmark datasets w.r.t the semantic text similarity (STS) task. Experimental results show that InfoCSE outperforms SimCSE by an average Spearman correlation of 2.60% on BERT-base, and 1.77% on BERT-large, achieving state-of-the-art results among unsupervised sentence representation learning methods.", "track": "Semantics: Lexical, Sentence level, Textual Inference and Other areas", "label": 8, "url": "https://www.semanticscholar.org/reader/6e224434886c5cdeb4da4028702b32285cb4800f?experiments=&features=reader_skimming%3Atrue"}, {"loc": [6.453577041625977, 1.925446629524231], "id": 1929, "title": "Benchmarking Language Models for Code Syntax Understanding", "authors": "Da Shen, Xinyun Chen, Chenguang Wang, Koushik Sen and Dawn Song", "abstract": "Pre-trained language models have demonstrated impressive performance in both natural language processing and program understanding, which represent the input as a token sequence without explicitly modeling its structure. Some prior works show that pre-trained language models can capture the syntactic rules of natural languages without finetuning on syntax understanding tasks. However, there is limited understanding of how well pre-trained models understand the code structure so far. In this work, we perform the first thorough benchmarking of the state-of-the-art pre-trained models for identifying the syntactic structures of programs. Specifically, we introduce CodeSyntax, a large-scale dataset of programs annotated with the syntactic relationships in their corresponding abstract syntax trees. Our key observation is that pre-training on massive code data does not result in decent code syntax understanding. In fact, these pre-trained programming language models fail to match the performance of naive baselines based on positional offsets and keywords. \nWe also present a natural language benchmark to highlight the differences between natural languages and programming languages in terms of understanding corresponding syntactic structures. Our findings point out key limitations of existing pre-training methods and suggest the importance of modeling syntactic structures for the programming language.", "track": "Machine Learning for NLP", "label": 3, "url": "https://www.semanticscholar.org/reader/a593ce5d2a93f3113be7717d08d1ba8e62fd7ddf?experiments=&features=reader_skimming%3Atrue"}, {"loc": [3.8505043983459473, 7.242842674255371], "id": 1931, "title": "Learning When and What to Quote: A Quotation Recommender System with Mutual Promotion of Recommendation and Generation", "authors": "Lingzhi Wang, Xingshan Zeng and Kam-Fai Wong", "abstract": "This work extends the current quotation recommendation task to a more realistic quotation recommender system that learns to predict when to quote and what to quote jointly. The system consists of three modules (tasks), a prediction module to predict whether to quote given conversation contexts, a recommendation module to recommend suitable quotations and a generation module generating quotations or sentences in ordinary language to continue the conversation. We benchmark several competitive models for the two newly introduced tasks (i.e., when-to-quote and what-to-continue). For quotation recommendation, compared with previous work that is either generation-based or ranking-based recommendation, we propose a novel framework with mutual promotion of generation module and ranking-based recommendation module. Experiments show that our framework achieves significantly better performance than baselines on two datasets. Further experiments and analyses validate the effectiveness of the proposed mechanisms and get a better understanding of the quotation recommendation task.", "track": "NLP Applications", "label": 0, "url": ""}, {"loc": [5.124294281005859, 12.127364158630371], "id": 1933, "title": "Think Beyond Words: Exploring Context-Relevant Visual Commonsense for Diverse Dialogue Generation", "authors": "Yiting Liu, Liang Li, Beichen Zhang and Qingming Huang", "abstract": "Commonsense knowledge has been widely considered for building intelligent open-domain dialogue agents, aiming to generate meaningful and diverse responses. Previous works in this field usually lack the ability to effectively obtain and utilize auxiliary commonsense from the external visual world. In this paper, we argue that exploiting logical information in images related to context can be effective to enrich and steer the generation process. In view of this, we propose VICTOR, a context-relevant VIsual Commonsense enhanced dialogue generaTOR for generating coherent and informative responses. To obtain the associated visual commonsense, we devise a novel approach that expands topic words on the knowledge graph and maps them into daily scenarios. During the generation, the model adopts multimodal fusion mechanism to integrate visual and textual information, and adaptively combine their decoding distributions for better response generation. The experimental results on two public datasets show that our proposed method outperforms the latest competitive methods in terms of coherence and diversity.", "track": "Dialogue and Interactive Systems", "label": 4, "url": ""}, {"loc": [6.447525978088379, 5.617816925048828], "id": 1938, "title": "Gender Bias in Meta-Embeddings", "authors": "Masahiro Kaneko, Danushka Bollegala and Naoaki Okazaki", "abstract": "Different methods have been proposed to develop meta-embeddings from a given set of source embeddings. \nHowever, the source embeddings can contain unfair gender-related biases, and how these influence the meta-embeddings has not been studied yet.\nWe study the gender bias in meta-embeddings created under three different settings:\n(1) meta-embedding multiple sources without performing any debiasing (Multi-Source No-Debiasing),\n(2) meta-embedding multiple sources debiased by a single method (Multi-Source Single-Debiasing), and\n(3) meta-embedding a single source debiased by different methods (Single-Source Multi-Debiasing).\nOur experimental results show that meta-embedding amplifies the gender biases compared to input source embeddings.\nWe find that debiasing not only the sources but also their meta-embedding is needed to mitigate those biases.\nMoreover, we propose a novel debiasing method based on meta-embedding learning where we use multiple debiasing methods on a single source embedding and then create a single unbiased meta-embedding.", "track": "Ethics", "label": 21, "url": "https://www.semanticscholar.org/reader/2b145c1eec51ae2d8cf95361cddfa784b7a80e59?experiments=&features=reader_skimming%3Atrue"}, {"loc": [9.622785568237305, 6.466322898864746], "id": 1941, "title": "Third-Party Aligner for Neural Word Alignments", "authors": "Jinpeng Zhang, Chuanqi Dong, Xiangyu Duan, Yuqi Zhang and Min Zhang", "abstract": "Word alignment is to find translationally equivalent words between source and target sentences. Previous work has demonstrated that self-training can achieve competitive word alignment results. In this paper, we propose to use word alignments generated by a third-party word aligner to supervise the neural word alignment training. Specifically, source word and target word of each word pair aligned by the third-party aligner are trained to be close neighbors to each other in the contextualized embedding space when fine-tuning a pre-trained cross-lingual language model. Experiments on the benchmarks of various language pairs show that our approach can surprisingly do self-correction over the third-party supervision by finding more accurate word alignments and deleting wrong word alignments, leading to better performance than various third-party word aligners, including the currently best one. When we integrate all supervisions from various third-party aligners, we achieve state-of-the-art word alignment performances, with averagely more than two points lower alignment error rates than the best third-party aligner.We released our code at https://github.com/sdongchuanqi/Third-Party-Supervised-Aligner.", "track": "Multilinguality", "label": 13, "url": "https://www.semanticscholar.org/reader/766eced3fccccbc8c9fd3ad8ffb4350747dc5362?experiments=&features=reader_skimming%3Atrue"}, {"loc": [2.778637647628784, 4.7255377769470215], "id": 1966, "title": "QaDialMoE: Question-answering Dialogue based Fact Verification with Mixture of Experts", "authors": "Longzheng Wang, Peng Zhang, Xiaoyu Sean Lu, Lei Zhang, Chaoyang Yan and Chuang Zhang", "abstract": "Fact verification is an essential tool to mitigate the spread of false information online, which has gained a widespread attention recently. However, a fact verification in the question-answering dialogue is still underexplored. In this paper, we propose a neural network based approach called question-answering dialogue based fact verification with mixture of experts (QaDialMoE). It exploits questions and evidence effectively in the verification process and can significantly improve the performance of fact verification. Specifically, we exploit the mixture of experts to focus on various interactions among responses, questions and evidence. A manager with an attention guidance module is implemented to guide the training of experts and assign a reasonable attention score to each expert. A prompt module is developed to generate synthetic questions that make our approach more generalizable. Finally, we evaluate the QaDialMoE and conduct a comparative study on three benchmark datasets. The experimental results demonstrate that our QaDialMoE outperforms previous approaches by a large margin and achieves new state-of-the-art results on all benchmarks. This includes the accuracy improvements on the HEALTHVER as 84.26%, the FAVIQ A dev set as 78.7%, the FAVIQ R dev set as 86.1%, test set as 86.0%, and the COLLOQUIAL as 89.5%. To our best knowledge, this is the first work to investigate a question-answering dialogue based fact verification, and achieves new state-of-the-art results on various benchmark datasets.", "track": "Semantics: Lexical, Sentence level, Textual Inference and Other areas", "label": 8, "url": ""}, {"loc": [5.5833516120910645, 12.74416446685791], "id": 1970, "title": "Multimodal Knowledge Learning for Named Entity Disambiguation", "authors": "Zhang Dongjie and Longtao Huang", "abstract": "With the popularity of online social media, massive-scale multimodal information has brought new challenges to traditional Named Entity Disambiguation (NED) tasks. Recently, Multimodal Named Entity Disambiguation (MNED) has been proposed to link ambiguous mentions with the textual and visual contexts to a predefined knowledge graph. Existing attempts usually perform MNED by annotating multimodal mentions and adding multimodal features to traditional NED models. However, these studies may suffer from 1) failing to model multimodal information at the knowledge level, and 2) lacking multimodal annotation data against the large-scale unlabeled corpus. In this paper, we explore a pioneer study on leveraging multimodal knowledge learning to address the MNED task. Specifically, we first harvest multimodal knowledge in the Meta-Learning way, which is much easier than collecting ambiguous mention corpus. Then we design a knowledge-guided transfer learning strategy to extract unified representation from different modalities. Finally, we propose an Interactive Multimodal Learning Network (IMN) to fully utilize the multimodal information on both the mention and knowledge sides. Extensive experiments conducted on two public MNED datasets demonstrate that the proposed method achieves improvements over the state-of-the-art multimodal methods.", "track": "Speech, Vision, Robotics, Multimodal Grounding", "label": 7, "url": ""}, {"loc": [0.8930509090423584, 8.156498908996582], "id": 1977, "title": "Generative Prompt Tuning for Relation Classification", "authors": "Jiale Han, Shuai Zhao, Bo Cheng, shengkun ma and Wei Lu", "abstract": "Using prompts to explore the knowledge contained within pre-trained language models for downstream tasks has now become an active topic. Current prompt tuning methods mostly convert the downstream tasks to masked language modeling problems by adding cloze-style phrases and mapping all labels to verbalizations with fixed length, which has proven effective for tasks with simple label spaces. However, when applied to relation classification exhibiting complex label spaces, vanilla prompt tuning methods may struggle with label verbalizations with arbitrary lengths due to rigid prompt restrictions. Inspired by the text infilling task for pre-training generative models that can flexibly predict missing spans, we propose a novel generative prompt tuning method to reformulate relation classification as an infilling problem, which frees our approach from limitations of current prompt based approaches and thus fully exploits rich semantics of entity and relation types. In addition, we design entity-guided decoding and discriminative relation scoring to generate and align relations effectively and efficiently during inference. Extensive experiments under fully supervised settings and low-resource settings demonstrate the effectiveness of our approach.", "track": "Information Extraction", "label": 5, "url": "https://www.semanticscholar.org/reader/aedc11b5d0e3f7c4547b845e109afcd7bd14f1c4?experiments=&features=reader_skimming%3Atrue"}, {"loc": [1.7668083906173706, 8.903051376342773], "id": 1993, "title": "Formulating Few-shot Fine-tuning Towards Language Model Pre-training: A Pilot Study on Named Entity Recognition", "authors": "Zihan Wang, Kewen Zhao, Zilong Wang and Jingbo Shang", "abstract": "Fine-tuning pre-trained language models is a common practice in building NLP models for various tasks, including the case with less supervision. We argue that under the few-shot setting, formulating fine-tuning closer to the pre-training objective shall be able to unleash more benefits from the pre-trained language models. In this work, we take few-shot named entity recognition (NER) for a pilot study, where existing fine-tuning strategies are much different from pre-training. We propose a novel few-shot fine-tuning framework for NER, FFF-NER. Specifically, we introduce three new types of tokens, \"is-entity\", \"which-type\" and \"bracket\", so we can formulate the NER fine-tuning as (masked) token prediction or generation, depending on the choice of the pre-training objective. In our experiments, we apply \\our to fine-tune both BERT and BART for few-shot NER on several benchmark datasets and observe significant improvements over existing fine-tuning strategies, including sequence labeling, prototype meta-learning, and prompt-based approaches. We further perform a series of ablation studies, showing few-shot NER performance is strongly correlated with the similarity between fine-tuning and pre-training.", "track": "Unsupervised and Weakly-Supervised Methods in NLP", "label": 17, "url": ""}, {"loc": [4.570583343505859, 3.2198073863983154], "id": 1996, "title": "Masked Language Models Know Which are Popular: A Simple Ranking Strategy for Commonsense Question Answering", "authors": "Xuan Luo, Chuang Fan, Yice Zhang, Wanguo Jiang, Bing Qin and Ruifeng Xu", "abstract": "We propose a simple ranking strategy to solve a generative commonsense question answering (QA) problem. Compared with multiple-choice QA, it is challenging because the answers to a question are not unique and they are supposed to be popular and diverse. Our strategy exploits the dataset itself and negative samples that we collect from WordNet to train a ranker that picks out the most popular answers for commonsense questions. The effectiveness of our strategy is verified on different pre-trained masked language models (MLMs) in a pipeline framework, where an MLM reranks the generated answers. Further, we explore an end-to-end framework where MLMs are utilized to guide the generation of generative language models (GLMs). Taking advantage of reinforcement learning, we apply policy gradient to train a GLM with the rewards fed back by an MLM. Empirical results on ProtoQA dataset demonstrate that MLMs can acquire the ability to distinguish the popular answers and improve the typical answer generation of GLMs as well.", "track": "Question Answering", "label": 11, "url": ""}, {"loc": [4.109504222869873, 7.391895771026611], "id": 1998, "title": "DialogUSR: Complex Dialogue Utterance Splitting and Reformulation for Multiple Intent Detection", "authors": "Haoran Meng, Zheng Xin, Tianyu Liu, Zizhen Wang, he feng, Binghuai Lin, Xuemin Zhao, Yunbo Cao and Zhifang Sui", "abstract": "While interacting with chatbots, users may elicit multiple intents in a single dialogue utterance. Instead of training a dedicated multi-intent detection model, we propose DialogUSR, a dialogue utterance splitting and reformulation task that first splits multi-intent user query into several single-intent sub-queries and then recovers all the coreferred and omitted information in the sub-queries. DialogUSR can serve as a plug-in and domain-agnostic module that empowers the multi-intent detection for the deployed chatbots with minimal efforts. We collect a high-quality naturally occurring dataset that covers 23 domains with a multi-step crowd-souring procedure. To benchmark the proposed dataset, we propose multiple action-based generative models that involve end-to-end and two-stage training, and conduct in-depth analyses on the pros and cons of the proposed baselines.", "track": "Resources and Evaluation", "label": 1, "url": "https://www.semanticscholar.org/reader/7085ee996d58bb0b53dd2fc394144996d4b93d69?experiments=&features=reader_skimming%3Atrue"}, {"loc": [7.978288173675537, 9.156038284301758], "id": 2000, "title": "Low-resource Interactive Active Labeling for Fine-tuning Language Models", "authors": "Seiji Maekawa, Dan Zhang, Hannah Kim, Sajjadur Rahman and Estevam Hruschka", "abstract": "Recently, active learning (AL) methods have been used to effectively fine-tune pre-trained language models for various NLP tasks such as sentiment analysis and document classification. However, given the task of fine-tuning language models, understanding the impact of different aspects on AL methods such as labeling cost, sample acquisition latency, and the diversity of the datasets necessitates a deeper investigation. This paper examines the performance of existing AL methods within a low-resource, interactive labeling setting. We observe that existing methods often underperform in such a setting while exhibiting higher latency and a lack of generalizability. To overcome these challenges, we propose a novel active learning method TYROUGE that employs a hybrid sampling strategy to minimize labeling cost and acquisition latency while providing a framework for adapting to dataset diversity via user guidance. Through our experiments, we observe that compared to SOTA methods, TYROUGE reduces the labeling cost by up to 43% and the acquisition latency by as much as 11X, while achieving comparable accuracy. Finally, we discuss the strengths and weaknesses of TYROUGE by exploring the impact of dataset characteristics.", "track": "Interpretability, Interactivity and Analysis of Models for NLP", "label": 9, "url": ""}, {"loc": [8.165827751159668, 5.287082672119141], "id": 2005, "title": "Getting the Most out of Simile Recognition", "authors": "Xiaoyue Wang, Linfeng Song, Xin Liu, Chulun Zhou, Hualin Zeng and Jinsong Su", "abstract": "Simile recognition involves two subtasks: simile sentence classification that discriminates whether a sentence contains simile, and simile component extraction that locates the corresponding objects (i.e., tenors and vehicles).\nRecent work ignores features other than surface strings and suffers from the data hunger issue.\nWe explore expressive features for this task to help achieve more effective data utilization.\nIn particular, we study two types of features: 1) input-side features that include POS tags, dependency trees and word definitions, and 2) decoding features that capture the interdependence among various decoding decisions.\nWe further construct a model named HGSR, which merges the input-side features as a heterogeneous graph and leverages decoding features via distillation.\nExperiments show that HGSR significantly outperforms the current state-of-the-art systems and carefully designed baselines, verifying the effectiveness of introduced features. We will release our code upon paper acceptance.", "track": "Sentiment Analysis, Stylistic Analysis, and Argument Mining", "label": 16, "url": "https://www.semanticscholar.org/reader/45373297e00227e4559dc2e63a76021f4c8ab4fd?experiments=&features=reader_skimming%3Atrue"}, {"loc": [5.148991584777832, 8.765201568603516], "id": 2006, "title": "A Unified Framework for Pun Generation with Humor Principles", "authors": "Yufei Tian, Divyanshu Arun Sheth and Nanyun Peng", "abstract": "We propose a unified framework to generate both homophonic and homographic puns to resolve the split-up in existing works. Specifically, we incorporate three linguistic attributes of puns to the language models: ambiguity, distinctiveness, and surprise. Our framework consists of three parts: 1) a context words/phrases selector to promote the aforementioned attributes, 2) a generation model trained on non-pun sentences to incorporate the context words/phrases into the generation output, and 3) a label predictor that learns the structure of puns which is used to steer the generation model at inference time. \nEvaluation results on both pun types demonstrate the efficacy of our model over strong baselines.", "track": "Natural Language Generation", "label": 6, "url": "https://www.semanticscholar.org/reader/af2ecdbd0252c8815512382dbab8b3fb47178d48?experiments=&features=reader_skimming%3Atrue"}, {"loc": [9.56695556640625, 6.545870780944824], "id": 2007, "title": "Improving English-Arabic Transliteration with Phonemic Memories", "authors": "Yuanhe Tian, Renze Lou, Xiangyu Pang, Lianxi Wang, Shengyi JIANG and Yan Song", "abstract": "Transliteration is an important task in natural language processing (NLP) which aims to convert a name in the source language to the target language without changing its pronunciation. Particularly, transliteration from English to Arabic is highly needed in many applications, especially in countries (e.g., United Arab Emirates (UAE)) whose most citizens are foreigners but the official language is Arabic. In such a task-oriented scenario, namely transliterating the English names to the corresponding Arabic ones, the performance of the transliteration model is highly important. However, most existing neural approaches mainly apply a universal transliteration model with advanced encoders and decoders to the task, where limited attention is paid to leveraging the phonemic association between English and Arabic to further improve model performance. In this paper, we focus on transliteration of people's names from English to Arabic for the general public. In doing so, we collect a corpus named EANames by extracting high quality name pairs from online resources which better represent the names in the general public than linked Wikipedia entries that are always names of famous people). We propose a model for English-Arabic transliteration, where a memory module modeling the phonemic association between English and Arabic is used to guide the transliteration process. We run experiments on the collected data and the results demonstrate the effectiveness of our approach for English-Arabic transliteration.", "track": "Machine Translation", "label": 10, "url": ""}, {"loc": [4.154089450836182, 7.382443904876709], "id": 2054, "title": "Mix-and-Match: Scalable Dialog Response Retrieval using Gaussian Mixture Embeddings", "authors": "Gaurav Pandey, Danish Contractor and Sachindra Joshi", "abstract": "Embedding-based approaches for dialog response retrieval embed the context-response pairs as points in the embedding space. These approaches are scalable, but fail to account for the complex, many-to-many relationships that exist between context-response pairs. \nOn the other end of the spectrum, there are approaches that feed the context-response pairs jointly through multiple layers of neural networks. These approaches can model the complex relationships between context-response pairs, but fail to scale when the set of responses is moderately large (>1000). \nIn this paper, we propose a scalable model that can learn complex relationships between context-response pairs. Specifically, the model maps the contexts as well as responses to probability distributions over the embedding space. We train the models by optimizing the Kullback-Leibler divergence between the distributions induced by context-response pairs in the training data. We show that the resultant model achieves better performance as compared to other embedding-based approaches on publicly available conversation data.", "track": "Dialogue and Interactive Systems", "label": 4, "url": "https://www.semanticscholar.org/reader/8708ffb9e983fad5455761db107104224cedb0af?experiments=&features=reader_skimming%3Atrue"}, {"loc": [8.802298545837402, 8.294027328491211], "id": 2074, "title": "AlphaTuning: Quantization-Aware Parameter-Efficient Adaptation of Large-Scale Pre-Trained Language Models", "authors": "Se Jung Kwon, Jeonghoon Kim, Jeongin Bae, Kang Min Yoo, Jin-Hwa Kim, Baeseong Park, Byeongwook Kim, Jung-Woo Ha, Nako Sung and Dongsoo Lee", "abstract": "There are growing interests in adapting large-scale language models using parameter-efficient fine-tuning methods. However, accelerating the model itself and achieving better inference efficiency through model compression has not been thoroughly explored yet.\nModel compression could provide the benefits of reducing memory footprints, enabling low-precision computations, and ultimately achieving cost-effective inference.\nTo combine parameter-efficient adaptation and model compression, we propose AlphaTuning consisting of post-training quantization of the pre-trained language model and fine-tuning only some parts of quantized parameters for a target task.\nSpecifically, AlphaTuning works by employing binary-coding quantization, which factorizes the full-precision parameters into binary parameters and a separate set of scaling factors.\nDuring the adaptation phase, the binary values are frozen for all tasks, while the scaling factors are fine-tuned for the downstream task.\nWe demonstrate that AlphaTuning, when applied to GPT-2 and OPT, performs competitively with full fine-tuning on a variety of downstream tasks while achieving >10x compression ratio under 4-bit quantization and >1,000x reduction in the number of trainable parameters.", "track": "Efficient Methods for NLP", "label": 12, "url": "https://www.semanticscholar.org/reader/dcff38de0e5fb47bdb31d472c21b0c2d88cbc4fc?experiments=&features=reader_skimming%3Atrue"}, {"loc": [3.3662941455841064, 4.050569534301758], "id": 2086, "title": "Learning Invariant Representation Improves Robustness for MRC Models", "authors": "Hai Yu, Liang Wen, Haoran Meng, Tianyu Liu and Houfeng Wang", "abstract": "The prosperity of Pretrained Language Models(PLM) has greatly promoted the development of Machine Reading Comprehension (MRC). However, these models are vulnerable and not robust to adversarial examples. In this paper, we propose Stable and Contrastive Question Answering (SCQA) to improve invariance of representation to alleviate these robustness issues. Specifically, we first construct positive example pairs which have same answer through data augmentation. Then SCQA learns enhanced representations with better alignment between positive pairs by introducing stability and contrastive loss. Experimental results show that our approach can boost the robustness of QA models cross different MRC tasks and attack sets significantly and consistently.", "track": "Question Answering", "label": 11, "url": ""}, {"loc": [5.430537700653076, 5.07767391204834], "id": 2097, "title": "ER-Test: Evaluating Explanation Regularization Methods for Language Models", "authors": "Brihi Joshi, Aaron Z. Chan, Ziyi Liu, Shaoliang Nie, Maziar Sanjabi, Hamed Firooz and Xiang Ren", "abstract": "By explaining how humans would solve a given task, human rationales can provide strong learning signal for neural language models (NLMs). Explanation regularization (ER) aims to improve NLM generalization by pushing the NLM's machine rationales (Which input tokens did the NLM focus on?) to align with human rationales (Which input tokens would humans focus on). Though prior works primarily study ER via in-distribution (ID) evaluation, out-of-distribution (OOD) generalization is often more critical in real-world scenarios, yet ER's effect on OOD generalization has been underexplored.\n\nIn this paper, we introduce ER-Test, a framework for evaluating ER models' OOD generalization along three dimensions: unseen datasets, contrast set tests, and functional tests. Using ER-Test, we comprehensively analyze how ER models' OOD generalization varies with the rationale alignment criterion (loss function), human rationale type (instance-level v/s task-level), number and choice of rationale-annotated instances, and time budget for rationale annotation. Across two tasks and six datasets, we show that ER has little impact on ID performance but yields large OOD performance gains, with the best ER criterion being task-dependent. Also, ER can improve OOD performance even with task-level or few human rationales. Finally, we find that rationale annotation is more time-efficient than label annotation for improving OOD performance. Our results with ER-Test help demonstrate ER's utility and establish best practices for using ER effectively.", "track": "Interpretability, Interactivity and Analysis of Models for NLP", "label": 9, "url": "https://www.semanticscholar.org/reader/506f4614f2be3b02984a1b293553ce07d18b38bb?experiments=&features=reader_skimming%3Atrue"}, {"loc": [1.0935375690460205, 10.570944786071777], "id": 2108, "title": "Learning Cooperative Interactions for Multi-Overlap Aspect Sentiment Triplet Extraction", "authors": "Shiman Zhao, Wei Chen and Tengjiao Wang", "abstract": "Aspect sentiment triplet extraction (ASTE) is an essential task, which aims to extract triplets\n(aspect, opinion, sentiment). However, overlapped triplets, especially multi-overlap triplets,\nmake ASTE a challenge. Most existing methods suffer from multi-overlap triplets because\nthey focus on the single interactions between an aspect and an opinion. To solve the above\nissues, we propose a novel multi-overlap triplet extraction method, which decodes the complex\nrelations between multiple aspects and opinions by learning their cooperative interactions. Overall, the method is based on an encoder-decoder architecture. During decoding, we design a\njoint decoding mechanism, which employs a multi-channel strategy to generate aspects and\nopinions through the cooperative interactions between them jointly. Furthermore, we construct\na correlation-enhanced network to reinforce the interactions between related aspects\nand opinions for sentiment prediction. Besides, a relation-wise calibration scheme is adopted\nto further improve performance. Experiments show that our method outperforms baselines,\nespecially multi-overlap triplets.", "track": "Machine Learning for NLP", "label": 3, "url": ""}, {"loc": [8.797540664672852, 8.396204948425293], "id": 2111, "title": "Different Tunes Played with Equal Skill: Exploring a Unified Optimization Subspace for Parameter-Efficient Tuning", "authors": "Jing Yi, Weize Chen, Yujia Qin, Yankai Lin, Ning Ding, Xu Han, Zhiyuan Liu, Maosong Sun and Jie Zhou", "abstract": "Delta tuning (DET, also known as parameter-efficient tuning) is deemed as the new paradigm for using pre-trained language models (PLMs). Up to now, various DETs with distinct design elements have been proposed, achieving performance on par with fine-tuning. However, the mechanisms behind the above success are still under-explored, especially the connections among various DETs. To fathom the mystery, we hypothesize that the adaptations of different DETs could all be reparameterized as low-dimensional optimizations in a unified optimization subspace, which could be found by jointly decomposing independent solutions of different DETs. Then we explore the connections among different DETs by conducting optimization within the subspace. In experiments, we find that, for a certain DET, conducting optimization simply in the subspace could achieve comparable performance to its original space, and the found solution in the subspace could be transferred to another DET and achieve non-trivial performance. We also visualize the performance landscape of the subspace, and find that, there exists a substantial region where different DETs all perform well. Finally, we extend our analysis and show the strong connections between fine-tuning and DETs. The codes are publicly available at https://github.com/thunlp/Unified-DeltaTuning.", "track": "Efficient Methods for NLP", "label": 12, "url": "https://www.semanticscholar.org/reader/d130837a5601f4f82380736897d07f3008de1fa4?experiments=&features=reader_skimming%3Atrue"}, {"loc": [6.896711826324463, 9.583019256591797], "id": 2113, "title": "Explainable Slot Type Attentions to Improve Joint Intent Detection and Slot Filling", "authors": "Kalpa Gunaratna, Vijay Srinivasan, Akhila Yerukola and Hongxia Jin", "abstract": "Joint intent detection and slot filling is a key research topic in natural language understanding (NLU). Existing joint intent and slot filling systems analyze and compute features collectively for all slot types, and importantly, have no way to explain the slot filling model decisions. In this work, we propose a novel approach that: (i) learns to generate additional slot type specific features in order to improve accuracy and (ii) provides explanations for slot filling decisions for the first time in a joint NLU model. We perform an additional constrained supervision using a set of binary classifiers for the slot type specific feature learning, thus ensuring appropriate attention weights are learned in the process to explain slot filling decisions for utterances. Our model is inherently explainable and does not need any post-hoc processing. We evaluate our approach on two widely used datasets and show accuracy improvements. Moreover, a detailed analysis is also provided for the exclusive slot explainability.", "track": "Machine Learning for NLP", "label": 3, "url": "https://www.semanticscholar.org/reader/f48543f11a1235a5ca0383ce1d191e5acb9f62a3?experiments=&features=reader_skimming%3Atrue"}, {"loc": [4.861375331878662, 3.2929584980010986], "id": 2138, "title": "PseudoReasoner: Leveraging Pseudo Labels for Commonsense Knowledge Base Population", "authors": "Tianqing Fang, Quyet V. Do, Hongming Zhang, Yangqiu Song, Ginny Y. Wong and Simon See", "abstract": "Commonsense Knowledge Base (CSKB) Population aims at reasoning over unseen entities and assertions on CSKBs, and is an important yet hard commonsense reasoning task. One challenge is that it requires out-of-domain generalization ability as the source CSKB for training is of a relatively smaller scale (1M) while the whole candidate space for population is way larger (200M). We propose PseudoReasoner, a semi-supervised learning framework for CSKB population that uses a teacher model pre-trained on CSKBs to provide pseudo labels on the unlabeled candidate dataset for a student model to learn from. \nThe teacher can be a generative model rather than restricted to discriminative models as previous works.\nIn addition, we design a new filtering procedure for pseudo labels based on influence function and the student model's prediction to further improve the performance. The framework can improve the backbone model KG-BERT (RoBERTa-large) by 3.3 points on the overall performance and especially, 5.3 points on the out-of-domain performance, and achieves the state-of-the-art. The codes will be made public on acceptance. Codes and data are available at https://github.com/HKUST-KnowComp/PseudoReasoner.", "track": "Commonsense Reasoning", "label": 19, "url": "https://www.semanticscholar.org/reader/ffa3ed87563fad0369078314d329cc3d59001ac7?experiments=&features=reader_skimming%3Atrue"}, {"loc": [4.071962356567383, 7.363285064697266], "id": 2150, "title": "History-Aware Hierarchical Transformer for Multi-session Open-domain Dialogue System", "authors": "Tong Zhang, Yong Liu, Boyang Li, Zhiwei Zeng, Pengwei Wang, Yuan You, Chunyan Miao and Lizhen Cui", "abstract": "With the evolution of pre-trained language models, current open-domain dialogue systems have achieved great progress in conducting one-session conversations. In contrast, Multi-Session Conversation (MSC), which consists of multiple sessions over a long term with the same user, is under-investigated. In this paper, we propose History-Aware Hierarchical Transformer (HAHT) for multi-session open-domain dialogue. HAHT maintains a long-term memory of history conversations and utilizes history information to understand current conversation context and generate well-informed and context-relevant responses. Specifically, HAHT first encodes history conversation sessions hierarchically into a history memory. Then, HAHT leverages historical information to facilitate the understanding of the current conversation context by encoding the history memory together with the current context with attention-based mechanisms. Finally, to explicitly utilize historical information, HAHT uses a history-aware response generator that switches between a generic vocabulary and a history-aware vocabulary. Experimental results on a large-scale MSC dataset suggest that the proposed HAHT model consistently outperforms baseline models. Human evaluation results support that HAHT generates more human-like, context-relevant, and history-relevant responses than baseline models.", "track": "Dialogue and Interactive Systems", "label": 4, "url": ""}, {"loc": [3.646893262863159, 8.082352638244629], "id": 2161, "title": "Guiding Abstractive Dialogue Summarization with Content Planning", "authors": "Ye Wang, Xiaojun Wan and Zhiping Cai", "abstract": "Abstractive dialogue summarization has recently been receiving more attention. We propose a coarse-to-fine model for generating abstractive dialogue summaries, and introduce a fact-aware reinforcement learning (RL) objective that improves the fact consistency between the dialogue and the generated summary. Initially, the model generates the predicate-argument spans of the dialogue, and then generates the final summary through a fact-aware RL objective. Extensive experiments and analysis on two benchmark datasets demonstrate that our proposed method effectively improves the quality of the generated summary, especially in coherence and consistency.", "track": "Summarization", "label": 14, "url": ""}, {"loc": [6.202732563018799, 8.767577171325684], "id": 2181, "title": "Truncation Sampling as Language Model Desmoothing", "authors": "John Hewitt, Christopher Manning and Percy Liang", "abstract": "Long samples of text from neural language models can be of poor quality. Truncation sampling algorithms--like top-p  or top-k---address this by setting some words' probabilities to zero at each step. This work investigates why these methods are important, and how to improve them. We propose thinking of a neural language model as a mixture of a true distribution and a smoothing distribution that avoids infinite perplexity. In this light, truncation algorithms aim to perform desmoothing, estimating a subset of the support of the true distribution. Finding a good subset is crucial: we show that top-p unnecessarily truncates high-probability words, for example causing it to truncate all words but Trump for a document that starts with Donald. We introduce eta-sampling, which truncates words below an entropy-dependent probability threshold. Compared to previous algorithms, our eta-sampling generates more plausible long documents according to humans, is better at breaking out of repetition, and behaves more reasonably on a battery of test distributions.", "track": "Natural Language Generation", "label": 6, "url": "https://www.semanticscholar.org/reader/21f0b7d4d4163e7a06fb420599b586958e9168a3?experiments=&features=reader_skimming%3Atrue"}, {"loc": [4.565167427062988, 7.698232173919678], "id": 2193, "title": "Knowledge-grounded Dialog State Tracking", "authors": "Dian Yu, Mingqiu Wang, Yuan Cao, Laurent El Shafey, Izhak Shafran and Hagen Soltau", "abstract": "Knowledge (including structured knowledge such as schema and ontology and unstructured knowledge such as web corpus) is a critical part of dialog understanding, especially for unseen tasks and domains. Traditionally, such domain-specific knowledge is encoded implicitly into model parameters for the execution of downstream tasks, which makes training inefficient. In addition , such models are not easily transferable to new tasks with different schemas. In this work, we propose to perform dialog state tracking grounded on knowledge encoded externally. We query relevant knowledge of various forms based on the dialog context where such information can grounds the prediction of dialog states. We demonstrate superior performance of our proposed method over strong baselines, especially in the few-shot learning setting.", "track": "Dialogue and Interactive Systems", "label": 4, "url": "https://www.semanticscholar.org/reader/c1614ab718dad97018ee34fd57864bb58b6ecaba?experiments=&features=reader_skimming%3Atrue"}, {"loc": [5.959856033325195, 5.61455774307251], "id": 2200, "title": "Context-aware Information-theoretic Causal De-biasing for Interactive Sequence Labeling", "authors": "Junda Wu, Rui Wang, Tong Yu, Ruiyi Zhang, Handong Zhao, Shuai Li, Ricardo Henao and Ani Nenkova", "abstract": "Supervised training of existing deep learning models for sequence labeling relies on large scale labeled datasets. Such datasets are generally created with crowd-source labeling. However, crowd-source labeling for tasks of sequence labeling can be expensive and time-consuming. Further, crowd-source labeling by external annotators may not be appropriate for data that contains user private information. Considering the above limitations of crowd-source labeling, we study interactive sequence labeling that allows training directly with the user feedback, which alleviates the annotation cost and maintains the user privacy. We identify two bias, namely, context bias and feedback bias, by formulating interactive sequence labeling via a Structural Causal Model (SCM). To alleviate the context and feedback bias based on the SCM, we identify the frequent context tokens as confounders in the backdoor adjustment and further propose an entropy-based modulation that is inspired by information theory. entities more sample-efficiently. With extensive experiments, we validate that our approach can effectively alleviate the biases and our models can be efficiently learnt  with the user feedback.", "track": "Machine Learning for NLP", "label": 3, "url": ""}, {"loc": [4.773019790649414, 4.5846757888793945], "id": 2201, "title": "Simple but Challenging: Natural Language Inference Models Fail on Simple Sentences", "authors": "Cheng Luo, Wei Liu, Jieyu Lin, Jiajie Zou, Ming Xiang and Nai Ding", "abstract": "Natural language inference (NLI) is a task to infer the relationship between a premise and a hypothesis (e.g., entailment, neutral, or contradiction), and transformer-based models perform well on current NLI datasets such as MNLI and SNLI. Nevertheless, given the linguistic complexity of the large-scale datasets, it remains controversial whether these models can truly infer the relationship between sentences or they simply guess the answer via shallow heuristics. Here, we introduce a controlled evaluation set called Simple Pair to test the basic sentence inference ability of NLI models using sentences with syntactically simple structures. Three popular transformer-based models, i.e., BERT, RoBERTa, and DeBERTa, are employed. We find that these models fine-tuned on MNLI or SNLI perform very poorly on Simple Pair (< 35.4% accuracy). Further analyses reveal event coreference and compositional binding problems in these models. To improve the model performance, we augment the training set, i.e., MNLI or SNLI, with a few examples constructed based on Simple Pair (~ 1% of the size of the original SNLI/MNLI training sets). Models fine-tuned on the augmented training set maintain high performance on MNLI/SNLI and perform very well on Simple Pair (~100% accuracy). Furthermore, the positive performance of the augmented training models can transfer to more complex examples constructed based on sentences from MNLI and SNLI. Taken together, the current work shows that (1) models achieving high accuracy on mainstream large-scale datasets still lack the capacity to draw accurate inferences on simple sentences, and (2) augmenting mainstream datasets with a small number of target simple sentences can effectively improve model performance.", "track": "Semantics: Lexical, Sentence level, Textual Inference and Other areas", "label": 8, "url": ""}, {"loc": [0.7555455565452576, 8.09090805053711], "id": 2210, "title": "DORE: Document Ordered Relation Extraction based on Generative Framework", "authors": "Qipeng Guo, Yuqing Yang, Hang Yan, Xipeng Qiu and Zheng Zhang", "abstract": "In recent years, there is a surge of generation-based information extraction work, which allows a more direct use of pre-trained language models and efficiently captures output dependencies. However, previous generative methods using lexical representation do not naturally fit document-level relation extraction (DocRE) where there are multiple entities and relational facts. In this paper, we investigate the root cause of the underwhelming performance of the existing generative DocRE models and discover that the culprit is the inadequacy of the training paradigm, instead of the capacities of the models. We propose to generate a symbolic and ordered sequence from the relation matrix which is deterministic and easier for model to learn. Moreover, we design a parallel row generation method to process overlong target sequences. Besides, we introduce several negative sampling strategies to improve the performance with balanced signals. Experimental results on four datasets show that our proposed method can improve the performance of the generative DocRE models.", "track": "Information Extraction", "label": 5, "url": ""}, {"loc": [2.412846565246582, 7.310841083526611], "id": 2214, "title": "Explicit Role Interaction Network for Event Argument Extraction", "authors": "Nan Ding, Chunming Hu, Kai Sun, Samuel Mensah and Richong Zhang", "abstract": "Event argument extraction is a challenging subtask of event extraction, aiming to identify and assign roles to arguments under a certain event. Existing methods extract arguments of each role independently, ignoring the relationship between different roles. Such an approach hinders the model from learning explicit interactions between different roles to improve the performance of individual argument extraction. As a solution, we design a neural model that we refer to as the Explicit Role Interaction Network (ERIN) which allows for dynamically capturing the correlations between different argument roles within an event. Extensive experiments on the benchmark dataset ACE2005 demonstrate the superiority of our proposed model to existing approaches.", "track": "Information Extraction", "label": 5, "url": ""}, {"loc": [7.91349458694458, 9.392195701599121], "id": 2218, "title": "Few-Shot Out-of-Domain Transfer Learning of Natural Language Explanations in a Label-Abundant Setup", "authors": "Yordan Yordanov, Vid Kocijan, Thomas Lukasiewicz and Oana-Maria Camburu", "abstract": "Training a model to provide natural language explanations (NLEs) for its predictions usually requires the acquisition of task-specific NLEs, which is time- and resource-consuming. A potential solution is the few-shot out-of-domain transfer of NLEs from a parent task with many NLEs to a child task.\nIn this work, we examine the setup in which the child task has few NLEs but abundant labels. We establish four few-shot transfer learning methods that cover the possible fine-tuning combinations of the labels and NLEs for the parent and child tasks. We transfer explainability from a large natural language inference dataset (e-SNLI) separately to two child tasks: (1) hard cases of pronoun resolution, where we introduce the small-e-WinoGrande dataset of NLEs on top of the WinoGrande dataset, and (2)~commonsense validation (ComVE). Our results demonstrate that the parent task helps with NLE generation and we establish the best methods for this setup.", "track": "Interpretability, Interactivity and Analysis of Models for NLP", "label": 9, "url": ""}, {"loc": [7.707474231719971, 3.559474229812622], "id": 2238, "title": "RoChBert: Towards Robust BERT Fine-tuning for Chinese", "authors": "Zihan Zhang, Jinfeng Li, Ning Shi, Bo Yuan, Xiangyu Liu, Rong Zhang, hui xue, DONGHONG SUN and Chao Zhang", "abstract": "Despite of the superb performance on a wide range of tasks, pre-trained language models (e.g., BERT) have been proved vulnerable to adversarial texts. In this paper, we present RoChBERT, a framework to build more Robust BERT-based models by utilizing a more comprehensive adversarial graph to fuse Chinese phonetic and glyph features into pre-trained representations during fine-tuning. Inspired by curriculum learning, we further propose to augment the training dataset with adversarial texts in combination with intermediate samples. Extensive experiments demonstrate that RoChBERT outperforms previous methods in significant ways: (i) robust -- RoChBERT greatly improves the model robustness without sacrificing accuracy on benign texts. Specifically, the defense lowers the success rates of unlimited and limited attacks by 59.43% and 39.33% respectively, while remaining accuracy of 93.30%; (ii) flexible -- RoChBERT can easily extend to various language models to solve different downstream tasks with excellent performance; and (iii) efficient -- RoChBERT can be directly applied to the fine-tuning stage without pre-training language model from scratch, and the proposed data augmentation method is also low-cost.", "track": "Language Modeling and Analysis of Language Models", "label": 2, "url": ""}, {"loc": [7.198788642883301, 5.789646625518799], "id": 2246, "title": "Lexical Entailment with Hierarchy Representations by Deep Metric Learning", "authors": "Naomi Sato, Masaru Isonuma, Kimitaka Asatani, Shoya Ishizuka, Aori Shimizu and Ichiro Sakata", "abstract": "In this paper, we introduce a novel method for lexical entailment tasks, which detects a hyponym-hypernym relation among words. Existing lexical entailment studies are lacking in generalization performance, as they cannot be applied to words that are not included in the training dataset. Moreover, existing work evaluates the performance by using the dataset that contains words used for training. This study proposes a method that learns a mapping from word embeddings to the hierarchical embeddings in order to predict the hypernymy relations of any input words. To validate the generalization performance, we conduct experiments using a train dataset that does not overlap with the evaluation dataset. As a result, our method achieved state-of-the-art performance and showed robustness for unknown words.", "track": "Semantics: Lexical, Sentence level, Textual Inference and Other areas", "label": 8, "url": ""}, {"loc": [8.045004844665527, 8.828048706054688], "id": 2248, "title": "Improving the Sample Efficiency of Prompt Tuning with Domain Adaptation", "authors": "Xu Guo, Boyang Li and Han Yu", "abstract": "Prompt tuning, or the conditioning of a frozen pretrained language model (PLM) with soft prompts learned from data, has demonstrated impressive performance on a wide range of NLP tasks. However, prompt tuning requires a large training dataset to be effective and is outperformed by finetuning the entire PLM in data-scarce regimes. Previous work  (Gu et al., 2022, Vu et al., 2022) proposed to transfer soft prompts pretrained on the source domain to the target domain. In this paper, we explore domain adaptation for prompt tuning, a problem setting where unlabeled data from the target domain are available during pretraining. We propose bOosting Prompt TunIng with doMain Adaptation (OPTIMA), which regularizes the decision boundary to be smooth around regions where source and target data distributions are similar. Extensive experiments demonstrate that OPTIMA significantly enhances the transferability and sample-efficiency of prompt tuning compared to strong baselines. Moreover, in few-shot settings, OPTIMA exceeds full-model tuning by a large margin.", "track": "Efficient Methods for NLP", "label": 12, "url": "https://www.semanticscholar.org/reader/26d923d95e6d09b8ab493c3741d97d128135352f?experiments=&features=reader_skimming%3Atrue"}, {"loc": [7.98429536819458, 5.755064010620117], "id": 2261, "title": "McPhraSy: Multi-Context Phrase Similarity and Clustering", "authors": "Amir Cohen, Hila Gonen, Ori Shapira, Ran Levy and Yoav Goldberg", "abstract": "Phrase similarity is a key component of many NLP applications. Current phrase similarity methods focus on embedding the phrase itself and use the phrase context only during training of the pretrained model. To better leverage the information in the context, we propose McPhraSy (Multi-context Phrase Similarity), a novel algorithm for estimating the similarity of phrases based on multiple contexts. At inference time, McPhraSy represents each phrase by considering multiple contexts in which it appears and computes the similarity of two phrases by aggregating the pairwise similarities between the contexts of the phrases. Incorporating context during inference enables McPhraSy to outperform current state-of-the-art models on two phrase similarity datasets by up to 13.3%. Finally, we also present a new downstream task that relies on phrase similarity \u2013 keyphrase clustering \u2013 and create a new benchmark for it in the product reviews domain. We show that McPhraSy surpasses all other baselines for this task.", "track": "Semantics: Lexical, Sentence level, Textual Inference and Other areas", "label": 8, "url": ""}, {"loc": [4.524389266967773, 9.149909019470215], "id": 2263, "title": "CANarEx: Contextually Aware Narrative Extraction for Semantically Rich Text-as-data Applications", "authors": "Nandini Anantharama, Simon D. Angus and Lachlan O'Neill", "abstract": "Narrative modelling is an area of active research, motivated by the acknowledgement of narratives as drivers of societal decision making. These research efforts conceptualize narratives as connected entity chains, and modeling typically focuses on the identification of entities and their connections within a text. An emerging approach to narrative modelling is the use of semantic role labeling (SRL) to extract Entity-Verb-Entity (E-V-Es) tuples from a text, followed by dimensionality reduction to reduce the space of entities and connections separately. This process penalises the semantic richness of narratives and discards much contextual information along the way. Here, we propose an alternate narrative extraction approach - CANarEx, incorporating a pipeline of common contextual constructs through co-reference resolution, micro-narrative generation and clustering of these narratives through sentence embeddings. We evaluate our approach through testing the recovery of \"narrative time-series clusters\", mimicking a desirable text-as-data task. The evaluation framework leverages synthetic data generated using a GPT-3 model. The GPT-3 model is trained to generate similar sentences using a large dataset of news articles. The synthetic data maps to three topics in the news dataset. We then generate narrative time-series document cluster representations by mapping the synthetic data to three distinct signals synthetically injected into the testing corpus. Evaluation results demonstrate the superior ability of CANarEx to recover narrative time-series through reduced MSE and improved precision/recall relative to existing methods. The validity is further reinforced through ablation studies and qualitative analysis.", "track": "NLP Applications", "label": 0, "url": ""}, {"loc": [3.6368181705474854, 8.046760559082031], "id": 2283, "title": "Narrate Dialogues for Better Summarization", "authors": "Ruochen Xu, Chenguang Zhu and Michael Zeng", "abstract": "Dialogue summarization models aim to generate a concise and accurate summary for multi-party dialogue. The complexity of dialogue, including coreference, dialogue acts, and inter-speaker interactions bring unique challenges to dialogue summarization. Most recent neural models achieve state-of-art performance following the pretrain-then-finetune recipe, where the large-scale language model (LLM) is pretrained on large-scale single-speaker written text, but later finetuned on multi-speaker dialogue text. To mitigate the gap between pretraining and finetuning, we propose several approaches to convert the dialogue into a third-person narrative style and show that the narration serves as a valuable annotation for LLMs. Empirical results on three benchmark datasets show our simple approach achieves higher scores on the ROUGE and a factual correctness metric.", "track": "Summarization", "label": 14, "url": ""}, {"loc": [0.7798523902893066, 8.095955848693848], "id": 2306, "title": "CrossRE: A Cross-Domain Dataset for Relation Extraction", "authors": "Elisa Bassignana and Barbara Plank", "abstract": "Relation Extraction (RE) has attracted increasing attention, but current RE evaluation is limited to in-domain evaluation setups. Little is known on how well a RE system fares in challenging, but realistic out-of-distribution evaluation setups. To address this gap, we propose CrossRE, a new, freely-available cross-domain benchmark for RE, which comprises six distinct text domains and includes multi-label annotations. An additional innovation is that we release meta-data collected during annotation, to include explanations and flags of difficult instances. We provide an empirical evaluation with a state-of-the-art model for relation classification. As the meta-data enables us to shed new light on the state-of-the-art model, we provide a comprehensive analysis on the impact of difficult cases and find correlations between model and human annotations. Overall, our empirical investigation highlights the difficulty of cross-domain RE. We release our dataset, to spur more research in this direction.", "track": "Resources and Evaluation", "label": 1, "url": "https://www.semanticscholar.org/reader/e80a95215a32d08d27d7d62aa6ad87ae8a007553?experiments=&features=reader_skimming%3Atrue"}, {"loc": [2.7872440814971924, 7.113026142120361], "id": 2309, "title": "Probing Structural Knowledge from Pre-trained Language Model for Argumentation Relation Classification", "authors": "Yang Sun, Bin Liang, Jianzhu Bao, Min Yang and Ruifeng Xu", "abstract": "Extracting fine-grained structural information between argumentation component (AC) pairs is essential for argumentation relation classification (ARC). However, most previous studies attempt to model the relationship between AC pairs using AC level similarity or semantically relevant features. They ignore the complex interaction between AC pairs and cannot effectively reason the argumentation relation deeply.\nTherefore, in this paper, we propose a novel \\underline{d}ual \\underline{p}rior \\underline{g}raph \\underline{n}eural \\underline{n}etwork (DPGNN) to jointly explore the probing knowledge derived from  pre-trained language models (PLMs) and the syntactical information for comprehensively modeling the relationship between AC pairs. Specifically, we construct a probing graph by using probing knowledge derived from PLMs to recognize and align the relational information within and across the argumentation components. In addition, we propose a mutual dependency graph for the AC pair to reason the fine-grained syntactic structural information, in which the syntactical correlation between words is set by the dependency information within AC and mutual attention mechanism across ACs. The knowledge learned from the probing graph and the dependency graph are combined to comprehensively capture the aligned relationships of AC pairs for improving the results of ARC. Experimental results on three public datasets show that DPGNN outperforms the state-of-the-art baselines by a noticeable margin.", "track": "Interpretability, Interactivity and Analysis of Models for NLP", "label": 9, "url": ""}, {"loc": [4.577014923095703, 4.359799385070801], "id": 2310, "title": "LogicNMR: Probing the Non-monotonic Reasoning Ability of Pre-trained Language Models", "authors": "Yeliang Xiu, Zhanhao Xiao and Yongmei Liu", "abstract": "The logical reasoning capabilities of pre-trained language models have recently received much attention. As one of the vital reasoning paradigms, non-monotonic reasoning refers to the fact that conclusions may be invalidated with new information. Existing work has constructed a non-monotonic inference dataset $\\delta$-NLI and explored the performance of language models on it. However, the $\\delta$-NLI dataset is entangled with commonsense reasoning. In this paper, we explore the pure non-monotonic reasoning ability of pre-trained language models. \nWe build a non-monotonic reasoning benchmark, named LogicNMR, with explicit default rules and iterative updates. In the experimental part, the performance of popular language models on LogicNMR is explored from the perspectives of accuracy, generalization, proof-based traceability and robustness. The experimental results show that even though the fine-tuned language models achieve an accuracy of more than 94.4\\% on LogicNMR, they perform unsatisfactorily, with a significant drop, in generalization and proof-based traceability.", "track": "Resources and Evaluation", "label": 1, "url": ""}, {"loc": [2.700573444366455, 4.857706546783447], "id": 2313, "title": "Cheater's Bowl: Human vs. Computer Search Strategies for Open-Domain QA", "authors": "Wanrong He, Andrew Mao and Jordan Boyd-Graber", "abstract": "For humans and computers, the first step in answering an open-domain question is retrieving a set of relevant documents from a large corpus. However, the strategies that computers use fundamentally differ from those of humans. To better understand these differences, we design a gamified interface for data collection -- Cheater's Bowl -- where a human answers complex questions with access to both traditional and modern search tools. We collect a dataset of human search sessions, analyze human search strategies and compare them to state-of-the-art multi-hop QA models. We show that humans query logically, apply dynamic search chains and utilize world knowledge to boost searching. We demonstrate how human queries can improve the accuracy of existing systems and propose the future design of QA models.", "track": "Question Answering", "label": 11, "url": ""}, {"loc": [3.9013633728027344, 9.77903938293457], "id": 2337, "title": "FRSUM: Towards Faithful Abstractive Summarization via Enhancing Factual Robustness", "authors": "Wenhao Wu, Wei Li, Jiachen Liu, Xinyan Xiao, Ziqiang Cao, Sujian Li and Hua Wu", "abstract": "Despite being able to generate fluent and grammatical text, current Seq2Seq summarization models still suffering from the unfaithful generation problem.\nIn this paper, we study the faithfulness of existing systems from a new perspective of factual robustness which is the ability to correctly generate  factual information over  adversarial unfaithful information.\nWe first measure a model's\nfactual robustness by its success rate to defend against adversarial attacks when generating factual information.\nThe factual robustness analysis on a wide range of current systems shows its good consistency with human judgments on faithfulness.\nInspired by these findings, we propose to improve the faithfulness of a model by enhancing its factual robustness.\nSpecifically, we propose a novel training strategy, namely FRSUM, which teaches the model to defend against both explicit adversarial samples and implicit factual adversarial perturbations.\nExtensive automatic and human evaluation results show that FRSUM consistently improves the faithfulness of various Seq2Seq models, such as T5, BART.", "track": "Summarization", "label": 14, "url": ""}, {"loc": [5.103869438171387, 8.885583877563477], "id": 2348, "title": "PoeLM: A Meter- and Rhyme-Controllable Language Model for Unsupervised Poetry Generation", "authors": "Aitor Ormazabal, Mikel Artetxe, Manex Agirrezabal, Aitor Soroa and Eneko Agirre", "abstract": "Formal verse poetry imposes strict constraints on the meter and rhyme scheme of poems. Most prior work on generating this type of poetry uses existing poems for supervision, which are difficult to obtain for most languages and poetic forms. In this work, we propose an unsupervised approach to generate poems that follow any given meter and rhyme scheme, without requiring any poetic text for training. Our method works by splitting a regular, non-poetic corpus into phrases, prepending control codes that describe the length and end rhyme of each phrase, and training a transformer language model in the augmented corpus. The transformer learns to link the structure descriptor with the control codes to the number of lines, their length and their end rhyme. During inference, we build control codes for the desired meter and rhyme scheme, and condition our language model on them to generate formal verse poetry. Experiments in Spanish and Basque show that our approach is able to generate valid poems, which are often comparable in quality to those written by humans.", "track": "Natural Language Generation", "label": 6, "url": ""}, {"loc": [7.970156192779541, 9.71275806427002], "id": 2349, "title": "ProGen: Progressive Zero-shot Dataset Generation via In-context Feedback", "authors": "Jiacheng Ye, Jiahui Gao, Zhiyong Wu, Jiangtao Feng, Tao Yu and Lingpeng Kong", "abstract": "Recently, dataset-generation-based zero-shot learning has shown promising results by training a task-specific model with a dataset synthesized from large pre-trained language models (PLMs). \n The final task-specific model often achieves compatible or even better performance than PLMs under the zero-shot setting, with orders of magnitude fewer parameters.\nHowever, synthetic datasets have their drawbacks. They have long being suffering from the low-quality issue (e.g., low informativeness, redundancy). This explains why the massive synthetic data does not lead to better performance -- a scenario we would expect in the human-labeled data. \nTo improve the quality in dataset synthesis, we propose a progressive zero-shot dataset generation framework, ProGen, which leverages the feedback from the task-specific model to guide the generation of new training data via in-context examples.\nExtensive experiments on five text classification datasets demonstrate the effectiveness of the proposed approach. \nWe also show ProGen achieves on-par or superior performance with only 1% synthetic dataset size, when comparing to baseline methods without in-context feedback.", "track": "Language Modeling and Analysis of Language Models", "label": 2, "url": "https://www.semanticscholar.org/reader/95d54e3ce577f7d91ab4b2c52c73b501245e484d?experiments=&features=reader_skimming%3Atrue"}, {"loc": [4.829037189483643, 7.315104007720947], "id": 2368, "title": "Constructing Highly Inductive Contexts for Dialogue Safety through Controllable Reverse Generation", "authors": "Zhexin Zhang, Jiale Cheng, Hao Sun, Jiawen Deng, Fei Mi, Yasheng Wang, Lifeng Shang and Minlie Huang", "abstract": "Large pretrained language models can easily produce toxic or biased content, which is prohibitive for practical use. In order to detect such toxic generations, existing methods rely on templates, real-world data extraction, crowdsourcing workers or automatic generation to construct adversarial contexts that are likely to induce toxic generations. However, what type of context is more likely to induce unsafe responses is still under-explored. In this paper, we identify that context toxicity and context category (e.g., profanity, insult, drugs, etc.) are two important factors to cause safety issues in response generation. Hence, we propose a method called reverse generation to construct adversarial contexts conditioned on a given response, with the flexibility to control category, toxicity level and inductivity of the generated contexts. Via reverse generation, we augment the existing BAD dataset and construct a new dataset BAD+ which contains more than 120K diverse and highly inductive contexts in 12 categories. We test three popular pretrained dialogue models (Blender, DialoGPT and Plato2) and find that BAD+ can largely expose their safety problems. Furthermore, we show that BAD+ can greatly enhance the safety of generation, and we reveal the key factors of safety improvement. Our code and dataset is available at \\url{https://github.com/thu-coai/Reverse_Generation}.", "track": "Ethic Concerns:Dialogue and Interactive Systems", "label": 4, "url": ""}, {"loc": [3.373538017272949, 4.544143199920654], "id": 2375, "title": "Language Prior Is Not the Only Shortcut: A Benchmark for Shortcut Learning in VQA", "authors": "Qingyi Si, Fandong Meng, Mingyu Zheng, Zheng Lin, Yuanxin LIU, Peng Fu, Yanan Cao, Weiping Wang and Jie Zhou", "abstract": "Visual Question Answering (VQA) models are prone to learn the shortcut solution formed by dataset biases rather than the intended solution. To evaluate the VQA models' reasoning ability beyond shortcut learning, the VQA-CP v2 dataset introduces a distribution shift between the training and test set given a question type. In this way, the model cannot use the training set shortcut (from question type to answer) to perform well on the test set. However, VQA-CP v2 only considers one type of shortcut and thus still cannot guarantee that the model relies on the intended solution rather than a solution specific to this shortcut. To overcome this limitation, we propose a new dataset that considers varying types of shortcuts by constructing different distribution shifts in multiple OOD test sets. In addition, we overcome the three troubling practices in the use of VQA-CP v2, e.g., selecting models using OOD test sets, and further standardize OOD evaluation procedure. Our benchmark provides a more rigorous and comprehensive testbed for shortcut learning in VQA. We benchmark recent methods and find that methods specifically designed for particular shortcuts fail to simultaneously generalize to our varying OOD test sets. We also systematically study the varying shortcuts and provide several valuable findings, which may promote the exploration of shortcut learning in VQA.", "track": "Question Answering", "label": 11, "url": "https://www.semanticscholar.org/reader/6a38a5a85d8405a11171876126eb9c7633005b03?experiments=&features=reader_skimming%3Atrue"}, {"loc": [1.8603405952453613, 4.00204610824585], "id": 2382, "title": "Bridging the Training-Inference Gap for Dense Phrase Retrieval", "authors": "Gyuwan Kim, Jinhyuk Lee, Barlas Oguz, Wenhan Xiong, Yizhe Zhang, Yashar Mehdad and William Yang Wang", "abstract": "Building dense retrievers requires a series of standard procedures, including training and validating neural models and creating indexes for efficient search. However, these procedures are often misaligned in that training objectives do not exactly reflect the retrieval scenario at inference time. In this paper, we explore how the gap between training and inference in dense retrieval can be reduced, focusing on dense phrase retrieval (Lee et al., 2021) where billions of representations are indexed at inference. Since validating every dense retriever with a large-scale index is practically infeasible, we propose an efficient way of validating dense retrievers using a small subset of the entire corpus. This allows us to validate various training strategies including unifying contrastive loss terms and using hard negatives for phrase retrieval, which largely reduces the training-inference discrepancy. As a result, we improve top-1 phrase retrieval accuracy by 2~3 points and top-20 passage retrieval accuracy by 2~4 points for open-domain question answering. Our work urges modeling dense retrievers with careful consideration of training and inference via efficient validation while advancing phrase retrieval as a general solution for dense retrieval.", "track": "Question Answering", "label": 11, "url": "https://www.semanticscholar.org/reader/0c171148052476b059611dd70eca29c72c121f6a?experiments=&features=reader_skimming%3Atrue"}, {"loc": [8.619942665100098, 6.743721961975098], "id": 2396, "title": "Beyond Counting Datasets: A Survey of Multilingual Dataset Construction and Necessary Resources", "authors": "Xinyan Yu, Trina Chatterjee, Akari Asai, Junjie Hu and Eunsol Choi", "abstract": "While the NLP community is generally aware of resource disparities among languages, we lack research that quantifies the extent and types of such disparity. Prior surveys estimating the availability of resources based on the number of datasets can be misleading as dataset quality varies: many datasets are automatically induced or translated from English data. To provide a more comprehensive picture of language resources, we examine the characteristics of 156 publicly available NLP datasets. We manually annotate how they are created, including input text and label sources and tools used to build them, and what they study, tasks they address and motivations for their creation. After quantifying the qualitative NLP resource gap across languages, we discuss how to improve data collection in low-resource languages. We survey language-proficient NLP researchers and crowd workers per language, finding that their estimated availability correlates with dataset availability. Through crowdsourcing experiments, we identify strategies for collecting high-quality multilingual data on the Mechanical Turk platform. We conclude by making macro and micro-level suggestions to the NLP community and individual researchers for future multilingual data development.", "track": "Theme Track", "label": 18, "url": ""}, {"loc": [5.734128475189209, 11.871498107910156], "id": 2403, "title": "ERNIE-Layout: Layout Knowledge Enhanced Pre-training for Visually-rich Document Understanding", "authors": "Qiming Peng, Yinxu Pan, Wenjin Wang, Bin Luo, Zhenyu Zhang, Zhengjie Huang, Yuhui Cao, Weichong Yin, Yongfeng Chen, Yin Zhang, Shikun Feng, Yu Sun, Hao Tian, Hua Wu and Haifeng Wang", "abstract": "Recent years have witnessed the rise and success of pre-training techniques in visually-rich document understanding. However, most existing methods lack the systematic mining and utilization of layout-centered knowledge, leading to sub-optimal performances. In this paper, we propose ERNIE-Layout, a novel document pre-training solution with layout knowledge enhancement in the whole workflow, to learn better representations that combine the features from text, layout, and image. Specifically, we first rearrange input sequences in the serialization stage, and then present a correlative pre-training task, reading order prediction, to learn the proper reading order of documents. To improve the layout awareness of the model, we integrate a spatial-aware disentangled attention into the multi-modal transformer and a replaced regions prediction task into the pre-training phase. Experimental results show that ERNIE-Layout achieves superior performance on various downstream tasks, setting new state-of-the-art on key information extraction, document image classification, and document question answering datasets. The code and models are publicly available at PaddleNLP.", "track": "Language Modeling and Analysis of Language Models", "label": 2, "url": "https://www.semanticscholar.org/reader/334116d685096d8fd2aedd66fc17e2a90d1f9a9d?experiments=&features=reader_skimming%3Atrue"}, {"loc": [4.903752326965332, 4.743311405181885], "id": 2428, "title": "Do Charge Prediction Models Learn Legal Theory?", "authors": "An Zhenwei, Quzhe Huang, Cong Jiang, Yansong Feng and Dongyan Zhao", "abstract": "The charge prediction task aims to predict the charge for a case given its fact description. Recent models have already achieved impressive accuracy in this task, however, little is understood about the mechanisms they use to perform the judgment.\nFor practical applications, a charge prediction model should conform to the certain legal theory in civil law countries,  as under the framework of civil law, all cases  are judged according to certain local legal theories. In China, for example, nearly all criminal judges make decisions based on the Four Elements Theory (FET).\nIn this paper, we argue that trustworthy  charge prediction models should take legal theories into consideration, and standing on prior studies in model interpretation, we propose three principles  for trustworthy models should follow in this task, which are \\texttt {sensitive}, \\texttt{selective}, and \\texttt{presumption of innocence}.\nWe further design a new framework to evaluate whether existing charge prediction models learn legal theories. Our findings indicate that, while existing charge prediction models meet the \\texttt{selective} principle on a benchmark dataset, most of them are still not \\texttt{sensitive} enough and do not satisfy the \\texttt{presumption of innocence}. Our code and dataset are released at \\url{https://github.com/ZhenweiAn/EXP_LJP}.", "track": "Interpretability, Interactivity and Analysis of Models for NLP", "label": 9, "url": ""}, {"loc": [4.286746978759766, 7.514503479003906], "id": 2445, "title": "Keep Me Updated! Memory Management in Long-term Conversations", "authors": "Sanghwan Bae, Donghyun Kwak, Soyoung Kang, Min Young Lee, Sungdong Kim, Yuin Jeong, Hyeri Kim, Sang-Woo Lee, Woomyoung Park and Nako Sung", "abstract": "Remembering important information from the past and continuing to talk about it in the present are crucial in long-term conversations. However, previous literature does not deal with cases where the memorized information is outdated, which may cause confusion in later conversations. To address this issue, we present a novel task and a corresponding dataset of memory management in long-term conversations, in which bots keep track of and bring up the latest information about users while conversing through multiple sessions. In order to support more precise and interpretable memory, we represent memory as unstructured text descriptions of key information and propose a new mechanism of memory management that selectively eliminates invalidated or redundant information. Experimental results show that our approach outperforms the baselines that leave the stored memory unchanged in terms of engagingness and humanness, with larger performance gap especially in the later sessions.", "track": "Dialogue and Interactive Systems", "label": 4, "url": "https://www.semanticscholar.org/reader/1d8f36b95f51af99fd5c7c4527b9b7ad598b15f4?experiments=&features=reader_skimming%3Atrue"}, {"loc": [4.509362697601318, 7.649197101593018], "id": 2456, "title": "A Unified Dialogue User Simulator for Few-shot Data Augmentation", "authors": "Dazhen Wan, Zheng Zhang, Qi Zhu, Lizi Liao and Minlie Huang", "abstract": "Pre-trained language models have shown superior performance in task-oriented dialogues. However, existing datasets are on limited scales, which cannot support large-scale pre-training. Fortunately, various data augmentation methods have been developed to augment large-scale task-oriented dialogue corpora. However, they heavily rely on annotated data in the target domain, which require a tremendous amount of data collection and human labeling work. In this paper, we build a unified dialogue user simulation model by pre-training on several publicly available datasets. The model can then be tuned on a target domain with few-shot data. The experiments on a target dataset across multiple domains show that our proposed model brings remarkable performance increases through data augmentation.", "track": "Dialogue and Interactive Systems", "label": 4, "url": ""}, {"loc": [7.613858699798584, 12.31232738494873], "id": 2469, "title": "Human-in-the-Loop Hate Speech Classification in a Multilingual Context", "authors": "Ana Kotarcic, Dominik Hangartner, Fabrizio Gilardi, Selina Kurer and Karsten Donnay", "abstract": "The shift of public debate to the digital sphere has been accompanied by a rise in online hate speech. While many promising approaches for hate speech classification have been proposed, studies often focus only on a single language, usually English, and do not address three key concerns: post-deployment performance, classifier maintenance and infrastructural limitations. In this paper, we introduce a new human-in-the-loop BERT-based hate speech classification pipeline and trace its development from initial data collection and annotation all the way to post-deployment. Our classifier, trained using data from our original corpus of over 422k examples, is specifically developed for the inherently multilingual setting of Switzerland and outperforms with its F1 score of 80.5 the currently best-performing BERT-based multilingual classifier by 5.8 F1 points in German and 3.6 F1 points in French. Our systematic evaluations over a 12-month period further highlight the vital importance of continuous, human-in-the-loop classifier maintenance to ensure robust hate speech classification post-deployment.", "track": "NLP Applications", "label": 0, "url": ""}, {"loc": [10.828190803527832, 9.34191608428955], "id": 2472, "title": "An Error-Guided Correction Model for Chinese Spelling Error Correction", "authors": "Rui Sun, Xiuyu Wu and Yunfang Wu", "abstract": "Although existing neural network approaches have achieved great progress on Chinese spelling correction, there is still room to improve. The model is required to avoid over-correction and to distinguish a correct token from its phonological and visual similar ones. In this paper, we propose an error-guided correction model to address these issues. By borrowing the powerful ability of the pre-trained BERT model, we propose a novel zero-shot error detection method to do a preliminary detection, which guides our model to attend more on the probably wrong tokens in encoding and to avoid modifying the correct tokens in generating. Furthermore, we introduce a new loss function to integrate the error confusion set, which enables our model  to distinguish similar tokens. Moreover, our model supports highly parallel decoding to meet real applications. Experiments are conducted on widely used benchmarks. Our model achieves superior performance against state-of-the-art approaches by a remarkable margin, on both the quality and computation speed.", "track": "Natural Language Generation", "label": 6, "url": ""}, {"loc": [5.474376678466797, 12.463579177856445], "id": 2481, "title": "Describing Sets of Images with Textual-PCA", "authors": "Oded Hupert, Idan Schwartz and Lior Wolf", "abstract": "We seek to semantically describe a set of images, capturing both the attributes of single images and the variations within the set. Our procedure is analogous to Principle Component Analysis, in which the role of projection vectors is replaced with generated phrases. First, a centroid phrase that has the largest average semantic similarity to the images in the set is generated, where both the computation of the similarity and the generation are based on pretrained vision-language models. Then, the phrase that generates the highest variation among the similarity scores is generated, using the same models. The next phrase maximizes the variance subject to being orthogonal, in the latent space, to the highest-variance phrase, and the process continues. Our experiments show that our method is able to convincingly capture the essence of image sets and describe the individual elements in a semantically meaningful way within the context of the entire set. Our code is available at: \\url{https://github.com/OdedH/textual-pca}.", "track": "Speech, Vision, Robotics, Multimodal Grounding", "label": 7, "url": "https://www.semanticscholar.org/reader/5808bda70e06a414e9970dff6946f007e942ac8e?experiments=&features=reader_skimming%3Atrue"}, {"loc": [5.723360061645508, 8.940983772277832], "id": 2484, "title": "Learning to Model Editing Processes", "authors": "Machel Reid and Graham Neubig", "abstract": "Most existing sequence generation models produce outputs in one pass, usually left-to-right. However, this is in contrast with a more natural approach that humans use in generating content; iterative refinement and editing. Recent work has introduced edit-based models for various tasks (such as neural machine translation and text style transfer), but these generally model a single edit step. In this work, we propose modeling editing processes, modeling the whole process of iteratively generating sequences. We form a conceptual framework to describe the likelihood of multi-step edits, and describe neural models that can learn a generative model of sequences based on these multistep edits. We introduce baseline results and metrics on this task, finding that modeling editing processes improves performance on a variety of axes on both our proposed task and related downstream tasks compared to previous single-step models of edits.", "track": "Language Modeling and Analysis of Language Models", "label": 2, "url": "https://www.semanticscholar.org/reader/60bff5a4527141599d8e05904baf96410541f8a9?experiments=&features=reader_skimming%3Atrue"}, {"loc": [0.7180464267730713, 6.795099258422852], "id": 2487, "title": "PALT: Parameter-Lite Transfer of Language Models for Knowledge Graph Completion", "authors": "Jianhao Shen, Chenguang Wang, Ye Yuan, Jiawei Han, Heng Ji, Koushik Sen, Ming Zhang and Dawn Song", "abstract": "This paper presents a parameter-lite transfer learning approach of pretrained language models (LM) for knowledge graph (KG) completion. Instead of finetuning, which modifies all LM parameters, we only tune a few new parameters while keeping the original LM parameters fixed. We establish this via reformulating KG completion as a \"fill-in-the-blank'' task, and introducing a parameter-lite encoder on top of the original LMs. We show that, by tuning far fewer parameters than finetuning, LMs transfer non-trivially to most tasks and reach competitiveness with prior state-of-the-art approaches. For instance, we outperform the fully finetuning approaches on a KG completion benchmark by tuning only 1% of the parameters.", "track": "Language Modeling and Analysis of Language Models", "label": 2, "url": "https://www.semanticscholar.org/reader/b32f967c0a5777a5045d4fd59f2cda9be68dc3bb?experiments=&features=reader_skimming%3Atrue"}, {"loc": [3.756138563156128, 5.894388198852539], "id": 2489, "title": "Prompt-based Connective Prediction Method for Fine-grained Implicit Discourse Relation Recognition", "authors": "Hao Zhou, Man Lan, Yuanbin Wu, Yuefeng Chen and Meirong Ma", "abstract": "Due to the absence of connectives, implicit discourse relation recognition (IDRR) is still a challenging and crucial task in discourse analysis. Most of the current work adopted multitask learning to aid IDRR through explicit discourse relation recognition (EDRR) or utilized dependencies between discourse relation labels to constrain model predictions. But these methods still performed poorly on fine-grained IDRR and even utterly misidentified on most of the few-shot discourse relation classes. To address these problems, we propose a novel Prompt-based Connective Prediction (PCP) method for IDRR. Our method instructs large-scale pre-trained models to use knowledge relevant to discourse relation and utilizes the strong correlation between connectives and discourse relation to help the model recognize implicit discourse relations. Experimental results show that our method surpasses the current state-of-the-art model and achieves significant improvements on those fine-grained few-shot discourse relation. Moreover, our approach is able to be transferred to EDRR and obtain acceptable results. Our code is released in https://github.com/zh-i9/PCP-for-IDRR.", "track": "Discourse and Pragmatics", "label": 24, "url": ""}, {"loc": [9.656222343444824, 6.321267127990723], "id": 2514, "title": "On Utilizing Constituent Language Resources to Improve Downstream Tasks in Hinglish", "authors": "Vishwajeet Kumar, Rudra Murthy and Tejas Dhamecha", "abstract": "Performance of downstream NLP tasks on code-switched Hindi-English (aka \\hgl) continues to remain a significant challenge. Intuitively, Hindi and English corpora should aid improve task performance on Hinglish. We show that meta-learning framework can effectively utilize the the labelled resources of the downstream tasks in the constituent\\footnote{We use the term \\textit{constituent} to jointly refer to the matrix and embedding languages.} languages. The proposed approach improves the performance on downstream tasks on code-switched language. We experiment with \\hgl code-switching benchmark GLUECoS and report significant improvements.", "track": "Multilinguality", "label": 13, "url": ""}, {"loc": [1.7021663188934326, 5.389439105987549], "id": 2532, "title": "SYGMA: A System for Generalizable and Modular Question Answering Over Knowledge Bases", "authors": "Sumit Neelam, Udit Sharma, Hima Karanam, Shajith Ikbal, Pavan Kapanipathi, Ibrahim Abdelaziz, Nandana Mihindukulasooriya, Young-Suk Lee, Santosh Srivastava, Cezar Pendus, Saswati Dana, Dinesh Garg, Achille Fokoue, G P Shrivatsa Bhargav, Dinesh Khandelwal, Srinivas Ravishankar, Sairam Gurajada, Maria Chang, Rosario Uceda-Sosa, Salim Roukos, Alexander Gray, Guilherme Lima, Ryan Riegel, Francois Luus and L V Subramaniam", "abstract": "Knowledge Base Question Answering (KBQA) involving complex reasoning is emerging as an important research direction. However, most KBQA systems struggle with generalizability, particularly on two dimensions: (a) across multiple knowledge bases, where existing KBQA approaches are typically tuned to a single knowledge base, and (b) across multiple reasoning types, where majority of datasets and systems have primarily focused on multi-hop reasoning. In this paper, we present SYGMA, a modular KBQA approach developed with goal of generalization across multiple knowledge bases and multiple reasoning types. To facilitate this, SYGMA is designed as two high level modules: 1) KB-agnostic question understanding module that remain common across KBs, and generates logic representation of the question with high level reasoning constructs that are extensible, and 2) KB-specific question mapping and answering module to address the KB-specific aspects of the answer extraction. We evaluated SYGMA on multiple datasets belonging to distinct knowledge bases (DBpedia and Wikidata) and distinct reasoning types (multi-hop and temporal). State-of-the-art or competitive performances achieved on those datasets demonstrate its generalization capability.", "track": "Question Answering", "label": 11, "url": "https://www.semanticscholar.org/reader/76ddbcc982ba1ccb6128dfd5960a3ab081f703ff?experiments=&features=reader_skimming%3Atrue"}, {"loc": [8.055648803710938, 9.392278671264648], "id": 2546, "title": "Instance-Guided Prompt Learning for Few-Shot Text Matching", "authors": "Jia Du, Xuanyu Zhang, siyi wang, Kai Wang, Yanquan Zhou, Lei Li, Qing Yang and Dongliang Xu", "abstract": "Few-shot text matching is a more practical technique in natural language processing (NLP) to determine whether two texts are semantically identical. They primarily design patterns to reformulate text matching into a pre-trained task with uniform prompts across all instances. But they fail to take into account the connection between prompts and instances. This paper argues that dynamically strengthening the correlation between particular instances and the prompts is necessary because fixed prompts cannot adequately fit all diverse instances in inference. We suggest IGATE: Instance-Guided prompt leArning for few-shoT tExt matching, a novel pluggable prompt learning method. The gate mechanism used by IGATE, which is between the embedding and the PLM encoders, makes use of the semantics of instances to regulate the effects of the gate on the prompt tokens. The experimental findings show that IGATE achieves SOTA performance on MRPC and QQP, outperforming strong baselines. GitHub will host the release of codes.", "track": "Machine Learning for NLP", "label": 3, "url": ""}, {"loc": [3.308990001678467, 9.415026664733887], "id": 2549, "title": "M3: Multi-level dataset for Multi-document summarisation of Medical studies", "authors": "Yulia Otmakhova, Karin Verspoor, Timothy Baldwin, Antonio Jimeno Yepes and Jey Han Lau", "abstract": "We present M3 (Multi-level dataset for Multi-document summarisation of Medical studies), a benchmark dataset for evaluating the quality of summarisation systems in the biomedical domain. The dataset contains sets of multiple input documents and target summaries of three levels of complexity: documents, sentences, and propositions. The dataset also includes several levels of annotation, including biomedical entities, direction, and strength of relations between them, and the discourse relationships between the input documents (\"contradiction'' or \"agreement''). We showcase usage scenarios of the dataset by testing 10 generic and domain-specific summarisation models in a zero-shot setting, and introduce a probing task based on counterfactuals to test if models are aware of the direction and strength of the conclusions generated from input studies.", "track": "Summarization", "label": 14, "url": ""}, {"loc": [0.7095517516136169, 6.945507526397705], "id": 2565, "title": "A Knowledge-Enhanced Multilingual Language Model for Both Knowledge Graph and Language Tasks", "authors": "Yifan Hou, Wenxiang Jiao, Meizhen Liu, Carl Allen, Zhaopeng Tu and Mrinmaya Sachan", "abstract": "Large language models (LMs) appear to learn facts from the large text corpora they are trained on. Such facts are encoded implicitly within their many parameters, making it difficult to verify or manipulate what knowledge has been learned. LMs have recently been extended to multilingual LMs (MLLMs), enabling knowledge to be learned across hundreds of languages. Meanwhile, knowledge graphs (KGs) contain facts in an explicit triple format, which require careful and costly curation and are only available in a few high-resource languages, restricting their research and application. To address this, we propose to enhance MLLMs with the knowledge of multilingual knowledge graphs (MLKGs) so as to tackle language and KG tasks across many languages, including low-resource ones. Specifically, we introduce a lightweight adapter set to enhance MLLMs with cross-lingual entity alignment and facts from MLKGs for many languages. Experiments on common benchmarks show that such enhancement benefits both the MLLM and MLKG, achieving: (1) comparable or improved performance for KG completion and entity alignment relative to baselines, especially for low-resource languages (for which KGs are unavailable); and (2) improved MLLM performance on language understanding tasks that require multilingual factual knowledge; all while maintaining performance on other general language tasks.", "track": "Multilinguality", "label": 13, "url": ""}, {"loc": [7.316677093505859, 9.588396072387695], "id": 2568, "title": "SepLL: Separating Latent Class Labels from Weak Supervision Noise", "authors": "Andreas Stephan, Vasiliki Kougia and Benjamin Roth", "abstract": "In the weakly supervised learning paradigm, labeling functions automatically assign heuristic, often noisy, labels to data samples. In this work, we provide a method for learning from weak labels by separating two types of complementary information associated with the labeling functions: information related to the target label and information specific to one labeling function only. Both types of information are reflected to different degrees by all labeled instances. In contrast to previous works that aimed at correcting or removing wrongly labeled instances, we learn a branched deep model that uses all data as-is, but splits the labeling function information in the latent space. Specifically, we propose the end-to-end model SepLL which extends a transformer classifier by introducing a latent space for labeling function specific and task-specific information. The learning signal is only given by the labeling functions matches, no pre-processing or label model is required for our method.  Notably, the task prediction is made from the latent layer without any direct task signal. Experiments on Wrench text classification tasks show that our model is competitive with the state-of-the-art, and yields a new best average performance.", "track": "Unsupervised and Weakly-Supervised Methods in NLP", "label": 17, "url": "https://www.semanticscholar.org/reader/51b795ae752dbd185281aae29671492b29b6ba83?experiments=&features=reader_skimming%3Atrue"}, {"loc": [4.786653518676758, 3.919642448425293], "id": 2573, "title": "Probing Relational Knowledge in Language Models via Word Analogies", "authors": "Kiamehr Rezaee and Jose Camacho-Collados", "abstract": "Understanding relational knowledge plays an integral part in natural language comprehension. When it comes to pre-trained language models (PLM), prior work has been focusing on probing relational knowledge this by filling the blanks in pre-defined prompts such as \"The capital of France is ---\". However, these probes may be affected by the co-occurrence of target relation words and entities (e.g. \"capital\", \"France\" and \"Paris\") in the pre-training corpus. In this work, we extend these probing methodologies leveraging analogical proportions as a proxy to probe relational knowledge in transformer-based PLMs without directly presenting the desired relation. In particular, we analysed the ability of PLMs to understand (1) the directionality of a given relation (e.g. Paris-France is not the same as France-Paris); (2) the ability to distinguish types on a given relation (both France and Japan are countries); and (3) the relation itself (Paris is the capital of France, but not Rome). Our results show how PLMs are extremely accurate at (1) and (2), but have clear room for improvement for (3). To better understand the reasons behind this behaviour and mistakes made by PLMs, we provide an extended quantitative analysis based on relevant factors such as frequency.", "track": "Language Modeling and Analysis of Language Models", "label": 2, "url": ""}, {"loc": [8.153226852416992, 8.739192962646484], "id": 2575, "title": "Semi-Supervised Lifelong Language Learning", "authors": "Yingxiu Zhao, Yinhe Zheng, Bowen Yu, Zhiliang Tian, Dongkyu Lee, Jian Sun, Yongbin Li and Nevin L. Zhang", "abstract": "Lifelong learning aims to accumulate knowledge and alleviate catastrophic forgetting when learning tasks sequentially. However, existing lifelong language learning methods only focus on the supervised learning setting. Unlabeled data, which can be easily accessed in real-world scenarios, are underexplored. In this paper, we explore a novel setting, semi-supervised lifelong language learning (SSLL), where a model learns sequentially arriving language tasks with both labeled and unlabeled data. We propose an unlabeled data enhanced lifelong learner to explore SSLL. Specially, we dedicate task-specific modules to alleviate catastrophic forgetting and design two modules to exploit unlabeled data: (1) a virtual supervision enhanced task solver is constructed on a teacher-student framework to mine the underlying knowledge from unlabeled data; and (2) a backward augmented learner is built to encourage knowledge transfer from newly arrived unlabeled data to previous tasks. Experimental results on various language tasks demonstrate our model's effectiveness and superiority over competitive baselines under the new setting SSLL.", "track": "Machine Learning for NLP", "label": 3, "url": ""}, {"loc": [8.054038047790527, 9.469047546386719], "id": 2590, "title": "Parameter-free Automatically Prompting: A Latent Pseudo Label Mapping Model for Prompt-based Learning", "authors": "Jirui Qi, Richong Zhang, Junfan Chen, Jaein Kim and Yongyi Mao", "abstract": "Prompt-based learning has achieved excellent performance in few-shot learning by mapping the outputs of the pre-trained language model to the labels with the help of a label mapping component. Existing manual label mapping (MLM) methods achieve good results but heavily rely on expensive human knowledge. Automatic label mapping (ALM) methods that learn the mapping functions with extra parameters have shown their potentiality. However, no effective ALM model comparable to MLM methods is developed yet due to the limited data. In this paper, we propose a Latent Pseudo Label Mapping (LPLM) method that optimizes the label mapping without human knowledge and extra parameters. LPLM is built upon a probabilistic latent model and is iteratively self-improved with the EM-style algorithm. The empirical results demonstrate that our LPLM method is superior to the mainstream ALM methods and significantly outperforms the SOTA method in few-shot classification tasks. Moreover, LPLM also shows impressively better performance than the vanilla MLM method which requires extra task-specific prior knowledge.", "track": "Efficient Methods for NLP", "label": 12, "url": ""}, {"loc": [1.0461918115615845, 10.521834373474121], "id": 2592, "title": "Exploring Logographic Image for Chinese Aspect-based Sentiment Classification", "authors": "Xiabing Zhou, Renjie Feng, Xiaotong Jiang and Zhongqing Wang", "abstract": "In logographic languages like Chinese, word meanings are constructed using specific character formations, which can help to disambiguate word senses and are beneficial for sentiment classification. \nHowever, such knowledge is rarely explored in previous sentiment analysis methods. In this paper, we focus on exploring the logographic information for aspect-based sentiment classification in Chinese text. Specifically, we employ a logographic image to capture an internal morphological structure from the character sequence. The logographic image is also used to learn the external relations among context and aspect words. Furthermore, we propose a  multimodal language model to explicitly incorporate a logographic image with review text for aspect-based sentiment classification in Chinese. Experimental results show that our method brings substantial performance improvement over strong baselines. The results also indicate that the logographic image is very important for exploring the internal structure and external relations from the character sequence.", "track": "Sentiment Analysis, Stylistic Analysis, and Argument Mining", "label": 16, "url": ""}, {"loc": [8.763411521911621, 7.828667640686035], "id": 2596, "title": "On the Role of Bidirectionality in Language Model Pre-Training", "authors": "Mikel Artetxe, Jingfei Du, Naman Goyal, Luke Zettlemoyer and Veselin Stoyanov", "abstract": "Prior work on language model pre-training has explored different architectures and learning objectives, but differences in data, hyperparameters and evaluation make a principled comparison difficult. In this work, we focus on bidirectionality as a key factor that differentiates existing approaches, and present a comprehensive study of its role in next token prediction, text infilling, zero-shot priming and fine-tuning. We propose a new framework that generalizes prior approaches, including fully unidirectional models like GPT, fully bidirectional models like BERT, and hybrid models like CM3 and prefix LM. Our framework distinguishes between two notions of bidirectionality (bidirectional context and bidirectional attention) and allows us to control each of them separately. We find that the optimal configuration is largely application-dependent (e.g., bidirectional attention is beneficial for fine-tuning and infilling, but harmful for next token prediction and zero-shot priming). We train models with up to 6.7B parameters, and find differences to remain consistent at scale. While prior work on scaling has focused on left-to-right autoregressive models, our results suggest that this approach comes with some trade-offs, and it might be worthwhile to develop very large bidirectional models.", "track": "Language Modeling and Analysis of Language Models", "label": 2, "url": "https://www.semanticscholar.org/reader/8ce9b1e527c4d9d15239621ec4e3ef3fbbe32202?experiments=&features=reader_skimming%3Atrue"}, {"loc": [5.694046974182129, 6.057868957519531], "id": 2614, "title": "You Are What You Talk About: Inducing Evaluative Topics for Personality Analysis", "authors": "Josip Juki\u0107, Iva Vukojevi\u0107 and Jan Snajder", "abstract": "Expressing attitude or stance toward entities and concepts is an integral part of human behavior and personality. Recently, evaluative language data has become more accessible with social media's rapid growth, enabling large-scale opinion analysis. However, surprisingly little research examines the relationship between personality and evaluative language. To bridge this gap, we introduce the notion of evaluative topics, obtained by applying topic models to pre-filtered evaluative text from social media. We then link evaluative topics to individual text authors to build their evaluative profiles. We apply evaluative profiling to Reddit comments labeled with personality scores and conduct an exploratory study on the relationship between evaluative topics and Big Five personality facets, aiming for a more interpretable, facet-level analysis. Finally, we validate our approach by observing correlations consistent with prior research in personality psychology.", "track": "Linguistic Theories, Cognitive Modeling and Psycholinguistics", "label": 22, "url": ""}, {"loc": [6.4767961502075195, 1.9007999897003174], "id": 2622, "title": "CAT-probing: A Metric-based Approach to Interpret How Pre-trained Models for Programming Language Attend Code Structure", "authors": "Nuo Chen, Qiushi Sun, Renyu Zhu, Xiang Li, Xuesong Lu and Ming Gao", "abstract": "Code pre-trained models (CodePTMs) have recently demonstrated significant success in code intelligence. To interpret these models, some probing methods have been applied. However, these methods fail to consider the inherent characteristics of codes. In this paper, to address the problem, we propose a novel probing method CAT-probing to quantitatively interpret how CodePTMs attend code structure. We first denoise the input code sequences based on the token types pre-defined by the compilers to filter those tokens whose attention scores are too small. After that, we define a new metric CAT-score to measure the commonality between the token-level attention scores generated in CodePTMs and the pair-wise distances between corresponding AST nodes. The higher the CAT-score, the stronger the ability of CodePTMs to capture code structure. We conduct extensive experiments to integrate CAT-probing with representative CodePTMs for different programming languages. Experimental results show the effectiveness of CAT-probing in CodePTM interpretation. Our codes and data are publicly available at https://github.com/nchen909/CodeAttention.", "track": "Language Modeling and Analysis of Language Models", "label": 2, "url": "https://www.semanticscholar.org/reader/27c05c909329c3b10573583afcb788ee15b356ef?experiments=&features=reader_skimming%3Atrue"}, {"loc": [3.1843578815460205, 9.340736389160156], "id": 2623, "title": "Learning to Revise References for Faithful Summarization", "authors": "Griffin Adams, Han-Chin Shing, Qing Sun, Christopher Winestock, Kathleen McKeown and No\u00e9mie Elhadad", "abstract": "In real-world scenarios with naturally occurring datasets, reference summaries are noisy and may contain information that cannot be inferred from the source text. On large news corpora, removing low quality samples has been shown to reduce model hallucinations. Yet, for smaller, and/or noisier corpora, filtering is detrimental to performance. To improve reference quality while retaining all data, we propose a new approach: to selectively re-write unsupported reference sentences to better reflect source data. We automatically generate a synthetic dataset of positive and negative revisions by corrupting supported sentences and learn to revise reference sentences with contrastive learning. The intensity of revisions is treated as a controllable attribute so that, at inference, diverse candidates can be over-generated-then-rescored to balance faithfulness and abstraction. To test our methods, we extract noisy references from publicly available MIMIC-III discharge summaries for the task of hospital-course summarization, and vary the data on which models are trained. According to metrics and human evaluation, models trained on revised clinical references are much more faithful, informative, and fluent than models trained on original or filtered data.", "track": "Summarization", "label": 14, "url": "https://www.semanticscholar.org/reader/933d1d4f18e721160ddbf8dab25c33f8e3d2cec7?experiments=&features=reader_skimming%3Atrue"}, {"loc": [5.655788421630859, 6.289561748504639], "id": 2627, "title": "Towards Intention Understanding in Suicidal Risk Assessment with Natural Language Processing", "authors": "Shaoxiong Ji", "abstract": "Recent applications of natural language processing techniques to suicidal ideation detection and risk assessment frame the detection or assessment task as a text classification problem. \nRecent advances have developed many models, especially deep learning models, to boost predictive performance.\nThough the performance (in terms of aggregated evaluation scores) is improving, this position paper urges that better intention understanding is required for reliable suicidal risk assessment with computational methods. \nThis paper reflects the state of natural language processing applied to suicide-associated text classification tasks, differentiates suicidal risk assessment and intention understanding, and points out potential limitations of sentiment features and pretrained language models in suicidal intention understanding.\nBesides, it urges the necessity for sequential intention understanding and risk assessment, discusses some critical issues in evaluation such as uncertainty, and studies the lack of benchmarks.", "track": "Theme Track", "label": 18, "url": ""}, {"loc": [5.494220733642578, 5.096099853515625], "id": 2631, "title": "On the Impact of Temporal Concept Drift on Model Explanations", "authors": "Zhixue Zhao, George Chrysostomou, Kalina Bontcheva and Nikolaos Aletras", "abstract": "Explanation faithfulness of model predictions in natural language processing is typically evaluated on held-out data from the same temporal distribution as the training data (i.e. synchronous settings). While model performance often deteriorates due to temporal variation (i.e. temporal concept drift), it is currently unknown how explanation faithfulness is impacted when the time span of the target data is different from the data used to train the model (i.e. asynchronous settings). For this purpose, we examine the impact of temporal variation on model explanations extracted by eight feature attribution methods and three select-then-predict models across six text classification tasks. Our experiments show that (i) faithfulness is not consistent under temporal variations across feature attribution methods (e.g. it decreases or increases depending on the method), with an attention-based method demonstrating the most robust faithfulness scores across datasets; and (ii) select-then-predict models are mostly robust in asynchronous settings with only small degradation in predictive performance. Finally, feature attribution methods show conflicting behavior when used in FRESH (i.e. a select-and-predict model) and for measuring sufficiency/comprehensiveness (i.e. as post-hoc methods), suggesting that we need more robust metrics to evaluate post-hoc explanation faithfulness. Code will be made publicly available.", "track": "Interpretability, Interactivity and Analysis of Models for NLP", "label": 9, "url": "https://www.semanticscholar.org/reader/eae0fdca3762311b9cbd6a668f1ef632cbe2a1b1?experiments=&features=reader_skimming%3Atrue"}, {"loc": [5.0448689460754395, 12.501559257507324], "id": 2668, "title": "Text-Only Training for Image Captioning using Noise-Injected CLIP", "authors": "David Nukrai, Ron Mokady and Amir Globerson", "abstract": "We consider the task of image-captioning using only the CLIP model and additional text data at training time and no additional captioned images. Our approach relies on the fact that CLIP is trained to make visual and textual embeddings similar. Therefore, we only need to learn how to translate CLIP textual embeddings back into text, and we can learn how to do this by learning a decoder for the frozen CLIP text encoder using only text. We argue that this intuition is \"almost correct\" because of a gap between the embedding spaces, and propose to rectify this via noise injection during training. We demonstrate the effectiveness of our approach by showing SOTA zero-shot image captioning across four benchmarks, including style transfer. \nCode, data, and models are available at https://github.com/DavidHuji/CapDec.", "track": "Speech, Vision, Robotics, Multimodal Grounding", "label": 7, "url": ""}, {"loc": [8.737630844116211, 8.278707504272461], "id": 2678, "title": "Improving Sharpness-Aware Minimization with Fisher Mask for Better Generalization on Language Models", "authors": "Qihuang Zhong, Liang Ding, Li Shen, Peng Mi, Juhua Liu, Bo Du and Dacheng Tao", "abstract": "Fine-tuning large pretrained language models on a limited training corpus usually suffers from poor generalization. Prior works show that the recently-proposed sharpness-aware minimization (SAM) optimization method can improve the model generalization. However, SAM adds a perturbation to each model parameter equally (but not all parameters contribute equally to the optimization of training), which we argue is sub-optimal and will lead to excessive computation. In this paper, we propose a novel optimization procedure, namely FSAM, which introduces a Fisher mask to improve the efficiency and performance of SAM. In short, instead of adding perturbation to all parameters, FSAM uses the Fisher information to identity the important parameters and formulates a Fisher mask to obtain the sparse perturbation, i.e., making the optimizer focus on these important parameters. Experiments on various tasks in GLUE and SuperGLUE benchmarks show that FSAM consistently outperforms the vanilla SAM by 0.67~1.98 average score among four different pretrained models. We also empirically show that FSAM works well in other complex scenarios, e.g., fine-tuning on generation tasks or limited training data. Encouragingly, when training data is limited, FSAM improves the SAM by a large margin, i.e., up to 15.1.", "track": "Machine Learning for NLP", "label": 3, "url": "https://www.semanticscholar.org/reader/15292ec8582514311e4460629361d0ec76882343?experiments=&features=reader_skimming%3Atrue"}, {"loc": [4.583014488220215, 4.497382164001465], "id": 2680, "title": "TINA: Textual Inference with Negation Augmentation", "authors": "Chadi Helwe, Simon Coumes, Chlo\u00e9 Clavel and Fabian Suchanek", "abstract": "Transformer-based language models achieve state-of-the-art results on several natural language processing tasks. One of these is textual entailment, i.e., the task of determining whether a premise logically entails a hypothesis. However, the models perform poorly on this task when the examples contain negations. In this paper, we propose a new definition of textual entailment that captures also negation. This allows us to develop TINA (Textual Inference with Negation Augmentation), a principled technique for negated data augmentation that can be combined with the unlikelihood loss function.\nOur experiments with different transformer-based models show that our method can significantly improve the performance of the models on textual entailment datasets with negation -- without sacrificing performance on datasets without negation.", "track": "Semantics: Lexical, Sentence level, Textual Inference and Other areas", "label": 8, "url": ""}, {"loc": [9.31785774230957, 6.230337142944336], "id": 2685, "title": "Improving Bilingual Lexicon Induction with Cross-Encoder Reranking", "authors": "Yaoyiran Li, Fangyu Liu, Ivan Vuli\u0107 and Anna Korhonen", "abstract": "Bilingual lexicon induction (BLI) with limited bilingual supervision is a crucial yet challenging task in multilingual NLP. Current state-of-the-art BLI methods rely on the induction of cross-lingual word embeddings (CLWEs) to capture cross-lingual word similarities; such CLWEs are obtained <b>1)</b> via traditional static models (e.g., VecMap), or <b>2)</b> by extracting type-level CLWEs from multilingual pretrained language models (mPLMs), or <b>3)</b> through combining the former two options. In this work, we propose a novel semi-supervised <i>post-hoc</i> reranking method termed <b>BLICEr</b> (<b>BLI</b> with <b>C</b>ross-<b>E</b>ncoder <b>R</b>eranking), applicable to any precalculated CLWE space, which improves their BLI capability. The key idea is to 'extract' cross-lingual lexical knowledge from mPLMs, and then combine it with the original CLWEs. This crucial step is done via <b>1)</b> creating a word similarity dataset, comprising positive word pairs (i.e., true translations) and hard negative pairs induced from the original CLWE space, and then <b>2)</b> fine-tuning an mPLM (e.g., mBERT or XLM-R) in a cross-encoder manner to predict the similarity scores. At inference, we <b>3)</b> combine the similarity score from the original CLWE space with the score from the BLI-tuned cross-encoder. BLICEr establishes new state-of-the-art results on two standard BLI benchmarks spanning a wide spectrum of diverse languages: it substantially outperforms a series of strong baselines across the board. We also validate the robustness of BLICEr with different CLWEs.", "track": "Multilinguality", "label": 13, "url": ""}, {"loc": [2.1346378326416016, 4.778950214385986], "id": 2694, "title": "Mixed-modality Representation Learning and Pre-training for Joint Table-and-Text Retrieval in OpenQA", "authors": "Junjie Huang, Wanjun Zhong, Qian Liu, Ming Gong, Daxin Jiang and Nan Duan", "abstract": "Retrieving evidences from tabular and textual resources is essential for open-domain question answering (OpenQA), which provides more comprehensive information. However, training an effective dense table-text retriever is difficult due to the challenges of table-text discrepancy and data sparsity problem. To address the above challenges, we introduce an optimized OpenQA Table-Text Retriever (OTTeR) to jointly retrieve tabular and textual evidences. Firstly, we propose to enhance mixed-modality representation learning via two mechanisms: modality-enhanced representation and mixed-modality negative sampling strategy. Secondly, to alleviate data sparsity problem and enhance the general retrieval ability, we conduct retrieval-centric mixed-modality synthetic pre-training. Experimental results demonstrate that OTTeR substantially improves the performance of table-and-text retrieval on the OTT-QA dataset. Comprehensive analyses examine the effectiveness of all the proposed mechanisms. Besides, equipped with OTTeR, our OpenQA system achieves the state-of-the-art result on the downstream QA task, with 10.1\\% absolute improvement in terms of the exact match over the previous best system. \\footnote{All the code and data are available at \\url{https://github.com/Jun-jie-Huang/OTTeR}.}", "track": "Information Retrieval and Text Mining", "label": 15, "url": "https://www.semanticscholar.org/reader/6f8ffdf8493323baadb2eb4b8c70f2d7084474f8?experiments=&features=reader_skimming%3Atrue"}, {"loc": [8.984067916870117, 6.252177715301514], "id": 2705, "title": "The Effects of Corpus Choice and Morphosyntax on Multilingual Space Induction", "authors": "Vinit Ravishankar and Joakim Nivre", "abstract": "In an effort to study the inductive biases of language models, numerous studies have attempted to use linguistically motivated tasks as a proxy of sorts, wherein performance on these tasks would imply an inductive bias towards a specific linguistic phenomenon. In this study, we attempt to analyse the inductive biases of language models with respect to natural language phenomena, in the context of building multilingual embedding spaces.\n\nWe sample corpora from 2 sources in 15 languages and train language models on pseudo-bilingual variants of each corpus, created by duplicating each corpus and shifting token indices for half the resulting corpus. We evaluate the cross-lingual capabilities of these LMs, and show that while correlations with language families tend to be weak, other corpus-level characteristics, such as type-token ratio, tend to be more strongly correlated. Finally, we show that multilingual spaces can be built, albeit less effectively, even when additional destructive perturbations are applied to the training corpora, implying that (effectively) bag-of-words models also have an inductive bias that is sufficient for inducing multilingual spaces.", "track": "Multilinguality", "label": 13, "url": ""}, {"loc": [4.057755947113037, 7.518723487854004], "id": 2712, "title": "Modeling Complex Dialogue Mappings via Sentence Semantic Segmentation Guided Conditional Variational Auto-Encoder", "authors": "Bin Sun, Shaoxiong Feng, Yiwei Li, Weichao Wang, Fei Mi, Yitong Li and Kan Li", "abstract": "Complex dialogue mappings (CDM), including one-to-many and many-to-one mappings, tend to make dialogue models generate incoherent or dull responses, and modeling these mappings remains a huge challenge for neural dialogue systems. To alleviate these problems, methods like introducing external information, reconstructing the optimization function, and manipulating data samples are proposed, while they primarily focus on avoiding training with CDM, inevitably weakening the model's ability of understanding CDM in human conversations and limiting further improvements in model performance. This paper proposes a Sentence Semantic Segmentation guided Conditional Variational Auto-Encoder (SegCVAE) method which can model and take advantages of the CDM data. Specifically, to tackle the incoherent problem caused by one-to-many, SegCVAE uses response-related prominent semantics to constrained the latent variable. To mitigate the non-diverse problem brought by many-to-one, SegCVAE segments multiple prominent semantics to enrich the latent variables. Three novel components, Internal Separation, External Guidance, and Semantic Norms, are proposed to achieve SegCVAE. On dialogue generation tasks, both the automatic and human evaluation results show that SegCVAE achieves new state-of-the-art performance.", "track": "Dialogue and Interactive Systems", "label": 4, "url": ""}, {"loc": [2.9457786083221436, 7.1463518142700195], "id": 2715, "title": "Graph Embeddings for Argumentation Quality Assessment", "authors": "Santiago Marro, Elena Cabrio and Serena Villata", "abstract": "Argumentation is used by people both internally, by evaluating arguments and counterarguments to make sense of a situation and take a decision, and externally, e.g., in a debate, by exchanging arguments to reach an agreement or to promote an individual position. In this context, the assessment of the quality of the arguments is of extreme importance, as it strongly influences the evaluation of the overall argumentation, impacting on the decision making process. The automatic assessment of the quality of natural language arguments is recently attracting interest in the Argument Mining field. However, the issue of automatically assessing the quality of an argumentation largely remains a challenging unsolved task. Our contribution is twofold: first, we present a novel resource of 402 student persuasive essays, where three main quality dimensions (i.e., cogency, rhetoric, and reasonableness) have been annotated, leading to 1908 arguments tagged with quality facets; second, we address this novel task of argumentation quality assessment proposing a novel neural architecture based on graph embeddings, that combines both the textual features of the natural language arguments and the overall argument graph, i.e., considering also the support and attack relations holding among the arguments. Results on the persuasive essays dataset outperform state-of-the-art and standard baselines' performance.", "track": "Sentiment Analysis, Stylistic Analysis, and Argument Mining", "label": 16, "url": ""}, {"loc": [0.5103975534439087, 7.130259990692139], "id": 2737, "title": "SMiLE: Schema-augmented Multi-level Contrastive Learning for Knowledge Graph Link Prediction", "authors": "Miao Peng, Ben Liu, Qianqian Xie, Wenjie Xu, Hua Wang and Min Peng", "abstract": "Link prediction is the task of inferring missing links between entities in knowledge graphs. Embedding-based methods have shown effectiveness in addressing this problem by modeling relational patterns in triples. However, the link prediction task often requires contextual information in entity neighborhoods, while most existing embedding-based methods fail to capture it. Additionally, little attention is paid to the diversity of entity representations in different contexts, which often leads to false prediction results. In this situation, we consider that the schema of knowledge graph contains the specific contextual information, and it is beneficial for preserving the consistency of entities across contexts. In this paper, we propose a novel Schema-augmented Multi-level contrastive LEarning framework (SMiLE) to conduct knowledge graph link prediction. Specifically, we first exploit network schema as the prior constraint to sample negatives and pre-train our model by employing a multi-level contrastive learning method to yield both prior schema and contextual information. Then we fine-tune our model under the supervision of individual triples to learn subtler representations for link prediction. Extensive experimental results on four knowledge graph datasets with thorough analysis of each component demonstrate the effectiveness of our proposed framework against state-of-the-art baselines. The implementation of SMiLE is available at https://github.com/GKNL/SMiLE.", "track": "Efficient Methods for NLP", "label": 12, "url": "https://www.semanticscholar.org/reader/722d1662f27ef33f7c5c3dfc9613f331e6e7e6d2?experiments=&features=reader_skimming%3Atrue"}, {"loc": [6.161717414855957, 12.386127471923828], "id": 2744, "title": "Multilingual Multimodal Learning with Machine Translated Text", "authors": "Chen Qiu, Dan Onea\u021b\u0103, Emanuele Bugliarello, Stella Frank and Desmond Elliott", "abstract": "Most vision-and-language pretraining research focuses on English tasks. However, the creation of multilingual multimodal evaluation datasets (e.g. Multi30K, xGQA, XVNLI, and MaRVL) poses a new challenge in finding high-quality training data that is both multilingual and multimodal. In this paper, we investigate whether machine translating English multimodal data can be an effective proxy for the lack of readily available multilingual data. We call this framework TD-MML: Translated Data for Multilingual Multimodal Learning, and it can be applied to any multimodal dataset and model. We apply it to both pretraining and fine-tuning data with a state-of-the-art model. In order to prevent models from learning from low-quality translated text, we propose two metrics for automatically removing such translations from the resulting datasets. In experiments on five tasks across 20 languages in the IGLUE benchmark, we show that translated data can provide a useful signal for multilingual multimodal learning, both at pretraining and fine-tuning.", "track": "Speech, Vision, Robotics, Multimodal Grounding", "label": 7, "url": "https://www.semanticscholar.org/reader/d3cf1287d2ae2c1102f6d1bc83d39d87e7159dfe?experiments=&features=reader_skimming%3Atrue"}, {"loc": [3.783978223800659, 9.837563514709473], "id": 2760, "title": "Learning From the Source Document: Unsupervised Abstractive Summarization", "authors": "Haojie Zhuang, Wei Emma Zhang, Jian Yang, Congbo Ma, Yutong Qu and Quan Z. Sheng", "abstract": "Most of the state-of-the-art methods for abstractive text summarization are under supervised learning settings, while heavily relying on high-quality and large-scale parallel corpora. In this paper, we remove the need for reference summaries and present an unsupervised learning method SCR (Summarize, Contrast and Review) for abstractive summarization, which leverages contrastive learning and is the first work to apply contrastive learning for unsupervised abstractive summarization. Particularly, we use the true source documents as positive source document examples, and strategically generated fake source documents as negative source document examples to train the model to generate good summaries. Furthermore, we consider and improve the writing quality of the generated summaries by guiding them to be similar to human-written texts. The promising results on extensive experiments show that SCR outperforms other unsupervised abstractive summarization baselines, which demonstrates its effectiveness.", "track": "Summarization", "label": 14, "url": ""}, {"loc": [7.4969611167907715, 12.305801391601562], "id": 2763, "title": "How to Do Things without Words: Modeling Semantic Drift of Emoji", "authors": "Eyal Arviv and Oren Tsur", "abstract": "Emoji have become a significant part of our informal textual communication. Previous work, addressing the societal and linguistic functions of emoji, overlooked the relation between the semantics and the visual variations of the symbols. In this paper we model and analyze the semantic drift of emoji and discuss the features that may be contributing to the drift, some are unique to emoji and some are more general. Specifically, we explore the relations between graphical changes and semantic changes.", "track": "Semantics: Lexical, Sentence level, Textual Inference and Other areas", "label": 8, "url": "https://www.semanticscholar.org/reader/e34abd57de0b8d7ca3141a15826c3b6696cacc9c?experiments=&features=reader_skimming%3Atrue"}, {"loc": [6.287376403808594, 5.739569187164307], "id": 2769, "title": "Mind Your Bias: A Critical Review of Bias Detection Methods for Contextual Language Models", "authors": "Silke Husse and Andreas Spitz", "abstract": "The awareness and mitigation of biases are of fundamental importance for the fair and transparent use of contextual language models, yet they crucially depend on the accurate detection of biases as a precursor. Consequently, numerous bias detection methods have been proposed, which vary in their approach, the considered type of bias, and the data used for evaluation. However, while most detection methods are derived from the word embedding association test for static word embeddings, the reported results are heterogeneous, inconsistent, and ultimately inconclusive. To address this issue, we conduct a rigorous analysis and comparison of bias detection methods for contextual language models. Our results show that minor design and implementation decisions (or errors) have a substantial and often significant impact on the derived bias scores. Overall, we find the state of the field to be both worse than previously acknowledged due to systematic and propagated errors in implementations, yet better than anticipated since divergent results in the literature homogenize after accounting for implementation errors. Based on our findings, we conclude with a discussion of paths towards more robust and consistent bias detection methods.", "track": "Language Modeling and Analysis of Language Models", "label": 2, "url": "https://www.semanticscholar.org/reader/f11f6066a92f20b71a8bc5c8a738ad78f073d095?experiments=&features=reader_skimming%3Atrue"}, {"loc": [8.085168838500977, 9.3946533203125], "id": 2782, "title": "ZeroPrompt: Scaling Prompt-Based Pretraining to 1,000 Tasks Improves Zero-Shot Generalization", "authors": "Hanwei Xu, Yujun Chen, Yulun Du, Nan Shao, wang yanggang, Haiyu Li and Zhilin Yang", "abstract": "We propose a multitask pretraining approach ZeroPrompt for zero-shot generalization, focusing on task scaling and zero-shot prompting.\nWhile previous models are trained on only a few dozen tasks, we scale to 1,000 tasks for the first time using real-world data. This leads to a crucial discovery that task scaling can be an efficient alternative to model scaling; i.e., the model size has less impact on performance with an extremely large number of tasks. Our results show that task scaling can improve training efficiency by 30 times in FLOPs.\nEmpirically, ZeroPrompt substantially improves both the efficiency and the performance of zero-shot learning across a variety of academic and production datasets.", "track": "Language Modeling and Analysis of Language Models", "label": 2, "url": ""}, {"loc": [2.3767037391662598, 7.324089050292969], "id": 2784, "title": "Semantic Role Labeling Meets Definition Modeling: Using Natural Language to Describe Predicate-Argument Structures", "authors": "Simone Conia, Edoardo Barba, Alessandro Scir\u00e8 and Roberto Navigli", "abstract": "One of the common traits of past and present approaches for Semantic Role Labeling (SRL) is that they rely upon discrete labels drawn from a predefined linguistic inventory to classify predicate senses and their arguments.\nHowever, we argue this need not be the case. In this paper, we present an approach that leverages Definition Modeling to introduce a generalized formulation of SRL as the task of describing predicate-argument structures using natural language definitions instead of discrete labels. Our novel formulation takes a first step towards placing interpretability and flexibility foremost, and yet our experiments and analyses on PropBank-style and FrameNet-style, dependency-based and span-based SRL also demonstrate that a flexible model with an interpretable output does not necessarily come at the expense of performance. We release our software for research purposes at https://github.com/SapienzaNLP/dsrl.", "track": "Semantics: Lexical, Sentence level, Textual Inference and Other areas", "label": 8, "url": ""}, {"loc": [6.932897567749023, 5.943874835968018], "id": 2787, "title": "Is anisotropy really the cause of BERT embeddings not being semantic?", "authors": "Alejandro Fuster Baggetto and Victor Fresno", "abstract": "In this paper we conduct a set of experiments aimed to improve our understanding of the lack of semantic isometry in BERT, i.e. the lack of correspondence between the embedding and meaning spaces of its contextualized word representations. Our empirical results show that, contrary to popular belief, the anisotropy is not the root cause of the poor performance of these contextual models' embeddings in semantic tasks. What does affect both the anisotropy and semantic isometry is a set of known biases: frequency, subword, punctuation, and case. For each one of them, we measure its magnitude and the effect of its removal, showing that these biases contribute but do not completely explain the phenomenon of anisotropy and lack of semantic isometry of these contextual language models.", "track": "Theme Track", "label": 18, "url": ""}, {"loc": [10.240006446838379, 6.948047161102295], "id": 2800, "title": "m^4 Adapter: Multilingual Multi-Domain Adaptation for Machine Translation with a Meta-Adapter", "authors": "Wen Lai, Alexandra Chronopoulou and Alexander Fraser", "abstract": "Multilingual neural machine translation models (MNMT) yield state-of-the-art performance when evaluated on data from a domain and language pair seen at training time. However, when a MNMT model is used to translate under domain shift or to a new language pair, performance drops dramatically. We consider a very challenging scenario: adapting the MNMT model both to a new domain and to a new language pair at the same time. In this paper, we propose m^4Adapter (Multilingual Multi-Domain Adaptation for Machine Translation with a Meta-Adapter), which combines domain and language knowledge using meta-learning with adapters. We present results showing that our approach is a parameter-efficient solution which effectively adapts a model to both a new language pair and a new domain, while outperforming other adapter methods. An ablation study also shows that our approach more effectively transfers domain knowledge across different languages and language information across different domains.", "track": "Machine Translation", "label": 10, "url": "https://www.semanticscholar.org/reader/ec5cbde54ce5121fa1f847d786a3929ddd6c68d9?experiments=&features=reader_skimming%3Atrue"}, {"loc": [4.06857967376709, 3.9447531700134277], "id": 2806, "title": "Textual Enhanced Contrastive Learning for Solving Math Word Problems", "authors": "Yibin Shen, Qianying Liu, Zhuoyuan Mao, Fei Cheng and Sadao Kurohashi", "abstract": "Solving math word problems is the task that analyses the relation of quantities and requires an accurate understanding of contextual natural language information. Recent studies show that current models rely on shallow heuristics to predict solutions and could be easily misled by small textual perturbations. To address this problem, we propose a Textual Enhanced Contrastive Learning framework, which enforces the models to distinguish semantically similar examples while holding different mathematical logic. We adopt a self-supervised manner strategy to enrich examples with subtle textual variance by textual reordering or problem re-construction. We then retrieve the hardest to differentiate samples from both equation and textual perspectives and guide the model to learn their representations. Experimental results show that our method achieves state-of-the-art on both widely used benchmark datasets and also exquisitely designed challenge datasets in English and Chinese.", "track": "Question Answering", "label": 11, "url": ""}, {"loc": [10.606300354003906, 6.930465221405029], "id": 2846, "title": "What Do Compressed Multilingual Machine Translation Models Forget?", "authors": "Alireza Mohammadshahi, Vassilina Nikoulina, Alexandre Berard, Caroline Brun, James Henderson and Laurent Besacier", "abstract": "Recently, very large pre-trained models achieve state-of-the-art results in various natural language processing (NLP) tasks, but their size makes it more challenging to apply them in resource-constrained environments. Compression techniques allow to drastically reduce the size of the models and therefore their inference time with negligible impact on top-tier metrics.  However,  the general performance averaged across multiple tasks and/or languages may hide a drastic performance drop on under-represented features, which could result in the amplification of biases encoded by the models. \nIn this work, we assess the impact of compression methods on Multilingual Neural Machine Translation models (MNMT) for various language groups, gender, and semantic biases by extensive analysis of compressed models on different machine translation benchmarks,  i.e. FLORES-101, MT-Gender, and DiBiMT.  We show that the performance of under-represented languages drops significantly, while the average BLEU metric only slightly decreases. Interestingly, the removal of noisy memorization with compression leads to a significant improvement for some medium-resource languages. Finally, we demonstrate that compression amplifies intrinsic gender and semantic biases, even in high-resource languages.", "track": "Machine Translation", "label": 10, "url": ""}, {"loc": [4.281546592712402, 7.545773506164551], "id": 2849, "title": "Controllable Dialogue Simulation with In-context Learning", "authors": "Zekun Li, Wenhu Chen, Shiyang Li, Hong Wang, Jing Qian and Xifeng Yan", "abstract": "Building dialogue systems requires a large corpus of annotated dialogues. Such datasets are usually created via crowdsourcing, which is expensive and time-consuming. In this paper, we propose \\textsc{Dialogic}, a novel dialogue simulation method based on large language model in-context learning to automate dataset creation. Seeded with a few annotated dialogues, \\textsc{Dialogic} automatically selects in-context examples for demonstration and prompts GPT-3 to generate new dialogues and annotations in a controllable way. Our method can rapidly expand a small set of dialogue data with minimum or zero \\textit{human involvement} and \\textit{parameter update} and is thus much more cost-efficient and time-saving than crowdsourcing. Experimental results on the MultiWOZ dataset demonstrate that training a model on the simulated dialogues leads to even better performance than using the same amount of human-generated dialogues under the challenging low-resource settings, with as few as 85 dialogues as a seed. When the full training set is given, our method can still serve as an effective data augmentation method to further improve performance. Human evaluation results show that our simulated dialogues have near-human fluency and annotation accuracy. The code and data are available at \\textbf{\\url{https://github.com/Leezekun/dialogic}}.", "track": "Dialogue and Interactive Systems", "label": 4, "url": ""}, {"loc": [2.7393853664398193, 8.892248153686523], "id": 2856, "title": "Improving the Factual Correctness of Radiology Report Generation with Semantic Rewards", "authors": "Jean-Benoit Delbrouck, Pierre Chambon, Christian Bluethgen, Emily Tsai, Omar Almusa and Curtis Langlotz", "abstract": "Neural image-to-text radiology report generation systems offer the potential to improve radiology reporting by reducing the repetitive process of report drafting and identifying possible medical errors. These systems have achieved promising performance as measured by widely used NLG metrics such as BLEU and CIDEr. However, the current systems face important limitations. First, they present an increased complexity in architecture that offers only marginal improvements on NLG metrics. Secondly, these systems that achieve high performance on these metrics are not always factually complete or consistent due to both inadequate training and evaluation. Recent studies have shown the systems can be substantially improved by using new methods encouraging 1) the generation of domain entities consistent with the reference and 2) describing these entities in inferentially consistent ways. So far, these methods rely on weakly-supervised approaches (rule-based) and named entity recognition systems that are not specific to the chest X-ray domain. To overcome this limitation, we propose a new method, the RadGraph reward, to further improve the factual completeness and correctness of generated radiology reports. More precisely, we leverage the RadGraph dataset containing annotated chest X-ray reports with entities and relations between entities. On two open radiology report datasets, our system substantially improves the scores up to 14.2% and 25.3% on metrics evaluating the factual correctness and completeness of reports.", "track": "Natural Language Generation", "label": 6, "url": "https://www.semanticscholar.org/reader/9a3ecfc83662476cd6d7a3f41ca628e9d8d9f9fd?experiments=&features=reader_skimming%3Atrue"}, {"loc": [7.384744167327881, 7.112301349639893], "id": 2858, "title": "Recursive Neural Networks with Bottlenecks Diagnose (Non-)Compositionality", "authors": "Verna Dankers and Ivan Titov", "abstract": "A recent line of work in NLP focuses on the (dis)ability of models to generalise compositionally for artificial languages.\nHowever, when considering natural language tasks, the data involved is not strictly, or locally, compositional.\nQuantifying the compositionality of data is a challenging task, which has been investigated primarily for short utterances.\nWe use recursive neural models (Tree-LSTMs) with bottlenecks that limit the transfer of information between nodes.\nWe illustrate that comparing data's representations in models with and without the bottleneck can be used to produce a compositionality metric.\nThe procedure is applied to the evaluation of arithmetic expressions using synthetic data, and sentiment classification using natural language data.\nWe demonstrate that compression through a bottleneck impacts non-compositional examples disproportionately\nand then use the bottleneck compositionality metric (BCM) to distinguish compositional from non-compositional samples, yielding a compositionality ranking over a dataset.", "track": "Interpretability, Interactivity and Analysis of Models for NLP", "label": 9, "url": ""}, {"loc": [8.762787818908691, 6.923155784606934], "id": 2897, "title": "HumSet: Dataset of Multilingual Information Extraction and Classification for Humanitarian Crises Response", "authors": "Selim Fekih, Nicolo' Tamagnone, Benjamin Minixhofer, Ranjan Shrestha, Ximena Contla, Ewan Oglethorpe and Navid Rekabsaz", "abstract": "Timely and effective response to humanitarian crises requires quick and accurate analysis of large amounts of text data \u2013 a process that can highly benefit from expert-assisted NLP systems trained on validated and annotated data in the humanitarian response domain. To enable creation of such NLP systems, we introduce and release HumSet, a novel and rich multilingual dataset of humanitarian response documents annotated by experts in the humanitarian response community. The dataset provides documents in three languages (English, French, Spanish) and covers a variety of humanitarian crises from 2018 to 2021 across the globe. For each document, HUMSET provides selected snippets (entries) as well as assigned classes to each entry annotated using common humanitarian information analysis frameworks. HUMSET also provides novel and challenging entry extraction and multi-label entry classification tasks. In this paper, we take a first step towards approaching these tasks and conduct a set of experiments on Pre-trained Language Models (PLM) to establish strong baselines for future research in this domain. The dataset is available at https://blog.thedeep.io/humset/.", "track": "Resources and Evaluation", "label": 1, "url": "https://www.semanticscholar.org/reader/199b2d3e76c8237e38572f1b74dc2081723db526?experiments=&features=reader_skimming%3Atrue"}, {"loc": [10.595967292785645, 7.622678756713867], "id": 2901, "title": "Viterbi Decoding of Directed Acyclic Transformer for Non-Autoregressive Machine Translation", "authors": "Chenze Shao, Zhengrui Ma and Yang Feng", "abstract": "Non-autoregressive models achieve significant decoding speedup in neural machine translation but lack the ability to capture sequential dependency. Directed Acyclic Transformer (DA-Transformer) was recently proposed to model sequential dependency with a directed acyclic graph. Consequently, it has to apply a sequential decision process at inference time, which harms the global translation accuracy. In this paper, we present a Viterbi decoding framework for DA-Transformer, which guarantees to find the joint optimal solution for the translation and decoding path under any length constraint. Experimental results demonstrate that our approach consistently improves the performance of DA-Transformer while maintaining a similar decoding speedup.", "track": "Machine Translation", "label": 10, "url": "https://www.semanticscholar.org/reader/75760fee314a73339b13fd8aa3686964396a54af?experiments=&features=reader_skimming%3Atrue"}, {"loc": [6.90501070022583, 6.350910663604736], "id": 2907, "title": "Lexical Generalization Improves with Larger Models and Longer Training", "authors": "Elron Bandel, Yoav Goldberg and Yanai Elazar", "abstract": "While fine-tuned language models perform well on many language tasks, they were also shown to rely on superficial surface features such as lexical overlap. Excessive utilization of such heuristics can lead to failure on challenging inputs. We analyze the use of lexical overlap heuristics in natural language inference, paraphrase detection, and reading comprehension (using a novel contrastive dataset),\nand find that larger models are much less susceptible to adopting lexical overlap heuristics. We also find that longer training leads models to abandon lexical overlap heuristics. Finally, We provide evidence that the disparity between models size has its source in the pre-trained model.", "track": "Language Modeling and Analysis of Language Models", "label": 2, "url": ""}, {"loc": [4.461104393005371, 4.851218223571777], "id": 2920, "title": "Realistic Data Augmentation Framework for Enhancing Tabular Reasoning", "authors": "Dibyakanti Kumar, Vivek Gupta, Soumya Sharma and Shuo Zhang", "abstract": "Existing approaches to constructing training data for Natural Language Inference (NLI) tasks, such as for semi-structured table reasoning, are either via crowdsourcing or fully automatic methods. However, the former is expensive and time consuming and thus limits scale, and the latter often produces naive examples that may lack complex reasoning. This paper develops a realistic semi-automated framework for data augmentation for tabular inference. Instead of manually generating a hypothesis for each table, our methodology generates hypothesis templates transferable to similar tables. In addition, our framework entails the creation of rational counterfactual tables based on human written logical constraints and premise paraphrasing. For our case study, we use the INFOTABS (Gupta et al., 2020), which is an entity centric tabular inference dataset. We observed that our framework could generate human-like tabular inference examples, which could benefit training data augmentation, especially in the scenario with limited supervision.", "track": "Semantics: Lexical, Sentence level, Textual Inference and Other areas", "label": 8, "url": "https://www.semanticscholar.org/reader/2a5de8118bf4871b13197d85d8858d875a6106a6?experiments=&features=reader_skimming%3Atrue"}, {"loc": [5.807241439819336, 6.0446038246154785], "id": 2930, "title": "Inducing Generalizable and Interpretable Lexica", "authors": "Yilin Geng, Zetian Wu, Roshan Santhosh, Tejas Srivastava, Lyle Ungar and Jo\u00e3o Sedoc", "abstract": "Lexica \u2013 words and associated scores \u2013 are widely used as simple, interpretable, generalizable language features to predict sentiment, emotions, mental health, and personality. They also provide insight into the psychological features behind those moods and traits. Such lexica, historically created by human experts, are valuable to linguists, psychologists, and social scientists, but they take years of refinement and have limited coverage. In this paper, we investigate how the lexica that provide psycholinguistic insights could be computationally induced and how they should be assessed. We identify generalizability and interpretability as two essential properties of such lexica. We induce lexica using both context-oblivious and context-aware approaches, compare their predictive performance both within the training corpus and across various corpora, and evaluate their quality using crowd-worker assessment. We find that lexica induced from context-oblivious models are more generalizable and interpretable than those from more accurate context-aware transformer models. In addition, lexicon scores can identify explanatory words more reliably than a high performing transformer with feature-importance measures like SHAP.", "track": "Interpretability, Interactivity and Analysis of Models for NLP", "label": 9, "url": ""}, {"loc": [7.066840648651123, 6.204687118530273], "id": 2931, "title": "The Curious Case of Absolute Position Embeddings", "authors": "Koustuv Sinha, Amirhossein Kazemnejad, Siva Reddy, Joelle Pineau, Dieuwke Hupkes and Adina Williams", "abstract": "Transformer language models encode the notion of word order using positional information. Most commonly, this positional information is represented by absolute position embeddings (APEs), that are learned from the pretraining data. However, in natural language, it is not absolute position that matters, but relative position, and the extent to which APEs can capture this type of information has not been studied. In this work, we observe that models trained with APE over-rely on positional information to the point that they break-down when subjected to sentences with shifted position information. Specifically, when models are subjected to sentences starting from a non-zero position (excluding the effect of priming), they exhibit noticeably degraded performance on zero- to full-shot tasks, across a range of model families and model sizes. Our findings raise questions about the efficacy of APEs to model the relativity of position information, and invite further introspection on the sentence and word order processing strategies employed by these models.", "track": "Language Modeling and Analysis of Language Models", "label": 2, "url": "https://www.semanticscholar.org/reader/97833e2aa0da5240e62436373b58af988a4ab6ab?experiments=&features=reader_skimming%3Atrue"}, {"loc": [5.683578968048096, 10.633499145507812], "id": 2943, "title": "Goal-oriented Vision-and-Dialog Navigation via Reinforcement Learning", "authors": "Yan Cao, Keting Lu, David DeFazio and Shiqi Zhang", "abstract": "Vision-and-dialog navigation is a recent benchmark for evaluating the AI capabilities of perception, interaction, and decision making. While existing methods developed for this benchmark have demonstrated great successes, they mostly rely on large datasets, where data collection can be a challenge, and the learned policies are not adaptive to domain changes. In this paper, we focus on a new problem, referred to as goal-oriented vision-and-dialog navigation (GVDN), where an agent uses reinforcement learning techniques to compute dialog-navigation policies from trial and error. A robot conducts visual navigation to locate target objects, and can talk to a remote human operator as needed. Our remote human is able to provide guidance on navigation only if the robot correctly conveys its location through dialog. Experiments have been conducted using photo-realistic simulation environments. Results suggest that, our agent outperforms competitive baselines in success rate.", "track": "Dialogue and Interactive Systems", "label": 4, "url": ""}, {"loc": [4.398736953735352, 4.777635097503662], "id": 2947, "title": "Leveraging Data Recasting to Enhance Tabular Reasoning", "authors": "Aashna Jena, Vivek Gupta, Manish Shrivastava and Julian Martin Eisenschlos", "abstract": "Creating challenging tabular inference data is essential for learning complex reasoning. Prior work has mostly relied on two data generation strategies. The first is human annotation, which yields linguistically diverse data but is difficult to scale. The second category for creation is synthetic generation, which is scalable and cost effective but lacks inventiveness. In this research, we present a framework for semi-automatically recasting existing tabular data to make use of the benefits of both approaches. We utilize our framework to build tabular NLI instances from five datasets that were initially intended for tasks like table2text creation, tabular Q/A, and semantic parsing. We demonstrate that recasted data could be used as evaluation benchmarks as well as augmentation data to enhance performance on tabular NLI tasks. Furthermore, we investigate the effectiveness of models trained on recasted data in the zero-shot scenario, and analyse trends in performance across different recasted datasets types.", "track": "Semantics: Lexical, Sentence level, Textual Inference and Other areas", "label": 8, "url": ""}, {"loc": [2.424914836883545, 8.633315086364746], "id": 2951, "title": "Thinking about GPT-3 In-Context Learning for Biomedical IE? Think Again", "authors": "Bernal Jimenez Gutierrez, Nikolas McNeal, Clayton B. Washington, You Chen, Lang Li, Huan Sun and Yu Su", "abstract": "Large pre-trained language models (PLMs) such as GPT-3 have shown strong in-context learning capabilities, which are highly appealing for domains such as biomedicine that feature high and diverse demands of language technologies but also high data annotation costs. In this paper, we present the first systematic and comprehensive study to compare the few-shot performance of GPT-3 in-context learning with fine-tuning smaller (i.e., BERT-sized) PLMs on two representative biomedical information extraction (IE) tasks: named entity recognition and relation extraction. We follow the true few-shot setting to avoid overestimating models' few-shot performance by model selection over a large validation set. We also optimize GPT-3's performance with known techniques such as contextual calibration and dynamic in-context example retrieval. However, our results show that GPT-3 still significantly underperforms compared to simply fine-tuning a smaller PLM. In addition, GPT-3 in-context learning also yields smaller gains in accuracy when more training data becomes available. More in-depth analyses further reveal issues of in-context learning that may be detrimental to IE tasks in general. Given the high cost of experimenting with GPT-3, we hope our study provides helpful guidance for biomedical researchers and practitioners towards more practical solutions such as fine-tuning small PLMs before better in-context learning is available for biomedical IE.", "track": "Information Extraction", "label": 5, "url": "https://www.semanticscholar.org/reader/cfc12c38a4d848ff3c4225488a2c72e7d4300f4b?experiments=&features=reader_skimming%3Atrue"}, {"loc": [7.010500907897949, 6.301388263702393], "id": 2956, "title": "Attention weights accurately predict language representations in the brain", "authors": "Mathis Lamarre, Catherine Chen and Fatma Deniz", "abstract": "In Transformer-based language models (LMs) the attention mechanism converts token embeddings into contextual embeddings that incorporate information from neighboring words. The resulting contextual hidden state embeddings have enabled highly accurate models of brain responses, suggesting that the attention mechanism constructs contextual embeddings that carry information reflected in language-related brain representations. However, it is unclear whether the attention weights that are used to integrate information across words are themselves related to language representations in the brain. To address this question we analyzed functional magnetic resonance imaging (fMRI) recordings of participants reading English language narratives. We provided the narrative text as input to two LMs (BERT and GPT-2) and extracted their corresponding attention weights. We then used encoding models to determine how well attention weights can predict recorded brain responses. We find that attention weights accurately predict brain responses in much of the frontal and temporal cortices. Our results suggest that the attention mechanism itself carries information that is reflected in brain representations. Moreover, these results indicate cortical areas in which context integration may occur.", "track": "Linguistic Theories, Cognitive Modeling and Psycholinguistics", "label": 22, "url": ""}, {"loc": [7.439350605010986, 5.8168158531188965], "id": 2967, "title": "Improving HowNet-Based Chinese Word Sense Disambiguation with Translations", "authors": "xiang zhang, Bradley Hauer and Grzegorz Kondrak", "abstract": "Word sense disambiguation (WSD) is the task of identifying the intended sense of a word in context. While prior work on unsupervised WSD has leveraged lexical knowledge bases, such as WordNet and BabelNet, these resources have proven to be less effective for Chinese. Instead, the most widely used lexical knowledge base for Chinese is HowNet. Previous HowNet-based WSD methods have not exploited contextual translation information. In this paper, we present the first HowNet-based WSD system which combines monolingual contextual information from a pretrained neural language model with bilingual information obtained via machine translation and sense translation information from HowNet. The results of our evaluation experiment on a test set from prior work demonstrate that our new method achieves a new state of the art for unsupervised Chinese WSD.", "track": "Semantics: Lexical, Sentence level, Textual Inference and Other areas", "label": 8, "url": ""}, {"loc": [2.145115852355957, 7.550420761108398], "id": 2970, "title": "Mask-then-Fill: A Flexible and Effective Data Augmentation Framework for Event Extraction", "authors": "Jun Gao, Changlong Yu, Wei Wang, Huan Zhao and Ruifeng Xu", "abstract": "We present Mask-then-Fill, a flexible and effective data augmentation framework for event extraction. Our approach allows for more flexible manipulation of text and thus can generate more diverse data while keeping the original event structure unchanged as much as possible. Specifically, it first randomly masks out an adjunct sentence fragment and then infills a variable-length text span with a fine-tuned infilling model. The main advantage lies in that it can replace a fragment of arbitrary length in the text with another fragment of variable length, compared to the existing methods which can only replace a single word or a fixed-length fragment. On trigger and argument extraction tasks, the proposed framework is more effective than baseline methods and it demonstrates particularly strong results in the low-resource setting. Our further analysis shows that it achieves a good balance between diversity and distributional similarity.", "track": "Information Extraction", "label": 5, "url": ""}, {"loc": [4.655350208282471, 9.159080505371094], "id": 2972, "title": "MOBA-E2C: Generating MOBA Game Commentaries via Capturing Highlight Events from the Meta-Data", "authors": "Dawei Zhang, Sixing Wu, Yao Guo and Xiangqun Chen", "abstract": "MOBA (Multiplayer Online Battle Arena) games such as Dota2 are currently one of the most popular e-sports gaming genres. Following professional commentaries is a great way to understand and enjoy a MOBA game. However, massive game competitions lack commentaries because of the shortage of professional human commentators. As an alternative, employing machine commentators that can work at any time and place is a feasible solution. \nConsidering the challenges in modeling MOBA games, we propose a data-driven MOBA commentary generation framework, MOBA-E2C, allowing a model to generate commentaries based on the game meta-data. Subsequently, to alleviate the burden of collecting supervised data, we propose a MOBA-FuseGPT generator to generate MOBA game commentaries by fusing the power of a rule-based generator and a generative GPT generator. Finally, in the experiments, we take a popular MOBA game Dota2 as our case and construct a Chinese Dota2 commentary generation dataset Dota2-Commentary. Experimental results demonstrate the superior performance of our approach. To the best of our knowledge, this work is the first Dota2 machine commentator and Dota2-Commentary is the first dataset.", "track": "NLP Applications", "label": 0, "url": ""}, {"loc": [6.021492958068848, 8.31048583984375], "id": 2977, "title": "Enhancing Automatic Readability Assessment with Pre-training and Soft Labels for Ordinal Regression", "authors": "Jinshan Zeng, Yudong Xie, Xianglong Yu, John Lee and Ding-Xuan Zhou", "abstract": "The readability assessment task aims to assign a difficulty grade to a text. While neural models have recently demonstrated impressive performance, most do not exploit the ordinal nature of the difficulty grades, and make little effort for model initialization to facilitate fine-tuning. We address these limitations with soft labels for ordinal regression, and with model pre-training through prediction of pairwise relative text difficulty. We incorporate these two components into a model based on hierarchical attention networks, and evaluate its performance on both English and Chinese datasets. Experimental results show that our proposed model outperforms competitive neural models and statistical classifiers on most datasets.", "track": "Machine Learning for NLP", "label": 3, "url": ""}, {"loc": [4.632043361663818, 6.651770114898682], "id": 2985, "title": "Opening up Minds with Argumentative Dialogues", "authors": "Youmna Farag, Charlotte Brand, Jacopo Amidei, Paul Piwek, Tom Stafford, Svetlana Stoyanchev and Andreas Vlachos", "abstract": "Recent research on argumentative dialogues has focused on persuading people to take some action, changing their stance on the topic of discussion, or winning debates. In this work, we focus on argumentative dialogues that aim to open up (rather than change) people's minds to help them become more understanding to views that are unfamiliar or in opposition to their own convictions. To this end, we present a dataset of $183$ argumentative dialogues about $3$ controversial topics: veganism, Brexit and COVID-19 vaccination. The dialogues were collected using the Wizard of Oz approach, where wizards leverage a knowledge-base of arguments to converse with participants. Open-mindedness is measured before and after engaging in the dialogue using a questionnaire from the psychology literature, and success of the dialogue is measured as the change in the participant's stance towards those who hold opinions different to theirs. We evaluate two dialogue models: a Wikipedia-based and an argument-based model. We show that while both models perform closely in terms of opening up minds, the argument-based model is significantly better on other dialogue properties such as engagement and clarity.", "track": "Computational Social Science and Cultural Analytics", "label": 20, "url": ""}, {"loc": [5.2706990242004395, 5.317431449890137], "id": 3018, "title": "You Are My Type! Type Embeddings for Pre-trained Language Models", "authors": "Mohammed Adel Saeed and Paolo Papotti", "abstract": "One reason for the positive impact of Pre-trained Language Models (PLMs) in NLP tasks is their ability to encode semantic types, such as `European City' or `Woman'. While previous work has analyzed such information in the context of interpretability, it is not clear how to use types to steer the PLM output. For example, in a cloze statement, it is desirable to steer the model to generate a token that satisfies a user-specified type, e.g., predict a date rather than a location. In this work, we introduce Type Embeddings (TEs), an input embedding that promotes desired types in a PLM. Our proposal is to define a type by a small set of word examples. We empirically study the ability of TEs both in representing types and in steering masking predictions without changes to the prompt text in BERT. Finally, using the LAMA datasets, we show how TEs highly improve the precision in extracting facts from PLMs.", "track": "Language Modeling and Analysis of Language Models", "label": 2, "url": ""}, {"loc": [7.635558128356934, 3.6308112144470215], "id": 3037, "title": "Generating Textual Adversaries with Minimal Perturbation", "authors": "Xingyi Zhao, Lu Zhang, Depeng Xu and Shuhan Yuan", "abstract": "Many word-level adversarial attack approaches for textual data have been proposed in recent studies. However, due to the massive search space consisting of combinations of candidate words, the existing approaches face the problem of preserving the semantics of texts when crafting adversarial counterparts. In this paper, we develop a novel attack strategy to find adversarial texts with high similarity to the original texts while introducing minimal perturbation. The rationale is that we expect the adversarial texts with small perturbation can better preserve the semantic meaning of original texts. Experiments show that, compared with state-of-the-art attack approaches, our approach achieves higher success rates and lower perturbation rates in four benchmark datasets.", "track": "Machine Learning for NLP", "label": 3, "url": "https://www.semanticscholar.org/reader/064ccc5c41e13ab468d8ce0569333c8acd4f641a?experiments=&features=reader_skimming%3Atrue"}, {"loc": [7.068790435791016, 5.832129001617432], "id": 3038, "title": "SensePOLAR: Word sense aware interpretability for pre-trained contextual word embeddings", "authors": "Jan Engler, Sandipan Sikdar, Marlene Lutz and Markus Strohmaier", "abstract": "Adding interpretability to word embeddings represents an area of active research in text\nrepresentation. Recent work has explored the potential of embedding words via so-called polar\ndimensions (e.g. good vs. bad, correct vs. wrong). Examples of such recent approaches\ninclude SemAxis, POLAR, FrameAxis, and BiImp. Although these approaches provide interpretable\ndimensions for words, they have not been designed to deal with polysemy, i.e. they can not easily distinguish between different senses of words. To address this limitation, we present SensePOLAR, an extension of the original POLAR framework that enables wordsense aware interpretability for pre-trained contextual word embeddings. The resulting interpretable word embeddings achieve a level of\nperformance that is comparable to original contextual word embeddings across a variety of\nnatural language processing tasks including the GLUE and SQuAD benchmarks. Our work\nremoves a fundamental limitation of existing approaches by offering users sense aware interpretations\nfor contextual word embeddings.", "track": "Interpretability, Interactivity and Analysis of Models for NLP", "label": 9, "url": ""}, {"loc": [5.813555717468262, 5.833791732788086], "id": 3043, "title": "Contextualizing Language Models for Norms Diverging from Social Majority", "authors": "Niklas Kiehne, Hermann Kroll and Wolf-Tilo Balke", "abstract": "To comprehensibly contextualize decisions, artificial systems in social situations need a high degree of awareness of the rules of conduct of human behavior. Especially transformer-based language models have recently been shown to exhibit some such awareness. But what if norms in some social setting do not adhere to or even blatantly deviate from the mainstream? \n In this paper, we introduce a novel mechanism based on deontic logic to allow for a flexible adaptation of individual norms by de-biasing training data sets and a task-reduction to textual entailment. Building on the popular 'Moral Stories' dataset we on the one hand highlight the intrinsic bias of current language models, on the other hand characterize the adaptability of pre-trained models to deviating norms in fine-tuning settings.", "track": "Computational Social Science and Cultural Analytics", "label": 20, "url": ""}, {"loc": [4.767204761505127, 6.926342487335205], "id": 3046, "title": "Empathetic Dialogue Generation via Sensitive Emotion Recognition and Sensible Knowledge Selection", "authors": "Lanrui Wang, Jiangnan Li, Zheng Lin, Fandong Meng, Chenxu Yang, Weiping Wang and Jie Zhou", "abstract": "Empathy, which is widely used in psychological counseling, is a key trait of everyday human conversations. Equipped with commonsense knowledge, current approaches to empathetic response generation focus on capturing implicit emotion within dialogue context, where the emotions are treated as a static variable throughout the conversations. However, emotions change dynamically between utterances, which makes previous works difficult to perceive the emotion flow and predict the correct emotion of the target response, leading to inappropriate response. Furthermore, simply importing commonsense knowledge without harmonization may trigger the conflicts between knowledge and emotion, which confuse the model to choose the correct information to guide the generation process. To address the above problems, we propose a Serial Encoding and Emotion-Knowledge interaction (SEEK) method for empathetic dialogue generation. We use a fine-grained encoding strategy which is more sensitive to the emotion dynamics (emotion flow) in the conversations to predict the emotion-intent characteristic of response. Besides, we design a novel framework to model the interaction between knowledge and emotion to solve the conflicts generate more sensible response. Extensive experiments on the utterance-level annotated EMPATHETICDIALOGUES demonstrate that SEEK outperforms the strong baseline in both automatic and manual evaluations.", "track": "Natural Language Generation", "label": 6, "url": "https://www.semanticscholar.org/reader/7f6a790ad82960cfb282542efe0fac1a8db0e9dd?experiments=&features=reader_skimming%3Atrue"}, {"loc": [0.5323992967605591, 6.972627639770508], "id": 3077, "title": "Joint Multilingual Knowledge Graph Completion and Alignment", "authors": "Vinh Tong, Dat Quoc Nguyen, Trung Thanh Huynh, Tam Thanh Nguyen, Quoc Viet Hung Nguyen and Mathias Niepert", "abstract": "Knowledge graph (KG) alignment and completion are usually treated as two independent tasks. While recent work has leveraged entity and relation alignments from multiple KGs, such as alignments between multilingual KGs with common entities and relations, a deeper understanding of the ways in which multilingual KG completion (MKGC) can aid the creation of multilingual KG alignments (MKGA) is still limited. Motivated by the observation that structural inconsistencies -- the main challenge for MKGA models -- can be mitigated through KG completion methods, we propose a novel model for jointly completing and aligning knowledge graphs. The proposed model combines two components that jointly accomplish KG completion and alignment. These two components employ relation-aware graph neural networks that we propose to encode multi-hop neighborhood structures into entity and relation representations. Moreover, we also propose (i) a structural inconsistency reduction mechanism to incorporate information from the completion into the alignment component, and (ii) an alignment seed enlargement and triple transferring mechanism to enlarge alignment seeds and transfer triples during KGs alignment. Extensive experiments on a public multilingual benchmark show that our proposed model outperforms existing competitive baselines, obtaining new state-of-the-art results on both MKGC and MKGA tasks.", "track": "Information Extraction", "label": 5, "url": "https://www.semanticscholar.org/reader/53802c3e16f944b71b5d59d9572bbd4bf5ee3c9e?experiments=&features=reader_skimming%3Atrue"}, {"loc": [2.885392189025879, 4.6865739822387695], "id": 3086, "title": "A Framework for Automatic Generation of Spoken Question-Answering Data", "authors": "Merve \u00dcnl\u00fc Menev\u015fe, Yusufcan Manav, Ebru Arisoy and Arzucan \u00d6zg\u00fcr", "abstract": "This paper describes a framework to automatically generate a spoken question answering (QA) dataset. The framework consists of a question generation (QG) module to generate questions automatically from given text documents, a text-to-speech (TTS) module to convert the text documents into spoken form and an automatic speech recognition (ASR) module to transcribe the spoken content. The final dataset contains question-answer pairs for both the reference text and ASR transcriptions as well as the audio files corresponding to each reference text. For QG and ASR systems we used pre-trained multilingual encoder-decoder transformer models and fine-tuned these models using a limited amount of manually generated QA data and TTS-based speech data, respectively. As a proof of concept, we investigated the proposed framework for Turkish and generated the Turkish Question Answering (TurQuAse) dataset using Wikipedia articles. Manual evaluation of the automatically generated question- answer pairs and QA performance evaluation with state of-the-art models on TurQuAse show that the proposed framework is efficient for automatically generating spoken QA datasets. To the best of our knowledge, TurQuAse is the first publicly available spoken question answering dataset for Turkish. The proposed framework can be easily extended to other languages where a limited amount of QA data is available.", "track": "Question Answering", "label": 11, "url": ""}, {"loc": [3.261929750442505, 9.424206733703613], "id": 3092, "title": "Readability Controllable Biomedical Document Summarization", "authors": "Zheheng Luo, Qianqian Xie and Sophia Ananiadou", "abstract": "Different from general documents, it is recognised that \nthe ease with which people can understand a biomedical text is eminently varied, owing to the highly technical nature of biomedical documents and the variance of readers' domain knowledge. \nHowever, existing biomedical document summarization systems have paid little attention to readability control, leaving users with summaries that are incompatible with their levels of expertise.\nIn recognition of this urgent demand, we introduce a new task of readability controllable summarization for biomedical documents, which aims to recognise users' readability demands and generate summaries that better suit their needs: technical summaries for experts and plain language summaries (PLS) for laymen.\nTo establish this task, we construct a corpus consisting of biomedical papers with technical summaries and PLSs written by the authors, and benchmark multiple advanced controllable abstractive and extractive summarization models based on pre-trained language models (PLMs) with prevalent controlling and generation techniques.\nMoreover, we propose a novel masked language model (MLM) based metric and its variant to effectively evaluate the readability discrepancy between lay and technical summaries.\nExperimental results from automated and human evaluations show that though current control techniques allow for a certain degree of readability adjustment during generation, the performance of existing controllable summarization methods is far from desirable in this task.", "track": "Summarization", "label": 14, "url": "https://www.semanticscholar.org/reader/de0d1ad3380b0e99ada82b19ba15042e44be37db?experiments=&features=reader_skimming%3Atrue"}, {"loc": [6.335440158843994, 12.204106330871582], "id": 3096, "title": "Beyond Additive Fusion: Learning Non-Additive Multimodal Interactions", "authors": "Torsten W\u00f6rtwein, Lisa B. Sheeber, Nicholas Allen, Jeffrey Cohn and Louis-Philippe Morency", "abstract": "Multimodal fusion addresses the problem of analyzing spoken words in the multimodal context, including visual expressions and prosodic cues. Even when multimodal models lead to performance improvements, it is often unclear whether bimodal and trimodal interactions are learned or whether modalities are processed independently of each other. We propose Multimodal Residual Optimization (MRO) to separate unimodal, bimodal, and trimodal interactions in a multimodal model. This improves interpretability as the multimodal interaction can be quantified. Inspired by Occam's razor, the main intuition of MRO is that (simpler) unimodal contributions should be learned before learning (more complex) bimodal and trimodal interactions. For example, bimodal predictions should learn to correct the mistakes (residuals) of unimodal predictions, thereby letting the bimodal predictions focus on the remaining bimodal interactions. Empirically, we observe that MRO successfully separates unimodal, bimodal, and trimodal interactions while not degrading predictive performance. We complement our empirical results with a human perception study and observe that MRO learns multimodal interactions that align with human judgments.", "track": "Speech, Vision, Robotics, Multimodal Grounding", "label": 7, "url": ""}, {"loc": [5.4007134437561035, 12.143303871154785], "id": 3109, "title": "Generalization Differences between End-to-End and Neuro-Symbolic Vision-Language Reasoning Systems", "authors": "Wang Zhu, Jesse Thomason and Robin Jia", "abstract": "For vision-and-language reasoning tasks, both fully connectionist, end-to-end methods and hybrid, neuro-symbolic methods have achieved high in-distribution performance. In which out-of-distribution settings does each paradigm excel? We investigate this question on both single-image and multi-image visual question-answering through four types of generalization tests: a novel segment-combine test for multi-image queries, contrast set, compositional generalization, and  cross-benchmark transfer.\nVision-and-language end-to-end trained systems exhibit sizeable performance drops across all these tests. Neuro-symbolic methods suffer even more on cross-benchmark transfer from GQA to VQA, but they show smaller accuracy drops on the other generalization tests and their performance quickly improves by few-shot training. Overall, our results demonstrate the complementary benefits of these two paradigms, and emphasize the importance of using a diverse suite of generalization tests to fully characterize model robustness to distribution shift.", "track": "Speech, Vision, Robotics, Multimodal Grounding", "label": 7, "url": "https://www.semanticscholar.org/reader/59daaebe48d5d23e7ea682e2ddee0ae171c87a7e?experiments=&features=reader_skimming%3Atrue"}, {"loc": [4.9796366691589355, 12.407997131347656], "id": 3111, "title": "Learning to Model Multimodal Semantic Alignment for Story Visualization", "authors": "Bowen Li and Thomas Lukasiewicz", "abstract": "Story visualization aims to generate a sequence of images to narrate each sentence in a multi-sentence story, where the images should be realistic and keep global consistency across dynamic scenes and characters. Current works face the problem of semantic misalignment because of their fixed architecture and diversity of input modalities. To address this problem, we explore the semantic alignment between text and image representations by learning to match their semantic levels in the GAN-based generative model. More specifically, we introduce dynamic interactions according to learning to dynamically explore various semantic depths and fuse the different-modal information at a matched semantic level, which thus relieves the text-image semantic misalignment problem. Extensive experiments on different datasets demonstrate the improvements of our approach, neither using segmentation masks nor auxiliary captioning networks, on image quality and story consistency, compared with state-of-the-art methods.", "track": "Speech, Vision, Robotics, Multimodal Grounding", "label": 7, "url": "https://www.semanticscholar.org/reader/6be8bc2b5fecd2fc361799980800e74fb2e38ac4?experiments=&features=reader_skimming%3Atrue"}, {"loc": [4.486021041870117, 5.509698390960693], "id": 3131, "title": "SciFact-Open: Towards open-domain scientific claim verification", "authors": "David Wadden, Kyle Lo, Bailey E. Kuehl, Arman Cohan, Iz Beltagy, Lucy Lu Wang and Hannaneh Hajishirzi", "abstract": "While research on scientific claim verification has led to the development of powerful systems that appear to approach human performance, these approaches have yet to be tested in a realistic setting against large corpora of scientific literature. Moving to this open-domain evaluation setting, however, poses unique challenges; in particular, it is infeasible to exhaustively annotate all evidence documents. In this work, we present SciFact-Open, a new test collection designed to evaluate the performance of scientific claim verification systems on a corpus of 500K research abstracts. Drawing upon pooling techniques from information retrieval, we collect evidence for scientific claims by pooling and annotating the top predictions of four state-of-the-art scientific claim verification models. We find that systems developed on smaller corpora struggle to generalize to SciFact-Open, exhibiting performance drops of at least 15 F1. In addition, analysis of the evidence in SciFact-Open reveals interesting phenomena likely to appear when claim verification systems are deployed in practice, e.g., cases where the evidence supports only a special case of the claim. Our dataset is available at https://github.com/dwadden/scifact-open.", "track": "NLP Applications", "label": 0, "url": "https://www.semanticscholar.org/reader/f13b251c8346bc3be19b71b840449831e9716999?experiments=&features=reader_skimming%3Atrue"}, {"loc": [10.748750686645508, 6.844636917114258], "id": 3133, "title": "COMET-QE and Active Learning for Low-Resource Machine Translation", "authors": "Everlyn Chimoto and Bruce Bassett", "abstract": "Active learning aims to deliver maximum benefit when resources are scarce. We use COMET-QE, a reference-free evaluation metric, to select sentences for low-resource neural machine translation. Using Swahili, Kinyarwanda and Spanish for our experiments, we show that COMET-QE significantly outperforms two variants of Round Trip Translation Likelihood (RTTL) and random sentence selection by up to 5 BLEU points for 20k sentences selected by Active Learning on a 30k baseline. This suggests that COMET-QE is a powerful tool for sentence selection in the very low-resource limit.", "track": "Machine Translation", "label": 10, "url": "https://www.semanticscholar.org/reader/40b2b5ea3fb43874fff960723000f43c2174eb7d?experiments=&features=reader_skimming%3Atrue"}, {"loc": [2.7532668113708496, 8.864214897155762], "id": 3136, "title": "MedicalSum: A Guided Clinical Abstractive Summarization Model for Generating Medical Reports from Patient-Doctor Conversations", "authors": "George Michalopoulos, Kyle Williams, Gagandeep Singh and Thomas Lin", "abstract": "We introduce MedicalSum, a transformer-based sequence-to-sequence architecture for summarizing medical conversations by integrating medical domain knowledge from the Unified Medical Language System (UMLS). The novel knowledge augmentation is performed in three ways: (i) introducing a guidance signal that consists of the medical words in the input sequence, (ii) leveraging semantic type knowledge in UMLS to create clinically meaningful input embeddings, and (iii) making use of a novel weighted loss function that provides a stronger incentive for the model to correctly predict words with a medical meaning. By applying these three strategies, MedicalSum takes clinical knowledge into consideration during the summarization process and achieves state-of-the-art ROUGE score improvements of 0.8-2.1 points (including 6.2% ROUGE-1 error reduction in the PE section) when producing medical summaries of patient-doctor conversations.", "track": "Summarization", "label": 14, "url": ""}, {"loc": [7.464713096618652, 9.526053428649902], "id": 3155, "title": "Leveraging Training Dynamics and Self-Training for Text Classification", "authors": "Tiberiu Sosea and Cornelia Caragea", "abstract": "The effectiveness of pre-trained language models in downstream tasks is highly dependent on the amount of labeled data available for training. Semi-supervised learning (SSL) is a promising technique that has seen wide attention recently due to its effectiveness in improving deep learning models when training data is scarce. Common approaches employ a teacher-student self-training framework, where a teacher network generates pseudo-labels for unlabeled data, which are then used to iteratively train a student network. In this paper, we propose a new self-training approach for text classification that leverages training dynamics of unlabeled data. We evaluate our approach on a wide range of text classification tasks, including emotion detection, sentiment analysis, question classification and gramaticality, which span a variety of domains, e.g, Reddit, Twitter, and online forums. Notably, our method is successful on all benchmarks, obtaining an average increase in F1 score of 3.5% over strong baselines in low resource settings.", "track": "Machine Learning for NLP", "label": 3, "url": ""}, {"loc": [4.721792221069336, 4.54890251159668], "id": 3167, "title": "Learning to Infer from Unlabeled Data: A Semi-supervised Learning Approach for Robust Natural Language Inference", "authors": "Mobashir Sadat and Cornelia Caragea", "abstract": "Natural Language Inference (NLI) or Recognizing Textual Entailment (RTE) aims at predicting the relation between a pair of sentences (premise and hypothesis) as entailment, contradiction or semantic independence. Although deep learning models have shown promising performance for NLI in recent years, they rely on large scale expensive human-annotated datasets. Semi-supervised learning (SSL) is a popular technique for reducing the reliance on human annotation by leveraging unlabeled data for training. However, despite its substantial success on single sentence classification tasks where the challenge in making use of unlabeled data is to assign \"good enough\" pseudo-labels, for NLI tasks, the nature of unlabeled data is more complex: one of the sentences in the pair (usually the hypothesis) along with the class label are missing from the data and require human annotations, which makes SSL for NLI more challenging. In this paper, we propose a novel way to incorporate unlabeled data in SSL for NLI where we use a conditional language model, BART to generate the hypotheses for the unlabeled sentences (used as premises). Our experiments show that our SSL framework successfully exploits unlabeled data and substantially improves the performance of four NLI datasets in low-resource settings. We release our code here: https://github.com/msadat3/SSL_for_NLI", "track": "Semantics: Lexical, Sentence level, Textual Inference and Other areas", "label": 8, "url": "https://www.semanticscholar.org/reader/20b76171bf81c684a3a877b72af5f9a673c46fd6?experiments=&features=reader_skimming%3Atrue"}, {"loc": [8.041497230529785, 2.985491991043091], "id": 3169, "title": "Unsupervised Text Deidentification", "authors": "John Morris, Justin Chiu, Ramin Zabih and Alexander Rush", "abstract": "Deidentification seeks to anonymize textual data prior to distribution. Automatic deidentification primarily uses supervised named entity recognition from human-labeled data points. We propose an unsupervised deidentification method that masks words that leak personally-identifying information. The approach utilizes a specially trained reidentification model to identify individuals from redacted personal documents. Motivated by K-anonymity based privacy, we generate redactions that ensure a minimum reidentification rank for the correct profile of the document. To evaluate this approach, we consider the task of deidentifying Wikipedia Biographies, and evaluate using an adversarial reidentification metric. Compared to a set of unsupervised baselines, our approach deidentifies documents more completely while removing fewer words. Qualitatively, we see that the approach eliminates many identifying aspects that would fall outside of the common named entity based approach.", "track": "Unsupervised and Weakly-Supervised Methods in NLP", "label": 17, "url": "https://www.semanticscholar.org/reader/c3e846a906f2bd7cb1ac39068a4f95e7adc1818b?experiments=&features=reader_skimming%3Atrue"}, {"loc": [8.064698219299316, 3.122032642364502], "id": 3178, "title": "Federated Continual Learning for Text Classification via Selective Inter-client Transfer", "authors": "Yatin Chaudhary, Pranav Rai, Matthias Schubert, Hinrich Sch\u00fctze and Pankaj Gupta", "abstract": "In this work, we combine the two paradigms: Federated Learning (FL) and Continual Learning (CL) for text classification task in cloud-edge continuum. The objective of Federated Continual Learning (FCL) is to improve deep learning models over life time at each client by (relevant and efficient) knowledge transfer without sharing data. Here, we address challenges in minimizing inter-client interference while knowledge sharing due to heterogeneous tasks across clients in FCL setup. In doing so, we propose a novel framework, Federated Selective Inter-client Transfer (FedSeIT) which selectively combines model parameters of foreign clients. To further maximize knowledge transfer, we assess domain overlap and select informative tasks from the sequence of historical tasks at each foreign client while preserving privacy. Evaluating against the baselines, we  show improved performance, a gain of (average) 12.4% in text classification over a sequence of tasks using five datasets from diverse domains. To the best of our knowledge, this is the first work that applies FCL to NLP.", "track": "Machine Learning for NLP", "label": 3, "url": "https://www.semanticscholar.org/reader/2889eb10fc8b5ea6c70dc76849e30c655853d6e2?experiments=&features=reader_skimming%3Atrue"}, {"loc": [4.221919536590576, 7.763498783111572], "id": 3179, "title": "DOROTHIE: Spoken Dialogue for Handling Unexpected Situations in Interactive Autonomous Driving Agents", "authors": "Ziqiao Ma, Benjamin VanDerPloeg, Cristian-Paul Bara, Huang Yidong, Eui-In Kim, Felix Gervits, Matthew Marge and Joyce Chai", "abstract": "In the real world, autonomous driving agents navigate in highly dynamic environments full of unexpected situations where pre-trained models are unreliable. In these situations, what is immediately available to vehicles is often only human operators. Empowering autonomous driving agents with the ability to navigate in a continuous and dynamic environment and to communicate with humans through sensorimotor-grounded dialogue becomes critical. To this end, we introduce Dialogue On the ROad To Handle Irregular Events (DOROTHIE), a novel interactive simulation platform that enables the creation of unexpected situations on the fly to support empirical studies on situated communication with autonomous driving agents. Based on this platform, we created the Situated Dialogue Navigation (SDN), a navigation benchmark of 183 trials with a total of 8415 utterances, around 18.7 hours of control streams, and 2.9 hours of trimmed audio. SDN is developed to evaluate the agent's ability to predict dialogue moves from humans as well as generate its own dialogue moves and physical navigation actions. We further developed a transformer-based baseline model for these SDN tasks. Our empirical results indicate that language guided-navigation in a highly dynamic environment is an extremely difficult task for end-to-end models. These results will provide insight towards future work on robust autonomous driving agents", "track": "Dialogue and Interactive Systems", "label": 4, "url": "https://www.semanticscholar.org/reader/3dbe1b13c7fb234a72861e1614a188b5a5fbbef2?experiments=&features=reader_skimming%3Atrue"}, {"loc": [3.6027657985687256, 8.030424118041992], "id": 3183, "title": "He Said, She Said: Style Transfer for Shifting the Perspective of Dialogues", "authors": "Amanda Bertsch, Graham Neubig and Matthew R. Gormley", "abstract": "In this work, we define a new style transfer task: perspective shift, which reframes a dialouge from informal first person to a formal third person rephrasing of the text. This task requires challenging coreference resolution, emotion attribution, and interpretation of informal text. We explore several baseline approaches and discuss further directions on this task when applied to short dialogues. As a sample application, we demonstrate that applying perspective shifting to a dialogue summarization dataset (SAMSum) substantially improves the zero-shot performance of extractive news summarization models on this data. Additionally, supervised extractive models perform better when trained on perspective shifted data than on the original dialogues. We release our code publicly.", "track": "Natural Language Generation", "label": 6, "url": "https://www.semanticscholar.org/reader/9eea41c0341e15e97062dd771515378cfba29019?experiments=&features=reader_skimming%3Atrue"}, {"loc": [7.929487228393555, 9.61744213104248], "id": 3184, "title": "Dynamic Augmentation Data Selection for Few-shot Text Classification", "authors": "Guangliang Liu, Lifeng Jin, Owen Yuan and Jiayu Zhou", "abstract": "Data augmentation has been a popular method for fine-tuning pre-trained language models to increase model robustness and performance. With augmentation data coming from modifying gold train data (in-sample augmentation) or being harvested from general domain unlabeled data (out-of-sample augmentation), the quality of such data is the key to successful fine-tuning. In this paper, we propose a dynamic data selection method to select effective augmentation data from different augmentation sources according to the model's learning stage, by identifying a set of augmentation samples that optimally facilitates the learning process of the most current model. The method firstly filters out augmentation samples with noisy pseudo labels through a curriculum learning strategy, then estimates the effectiveness of reserved augmentation data by its influence scores on the current model at every update, allowing the data selection process tightly tailored to model parameters. And the two-stage augmentation strategy considers in-sample augmentation and out-of-sample augmentation in different learning stages. Experiments with both kinds of augmentation data on a variety of sentence classification tasks show that our method outperforms strong baselines, proving the effectiveness of our method. Analysis confirms the dynamic nature of the data effectiveness and the importance of model learning stages in utilization of augmentation data.", "track": "Machine Learning for NLP", "label": 3, "url": ""}, {"loc": [5.0960869789123535, 9.631250381469727], "id": 3195, "title": "KPDROP: Improving Absent Keyphrase Generation", "authors": "Jishnu Ray Chowdhury, Seo Yeon Park, Tuhin Kundu and Cornelia Caragea", "abstract": "Keyphrase generation is the task of generating phrases (keyphrases) that summarize the main topics of a given document. Keyphrases can be either present or absent from the given document. While the extraction of present keyphrases has received much attention in the past, only recently a stronger focus has been placed on the generation of absent keyphrases. However, generating absent keyphrases is challenging; even the best methods show only a modest degree of success. In this paper, we propose a model-agnostic approach called keyphrase dropout (or KPDrop) to improve absent keyphrase generation. In this approach, we randomly drop present keyphrases from the document and turn them into artificial absent keyphrases during training. We test our approach extensively and show that it consistently improves the absent performance of strong baselines in both supervised and resource-constrained semi-supervised settings.", "track": "Information Extraction", "label": 5, "url": "https://www.semanticscholar.org/reader/13ee5541d2197cab6bd76e519d19ab232bdf400d?experiments=&features=reader_skimming%3Atrue"}, {"loc": [4.527041912078857, 4.499120712280273], "id": 3209, "title": "Natural Language Deduction through Search over Statement Compositions", "authors": "Kaj Bostrom, Zayne Sprague, Swarat Chaudhuri and Greg Durrett", "abstract": "In settings from fact-checking to question answering, we frequently want to know whether a collection of evidence (premises) entails a hypothesis. Existing methods primarily focus on the end-to-end discriminative version of this task, but less work has treated the generative version in which a model searches over the space of statements entailed by the premises to constructively derive the hypothesis. We propose a system for doing this kind of deductive reasoning in natural language by decomposing the task into separate steps coordinated by a search procedure, producing a tree of intermediate conclusions that faithfully reflects the system's reasoning process. Our experiments on the EntailmentBank dataset (Dalvi et al., 2021)  demonstrate that the proposed system can successfully prove true statements while rejecting false ones. Moreover, it produces natural language explanations with a 17% absolute higher step validity than those produced by an end-to-end T5 model.", "track": "Semantics: Lexical, Sentence level, Textual Inference and Other areas", "label": 8, "url": ""}, {"loc": [4.466771125793457, 7.180026054382324], "id": 3216, "title": "EnDex: Evaluation of Dialogue Engagingness at Scale", "authors": "Guangxuan Xu, Ruibo Liu, Fabrice Harel-Canada, Nischal Reddy Chandra and Nanyun Peng", "abstract": "We propose EnDex, the first human-reaction based model to evaluate dialogue engagingness. EnDex is trained on 80k Reddit-based Engagement Dataset (RED) curated using a novel distant-supervision framework. Engagingness is a key measure that captures high-level quality of AI dialogue systems and closely reflects actual user experience. However, data shortage, plus the abstract and extensive definition of engagingness makes it challenging to develop an automatic metric. Our work departs from mainstream approaches that use synthetic negative examples to train binary classifiers, and instead, proposes a solution using distant-supervision from human-reaction feedback. \nTo support the soundness of our EnDex metric, we offer a theoretical foundation for engagement, an extensive ablation study, and empirical evidence of high correlation on five engagingness related datasets. We will release code, off-the-shelf EnDex model, and a large-scale dataset upon paper publication to facilitate future research.", "track": "Resources and Evaluation", "label": 1, "url": "https://www.semanticscholar.org/reader/0a722a62375b5542e838d04fbefd27e1917328bd?experiments=&features=reader_skimming%3Atrue"}, {"loc": [7.29884147644043, 9.583135604858398], "id": 3238, "title": "LOPS: Learning Order Inspired Pseudo-Label Selection for Weakly Supervised Text Classification", "authors": "Dheeraj Mekala, Chengyu Dong and Jingbo Shang", "abstract": "Weakly supervised text classification methods typically train a deep neural classifier based on pseudo-labels. The quality of pseudo-labels is crucial to final performance but they are inevitably noisy due to their heuristic nature, so selecting the correct ones has a huge potential for performance boost. One straightforward solution is to select samples based on the softmax probability scores in the neural classifier corresponding to their pseudo-labels. However, we show through our experiments that such solutions are ineffective and unstable due to the erroneously high-confidence predictions from poorly calibrated models. Recent studies on the memorization effects of deep neural models suggest that these models first memorize training samples with clean labels and then those with noisy labels. Inspired by this observation, we propose a novel pseudo-label selection method LOPS that takes learning order of samples into consideration. We hypothesize that the learning order reflects the probability of wrong annotation in terms of ranking, and therefore, propose to select the samples that are learnt earlier. LOPS can be viewed as a strong performance-boost plug-in to most existing weakly-supervised text classification methods, as confirmed in extensive experiments on four real-world datasets.", "track": "Unsupervised and Weakly-Supervised Methods in NLP", "label": 17, "url": "https://www.semanticscholar.org/reader/a1ccfb5bf4a5666b0f5dd4c1d81d2aa176d74202?experiments=&features=reader_skimming%3Atrue"}, {"loc": [8.688488960266113, 8.2194185256958], "id": 3241, "title": "Train Flat, Then Compress: Sharpness-Aware Minimization Learns More Compressible Models", "authors": "Clara Na, Sanket Vaibhav Mehta and Emma Strubell", "abstract": "Model compression by way of parameter pruning, quantization, or distillation has recently gained popularity as an approach for reducing the computational requirements of modern deep neural network models for NLP. Inspired by prior works suggesting a connection between simpler, more generalizable models and those that lie within wider loss basins, we hypothesize that optimizing for flat minima should lead to simpler parameterizations and thus more compressible models. We propose to combine sharpness-aware minimization (SAM) with various task-specific model compression methods, including iterative magnitude pruning (IMP), structured pruning with a distillation objective, and post-training dynamic quantization. Empirically, we show that optimizing for flatter minima consistently leads to greater compressibility of parameters compared to vanilla Adam when fine-tuning BERT models, with little to no loss in accuracy on the GLUE text classification and SQuAD question answering benchmarks. Moreover, SAM finds superior winning tickets during IMP that 1) are amenable to vanilla Adam optimization, and 2) transfer more effectively across tasks.", "track": "Efficient Methods for NLP", "label": 12, "url": "https://www.semanticscholar.org/reader/294a315631d8a76697ecc9fd9cd0ed4bc5ce90fd?experiments=&features=reader_skimming%3Atrue"}, {"loc": [7.64055871963501, 9.80152702331543], "id": 3248, "title": "Structural Contrastive Representation Learning for Zero-shot Multi-label Text Classification", "authors": "Tianyi Zhang, Zhaozhuo Xu, Tharun Medini and Anshumali Shrivastava", "abstract": "Zero-shot multi-label text classification (ZMTC) is a fundamental task in natural language processing with applications in the cold start problem of recommendation systems. Ideally, one would learn an expressive representation of both input text and label features so that ZMTC is transformed into a nearest neighbor search problem. However, the existing representation learning approaches for ZMTC struggle with accuracy as well as poor training efficiency. Firstly, the input text is structural, consisting of both short title sentences and long content paragraphs. It is challenging to model the correlation between short label descriptions and long structural input documents. Secondly, the enormous label space in ZMTC forces the existing approaches to perform multi-stage learning with label engineering. As a result, the training overhead is significant. In this paper, we address both problems by introducing an end-to-end structural contrastive representation learning approach. We propose a randomized text segmentation (RTS) technique to generate high-quality contrastive pairs.  This RTS technique allows us to model title-content correlation.  Additionally, we simplify the multi-stage ZMTC learning strategy by avoiding label engineering. Extensive experiments demonstrate that our approach leads to up to 2.33% improvement in precision@1 and 5.94x speedup in training time on publicly available datasets. Our code is available publicly.", "track": "Machine Learning for NLP", "label": 3, "url": ""}, {"loc": [8.344463348388672, 8.191740989685059], "id": 3249, "title": "Improving Generalization of Pre-trained Language Models via Stochastic Weight Averaging", "authors": "Peng Lu, Ivan Kobyzev, Mehdi Rezagholizadeh, Ahmad Rashid, Ali Ghodsi and Phillippe Langlais", "abstract": "Knowledge Distillation (KD) is a commonly used technique for improving the generalization of compact Pre-trained Language Models (PLMs) on downstream tasks. However, such methods impose the additional burden of training a separate teacher model for every new dataset.\nAlternatively, one may directly work on the improvement of the optimization procedure of the compact model towards better generalization. Recent works observe that the flatness of the local minimum correlates well with better generalization.\nIn this work, we adapt Stochastic Weight Averaging (SWA), a method encouraging convergence to a flatter minimum, to fine-tuning PLMs. We conduct extensive experiments on various NLP tasks (text classification, question answering, and generation) and different model architectures and demonstrate that our adaptation improves the generalization without extra computation cost. Moreover, we observe that this simple optimization technique is able to outperform the state-of-the-art KD methods for compact models.", "track": "Efficient Methods for NLP", "label": 12, "url": ""}, {"loc": [4.091793060302734, 7.472659111022949], "id": 3263, "title": "Learn What Is Possible, Then Choose What Is Best: Disentangling One-To-Many Relations in Language Through Text-based Games", "authors": "Benjamin Towle and Ke Zhou", "abstract": "Language models pre-trained on large self-supervised corpora, followed by task-specific fine-tuning has become the dominant paradigm in NLP. These pre-training datasets often have a one-to-many structure---e.g. in dialogue there are many valid responses for a given context. However, only some of these responses will be desirable in our downstream task.  This raises the question of how we should train the model such that it can emulate the desirable behaviours, but not the undesirable ones. Current approaches train in a one-to-one setup---only a single target response is given for a single dialogue context---leading to models only learning to predict the average response, while ignoring the full range of possible responses. Using text-based games as a testbed, our approach, PASA, uses discrete latent variables to capture the range of different behaviours represented in our larger pre-training dataset. We then use knowledge distillation to distil the posterior probability distribution into a student model. This probability distribution is far richer than learning from only the hard targets of the dataset, and thus allows the student model to benefit from the richer range of actions the teacher model has learned. Results show up to 49\\% empirical improvement over the previous state-of-the-art model on the Jericho Walkthroughs dataset.", "track": "Dialogue and Interactive Systems", "label": 4, "url": ""}, {"loc": [7.197891712188721, 6.870428562164307], "id": 3268, "title": "Structurally Diverse Sampling for Sample-Efficient Training and Comprehensive Evaluation", "authors": "Shivanshu Gupta, Sameer Singh and Matt Gardner", "abstract": "A growing body of research has demonstrated the inability of NLP models to generalize compositionally and has tried to alleviate it through specialized architectures, training schemes, and data augmentation, among other approaches. In this work, we study a different approach: training on instances with diverse structures. We propose a model-agnostic algorithm for subsampling such sets of instances from a labeled instance pool with structured outputs. Evaluating on both compositional template splits and traditional IID splits of 5 semantic parsing datasets of varying complexity, we show that structurally diverse training using our algorithm leads to comparable or better generalization than prior algorithms in 9 out of 10 dataset-split type pairs. In general, we find structural diversity to consistently improve sample efficiency compared to random train sets. Moreover, we show that structurally diverse sampling yields comprehensive test sets that are a lot more challenging than IID test sets. Finally, we provide two explanations for improved generalization from diverse train sets: 1) improved coverage of output substructures, and 2) a reduction in spurious correlations between these substructures.", "track": "Semantics: Lexical, Sentence level, Textual Inference and Other areas", "label": 8, "url": "https://www.semanticscholar.org/reader/6913d3f23d13416407b7fcd03bea3231b268a20a?experiments=&features=reader_skimming%3Atrue"}, {"loc": [3.7431910037994385, 9.721627235412598], "id": 3280, "title": "Unsupervised Multi-Granularity Summarization", "authors": "Ming Zhong, Yang Liu, Suyu Ge, Yuning Mao, Yizhu Jiao, Xingxing Zhang, Yichong Xu, Chenguang Zhu, Michael Zeng and Jiawei Han", "abstract": "Text summarization is a user-preference based task, i.e., for one document, users often have different priorities for the summary. As a key aspect of customization in summarization, granularity is used to measure the semantic coverage between the summary and source document. However, developing systems that can generate summaries with customizable semantic coverage is still an under-explored topic. In this paper, we propose the first unsupervised multi-granularity summarization framework, GranuSum. We take events as the basic semantic units of the source documents and propose to rank these events by their salience. We also develop a model to summarize input documents with given events as anchors and hints. By inputting different numbers of events, GranuSum is capable of producing multi-granular summaries in an unsupervised manner. Meanwhile, we annotate a new benchmark GranuDUC that contains multiple summaries at different granularities for each document cluster. Experimental results confirm the substantial superiority of GranuSum on multi-granularity summarization over strong baselines. Furthermore, by exploiting the event information, GranuSum also exhibits state-of-the-art performance under the conventional unsupervised abstractive setting.", "track": "Summarization", "label": 14, "url": "https://www.semanticscholar.org/reader/678042b8603958aef11d5359cc638c7bb24c0549?experiments=&features=reader_skimming%3Atrue"}, {"loc": [4.186501502990723, 7.724478721618652], "id": 3287, "title": "HeLo: Learning-Free Lookahead Decoding for Conversation Infilling", "authors": "Ivan Lee and Taylor Berg-Kirkpatrick", "abstract": "We propose Heuristic Guided Lookahead Decoding (HeLo), a novel decoding strategy for conversation infilling. Conversation infilling aims to generate a seamless bridge of utterances connecting a given pair of source and target utterances. HeLo does not require fine-tuning or extra models -- only the generating model itself. Instead, HeLo leverages a greedy lookahead phase before committing to any token. The HeLo framework is simple and can augment conventional decoding strategies paired with any autoregressive language model. Smooth transitions between utterances are encouraged with an annealing schedule. Our experiments show HeLo outperforms several baselines when evaluated with both automatic and human evaluation metrics, which, we argue, are appropriate for the task.", "track": "Natural Language Generation", "label": 6, "url": ""}, {"loc": [0.7302057147026062, 7.407279014587402], "id": 3292, "title": "RE-Matching: A Fine-Grained Semantic Matching Method for Zero-Shot Relation Extraction", "authors": "Jun Zhao, WenYu Zhan, Tao Gui, Qi Zhang, Jin Ma and Ying Shan", "abstract": "Semantic matching is a mainstream paradigm of zero-shot relation extraction, which matches a given input with a corresponding label description. \nHowever, the generic matching methods lack explicit modeling of characteristics of relational data. \nIn this work, we propose a fine-grained text semantic matching method tailored to relational data.\nSpecifically, our method consists of an encoding and a matching module. To facilitates efficiency, in the encoding module, we adopt a siamese scheme to separately encode the input and description. To make full use of the characteristics of relational data, in the matching module, we refine the similarity score between input and label descriptions into entity matching score and context matching score. Considering that not all contextual words contribute equally to the relation semantics, we design a context distillation module to filter irrelevant context information to improve context matching. \nExperimental results show that our method achieves higher matching accuracy and more than 10 times faster inference speed, compared with the state-of-the-art methods.", "track": "Information Extraction", "label": 5, "url": ""}, {"loc": [8.217975616455078, 5.80077600479126], "id": 3295, "title": "A Multilingual Generative Transformer for Semantic Sentence Embedding", "authors": "John Wieting, William Cohen, Graham Neubig and Taylor Berg-Kirkpatrick", "abstract": "Contrastive learning has been successfully used for retrieval of semantically aligned sentences, but it often requires large batch sizes or careful engineering to work well. In this paper, we instead propose a generative model for learning multilingual text embeddings which can be also be used to retrieve or score sentence pairs. Our model operates on parallel data in N languages and efficiently encourages source separation in this multilingual setting, separating semantic information that is shared between translations from stylistic or language-specific variation. We evaluate this method on a suite of tasks including semantic similarity, bitext mining, and cross-lingual question retrieval - the last of which we introduce in this paper. Overall, our model outperforms both a strong contrastive and generative baseline on these tasks.", "track": "Multilinguality", "label": 13, "url": ""}, {"loc": [8.106181144714355, 3.111661911010742], "id": 3296, "title": "Invernet: An Inversion Attack Framework to Infer Fine-Tuning Datasets through Word Embeddings", "authors": "Ishrak Hayet, Zijun Yao and Bo Luo", "abstract": "Word embedding aims to learn the dense representation of words and has become a regular input preparation in many NLP tasks. Due to the data and computation intensive nature of learning embeddings from scratch, a more affordable way is to borrow the pretrained embedding available in public and fine-tune the embedding through a domain specific downstream dataset. A privacy concern can arise if a malicious owner of the pretrained embedding gets access to the fine-tuned embedding and tries to infer the critical information from the downstream datasets. In this study, we propose a novel embedding inversion framework called Invernet that materializes the privacy concern by inferring the context distribution in the downstream dataset, which can lead to key information breach. With extensive experimental studies on two real-world news datasets: Antonio Gulli's News and New York Times, we validate the feasibility of proposed privacy attack and demonstrate the effectiveness of Invernet on inferring downstream datasets based on multiple word embedding methods.", "track": "NLP Applications", "label": 0, "url": ""}, {"loc": [4.773763179779053, 4.6390485763549805], "id": 3336, "title": "LawngNLI: A Long-Premise Benchmark for In-Domain Generalization from Short to Long Contexts and for Implication-Based Retrieval", "authors": "William Bruno and Dan Roth", "abstract": "Natural language inference has trended toward studying contexts beyond the sentence level. An important application area is law: past cases often do not foretell how they apply to new situations and implications must be inferred. This paper introduces LawngNLI, constructed from U.S. legal opinions with automatic labels with high human-validated accuracy. Premises are long and multigranular. Experiments show two use cases. First, LawngNLI can benchmark for in-domain generalization from short to long contexts. It has remained unclear if large-scale long-premise NLI datasets actually need to be constructed: near-top performance on long premises could be achievable by fine-tuning using short premises. Without multigranularity, benchmarks cannot distinguish lack of fine-tuning on long premises versus domain shift between short and long datasets. In contrast, our long and short premises share the same examples and domain. Models fine-tuned using several past NLI datasets and/or our short premises fall short of top performance on our long premises. So for at least certain domains (such as ours), large-scale long-premise datasets are needed. Second, LawngNLI can benchmark for implication-based retrieval. Queries are entailed or contradicted by target documents, allowing users to move between arguments and evidence. Leading retrieval models perform reasonably zero shot on a LawngNLI-derived retrieval task. We compare different systems for re-ranking, including lexical overlap and cross-encoders fine-tuned using a modified LawngNLI or past NLI datasets. LawngNLI can train and test systems for implication-based case retrieval and argumentation.", "track": "Semantics: Lexical, Sentence level, Textual Inference and Other areas", "label": 8, "url": ""}, {"loc": [8.108076095581055, 3.051406145095825], "id": 3356, "title": "Distillation-Resistant Watermarking for Model Protection in NLP", "authors": "Xuandong Zhao, Lei Li and Yu-Xiang Wang", "abstract": "How can we protect the intellectual property of trained NLP models? Modern NLP models are prone to stealing by querying and distilling from their publicly exposed APIs. However, existing protection methods such as watermarking only work for images but are not applicable to text. We propose Distillation-Resistant Watermarking (DRW), a novel technique to protect NLP models from being stolen via distillation. DRW protects a model by injecting watermarks into the victim's prediction probability corresponding to a secret key and is able to detect such a key by probing a suspect model. We prove that a protected model still retains the original accuracy within a certain bound. We evaluate DRW on a diverse set of NLP tasks including text classification, part-of-speech tagging, and named entity recognition. Experiments show that DRW protects the original model and detects stealing suspects at 100% mean average precision for all four tasks while the prior method fails on two.", "track": "Ethics", "label": 21, "url": "https://www.semanticscholar.org/reader/c7bdd6c7b786fba60ff8a6e656cc14c3f7b57b78?experiments=&features=reader_skimming%3Atrue"}, {"loc": [5.919833660125732, 5.08413553237915], "id": 3358, "title": "NeuroCounterfactuals: Beyond Minimal-Edit Counterfactuals for Richer Data Augmentation", "authors": "Phillip Howard, Gadi Singer, Vasudev Lal, Yejin Choi and Swabha Swayamdipta", "abstract": "While counterfactual data augmentation offers a promising step towards robust generalization in natural language processing, producing a set of counterfactuals that offer valuable inductive bias for models remains a challenge. Most existing approaches for producing counterfactuals, manual or automated, rely on small perturbations via minimal edits, resulting in simplistic changes. We introduce NeuroCounterfactuals, designed as loose counterfactuals, allowing for larger edits which result in naturalistic generations containing linguistic diversity, while still bearing similarity to the original document. Our novel generative approach bridges the benefits of constrained decoding, with those of language model adaptation for sentiment steering. Training data augmentation with our generations results in both in-domain and out-of-domain improvements for sentiment classification, outperforming even manually curated counterfactuals, under select settings. We further present detailed analyses to show the advantages of NeuroCounterfactuals over approaches involving simple, minimal edits.", "track": "Machine Learning for NLP", "label": 3, "url": "https://www.semanticscholar.org/reader/39880b887c19ae80d71643b37d6fc89aba8ec0c4?experiments=&features=reader_skimming%3Atrue"}, {"loc": [6.196130752563477, 5.418179512023926], "id": 3364, "title": "Don't Just Clean It, Proxy Clean It: Mitigating Bias by Proxy in Pre-Trained Models", "authors": "Swetasudha Panda, Ari Kobren, Michael Wick and Qinlan Shen", "abstract": "Transformer-based pre-trained models are known to encode societal biases not only in their contextual representations, but also in downstream predictions when fine-tuned on task-specific data.\nWe present D-Bias, an approach that selectively eliminates stereotypical associations (e.g, co-occurrence statistics) at fine-tuning, such that the model doesn't learn to excessively rely on those signals.\nD-Bias attenuates biases from both identity words and  frequently co-occurring proxies, which we select using pointwise mutual information.\nWe apply D-Bias to a) occupation classification, and b) toxicity classification and find that our approach substantially reduces downstream biases (e.g. by > 60% in toxicity classification, for identities that are most frequently flagged as toxic on online platforms).\nIn addition, we show that  D-Bias dramatically improves upon scrubbing, i.e., removing only the identity words in question.\nWe also demonstrate that D-Bias easily extends to multiple identities, and achieves competitive performance with two recently proposed debiasing approaches: R-LACE and INLP.", "track": "Ethics", "label": 21, "url": ""}, {"loc": [6.447549343109131, 5.709017276763916], "id": 3367, "title": "The Undesirable Dependence on Frequency of Gender Bias Metrics Based on Word Embeddings", "authors": "Francisco Valentini, Germ\u00e1n Rosati, Diego Fernandez Slezak and Edgar Altszyler", "abstract": "Numerous works use word embedding-based metrics to quantify societal biases and stereotypes in texts. Recent studies have found that word embeddings can capture semantic similarity but may be affected by word frequency. In this work we study the effect of frequency when measuring female vs. male gender bias with word embedding-based bias quantification methods. We find that Skip-gram with negative sampling and GloVe tend to detect male bias in high frequency words, while GloVe tends to return female bias in low frequency words. We show these behaviors still exist when words are randomly shuffled. This proves that the frequency-based effect observed in unshuffled corpora stems from properties of the metric rather than from word associations. The effect is spurious and problematic since bias metrics should depend exclusively on word co-occurrences and not individual word frequencies. Finally, we compare these results with the ones obtained with an alternative metric based on Pointwise Mutual Information. We find that this metric does not show a clear dependence on frequency, even though it is slightly skewed towards male bias across all frequencies.", "track": "Computational Social Science and Cultural Analytics", "label": 20, "url": ""}, {"loc": [4.813739776611328, 4.814473628997803], "id": 3369, "title": "BioNLI: Generating a Biomedical NLI Dataset Using Lexico-semantic Constraints for Adversarial Examples", "authors": "Mohaddeseh Bastan, Mihai Surdeanu and Niranjan Balasubramanian", "abstract": "Natural language inference (NLI) is critical in many domains requiring complex decision-making, such as the biomedical domain. We introduce a novel semi-supervised procedure that bootstraps biomedical NLI datasets from positive entailment examples present in abstracts of biomedical publications. We focus on challenging texts where the hypothesis includes mechanistic information such as biochemical interactions between two entities. A key contribution of this work is automating the creation of negative examples that are informative without being simplistic. We generate a range of negative examples using nine strategies that manipulate the structure of the underlying mechanisms both with rules, e.g., flip the roles of the entities in the interaction, and, more importantly, by imposing the perturbed conditions as logical constraints in a neuro-logical decoding system \\cite{lu-etal-2021-neurologic}.\nWe use this procedure to create a novel dataset for NLI in the biomedical domain, called \\dataset. The accuracy of neural classifiers on this dataset is in the mid 70s F1, which indicates that this NLI task remains to be solved. Critically, we observe that the performance on the different classes of negative examples varies widely, from 97\\% F1 on the simple negative examples that change the role of the entities in the hypothesis, to barely better than chance on the negative examples generated using neuro-logic decoding.", "track": "Resources and Evaluation", "label": 1, "url": "https://www.semanticscholar.org/reader/acd076a09b49e16d71b60ee919b47945d20ac1da?experiments=&features=reader_skimming%3Atrue"}, {"loc": [6.573816299438477, 11.990452766418457], "id": 3377, "title": "Self-supervised Cross-modal Pretraining for Speech Emotion Recognition and Sentiment Analysis", "authors": "Iek-Heng Chu, Ziyi Chen, Xinlu Yu, Mei Han, Jing Xiao and Peng Chang", "abstract": "Multimodal speech emotion recognition (SER) and sentiment analysis (SA) are important techniques for human-computer interaction. Most existing multimodal approaches utilize either shallow cross-modal fusion of pretrained features, or deep cross-modal fusion with raw features. Recently, attempts have been made to fuse pretrained feature representations in a deep fusion manner during fine-tuning stage. However those approaches have not led to improved results, partially due to their relatively simple fusion mechanisms and lack of proper cross-modal pretraining. In this work, leveraging single-modal pretrained models (RoBERTa and HuBERT), we propose a novel deeply-fused audio-text bi-modal transformer with carefully designed cross-modal fusion mechanism and a stage-wise cross-modal pretraining scheme to fully facilitate the cross-modal learning. Our experiment results show that the proposed method achieves state-of-the-art results on the public IEMOCAP emotion and CMU-MOSEI sentiment datasets, exceeding the previous benchmarks by a large margin.", "track": "Speech, Vision, Robotics, Multimodal Grounding", "label": 7, "url": ""}, {"loc": [6.518058776855469, 12.351614952087402], "id": 3383, "title": "Multimodal Conversation Modelling for Topic Derailment Detection", "authors": "Zhenhao Li, Marek Rei and Lucia Specia", "abstract": "Conversations on social media tend to go off-topic and turn into different and sometimes toxic exchanges. Previous work focuses on analysing textual dialogues that have derailed into toxic content, but the range of derailment types is much broader, including spam or bot content, tangential comments, etc. In addition, existing work disregards conversations that involve visual information (i.e. images or videos), which are prevalent on most platforms. In this paper, we take a broader view of conversation derailment and propose a new challenge: detecting derailment based on the \"change of conversation topic\", where the topic is defined by an initial post containing both a text and an image. For that, we (i) create the first Multimodal Conversation Derailment (MCD) dataset, and (ii) introduce a new multimodal conversational architecture (MMConv) that utilises visual and conversational contexts to classify comments for derailment. Experiments show that MMConv substantially outperforms previous text-based approaches to detect conversation derailment, as well as general multimodal classifiers. MMConv is also more robust to textual noise, since it relies on richer contextual information.", "track": "Speech, Vision, Robotics, Multimodal Grounding", "label": 7, "url": ""}, {"loc": [3.7512354850769043, 9.798709869384766], "id": 3387, "title": "Active Learning for Abstractive Text Summarization", "authors": "Akim Tsvigun, Ivan Lysenko, Danila Sedashov, Ivan Lazichny, Eldar Damirov, Vladimir Alexeyevich Karlov, Artemy V. Belousov, Leonid Sanochkin, Maxim Panov, Alexander Panchenko, Mikhail Burtsev and Artem Shelmanov", "abstract": "Construction of human-curated annotated datasets for abstractive text summarization (ATS) is very time-consuming and expensive because creating each instance requires a human annotator to read a long document and compose a shorter summary that would preserve the key information relayed by the original document. Active Learning (AL) is a technique developed to reduce the amount of annotation required to achieve a certain level of machine learning model performance. In information extraction and text classification, AL can reduce the amount of labor up to multiple times. Despite its potential for aiding expensive annotation, as far as we know, there were no effective AL query strategies for ATS. This stems from the fact that many AL strategies rely on uncertainty estimation, while as we show in our work, uncertain instances are usually noisy, and selecting them can degrade the model performance compared to passive annotation. We address this problem by proposing the first effective query strategy for AL in ATS based on diversity principles. We show that given a certain annotation budget, using our strategy in AL annotation helps to improve the model performance in terms of ROUGE and consistency scores. Additionally, we analyze the effect of self-learning and show that it can additionally increase the performance of the model.", "track": "Machine Learning for NLP", "label": 3, "url": ""}, {"loc": [6.059288024902344, 8.842109680175781], "id": 3388, "title": "Finding Memo: Extractive Memorization in Constrained Sequence Generation Tasks", "authors": "Vikas Raunak and Arul Menezes", "abstract": "Memorization presents a challenge for several constrained Natural Language Generation (NLG) tasks such as Neural Machine Translation (NMT), wherein the proclivity of neural models to memorize noisy and atypical samples reacts adversely with the noisy (web crawled) datasets. However, previous studies of memorization in constrained NLG tasks have only focused on counterfactual memorization, linking it to the problem of hallucinations. In this work, we propose a new, inexpensive algorithm for extractive memorization (exact training data generation under insufficient context) in constrained sequence generation tasks and use it to study extractive memorization and its effects in NMT. We demonstrate that extractive memorization poses a serious threat to NMT reliability by qualitatively and quantitatively characterizing the memorized samples as well as the model behavior in their vicinity. Based on empirical observations, we develop a simple algorithm which elicits non-memorized translations of memorized samples from the same model, for a large fraction of such samples. Finally, we show that the proposed algorithm could also be leveraged to mitigate memorization in the model through finetuning. We have released the code to reproduce our results at https://github.com/vyraun/Finding-Memo.", "track": "Machine Translation", "label": 10, "url": "https://www.semanticscholar.org/reader/6ab78343ab82fa9d7baa68027f9f7e8cd9863737?experiments=&features=reader_skimming%3Atrue"}, {"loc": [10.930545806884766, 6.814829349517822], "id": 3392, "title": "SALTED: A Framework for SAlient Long-tail Translation Error Detection", "authors": "Vikas Raunak, Matt Post and Arul Menezes", "abstract": "Traditional machine translation (MT) metrics provide an average measure of translation quality that is insensitive to the long tail of behavioral problems. Examples include translation of numbers, physical units, dropped content and hallucinations. These errors, which occur rarely and unpredictably in Neural Machine Translation (NMT), greatly undermine the reliability of state-of-the-art MT systems. Consequently, it is important to have visibility into these problems during model development.\nTowards this end, we introduce SALTED, a specifications-based framework for behavioral testing of NMT models. At the core of our approach is the use of high-precision detectors that flag errors (or alternatively, verify output correctness) between a source sentence and a system output. These detectors provide fine-grained measurements of long-tail errors, providing a trustworthy view of problems that were previously invisible. We demonstrate that such detectors could be used not just to identify salient long-tail errors in MT systems, but also for higher-recall filtering of the training data, fixing targeted errors with model fine-tuning in NMT and generating novel data for metamorphic testing to elicit further bugs in models.", "track": "Machine Translation", "label": 10, "url": "https://www.semanticscholar.org/reader/a349bcb86ba80ef543e5deaadbb7e0ff5daef5e7?experiments=&features=reader_skimming%3Atrue"}, {"loc": [3.2614967823028564, 4.833678722381592], "id": 3397, "title": "Discord Questions: A Computational Approach To Diversity Analysis in News Coverage", "authors": "Philippe Laban, Chien-Sheng Wu, Lidiya Murakhovs'ka, Xiang Chen and Caiming Xiong", "abstract": "There are many potential benefits to news readers accessing diverse sources. Modern news aggregators do the hard work of organizing the news, offering readers a plethora of source options, but choosing which source to read remains challenging.\nWe propose a new framework to assist readers in identifying source differences and gaining an understanding of news coverage diversity.\nThe framework is based on the generation of Discord Questions: questions with a diverse answer pool, explicitly illustrating source differences.\nTo assemble a prototype of the framework, we focus on two components: (1) discord question generation, the task of generating questions answered differently by sources, for which we propose an automatic scoring method, and create a model that improves performance from current question generation (QG) methods by 5%, (2) answer consolidation, the task of grouping answers to a question that are semantically similar, for which we collect data and repurpose a method that achieves 81% balanced accuracy on our realistic test set.\nWe illustrate the framework's feasibility through a prototype interface. Even though model performance at discord QG still lags human performance by more than 15%, generated questions are judged to be more interesting than factoid questions and can reveal differences in the level of detail, sentiment, and reasoning of sources in news coverage. Code is available at https://github.com/Salesforce/discord_questions.", "track": "NLP Applications", "label": 0, "url": "https://www.semanticscholar.org/reader/ef194ab52031cde7c6119c7701499c1fd9bc9d65?experiments=&features=reader_skimming%3Atrue"}, {"loc": [6.230443477630615, 5.289445877075195], "id": 3398, "title": "Adversarial Multi-task Training for Debiased Toxicity Detection", "authors": "Zhenhao Li, Marina Fomicheva, Ozan Caglayan and Lucia Specia", "abstract": "Current toxicity detection models tend to overfit on specific terms such as profanity words or group identity mentions, among others. This results in unintended biases in predictions, such as models predicting all occurrences of \"black people\" as toxic. Previous work on mitigating biases in toxicity detection focuses on improving models via techniques such as regularisation, data sampling, and ensembling. In this paper, we propose a new method where potential biases are modelled as additional tasks. Our multi-task learning approach extracts representations that share relevant information across tasks, and relies on adversarial learning to disentangle representations that are task-specific and could lead to biases. Our experiments on three potential biases -- sentiment, profanity, and identity mentions -- show that our method successfully mitigates unintended biases and improves toxicity detection performance on out-of-domain settings while also improving or maintaining performance on in-domain settings.", "track": "Computational Social Science and Cultural Analytics", "label": 20, "url": ""}, {"loc": [3.089956045150757, 4.662405490875244], "id": 3406, "title": "FocusQA: Open-Domain Question Answering with a Context in Focus", "authors": "Gianni Barlacchi, Ivano Lauriola, Alessandro Moschitti, Marco Del Tredici, Xiaoyu Shen, Thuy Vu, Bill Byrne and Adri\u00e0 de Gispert", "abstract": "We introduce question answering with a cotext in focus, a task that simulates a free interaction with a QA system. The user reads on a screen some information about a topic, and they can follow-up with questions that can be either related or not to the topic; and the answer can be found in the document containing the screen content or from other pages. We call such information context. To study the task, we construct FocusQA, a dataset for answer sentence selection (AS2) with 12,165011\nunique question/context pairs, and a total of 109,940 answers. To build the dataset, we developed a novel methodology that takes existing questions and pairs them with relevant contexts. To show the benefits of this approach, we present a comparative analysis with a set of questions written by humans after reading the context, showing that our approach greatly helps in eliciting more realistic question/context pairs. Finally, we show that the task poses several challenges for incorporating contextual information. In this respect, we introduce strong baselines for answer sentence selection that outperform the precision of state-of-the-art models for AS2 up to 21.3% absolute points.", "track": "Resources and Evaluation", "label": 1, "url": ""}, {"loc": [4.950631618499756, 5.908518314361572], "id": 3413, "title": "Challenges and Opportunities in Information Manipulation Detection: An Examination of Wartime Russian Media", "authors": "Chan Young Park, Julia Mendelsohn, Anjalie Field and Yulia Tsvetkov", "abstract": "NLP research on public opinion manipulation campaigns has primarily focused on detecting overt strategies such as fake news and disinformation. However, information manipulation in the ongoing Russia-Ukraine war exemplifies how governments and media also employ more nuanced strategies. We release a new dataset, VoynaSlov, containing 38M+ posts from Russian media outlets on Twitter and VKontakte, as well as public activity and responses, immediately preceding and during the 2022 Russia-Ukraine war. We apply standard and recently-developed NLP models on VoynaSlov to examine agenda setting, framing, and priming, several strategies underlying information manipulation, and reveal variation across media outlet control, social media platform, and time. Our examination of these media effects and extensive discussion of current approaches' limitations encourage further development of NLP models for understanding information manipulation in emerging crises, as well as other real-world and interdisciplinary tasks.", "track": "Ethic Concerns:Theme Track", "label": 18, "url": "https://www.semanticscholar.org/reader/b616154578751e156b21561e1a5d5ed833a3506f?experiments=&features=reader_skimming%3Atrue"}, {"loc": [8.032393455505371, 9.707032203674316], "id": 3417, "title": "Disentangling Task Relations for Few-shot Text Classification via Self-Supervised Hierarchical Task Clustering", "authors": "Juan Zha, Zheng Li, Ying Wei and Yu Zhang", "abstract": "Few-Shot Text Classification (FSTC) imitates humans to learn a new text classifier efficiently with only few examples, by leveraging prior knowledge from historical tasks. However, most prior works assume that all the tasks are sampled from a single data source, which cannot adapt to real-world scenarios where tasks are heterogeneous and lie in different distributions. As such, existing methods may suffer from their globally knowledge-shared mechanisms to handle the task heterogeneity. On the other hand, inherent task relationships are not explicitly captured, making task knowledge unorganized and hard to transfer to new tasks. Thus, we explore a new FSTC setting where tasks can come from a diverse range of data sources. To address the task heterogeneity, we propose a self-supervised hierarchical task clustering (SS-HTC) method. SS-HTC not only customizes the cluster-specific knowledge by dynamically organizing heterogeneous tasks into different clusters in hierarchical levels but also disentangles the underlying relations between tasks to improve the interpretability. Empirically, extensive experiments on five public FSTC benchmark datasets demonstrate the effectiveness of SS-HTC.", "track": "Machine Learning for NLP", "label": 3, "url": "https://www.semanticscholar.org/reader/26527955d4603f4af05610453228ebfc2404b269?experiments=&features=reader_skimming%3Atrue"}, {"loc": [1.3641283512115479, 4.940248966217041], "id": 3427, "title": "XRICL: Cross-lingual Retrieval-Augmented In-Context Learning for Cross-lingual Text-to-SQL Semantic Parsing", "authors": "Peng Shi, Rui Zhang, He Bai and Jimmy Lin", "abstract": "In-context learning using large language models has recently shown surprising results for semantic parsing tasks such as Text-to-SQL translation.\nPrompting GPT-3 or Codex using several examples of question-SQL pairs can produce excellent results, comparable to state-of-the-art finetuning-based models.\nHowever, existing work primarily focuses on English datasets, and it is unknown whether large language models can serve as competitive semantic parsers for other languages.\nTo bridge this gap, our work focuses on cross-lingual Text-to-SQL semantic parsing for translating non-English utterances into SQL queries based on an English schema.\nWe consider a zero-shot transfer learning setting with the assumption that we do not have any labeled examples in the target language (but have annotated examples in English).\nThis work introduces the XRICL framework, which learns to retrieve relevant English exemplars for a given query to construct prompts.\nWe also include global translation exemplars for a target language to facilitate the translation process for large language models.\nTo systematically evaluate our model, we construct two new benchmark datasets, XSpider and XKaggle-dbqa, which include questions in Chinese, Vietnamese, Farsi, and Hindi.\nOur experiments show that XRICL effectively leverages large pre-trained language models to outperform existing baselines.\nData and code are publicly available at https://github.com/Impavidity/XRICL.", "track": "Semantics: Lexical, Sentence level, Textual Inference and Other areas", "label": 8, "url": "https://www.semanticscholar.org/reader/38e1a9c5599fc7597b7c5ffd37951ba5f528094c?experiments=&features=reader_skimming%3Atrue"}, {"loc": [7.818761825561523, 7.932519912719727], "id": 3432, "title": "Continuation KD: Improved Knowledge Distillation through the Lens of Continuation Optimization", "authors": "Aref Jafari, Ivan Kobyzev, Mehdi Rezagholizadeh, Pascal Poupart and Ali Ghodsi", "abstract": "Knowledge Distillation (KD) has been extensively used for natural language understanding (NLU) tasks to improve a small model's (a student) generalization by transferring the knowledge from a larger model (a teacher). Although KD methods achieve state-of-the-art performance in numerous settings, they suffer from several problems limiting their performance. It is shown in the literature that the capacity gap between the teacher and the student networks can make KD ineffective. Additionally, existing KD techniques do not mitigate the noise in the teacher's output: modeling the noisy behaviour of the teacher can distract the student from learning more useful features. We propose a new KD method that addresses these problems and facilitates the  training compared to previous techniques. Inspired by continuation optimization, we design a training procedure that optimizes the highly non-convex KD objective by starting with the smoothed version of this objective and making it more complex as the training proceeds. Our method (Continuation-KD) achieves state-of-the-art performance across various compact architectures on NLU (GLUE benchmark) and computer vision tasks (CIFAR-10 and CIFAR-100).", "track": "Efficient Methods for NLP", "label": 12, "url": ""}, {"loc": [5.686916828155518, 6.2741570472717285], "id": 3435, "title": "Detecting Dementia from Long Neuropsychological Interviews", "authors": "Nauman Dawalatabad, Yuan Gong, Sameer Khurana, Rhoda Au and James Glass", "abstract": "Neuropsychological exams are commonly used to diagnose various kinds of cognitive impairment. They typically involve a trained examiner who conducts a series of cognitive tests with a subject. In recent years, there has been growing interest in developing machine learning methods to extract speech and language biomarkers from exam recordings to provide automated input for cognitive assessment. Inspired by recent findings suggesting that the examiner's language can influence cognitive impairment classifications, in this paper, we study the influence of the examiner on automatic dementia identification decisions in real-world neuropsychological exams. To mitigate the influence of the examiner, we propose a systematic three-stage pipeline for detecting dementia from exam recordings. In the first stage, we perform audio-based speaker diarization (i.e., estimating who spoke when?) by incorporating speaker discriminative features. In the second stage, we employ text-based language models to identify the role of the speaker (i.e., examiner or subject). Finally, in the third stage, we employ text- and audio-based models to detect cognitive impairment from hypothesized subject segments. Our studies suggest that incorporating audio-based diarization followed by text-based role identification helps mitigate the influences from the examiner's segments. Further, we found that the text and audio modalities complement each other, and the performance improves when we use both modalities. We also perform several carefully designed experimental studies to assess the performance of each stage.", "track": "Speech, Vision, Robotics, Multimodal Grounding", "label": 7, "url": ""}, {"loc": [4.780162334442139, 8.679004669189453], "id": 3438, "title": "Sarcasm Detection is Way Too Easy! An Empirical Comparison of Human and Machine Sarcasm Detection", "authors": "Ibrahim Abu Farha, Steven R. Wilson, Silviu Oprea and Walid Magdy", "abstract": "Recently, author-annotated sarcasm datasets, which focus on intended, rather than perceived sarcasm, have been introduced. Although datasets collected using first-party annotation have important benefits, there is no comparison of human and machine performance on these new datasets. In this paper, we collect new annotations to provide human-level benchmarks for these first-party annotated sarcasm tasks in both English and Arabic, and  compare the performance of human annotators to that of state-of-the-art sarcasm detection systems. Our analysis confirms that sarcasm detection is extremely challenging, with individual humans performing close to or slightly worse than the best trained models. With majority voting, however, humans are able to achieve the best results on all tasks. We also perform error analysis, finding that some of the most challenging examples are those that require additional context.  We also highlight common features and patterns used to express sarcasm in English and Arabic such as idioms and proverbs. We suggest that to better capture sarcasm, future sarcasm detection datasets and models should focus on representing conversational and cultural context while leveraging world knowledge and common sense.", "track": "Computational Social Science and Cultural Analytics", "label": 20, "url": ""}, {"loc": [1.3317899703979492, 4.932599067687988], "id": 3442, "title": "Cross-lingual Text-to-SQL Semantic Parsing with Representation Mixup", "authors": "Peng Shi, Linfeng Song, Lifeng Jin, Haitao Mi, He Bai, Jimmy Lin and Dong Yu", "abstract": "We focus on the cross-lingual Text-to-SQL semantic parsing task,\nwhere the parsers are expected to generate SQL for non-English utterances based on English database schemas.\nIntuitively, English translation as side information is an effective way to bridge the language gap,\nbut noise introduced by the translation system may affect parser effectiveness.\nIn this work, we propose a Representation Mixup Framework (Rex) for effectively exploiting translations in the cross-lingual Text-to-SQL task.\nParticularly, it uses a general encoding layer, a transition layer, and a target-centric layer to properly guide the information flow of the English translation.\nExperimental results on CSpider and VSpider show that our framework can benefit from cross-lingual training and improve the effectiveness of semantic parsers, achieving state-of-the-art performance.", "track": "Semantics: Lexical, Sentence level, Textual Inference and Other areas", "label": 8, "url": ""}, {"loc": [8.81701946258545, 6.611511707305908], "id": 3445, "title": "JamPatoisNLI: A Jamaican Patois Natural Language Inference Dataset", "authors": "Ruth-Ann Hazel Armstrong, John Hewitt and Christopher D. Manning", "abstract": "JamPatoisNLI provides the first dataset for natural language inference in a creole language, Jamaican Patois.\nMany of the most-spoken low-resource languages are creoles. These languages  commonly have a lexicon derived from a major world language and a distinctive grammar reflecting the languages of the original speakers and the process of language birth by creolization. This gives them a distinctive place in exploring the effectiveness of transfer from large monolingual or multilingual pretrained models. While our work, along with previous work, shows that transfer from these models to low-resource languages that are unrelated to languages in their training set is not very effective, we would expect stronger results from transfer to creoles. Indeed, our experiments show considerably better results from few-shot learning of JamPatoisNLI than for such unrelated languages, and help us begin to understand how the unique relationship between creoles and their high-resource base languages affect cross-lingual transfer. JamPatoisNLI, which consists of naturally-occurring premises and expert-written hypotheses, is a step towards steering research into a traditionally underserved language and a useful benchmark for understanding cross-lingual NLP.", "track": "Multilinguality", "label": 13, "url": ""}, {"loc": [6.900683879852295, 9.907169342041016], "id": 3457, "title": "Are Neural Topic Models Broken?", "authors": "Alexander Miserlis Hoyle, Rupak Sarkar, Pranav Goel and Philip Resnik", "abstract": "Recently, the relationship between automated and human evaluation of topic models has been called into question. Method developers have staked the efficacy of new topic model variants on automated measures, and their failure to approximate human preferences places these models on uncertain ground. Moreover, existing evaluation paradigms are often divorced from real-world use.\n\nMotivated by content analysis as a dominant real-world use case for topic modeling, we analyze two related aspects of topic models that affect their effectiveness and trustworthiness in practice for that purpose: the stability of their estimates and the extent to which the model's discovered categories align with human-determined categories in the data. We find that neural topic models fare worse in both respects compared to an established classical method. We take a step toward addressing both issues in tandem by demonstrating that a straightforward ensembling method can reliably outperform the members of the ensemble.", "track": "Information Retrieval and Text Mining", "label": 15, "url": ""}, {"loc": [4.566172122955322, 7.567196369171143], "id": 3468, "title": "Know Thy Strengths: Comprehensive Dialogue State Tracking Diagnostics", "authors": "Hyundong Cho, Chinnadhurai Sankar, Christopher Lin, Kaushik Ram Sadagopan, Shahin Shayandeh, Asli Celikyilmaz, Jonathan May and Ahmad Beirami", "abstract": "Recent works that revealed the vulnerability of dialogue state tracking (DST) models to distributional shifts have made holistic comparisons on robustness and qualitative analyses increasingly important for understanding their relative performance. \nWe present our findings from standardized and comprehensive DST diagnoses, which have previously been sparse and uncoordinated, using our toolkit, CheckDST, a collection of robustness tests and failure mode analytics. \nWe discover that different classes of DST models have clear strengths and weaknesses, where generation models are more promising for handling language variety while span-based classification models are more robust to unseen entities.  \nPrompted by this discovery, we also compare checkpoints from the same model and find that the standard practice of selecting checkpoints using validation loss/accuracy is prone to overfitting and each model class has distinct patterns of failure.   \nLastly, we demonstrate how our diagnoses motivate a pre-finetuning procedure with non-dialogue data that offers comprehensive improvements to generation models by alleviating the impact of distributional shifts through transfer learning.", "track": "Dialogue and Interactive Systems", "label": 4, "url": ""}, {"loc": [1.7146663665771484, 5.347075462341309], "id": 3470, "title": "Open-domain Question Answering via Chain of Reasoning over Heterogeneous Knowledge", "authors": "Kaixin Ma, Hao Cheng, Xiaodong Liu, Eric Nyberg and Jianfeng Gao", "abstract": "We propose a novel open-domain question answering (ODQA) framework for answering single/multi-hop questions across heterogeneous knowledge sources.\nThe key novelty of our method is the introduction of the intermediary modules into the current retriever-reader pipeline.\nUnlike previous methods that solely rely on the retriever for gathering all evidence in isolation,\nour intermediary performs a chain of reasoning over the retrieved set.\nSpecifically, our method links the retrieved evidence with its related global context into graphs and organizes them into a candidate list of evidence chains.\nBuilt upon pretrained language models, our system achieves competitive performance on two ODQA datasets, OTT-QA and NQ, against tables and passages from Wikipedia.\nIn particular, our model substantially outperforms the previous state-of-the-art on OTT-QA with an exact match score of 47.3 (45% relative gain).", "track": "Question Answering", "label": 11, "url": "https://www.semanticscholar.org/reader/fff24425c8eaa3af4422261b9e108374ded678f0?experiments=&features=reader_skimming%3Atrue"}, {"loc": [9.058396339416504, 6.4504241943359375], "id": 3472, "title": "Detecting Languages Unintelligible to Multilingual Models through Local Structure Probes", "authors": "Louis Clouatre, Prasanna Parthasarathi, Amal Zouaq and Sarath Chandar", "abstract": "Providing better language tools for low-resource and endangered languages is imperative for equitable growth.\nRecent progress with massively multilingual pretrained models has proven surprisingly effective at performing zero-shot transfer to a wide variety of languages.\nHowever, this transfer is not universal, with many languages not currently understood by multilingual approaches.\nIt is estimated that only 72 languages possess a \"small set of labeled datasets\" on which we could test a model's performance, the vast majority of languages not having the resources available to simply evaluate performances on.\nIn this work, we attempt to clarify which languages do and do not currently benefit from such transfer.\nTo that end, we develop a general approach that requires only unlabelled text to detect which languages are not well understood by a cross-lingual model.\nOur approach is derived from the hypothesis that if a model's understanding is insensitive to perturbations to text in a language, it is likely to have a limited understanding of that language.\nWe construct a cross-lingual sentence similarity task to evaluate our approach empirically on 350, primarily low-resource, languages.", "track": "Multilinguality", "label": 13, "url": "https://www.semanticscholar.org/reader/fc78d652c4d395ba2737ab0406bc53fd025d4aad?experiments=&features=reader_skimming%3Atrue"}, {"loc": [2.373991012573242, 7.31970739364624], "id": 3481, "title": "Open-Vocabulary Argument Role Prediction For Event Extraction", "authors": "Yizhu Jiao, Sha Li, Yiqing Xie, Ming Zhong, Heng Ji and Jiawei Han", "abstract": "The argument role in event extraction refers to the relation between an event and an argument participating in it. Despite the great progress in event extraction, existing studies still depend on roles pre-defined by domain experts. These studies expose obvious weakness when extending to emerging event types or new domains without available roles. Therefore, more attention and effort needs to be devoted to automatically customizing argument roles. In this paper, we define this essential but under-explored task: \\textbf{open-vocabulary argument role prediction}. The goal of this task is to infer a set of argument roles for a given event type. We propose a novel unsupervised framework, \\textsc{RolePred} for this task. Specifically, we formulate the role prediction problem as an in-filling task and construct prompts for a pre-trained language model to generate candidate roles. By extracting and analyzing the candidate arguments, the event-specific roles are further merged and selected. To standardize the research of this task, we collect a new human-annotated event extraction dataset including 143 customized argument roles with rich semantics. On this dataset, \\textsc{RolePred} outperforms the existing methods by a large margin.", "track": "Information Extraction", "label": 5, "url": "https://www.semanticscholar.org/reader/433e052ed37dd7fd43bf1bfd9e07419deb690814?experiments=&features=reader_skimming%3Atrue"}, {"loc": [9.52770709991455, 7.464467525482178], "id": 3497, "title": "Token-level Sequence Labeling for Spoken Language Understanding using Compositional End-to-End Models", "authors": "Siddhant Arora, Siddharth Dalmia, Brian Yan, Florian Metze, Alan W Black and Shinji Watanabe", "abstract": "End-to-end spoken language understanding (SLU) systems are gaining popularity over cascaded approaches due to their simplicity and ability to avoid error propagation. However, these systems model sequence labeling as a sequence prediction task causing a divergence from its well-established token-level tagging formulation. We build compositional end-to-end SLU systems that explicitly separate the added complexity of recognizing spoken mentions in SLU from the NLU task of sequence labeling. By relying on intermediate decoders trained for ASR, our end-to-end systems transform the input modality from speech to token-level representations that can be used in the traditional sequence labeling framework. This composition of ASR and NLU formulations in our end-to-end SLU system offers direct compatibility with pre-trained ASR and NLU systems, allows performance monitoring of individual components and enables the use of globally normalized losses like CRF, making them attractive in practical scenarios. Our models outperform both cascaded and direct end-to-end models on a labeling task of named entity recognition across SLU benchmarks.", "track": "Speech, Vision, Robotics, Multimodal Grounding", "label": 7, "url": ""}, {"loc": [6.73367977142334, 6.533031940460205], "id": 3503, "title": "Baked-in State Probing", "authors": "Shubham Toshniwal, Sam Wiseman, Karen Livescu and Kevin Gimpel", "abstract": "Neural language models have been analyzed for their linguistic and extra-linguistic knowledge via probing. Of particular interest has been the following question: how much can a language model trained only on form learn about meaning? Recent work has demonstrated via probing classifiers that in the setting of simple procedural text, where by \"meaning\" we mean the underlying world state, language models have a non-trivial performance on world state tracking. However, our proposed evaluation based on model predictions shows differing results, suggesting that these models are either not capturing the world state or not using it. How do these results change if the model has access to the world state? We explore this alternate setting with access to the underlying world state only during training and investigate ways of \"baking in\u201d the state knowledge along with the primary task of language modeling. Our proposed approaches allow for state probing during inference simply via text prompts, avoiding any probing classifier machinery. In terms of performance, we show that baking in the state knowledge during training leads to significant improvements in state tracking performance and text generation quality,", "track": "Interpretability, Interactivity and Analysis of Models for NLP", "label": 9, "url": ""}, {"loc": [5.141451358795166, 12.137025833129883], "id": 3511, "title": "Find Someone Who: Visual Commonsense Understanding in Human-Centric Grounding", "authors": "Haoxuan You, Rui Sun, Zhecan Wang, Kai-Wei Chang and Shih-Fu Chang", "abstract": "From a visual scene containing multiple people, human is able to distinguish each individual given the context descriptions about what happened before, their mental/physical states or intentions, etc. Above ability heavily relies on human-centric commonsense knowledge and reasoning.  For example, if asked to identify the \"person who needs healing\" in an image, we need to first know that they usually have injuries or suffering expressions, then find the corresponding visual clues before finally grounding the person. \nWe present a new commonsense task, Human-centric Commonsense Grounding, that tests the models' ability to ground individuals given the context descriptions about what happened before, and their mental/physical states or intentions. We further create a benchmark, HumanCog, a dataset with 130k grounded commonsensical descriptions annotated on 67k images, covering diverse types of commonsense and visual scenes. We set up a context-object-aware method as a strong baseline that outperforms previous pre-trained and non-pretrained models. Further analysis demonstrates that rich visual commonsense and powerful integration of multi-modal commonsense are essential, which sheds light on future works. Data and code will be available at https://github.com/Hxyou/HumanCog.", "track": "Speech, Vision, Robotics, Multimodal Grounding", "label": 7, "url": ""}, {"loc": [3.871528387069702, 9.226153373718262], "id": 3514, "title": "CrisisLTLSum: A Benchmark for Local Crisis Event Timeline Extraction and Summarization", "authors": "Hossein Rajaby Faghihi, Bashar Alhafni, Ke Zhang, Shihao Ran, Joel Tetreault and Alejandro Jaimes", "abstract": "Social media has increasingly played a key role in emergency response: first responders can use public posts to better react to ongoing crisis events and deploy the necessary resources where they are most needed. Timeline extraction and abstractive summarization are critical technical tasks to leverage large numbers of social media posts about events. Unfortunately, there are few datasets for benchmarking technical approaches for those tasks. This paper presents \\datasetname{}, the largest dataset of local crisis event timelines available to date. \\datasetname{} contains 1,000 crisis event timelines across four domains: wildfires, local fires, traffic, and storms. We built \\datasetname{} using a semi-automated cluster-then-refine approach to collect data from the public Twitter stream. \nOur initial experiments indicate a significant gap between the performance of strong baselines compared to the human performance on both tasks.\nOur dataset, code, and models are publicly available (https://github.com/CrisisLTLSum/CrisisTimelines).", "track": "Resources and Evaluation", "label": 1, "url": "https://www.semanticscholar.org/reader/bfb31e3572c37f4de88c89ab5c2acebf67c43a9e?experiments=&features=reader_skimming%3Atrue"}, {"loc": [9.164258003234863, 6.983469009399414], "id": 3528, "title": "Prompt-Tuning Can Be Much Better Than Fine-Tuning on Cross-lingual Understanding With Multilingual Language Models", "authors": "Lifu Tu, Caiming Xiong and Yingbo Zhou", "abstract": "Pre-trained multilingual language models show significant performance gains for zero-shot cross-lingual model transfer on a wide range of natural language understanding (NLU) tasks. Previously, for zero-shot cross-lingual evaluation, pre-trained models are only fine-tuned on English data and tested on a variety of target languages. In this paper, we do cross-lingual\nevaluation on various NLU tasks (sentence classification, sequence labeling, question answering) using prompt-tuning and compare it with fine-tuning. The results show that prompt tuning achieves much better cross-lingual transfer than fine-tuning across datasets, with only 0.1% to 0.3% tuned parameters. Additionally, we demonstrate through the analysis that prompt tuning can have better cross-lingual transfer-ability of representations on downstream tasks with better aligned decision boundaries.", "track": "Multilinguality", "label": 13, "url": "https://www.semanticscholar.org/reader/0f8806fb1c28733e59c4311479dc7cc916524919?experiments=&features=reader_skimming%3Atrue"}, {"loc": [9.959933280944824, 7.850012302398682], "id": 3530, "title": "BERT Meets CTC: New Formulation of End-to-End Speech Recognition with Pre-trained Masked Language Model", "authors": "Yosuke Higuchi, Brian Yan, Siddhant Arora, Tetsuji Ogawa, Tetsunori Kobayashi and Shinji Watanabe", "abstract": "This paper presents BERT-CTC, a novel formulation of end-to-end speech recognition that adapts BERT for connectionist temporal classification (CTC). Our formulation relaxes the conditional independence assumptions used in conventional CTC and incorporates linguistic knowledge through the explicit output dependency obtained by BERT contextual embedding. BERT-CTC attends to the full contexts of the input and hypothesized output sequences via the self-attention mechanism. This mechanism encourages a model to learn inner/inter-dependencies between the audio and token representations while maintaining CTC's training efficiency. During inference, BERT-CTC combines a mask-predict algorithm with CTC decoding, which iteratively refines an output sequence. The experimental results reveal that BERT-CTC improves over conventional approaches across variations in speaking styles and languages. Finally, we show that the semantic representations in BERT-CTC are beneficial towards downstream spoken language understanding tasks.", "track": "Speech, Vision, Robotics, Multimodal Grounding", "label": 7, "url": ""}, {"loc": [4.668966770172119, 9.15731143951416], "id": 3533, "title": "EtriCA: Event-Triggered Context-Aware Story Generation Augmented by Cross Attention", "authors": "Chen Tang, Chenghua Lin, Henglin Huang, Frank Guerin and Zhihao Zhang", "abstract": "One of the key challenges of automatic story generation is how to generate a long narrative that can maintain fluency, relevance, and coherence. Despite recent progress, current story generation systems still face the challenge of how to effectively capture contextual and event features, which has a profound impact on a model's generation performance. To address these challenges, we present EtriCA, a novel neural generation model, which improves the relevance and coherence of the generated stories through residually mapping context features to event sequences with a cross-attention mechanism. Such a feature capturing mechanism allows our model to better exploit the logical relatedness between events when generating stories. Extensive experiments based on both automatic and human evaluations show that our model significantly outperforms state-of-the-art baselines, demonstrating the effectiveness of our model in leveraging  context and event features.", "track": "Natural Language Generation", "label": 6, "url": "https://www.semanticscholar.org/reader/58b8da3821affc426895a85dbac5556322e6e2a9?experiments=&features=reader_skimming%3Atrue"}, {"loc": [5.9025468826293945, 9.186478614807129], "id": 3534, "title": "LADIS: Language Disentanglement for 3D Shape Editing", "authors": "Ian Huang, Panos Achlioptas, Tianyi Zhang, Sergei Tulyakov, Minhyuk Sung and Leonidas Guibas", "abstract": "Natural language interaction is a promising direction for democratizing 3D shape design. However, existing methods for text-driven 3D shape editing face challenges in producing decoupled, local edits to 3D shapes. We address this problem by learning disentangled latent representations that ground language in 3D geometry. To this end, we propose a complementary tool set including a novel network architecture, a disentanglement loss, and a new editing procedure. Additionally, to measure edit locality, we define a new metric that we call part-wise edit precision. We show that our method outperforms existing SOTA methods by 20% in terms of edit locality, and up to 6.6% in terms of language reference resolution accuracy. Human evaluations  additionally show that compared to the existing SOTA, our method produces shape edits that are more local, more semantically accurate, and more visually obvious. Our work suggests that by solely disentangling language representations, downstream 3D shape editing can become more local to relevant parts, even if the model was never given explicit part-based supervision.", "track": "Speech, Vision, Robotics, Multimodal Grounding", "label": 7, "url": ""}, {"loc": [8.532156944274902, 7.888370513916016], "id": 3544, "title": "Effective Pretraining Objectives for Transformer-based Autoencoders", "authors": "Luca Di Liello, Matteo Gabburo and Alessandro Moschitti", "abstract": "In this paper, we study trade-offs between efficiency, cost and accuracy when pre-training Transformer encoders with different pre-training objectives. For this purpose, we analyze features of common objectives and combine them to create new effective pre-training approaches. Specifically, we designed light token generators based on a straightforward statistical approach, which can replace ELECTRA computationally heavy generators, thus highly reducing cost. Our experiments also show that (i) there are more efficient alternatives to BERT's MLM, and (ii) it is possible to efficiently pre-train Transformer-based models using lighter generators without a significant drop in performance.", "track": "Machine Learning for NLP", "label": 3, "url": "https://www.semanticscholar.org/reader/3a4f61e87d8d6e24e5dbdbe59483d6a250a64607?experiments=&features=reader_skimming%3Atrue"}, {"loc": [4.861241340637207, 7.375240802764893], "id": 3578, "title": "Language Model Detoxification in Dialogue with Contextualized Stance Control", "authors": "Jing Qian and Xifeng Yan", "abstract": "To reduce the toxic degeneration in a pretrained Language Model (LM), previous work on Language Model detoxification has focused on reducing the toxicity of the generation itself (self-toxicity) without consideration of the context. As a result, a type of implicit offensive language where the generations support the offensive language in the context is ignored. Different from the LM controlling tasks in previous work, where the desired attributes are fixed for generation, the desired stance of the generation depends on the offensiveness of the context. Therefore, we propose a novel control method to do context-dependent detoxification with the stance taken into consideration.  We introduce meta prefixes to learn the contextualized stance control strategy and to generate the stance control prefix according to the input context. The generated stance prefix is then combined with the toxicity control prefix to guide the response generation. Experimental results show that our proposed method can effectively learn the context-dependent stance control strategies while keeping a low self-toxicity of the underlying LM.", "track": "Computational Social Science and Cultural Analytics", "label": 20, "url": ""}, {"loc": [2.0995357036590576, 7.5966339111328125], "id": 3582, "title": "Multilingual SubEvent Relation Extraction: A Novel Dataset and Structure Induction Method", "authors": "Viet Dac Lai, Hieu Man, Linh Ngo, Franck Dernoncourt and Thien Huu Nguyen", "abstract": "Subevent Relation Extraction (SRE) is a task in Information Extraction that aims to recognize spatial and temporal containment relations between event mentions in text. Recent methods have utilized pre-trained language models to represent input texts for SRE. However, a key issue in existing SRE methods is the employment of sequential order of words in texts to feed into representation learning methods, thus unable to explicitly focus on important context words and their interactions to enhance representations. In this work, we introduce a new method for SRE that learns to induce effective graph structures for input texts to boost representation learning. Our method features a word alignment framework with dependency paths and optimal transport to identify important context words to form effective graph structures for SRE. In addition, to enable SRE research on non-English languages, we present a new multilingual SRE dataset for five typologically different languages. Extensive experiments reveal the state-of-the-art performance for our method on different datasets and languages.", "track": "Information Extraction", "label": 5, "url": ""}, {"loc": [1.6975172758102417, 5.370996475219727], "id": 3585, "title": "A Two-Stage Approach towards Generalization in Knowledge Base Question Answering", "authors": "Srinivas Ravishankar, Dung Thai, Ibrahim Abdelaziz, Nandana Mihindukulasooriya, Tahira Naseem, Pavan Kapanipathi, Gaetano Rossiello and Achille Fokoue", "abstract": "Most existing approaches for Knowledge Base Question Answering (KBQA) focus on a specific underlying knowledge base either because of inherent assumptions in the approach, or because evaluating it on a different knowledge base requires non-trivial changes. However, many popular knowledge bases share similarities in their underlying schemas that can be leveraged to facilitate generalization across knowledge bases. To achieve this generalization, we introduce a KBQA framework based on a 2-stage architecture that explicitly separates semantic parsing from the knowledge base interaction, facilitating transfer learning across datasets and knowledge graphs. We show that pretraining on datasets with a different underlying knowledge base can nevertheless provide significant performance gains and reduce sample complexity. Our approach achieves comparable or state-of-the-art performance for LC-QuAD (DBpedia), WebQSP (Freebase), SimpleQuestions (Wikidata) and MetaQA (Wikimovies-KG).", "track": "Question Answering", "label": 11, "url": "https://www.semanticscholar.org/reader/b2a7b03a3c403b7c7d01a5f52dfdbd845323ab66?experiments=&features=reader_skimming%3Atrue"}, {"loc": [8.001968383789062, 9.687429428100586], "id": 3612, "title": "Few-Shot (Dis)Agreement Identification in Online Discussions with Regularized and Augmented Meta-Learning", "authors": "Yuanyuan Lei and Ruihong Huang", "abstract": "Online discussions are abundant with  opinions towards a common topic, and identifying (dis)agreement between a pair of comments enables many opinion mining applications. Realizing the increasing needs to analyze opinions for emergent new topics that however tend to lack annotations, we present the first meta-learning approach for few-shot (dis)agreement identification that can be quickly applied to analyze opinions for new topics with few labeled instances. Furthermore, we enhance the meta-learner's domain generalization ability from two perspectives. The first is domain-invariant regularization, where we design a lexicon-based regularization loss to enable the meta-learner to learn domain-invariant cues. The second is domain-aware augmentation, where we propose domain-aware task augmentation for meta-training to learn domain-specific expressions. In addition to using an existing dataset, we also evaluate our approach on two very recent new topics, mask mandate and COVID vaccine, using our newly annotated datasets containing 1.5k and 1.4k SubReddits comment pairs respectively. Extensive experiments on three domains/topics demonstrate the effectiveness of our meta-learning approach.", "track": "Sentiment Analysis, Stylistic Analysis, and Argument Mining", "label": 16, "url": ""}, {"loc": [10.710810661315918, 6.927748203277588], "id": 3615, "title": "Data Cartography for Low-Resource Neural Machine Translation", "authors": "Aquia Richburg and Marine Carpuat", "abstract": "While collecting or generating more parallel data is necessary to improve machine translation (MT) in low-resource settings, we lack an understanding of how the limited amounts of existing data are actually used to help guide the collection of further resources.  In this paper, we apply data cartography techniques (Swayamdipta et al., 2020) to characterize the contribution of training samples in two low-resource MT tasks (Swahili-English and Turkish-English) throughout the training of standard neural MT models.  Our empirical study shows that, unlike in prior work for classification tasks, most samples contribute to model training in low-resource MT, albeit not uniformly throughout the training process. \n Furthermore, uni-dimensional characterizations of samples -- e.g., based on dual cross-entropy or word frequency -- do not suffice to characterize to what degree they are hard or easy to learn.  Taken together, our results suggest that data augmentation strategies for low-resource MT would benefit from model-in-the-loop strategies to maximize improvements.", "track": "Machine Translation", "label": 10, "url": "https://www.semanticscholar.org/reader/f2e15f3f2c3d4f7e8cf8445435e40d65d828ffd5?experiments=&features=reader_skimming%3Atrue"}, {"loc": [1.3235055208206177, 4.910745143890381], "id": 3645, "title": "Augmenting Multi-Turn Text-to-SQL Datasets with Self-Play", "authors": "Qi Liu, Zihuiwen Ye, Tao Yu, Linfeng Song and Phil Blunsom", "abstract": "The task of context-dependent text-to-SQL aims to convert multi-turn user utterances to formal SQL queries. This is a challenging task due to both the scarcity of training data from which to learn complex contextual dependencies and to generalize to unseen databases. In this paper we explore augmenting the training datasets using self-play, which leverages contextual information to synthesize new interactions to adapt the model to new databases. We first design a SQL-to-text model conditioned on a sampled goal query, which represents a user's intent, that then converses with a text-to-SQL semantic parser to generate new interactions. We then filter the synthesized interactions and retrain the models with the augmented data. We find that self-play improves the accuracy of a strong baseline on SParC and CoSQL, two widely used cross-domain text-to-SQL datasets. Our analysis shows that self-play simulates various conversational thematic relations, enhances cross-domain generalization and improves beam-search.", "track": "Syntax, Parsing and their Applications", "label": 23, "url": "https://www.semanticscholar.org/reader/891db4adb6d10a51882430ab1266f51e6e3408c5?experiments=&features=reader_skimming%3Atrue"}, {"loc": [5.990258693695068, 8.834150314331055], "id": 3647, "title": "Prompt Compression and Contrastive Conditioning for Controllability and Toxicity Reduction in Language Models", "authors": "David Wingate, Mohammad Shoeybi and Taylor Sorensen", "abstract": "We explore the idea of compressing the prompts used to condition language models, and show that compressed prompts can retain a substantive amount of information about the original prompt. For severely compressed prompts, while fine-grained information is lost, abstract information and general sentiments can be retained with surprisingly few parameters, which can be useful in the context of decode-time algorithms for controllability and toxicity reduction. We find that some complex prompts can be effectively compressed into a single token to guide generation. We also show that compressed prompts are largely compositional, and can be constructed such that they can be used to control independent aspects of generated text.", "track": "Ethic Concerns:Language Modeling and Analysis of Language Models", "label": 2, "url": "https://www.semanticscholar.org/reader/4afda39036206dcb3f97829dccb897f1fc80f459?experiments=&features=reader_skimming%3Atrue"}, {"loc": [7.579198837280273, 3.7355782985687256], "id": 3664, "title": "NaturalAdversaries: Can Naturalistic Adversaries Be as Effective as Artificial Adversaries?", "authors": "Saadia Gabriel, Hamid Palangi and Yejin Choi", "abstract": "While a substantial body of prior work has explored adversarial example generation for natural language understanding tasks, these examples are often unrealistic and diverge from the real-world data distributions. In this work, we introduce a two-stage adversarial example generation framework (NaturalAdversaries), for designing adversaries that are effective at fooling a given classifier and demonstrate natural-looking failure cases that could plausibly occur during in-the-wild deployment of the models. At the first stage a token attribution method is used to summarize a given classifier's behavior as a function of the key tokens in the input. In the second stage a generative model is conditioned on the key tokens from the first stage. NaturalAdversaries is adaptable to both black-box and white-box adversarial attacks based on the level of access to the model parameters. Our results indicate these adversaries generalize across domains, and offer insights for future research on improving robustness of neural text classification models.", "track": "Resources and Evaluation", "label": 1, "url": "https://www.semanticscholar.org/reader/337ad42b01d0ff764aa46a1ac9e3a93e2830e06c?experiments=&features=reader_skimming%3Atrue"}, {"loc": [10.523860931396484, 7.183385372161865], "id": 3679, "title": "Multi-Path Transformer is Better: A Case Study on Neural Machine Translation", "authors": "Ye Lin, Shuhan Zhou, Yanyang Li, Anxiang Ma, Tong Xiao and Jingbo Zhu", "abstract": "For years the model performance in machine learning obeyed a power-law relationship with the model size. For the consideration of parameter efficiency, recent studies focus on increasing model depth rather than width to achieve better performance. In this paper, we study how model width affects the Transformer model through a parameter-efficient multi-path structure. To better fuse features extracted from different paths, we add three additional operations to each sublayer: a normalization at the end of each path, a cheap operation to produce more features, and a learnable weighted mechanism to fuse all features flexibly. Extensive experiments on 12 WMT machine translation tasks show that, with the same number of parameters, the shallower multi-path model can achieve similar or even better performance than the deeper model. It reveals that we should pay more attention to the multi-path structure, and there should be a balance between the model depth and width to train a better large-scale Transformer.", "track": "Machine Learning for NLP", "label": 3, "url": ""}, {"loc": [3.853700637817383, 7.779420852661133], "id": 3683, "title": "Unsupervised Learning of Hierarchical Conversation Structure", "authors": "Bo-Ru Lu, Yushi Hu, Hao Cheng, Noah A. Smith and Mari Ostendorf", "abstract": "Human conversations can evolve in many different ways, creating challenges for automatic understanding and summarization. Goal-oriented conversations often have meaningful sub-dialogue structure, but it can be highly domain-dependent. This work introduces an unsupervised approach to learning hierarchical conversation structure, including turn and sub-dialogue segment labels, corresponding roughly to dialogue acts and sub-tasks, respectively. The decoded structure is shown to be useful in enhancing neural models of language for three conversation-level understanding tasks. Further, the learned finite-state sub-dialogue network is made interpretable through automatic summarization.", "track": "Dialogue and Interactive Systems", "label": 4, "url": "https://www.semanticscholar.org/reader/42b3982331aa3dbd233d6c45bf34577223e2ecc9?experiments=&features=reader_skimming%3Atrue"}, {"loc": [7.6703386306762695, 8.579376220703125], "id": 3685, "title": "Task Compass: Scaling Multi-task Pre-training with Task Prefix", "authors": "Zhuosheng Zhang, Shuohang Wang, Yichong Xu, Yuwei Fang, Wenhao Yu, Yang Liu, Hai Zhao, Chenguang Zhu and Michael Zeng", "abstract": "Leveraging task-aware annotated data as supervised signals to assist with self-supervised learning on large-scale unlabeled data has become a new trend in pre-training language models. Existing studies show that multi-task learning with large-scale supervised tasks suffers from negative effects across tasks. To tackle the challenge, we propose a task prefix guided multi-task pre-training framework to explore the relationships among tasks. We conduct extensive experiments on 40 datasets, which show that our model can not only serve as the strong foundation backbone for a wide range of tasks but also be feasible as a probing tool for analyzing task relationships. The task relationships reflected by the prefixes align transfer learning performance between tasks. They also suggest directions for data augmentation with complementary tasks, which help our model achieve human-parity results on commonsense reasoning leaderboards. Code is available at https://github.com/cooelf/CompassMTL.", "track": "Language Modeling and Analysis of Language Models", "label": 2, "url": "https://www.semanticscholar.org/reader/0979695b5d74016e97ab8f306f632114e98bd6d9?experiments=&features=reader_skimming%3Atrue"}, {"loc": [7.541600704193115, 3.7566184997558594], "id": 3688, "title": "Sharpness-Aware Minimization with Dynamic Reweighting", "authors": "Wenxuan Zhou, Fangyu Liu, Huan Zhang and Muhao Chen", "abstract": "Deep neural networks are often overparameterized and may not easily achieve model generalization. Adversarial training has shown effectiveness in improving generalization by regularizing the change of loss on top of adversarially chosen perturbations. The recently proposed sharpness-aware minimization (SAM) algorithm conducts adversarial weight perturbation, encouraging the model to converge to a flat minima. SAM finds a common adversarial weight perturbation per-batch. Although per-instance adversarial weight perturbations are stronger adversaries and can potentially lead to better generalization performance, their computational cost is very high and thus it is impossible to use per-instance perturbations efficiently in SAM. In this paper, we tackle this efficiency bottleneck and propose sharpness-aware minimization with dynamic reweighting (delta-SAM). Our theoretical analysis motivates that it is possible to approach the stronger, per-instance adversarial weight perturbations using reweighted per-batch weight perturbations. delta-SAM dynamically reweights perturbation within each batch according to the theoretically principled weighting factors, serving as a good approximation to per-instance perturbation. Experiments on various natural language understanding tasks demonstrate the effectiveness of delta-SAM.", "track": "Machine Learning for NLP", "label": 3, "url": "https://www.semanticscholar.org/reader/9284038a5d2512653d7834d72f2ac353fd443d66?experiments=&features=reader_skimming%3Atrue"}, {"loc": [6.449916839599609, 7.521115779876709], "id": 3693, "title": "Predicting Long-Term Citations from Short-Term Linguistic Influence", "authors": "Sandeep Soni, David Bamman and Jacob Eisenstein", "abstract": "A standard measure of the influence of a research paper is the number of times it is cited. However, papers may be cited for many reasons, and citation count is not informative about the extent to which a paper affected the content of subsequent publications. We therefore propose a novel method to quantify linguistic influence in timestamped document collections. There are two main steps: first, identify lexical and semantic changes using contextual embeddings and word frequencies; second, aggregate information about these changes into per-document influence parameters by estimating a high-dimensional Hawkes process with a low-rank parameter matrix. The resulting measures of linguistic influence are predictive of \\emph{future} citations. Specifically, the estimate of linguistic influence from the two years after a paper's publication is correlated with and predictive of its citation count in the following three years. This is demonstrated using an online evaluation with incremental temporal training/test splits, in comparison with a strong baseline that includes predictors for initial citation counts, topics, and lexical features.", "track": "Computational Social Science and Cultural Analytics", "label": 20, "url": "https://www.semanticscholar.org/reader/6744b490c49db0945b5eb1aa7358097393d4c185?experiments=&features=reader_skimming%3Atrue"}, {"loc": [10.024506568908691, 7.926711082458496], "id": 3697, "title": "Joint Audio/Text Training for Transformer Rescorer of Streaming Speech Recognition", "authors": "Suyoun Kim, Ke Li, Lucas Kabela, Ron Huang, Jiedan Zhu, Ozlem Kalinli and Duc Le", "abstract": "Recently, there has been an increasing interest in two-pass streaming end-to-end speech recognition (ASR) that incorporates a 2nd-pass rescoring model on top of the conventional 1st-pass streaming ASR model to improve recognition accuracy while keeping latency low. One of the latest 2nd-pass rescoring model, Transformer Rescorer, takes the n-best initial outputs and audio embeddings from the 1st-pass model, and then choose the best output by re-scoring the n-best initial outputs. However, training this Transformer Rescorer requires expensive paired audio-text training data because the model uses audio embeddings as input. In this work, we present our Joint Audio/Text training method for Transformer Rescorer, to leverage unpaired text-only data which is relatively cheaper than paired audio-text data. We evaluate Transformer Rescorer with our Joint Audio/Text training on Librispeech dataset as well as our large-scale in-house dataset and show that our training method can improve word error rate (WER) significantly compared to standard Transformer Rescorer without requiring any extra model parameters or latency.", "track": "Speech, Vision, Robotics, Multimodal Grounding", "label": 7, "url": "https://www.semanticscholar.org/reader/a6c80f38f085dcade0f28d262962c30c24b9c362?experiments=&features=reader_skimming%3Atrue"}, {"loc": [4.501277446746826, 7.108351230621338], "id": 3700, "title": "TyDiP: A Dataset for Politeness Classification in Nine Typologically Diverse Languages", "authors": "Anirudh Srinivasan and Eunsol Choi", "abstract": "We study politeness phenomena in nine typologically diverse languages. Politeness is an important facet of communication and is sometimes argued to be cultural-specific, yet existing computational linguistic study is limited to English. We create TyDiP, a dataset containing three-way politeness annotations for 500 examples in each language, totaling 4.5K examples. We evaluate how well multilingual models can identify politeness levels -- they show a fairly robust zero-shot transfer ability, yet fall short of estimated human accuracy significantly. We further study mapping the English politeness strategy lexicon into nine languages via automatic translation and lexicon induction, analyzing whether each strategy's impact stays consistent across languages. Lastly, we empirically study the complicated relationship between formality and politeness through transfer experiments. We hope our dataset will support various research questions and applications, from evaluating multilingual models to constructing polite multilingual agents.", "track": "Unsupervised and Weakly-Supervised Methods in NLP", "label": 17, "url": ""}, {"loc": [5.493197441101074, 12.417745590209961], "id": 3714, "title": "Probing Cross-modal Semantics Alignment Capability from the Textual Perspective", "authors": "Zheng Ma, Shi Zong, Mianzhi Pan, Jianbing Zhang, Shujian Huang, Xinyu Dai and Jiajun CHEN", "abstract": "In recent years, vision and language pre-training (VLP) models have advanced the state-of-the-art results in a variety of cross-modal downstream tasks. Aligning cross-modal semantics is claimed to be one of the essential capabilities of VLP models. However, it still remains unclear about the inner working mechanism of alignment in VLP models. In this paper, we propose a new probing method that is based on image captioning to first empirically study the cross-modal semantics alignment of VLP models. Our probing method is built upon the fact that given an image-caption pair, the VLP models will give a score, indicating how well two modalities are aligned; maximizing such scores will generate sentences that VLP models believe are of good alignment. Analyzing these sentences thus will reveal in what way different modalities are aligned and how well these alignments are in VLP models. We apply our probing method to five popular VLP models, including UNITER, ROSITA, ViLBERT, CLIP, and LXMERT, and provide a comprehensive analysis of the generated captions guided by these models. Our results show that VLP models (1) focus more on just aligning objects with visual words, while neglecting global semantics; (2) prefer fixed sentence patterns, thus ignoring more important textual information including fluency and grammar; and (3) deem the captions with more visual words are better aligned with images. These findings indicate that VLP models still have weaknesses in cross-modal semantics alignment and we hope this work will draw researchers' attention to such problems when designing a new VLP model.", "track": "Interpretability, Interactivity and Analysis of Models for NLP", "label": 9, "url": "https://www.semanticscholar.org/reader/3171d9252ffae34a671c8c98f99fe99ead96e458?experiments=&features=reader_skimming%3Atrue"}, {"loc": [8.691482543945312, 8.38038444519043], "id": 3715, "title": "Hidden State Variability of Pretrained Language Models Can Guide Computation Reduction for Transfer Learning", "authors": "Shuo Xie, Jiahao Qiu, Ankita Pasad, Li Du, Qing Qu and Hongyuan Mei", "abstract": "While transferring a pretrained language model, common approaches conventionally attach their task-specific classifiers to the top layer and adapt all the pretrained layers. We investigate whether one could make a task-specific selection on which subset of the layers to adapt and where to place the classifier. The goal is to reduce the computation cost of transfer learning methods (e.g. fine-tuning or adapter-tuning) without sacrificing its performance.\n\nWe propose to select layers based on the variability of their hidden states given a task-specific corpus. \nWe say a layer is already ``well-specialized'' in a task if the within-class variability of its hidden states is low relative to the between-class variability. Our variability metric is cheap to compute and doesn't need any training or hyperparameter tuning. It is robust to data imbalance and data scarcity. Extensive experiments on the GLUE benchmark demonstrate that selecting layers based on our metric can yield significantly stronger performance than using the same number of top layers and often match the performance of fine-tuning or adapter-tuning the entire language model.", "track": "Language Modeling and Analysis of Language Models", "label": 2, "url": "https://www.semanticscholar.org/reader/1c7ddec500b12a39040057758e3b972bd02c4758?experiments=&features=reader_skimming%3Atrue"}, {"loc": [6.602209091186523, 6.4114837646484375], "id": 3728, "title": "Language Models as Agent Models", "authors": "Jacob Andreas", "abstract": "Language models (LMs) are trained on collections of documents, written by individual human agents to achieve specific goals in the outside world. During training, LMs have access only to text of these documents, with no direct evidence of the internal states of the agents that produced them---a fact often used to argue that LMs are incapable of modeling goal-directed aspects of human language production and comprehension.  Can LMs trained on text learn anything at all about the relationship between language and use?  I argue that LMs are models of communicative intentions in a specific, narrow sense. When performing next word prediction given a textual context, an LM can infer and represent properties of an agent likely to have produced that context.  These representations can in turn influence subsequent LM generation in the same way that agents' communicative intentions influence their language. I survey findings from the recent literature showing that---even in today's non-robust and error-prone models---LMs infer and use representations of fine-grained communicative intentions and high-level beliefs and goals.  Despite the limited nature of their training data, they can thus serve as building blocks for systems that communicate and act intentionally.", "track": "Theme Track", "label": 18, "url": ""}, {"loc": [0.9188224673271179, 8.126646995544434], "id": 3738, "title": "Combinatory Grammar Tells Underlying Relevance among Entities", "authors": "Yuanhe Tian and Yan Song", "abstract": "Relation extraction (RE) is an important task in natural language processing which aims to annotate the relation between two given entities, which requires a deep understanding of the running text. To import model performance, existing approaches leverage syntactic information to facilitate the relation extraction process, where they mainly focus on dependencies among words while paying limited attention to other types of syntactic structure. Considering that combinatory categorial grammar (CCG) is a lexicalized grammatical formalism that carries the syntactic and semantic knowledge for text understanding, we propose an alternative solution for RE that takes advantage of CCG to detect the relation between entities. In doing so, we perform a multi-task learning process to learn from RE and auto-annotated CCG supertags, where an attention mechanism is performed over all input words to distinguish the important ones for RE with the attention weights guided by the supertag decoding process. We evaluate our model on two widely used English benchmark datasets (i.e., ACE2005EN and SemEval 2010 Task 8 datasets) for RE, where the effectiveness of our approach is demonstrated by the experimental results with our approach achieving state-of-the-art performance on both datasets.", "track": "Information Retrieval and Text Mining", "label": 15, "url": ""}, {"loc": [4.854565143585205, 6.876981735229492], "id": 3748, "title": "Leveraging Open Data and Task Augmentation to Automated Behavioral Coding of Psychotherapy Conversations in Low-Resource Scenarios", "authors": "Zhuohao Chen, Nikolaos Flemotomos, Zac Imel, David Atkins and Shrikanth Narayanan", "abstract": "In psychotherapy interactions, the quality of a session is assessed by codifying the communicative behaviors of participants during the conversation through manual observation and annotation. Developing computational approaches for automated behavioral coding can reduce the burden on human coders and facilitate the objective evaluation of the intervention. In the real world, however, implementing such algorithms is associated with data sparsity challenges since privacy concerns lead to limited available in-domain data. In this paper, we leverage a publicly available conversation-based dataset and transfer knowledge to the low-resource behavioral coding task by performing an intermediate language model training via meta-learning. We introduce a task augmentation method to produce a large number of ``analogy tasks'' \u2014 tasks similar to the target one \u2014 and demonstrate that the proposed framework predicts target behaviors more accurately than all the other baseline models.", "track": "Linguistic Theories, Cognitive Modeling and Psycholinguistics", "label": 22, "url": "https://www.semanticscholar.org/reader/9b76c99ae13e0b6d578e2302f27c083e41a18f7b?experiments=&features=reader_skimming%3Atrue"}, {"loc": [7.2511725425720215, 9.505478858947754], "id": 3749, "title": "Learning to Detect Noisy Labels Using Model-Based Features", "authors": "Zhihao Wang, Zongyu Lin, Junjie Wen, Xianxin Chen, Peiqi Liu, Guidong Zheng, Yujun Chen and Zhilin Yang", "abstract": "Label noise is ubiquitous in various machine learning scenarios such as self-labeling with model predictions and erroneous data annotation. Many existing approaches are based on heuristics such as sample losses, which might not be flexible enough to achieve optimal solutions. Meta learning based methods address this issue by learning a data selection function, but can be hard to optimize. In light of these pros and cons, we propose SENT (Selection-Enhanced Noisy label Training) that does not rely on meta learning while having the flexibility of being data-driven. SENT transfers the noise distribution to a clean set and trains a model to distinguish noisy labels from clean ones using model-based features. Empirically, on a wide range of tasks including text classification and speech recognition, SENT improves performance over strong baselines under the settings of self-training and label corruption.", "track": "Machine Learning for NLP", "label": 3, "url": ""}, {"loc": [5.100921154022217, 9.623579978942871], "id": 3753, "title": "Keyphrase Generation Beyond the Boundaries of Title and Abstract", "authors": "Krishna Garg, Jishnu Ray Chowdhury and Cornelia Caragea", "abstract": "Keyphrase generation aims at generating important phrases (keyphrases) that best describe a given document. In scholarly domains, current approaches have largely used only the title and abstract of the articles to generate keyphrases. In this paper, we comprehensively explore whether the integration of additional information from the full text of a given article or from semantically similar articles can be helpful for a neural keyphrase generation model or not. We discover that adding sentences from the full text, particularly in the form of the extractive summary of the article can significantly improve the generation of both types of keyphrases that are either present or absent from the text. Experimental results with three widely used models for keyphrase generation along with one of the latest transformer models suitable for longer documents, Longformer Encoder-Decoder (LED) validate the observation. We also present a new large-scale scholarly dataset FullTextKP for keyphrase generation. Unlike prior large-scale datasets, FullTextKP includes the full text of the articles along with the title and abstract. We release the source code at https://github.com/kgarg8/FullTextKP.", "track": "Information Extraction", "label": 5, "url": "https://www.semanticscholar.org/reader/c2b11dfa7f94127893279df950756d3bedf7f599?experiments=&features=reader_skimming%3Atrue"}, {"loc": [7.322485446929932, 7.006447792053223], "id": 3767, "title": "Composition, Attention, or Both?", "authors": "Ryo Yoshida and Yohei Oseki", "abstract": "In this paper, we propose a novel architecture called Composition Attention Grammars (CAGs) that recursively compose subtrees into a single vector representation with a composition function, and selectively attend to previous structural information with a self-attention mechanism. We investigate whether these components---the composition function and the self-attention mechanism---can both induce human-like syntactic generalization. Specifically, we train language models (LMs) with and without these two components with the model sizes carefully controlled, and evaluate their syntactic generalization performance against six test circuits on the SyntaxGym benchmark. The results demonstrated that the composition function and the self-attention mechanism both play an important role to make LMs more human-like, and closer inspection of linguistic phenomenon implied that the composition function allowed syntactic features, but not semantic features, to percolate into subtree representations.", "track": "Linguistic Theories, Cognitive Modeling and Psycholinguistics", "label": 22, "url": ""}, {"loc": [6.109938621520996, 8.323406219482422], "id": 3777, "title": "CDGP: Automatic Cloze Distractor Generation based on Pre-trained Language Model", "authors": "Shang-Hsuan Chiang, Ssu-Cheng Wang and Yao-Chung Fan", "abstract": "Manually designing cloze test consumes enormous time and efforts. The major challenge lies in wrong option (distractor) selection. Having carefully-design distractors improves the effectiveness of learner ability assessment. As a result, the idea of automatically generating cloze distractor is motivated. In this paper, we investigate cloze distractor generation by exploring the employment of pre-trained language models (PLMs) as an alternative for candidate distractor generation. Experiments show that the PLM-enhanced model brings a substantial performance improvement. Our best performing model advances the state-of-the-art result from 14.94 to 34.17 (NDCG@10 score). Our code and dataset is available at \nhttps://github.com/AndyChiangSH/CDGP.", "track": "NLP Applications", "label": 0, "url": ""}, {"loc": [5.090182304382324, 12.533550262451172], "id": 3778, "title": "G3: Geolocation via Guidebook Grounding", "authors": "Grace Luo, Giscard Biamby, Trevor Darrell, Daniel Fried and Anna Rohrbach", "abstract": "We demonstrate how language can improve geolocation: the task of predicting the location where an image was taken. Here we study explicit knowledge from human-written guidebooks that describe the salient and class-discriminative visual features humans use for geolocation. We propose the task of Geolocation via Guidebook Grounding that uses a dataset of StreetView images from a diverse set of locations and an associated textual guidebook for GeoGuessr, a popular interactive geolocation game. Our approach predicts a country for each image by attending over the clues automatically extracted from the guidebook. Supervising attention with country-level pseudo labels achieves the best performance. Our approach substantially outperforms a state-of-the-art image-only geolocation method, with an improvement of over 5% in Top-1 accuracy. Our dataset and code can be found at https://github.com/g-luo/geolocation_via_guidebook_grounding.", "track": "Speech, Vision, Robotics, Multimodal Grounding", "label": 7, "url": ""}, {"loc": [6.026961803436279, 5.405941486358643], "id": 3785, "title": "Controlling Bias Exposure for Fair Interpretable Predictions", "authors": "Zexue He, Yu Wang, Julian McAuley and Bodhisattwa Prasad Majumder", "abstract": "Recent work on reducing bias in NLP models usually focuses on protecting or isolating information related to a sensitive attribute (like gender or race). However, when sensitive information is semantically entangled with the task information of the input, e.g., gender information is predictive for a profession, a fair trade-off between task performance and bias mitigation is difficult to achieve. Existing approaches perform this trade-off by eliminating bias information from the latent space, lacking control over how much bias is necessarily required to be removed. We argue that a favorable debiasing method should use sensitive information \u2018fairly', rather than blindly eliminating it (Caliskan et al., 2017; Sun et al., 2019; Bogen et al., 2020). In this work, we provide a novel debiasing algorithm by adjusting\nthe predictive model's belief to (1) ignore the sensitive information if it is not useful for the task; (2) use sensitive information minimally as necessary for the prediction (while also incurring a penalty). Experimental results on two text classification tasks (influenced by gender) and an open-ended generation task (influenced by race) indicate that our model achieves a desirable trade-off between debiasing and task performance along with producing debiased rationales as evidence.", "track": "Ethics", "label": 21, "url": "https://www.semanticscholar.org/reader/6ee75df901a5b8f9e048402bb41cffdd1f6b178f?experiments=&features=reader_skimming%3Atrue"}, {"loc": [5.0633955001831055, 4.9315948486328125], "id": 3821, "title": "Investigating the Benefits of Free-Form Rationales", "authors": "Jiao Sun, Swabha Swayamdipta, Jonathan May and Xuezhe Ma", "abstract": "Free-form rationales aim to aid model interpretability by supplying the background knowledge that can help understand model decisions. Crowdsourced rationales are provided for commonsense QA instances in popular datasets such as CoS-E and ECQA, but their utility remains under-investigated. We present human studies which show that ECQA rationales indeed provide additional background information to understand a decision, while over 88% of CoS-E rationales do not. Inspired by this finding, we ask: can the additional context provided by free-form rationales benefit models, similar to human users? We investigate the utility of rationales as an additional source of supervision, by varying the quantity and quality of rationales during training. After controlling for instances where rationales leak the correct answer while not providing additional background knowledge, we find that incorporating only 5% of rationales during training can boost model performance by 47.22% for CoS-E and 57.14% for ECQA during inference. Moreover, we also show that rationale quality matters: compared to crowdsourced rationales, T5-generated rationales provide not only weaker supervision to models, but are also not helpful for humans in aiding model interpretability.", "track": "Interpretability, Interactivity and Analysis of Models for NLP", "label": 9, "url": "https://www.semanticscholar.org/reader/a9c3677f3f82817c402ed06040067860785188f4?experiments=&features=reader_skimming%3Atrue"}, {"loc": [4.7183098793029785, 3.430185556411743], "id": 3853, "title": "Data-Efficient Concept Extraction from Pre-trained Language Models for Commonsense Explanation Generation", "authors": "Yanbo Fang and Yongfeng Zhang", "abstract": "Predicting the key explanation concept is essential for generating commonsense explanations. This paper introduces a method to predict the concept from pre-trained language models for commonsense explanation generation. Our experiment found that adopting a language model as the concept extractor and fine-tuning it with 20% training data can improve the quality and accuracy of the generated explanations over multiple evaluation metrics. Compared with conventional methods that search concepts over knowledge graphs, our method does not require the preparation and training models to search through knowledge graphs. To better understand the results from pre-trained language models, we also designed a metric to evaluate the retrieved concepts. Through analysis and experiments, we show the correlation between this metric and the performance of the generators, and we also show the importance of attaching concepts for generating high-quality sentences.", "track": "Natural Language Generation", "label": 6, "url": ""}, {"loc": [1.6340166330337524, 8.558052062988281], "id": 3862, "title": "Unsupervised Domain Adaptation for Joint Information Extraction", "authors": "Nghia Ngo Trung, Bonan Min and Thien Huu Nguyen", "abstract": "Joint Information Extraction (JIE) aims to jointly solve multiple tasks in the Information Extraction pipeline (e.g., entity mention, event trigger, relation, and event argument extraction). Due to their ability to leverage task dependencies and avoid error propagation, JIE models have presented state-of-the-art performance for different IE tasks. However, an issue with current JIE methods is that they only focus on standard supervised learning setting where training and test data comes from the same domain. Cross-domain/domain adaptation learning with training and test data in different domains have not been explored for JIE, thus hindering the application of this technology to different domains in practice. To address this issue, our work introduces the first study to evaluate performance of JIE models in unsupervised domain adaptation setting. In addition, we present a novel method to induce domain-invariant representations for the tasks in JIE, called Domain Adaptation for Joint Information Extraction (DA4JIE). In DA4JIE, we propose an Instance-relational Domain Adaptation mechanism that seeks to align representations of task instances in JIE across domains through a generalized version of domain-adversarial learning approach. We further devise a Context-invariant Structure Learning technique to filter domain-specialized contextual information from induced representations to boost performance of JIE models in new domains. Extensive experiments and analyses demonstrate that DA4JIE can significantly improve out-of-domain performance for current state-of-the-art JIE systems for all IE tasks.", "track": "Information Extraction", "label": 5, "url": ""}, {"loc": [7.909524917602539, 3.3119137287139893], "id": 3866, "title": "Foiling Training-Time Attacks on Neural Machine Translation Systems", "authors": "Jun Wang, Xuanli He, Benjamin Rubinstein and Trevor Cohn", "abstract": "Neural machine translation (NMT) systems are vulnerable to backdoor attacks, whereby an attacker injects poisoned samples into training such that a trained model produces malicious translations. Nevertheless, there is little research on defending against such backdoor attacks in NMT. In this paper, we first show that backdoor attacks that have been successful in text classification are also effective against machine translation tasks. We then present a novel defence method that exploits a key property of most backdoor attacks: namely the asymmetry between the source and target language sentences, which is used to facilitate malicious text insertions, substitutions and suchlike. Our technique uses word alignment coupled with language model scoring to detect outlier tokens, and thus can find and filter out training instances which may contain backdoors. Experimental results demonstrate that our technique can significantly reduce the success of various attacks by up to 89.0%, while not affecting predictive accuracy.", "track": "Machine Translation", "label": 10, "url": ""}, {"loc": [5.605201721191406, 11.145689964294434], "id": 3869, "title": "Learning Action-Effect Dynamics for Hypothetical Vision-Language Reasoning Task", "authors": "Shailaja Keyur Sampat, Pratyay Banerjee, Yezhou Yang and Chitta Baral", "abstract": "'Actions' play a vital role in how humans interact with the world. Thus, autonomous agents that would assist us in everyday tasks also require the capability to perform 'Reasoning about Actions & Change' (RAC). This has been an important research direction in Artificial Intelligence (AI) in general, but the study of RAC with visual and linguistic inputs is relatively recent. The CLEVR_HYP (Sampat et. al., 2021) is one such testbed for hypothetical vision-language reasoning with actions as the key focus. In this work, we propose a novel learning strategy that can improve reasoning about the effects of actions. We implement an encoder-decoder architecture to learn the representation of actions as vectors. We combine the aforementioned encoder-decoder architecture with existing modality parsers and a scene graph question answering model to evaluate our proposed system on the CLEVR_HYP dataset. We conduct thorough experiments to demonstrate the effectiveness of our proposed approach and discuss its advantages over previous baselines in terms of performance, data efficiency, and generalization capability.", "track": "Speech, Vision, Robotics, Multimodal Grounding", "label": 7, "url": ""}, {"loc": [5.538020610809326, 12.720898628234863], "id": 3897, "title": "Named Entity and Relation Extraction with Multi-Modal Retrieval", "authors": "Xinyu Wang, Jiong Cai, Yong Jiang, Pengjun Xie, Kewei Tu and Wei Lu", "abstract": "Multi-modal named entity recognition (NER) and relation extraction (RE) aim to leverage relevant image information to improve the performance of NER and RE. \nMost existing efforts largely focused on directly extracting potentially useful information from images (such as pixel-level features, identified objects, and associated captions).\nHowever, such extraction processes may not be knowledge aware, resulting in information that may not be highly relevant.\nIn this paper, we propose a novel Multi-modal Retrieval based framework (MoRe).\nMoRe contains a text retrieval module and an image-based retrieval module, which retrieve related knowledge of the input text and image in the knowledge corpus respectively.\nNext, the retrieval results are sent to the textual and visual models respectively for predictions.\nFinally, a Mixture of Experts (MoE) module combines the predictions from the two models to make the final decision.\nOur experiments show that both our textual model and visual model can achieve state-of-the-art performance on four multi-modal NER datasets and one multi-modal RE dataset.\nWith MoE, the model performance can be further improved and our analysis demonstrates the benefits of integrating both textual and visual cues for such tasks.", "track": "Information Extraction", "label": 5, "url": ""}, {"loc": [5.008468151092529, 3.7165839672088623], "id": 3910, "title": "Calibrating Factual Knowledge in Pretrained Language Models", "authors": "Qingxiu Dong, Damai Dai, Yifan Song, Jingjing Xu, Zhifang Sui and Lei Li", "abstract": "Previous literature has proved that Pretrained Language Models~(PLMs) can store factual knowledge. \nHowever, we find that facts stored in the PLMs are not always correct. It motivates us to explore a fundamental question: How do we calibrate factual knowledge in PLMs without re-training from scratch? In this work, we propose a simple and lightweight method CaliNet to achieve this goal. To be specific, we first detect whether PLMs can learn the right facts via a contrastive score between right and fake facts. If not, we then use a lightweight method to add and adapt new parameters to specific factual texts. \nExperiments on the knowledge probing task show the calibration effectiveness and efficiency. \nIn addition, through closed-book question answering, we find that the calibrated PLM possesses knowledge generalization ability after finetuning.\nBeyond the calibration performance, we further investigate and visualize the knowledge calibration mechanism.", "track": "Language Modeling and Analysis of Language Models", "label": 2, "url": ""}, {"loc": [8.129040718078613, 5.210988998413086], "id": 3915, "title": "MCPG: A Flexible Multi-Level Controllable Framework for Unsupervised Paraphrase Generation", "authors": "Yi Chen, Haiyun Jiang, Lemao Liu, Rui Wang, Shuming Shi and Ruifeng Xu", "abstract": "We present MCPG: a simple and effective\napproach for controllable unsupervised paraphrase generation, which is also flexible to\nadapt to specific domains without extra training. MCPG is controllable in different levels: local lexicons, global semantics, and universal styles. The unsupervised paradigm of\nMCPG combines factual keywords and diversified semantic embeddings as local lexical and\nglobal semantic constraints. The semantic embeddings are diversified by standard dropout,\nwhich is exploited for the first time to increase\ninference diversity by us. Moreover, MCPG\nis qualified with good domain adaptability by\nadding a transfer vector as a universal style constraint, which is refined from the exemplars retrieved from the corpus of the target domain in a\ntraining-free way. Extensive experiments show\nthat MCPG outperforms state-of-the-art unsupervised baselines by a margin. Meanwhile,\nour domain-adapted MCPG also achieves competitive performance with strong supervised\nbaselines even without training.", "track": "Natural Language Generation", "label": 6, "url": ""}, {"loc": [6.899649620056152, 5.91014289855957], "id": 3931, "title": "WordTies: Measuring Word Associations in Language Models via Constrained Sampling", "authors": "Peiran Yao, Tobias Renwick and Denilson Barbosa", "abstract": "Word associations are widely used in psychology to provide insights on how humans perceive and understand concepts. \nComparing word associations in language models (LMs) to those generated by human subjects can serve as a proxy to uncover embedded lexical and commonsense knowledge in language models. \nWhile much helpful work has been done applying direct metrics, such as cosine similarity, to help understand latent spaces, these metrics are symmetric, while human word associativity is asymmetric. \nWe propose WordTies, an algorithm based on constrained sampling from LMs, which allows an asymmetric measurement of associated words, given a cue word as the input. \nComparing to existing methods, word associations found by this method share more overlap with associations provided by humans, and observe the asymmetric property of human associations. \nTo examine possible reasons behind associations, we analyze the knowledge and reasoning behind the word pairings as they are linked to lexical and commonsense knowledge graphs.\nWhen the knowledge about the nature of the word pairings is combined with a probability that the LM has learned that information, we have a new way to examine what information is captured in LMs.", "track": "Semantics: Lexical, Sentence level, Textual Inference and Other areas", "label": 8, "url": ""}, {"loc": [3.360987901687622, 4.0825605392456055], "id": 3944, "title": "Exploring The Landscape of Distributional Robustness for Question Answering Models", "authors": "Anas Awadalla, Mitchell Wortsman, Gabriel Ilharco, Sewon Min, Ian Magnusson, Hannaneh Hajishirzi and Ludwig Schmidt", "abstract": "We conduct a large empirical evaluation to investigate the landscape of distributional robustness in question answering. Our investigation spans over 350 models and 16 question answering datasets, including a diverse set of architectures, model sizes, and adaptation methods (e.g., fine-tuning, adapter tuning, in-context learning, etc.). We find that, in many cases, model variations do not affect robustness and in-distribution performance alone determines out-of-distribution performance.\nMoreover, our findings indicate that\ni) zero-shot and in-context learning methods are more robust to distribution shifts than fully fine-tuned models;\nii) few-shot prompt fine-tuned models exhibit better robustness than few-shot fine-tuned span prediction models;\niii) parameter-efficient and robustness enhancing training methods provide no significant robustness improvements.\nIn addition, we publicly release all evaluations to encourage researchers to further analyze robustness trends for question answering models.", "track": "Interpretability, Interactivity and Analysis of Models for NLP", "label": 9, "url": "https://www.semanticscholar.org/reader/7cf4f8cb8b4a373d869e785b79160dda7a49a250?experiments=&features=reader_skimming%3Atrue"}, {"loc": [5.196673393249512, 11.815200805664062], "id": 3945, "title": "Collaborative Reasoning on Multi-Modal Semantic Graphs for Video-Grounded Dialogue Generation", "authors": "Xueliang Zhao, Yuxuan Wang, Chongyang Tao, Chenshuo Wang and Dongyan Zhao", "abstract": "We study video-grounded dialogue generation, where a response is generated based on the dialogue context and the associated video. The primary challenges of this task lie in (1)  the difficulty of integrating video data into pre-trained language models (PLMs) which presents obstacles to exploiting the power of large-scale pre-training; and (2) the necessity of taking into account the complementarity of various modalities throughout the reasoning process. Although having made remarkable progress in video-grounded dialogue generation, existing methods still fall short when it comes to integrating with PLMs in a way that allows information from different modalities to complement each other. To alleviate these issues, we first propose extracting pertinent information from videos and turning it into reasoning paths that are acceptable to PLMs. Additionally, we propose a multi-agent reinforcement learning method to collaboratively perform reasoning on different modalities (i.e., video and dialogue context). Empirical experiment results on two public datasets indicate that the proposed model can significantly outperform state-of-the-art models by large margins on both automatic and human evaluations.", "track": "Dialogue and Interactive Systems", "label": 4, "url": "https://www.semanticscholar.org/reader/256fd60c692ebe12fe2bbf65d46722f511aa3117?experiments=&features=reader_skimming%3Atrue"}, {"loc": [9.708629608154297, 7.980014324188232], "id": 3958, "title": "Partitioned Gradient Matching-based Data Subset Selection for Compute-Efficient Robust ASR Training", "authors": "Ashish Mittal, Durga Sivasubramanian, Rishabh Iyer, Preethi Jyothi and Ganesh Ramakrishnan", "abstract": "Training state-of-the-art ASR systems such as RNN-T often has a high associated financial and environmental cost. Training with a subset of training data could mitigate this problem if the subset selected could achieve on-par performance with training with the entire dataset. Although there are many data subset selection(DSS) algorithms, direct application to the RNN-T is difficult, especially the DSS algorithms that are adaptive and use learning dynamics such as gradients, as RNN-T tend to have gradients with a significantly larger memory footprint. In this paper, we propose Partitioned Gradient Matching (PGM) a novel distributable DSS algorithm, suitable for massive datasets like those used to train RNN-T. Through extensive experiments on Librispeech 100H and Librispeech 960H, we show that PGM achieves between 3x to 6x speedup with only a very small accuracy degradation (under 1% absolute WER difference). In addition, we demonstrate similar results for PGM even in settings where the training data is corrupted with noise.", "track": "Efficient Methods for NLP", "label": 12, "url": ""}, {"loc": [0.510472297668457, 7.165741443634033], "id": 3960, "title": "Adaptive Graph Convolutional Network for Knowledge Graph Entity Alignment", "authors": "Renbo Zhu, Xukun Luo, Meng Ma and Ping Wang", "abstract": "Entity alignment (EA) aims to identify equivalent entities from different Knowledge Graphs (KGs), which is a fundamental task for integrating KGs. Throughout its development, Graph Convolutional Network (GCN) has become one of the mainstream methods for EA. These GCN-based methods learn the representations of entities from two KGs by message passing mechanism and then make alignments via measuring the similarity between entity embeddings. The key idea that GCN works in EA is that entities with similar neighbor structures are highly likely to be aligned. However, the noisy neighbors of entities transfer invalid information, drown out equivalent information, lead to inaccurate entity embeddings, and finally reduce the performance of EA. Based on the Sinkhorn algorithm, we design a reliability measure for potential equivalent entities and propose Adaptive Graph Convolutional Network to deal with neighbor noises in GCN. During the training, the network dynamically updates the adaptive weights of relation triples to weaken the propagation of noises. While calculating entity similarity, it comprehensively considers the self-similarity and neighborhood similarity of the entity pair to alleviate the influence of noises. Furthermore, we design a straightforward but efficient strategy to construct pseudo alignments for unsupervised EA. Extensive experiments on benchmark datasets demonstrate that our framework outperforms the state-of-the-art methods in both supervised and unsupervised settings.", "track": "Machine Learning for NLP", "label": 3, "url": ""}, {"loc": [6.155917644500732, 5.769199848175049], "id": 3961, "title": "Towards Robust NLG Bias Evaluation with Syntactically-diverse Prompts", "authors": "Arshiya Aggarwal, Jiao Sun and Nanyun Peng", "abstract": "We present a robust methodology for evaluating biases in natural language generation(NLG) systems. Previous works use fixed hand-crafted prefix templates with mentions of various demographic groups to prompt models to generate continuations for bias analysis. These fixed prefix templates could themselves be specific in terms of styles or linguistic structures, which may lead to unreliable fairness conclusions that are not representative of the general trends from tone varying prompts. To study this problem, we paraphrase the prompts with different syntactic structures and use these to evaluate demographic bias in NLG systems. Our results suggest similar overall bias trends but some syntactic structures lead to contradictory conclusions compared to past works. We show that our methodology is more robust and that some syntactic structures prompt more toxic content while others could prompt less biased generation. This suggests the importance of not relying on a fixed syntactic structure and using tone-invariant prompts. Introducing syntactically-diverse prompts can achieve more robust NLG (bias) evaluation.", "track": "Interpretability, Interactivity and Analysis of Models for NLP", "label": 9, "url": ""}, {"loc": [3.8473222255706787, 9.227507591247559], "id": 3964, "title": "PcMSP: A Dataset for Scientific Action Graphs Extraction from Polycrystalline Materials Synthesis Procedure Text", "authors": "Xianjun Yang, Ya Zhuo, Julia Zuo, Xinlu Zhang, Stephen Wilson and Linda Petzold", "abstract": "Scientific action graphs extraction from materials synthesis procedures is important for reproducible research, machine automation, and material prediction. But the lack of annotated data has hindered progress in this field. We demonstrate an effort to annotate P}olycrystalline Materials Synthesis Procedures PcMSP from 305 open access scientific articles for the construction of synthesis action graphs. This is a new dataset for material science information extraction that simultaneously contains the synthesis sentences extracted from the experimental paragraphs, as well as the entity mentions and intra-sentence relations. A two-step human annotation and inter-annotator agreement study guarantee the high quality of the PcMSP corpus. We introduce four natural language processing tasks: sentence classification, named entity recognition, relation classification, and joint extraction of entities and relations. Comprehensive experiments validate the effectiveness of several state-of-the-art models for these challenges while leaving large space for improvement. We also perform the error analysis and point out some unique challenges that require further investigation. We will release our annotation scheme, the corpus, and codes to the research community to alleviate the scarcity of labeled data in this domain.", "track": "Information Extraction", "label": 5, "url": "https://www.semanticscholar.org/reader/36790bd387ccc069d3c1a8986bb0cb166d056672?experiments=&features=reader_skimming%3Atrue"}, {"loc": [4.773200035095215, 4.7127227783203125], "id": 3965, "title": "Validity Assessment of Legal Will Statements as Natural Language Inference", "authors": "Alice Saebom Kwak, Jacob O. Israelsen, Clayton T. Morrison, Derek E. Bambauer and Mihai Surdeanu", "abstract": "This work introduces a natural language inference (NLI) dataset that focuses on the validity of statements in legal wills. This dataset is unique because: (a) each entailment decision requires three inputs: the statement from the will, the law, and the conditions that hold at the time of the testator's death; and (b) the included texts are longer than the ones in current NLI datasets. We trained eight neural NLI models in this dataset. All the models achieve more than 80% macro F1 and accuracy, which indicates that neural approaches can handle this task reasonably well. However, group accuracy, a stricter evaluation measure that is calculated with a group of positive and negative examples  generated from the same statement as a unit, is in mid 80s at best, which suggests that the models' understanding of the task remains superficial. Further ablative analyses and explanation experiments indicate that all three text segments are used for prediction, but some decisions rely on semantically irrelevant tokens. This indicates that overfitting on these longer texts likely happens, and that additional research is required for this task to be solved.", "track": "Resources and Evaluation", "label": 1, "url": "https://www.semanticscholar.org/reader/9e6d3cb1249f17a419b3b6140d30a9e1e4b8314d?experiments=&features=reader_skimming%3Atrue"}, {"loc": [7.908806324005127, 9.121292114257812], "id": 3975, "title": "AdaPrompt: Adaptive Model Training for Prompt-based NLP", "authors": "Yulong Chen, Yang Liu, Li Dong, Shuohang Wang, Chenguang Zhu, Michael Zeng and Yue Zhang", "abstract": "Prompt-based learning, with its capability to tackle zero-shot and few-shot NLP tasks, has gained much attention in the community.\nThe main idea is to bridge the gap between NLP downstream tasks and language modeling (LM), by mapping these tasks into natural language prompts, which are then filled by pre-trained language models (PLMs).\nHowever, for prompt learning, there are still two salient gaps between NLP tasks and pretraining.\nFirst, prompt information is not necessarily sufficiently present during LM pre-training. \nSecond, task-specific data are not necessarily well represented during pre-training. \nWe address these two issues by proposing AdaPrompt, adaptively retrieving external data for continual pretraining of PLMs by making use of both task and prompt characteristics. \nIn addition, we make use of knowledge in Natural Language Inference models for deriving adaptive verbalizers.\nExperimental results on five NLP benchmarks show that AdaPrompt can improve over standard PLMs in few-shot settings. \nIn addition, in zero-shot settings, our method outperforms standard prompt-based methods by up to 26.35\\% relative error reduction.", "track": "Language Modeling and Analysis of Language Models", "label": 2, "url": ""}, {"loc": [6.4626898765563965, 1.9154670238494873], "id": 3988, "title": "Code Generation From Flowcharts with Texts: A Benchmark Dataset and An Approach", "authors": "ZeJie Liu, Xiaoyu Hu, Deyu Zhou, lin li, Xu Zhang and Yanzheng Xiang", "abstract": "Currently, researchers focus on generating codes from the requirement documents. However, current approaches still perform poorly on some requirements needing complex problem-solving skills. In reality, to tackle such complex requirements, instead of directly translating requirement documents into codes, software engineers write codes via unified modeling language diagrams, such as flowcharts, an intermediate tool to analyze and visualize the system. Therefore, we propose a new source code generation task, that is, to generate source code from flowcharts with texts. We manually construct a benchmark dataset containing 320 flowcharts with their corresponding source codes. Obviously, it is not straightforward to employ the current approaches for the new source code generation task since (1) the flowchart is a graph that contains various structures, including loop, selection, and others which is different from texts; (2) the connections between nodes in the flowchart are abundant and diverse which need to be carefully handled. To solve the above problems, we propose a two-stage code generation model. In the first stage, a structure recognition algorithm is employed to transform the flowchart into pseudo-code containing the structural conventions of a typical programming language such as while, if.  In the second stage, a code generation model is employed to convert the pseudo-code into code. Experimental results show that the proposed approach can achieve some improvement over the baselines.", "track": "NLP Applications", "label": 0, "url": ""}, {"loc": [5.242216110229492, 12.558262825012207], "id": 3998, "title": "Focus! Relevant and Sufficient Context Selection for News Image Captioning", "authors": "Mingyang Zhou, Grace Luo, Anna Rohrbach and Zhou Yu", "abstract": "News Image Captioning requires describing an image by leveraging additional context derived from a news article. Previous works only coarsely leverage the article to extract the necessary context, which makes it challenging for models to identify relevant events and named entities. In our paper, we first demonstrate that by combining more fine-grained context that captures the key named entities (obtained via an oracle) and the global context that summarizes the news, we can dramatically improve the model's ability to generate accurate news captions. This begs the question, how to automatically extract such key entities from an image? We propose to use pre-trained vision and language retrieval model CLIP to localize the visually grounded entities in the news article, and then capture the non-visual entities via a open relation extraction model. Our experiments demonstrate that by simply selecting better context from the article, we can significantly improve the performance of existing models and achieve the new state-of-the-art performance on multiple benchmarks.", "track": "Speech, Vision, Robotics, Multimodal Grounding", "label": 7, "url": ""}, {"loc": [1.043867826461792, 10.542702674865723], "id": 4014, "title": "Generative Aspect-Based Sentiment Analysis with Contrastive Learning and Expressive Structure", "authors": "Joseph Peper and Lu Wang", "abstract": "Generative models have demonstrated impressive results on Aspect-based Sentiment Analysis (ABSA) tasks, particularly for the emerging task of extracting Aspect-Category-Opinion-Sentiment (ACOS) quadruples. However, these models struggle with implicit sentiment expressions, which are commonly observed in opinionated content such as online reviews.  \nIn this work, we introduce GEN-SCL-NAT, which consists of two techniques for improved structured generation for ACOS quadruple extraction. First, we propose GEN-SCL, a supervised contrastive learning objective that aids quadruple prediction by encouraging the model to produce input representations that are discriminable across key input attributes, such as sentiment polarity and the existence of implicit opinions and aspects. Second, we introduce GEN-NAT, a new structured generation format that better adapts pre-trained autoregressive encoder-decoder models to extract quadruples in a generative fashion.  \nExperimental results show that GEN-SCL-NAT achieves top performance across three ACOS datasets, averaging 1.48% F1 improvement, with a maximum 1.73% increase on the LAPTOP-L1 dataset. Additionally, we see significant gains on implicit aspect and opinion splits that have been shown as challenging for existing ACOS approaches.", "track": "Sentiment Analysis, Stylistic Analysis, and Argument Mining", "label": 16, "url": "https://www.semanticscholar.org/reader/34c6b66ef95bb041795c13eb23b8af1c17d13975?experiments=&features=reader_skimming%3Atrue"}, {"loc": [7.778597831726074, 6.722175598144531], "id": 4025, "title": "Semantic Dependency Parsing with Edge GNNs", "authors": "Songlin Yang and Kewei Tu", "abstract": "Second-order neural parsers have obtained high accuracy in semantic dependency parsing.\n Inspired by the factor graph representation of second-order parsing, we propose edge graph neural networks (E-GNNs). In an E-GNN, each node corresponds to a dependency edge, and the neighbors are defined in terms of sibling, co-parent, and grandparent relationships. We conduct experiments on SemEval 2015 Task 18 English datasets, showing the superior performance of E-GNNs.", "track": "Syntax, Parsing and their Applications", "label": 23, "url": ""}, {"loc": [0.8032247424125671, 8.081657409667969], "id": 4031, "title": "Explore Unsupervised Structures in Pretrained Models for Relation Extraction", "authors": "xi yang, Tao Ji and Yuanbin Wu", "abstract": "Syntactic trees have been widely applied in relation extraction (RE). However, since parsing  qualities are not stable on different text domains and a pre-defined grammar may not well fit  the target relation schema, the introduction of syntactic structures sometimes fails to improve RE performances consistently.  In this work, we study RE models  with various unsupervised structures mined  from pre-trained language models (e.g., BERT). We show that, similar to syntactic trees, unsupervised structures are quite informative   for RE task: they are able to obtain competitive (even the best) performance scores on benchmark RE datasets (ACE05, WebNLG, SciERC). We also conduct detailed analyses on   their abilities of adapting new RE domains and influence of noise links in those structures. The results suggest that unsupervised structures are reasonable alternatives of commonly used syntactic structures in relation extraction models.", "track": "Information Extraction", "label": 5, "url": ""}, {"loc": [7.5557942390441895, 3.7133142948150635], "id": 4072, "title": "Identifying Human Strategies for Generating Word-Level Adversarial Examples", "authors": "Maximilian Mozes, Bennett Kleinberg and Lewis Griffin", "abstract": "Adversarial examples in NLP are receiving increasing research attention. One line of investigation is the generation of word-level adversarial examples against fine-tuned Transformer models that preserve naturalness and grammaticality. Previous work found that human- and machine-generated adversarial examples are comparable in their naturalness and grammatical correctness. Most notably, humans were able to generate adversarial examples much more effortlessly than automated attacks. In this paper, we provide a detailed analysis of exactly how humans create these adversarial examples. By exploring the behavioural patterns of human workers during the generation process, we identify statistically significant tendencies based on which words humans prefer to select for adversarial replacement (e.g., word frequencies, word saliencies, sentiment) as well as where and when words are replaced in an input sequence. With our findings, we seek to inspire efforts that harness human strategies for more robust NLP models.", "track": "Interpretability, Interactivity and Analysis of Models for NLP", "label": 9, "url": "https://www.semanticscholar.org/reader/ec09a2233b8f42388875af500dd868ec91f8495e?experiments=&features=reader_skimming%3Atrue"}, {"loc": [7.85883903503418, 9.804229736328125], "id": 4098, "title": "Refinement Matters: Textual Description Needs to be Refined for Zero-shot Learning", "authors": "Chandan Gautam, Sethupathy Parameswaran, Vinay Verma, Suresh Sundaram and Savitha Ramasamy", "abstract": "Zero-Shot Learning (ZSL) has shown great promise at the intersection of vision and language, and generative methods for ZSL are predominant owing to their efficiency.  Moreover, textual description or attribute plays a critical role in transferring knowledge from the seen to unseen classes in ZSL. Such generative approaches for ZSL are very costly to train and require the class description of the unseen classes during training. In this work, we propose a non-generative gating-based attribute refinement network for ZSL, which achieves similar accuracies to generative methods of ZSL, at a much lower computational cost. The refined attributes are mapped into the visual domain through an attribute embedder, and the whole network is guided by the circle loss and the well-known softmax cross-entropy loss to obtain a robust class embedding. We refer to our approach as Circle loss guided gating-based Attribute-Refinement Network (CARNet). We perform extensive experiments on the five benchmark datasets over the various challenging scenarios viz., Generalized ZSL (GZSL), Continual GZSL (CGZSL), and conventional ZSL. We observe that the CARNet significantly outperforms recent non-generative ZSL methods and most generative ZSL methods in all three settings by a significant margin. Our extensive ablation study disentangles the performance of various components and justifies their importance. The source code is available at https://github.com/Sethup123/CARNet.", "track": "Machine Learning for NLP", "label": 3, "url": ""}, {"loc": [7.448903560638428, 9.582947731018066], "id": 4122, "title": "SAT: Improving Semi-Supervised Text Classification with Simple Instance-Adaptive Self-Training", "authors": "Hui Chen, Wei Han and Soujanya Poria", "abstract": "Self-training methods have been explored in recent years and have exhibited great performance in improving semi-supervised learning. This work presents a simple instance-adaptive self-training method (SAT) for semi-supervised text classification. SAT first generates two augmented views for each unlabeled data, and then trains a meta learner to automatically identify the relative strength of augmentations based on the similarity between the original view and the augmented views. The weakly-augmented view is fed to the model to produce a pseudo-label and the strongly-augmented view is used to train the model to predict the same pseudo-label. We conducted extensive experiments and analyses on three text classification datasets and found that with varying sizes of labeled training data, SAT consistently shows competitive performance compared to existing semi-supervised learning methods.", "track": "Ethic Concerns:Unsupervised and Weakly-Supervised Methods in NLP", "label": 17, "url": "https://www.semanticscholar.org/reader/449e78b387f6dec6aae1ae629eb7ae4e28ee79a4?experiments=&features=reader_skimming%3Atrue"}, {"loc": [2.9278390407562256, 4.662806510925293], "id": 4133, "title": "Answer Quality Aware Aggregation for Extractive QA Crowdsourcing", "authors": "Peide Zhu, Zhen Wang, Claudia Hauff, Jie Yang and Avishek Anand", "abstract": "Quality control is essential for creating extractive question answering (EQA) datasets via crowdsourcing. Aggregation across answers, i.e. word spans within passages annotated, by different crowd workers is one major focus for ensuring its quality. However, crowd workers cannot reach a consensus on a considerable portion of questions. We introduce a simple yet effective answer aggregation method that takes into account the relations among the answer, question, and context passage. We evaluate answer quality from both the view of question answering model to determine how confident the QA model is about each answer and the view of the answer verification model to determine whether the answer is correct. Then we compute aggregation scores with each answer's quality and its contextual embedding produced by pre-trained language models. The experiments on a large real crowdsourced EQA  dataset show that our framework outperforms baselines by around 16% on precision and effectively conduct answer aggregation for extractive QA task.", "track": "Question Answering", "label": 11, "url": ""}, {"loc": [0.6747884154319763, 6.558532238006592], "id": 4136, "title": "Search to Pass Messages for Temporal Knowledge Graph Completion", "authors": "Zhen Wang, Haotong Du, Quanming Yao and Xuelong Li", "abstract": "Completing missing facts is a fundamental task for temporal knowledge graphs (TKGs).\nRecently, graph neural network (GNN) based methods, which can simultaneously explore topological and temporal information, have become the state-of-the-art (SOTA) to complete TKGs. However, these studies are based on hand-designed architectures and fail to explore the diverse topological and temporal properties of TKG.\nTo address this issue, we propose to use neural architecture search (NAS) to design data-specific message passing architecture for TKG completion.\nIn particular, \nwe develop a generalized framework to explore topological and temporal information in TKGs.\nBased on this framework, we design an expressive search space to fully capture various properties of different TKGs. \nMeanwhile, we adopt a search algorithm, which trains a supernet structure by sampling single path for efficient search with less cost.\nWe further conduct extensive experiments on three benchmark datasets. The results show that the searched architectures by our method achieve the SOTA performances.\nBesides, \nthe searched models can also implicitly reveal diverse properties in different TKGs.\nOur code is released in https://github.com/striderdu/SPA.", "track": "Machine Learning for NLP", "label": 3, "url": ""}, {"loc": [6.6042609214782715, 1.883830189704895], "id": 4145, "title": "Code Vulnerability Detection via Nearest Neighbor Mechanism", "authors": "Qianjin Du, Xiaohui Kuang and Gang Zhao", "abstract": "Code vulnerability detection is a fundamental and challenging task in the software security field. Existing research works aim to learn semantic information from the source code by utilizing NLP technologies. However, in vulnerability detection tasks, some vulnerable samples are very similar to non-vulnerable samples, which are difficult to identify. To address this issue and improve detection performance, we introduce the $k$-nearest neighbor mechanism which retrieves multiple neighbor samples and utilizes label information of retrieved neighbor samples to provide help for model predictions. Besides, we use supervised contrastive learning to make the model learn the discriminative representation and ensure that label information of retrieved neighbor samples is as consistent as possible with the label information of testing samples. Extensive experiments show that our method can achieve obvious performance improvements compared to baseline models.", "track": "NLP Applications", "label": 0, "url": ""}, {"loc": [3.3504326343536377, 4.088421821594238], "id": 4159, "title": "Robust Question Answering against Distribution Shifts with Test-Time Adaption: An Empirical Study", "authors": "Hai Ye, Yuyang Ding, Juntao Li and Hwee Tou Ng", "abstract": "A deployed question answering (QA) model can easily fail when the test data has a distribution shift compared to the training data. Robustness tuning (RT) methods have been widely studied to enhance model robustness against distribution shifts before model deployment. However, can we improve a model after deployment? To answer this question, we evaluate test-time adaptation (TTA) to improve a model after deployment. We first introduce ColdQA, a unified evaluation benchmark for robust QA against text corruption and changes in language and domain. We then evaluate previous TTA methods on ColdQA and compare them to RT methods. We also propose a novel TTA method called online imitation learning (OIL). Through extensive experiments, we find that TTA is comparable to RT methods, and applying TTA after RT can significantly boost the performance on ColdQA. We observe that TTA can help the model better generalize to more distant distributions. Our proposed OIL improves TTA to be more robust to variation in hyper-parameters and test distributions over time.", "track": "Question Answering", "label": 11, "url": ""}, {"loc": [8.136977195739746, 5.216827392578125], "id": 4173, "title": "ParaMac: A General Unsupervised Paraphrase Generation Framework Leveraging Semantic Constraints and Diversifying Mechanisms", "authors": "Jinxin Liu, Jiaxin Shi, Ji Qi, Lei Hou, Juanzi Li and Qi Tian", "abstract": "Paraphrase generation reflects the ability to understand the meaning from the language surface form and rephrase it to other expressions. Recent paraphrase generation works have paid attention to unsupervised approaches based on Pre-trained Language Models (PLMs) to avoid heavy reliance on parallel data by utilizing PLMs' generation ability. However, the generated pairs of existing unsupervised methods are usually weak either in semantic equivalence or expression diversity. In this paper, we present a novel unsupervised paraphrase generation framework called Paraphrase Machine. By employing multi-aspect equivalence constraints and multi-granularity diversifying mechanisms, Paraphrase Machine is able to achieve good semantic equivalence and expressive diversity, producing a high-quality unsupervised paraphrase dataset. Based on this dataset, we train a general paraphrase model, which can be directly applied to rewrite the input sentence of various domains without any fine-tuning, and achieves substantial gains of 9.1% and 3.3% absolutely in BLEU score over previous SOTA on Quora and MSCOCO. By further fine-tuning our model with domain-specific training sets, the improvement can be increased to even 18.0% and 4.6%. Most importantly, by applying it to language understanding and generation tasks under the low-resource setting, we demonstrate that our model can serve as a universal data augmentor to boost the few-shot performance (e.g., average 2.0% gain on GLUE).", "track": "Natural Language Generation", "label": 6, "url": ""}, {"loc": [4.5458292961120605, 7.7278008460998535], "id": 4190, "title": "Semi-supervised New Slot Discovery with Incremental Clustering", "authors": "Yuxia Wu, Lizi Liao, Xueming Qian and Tat-Seng Chua", "abstract": "Discovering new slots is critical to the success of dialogue systems. Most existing methods rely on automatic slot induction in unsupervised fashion or perform domain adaptation across zero or few-shot scenarios. They have difficulties in providing high-quality supervised signals to learn clustering-friendly features, and are limited in effectively transferring the prior knowledge from known slots to new slots. In this work, we propose a Semi-supervised Incremental Clustering method (SIC), to discover new slots with the aid of existing linguistic annotation models and limited known slot data. Specifically, we harvest slot value candidates with NLP model cues and innovatively formulate the slot discovery task under an incremental clustering framework. The model gradually calibrate slot representations under the supervision of generated pseudo-labels, and automatically learns to terminate when no more salient slot remains. Our thorough evaluation on five public datasets demonstrates that it significantly outperforms state-of-the-art models.", "track": "Dialogue and Interactive Systems", "label": 4, "url": ""}, {"loc": [10.601932525634766, 7.575677394866943], "id": 4201, "title": "Con-NAT: Contrastive Non-autoregressive Neural Machine Translation", "authors": "Hao Cheng and Zhihua Zhang", "abstract": "Inspired by the success of contrastive learning in natural language processing, we incorporate contrastive learning into the conditional masked language model which is extensively used in non-autoregressive neural machine translation (NAT). Accordingly,  we propose a Contrastive Non-autoregressive Neural Machine Translation (Con-NAT) model. Con-NAT optimizes the similarity of several different representations of the same token in the same sentence. We propose two methods to obtain various representations: Contrastive Common Mask and Contrastive Dropout. Positive pairs are various different representations of the same token, while negative pairs are representations of different tokens. In the feature space, the model with contrastive loss pulls positive pairs together and pushes negative pairs away. We conduct extensive experiments on six translation directions with different data sizes. The results demonstrate that Con-NAT showed a consistent and significant improvement in fully and iterative NAT. Con-NAT is state-of-the-art on WMT'16 Ro-En (34.18 BLEU).", "track": "Machine Translation", "label": 10, "url": ""}, {"loc": [7.699717998504639, 7.823615074157715], "id": 4223, "title": "Improved Knowledge Distillation for Pre-trained Language Models via Knowledge Selection", "authors": "Chenglong Wang, Yi Lu, Yongyu Mu, Yimin Hu, Tong Xiao and Jingbo Zhu", "abstract": "Knowledge distillation addresses the problem of transferring knowledge from a teacher model to a student model.\nIn this process, we typically have multiple types of knowledge extracted from the teacher model.\nThe problem is to make full use of them to train the student model.\nOur preliminary study shows that: (1) not all of the knowledge is necessary for learning a good student model, and (2) knowledge distillation can benefit from certain knowledge at different training steps.\nIn response to these, we propose an actor-critic approach to selecting appropriate knowledge to transfer during the process of knowledge distillation.\nIn addition, we offer a refinement of the training algorithm to ease the computational burden.\nExperimental results on the GLUE datasets show that our method outperforms several strong knowledge distillation baselines significantly.", "track": "Machine Learning for NLP", "label": 3, "url": ""}, {"loc": [1.2883535623550415, 7.921083450317383], "id": 4235, "title": "Syntactically Robust Training on Partially-Observed Data for Open Information Extraction", "authors": "Ji Qi, Yuxiang Chen, Lei Hou, Juanzi Li and Bin Xu", "abstract": "Open Information Extraction models have shown promising results with sufficient supervision. However, these models face a fundamental challenge that the syntactic distribution of training data is partially observable in comparison to the real world. In this paper, we propose a syntactically robust training framework that enables models to be trained on a syntactic-abundant distribution based on diverse paraphrase generation. To tackle the intrinsic problem of knowledge deformation of paraphrasing, two algorithms based on semantic similarity matching and syntactic tree walking are used to restore the expressionally transformed knowledge. The training framework can be generally applied to other syntactic partial observable domains. Based on the proposed framework, we build a new evaluation set called CaRB-AutoPara, a syntactically diverse dataset consistent with the real-world setting for validating the robustness of the models. Experiments including a thorough analysis show that the performance of the model degrades with the increase of the difference in syntactic distribution, while our framework gives a robust boundary.", "track": "Information Extraction", "label": 5, "url": ""}, {"loc": [10.80473804473877, 9.30996322631836], "id": 4240, "title": "A Benchmark and Dataset for Post-OCR text correction in Sanskrit", "authors": "Ayush Maheshwari, Nikhil Singh, Amrith Krishna and Ganesh Ramakrishnan", "abstract": "Sanskrit is a classical language with about 30 million extant manuscripts fit for digitisation, available in written, printed or scanned-image forms. However, it is still considered to be a low-resource language when it comes to available digital resources.  In this work, we release a post-OCR text correction dataset containing around 218,000 sentences, with 1.5 million words, from 30 different books. Texts in Sanskrit are known to be diverse in terms of their linguistic and stylistic usage since Sanskrit was the `lingua francua' for discourse in the Indian subcontinent  for about 3 millennia. Keeping this in mind, we release a multi-domain dataset, from areas as diverse as astronomy, medicine and mathematics, with some of them as old as 18 centuries. Further, we release multiple strong baselines as benchmarks for the task, based on pre-trained Seq2Seq language models. We find that our best-performing model, consisting of byte level tokenization in conjunction with phonetic encoding (Byt5+SLP1), yields a 23% point increase over the OCR output in terms of word and character error rates. Moreover, we perform extensive experiments in evaluating these models on their performance and analyse common causes of mispredictions both at the graphemic and lexical levels. Our code and dataset is publicly available at https://github.com/ayushbits/pe-ocr-sanskrit.", "track": "NLP Applications", "label": 0, "url": "https://www.semanticscholar.org/reader/d50b9db750ded246bde13e2c263e341bcbd8a335?experiments=&features=reader_skimming%3Atrue"}, {"loc": [2.020648956298828, 7.5630202293396], "id": 4248, "title": "Knowledge-Enhanced Self-Supervised Prototypical Network for Few-Shot Event Detection", "authors": "Kailin Zhao, Xiaolong Jin, Long Bai, Jiafeng Guo and Xueqi Cheng", "abstract": "Prototypical network based joint methods have attracted much attention in few-shot event detection, which carry out event detection in a unified sequence tagging framework. However, these methods suffer from the inaccurate prototype representation problem, due to two main reasons: the number of instances for calculating prototypes is limited; And, they do not well capture the relationships among event prototypes. To deal with this problem, we propose a Knowledge-Enhanced self-supervised Prototypical Network, called KE-PN, for few-shot event detection. KE-PN adopts hybrid rules, which can automatically align event types to an external knowledge base, i.e., FrameNet, to obtain more instances.\nIt proposes a self-supervised learning method to filter out noisy data from enhanced instances. KE-PN is further equipped with an auxiliary event type relationship classification module, which injects the relationship information into representations of event prototypes. Extensive experiments on three benchmark datasets, i.e., FewEvent, MAVEN, and ACE2005 demonstrate the state-of-the-art performance of KE-PN.", "track": "Information Extraction", "label": 5, "url": ""}, {"loc": [7.9518656730651855, 8.596741676330566], "id": 4263, "title": "VarMAE: Pre-training of Variational Masked Autoencoder for Domain-adaptive Language Understanding", "authors": "Dou Hu, Xiaolong Hou, Xiyang Du, Mengyuan Zhou, Lianxin Jiang, Yang Mo and Xiaofeng Shi", "abstract": "Pre-trained language models have been widely applied to standard benchmarks. Due to the flexibility of natural language, the available resources in a certain domain can be restricted to support obtaining precise representation. To address this issue, we propose a novel Transformer-based language model named VarMAE for domain-adaptive language understanding. Under the masked autoencoding objective, we design a context uncertainty learning module to encode the token's context into a smooth latent distribution. The module can produce diverse and well-formed contextual representations. Experiments on science- and finance-domain NLU tasks demonstrate that VarMAE can be efficiently adapted to new domains with limited resources.", "track": "Language Modeling and Analysis of Language Models", "label": 2, "url": ""}, {"loc": [9.62819766998291, 6.357034683227539], "id": 4270, "title": "Exploring Methods for Building Dialects-Mandarin Code-Mixing Corpora: A Case Study in Taiwanese Hokkien", "authors": "Sin-En Lu, Bo-Han Lu, Chao-Yi Lu and Richard Tzong-Han Tsai", "abstract": "In natural language processing (NLP), code-mixing (CM) is a challenging task, especially when the mixed languages include dialects. In Southeast Asian countries such as Singapore, Indonesia, and Malaysia, Hokkien-Mandarin is the most widespread code-mixed language pair among Chinese immigrants, and it is also common in Taiwan. However, dialects such as Hokkien often have a scarcity of resources and the lack of an official writing system, limiting the development of dialect CM research. In this paper, we propose a method to construct a Hokkien-Mandarin CM dataset to mitigate the limitation, overcome the morphological issue under the Sino-Tibetan language family, and offer an efficient Hokkien word segmentation method through a linguistics-based toolkit. Furthermore, we use our proposed dataset and employ transfer learning to train the XLM (cross-lingual language model) for translation tasks. To fit the code-mixing scenario, we adapt XLM slightly. We found that by using linguistic knowledge, rules, and language tags, the model produces good results on CM data translation while maintaining monolingual translation quality.", "track": "Resources and Evaluation", "label": 1, "url": ""}, {"loc": [6.105129241943359, 8.96927261352539], "id": 4286, "title": "Recurrence Boosts Diversity! Revisiting Recurrent Latent Variable in Transformer-Based Variational AutoEncoder for Diverse Text Generation", "authors": "Jinyi Hu, Xiaoyuan Yi, Wenhao Li, Maosong Sun and Xing Xie", "abstract": "Variational Auto-Encoder (VAE) has been widely adopted in text generation. Among many variants, recurrent VAE learns token-wise latent variables with each conditioned on the preceding ones, which captures sequential variability better in the era of RNN. However, it is unclear how to incorporate such recurrent dynamics into the recently dominant Transformer due to its parallelism. In this work, we propose TRACE, a Transformer-based recurrent VAE structure. TRACE imposes recurrence on segment-wise latent variables with arbitrarily separated text segments and constructs the posterior distribution with residual parameterization. Besides, we design an acceleration method by approximating idempotent matrices, which allows parallelism while maintaining the conditional dependence of latent variables. We demonstrate that TRACE could deduce a non-zero lower bound of the KL term and enhance the entanglement of each segment and preceding latent variables, providing a theoretical guarantee of generation diversity. Experiments on two unconditional and one conditional generation task show that TRACE achieves significantly improved diversity while maintaining satisfactory generation quality.", "track": "Natural Language Generation", "label": 6, "url": "https://www.semanticscholar.org/reader/503ae39c110d298a453259b1b72ee831a9bb0488?experiments=&features=reader_skimming%3Atrue"}, {"loc": [6.499881267547607, 7.514617919921875], "id": 4301, "title": "Tweet Based Reach Aware Temporal Attention Network for NFT Valuation", "authors": "Ramit Sawhney, Megh Thakkar, Ritesh Soun, Atula Neerkaje, Vasu Sharma, Dipanwita Guhathakurta and Sudheer Chava", "abstract": "Non-Fungible Tokens (NFTs) are a relatively unexplored class of assets. Designing strategies to forecast NFT trends is an intricate task due to its extremely volatile nature. The market is largely driven by public sentiment and \"hype\", which in turn has a high correlation with conversations taking place on social media platforms like Twitter. Prior work done for modelling stock market data does not take into account the extent of impact certain highly influential tweets and their authors can have on the market. Building on these limitations and the nature of the NFT market, we propose a novel reach-aware temporal learning approach to make predictions for forecasting future trends in the NFT market. We perform experiments on a new dataset consisting of over 1.3 million tweets and 180 thousand NFT transactions spanning over 15 NFT collections curated by us. Our model (TA-NFT) outperforms other state-of-the-art methods by an average of 36%. Through extensive quantitative and ablative analysis, we demonstrate the ability of our approach as a practical method for predicting NFT trends.", "track": "NLP Applications", "label": 0, "url": ""}, {"loc": [1.6102356910705566, 8.588443756103516], "id": 4305, "title": "Entity Embedding Completion for Wide-Coverage Entity Disambiguation", "authors": "Daisuke Oba, Ikuya Yamada, Naoki Yoshinaga and Masashi Toyoda", "abstract": "Entity disambiguation (ED) is typically solved by learning to classify a given mention into one of the entities in the model's entity vocabulary by referring to their embeddings. However, this approach cannot address mentions of entities that are not covered by the entity vocabulary. Aiming to enhance the applicability of ED models, we propose a method of extending a state-of-the-art ED model by dynamically computing embeddings of out-of-vocabulary entities. Specifically, our method computes embeddings from entity descriptions and mention contexts. Experiments with standard benchmark datasets show that the extended model performs comparable to or better than existing models whose entity embeddings are trained for all candidate entities as well as embedding-free models. We release our source code and model checkpoints at https://github.com/studio-ousia/steel.", "track": "Information Extraction", "label": 5, "url": ""}, {"loc": [5.595871925354004, 12.727925300598145], "id": 4306, "title": "Entity-level Interaction via Heterogeneous Graph for Multimodal Named Entity Recognition", "authors": "Gang Zhao, Guanting Dong, Yidong Shi, Haolong Yan, Weiran Xu and Si Li", "abstract": "Multimodal Named Entity Recognition (MNER) faces two specific challenges: 1) How to capture useful entity-related visual information. 2) How to alleviate the interference of visual noise. Previous works have gained progress by improving interacting mechanisms or seeking for better visual features. However, existing methods neglect the integrity of entity semantics and conduct cross-modal interaction at token-level, which cuts apart the semantics of entities and makes non-entity tokens easily interfered with by irrelevant visual noise.  Thus in this paper, we propose an end-to-end heterogeneous Graph-based Entity-level Interacting model (GEI) for MNER. GEI first utilizes a span detection subtask to obtain entity representations, which serve as the bridge between two modalities. Then, the heterogeneous graph interacting network interacts entity with object nodes to capture entity-related visual information, and fuses it into only entity-associated tokens to rid non-entity tokens of the visual noise. Experiments on two widely used datasets demonstrate the effectiveness of our method. Our code will be available at https://github.com/GangZhao98/GEI.", "track": "Information Extraction", "label": 5, "url": ""}, {"loc": [5.263582229614258, 6.000616073608398], "id": 4339, "title": "Status Biases in Deliberation Online: Evidence from a Randomized Experiment on ChangeMyView", "authors": "Emaad Manzoor, Yohan Jo and Alan M. Montgomery", "abstract": "Status is widely used to incentivize user engagement online. However, visible status indicators could inadvertently bias online deliberation to favor high-status users. In this work, we design and deploy a randomized experiment on the ChangeMyView platform to quantify status biases in deliberation online. We find strong evidence of status bias: hiding status on ChangeMyView increases the persuasion rate of moderate-status users by 84% and decreases the persuasion rate of high-status users by 41% relative to the control group. We also find that the persuasive power of status is moderated by verbosity, suggesting that status is used as an information-processing heuristic under cognitive load. Finally, we find that a user's status influences the argumentation behavior of other users they interact with in a manner that disadvantages low and moderate-status users.", "track": "Computational Social Science and Cultural Analytics", "label": 20, "url": ""}, {"loc": [4.779438495635986, 6.95224142074585], "id": 4354, "title": "Empathetic and Emotionally Positive Conversation Systems with an Emotion-specific Query-Response Memory", "authors": "Zhiliang Tian, Yinliang Wang, YIPING SONG, Chi ZHANG, Dongkyu Lee, Yingxiu Zhao, Dongsheng Li and Nevin L. Zhang", "abstract": "Emotional conversation systems generate responses for the input queries considering the speaker's emotions in a conversation. Existing emotional conversation systems output emotional responses according to either a given emotion or the user's emotion reflected in the input queries. Following a given emotion may lead to an emotional drift between the given emotion and the conversation state, and following only the user's emotion may aggravate the user's negative feelings if users suffer from a negative mood. In this paper, we propose to generate empathetic responses catering to the user's emotions while leading the conversation to be emotionally positive. Particularly, by abstracting the conversation corpus, we extract and store the different responding strategies for different users' emotions and conversational topics into a memory. We encourage positive emotions in conversation via a sentiment evaluator. We model the memory outputs with a Gaussian mixture distribution and sample a final responding strategy from the distribution. The strategy acts as a condition to a transformer model to generate responses. The experiments verify our model surpasses the baseline methods in appropriateness, diversity, and generating emotionally positive responses.", "track": "Dialogue and Interactive Systems", "label": 4, "url": ""}, {"loc": [2.492269277572632, 8.652530670166016], "id": 4355, "title": "Trial2Vec: Zero-Shot Clinical Trial Document Similarity Search using Self-Supervision", "authors": "Zifeng Wang and Jimeng Sun", "abstract": "Clinical trials are essential for drug development but are extremely expensive and time-consuming to conduct.  It is beneficial to study similar historical trials when designing a clinical trial. However, lengthy trial documents and lack of labeled data make trial similarity search difficult. \nWe propose a zero-shot}clinical trial retrieval method, called Trial2Vec, which learns through self-supervision without the need for annotating similar clinical trials. Specifically, the meta-structure of trial documents (e.g., title, eligibility criteria, target disease) along with clinical knowledge (e.g., UMLS knowledge base) are leveraged to automatically generate contrastive samples. Besides, \\method encodes trial documents considering meta-structure thus producing compact embeddings aggregating multi-aspect information from the whole document. We show that our method yields medically interpretable embeddings by visualization and it gets 15\\% average improvement over the best baselines on precision/recall for trial retrieval, which is evaluated on our labeled 1600 trial pairs. In addition, we prove the pretrained embeddings benefit the downstream trial outcome prediction task over 240k trials. Software is available at https://github.com/RyanWangZf/Trial2Vec.", "track": "NLP Applications", "label": 0, "url": "https://www.semanticscholar.org/reader/ee9f79f0f652011f7df2548b8fca62cb5c48ba66?experiments=&features=reader_skimming%3Atrue"}, {"loc": [7.742769718170166, 7.791601657867432], "id": 4358, "title": "From Mimicking to Integrating: Knowledge Integration for Pre-Trained Language Models", "authors": "Lei Li, Yankai Lin, Xuancheng Ren, Guangxiang Zhao, Peng Li, Jie Zhou and Xu Sun", "abstract": "Investigating better ways to reuse the released pre-trained language models (PLMs) can significantly reduce the computational cost and the potential environmental side-effects. This paper explores a novel PLM reuse paradigm, Knowledge Integration (KI). Without human annotations available, KI aims to merge the knowledge from different teacher-PLMs, each of which specializes in a different classification problem, into a versatile student model. To achieve this, we first derive the correlation between virtual golden supervision and teacher predictions. We then design a Model Uncertainty--aware Knowledge Integration (MUKI) framework to recover the golden supervision for the student. Specifically, MUKI adopts Monte-Carlo Dropout to estimate model uncertainty for the supervision integration. An instance-wise re-weighting mechanism based on the margin of uncertainty scores is further incorporated, to deal with the potential conflicting supervision from teachers.\nExperimental results demonstrate that MUKI achieves substantial improvements over baselines on benchmark datasets. Further analysis shows that MUKI can generalize well for merging teacher models with heterogeneous architectures, and even teachers major in cross-lingual datasets.", "track": "Efficient Methods for NLP", "label": 12, "url": "https://www.semanticscholar.org/reader/347cb88984f55de9d51bafeb55f340ae189b795a?experiments=&features=reader_skimming%3Atrue"}, {"loc": [9.213130950927734, 6.6678595542907715], "id": 4365, "title": "Model and Data Transfer for Cross-Lingual Sequence Labelling in Zero-Resource Settings", "authors": "Iker Garc\u00eda-Ferrero, Rodrigo Agerri and German Rigau", "abstract": "Zero-resource cross-lingual transfer approaches aim to apply supervised models\nfrom a source language to unlabelled target languages. In this paper we perform\nan in-depth study of the two main techniques employed so far for cross-lingual\nzero-resource sequence labelling, based either on data or model transfer.\nAlthough previous research has proposed translation and annotation projection\n(data-based cross-lingual transfer) as an effective technique for cross-lingual\nsequence labelling, in this paper we experimentally demonstrate that high\ncapacity multilingual language models applied in a zero-shot (model-based\ncross-lingual transfer) setting consistently outperform data-based\ncross-lingual transfer approaches. A detailed analysis of our results suggests\nthat this might be due to important differences in language use. More\nspecifically, machine translation often generates a textual signal which is\ndifferent to what the models are exposed to when using gold standard data,\nwhich affects both the fine-tuning and evaluation processes. Our results also\nindicate that data-based cross-lingual transfer approaches remain a competitive\noption when high-capacity multilingual language models are not available.", "track": "Multilinguality", "label": 13, "url": "https://www.semanticscholar.org/reader/2cc51dd9da5a145acff6c4a245ecacf3c6ee722c?experiments=&features=reader_skimming%3Atrue"}, {"loc": [9.156103134155273, 6.384519100189209], "id": 4367, "title": "Early Guessing for Dialect Identification", "authors": "Vani Kanjirangat, Tanja Samardzic, Fabio Rinaldi and Ljiljana Dolamic", "abstract": "This paper deals with the problem of incre-\nmental dialect identification. Our goal is to\nreliably determine the dialect before the full\nutterance is given as input. The major part\nof the previous research on dialect identification has been model-centric, focusing on performance. We address a new question: How much input is needed to identify a dialect? Our\napproach is a data-centric analysis that results\nin general criteria for finding the shortest input\nneeded to make a plausible guess. Working\nwith three sets of language dialects (Swiss German, Indo-Aryan and Arabic languages), we\nshow that it is possible to generalize across dialects and datasets with two input shortening\ncriteria: model confidence and minimal input\nlength (adjusted for the input type). The source\ncode for experimental analysis can be found at\nGithub.", "track": "Multilinguality", "label": 13, "url": ""}, {"loc": [7.5415520668029785, 3.7444019317626953], "id": 4368, "title": "R-AT: Regularized Adversarial Training for Natural Language Understanding", "authors": "Shiwen Ni, Jiawen Li and Hung-Yu Kao", "abstract": "Currently, adversarial training has become a popular and powerful regularization method in the natural language domain. In this paper, we Regularized Adversarial Training (R-AT) via dropout, which forces the output probability distributions of different sub-models generated by dropout to be consistent under the same adversarial samples. Specifically, we generate adversarial samples by perturbing the word embeddings. For each adversarial sample fed to the model, R-AT minimizes both the adversarial risk and the bidirectional KL-divergence between the adversarial output distributions of two sub-models sampled by dropout. Through extensive experiments on 13 public natural language understanding datasets, we found that R-AT has improvements for many models (e.g., rnn-based, cnn-based, and transformer-based models). For the GLUE benchmark, when R-AT is only applied to the fine-tuning stage, it is able to improve the overall test score of the BERT-base model from 78.3 to 79.6 and the RoBERTa-large model from 88.1 to 88.6. Theoretical analysis reveals that R-AT has potential gradient regularization during the training process. Furthermore, R-AT can reduce the inconsistency between training and testing of models with dropout.", "track": "Machine Learning for NLP", "label": 3, "url": ""}, {"loc": [7.927786350250244, 9.20006275177002], "id": 4373, "title": "Deep Active Learning with Pretrained Language Models for Filtering Data in Microblogs", "authors": "Payam Karisani, Negin Karisani and Li Xiong", "abstract": "", "track": "Information Retrieval and Text Mining", "label": 15, "url": ""}, {"loc": [8.014862060546875, 8.572415351867676], "id": 4375, "title": "Forging Multiple Training Objectives for Pre-trained Language Models via Meta-Learning", "authors": "Hongqiu Wu, Ruixue Ding, Hai Zhao, Boli Chen, Pengjun Xie, Fei Huang and Min Zhang", "abstract": "Multiple pre-training objectives fill the vacancy of the understanding capability of single-objective language modeling, which serves the ultimate purpose of pre-trained language models (PrLMs), generalizing well on a mass of scenarios. However, learning multiple training objectives in a single model is challenging due to the unknown relative significance as well as the potential contrariety between them. Empirical studies have shown that the current objective sampling in an ad-hoc manual setting makes the learned language representation barely converge to the desired optimum. Thus, we propose \\textit{MOMETAS}, a novel adaptive sampler based on meta-learning, which learns the latent sampling pattern on arbitrary pre-training objectives. Such a design is lightweight with negligible additional training overhead. To validate our approach, we adopt five objectives and conduct continual pre-training with BERT-base and BERT-large models, where MOMETAS demonstrates universal performance gain over other rule-based sampling strategies on 14 natural language processing tasks.", "track": "Language Modeling and Analysis of Language Models", "label": 2, "url": "https://www.semanticscholar.org/reader/3a021e1acc7588897df3f58e3ad928122846122f?experiments=&features=reader_skimming%3Atrue"}, {"loc": [8.033607482910156, 5.738097667694092], "id": 4378, "title": "ConGen: Unsupervised Control and Generalization Distillation For Sentence Representation", "authors": "Peerat Limkonchotiwat, Wuttikorn Ponwitayarat, Lalita Lowphansirikul, Ekapol Chuangsuwanich and Sarana Nutanong", "abstract": "Sentence representations are essential in many NLP tasks operating at the sentence level.\nRecently, research attention has shifted towards learning how to represent sentences without any annotations, i.e., unsupervised representation learning. \nDespite the benefit of training without supervised data, there is still a performance penalty compared to supervised methods.\nFurthermore, the supervised-unsupervised performance gap widens as we reduce the model size. \nIn this paper, we propose an unsupervised sentence representation method to reduce the supervised-unsupervised performance gap, especially for smaller models. \nUtilizing the concept for knowledge distillation, we derive a distillation framework comprising two training objectives, control and generalize, called ConGen. \nExperiments on semantic textual similarity (STS), text classification (transfer), and natural language inference (NLI) tasks show that ConGen is on par with supervised training even on smaller models.\nFurthermore, our method consistently outperformed competitors on multilingual STS.\nThe code and models are available at https://github.com/KornWtp/ConGen.", "track": "Information Retrieval and Text Mining", "label": 15, "url": ""}, {"loc": [8.046293258666992, 3.079493522644043], "id": 4379, "title": "Large-Scale Differentially Private BERT", "authors": "Rohan Anil, Badih Ghazi, Vineet Gupta, Ravi Kumar and Pasin Manurangsi", "abstract": "In this work, we study the large-scale pretraining of BERT-Large (Devlin et al., 2019) with differentially private SGD (DP-SGD). We show that combined with a careful implementation, scaling up the batch size to millions (i.e., mega-batches) improves the utility of the DP-SGD step for BERT; we also enhance the training efficiency by using an increasing batch size schedule. Our implementation builds on the recent work of Subramani et al (2020), who demonstrated that the overhead of a DP-SGD step is minimized with effective use of JAX (Bradbury et al., 2018; Frostig et al., 2018) primitives in conjunction with the XLA compiler (XLA team and collaborators, 2017). Our implementation achieves a masked language model accuracy of 60.5% at a batch size of 2M, for epsilon=5, which is a reasonable privacy setting. To put this number in perspective, non-private BERT models achieve an accuracy of \u223c70%.", "track": "Efficient Methods for NLP", "label": 12, "url": "https://www.semanticscholar.org/reader/2cbf8688cbaddb28eac94fafb01251178f664dc7?experiments=&features=reader_skimming%3Atrue"}, {"loc": [10.095953941345215, 7.3653764724731445], "id": 4381, "title": "Improving Zero-Shot Multilingual Translation with Universal Representations and Cross-Mapping", "authors": "Shuhao Gu and Yang Feng", "abstract": "The many-to-many multilingual neural machine translation can translate between language pairs unseen during training, i.e., zero-shot translation. Improving zero-shot translation requires the model to learn universal representations and cross-mapping relationships to transfer the knowledge learned on the supervised directions to the zero-shot directions. In this work, we propose the state mover's distance based on the optimal theory to model the difference of the representations output by the encoder. Then, we bridge the gap between the semantic-equivalent representations of different languages at the token level by minimizing the proposed distance to learn universal representations. Besides, we propose an agreement-based training scheme, which can help the model make consistent predictions based on the semantic-equivalent sentences to learn universal cross-mapping relationships for all translation directions. The experimental results on diverse multilingual datasets show that our method can improve consistently compared with the baseline system and other contrast methods. The analysis proves that our method can better align the semantic space and improve the prediction consistency.", "track": "Machine Translation", "label": 10, "url": ""}, {"loc": [7.4768500328063965, 3.896463394165039], "id": 4383, "title": "Controllable Fake Document Infilling for Cyber Deception", "authors": "Yibo Hu, Yu Lin, Erick Skorupa Parolin, Latifur Khan and Kevin Hamlen", "abstract": "Recent works in cyber deception study how to deter malicious intrusion by generating multiple fake versions of a critical document to impose costs on adversaries who need to identify the correct information. However, existing approaches are context-agnostic,  resulting in sub-optimal and unvaried outputs. We propose a novel context-aware model, Fake Document Infilling (FDI), by converting the problem to a controllable mask-then-infill procedure. FDI masks important concepts of varied lengths in the document, then infills a realistic but fake alternative considering both the previous and future contexts. We conduct comprehensive evaluations on technical documents and news stories. Results show that FDI outperforms the baselines in generating highly believable fakes with moderate modification to protect critical information and deceive adversaries.", "track": "Natural Language Generation", "label": 6, "url": ""}, {"loc": [8.371031761169434, 6.50191068649292], "id": 4388, "title": "Weakly Supervised Headline Dependency Parsing", "authors": "Adrian Benton, Tianze Shi, Ozan \u0130rsoy and Igor Malioutov", "abstract": "English news headlines form a register with unique syntactic properties that have been documented in linguistics literature since the 1930s.  However, headlines have received surprisingly little attention from the NLP syntactic parsing community. We aim to bridge this gap by providing the first news headline corpus of Universal Dependencies annotated syntactic dependency trees, which enables us to evaluate existing state-of-the-art dependency parsers on news headlines. To improve English news headline parsing accuracies, we develop a projection method to bootstrap silver training data from unlabeled news headline-article lead sentence pairs. Models trained on silver headline parses demonstrate significant improvements in performance over models trained solely on gold-annotated long-form texts. Ultimately, we find that, although projected silver training data improves parser performance across different news outlets, the improvement is moderated by constructions idiosyncratic to outlet.", "track": "Syntax, Parsing and their Applications", "label": 23, "url": ""}, {"loc": [3.868257522583008, 9.301432609558105], "id": 4389, "title": "BOOKSUM: A Collection of Datasets for Long-form Narrative Summarization", "authors": "Wojciech Kryscinski, Nazneen Rajani, Divyansh Agarwal, Caiming Xiong and Dragomir Radev", "abstract": "The majority of existing text summarization datasets include short-form source documents that lack long-range causal and temporal dependencies, and often contain strong layout and stylistic biases. While relevant, such datasets will offer limited challenges for future text summarization systems. We address these issues by introducing BOOKSUM, a collection of datasets for long-form narrative summarization. Our dataset covers documents from the literature domain, such as novels, plays and stories, and includes highly abstractive, human written summaries on three levels of granularity of increasing difficulty: paragraph-, chapter-, and book-level. The domain and structure of our dataset poses a unique set of challenges for summarization systems, which include: processing very long documents, non-trivial causal and temporal dependencies, and rich discourse structures. To facilitate future work, we trained and evaluated multiple extractive and abstractive summarization models as baselines for our dataset.", "track": "Resources and Evaluation", "label": 1, "url": "https://www.semanticscholar.org/reader/307054c95e25e91c8e1cb5cc20ee08a2b55aaa13?experiments=&features=reader_skimming%3Atrue"}, {"loc": [5.56272029876709, 8.466367721557617], "id": 4391, "title": "Not All Errors are Equal: Learning Text Generation Metrics using Stratified Error Synthesis", "authors": "Wenda Xu, Yi-Lin Tuan, Yujie Lu, Michael S. Saxon, Lei Li and William Yang Wang", "abstract": "Is it possible to build a general and automatic natural language generation (NLG) evaluation metric? Existing learned metrics either perform unsatisfactorily or are restricted to tasks where large human rating data is already available. We introduce SESCORE, a model-based metric that is highly correlated with human judgements without requiring human annotation, by utilizing a novel, iterative error synthesis and severity scoring pipeline. This pipeline applies a series of plausible errors to raw text and assigns severity labels by simulating human judgements with entailment. We evaluate SESCORE against existing metrics by comparing how their scores correlate with human ratings. SESCORE outperforms all prior unsupervised metrics on multiple diverse NLG tasks including machine translation, image captioning, and WebNLG text generation. For WMT 20/21\nEn-De and Zh-En, SESCORE improve the average Kendall correlation with human judgement from 0.154 to 0.195. SESCORE even achieves comparable performance to the best supervised metric COMET, despite receiving no human annotated training data.", "track": "Resources and Evaluation", "label": 1, "url": "https://www.semanticscholar.org/reader/8eac7b9318e186cc2708845d669a7a759565c452?experiments=&features=reader_skimming%3Atrue"}, {"loc": [0.8610759973526001, 8.150385856628418], "id": 4395, "title": "Summarization as Indirect Supervision for Relation Extraction", "authors": "Keming Lu, I-Hung Hsu, Wenxuan Zhou, Mingyu Derek Ma and Muhao Chen", "abstract": "Relation extraction (RE) models have been challenged by their reliance on training data with expensive annotations. Considering that summarization tasks aim at acquiring concise expressions of synoptical information from the longer context, these tasks naturally align with the objective of RE, i.e., extracting a kind of synoptical information that describes the relation of entity mentions. We present SuRE, which converts RE into a summarization formulation. SuRE leads to more precise and resource-efficient RE based on indirect supervision from summarization tasks. To achieve this goal, we develop sentence and relation conversion techniques that essentially bridge the formulation of summarization and RE tasks. We also incorporate constraint decoding techniques with Trie scoring to further enhance summarization-based RE with robust inference. Experiments on three RE datasets demonstrate the effectiveness of SuRE in both full-dataset and low-resource settings, showing that summarization is a promising source of indirect supervision signals to improve RE models.", "track": "Information Extraction", "label": 5, "url": "https://www.semanticscholar.org/reader/11fc7b4e459479ec5facb344b42a9bad940da37a?experiments=&features=reader_skimming%3Atrue"}, {"loc": [2.942837953567505, 6.075201034545898], "id": 4400, "title": "DIGAT: Modeling News Recommendation with Dual-Graph Interaction", "authors": "Zhiming Mao, Jian Li, Hongru Wang, Xingshan Zeng and Kam-Fai Wong", "abstract": "News recommendation (NR) is essential for online news services. Existing NR methods typically adopt a news-user representation learning framework, facing two potential limitations. First, in news encoder, single candidate news encoding suffers from an insufficient semantic information problem. Second, existing graph-based NR methods are promising but lack effective news-user feature interaction, rendering the graph-based recommendation suboptimal. To overcome these limitations, we propose dual-interactive graph attention networks (DIGAT) consisting of news- and user-graph channels. In the news-graph channel, we enrich the semantics of single candidate news by incorporating the semantically relevant news information with a semantic-augmented graph (SAG). In the user-graph channel, multi-level user interests are represented with a news-topic graph. Most notably, we design a dual-graph interaction process to perform effective feature interaction between the news and user graphs, which facilitates accurate news-user representation matching. Experiment results on the benchmark dataset MIND show that DIGAT outperforms existing news recommendation methods. Further ablation studies and analyses validate the effectiveness of (1) semantic-augmented news graph modeling and (2) dual-graph interaction.", "track": "NLP Applications", "label": 0, "url": "https://www.semanticscholar.org/reader/922f58be48fa45e0e8d8efb81044cc037bdba1fa?experiments=&features=reader_skimming%3Atrue"}, {"loc": [8.007988929748535, 9.231302261352539], "id": 4406, "title": "SMASH: Improving SMAll Language Models' Few-SHot Ability with Prompt-Based Distillation", "authors": "Yueqian Wang, Chang Liu, Kai Chen, Xi Wang and Dongyan Zhao", "abstract": "Large-scale language models coupled with prompts have shown remarkable performance on few-shot learning. However, through systematic experiments, we find that the few-shot performance of small language models is poor, and using prompts on them brings fewer improvements than on larger ones. In this paper, we propose SMASH, an approach to improve SMAll language models' few-SHot ability by training on intermediate tasks before prompt-based fine-tuning on downstream tasks. We design intermediate tasks for sentence-pair tasks and sentiment classification tasks by creating training examples with prompt templates similar to downstream tasks using sentences sampled from a large-scale unsupervised corpus, and apply knowledge distillation to distill from outputs of larger pre-trained models as the training objective. We conduct extensive experiments and show that SMASH can make a 6-layer DistilRoBRETa-base achieve comparable performance on few-shot datasets with a 12-layer RoBERTa-base at a low cost.", "track": "Semantics: Lexical, Sentence level, Textual Inference and Other areas", "label": 8, "url": ""}, {"loc": [2.999054193496704, 4.688065052032471], "id": 4410, "title": "Consecutive Question Generation via Dynamic Multitask Learning", "authors": "Yunji Li, Sujian Li and Xing Shi", "abstract": "In this paper, we propose the task of consecutive question generation (CQG), which generates a set of logically related question-answer pairs to understand a whole passage, with a comprehensive consideration of the aspects including accuracy, coverage, and informativeness.\nTo achieve this, we first examine the four key elements of CQG, i.e., question, answer, rationale, and context history, and propose a novel dynamic multitask framework with one main task generating a question-answer pair, and four auxiliary tasks generating other elements. It directly helps the model generate good questions through both joint training and self-reranking. At the same time, to fully explore the worth-asking information in a given passage, we make use of the reranking losses to sample the rationales and search for the best question series globally.\nFinally, we measure our strategy by QA data augmentation and manual evaluation, as well as a novel application of generated question-answer pairs on DocNLI. We prove that our strategy can improve question generation significantly and benefit multiple related NLP tasks.", "track": "Natural Language Generation", "label": 6, "url": "https://www.semanticscholar.org/reader/bd61f0258fc77378e366083aea1d988bf33bd118?experiments=&features=reader_skimming%3Atrue"}, {"loc": [8.697159767150879, 6.511637210845947], "id": 4411, "title": "Subword Segmental Language Modelling for Nguni Languages", "authors": "Francois Meyer and Jan Buys", "abstract": "Subwords have become the standard units of text in NLP, enabling efficient open-vocabulary models. With algorithms like byte-pair encoding (BPE), subword segmentation is viewed as a preprocessing step applied to the corpus before training. This can lead to sub-optimal segmentations for low-resource languages with complex morphologies. We propose a subword segmental language model (SSLM) that learns how to segment words while being trained for autoregressive language modelling. By unifying subword segmentation and language modelling, our model learns subwords that optimise LM performance. We train our model on the 4 Nguni languages of South Africa. These are low-resource agglutinative languages, so subword information is critical. As an LM, SSLM outperforms existing approaches such as BPE-based models on average across the 4 languages. Furthermore, it outperforms standard subword segmenters on unsupervised morphological segmentation. We also train our model as a word-level sequence model, resulting in an unsupervised morphological segmenter that outperforms existing methods by a large margin for all 4 languages. Our results show that learning subword segmentation is an effective alternative to existing subword segmenters, enabling the model to discover morpheme-like subwords that improve its LM capabilities.", "track": "Phonology, Morphology and Word Segmentation", "label": 25, "url": "https://www.semanticscholar.org/reader/379722c04fb3b54215f82512eb86398cb02d42dd?experiments=&features=reader_skimming%3Atrue"}, {"loc": [5.415914535522461, 12.141900062561035], "id": 4417, "title": "Towards Robust Visual Question Answering: Making the Most of Biased Samples via Contrastive Learning", "authors": "Qingyi Si, Yuanxin LIU, Fandong Meng, Zheng Lin, Peng Fu, Yanan Cao, Weiping Wang and Jie Zhou", "abstract": "Models for Visual Question Answering (VQA) often rely on the spurious correlations, i.e., the language priors, that appear in the biased samples of training set, which make them brittle against the out-of-distribution (OOD) test data. Recent methods have achieved promising progress in overcoming this problem by reducing the impact of biased samples on model training. However, these models reveal a trade-off that the improvements on OOD data severely sacrifice the performance on the in-distribution (ID) data (which is dominated by the biased samples). Therefore, we propose a novel contrastive learning approach, MMBS, for building robust VQA models by Making the Most of Biased Samples. Specifically, we construct positive samples for contrastive learning by eliminating the information related to spurious correlation from the original training samples and explore several strategies to use the constructed positive samples for training. Instead of undermining the importance of biased samples in model training, our approach precisely exploits the biased samples for unbiased information that contributes to reasoning. The proposed method is compatible with various VQA backbones.  We validate our contributions by achieving competitive performance on the OOD dataset VQA-CP v2 while preserving robust performance on the ID dataset VQA v2.", "track": "Question Answering", "label": 11, "url": "https://www.semanticscholar.org/reader/42d020473915136cb4fff4f5c133e2970951c00c?experiments=&features=reader_skimming%3Atrue"}, {"loc": [5.2876434326171875, 8.902695655822754], "id": 4426, "title": "P3LM: Probabilistically Permuted Prophet Language Modeling for Generative Pre-Training", "authors": "Junwei Bao, Yifan Wang, ying jiangyong, Yeyun Gong, Jing Zhao, Youzheng Wu and Xiaodong He", "abstract": "Conventional autoregressive left-to-right (L2R) sequence generation faces two issues during decoding: limited to unidirectional target sequence modeling, and constrained on strong local dependencies.\nTo address the aforementioned problem, we propose P3LM, a probabilistically permuted prophet language model, which strengthens the modeling of bidirectional information and long token dependencies for sequence generation.\nSpecifically, P3LM learns to generate tokens in permuted order upon an order-aware transformer decoder, as well as to generate the corresponding future N tokens with a multi-stream attention mechanism.\nExtensive experiments are conducted on the GLGE benchmark, which includes four datasets for summarization, two for question generation, one for conversational question answering, and one for dialog response generation, where P3LM achieves state-of-the-art results compared with strong publicly available generative pre-training methods.", "track": "Natural Language Generation", "label": 6, "url": "https://www.semanticscholar.org/reader/2ae0c69cac7bb2ba386faf6e9702db54b2ca594d?experiments=&features=reader_skimming%3Atrue"}, {"loc": [5.482527256011963, 7.5004425048828125], "id": 4429, "title": "Holistic Sentence Embeddings for Better Out-of-Distribution Detection", "authors": "Sishuo Chen, Xiaohan Bi, Rundong Gao and Xu Sun", "abstract": "Detecting out-of-distribution (OOD) instances is significant for the safe deployment of NLP models. Among recent textual OOD detection works based on pretrained language models (PLMs), distance-based methods have shown superior performance. However, they estimate sample distance scores in the last-layer CLS embedding space and thus do not make full use of linguistic information underlying in PLMs. To address the issue, we propose to boost OOD detection by deriving more holistic sentence embeddings. On the basis of the observations that token averaging and layer combination contribute to improving OOD detection, we propose a simple embedding approach named Avg-Avg, which averages all token representations from each intermediate layer as the sentence embedding and significantly surpasses the state-of-the-art on a comprehensive suite of benchmarks by a 9.33% FAR95 margin. Furthermore, our analysis demonstrates that it indeed helps preserve general linguistic knowledge in fine-tuned PLMs and substantially benefits detecting background shifts. The simple yet effective embedding method can be applied to fine-tuned PLMs with negligible extra costs, providing a free gain in OOD detection. Our code is available at https://github.com/lancopku/Avg-Avg.", "track": "Machine Learning for NLP", "label": 3, "url": "https://www.semanticscholar.org/reader/020b0c80270af27cd28899f2711eeed7a88b95cd?experiments=&features=reader_skimming%3Atrue"}, {"loc": [1.770755410194397, 5.299342155456543], "id": 4432, "title": "MuGER2: Multi-Granularity Evidence Retrieval and Reasoning for Hybrid Question Answering", "authors": "Yingyao Wang, Junwei Bao, Chaoqun Duan, Youzheng Wu, Xiaodong He and Tiejun Zhao", "abstract": "Hybrid question answering (HQA) aims to answer questions over heterogeneous data, including tables and passages linked to table cells. The heterogeneous data can provide different granularity evidence to HQA models, e.t., column, row, cell, and link. Conventional HQA models usually retrieve coarse- or fine-grained evidence to reason the answer. Through comparison, we find that coarse-grained evidence is easier to retrieve but contributes less to the reasoner, while fine-grained evidence is the opposite. To preserve the advantage and eliminate the disadvantage of different granularity evidence, we propose MuGER2, a Multi-Granularity Evidence Retrieval and Reasoning approach. In evidence retrieval, a unified retriever is designed to learn the multi-granularity evidence from the heterogeneous data. In answer reasoning, an evidence selector is proposed to navigate the fine-grained evidence for the answer reader based on the learned multi-granularity evidence. Experiment results on the HybridQA dataset show that MuGER2 significantly boosts the HQA performance. Further ablation analysis verifies the effectiveness of both the retrieval and reasoning designs.", "track": "Question Answering", "label": 11, "url": "https://www.semanticscholar.org/reader/c63296d9907dd522271cb60cf525a7d66aa1c25e?experiments=&features=reader_skimming%3Atrue"}, {"loc": [9.560885429382324, 6.354761123657227], "id": 4433, "title": "EntityCS: Improving Zero-Shot Cross-lingual Transfer with Entity-Centric Code Switching", "authors": "Chenxi Whitehouse, Fenia Christopoulou and Ignacio Iacobacci", "abstract": "Accurate alignment between languages is fundamental for improving cross-lingual pre-trained language models (XLMs). Motivated by the natural phenomenon of code-switching (CS) in multilingual speakers, CS has been used as an effective data augmentation method that offers language alignment at word- or phrase-level, in contrast to sentence-level via parallel instances. Existing approaches either use dictionaries or parallel sentences with word-alignment to generate CS data by randomly switching words in a sentence. However, such methods can be suboptimal as dictionaries disregard semantics, and syntax might become invalid after random word switching. In this work, we propose EntityCS, a method that focuses on Entity-level Code-Switching to capture fine-grained cross-lingual semantics without corrupting syntax. We use Wikidata and the English Wikipedia to construct an entity-centric CS corpus by switching entities to their counterparts in other languages. We further propose entity-oriented masking strategies during intermediate model training on the EntityCS corpus for improving entity prediction. Evaluation of the trained models on four entity-centric downstream tasks shows consistent improvements over the baseline with a notable increase of 10% in Fact Retrieval. We release the corpus and models to assist research on code-switching and enriching XLMs with external knowledge.", "track": "Multilinguality", "label": 13, "url": "https://www.semanticscholar.org/reader/cfc907cb4da8734f713ed42f1d7ecdbd90e31832?experiments=&features=reader_skimming%3Atrue"}, {"loc": [4.737878799438477, 8.774112701416016], "id": 4444, "title": "MBTI Personality Prediction for Fictional Characters Using Movie Scripts", "authors": "Yisi Sang, Xiangyang Mou, Mo Yu, Dakuo Wang, Jing Li and Jeffrey Stanton", "abstract": "An NLP model that understands stories should be able to understand the characters in them. To support the development of neural models for this purpose, we construct a benchmark, Story2Personality. The task is to predict a movie character's MBTI or Big 5 personality types based on the narratives of the character. Experiments show that our task is challenging for the existing text classification models, as none is able to largely outperform random guesses. We further proposed a multi-view model for personality prediction using both verbal and non-verbal descriptions, which gives improvement compared to using only verbal descriptions. The uniqueness and challenges in our dataset call for the development of narrative comprehension techniques from the perspective of understanding characters.", "track": "Resources and Evaluation", "label": 1, "url": "https://www.semanticscholar.org/reader/c1fdff2943289250a2eac036ef81402f408d8b47?experiments=&features=reader_skimming%3Atrue"}, {"loc": [3.7458555698394775, 5.892829895019531], "id": 4451, "title": "A Simple and Strong Baseline for End-to-End Neural RST-style Discourse Parsing", "authors": "Naoki Kobayashi, Tsutomu Hirao, Hidetaka Kamigaito, Manabu Okumura and Masaaki Nagata", "abstract": "To promote and further develop RST-style discourse parsing models, we need a strong baseline that can be regarded as a reference for reporting reliable experimental results. \nThis paper explores a strong baseline by integrating existing simple parsing strategies, top-down and bottom-up, with various transformer-based pre-trained language models.\nThe experimental results obtained from two benchmark datasets demonstrate that the parsing performance strongly relies on the pre-trained language models rather than the parsing strategies.\nIn particular, the bottom-up parser achieves large performance gains compared to the current best parser when employing DeBERTa.\nWe further reveal that language models with a span-masking scheme especially boost the parsing performance through our analysis within intra- and multi-sentential parsing, and nuclearity prediction.", "track": "Discourse and Pragmatics", "label": 24, "url": ""}, {"loc": [6.982294082641602, 6.36100959777832], "id": 4462, "title": "Probing for Constituency Structure in Neural Language Models", "authors": "David Arps, Younes Samih, Laura Kallmeyer and Hassan Sajjad", "abstract": "In this paper, we investigate to which extent contextual neural language models (LMs) implicitly learn syntactic structure. More concretely, we focus on constituent structure as represented in the Penn Treebank (PTB). Using standard probing techniques based on diagnostic classifiers, we assess the accuracy of representing constituents of different categories within the neuron activations of a LM such as RoBERTa. In order to make sure that our probe focuses on syntactic knowledge and not on implicit semantic generalizations, we also experiment on a PTB version that is obtained by randomly replacing constituents with each other while keeping syntactic structure, i.e., a semantically ill-formed but syntactically well-formed version of the PTB. We find that 4 pretrained transfomer LMs obtain high performance on our probing tasks even on manipulated data, suggesting that semantic and syntactic knowledge in their representations can be separated and that constituency information is in fact learned by the LM. Moreover, we show that a complete constituency tree can be linearly separated from LM representations.", "track": "Language Modeling and Analysis of Language Models", "label": 2, "url": "https://www.semanticscholar.org/reader/b7e66de289baad3f013b77a96de58e419721873e?experiments=&features=reader_skimming%3Atrue"}, {"loc": [4.2999982833862305, 4.9409074783325195], "id": 4467, "title": "Table-To-Text generation and pre-training with TabT5", "authors": "Ewa Andrejczuk, Julian Martin Eisenschlos, Francesco Piccinno, Syrine Krichene and Yasemin Altun", "abstract": "Encoder-only transformer models have been successfully applied to different table understanding tasks,  as in TAPAS. A major limitation of these architectures is that they are constrained to classification-like tasks such as cell selection or entailment detection. We present TabT5, an encoder-decoder model that generates natural language text based on tables and textual inputs. TabT5 overcomes the encoder-only limitation by incorporating a decoder component and leverages the input structure with table specific embeddings and pre-training. TabT5 achieves new state-of-the-art results on several domains,  including spreadsheet formula prediction with a 15% increase in sequence accuracy, QA with a 2.5% increase in sequence accuracy and data-to-text generation with a 2.5% increase in BLEU.", "track": "Unsupervised and Weakly-Supervised Methods in NLP", "label": 17, "url": "https://www.semanticscholar.org/reader/38f172208bff91429710bba77f658093b62628cc?experiments=&features=reader_skimming%3Atrue"}, {"loc": [5.584383010864258, 9.727012634277344], "id": 4470, "title": "A POMDP Dialogue Policy with 3-way Grounding and Adaptive Sensing for Learning through Communication", "authors": "Maryam Zare, Alan R. Wagner and Rebecca Jane Passonneau", "abstract": "Agents to assist with rescue, surgery, and similar activities could collaborate better with humans if they could learn new strategic behaviors through communication. We introduce a novel POMDP dialogue policy for learning from people. The policy has 3-way grounding of language in the shared physical context, the dialogue context, and persistent knowledge. It can learn distinct but related games, and can continue learning across dialogues for complex games. A novel sensing component supports adaptation to information-sharing differences across people. The single policy performs better than oracle policies customized to specific games and information behavior.", "track": "Dialogue and Interactive Systems", "label": 4, "url": ""}, {"loc": [4.900187969207764, 3.453322172164917], "id": 4471, "title": "PaCo: Preconditions Attributed to Commonsense Knowledge", "authors": "Ehsan Qasemi, Filip Ilievski, Muhao Chen and Pedro Szekely", "abstract": "Humans can seamlessly reason with circumstantial preconditions of commonsense knowledge. We understand that a glass is used for drinking water, unless the glass is broken or the water is toxic. Despite state-of-the-art (SOTA) language models' (LMs) impressive performance on inferring commonsense knowledge, it is unclear whether they understand the circumstantial preconditions. To address this gap, we propose a novel challenge of reasoning with circumstantial preconditions. We collect a dataset, called PaCo, consisting of 12.4 thousand preconditions of commonsense statements expressed in natural language. Based on this dataset, we create three canonical evaluation tasks and use them to examine the capability of existing LMs to understand situational preconditions. Our results reveal a 10-30% gap between machine and human performance on our tasks, which shows that reasoning with preconditions is an open challenge.", "track": "Resources and Evaluation", "label": 1, "url": "https://www.semanticscholar.org/reader/3ae743e91f86b5170c2d252fa810c14fd9b70115?experiments=&features=reader_skimming%3Atrue"}, {"loc": [1.9442188739776611, 8.694657325744629], "id": 4477, "title": "Improving Few-Shot Domain Transfer for Named Entity Disambiguation with Pattern Exploitation", "authors": "Philip Blair and Kfir Bar", "abstract": "Named entity disambiguation (NED) is a critical subtask of entity linking, which seeks to connect knowledge base entities with textual mentions of those entities. Naturally, the performance of a model depends on the domain it was trained on; thus, reducing the amount of data required to train models is advantageous. In this work, we leverage recent research on pattern exploitation for NED and explore whether it can reduce the amount of data required for domain adaptation by reformulating the disambiguation task as a masked language modeling problem. Using ADAPET (Tam et al., 2021), which implements a new approach for few-shot learning using fine-tuned transformer-based language models, we produce an NED model which yields, without any sacrifice of in-domain accuracy, a 7% improvement in zero-shot cross-domain performance as evaluated on NEDMed, a new NED dataset of mental health news which we release with this work.", "track": "Information Retrieval and Text Mining", "label": 15, "url": ""}, {"loc": [4.964476585388184, 5.926020622253418], "id": 4479, "title": "Capturing Topic Framing via Masked Language Modeling", "authors": "Xiaobo Guo, Weicheng Ma and Soroush Vosoughi", "abstract": "Differential framing of issues can lead to divergent world views on important issues. This is especially true in domains where the information presented can reach a large audience, such as traditional and social media. Scalable and reliable measurement of such differential framing is an important first step in addressing them. In this work, based on the intuition that framing affects the tone and word choices in written language, we propose a framework for modeling the differential framing of issues through masked token prediction via large-scale fine-tuned language models (LMs). Specifically, we explore three key factors for our framework: 1) prompt generation methods for the masked token prediction; 2) methods for normalizing the output of fine-tuned LMs; 3) robustness to the choice of pre-trained LMs used for fine-tuning. Through experiments on a dataset of articles from traditional media outlets covering five diverse and politically polarized topics, we show that our framework can capture differential framing of these topics with high reliability.", "track": "NLP Applications", "label": 0, "url": ""}, {"loc": [4.667919158935547, 5.000764846801758], "id": 4480, "title": "WANLI: Worker and AI Collaboration for Natural Language Inference Dataset Creation", "authors": "Alisa Liu, Swabha Swayamdipta, Noah A. Smith and Yejin Choi", "abstract": "A recurring challenge of crowdsourcing NLP datasets at scale is that human writers often rely on repetitive patterns when crafting examples, leading to a lack of linguistic diversity. We introduce a novel approach for dataset creation based on worker and AI collaboration, which brings together the generative strength of language models and the evaluative strength of humans. Starting with an existing dataset, MultiNLI for natural language inference (NLI), our approach uses dataset cartography to automatically identify examples that demonstrate challenging reasoning patterns, and instructs GPT-3 to compose new examples with similar patterns. Machine generated examples are then automatically filtered, and finally revised and labeled by human crowdworkers. The resulting dataset, WANLI, consists of 107,885 NLI examples and presents unique empirical strengths over existing NLI datasets. Remarkably, training a model on WANLI improves performance on eight out-of-domain test sets we consider, including by 11% on HANS and 9% on Adversarial NLI, compared to training on the 4x larger MultiNLI. Moreover, it continues to be more effective than MultiNLI augmented with other NLI datasets. Our results demonstrate the promise of leveraging natural language generation techniques and re-imagining the role of humans in the dataset creation process.", "track": "Semantics: Lexical, Sentence level, Textual Inference and Other areas", "label": 8, "url": "https://www.semanticscholar.org/reader/56b30c6bd9dc4a2416ab3b74ad97dbb7a2904229?experiments=&features=reader_skimming%3Atrue"}, {"loc": [5.528929233551025, 8.837152481079102], "id": 4483, "title": "Sequentially Controlled Text Generation", "authors": "Alexander Spangher, Yao Ming, Xinyu Hua and Nanyun Peng", "abstract": "While GPT-2 generates sentences that are remarkably human-like, longer documents can ramble and do not follow human-like writing structure. We study the problem of imposing structure on long-range text. We propose a novel controlled text generation task, sequentially controlled text generation, and identify a dataset, NewsDiscourse as a starting point for this task. We develop a sequential controlled text generation pipeline with generation and editing. We test different degrees of structural awareness and show that, in general, more structural awareness results in higher control- accuracy, grammaticality, coherency and topicality, approaching human-level writing performance.", "track": "Natural Language Generation", "label": 6, "url": ""}, {"loc": [5.625174522399902, 9.655472755432129], "id": 4486, "title": "Revisiting the Roles of \"Text\u201d in Text Games", "authors": "Yi Gu, Shunyu Yao, Chuang Gan, Josh Tenenbaum and Mo Yu", "abstract": "Text games present opportunities for natural language understanding (NLU) methods to tackle reinforcement learning (RL) challenges. However, recent work has questioned the necessity of NLU by showing random text hashes could perform decently. In this paper, we pursue a fine-grained investigation into the roles of text in the face of different RL challenges, and reconcile that semantic and non-semantic language representations could be complementary rather than contrasting. Concretely, we propose a simple scheme to extract relevant contextual information into an approximate state hash as extra input for an RNN-based text agent. Such a lightweight plug-in achieves competitive performance with state-of-the-art text agents using advanced NLU techniques such as knowledge graph and passage retrieval, suggesting non-NLU methods might suffice to tackle the challenge of partial observability. However, if we remove RNN encoders and use approximate or even ground-truth state hash alone, the model performs miserably, which confirms the importance of semantic function approximation to tackle the challenge of combinatorially large observation and action spaces. Our findings and analysis provide new insights for designing better text game task setups and agents.", "track": "Resources and Evaluation", "label": 1, "url": "https://www.semanticscholar.org/reader/eb35adb231ce84db3cc1dd6c1a00ae5d9a566fcf?experiments=&features=reader_skimming%3Atrue"}, {"loc": [8.563857078552246, 8.47903060913086], "id": 4487, "title": "FPT: Improving Prompt Tuning Efficiency via Progressive Training", "authors": "Yufei Huang, Yujia Qin, Huadong Wang, Yichun Yin, Maosong Sun, Zhiyuan Liu and Qun Liu", "abstract": "Recently, prompt tuning (PT) has gained increasing attention as a parameter-efficient way of tuning pre-trained language models (PLMs). Despite extensively reducing the number of tunable parameters and achieving satisfying performance, PT is training-inefficient due to its slow convergence. To improve PT's training efficiency, we first make some novel observations about the prompt transferability of \"partial PLMs\u201d, which are defined by compressing a PLM in depth or width. We observe that the soft prompts learned by different partial PLMs of various sizes are similar in the parameter space, implying that these soft prompts could potentially be transferred among partial PLMs. Inspired by these observations, we propose Fast Prompt Tuning (FPT), which starts by conducting PT using a small-scale partial PLM, and then progressively expands its depth and width until the full-model size. After each expansion, we recycle the previously learned soft prompts as initialization for the enlarged partial PLM and then proceed PT. We demonstrate the feasibility of FPT on 5 tasks and show that FPT could save over 30% training computations while achieving comparable performance. The codes are publicly available at https://github.com/thunlp/FastPromptTuning.", "track": "Efficient Methods for NLP", "label": 12, "url": "https://www.semanticscholar.org/reader/3f88eb2abbf54f043c50de9b33530ddbe9f02b87?experiments=&features=reader_skimming%3Atrue"}, {"loc": [1.6058895587921143, 8.621681213378906], "id": 4490, "title": "Prompt-learning for Fine-grained Entity Typing", "authors": "Ning Ding, Yulin Chen, Xu Han, Guangwei Xu, Xiaobin Wang, Pengjun Xie, Haitao Zheng, Zhiyuan Liu, Juanzi Li and Hong-Gee Kim", "abstract": "As an effective approach to adapting pre-trained language models (PLMs) for specific tasks, prompt-learning has recently attracted much attention from researchers. By using cloze-style language prompts to stimulate the versatile knowledge of PLMs, prompt-learning can achieve promising results on a series of NLP tasks, such as natural language inference, sentiment classification, and knowledge probing. In this work, we investigate the application of prompt-learning on fine-grained entity typing in fully supervised, few-shot, and zero-shot scenarios. \nWe first develop a simple and effective prompt-learning pipeline by constructing entity-oriented verbalizers and templates and conducting masked language modeling. Further, to tackle the zero-shot regime, we propose a self-supervised strategy that carries out distribution-level optimization in prompt-learning to automatically summarize the information of entity types. Extensive experiments on four fine-grained entity typing benchmarks under fully supervised, few-shot, and zero-shot settings show the effectiveness of the prompt-learning paradigm and further make a powerful alternative to vanilla fine-tuning.", "track": "Information Extraction", "label": 5, "url": "https://www.semanticscholar.org/reader/bf722dc893ddaad5045fca5646212ec3badf3c5a?experiments=&features=reader_skimming%3Atrue"}, {"loc": [8.6024808883667, 6.765219688415527], "id": 4492, "title": "TransLIST: A Transformer-Based Linguistically Informed Sanskrit Tokenizer", "authors": "Jivnesh Sandhan, Rathin Singha, Narein Rao, SUVENDU SAMANTA, Laxmidhar Behera and Pawan Goyal", "abstract": "Sanskrit Word Segmentation (SWS) is essential in making digitized texts available and in deploying downstream tasks. It is, however, non-trivial because of the sandhi phenomenon that modifies the characters at the word boundaries, and needs special treatment. Existing lexicon driven approaches for SWS make use of Sanskrit Heritage Reader, a lexicon-driven shallow parser, to generate the complete candidate solution space, over which  various methods are applied to produce the most valid solution. However, these approaches fail while encountering out-of-vocabulary tokens. On the other hand, purely engineering methods for SWS have made use of recent advances in deep learning, but cannot make use of the latent word information on availability. \n\nTo mitigate the shortcomings of both families of approaches, we propose Transformer based Linguistically Informed Sanskrit Tokenizer (TransLIST) consisting of (1) a module that encodes the character input along with latent-word information, which takes into account the sandhi phenomenon specific to SWS and is apt to work with partial or no candidate solutions, (2) a novel soft-masked attention to prioritize potential candidate words and (3) a novel path ranking algorithm to rectify the corrupted predictions.  Experiments on the benchmark datasets for SWS show that TransLIST outperforms the current state-of-the-art system by an average 7.2 points absolute gain in terms of perfect match (PM) metric.", "track": "Phonology, Morphology and Word Segmentation", "label": 25, "url": "https://www.semanticscholar.org/reader/abc2280a8ea693643960cebbd687edd0ea57a928?experiments=&features=reader_skimming%3Atrue"}, {"loc": [8.12582015991211, 3.0134832859039307], "id": 4498, "title": "Fair NLP Models with Differentially Private Text Encoders", "authors": "Gaurav Maheshwari, Pascal Denis, Mikaela Keller and Aur\u00e9lien Bellet", "abstract": "Encoded text representations often capture sensitive attributes about individuals (e.g., race or gender), which raise privacy concerns and can make downstream models unfair to certain groups. In this work, we propose FEDERATE, an approach that combines ideas from differential privacy and adversarial training to learn private text representations which also induces fairer models. We empirically evaluate the trade-off between the privacy of the representations and the fairness and accuracy of the downstream model on four NLP datasets. Our results show that FEDERATE consistently improves upon previous methods, and thus suggest that privacy and fairness can positively reinforce each other.", "track": "Ethics", "label": 21, "url": "https://www.semanticscholar.org/reader/9b78140aa26f738a7a225d505ad34023ff3b6d61?experiments=&features=reader_skimming%3Atrue"}, {"loc": [10.621461868286133, 7.153485298156738], "id": 4500, "title": "Modeling Context With Linear Attention for Scalable Document-Level Translation", "authors": "Zhaofeng Wu, Hao Peng, Nikolaos Pappas and Noah A. Smith", "abstract": "Document-level machine translation leverages inter-sentence dependencies to produce more coherent and consistent translations. However, these models, predominantly based on transformers, are difficult to scale to long documents as their attention layers have quadratic complexity in the sequence length. Recent efforts on efficient attention improve scalability, but their effect on document translation remains unexplored. In this work, we investigate the efficacy of a recent linear attention model by Peng et al. (2021) on document translation and augment it with a sentential gate to promote a recency inductive bias. We evaluate the model on IWSLT 2015 and OpenSubtitles 2018 against the transformer, demonstrating substantially increased decoding speed on long sequences with similar or better BLEU scores. We show that sentential gating further improves translation quality on IWSLT.", "track": "Efficient Methods for NLP", "label": 12, "url": "https://www.semanticscholar.org/reader/296c4ff39184fb7787954bc4e1a5bde89e16c16e?experiments=&features=reader_skimming%3Atrue"}, {"loc": [8.130899429321289, 7.1678385734558105], "id": 4503, "title": "What do Large Language Models Learn beyond Language?", "authors": "Avinash Madasu and Shashank Srivastava", "abstract": "Large language models (LMs) have rapidly become a mainstay in Natural Language Processing. These models are known to acquire rich linguistic knowledge from training on large amounts of text. In this paper, we investigate if pre-training on text also confers these models with helpful `inductive biases' for non-linguistic reasoning. On a set of 19 diverse non-linguistic tasks involving quantitative computations, recognizing regular expressions and reasoning over strings. We find that pretrained models significantly outperform comparable non-pretrained neural models. This remains true also in experiments with training non-pretrained models with fewer parameters to account for model regularization effects. We further explore the effect of text domain on LMs by pretraining models from text from different domains and provenances. Our experiments surprisingly reveal that the positive effects of pre-training persist even when pretraining on multi-lingual text or computer code, and even for text generated from synthetic languages. Our findings suggest a hithertho unexplored deep connection between pre-training and inductive learning abilities of language models", "track": "Language Modeling and Analysis of Language Models", "label": 2, "url": "https://www.semanticscholar.org/reader/5efab88c0cdb11c795fa8f44a5d31b40e2a1c261?experiments=&features=reader_skimming%3Atrue"}, {"loc": [3.2368741035461426, 4.806027889251709], "id": 4507, "title": "CONSISTENT: Open-Ended Question Generation From News Articles", "authors": "Tuhin Chakrabarty, Justin Lewis and Smaranda Muresan", "abstract": "Recent work on question generation has largely focused on factoid questions such as who, what,\nwhere, when about basic facts. Generating open-ended why, how, what, etc. questions that\nrequire long-form answers have proven more difficult. To facilitate the generation of openended questions, we propose CONSISTENT, a new end-to-end system for generating openended questions that are answerable from and faithful to the input text. Using news articles as\na trustworthy foundation for experimentation, we demonstrate our model's strength over several baselines using both automatic and human based evaluations. We contribute an evaluation\ndataset of expert-generated open-ended questions. We discuss potential downstream applications for news media organizations.", "track": "NLP Applications", "label": 0, "url": "https://www.semanticscholar.org/reader/91eb2e73f8f3574c00dc6787a3e277eedaf33531?experiments=&features=reader_skimming%3Atrue"}, {"loc": [5.895401954650879, 8.80286693572998], "id": 4511, "title": "Efficient (Soft) Q-Learning for Text Generation with Limited Good Data", "authors": "Han Guo, Bowen Tan, Zhengzhong Liu, Eric Xing and Zhiting Hu", "abstract": "Maximum likelihood estimation (MLE) is the predominant algorithm for training text generation models. This paradigm relies on direct supervision examples, which is not applicable to many emerging applications, such as generating adversarial attacks or generating prompts to control language models. Reinforcement learning (RL) on the other hand offers a more flexible solution by allowing users to plug in arbitrary task metrics as reward. Yet previous RL algorithms for text generation, such as policy gradient (on-policy RL) and Q-learning (off-policy RL), are often notoriously inefficient or unstable to train due to the large sequence space and the sparse reward received only at the end of sequences. In this paper, we introduce a new RL formulation for text generation from the soft Q-learning (SQL) perspective. It enables us to draw from the latest RL advances, such as path consistency learning, to combine the best of on-/off-policy updates, and learn effectively from sparse reward. We apply the approach to a wide range of novel text generation tasks, including learning from noisy/negative examples, adversarial attacks, and prompt generation. Experiments show our approach consistently outperforms both task-specialized algorithms and the previous RL methods.", "track": "Machine Learning for NLP", "label": 3, "url": "https://www.semanticscholar.org/reader/f3a2bc491bb9c96e14a728de0b0adf9228569ffd?experiments=&features=reader_skimming%3Atrue"}, {"loc": [5.768237590789795, 11.879371643066406], "id": 4516, "title": "Lexi: Self-Supervised Learning of the UI Language", "authors": "Pratyay Banerjee, Shweti Mahajan, Kushal Arora, Chitta Baral and Oriana Riva", "abstract": "Humans can learn to operate the user interface (UI) of an application by reading an instruction manual or how-to guide. Along with text, these resources include visual content such as UI screenshots and images of application icons referenced in the text. We explore how to leverage this data to learn generic visio-linguistic representations of UI screens and their components. These representations are useful in many real applications, such as accessibility, voice navigation, and task automation. Prior UI representation models rely on UI metadata (UI trees and accessibility labels), which is often missing, incompletely defined, or not accessible. We avoid such a dependency, and propose Lexi, a pre-trained vision and language model designed to handle the unique features of UI screens, including their text richness and context sensitivity. To train Lexi we curate the UICaption dataset consisting of 114k UI images paired with descriptions of their functionality. We evaluate Lexi on four tasks: UI action entailment, instruction-based UI image retrieval, grounding referring expressions, and UI entity recognition.", "track": "NLP Applications", "label": 0, "url": ""}, {"loc": [4.617684841156006, 9.1382417678833], "id": 4517, "title": "Inferring the Reader: Guiding Automated Story Generation with Commonsense Reasoning", "authors": "Xiangyu Peng, Siyan Li, Sarah Wiegreffe and Mark Riedl", "abstract": "Transformer-based language model approaches to automated story generation currently provide state-of-the-art results. However, they still suffer from plot incoherence when generating\nnarratives over time, and critically lack basic\ncommonsense reasoning. Furthermore, existing methods generally focus only on single-character stories, or fail to track characters\nat all. To improve the coherence of generated narratives and to expand the scope of\ncharacter-centric narrative generation, we introduce Commonsense-inference Augmented\nneural StoryTelling (CAST), a framework for\nintroducing commonsense reasoning into the\ngeneration process with the option to model the\ninteraction between multiple characters. We\nfind that our CAST method produces significantly more coherent, on-topic, enjoyable and\nfluent stories than existing models in both the\nsingle-character and two-character settings in\nthree storytelling domains.", "track": "Natural Language Generation", "label": 6, "url": "https://www.semanticscholar.org/reader/a791712371ed865cb6debe9cb4d5fd59a3405b85?experiments=&features=reader_skimming%3Atrue"}, {"loc": [4.403098106384277, 7.531744480133057], "id": 4520, "title": "How to Stop an Avalanche? JoDeM: Joint Decision Making through Compare and Contrast for Dialog State Tracking", "authors": "Haoming Wang and Wang Xin", "abstract": "Dialog state tracking (DST) is a core component in task-oriented dialog systems. Existing state-of-the-art DST model incorporates insight and intuition from the human experience into design of supplementary labels, which greatly assisted the training process of turn-by-turn DST model. Though the turn-by-turn scheme and supplementary labels enabled satisfactory performance on the task, most of the DST models of this fashion label or process the raw dialogue data on the premise that the last turn dialogue state is always correct, which is usually not the case. In this paper, we address the negative impact resulted from the premise above as the avalanche phenomenon. After that, we propose JoDeM, a state-of-the-art DST model which can tackle the Avalanche phenomenon with two mechanisms. First mechanism is a jointly decision making method to extract key information from the dialogue. Second mechanism is a compare and contrast dialogue update technique to prevent error accumulation. Example study and graph analysis are presented to support our claim about the harmfulness of avalanche phenomenon. We also conduct quantitative and qualitative experiments on the high quality MultiWOZ2.3 corpus dataset to demonstrate that the proposed model not only outperforms the existing state-of-the-art methods, but also proves the validity of solving avalanche degradation problem.", "track": "Dialogue and Interactive Systems", "label": 4, "url": ""}, {"loc": [8.023041725158691, 5.7381181716918945], "id": 4522, "title": "Contrastive Learning with Prompt-derived Virtual Semantic Prototypes for Unsupervised Sentence Embedding", "authors": "Jiali Zeng, Yongjing Yin, Yufan Jiang, Shuangzhi Wu and Yunbo Cao", "abstract": "Contrastive learning has become a new paradigm for unsupervised sentence embeddings.\nPrevious studies focus on instance-wise contrastive learning, attempting to construct positive pairs with textual data augmentation. In this paper, we propose a novel Contrastive learning method with Prompt-derived Virtual semantic Prototypes (ConPVP). \nSpecifically, with the help of prompts, we construct virtual semantic prototypes to each instance, and derive negative prototypes by using the negative form of the prompts.\nUsing a prototypical contrastive loss, we enforce the anchor sentence embedding to be close to its corresponding semantic prototypes, and far apart from the negative prototypes as well as the prototypes of other sentences.\nExtensive experimental results on semantic textual similarity, transfer, and clustering tasks demonstrate the effectiveness of our proposed model compared to strong baselines.\nCode is available at https://github.com/lemon0830/promptCSE.", "track": "Semantics: Lexical, Sentence level, Textual Inference and Other areas", "label": 8, "url": "https://www.semanticscholar.org/reader/c8c99356e5ded23149a82ab7e1c556499928bce4?experiments=&features=reader_skimming%3Atrue"}, {"loc": [7.617175579071045, 3.6496224403381348], "id": 4524, "title": "Weight Perturbation as Defense against Adversarial Word Substitutions", "authors": "Jianhan Xu, Linyang Li, Jiping Zhang, Xiaoqing Zheng, Kai-Wei Chang, Cho-Jui Hsieh and Xuanjing Huang", "abstract": "The existence and pervasiveness of textual adversarial examples have raised serious concerns to security-critical applications. \nMany methods have been developed to defend against adversarial attacks for neural natural language processing (NLP) models.\nAdversarial training is one of the most successful defense methods by adding some random or intentional perturbations to the original input texts and making the models robust to the perturbed examples.\nIn this study, we explore the feasibility of improving the adversarial robustness of NLP models by performing perturbations in the parameter space rather than the input feature space.\nThe weight perturbation helps to find a better solution (i.e., the values of weights) that minimizes the adversarial loss among other feasible solutions.\nWe found that the weight perturbation can significantly improve the robustness of NLP models when it is combined with the perturbation in the input embedding space, yielding the highest accuracy on both clean and adversarial examples across different datasets.", "track": "Machine Learning for NLP", "label": 3, "url": ""}, {"loc": [1.071527361869812, 10.52360725402832], "id": 4527, "title": "CORT: A New Baseline for Comparative Opinion Classification by Dual Prompts", "authors": "Yequan Wang, Hengran Zhang, Aixin Sun and Xuying Meng", "abstract": "Comparative opinion is a common linguistic phenomenon. The opinion is expressed by comparing multiple targets on a shared aspect, e.g., \"camera A is better than camera B in picture quality\u201d. Among the various subtasks in opinion mining, comparative opinion classification is relatively less studied. Current solutions use rules or classifiers to identify opinions, i.e., better, worse, or same, through feature engineering. Because the features are directly derived from the input sentence, these solutions are sensitive to the order of the targets mentioned in the sentence. For example, \"camera A is better than camera B\u201d means the same as \"camera B is worse than camera A\u201d; but the features of these two sentences are completely different. In this paper, we approach comparative opinion classification through prompt learning, taking the advantage of embedded knowledge in pre-trained language model. We design a twin framework with dual prompts, named CORT. This extremely simple model delivers state-of-the-art and robust performance on all benchmark datasets for comparative opinion classification. We believe CORT well serves as a new baseline for comparative opinion classification.", "track": "Sentiment Analysis, Stylistic Analysis, and Argument Mining", "label": 16, "url": ""}, {"loc": [7.5784406661987305, 12.384275436401367], "id": 4532, "title": "APEACH: Attacking Pejorative Expressions with Analysis on Crowd-Generated Hate Speech Evaluation Datasets", "authors": "Kichang Yang, Wonjun Jang and Won Ik Cho", "abstract": "In hate speech detection, developing training and evaluation datasets across various domains is the critical issue. Whereas, major approaches crawl social media texts and hire crowd-workers to annotate the data. Following this convention often restricts the scope of pejorative expressions to a single domain lacking generalization. Sometimes domain overlap between training corpus and evaluation set overestimate the prediction performance when pretraining language models on low-data language. To alleviate these problems in Korean, we propose APEACH that asks unspecified users to generate hate speech examples followed by minimal post-labeling. We find that APEACH can collect useful datasets that are less sensitive to the lexical overlaps between the pretraining corpus and the evaluation set, thereby properly measuring the model performance.", "track": "Resources and Evaluation", "label": 1, "url": "https://www.semanticscholar.org/reader/4ec9e75af8046ba664e14d761befebe8713cc790?experiments=&features=reader_skimming%3Atrue"}, {"loc": [4.6500139236450195, 9.146406173706055], "id": 4533, "title": "Guiding Neural Story Generation with Reader Models", "authors": "Xiangyu Peng, Kaige Xie, Amal Alabdulkarim, Harshith Kayam, Samihan Dani and Mark Riedl", "abstract": "Automated storytelling has long captured the attention of researchers for the ubiquity of narratives in everyday life. However, it is challenging to maintain coherence and stay on-topic\ntoward a specific ending when generating narratives with neural language models. In this paper, we introduce Story generation with Reader\nModels (StoRM), a framework in which a\nreader model is used to reason about the story\nshould progress. A reader model infers what\na human reader believes about the concepts,\nentities, and relations about the fictional story\nworld. We show how an explicit reader model\nrepresented as a knowledge graph affords the story\ncoherence and provides controllability in the\nform of achieving a given story world state\ngoal. Experiments show that our model produces significantly more coherent and on-topic\nstories, outperforming baselines in dimensions\nincluding plot plausibility and staying on topic", "track": "Natural Language Generation", "label": 6, "url": "https://www.semanticscholar.org/reader/03f079c0d6d5b14a3948e55de0f40677d9634338?experiments=&features=reader_skimming%3Atrue"}, {"loc": [4.0919718742370605, 7.065012454986572], "id": 4539, "title": "Reason first, then respond: Modular Generation for Knowledge-infused Dialogue", "authors": "Leonard Adolphs, Kurt Shuster, Jack Urbanek, Arthur Szlam and Jason Weston", "abstract": "Large language models can produce fluent dialogue but often hallucinate factual inaccuracies. While retrieval-augmented models help alleviate this issue, they still face a difficult challenge of both reasoning to provide correct knowledge and generating conversation simultaneously. In this work, we propose a modular model, Knowledge to Response (K2R), for incorporating knowledge into conversational agents, which breaks down this problem into two easier steps. K2R first generates a knowledge sequence, given a dialogue context, as an intermediate step. After this \"reasoning step\", the model then attends to its own generated knowledge sequence, as well as the dialogue context, to produce a final response. In detailed experiments, we find that such a model hallucinates less in knowledge-grounded dialogue tasks,  and has advantages in terms of interpretability and modularity. In particular, it can be used to fuse QA and dialogue systems together to enable dialogue agents to give knowledgeable answers, or QA models to give conversational responses in a zero-shot setting.", "track": "Dialogue and Interactive Systems", "label": 4, "url": "https://www.semanticscholar.org/reader/d15d96517370c9ed0658d176b979bcf92d1373ea?experiments=&features=reader_skimming%3Atrue"}, {"loc": [9.931356430053711, 6.445319175720215], "id": 4540, "title": "Adapting Multilingual Models for Code-Mixed Translation", "authors": "Aditya Vavre, Abhirut Gupta and Sunita Sarawagi", "abstract": "The scarcity of gold standard code-mixed to pure language parallel data makes it difficult to train translation models reliably.\nPrior work has addressed the paucity of parallel data with data augmentation techniques.\nSuch methods rely heavily on external resources making systems difficult to train and scale effectively for multiple languages.\nWe present a simple yet highly effective two-stage back-translation based training scheme for adapting multilingual models to the task of code-mixed translation which eliminates dependence on external resources.\nWe show a substantial improvement in translation quality (measured through BLEU), beating existing prior work by up to +3.8 BLEU on code-mixed Hi$\\rightarrow$En, Mr$\\rightarrow$En, and Bn$\\rightarrow$En tasks. On the LinCE Machine Translation leader board, we achieve the highest score for code-mixed Es$\\rightarrow$En, beating existing best baseline by +6.5 BLEU, and our own stronger baseline by +1.1 BLEU.", "track": "Machine Translation", "label": 10, "url": ""}, {"loc": [8.681415557861328, 8.381829261779785], "id": 4543, "title": "LPC: A Logits and Parameter Calibration Framework for Continual Learning", "authors": "Xiaodi Li, Zhuoyi Wang, Dingcheng Li, Latifur Khan and Bhavani Thuraisingham", "abstract": "When we execute the typical fine-tuning paradigm on continuously sequential tasks, the model will suffer from the catastrophic forgetting problem (i.e., the model tends to adjust old parameters according to the new knowledge, which leads to the loss of previously acquired concepts). People proposed replay-based methods by accessing old data from extra storage and maintaining the parameters of old concepts, which actually raise the privacy issue and larger memory requirements. In this work, we aim to achieve the sequential/continual learning of knowledge without accessing the old data. The core idea is to calibrate the parameters and logits (output) so that preserving old parameters and generalized learning on new concepts can be solved simultaneously. Our proposed framework includes two major components, Logits Calibration (LC) and Parameter Calibration (PC). The LC focuses on calibrating the learning of novel models with old models, and PC aims to preserve the parameters of old models. These two operations can maintain the old knowledge while learning new tasks without storing previous data. We conduct experiments on various scenarios of the GLUE (the General Language Understanding Evaluation) benchmark. The experimental results show that our model achieves state-of-the-art performance in all scenarios.", "track": "Machine Learning for NLP", "label": 3, "url": ""}, {"loc": [8.956563949584961, 6.496481418609619], "id": 4547, "title": "SlovakBERT: Slovak Masked Language Model", "authors": "Mat\u00fa\u0161 Pikuliak, \u0160tefan Grivalsk\u00fd, Martin Kon\u00f4pka, Miroslav Bl\u0161t\u00e1k, Martin Tamajka, Viktor Bachrat\u00fd, Marian Simko, Pavol Bal\u00e1\u017eik, Michal Trnka and Filip Uhl\u00e1rik", "abstract": "We introduce a new Slovak masked language model called \\textit{SlovakBERT}. This is to our best knowledge the first paper discussing Slovak transformers-based language models. We evaluate our model on several NLP tasks and achieve state-of-the-art results. This evaluation is likewise the first attempt to establish a benchmark for Slovak language models. We publish the masked language model, as well as the fine-tuned models for part-of-speech tagging, sentiment analysis and semantic textual similarity.", "track": "Language Modeling and Analysis of Language Models", "label": 2, "url": ""}, {"loc": [2.076018810272217, 7.563241481781006], "id": 4552, "title": "Efficient Zero-shot Event Extraction with Context-Definition Alignment", "authors": "Hongming Zhang, Wenlin Yao and Dong Yu", "abstract": "Event extraction (EE) is the task of identifying interested event mentions from text.\nConventional efforts mainly focus on the supervised setting. However, these supervised models cannot generalize to event types out of the pre-defined ontology. To fill this gap, many efforts have been devoted to the zero-shot EE problem. This paper follows the trend of modeling event-type semantics but moves one step further. We argue that using the static embedding of the event type name might not be enough because a single word could be ambiguous, and we need a sentence to define the type semantics accurately. To model the definition semantics, we use two separate transformer models to project the contextualized event mentions and corresponding definitions into the same embedding space and then minimize their embedding distance via contrastive learning. On top of that, we also propose a warming phase to help the model learn the minor difference between similar definitions. We name our approach Zero-shot Event extraction with Definition (ZED).  Experiments on the MAVEN dataset show that our model significantly outperforms all previous zero-shot EE methods with fast inference speed due to the disjoint design. Further experiments also show that \\ModelName~can be easily applied to the few-shot setting when the annotation is available and consistently outperforms baseline supervised methods.", "track": "Information Extraction", "label": 5, "url": ""}, {"loc": [4.441400051116943, 5.304572582244873], "id": 4555, "title": "Logical Fallacy Detection", "authors": "Zhijing Jin, Abhinav Lalwani, Tejas Vaidhya, Xiaoyu Shen, Yiwen Ding, Zhiheng LYU, Mrinmaya Sachan, Rada Mihalcea and Bernhard Schoelkopf", "abstract": "Reasoning is central to human intelligence. However, fallacious arguments are common, and some exacerbate problems such as spreading misinformation about climate change. In this paper, we propose the task of logical fallacy detection, and provide a new dataset (Logic) of logical fallacies generally found in text, together with an additional challenge set for detecting logical fallacies in climate change claims (LogicClimate). Detecting logical fallacies is a hard problem as the model must understand the underlying logical structure of the argument. We find that existing pretrained large language models perform poorly on this task. In contrast, we show that a simple structure-aware classifier outperforms the best language model by 5.46% F1 scores on Logic and 4.51% on LogicClimate. We encourage future work to explore this task since (a) it can serve as a new reasoning challenge for language models, and (b) it can have potential applications in tackling the spread of misinformation. Our dataset and code are available at https://\ngithub.com/causalNLP/logical-fallacy", "track": "NLP Applications", "label": 0, "url": "https://www.semanticscholar.org/reader/5df1a114dab6938e5078130c2440e8b846e785ae?experiments=&features=reader_skimming%3Atrue"}, {"loc": [4.09990930557251, 7.124439716339111], "id": 4561, "title": "Topic-Aware Response Generation in Task-Oriented Dialogue with Unstructured Knowledge Access", "authors": "Yue Feng, Gerasimos Lampouras and Ignacio Iacobacci", "abstract": "To alleviate the problem of structured databases' limited coverage, recent task-oriented dialogue systems incorporate external unstructured knowledge to guide the generation of system responses. However, these usually use word or sentence level similarities to detect the relevant knowledge context, which only partially capture the topical level relevance. In this paper, we examine how to better integrate topical information in knowledge grounded task-oriented dialogue and propose \"Topic-Aware Response Generation\" (TARG), an end-to-end response generation model. TARG incorporates multiple topic-aware attention mechanisms to derive the importance weighting scheme over dialogue utterances and external knowledge sources towards a better understanding of the dialogue history. Experimental results indicate that TARG achieves state-of-the-art performance in knowledge selection and response generation, outperforming previous state-of-the-art by 3.2, 3.6, and 4.2 points in EM, F1 and BLEU-4 respectively on Doc2Dial, and performing comparably with previous work on DSTC9; both being knowledge-grounded task-oriented dialogue datasets.", "track": "Dialogue and Interactive Systems", "label": 4, "url": ""}, {"loc": [7.272808074951172, 8.017844200134277], "id": 4563, "title": "Revisiting Transformer-based Models for Long Document Classification", "authors": "Xiang Dai, Ilias Chalkidis, Sune Darkner and Desmond Elliott", "abstract": "The recent literature in text classification is biased towards short text sequences (e.g., sentences or paragraphs). \nIn real-world applications, multi-page multi-paragraph documents are common and they cannot be efficiently encoded by vanilla Transformer-based models.  \nWe compare different Transformer-based Long Document Classification (TrLDC) approaches that aim to mitigate the computational overhead of vanilla transformers to encode much longer text, namely sparse attention and hierarchical encoding methods.\nWe examine several aspects of sparse attention (e.g., size of local attention window, use of global attention) and hierarchical (e.g., document splitting strategy) transformers on four document classification datasets covering different domains. \nWe observe a clear benefit from being able to process longer text, and, based on our results, we derive practical advice of applying Transformer-based models on long document classification tasks.", "track": "NLP Applications", "label": 0, "url": "https://www.semanticscholar.org/reader/69ec135064e66bd2c9b278687d8b7fd03391284a?experiments=&features=reader_skimming%3Atrue"}, {"loc": [5.274668216705322, 9.11607551574707], "id": 4568, "title": "Time-aware Prompting for Text Generation", "authors": "Shuyang Cao and Lu Wang", "abstract": "In this paper, we study the effects of incorporating timestamps, such as document creation dates, into generation systems. Two types of time-aware prompts are investigated: (1) textual prompts that encode document timestamps in natural language sentences; and (2) linear prompts that convert timestamps into continuous vectors. To explore extrapolation to future data points, we further introduce a new data-to-text generation dataset, TempWikiBio, containing more than 4 millions of chronologically ordered revisions of biographical articles from English Wikipedia, each paired with structured personal profiles.\nThrough data-to-text generation on TempWikiBio, text-to-text generation on the content transfer dataset, and summarization on XSum,\nwe show that linear prompts on encoder and textual prompts improve the generation quality on all datasets.\nDespite having less performance drop when testing on data drawn from a later time, linear prompts focus more on non-temporal information and are less sensitive to the given timestamps, according to human evaluations and sensitivity analyses.\nMeanwhile, textual prompts establish the association between the given timestamps and the output dates, yielding more factual temporal information in the output.", "track": "Natural Language Generation", "label": 6, "url": "https://www.semanticscholar.org/reader/c36ab572b5be7a470b725b87e369038295d5e7ab?experiments=&features=reader_skimming%3Atrue"}, {"loc": [10.11783218383789, 7.202850818634033], "id": 4572, "title": "Improving Scheduled Sampling with Elastic Weight Consolidation for Neural Machine Translation", "authors": "Michalis Korakakis and Andreas Vlachos", "abstract": "Despite strong performance in many sequence-to-sequence tasks, autoregressive models trained with maximum likelihood estimation suffer from exposure bias, i.e. the discrepancy between the ground-truth prefixes used during training and the model-generated prefixes used at inference time. Scheduled sampling is a simple and empirically successful approach which addresses this issue by incorporating model-generated prefixes into training. However, it has been argued that it is an inconsistent training objective leading to models ignoring the prefixes altogether. In this paper, we conduct systematic experiments and find that scheduled sampling, while it ameliorates exposure bias by increasing model reliance on the input sequence, worsens performance when the prefix at inference time is correct, a form of catastrophic forgetting. We propose to use Elastic Weight Consolidation to better balance mitigating exposure bias with retaining performance. Experiments on four IWSLT'14 and WMT'14 translation datasets demonstrate that our approach alleviates catastrophic forgetting and significantly outperforms maximum likelihood estimation and scheduled sampling baselines.", "track": "Machine Learning for NLP", "label": 3, "url": "https://www.semanticscholar.org/reader/92646baf394670ef83ad70ae6a77969f4caee122?experiments=&features=reader_skimming%3Atrue"}, {"loc": [2.9034206867218018, 4.580212593078613], "id": 4585, "title": "Ensemble Transformer for Efficient and Accurate Ranking Tasks: an Application to Question Answering Systems", "authors": "Yoshitomo Matsubara, Luca Soldaini, Eric Lind and Alessandro Moschitti", "abstract": "Large transformer models can highly improve Answer Sentence Selection (AS2) tasks, but their high computational costs prevent their use in many real-world applications.  In this paper, we explore the following research question: How can we make the AS2 models more accurate without significantly increasing their model complexity? To address the question, we propose a Multiple Heads Student architecture (named CERBERUS), an efficient neural network designed to distill an ensemble of large transformers into a single smaller model. CERBERUS consists of two components: a stack of transformer layers that is used to encode inputs, and a set of ranking heads; unlike traditional distillation technique, each of them is trained by distilling a different large transformer architecture in a way that preserves the diversity of the ensemble members. The resulting model captures the knowledge of heterogeneous transformer models by using just a few extra parameters. We show the effectiveness of CERBERUS on three English datasets for AS2; our proposed approach outperforms all single-model distillations we consider, rivaling the state-of-the-art large AS2 models that have 2.7\u00d7 more parameters and run 2.5\u00d7 slower. Code for our model is available at https://github.com/amazon-research/wqa-cerberus.", "track": "Question Answering", "label": 11, "url": "https://www.semanticscholar.org/reader/b61a8db8d2bdc9bc1594587dcf17ed8a7eb439cd?experiments=&features=reader_skimming%3Atrue"}, {"loc": [8.425239562988281, 7.632030010223389], "id": 4587, "title": "Uncertainty Quantification with Pre-trained Language Models: A Large-Scale Empirical Analysis", "authors": "Yuxin Xiao, Paul Pu Liang, Umang Bhatt, Willie Neiswanger, Ruslan Salakhutdinov and Louis-Philippe Morency", "abstract": "Pre-trained language models (PLMs) have gained increasing popularity due to their compelling prediction performance in diverse natural language processing (NLP) tasks. When formulating a PLM-based prediction pipeline for NLP tasks, it is also crucial for the pipeline to minimize the calibration error, especially in safety-critical applications. That is, the pipeline should reliably indicate when we can trust its predictions. In particular, there are various considerations behind the pipeline: (1) the choice and (2) the size of PLM, (3) the choice of uncertainty quantifier, (4) the choice of fine-tuning loss, and many more. Although prior work has looked into some of these considerations, they usually draw conclusions based on a limited scope of empirical studies. There still lacks a holistic analysis on how to compose a well-calibrated PLM-based prediction pipeline. To fill this void, we compare a wide range of popular options for each consideration based on three prevalent NLP classification tasks and the setting of domain shift. In response, we recommend the following: (1) use ELECTRA for PLM encoding, (2) use larger PLMs if possible, (3) use Temp Scaling as the uncertainty quantifier, and (4) use Focal Loss for fine-tuning.", "track": "Resources and Evaluation", "label": 1, "url": "https://www.semanticscholar.org/reader/551b05734eb2181c4ca009a411144e8447ed1606?experiments=&features=reader_skimming%3Atrue"}, {"loc": [4.020224094390869, 7.227565765380859], "id": 4590, "title": "How to Represent Context Better? An Empirical Study on Context Modeling for Multi-turn Response Selection", "authors": "Jiazhan Feng, Chongyang Tao, Chang Liu, Rui Yan and Dongyan Zhao", "abstract": "Building retrieval-based dialogue models that can predict appropriate responses based on the understanding of multi-turn context messages is a challenging problem. Early models usually concatenate all utterances or independently encode each dialogue turn, which may lead to an inadequate understanding of dialogue status. Although a few researchers have noticed the importance of context modeling in multi-turn response prediction, there is no systematic comparison to analyze how to model context effectively and no framework to unify those methods. In this paper, instead of configuring new architectures, we investigate how to improve existing models with a better context modeling method. Specifically, we heuristically summarize three categories of turn-aware context modeling strategies which model the context messages from the perspective of sequential relationship, local relationship, and query-aware manner respectively. A Turn-Aware Context Modeling (TACM) layer is explored to flexibly adapt and unify these context modeling strategies to several advanced response selection models. Evaluation results on three public data sets indicate that employing each individual context modeling strategy or multiple strategies can consistently improve the performance of existing models.", "track": "Dialogue and Interactive Systems", "label": 4, "url": ""}, {"loc": [10.56942367553711, 6.848044395446777], "id": 4591, "title": "CHIA: CHoosing Instances to Annotate for Machine Translation", "authors": "Rajat Bhatnagar, Ananya Ganesh and Katharina Kann", "abstract": "Neural machine translation (MT) systems have been shown to perform poorly on low-resource language pairs, for which large-scale parallel data is unavailable. Making the data annotation process faster and cheaper is therefore important to ensure equitable access to MT systems. To make optimal use of a limited annotation budget, we present CHIA (choosing instances to annotate), a method for selecting instances to annotate for machine translation.  Using an existing multi-way parallel dataset of high-resource languages, we first identify instances, based on model training dynamics, that are most informative for training MT models for high-resource languages. \nWe find that there are cross-lingual commonalities in instances that are useful for MT model training, which we use to identify instances that will be useful to train models on a new target language. Evaluating on 20 languages from two corpora, we show that training on instances selected using our method provides an average performance improvement of 1.59 BLEU over training on randomly selected instances of the same size.", "track": "Machine Translation", "label": 10, "url": ""}, {"loc": [10.577953338623047, 7.187368392944336], "id": 4596, "title": "Guiding Neural Machine Translation with Semantic Kernels", "authors": "Ping Guo, Yue Hu, Xiangpeng Wei, Yubing Ren, Yunpeng Li, Luxi Xing and Yuqiang Xie", "abstract": "Machine Translation task has made great progress with the help of auto-regressive decoding paradigm and Transformer architecture. In this paradigm, though the encoder can obtain global source representations, the decoder can only use translation history to determine the current word. Previous promising works attempted to address this issue by applying a draft or a fixed-length semantic embedding as target-side global information. However, these methods either degrade model efficiency or show limitations in expressing semantics. Motivated by Functional Equivalence Theory, we extract several semantic kernels from a source sentence, each of which can express one semantic segment of the original sentence. Together, these semantic kernels can capture global semantic information, and we project them into target embedding space to guide target sentence generation. We further force our model to use semantic kernels at each decoding step through an adaptive mask algorithm. Empirical studies on various machine translation benchmarks show that our approach gains approximately an improvement of 1 BLEU score on most benchmarks over the Transformer baseline and about 1.7 times faster than previous works on average at inference time.", "track": "Machine Translation", "label": 10, "url": ""}, {"loc": [0.7051019072532654, 6.476152420043945], "id": 4597, "title": "HiSMatch: Historical Structure Matching based Temporal Knowledge Graph Reasoning", "authors": "Zixuan Li, Zhongni Hou, Saiping Guan, Xiaolong Jin, Weihua Peng, Long Bai, Yajuan Lyu, Wei Li, Jiafeng Guo and Xueqi Cheng", "abstract": "A Temporal Knowledge Graph (TKG) is a sequence of KGs with respective timestamps, which adopts quadruples in the form of (\\emph{subject}, \\emph{relation}, \\emph{object}, \\emph{timestamp}) to describe dynamic facts. TKG reasoning has facilitated many real-world applications via answering such queries as (\\emph{query entity}, \\emph{query relation}, \\emph{?}, \\emph{future timestamp}) about future. This is actually a matching task between a query and candidate entities based on their historical structures, which reflect behavioral trends of the entities at different timestamps. In addition, recent KGs provide background knowledge of all the entities, which is also helpful for the matching. Thus, in this paper, we propose the \\textbf{Hi}storical \\textbf{S}tructure \\textbf{Match}ing (\\textbf{HiSMatch}) model. It applies two structure encoders to capture the semantic information contained in the historical structures of the query and candidate entities. Besides, it adopts another encoder to integrate the background knowledge into the model. TKG reasoning experiments on six benchmark datasets demonstrate the significant improvement of the proposed HiSMatch model, with up to 5.6\\% performance improvement in MRR, compared to the state-of-the-art baselines.", "track": "Information Extraction", "label": 5, "url": "https://www.semanticscholar.org/reader/7e17da15c878a448174372385dfd775cf9472e00?experiments=&features=reader_skimming%3Atrue"}, {"loc": [8.211596488952637, 6.54801082611084], "id": 4606, "title": "Dependency Parsing via Sequence Generation", "authors": "Boda Lin, Zijun Yao, Jiaxin Shi, Shulin Cao, Binghao Tang, Si Li, Yong Luo, Juanzi Li and Lei Hou", "abstract": "Dependency parsing aims to extract syntactic dependency structure or semantic dependency structure for sentences.\nExisting methods for dependency parsing include transition-based method, graph-based method and sequence-to-sequence method.\nThese methods obtain excellent performance and we notice them belong to labeling method.\nTherefore, it may be very valuable and interesting to explore the possibility of using generative method to implement dependency parsing.\nIn this paper, we propose to achieve Dependency Parsing (DP) via Sequence Generation (SG) by utilizing only the pre-trained language model without any auxiliary structures.\nWe first explore different serialization designing strategies for converting parsing structures into sequences.\nThen we design dependency units and concatenate these units into the sequence for DPSG.\nWe verify the DPSG is capable of parsing on widely used DP benchmarks, i.e., PTB, UD2.2, SDP15 and SemEval16.\nIn addition, we also investigate the astonishing low-resource applicability of DPSG, which includes unsupervised cross-domain conducted on CODT and few-shot cross-task conducted on SDP15.\nOur research demonstrates that sequence generation is one of the effective methods to achieve dependency parsing.\nOur codes are available now.", "track": "Syntax, Parsing and their Applications", "label": 23, "url": ""}, {"loc": [8.511802673339844, 8.262737274169922], "id": 4609, "title": "Scaling Laws Under the Microscope: Predicting Transformer Performance from Small Scale Experiments", "authors": "Maor Ivgi, Yair Carmon and Jonathan Berant", "abstract": "Neural scaling laws define a predictable relationship between a model's parameter count and its performance after training in the form of a power law. However, most research to date has not explicitly investigated whether scaling laws can be used to accelerate model development. \nIn this work, we perform such an empirical investigation across a wide range of language understanding tasks, starting from models with as few as 10K parameters, and evaluate downstream performance across 9 language understanding tasks.\nWe find that scaling laws emerge at finetuning time in some NLP tasks, and that they can also be exploited for debugging convergence when training large models. Moreover, for tasks where scaling laws exist, they can be used to predict the performance of larger models, which enables effective model selection. However, revealing scaling laws\nrequires careful hyperparameter tuning and multiple runs for the purpose of uncertainty estimation, which incurs additional overhead, partially offsetting the computational benefits.", "track": "Efficient Methods for NLP", "label": 12, "url": "https://www.semanticscholar.org/reader/e404bdfaa858b3c25540aa5d2c5dfe20c16ead37?experiments=&features=reader_skimming%3Atrue"}, {"loc": [5.97166109085083, 5.87507963180542], "id": 4619, "title": "Analyzing the Limits of Self-Supervision in Handling Bias in Language", "authors": "Lisa Bauer, Karthik Gopalakrishnan, Spandana Gella, Yang Liu, Mohit Bansal and Dilek Hakkani-Tur", "abstract": "Prompting inputs with natural language task descriptions has emerged as a popular mechanism to elicit reasonably accurate outputs from large-scale generative language models with little to no in-context supervision. This also helps gain insight into how well language models capture the semantics of a wide range of downstream tasks purely from self-supervised pre-training on massive corpora of unlabeled text. Such models have naturally also been exposed to a lot of undesirable content like racist and sexist language and there is only some work on awareness of models along these dimensions. In this paper, we define and comprehensively evaluate how well such language models capture the semantics of four tasks for bias: diagnosis, identification, extraction and rephrasing. We define three broad classes of task descriptions for these tasks: statement, question, and completion, with numerous lexical variants within each class. We study the efficacy of prompting for each task using these classes and the null task description across several decoding methods and few-shot examples. Our analyses indicate that language models are capable of performing these tasks to widely varying degrees across different bias dimensions, such as gender and political affiliation. We believe our work is an important step towards unbiased language models by quantifying the limits of current self-supervision objectives at accomplishing such sociologically challenging tasks.", "track": "Language Modeling and Analysis of Language Models", "label": 2, "url": "https://www.semanticscholar.org/reader/fb2e38502ac66ae09b58e87d7ef25c60e7d49969?experiments=&features=reader_skimming%3Atrue"}, {"loc": [7.5991668701171875, 12.304539680480957], "id": 4623, "title": "Multiple Instance Learning for Offensive Language Detection", "authors": "Jiexi Liu, Dehan Kong, Longtao Huang, Dinghui Mao and hui xue", "abstract": "Automatic offensive language detection has become a crucial issue in recent years. Existing researches on this topic are usually based on a large amount of data annotated at sentence level to train a robust model. However, sentence-level annotations are expensive in practice as the scenario expands, while there exist a large amount of natural labels from historical information on online platforms such as reports and punishments. Notably, these natural labels are usually in bag-level corresponding to the whole documents (articles, user profiles, conversations, etc.). Therefore, we target at proposing an approach capable of utilizing the bag-level labeled data for offensive language detection in this study. For this purpose, we formalize this task into a multiple instance learning (MIL) problem. We break down the design of existing MIL methods and propose a hybrid fusion MIL model with mutual-attention mechanism. In order to verify the validity of the proposed method, we present two new bag-level labeled datasets for offensive language detection: OLID-bags and MINOR. Experimental results based on the proposed datasets demonstrate the effectiveness of the mutual-attention method at both sentence level and bag level.", "track": "Ethics", "label": 21, "url": ""}, {"loc": [5.506701946258545, 8.555914878845215], "id": 4626, "title": "Grounded Keys-to-Text Generation: Towards Factual Open-Ended Generation", "authors": "Faeze Brahman, Baolin Peng, Michel Galley, Sudha Rao, Bill Dolan, Snigdha Chaturvedi and Jianfeng Gao", "abstract": "Large pre-trained language models have recently enabled open-ended generation frameworks (e.g., prompt-to-text NLG) to tackle a variety of tasks going beyond the traditional data-to-text generation. While this framework is more general, it is under-specified and often leads to a lack of controllability restricting their real-world usage. We propose a new grounded keys-to-text generation task: the task is to generate a factual description about an entity given a set of guiding keys, and grounding passages. To address this task, we introduce a new dataset, called EntDeGen. Inspired by recent QA-based evaluation measures, we propose an automatic metric, MAFE, for factual correctness of generated descriptions. Our EntDescriptor model is equipped with strong rankers to fetch helpful passages and generate entity descriptions. Experimental result shows a good correlation (60.14) between our proposed metric and human judgments of factuality. Our rankers significantly improved the factual correctness of generated descriptions (15.95% and 34.51% relative gains in recall and precision). Finally, our ablation study highlights the benefit of combining keys and groundings.", "track": "Natural Language Generation", "label": 6, "url": ""}, {"loc": [0.6820216774940491, 6.776662349700928], "id": 123, "title": "Generative Knowledge Graph Construction: A Review", "authors": "Hongbin Ye, Ningyu Zhang, Hui Chen and Huajun Chen", "abstract": "Generative Knowledge Graph Construction (KGC) refers to those methods that leverage the sequence-to-sequence framework for building knowledge graphs, which is flexible and can be adapted to widespread tasks. In this study, we summarize the recent compelling progress in generative knowledge graph construction. We present the advantages and weaknesses of each paradigm in terms of different generation targets and provide theoretical insight and empirical analysis. Based on the review, we suggest promising research directions for the future. Our contributions are threefold: (1) We present a detailed, complete taxonomy for the generative KGC methods; (2) We provide a theoretical and empirical analysis of the generative KGC methods; (3) We propose several research directions that can be developed in the future.", "track": "Information Extraction", "label": 5, "url": "https://www.semanticscholar.org/reader/8682d1f35f8a854b0e47beafc5201950bee84077?experiments=&features=reader_skimming%3Atrue"}, {"loc": [4.255823135375977, 7.2021002769470215], "id": 142, "title": "CDConv: A Benchmark for Contradiction Detection in Chinese Conversations", "authors": "Chujie Zheng, Jinfeng Zhou, Yinhe Zheng, Libiao Peng, Zhen Guo, Wenquan Wu, Zheng-Yu Niu, Hua Wu and Minlie Huang", "abstract": "Dialogue contradiction is a critical issue in open-domain dialogue systems. The contextualization nature of conversations makes dialogue contradiction detection rather challenging. In this work, we propose a benchmark for Contradiction Detection in Chinese Conversations, namely CDConv. It contains 12K multi-turn conversations annotated with three typical contradiction categories: Intra-sentence Contradiction, Role Confusion, and History Contradiction. To efficiently construct the CDConv conversations, we devise a series of methods for automatic conversation generation, which simulate common user behaviors that trigger chatbots to make contradictions. We conduct careful manual quality screening of the constructed conversations and show that state-of-the-art Chinese chatbots can be easily goaded into making contradictions. Experiments on CDConv show that properly modeling contextual information is critical for dialogue contradiction detection, but there are still unresolved challenges that require future research.", "track": "Dialogue and Interactive Systems", "label": 4, "url": "https://www.semanticscholar.org/reader/577682d6df0da548dfb58d93dfd623b973bdf34a?experiments=&features=reader_skimming%3Atrue"}, {"loc": [8.583722114562988, 7.876671314239502], "id": 164, "title": "Transformer Feed-Forward Layers Build Predictions by Promoting Concepts in the Vocabulary Space", "authors": "Mor Geva, Avi Caciularu, Kevin Wang and Yoav Goldberg", "abstract": "Transformer-based language models (LMs) are at the core of modern NLP, but their internal prediction construction process is opaque and largely not understood. In this work, we make a substantial step towards unveiling this underlying prediction process, by reverse-engineering the operation of the feed-forward network (FFN) layers, one of the building blocks of transformer models. We view the token representation as a changing distribution over the vocabulary, and the output from each FFN layer as an additive update to that distribution. Then, we analyze the FFN updates in the vocabulary space, showing that each update can be decomposed to sub-updates corresponding to single FFN parameter vectors, each promoting concepts that are often human-interpretable. We then leverage these findings for controlling LM predictions, where we reduce the toxicity of GPT2 by almost 50%, and for improving computation efficiency with a simple early exit rule, saving 20% of computation on average.", "track": "Interpretability, Interactivity and Analysis of Models for NLP", "label": 9, "url": "https://www.semanticscholar.org/reader/cf36236015c9f93f15bfafbf282f69e08bdc9c16?experiments=&features=reader_skimming%3Atrue"}, {"loc": [2.9749038219451904, 4.687404632568359], "id": 168, "title": "Learning to Generate Question by Asking Question: A Primal-Dual Approach with Uncommon Word Generation", "authors": "Qifan Wang, Li Yang, Xiaojun Quan, Fuli Feng, Dongfang Liu, Zenglin Xu, Sinong Wang and Hao Ma", "abstract": "Automatic question generation (AQG) is the task of generating a question from a given passage and an answer. Most existing AQG methods aim at encoding the passage and the answer to generate the question. However, limited work has focused on modeling the correlation between the target answer and the generated question. Moreover, unseen or rare word generation has not been studied in previous works. In this paper, we propose a novel approach which incorporates question generation with its dual problem, question answering, into a unified primal-dual framework. Specifically, the question generation component consists of an encoder that jointly encodes the answer with the passage, and a decoder that produces the question. The question answering component then re-asks the generated question on the passage to ensure that the target answer is obtained. We further introduce a knowledge distillation module to improve the model generalization ability. We conduct an extensive set of experiments on SQuAD and HotpotQA benchmarks. Experimental results demonstrate the superior performance of the proposed approach over several state-of-the-art methods.", "track": "NLP Applications", "label": 0, "url": ""}, {"loc": [0.7862079739570618, 7.540556907653809], "id": 236, "title": "Graph-based Model Generation for Few-Shot Relation Extraction", "authors": "Wanli Li and Tieyun Qian", "abstract": "Few-shot relation extraction (FSRE) has been a challenging problem since it only has a handful of training instances. Existing models follow a `one-for-all' scheme where one general large model performs all individual N-way-K-shot tasks in FSRE, which prevents the model  from achieving the optimal point on each task. In view of this, we propose a model generation framework that consists of one general model for all tasks and many tiny task-specific models for each individual task. The general model generates and passes the universal knowledge to the tiny models which will be further fine-tuned when performing specific tasks. In this way, we decouple the complexity of the entire task space from that of all individual tasks while absorbing the universal knowledge.\nExtensive experimental results on two public datasets demonstrate that our framework reaches a new state-of-the-art performance for FRSE tasks. Our code is available at: https://github.com/NLPWM-WHU/GM_GEN.", "track": "Information Extraction", "label": 5, "url": ""}, {"loc": [8.076251029968262, 3.094322681427002], "id": 264, "title": "Backdoor Attacks in Federated Learning by Rare Embeddings and Gradient Ensembling", "authors": "Ki Yoon Yoo and Nojun Kwak", "abstract": "Recent advances in federated learning have demonstrated its promising capability to learn on decentralized datasets. However, a considerable amount of work has raised concerns due to the potential risks of adversaries participating in the framework to poison the global model for an adversarial purpose. This paper investigates the feasibility of model poisoning for backdoor attacks through rare word embeddings of NLP models. In text classification, less than 1% of adversary clients suffices to manipulate the model output without any drop in the performance of clean sentences. For a less complex dataset, a mere 0.1% of adversary clients is enough to poison the global model effectively. We also propose a technique specialized in the federated learning scheme called gradient ensemble, which enhances the backdoor performance in all experimental settings.", "track": "Machine Learning for NLP", "label": 3, "url": "https://www.semanticscholar.org/reader/2b8d483b94cceefe10d804579f09891ddb53f836?experiments=&features=reader_skimming%3Atrue"}, {"loc": [4.497512340545654, 4.525813102722168], "id": 266, "title": "Generating Natural Language Proofs with Verifier-Guided Search", "authors": "Kaiyu Yang, Jia Deng and Danqi Chen", "abstract": "Reasoning over natural language is a challenging problem in NLP. In this work, we focus on proof generation: Given a hypothesis and a set of supporting facts, the model generates a proof tree indicating how to derive the hypothesis from supporting facts. Compared to generating the entire proof in one shot, stepwise generation can better exploit the compositionality and generalize to longer proofs but has achieved limited success on real-world data. Existing stepwise methods struggle to generate proof steps that are both logically valid and relevant to the hypothesis. Instead, they tend to hallucinate invalid steps given the hypothesis. In this paper, we present a novel stepwise method, NLProofS (Natural Language Proof Search), which learns to generate relevant steps conditioning on the hypothesis. At the core of our approach, we train an independent verifier to check the validity of the proof steps to prevent hallucination. Instead of generating steps greedily, we search for proofs maximizing a global proof score judged by the verifier. NLProofS achieves state-of-the-art performance on EntailmentBank and RuleTaker. Specifically, it improves the correctness of predicted proofs from 27.7% to 33.3% in the distractor setting of EntailmentBank, demonstrating the effectiveness of NLProofS in generating challenging human-authored proofs.", "track": "Question Answering", "label": 11, "url": "https://www.semanticscholar.org/reader/196cc546041cb6db167784f632037f0a1dcf4a79?experiments=&features=reader_skimming%3Atrue"}, {"loc": [3.86320424079895, 9.9197359085083], "id": 280, "title": "Toward Unifying Text Segmentation and Long Document Summarization", "authors": "Sangwoo Cho, Kaiqiang Song, Xiaoyang Wang, Fei Liu and Dong Yu", "abstract": "Text segmentation is important for signaling a document's structure. Without segmenting a long document into topically coherent sections, it is difficult for readers to comprehend the text, let alone find important information. The problem is only exacerbated by a lack of segmentation in transcripts of audio/video recordings. In this paper, we explore the role that section segmentation plays in extractive summarization of written and spoken documents. Our approach learns robust sentence representations by performing summarization and segmentation simultaneously, which is further enhanced by an optimization-based regularizer to promote selection of diverse summary sentences. We conduct experiments on multiple datasets ranging from scientific articles to spoken transcripts to evaluate the model's performance. Our findings suggest that the model can not only achieve state-of-the-art performance on publicly available benchmarks, but demonstrate better cross-genre transferability when equipped with text segmentation. We perform a series of analyses to quantify the impact of section segmentation on summarizing written and spoken documents of substantial length and complexity.", "track": "Summarization", "label": 14, "url": ""}, {"loc": [9.092198371887207, 6.21954870223999], "id": 307, "title": "The Geometry of Multilingual Language Model Representations", "authors": "Tyler Chang, Zhuowen Tu and Benjamin Bergen", "abstract": "We assess how multilingual language models maintain a shared multilingual representation space while still encoding language-sensitive information in each language. Using XLM-R as a case study, we show that languages occupy similar linear subspaces after mean-centering, evaluated based on causal effects on language modeling performance and direct comparisons between subspaces for 88 languages. The subspace means differ along language-sensitive axes that are relatively stable throughout middle layers, and these axes encode information such as token vocabularies. Shifting representations by language means is sufficient to induce token predictions in different languages. However, we also identify stable language-neutral axes that encode information such as token positions and part-of-speech. We visualize representations projected onto language-sensitive and language-neutral axes, identifying language family and part-of-speech clusters, along with spirals, toruses, and curves representing token position information. These results demonstrate that multilingual language models encode information along orthogonal language-sensitive and language-neutral axes, allowing the models to extract a variety of features for downstream tasks and cross-lingual transfer learning.", "track": "Language Modeling and Analysis of Language Models", "label": 2, "url": "https://www.semanticscholar.org/reader/24a4657b614a4a3037bf045cc1ded0548771c148?experiments=&features=reader_skimming%3Atrue"}, {"loc": [2.8296313285827637, 4.764945030212402], "id": 321, "title": "Improving Complex Knowledge Base Question Answering via Question-to-Action and Question-to-Question Alignment", "authors": "Yechun Tang, Xiaoxia Cheng and Weiming Lu", "abstract": "Complex knowledge base question answering can be achieved by converting questions into sequences of predefined actions. However, there is a significant semantic and structural gap between natural language and action sequences, which makes this conversion difficult. In this paper, we introduce an alignment-enhanced complex question answering framework, called ALCQA, which mitigates this gap through question-to-action alignment and question-to-question alignment. We train a question rewriting model to align the question and each action, and utilize a pretrained language model to implicitly align the question and KG artifacts. Moreover, considering that similar questions correspond to similar action sequences, we retrieve top-k similar question-answer pairs at the inference stage through question-to-question alignment and propose a novel reward-guided action sequence selection strategy to select from candidate action sequences. We conduct experiments on CQA and WQSP datasets, and the results show that our approach outperforms state-of-the-art methods and obtains a 9.88\\% improvements in the F1 metric on CQA dataset. Our source code is available at \\url{\nhttps://github.com/TTTTTTTTy/ALCQA}.", "track": "Question Answering", "label": 11, "url": ""}, {"loc": [4.672688961029053, 6.941009998321533], "id": 375, "title": "PAIR: Prompt-Aware margIn Ranking for Counselor Reflection Scoring in Motivational Interviewing", "authors": "Do June Min, Ver\u00f3nica P\u00e9rez-Rosas, Kenneth Resnicow and Rada Mihalcea", "abstract": "Counselor reflection is a core verbal skill used by mental health counselors to express understanding and affirmation of the client's experience and concerns. In this paper, we propose a system for the analysis of counselor reflections. Specifically, our system takes as input one dialog turn containing a client prompt and a counselor response, and outputs a score indicating the level of reflection in the counselor response. We compile a dataset consisting of different levels of reflective listening skills, and propose the Prompt-Aware margIn Ranking (PAIR) framework that contrasts positive and negative prompt and response pairs using specially designed multi-gap and prompt-aware margin ranking losses. Through empirical evaluations and deployment of our system in a real-life educational environment, we show that our analysis model outperforms several baselines on different metrics, and can be used to provide useful feedback to counseling trainees.", "track": "Ethic Concerns:NLP Applications", "label": 0, "url": ""}, {"loc": [6.913618564605713, 9.56233024597168], "id": 376, "title": "Co-guiding Net: Achieving Mutual Guidances between Multiple Intent Detection and Slot Filling via Heterogeneous Semantics-Label Graphs", "authors": "Bowen Xing and Ivor Tsang", "abstract": "Recent graph-based models for joint multiple intent detection and slot filling have obtained promising results through modeling the guidance from the prediction of intents to the decoding of slot filling.\nHowever, existing methods (1) only model the \\textit{unidirectional guidance} from intent to slot; (2) adopt \\textit{homogeneous graphs} to model the interactions between the slot semantics nodes and intent label nodes, which limit the performance.\nIn this paper, we propose a novel model termed Co-guiding Net, which implements a two-stage framework achieving the \\textit{mutual guidances} between the two tasks.\nIn the first stage, the initial estimated labels of both tasks are produced, and then they are leveraged in the second stage to model the mutual guidances.\nSpecifically, we propose two \\textit{heterogeneous graph attention networks} working on the proposed two \\textit{heterogeneous semantics-label graphs}, which effectively represent the relations among the semantics nodes and label nodes.\nExperiment results show that our model outperforms existing models by a large margin, obtaining a relative improvement of 19.3\\% over the previous best model on MixATIS dataset in overall accuracy.", "track": "Dialogue and Interactive Systems", "label": 4, "url": "https://www.semanticscholar.org/reader/b3aec6ba3bba8183230db45ea5ddfec7685900a0?experiments=&features=reader_skimming%3Atrue"}, {"loc": [10.305692672729492, 7.068643569946289], "id": 385, "title": "The Importance of Being Parameters: An Intra-Distillation Method for Serious Gains", "authors": "Haoran Xu, Philipp Koehn and Kenton Murray", "abstract": "Recent model pruning methods have demonstrated the ability to remove redundant parameters without sacrificing model performance. Common methods remove redundant parameters according to the parameter sensitivity, a gradient-based measure reflecting the contribution of the parameters. In this paper, however, we argue that redundant parameters can be trained to make beneficial contributions. We first highlight the large sensitivity (contribution) gap among high-sensitivity and low-sensitivity parameters and show that the model generalization performance can be significantly improved after balancing the contribution of all parameters. Our goal is to balance the sensitivity of all parameters and encourage all of them to contribute equally. We propose a general task-agnostic method, namely intra-distillation, appended to the regular training loss to balance parameter sensitivity. Moreover, we also design a novel adaptive learning method to control the strength of intra-distillation loss for faster convergence. Our experiments show the strong effectiveness of our methods on machine translation, natural language understanding, and zero-shot cross-lingual transfer across up to 48 languages, e.g., a gain of 3.54 BLEU on average across 8 language pairs from the IWSLT'14 dataset.", "track": "Machine Translation", "label": 10, "url": "https://www.semanticscholar.org/reader/190b53f18d238f56a5164ee152431afc2fd142c3?experiments=&features=reader_skimming%3Atrue"}, {"loc": [5.427731990814209, 5.067387104034424], "id": 449, "title": "Interpreting Language Models with Contrastive Explanations", "authors": "Kayo Yin and Graham Neubig", "abstract": "Model interpretability methods are often used to explain NLP model decisions on tasks such as text classification, where the output space is relatively small. However, when applied to language generation, where the output space often consists of tens of thousands of tokens, these methods are unable to provide informative explanations. \nLanguage models must consider various features to predict a token, such as its part of speech, number, tense, or semantics.\nExisting explanation methods conflate evidence for all these features into a single explanation, which is less interpretable for human understanding.\n\nTo disentangle the different decisions in language modeling, we focus on explaining language models contrastively: we look for salient input tokens that explain why the model predicted one token instead of another. We demonstrate that contrastive explanations are quantifiably better than non-contrastive explanations in verifying major grammatical phenomena, and that they significantly improve contrastive model simulatability for human observers. We also identify groups of contrastive decisions where the model uses similar evidence, and we are able to characterize what input tokens models use during various language generation decisions.", "track": "Interpretability, Interactivity and Analysis of Models for NLP", "label": 9, "url": "https://www.semanticscholar.org/reader/1ec16018e9152c50bbaed1d49c3077b9fb6d2838?experiments=&features=reader_skimming%3Atrue"}, {"loc": [5.9568190574646, 8.789165496826172], "id": 461, "title": "RankGen: Improving Text Generation with Large Ranking Models", "authors": "Kalpesh Krishna, Yapei Chang, John Wieting and Mohit Iyyer", "abstract": "Given an input sequence (or prefix), modern language models often assign high probabilities to output sequences that are repetitive, incoherent, or irrelevant to the prefix; as such, model-generated text also contains such artifacts. To address these issues we present RankGen, a 1.2B parameter encoder model for English that scores model generations given a prefix. RankGen can be flexibly incorporated as a scoring function in beam search and used to decode from any pretrained language model. We train RankGen using large-scale contrastive learning to map a prefix close to the ground-truth sequence that follows it and far away from two types of negatives: (1) random sequences from the same document as the prefix, and (2) sequences generated from a large language model conditioned on the prefix. Experiments across four different language models (345M-11B parameters) and two domains show that RankGen significantly outperforms decoding algorithms like nucleus, top-k, and typical sampling on both automatic metrics (85.0 vs 77.3 MAUVE) as well as human evaluations with English writers (74.5% human preference over nucleus sampling).  Analysis reveals that RankGen outputs are more relevant to the prefix and improve continuity and coherence compared to baselines. We release our model checkpoints, code, and human preference data with explanations to facilitate future research.", "track": "Natural Language Generation", "label": 6, "url": "https://www.semanticscholar.org/reader/23447f473cd240494b0a20ea008038aaef7e3391?experiments=&features=reader_skimming%3Atrue"}, {"loc": [5.709000587463379, 11.713682174682617], "id": 528, "title": "Learning a Grammar Inducer from Massive Uncurated Instructional Videos", "authors": "Songyang Zhang, Linfeng Song, Lifeng Jin, Haitao Mi, Kun Xu, Dong Yu and Jiebo Luo", "abstract": "Video-aided grammar induction aims to leverage video information for finding more accurate syntactic grammars for accompanying text. While previous work focuses on building systems for inducing grammars on text that are well-aligned with video content, we investigate the scenario, in which text and video are only in loose correspondence. Such data can be found in abundance online, and the weak correspondence is similar to the indeterminacy problem studied in language acquisition. Furthermore, we build a new model that can better learn video-span correlation without manually designed features adopted by previous work. Experiments show that our model trained only on large-scale YouTube data with no text-video alignment reports strong and robust performances across three unseen datasets, despite domain shift and noisy label issues. Furthermore our model yields higher F1 scores than the previous state-of-the-art systems trained on in-domain data.", "track": "Syntax, Parsing and their Applications", "label": 23, "url": "https://www.semanticscholar.org/reader/633cc9f824aafdf4f3c1c51fc4957a44a4936cc1?experiments=&features=reader_skimming%3Atrue"}, {"loc": [5.963115215301514, 11.924002647399902], "id": 538, "title": "Normalized Contrastive Learning for Text-Video Retrieval", "authors": "Yookoon Park, Mahmoud Azab, Seungwhan Moon, Bo Xiong, Florian Metze, Gourab Kundu and Kirmani Ahmed", "abstract": "Cross-modal contrastive learning has led the recent advances in multimodal retrieval with its simplicity and effectiveness. In this work, however, we reveal that cross-modal contrastive learning suffers from incorrect normalization of the sum retrieval probabilities of each text or video instance. Specifically, we show that many test instances are either over- or under-represented during retrieval, significantly hurting the retrieval performance. To address this problem, we propose Normalized Contrastive Learning (NCL) which utilizes the Sinkhorn-Knopp algorithm to compute the instance-wise biases that properly normalize the sum retrieval probabilities of each instance so that every text and video instance is fairly represented during cross-modal retrieval. Empirical study shows that NCL brings consistent and significant gains in text-video retrieval on different model architectures, with new state-of-the-art multimodal retrieval metrics on the ActivityNet, MSVD, and MSR-VTT datasets without any architecture engineering.", "track": "Speech, Vision, Robotics, Multimodal Grounding", "label": 7, "url": ""}, {"loc": [5.356980800628662, 7.513444423675537], "id": 567, "title": "Estimating Soft Labels for Out-of-Domain Intent Detection", "authors": "Hao Lang, Yinhe Zheng, Jian Sun, Fei Huang, Luo Si and Yongbin Li", "abstract": "Out-of-Domain (OOD) intent detection is important for practical dialog systems. To alleviate the issue of lacking OOD training samples, some works propose synthesizing pseudo OOD samples and directly assigning one-hot OOD labels to these pseudo samples. However, these one-hot labels introduce noises to the training process because some ``hard'' pseudo OOD samples may coincide with In-Domain (IND) intents. In this paper, we propose an adaptive soft pseudo labeling (ASoul) method that can estimate soft labels for pseudo OOD samples when training OOD detectors. Semantic connections between pseudo OOD samples and IND intents are captured using an embedding graph. A co-training framework is further introduced to produce resulting soft labels following the smoothness assumption, i.e., close samples are likely to have similar labels. Extensive experiments on three benchmark datasets show that ASoul consistently improves the OOD detection performance and outperforms various competitive baselines.", "track": "Dialogue and Interactive Systems", "label": 4, "url": "https://www.semanticscholar.org/reader/fa8d5b09c405416d6343261739ecb3862cac0d6b?experiments=&features=reader_skimming%3Atrue"}, {"loc": [5.092829704284668, 12.21367073059082], "id": 594, "title": "Multi-VQG: Generating Engaging Questions for Multiple Images", "authors": "Min-Hsuan Yeh, Vincent Foster Chen, Ting-Hao Kenneth Huang and Lun-Wei Ku", "abstract": "Generating engaging content has drawn much recent attention in the NLP community. Asking questions is a natural way to respond to photos and promote awareness. However, most answers to questions in traditional question-answering (QA) datasets are factoids, which reduce individuals' willingness to answer. Furthermore, traditional visual question generation (VQG) confines the source data for question generation to single images, resulting in a limited ability to comprehend time-series information of the underlying event. In this paper, we propose generating engaging questions from multiple images. We present MVQG, a new dataset, and establish a series of baselines, including both end-to-end and dual-stage architectures. Results show that building stories behind the image sequence enables models to\ngenerate engaging questions, which confirms our assumption that people typically construct a picture of the event in their minds before asking questions. These results open up an exciting challenge for visual-and-language models to implicitly construct a story behind a series of photos to allow for creativity and experience sharing and hence draw attention to downstream applications.", "track": "Resources and Evaluation", "label": 1, "url": ""}, {"loc": [3.361759901046753, 4.537327289581299], "id": 615, "title": "Tomayto, Tomahto. Beyond Token-level Answer Equivalence for Question Answering Evaluation", "authors": "Jannis Bulian, Christian Buck, Wojciech Gajewski, Benjamin B\u00f6rschinger and Tal Schuster", "abstract": "The predictions of question answering (QA) systems are typically evaluated against manually annotated finite sets of one or more answers. This leads to a coverage limitation that results in underestimating the true performance of systems, and is typically addressed by extending over exact match (EM) with predefined rules or with the token-level F1 measure.\nIn this paper, we present the first systematic conceptual and data-driven analysis to examine the shortcomings of token-level equivalence measures.\n\nTo this end, we define the asymmetric notion of answer equivalence (AE), accepting answers that are equivalent to or improve over the reference, and publish over 23k human judgements for candidates produced by multiple QA systems on SQuAD.\n\nThrough a careful analysis of this data, we reveal and quantify several concrete limitations of the F1 measure, such as a false impression of graduality, or missing dependence on the question.\n\nSince collecting AE annotations for each evaluated model is expensive, we learn a BERT matching (BEM) measure to approximate this task. Being a simpler task than QA, we find BEM to provide significantly better AE approximations than F1, and to more accurately reflect the performance of systems.\n\nFinally, we demonstrate the practical utility of AE and BEM on the concrete application of minimal accurate prediction sets, reducing the number of required answers by up to X2.6.", "track": "Resources and Evaluation", "label": 1, "url": "https://www.semanticscholar.org/reader/8324cc3fb32246f57d18ea8f81eaeae50de60079?experiments=&features=reader_skimming%3Atrue"}, {"loc": [10.201896667480469, 7.435024738311768], "id": 633, "title": "Non-Parametric Domain Adaptation for End-to-End Speech Translation", "authors": "Yichao Du, Weizhi Wang, Zhirui Zhang, Boxing Chen, Tong Xu, Jun Xie and Enhong Chen", "abstract": "The end-to-end speech translation (E2E-ST) has received increasing attention due to the potential of its less error propagation, lower latency and fewer parameters. However, the effectiveness of neural-based approaches to this task is severely limited by the available training corpus, especially for domain adaptation where in-domain triplet data is scarce or nonexistent. In this paper, we propose a novel non-parametric method that leverages in-domain text translation corpus to achieve domain adaptation for E2E-ST systems. To this end, we first incorporate an additional encoder into the pre-trained E2E-ST model to realize text translation modeling, based on which the decoder's output representations for text and speech translation tasks are unified by reducing the correspondent representation mismatch in available triplet training data. During domain adaptation, a k-nearest-neighbor (kNN) classifier is introduced to produce the final translation distribution using the external datastore built by the domain-specific text translation corpus, while the universal output representation is adopted to perform a similarity search. Experiments on the Europarl-ST benchmark demonstrate that when in-domain text translation data is involved only, our proposed approach significantly improves baseline by 12.82 BLEU on average in all translation directions, even outperforming the strong in-domain fine-tuning strategy.", "track": "Machine Translation", "label": 10, "url": ""}, {"loc": [7.496976852416992, 12.38073444366455], "id": 669, "title": "Prompting for Multimodal Hateful Meme Classification", "authors": "Rui Cao, Roy Ka-Wei Lee, Wen-Haw Chong and Jing Jiang", "abstract": "Hateful meme classification is a challenging multimodal task that requires complex reasoning and contextual background knowledge. Ideally, we could leverage an explicit external knowledge base to supplement contextual and cultural information in hateful memes. However, there is no known explicit external knowledge base that could provide such hate speech contextual information. To address this gap, we propose PromptHate, a simple yet effective prompt-based model that prompts pre-trained language models (PLMs) for hateful meme classification. Specifically, we construct simple prompts and provide a few in-context examples to exploit the implicit knowledge in the pre-trained RoBERTa language model for hateful meme classification. We conduct extensive experiments on two publicly available hateful and offensive meme datasets. Our experiment results show that PromptHate is able to achieve a high AUC of 90.96, outperforming state-of-the-art baselines on the hateful meme classification task. We also perform fine-grain analyses and case studies on various prompt settings and demonstrate the effectiveness of the prompts on hateful meme classification.", "track": "Computational Social Science and Cultural Analytics", "label": 20, "url": ""}, {"loc": [1.8098297119140625, 3.895242929458618], "id": 675, "title": "Certified Error Control of Candidate Set Pruning for Two-Stage Relevance Ranking", "authors": "Minghan Li, Xinyu Zhang, Ji Xin, Hongyang Zhang and Jimmy Lin", "abstract": "In information retrieval (IR), candidate set pruning has been commonly used to speed up two-stage relevance ranking. However, such an approach lacks accurate error control and often trades accuracy against computational efficiency in an empirical fashion, missing theoretical guarantees. In this paper, we propose the concept of certified error control of candidate set pruning for relevance ranking, which means that the test error after pruning is guaranteed to be controlled under a user-specified threshold with high probability. Both in-domain and out-of-domain experiments show that our method successfully prunes the first-stage retrieved candidate sets to improve the second-stage reranking speed while satisfying the pre-specified accuracy constraints in both settings. For example, on MS MARCO Passage v1, our method reduces the average candidate set size from 1000 to 27, increasing reranking speed by about 37 times, while keeping MRR@10 greater than a pre-specified value of 0.38 with about 90% empirical coverage. In contrast, empirical baselines fail to meet such requirements. Code and data are available at: https://github.com/alexlimh/CEC-Ranking.", "track": "Information Retrieval and Text Mining", "label": 15, "url": "https://www.semanticscholar.org/reader/0c430ea48e37ff43d3ab373ea1441468aa923653?experiments=&features=reader_skimming%3Atrue"}, {"loc": [9.630433082580566, 8.070455551147461], "id": 686, "title": "Linearizing Transformer with Key-Value Memory", "authors": "Yizhe Zhang and Deng Cai", "abstract": "Efficient transformer variants with linear time complexity have been developed to mitigate the quadratic computational overhead of the vanilla transformer. Among them are low-rank projection methods such as Linformer and kernel-based Transformers. Despite their unique merits, they usually suffer from a performance drop comparing with the vanilla transformer on many sequence generation tasks, and often fail to obtain computation gain when the generation is short. We propose Memsizer, an approach towards closing the performance gap while improving the efficiency even with short generation. It projects the source sequences into lower dimension representations like Linformer, while enjoying efficient recurrent-style incremental computation similar to kernel-based transformers. This yields linear computation time and constant memory complexity at inference time. Memsizer also employs a lightweight multi-head mechanism which renders the computation as light as a single-head model. We demonstrate that Memsizer provides an improved balance between efficiency and accuracy over the vanilla transformer and other efficient transformer variants in three typical sequence generation tasks, including machine translation, abstractive text summarization, and language modeling.", "track": "Natural Language Generation", "label": 6, "url": "https://www.semanticscholar.org/reader/365d0313908871118df59c469c4db10f4e1b96bd?experiments=&features=reader_skimming%3Atrue"}, {"loc": [6.293059825897217, 12.311273574829102], "id": 689, "title": "Robustness of Fusion-based Multimodal Classifiers to Cross-Modal Content Dilutions", "authors": "Gaurav Verma, Vishwa Vinay, Ryan Rossi and Srijan Kumar", "abstract": "As multimodal learning finds applications in a wide variety of high-stakes societal tasks, investigating their robustness becomes important. Existing work has focused on understanding the robustness of vision-and-language models to imperceptible variations on benchmark tasks. In this work, we investigate the robustness of multimodal classifiers to cross-modal dilutions \u2013 a plausible variation. We develop a model that, given a multimodal (image + text) input, generates additional dilution text that (a) maintains relevance and topical coherence with the image and existing text, and (b) when added to the original text, leads to misclassification of the multimodal input. Via experiments on Crisis Humanitarianism and Sentiment Detection tasks, we find that the performance of task-specific fusion-based multimodal classifiers drops by 23.3% and 22.5%, respectively, in the presence of dilutions generated by our model. Metric-based comparisons with several baselines and human evaluations indicate that our dilutions show higher relevance and topical coherence, while simultaneously being more effective at demonstrating the brittleness of the multimodal classifiers. Our work aims to highlight and encourage further research on the robustness of deep multimodal models to realistic variations, especially in human-facing societal applications.", "track": "Speech, Vision, Robotics, Multimodal Grounding", "label": 7, "url": "https://www.semanticscholar.org/reader/cafb98bf7b40acd5e9599120b151aa24594cb90e?experiments=&features=reader_skimming%3Atrue"}, {"loc": [5.207403659820557, 11.77302360534668], "id": 698, "title": "Translation between Molecules and Natural Language", "authors": "Carl Edwards, Tuan M. Lai, Kevin Ros, Garrett Honke, Kyunghyun Cho and Heng Ji", "abstract": "We present MolT5 - a self-supervised learning framework for pretraining models on a vast amount of unlabeled natural language text and molecule strings. MolT5 allows for new, useful, and challenging analogs of traditional vision-language tasks, such as molecule captioning and text-based de novo molecule generation (altogether: translation between molecules and language), which we explore for the first time. Since MolT5 pretrains models on single-modal data, it helps overcome the chemistry domain shortcoming of data scarcity. Furthermore, we consider several metrics, including a new cross-modal embedding-based metric, to evaluate the tasks of molecule captioning and text-based molecule generation. Our results show that MolT5-based models are able to generate outputs, both molecules and captions, which in many cases are high quality.", "track": "NLP Applications", "label": 0, "url": "https://www.semanticscholar.org/reader/3b9b1aba877ecd3f7e508cbc78a41b623349902b?experiments=&features=reader_skimming%3Atrue"}, {"loc": [7.785195827484131, 8.157483100891113], "id": 701, "title": "What Makes Instruction Learning Hard? An Investigation and a New Challenge in a Synthetic Environment", "authors": "Matthew Finlayson, Kyle Richardson, Ashish Sabharwal and Peter Clark", "abstract": "The instruction learning paradigm---where a model learns to perform new tasks from task descriptions alone---has become popular in research on general-purpose models. The capabilities of large transformer models as instruction learners, however, remain poorly understood. We use a controlled synthetic environment to characterize such capabilities. Specifically, we use the task of deciding whether a given string matches a regular expression (viewed as an instruction) to identify properties of tasks, instructions, and instances that make instruction learning challenging. For instance, we find that our model, a fine-tuned T5-based text2text transformer, struggles with large regular languages, suggesting that less precise instructions are challenging for models. Instruction executions that require tracking longer contexts of prior steps are also difficult. We use our findings to systematically construct a challenging instruction learning dataset, which we call Hard RegSet. Fine-tuning on Hard RegSet, our large transformer learns to correctly interpret (with at least 90\\% accuracy) only 65.6\\% of test instructions, and 11\\%-24\\% of the instructions in out-of-distribution generalization settings. We thus propose Hard RegSet as a challenging instruction learning dataset, and a controlled environment for studying instruction learning.", "track": "Language Modeling and Analysis of Language Models", "label": 2, "url": "https://www.semanticscholar.org/reader/cb16b85891172572cd856142880b503db0c2bc61?experiments=&features=reader_skimming%3Atrue"}, {"loc": [2.3501217365264893, 7.850691318511963], "id": 702, "title": "Sentence-Incremental Neural Coreference Resolution", "authors": "Matt Grenander, Shay B. Cohen and Mark Steedman", "abstract": "We propose a sentence-incremental neural coreference resolution system which incrementally builds clusters after marking mention boundaries in a shift-reduce method. The system is aimed at bridging two recent approaches at coreference resolution: (1) state-of-the-art non-incremental models that incur quadratic complexity in document length with high computational cost, and (2) memory network-based models which operate incrementally but do not generalize beyond pronouns. For comparison, we simulate an incremental setting by constraining non-incremental systems to form partial coreference chains before observing new sentences. In this setting, our system outperforms comparable state-of-the-art methods by 2 F1 on OntoNotes and 6.8 F1 on the CODI-CRAC 2021 corpus. In a conventional coreference setup, our system achieves 76.3 F1 on OntoNotes and 45.5 F1 on CODI-CRAC 2021, which is comparable to state-of-the-art baselines. We also analyze variations of our system and show that the degree of incrementality in the encoder has a surprisingly large effect on the resulting performance.", "track": "Discourse and Pragmatics", "label": 24, "url": ""}, {"loc": [3.921996593475342, 9.257647514343262], "id": 735, "title": "SNaC: Coherence Error Detection for Narrative Summarization", "authors": "Tanya Goyal, Junyi Jessy Li and Greg Durrett", "abstract": "Progress in summarizing long texts is inhibited by the lack of appropriate evaluation frameworks. A long summary that appropriately covers the facets of that text must also present a coherent narrative, but current automatic and human evaluation methods fail to identify gaps in coherence. In this work, we introduce SNaC, a narrative coherence evaluation framework for fine-grained annotations of long summaries. We develop a taxonomy of coherence errors in generated narrative summaries and collect span-level annotations for 6.6k sentences across 150 book and movie summaries. Our work provides the first characterization of coherence errors generated by state-of-the-art summarization models and a protocol for eliciting coherence judgments from crowdworkers. Furthermore, we show that the collected annotations allow us to benchmark past work in coherence modeling and train a strong classifier for automatically localizing coherence errors in generated summaries. Finally, our SNaC framework can support future work in long document summarization and coherence evaluation, including improved summarization modeling and post-hoc summary correction.", "track": "Summarization", "label": 14, "url": ""}, {"loc": [3.8970723152160645, 9.954273223876953], "id": 737, "title": "HydraSum: Disentangling Style Features in Text Summarization with Multi-Decoder Models", "authors": "Tanya Goyal, Nazneen Rajani, Wenhao Liu and Wojciech Kryscinski", "abstract": "Summarization systems make numerous ``decisions'' about summary properties during inference, e.g. degree of copying, specificity and length of outputs, etc. However, these are implicitly encoded within model parameters and specific styles cannot be enforced. To address this, we introduce HydraSum, a new summarization architecture that extends the single decoder framework of current models to a mixture-of-experts version with multiple decoders. We show that HydraSum's multiple decoders automatically learn contrasting summary styles when trained under the standard training objective without any extra supervision. Through experiments on three summarization datasets (CNN, Newsroom and XSum), we show that HydraSum provides a simple mechanism to obtain stylistically-diverse summaries by sampling from either individual decoders or their mixtures, outperforming baseline models. Finally, we demonstrate that a small modification to the gating strategy during training can  enforce an even stricter style partitioning, e.g. high- vs low-abstractiveness or high- vs low-specificity, allowing users to sample from a larger area in the generation space and vary summary styles along multiple dimensions.", "track": "Summarization", "label": 14, "url": ""}, {"loc": [0.58744215965271, 7.263391017913818], "id": 776, "title": "A Good Neighbor, A Found Treasure: Mining Treasured Neighbors for Knowledge Graph Entity Typing", "authors": "Zhuoran Jin, Pengfei Cao, Yubo Chen, Kang Liu and Jun Zhao", "abstract": "The task of knowledge graph entity typing (KGET) aims to infer the missing types for entities in knowledge graphs. Some pioneering work has proved that neighbor information is very important for the task. However, existing methods only leverage the one-hop neighbor information of the central entity, ignoring the multi-hop neighbor information that can provide valuable clues for inference. Besides, we also observe that there are co-occurrence relations between types, which is very helpful to alleviate false-negative problem. In this paper, we propose a novel method called Mining Treasured Neighbors (MiNer) to make use of these two characteristics. Firstly, we devise a Neighbor Information Aggregation module to aggregate the neighbor information. Then, we propose an Entity Type Inference module to mitigate the adverse impact of the irrelevant neighbor information. Finally, a Type Co-occurrence Regularization module is designed to prevent the model from overfitting the false negative examples caused by missing types. Experimental results on two widely used datasets indicate that our approach significantly outperforms previous state-of-the-art methods.", "track": "Information Extraction", "label": 5, "url": ""}, {"loc": [0.4618845283985138, 7.0692243576049805], "id": 781, "title": "Guiding Neural Entity Alignment with Compatibility", "authors": "Bing Liu, Harrisen Scells, Wen Hua, Guido Zuccon, Genghong Zhao and Xia Zhang", "abstract": "Entity Alignment (EA) aims to find equivalent entities between two Knowledge Graphs (KGs). While numerous neural EA models have been devised, they are mainly learned using labelled data only. In this work, we argue that different entities within one KG should have compatible counterparts in the other KG due to the potential dependencies among the entities. Making compatible predictions thus should be one of the goals of training an EA model along with fitting the labelled data: this aspect however is neglected in current methods. To power neural EA models with compatibility, we devise a training framework by addressing three problems: (1) how to measure the compatibility of an EA model; (2) how to inject the property of being compatible into an EA model; (3) how to optimise parameters of the compatibility model. Extensive experiments on widely-used datasets demonstrate the advantages of integrating compatibility within EA models. In fact, state-of-the-art neural EA models trained within our framework using just 5% of the labelled data can achieve comparable effectiveness with supervised training using 20% of the labelled data.", "track": "NLP Applications", "label": 0, "url": ""}, {"loc": [4.35542106628418, 7.514373779296875], "id": 790, "title": "InstructDial: Improving Zero and Few-shot Generalization in Dialogue through Instruction Tuning", "authors": "Prakhar Gupta, Cathy Jiao, Yi-Ting Yeh, Shikib Mehri, Maxine Eskenazi and Jeffrey P. Bigham", "abstract": "Instruction tuning is an emergent paradigm in NLP wherein natural language instructions are leveraged with language models to induce zero-shot performance on unseen tasks. Dialogue is an especially interesting area in which to explore instruction tuning because dialogue systems perform multiple kinds of tasks related to language (e.g., natural language understanding and generation, domain-specific interaction), yet instruction tuning has not been systematically explored for dialogue-related tasks. We introduce InstructDial, an instruction tuning framework for dialogue, which consists of a repository of 48 diverse dialogue tasks in a unified text-to-text format created from 59 openly available dialogue datasets. We explore cross-task generalization ability on models tuned on InstructDial across diverse dialogue tasks. Our analysis reveals that InstructDial enables good zero-shot performance on unseen datasets and tasks such as dialogue evaluation and intent detection, and even better performance in a few-shot setting. To ensure that models adhere to instructions, we introduce novel meta-tasks. We establish benchmark zero-shot and few-shot performance of models trained using the proposed framework on multiple dialogue tasks.", "track": "Dialogue and Interactive Systems", "label": 4, "url": "https://www.semanticscholar.org/reader/8f926c0c3f1557a9241b7e75609082a1f207a75e?experiments=&features=reader_skimming%3Atrue"}, {"loc": [8.592419624328613, 6.591548442840576], "id": 792, "title": "Unsupervised Boundary-Aware Language Model Pretraining for Chinese Sequence Labeling", "authors": "Peijie Jiang, Dingkun Long, Yanzhao Zhang, Pengjun Xie, Meishan Zhang and Min Zhang", "abstract": "Boundary information is critical for various Chinese language processing tasks, such as word segmentation, part-of-speech tagging, and named entity recognition. Previous studies usually resorted to the use of a high-quality external lexicon, where lexicon items can offer explicit boundary information. However, to ensure the quality of the lexicon, great human effort is always necessary, which has been generally ignored. In this work, we suggest unsupervised statistical boundary information instead, and propose an architecture to encode the information directly into pre-trained language models, resulting in Boundary-Aware BERT (BABERT). We apply BABERT for feature induction of Chinese sequence labeling tasks. Experimental results on ten benchmarks of Chinese sequence labeling demonstrate that BABERT can provide consistent improvements on all datasets. In addition, our method can complement previous supervised lexicon exploration, where further improvements can be achieved when integrated with external lexicon information.", "track": "Phonology, Morphology and Word Segmentation", "label": 25, "url": "https://www.semanticscholar.org/reader/beb40cc99a6ab931aa8ea1758c1a0397ecd32847?experiments=&features=reader_skimming%3Atrue"}, {"loc": [1.8531019687652588, 3.931609869003296], "id": 862, "title": "RetroMAE: Pre-Training Retrieval-oriented Language Models Via Masked Auto-Encoder", "authors": "Shitao Xiao, Zheng Liu, Yingxia Shao and Zhao Cao", "abstract": "Despite pre-training's progress in many important NLP tasks, it remains to explore effective pre-training strategies for dense retrieval. In this paper, we propose RetroMAE, a new retrieval oriented pre-training paradigm based on Masked Auto-Encoder (MAE). RetroMAE is highlighted by three critical designs. 1) A novel MAE workflow, where the input sentence is polluted for encoder and decoder with different masks. The sentence embedding is generated from the encoder's masked input; then, the original sentence is recovered based on the sentence embedding and the decoder's masked input via masked language modeling. 2) Asymmetric model structure, with a full-scale BERT like transformer as encoder, and a one-layer transformer as decoder. 3) Asymmetric masking ratios, with a moderate ratio for encoder: 15~30%, and an aggressive ratio for decoder: 50~70%. Our framework is simple to realize and empirically competitive: the pre-trained models dramatically improve the SOTA performances on a wide range of dense retrieval benchmarks, like BEIR and MS MARCO. The source code and pre-trained models are made publicly available at https://github.com/staoxiao/RetroMAE so as to inspire more interesting research.", "track": "Information Retrieval and Text Mining", "label": 15, "url": "https://www.semanticscholar.org/reader/103ffc0879fbed73e7a51b52268fb6744fe0c284?experiments=&features=reader_skimming%3Atrue"}, {"loc": [3.091543436050415, 6.207213401794434], "id": 865, "title": "Aligning Recommendation and Conversation via Dual Imitation", "authors": "Jinfeng Zhou, Bo Wang, Minlie Huang, Dongming Zhao, Kun Huang, Ruifang He and Yuexian Hou", "abstract": "Human conversations of recommendation naturally involve the shift of interests which can align the recommendation actions and conversation process to make accurate recommendations with rich explanations. However, existing conversational recommendation systems (CRS) ignore the advantage of user interest shift in connecting recommendation and conversation, which leads to an ineffective loose coupling structure of CRS. To address this issue, by modeling the recommendation actions as recommendation paths in a knowledge graph (KG), we propose DICR (\\textbf{D}ual \\textbf{I}mitation for \\textbf{C}onversational \\textbf{R}ecommendation), which designs a dual imitation to explicitly align the recommendation paths and user interest shift paths in a recommendation module and a conversation module, respectively. By exchanging alignment signals, DICR achieves bidirectional promotion between recommendation and conversation modules and generates high-quality responses with accurate recommendations and coherent explanations. Experiments demonstrate that DICR outperforms the state-of-the-art models on recommendation and conversation performance with automatic, human, and novel explainability metrics.", "track": "Dialogue and Interactive Systems", "label": 4, "url": "https://www.semanticscholar.org/reader/5b1a4ad14662be9e48e3b4cf67a4b43adbe9eee1?experiments=&features=reader_skimming%3Atrue"}, {"loc": [3.0356905460357666, 4.634920120239258], "id": 888, "title": "QRelScore: Better Evaluating Generated Questions with Deeper Understanding of Context-aware Relevance", "authors": "Xiaoqiang Wang, Bang Liu, Siliang Tang and Lingfei Wu", "abstract": "Existing metrics for assessing question generation not only require costly human reference but also fail to take into account the input context of generation, rendering the lack of deep understanding of the relevance between the generated questions and input contexts. As a result, they may wrongly penalize a legitimate and reasonable candidate question when it (1) involves complicated reasoning with the context or (2) can be grounded by multiple evidences in the context.\nIn this paper, we propose QRelScore, a context-aware Relevance evaluation metric for Question Generation.\nBased on off-the-shelf language models such as BERT and GPT2, QRelScore employs both word-level hierarchical matching and sentence-level prompt-based generation to cope with the complicated reasoning and diverse generation from multiple evidences, respectively.\nCompared with existing metrics, our experiments demonstrate that QRelScore is able to achieve a higher correlation with human judgments while being much more robust to adversarial samples.", "track": "Resources and Evaluation", "label": 1, "url": "https://www.semanticscholar.org/reader/e6f44759d5d03d7018319d507ee5ac19485596a5?experiments=&features=reader_skimming%3Atrue"}, {"loc": [5.2229228019714355, 12.128870964050293], "id": 929, "title": "Abstract Visual Reasoning with Tangram Shapes", "authors": "Anya Ji, Noriyuki Kojima, Noah J. Rush, Alane Suhr, Wai Keen Vong, Robert Hawkins and Yoav Artzi", "abstract": "We introduce KiloGram, a resource for studying abstract visual reasoning in humans and machines. Drawing on the history of tangram puzzles as stimuli in cognitive science, we build a richly annotated dataset that, with >1k distinct stimuli, is orders of magnitude larger and more diverse than prior resources. It is both visually and linguistically richer, moving beyond whole shape descriptions to include segmentation maps and part labels. We use this resource to evaluate the abstract visual reasoning capacities of recent multi-modal models. We observe that pre-trained weights demonstrate limited abstract reasoning, which dramatically improves with fine-tuning. We also observe that explicitly describing parts aids abstract reasoning for both humans and models, especially when jointly encoding the linguistic and visual inputs.", "track": "Speech, Vision, Robotics, Multimodal Grounding", "label": 7, "url": ""}, {"loc": [1.7461912631988525, 5.390502452850342], "id": 939, "title": "UnifiedSKG: Unifying and Multi-Tasking Structured Knowledge Grounding with Text-to-Text Language Models", "authors": "Tianbao Xie, Chen Henry Wu, Peng Shi, Ruiqi Zhong, Torsten Scholak, Michihiro Yasunaga, Chien-Sheng Wu, Ming Zhong, Pengcheng Yin, Sida I. Wang, Victor Zhong, Bailin Wang, Chengzu Li, Connor Boyle, Ansong Ni, Ziyu Yao, Dragomir Radev, Caiming Xiong, Lingpeng Kong, Rui Zhang, Noah A. Smith, Luke Zettlemoyer and Tao Yu", "abstract": "Structured knowledge grounding (SKG) leverages structured knowledge to complete user requests, such as semantic parsing over databases and question answering over knowledge bases. Since the inputs and outputs of SKG tasks are heterogeneous, they have been studied separately by different communities, which limits systematic and compatible research on SKG. In this paper, we overcome this limitation by proposing the UnifiedSKG framework, which unifies 21 SKG tasks into a text-to-text format, aiming to promote systematic SKG research, instead of being exclusive to a single task, domain, or dataset. We use UnifiedSKG to benchmark T5 with different sizes and show that T5, with simple modifications when necessary, achieves state-of-the-art performance on almost all of the 21 tasks. We further demonstrate that multi-task prefix-tuning improves the performance on most tasks, largely improving the overall performance. UnifiedSKG also facilitates the investigation of zero-shot and few-shot learning, and we show that T0, GPT-3, and Codex struggle in zero-shot and few-shot learning for SKG. We also use UnifiedSKG to conduct a series of controlled experiments on structured knowledge encoding variants across SKG tasks. UnifiedSKG is easily extensible to more tasks, and it is open-sourced at https://github.com/hkunlp/unifiedskg.", "track": "Semantics: Lexical, Sentence level, Textual Inference and Other areas", "label": 8, "url": "https://www.semanticscholar.org/reader/53c0abe83fe9b4fdaf2208295d8504fcf5241694?experiments=&features=reader_skimming%3Atrue"}, {"loc": [7.533488750457764, 3.741511344909668], "id": 987, "title": "Balanced Adversarial Training: Balancing Tradeoffs between Fickleness and Obstinacy in NLP Models", "authors": "Hannah Chen, Yangfeng Ji and David Evans", "abstract": "Traditional (fickle) adversarial examples involve finding a small perturbation that does not change an input's true label but confuses the classifier into outputting a different prediction. Conversely, obstinate adversarial examples occur when an adversary finds a small perturbation that preserves the classifier's prediction but changes the true label of an input.\nAdversarial training and certified robust training have shown some effectiveness in improving the robustness of machine learnt models to fickle adversarial examples. We show that standard adversarial training methods focused on reducing vulnerability to fickle adversarial examples may make a model more vulnerable to obstinate adversarial examples, with experiments for both natural language inference and paraphrase identification tasks. To counter this phenomenon, we introduce Balanced Adversarial Training, which incorporates contrastive learning to increase robustness against both fickle and obstinate adversarial examples.", "track": "Interpretability, Interactivity and Analysis of Models for NLP", "label": 9, "url": ""}, {"loc": [7.382798671722412, 7.218418598175049], "id": 991, "title": "When Can Transformers Ground and Compose: Insights from Compositional Generalization Benchmarks", "authors": "Ankur Sikarwar, Arkil Patel and Navin Goyal", "abstract": "Humans can reason compositionally whilst grounding language utterances to the real world. Recent benchmarks like ReaSCAN (Wu et al., 2021) use navigation tasks grounded in a grid world to assess whether neural models exhibit similar capabilities. In this work, we present a simple transformer-based model that outperforms specialized architectures on ReaSCAN and a modified version (Qiu et al., 2021) of gSCAN (Ruis et al., 2020). On analyzing the task, we find that identifying the target location in the grid world is the main challenge for the models. Furthermore, we show that a particular split in ReaSCAN, which tests depth generalization, is unfair. On an amended version of this split, we show that transformers can generalize to deeper input structures. Finally, we design a simpler grounded compositional generalization task, RefEx, to investigate how transformers reason compositionally. We show that a single self-attention layer with a single head generalizes to novel combinations of object attributes. Moreover, we derive a precise mathematical construction of the transformer's computations from the learned network. Overall, we provide valuable insights about the grounded compositional generalization task and the behaviour of transformers on it, which would be useful for researchers working in this area.", "track": "Machine Learning for NLP", "label": 3, "url": ""}, {"loc": [3.014382839202881, 4.7776079177856445], "id": 1002, "title": "Generative Language Models for Paragraph-Level Question Generation", "authors": "Asahi Ushio, Fernando Alva-Manchego and Jose Camacho-Collados", "abstract": "Powerful generative models have led to recent progress in question generation (QG). However, it is difficult to measure advances in QG research since there are no standardized resources that allow a uniform comparison among approaches. In this paper, we introduce QG-Bench, a multilingual and multidomain benchmark for QG that unifies existing question answering datasets by converting them to a standard QG setting. It includes general-purpose datasets such as SQuAD for English, datasets from ten domains and two styles, as well as datasets in eight different languages. Using QG-Bench as a reference, we perform an extensive analysis of the capabilities of language models for the task. First, we propose robust QG baselines based on fine-tuning generative language models. Then, we complement automatic evaluation based on standard metrics with an extensive manual evaluation, which in turn sheds light on the difficulty of evaluating QG models. Finally, we analyse both the domain adaptability of these models as well as the effectiveness of multilingual models in languages other than English.\nQG-Bench is released along with the fine-tuned models presented in the paper (https://github.com/asahi417/lm-question-generation), which are also available as a demo (https://autoqg.net/).", "track": "Resources and Evaluation", "label": 1, "url": "https://www.semanticscholar.org/reader/78779ea16396df37563c965d559460e29b22cc40?experiments=&features=reader_skimming%3Atrue"}, {"loc": [6.033627510070801, 8.440853118896484], "id": 1008, "title": "A Unified Encoder-Decoder Framework with Entity Memory", "authors": "Zhihan Zhang, Wenhao Yu, Chenguang Zhu and Meng Jiang", "abstract": "Entities, as important carriers of real-world knowledge, play a key role in many NLP tasks.\nWe focus on incorporating entity knowledge into an encoder-decoder framework for informative text generation. Existing approaches tried to index, retrieve, and read external documents as evidence, but they suffered from a large computational overhead. In this work, we propose an encoder-decoder framework with an entity memory, namely EDMem. The entity knowledge is stored in the memory as latent representations, and the memory is pre-trained on Wikipedia along with encoder-decoder parameters. To precisely generate entity names, we design three decoding methods to constrain entity generation by linking entities in the memory. EDMem is a unified framework that can be used on various entity-intensive question answering and generation tasks. Extensive experimental results show that EDMem outperforms both memory-based auto-encoder models and non-memory encoder-decoder models.", "track": "Natural Language Generation", "label": 6, "url": "https://www.semanticscholar.org/reader/7c9a7e6e34f6f6b9e1be36b59f01ac3dcbb275fc?experiments=&features=reader_skimming%3Atrue"}, {"loc": [7.889179706573486, 3.405285596847534], "id": 1010, "title": "Segmenting Numerical Substitution Ciphers", "authors": "Nada Aldarrab and Jonathan May", "abstract": "Deciphering historical substitution ciphers is a challenging problem. Example problems that have been previously studied include detecting cipher type, detecting plaintext language, and acquiring the substitution key for segmented ciphers. However, attacking unsegmented ciphers is still a challenging task. Segmentation (i.e. finding substitution units) is essential for cracking those ciphers. In this work, we propose the first automatic methods to segment those ciphers using Byte Pair Encoding (BPE) and unigram language models. Our methods achieve an average segmentation error of 2\\% on 100 randomly-generated monoalphabetic ciphers and 27\\% on 3 real historical homophonic ciphers. We also propose a method for solving non-deterministic ciphers with existing keys using a lattice and a pretrained language model. Our method leads to the full solution of the IA cipher; a real historical cipher that has not been fully solved until this work.", "track": "NLP Applications", "label": 0, "url": "https://www.semanticscholar.org/reader/16c9eea3abc67873de0c59ba106f7db92bd36f8c?experiments=&features=reader_skimming%3Atrue"}, {"loc": [6.120254039764404, 12.40794563293457], "id": 1034, "title": "Crossmodal-3600: A Massively Multilingual Multimodal Evaluation Dataset", "authors": "Ashish V. Thapliyal, Jordi Pont Tuset, Xi Chen and Radu Soricut", "abstract": "Research in massively multilingual image captioning has been severely hampered by a lack of high-quality evaluation datasets. In this paper we present the Crossmodal-3600 dataset (XM3600 in short), a geographically diverse set of 3600 images annotated with human-generated reference captions in 36 languages. The images were selected from across the world, covering regions where the 36 languages are spoken, and annotated with captions that achieve consistency in terms of style across all languages, while avoiding annotation artifacts due to direct translation. We apply this benchmark to model selection for massively multilingual image captioning models, and show superior correlation results with human evaluations when using XM3600 as golden references for automatic metrics.", "track": "Multilinguality", "label": 13, "url": "https://www.semanticscholar.org/reader/a8260077135246476a0b0601495ef08e56c21a50?experiments=&features=reader_skimming%3Atrue"}, {"loc": [0.6602703332901001, 7.840590953826904], "id": 1035, "title": "ReSel: N-ary Relation Extraction from Scientific Text and Tables by Learning to Retrieve and Select", "authors": "Yuchen Zhuang, Yinghao Li, Junyang Zhang, Yue Yu, Yingjun Mou, Xiang Chen, Le Song and Chao Zhang", "abstract": "We study the problem of extracting N-ary relation tuples from scientific articles. This task is challenging because the target knowledge tuples can reside in multiple parts and modalities of the document. Our proposed method ReSel decomposes this task into a two-stage procedure that first retrieves the most relevant paragraph/table and then selects the target entity from the retrieved component. For the high-level retrieval stage, ReSel designs a simple and effective feature set, which captures multi-level lexical and semantic similarities between the query and components. For the low-level selection stage, ReSel designs a cross-modal entity correlation graph along with  a multi-view architecture, which models both semantic and document-structural relations between entities. Our experiments on three scientific information extraction datasets show that ReSel outperforms state-of-the-art baselines significantly.", "track": "Information Extraction", "label": 5, "url": "https://www.semanticscholar.org/reader/5f5cb6a74f6971f022d6c8b3b70146f28b606ad1?experiments=&features=reader_skimming%3Atrue"}, {"loc": [0.5032818913459778, 7.0611138343811035], "id": 1079, "title": "GammaE: Gamma Embeddings for Logical Queries on Knowledge Graphs", "authors": "Dong Yang, QING PEIJUN, Yang Li, Haonan Lu and xiaodong lin", "abstract": "Embedding knowledge graphs (KGs) for multi-hop logical reasoning is a challenging problem due to massive and complicated structures in many KGs. Recently, many promising works projected entities and queries into a geometric space to efficiently find answers. However, it remains challenging to model the negation and union operator. The negation operator has no strict boundaries, which generates overlapped embeddings and leads to obtaining ambiguous answers. An additional limitation is that the union operator is non-closure, which undermines the model to handle a series of union operators. To address these problems, we propose a novel probabilistic embedding model, namely Gamma Embeddings (GammaE), for encoding entities and queries to answer different types of FOL queries on KGs. We utilize the linear property and strong boundary support of the Gamma distribution to capture more features of entities and queries, which dramatically reduces model uncertainty. Furthermore, GammaE implements the Gamma mixture method to design the closed union operator. The performance of GammaE is validated on three large logical query datasets. Experimental results show that GammaE significantly outperforms state-of-the-art models on public benchmarks.", "track": "Machine Learning for NLP", "label": 3, "url": "https://www.semanticscholar.org/reader/b398696d913f6099843b6190de2e77180dd027a9?experiments=&features=reader_skimming%3Atrue"}, {"loc": [4.091821193695068, 4.093278884887695], "id": 1110, "title": "Reasoning Like Program Executors", "authors": "Xinyu Pi, Qian Liu, Bei Chen, Morteza Ziyadi, Zeqi Lin, Qiang Fu, Yan Gao, Jian-Guang LOU and Weizhu Chen", "abstract": "Reasoning over natural language is a long-standing goal for the research community. However, studies have shown that existing language models are inadequate in reasoning. To address the issue, we present POET, a novel reasoning pre-training paradigm. Through pre-training language models with programs and their execution results, POET empowers language models to harvest the reasoning knowledge possessed by program executors via a data-driven approach. POET is conceptually simple and can be instantiated by different kinds of program executors. In this paper, we showcase two simple instances POET-Math and POET-Logic, in addition to a complex instance, POET-SQL. Experimental results on six benchmarks demonstrate that POET can significantly boost model performance in natural language reasoning, such as numerical reasoning, logical reasoning, and multi-hop reasoning. POET opens a new gate on reasoning-enhancement pre-training, and we hope our analysis would shed light on the future research of reasoning like program executors.", "track": "Semantics: Lexical, Sentence level, Textual Inference and Other areas", "label": 8, "url": "https://www.semanticscholar.org/reader/03488f1a193066b5ea8b9b800e119f07df5c1d9e?experiments=&features=reader_skimming%3Atrue"}, {"loc": [3.984764337539673, 9.305280685424805], "id": 1113, "title": "SEM-F1: an Automatic Way for Semantic Evaluation of Multi-Narrative Overlap Summaries at Scale", "authors": "Naman Bansal, Mousumi Akter and Shubhra Kanti Karmaker", "abstract": "Recent work has introduced an important yet relatively under-explored NLP task called Semantic Overlap Summarization (SOS) that entails generating a summary from multiple alternative narratives which conveys the common information provided by those narratives. Previous work also published a benchmark dataset for this task by collecting 2,925 alternative narrative pairs from the web and manually annotating 411 different reference summaries by engaging human annotators. In this paper, we exclusively focus on the automated evaluation of the SOS task using the benchmark dataset. More specifically, we first use the popular ROUGE metric from text-summarization literature and conduct a systematic study to evaluate the SOS task. Our experiments discover that ROUGE is not suitable for this novel task and therefore, we propose a new sentence-level precision-recall style automated evaluation metric, called SEM-F1 (Semantic F1). It is inspired by the benefits of the sentence-wise annotation technique using overlap labels reported by the previous work. Our experiments show that the proposed SEM-F1 metric yields a higher correlation with human judgment and higher inter-rater agreement compared to the ROUGE metric.", "track": "Summarization", "label": 14, "url": ""}, {"loc": [8.33066177368164, 8.465265274047852], "id": 1116, "title": "Inducer-tuning: Connecting Prefix-tuning and Adapter-tuning", "authors": "Yifan Chen, Devamanyu Hazarika, Mahdi Namazifar, Yang Liu, Di Jin and Dilek Hakkani-Tur", "abstract": "Prefix-tuning, or more generally continuous prompt tuning, has become an essential paradigm of parameter-efficient transfer learning. Using a large pre-trained language model (PLM), prefix-tuning can obtain strong performance by training only a small portion of parameters. In this paper, we propose to understand and further develop prefix-tuning through the kernel lens. Specifically, we make an analogy between \\textit{prefixes} and \\textit{inducing variables} in kernel methods and hypothesize that \\textit{prefixes} serving as \\textit{inducing variables} would improve their overall mechanism. From the kernel estimator perspective, we suggest a new variant of prefix-tuning---\\textit{inducer-tuning}, which shares the exact mechanism as prefix-tuning while leveraging the residual form found in adapter-tuning. This mitigates the initialization issue in prefix-tuning. Through comprehensive empirical experiments on natural language understanding and generation tasks, we demonstrate that inducer-tuning can close the performance gap between prefix-tuning and fine-tuning.", "track": "Machine Learning for NLP", "label": 3, "url": "https://www.semanticscholar.org/reader/289700f4570733b612147883ad29b963bbffe31a?experiments=&features=reader_skimming%3Atrue"}, {"loc": [4.771486759185791, 4.629601955413818], "id": 1128, "title": "DocInfer: Document-level Natural Language Inference using Optimal Evidence Selection", "authors": "Puneet Mathur, Gautam Kunapuli, Riyaz Ahmad Bhat, Manish Shrivastava, Dinesh Manocha and Maneesh Singh", "abstract": "We present DocInfer - a novel, end-to-end Document-level Natural Language Inference model that builds a hierarchical document graph enriched through inter-sentence relations (topical, entity-based, concept-based), performs paragraph pruning using the novel SubGraph Pooling layer, followed by optimal evidence selection based on REINFORCE algorithm to identify the most important context sentences for a given hypothesis. Our evidence selection mechanism allows it to transcend the input length limitation of modern BERT-like Transformer models while presenting the entire evidence together for inferential reasoning. We show this is an important property needed to reason on large documents where the evidence may be fragmented and located arbitrarily far from each other. Extensive experiments on popular corpora - DocNLI, ContractNLI, and ConTRoL datasets, and our new proposed dataset called CaseHoldNLI on the task of legal judicial reasoning, demonstrate significant performance gains of 8-12% over SOTA methods. Our ablation studies validate the impact of our model. Performance improvement of 3-6% on annotation-scarce downstream tasks of fact verification, multiple-choice QA, and contract clause retrieval demonstrates the usefulness of DocInfer beyond primary NLI tasks.", "track": "Semantics: Lexical, Sentence level, Textual Inference and Other areas", "label": 8, "url": ""}, {"loc": [0.44673553109169006, 7.152421951293945], "id": 1135, "title": "LightEA: A Scalable, Robust, and Interpretable Entity Alignment Framework via Three-view Label Propagation", "authors": "Xin Mao, wenting wang, Yuanbin Wu and Man Lan", "abstract": "Entity Alignment (EA) aims to find equivalent entity pairs between KGs, which is the core step to bridging and integrating multi-source KGs. In this paper, we argue that existing complex EA methods inevitably inherit the inborn defects from their neural network lineage: poor interpretability and weak scalability. Inspired by recent studies, we reinvent the classical Label Propagation algorithm to effectively run on KGs and propose a neural-free EA framework \u2014 LightEA, consisting of three efficient components: (i) Random Orthogonal Label Generation, (ii) Three-view Label Propagation, and (iii) Sparse Sinkhorn Operation.\nAccording to the extensive experiments on public datasets, LightEA has impressive scalability, robustness, and interpretability. With a mere tenth of time consumption, LightEA achieves comparable results to state-of-the-art methods across all datasets and even surpasses them on many. Besides, due to the computational process of LightEA being entirely linear, we could trace the propagation process at each step and clearly explain how the entities are aligned.", "track": "Efficient Methods for NLP", "label": 12, "url": ""}, {"loc": [4.757153511047363, 3.2815983295440674], "id": 1164, "title": "Metric-guided Distillation: Distilling Knowledge from the Metric to Ranker and Retriever for Generative Commonsense Reasoning", "authors": "Xingwei He, Yeyun Gong, A-Long Jin, Weizhen Qi, Hang Zhang, Jian Jiao, Bartuer Zhou, Biao Cheng, SM Yiu and Nan Duan", "abstract": "Commonsense generation aims to generate a realistic sentence describing a daily scene under the given concepts, which is very challenging, since it requires models to have relational reasoning and compositional generalization capabilities. Previous work focuses on retrieving prototype sentences for the provided concepts to assist generation. They first use a sparse retriever to retrieve candidate sentences, then re-rank the candidates with a ranker. However, the candidates returned by their ranker may not be the most relevant sentences, since the ranker treats all candidates equally without considering their relevance to the reference sentences of the given concepts. Another problem is that re-ranking is very expensive, but only using retrievers will seriously degrade the performance of their generation models. To solve these problems, we propose the metric distillation rule to distill knowledge from the metric (e.g., BLEU) to the ranker. We further transfer the critical knowledge summarized by the distilled ranker to the retriever. In this way, the relevance scores of candidate sentences predicted by the ranker and retriever will be more consistent with their quality measured by the metric. Experimental results on the CommonGen benchmark verify the effectiveness of our proposed method: (1) Our generation model with the distilled ranker achieves a new state-of-the-art result. (2) Our generation model with the distilled retriever even surpasses the previous SOTA.", "track": "Commonsense Reasoning", "label": 19, "url": "https://www.semanticscholar.org/reader/7de0d0800fa2046ce74fff0bf60ff63a966e166d?experiments=&features=reader_skimming%3Atrue"}, {"loc": [1.7093737125396729, 3.79512095451355], "id": 1186, "title": "Efficient Document Retrieval by End-to-End Refining and Quantizing BERT Embedding with Contrastive Product Quantization", "authors": "Zexuan Qiu, Qinliang Su, Jianxing Yu and Shijing Si", "abstract": "Efficient document retrieval heavily relies on the technique of semantic hashing, which learns a binary code for every document and employs Hamming distance to evaluate document distances. However, existing semantic hashing methods are mostly established on outdated TFIDF features, which obviously do not contain lots of important semantic information about documents. Furthermore, the Hamming distance can only be equal to one of several integer values, significantly limiting its representational ability for document distances. To address these issues, in this paper, we propose to leverage BERT embeddings to perform efficient retrieval based on the product quantization technique, which will assign for every document a real-valued codeword from the codebook, instead of a binary code as in semantic hashing. Specifically, we first transform the original BERT embeddings via a learnable mapping and feed the transformed embedding into a probabilistic product quantization module to output the assigned codeword. The refining and quantizing modules can be optimized in an end-to-end manner by minimizing the probabilistic contrastive loss. A mutual information maximization based method is further proposed to improve the representativeness of codewords, so that documents can be quantized more accurately. Extensive experiments conducted on three benchmarks demonstrate that our proposed method significantly outperforms current state-of-the-art baselines.", "track": "Information Retrieval and Text Mining", "label": 15, "url": "https://www.semanticscholar.org/reader/67229d3394ba916516c8ce12be5e874061588eb6?experiments=&features=reader_skimming%3Atrue"}, {"loc": [1.0890947580337524, 10.554510116577148], "id": 1226, "title": "Curriculum Knowledge Distillation for Emoji-supervised Cross-lingual Sentiment Analysis", "authors": "Jianyang Zhang, Tao Liang, Mingyang Wan, Guowu Yang and Fengmao Lv", "abstract": "Existing sentiment analysis models have achieved great advances with the help of sufficient sentiment annotations. Unfortunately, many languages do not have sufficient sentiment corpus. To this end, recent studies have proposed cross-lingual sentiment analysis to transfer sentiment analysis models from resource-rich languages to low-resource languages. However, these studies either rely on external cross-lingual supervision (e.g., parallel corpora and translation model), or are limited by the cross-lingual gaps. In this work, based on the intuitive assumption that the relationships between emojis and sentiments are consistent across different languages, we investigate transferring sentiment knowledge across languages with the help of emojis. To this end, we propose a novel cross-lingual sentiment analysis approach dubbed Curriculum Knowledge Distiller (CKD). The core idea of CKD is to use emojis to bridge the source and target languages. Note that, compared with texts, emojis are more transferable, but cannot reveal the precise sentiment. Thus, we distill multiple Intermediate Sentiment Classifiers (ISC) on source language corpus with emojis to get ISCs with different attention weights of texts. To transfer them into the target language, we distill ISCs into the Target Language Sentiment Classifier (TSC) following the curriculum learning mechanism. In this way, TSC can learn delicate sentiment knowledge, meanwhile, avoid being affected by cross-lingual gaps. Experimental results on five cross-lingual benchmarks clearly verify the effectiveness of our approach.", "track": "Sentiment Analysis, Stylistic Analysis, and Argument Mining", "label": 16, "url": ""}, {"loc": [4.446403503417969, 7.6140642166137695], "id": 1227, "title": "Correctable-DST: Mitigating Historical Context Mismatch between Training and Inference for Improved Dialogue State Tracking", "authors": "Hongyan Xie, Haoxiang Su, Shuangyong Song, Hao Huang, Bo Zou, Kun Deng, Jianghua Lin, Zhihui Zhang and Xiaodong He", "abstract": "Recently proposed dialogue state tracking (DST) approaches predict the dialogue state of a target turn sequentially based on the previous dialogue state. During the training time, the ground-truth previous dialogue state is utilized as the historical context. However, only the previously predicted dialogue state can be used in inference. This discrepancy might lead to error propagation, i.e., mistakes made by the model in the current turn are likely to be carried over to the following turns.\nTo solve this problem, we propose Correctable Dialogue State Tracking (Correctable-DST). Specifically, it consists of three stages: (1) a Predictive State Simulator is exploited to generate a previously \"predicted\" dialogue state based on the ground-truth previous dialogue state during training; (2) a Slot Detector is proposed to determine the slots with an incorrect value in the previously \"predicted\" state and the slots whose values are to be updated in the current turn; (3) a State Generator takes the name of the above-selected slots as a prompt to generate the current state.\nEmpirical results show that our approach achieves 67.51%, 68.24%, 70.30%, 71.38%, and 81.27% joint goal accuracy on MultiWOZ 2.0-2.4  datasets, respectively, and achieves a new state-of-the-art performance with significant improvements.", "track": "Dialogue and Interactive Systems", "label": 4, "url": ""}, {"loc": [7.472158908843994, 9.513226509094238], "id": 1233, "title": "DropMix: A Textual Data Augmentation Combining Dropout with Mixup", "authors": "Fanshuang Kong, Richong Zhang, Xiaohui Guo, Samuel Mensah and Yongyi Mao", "abstract": "Overfitting is a notorious problem when there is insufficient data to train deep neural networks in machine learning tasks. Data augmentation regularization methods such as Dropout, Mixup, and their enhanced variants are effective and prevalent, and achieve promising performance to overcome overfitting. However, in text learning, most of the existing regularization approaches merely adopt ideas from computer vision without considering the importance of dimensionality in natural language processing. In this paper, we argue that the property is essential to overcome overfitting in text learning. Accordingly, we present a saliency map informed textual data augmentation and regularization framework, which combines Dropout and Mixup, namely DropMix, to mitigate the overfitting problem in text learning. In addition, we design a procedure that drops and patches fine grained shapes of the saliency map under the DropMix framework to enhance regularization. Empirical studies confirm the effectiveness of the proposed approach on 12 text classification tasks.", "track": "Interpretability, Interactivity and Analysis of Models for NLP", "label": 9, "url": ""}, {"loc": [2.337517023086548, 7.8153228759765625], "id": 1279, "title": "Cross-document Event Coreference Search: Task, Dataset and Modeling", "authors": "Alon Eirew, Avi Caciularu and Ido Dagan", "abstract": "The task of Cross-document Coreference Resolution has been traditionally formulated as requiring to identify all coreference links across a given set of documents. We propose an appealing, and often more applicable, complementary set up for the task -- Cross-document Coreference Search, focusing in this paper on event coreference. Concretely, given a mention in context of an event of interest, considered as a query, the task is to find all coreferring mentions for the query event in a large document collection. To support research on this task, we create a corresponding dataset, which is derived from Wikipedia while leveraging annotations in the available Wikipedia Event Coreferecene dataset (WEC-Eng). Observing that the coreference search setup is largely analogous to the setting of Open Domain Question Answering, we adapt the prominent Deep Passage Retrieval (DPR) model to our setting, as an appealing baseline. Finally, we present a novel model that integrates a powerful coreference scoring scheme into the DPR architecture, yielding improved performance.", "track": "Resources and Evaluation", "label": 1, "url": "https://www.semanticscholar.org/reader/f4d587be83b5da1e35592d5662a05398c9e9b720?experiments=&features=reader_skimming%3Atrue"}, {"loc": [7.520313262939453, 6.754205226898193], "id": 1320, "title": "VIRT: Improving Representation-based Text Matching via Virtual Interaction", "authors": "Dan Li, Yang Yang, Hongyin Tang, Jiahao Liu, Qifan Wang, Jingang Wang, Tong Xu, Wei Wu and Enhong Chen", "abstract": "Text matching is a fundamental research problem in natural language understanding. Interaction-based approaches treat the text pair as a single sequence and encode it through cross encoders, while representation-based models encode the text pair independently with siamese or dual encoders. Interaction-based models require dense computations and thus are impractical in real-world applications. Representation-based models have become the mainstream paradigm for efficient text matching. However, these models suffer from severe performance degradation due to the lack of interactions between the pair of texts. To remedy this, we propose a Virtual InteRacTion mechanism (VIRT) for improving representation-based text matching while maintaining its efficiency. In particular, we introduce an interactive knowledge distillation module that is only applied during training. It enables deep interaction between texts by effectively transferring knowledge from the interaction-based model. A light interaction strategy is designed to fully leverage the learned interactive knowledge. Experimental results on six text matching benchmarks demonstrate the superior performance of our method over several state-of-the-art representation-based models. We further show that VIRT can be integrated into existing methods as plugins to lift their performances.", "track": "Efficient Methods for NLP", "label": 12, "url": ""}, {"loc": [2.145726442337036, 7.63754940032959], "id": 1343, "title": "MAVEN-ERE: A Unified Large-scale Dataset for Event Coreference, Temporal, Causal, and Subevent Relation Extraction", "authors": "Xiaozhi Wang, Yulin Chen, Ning Ding, Hao Peng, Zimu Wang, Yankai Lin, Xu Han, Lei Hou, Juanzi Li, Zhiyuan Liu, Peng Li and Jie Zhou", "abstract": "The diverse relationships among real-world events, including coreference, temporal, causal, and subevent relations, are fundamental to understanding natural languages. However, two drawbacks of existing datasets limit event relation extraction (ERE) tasks: (1) Small scale. Due to the annotation complexity, the data scale of existing datasets is limited, which cannot well train and evaluate data-hungry models. (2) Absence of unified annotation. Different types of event relations naturally interact with each other, but existing datasets only cover limited relation types at once, which prevents models from taking full advantage of relation interactions.  To address these issues, we construct a unified large-scale human-annotated ERE dataset MAVEN-ERE with improved annotation schemes. It contains 103,193 event coreference chains, 1,216,217 temporal relations, 57,992 causal relations, and 15,841 subevent relations, which is larger than existing datasets of all the ERE tasks by at least an order of magnitude. Experiments show that ERE on MAVEN-ERE is quite challenging, and considering relation interactions with joint learning can improve performances. The dataset and source codes can be obtained from https://github.com/THU-KEG/MAVEN-ERE.", "track": "Information Extraction", "label": 5, "url": "https://www.semanticscholar.org/reader/4b68322883f83fdfaf07344dff47a73b5cee9ce7?experiments=&features=reader_skimming%3Atrue"}, {"loc": [1.7272932529449463, 9.077872276306152], "id": 1344, "title": "Entity Extraction in Low Resource Domains with Selective Pre-training of Large Language Models", "authors": "Aniruddha Mahapatra, Sharmila Reddy Nangi, Aparna Garimella and Anandhavelu N", "abstract": "Transformer-based language models trained on large natural language corpora have been very useful in downstream entity extraction tasks. However, they often result in poor performances when applied to domains that are different from those they are pretrained on. Continued pretraining using unlabeled data from target domains can help improve the performances of these language models on the downstream tasks.  However, using all of the available unlabeled data for pretraining can be time-intensive; also, it can be detrimental to the performance of the downstream tasks, if the unlabeled data is not aligned with the data distribution for the target tasks. Previous works employed external supervision in the form of ontologies for selecting appropriate data samples for pretraining, but external supervision can be quite hard to obtain in low-resource domains. In this paper, we introduce effective ways to select data from unlabeled corpora of target domains for language model pretraining to improve the performances in target entity extraction tasks. Our data selection strategies do not require any external supervision. We conduct extensive experiments for the task of named entity recognition (NER) on seven different domains and show that language models pretrained on target domain unlabeled data obtained using our data selection strategies achieve better performances compared to those using data selection strategies in previous works that use external supervision. We also show that these pretrained language models using our data selection strategies outperform those pretrained on all of the available unlabeled target domain data.", "track": "Information Extraction", "label": 5, "url": ""}, {"loc": [8.030102729797363, 5.1703104972839355], "id": 1347, "title": "How Large Language Models are Transforming Machine-Paraphrase Plagiarism", "authors": "Jan Philip Wahle, Terry Ruas, Frederic Kirstein and Bela Gipp", "abstract": "The recent success of large language models for text generation poses a severe threat to academic integrity, as plagiarists can generate realistic paraphrases indistinguishable from original work.\nHowever, the role of large autoregressive models in generating machine-paraphrased plagiarism and their detection is still incipient in the literature.\nThis work explores T5 and GPT3 for machine-paraphrase generation on scientific articles from arXiv, student theses, and Wikipedia.\nWe evaluate the detection performance of six automated solutions and one commercial plagiarism detection software and perform a human study with 105 participants regarding their detection performance and the quality of generated examples.\nOur results suggest that large language models can rewrite text humans have difficulty identifying as machine-paraphrased (53% mean acc.).\nHuman experts rate the quality of paraphrases generated by GPT-3 as high as original texts (clarity 4.0/5, fluency 4.2/5, coherence 3.8/5).\nThe best-performing detection model (GPT-3) achieves 66% F1-score in detecting paraphrases.\nWe make our code, data, and findings publicly available to facilitate the development of detection solutions.", "track": "NLP Applications", "label": 0, "url": "https://www.semanticscholar.org/reader/f158e70e9ead719e8a524eaf8ec79270574f2eda?experiments=&features=reader_skimming%3Atrue"}, {"loc": [8.093953132629395, 8.708601951599121], "id": 1348, "title": "M2D2: A Massively Multi-Domain Language Modeling Dataset", "authors": "Machel Reid, Victor Zhong, Suchin Gururangan and Luke Zettlemoyer", "abstract": "We present M2D2, a fine-grained, massively multi-domain corpus for studying domain adaptation in language models (LMs). M2D2 consists of 8.5B tokens and spans 145 domains extracted from Wikipedia and Semantic Scholar. Using ontologies derived from Wikipedia and ArXiv categories, we organize the domains in each data source into 22 groups. This two-level hierarchy enables the study of relationships between domains and their effects on in- and out-of-domain performance after adaptation. We also present a number of insights into the nature of effective domain adaptation in LMs, as examples of the new types of studies M2D2 enables. To improve in-domain performance, we show the benefits of adapting the LM along a domain hierarchy; adapting to smaller amounts of fine-grained domain-specific data can lead to larger in-domain performance gains than larger amounts of weakly relevant data. We further demonstrate a trade-off between in-domain specialization and out-of-domain generalization within and across ontologies, as well as a strong correlation between out-of-domain performance and lexical overlap between domains.", "track": "Resources and Evaluation", "label": 1, "url": "https://www.semanticscholar.org/reader/7c3a735c7567b5b54581ba09612db4d18a5dacac?experiments=&features=reader_skimming%3Atrue"}, {"loc": [5.498634338378906, 5.076426029205322], "id": 1369, "title": "\"Will You Find These Shortcuts?\" A Protocol for Evaluating the Faithfulness of Input Salience Methods for Text Classification", "authors": "Jasmijn Bastings, Sebastian Ebert, Polina Zablotskaia, Anders Sandholm and Katja Filippova", "abstract": "Feature attribution a.k.a. input salience methods which assign an importance score to a feature are abundant but may produce surprisingly different results for the same model on the same input. While differences are expected if disparate definitions of importance are assumed, most methods claim to provide faithful attributions and point at the features most relevant for a model's prediction. Existing work on faithfulness evaluation is not conclusive and does not provide a clear answer as to how different methods are to be compared.\nFocusing on text classification and the model debugging scenario, our main contribution is a protocol for faithfulness evaluation that makes use of partially synthetic data to obtain ground truth for feature importance ranking. Following the protocol, we do an in-depth analysis of four standard salience method classes on a range of datasets and lexical shortcuts for BERT and LSTM models. We demonstrate that some of the most popular method configurations provide poor results even for simple shortcuts while a method judged to be too simplistic works remarkably well for BERT.", "track": "Interpretability, Interactivity and Analysis of Models for NLP", "label": 9, "url": "https://www.semanticscholar.org/reader/1818e24137383ece9b2f379a63674b2632e16d04?experiments=&features=reader_skimming%3Atrue"}, {"loc": [10.334426879882812, 7.665778636932373], "id": 1410, "title": "Information-Transport-based Policy for Simultaneous Translation", "authors": "Shaolei Zhang and Yang Feng", "abstract": "Simultaneous translation (ST) outputs translation while receiving the source inputs, and hence requires a policy to determine whether to translate a target token or wait for the next source token. The major challenge of ST is that each target token can only be translated based on the current received source tokens, where the received source information will directly affect the translation quality. So naturally, how much source information is received for the translation of the current target token is supposed to be the pivotal evidence for the ST policy to decide between translating and waiting. In this paper, we treat the translation as information transport from source to target and accordingly propose an Information-Transport-based Simultaneous Translation (ITST). ITST quantifies the transported information weight from each source token to the current target token, and then decides whether to translate the target token according to its accumulated received information. Experiments on both text-to-text ST and speech-to-text ST (a.k.a., streaming speech translation) tasks show that ITST outperforms strong baselines and achieves state-of-the-art performance.", "track": "Machine Translation", "label": 10, "url": ""}, {"loc": [8.135863304138184, 5.209171295166016], "id": 1416, "title": "Learning to Adapt to Low-Resource Paraphrase Generation", "authors": "Zhigen Li, Yanmeng Wang, Rizhao Fan, Ye Wang, Jianfeng Li and Shaojun Wang", "abstract": "Paraphrase generation is a longstanding NLP task and achieves great success with the aid of large corpora. However, transferring a paraphrasing model to another domain encounters the problem of domain shifting especially when the data is sparse. At the same time, widely using large pre-trained language models (PLMs) faces the overfitting problem when training on scarce labeled data. To mitigate these two issues, we propose, LAPA, an effective adapter for PLMs optimized by meta-learning. LAPA has three-stage training on three types of related resources to solve this problem: 1. pre-training PLMs on unsupervised corpora, 2. inserting an adapter layer and meta-training on source domain labeled data, and 3. fine-tuning adapters on a small amount of target domain labeled data. This method enables paraphrase generation models to learn basic language knowledge first, then learn the paraphrasing task itself later, and finally adapt to the target task. Our experimental results demonstrate that LAPA achieves state-of-the-art in supervised, unsupervised, and low-resource settings on three benchmark datasets. \nWith only 2% of trainable parameters and 1% labeled data of the target task, our approach can achieve a competitive performance with previous work.", "track": "Unsupervised and Weakly-Supervised Methods in NLP", "label": 17, "url": ""}, {"loc": [5.886528015136719, 8.78001594543457], "id": 1435, "title": "A Distributional Lens for Multi-Aspect Controllable Text Generation", "authors": "Yuxuan Gu, Xiaocheng Feng, Sicheng Ma, Lingyuan Zhang, Heng Gong and Bing Qin", "abstract": "Multi-aspect controllable text generation is a more challenging and practical task than single-aspect control. Existing methods achieve complex multi-aspect control by fusing multiple controllers learned from single-aspect, but suffer from attribute degeneration caused by the mutual interference of these controllers. To address this, we provide observations on attribute fusion from a distributional perspective and propose to directly search for the intersection areas of multiple attribute distributions as their combination for generation. Our method first estimates the attribute space with an autoencoder structure.  Afterward, we iteratively approach the intersections by jointly minimizing distances to points representing different attributes. Finally, we map them to attribute-relevant sentences with a prefix-tuning-based decoder. Experiments on the three-aspect control task, including sentiment, topic, and detoxification aspects, reveal that our method outperforms several strong baselines on attribute relevance and text quality and achieves the SOTA. Further analysis also supplies some explanatory support for the effectiveness of our approach.", "track": "Natural Language Generation", "label": 6, "url": "https://www.semanticscholar.org/reader/2383140a30cbd5e66db3f73e488ebfdc7a7fbb56?experiments=&features=reader_skimming%3Atrue"}, {"loc": [5.816460609436035, 8.775479316711426], "id": 1478, "title": "ELMER: A Non-Autoregressive Pre-trained Language Model for Efficient and Effective Text Generation", "authors": "Junyi Li, Tianyi Tang, Wayne Xin Zhao, Jian-Yun Nie and Ji-Rong Wen", "abstract": "We study the text generation task under the approach of pre-trained language models (PLMs). Typically, an auto-regressive (AR) method is adopted for generating texts in a token-by-token manner.  \nDespite many advantages of AR generation, it usually suffers from inefficient inference. Therefore, non-autoregressive (NAR) models are proposed to generate all target tokens simultaneously. However, NAR models usually generate texts of lower quality due to the absence of token dependency in the output text. In this paper, we propose ELMER: an efficient and effective PLM for NAR text generation to explicitly model the token dependency during NAR generation. By leveraging the early exit technique, ELMER enables the token generations at different layers, according to their prediction confidence (a more confident token will exit at a lower layer). Besides, we propose a novel pre-training objective, Layer Permutation Language Modeling, to pre-train ELMER by permuting the exit layer for each token in sequences. Experiments on three text generation tasks show that ELMER significantly outperforms NAR models and further narrows the performance gap with AR PLMs (\\eg ELMER (29.92) vs BART (30.61) ROUGE-L in XSUM) while achieving over 10 times inference speedup.", "track": "Natural Language Generation", "label": 6, "url": ""}, {"loc": [0.9178818464279175, 8.154624938964844], "id": 1479, "title": "Multilingual Relation Classification via Efficient and Effective Prompting", "authors": "Yuxuan Chen, David Harbecke and Leonhard Hennig", "abstract": "Prompting pre-trained language models has achieved impressive performance on various NLP tasks, especially in low data regimes. Despite the success of prompting in monolingual settings, applying prompt-based methods in multilingual scenarios has been limited to a narrow set of tasks, due to the high cost of handcrafting multilingual prompts. In this paper, we present the first work on prompt-based multilingual relation classification (RC), by introducing an efficient and effective method that constructs prompts from relation triples and involves only minimal translation for the class labels. We evaluate its performance in fully supervised, few-shot and zero-shot scenarios, and analyze its effectiveness across 14 languages, prompt variants, and English-task training in cross-lingual settings. We find that in both fully supervised and few-shot scenarios, our prompt method beats competitive baselines: fine-tuning XLM-R_EM and null prompts. It also outperforms the random baseline by a large margin in zero-shot experiments. Our method requires little in-language knowledge and can be used as a strong baseline for similar multilingual classification tasks.", "track": "Information Extraction", "label": 5, "url": "https://www.semanticscholar.org/reader/32635a3daba6cbd7f0dd930aa325254b191c1343?experiments=&features=reader_skimming%3Atrue"}, {"loc": [7.071919918060303, 4.849345684051514], "id": 1536, "title": "Topic-Regularized Authorship Representation Learning", "authors": "Jitkapat Sawatphol, Nonthakit Chaiwong, Can Udomcharoenchaikit and Sarana Nutanong", "abstract": "Authorship attribution is a task that aims to identify the author of a given piece of writing. We aim to develop a generalized solution that can handle a large number of texts from authors and topics unavailable in training data. Previous studies have proposed strategies to address only either unseen authors or unseen topics. Authorship representation learning has been shown to work in open-set environments with a large number of unseen authors but has not been explicitly designed for cross-topic environments at the same time. To handle a large number of unseen authors and topics, we propose Authorship Representation Regularization (ARR), a distillation framework that creates authorship representation with reduced reliance on topic-specific information. To assess the performance of our framework, we also propose a cross-topic-open-set evaluation method. Our proposed method has improved performances in the cross-topic-open set setup over baselines in 4 out of 6 cases.", "track": "Sentiment Analysis, Stylistic Analysis, and Argument Mining", "label": 16, "url": ""}, {"loc": [0.7960485816001892, 8.063212394714355], "id": 1573, "title": "Fine-grained Contrastive Learning for Relation Extraction", "authors": "William Hogan, Jiacheng Li and Jingbo Shang", "abstract": "Recent relation extraction (RE) works have shown encouraging improvements by conducting contrastive learning on silver labels generated by distant supervision before fine-tuning on gold labels. Existing methods typically assume all these silver labels are accurate and treat them equally; however, distant supervision is inevitably noisy\u2013some silver labels are more reliable than others. In this paper, we propose fine-grained contrastive learning (FineCL) for RE, which leverages fine-grained information about which silver labels are and are not noisy to improve the quality of learned relationship representations for RE. We first assess the quality of silver labels via a simple and automatic approach we call \"learning order denoising,\" where we train a language model to learn these relations and record the order of learned training instances. We show that learning order largely corresponds to label accuracy\u2013early-learned silver labels have, on average, more accurate labels than later-learned silver labels. Then, during pre-training, we increase the weights of accurate labels within a novel contrastive learning objective. Experiments on several RE benchmarks show that FineCL makes consistent and significant performance gains over state-of-the-art methods.", "track": "Information Extraction", "label": 5, "url": "https://www.semanticscholar.org/reader/1242ee5c52464a5ac58d68a5f93449e334e00dfa?experiments=&features=reader_skimming%3Atrue"}, {"loc": [3.661283254623413, 8.038297653198242], "id": 1590, "title": "Curriculum Prompt Learning with Self-Training for Abstractive Dialogue Summarization", "authors": "Changqun Li, Linlin Wang, xin Lin, Gerard de Melo and Liang He", "abstract": "Succinctly summarizing dialogue is a task of growing interest, but inherent challenges, such as insufficient training data and low information density impede our ability to train abstractive models. In this work, we propose a novel curriculum-based prompt learning method with self-training to address these problems. Specifically, prompts are learned using a curriculum learning strategy that gradually increases the degree of prompt perturbation, thereby improving the dialogue understanding and modeling capabilities of our model. Unlabeled dialogue is incorporated by means of self-training so as to reduce the dependency on labeled data. We further investigate topic-aware prompts to better plan for the generation of summaries. Experiments confirm that our model substantially outperforms strong baselines and achieves new state-of-the-art results on the AMI and ICSI datasets. Human evaluations also show the superiority of our model with regard to the summary generation quality.", "track": "Natural Language Generation", "label": 6, "url": ""}, {"loc": [8.017522811889648, 9.721717834472656], "id": 1635, "title": "Zero-Shot Text Classification with Self-Training", "authors": "Ariel Gera, Alon Halfon, Eyal Shnarch, Yotam Perlitz, Liat Ein-Dor and Noam Slonim", "abstract": "Recent advances in large pretrained language models have increased attention to zero-shot text classification. In particular, models finetuned on natural language inference datasets have been widely adopted as zero-shot classifiers due to their promising results and off-the-shelf availability. However, the fact that such models are unfamiliar with the target task can lead to instability and performance issues.  We propose a plug-and-play method to bridge this gap using a simple self-training approach, requiring only the class names along with an unlabeled dataset, and without the need for domain expertise or trial and error. We show that fine-tuning the zero-shot classifier on its most confident predictions leads to significant performance gains across a wide range of text classification tasks, presumably since self-training adapts the zero-shot model to the task at hand.", "track": "Unsupervised and Weakly-Supervised Methods in NLP", "label": 17, "url": ""}, {"loc": [4.86292028427124, 4.750800132751465], "id": 1704, "title": "Deconfounding Legal Judgment Prediction for European Court of Human Rights Cases Towards Better Alignment with Experts", "authors": "T.Y.S.S Santosh, Shanshan Xu, Oana Ichim and Matthias Grabmair", "abstract": "This work demonstrates that Legal Judgement Prediction systems without expert-informed adjustments can be vulnerable to shallow, distracting surface signals that arise from corpus construction, case distribution, and confounding factors. To mitigate this, we use domain expertise to strategically identify statistically predictive but legally irrelevant information. We adopt adversarial training to prevent the system from relying on it. We evaluate our deconfounded models by employing interpretability techniques and comparing to expert annotations. Quantitative experiments and qualitative analysis show that our deconfounded model consistently  aligns better with expert rationales than baselines trained for prediction only. We further contribute a set of reference expert annotations to the validation and testing partitions of an existing benchmark dataset of European Court of Human Rights cases.", "track": "NLP Applications", "label": 0, "url": "https://www.semanticscholar.org/reader/0476fe2b42398f3482946fff2d5392e22662a248?experiments=&features=reader_skimming%3Atrue"}, {"loc": [3.68505859375, 9.543838500976562], "id": 1733, "title": "SQuALITY: Building a Long-Document Summarization Dataset the Hard Way", "authors": "Alex Wang, Richard Yuanzhe Pang, Angelica Chen, Jason Phang and Samuel R. Bowman", "abstract": "Summarization datasets are often assembled either by scraping naturally occurring public-domain summaries---which are nearly always in difficult-to-work-with technical domains---or by using approximate heuristics to extract them from everyday text---which frequently yields unfaithful summaries. In this work, we turn to a slower but more straightforward approach to developing summarization benchmark data: We hire highly-qualified contractors to read stories and write original summaries from scratch. To amortize reading time, we collect five summaries per document, with the first giving an overview and the subsequent four addressing specific questions. We use this protocol to collect SQuALITY, a dataset of question-focused summaries built on the same public-domain short stories as the multiple-choice dataset QuALITY (Pang et al., 2021). Experiments with state-of-the-art summarization systems show that our dataset is challenging and that existing automatic evaluation metrics are weak indicators of quality.", "track": "Summarization", "label": 14, "url": "https://www.semanticscholar.org/reader/b7422b7a7830cd899b47b03e514d8151ffb74c03?experiments=&features=reader_skimming%3Atrue"}, {"loc": [4.5531697273254395, 7.628974437713623], "id": 1770, "title": "MetaASSIST: Robust Dialogue State Tracking with Meta Learning", "authors": "Fanghua Ye, xi wang, Jie Huang, Shenghui Li, Samuel Stern and Emine Yilmaz", "abstract": "Existing dialogue datasets contain lots of noise in their state annotations. Such noise can hurt model training and ultimately lead to poor generalization performance. A general framework named ASSIST has recently been proposed to train robust dialogue state tracking (DST) models. It introduces an auxiliary model to generate pseudo labels for the noisy training set. These pseudo labels are combined with vanilla labels by a common fixed weighting parameter to train the primary DST model. Notwithstanding the improvements of ASSIST on DST, tuning the weighting parameter is challenging. Moreover, a single parameter shared by all slots and all instances may be suboptimal. To overcome these limitations, we propose a meta learning-based framework MetaASSIST to adaptively learn the weighting parameter. Specifically, we propose three schemes with varying degrees of flexibility, ranging from slot-wise to both slot-wise and instance-wise, to convert the weighting parameter into learnable functions. These functions are trained in a meta-learning manner by taking the validation set as meta data. Experimental results demonstrate that all three schemes can achieve competitive performance. Most impressively, we achieve a state-of-the-art joint goal accuracy of 80.10% on MultiWOZ 2.4.", "track": "Dialogue and Interactive Systems", "label": 4, "url": "https://www.semanticscholar.org/reader/1a37bd6d3ae6ffa6ebdfc35204de22edc85d887b?experiments=&features=reader_skimming%3Atrue"}, {"loc": [9.939080238342285, 6.70028829574585], "id": 1781, "title": "Multilingual Machine Translation with Hyper-Adapters", "authors": "Christos Baziotis, Mikel Artetxe, James Cross and Shruti Bhosale", "abstract": "Multilingual machine translation suffers from negative interference across languages. A common solution is to relax parameter sharing with language-specific modules like adapters. However, adapters of related languages are unable to transfer information, and their total number of parameters becomes prohibitively expensive as the number of languages grows. In this work, we overcome these drawbacks using hyper-adapters -- hyper-networks that generate adapters from language and layer embeddings. While past work had poor results when scaling hyper-networks, we propose a rescaling fix that significantly improves convergence and enables training larger hyper-networks. We find that hyper-adapters are more parameter efficient than regular adapters, reaching the same performance with up to 12 times less parameters. When using the same number of parameters and FLOPS, our approach consistently outperforms regular adapters. Also, hyper-adapters converge faster than alternative approaches and scale better than regular dense networks. Our analysis shows that hyper-adapters learn to encode language relatedness, enabling positive transfer across languages.", "track": "Machine Translation", "label": 10, "url": "https://www.semanticscholar.org/reader/935a899b5428d5f3518a5b7ffec0c9ed0d219772?experiments=&features=reader_skimming%3Atrue"}, {"loc": [5.380457401275635, 12.177384376525879], "id": 1823, "title": "Z-LaVI: Zero-Shot Language Solver Fueled by Visual Imagination", "authors": "Yue Yang, Wenlin Yao, Hongming Zhang, Xiaoyang Wang, Dong Yu and Jianshu Chen", "abstract": "Large-scale pretrained language models have made significant advances in solving downstream language understanding tasks. However, they generally suffer from reporting bias, the phenomenon describing the lack of explicit commonsense knowledge in written text, e.g., ''an orange is orange''. To overcome this limitation, we develop a novel approach, Z-LaVI, to endow language models with visual imagination capabilities. Specifically, we leverage two complementary types of ''imaginations'': (i) recalling existing images through retrieval and (ii) synthesizing nonexistent images via text-to-image generation. Jointly exploiting the language inputs and the imagination, a pretrained vision-language model (e.g., CLIP) eventually composes a zero-shot solution to the original language tasks. Notably, fueling language models with imagination can effectively leverage visual knowledge to solve plain language tasks. In consequence, Z-LaVI consistently improves the zero-shot performance of existing language models across a diverse set of language tasks.", "track": "Speech, Vision, Robotics, Multimodal Grounding", "label": 7, "url": "https://www.semanticscholar.org/reader/c2a2b801e9091c33d50efd8758d3bcc2b05368ff?experiments=&features=reader_skimming%3Atrue"}, {"loc": [4.838489055633545, 3.3683929443359375], "id": 1833, "title": "Using Commonsense Knowledge to Answer Why-Questions", "authors": "Yash Kumar Lal, Niket Tandon, Tanvi Aggarwal, Horace Liu, Nathanael Chambers, Raymond Mooney and Niranjan Balasubramanian", "abstract": "Answering questions in narratives about {why events happened often requires commonsense knowledge external to the text. What aspects of this knowledge are available in large language models?  What aspects can be made accessible via external commonsense resources?  We study these questions in the context of answering questions in the TellMeWhy dataset using COMET as a source of relevant commonsense relations. We analyze the effects of model size (T5 and GPT3) along with methods of injecting knowledge (COMET) into these models. Results show that the largest models, as expected, yield substantial improvements over base models. Injecting external knowledge helps models of various sizes, but the amount of improvement decreases with larger model size. We also find that the format in which knowledge is provided is critical, and that smaller models benefit more from larger amounts of knowledge. Finally, we develop an ontology of knowledge types and analyze the relative coverage of the models across these categories.", "track": "Commonsense Reasoning", "label": 19, "url": ""}, {"loc": [5.727928161621094, 6.170063018798828], "id": 1834, "title": "Affective Idiosyncratic Responses to Music", "authors": "Sky CH-Wang, Evan Li, Oliver Li, Smaranda Muresan and Zhou Yu", "abstract": "Affective responses to music are highly personal. Despite consensus that idiosyncratic factors play a key role in regulating how listeners emotionally respond to music, precisely measuring the marginal effects of these variables has proved challenging. To address this gap, we develop computational methods to measure affective responses to music from over 403M listener comments on a Chinese social music platform. Building on studies from music psychology in systematic and quasi-causal analyses, we test for musical, lyrical, contextual, demographic, and mental health effects that drive listener affective responses. Finally, motivated by the social phenomenon known as \u7f51\u6291\u4e91 (w\u01ceng-y\u00ec-y\u00fan), we identify influencing factors of platform user self-disclosures, the social support they receive, and notable differences in discloser user activity.", "track": "Computational Social Science and Cultural Analytics", "label": 20, "url": "https://www.semanticscholar.org/reader/d8013589c4e260e45f76426fd7e2beb7d5cf7d4a?experiments=&features=reader_skimming%3Atrue"}, {"loc": [3.1884076595306396, 4.628033638000488], "id": 1846, "title": "Successive Prompting for Decomposing Complex Questions", "authors": "Dheeru Dua, Shivanshu Gupta, Sameer Singh and Matt Gardner", "abstract": "Answering complex questions that require making latent decisions is a challenging task, especially when limited supervision is available.  Recent works leverage the capabilities of large language models (LMs) to perform complex question answering in a few-shot setting by demonstrating how to output intermediate rationalizations while solving the complex question in a single pass.  We introduce ``Successive Prompting'' where, we iteratively break down a complex task into a simple task, solve it, and then repeat the process until we get the final solution. Successive prompting decouples the supervision for decomposing complex questions from the supervision for answering simple questions, allowing us to (1) have multiple opportunities to query in-context examples at each reasoning step (2) learn question decomposition separately from question answering, including using synthetic data, and (3) use bespoke (fine-tuned) components for reasoning steps where a large LM does not perform well. The intermediate supervision is typically manually written, which can be expensive to collect. We introduce a way to generate synthetic dataset which can be used to bootstrap model's ability to decompose and answer intermediate questions. Our best model (with successive prompting) achieves an improvement in F1 of ~5% when compared with a state-of-the-art model with synthetic augmentations and few-shot version of the DROP dataset.", "track": "Question Answering", "label": 11, "url": ""}, {"loc": [4.4579620361328125, 4.39894437789917], "id": 1864, "title": "Maieutic Prompting: Logically Consistent Reasoning with Recursive Explanations", "authors": "Jaehun Jung, Lianhui Qin, Sean Welleck, Faeze Brahman, Chandra Bhagavatula, Ronan Le Bras and Yejin Choi", "abstract": "Pre-trained language models (LMs) struggle with consistent reasoning; recently, prompting LMs to generate explanations that self-guide the inference has emerged as a promising direction to amend this. However, these approaches are fundamentally bounded by the correctness of explanations, which themselves are often noisy and inconsistent. In this work, we develop Maieutic Prompting, which aims to infer a correct answer to a question even from the unreliable generations of LM. Maieutic Prompting induces a tree of explanations abductively (e.g. X is true, because ...) and recursively, then frames the inference as a satisfiability problem over these explanations and their logical relations. We test Maieutic Prompting for true/false QA on three challenging benchmarks that require complex commonsense reasoning. Maieutic Prompting achieves up to 20% better accuracy than state-of-the-art prompting methods, and as a fully unsupervised approach, performs competitively with supervised models. We also show that Maieutic Prompting improves robustness in inference while providing interpretable rationales.", "track": "Commonsense Reasoning", "label": 19, "url": "https://www.semanticscholar.org/reader/50b0c6ee2b3d53ba5af69d6c00b5d60888a9026f?experiments=&features=reader_skimming%3Atrue"}, {"loc": [5.693565368652344, 10.654388427734375], "id": 1932, "title": "DANLI: Deliberative Agent for Following Natural Language Instructions", "authors": "Yichi Zhang, Jianing Yang, Jiayi Pan, Shane Storks, Nikhil Devraj, Ziqiao Ma, Keunwoo Peter Yu, Yuwei Bao and Joyce Chai", "abstract": "Recent years have seen an increasing amount of work on embodied AI agents that can perform tasks by following human language instructions. However, most of these agents are reactive, meaning that they simply learn and imitate behaviors encountered in the training data. These reactive agents are insufficient for long-horizon complex tasks. To address this limitation, we propose a neuro-symbolic deliberative agent that, while following language instructions, proactively applies reasoning and planning based on its neural and symbolic representations acquired from past experience (e.g., natural language and egocentric vision). We show that our deliberative agent achieves greater than 70% improvement over reactive baselines on the challenging TEACh benchmark. Moreover, the underlying reasoning and planning processes, together with our modular framework, offer impressive transparency and explainability to the behaviors of the agent. This enables an in-depth understanding of the agent's capabilities, which shed light on challenges and opportunities for future embodied agents for instruction following. The code is available at https://github.com/sled-group/DANLI.", "track": "Speech, Vision, Robotics, Multimodal Grounding", "label": 7, "url": "https://www.semanticscholar.org/reader/fc5631cdd08722f51e0ce4b718de0f081ae73603?experiments=&features=reader_skimming%3Atrue"}, {"loc": [6.734060287475586, 5.908910751342773], "id": 1943, "title": "Tracing Semantic Variation in Slang", "authors": "Zhewei Sun and Yang Xu", "abstract": "The meaning of a slang term can vary in different communities. However, slang semantic variation is not well understood and under-explored in the natural language processing of slang. One existing view argues that slang semantic variation is driven by culture-dependent communicative needs. An alternative view focuses on slang's social functions suggesting that the desire to foster semantic distinction may have led to the historical emergence of community-specific slang senses. We explore these theories using computational models and test them against historical slang dictionary entries, with a focus on characterizing regularity in the geographical variation of slang usages attested in the US and the UK over the past two centuries. We show that our models are able to predict the regional identity of emerging slang word meanings from historical slang records. We offer empirical evidence that both communicative need and semantic distinction play a role in the variation of slang meaning yet their relative importance fluctuates over the course of history. Our work offers an opportunity for incorporating historical cultural elements into the natural language processing of slang.", "track": "Linguistic Theories, Cognitive Modeling and Psycholinguistics", "label": 22, "url": ""}, {"loc": [2.0118186473846436, 8.20055103302002], "id": 1945, "title": "Fine-grained Category Discovery under Coarse-grained supervision with Hierarchical Weighted Self-contrastive Learning", "authors": "Wenbin An, Feng Tian, Ping Chen, Siliang Tang, Qinghua Zheng and QianYing Wang", "abstract": "Novel category discovery aims at adapting models trained on known categories to novel categories. Previous works only focus on the scenario where known and novel categories are of the same granularity.\nIn this paper, we investigate a new practical scenario called Fine-grained Category Discovery under Coarse-grained supervision (FCDC). FCDC aims at discovering fine-grained categories with only coarse-grained labeled data, which can adapt models to categories of different granularity from known ones and reduce significant labeling cost. \nIt is also a challenging task since supervised training on coarse-grained categories tends to focus on inter-class distance (distance between coarse-grained classes) but ignore intra-class distance (distance between fine-grained sub-classes) which is essential for separating fine-grained categories.\nConsidering most current methods cannot transfer knowledge from coarse-grained level to fine-grained level, we propose a hierarchical weighted self-contrastive network by building a novel weighted self-contrastive module and combining it with supervised learning in a hierarchical manner.\nExtensive experiments on public datasets show both effectiveness and efficiency of our model over compared methods.", "track": "Unsupervised and Weakly-Supervised Methods in NLP", "label": 17, "url": "https://www.semanticscholar.org/reader/d078a0fb395c4c964123790873c8c748a2a73463?experiments=&features=reader_skimming%3Atrue"}, {"loc": [5.595623970031738, 9.58731460571289], "id": 1964, "title": "PLM-based World Models for Text-based Games", "authors": "Minsoo Kim, Yeonjoon Jung, Dohyeon Lee and Seung-won Hwang", "abstract": "World models have improved the ability of reinforcement learning agents to operate in a sample efficient manner, by being trained to predict plausible changes in the underlying environment. As the core tasks of world models are future prediction and commonsense understanding, our claim is that  pre-trained language models (PLMs) already provide a strong base upon which to build world models. Worldformer is a recently proposed world model for text-based game environments, based only partially on PLM and transformers. Our distinction is to fully leverage PLMs as actionable world models in text-based game environments, by reformulating generation as constrained decoding which decomposes actions into verb templates and objects. We show that our model improves future valid action prediction and graph change prediction. Additionally, we show that our model better reflects commonsense than standard PLM.", "track": "NLP Applications", "label": 0, "url": ""}, {"loc": [7.959944725036621, 9.772128105163574], "id": 2041, "title": "Prompt-Based Meta-Learning For Few-shot Text Classification", "authors": "Haoxing Zhang, Xiaofeng Zhang, Haibo Huang and Lei Yu", "abstract": "Few-shot Text Classification predicts the semantic label of a given text with a handful of supporting instances. Current meta-learning methods have achieved satisfying results in various few-shot situations. Still, they often require a large amount of data to construct many few-shot tasks for meta-training, which is not practical in real-world few-shot scenarios. Prompt-tuning has recently proved to be another effective few-shot learner by bridging the gap between pre-train and downstream tasks. In this work, we closely combine the two promising few-shot learning methodologies in structure and propose a Prompt-Based Meta-Learning (PBML) model to overcome the above meta-learning problem by adding the prompting mechanism. PBML assigns label word learning to base-learners and template learning to meta-learner, respectively. Experimental results show state-of-the-art performance on four text classification datasets under few-shot settings, with higher accuracy and good robustness. We demonstrate through low-resource experiments that our method alleviates the shortcoming that meta-learning requires too much data for meta-training. In the end, we use the visualization to interpret and verify that the meta-learning framework can help the prompting method converge better. We release our code to reproduce our experiments.", "track": "Information Retrieval and Text Mining", "label": 15, "url": ""}, {"loc": [6.431832790374756, 7.517152786254883], "id": 2132, "title": "Geographic Citation Gaps in NLP Research", "authors": "Mukund Rungta, Janvijay Singh, Saif M. Mohammad and Diyi Yang", "abstract": "In a fair world, people have equitable opportunities to education, to conduct scientific research, to publish, and to get credit for their work, regardless of where they live. However, it is common knowledge among researchers that a vast number of papers accepted at top NLP venues come from a handful of western countries and (lately) China; whereas, very few papers from Africa and South America get published. Similar disparities are also believed to exist for paper citation counts. In the spirit of \"what we do not measure, we cannot improve\u201d, this work asks a series of questions on the relationship between geographical location and publication success (acceptance in top NLP venues and citation impact). We first created a dataset of 70,000 papers from the ACL Anthology, extracted their meta-information, and\ngenerated their citation network. We then show that not only are there substantial geographical disparities in paper acceptance and citation but also that these disparities persist even when controlling for a number of variables such as venue of publication and sub-field of NLP. Further, despite some steps taken by the NLP community to improve geographical diversity, we show that the disparity in publication metrics across locations is still on an increasing trend since the early 2000s. We release our code and dataset here: https://github.com/iamjanvijay/acl-cite-net", "track": "Theme Track", "label": 18, "url": "https://www.semanticscholar.org/reader/6f8ab0fa15c87cee55b2ca5b8877e6784887ddbf?experiments=&features=reader_skimming%3Atrue"}, {"loc": [4.683065414428711, 3.4136130809783936], "id": 2133, "title": "Language Models of Code are Few-Shot Commonsense Learners", "authors": "Aman Madaan, Shuyan Zhou, Uri Alon, Yiming Yang and Graham Neubig", "abstract": "We address the general task of structured commonsense reasoning: given a natural language input, the goal is to generate a graph such as an event or a reasoning-graph.\nTo employ large language models (LMs) for this task, existing approaches 'serialize' the output graph as a flat list of nodes and edges.\nAlthough feasible, these serialized graphs strongly deviate from the natural language corpora that LMs were pre-trained on, hindering LMs from generating them correctly. \nIn this paper, we show that when we instead frame structured commonsense reasoning tasks as code generation tasks, pre-trained LMs of code are better structured commonsense reasoners than LMs of natural language, even when the downstream task does not involve source code at all.\nWe demonstrate our approach across three diverse structured commonsense reasoning tasks. In all these natural language tasks, we show that using our approach, a code generation LM~(codex) outperforms natural-LMs that are fine-tuned on the target task (T5) and other strong LMs such as GPT-3 in the few-shot setting.", "track": "Commonsense Reasoning", "label": 19, "url": "https://www.semanticscholar.org/reader/14846d42a6ef7f37dd6c644aa8ea98ae582bc034?experiments=&features=reader_skimming%3Atrue"}, {"loc": [9.428143501281738, 8.06722640991211], "id": 2172, "title": "Numerical Optimizations for Weighted Low-rank Estimation on Language Models", "authors": "Ting Hua, Yen-Chang Hsu, Felicity Wang, Qian Lou, Yilin Shen and Hongxia Jin", "abstract": "Singular value decomposition (SVD) is one of the most popular compression methods that approximate a target matrix with smaller matrices. However, standard SVD treats the parameters within the matrix with equal importance, which is a simple but unrealistic assumption. The parameters of a trained neural network model may affect the task performance unevenly, which suggests non-equal importance among the parameters.  Compared to SVD, the decomposition method aware of parameter importance is the more practical choice in  real cases. Unlike standard SVD, weighed value decomposition is a non-convex optimization problem that lacks a closed-form solution. \nWe systematically investigated multiple optimization strategies to tackle the problem and examined our method by compressing Transformer-based language models.\nFurther, we designed a metric to predict when the SVD may introduce a significant performance drop, for which our method can be a rescue strategy.\nThe extensive evaluations demonstrate that our method can perform  better than current SOTA methods in compressing Transformer-based language models.", "track": "Machine Learning for NLP", "label": 3, "url": "https://www.semanticscholar.org/reader/294c3cbddbe827d4e2fd2084787502e2cf9f9e2d?experiments=&features=reader_skimming%3Atrue"}, {"loc": [1.8095660209655762, 3.8797428607940674], "id": 2196, "title": "Generative Multi-hop Retrieval", "authors": "Hyunji Lee, Sohee Yang, Hanseok Oh and Minjoon Seo", "abstract": "A common practice for text retrieval is to use an encoder to map the documents and the query to a common vector space and perform a nearest neighbor search (NNS); multi-hop retrieval also often adopts the same paradigm, usually with a modification of iteratively reformulating the query vector so that it can retrieve different documents at each hop. However, such a bi-encoder approach has limitations in multi-hop settings; (1) the reformulated query gets longer as the number of hops increases, which further tightens the embedding bottleneck of the query vector, and (2) it is prone to error propagation. In this paper, we focus on alleviating these limitations in multi-hop settings by formulating the problem in a fully generative way. We propose an encoder-decoder model that performs multi-hop retrieval by simply generating the entire text sequences of the retrieval targets, which means the query and the documents interact in the language model's parametric space rather than L2 or inner product space as in the bi-encoder approach. Our approach, Generative Multi-hop Retrieval (GMR), consistently achieves comparable or higher performance than bi-encoder models in five datasets while demonstrating superior GPU memory and storage footprint.", "track": "Information Retrieval and Text Mining", "label": 15, "url": "https://www.semanticscholar.org/reader/5e793ce1e3003cd42144e45b7d8db06a60b58ca2?experiments=&features=reader_skimming%3Atrue"}, {"loc": [4.989002704620361, 12.464166641235352], "id": 2204, "title": "Visual Spatial Description: Controlled Spatial-Oriented Image-to-Text Generation", "authors": "Yu Zhao, Jianguo Wei, ZhiChao Lin, Yueheng Sun, Meishan Zhang and Min Zhang", "abstract": "Image-to-text tasks such as open-ended image captioning and controllable image description have received extensive attention for decades. Here we advance this line of work further, presenting Visual Spatial Description (VSD), a new perspective for image-to-text toward spatial semantics. Given an image and two objects inside it, VSD aims to produce one description focusing on the spatial perspective between the two objects. Accordingly, we annotate a dataset manually to facilitate the investigation of the newly-introduced task, and then build several benchmark encoder-decoder models by using VL-BART and VL-T5 as backbones. In addition, we investigate visual spatial relationship classification (VSRC) information into our model by pipeline and end-to-end architectures. Finally, we conduct experiments on our benchmark dataset to evaluate all our models. Results show that our models are awe-inspiring, offering accurate and human-like spatial-oriented text descriptions. Besides, VSRC has great potential for VSD, and the joint end-to-end architecture is the better choice for their integration. We will make the dataset and codes publicly available for research purposes.", "track": "Natural Language Generation", "label": 6, "url": "https://www.semanticscholar.org/reader/0b574244f2ecea75a536106789f08d3c3c2590e0?experiments=&features=reader_skimming%3Atrue"}, {"loc": [2.911705255508423, 4.623122692108154], "id": 2221, "title": "M3: A Multi-View Fusion and Multi-Decoding Network for Multi-Document Reading Comprehension", "authors": "Liang Wen, Houfeng Wang, Yingwei Luo and Xiaolin Wang", "abstract": "Multi-document reading comprehension task requires collecting evidences from different documents for answering questions. Previous research works either use the extractive modeling method to naively integrate the scores from different documents on the encoder side or use the generative modeling method to collect the clues from different documents on the decoder side individually. However, any single modeling method cannot make full of the advantages of both. In this work, we propose a novel method that tries to employ a multi-view fusion and multi-decoding mechanism to achieve it. For one thing, our approach leverages question-centered fusion mechanism and cross-attention mechanism to gather fine-grained fusion of evidence clues from different documents in the encoder and decoder concurrently. For another, our method simultaneously employs both the extractive decoding approach and the generative decoding method to effectively guide the training process. Compared with existing methods, our method can perform both extractive decoding and generative decoding independently and optionally. Our experiments on two mainstream multi-document reading comprehension datasets (Natural Questions and TriviaQA) demonstrate that our method can provide consistent improvements over previous state-of-the-art methods.", "track": "Question Answering", "label": 11, "url": ""}, {"loc": [1.807599425315857, 3.897414207458496], "id": 2247, "title": "COCO-DR: Combating the Distribution Shift in Zero-Shot Dense Retrieval with Contrastive and Distributionally Robust Learning", "authors": "Yue Yu, Chenyan Xiong, Si Sun, Chao Zhang and Arnold Overwijk", "abstract": "We present a new zero-shot dense retrieval (ZeroDR) method, COCO-DR, to improve the generalization ability of dense retrieval by combating the distribution shifts between source training tasks and target scenarios. To mitigate the impact of document differences, COCO-DR continues pretraining the language model on the target corpora to adapt the model to target distributions via COtinuous COtrastive learning. To prepare for unseen target queries, COCO-DR leverages implicit  Distributionally Robust Optimization (iDRO) to reweight samples from different source query clusters for improving model robustness over rare queries during fine-tuning. \nCOCO-DR achieves superior average performance on BEIR, the zero-shot retrieval benchmark. \nAt BERT_Base scale, COCO-DR Base outperforms other ZeroDR models with 60x larger size. At BERT_Large scale, COCO-DR Large outperforms the giant GPT-3 embedding model which has 500x more parameters. Our analysis shows the correlation between COCO-DR's effectiveness in combating distribution shifts and improving zero-shot accuracy. Our code and model can be found at \\url{https://github.com/OpenMatch/COCO-DR}.", "track": "Information Retrieval and Text Mining", "label": 15, "url": ""}, {"loc": [7.300162315368652, 7.916706085205078], "id": 2256, "title": "Language Model Pre-Training with Sparse Latent Typing", "authors": "Liliang Ren, Zixuan Zhang, Han Wang, Clare Voss, ChengXiang Zhai and Heng Ji", "abstract": "Modern large-scale Pre-trained Language Models (PLMs) have achieved tremendous success on a wide range of downstream tasks. However, most of the LM pre-training objectives only focus on text reconstruction, but have not sought to learn latent-level interpretable representations of sentences. In this paper, we manage to push the language models to obtain a deeper understanding of sentences by proposing a new pre-training objective, Sparse Latent Typing, which enables the model to sparsely extract sentence-level keywords with diverse latent types. Experimental results show that our model is able to learn interpretable latent type categories in a self-supervised manner without using any external knowledge. Besides, the language model pre-trained with such an objective also significantly improves Information Extraction related downstream tasks in both supervised and few-shot settings. Our code is publicly available at https://github.com/renll/SparseLT .", "track": "Language Modeling and Analysis of Language Models", "label": 2, "url": ""}, {"loc": [7.718135833740234, 8.1510009765625], "id": 2260, "title": "On the Transformation of Latent Space in Fine-Tuned NLP Models", "authors": "Nadir Durrani, Hassan Sajjad, Fahim Dalvi and Firoj Alam", "abstract": "We study the evolution of latent space in fine-tuned NLP models. Different from the commonly used probing-framework, we opt for an unsupervised method to analyze representations. More specifically, we discover latent concepts in the representational space using hierarchical clustering. We \nthen use an alignment function to gauge the similarity between the latent space of a pre-trained model and its fine-tuned version. We use traditional linguistic concepts to facilitate our understanding and also study how the model space transforms towards task-specific information. We perform a thorough analysis, comparing pre-trained and fine-tuned models across three models and three downstream tasks. The notable findings of our work are: i) the latent space of the higher layers evolve towards task-specific concepts, ii) whereas the lower layers retain generic concepts acquired in the pre-trained model, iii) we discovered that some concepts in the higher layers acquire polarity towards the output class, and iv) that these concepts can be used for generating adversarial triggers.", "track": "Interpretability, Interactivity and Analysis of Models for NLP", "label": 9, "url": "https://www.semanticscholar.org/reader/94d931a253fb44b9d2f93d9287aec1bf8bdf0a4b?experiments=&features=reader_skimming%3Atrue"}, {"loc": [5.368982315063477, 7.537463665008545], "id": 2298, "title": "Watch the Neighbors: A Unified K-Nearest Neighbor Contrastive Learning Framework for OOD Intent Discovery", "authors": "Yutao Mou, Keqing He, Pei Wang, Yanan Wu, Jingang Wang, Wei Wu and Weiran Xu", "abstract": "Discovering out-of-domain (OOD) intent is important for developing new skills in task-oriented dialogue systems. The key challenges lie in how to transfer prior in-domain (IND) knowledge to OOD clustering, as well as jointly learn OOD representations and cluster assignments. Previous methods suffer from in-domain overfitting problem, and there is a natural gap between representation learning and clustering objectives. In this paper, we propose a unified K-nearest neighbor contrastive learning framework to discover OOD intents. Specifically, for IND pre-training stage, we propose a KCL objective to learn inter-class discriminative features, while maintaining intra-class diversity, which alleviates the in-domain overfitting problem. For OOD clustering stage, we propose a KCC method to form compact clusters by mining true hard negative samples, which bridges the gap between clustering and representation learning. Extensive experiments on three benchmark datasets show that our method achieves substantial improvements over the state-of-the-art methods.", "track": "Dialogue and Interactive Systems", "label": 4, "url": "https://www.semanticscholar.org/reader/f567ebbfac14034f8be570ed90164ddf531726e3?experiments=&features=reader_skimming%3Atrue"}, {"loc": [8.134905815124512, 3.016488790512085], "id": 2299, "title": "Extracted BERT Model Leaks More Information than You Think!", "authors": "Xuanli He, Lingjuan Lyu, Chen Chen and Qiongkai Xu", "abstract": "The collection and availability of big data, combined with advances in pre-trained models (e.g. BERT), have revolutionized the predictive performance of natural language processing tasks. This allows corporations to provide machine learning as a service (MLaaS) by encapsulating fine-tuned BERT-based models as APIs. Due to significant commercial interest, there has been a surge of attempts to steal remote services via model extraction. Although previous works have made progress in defending against model extraction attacks, there has been little discussion on their performance in preventing privacy leakage. This work bridges this gap by launching an attribute inference attack against the extracted BERT model. Our extensive experiments reveal that model extraction can cause severe privacy leakage even when victim models are facilitated with state-of-the-art defensive strategies.", "track": "Language Modeling and Analysis of Language Models", "label": 2, "url": ""}, {"loc": [5.44429349899292, 12.283903121948242], "id": 2327, "title": "Do Vision-and-Language Transformers Learn Grounded Predicate-Noun Dependencies?", "authors": "Mitja Nikolaus, Emmanuelle Salin, Stephane Ayache, Abdellah Fourtassi and Benoit Favre", "abstract": "Recent advances in vision-and-language modeling have seen the development of Transformer architectures that achieve remarkable performance on multimodal reasoning tasks.\nYet, the exact capabilities of these black-box models are still poorly understood. While much of previous work has focused on studying their ability to learn meaning at the word-level, their ability to track syntactic dependencies between words has received less attention.\nWe take a first step in closing this gap by creating a new multimodal task targeted at evaluating understanding of predicate-noun dependencies in a controlled setup.\nWe evaluate a range of state-of-the-art models and find that their performance on the task varies considerably, with some models performing relatively well and others at chance level. In an effort to explain this variability, our analyses indicate that the quality (and not only sheer quantity) of pretraining data is essential. Additionally, the best performing models leverage fine-grained multimodal pretraining objectives in addition to the standard image-text matching objectives.\nThis study highlights that targeted and controlled evaluations are a crucial step for a precise and rigorous test of the multimodal knowledge of vision-and-language models.", "track": "Ethic Concerns:Speech, Vision, Robotics, Multimodal Grounding", "label": 7, "url": "https://www.semanticscholar.org/reader/4c43063804ee1fac639c0b68e75745ccde0e5649?experiments=&features=reader_skimming%3Atrue"}, {"loc": [5.466250419616699, 4.917712211608887], "id": 2361, "title": "A Multilingual Perspective Towards the Evaluation of Attribution Methods in Natural Language Inference", "authors": "Kerem Zaman and Yonatan Belinkov", "abstract": "Most evaluations of attribution methods focus on the English language. In this work, we present a multilingual approach for evaluating attribution methods for the Natural Language Inference (NLI) task in terms of  faithfulness and plausibility.\nFirst, we introduce a novel cross-lingual strategy to measure faithfulness based on word alignments, which eliminates the drawbacks of erasure-based evaluations.\nWe then perform a comprehensive evaluation of attribution methods, considering different output mechanisms and aggregation methods.\nFinally, we augment the XNLI dataset with highlight-based explanations,  providing a multilingual NLI dataset with highlights, to support future exNLP studies. Our results show that attribution methods performing best for plausibility and faithfulness are different.", "track": "Interpretability, Interactivity and Analysis of Models for NLP", "label": 9, "url": "https://www.semanticscholar.org/reader/deb236200eacdc915f607f0c89971d1ddd6f26d5?experiments=&features=reader_skimming%3Atrue"}, {"loc": [8.924700736999512, 6.284296035766602], "id": 2400, "title": "Graph-Based Multilingual Label Propagation for Low-Resource Part-of-Speech Tagging", "authors": "Ayyoob ImaniGooghari, Silvia Severini, Masoud Jalili Sabet, Fran\u00e7ois Yvon and Hinrich Sch\u00fctze", "abstract": "Part-of-Speech (POS) tagging is an important component of the NLP pipeline, \nbut many low-resource languages lack labeled data for training.  An established method for training a POS tagger in such a scenario is to create a labeled training set by transferring from high-resource languages. In this paper, we propose a novel method for transferring labels from multiple high-resource source to low-resource target languages. We formalize POS tag projection as graph-based label propagation.  Given translations of a sentence in multiple languages, we create a graph with words as nodes and alignment links as edges by aligning words for all language pairs. We then propagate node labels from source to target using a Graph Neural Network augmented with transformer layers. \nWe show that our propagation creates training sets that allow us to train POS taggers for a diverse set of languages. When combined with enhanced contextualized embeddings, our method achieves a new \nstate-of-the-art for unsupervised POS tagging of low-resource languages.", "track": "Multilinguality", "label": 13, "url": ""}, {"loc": [4.753547191619873, 9.127262115478516], "id": 2430, "title": "SubeventWriter: Iterative Sub-event Sequence Generation with Coherence Controller", "authors": "Zhaowei Wang, Hongming Zhang, Tianqing Fang, Yangqiu Song, Ginny Y. Wong and Simon See", "abstract": "In this paper, we propose a new task of sub-event generation for an unseen process to evaluate the understanding of the coherence of sub-event actions and objects. To solve the problem, we design SubeventWriter, a sub-event sequence generation framework with a coherence controller. Given an unseen process, the framework can iteratively construct the sub-event sequence by generating one sub-event at each iteration. We also design a very effective coherence controller to decode more coherent sub-events. As our extensive experiments and analysis indicate, SubeventWriter can generate more reliable and meaningful sub-event sequences for unseen processes.", "track": "Natural Language Generation", "label": 6, "url": "https://www.semanticscholar.org/reader/3d7dccc8fcc7dc26fea7a44df428e1c2b96c988f?experiments=&features=reader_skimming%3Atrue"}, {"loc": [6.8713059425354, 9.872618675231934], "id": 2432, "title": "Infinite SCAN: An Infinite Model of Diachronic Semantic Change", "authors": "Seiichi Inoue, Mamoru Komachi, Toshinobu Ogiso, Hiroya Takamura and Daichi Mochihashi", "abstract": "In this study, we propose a Bayesian model that can jointly estimate the number of senses of words and their changes through time.\nThe model combines a dynamic topic model on Gaussian Markov random fields with a logistic stick-breaking process that realizes Dirichlet process. \nIn the experiments, we evaluated the proposed model in terms of interpretability, accuracy in estimating the number of senses, and tracking their changes using both artificial data and real data.\nWe quantitatively verified that the model behaves as expected through evaluation using artificial data.\nUsing the CCOHA corpus, we showed that our model outperforms the baseline model and investigated the semantic changes of several well-known target words.", "track": "Semantics: Lexical, Sentence level, Textual Inference and Other areas", "label": 8, "url": ""}, {"loc": [7.819373607635498, 8.551979064941406], "id": 2490, "title": "Learning Instructions with Unlabeled Data for Zero-Shot Cross-Task Generalization", "authors": "Yuxian Gu, Pei Ke, Xiaoyan Zhu and Minlie Huang", "abstract": "Training language models to learn from human instructions for zero-shot cross-task generalization has attracted much attention in NLP communities. Recently, instruction tuning (IT), which fine-tunes a pre-trained language model on a massive collection of tasks described via human-craft instructions, has been shown effective in instruction learning for unseen tasks. However, IT relies on a large amount of human-annotated samples, which restricts its generalization. Unlike labeled data, unlabeled data are often massive and cheap to obtain. In this work, we study how IT can be improved with unlabeled data. We first empirically explore the IT performance trends versus the number of labeled data, instructions, and training tasks. We find it critical to enlarge the number of training instructions, and the instructions can be underutilized due to the scarcity of labeled data. Then, we propose Unlabeled Data Augmented Instruction Tuning (UDIT) to take better advantage of the instructions during IT by constructing pseudo-labeled data from unlabeled plain texts. We conduct extensive experiments to show UDIT's effectiveness in various scenarios of tasks and datasets. We also comprehensively analyze the key factors of UDIT to investigate how to better improve IT with unlabeled data. The code is publicly available at https://github.com/thu-coai/UDIT.", "track": "Unsupervised and Weakly-Supervised Methods in NLP", "label": 17, "url": "https://www.semanticscholar.org/reader/82cd40e926300b6b18c34ced2edeb07e84d9d6c7?experiments=&features=reader_skimming%3Atrue"}, {"loc": [4.077859878540039, 7.372326850891113], "id": 2525, "title": "Counterfactual Data Augmentation via Perspective Transition for Open-Domain Dialogues", "authors": "Jiao Ou, Jinchao Zhang, Yang Feng and Jie Zhou", "abstract": "The construction of open-domain dialogue systems requires high-quality dialogue datasets. The dialogue data admits a wide variety of responses for a given dialogue history, especially responses with different semantics. However, collecting high-quality such a dataset in most scenarios is labor-intensive and time-consuming. In this paper, we propose a data augmentation method to automatically augment high-quality responses with different semantics by counterfactual inference. Specifically, given an observed dialogue, our counterfactual generation model first infers semantically different responses by replacing the observed reply perspective with substituted ones. Furthermore, our data selection method filters out detrimental augmented responses. Experimental results show that our data augmentation method can augment high-quality responses with different semantics for a given dialogue history, and can outperform competitive baselines on multiple downstream tasks.", "track": "Dialogue and Interactive Systems", "label": 4, "url": ""}, {"loc": [0.702044665813446, 6.691017150878906], "id": 2527, "title": "SQUIRE: A Sequence-to-sequence Framework for Multi-hop Knowledge Graph Reasoning", "authors": "Yushi Bai, Xin Lv, Juanzi Li, Lei Hou, Yincen Qu, zelin Dai and Feiyu Xiong", "abstract": "Multi-hop knowledge graph (KG) reasoning has been widely studied in recent years to provide interpretable predictions on missing links with evidential paths. Most previous works use reinforcement learning (RL) based methods that learn to navigate the path towards the target entity. However, these methods suffer from slow and poor convergence, and they may fail to infer a certain path when there is a missing edge along the path. Here we present SQUIRE, the first Sequence-to-sequence based multi-hop reasoning framework, which utilizes an encoder-decoder Transformer structure to translate the query to a path. Our framework brings about two benefits: (1) It can learn and predict in an end-to-end fashion, which gives better and faster convergence; (2) Our transformer model does not rely on existing edges to generate the path, and has the flexibility to complete missing edges along the path, especially in sparse KGs. Experiments on standard and sparse KGs show that our approach yields significant improvement over prior methods, while converging 4x-7x faster.", "track": "Information Extraction", "label": 5, "url": ""}, {"loc": [10.152667999267578, 7.764471054077148], "id": 2551, "title": "SpeechUT: Bridging Speech and Text with Hidden-Unit for Encoder-Decoder Based Speech-Text Pre-training", "authors": "Ziqiang Zhang, Long Zhou, Junyi Ao, Shujie Liu, Lirong Dai, Jinyu Li and Furu Wei", "abstract": "The rapid development of single-modal pre-training has prompted researchers to pay more attention to cross-modal pre-training methods. In this paper, we propose a unified-modal speech-unit-text pre-training model, SpeechUT, to connect the representations of a speech encoder and a text decoder with a shared unit encoder. Leveraging hidden-unit as an interface to align speech and text, we can decompose the speech-to-text model into a speech-to-unit model and a unit-to-text model, which can be jointly pre-trained with unpaired speech and text data respectively. Our proposed SpeechUT is fine-tuned and evaluated on automatic speech recognition (ASR) and speech translation (ST) tasks. Experimental results show that SpeechUT gets substantial improvements over strong baselines, and achieves state-of-the-art performance on both the LibriSpeech ASR and MuST-C ST tasks. To better understand the proposed SpeechUT, detailed analyses are conducted. The code and pre-trained models are available at https://aka.ms/SpeechUT.", "track": "Speech, Vision, Robotics, Multimodal Grounding", "label": 7, "url": "https://www.semanticscholar.org/reader/628fb0736c5484f7a0006d0bb2d4a7a2ef9ae6b3?experiments=&features=reader_skimming%3Atrue"}, {"loc": [7.337219715118408, 9.626974105834961], "id": 2647, "title": "Learning Label Modular Prompts for Text Classification in the Wild", "authors": "Hailin Chen, Amrita Saha, Shafiq Joty and Steven C.H. Hoi", "abstract": "Machine learning models usually assume i.i.d data during training and testing, but data and tasks  in real world often change over time. To emulate the transient nature of real world, we propose a challenging but practical task: text classification in-the-wild, which introduces different non-stationary training/testing stages. Decomposing a complex task into modular components can enable robust generalisation under such non-stationary environment. However, current modular approaches in NLP do not take advantage of recent advances in parameter efficient tuning of pretrained language models. To close this gap, we propose ModularPrompt, a label-modular prompt tuning framework for text classification tasks. In ModularPrompt, the input prompt consists of a sequence of soft label prompts, each encoding modular knowledge related to the corresponding class label. In two of most formidable settings, ModularPrompt outperforms relevant baselines by a large margin demonstrating strong generalisation ability. We also conduct comprehensive analysis to validate whether the learned prompts satisfy properties of a modular representation.", "track": "Efficient Methods for NLP", "label": 12, "url": ""}, {"loc": [8.282912254333496, 6.642906665802002], "id": 2669, "title": "Unbiased and Efficient Sampling of Dependency Trees", "authors": "Milo\u0161 Stanojevi\u0107", "abstract": "Most computational models of dependency syntax consist of distributions over spanning trees. However, the majority of dependency treebanks require that every valid dependency tree has a single edge coming out of the ROOT node, a constraint that is not part of the definition of spanning trees. For this reason all standard inference algorithms for spanning trees are sub-optimal for inference over dependency trees.\n\nZmigrod et al (2021) proposed algorithms for sampling with and without replacement from the dependency tree distribution that incorporate the single-root constraint. In this paper we show that their fastest algorithm for sampling with replacement, Wilson-RC, is in fact producing biased samples and we provide two alternatives that are unbiased. Additionally, we propose two algorithms (one incremental, one parallel) that reduce the asymptotic runtime of algorithm for sampling k trees without replacement to O(kn^3). These algorithms are both asymptotically and practically more efficient.", "track": "Syntax, Parsing and their Applications", "label": 23, "url": ""}, {"loc": [10.159270286560059, 7.069762229919434], "id": 2692, "title": "Continual Learning of Neural Machine Translation within Low Forgetting Risk Regions", "authors": "Shuhao Gu, Bojie Hu and Yang Feng", "abstract": "This paper considers continual learning of large-scale pretrained neural machine translation model without accessing the previous training data or introducing model separation.  We argue that the widely used regularization-based methods, which perform multi-objective learning with an auxiliary loss, suffer from the misestimate problem and cannot always achieve a good balance between the previous and new tasks. To solve the problem, we propose a two-stage training method based on the local features of the real loss. We first search low forgetting risk regions, where the model can retain the performance on the previous task as the parameters are updated, to avoid the catastrophic forgetting problem. Then we can continually train the model within this region only with the new training data to fit the new task. Specifically, we propose two methods to search the low forgetting risk regions, which are based on the curvature of loss and the impacts of the parameters on the model output, respectively. We conduct experiments on domain adaptation and more challenging language adaptation tasks, and the experimental results show that our method can achieve significant improvements compared with several strong baselines.", "track": "Machine Translation", "label": 10, "url": "https://www.semanticscholar.org/reader/b6ea823efc131c8a061ccaab9df7ee9aec746c21?experiments=&features=reader_skimming%3Atrue"}, {"loc": [8.888801574707031, 8.184469223022461], "id": 2741, "title": "COST-EFF: Collaborative Optimization of Spatial and Temporal Efficiency with Slenderized Multi-exit Language Models", "authors": "Bowen Shen, Zheng Lin, Yuanxin LIU, Zhengxiao Liu, Lei Wang and Weiping Wang", "abstract": "Transformer-based pre-trained language models (PLMs) mostly suffer from excessive overhead despite their advanced capacity. For resource-constrained devices, there is an urgent need for a spatially and temporally efficient model which retains the major capacity of PLMs. However, existing statically compressed models are unaware of the diverse complexities between input instances, potentially resulting in redundancy and inadequacy for simple and complex inputs. Also, miniature models with early exiting encounter challenges in the trade-off between making predictions and serving the deeper layers. Motivated by such considerations, we propose a collaborative optimization for PLMs that integrates static model compression and dynamic inference acceleration. Specifically, the PLM is slenderized in width while the depth remains intact, complementing layer-wise early exiting to speed up inference dynamically. To address the trade-off of early exiting, we propose a joint training approach that calibrates slenderization and preserves contributive structures to each exit instead of only the final layer. Experiments are conducted on GLUE benchmark and the results verify the Pareto optimality of our approach at high compression and acceleration rate with 1/8 parameters and 1/19 FLOPs of BERT.", "track": "Efficient Methods for NLP", "label": 12, "url": "https://www.semanticscholar.org/reader/7d0cda80884e1408e50e07ecae8001883eaf52c7?experiments=&features=reader_skimming%3Atrue"}, {"loc": [0.7676991820335388, 7.998960018157959], "id": 2794, "title": "Rescue Implicit and Long-tail Cases: Nearest Neighbor Relation Extraction", "authors": "Zhen Wan, Qianying Liu, Zhuoyuan Mao, Fei Cheng, Sadao Kurohashi and Jiwei Li", "abstract": "Relation extraction (RE) has achieved remarkable progress with the help of pre-trained language models. However, existing RE models are usually incapable of handling two situations: implicit expressions and long-tail relation types, caused by language complexity and data sparsity. In this paper, we introduce a simple enhancement of RE using $k$ nearest neighbors ($k$NN-RE). $k$NN-RE allows the model to consult training relations at test time through a nearest-neighbor search and provides a simple yet effective means to tackle the two issues above. Additionally, we observe that $k$NN-RE serves as an effective way to leverage distant supervision (DS) data for RE. Experimental results show that the proposed $k$NN-RE achieves state-of-the-art performances on a variety of supervised RE datasets, i.e., ACE05, SciERC, and Wiki80, along with outperforming the best model to date on the i2b2 and Wiki80 datasets in the setting of allowing using DS. Our code and models are available at: https://github.com/YukinoWan/kNN-RE.", "track": "Information Extraction", "label": 5, "url": "https://www.semanticscholar.org/reader/7ebcef65ea0e47df75f767fcf3255f06a4955c5e?experiments=&features=reader_skimming%3Atrue"}, {"loc": [4.661730766296387, 9.162493705749512], "id": 2802, "title": "StoryER: Automatic Story Evaluation via Ranking, Rating and Reasoning", "authors": "Hong Chen, Duc Vo, Hiroya Takamura, Yusuke Miyao and Hideki Nakayama", "abstract": "Existing automatic story evaluation methods place a premium on story lexical level coherence, deviating from human preference.\nWe go beyond this limitation by considering a novel Story Evaluation method that mimics human preference when judging a story, namely StoryER, which consists of three sub-tasks: Ranking, Rating and Reasoning.\nGiven either a machine-generated or a human-written story, StoryER requires the machine to output 1) a preference score that corresponds to human preference, 2) specific ratings and their corresponding confidences and 3) comments for various aspects (e.g., opening, character-shaping).\nTo support these tasks, we introduce a well-annotated dataset comprising (i) 100k ranked story pairs; and (ii) a set of 46k ratings and comments on various aspects of the story.\nWe finetune Longformer-Encoder-Decoder (LED) on the collected dataset, with the encoder responsible for preference score and aspect prediction and the decoder for comment generation.\nOur comprehensive experiments result a competitive benchmark for each task, showing the high correlation to human preference.\nIn addition, we have witnessed the joint learning of the preference scores, the aspect ratings, and the comments brings gain each single task.\nOur dataset and benchmarks are publicly available to advance the research of story evaluation tasks.", "track": "Resources and Evaluation", "label": 1, "url": ""}, {"loc": [3.994086265563965, 4.318916320800781], "id": 2807, "title": "Enhancing Self-Consistency and Performance of Pre-Trained Language Models through Natural Language Inference", "authors": "Eric A. Mitchell, Joseph Noh, Siyan Li, Will Armstrong, Ananth Agarwal, Patrick Liu, Chelsea B. Finn and Christopher D. Manning", "abstract": "While large pre-trained language models are powerful, their predictions often lack logical consistency across test inputs. For example, a state-of-the-art Macaw question-answering (QA) model answers <i>Yes</i> to <i>Is a sparrow a bird?</i> and <i>Does a bird have feet?</i> but answers <i>No</i> to <i>Does a sparrow have feet?</i>. To address this failure mode, we propose a framework, Consistency Correction through Relation Detection, or <b>ConCoRD</b>, for boosting the consistency and accuracy of pre-trained NLP models using pre-trained natural language inference (NLI) models without fine-tuning or re-training. Given a batch of test inputs, ConCoRD samples several candidate outputs for each input and instantiates a factor graph that accounts for both the model's belief about the likelihood of each answer choice in isolation and the NLI model's beliefs about pair-wise answer choice compatibility. We show that a weighted MaxSAT solver can efficiently compute high-quality answer choices under this factor graph, improving over the raw model's predictions. Our experiments demonstrate that ConCoRD consistently boosts accuracy and consistency of off-the-shelf closed-book QA and VQA models using off-the-shelf NLI models, notably increasing accuracy of LXMERT on ConVQA by 5% absolute. See the project website (https://ericmitchell.ai/emnlp-2022-concord/) for code and data.", "track": "Commonsense Reasoning", "label": 19, "url": "https://www.semanticscholar.org/reader/529e997e0d9730c25ad4347502da7e5a753274b8?experiments=&features=reader_skimming%3Atrue"}, {"loc": [7.596951961517334, 9.060623168945312], "id": 2827, "title": "Robustness of Demonstration-based Learning Under Limited Data Scenario", "authors": "Hongxin Zhang, Yanzhe Zhang, Ruiyi Zhang and Diyi Yang", "abstract": "Demonstration-based learning has shown great potential in stimulating pretrained language models' ability under limited data scenario. Simply augmenting the input with some demonstrations can significantly improve performance on few-shot NER. However, why such demonstrations are beneficial for the learning process remains unclear since there is no explicit alignment between the demonstrations and the predictions. In this paper, we design pathological demonstrations by gradually removing intuitively useful information from the standard ones to take a deep dive of the robustness of demonstration-based sequence labeling and show that (1) demonstrations composed of random tokens still make the model a better few-shot learner;  (2) the length of random demonstrations and the relevance of random tokens are the main factors affecting the performance; (3) demonstrations increase the confidence of model predictions on captured superficial patterns. We have publicly released our code at https://github.com/SALT-NLP/RobustDemo.", "track": "Interpretability, Interactivity and Analysis of Models for NLP", "label": 9, "url": "https://www.semanticscholar.org/reader/9a523de464d0096a4f2f722ecda5ef11a42bc6eb?experiments=&features=reader_skimming%3Atrue"}, {"loc": [6.362502098083496, 7.5349955558776855], "id": 2843, "title": "Modeling Information Change in Science Communication with Semantically Matched Paraphrases", "authors": "Dustin Wright, Jiaxin Pei, David Jurgens and Isabelle Augenstein", "abstract": "Whether the media faithfully communicate scientific information has long been a core issue to the science community. Automatically identifying paraphrased scientific findings could enable large-scale tracking and analysis of information changes in the science communication process, but this requires systems to understand the similarity between scientific information across multiple domains. To this end, we present the SCIENTIFIC PARAPHRASE AND INFORMATION CHANGE DATASET (SPICED), the first paraphrase dataset of scientific findings annotated for degree of information change. SPICED contains 6,000 scientific finding pairs extracted from news stories, social media discussions, and full texts of original papers. We demonstrate that SPICED poses a challenging task and that models trained on SPICED improve downstream performance on evidence retrieval for fact checking of real-world scientific claims. Finally, we show that models trained on SPICED can reveal large-scale trends in the degrees to which people and organizations faithfully communicate new scientific findings. Data, code, and pre-trained models are available at http://www.copenlu.com/publication/2022_emnlp_wright/.", "track": "Computational Social Science and Cultural Analytics", "label": 20, "url": "https://www.semanticscholar.org/reader/0b7cc0e510ef05ad394a36d9cee9ddf5f2ae912f?experiments=&features=reader_skimming%3Atrue"}, {"loc": [7.068703651428223, 6.371949195861816], "id": 2866, "title": "Word Order Matters When You Increase Masking", "authors": "Karim Lasri, Alessandro Lenci and Thierry Poibeau", "abstract": "Word order, an essential property of natural languages, is injected in Transformer-based neural language models using position encoding. However, recent experiments have shown that explicit position encoding is not always useful, since some models without such feature managed to achieve state-of-the art performance on some tasks. To understand better this phenomenon, we examine the effect of removing position encodings on the pre-training objective itself (i.e., masked language modelling), to test whether models can reconstruct position information from co-occurrences alone. We do so by controlling the amount of masked tokens in the input sentence, as a proxy to affect the importance of position information for the task. We find that the necessity of position information increases with the amount of masking, and that masked language models without position encodings are not able to reconstruct this information on the task. These findings point towards a direct relationship between the amount of masking and the ability of Transformers to capture order-sensitive aspects of language using position encoding.", "track": "Interpretability, Interactivity and Analysis of Models for NLP", "label": 9, "url": "https://www.semanticscholar.org/reader/ca0f43ae0e80deeac39b71822e63928b56031132?experiments=&features=reader_skimming%3Atrue"}, {"loc": [7.898085594177246, 3.3622450828552246], "id": 2902, "title": "An Empirical Analysis of Memorization in Fine-tuned Autoregressive Language Models", "authors": "Fatemehsadat Mireshghallah, Archit Uniyal, Tianhao Wang, David Evans and Taylor Berg-Kirkpatrick", "abstract": "Large language models are shown to present privacy risks through memorization of training data, and\nseveral recent works have studied such risks for the pre-training phase. Little attention, however, has been given to the fine-tuning phase and it is not well understood how different fine-tuning  methods (such as fine-tuning the full model, the model head, and adapter) compare in terms of memorization risk. This presents increasing concern as the ``pre-train and fine-tune'' paradigm proliferates. In this paper, we empirically study memorization of fine-tuning methods using membership inference and extraction attacks, and show that their susceptibility to attacks is very different. We observe that fine-tuning the head of the model has the highest susceptibility to attacks, whereas fine-tuning smaller adapters appears to be less vulnerable to known extraction attacks.", "track": "Ethics", "label": 21, "url": ""}, {"loc": [1.7898797988891602, 9.129376411437988], "id": 2980, "title": "Style Transfer as Data Augmentation: A Case Study on Named Entity Recognition", "authors": "Shuguang Chen, Leonardo Neves and Thamar Solorio", "abstract": "In this work, we take the named entity recognition task in the English language as a case study and explore style transfer as a data augmentation method to increase the size and diversity of training data in low-resource scenarios. We propose a new method to effectively transform the text from a high-resource domain to a low-resource domain by changing its style-related attributes to generate synthetic data for training. Moreover, we design a constrained decoding algorithm along with a set of key ingredients for data selection to guarantee the generation of valid and coherent data. Experiments and analysis on five different domain pairs under different data regimes demonstrate that our approach can significantly improve results compared to current state-of-the-art data augmentation methods. Our approach is a practical solution to data scarcity, and we expect it to be applicable to other NLP tasks.", "track": "Information Extraction", "label": 5, "url": "https://www.semanticscholar.org/reader/aea66d304c5126b9c5fb1fe4ea3360dc222877c4?experiments=&features=reader_skimming%3Atrue"}, {"loc": [6.037842273712158, 8.422521591186523], "id": 3005, "title": "Linguistic Corpus Annotation for Automatic Text Simplification Evaluation", "authors": "R\u00e9mi Cardon, Adrien Bibal, Rodrigo Wilkens, David Alfter, Magali Norr\u00e9, Adeline M\u00fcller, Patrick Watrin and Thomas Fran\u00e7ois", "abstract": "Evaluating automatic text simplification (ATS) systems is a difficult task that is either performed by automatic metrics or user-based evaluations. However, from a linguistic point-of-view, it is not always clear on what bases these evaluations operate. In this paper, we propose annotations of the ASSET corpus that can be used to shed more light on ATS evaluation. In addition to contributing with this resource, we show how it can be used to analyze SARI's behavior and to re-evaluate existing ATS systems. We present our insights as a step to improve ATS evaluation protocols in the future.", "track": "Resources and Evaluation", "label": 1, "url": ""}, {"loc": [0.7345057725906372, 6.453988552093506], "id": 3014, "title": "Semantic Framework based Query Generation for Temporal Question Answering over Knowledge Graphs", "authors": "Wentao Ding, Hao Chen, Huayu Li and Yuzhong Qu", "abstract": "Answering factual questions with temporal intent over knowledge graphs (temporal KGQA) attracts rising attention in recent years.\nIn the generation of temporal queries, existing KGQA methods ignore the fact that some intrinsic connections between events can make them temporally related, which may limit their capability.\nWe systematically analyze the possible interpretation of temporal constraints and conclude the interpretation structures as the Semantic Framework of Temporal Constraints, SF-TCons.\nBased on the semantic framework, we propose a temporal question answering method, SF-TQA, which generates query graphs by exploring the relevant facts of mentioned entities, where the exploring process is restricted by SF-TCons. \nOur evaluations show that SF-TQA significantly outperforms existing methods on two benchmarks over different knowledge graphs.", "track": "Question Answering", "label": 11, "url": "https://www.semanticscholar.org/reader/0060396cecfb5d684d51bbf015213d1daea52be4?experiments=&features=reader_skimming%3Atrue"}, {"loc": [4.241262912750244, 7.099575519561768], "id": 3039, "title": "There Is No Standard Answer: Knowledge-Grounded Dialogue Generation with Adversarial Activated Multi-Reference Learning", "authors": "Xueliang Zhao, Tingchen Fu, Chongyang Tao and Rui Yan", "abstract": "Knowledge-grounded dialogue (KGC) shows excellent potential to deliver an engaging and informative response. However, existing approaches emphasize selecting one golden knowledge given a particular dialogue context, overlooking the one-to-many phenomenon in dialogue. As a result, existing paradigm limits the diversity of knowledge selection and generation. To this end, we establish a multi-reference KGC dataset and propose a series of metrics to systematically assess the one-to-many efficacy of existing KGC models. Furthermore, to extend the hypothesis space of knowledge selection to enhance the mapping relationship between multiple knowledge and multiple responses, we devise a span-based variational model and optimize the model in a wake-sleep style with an ameliorated evidence lower bound objective to learn the one-to-many generalization. Both automatic and human evaluations demonstrate the efficacy of our approach.", "track": "Dialogue and Interactive Systems", "label": 4, "url": "https://www.semanticscholar.org/reader/b305c995821c6e9510b9c20e966bb9a6f4658bfe?experiments=&features=reader_skimming%3Atrue"}, {"loc": [5.774575710296631, 5.589908599853516], "id": 3079, "title": "Stop Measuring Calibration When Humans Disagree", "authors": "Joris Baan, Wilker Aziz, Barbara Plank and Raquel Fern\u00e1ndez", "abstract": "Calibration is a popular framework to evaluate whether a classifier knows when it does not know - i.e., its predictive probabilities are a good indication of how likely a prediction is to be correct. Correctness is commonly estimated against the human majority class. Recently, calibration to human majority has been measured on tasks where humans inherently disagree about which class applies. We show that measuring calibration to human majority given inherent disagreements is theoretically problematic, demonstrate this empirically on the ChaosNLI dataset, and derive several instance-level measures of calibration that capture key statistical properties of human judgements - including class frequency, ranking and entropy.", "track": "Interpretability, Interactivity and Analysis of Models for NLP", "label": 9, "url": ""}, {"loc": [3.9106900691986084, 4.222187042236328], "id": 3107, "title": "Improving compositional generalization for multi-step quantitative reasoning in question answering", "authors": "Armineh Nourbakhsh, Cathy Jiao, Sameena Shah and Carolyn Ros\u00e9", "abstract": "Quantitative reasoning is an important aspect of question answering, especially when numeric and verbal cues interact to indicate sophisticated, multi-step programs. In this paper, we demonstrate how modeling the compositional nature of quantitative text can enhance the performance and robustness of QA models, allowing them to capture arithmetic logic that is expressed verbally. Borrowing from the literature on semantic parsing, we propose a method that encourages the QA models to adjust their attention patterns and capture input/output alignments that are meaningful to the reasoning task. We show how this strategy improves program accuracy and renders the models more robust against overfitting as the number of reasoning steps grows. Our approach is designed as a standalone module which can be prepended to many existing models and trained in an end-to-end fashion without the need for additional supervisory signal. As part of this exercise, we also create a unified dataset building on four previously released numerical QA datasets over tabular data.", "track": "Question Answering", "label": 11, "url": ""}, {"loc": [7.016415596008301, 6.321554660797119], "id": 3114, "title": "A Comprehensive Comparison of Neural Networks as Cognitive Models of Inflection", "authors": "Adam Wiemerslage, Shiran Dudy and Katharina Kann", "abstract": "Neural networks have long been at the center of a debate around the cognitive mechanism by which humans process inflectional morphology. This debate has gravitated into NLP by way of the question: Are neural networks a feasible account for human behavior in morphological inflection?\nWe address that question by measuring the correlation between human judgments and neural network probabilities for unknown word inflections. We test a larger range of architectures than previously studied on two important tasks for the cognitive processing debate: English past tense, and German number inflection. We find evidence that the Transformer may be a better account of human behavior than LSTMs on these datasets, and that LSTM features known to increase inflection accuracy do not always result in more human-like behavior.", "track": "Linguistic Theories, Cognitive Modeling and Psycholinguistics", "label": 22, "url": "https://www.semanticscholar.org/reader/294a75d659657b4b3b1fb48e69bd9d09e485961c?experiments=&features=reader_skimming%3Atrue"}, {"loc": [9.819525718688965, 7.841202259063721], "id": 3124, "title": "Can Visual Context Improve Automatic Speech Recognition for an Embodied Agent?", "authors": "Pradip Pramanick and Chayan Sarkar", "abstract": "The usage of automatic speech recognition (ASR) systems are becoming omnipresent ranging from personal assistant to chatbots, home, and industrial automation systems, etc. Modern robots are also equipped with ASR capabilities for interacting with humans as speech is the most natural interaction modality. However, ASR in robots faces additional challenges as compared to a personal assistant. Being an embodied agent, a robot must recognize the physical entities around it and therefore reliably recognize the speech containing the description of such entities. However, current ASR systems are often unable to do so due to limitations in ASR training, such as generic datasets and open-vocabulary modeling. Also, adverse conditions during inference, such as noise, accented, and far-field speech makes the transcription inaccurate. In this work, we present a method to incorporate a robot's visual information into an ASR system and improve the recognition of a spoken utterance containing a visible entity. Specifically, we propose a new decoder biasing technique to incorporate the visual context while ensuring the ASR output does not degrade for incorrect context. We achieve a 59% relative reduction in WER from an unmodified ASR system.", "track": "Speech, Vision, Robotics, Multimodal Grounding", "label": 7, "url": "https://www.semanticscholar.org/reader/0340479e8ac5a93d55a917db81c160380634f247?experiments=&features=reader_skimming%3Atrue"}, {"loc": [9.098329544067383, 6.429450988769531], "id": 3165, "title": "AfroLID: A Neural Language Identification Tool for African Languages", "authors": "Ife Adebara, AbdelRahim Elmadany, Muhammad Abdul-Mageed and Alcides Alcoba Inciarte", "abstract": "Language identification (LID) is a crucial precursor for NLP, especially for mining web data. Problematically, most of the world's 7000+ languages today are not covered by LID technologies. We address this pressing issue for Africa by introducing AfroLID, a neural LID toolkit for 517 African languages and varieties. AfroLID exploits a multi-domain web dataset manually curated from across 14 language families utilizing five orthographic systems. When evaluated on our blind Test set, AfroLID achieves 95.89 F_1-score. We also compare AfroLID to five existing LID tools that each cover a small number of African languages, finding it to outperform them on most languages. We further show the utility of AfroLID in the wild by testing it on the acutely under-served Twitter domain. Finally, we offer a number of controlled case studies and perform a linguistically-motivated error analysis that allow us to both showcase AfroLID's powerful capabilities and limitations\\footnote{AfroLID is publicly available at \\href{https://github.com/UBC-NLP/afrolid}{https://github.com/UBC-NLP/afrolid}.\n}", "track": "Multilinguality", "label": 13, "url": "https://www.semanticscholar.org/reader/5f1264f4d170b74066f683259f92082aa6480a14?experiments=&features=reader_skimming%3Atrue"}, {"loc": [2.303135633468628, 7.357325077056885], "id": 3270, "title": "EvEntS ReaLM: Event Reasoning of Entity States via Language Models", "authors": "Evangelia Spiliopoulou, Artidoro Pagnoni, Yonatan Bisk and Eduard Hovy", "abstract": "This paper investigates models of event implications. Specifically, how well models predict entity state-changes, by targeting their understanding of physical attributes. Nominally, Large Language models (LLM) have been exposed to procedural knowledge about how objects interact, yet our benchmarking shows they fail to reason about the world. Conversely, we also demonstrate that existing approaches often misrepresent the surprising abilities of LLMs via improper task encodings and that proper model prompting can dramatically improve performance of reported baseline results across multiple tasks. In particular, our results indicate that our prompting technique is especially useful for unseen attributes (out-of-domain) or when only limited data is available.", "track": "Commonsense Reasoning", "label": 19, "url": "https://www.semanticscholar.org/reader/748a2700ec11f51560a69ec05c67ca9f97014be7?experiments=&features=reader_skimming%3Atrue"}, {"loc": [2.5373737812042236, 8.691519737243652], "id": 3279, "title": "Large language models are few-shot clinical information extractors", "authors": "Monica Agrawal, Stefan Hegselmann, Hunter Lang, Yoon Kim and David Sontag", "abstract": "A long-running goal of the clinical NLP community is the extraction of important variables trapped in clinical notes. However, roadblocks have included dataset shift from the general domain and a lack of public clinical corpora and annotations. In this work, we show that large language models, such as InstructGPT (Ouyang et al., 2022), perform well at zero- and few-shot information extraction from clinical text despite not being trained specifically for the clinical domain. Whereas text classification and generation performance have already been studied extensively in such models, here we additionally demonstrate how to leverage them to tackle a diverse set of NLP tasks which require more structured outputs, including span identification, token-level sequence classification, and relation extraction. Further, due to the dearth of available data to evaluate these systems, we introduce new datasets for benchmarking few-shot clinical information extraction based on a manual re-annotation of the CASI dataset (Moon et al., 2014) for new tasks. On the clinical extraction tasks we studied, the GPT-3 systems significantly outperform existing zero- and few-shot baselines.", "track": "NLP Applications", "label": 0, "url": ""}, {"loc": [5.423282146453857, 8.458403587341309], "id": 3285, "title": "Towards a Unified Multi-Dimensional Evaluator for Text Generation", "authors": "Ming Zhong, Yang Liu, Da Yin, Yuning Mao, Yizhu Jiao, Pengfei Liu, Chenguang Zhu, Heng Ji and Jiawei Han", "abstract": "Multi-dimensional evaluation is the dominant paradigm for human evaluation in Natural Language Generation (NLG), i.e., evaluating the generated text from multiple explainable dimensions, such as coherence and fluency. However, automatic evaluation in NLG is still dominated by similarity-based metrics, and we lack a reliable framework for a more comprehensive evaluation of advanced models. In this paper, we propose a unified multi-dimensional evaluator UniEval for NLG. We re-frame NLG evaluation as a Boolean Question Answering (QA) task, and by guiding the model with different questions, we can use one evaluator to evaluate from multiple dimensions. Furthermore, thanks to the unified Boolean QA format, we are able to introduce an intermediate learning phase that enables UniEval to incorporate external knowledge from multiple related tasks and gain further improvement. Experiments on three typical NLG tasks show that UniEval correlates substantially better with human judgments than existing metrics. Specifically, compared to the top-performing unified evaluators, UniEval achieves a 23% higher correlation on text summarization, and over 43% on dialogue response generation. Also, UniEval demonstrates a strong zero-shot learning ability for unseen evaluation dimensions and tasks. Source code, data, and all pre-trained evaluators are available at https://github.com/maszhongming/UniEval.", "track": "Natural Language Generation", "label": 6, "url": "https://www.semanticscholar.org/reader/041f5dbfcd07a3369ac44a6b902ee4b145eccf2b?experiments=&features=reader_skimming%3Atrue"}, {"loc": [4.924619674682617, 3.515523910522461], "id": 3331, "title": "GeoMLAMA: Geo-Diverse Commonsense Probing on Multilingual Pre-Trained Language Models", "authors": "Da Yin, Hritik Bansal, Masoud Monajatipoor, Liunian Harold Li and Kai-Wei Chang", "abstract": "Recent work has shown that Pre-trained Language Models (PLMs) store the relational knowledge learned from data and utilize it for performing downstream tasks. However, commonsense knowledge across different regions may vary. For instance, the color of bridal dress is white in American weddings whereas it is red in Chinese weddings. In this paper, we introduce a benchmark dataset, Geo-diverse Commonsense Multilingual Language Models Analysis (GeoMLAMA), for probing the diversity of the relational knowledge in multilingual PLMs. GeoMLAMA contains 3125 prompts in English, Chinese, Hindi, Persian, and Swahili, with a wide coverage of concepts shared by people from American, Chinese, Indian, Iranian and Kenyan cultures. We benchmark 11 standard multilingual PLMs on GeoMLAMA. Interestingly, we find that 1) larger multilingual PLMs variants do not necessarily store geo-diverse concepts better than its smaller variant; 2) multilingual PLMs are not intrinsically biased towards knowledge from the Western countries (the United States); 3) the native language of a country may not be the best language to probe its knowledge and 4) a language may better probe knowledge about a non-native country than its native country.", "track": "Commonsense Reasoning", "label": 19, "url": ""}, {"loc": [9.025883674621582, 6.288629531860352], "id": 3370, "title": "The (Undesired) Attenuation of Human Biases by Multilinguality", "authors": "Cristina Espa\u00f1a-Bonet and Alberto Barr\u00f3n-Cede\u00f1o", "abstract": "Some human preferences are universal. The odor of vanilla is perceived as pleasant all around the world. We expect neural models trained on human texts to exhibit these kind of preferences, i.e. biases, but we show that this is not always the case. We explore 16 static and contextual embedding models in 9 languages and, when possible, compare them under similar training conditions. We introduce and release CA-WEAT, multilingual cultural aware tests to quantify biases, and compare them to previous English-centric tests. Our experiments confirm that monolingual static embeddings do exhibit human biases, but values differ across languages, being far from universal. Biases are less evident in contextual models, to the point that the original human association might be reversed. Multilinguality proves to be another variable that attenuates and even reverses the effect of the bias, specially in contextual multilingual models. In order to explain this variance among models and languages, we examine the effect of asymmetries in the training corpus, departures from isomorphism in multilingual embedding spaces and discrepancies in the testing measures between languages.", "track": "Multilinguality", "label": 13, "url": ""}, {"loc": [4.161087989807129, 4.456340789794922], "id": 3374, "title": "Entailer: Answering Questions with Faithful and Truthful Chains of Reasoning", "authors": "Oyvind Tafjord, Bhavana Dalvi Mishra and Peter Clark", "abstract": "Our goal is a question-answering (QA) system that can show how its answers are implied by its own internal beliefs via a systematic chain of reasoning. Such a capability would allow better understanding of why a model produced the answer it did. Our approach is to recursively combine a trained backward-chaining\nmodel, capable of generating a set of premises entailing an answer hypothesis, with a verifier that checks that the model itself believes those premises (and the entailment itself) through self-querying. To our knowledge, this is the first system to generate multistep chains that are both faithful (the answer follows from the reasoning) and truthful (the chain reflects the system's own internal beliefs). In evaluation using two different datasets, users judge that a majority (70%+) of generated chains clearly show how an answer follows from a set of facts - substantially better than a high-performance baseline - while preserving answer accuracy. By materializing model beliefs that systematically support an answer, new opportunities arise for understanding the model's system of belief, and diagnosing and correcting its misunderstandings when an answer is wrong.", "track": "Interpretability, Interactivity and Analysis of Models for NLP", "label": 9, "url": "https://www.semanticscholar.org/reader/d400a649f0f0a3de22b89a268f48aff2dcb06a09?experiments=&features=reader_skimming%3Atrue"}, {"loc": [5.532333850860596, 8.517032623291016], "id": 3389, "title": "Near-Negative Distinction: Giving a Second Life to Human Evaluation Datasets", "authors": "Philippe Laban, Chien-Sheng Wu, Wenhao Liu and Caiming Xiong", "abstract": "Precisely assessing the progress in natural language generation (NLG) tasks is challenging, and human evaluation to establish a preference in a model's output over another is often necessary.\nHowever, human evaluation is usually costly, difficult to reproduce, and non-reusable.\nIn this paper, we propose a new and simple automatic evaluation method for NLG called Near-Negative Distinction (NND) that repurposes prior human annotations into NND tests.\nIn an NND test, an NLG model must place a higher likelihood on a high-quality output candidate than on a near-negative candidate with a known error.\nModel performance is established by the number of NND tests a model passes, as well as the distribution over task-specific errors the model fails on.\nThrough experiments on three NLG tasks (question generation, question answering, and summarization), we show that NND achieves a higher correlation with human judgments than standard NLG evaluation metrics. We then illustrate NND evaluation in four practical scenarios, for example performing fine-grain model analysis, or studying model training dynamics. Our findings suggest that NND can give a second life to human annotations and provide low-cost NLG evaluation.", "track": "Resources and Evaluation", "label": 1, "url": "https://www.semanticscholar.org/reader/79032fc08981bbb0ae9ae353f399f0df8bdd25ee?experiments=&features=reader_skimming%3Atrue"}, {"loc": [7.588822841644287, 12.390138626098633], "id": 3425, "title": "ToKen: Task Decomposition and Knowledge Infusion for Few-Shot Hate Speech Detection", "authors": "Badr AlKhamissi, Faisal Ladhak, Srinivasan Iyer, Veselin Stoyanov, Zornitsa Kozareva, Xian Li, Pascale Fung, Lambert Mathias, Asli Celikyilmaz and Mona Diab", "abstract": "Hate speech detection is complex; it relies on commonsense reasoning, knowledge of stereotypes, and an understanding of social nuance that differs from one culture to the next. It is also difficult to collect a large-scale hate speech annotated dataset. In this work, we frame this problem as a few-shot learning task, and show significant gains with decomposing the task into its \"constituent\" parts. In addition, we see that infusing knowledge from reasoning datasets (e.g. ATOMIC2020) improves the performance even further. Moreover, we observe that the trained models generalize to out-of-distribution datasets, showing the superiority of task decomposition and knowledge infusion compared to previously used methods. Concretely, our method outperforms the baseline by 17.83% absolute gain in the 16-shot case.", "track": "NLP Applications", "label": 0, "url": "https://www.semanticscholar.org/reader/61349749b9dda9d9299f0c232a070301428c1039?experiments=&features=reader_skimming%3Atrue"}, {"loc": [5.42059850692749, 5.067257881164551], "id": 3434, "title": "Are Hard Examples also Harder to Explain? A Study with Human and Model-Generated Explanations", "authors": "Swarnadeep Saha, Peter Hase, Nazneen Rajani and Mohit Bansal", "abstract": "Recent work on explainable NLP has shown that few-shot prompting can enable large pre-trained language models (LLMs) to generate grammatical and factual natural language explanations for data labels. In this work, we study the connection between explainability and sample hardness by investigating the following research question -- \"Are LLMs and humans equally good at explaining data labels for both easy and hard samples?\" We answer this question by first collecting human-written explanations in the form of generalizable commonsense rules on the task of Winograd Schema Challenge (Winogrande dataset). We compare these explanations with those generated by GPT-3 while varying the hardness of the test samples as well as the in-context samples. We observe that (1) GPT-3 explanations are as grammatical as human explanations regardless of the hardness of the test samples, (2) for easy examples, GPT-3 generates highly supportive explanations but human explanations are more generalizable, and (3) for hard examples, human explanations are significantly better than GPT-3 explanations both in terms of label-supportiveness and generalizability judgements. We also find that hardness of the in-context examples impacts the quality of GPT-3 explanations. Finally, we show that the supportiveness and generalizability aspects of human explanations are also impacted by sample hardness, although by a much smaller margin than models.", "track": "Interpretability, Interactivity and Analysis of Models for NLP", "label": 9, "url": "https://www.semanticscholar.org/reader/0040dac7a1bf7a1eeb01c86ddb993f331f35b158?experiments=&features=reader_skimming%3Atrue"}, {"loc": [4.569742202758789, 5.574893474578857], "id": 3463, "title": "Stanceosaurus: Classifying Stance Towards Multicultural Misinformation", "authors": "Jonathan Qiaoyi Zheng, Ashutosh Baheti, Tarek Naous, Wei Xu and Alan Ritter", "abstract": "We present Stanceosaurus, a new corpus of 28,033 tweets in English, Hindi and Arabic annotated with stance towards 250 misinformation claims. As far as we are aware, it is the largest corpus annotated with stance towards misinformation claims. The claims in Stanceosaurus originate from 15 fact-checking sources that cover diverse geographical regions and cultures. Unlike existing stance datasets, we introduce a more fine-grained 5-class labeling strategy with additional subcategories to distinguish implicit stance. Pre-trained transformer-based stance classifiers that are fine-tuned on our corpus show good generalization on unseen claims and regional claims from countries outside the training data. Cross-lingual experiments demonstrate Stanceosaurus' capability of training multilingual models, achieving 53.1 F1 on Hindi and 50.4 F1 on Arabic without any target-language fine-tuning. Finally, we show how a domain adaptation method can be used to improve performance on Stanceosaurus using additional RumourEval-2019 data. We will make Stanceosaurus publicly available to the research community upon publication and hope it will encourage further work on misinformation identification across languages and cultures.", "track": "Resources and Evaluation", "label": 1, "url": ""}, {"loc": [6.055968284606934, 5.8220953941345215], "id": 3465, "title": "Gendered Mental Health Stigma in Masked Language Models", "authors": "Wanyin Lin, Lucille Njoo, Anjalie Field, Ashish Sharma, Katharina Reinecke, Tim Althoff and Yulia Tsvetkov", "abstract": "Mental health stigma prevents many individuals from receiving the appropriate care, and social psychology studies have shown that mental health tends to be overlooked in men. In this work, we investigate gendered mental health stigma in masked language models. In doing so, we operationalize mental health stigma by developing a framework grounded in psychology research: we use clinical psychology literature to curate prompts, then evaluate the models' propensity to generate gendered words. We find that masked language models capture societal stigma about gender in mental health: models are consistently more likely to predict female subjects than male in sentences about having a mental health condition (32% vs. 19%), and this disparity is exacerbated for sentences that indicate treatment-seeking behavior. Furthermore, we find that different models capture dimensions of stigma differently for men and women, associating stereotypes like anger, blame, and pity more with women with mental health conditions than with men. In showing the complex nuances of models' gendered mental health stigma, we demonstrate that context and overlapping dimensions of identity are important considerations when assessing computational models' social biases.", "track": "Ethics", "label": 21, "url": "https://www.semanticscholar.org/reader/4bf6f629eda8301b2e1339401678af952dd9bfb1?experiments=&features=reader_skimming%3Atrue"}, {"loc": [1.7344635725021362, 3.818256139755249], "id": 3496, "title": "Efficient Nearest Neighbor Search for Cross-Encoder Models using Matrix Factorization", "authors": "Nishant Yadav, Nicholas Monath, Rico Angell, Manzil Zaheer and Andrew McCallum", "abstract": "Efficient k-nearest neighbor search is a fundamental task, foundational for many problems in NLP.  When the similarity is measured by dot-product between dual-encoder vectors or L2-distance, there already exist many scalable and efficient search methods.  But not so when similarity is measured by more accurate and expensive black-box neural similarity models, such as cross-encoders, which jointly encode the query and candidate neighbor. The cross-encoders' high computational cost typically limits their use to reranking candidates retrieved by a cheaper model, such as dual encoder or TF-IDF.  However, the accuracy of such a two-stage approach is upper-bounded by the recall of the initial candidate set, and potentially requires additional training to align the auxiliary retrieval model with the cross-encoder model. In this paper, we present an approach that avoids the use of a dual-encoder for retrieval, relying solely on the cross-encoder.  Retrieval is made efficient with CUR decomposition, a matrix decomposition approach that approximates all pairwise cross-encoder distances from a small subset of rows and columns of the distance matrix. Indexing items using our approach is computationally cheaper than training an auxiliary dual-encoder model through distillation. Empirically, for k > 10, our approach provides test-time recall-vs-computational cost trade-offs superior to the current widely-used methods that re-rank items retrieved using a dual-encoder or TF-IDF.", "track": "Machine Learning for NLP", "label": 3, "url": "https://www.semanticscholar.org/reader/280eda29f3704b53f3488497c43983c131574c3e?experiments=&features=reader_skimming%3Atrue"}, {"loc": [5.928123950958252, 9.137007713317871], "id": 3501, "title": "Prompt-and-Rerank: A Method for Zero-Shot and Few-Shot Arbitrary Textual Style Transfer with Small Language Models", "authors": "Mirac Suzgun, Luke Melas-Kyriazi and Dan Jurafsky", "abstract": "We propose a method for arbitrary textual style transfer (TST)\u2014the task of transforming a text into any given style\u2014utilizing general-purpose pre-trained language models. Our method, Prompt-and-Rerank, is based on a mathematical formulation of the TST task, decomposing it into three constituent components: textual similarity, target style strength, and fluency. Our method uses zero-shot or few-shot prompting to obtain a set of candidate generations in the target style, and then re-ranks them according to the three components. Our method enables small pre-trained language models to perform on par with state-of-the-art large-scale models while using two orders of magnitude less compute and memory. We also investigate the effect of model size and prompt design (e.g., prompt paraphrasing and delimiter-pair choice) on style transfer quality across seven diverse textual style transfer datasets, finding, among other things, that delimiter-pair choice has a large impact on performance, and that models have biases on the direction of style transfer.", "track": "Natural Language Generation", "label": 6, "url": "https://www.semanticscholar.org/reader/0d6bb585493e34975f0437faa3179db3a02f6ae8?experiments=&features=reader_skimming%3Atrue"}, {"loc": [3.2644262313842773, 4.88023042678833], "id": 3523, "title": "Learning to Decompose: Hypothetical Question Decomposition Based on Comparable Texts", "authors": "Ben Zhou, Kyle Richardson, Xiaodong Yu and Dan Roth", "abstract": "Explicit decomposition modeling, which involves breaking down complex tasks into more straightforward and often more interpretable sub-tasks, has long been a central theme in developing robust and interpretable NLU systems. However, despite the many datasets and resources built as part of this effort, the majority have small-scale annotations and limited scope, which is insufficient to solve general decomposition tasks. In this paper, we look at large-scale intermediate pre-training of decomposition-based transformers using distant supervision from comparable texts, particularly large-scale parallel news. We show that with such intermediate pre-training, developing robust decomposition-based models for a diverse range of tasks becomes more feasible. For example, on semantic parsing, our model, DecompT5, improves 20% to 30% on two datasets, Overnight and TORQUE, over the baseline language model. We further use DecompT5 to build a novel decomposition-based QA system named DecompEntail, improving over state-of-the-art models, including GPT-3, on both HotpotQA and StrategyQA by 8% and 4%, respectively.", "track": "Question Answering", "label": 11, "url": ""}, {"loc": [5.273123264312744, 12.32708740234375], "id": 3541, "title": "Why is Winoground Hard? Investigating Failures in Visuolinguistic Compositionality", "authors": "Anuj Diwan, Layne Berry, Eunsol Choi, David Harwath and Kyle Mahowald", "abstract": "Recent visuolinguistic pre-trained models show promising progress on various end tasks such as image retrieval and video captioning. Yet, they fail miserably on the recently proposed Winoground dataset, which challenges models to match paired images and English captions, with items constructed to overlap lexically but differ in meaning (e.g., \"there is a mug in some grass\" vs. \"there is some grass in a mug\"). By annotating the dataset using new fine-grained tags, we show that solving the Winoground task requires not just compositional language understanding, but a host of other abilities like commonsense reasoning or locating small, out-of-focus objects in low-resolution images. In this paper, we identify the dataset's main challenges through a suite of experiments on related tasks (probing task, image retrieval task), data augmentation, and manual inspection of the dataset. Our analysis suggests that a main challenge in visuolinguistic models may lie in fusing visual and textual representations, rather than in compositional language understanding. We release our annotation and code at https://github.com/ajd12342/why-winoground-hard.", "track": "Speech, Vision, Robotics, Multimodal Grounding", "label": 7, "url": ""}, {"loc": [5.912754058837891, 8.834760665893555], "id": 3614, "title": "Gradient-based Constrained Sampling from Language Models", "authors": "Sachin Kumar, Biswajit Paria and Yulia Tsvetkov", "abstract": "Large pretrained language models are successful at generating fluent text but are notoriously hard to controllably sample from. In this work, we study constrained sampling from such language models, i.e., generating text that satisfies user-defined constraints, while maintaining fluency and model's performance in a downstream task. \nWe propose MuCoLa---a sampling procedure that combines the log-likelihood of the language model with arbitrary (differentiable) constraints in a single energy function, and then generates samples in a non-autoregressive manner. \nSpecifically, it initializes the entire output sequence with noise and follows a Markov chain defined by Langevin Dynamics using the gradients of this energy. \nWe evaluate MuCoLa on text generation with soft and hard constraints as well as their combinations, obtaining significant improvements over competitive baselines for toxicity avoidance, sentiment control, and keyword-guided generation.", "track": "Natural Language Generation", "label": 6, "url": "https://www.semanticscholar.org/reader/f1e56def812bc398d1b2b8c9a7ea6a623abd38e5?experiments=&features=reader_skimming%3Atrue"}, {"loc": [3.9820315837860107, 4.211977958679199], "id": 3617, "title": "TaCube: Pre-computing Data Cubes for Answering Numerical-Reasoning Questions over Tabular Data", "authors": "Fan Zhou, Mengkang Hu, Haoyu Dong, zhoujun cheng, Fan Cheng, Shi Han and Dongmei Zhang", "abstract": "Existing auto-regressive pre-trained language models (PLMs) like T5 and BART, have been well applied to table question answering by UNIFIEDSKG and TAPEX, respectively, and demonstrated state-of-the-art results on multiple benchmarks. However, auto-regressive PLMs are challenged by recent emerging numerical reasoning datasets, such as TAT-QA, due to the error-prone implicit calculation. In this paper, we present TaCube, to pre-compute aggregation/arithmetic results for the table in advance, so that they are handy and readily available for PLMs to answer numerical reasoning questions. TaCube systematically and comprehensively covers a collection of computational operations over table segments. By simply concatenating TaCube to the input sequence of PLMs, it shows significant experimental effectiveness. TaCube promotes the F1 score from 49.6% to 66.2% on TAT-QA and achieves new state-of-the-art results on WikiTQ (59.6% denotation accuracy). TaCube's improvements on numerical reasoning cases are even more notable: on TAT-QA, TaCube promotes the exact match accuracy of BART-large by 39.6% on sum, 52.5% on average, 36.6% on substraction, and 22.2% on division. We believe that TaCube is a general and portable pre-computation solution that can be potentially integrated to various numerical reasoning frameworks", "track": "Question Answering", "label": 11, "url": "https://www.semanticscholar.org/reader/52b3087525b262f6f467453e22fdfa843353d40c?experiments=&features=reader_skimming%3Atrue"}, {"loc": [4.996258735656738, 3.7615697383880615], "id": 3636, "title": "Rich Knowledge Sources Bring Complex Knowledge Conflicts: Recalibrating Models to Reflect Conflicting Evidence", "authors": "Hung-Ting Chen, Michael Zhang and Eunsol Choi", "abstract": "Question answering models can use rich knowledge sources \u2014 up to one hundred retrieved passages and parametric knowledge in the large-scale language model (LM). Prior work assumes information in such knowledge sources is consistent with each other, paying little attention to how models blend information stored in their LM parameters with that from retrieved evidence documents. In this paper, we simulate knowledge conflicts (i.e., where parametric knowledge suggests one answer and different passages suggest different answers) and examine model behaviors. We find retrieval performance heavily impacts which sources models rely on, and current models mostly rely on non-parametric knowledge\nin their best-performing settings. We discover a troubling trend that contradictions among knowledge sources affect model confidence only marginally. To address this issue, we present a new calibration study, where models are discouraged from presenting any single answer when presented with multiple conflicting answer candidates in retrieved evidences.", "track": "Question Answering", "label": 11, "url": "https://www.semanticscholar.org/reader/5b70e69b65b29d231d37bea354b25c05daec07e2?experiments=&features=reader_skimming%3Atrue"}, {"loc": [7.945428848266602, 8.67428207397461], "id": 3725, "title": "QA Domain Adaptation using Hidden Space Augmentation and Self-Supervised Contrastive Adaptation", "authors": "Zhenrui Yue, Huimin Zeng, Bernhard Kratzwald, Stefan Feuerriegel and Dong Wang", "abstract": "Question answering (QA) has recently shown impressive results for answering questions from customized domains. Yet, a common challenge is to adapt QA models to an unseen target domain. In this paper, we propose a novel self-supervised framework called QADA for QA domain adaptation. QADA introduces a novel data augmentation pipeline used to augment training QA samples. Different from existing methods, we enrich the samples via hidden space augmentation. For questions, we introduce multi-hop synonyms and sample augmented token embeddings with Dirichlet distributions. For contexts, we develop an augmentation method which learns to drop context spans via a custom attentive sampling strategy. Additionally, contrastive learning is integrated in the proposed self-supervised adaptation framework QADA. Unlike existing approaches, we generate pseudo labels and propose to train the model via a novel attention-based contrastive adaptation method. The attention weights are used to build informative features for discrepancy estimation that helps the QA model separate answers and generalize across source and target domains. To the best of our knowledge, our work is the first to leverage hidden space augmentation and attention-based contrastive adaptation for self-supervised domain adaptation in QA. Our evaluation shows that QADA achieves considerable improvements on multiple target datasets over state-of-the-art baselines in QA domain adaptation.", "track": "Question Answering", "label": 11, "url": "https://www.semanticscholar.org/reader/3269250db1cca1b18f26be4224055a2ef9eeded6?experiments=&features=reader_skimming%3Atrue"}, {"loc": [8.25633716583252, 7.153022766113281], "id": 3779, "title": "When FLUE Meets FLANG: Benchmarks and Large Pretrained Language Model for Financial Domain", "authors": "Raj Shah, Kunal Chawla, Dheeraj Eidnani, Agam Shah, Wendi Du, Sudheer Chava, Natraj Raman, Charese Smiley, Jiaao Chen and Diyi Yang", "abstract": "Pre-trained language models have shown impressive performance on a variety of tasks and domains. Previous research on financial language models usually employs a generic training scheme to train standard model architectures, without completely leveraging the richness of the financial data. We propose a novel domain specific Financial LANGuage model (FLANG) which uses financial keywords and phrases for better masking, together with span boundary objective and in-filing objective. Additionally, the evaluation benchmarks in the field have been limited. To this end, we contribute the Financial Language Understanding Evaluation (FLUE), an open-source comprehensive suite of benchmarks for the financial domain. These include new benchmarks across 5 NLP tasks in financial domain as well as common benchmarks used in the previous research. Experiments on these benchmarks suggest that our model outperforms those in prior literature on a variety of NLP tasks. Our models, code and benchmark data will be made publicly available on Github and Huggingface.", "track": "Resources and Evaluation", "label": 1, "url": ""}, {"loc": [2.3020665645599365, 4.6393513679504395], "id": 3812, "title": "Retrieval as Attention: End-to-end Learning of Retrieval and Reading within a Single Transformer", "authors": "Zhengbao Jiang, Luyu Gao, Zhiruo Wang, Jun Araki, Haibo Ding, Jamie Callan and Graham Neubig", "abstract": "Systems for knowledge-intensive tasks such as open-domain question answering (QA) usually consist of two stages: efficient retrieval of relevant documents from a large corpus and detailed reading of the selected documents. This is usually done through two separate models, a retriever that encodes the query and finds nearest neighbors, and a reader based on Transformers. These two components are usually modeled separately, which necessitates a cumbersome implementation and is awkward to optimize in an end-to-end fashion. In this paper, we revisit this design and eschew the separate architecture and training in favor of a single Transformer that performs retrieval as attention (RAA), and end-to-end training solely based on supervision from the end QA task. We demonstrate for the first time that an end-to-end trained single Transformer can achieve both competitive retrieval and QA performance on in-domain datasets, matching or even slightly outperforming state-of-the-art dense retrievers and readers. Moreover, end-to-end adaptation of our model significantly boosts its performance on out-of-domain datasets in both supervised and unsupervised settings, making our model a simple and adaptable end-to-end solution for knowledge-intensive tasks.", "track": "Question Answering", "label": 11, "url": ""}, {"loc": [8.81047248840332, 6.608438968658447], "id": 3820, "title": "Reproducibility in Computational Linguistics: Is Source Code Enough?", "authors": "Mohammad Arvan, Lu\u00eds Pina and Natalie Parde", "abstract": "The availability of source code has been put forward as one of the most critical factors for improving the reproducibility of scientific research. This work studies trends in source code availability at major computational linguistics conferences, namely, ACL, EMNLP, LREC, NAACL, and COLING. We observe positive trends, especially in conferences that actively promote reproducibility. We follow this by conducting a reproducibility study of eight papers published in EMNLP 2021, finding that source code releases leave much to be desired. Moving forward, we suggest all conferences require self-contained artifacts and provide a venue to evaluate such artifacts at the time of publication. Authors can include small-scale experiments and explicit scripts to generate each result to improve the reproducibility of their work.", "track": "Resources and Evaluation", "label": 1, "url": ""}, {"loc": [2.596644878387451, 4.738193035125732], "id": 3826, "title": "Generating Information-Seeking Conversations from Unlabeled Documents", "authors": "Gangwoo Kim, Sungdong Kim, Kang Min Yoo and Jaewoo Kang", "abstract": "Synthesizing datasets for conversational question answering (CQA) from unlabeled documents remains challenging due to its interactive nature.\nMoreover, while modeling information needs is an essential key, only few studies have discussed it.\nIn this paper, we introduce a novel framework, **SimSeek**, (**Sim**ulating information-**Seek**ing conversation from unlabeled documents), and compare its two variants.\nIn our baseline, **SimSeek-sym**, a questioner generates follow-up questions upon the predetermined answer by an answerer.\nOn the contrary, **SimSeek-asym** first generates the question and then finds its corresponding answer under the conversational context.\nOur experiments show that they can synthesize effective training resources for CQA and conversational search tasks.\nAs a result, conversations from **SimSeek-asym** not only make more improvements in our experiments but also are favorably reviewed in a human evaluation.\nWe finally release a large-scale resource of synthetic conversations, **Wiki-SimSeek**, containing 2 million CQA pairs built upon Wikipedia documents.\nWith the dataset, our CQA model achieves the state-of-the-art performance on a recent CQA benchmark, QuAC.\nThe code and dataset are available at https://github.com/naver-ai/simseek", "track": "Question Answering", "label": 11, "url": "https://www.semanticscholar.org/reader/c483861a011034b8972fec3a3ec76f28335b131c?experiments=&features=reader_skimming%3Atrue"}, {"loc": [6.162881851196289, 12.448103904724121], "id": 3867, "title": "Distill The Image to Nowhere: Inversion Knowledge Distillation for Multimodal Machine Translation", "authors": "RU Peng, Yawen Zeng and Jake Zhao", "abstract": "Past works on multimodal machine translation (MMT) elevate bilingual setup by incorporating additional aligned vision information.\nHowever, an image-must requirement of the multimodal dataset largely hinders MMT's development --- namely that it demands an aligned form of [image, source text, target text].\nThis limitation is generally troublesome during the inference phase especially when the aligned image is not provided as in the normal NMT setup.\nThus, in this work, we introduce IKD-MMT, a novel MMT framework to support the image-free inference phase via an inversion knowledge distillation scheme.\nIn particular, a multimodal feature generator is executed with a knowledge distillation module, which directly generates the multimodal feature from (only) source texts as the input.\nWhile there have been a few prior works entertaining the possibility to support image-free inference for machine translation, their performances have yet to rival the image-must translation.\nIn our experiments, we identify our method as the first image-free approach to comprehensively rival or even surpass (almost) all image-must frameworks, and achieved the state-of-the-art result on the often-used Multi30k benchmark. Our code and data are available\nat: https://github.com/pengr/IKD-mmt/tree/master..", "track": "Machine Translation", "label": 10, "url": "https://www.semanticscholar.org/reader/dd62b2b99b5baa913be90d47779a194a21c866c4?experiments=&features=reader_skimming%3Atrue"}, {"loc": [7.219461441040039, 4.67414665222168], "id": 3871, "title": "A Multifaceted Framework to Evaluate Evasion, Content Preservation, and Misattribution in Authorship Obfuscation Techniques", "authors": "Malik Altakrori, Thomas Scialom, Benjamin C. M. Fung and Jackie Chi Kit Cheung", "abstract": "Authorship obfuscation techniques have commonly been evaluated based on their ability to hide the author's identity (evasion) while preserving the content of the original text. However, to avoid overstating the systems' effectiveness, evasion detection must be evaluated using competitive identification techniques in settings that mimic real-life scenarios, and the outcomes of the content-preservation evaluation have to be interpretable by potential users of these obfuscation tools. Motivated by recent work on cross-topic authorship identification and content preservation in summarization, we re-evaluate different authorship obfuscation techniques on detection evasion and content preservation. Furthermore, we propose a new information-theoretic measure to characterize the misattribution harm that can be caused by detection evasion. Our results reveal key weaknesses in state-of-the-art obfuscation techniques and a surprisingly competitive effectiveness from a back-translation baseline in all evaluation aspects.", "track": "Sentiment Analysis, Stylistic Analysis, and Argument Mining", "label": 16, "url": ""}, {"loc": [5.763286590576172, 4.703256130218506], "id": 3904, "title": "SafeText: A Benchmark for Exploring Physical Safety in Language Models", "authors": "Sharon Levy, Emily Allaway, Melanie Subbiah, Lydia Chilton, Desmond Patton, Kathleen McKeown and William Yang Wang", "abstract": "Understanding what constitutes safe text is an important issue in natural language processing and can often prevent the deployment of models deemed harmful and unsafe. One such type of safety that has been scarcely studied is commonsense physical safety, i.e. text that is not explicitly violent and requires additional commonsense knowledge to comprehend that it leads to physical harm. We create the first benchmark dataset, SafeText, comprising real-life scenarios with paired safe and physically unsafe pieces of advice. We utilize SafeText to empirically study commonsense physical safety across various models designed for text generation and commonsense reasoning tasks. We find that state-of-the-art large language models are susceptible to the generation of unsafe text and have difficulty rejecting unsafe advice. As a result, we argue for further studies of safety and the assessment of commonsense physical safety in models before release.", "track": "Ethics", "label": 21, "url": "https://www.semanticscholar.org/reader/2b6291eb76e2ff885238e94704bb795046d7d530?experiments=&features=reader_skimming%3Atrue"}, {"loc": [7.578199863433838, 9.050206184387207], "id": 3992, "title": "Ground-Truth Labels Matter: A Deeper Look into Input-Label Demonstrations", "authors": "Kang Min Yoo, Junyeob Kim, Hyuhng Joon Kim, Hyunsoo Cho, Hwiyeol Jo, Sang-Woo Lee, Sang-goo Lee and Taeuk Kim", "abstract": "Despite recent explosion of interests in in-context learning, the underlying mechanism and the precise impact of the quality of demonstrations remain elusive.\nIntuitively, ground-truth labels should have as much impact in in-context learning (ICL) as supervised learning, but recent work reported that the input-label correspondence is significantly less important than previously thought.\nIntrigued by this counter-intuitive observation, we re-examine the importance of ground-truth labels in in-context learning.\nWith the introduction of two novel metrics, namely Label-Correctness Sensitivity and Ground-truth Label Effect Ratio (GLER), we were able to conduct quantifiable analysis on the impact of ground-truth label demonstrations.\nThrough extensive analyses, we find that the correct input-label mappings can have varying impacts on the downstream in-context learning performances, depending on the experimental configuration.\nThrough additional studies, we identify key components, such as the verbosity of prompt templates and the language model size, as the controlling factor to achieve more noise-resilient ICL.", "track": "Language Modeling and Analysis of Language Models", "label": 2, "url": "https://www.semanticscholar.org/reader/316206a2f89eb94ce02a81fba1dc304586f21b39?experiments=&features=reader_skimming%3Atrue"}, {"loc": [4.582016468048096, 7.6970062255859375], "id": 4233, "title": "Exploiting domain-slot related keywords description for Few-Shot Cross-Domain Dialogue State Tracking", "authors": "Gao Qixiang, Guanting Dong, Yutao Mou, Liwen Wang, Chen Zeng, Daichi Guo, Mingyang Sun and Weiran Xu", "abstract": "Collecting dialogue data with domain-slot-value labels for dialogue state tracking (DST) could be a costly process. In this paper, we propose a novel framework based on domain-slot related description to tackle the challenge of few-shot cross-domain DST. Specifically, we design an extraction module to extract domain-slot related verbs and nouns in the dialogue. Then, we integrates them into the description, which aims to prompt the model to identify the slot information. Furthermore, we introduce a random sampling strategy to improve the domain generalization ability of the model. We utilize a pre-trained model to encode contexts and description and generates answers with an auto-regressive manner. Experimental results show that our approaches substantially outperform the existing few-shot DST methods on MultiWOZ and gain strong improvements on the slot accuracy comparing to existing slot description methods.", "track": "Dialogue and Interactive Systems", "label": 4, "url": ""}, {"loc": [9.780959129333496, 6.335411548614502], "id": 4291, "title": "CoCoA: An Encoder-Decoder Model for Controllable Code-switched Generation", "authors": "Sneha Mondal, Ritika ., Shreya Pathak, Preethi Jyothi and Aravindan Raghuveer", "abstract": "Code-switching has seen growing interest in recent years as an important multilingual NLP phenomenon. Generating code-switched text for data augmentation has been sufficiently well-explored. However, there is no prior work on generating code-switched text with fine-grained control on the degree of code-switching and the lexical choices used to convey formality. Due to the inherently high diversity in code-switched text, exercising fine-grained control over generated text is very useful both from a generation perspective and a data augmentation perspective. We present CoCoa, an encoder-decoder translation model that converts monolingual Hindi text to Hindi-English code-switched text with both encoder-side and decoder-side interventions to achieve fine-grained controllable generation. CoCoa can be invoked at test-time to synthesize code-switched text that is simultaneously faithful to syntactic and lexical attributes relevant to code-switching. CoCoa outputs were subjected to rigorous subjective and objective evaluations. Human evaluations establish that our outputs are of superior quality while being faithful to the desired attributes. We show significantly improved BLEU scores when compared with human-generated CS text. Compared to competitive baselines, we show 10% reduction in perplexity on a language modeling task and also demonstrate clear improvements on a downstream code-switched sentiment analysis task.", "track": "Multilinguality", "label": 13, "url": ""}, {"loc": [8.307180404663086, 7.350909233093262], "id": 4366, "title": "Towards Climate Awareness in NLP Research", "authors": "Daniel Hershcovich, Nicolas Webersinke, Mathias Kraus, Julia Bingler and Markus Leippold", "abstract": "The climate impact of AI, and NLP research in particular, has become a serious issue given the enormous amount of energy that is increasingly being used for training and running computational models. Consequently, increasing focus is placed on efficient NLP. However, this important initiative lacks simple guidelines that would allow for systematic climate reporting of NLP research. We argue that this deficiency is one of the reasons why very few publications in NLP report key figures that would allow a more thorough examination of environmental impact, and present a quantitative survey to demonstrate this. As a remedy, we propose a climate performance model card with the primary purpose of being practically usable with only limited information about experiments and the underlying computer hardware. We describe why this step is essential to increase awareness about the environmental impact of NLP research and, thereby, paving the way for more thorough discussions.", "track": "Theme Track", "label": 18, "url": "https://www.semanticscholar.org/reader/8d0f755dea90f35f4b126a01fa3cce96b3bdd344?experiments=&features=reader_skimming%3Atrue"}, {"loc": [4.247328281402588, 7.546331882476807], "id": 4386, "title": "Navigating Connected Memories with a Task-oriented Dialog System", "authors": "Satwik Kottur, Seungwhan Moon, Alborz Geramifard and Babak Damavandi", "abstract": "Recent years have seen an increasing trend in the volume of personal media captured by users, thanks to the advent of smartphones and smart glasses, resulting in large media collections. Despite conversation being an intuitive human-computer interface, current efforts focus mostly on single-shot natural language based media retrieval to aid users query their media and re-live their memories. This severely limits the search functionality as users can neither ask follow-up queries nor obtain information without first formulating a single-turn query.\n\nIn this work, we propose dialogs for connected memories as a powerful tool to empower users to search their media collection through a multi-turn, interactive conversation. Towards this, we collect a new task-oriented dialog dataset COMET, which contains 11.5k user\u2194assistant dialogs (totalling 103k utterances), grounded in simulated personal memory graphs. We employ a resource-efficient, two-phase data collection pipeline that uses: (1) a novel multimodal dialog simulator that generates synthetic dialog flows grounded in memory graphs, and, (2) manual paraphrasing to obtain natural language utterances. We analyze COMET, formulate four main tasks to benchmark meaningful progress, and adopt state-of-the-art language models as strong baselines, in order to highlight the multimodal challenges captured by our dataset.", "track": "Dialogue and Interactive Systems", "label": 4, "url": "https://www.semanticscholar.org/reader/bda1df17ff234cb7bcf454f22b6c4f45b431ab15?experiments=&features=reader_skimming%3Atrue"}, {"loc": [8.869048118591309, 7.9376115798950195], "id": 4390, "title": "Language Model Decomposition: Quantifying the Dependency and Correlation of Language Models", "authors": "Hao Zhang", "abstract": "Pre-trained language models (LMs), such as BERT (Devlin et al., 2018) and its variants, have led to significant improvements on various NLP tasks in past years. However, a theoretical framework for studying their relationships is still missing. In this paper, we fill this gap by investigating the linear dependency between pre-trained LMs. The linear dependency of LMs is defined analogously to the linear dependency of vectors. We propose Language Model Decomposition (LMD) to represent a LM using a linear combination of other LMs as basis, and derive the closed-form solution. A goodness-of-fit metric for LMD similar to the coefficient of determination is defined and used to measure the linear dependency of a set of LMs. In experiments, we find that BERT and eleven (11) BERT-like LMs are 91% linearly dependent. This observation suggests that current state-of-the-art (SOTA) LMs are highly \"correlated\". To further advance SOTA we need more diverse and novel LMs that are less dependent on existing LMs.", "track": "Language Modeling and Analysis of Language Models", "label": 2, "url": "https://www.semanticscholar.org/reader/97fa7651ed8ffa2be62e40c97b55a4590741117e?experiments=&features=reader_skimming%3Atrue"}, {"loc": [10.825882911682129, 9.34489917755127], "id": 4405, "title": "SynGEC: Syntax-Enhanced Grammatical Error Correction with a Tailored GEC-Oriented Parser", "authors": "Yue Zhang, Bo Zhang, Zhenghua Li, Zuyi Bao, Chen Li and Min Zhang", "abstract": "This work proposes a syntax-enhanced grammatical error correction (GEC) approach named SynGEC that effectively incorporates dependency syntactic information into the encoder part of GEC models. The key challenge for this idea is that off-the-shelf parsers are unreliable when processing ungrammatical sentences. To confront this challenge, we propose to build a tailored GEC-oriented parser (GOPar) using parallel GEC training data as a pivot. First, we design an extended syntax representation scheme that allows us to represent both grammatical errors and syntax in a unified tree structure. Then, we obtain parse trees of the source incorrect sentences by projecting trees of the target correct sentences. Finally, we train GOPar with such projected trees. For GEC, we employ the graph convolution network to encode source-side syntactic information produced by GOPar, and fuse them with the outputs of the Transformer encoder. Experiments on mainstream English and Chinese GEC datasets show that our proposed SynGEC approach consistently and substantially outperforms strong baselines and achieves competitive performance. Our code and data are all publicly available at https://github.com/HillZhang1999/SynGEC.", "track": "Syntax, Parsing and their Applications", "label": 23, "url": ""}, {"loc": [4.457025051116943, 5.449256420135498], "id": 4436, "title": "Varifocal Question Generation for Fact-checking", "authors": "Nedjma Djouhra Ousidhoum, Zhangdie Yuan and Andreas Vlachos", "abstract": "Fact-checking requires retrieving evidence related to a claim under investigation. The task can be formulated as question generation based on a claim, followed by question answering.\nHowever, recent question generation approaches assume that the answer is known and typically contained in a passage given as input,\nwhereas such passages \nare what is being sought when verifying a claim.\nIn this paper, we present {\\it Varifocal}, a method that generates questions based on different focal points within a given claim, i.e.\\ different spans of the claim and its metadata, such as its source and date.\nOur method outperforms previous work on a fact-checking question generation dataset on a wide range of automatic evaluation metrics.\nThese results are corroborated by our manual evaluation, which indicates that our method generates more relevant and informative questions.\nWe further demonstrate the potential of focal points in generating sets of clarification questions for product descriptions.", "track": "NLP Applications", "label": 0, "url": "https://www.semanticscholar.org/reader/be050e69aadd6461ff3bc35dcfa7a551742ef840?experiments=&features=reader_skimming%3Atrue"}, {"loc": [9.337663650512695, 6.2572102546691895], "id": 4439, "title": "Bilingual Lexicon Induction for Low-Resource Languages using Graph Matching via Optimal Transport", "authors": "Kelly Marchisio, Ali Saad-Eldin, Kevin Duh, carey e. priebe and Philipp Koehn", "abstract": "Bilingual lexicons form a critical component of various natural language processing applications, including unsupervised and semisupervised machine translation and crosslingual information retrieval. In this work, we improve bilingual lexicon induction performance across 40 language pairs with a graph-matching method based on optimal transport. The method is especially strong with low amounts of supervision.", "track": "Unsupervised and Weakly-Supervised Methods in NLP", "label": 17, "url": "https://www.semanticscholar.org/reader/0d1bceb56cfb765b46886ee83f1d6a498d6ea61a?experiments=&features=reader_skimming%3Atrue"}, {"loc": [6.16102409362793, 5.918120384216309], "id": 4441, "title": "Whose Language Counts as High Quality? Measuring Language Ideologies in Text Data Selection", "authors": "Suchin Gururangan, Dallas Card, Sarah K. Dreier, Emily K. Gade, Leroy Zhifei Wang, Zeyu Wang, Luke Zettlemoyer and Noah A. Smith", "abstract": "Language models increasingly rely on massive web crawls for diverse text data. However, these sources are rife with undesirable content. As such, resources like Wikipedia, books, and news often serve as anchors for automatically selecting web text most suitable for language modeling, a process typically referred to as quality filtering. Using a new dataset of U.S. high school newspaper articles---written by students from across the country---we investigate whose language is preferred by the quality filter used for GPT-3. We find that newspapers from larger schools, located in wealthier, educated, and urban zones (ZIP codes) are more likely to be classified as high quality. We also show that this quality measurement is unaligned with other sensible metrics, such as factuality or literary acclaim. We argue that privileging any corpus as high quality entails a language ideology, and more care is needed to construct training corpora for language models, with better transparency and justification for the inclusion or exclusion of various texts.", "track": "Theme Track", "label": 18, "url": "https://www.semanticscholar.org/reader/0a4b8b161931799d5c6bc3ecf07c53bae0e9e502?experiments=&features=reader_skimming%3Atrue"}, {"loc": [1.1150788068771362, 7.786769390106201], "id": 4446, "title": "ConReader: Exploring Implicit Relations in Contracts for Contract Clause Extraction", "authors": "Weiwen Xu, Yang Deng, Wenqiang Lei, Wenlong ZHAO, Tat-Seng Chua and Wai Lam", "abstract": "We study automatic Contract Clause Extraction (CCE) by modeling implicit relations in legal contracts. Existing CCE methods mostly treat contracts as plain text, creating a substantial barrier to understanding contracts of high complexity. In this work, we first comprehensively analyze the complexity issues of contracts and distill out three implicit relations commonly found in contracts, namely, 1) Long-range Context Relation that captures the correlations of distant clauses; 2) Term-Definition Relation that captures the relation between important terms with their corresponding definitions, and 3) Similar Clause Relation that captures the similarities between clauses of the same type. Then we propose a novel framework ConReader to exploit the above three relations for better contract understanding and improving CCE. Experimental results show that ConReader makes the prediction more interpretable and achieves new state-of-the-art on two CCE tasks in both conventional and zero-shot settings.", "track": "NLP Applications", "label": 0, "url": "https://www.semanticscholar.org/reader/0e131a325ffbdbfb8963ce8c63b1336376bf5de8?experiments=&features=reader_skimming%3Atrue"}, {"loc": [7.782354831695557, 8.191479682922363], "id": 4456, "title": "Training Dynamics for Curriculum Learning: A Study on Monolingual and Cross-lingual NLU", "authors": "Fenia Christopoulou, Gerasimos Lampouras and Ignacio Iacobacci", "abstract": "Curriculum Learning (CL) is a technique of training models via ranking examples in a typically increasing difficulty trend with the aim of accelerating convergence and improving generalisability. Current approaches for Natural Language Understanding (NLU) tasks use CL to improve in-distribution data performance often via heuristic-oriented or task-agnostic difficulties. In this work, instead, we employ CL for NLU by taking advantage of training dynamics as difficulty metrics, i.e., statistics that measure the behavior of the model at hand on specific task-data instances during training and propose modifications of existing CL schedulers based on these statistics. Differently from existing works, we focus on evaluating models on in-distribution (ID), out-of-distribution (OOD) as well as zero-shot (ZS) cross-lingual transfer datasets. We show across several NLU tasks that CL with training dynamics can result in better performance mostly on zero-shot cross-lingual transfer and OOD settings with improvements up by 8.5% in certain cases. Overall, experiments indicate that training dynamics can lead to better performing models with smoother training compared to other difficulty metrics while being 20% faster on average. In addition, through analysis we shed light on the correlations of task-specific versus task-agnostic metrics.", "track": "Efficient Methods for NLP", "label": 12, "url": ""}, {"loc": [8.757943153381348, 8.310791969299316], "id": 4475, "title": "Revisiting Parameter-Efficient Tuning: Are We Really There Yet?", "authors": "Guanzheng Chen, Fangyu Liu, Zaiqiao Meng and Shangsong Liang", "abstract": "Parameter-Efficient Tuning (PETuning) methods have been deemed by many as the new paradigm for using pretrained language models (PLMs). By tuning just a fraction amount of parameters comparing to full model finetuning, PETuning methods claim to have achieved performance on par with or even better than finetuning. In this work, we take a step back and re-examine these PETuning methods by conducting the first comprehensive investigation into the training and evaluation of them. We found the problematic validation and testing practice in current studies, when accompanied by the instability nature of PETuning methods, has led to unreliable conclusions. When being compared under a truly fair evaluation protocol, PETuning cannot yield consistently competitive performance while finetuning remains to be the best-performing method in medium- and high-resource settings. We delve deeper into the cause of the instability and observed that the number of trainable parameters and training iterations are two main factors: reducing trainable parameters and prolonging training iterations may lead to higher stability in PETuning methods.", "track": "Interpretability, Interactivity and Analysis of Models for NLP", "label": 9, "url": "https://www.semanticscholar.org/reader/4c09ac7b09628aa2aad12aea8dd6c2aef6c83aa0?experiments=&features=reader_skimming%3Atrue"}, {"loc": [2.404162645339966, 7.303460597991943], "id": 4482, "title": "Transfer Learning from Semantic Role Labeling to Event Argument Extraction with Template-based Slot Querying", "authors": "Zhisong Zhang, Emma Strubell and Eduard Hovy", "abstract": "In this work, we investigate transfer learning from semantic role labeling (SRL) to event argument extraction (EAE), considering their similar argument structures. We view the extraction task as a role querying problem, unifying various methods into a single framework. There are key discrepancies on role labels and distant arguments between semantic role and event argument annotations. To mitigate these discrepancies, we specify natural language-like queries to tackle the label mismatch problem and devise argument augmentation to recover distant arguments. We show that SRL annotations can serve as a valuable resource for EAE, and a template-based slot querying strategy is especially effective for facilitating the transfer. In extensive evaluations on two English EAE benchmarks, our proposed model obtains impressive zero-shot results by leveraging SRL annotations, reaching nearly 80% of the fullysupervised scores. It further provides benefits in low-resource cases, where few EAE annotations are available. Moreover, we show that our approach generalizes to cross-domain and multilingual scenarios.", "track": "Information Extraction", "label": 5, "url": ""}, {"loc": [9.246109962463379, 6.88762903213501], "id": 4485, "title": "Calibrating Zero-shot Cross-lingual (Un-)structured Predictions", "authors": "Zhengping Jiang, Anqi Liu and Benjamin Van Durme", "abstract": "We investigate model calibration in the setting of zero-shot cross-lingual transfer with large-scale pre-trained language models. The level of model calibration is an important metric for evaluating the trustworthiness of predictive models. There exists an essential need for model calibration when natural language models are deployed in critical tasks. We study different post-training calibration methods in structured and unstructured prediction tasks. We find that models trained with data from the source language become less calibrated when applied to the target language and that calibration errors increase with intrinsic task difficulty and relative sparsity of training data. Moreover, we observe a potential connection between the level of calibration error and an earlier proposed measure of the distance from English to other languages. Finally, our comparison demonstrates that among other methods Temperature Scaling (TS)  generalizes well to distant languages, but TS fails to calibrate more complex confidence estimation in structured predictions compared to more expressive alternatives like Gaussian Process Calibration.", "track": "Multilinguality", "label": 13, "url": ""}, {"loc": [6.0487213134765625, 8.463147163391113], "id": 4489, "title": "PRINCE: Prefix-Masked Decoding for Knowledge Enhanced Sequence-to-Sequence Pre-Training", "authors": "Song Xu, Haoran Li, Peng Yuan, Youzheng Wu and Xiaodong He", "abstract": "Pre-trained Language Models (PLMs) have shown effectiveness in various Natural Language Processing (NLP) tasks. Denoising autoencoder is one of the most successful pre-training frameworks,  learning to recompose the original text given a noise-corrupted one. The existing studies mainly focus on injecting noises into the input. This paper introduces a simple yet effective pre-training paradigm, equipped with a knowledge-enhanced decoder that predicts the next entity token with noises in the prefix, explicitly strengthening the representation learning of entities that span over multiple input tokens. Specifically, when predicting the next token within an entity, we feed masks into the prefix in place of some of the previous ground-truth tokens that constitute the entity. Our model achieves new state-of-the-art results on two knowledge-driven data-to-text generation tasks with up to 2% BLEU gains.", "track": "Natural Language Generation", "label": 6, "url": ""}, {"loc": [3.7194936275482178, 9.547513008117676], "id": 4531, "title": "How Far are We from Robust Long Abstractive Summarization?", "authors": "Huan Yee Koh, Jiaxin Ju, He Zhang, Ming Liu and Shirui Pan", "abstract": "Abstractive summarization has made tremendous progress in recent years. In this work, we perform fine-grained human annotations to evaluate long document abstractive summarization systems (i.e., models and metrics) with the aim of implementing them to generate reliable summaries. For long document abstractive models, we show that the constant strive for state-of-the-art ROUGE results can lead us to generate more relevant summaries but not factual ones. For long document evaluation metrics, human evaluation results show that ROUGE remains the best at evaluating the relevancy of a summary. It also reveals important limitations of factuality metrics in detecting different types of factual errors and the reasons behind the effectiveness of BARTScore. We then suggest promising directions in the endeavor of developing factual consistency metrics. Finally, we release our annotated long document dataset with the hope that it can contribute to the development of metrics across a broader range of summarization settings.", "track": "Summarization", "label": 14, "url": ""}, {"loc": [6.900421142578125, 5.912875652313232], "id": 4550, "title": "Measuring Context-Word Biases in Lexical Semantic Datasets", "authors": "Qianchu Liu, Diana McCarthy and Anna Korhonen", "abstract": "State-of-the-art pretrained contextualized models (PCM) eg. BERT use tasks such as WiC and WSD to evaluate their word-in-context representations. This inherently assumes that performance in these tasks reflect how well a model represents the coupled word and context semantics. We question this assumption by presenting the first quantitative analysis on the context-word interaction being tested in major contextual lexical semantic tasks. To achieve this, we run probing baselines on masked input, and propose measures to calculate and visualize the degree of context or word biases in existing datasets. The analysis was performed on both models and humans. Our findings demonstrate that models are usually not being tested for word-in-context semantics in the same way as humans are in these tasks, which helps us better understand the model-human gap. Specifically, to PCMs, most existing datasets fall into the extreme ends (the retrieval-based tasks exhibit strong target word bias while WiC-style tasks and WSD show strong context bias); In comparison, humans are less biased and achieve much better performance when both word and context are available than with masked input. We recommend our framework for understanding and controlling these biases for model interpretation and future task design.", "track": "Semantics: Lexical, Sentence level, Textual Inference and Other areas", "label": 8, "url": "https://www.semanticscholar.org/reader/4a4991a425a8181a6a65c8ca092ab0c3a2707a8b?experiments=&features=reader_skimming%3Atrue"}, {"loc": [7.12595796585083, 7.601161479949951], "id": 4567, "title": "Iteratively Prompt Pre-trained Language Models for Chain of Thought", "authors": "Boshi Wang, Xiang Deng and Huan Sun", "abstract": "While Pre-trained Language Models (PLMs) internalize a great amount of world knowledge, they have been shown incapable of recalling these knowledge to solve tasks requiring complex & multi-step reasoning. Similar to how humans develop a \"chain of thought\" for these tasks, how can we equip PLMs with such abilities? In this work, we explore an iterative prompting framework, a new prompting paradigm which progressively elicits relevant knowledge from PLMs for multi-step inference. We identify key limitations of existing prompting methods, namely they are either restricted to queries with a single identifiable relation/predicate, or being agnostic to input contexts, which makes it difficult to capture variabilities across different inference steps. We propose an iterative context-aware prompter, which addresses these limitations by learning to dynamically synthesize prompts conditioned on the current step's contexts. Experiments on three datasets involving multi-step reasoning show the effectiveness of the iterative scheme and the context-aware prompter design.", "track": "Language Modeling and Analysis of Language Models", "label": 2, "url": "https://www.semanticscholar.org/reader/3f4d11971f2c64be9125a7fe99c019588bbebf16?experiments=&features=reader_skimming%3Atrue"}, {"loc": [7.290417671203613, 6.969555854797363], "id": 4584, "title": "Unobserved Local Structures Make Compositional Generalization Hard", "authors": "Ben Bogin, Shivanshu Gupta and Jonathan Berant", "abstract": "While recent work has shown that sequence-to-sequence models struggle to generalize to new compositions (termed compositional generalization), little is known on what makes compositional generalization hard on a particular test instance. In this work, we investigate the factors that make generalization to certain test instances challenging. We first substantiate that some examples are more difficult than others by showing that different models consistently fail or succeed on the same test instances. Then, we propose a criterion for the difficulty of an example: a test instance is hard if it contains a local structure that was not observed at training time. We formulate a simple decision rule based on this criterion and empirically show it predicts instance-level generalization well across 5 different semantic parsing datasets, substantially better than alternative decision rules. Last, we show local structures can be leveraged for creating difficult adversarial compositional splits and also to improve compositional generalization under limited training budgets by strategically selecting examples for the training set.", "track": "Semantics: Lexical, Sentence level, Textual Inference and Other areas", "label": 8, "url": "https://www.semanticscholar.org/reader/9fe39e0f2cf3b6d5f70a379654f9c08ffa48ddee?experiments=&features=reader_skimming%3Atrue"}, {"loc": [6.916767597198486, 9.901144981384277], "id": 108, "title": "Mitigating Data Sparsity for Short Text Topic Modeling by Topic-Semantic Contrastive Learning", "authors": "Xiaobao Wu, Anh Tuan Luu and Xinshuai Dong", "abstract": "To overcome the data sparsity issue in short text topic modeling,\n        existing methods commonly rely on data augmentation or the data characteristic of short texts\n        to introduce more word co-occurrence information.\n        However, most of them do not make full use of the augmented data or the data characteristic:\n        they insufficiently learn the relations among samples in data,\n        leading to dissimilar topic distributions of semantically similar text pairs.\n        To better address data sparsity, in this paper\n        we propose a novel short text topic modeling framework, Topic-Semantic Contrastive Topic Model (TSCTM).\n        To sufficiently model the relations among samples,\n        we employ a new contrastive learning method with efficient positive and negative sampling strategies based on topic semantics.\n        This contrastive learning method refines the representations, enriches the learning signals, and thus mitigates the sparsity issue.\n        Extensive experimental results show that our TSCTM outperforms state-of-the-art baselines\n         regardless of the data augmentation availability, producing high-quality topics and topic distributions.", "track": "Information Retrieval and Text Mining", "label": 15, "url": ""}, {"loc": [3.99932599067688, 7.540581226348877], "id": 112, "title": "Back to the Future: Bidirectional Information Decoupling Network for Multi-turn Dialogue Modeling", "authors": "Yiyang Li, Hai Zhao and Zhuosheng Zhang", "abstract": "Multi-turn dialogue modeling as a challenging branch of natural language understanding (NLU), aims to build representations for machines to understand human dialogues, which provides a solid foundation for multiple downstream tasks. Recent studies of dialogue modeling commonly employ pre-trained language models (PrLMs) to encode the dialogue history as successive tokens, which is insufficient in capturing the temporal characteristics of dialogues. Therefore, we propose Bidirectional Information Decoupling Network (BiDeN) as a universal dialogue encoder, which explicitly incorporates both the past and future contexts and can be generalized to a wide range of dialogue-related tasks. Experimental results on datasets of different downstream tasks demonstrate the universality and effectiveness of our BiDeN.", "track": "Dialogue and Interactive Systems", "label": 4, "url": "https://www.semanticscholar.org/reader/7ba28d214d98f2a9c2e37e6cdf294d0d4e2a1e50?experiments=&features=reader_skimming%3Atrue"}, {"loc": [5.809638977050781, 5.537075519561768], "id": 113, "title": "Calibration Meets Explanation: A Simple and Effective Approach for Model Confidence Estimates", "authors": "Dongfang Li, Baotian Hu and Qingcai Chen", "abstract": "Calibration strengthens the trustworthiness of black-box models by producing better accurate confidence estimates on given examples. However, little is known about if model explanations can help confidence calibration. Intuitively, humans look at important features attributions and decide whether the model is trustworthy. Similarly, the explanations may tell us when the model might know and when it does not. Inspired by this, we propose a method named CME that leverages model explanations to make the model less confident with non-inductive attributions. The idea is that when the model is not highly confident, it is difficult to identify strong indications of any class, and the tokens accordingly do not have high attribution scores for any class and vice versa. We conduct extensive experiments on six datasets with two popular pre-trained language models in the in-domain and out-of-domain settings. The results show that CME improves calibration performance in all settings. The expected calibration errors are further reduced when combined with temperature scaling. Our findings highlight that model explanations can help calibrate posterior estimates.", "track": "Interpretability, Interactivity and Analysis of Models for NLP", "label": 9, "url": "https://www.semanticscholar.org/reader/00e06c446546a51445847f11d2a89cc08aa045e8?experiments=&features=reader_skimming%3Atrue"}, {"loc": [10.640687942504883, 7.656763076782227], "id": 131, "title": "Non-Autoregressive Neural Machine Translation: A Call for Clarity", "authors": "Robin M. Schmidt, Telmo Pires, Stephan Peitz and Jonas L\u00f6\u00f6f", "abstract": "Non-autoregressive approaches aim to improve the inference speed of translation models by only requiring a single forward pass to generate the output sequence instead of iteratively producing each predicted token. Consequently, their translation quality still tends to be inferior to their autoregressive counterparts due to several issues involving output token interdependence. In this work, we take a step back and revisit several techniques that have been proposed for improving non-autoregressive translation models and compare their combined translation quality and speed implications under third-party testing environments. We provide novel insights for establishing strong baselines using length prediction or CTC-based architecture variants and contribute standardized BLEU, chrF++, and TER scores using sacreBLEU on four translation tasks, which crucially have been missing as inconsistencies in the use of tokenized BLEU lead to deviations of up to 1.7 BLEU points. Our open-sourced code is integrated into fairseq for reproducibility.", "track": "Machine Translation", "label": 10, "url": "https://www.semanticscholar.org/reader/258cbe92945708a9bfc7eb0c87d08516db1d8b40?experiments=&features=reader_skimming%3Atrue"}, {"loc": [10.084028244018555, 8.063382148742676], "id": 144, "title": "RED-ACE: Robust Error Detection for ASR using Confidence Embeddings", "authors": "Zorik Gekhman, Dina Zverinski, Jonathan Mallinson and Genady Beryozkin", "abstract": "ASR Error Detection (AED) models aim to post-process the output of Automatic Speech Recognition (ASR) systems, in order to detect transcription errors. Modern approaches usually use text-based input, comprised solely of the ASR transcription hypothesis, disregarding additional signals from the ASR model. Instead, we utilize the ASR system's word-level confidence scores for improving AED performance. Specifically, we add an ASR Confidence Embedding (ACE) layer to the AED model's encoder, allowing us to jointly encode the confidence scores and the transcribed text into a contextualized representation. Our experiments show the benefits of ASR confidence scores for AED, their complementary effect over the textual signal, as well as the effectiveness and robustness of ACE for combining these signals. To foster further research, we publish a novel AED dataset consisting of ASR outputs on the LibriSpeech corpus with annotated transcription errors.", "track": "NLP Applications", "label": 0, "url": "https://www.semanticscholar.org/reader/076e3bd06c5a5b56bcdea13f6af545b89352907b?experiments=&features=reader_skimming%3Atrue"}, {"loc": [7.887290000915527, 7.006139755249023], "id": 149, "title": "Fast-R2D2: A Pretrained Recursive Neural Network based on Pruned CKY for Grammar Induction and Text Representation", "authors": "Xiang Hu, Haitao Mi, Liang Li and Gerard de Melo", "abstract": "Chart-based models have shown great potential in unsupervised grammar induction, running recursively and hierarchically, but requiring O(n\u00b3) time-complexity. The Recursive Transformer based on Differentiable Trees (R2D2) makes it possible to scale to large language model pretraining even with a complex tree encoder, by introducing a heuristic pruning method.\nHowever, its rule-based pruning process suffers from local optima and slow inference. In this paper, we propose a unified R2D2 method that overcomes these issues. We use a top-down unsupervised parser as a model-guided pruning method, which also enables parallel encoding during inference. Our parser casts parsing as a split point scoring task by first scoring all split points for a given sentence and then using the highest-scoring one to recursively split a span into two parts. The reverse order of the splits is considered as the order of pruning in the encoder. We optimize the unsupervised parser by minimizing the Kullback\u2013Leibler distance between tree probabilities from the parser and the R2D2 model.\nOur experiments show that our Fast-R2D2 significantly improves the grammar induction quality and achieves competitive results in downstream tasks.", "track": "Unsupervised and Weakly-Supervised Methods in NLP", "label": 17, "url": "https://www.semanticscholar.org/reader/dc85180153687539724d20a5927b2fbdf5f8e2a4?experiments=&features=reader_skimming%3Atrue"}, {"loc": [0.4715983271598816, 7.105227470397949], "id": 165, "title": "A Localized Geometric Method to Match Knowledge in Low-dimensional Hyperbolic Space", "authors": "Bo Hui, Tian Xia and Wei-Shinn Ku", "abstract": "Matching equivalent entities across Knowledge graphs is a pivotal step for knowledge fusion. Previous approaches usually study the problem in Euclidean space. However, recent works have shown that hyperbolic space has a higher capacity than Euclidean space and hyperbolic embedding can represent the hierarchical structure in a knowledge graph. In this paper, we propose a localized geometric method to find equivalent entities in hyperbolic space. Specifically, we use a hyperbolic neural network to encode the lingual information of entities and the structure of both knowledge graphs into a low-dimensional hyperbolic space. To address the asymmetry of structure on different KGs and the localized nature of relations, we learn an instance-specific geometric mapping function based on rotation to match entity pairs. A contrastive loss function is used to train the model. The experiment verifies the power of low-dimensional hyperbolic space for entity matching and shows that our method outperforms the state of the art by a large margin.", "track": "Machine Learning for NLP", "label": 3, "url": ""}, {"loc": [3.8399946689605713, 4.703279495239258], "id": 166, "title": "Memory-assisted prompt editing to improve GPT-3 after deployment", "authors": "Aman Madaan, Niket Tandon, Peter Clark and Yiming Yang", "abstract": "Large LMs such as GPT-3 are powerful, but can commit mistakes that are obvious to humans. For example, GPT-3 would mistakenly interpret \"What word is similar to good?\" to mean a homophone, while the user intended a synonym. Our goal is to effectively correct such errors via user interactions with the system but without retraining, which will be prohibitively costly. We pair GPT-3 with a growing memory of recorded cases where the model misunderstood the user's intents, along with user feedback for clarification. Such a memory allows our system to produce enhanced prompts for any new query based on the user feedback for error correction on similar cases in the past. On four tasks (two lexical tasks, two  advanced ethical reasoning tasks), we show how a (simulated) user can interactively teach a deployed GPT-3, substantially increasing its accuracy over the queries with different kinds of misunderstandings by the GPT-3. Our approach is a step towards the low-cost utility enhancement for very large pre-trained LMs.", "track": "Commonsense Reasoning", "label": 19, "url": ""}, {"loc": [6.190282821655273, 12.469200134277344], "id": 176, "title": "LVP-M3: Language-aware Visual Prompt for Multilingual Multimodal Machine Translation", "authors": "hongcheng guo, Jiaheng Liu, Haoyang Huang, Jian Yang, Zhoujun Li, Dongdong Zhang and Zheng Cui", "abstract": "Multimodal Machine Translation (MMT) focuses on enhancing text-only translation with visual features, which has attracted considerable attention from both natural language processing and computer vision communities. Recent advances still struggle to train a separate model for each language pair, which is costly and unaffordable when the number of languages increases in the real world. In other words, the multilingual multimodal machine translation (Multilingual MMT) task has not been investigated, which aims to handle the aforementioned issues by providing a shared semantic space for multiple languages. Besides, the image modality has no language boundaries, which is superior to bridging the semantic gap between languages. To this end,\nwe first propose the Multilingual MMT task by establishing two new Multilingual MMT benchmark datasets covering seven languages.\nThen, an effective baseline LVP-M3 using visual prompts is proposed to support translations between different languages,\nwhich includes three stages (token encoding, language-aware visual prompt generation, and language translation). Extensive experimental results on our constructed benchmark datasets demonstrate the effectiveness of LVP-M3 method for Multilingual MMT.", "track": "Speech, Vision, Robotics, Multimodal Grounding", "label": 7, "url": ""}, {"loc": [8.137381553649902, 2.9900803565979004], "id": 178, "title": "PromptEHR: Conditional Electronic Healthcare Records Generation with Prompt Learning", "authors": "Zifeng Wang and Jimeng Sun", "abstract": "Accessing longitudinal multimodal Electronic Healthcare Records (EHRs) is challenging due to privacy concerns, which hinders the use of ML for healthcare applications. Synthetic EHRs generation bypasses the need to share sensitive real patient records. However, existing methods generate single-modal EHRs by unconditional generation or by longitudinal inference, which falls short of low flexibility and makes unrealistic EHRs. In this work, we propose to formulate EHRs generation as a text-to-text translation task by language models (LMs), which suffices to highly flexible event imputation during generation. We also design prompt learning to control the generation conditioned by numerical and categorical demographic features. We evaluate synthetic EHRs quality by two perplexity measures accounting for their longitudinal pattern (longitudinal imputation perplexity, lpl) and the connections cross modalities (cross-modality imputation perplexity, mpl). Moreover, we utilize two adversaries: membership and attribute inference attacks for privacy-preserving evaluation. Experiments on MIMIC-III data demonstrate the superiority of our methods on realistic EHRs generation (53.1\\% decrease of lpl and 45.3\\% decrease of mpl on average compared to the best baselines) with low privacy risks. Software is available at https://github.com/RyanWangZf/PromptEHR.", "track": "NLP Applications", "label": 0, "url": "https://www.semanticscholar.org/reader/3c4f79018c5c68bb470d0f8ddc78e1a8cbf61209?experiments=&features=reader_skimming%3Atrue"}, {"loc": [7.738099575042725, 3.5442287921905518], "id": 184, "title": "ROSE: Robust Selective Fine-tuning for Pre-trained Language Models", "authors": "Lan Jiang, Hao Zhou, Yankai Lin, Peng Li, Jie Zhou and Rui Jiang", "abstract": "Even though the large-scale language models have achieved excellent performances, they suffer from various adversarial attacks.\nA large body of defense methods has been proposed. \nHowever, they are still limited due to redundant attack search spaces and the inability to defend against various types of attacks.\nIn this work, we present a novel fine-tuning approach called \\textbf{RO}bust \\textbf{SE}letive fine-tuning (\\textbf{ROSE}) to address this issue.\nROSE conducts selective updates when adapting pre-trained models to downstream tasks, filtering out invaluable and unrobust updates of parameters.\nSpecifically, we propose two strategies: the first-order and second-order ROSE for selecting target robust parameters.\nThe experimental results show that ROSE achieves significant improvements in adversarial robustness on various downstream NLP tasks, and the ensemble method even surpasses both variants above.\nFurthermore, ROSE can be easily incorporated into existing fine-tuning methods to improve their adversarial robustness further.\nThe empirical analysis confirms that ROSE eliminates unrobust spurious updates during fine-tuning, leading to solutions corresponding to flatter and wider optima than the conventional method.\nCode is available at \\url{https://github.com/jiangllan/ROSE}.", "track": "Language Modeling and Analysis of Language Models", "label": 2, "url": "https://www.semanticscholar.org/reader/175b32c07e56f881479be4c5a74bfa3c731cc454?experiments=&features=reader_skimming%3Atrue"}, {"loc": [6.528061389923096, 1.8590787649154663], "id": 191, "title": "CodeRetriever: A Large Scale Contrastive Pre-Training Method for Code Search", "authors": "Xiaonan Li, Yeyun Gong, Yelong Shen, Xipeng Qiu, Hang Zhang, Bolun Yao, Weizhen Qi, Daxin Jiang, Weizhu Chen and Nan Duan", "abstract": "In this paper, we propose the CodeRetriever model, which learns the function-level code semantic representations through large-scale code-text contrastive pre-training. We adopt two contrastive learning schemes in CodeRetriever: unimodal contrastive learning and bimodal contrastive learning. For unimodal contrastive learning, we design an unsupervised learning approach to build semantic-related code pairs based on the documentation and function name. For bimodal contrastive learning, we leverage the documentation and in-line comments of code to build code-text pairs. Both contrastive objectives can fully leverage large-scale code corpus for pre-training. \nExtensive experimental results show that CodeRetriever achieves new state-of-the-art with significant improvement over existing code pre-trained models, on eleven domain/language-specific code search tasks with six programming languages in different code granularity (function-level, snippet-level and statement-level).\nThese results demonstrate the effectiveness and robustness of CodeRetriever.\nThe codes and resources are available at \\url{https://github.com/microsoft/AR2/tree/main/CodeRetriever}.", "track": "Information Retrieval and Text Mining", "label": 15, "url": ""}, {"loc": [7.7762837409973145, 3.47430682182312], "id": 198, "title": "Open-Topic False Information Detection on Social Networks with Contrastive Adversarial Learning", "authors": "Guanghui Ma, Chunming Hu, Ling Ge and Hong Zhang", "abstract": "Current works about false information detection based on conversation graphs on social networks focus primarily on two research streams from the standpoint of topic distribution: in-topic and cross-topic techniques, which assume that the data topic distribution is identical or cross, respectively. This signifies that all test data topics are seen or unseen by the model.\nHowever, these assumptions are too harsh for actual social networks that contain both seen and unseen topics simultaneously, hence restricting their practical application.\nIn light of this, this paper develops a novel open-topic scenario that is better suited to actual social networks. In this open-topic scenario, we empirically find that the existing models suffer from impairment in the detection performance for seen or unseen topic data, resulting in poor overall model performance. To address this issue,  we propose a novel Contrastive Adversarial Learning Network, CALN, that employs an unsupervised topic clustering method to capture topic-specific features to enhance the model's performance for seen topics and an unsupervised adversarial learning method to align data representation distributions to enhance the model's generalisation to unseen topics.\nExperiments on two benchmark datasets and a variety of graph neural networks demonstrate the effectiveness of our approach.", "track": "NLP Applications", "label": 0, "url": ""}, {"loc": [6.4374680519104, 12.122154235839844], "id": 207, "title": "Mitigating Inconsistencies in Multimodal Sentiment Analysis under Uncertain Missing Modalities", "authors": "Jiandian Zeng, Jiantao Zhou and Tianyi Liu", "abstract": "For the missing modality problem in Multimodal Sentiment Analysis (MSA), the inconsistency phenomenon occurs when the sentiment changes due to the absence of a modality. The absent modality that determines the overall semantic can be considered as a key missing modality. However, previous works all ignored the inconsistency phenomenon, simply discarding missing modalities or solely generating associated features from available modalities. The neglect of the key missing modality case may lead to incorrect semantic results. To tackle the issue, we propose an Ensemble-based Missing Modality Reconstruction (EMMR) network to detect and recover semantic features of the key missing modality. Specifically, we first learn joint representations with remaining modalities via a backbone encoder-decoder network. Then, based on the recovered features, we check the semantic consistency to determine whether the absent modality is crucial to the overall sentiment polarity. Once the inconsistency problem due to the key missing modality exists, we integrate several encoder-decoder approaches for better decision making. Extensive experiments and analyses are conducted on CMU-MOSI and IEMOCAP datasets, validating the superiority of the proposed method.", "track": "Sentiment Analysis, Stylistic Analysis, and Argument Mining", "label": 16, "url": ""}, {"loc": [2.3089511394500732, 4.576399803161621], "id": 209, "title": "ConvTrans: Transforming Web Search Sessions for Conversational Dense Retrieval", "authors": "Kelong Mao, Zhicheng Dou, Hongjin Qian, Fengran Mo, Xiaohua Cheng and Zhao Cao", "abstract": "Conversational search provides users with a natural and convenient new search experience. Recently, conversational dense retrieval has shown to be a promising technique for realizing conversational search. However, as conversational search systems have not been widely deployed, it is hard to get large-scale real conversational search sessions and relevance labels to support the training of conversational dense retrieval. To tackle this data scarcity problem, previous methods focus on developing better few-shot learning approaches or generating pseudo relevance labels, but the data they use for training still heavily rely on manual generation.\n\nIn this paper, we present ConvTrans, a data augmentation method that can automatically transform easily-accessible web search sessions into conversational search sessions to fundamentally alleviate the data scarcity problem for conversational dense retrieval. ConvTrans eliminates the gaps between these two types of sessions in terms of session quality and query form to achieve effective session transformation. Extensive evaluations on two widely used conversational search benchmarks, i.e., CAsT-19 and CAsT-20, demonstrate that the same model trained on the data generated by ConvTrans can achieve comparable retrieval performance as it trained on high-quality but expensive artificial conversational search data.", "track": "Information Retrieval and Text Mining", "label": 15, "url": ""}, {"loc": [2.131030559539795, 7.54892110824585], "id": 229, "title": "MUSIED: A Benchmark for Event Detection from Multi-Source Heterogeneous Informal Texts", "authors": "Xi Xiangyu, Jianwei Lv, Shuaipeng Liu, Wei Ye, Fan Yang and Guanglu Wan", "abstract": "Event detection (ED) identifies and classifies event triggers from unstructured texts, serving as a fundamental task for information extraction. Despite the remarkable progress achieved in the past several years,  most research efforts focus on detecting events from formal texts (e.g., news articles, Wikipedia documents, financial announcements). Moreover, the texts in each dataset are either from a single source or multiple yet relatively homogeneous sources. With massive amounts of user-generated text accumulating on the Web and inside enterprises, identifying meaningful events in these informal texts, usually from multiple heterogeneous sources, has become a problem of significant practical value. As a pioneering exploration that expands event detection to the scenarios involving informal and heterogeneous texts, we propose a new large-scale Chinese event detection dataset based on user reviews, text conversations, and phone conversations in a leading e-commerce platform for food service. We carefully investigate the proposed dataset's textual informality and multi-domain heterogeneity characteristics by inspecting data samples quantitatively and qualitatively. Extensive experiments with state-of-the-art event detection methods verify the unique challenges posed by these characteristics, indicating that multi-domain informal event detection remains an open problem and requires further efforts. Our benchmark and code are released at https://github.com/myeclipse/MUSIED.", "track": "Resources and Evaluation", "label": 1, "url": ""}, {"loc": [11.025067329406738, 6.808716773986816], "id": 230, "title": "Reproducibility Issues for BERT-based Evaluation Metrics", "authors": "Yanran Chen, Jonas Belouadi and Steffen Eger", "abstract": "Reproducibility is of utmost concern in machine learning and natural language processing (NLP). In the field of natural language generation (especially machine translation), the seminal paper of Post (2018) has pointed out problems of reproducibility of the dominant metric, BLEU, at the time of publication. Nowadays, BERT-based evaluation metrics considerably outperform BLEU. In this paper, we ask whether results and claims from four recent BERT-based metrics can be reproduced. We find that reproduction of claims and results often fails because of (i) heavy undocumented preprocessing involved in the metrics, (ii) missing code and (iii) reporting weaker results for the baseline metrics. (iv) In one case, the problem stems from correlating not to human scores but to a wrong column in the csv file, inflating scores by 5 points. Motivated by the impact of preprocessing, we then conduct a second study where we examine its effects more closely (for one of the metrics). We find that preprocessing can have large effects, especially for highly inflectional languages. In this case, the effect of preprocessing may be larger than the effect of the aggregation mechanism (e.g., greedy alignment vs. Word Mover Distance).", "track": "Resources and Evaluation", "label": 1, "url": ""}, {"loc": [4.357364177703857, 5.941081523895264], "id": 239, "title": "Improving Multi-task Stance Detection with Multi-task Interaction Network", "authors": "Heyan Chai, Siyu Tang, Jinhao Cui, Ye Ding, Binxing Fang and Qing Liao", "abstract": "Stance detection aims to identify people's standpoints expressed in the text towards a  target, which can provide powerful information for various downstream tasks.\nRecent studies have proposed multi-task learning models that introduce sentiment information to boost stance detection.\nHowever, they neglect to explore capturing the fine-grained task-specific interaction between stance detection and sentiment tasks, thus degrading performance.\nTo address this issue, this paper proposes a novel multi-task interaction network (MTIN) for improving the performance of stance detection and sentiment analysis tasks simultaneously.\nSpecifically, we construct heterogeneous task-related graphs to automatically identify and adapt the roles that a word plays with respect to a specific task. Also, a multi-task interaction module is designed to capture the word-level interaction between tasks, so as to obtain richer task representations.\nExtensive experiments on two real-world datasets show that our proposed approach outperforms state-of-the-art methods in both stance detection and sentiment analysis tasks.", "track": "Information Retrieval and Text Mining", "label": 15, "url": ""}, {"loc": [0.5278493165969849, 7.039675712585449], "id": 240, "title": "Neural-based Mixture Probabilistic Query Embedding for Answering FOL queries on Knowledge Graphs", "authors": "xiao long, Liansheng Zhuang, Li Aodi, Shafei Wang and Houqiang Li", "abstract": "Query embedding (QE)\u2014which aims to embed entities and first-order logical (FOL) queries in a vector space, has shown great power in answering FOL queries on knowledge graphs (KGs). Existing QE methods divide a complex query into a sequence of mini-queries according to its computation graph and perform logical operations on the answer sets of mini-queries to get answers. However, most of them assume that answer sets satisfy an individual distribution (e.g., Uniform, Beta, or Gaussian), which is often violated in real applications and limit their performance. In this paper, we propose a Neural-based Mixture Probabilistic Query Embedding Model (NMP-QEM) that encodes the answer set of each mini-query as a mixed Gaussian distribution with multiple means and covariance parameters, which can approximate any random distribution arbitrarily well in real KGs. Additionally, to overcome the difficulty in defining the closed solution of negation operation, we introduce neural-based logical operators of projection, intersection and negation for a mixed Gaussian distribution to answer all the FOL queries. Extensive experiments demonstrate that NMP-QEM significantly outperforms existing state-of-the-art methods on benchmark datasets. In NELL995, NMP-QEM achieves a 31\\% relative improvement over the state-of-the-art.", "track": "Efficient Methods for NLP", "label": 12, "url": ""}, {"loc": [4.671926975250244, 6.999411106109619], "id": 248, "title": "Improving Multi-turn Emotional Support Dialogue Generation with Lookahead Strategy Planning", "authors": "Yi Cheng, Wenge Liu, Wenjie Li, Jiashuo WANG, Ruihui Zhao, Bang Liu, Xiaodan Liang and Yefeng Zheng", "abstract": "Providing Emotional Support (ES) to soothe people in emotional distress is an essential capability in social interactions. Most existing researches on building ES conversation systems only considered single-turn interactions with users, which was over-simplified. In comparison, multi-turn ES conversation systems can provide ES more effectively, but face several new technical challenges, including: (1) how to adopt appropriate support strategies to achieve the long-term dialogue goal of comforting the user's emotion; (2) how to dynamically model the user's state. In this paper, we propose a novel system MultiESC to address these issues. For strategy planning, drawing inspiration from the A* search algorithm, we propose lookahead heuristics to estimate the future user feedback after using particular strategies, which helps to select strategies that can lead to the best long-term effects. For user state modeling, MultiESC focuses on capturing users' subtle emotional expressions and understanding their emotion causes. Extensive experiments show that MultiESC significantly outperforms competitive baselines in both dialogue generation and strategy planning.", "track": "Dialogue and Interactive Systems", "label": 4, "url": "https://www.semanticscholar.org/reader/f36053a516cc4e3e72291ad2eaa042a299a19635?experiments=&features=reader_skimming%3Atrue"}, {"loc": [7.9762749671936035, 9.743143081665039], "id": 254, "title": "Conformal Predictor for Improving Zero-Shot Text Classification Efficiency", "authors": "Prafulla Kumar Choubey, Yu Bai, Chien-Sheng Wu, Wenhao Liu and Nazneen Rajani", "abstract": "Pre-trained language models (PLMs) have been shown effective for zero-shot (0shot) text classification. 0shot models based on natural language inference (NLI) and next sentence prediction (NSP) employ cross-encoder architecture and infer by making a forward pass through the model for each label-text pair separately. This increases the computational cost to make inferences linearly in the number of labels. In this work, we improve the efficiency of such cross-encoder-based 0shot models by restricting the number of likely labels using another fast base classifier-based conformal predictor (CP) calibrated on samples labeled by the 0shot model. Since a CP generates prediction sets with coverage guarantees, it reduces the number of target labels without excluding the most probable label based on the 0shot model. We experiment with three intent and two topic classification datasets. With a suitable CP for each dataset, we reduce the average inference time for NLI- and NSP-based models by 25.6% and 22.2% respectively, without dropping performance below the predefined error rate of 1%.", "track": "Machine Learning for NLP", "label": 3, "url": "https://www.semanticscholar.org/reader/268fda32364892264030f9749fda5b7ca780ae11?experiments=&features=reader_skimming%3Atrue"}, {"loc": [1.8328033685684204, 3.931988000869751], "id": 259, "title": "Effective and Efficient Query-aware Snippet Extraction for Web Search", "authors": "Jingwei Yi, Fangzhao Wu, Chuhan Wu, Xiaolong Huang, Binxing Jiao, Guangzhong Sun and Xing Xie", "abstract": "Query-aware webpage snippet extraction is widely used in search engines to help users better understand the content of the returned webpages before clicking. The extracted snippet is expected to summarize the webpage in the context of the input query. Existing snippet extraction methods mainly rely on handcrafted features of overlapping words, which cannot capture deep semantic relationships between the query and webpages. Another idea is to extract the sentences which are most relevant to queries as snippets with existing text matching methods. However, these methods ignore the contextual information of webpages, which may be sub-optimal. In this paper, we propose an effective query-aware webpage snippet extraction method named DeepQSE. In DeepQSE, the concatenation of title, query and each candidate sentence serves as an input of query-aware sentence encoder, aiming to capture the fine-grained relevance between the query and sentences. Then, these query-aware sentence representations are modeled jointly through a document-aware relevance encoder to capture contextual information of the webpage. Since the query and each sentence are jointly modeled in DeepQSE, its online inference may be slow. Thus, we further propose an efficient version of DeepQSE, named Efficient-DeepQSE, which can significantly improve the inference speed of DeepQSE without affecting its performance. The core idea of Efficient-DeepQSE is to decompose the query-aware snippet extraction task into two stages, i.e., a coarse-grained candidate sentence selection stage where sentence representations can be cached, and a fine-grained relevance modeling stage. Experiments on two datasets validate the effectiveness and efficiency of our methods.", "track": "Summarization", "label": 14, "url": "https://www.semanticscholar.org/reader/aeb0335390f53a6a38090c021c77c47aca6a0021?experiments=&features=reader_skimming%3Atrue"}, {"loc": [2.548063278198242, 4.718426704406738], "id": 281, "title": "You Only Need One Model for Open-domain Question Answering", "authors": "Haejun Lee, Akhil Kedia, Jongwon Lee, Ashwin Paranjape, Christopher Manning and Kyoung-Gu Woo", "abstract": "Recent approaches to Open-domain Question Answering refer to an external knowledge base using a retriever model, optionally rerank passages with a separate reranker model and generate an answer using another reader model. Despite performing related tasks, the models have separate parameters and are weakly-coupled during training. We propose casting the retriever and the reranker as internal passage-wise attention mechanisms applied sequentially within the transformer architecture and feeding computed representations to the reader, with the hidden representations progressively refined at each stage. This allows us to use a single question answering model trained end-to-end, which is a more efficient use of model capacity and also leads to better gradient flow. We present a pre-training method to effectively train this architecture and evaluate our model on the Natural Questions and TriviaQA open datasets. For a fixed parameter budget, our model outperforms the previous state-of-the-art model by 1.0 and 0.7 exact match scores.", "track": "Question Answering", "label": 11, "url": ""}, {"loc": [1.6088727712631226, 8.614110946655273], "id": 287, "title": "Generative Entity Typing with Curriculum Learning", "authors": "Siyu Yuan, Deqing Yang, Jiaqing Liang, Zhixu Li, Jinxi Liu, Jingyue Huang and Yanghua Xiao", "abstract": "Entity typing aims to assign types to the entity mentions in given texts. The traditional classification-based entity typing paradigm has two unignorable drawbacks: 1) it fails to assign an entity to the types beyond the predefined type set, and 2) it can hardly handle few-shot and zero-shot situations where many long-tail types only have few or even no training instances. To overcome these drawbacks, we propose a novel generative entity typing (GET) paradigm: given a text with an entity mention, the multiple types for the role that the entity plays in the text are generated with a pre-trained language model (PLM). However, PLMs tend to generate coarse-grained types after fine-tuning upon the entity typing dataset. In addition, only the heterogeneous training data consisting of a small portion of human-annotated data and a large portion of auto-generated but low-quality data are provided for model training. To tackle these problems, we employ curriculum learning (CL) to train our GET model on heterogeneous data, where the curriculum could be self-adjusted with the self-paced learning according to its comprehension of the type granularity and data heterogeneity. Our extensive experiments upon the datasets of different languages and downstream tasks justify the superiority of our GET model over the state-of-the-art entity typing models. The code has been released on https://github.com/siyuyuan/GET.", "track": "Information Retrieval and Text Mining", "label": 15, "url": "https://www.semanticscholar.org/reader/2b787c790189c82be89b9bb3b887a69da4259dbe?experiments=&features=reader_skimming%3Atrue"}, {"loc": [1.7253130674362183, 8.752220153808594], "id": 297, "title": "SetGNER: General Named Entity Recognition as Entity Set Generation", "authors": "Yuxin He and Buzhou Tang", "abstract": "Recently, joint recognition of flat, nested and discontinuous entities has received increasing attention. Motivated by the observation that the target output of NER is essentially a set of sequences, we propose a novel entity set generation framework for general NER scenes in this paper. Different from sequence-to-sequence NER methods, our method does not force the entities to be generated in a predefined order and can get rid of the problem of error propagation and inefficient decoding. Distinguished from the set-prediction NER framework, our method treats each entity as a sequence and is capable of recognizing discontinuous mentions. Given an input sentence, the model first encodes the sentence in word-level and detects potential entity mentions based on the encoder's output, then reconstructs entity mentions from the detected entity heads in parallel.  To let the encoder of our model capture better right-to-left semantic structure, we also propose an auxiliary Inverse Generation Training task. Extensive experiments show that our model (w/o. Inverse Generation Training) outperforms state-of-the-art generative NER models by a large margin on two discontinuous NER datasets, two nested NER datasets and one flat NER dataset. Besides, the auxiliary Inverse Generation Training task is found to further improve the model's performance on the five datasets.", "track": "Information Extraction", "label": 5, "url": ""}, {"loc": [3.684114933013916, 9.895216941833496], "id": 306, "title": "Opinion Summarization by Weak-Supervision from Mix-structured Data", "authors": "Yizhu Liu, Qi Jia and Kenny Zhu", "abstract": "Opinion summarization of multiple reviews suffers from the lack \nof reference summaries for training.\nMost previous approaches construct multiple reviews and their summary \nbased on textual similarities between reviews,\nresulting in information mismatch between the review input and the summary. \nIn this paper, we convert each review into a mix\nof structured and unstructured data, \nwhich we call opinion-aspect pairs (OAs) and implicit sentences (ISs).\nWe propose a new method to synthesize training pairs \nof such mix-structured data as input and the textual summary as output,\nand design a summarization model with OA encoder and IS encoder.\nExperiments show that our approach outperforms previous \nmethods on Yelp, Amazon and RottenTomatos datasets.", "track": "Summarization", "label": 14, "url": ""}, {"loc": [8.997915267944336, 6.5478835105896], "id": 320, "title": "Multi-level Distillation of Semantic Knowledge for Pre-training Multilingual Language Model", "authors": "Mingqi Li, Fei Ding, Dan Zhang, Long Cheng, Hongxin Hu and feng luo", "abstract": "Pre-trained multilingual language models play an important role in cross-lingual natural language understanding tasks. However, existing methods did not focus on learning the semantic structure of representation, and thus could not optimize their performance. In this paper, we propose Multi-level Multilingual Knowledge Distillation (MMKD), a novel method for improving multilingual language models. Specifically, we employ a teacher-student framework to adopt rich semantic representation knowledge in English BERT. We propose token-, word-, sentence-, and structure-level alignment objectives to encourage multiple levels of consistency between source-target pairs and correlation similarity between teacher and student models. We conduct experiments on cross-lingual evaluation benchmarks including XNLI, PAWS-X, and XQuAD. Experimental results show that MMKD outperforms other baseline models of similar size on XNLI and XQuAD and obtains comparable performance on PAWS-X. Especially, MMKD obtains significant performance gains on low-resource languages.", "track": "Multilinguality", "label": 13, "url": "https://www.semanticscholar.org/reader/ae3d8af12b176d16961b53850c98d98449f9940e?experiments=&features=reader_skimming%3Atrue"}, {"loc": [2.0102570056915283, 4.070786952972412], "id": 324, "title": "Empowering Dual-Encoder with Query Generator for Cross-Lingual Dense Retrieval", "authors": "Houxing Ren, Linjun Shou, Ning Wu, Ming Gong and Daxin Jiang", "abstract": "In monolingual dense retrieval, lots of works focus on how to distill knowledge from cross-encoder re-ranker to dual-encoder retriever and these methods achieve better performance due to the effectiveness of cross-encoder re-ranker. However, we find that the performance of the cross-encoder re-ranker is heavily influenced by the number of training samples and the quality of negative samples, which is hard to obtain in the cross-lingual setting. In this paper, we propose to use a query generator as the teacher in the cross-lingual setting, which is less dependent on enough training samples and high-quality negative samples. In addition to traditional knowledge distillation, we further propose a novel enhancement method, which uses the query generator to help the dual-encoder align queries from different languages, but does not need any additional parallel sentences. The experimental results show that our method outperforms the state-of-the-art methods on two benchmark datasets.", "track": "Multilinguality", "label": 13, "url": ""}, {"loc": [4.840381145477295, 4.609951019287109], "id": 340, "title": "R2F: A General Retrieval, Reading and Fusion Framework for Document-level Natural Language Inference", "authors": "Hao Wang, Yixin Cao, Yangguang Li, Zhen Huang, Kun Wang and Jing Shao", "abstract": "Document-level natural language inference (DOCNLI) is a new challenging task in natural language processing, aiming at judging the entailment relationship between a pair of hypothesis and premise documents. Current datasets and baselines largely follow sentence-level settings, but fail to address the issues raised by longer documents. In this paper, we establish a general solution, named Retrieval, Reading and Fusion (R2F) framework, and a new setting, by analyzing the main challenges of DOCNLI: interpretability, long-range dependency, and cross-sentence inference. The basic idea of the framework is to simplify document-level task into a set of sentence-level tasks, and improve both performance and interpretability with the power of evidence. For each hypothesis sentence, the framework retrieves evidence sentences from the premise, and reads to estimate its credibility. Then the sentence-level results are fused to judge the relationship between the documents. For the setting, we contribute complementary evidence and entailment label annotation on hypothesis sentences, for interpretability study. Our experimental results show that R2F framework can obtain state-of-the-art performance and is robust for diverse evidence retrieval methods. Moreover, it can give more interpretable prediction results. Our model and code are released at https://github.com/phoenixsecularbird/R2F.", "track": "Semantics: Lexical, Sentence level, Textual Inference and Other areas", "label": 8, "url": ""}, {"loc": [9.0950927734375, 6.504434585571289], "id": 351, "title": "Revisiting Pre-trained Language Models and their Evaluation for Arabic Natural Language Processing", "authors": "Abbas Ghaddar, Yimeng Wu, Sunyam Bagga, Ahmad Rashid, Khalil Bibi, Mehdi Rezagholizadeh, Chao Xing, Yasheng Wang, Xinyu Duan, Zhefeng Wang, baoxing Huai, Xin Jiang, Qun Liu and Phillippe Langlais", "abstract": "There is a growing body of work in recent years to develop pre-trained language models (PLMs) for the Arabic language. This work addresses two major problems in existing Arabic PLMs that limit the progress of the Arabic NLU and NLG fields. First, existing Arabic PLMs are not well-explored and their pre-training can be improved significantly using a more methodical approach. Second, there is a lack of systematic and reproducible evaluation of these models in the literature. We revisit both the pre-training and evaluation of Arabic PLMs. In terms of pre-training, we explore the impact of the quality of the pretraining data, the size of the model, and the incorporation of character-level information on Arabic PLM. As a result, we release three new Arabic BERT-style models ( JABER, Char-JABER, and SABER), and two T5-style models (AT5S and AT5B). In terms of evaluation, we conduct a comprehensive empirical study to systematically evaluate the performance of existing state-of-the-art models on ALUE, a leaderboard-powered benchmark for Arabic NLU tasks, and on a subset of the Arabic generative tasks. We show that our models significantly outperform existing Arabic PLMs and achieve a new state-of-the-art performance on discriminative and generative Arabic NLU and NLG tasks. Our models and source code to reproduce results will be made available upon acceptance.", "track": "Language Modeling and Analysis of Language Models", "label": 2, "url": "https://www.semanticscholar.org/reader/24fbe3af030f393e55bda3dc7dae0f57bd270d04?experiments=&features=reader_skimming%3Atrue"}, {"loc": [2.739131212234497, 4.600147247314453], "id": 357, "title": "KECP: Knowledge Enhanced Contrastive Prompting for Few-shot Extractive Question Answering", "authors": "Jianing Wang, Chengyu Wang, Minghui Qiu, Qiuhui Shi, Hongbin Wang, jun huang and Ming Gao", "abstract": "Extractive Question Answering (EQA) is one of the most essential tasks in Machine Reading Comprehension (MRC), which can be solved by fine-tuning the span selecting heads of Pre-trained Language Models (PLMs). However, most existing approaches for MRC may perform poorly in the few-shot learning scenario. To solve this issue, we propose a novel framework named Knowledge Enhanced Contrastive Prompt-tuning (KECP). Instead of adding pointer heads to PLMs, we introduce a seminal paradigm for EQA that transforms the task into a non-autoregressive Masked Language Modeling (MLM) generation problem.  Simultaneously, rich semantics from the external knowledge base (KB) and the passage context support enhancing the query's representations. In addition, to boost the performance of PLMs, we jointly train the model by the MLM and contrastive learning objectives. Experiments on multiple benchmarks demonstrate that our method consistently outperforms state-of-the-art approaches in few-shot settings by a large margin.", "track": "Question Answering", "label": 11, "url": "https://www.semanticscholar.org/reader/375c41566e8710c7b6cbf12c1bf6347f5aa23ab8?experiments=&features=reader_skimming%3Atrue"}, {"loc": [7.193092346191406, 7.633299350738525], "id": 358, "title": "Knowledge Prompting in Pre-trained Language Model for Natural Language Understanding", "authors": "Jianing Wang, Wenkang Huang, Minghui Qiu, Qiuhui Shi, Hongbin Wang, Xiang Li and Ming Gao", "abstract": "Knowledge-enhanced Pre-trained Language Model (PLM) has recently received significant attention, which aims to incorporate factual knowledge into PLMs. However, most existing methods modify the internal structures of fixed types of PLMs by stacking complicated modules, and introduce redundant and irrelevant factual knowledge from knowledge bases (KBs). In this paper, to address these problems, we introduce a seminal knowledge prompting paradigm and further propose a knowledge-prompting-based PLM framework KP-PLM. This framework can be flexibly combined with existing mainstream PLMs. Specifically, we first construct a knowledge sub-graph from KBs for each context. Then we design multiple continuous prompts rules and transform the knowledge sub-graph into natural language prompts. To further leverage the factual knowledge from these prompts, we propose two novel knowledge-aware self-supervised tasks including prompt relevance inspection and masked prompt modeling. Extensive experiments on multiple natural language understanding (NLU) tasks show the superiority of KP-PLM over other state-of-the-art methods in both full-resource and low-resource settings. Our source codes will be released upon the acceptance of the paper.", "track": "Language Modeling and Analysis of Language Models", "label": 2, "url": "https://www.semanticscholar.org/reader/17dcfef70619c0423e0527f0c9d90f4858125f5f?experiments=&features=reader_skimming%3Atrue"}, {"loc": [8.116920471191406, 5.195946216583252], "id": 364, "title": "On the Evaluation Metrics for Paraphrase Generation", "authors": "Lingfeng Shen, Lemao Liu, Haiyun Jiang and Shuming Shi", "abstract": "In this paper we revisit automatic metrics for paraphrase evaluation and obtain two findings that disobey conventional wisdom: (1) Reference-free metrics achieve better performance than their reference-based counterparts. (2) Most commonly used metrics do not align well with human annotation.\nUnderlying reasons behind the above findings are explored through additional experiments and in-depth analyses.\nBased on the experiments and analyses, we propose ParaScore, a new evaluation metric for paraphrase generation. It possesses the merits of reference-based and reference-free metrics and explicitly models lexical divergence. Based on our analysis and improvements, our proposed reference-based outperforms than reference-free metrics.\nExperimental results demonstrate that ParaScore significantly outperforms existing metrics.", "track": "Resources and Evaluation", "label": 1, "url": "https://www.semanticscholar.org/reader/e1fd982b8d223c0f1594c6e13176758e86b1de67?experiments=&features=reader_skimming%3Atrue"}, {"loc": [6.389890670776367, 12.151315689086914], "id": 369, "title": "Curriculum Learning Meets Weakly Supervised Multimodal Correlation Learning", "authors": "Sijie Mai, Ya Sun and Haifeng Hu", "abstract": "In the field of multimodal sentiment analysis (MSA), a few studies have leveraged the inherent modality correlation information stored in samples for self-supervised learning. However, they feed the training pairs in a random order without consideration of difficulty. Without human annotation, the generated training pairs of self-supervised learning often contain noise. If noisy or hard pairs are used for training at the easy stage, the model might be stuck in bad local optimum. In this paper, we inject curriculum learning into weakly supervised multimodal correlation learning. The weakly supervised correlation learning leverages the label information to generate scores for negative pairs to learn a more discriminative embedding space, where negative pairs are defined as two unimodal embeddings from different samples. To assist the correlation learning, we feed the training pairs to the model according to difficulty by the proposed curriculum learning, which consists of elaborately designed scoring and feeding functions. The scoring function computes the difficulty of pairs using pre-trained and current correlation predictors, where the pairs with large losses are defined as hard pairs. Notably, the hardest pairs are discarded in our algorithm, which are assumed as noisy pairs. Moreover, the feeding function takes the difference of correlation losses as feedback to determine the feeding actions (`stay', `step back', or `step forward'). The proposed method reaches state-of-the-art performance on MSA.", "track": "Sentiment Analysis, Stylistic Analysis, and Argument Mining", "label": 16, "url": ""}, {"loc": [6.497754096984863, 1.8809715509414673], "id": 380, "title": "Rethinking Positional Encoding in Tree Transformer for Code Representation", "authors": "Han Peng, Ge Li, Yunfei Zhao and Zhi Jin", "abstract": "Transformers are now widely used in code representation, and several recent works further develop tree Transformers to capture the syntactic structure in source code. \nSpecifically, novel tree positional encodings have been proposed to incorporate inductive bias into Transformer.\nIn this work, we propose a novel tree Transformer encoding node positions based on our new description method for tree structures.\nTechnically, local and global soft bias shown in previous works is both introduced as positional encodings of our Transformer model.\nOur model finally outperforms strong baselines on code summarization and completion tasks across two languages, demonstrating our model's effectiveness.\nBesides, extensive experiments and ablation study shows that combining both local and global paradigms is still helpful in improving model performance.  \nWe release our code at \\url{https://github.com/AwdHanPeng/TreeTransformer}.", "track": "NLP Applications", "label": 0, "url": ""}, {"loc": [1.3441051244735718, 4.924398422241211], "id": 381, "title": "RASAT: Integrating Relational Structures into Pretrained Seq2Seq Model for Text-to-SQL", "authors": "Jiexing Qi, Jingyao Tang, Ziwei He, Xiangpeng Wan, Yu Cheng, Chenghu Zhou, Xinbing Wang, Quanshi Zhang and Zhouhan Lin", "abstract": "Relational structures such as schema linking and schema encoding have been validated as a key component to qualitatively translating natural language into SQL queries. However, introducing these structural relations comes with prices: they often result in a specialized model structure, which largely prohibits using large pretrained models in text-to-SQL. To address this problem, we propose RASAT: a Transformer seq2seq architecture augmented with relation-aware self-attention that could leverage a variety of relational structures while inheriting the pretrained parameters from the T5 model effectively. Our model can incorporate almost all types of existing relations in the literature, and in addition, we propose introducing co-reference relations for the multi-turn scenario. Experimental results on three widely used text-to-SQL datasets, covering both single-turn and multi-turn scenarios, have shown that RASAT could achieve competitive results in all three benchmarks, achieving state-of-the-art execution accuracy (75.5% EX on Spider, 52.6% IEX on SParC, and 37.4% IEX on CoSQL).", "track": "Semantics: Lexical, Sentence level, Textual Inference and Other areas", "label": 8, "url": "https://www.semanticscholar.org/reader/14793aa93920cb8f748776cc45c3895de6df5fbf?experiments=&features=reader_skimming%3Atrue"}, {"loc": [1.0452271699905396, 10.523868560791016], "id": 395, "title": "COM-MRC: A COntext-Masked Machine Reading Comprehension Framework for Aspect Sentiment Triplet Extraction", "authors": "Zepeng Zhai, Hao Chen, Fangxiang Feng, Ruifan Li and Xiaojie WANG", "abstract": "Aspect Sentiment Triplet Extraction (ASTE) aims to extract sentiment triplets from sentences, which was recently formalized as an effective machine reading comprehension (MRC) based framework. However, when facing multiple aspect terms, the MRC-based methods could fail due to the interference from other aspect terms. In this paper, we propose a novel \\textit{COntext-Masked MRC} (COM-MRC) framework for ASTE. Our COM-MRC framework comprises three closely-related  components: a context augmentation strategy, a discriminative model, and an inference method. Specifically, a context augmentation strategy is designed by enumerating all masked contexts for each aspect term. The discriminative model comprises four modules, i.e., aspect and opinion extraction modules, sentiment classification and aspect detection modules. In addition, a two-stage inference method  first extracts all aspects and then identifies their opinions and sentiment through iteratively masking the aspects. Extensive experimental results on benchmark datasets show the effectiveness of our proposed COM-MRC framework, which outperforms state-of-the-art methods consistently.", "track": "Sentiment Analysis, Stylistic Analysis, and Argument Mining", "label": 16, "url": ""}, {"loc": [4.303220272064209, 7.505843162536621], "id": 405, "title": "CEM: Machine-Human Chatting Handoff via Causal-Enhance Module", "authors": "Shanshan Zhong, Jinghui Qin, Zhongzhan Huang and Daifeng Li", "abstract": "Aiming to ensure chatbot quality by predicting chatbot failure and enabling human-agent collaboration, Machine-Human Chatting Handoff (MHCH) has attracted lots of attention from both industry and academia in recent years. \nHowever, most existing methods mainly focus on the dialogue context or assist with global satisfaction prediction based on multi-task learning, which ignore the grounded relationships among the causal variables, like the user state and labor cost. These variables are significantly associated with handoff decisions, resulting in prediction bias and cost increasement. \nTherefore, we propose Causal-Enhance Module (CEM) by establishing the causal graph of MHCH based on these two variables, which is a simple yet effective module and can be easy to plug into the existing MHCH methods. \nFor the impact of users, we use the user state to correct the prediction bias according to the causal relationship of multi-task. For the labor cost, we train an auxiliary cost simulator to calculate unbiased labor cost through counterfactual learning so that a model becomes cost-aware.\nExtensive experiments conducted on four real-world benchmarks demonstrate the effectiveness of CEM in generally improving the performance of existing MHCH methods without any elaborated model crafting.", "track": "Sentiment Analysis, Stylistic Analysis, and Argument Mining", "label": 16, "url": ""}, {"loc": [8.039241790771484, 9.069884300231934], "id": 408, "title": "Nearest Neighbor Zero-Shot Inference", "authors": "Weijia Shi, Julian Michael, Suchin Gururangan and Luke Zettlemoyer", "abstract": "Retrieval-augmented language models (LMs) use non-parametric memory to substantially outperform their non-retrieval counterparts on perplexity-based evaluations, but it is an open question whether they achieve similar gains in few- and zero-shot end-task accuracy. We extensively study one such model, the k-nearest neighbor LM (kNN-LM), showing that the gains marginally transfer. The main challenge is to achieve coverage of the verbalizer tokens that define the different end-task class labels. To address this challenge, we also introduce kNN-Prompt, a simple and effective kNN-LM with automatically expanded fuzzy verbalizers (e.g. to expand \"terrible\u201d to also include \"silly\u201d and other task-specific synonyms for sentiment classification). Across nine diverse end-tasks, using kNN-Prompt with GPT-2 large yields significant performance boosts over strong zeroshot baselines (13.4% absolute improvement over the base LM on average). We also show that other advantages of non-parametric augmentation hold for end tasks; kNN-Prompt is effective for domain adaptation with no further training, and gains increase with the size of the retrieval model.", "track": "Language Modeling and Analysis of Language Models", "label": 2, "url": ""}, {"loc": [4.4921956062316895, 7.134725093841553], "id": 415, "title": "Robots-Dont-Cry: Understanding Falsely Anthropomorphic Utterances in Dialog Systems", "authors": "David Gros, Yu Li and Zhou Yu", "abstract": "Dialog systems are often designed or trained to output human-like responses. However, some responses may be impossible for a machine to truthfully say (e.g. \"that movie made me cry\"). Highly anthropomorphic responses might make users uncomfortable or implicitly deceive them into thinking they are interacting with a human. \nWe collect human ratings on the feasibility of approximately 900 two-turn dialogs sampled from 9 diverse data sources. Ratings are for two hypothetical machine embodiments: a futuristic humanoid robot and a digital assistant. We find that for some data-sources commonly used to train dialog systems, 20-30\\% of utterances are not viewed as possible for a machine. Rating is marginally affected by machine embodiment. \nWe explore qualitative and quantitative reasons for these ratings. Finally, we build classifiers and explore how modeling configuration might affect output permissibly, and discuss implications for building less falsely anthropomorphic dialog systems.", "track": "Dialogue and Interactive Systems", "label": 4, "url": "https://www.semanticscholar.org/reader/8c5dfc418b937ba78e481ca46a5f43ac61863059?experiments=&features=reader_skimming%3Atrue"}, {"loc": [1.1115050315856934, 10.43939208984375], "id": 416, "title": "A Joint Learning Framework for Restaurant Survival Prediction and Explanation", "authors": "Xin Li, Xiaojie Zhang, Peng JiaHao, Rui Mao, Mingyang Zhou, Xing Xie and Hao Liao", "abstract": "The bloom of the Internet and the recent breakthroughs in deep learning techniques open a new door to AI for E-commence, with a trend of evolving from using a few financial factors such as liquidity and profitability to using more advanced AI techniques to process complex and multi-modal data. In this paper, we tackle the practical problem of restaurant survival prediction. We argue that traditional methods ignore two essential respects, which are very helpful for the task: 1) modeling customer reviews and 2) jointly considering status prediction and result explanation. Thus, we propose a novel joint learning framework for explainable restaurant survival prediction based on the multi-modal data of user-restaurant interactions and users' textual reviews. Moreover, we design a  graph neural network to capture the high-order interactions and design a co-attention mechanism to capture the most informative and meaningful signal from noisy textual reviews. Our results on two datasets show a significant and consistent improvement over the SOTA techniques (average 6.8% improvement in prediction and 45.3% improvement in explanation).", "track": "NLP Applications", "label": 0, "url": ""}, {"loc": [8.11104965209961, 9.425466537475586], "id": 423, "title": "Making Pretrained Language Models Good Long-tailed Learners", "authors": "Chen Zhang, Lei Ren, Jingang Wang, Wei Wu and Dawei Song", "abstract": "Prompt-tuning has shown appealing performance in few-shot classification by virtue of its capability in effectively exploiting pre-trained knowledge. This motivates us to check the hypothesis that prompt-tuning is also a promising choice for long-tailed classification, since the tail classes are intuitively few-shot ones. To achieve this aim, we conduct empirical studies to examine the hypothesis. The results demonstrate that prompt-tuning makes pretrained language models at least good long-tailed learners. For intuitions on why prompt-tuning can achieve good performance in long-tailed classification, we carry out in-depth analyses by progressively bridging the gap between prompt-tuning and commonly used finetuning. The summary is that the classifier structure and parameterization form the key to making good long-tailed learners, in comparison with the less important input structure. Finally, we verify the applicability of our finding to few-shot classification.", "track": "Machine Learning for NLP", "label": 3, "url": "https://www.semanticscholar.org/reader/14f1c16a322fb6dfef7bde329648d9e34839c9dd?experiments=&features=reader_skimming%3Atrue"}, {"loc": [4.012414455413818, 3.992795467376709], "id": 425, "title": "UniGeo: Unifying Geometry Logical Reasoning via Reformulating Mathematical Expression", "authors": "Jiaqi Chen, Tong Li, Jinghui Qin, Pan Lu, Liang Lin, Chongyu Chen and Xiaodan Liang", "abstract": "Geometry problem solving is a well-recognized testbed for evaluating the high-level multi-modal reasoning capability of deep models. In most existing works, two main geometry problems: calculation and proving, are usually treated as two specific tasks, hindering a deep model to unify its reasoning capability on multiple math tasks. However, in essence, these two tasks have similar problem representations and overlapped math knowledge which can improve the understanding and reasoning ability of a deep model on both two tasks. Therefore, we construct a large-scale Unified Geometry problem benchmark, UniGeo, which contains 4,998 calculation problems and 9,543 proving problems. Each proving problem is annotated with a multi-step proof with reasons and mathematical expressions. The proof can be easily reformulated as a proving sequence that shares the same formats with the annotated program sequence for calculation problems. Naturally, we also present a unified multi-task Geometric Transformer framework, Geoformer, to tackle calculation and proving problems simultaneously in the form of sequence generation, which finally shows the reasoning ability can be improved on both two tasks by unifying formulation. Furthermore, we propose a Mathematical Expression Pretraining (MEP) method that aims to predict the mathematical expressions in the problem solution, thus improving the Geoformer model. Experiments on the UniGeo demonstrate that our proposed Geoformer obtains state-of-the-art performance by outperforming task-specific model NGS with over 5.6\\% and 3.2\\% accuracies on calculation and proving problems, respectively.", "track": "Speech, Vision, Robotics, Multimodal Grounding", "label": 7, "url": ""}, {"loc": [6.404867172241211, 12.175616264343262], "id": 430, "title": "Face-Sensitive Image-to-Emotional-Text Cross-modal Translation for Multimodal Aspect-based Sentiment Analysis", "authors": "Hao Yang, Yanyan Zhao and Bing Qin", "abstract": "Aspect-level multimodal sentiment analysis, which aims to identify the sentiment of the target aspect from multimodal data, recently has attracted extensive attention in the community of multimedia and natural language processing. Despite the recent success in textual aspect-based sentiment analysis, existing models mainly focused on utilizing the object-level semantic information in the image but ignore explicitly using the visual emotional cues, especially the facial emotions. How to distill visual emotional cues and align them with the textual content remains a key challenge to solve the problem. In this work, we introduce a face-sensitive image-to-emotional-text translation (FITE) method, which focuses on capturing visual sentiment cues through facial expressions and selectively matching and fusing with the target aspect in textual modality. To the best of our knowledge, we are the first that explicitly utilize the emotional information from images in the multimodal aspect-based sentiment analysis task. Experiment results show that our method achieves state-of-the-art results on the Twitter-2015 and Twitter-2017 datasets. The improvement demonstrates the superiority of our model in capturing aspect-level sentiment in multimodal data with facial expressions.", "track": "Sentiment Analysis, Stylistic Analysis, and Argument Mining", "label": 16, "url": ""}, {"loc": [4.347741603851318, 7.282843112945557], "id": 431, "title": "FineD-Eval: Fine-grained Automatic Dialogue-Level Evaluation", "authors": "Chen Zhang, Luis Fernando D'Haro, Qiquan Zhang, Thomas Friedrichs and Haizhou Li", "abstract": "Recent model-based reference-free metrics for open-domain dialogue evaluation exhibit promising correlations with human judgment. However, they either perform turn-level evaluation or look at a single dialogue quality dimension. One would expect a good evaluation metric to assess multiple quality dimensions at the dialogue level. To this end, we are motivated to propose a multi-dimensional dialogue-level metric, which consists of three sub-metrics with each targeting a specific dimension. The sub-metrics are trained with novel self-supervised objectives and exhibit strong correlations with human judgment for their respective dimensions. Moreover, we explore two approaches to combine the sub-metrics: metric ensemble and multitask learning. Both approaches yield a holistic metric that significantly outperforms individual sub-metrics. Compared to the existing state-of-the-art metric, the combined metrics achieve around 16% relative improvement on average across three high-quality dialogue-level evaluation benchmarks.", "track": "Dialogue and Interactive Systems", "label": 4, "url": ""}, {"loc": [7.991034030914307, 5.812930107116699], "id": 438, "title": "Sentence Representation Learning with Generative Objective rather than Contrastive Objective", "authors": "Bohong Wu and Hai Zhao", "abstract": "Though offering amazing contextualized token-level representations, current pre-trained language models take less attention on accurately acquiring sentence-level representation during their self-supervised pre-training. However, contrastive objectives which dominate the current sentence representation learning bring little linguistic interpretability and no performance guarantee on downstream semantic tasks. We instead propose a novel generative self-supervised learning objective based on phrase reconstruction. To overcome the drawbacks of previous generative methods, we carefully model intra-sentence structure by breaking down one sentence into pieces of important phrases. Empirical studies show that our generative learning achieves powerful enough performance improvement and outperforms the current state-of-the-art contrastive methods not only on the STS benchmarks, but also on downstream semantic retrieval and reranking tasks. Our code is available at https://github.com/chengzhipanpan/PaSeR.", "track": "Semantics: Lexical, Sentence level, Textual Inference and Other areas", "label": 8, "url": ""}, {"loc": [7.665589332580566, 8.905779838562012], "id": 456, "title": "RLPrompt: Optimizing Discrete Text Prompts with Reinforcement Learning", "authors": "Mingkai Deng, Jianyu Wang, Cheng-Ping Hsieh, Yihan Wang, Han Guo, Tianmin Shu, Meng Song, Eric Xing and Zhiting Hu", "abstract": "Prompting has shown impressive success in enabling large pre-trained language models (LMs) to perform diverse NLP tasks, especially with only few downstream data. Automatically finding the optimal prompt for each task, however, is challenging. Most existing work resorts to tuning *soft* prompts (e.g., embeddings) which fall short of interpretability, reusability across LMs, and applicability when gradients are not accessible. *Discrete* prompts, on the other hand, are difficult to optimize, and are often created by \"enumeration (e.g., paraphrasing)-then-selection\" heuristics that do not explore the prompt space systematically. This paper proposes RLPrompt, an efficient discrete prompt optimization approach with reinforcement learning (RL). RLPrompt formulates a parameter-efficient policy network that generates the optimized discrete prompt after training with reward. To harness the complex and stochastic reward signals from the large LM environment, we incorporate effective reward stabilization that substantially enhances training efficiency. RLPrompt is flexibly applicable to different types of LMs, such as masked (e.g., BERT) and left-to-right models (e.g., GPTs), for both classification and generation tasks. Experiments on few-shot classification and unsupervised text style transfer show superior performance over a wide range of existing fine-tuning or prompting methods. Interestingly, the resulting optimized prompts are often ungrammatical gibberish text; and surprisingly, those gibberish prompts are transferrable between different LMs to retain significant performance, indicating that LM prompting may not follow human language patterns.", "track": "Machine Learning for NLP", "label": 3, "url": "https://www.semanticscholar.org/reader/07759a84f27e43cfa5bc8d579f8227c96e6ae1dc?experiments=&features=reader_skimming%3Atrue"}, {"loc": [5.8519182205200195, 8.786553382873535], "id": 462, "title": "DisCup: Discriminator Cooperative Unlikelihood Prompt-tuning for Controllable Text Generation", "authors": "Hanqing Zhang and Dawei Song", "abstract": "Prompt learning with immensely large Casual Language Models (CLMs) has been shown promising for attribute-controllable text generation (CTG). However, vanilla prompt tuning tends to imitate training corpus characteristics beyond the control attributes, resulting in a poor generalization ability. Moreover, it is less able to capture the relationship between different attributes, further limiting the control performance. In this paper, we propose a new CTG approach, namely DisCup, which incorporates the attribute knowledge of discriminator to optimize the control-prompts, steering a frozen CLM to produce attribute-specific texts. Specifically, the frozen CLM model, capable of producing multitudinous texts, is first used to generate the next-token candidates based on the context, so as to ensure the diversity of tokens to be predicted. Then, we leverage an attribute-discriminator to select desired/undesired tokens from those candidates, providing the inter-attribute knowledge. Finally, we bridge the above two traits by an unlikelihood objective for prompt-tuning. Extensive experimental results show that DisCup can achieve a new state-of-the-art control performance while maintaining an efficient and high-quality text generation, only relying on around 10 virtual tokens.", "track": "Natural Language Generation", "label": 6, "url": "https://www.semanticscholar.org/reader/f7122057d86f4f9f2d28565d5e2709a8b7cc6fdb?experiments=&features=reader_skimming%3Atrue"}, {"loc": [5.476661205291748, 12.111429214477539], "id": 472, "title": "CPL: Counterfactual Prompt Learning for Vision and Language Models", "authors": "Xuehai He, Diji Yang, Weixi Feng, Tsu-Jui Fu, Arjun Akula, Varun Jampani, Pradyumna Narayana, Sugato Basu, William Yang Wang and Xin Eric Wang", "abstract": "Prompt tuning is a new few-shot transfer learning technique that only tunes the learnable prompt for pre-trained vision and language models such as CLIP. However, existing prompt tuning methods tend to learn spurious or entangled representations, which leads to poor generalization to unseen concepts.\nTowards non-spurious and efficient prompt learning from limited examples, this paper presents a novel Counterfactual Prompt Learning (CPL) method for vision and language models, which simultaneously employs counterfactual generation and contrastive learning in a joint optimization framework.\nParticularly, CPL constructs counterfactual by identifying minimal non-spurious feature change between semantically-similar positive and negative samples that causes concept change, and learns more generalizable prompt representation from both factual and counterfactual examples via contrastive learning. Extensive experiments demonstrate that CPL can obtain superior few-shot performance on different vision and language tasks than previous prompt tuning methods on CLIP. On image classification, we achieve 3.55% average relative improvement on unseen classes across seven datasets; on image-text retrieval and visual question answering, we gain up to 4.09% and 25.08% relative improvements across three few-shot scenarios on unseen test sets respectively.", "track": "Speech, Vision, Robotics, Multimodal Grounding", "label": 7, "url": "https://www.semanticscholar.org/reader/7c4be464e68a11c8f254d9608f31280e9bcda85c?experiments=&features=reader_skimming%3Atrue"}, {"loc": [4.832625865936279, 7.349550724029541], "id": 475, "title": "Red Teaming Language Models with Language Models", "authors": "Ethan Perez, Saffron Huang, Francis Song, Trevor Cai, Roman Ring, John Aslanides, Amelia Glaese, Nat McAleese and Geoffrey Irving", "abstract": "Language Models (LMs) often cannot be deployed because of their potential to harm users in hard-to-predict ways. Prior work identifies harmful behaviors before deployment by using human annotators to hand-write test cases. However, human annotation is expensive, limiting the number and diversity of test cases. In this work, we automatically find cases where a target LM behaves in a harmful way, by generating test cases (\"red teaming\") using another LM. We evaluate the target LM's replies to generated test questions using a classifier trained to detect offensive content, uncovering tens of thousands of offensive replies in a 280B parameter LM chatbot. We explore several methods, from zero-shot generation to reinforcement learning, for generating test cases with varying levels of diversity and difficulty. Furthermore, we use prompt engineering to control LM-generated test cases to uncover a variety of other harms, automatically finding groups of people that the chatbot discusses in offensive ways, personal and hospital phone numbers generated as the chatbot's own contact info, leakage of private training data in generated text, and harms that occur over the course of a conversation. Overall, LM-based red teaming is one promising tool (among many needed) for finding and fixing diverse, undesirable LM behaviors before impacting users.", "track": "Language Modeling and Analysis of Language Models", "label": 2, "url": "https://www.semanticscholar.org/reader/5d49c7401c5f2337c4cc88d243ae39ed659afe64?experiments=&features=reader_skimming%3Atrue"}, {"loc": [5.067829132080078, 12.552175521850586], "id": 478, "title": "CapOnImage: Context-driven Dense-Captioning on Image", "authors": "Yiqi Gao, Xinglin Hou, Yuanmeng Zhang, Tiezheng Ge, Yuning Jiang and peng wang", "abstract": "Existing image captioning systems are dedicated to generating narrative captions for images, which are spatially detached from the\nimage in presentation. However, texts can also be used as decorations on the image to highlight the key points and increase the\nattractiveness of images. In this work, we introduce a new task\ncalled captioning on image (CapOnImage), which aims to generate\ndense captions at different locations of the image based on contextual information. To fully exploit the surrounding visual context to\ngenerate the most suitable caption for each location, we propose a\nmulti-modal pre-training model with multi-level pre-training tasks\nthat progressively learn the correspondence between texts and image locations from easy to difficult. Since the model may generate\nredundant captions for nearby locations, we further enhance the\nlocation embedding with neighbor locations as context. For this\nnew task, we also introduce a large-scale benchmark called CapOnImage2M, which contains 2.1 million product images, each with an\naverage of 4.8 spatially localized captions. Compared with other image captioning model variants, our model achieves the best results\nin both captioning accuracy and diversity aspects.", "track": "Natural Language Generation", "label": 6, "url": "https://www.semanticscholar.org/reader/140f83a8774b1b847aa0aa6a5b0ac63fce27bb00?experiments=&features=reader_skimming%3Atrue"}, {"loc": [1.7430247068405151, 8.718894004821777], "id": 516, "title": "SpanProto: A Two-stage Span-based Prototypical Network for Few-shot Named Entity Recognition", "authors": "Jianing Wang, Chengyu Wang, Chuanqi Tan, Minghui Qiu, Songfang Huang, jun huang and Ming Gao", "abstract": "Few-shot Named Entity Recognition (NER) aims to identify named entities with very little annotated data. Previous methods solve this problem based on token-wise classification, which ignores the information of entity boundaries, and inevitably the performance is affected by the massive non-entity tokens. To this end, we propose a seminal span-based prototypical network (SpanProto) that tackles few-shot NER via a two-stage approach, including span extraction and mention classification. \nIn the span extraction stage, we transform the sequential tags into a global boundary matrix, enabling the model to focus on the explicit boundary information. For mention classification, we leverage prototypical learning to capture the semantic representations for each labeled span and make the model better adapt to novel-class entities. To further improve the model performance, we split out the false positives generated by the span extractor but not labeled in the current episode set, and then present a margin-based loss to separate them from each prototype region. Experiments over multiple benchmarks demonstrate that our model outperforms strong baselines by a large margin.", "track": "Information Extraction", "label": 5, "url": ""}, {"loc": [6.6595611572265625, 5.773978233337402], "id": 518, "title": "Discovering Differences in the Representation of People using Contextualized Semantic Axes", "authors": "Li Lucy, Divya Tadimeti and David Bamman", "abstract": "A common paradigm for identifying semantic differences across social and temporal contexts is the use of static word embeddings and their distances. In particular, past work has compared embeddings against \"semantic axes\" that represent two opposing concepts. We extend this paradigm to BERT embeddings, and construct contextualized axes that mitigate the pitfall where antonyms have neighboring representations. We validate and demonstrate these axes on two people-centric datasets: occupations from Wikipedia, and multi-platform discussions in extremist, men's communities over fourteen years. In both studies, contextualized semantic axes can characterize differences among instances of the same word type. In the latter study, we show that references to women and the contexts around them have become more detestable over time.", "track": "Computational Social Science and Cultural Analytics", "label": 20, "url": "https://www.semanticscholar.org/reader/7f5801f8036e71658a12d16203617b2ab25ef14f?experiments=&features=reader_skimming%3Atrue"}, {"loc": [4.486772537231445, 5.470057964324951], "id": 527, "title": "Generating Literal and Implied Subquestions to Fact-check Complex Claims", "authors": "Jifan Chen, Aniruddh Sriram, Eunsol Choi and Greg Durrett", "abstract": "Verifying political claims is a challenging task, as politicians can use various tactics to subtly misrepresent the facts for their agenda. Existing automatic fact-checking systems fall short here, and their predictions like \"half-true'' are not very useful in isolation, since it is unclear which parts of a claim are true and which are not. In this work, we focus on decomposing a complex claim into a comprehensive set of yes-no subquestions whose answers influence the veracity of the claim. We present CLAIMDECOMP, a dataset of decompositions for over 1000 claims. Given a claim and its verification paragraph written by fact-checkers, our trained annotators write subquestions covering both explicit propositions of the original claim and its implicit facets, such as asking about additional political context that changes our view of the claim's veracity. We study whether state-of-the-art models can generate such subquestions, showing that these models generate reasonable questions to ask, but predicting the comprehensive set of subquestions from the original claim without evidence remains challenging. We further show that these subquestions can help identify relevant evidence to fact-check the full claim and derive the veracity through their answers, suggesting that they can be useful pieces of a fact-checking pipeline.", "track": "Semantics: Lexical, Sentence level, Textual Inference and Other areas", "label": 8, "url": ""}, {"loc": [10.97620677947998, 6.7964396476745605], "id": 529, "title": "Machine Translation Robustness to Natural Asemantic Variation", "authors": "Jacob Bremerman, Xiang Ren and Jonathan May", "abstract": "Current Machine Translation (MT) models still struggle with more challenging input, such as noisy data and tail-end words and phrases.  Several works have addressed this robustness issue by identifying specific categories of noise and variation then tuning models to perform better on them.  An important yet under-studied category involves minor variations in nuance (non-typos) that preserve meaning w.r.t. the target language.  We introduce and formalize this category as Natural Asemantic Variation (NAV) and investigate it in the context of MT robustness.  We find that existing MT models fail when presented with NAV data, but we demonstrate strategies to improve performance on NAV by fine-tuning them with human-generated variations.  We also show that NAV robustness can be transferred across languages and find that synthetic perturbations can achieve some but not all of the benefits of organic NAV data.", "track": "Machine Translation", "label": 10, "url": "https://www.semanticscholar.org/reader/4743ee49af83d3010549ee105e0c193b36fa239a?experiments=&features=reader_skimming%3Atrue"}, {"loc": [6.49038553237915, 1.8903164863586426], "id": 531, "title": "Natural Language to Code Translation with Execution", "authors": "Freda Shi, Daniel Fried, Marjan Ghazvininejad, Luke Zettlemoyer and Sida I. Wang", "abstract": "Generative models of code, pretrained on large corpora of programs, have shown great success in translating natural language to code (Chen et al., 2021; Austin et al., 2021; Li et al., 2022, inter alia). While these models do not explicitly incorporate program semantics (i.e., execution results) during training, they are able to generate correct solutions for many problems. However, choosing a single correct program from a generated set for each problem remains challenging. In this work, we introduce execution result--based minimum Bayes risk decoding (MBR-EXEC) for program selection and show that it improves the few-shot performance of pretrained code models on natural-language-to-code tasks. We select output programs from a generated candidate set by marginalizing over program implementations that share the same semantics. Because exact equivalence is intractable, we execute each program on a small number of test inputs to approximate semantic equivalence. Across datasets, execution or simulated execution significantly outperforms the methods that do not involve program semantics. We find that MBR-EXEC consistently improves over all execution-unaware selection methods, suggesting it as an effective approach for natural language to code translation.", "track": "Machine Learning for NLP", "label": 3, "url": ""}, {"loc": [4.792774677276611, 3.505635976791382], "id": 536, "title": "Life is a Circus and We are the Clowns: Automatically Finding Analogies between Situations and Processes", "authors": "Oren Sultan and Dafna Shahaf", "abstract": "Analogy-making gives rise to reasoning, abstraction, flexible categorization and counterfactual inference -- abilities lacking in even the best AI systems today. Much research has suggested that analogies are key to non-brittle systems that can adapt to new domains. Despite their importance, analogies received little attention in the NLP community, with most research focusing on simple word analogies. Work that tackled more complex analogies relied heavily on manually constructed, hard-to-scale input representations.\nIn this work, we explore a more realistic, challenging setup: our input is a pair of natural language procedural texts, describing a situation or a process (e.g., how the heart works/how a pump works). \nOur goal is to automatically extract entities and their relations from the text and find a mapping between the different domains based on relational similarity (e.g., blood is mapped to water). \n\nWe develop an interpretable, scalable algorithm and demonstrate that it identifies the correct mappings 87% of the time for procedural texts and 94% for stories from cognitive-psychology literature. We show it can extract analogies from a large dataset of procedural texts, achieving 79% precision (analogy prevalence in data: 3%). Lastly, we demonstrate that our algorithm is robust to paraphrasing the input texts", "track": "NLP Applications", "label": 0, "url": "https://www.semanticscholar.org/reader/cc215aeab129dd3f403351353a07236a7944b763?experiments=&features=reader_skimming%3Atrue"}, {"loc": [9.133277893066406, 6.43787956237793], "id": 547, "title": "Language Contamination Helps Explains the Cross-lingual Capabilities of English Pretrained Models", "authors": "Terra Blevins and Luke Zettlemoyer", "abstract": "English pretrained language models, which make up the backbone of many modern NLP systems, require huge amounts of unlabeled training data. These models are generally presented as being trained only on English text but have been found to transfer surprisingly well to other languages. We investigate this phenomenon and find that common English pretraining corpora actually contain significant amounts of non-English text: even when less than 1% of data is not English (well within the error rate of strong language classifiers), this leads to hundreds of millions of foreign language tokens in large-scale datasets. We then demonstrate that even these small percentages of non-English data facilitate cross-lingual transfer for models trained on them, with target language performance strongly correlated to the amount of in-language data seen during pretraining. In light of these findings, we argue that no model is truly monolingual when pretrained at scale, which should be considered when evaluating cross-lingual transfer.", "track": "Multilinguality", "label": 13, "url": ""}, {"loc": [9.101027488708496, 6.344759464263916], "id": 548, "title": "Analyzing the Mono- and Cross-Lingual Pretraining Dynamics of Multilingual Language Models", "authors": "Terra Blevins, Hila Gonen and Luke Zettlemoyer", "abstract": "The emergent cross-lingual transfer seen in multilingual pretrained models has sparked significant interest in studying their behavior. However, because these analyses have focused on fully trained multilingual models, little is known about the dynamics of the multilingual pretraining process. We investigate when these models acquire their in-language and cross-lingual abilities by probing checkpoints taken from throughout XLM-R pretraining, using a suite of linguistic tasks. Our analysis shows that the model achieves high in-language performance early on, with lower-level linguistic skills acquired before more complex ones. In contrast, the point in pretraining when the model learns to transfer cross-lingually differs across language pairs. Interestingly, we also observe that, across many languages and tasks, the final model layer exhibits significant performance degradation over time, while linguistic knowledge propagates to lower layers of the network. Taken together, these insights highlight the complexity of multilingual pretraining and the resulting varied behavior for different languages over time.", "track": "Multilinguality", "label": 13, "url": "https://www.semanticscholar.org/reader/0b4f0f6b04476c4f2cdfeabf99d4b835227f0bb2?experiments=&features=reader_skimming%3Atrue"}, {"loc": [10.51369857788086, 7.22982931137085], "id": 566, "title": "Neural Machine Translation with Contrastive Translation Memories", "authors": "Xin Cheng, Shen Gao, Lemao Liu, Dongyan Zhao and Rui Yan", "abstract": "Retrieval-augmented Neural Machine Translation models have been successful in many translation scenarios. Different from previous works that make use of mutually similar but redundant translation memories~(TMs), we propose a new retrieval-augmented NMT to model contrastively retrieved translation memories that are holistically similar to the source sentence while individually contrastive to each other providing maximal information gain in three phases. First, in TM retrieval phase, we adopt contrastive retrieval algorithm to avoid redundancy and uninformativeness of similar translation pieces. Second, in memory encoding stage, given a set of TMs we propose a novel Hierarchical Group Attention module to gather both local context of each TM and global context of the whole TM set. Finally, in training phase, a Multi-TM contrastive learning objective is introduced to learn salient feature of each TM with respect to target sentence. Experimental results show that our framework obtains substantial improvements over strong baselines in the benchmark dataset.", "track": "Machine Translation", "label": 10, "url": ""}, {"loc": [1.6771990060806274, 8.707792282104492], "id": 569, "title": "Distilling Causal Effect from Miscellaneous Other-Class for Continual Named Entity Recognition", "authors": "Junhao Zheng, Zhanxian Liang, Haibin Chen and Qianli Ma", "abstract": "Continual Learning for Named Entity Recognition (CL-NER) aims to learn a growing number of entity types over time from a stream of data. However, simply learning Other-Class in the same way as new entity types amplifies the catastrophic forgetting and leads to a substantial performance drop. The main cause behind this is that Other-Class samples usually contain old entity types, and the old knowledge in these Other-Class samples is not preserved properly. Thanks to the causal inference, we identify that the forgetting is caused by the missing causal effect from the old data.To this end, we propose a unified causal framework to retrieve the causality from both new entity types and Other-Class.Furthermore, we apply curriculum learning to mitigate the impact of label noise and introduce a self-adaptive weight for balancing the causal effects between new entity types and Other-Class. Experimental results on three benchmark datasets show that our method outperforms the state-of-the-art method by a large margin. Moreover, our method can be combined with the existing state-of-the-art methods to improve the performance in CL-NER.", "track": "NLP Applications", "label": 0, "url": "https://www.semanticscholar.org/reader/2cad84f86b4632b356642c2c3ac799cc94383e0c?experiments=&features=reader_skimming%3Atrue"}, {"loc": [7.22475528717041, 6.848784446716309], "id": 570, "title": "Exploring the Secrets Behind the Learning Difficulty of Meaning Representations for Semantic Parsing", "authors": "Zhenwen Li, Jiaqi Guo, Qian Liu, Jian-Guang LOU and Tao Xie", "abstract": "Previous research has shown that the design of Meaning Representation (MR) greatly influences the final model performance of a neural semantic parser. Therefore, designing a good MR is a long-term goal for semantic parsing. However, it is still an art as there is no quantitative indicator that can tell us which MR among a set of candidates may have the best final model performance. In practice, in order to\nselect an MR design, researchers often have to go through the whole training-testing process for all design candidates, and the process often costs a lot. In this paper, we propose a data-aware metric called ISS (denoting incremental structural stability) of MRs, and demonstrate that ISS is highly correlated with the final performance. The finding shows that ISS can be used as an indicator for MR design to avoid the costly training-testing process.", "track": "Semantics: Lexical, Sentence level, Textual Inference and Other areas", "label": 8, "url": ""}, {"loc": [5.544415473937988, 12.263265609741211], "id": 577, "title": "That's the Wrong Lung! Evaluating and Improving the Interpretability of Unsupervised Multimodal Encoders for Medical Data", "authors": "Jered McInerney, Geoffrey Young, Jan-Willem van de Meent and Byron Wallace", "abstract": "Pretraining multimodal models on Electronic Health Records (EHRs) provides a means of learning representations that can transfer to downstream tasks with minimal supervision. Recent multimodal models induce soft local alignments between image regions and sentences. This is of particular interest in the medical domain, where alignments might highlight regions in an image relevant to specific phenomena described in free-text. While past work has suggested that attention \"heatmaps\u201d can be interpreted in this manner, there has been little evaluation of such alignments. We compare alignments from a state-of-the-art multimodal (image and text) model for EHR with human annotations that link image regions to sentences. Our main finding is that the text has an often weak or unintuitive influence on attention; alignments do not consistently reflect basic anatomical information. Moreover, synthetic modifications \u2014 such as substituting \"left\u201d for \"right\u201d \u2014 do not substantially influence highlights. Simple techniques such as allowing the model to opt out of attending to the image and few-shot finetuning show promise in terms of their ability to improve alignments with very little or no supervision. We make our code and checkpoints open-source.", "track": "Interpretability, Interactivity and Analysis of Models for NLP", "label": 9, "url": ""}, {"loc": [8.765167236328125, 6.520447731018066], "id": 582, "title": "Unsupervised Tokenization Learning", "authors": "Anton Kolonin and Vignav Ramesh", "abstract": "In the presented study, we discover that the so-called \"transition freedom\u201d metric appears superior for unsupervised tokenization purposes in comparison to statistical metrics such as mutual information and conditional probability, providing F-measure scores in range from 0.71 to 1.0 across explored multilingual corpora. We find that different languages require different offshoots of that metric (such as derivative, variance, and \"peak values\u201d) for successful tokenization. Larger training corpora do not necessarily result in better tokenization quality, while compressing the models by eliminating statistically weak evidence tends to improve performance. The proposed unsupervised tokenization technique provides quality better than or comparable to lexicon-based ones, depending on the language.", "track": "Unsupervised and Weakly-Supervised Methods in NLP", "label": 17, "url": "https://www.semanticscholar.org/reader/60eae587d084b4bc3bb7ae31d5e84a97e9dff15d?experiments=&features=reader_skimming%3Atrue"}, {"loc": [10.656447410583496, 6.976902961730957], "id": 590, "title": "A Template-based Method for Constrained Neural Machine Translation", "authors": "Shuo Wang, Peng Li, Zhixing Tan, Zhaopeng Tu, Maosong Sun and Yang Liu", "abstract": "Machine translation systems are expected to cope with various types of constraints in many practical scenarios. While neural machine translation (NMT) has achieved strong performance in unconstrained cases, it is non-trivial to impose pre-specified constraints into the translation process of NMT models. Although many approaches have been proposed to address this issue, most existing methods can not satisfy the following three desiderata at the same time: (1) high translation quality, (2) high match accuracy, and (3) low latency. In this work, we propose a template-based method that can yield results with high translation quality and match accuracy and the inference speed of our method is comparable with unconstrained NMT models. Our basic idea is to rearrange the generation of constrained and unconstrained tokens through a template. Our method does not require any changes in the model architecture and the decoding algorithm. Experimental results show that the proposed template-based approach can outperform several representative baselines in both lexically and structurally constrained translation tasks.", "track": "Machine Translation", "label": 10, "url": "https://www.semanticscholar.org/reader/558f8e4eabee92f2ac6c928c2f31759ce1c839b7?experiments=&features=reader_skimming%3Atrue"}, {"loc": [8.615113258361816, 8.294707298278809], "id": 597, "title": "PATS: Sensitivity-aware Noisy Learning for Pretrained Language Models", "authors": "Yupeng Zhang, Hongzhi Zhang, Sirui Wang, Wei Wu and Zhoujun Li", "abstract": "A wide range of NLP tasks benefit from the fine-tuning of pretrained language models (PLMs). However, a number of redundant parameters which contribute less to the downstream task are observed in a directly fine-tuned model. We consider the gap between pretraining and downstream tasks hinders the training of these redundant parameters, and results in a suboptimal performance of the overall model. In this paper, we present PATS (Perturbation According To Sensitivity), a noisy training mechanism which considers each parameter's importance in the downstream task to help fine-tune PLMs. The main idea of PATS is to add bigger noise to parameters with lower sensitivity and vice versa, in order to activate more parameters' contributions to downstream tasks without affecting the sensitive ones much. Extensive experiments conducted on different tasks of the GLUE benchmark show PATS can consistently empower the fine-tuning of different sizes of PLMs, and the parameters in the well-performing models always have more concentrated distributions of sensitivities, which experimentally proves the effectiveness of our method.", "track": "Machine Learning for NLP", "label": 3, "url": "https://www.semanticscholar.org/reader/c495061b6352a3fad808bfe8268877ff39453f91?experiments=&features=reader_skimming%3Atrue"}, {"loc": [6.902408123016357, 9.890228271484375], "id": 611, "title": "Towards Reinterpreting Neural Topic Models via Composite Activations", "authors": "Jia Peng Lim and Hady Lauw", "abstract": "Most Neural Topic Models (NTM) use a variational auto-encoder framework producing K topics limited to the size of the encoder's output. These topics are interpreted through the selection of the top activated words via the weights or reconstructed vector of the decoder that are directly connected to each neuron. In this paper, we present a model-free two-stage process to reinterpret NTM and derive further insights on the state of the trained model. Firstly, building on the original information from a trained NTM, we generate a pool of potential candidate \"composite topics\" by exploiting possible co-occurrences within the original set of topics, which decouples the strict interpretation of topics from the original NTM. This is followed by a combinatorial formulation to select a final set of composite topics, which we evaluate for coherence and diversity on a large external corpus. Lastly, we employ a user study to derive further insights on the reinterpretation process.", "track": "Information Retrieval and Text Mining", "label": 15, "url": ""}, {"loc": [3.785860061645508, 9.92243480682373], "id": 630, "title": "Few-shot Query-Focused Summarization with Prefix-Merging", "authors": "Ruifeng Yuan, zili Wang, Ziqiang Cao and Wenjie Li", "abstract": "Query-focused summarization has been considered as an important extension for text summarization. It aims to generate a concise highlight for a given query. Different from text summarization, query-focused summarization has long been plagued by the problem of lacking high-quality large-scale datasets. In this paper, we investigate the idea that whether we can integrate and transfer the knowledge of text summarization and question answering to assist the few-shot learning in query-focused summarization. Here, we propose prefix-merging, a prefix-based pretraining strategy for few-shot learning in query-focused summarization. Drawn inspiration from prefix-tuning, we are allowed to integrate the task knowledge from text summarization and question answering into a properly designed prefix and apply the merged prefix to query-focused summarization. With only a small amount of trainable parameters, prefix-merging outperforms fine-tuning on query-focused summarization. We further discuss the influence of different prefix designs and propose a visualized explanation for how prefix-merging works.", "track": "Summarization", "label": 14, "url": ""}, {"loc": [9.69129753112793, 6.506754398345947], "id": 638, "title": "Cross-Align: Modeling Deep Cross-lingual Interactions for Word Alignment", "authors": "Siyu Lai, Zhen Yang, Fandong Meng, Yufeng Chen, Jinan Xu and Jie Zhou", "abstract": "Word alignment which aims to extract lexicon translation equivalents between source and target sentences, serves as a fundamental tool for natural language processing. Recent studies in this area have yielded substantial improvements by generating alignments from contextualized embeddings of the pre-trained multilingual language models. However, we find that the existing approaches capture few interactions between the input sentence pairs, which degrades the word alignment quality severely, especially for the ambiguous words in the monolingual context. To remedy this problem, we propose Cross-Align to model deep interactions between the input sentence pairs, in which the source and target sentences are encoded separately with the shared self-attention modules in the shallow layers, while cross-lingual interactions are explicitly constructed by the cross-attention modules in the upper layers. Besides, to train our model effectively, we propose a two-stage training framework, where the model is trained with a simple Translation Language Modeling (TLM) objective in the first stage and then finetuned with a self-supervised alignment objective in the second stage.  Experiments show that the proposed Cross-Align achieves the state-of-the-art (SOTA) performance on four out of five language pairs.", "track": "Multilinguality", "label": 13, "url": "https://www.semanticscholar.org/reader/bcce29cc190f6669fd76aacf309e06be222dfbb1?experiments=&features=reader_skimming%3Atrue"}, {"loc": [5.557558536529541, 8.130949974060059], "id": 663, "title": "BERTScore is Unfair: On Social Bias in Language Model-Based Metrics for Text Generation", "authors": "Tianxiang Sun, Junliang He, Xipeng Qiu and Xuanjing Huang", "abstract": "Automatic evaluation metrics are crucial to the development of generative systems. In recent years, pre-trained language model (PLM) based metrics, such as BERTScore, have been commonly adopted in various generation tasks. However, it has been demonstrated that PLMs encode a range of stereotypical societal biases, leading to a concern about the fairness of PLMs as metrics. To that end, this work presents the first systematic study on the social bias in PLM-based metrics. We demonstrate that popular PLM-based metrics exhibit significantly higher social bias than traditional metrics on 6 sensitive attributes, namely race, gender, religion, physical appearance, age, and socioeconomic status. In-depth analysis suggests that choosing paradigms (matching, regression, or generation) of the metric has a greater impact on fairness than choosing PLMs. In addition, we develop debiasing adapters that are injected into PLM layers, mitigating bias in PLM-based metrics while retaining high performance for evaluating text generation.", "track": "Ethics", "label": 21, "url": "https://www.semanticscholar.org/reader/969f45a3adf5e0bcf741447b1c67a0f3a386801a?experiments=&features=reader_skimming%3Atrue"}, {"loc": [7.265092372894287, 9.717418670654297], "id": 667, "title": "HPT: Hierarchy-aware Prompt Tuning for Hierarchical Text Classification", "authors": "Zihan Wang, Peiyi Wang, Tianyu Liu, Binghuai Lin, Yunbo Cao, Zhifang Sui and Houfeng Wang", "abstract": "Hierarchical text classification (HTC) is a challenging subtask of multi-label classification due to its complex label hierarchy.\nRecently, the pretrained language models (PLM)\nhave been widely adopted in HTC through a fine-tuning paradigm. However, in this paradigm, there exists a huge gap between the classification tasks with sophisticated label hierarchy and the masked language model (MLM) pretraining tasks of PLMs and thus the potential of PLMs cannot be fully tapped.\nTo bridge the gap, in this paper, we propose HPT, a Hierarchy-aware Prompt Tuning method to handle HTC from a multi-label MLM perspective.\nSpecifically, we construct a dynamic virtual template and label words that take the form of soft prompts to fuse the label hierarchy knowledge and introduce a zero-bounded multi-label cross-entropy loss to harmonize the objectives of HTC and MLM.\nExtensive experiments show HPT achieves state-of-the-art performances on 3 popular HTC datasets and is adept at handling the imbalance and low resource situations. Our code is available at https://github.com/wzh9969/HPT.", "track": "Machine Learning for NLP", "label": 3, "url": "https://www.semanticscholar.org/reader/14c2611ab6c858cd3fab586f553eac6a10212fc3?experiments=&features=reader_skimming%3Atrue"}, {"loc": [8.052157402038574, 8.709228515625], "id": 674, "title": "Not to Overfit or Underfit the Source Domains? An Empirical Study of Domain Generalization in Question Answering", "authors": "Md Arafat Sultan, Avi Sil and Radu Florian", "abstract": "Machine learning models are prone to overfitting their training (source) domains, which is commonly believed to be the reason why they falter in novel target domains. Here we examine the contrasting view that multi-source domain generalization (DG) is first and foremost a problem of mitigating source domain underfitting: models not adequately learning the signal already present in their multi-domain training data. Experiments on a reading comprehension DG benchmark show that as a model learns its source domains better\u2014using familiar methods such as knowledge distillation (KD) from a bigger model\u2014its zero-shot out-of-domain utility improves at an even faster pace. Improved source domain learning also demonstrates superior out-of-domain generalization over three popular existing DG approaches that aim to limit overfitting. Our implementation of KD-based domain generalization is available via PrimeQA at: https://ibm.biz/domain-generalization-with-kd.", "track": "Question Answering", "label": 11, "url": ""}, {"loc": [5.983711242675781, 6.207870960235596], "id": 681, "title": "Neural Theory-of-Mind? On the Limits of Social Intelligence in Large LMs", "authors": "Maarten Sap, Ronan Le Bras, Daniel Fried and Yejin Choi", "abstract": "Social intelligence and Theory of Mind (TOM), i.e., the ability to reason about the different mental states, intents, and reactions of all people involved, allows humans to effectively navigate and understand everyday social interactions. As NLP systems are used in increasingly complex social situations, their ability to grasp social dynamics becomes crucial.\n\nIn this work, we examine the open question of social intelligence and Theory of Mind in modern NLP systems from an empirical and theorybased perspective. We show that one of today's largest language models (GPT-3; Brown et al., 2020) lacks this kind of social intelligence out-of-the box, using two tasks: SocialIQa (Sap et al., 2019), which measure models' ability to understand intents and reactions of participants of social interactions, and ToMi (Le, Boureau, and Nickel, 2019), which measures whether models can infer mental states and realities of participants of situations.\n\nOur results show that models struggle substantially at these Theory of Mind tasks, with well-below-human accuracies of 55% and 60% on SocialIQa and ToMi, respectively. To conclude, we draw on theories from pragmatics to contextualize this shortcoming of large language models, by examining the limitations stemming from their data, neural architecture, and training paradigms. Challenging the prevalent narrative that only scale is needed, we posit that person-centric NLP approaches might be more effective towards neural Theory of Mind.", "track": "Theme Track", "label": 18, "url": "https://www.semanticscholar.org/reader/b4c16b0f26f9f5ad5e12f9bec3f1ad72eaa5491b?experiments=&features=reader_skimming%3Atrue"}, {"loc": [2.5048956871032715, 4.591599941253662], "id": 683, "title": "Improving Passage Retrieval with Zero-Shot Question Generation", "authors": "Devendra Sachan, Mike Lewis, Mandar Joshi, Armen Aghajanyan, Wen-tau Yih, Joelle Pineau and Luke Zettlemoyer", "abstract": "We propose a simple and effective re-ranking method for improving passage retrieval in open question answering. The re-ranker re-scores retrieved passages with a zero-shot question generation model, which uses a pre-trained language model to compute the probability of the input question conditioned on a retrieved passage. This approach can be applied on top of any retrieval method (e.g. neural or keyword-based), does not require any domain- or task-specific training (and therefore is expected to generalize better to data distribution shifts), and provides rich cross-attention between query and passage (i.e. it must explain every token in the question). When evaluated on a number of open-domain retrieval datasets, our re-ranker improves strong unsupervised retrieval models by 6%-18% absolute and strong supervised models by up to 12% in terms of top-20 passage retrieval accuracy. We also obtain new state-of-the-art results on full open-domain question answering by simply adding the new re-ranker to existing models with no further changes.", "track": "Question Answering", "label": 11, "url": ""}, {"loc": [3.701219081878662, 9.476897239685059], "id": 684, "title": "Summarizing Community-based Question-Answer Pairs", "authors": "Ting-Yao Hsu, Yoshi Suhara and Xiaolan Wang", "abstract": "Community-based Question Answering (CQA), which allows users to acquire their desired information, has increasingly become an essential component of online services in various domains such as E-commerce, travel, and dining. However, an overwhelming number of CQA pairs makes it difficult for users without particular intent to find useful information spread over CQA pairs. To help users quickly digest the key information, we propose the novel CQA summarization task that aims to create a concise summary from CQA pairs. To this end, we first design a multi-stage data annotation process and create a benchmark dataset, COQASUM, based on the Amazon QA corpus. We then compare a collection of extractive and abstractive summarization methods and establish a strong baseline approach DedupLED for the CQA summarization task. Our experiment further confirms two key challenges, sentence-type transfer and deduplication removal, towards the CQA summarization task. Our data and code are publicly available.", "track": "Summarization", "label": 14, "url": ""}, {"loc": [4.708431243896484, 4.635732650756836], "id": 687, "title": "Logical Reasoning with Span-Level Predictions for Interpretable and Robust NLI Models", "authors": "Joe Stacey, Pasquale Minervini, Haim Dubossarsky and Marek Rei", "abstract": "Current Natural Language Inference (NLI) models achieve impressive results, sometimes outperforming humans when evaluating on in-distribution test sets. However, as these models are known to learn from annotation artefacts and dataset biases, it is unclear to what extent the models are learning the task of NLI instead of learning from shallow heuristics in their training data.\n\nWe address this issue by introducing a logical reasoning framework for NLI, creating highly transparent model decisions that are based on logical rules. Unlike prior work, we show that improved interpretability can be achieved without decreasing the predictive accuracy. We almost fully retain performance on SNLI, while also identifying the exact hypothesis spans that are responsible for each model prediction.\n\nUsing the e-SNLI human explanations, we verify that our model makes sensible decisions at a span level, despite not using any span labels during training. We can further improve model performance and the span-level decisions by using the e-SNLI explanations during training. Finally, our model is more robust in a reduced data setting. When training with only 1,000 examples, out-of-distribution performance improves on the MNLI matched and mismatched validation sets by 13% and 16% relative to the baseline. Training with fewer observations yields further improvements, both in-distribution and out-of-distribution.", "track": "Interpretability, Interactivity and Analysis of Models for NLP", "label": 9, "url": ""}, {"loc": [4.543882846832275, 6.71017599105835], "id": 688, "title": "How to disagree well: Investigating the dispute tactics used on Wikipedia", "authors": "Christine De Kock and Andreas Vlachos", "abstract": "Disagreements are frequently studied from the perspective of either detecting toxicity or analysing argument structure. We propose a framework of dispute tactics which unifies these two perspectives, as well as other dialogue acts which play a role in resolving disputes, such as asking questions and providing clarification. This framework includes a preferential ordering among rebuttal-type tactics, ranging from ad hominem attacks to refuting the central argument. Using this framework, we annotate 213 disagreements (3,865 utterances) from Wikipedia Talk pages. This allows us to investigate research questions around the tactics used in disagreements; for instance, we provide empirical validation of the  approach to disagreement recommended by Wikipedia. We develop models for multilabel prediction of dispute tactics in an utterance, achieving the best performance with a transformer-based label powerset model. Adding an auxiliary task to incorporate the ordering of rebuttal tactics further yields a statistically significant increase. Finally, we show that these annotations can be used to provide useful additional signals to improve performance on the task of predicting escalation.", "track": "Computational Social Science and Cultural Analytics", "label": 20, "url": ""}, {"loc": [3.925905466079712, 9.288348197937012], "id": 696, "title": "Chapter Ordering in Novels", "authors": "Allen Kim and Steve Skiena", "abstract": "Understanding narrative flow and text coherence in long-form documents (novels) remains an open problem in NLP.\nTo gain insight, we explore the task of chapter ordering, reconstructing the original order of chapters in novel given a random permutation of the text. This can be seen as extending the well-known sentence ordering task to vastly larger documents: our task deals with over 9,000 novels with an average of twenty chapters each, versus standard sentence ordering datasets averaging only 5-8 sentences. We formulate the task of reconstructing order as a constraint solving problem, using minimum feedback arc set and traveling salesman problem optimization criteria, where the weights of the graph are generated based on models for character occurrences and chapter boundary detection, using relational chapter scores derived from RoBERTa. Our best methods yield a Spearman correlation of 0.59 on this novel and challenging task, substantially above baseline.", "track": "NLP Applications", "label": 0, "url": ""}, {"loc": [3.597039222717285, 4.510239124298096], "id": 699, "title": "Open-ended Knowledge Tracing for Computer Science Education", "authors": "Naiming Liu, Richard Baraniuk, Andrew Lan and Zichao Wang", "abstract": "In educational applications, knowledge tracing refers to the problem of estimating students' time-varying concept/skill mastery level from their past responses to questions and predicting their future performance.\nOne key limitation of most existing knowledge tracing methods is that they treat student responses to questions as binary-valued, i.e., whether they are correct or incorrect. \nResponse correctness analysis/prediction is straightforward, but it ignores important information regarding mastery, especially for open-ended questions.\nIn contrast, exact student responses can provide much more information.\nIn this paper, we conduct the first exploration int open-ended knowledge tracing (OKT) by studying the new task of predicting students' exact open-ended responses to questions.\nOur work is grounded in the domain of computer science education with programming questions. \nWe develop an initial solution to the OKT problem, a student knowledge-guided code generation approach, that combines program synthesis methods using language models with student knowledge tracing methods. \nWe also conduct a series of quantitative and qualitative experiments on a real-world student code dataset to validate and demonstrate the promise of OKT.", "track": "NLP Applications", "label": 0, "url": ""}, {"loc": [0.9639930725097656, 6.660263538360596], "id": 704, "title": "Logical Neural Networks for Knowledge Base Completion with Embeddings & Rules", "authors": "Prithviraj Sen, Breno William Carvalho, Ibrahim Abdelaziz, Pavan Kapanipathi, Salim Roukos and Alexander Gray", "abstract": "Knowledge base completion (KBC) has benefitted greatly by learning explainable rules in an human-interpretable dialect such as first-order logic. Rule-based KBC has so far, mainly focussed on learning one of two types of rules: conjunction-of-disjunctions and disjunction-of-conjunctions. We qualitatively show, via examples, that one of these has an advantage over the other when it comes to achieving high quality KBC. To the best of our knowledge, we are the first to propose learning both kinds of rules within a common framework. To this end, we propose to utilize logical neural networks (LNN), a powerful neuro-symbolic AI framework that can express both kinds of rules and learn these end-to-end using gradient-based optimization. Our in-depth experiments show that our LNN-based approach to learning rules for KBC leads to roughly 10% relative improvements, if not more, over SotA rule-based KBC methods. Moreover, by showing how to combine our proposed methods with knowledge graph embeddings we further achieve an additional 7.5% relative improvement.", "track": "Information Extraction", "label": 5, "url": ""}, {"loc": [5.597498416900635, 12.144219398498535], "id": 707, "title": "MedCLIP: Contrastive Learning from Unpaired Medical Images and Text", "authors": "Zifeng Wang, Zhenbang Wu, Dinesh Agarwal and Jimeng Sun", "abstract": "Existing vision-text contrastive learning like CLIP aims to match the paired image and caption embeddings while pushing others apart, which improves representation transferability and supports zero-shot prediction. However, medical image-text datasets are orders of magnitude below the general images and captions from the internet. Moreover, previous methods encounter many false negatives, i.e., images and reports from separate patients probably carry the same semantics but are wrongly treated as negatives. In this paper, we decouple images and texts for multimodal contrastive learning, thus scaling the usable training data in a combinatorial magnitude with low cost. We also propose to replace the InfoNCE loss with semantic matching loss based on medical knowledge to eliminate false negatives in contrastive learning. We prove that MedCLIP is a simple yet effective framework: it outperforms state-of-the-art methods on zero-shot prediction, supervised classification, and image-text retrieval. Surprisingly, we observe that with only 20K pre-training data, MedCLIP wins over the state-of-the-art method (using 200K data). The code is available at https://github.com/RyanWangZf/MedCLIP.", "track": "NLP Applications", "label": 0, "url": "https://www.semanticscholar.org/reader/cdd9c1d23f9e89d5113f3e31821bb174c6a6afed?experiments=&features=reader_skimming%3Atrue"}, {"loc": [8.752326965332031, 8.1732759475708], "id": 731, "title": "GA-SAM: Gradient-Strength based Adaptive Sharpness-Aware Minimization for Improved Generalization", "authors": "Zhiyuan Zhang, Ruixuan Luo, Qi Su and Xu Sun", "abstract": "Recently, Sharpness-Aware Minimization (SAM) algorithm has shown state-of-the-art generalization abilities in vision tasks. It demonstrates that flat minima tend to imply better generalization abilities. However, it has some difficulty implying SAM to some natural language tasks, especially to models with drastic gradient changes, such as RNNs. In this work, we analyze the relation between the flatness of the local minimum and its generalization ability from a novel and straightforward theoretical perspective. We propose that the shift of the training and test distributions can be equivalently seen as a virtual parameter corruption or perturbation, which can explain why flat minima that are robust against parameter corruptions or perturbations have better generalization performances. On its basis, we propose a Gradient-Strength based Adaptive Sharpness-Aware Minimization (GA-SAM) algorithm to help to learn algorithms find flat minima that generalize better. Results in various language benchmarks validate the effectiveness of the proposed GA-SAM algorithm on natural language tasks.", "track": "Machine Learning for NLP", "label": 3, "url": "https://www.semanticscholar.org/reader/5a41152cfa769414f9d54cf436b98f36ffb0b729?experiments=&features=reader_skimming%3Atrue"}, {"loc": [7.719780921936035, 7.858575820922852], "id": 732, "title": "Sparse Teachers Can Be Dense with Knowledge", "authors": "Yi Yang, Chen Zhang and Dawei Song", "abstract": "Recent advances in distilling pretrained language models have discovered that, besides the expressiveness of knowledge, the student-friendliness should be taken into consideration to realize a truly knowledgeable teacher. Based on a pilot study, we find that over-parameterized teachers can produce expressive yet student-unfriendly knowledge and are thus limited in overall knowledgeableness. To remove the parameters that result in student-unfriendliness, we propose a sparse teacher trick under the guidance of an overall knowledgeable score for each teacher parameter. The knowledgeable score is essentially an interpolation of the expressiveness and student-friendliness scores. The aim is to ensure that the expressive parameters are retained while the student-unfriendly ones are removed. Extensive experiments on the GLUE benchmark show that the proposed sparse teachers can be dense with knowledge and lead to students with compelling performance in comparison with a series of competitive baselines.", "track": "Efficient Methods for NLP", "label": 12, "url": "https://www.semanticscholar.org/reader/2bf7978afacd83e5fc813741c11a0c0421cb2dfd?experiments=&features=reader_skimming%3Atrue"}, {"loc": [8.194052696228027, 8.937093734741211], "id": 739, "title": "BBTv2: Towards a Gradient-Free Future with Large Language Models", "authors": "Tianxiang Sun, Zhengfu He, Hong Qian, Yunhua Zhou, Xuanjing Huang and Xipeng Qiu", "abstract": "Most downstream adaptation methods tune all or part of the parameters of pre-trained models (PTMs) through gradient descent, where the tuning cost increases linearly with the growth of the model size.\nBy contrast, gradient-free methods only require the forward computation of the PTM to tune the prompt, retaining the benefits of efficient tuning and deployment.\nThough, past work on gradient-free tuning often introduces gradient descent to seek a good initialization of prompt and lacks versatility across tasks and PTMs.\nIn this paper, we present BBTv2, an improved version of Black-Box Tuning, to drive PTMs for few-shot learning.\nWe prepend continuous prompts to every layer of the PTM and propose a divide-and-conquer gradient-free algorithm to optimize the prompts at different layers alternately.\nExtensive experiments across various tasks and PTMs show that BBTv2 can achieve comparable performance to full model tuning and state-of-the-art parameter-efficient methods (e.g., Adapter, LoRA, BitFit, etc.) under few-shot settings while maintaining much fewer tunable parameters.", "track": "Machine Learning for NLP", "label": 3, "url": "https://www.semanticscholar.org/reader/0f30612423381eb5d271c4ca4f4254149b0d22fa?experiments=&features=reader_skimming%3Atrue"}, {"loc": [2.4545364379882812, 4.608763217926025], "id": 746, "title": "Passage-Mask: A Learnable Regularization Strategy for Retriever-Reader Models", "authors": "Shujian Zhang, Chengyue Gong and Xingchao Liu", "abstract": "Retriever-reader models achieve competitive performance across many different NLP tasks such as open question answering and dialogue conversations. In this work, we notice these models easily overfit the top-rank retrieval passages and standard training fails to reason over the entire retrieval passages. We introduce a learnable passage mask mechanism which desensitizes the impact from the top-rank retrieval passages and prevents the model from overfitting. Controlling the gradient variance with fewer mask candidates and selecting the mask candidates with one-shot bi-level optimization, our learnable regularization strategy enforces the answer generation to focus on the entire retrieval passages. Experiments on different tasks across open question answering, dialogue conversation, and fact verification show that our method consistently outperforms its baselines. Extensive experiments and ablation studies demonstrate that our method can be general, effective, and beneficial for many NLP tasks.", "track": "Machine Learning for NLP", "label": 3, "url": "https://www.semanticscholar.org/reader/5aaaf17b9bc115e6a6ff7a2b0d11b3997647b969?experiments=&features=reader_skimming%3Atrue"}, {"loc": [8.391736030578613, 8.031400680541992], "id": 752, "title": "Mixed-effects transformers for hierarchical adaptation", "authors": "Julia White, Noah Goodman and Robert Hawkins", "abstract": "Language differs dramatically from context to context. To some degree, large language models like GPT-3 account for such variation by conditioning on strings of initial input text, or prompts.  However, prompting can be ineffective when contexts are sparse, out-of-sample, or extra-textual. In this paper, we introduce the mixed-effects transformer (MET), a novel approach for learning hierarchically-structured prefixes--- lightweight modules prepended to an input sequence--- to account for structured variation in language use. Specifically, we show how the popular class of mixed-effects regression models may be extended to transformer-based architectures using a regularized prefix-tuning procedure with dropout. We evaluate this approach on several domain-adaptation benchmarks, finding that it learns contextual variation from minimal data while generalizing well to unseen contexts.", "track": "Language Modeling and Analysis of Language Models", "label": 2, "url": "https://www.semanticscholar.org/reader/b490fa416f303cda5f8665a618006203fb20d67d?experiments=&features=reader_skimming%3Atrue"}, {"loc": [8.009950637817383, 9.670308113098145], "id": 756, "title": "On Measuring the Intrinsic Few-Shot Hardness of Datasets", "authors": "Xinran Zhao, Shikhar Murty and Christopher D. Manning", "abstract": "While advances in pre-training have led to dramatic improvements in few-shot learning of NLP tasks, there is limited understanding of what drives successful few-shot adaptation in datasets. In particular, given a new dataset and a pre-trained model, what properties of the dataset make it few-shot learnable, and are these properties independent of the specific adaptation techniques used? We consider an extensive set of recent few-shot learning methods and show that their performance across a large number of datasets is highly correlated,  showing that few-shot hardness may be intrinsic to datasets, for a given pre-trained model. To estimate intrinsic few-shot hardness, we then propose a simple and lightweight metric called Spread that captures the intuition that few-shot learning is made possible by exploiting feature-space invariances between training and test samples. Our metric better accounts for few-shot hardness compared to existing notions of hardness and is ~8-100x faster to compute.", "track": "Machine Learning for NLP", "label": 3, "url": "https://www.semanticscholar.org/reader/d6ade4de1c5bccb052eb20e6d65f5232c8b61dc5?experiments=&features=reader_skimming%3Atrue"}, {"loc": [6.989253520965576, 9.617755889892578], "id": 757, "title": "Group is better than individual: Exploiting Label Topologies and Label Relations for Joint Multiple Intent Detection and Slot Filling", "authors": "Bowen Xing and Ivor Tsang", "abstract": "Recent joint multiple intent detection and slot filling models employ label embeddings to achieve the semantics-label interactions.\nHowever, they treat all labels and label embeddings as uncorrelated individuals, ignoring the dependencies among them. Besides, they conduct the decoding for the two tasks independently, without leveraging the correlations between them.\nTherefore, in this paper, we first construct a Heterogeneous Label Graph (HLG) containing two kinds of topologies: (1) statistical dependencies based on labels' co-occurrence patterns and hierarchies in slot labels; (2) rich relations among the label nodes.\nThen we propose a novel model termed ReLa-Net.\nIt can capture beneficial correlations among the labels from HLG.\nThe label correlations are leveraged to enhance semantic-label interactions. Moreover, we also propose the label-aware inter-dependent decoding mechanism to further exploit the label correlations for decoding. \nExperiment results show that our ReLa-Net significantly outperforms previous models.\nRemarkably, ReLa-Net surpasses the previous best model by over 20\\% in terms of overall accuracy on MixATIS dataset.", "track": "Dialogue and Interactive Systems", "label": 4, "url": "https://www.semanticscholar.org/reader/7dece8abe1afea95b77322025f0f92bb9d7ed3ec?experiments=&features=reader_skimming%3Atrue"}, {"loc": [3.886317253112793, 9.211671829223633], "id": 765, "title": "An Empirical Study on Finding Spans", "authors": "Weiwei Gu, Boyuan Zheng, Yunmo Chen, Tongfei Chen and Benjamin Van Durme", "abstract": "We present an empirical study on methods for span finding, the selection of consecutive tokens in text for some downstream tasks. We focus on approaches that can be employed in training end-to-end information extraction systems, and find there is no definitive solution without considering task properties, and provide our observations to help with future design choices: 1) a tagging approach often yields higher precision while span enumeration and boundary prediction provide higher recall; 2) span type information can benefit a boundary prediction approach; 3) additional contextualization does not help span finding in most cases.", "track": "Information Extraction", "label": 5, "url": "https://www.semanticscholar.org/reader/6dac365d3ff10de1a7fe464c5c5007e0aa644184?experiments=&features=reader_skimming%3Atrue"}, {"loc": [5.745916843414307, 11.904414176940918], "id": 767, "title": "MGDoc: Pre-training with Multi-granular Hierarchy for Document Image Understanding", "authors": "Zilong Wang, Jiuxiang Gu, Chris Tensmeyer, Nikolaos Barmpalios, Ani Nenkova, Tong Sun, Jingbo Shang and Vlad I. Morariu", "abstract": "Document images are a ubiquitous source of data where the text is organized in a complex hierarchical structure ranging from fine granularity (e.g., words), medium granularity (e.g., regions such as paragraphs or figures), to coarse granularity (e.g., the whole page). The spatial hierarchical relationships between content at different levels of granularity are crucial for document image understanding tasks. Existing methods learn features from either word-level or region-level but fail to consider both simultaneously. Word-level models are restricted by the fact that they originate from pure-text language models, which only encode the word-level context. In contrast, region-level models attempt to encode regions corresponding to paragraphs or text blocks into a single embedding, but they perform worse with additional word-level features. To deal with these issues, we propose MGDoc, a new multi-modal multi-granular pre-training framework that encodes page-level, region-level, and word-level information at the same time. MGDoc uses a unified text-visual encoder to obtain multi-modal features across different granularities, which makes it possible to project the multi-granular features into the same hyperspace. To model the region-word correlation, we design a cross-granular attention mechanism and specific pre-training tasks for our model to reinforce the model of learning the hierarchy between regions and words. Experiments demonstrate that our proposed model can learn better features that perform well across granularities and lead to improvements in downstream tasks.", "track": "Speech, Vision, Robotics, Multimodal Grounding", "label": 7, "url": ""}, {"loc": [5.359671115875244, 8.668365478515625], "id": 774, "title": "Understanding Jargon: Combining Extraction and Generation for Definition Modeling", "authors": "Jie Huang, Hanyin Shao, Kevin Chang, Jinjun Xiong and Wen-mei Hwu", "abstract": "Can machines know what twin prime is? From the composition of this phrase, machines may guess twin prime is a certain kind of prime, but it is still difficult to deduce exactly what twin stands for without additional knowledge. Here, twin prime is a jargon - a specialized term used by experts in a particular field. Explaining jargon is challenging since it usually requires domain knowledge to understand. Recently, there is an increasing interest in extracting and generating definitions of words automatically. However, existing approaches, either extraction or generation, perform poorly on jargon. In this paper, we propose to combine extraction and generation for jargon definition modeling: first extract self- and correlative definitional information of target jargon from the Web and then generate the final definitions by incorporating the extracted definitional information. Our framework is remarkably simple but effective: experiments demonstrate our method can generate high-quality definitions for jargon and outperform state-of-the-art models significantly, e.g., BLEU score from 8.76 to 22.66 and human-annotated score from 2.34 to 4.04.", "track": "Semantics: Lexical, Sentence level, Textual Inference and Other areas", "label": 8, "url": "https://www.semanticscholar.org/reader/b359105b2f6553c4699a2e988e459b8e4dce0ae4?experiments=&features=reader_skimming%3Atrue"}, {"loc": [4.707064151763916, 7.065857887268066], "id": 775, "title": "ProsocialDialog: A Prosocial Backbone for Conversational Agents", "authors": "Hyunwoo Kim, Youngjae Yu, Liwei Jiang, Ximing Lu, Daniel Khashabi, Gunhee Kim, Yejin Choi and Maarten Sap", "abstract": "Most existing dialogue systems fail to respond properly to potentially unsafe user utterances by either ignoring or passively agreeing with them. To address this issue, we introduce ProsocialDialog, the first large-scale multi-turn dialogue dataset to teach conversational agents to respond to problematic content following social norms. Covering diverse unethical, problematic, biased, and toxic situations, ProsocialDialog contains responses that encourage prosocial behavior, grounded in commonsense social rules (i.e., rules-of-thumb, RoTs). Created via a human-AI collaborative framework, ProsocialDialog consists of 58K dialogues, with 331K utterances, 160K unique RoTs, and 497K dialogue safety labels accompanied by free-form rationales.\n\nWith this dataset, we introduce a dialogue safety detection module, Canary, capable of generating RoTs given conversational context, and a socially-informed dialogue agent, Prost. Empirical results show that Prost generates more socially acceptable dialogues compared to other state-of-the-art language and dialogue models in both in-domain and out-of-domain settings. Additionally, Canary effectively guides conversational agents and off-the-shelf language models to generate significantly more prosocial responses. Our work highlights the promise and importance of creating and steering conversational AI to be socially responsible.", "track": "Dialogue and Interactive Systems", "label": 4, "url": "https://www.semanticscholar.org/reader/36c50e6638dddc8324eef9bfa064bfcab80cbef4?experiments=&features=reader_skimming%3Atrue"}, {"loc": [7.250244617462158, 9.73892593383789], "id": 779, "title": "Exploiting Global and Local Hierarchies for Hierarchical Text Classification", "authors": "Ting Jiang, Deqing Wang, Leilei Sun, Zhongzhi Chen, Fuzhen Zhuang and Qinghong Yang", "abstract": "Hierarchical text classification aims to leverage label hierarchy in multi-label text classification. Existing methods encode label hierarchy in a global view, where label hierarchy is treated as the static hierarchical structure containing all labels. Since global hierarchy is static and irrelevant to text samples, it makes these methods hard to exploit hierarchical information. Contrary to global hierarchy, local hierarchy as a structured labels hierarchy corresponding to each text sample. It is dynamic and relevant to text samples, which is ignored in previous methods. To exploit global and local hierarchies, we propose Hierarchy-guided BERT with Global and Local hierarchies (HBGL), which utilizes the large-scale parameters and prior language knowledge of BERT to model both global and local hierarchies. Moreover, HBGL avoids the intentional fusion of semantic and hierarchical modules by directly modeling semantic and hierarchical information with BERT. Compared with the state-of-the-art method HGCLR, our method achieves significant improvement on three benchmark datasets.", "track": "Semantics: Lexical, Sentence level, Textual Inference and Other areas", "label": 8, "url": "https://www.semanticscholar.org/reader/68137d118b31e13fb382bdceebd2365b4a6473fb?experiments=&features=reader_skimming%3Atrue"}, {"loc": [7.304051876068115, 6.875697612762451], "id": 782, "title": "Semantic-aware Contrastive Learning for More Accurate Semantic Parsing", "authors": "Shan Wu, Chunlei Xin, Bo Chen, Xianpei Han and Le Sun", "abstract": "Since the meaning representations are detailed and accurate annotations which express fine-grained sequence-level semtantics, it is usually hard to train discriminative semantic parsers via Maximum Likelihood Estimation (MLE) in an autoregressive fashion. In this paper, we propose a semantic-aware contrastive learning algorithm, which can learn to distinguish fine-grained meaning representations and take the overall sequence-level semantic into consideration. Specifically, a multi-level online sampling algorithm is proposed to sample confusing and diverse instances. Three semantic-aware similarity functions are designed to accurately measure the distance between meaning representations as a whole. And a ranked contrastive loss is proposed to pull the representations of the semantic-identical instances together and push negative instances away. Experiments on two standard datasets show that our approach achieves significant improvements over MLE baselines and gets state-of-the-art performances by simply applying semantic-aware contrastive learning on a vanilla Seq2Seq model.", "track": "Semantics: Lexical, Sentence level, Textual Inference and Other areas", "label": 8, "url": ""}, {"loc": [3.551393747329712, 9.897439956665039], "id": 785, "title": "Scientific Paper Extractive Summarization Enhanced by Citation Graphs", "authors": "Xiuying Chen, Mingzhe Li, Shen Gao, Rui Yan, Xin Gao and Xiangliang Zhang", "abstract": "In a citation graph, adjacent paper nodes share related scientific terms and topics. \nThe graph thus conveys unique structure information of document-level relatedness that can be utilized in the paper summarization task, for exploring beyond the intra-document information.\nIn this work, we focus on leveraging citation graphs to improve scientific paper extractive summarization under different settings.\nWe first propose a Multi-granularity Unsupervised Summarization model (MUS) as a simple and low-cost solution to the task.\nMUS finetunes a pre-trained encoder model on the citation graph by link prediction tasks.\nThen, the abstract sentences are extracted from the corresponding paper considering multi-granularity information.\nPreliminary results demonstrate that citation graph is helpful even in a simple unsupervised framework.\nMotivated by this, we next propose a Graph-based Supervised Summarizationmodel (GSS) to achieve more accurate results on the task when large-scale labeled data are available.\nApart from employing the link prediction as an auxiliary task, GSS introduces a gated sentence encoder and a graph information fusion module to take advantage of the graph information to polish the sentence representation.\nExperiments on a public benchmark dataset show that MUS and GSS bring substantial improvements over the prior state-of-the-art model.", "track": "Summarization", "label": 14, "url": ""}, {"loc": [2.3120298385620117, 8.654574394226074], "id": 802, "title": "Hardness-guided domain adaptation to recognise biomedical named entities under low-resource scenarios", "authors": "Ngoc Dang Nguyen, Lan Du, Wray Buntine, Changyou Chen and Richard Beare", "abstract": "Domain adaptation is an effective solution to data scarcity in low-resource scenarios. However, when applied to token-level tasks such as bioNER, domain adaptation methods often suffer from the challenging linguistic characteristics that clinical narratives possess, which leads to unsatsifactory performance. In this paper, we present a simple yet effective hardness-guided domain adaptation framework for bioNER tasks that can effectively leverage the domain hardness information to improve the adaptability of the learnt model in the low-resource scenarios. Experimental results on biomedical datasets show that our model can achieve significant performance improvement over the recently published state-of-the-art (SOTA) MetaNER model.", "track": "Efficient Methods for NLP", "label": 12, "url": "https://www.semanticscholar.org/reader/d7837d577fc6821d095dffb559cfdc0e3574166f?experiments=&features=reader_skimming%3Atrue"}, {"loc": [0.963117778301239, 7.885301113128662], "id": 805, "title": "Syntactic Multi-view Learning for Open Information Extraction", "authors": "Kuicai Dong, Aixin Sun, Jung-Jae Kim and Xiaoli Li", "abstract": "Open Information Extraction (OpenIE) aims to extract relational tuples from open-domain sentences. \nTraditional rule-based or statistical models were developed based on syntactic structure of sentence, identified by syntactic parsers. However, previous neural OpenIE models under-explored the useful syntactic information. In this paper, we model both constituency and dependency trees into word-level graphs, and enable neural OpenIE to learn from the syntactic structures. To better fuse heterogeneous information from the two graphs, we adopt multi-view learning to capture multiple relationships from them. Finally, the finetuned constituency and dependency representations are aggregated with sentential semantic representations for tuple generation. Experiments show that both constituency and dependency information, and the multi-view learning are effective.", "track": "Information Extraction", "label": 5, "url": ""}, {"loc": [5.617773532867432, 11.984402656555176], "id": 817, "title": "TRIPS: Efficient Vision-and-Language Pre-training with Text-Relevant Image Patch Selection", "authors": "Chaoya Jiang, Haiyang Xu, Chenliang Li, Ming Yan, Wei Ye, Shikun Zhang, Bin Bi and Songfang Huang", "abstract": "Vision Transformers (ViTs) have been widely used in large-scale Vision and Language Pre-training (VLP) models. Though previous VLP works have proved the effectiveness of ViTs, they still suffer from computational efficiency brought by the long visual sequence. To tackle this problem, in this paper, we propose an efficient vision-and-language pre-training model with Text-Relevant Image Patch Selection, namely TRIPS, which reduces the visual sequence progressively with a text-guided patch-selection layer in the visual backbone for efficient training and inference. The patch-selection layer can dynamically compute text-dependent visual attention to identify the attentive image tokens with text guidance and fuse inattentive ones in an end-to-end manner. Meanwhile, TRIPS does not introduce extra parameters to ViTs. Experimental results on a variety of popular benchmark datasets demonstrate that TRIPS gain a speedup of 40% over previous similar VLP models, yet with competitive or better downstream task performance.", "track": "Speech, Vision, Robotics, Multimodal Grounding", "label": 7, "url": ""}, {"loc": [4.411097526550293, 7.556691646575928], "id": 821, "title": "CGoDial: A Large-Scale Benchmark for Chinese Goal-oriented Dialog Evaluation", "authors": "Yinpei Dai, Wanwei He, Bowen Li, Yuchuan Wu, Zheng Cao, Zhongqi An, Jian Sun and Yongbin Li", "abstract": "Practical dialog systems need to deal with various knowledge sources, noisy user expressions, and the shortage of annotated data. To better solve the above problems, we propose CGoDial, a new challenging and comprehensive Chinese benchmark for multi-domain Goal-oriented Dialog evaluation. It contains 96,763 dialog sessions, and 574,949 dialog turns totally, covering three datasets with different knowledge sources: 1) a slot-based dialog (SBD) dataset with table-formed knowledge, 2) a flow-based dialog (FBD) dataset with tree-formed knowledge, and a retrieval-based dialog (RBD) dataset with candidate-formed knowledge. To bridge the gap between academic benchmarks and spoken dialog scenarios, we either collect data from real conversations or add spoken features to existing datasets via crowd-sourcing. The proposed experimental settings include the combinations of training with either the entire training set or a few-shot training set, and testing with either the standard test set or a hard test subset, which can assess model capabilities in terms of general prediction, fast adaptability and reliable robustness.", "track": "Dialogue and Interactive Systems", "label": 4, "url": ""}, {"loc": [6.27471923828125, 5.334392547607422], "id": 836, "title": "Kernel-Whitening: Overcome Dataset Bias with Isotropic Sentence Embedding", "authors": "SongYang Gao, Shihan Dou, Qi Zhang and Xuanjing Huang", "abstract": "Dataset bias has attracted increasing attention recently for its detrimental effect on the generalization ability of fine-tuned models. The current mainstream solution is designing an additional shallow model to pre-identify biased instances. However, such two-stage methods scale up the computational complexity of training process and obstruct valid feature information while mitigating bias.\nTo address this issue, we utilize the representation normalization method which aims at disentangling the correlations between features of encoded sentences. We find it also promising in eliminating the bias problem by providing isotropic data distribution. We further propose Kernel-Whitening, a Nystrom kernel approximation method to achieve more thorough debiasing on nonlinear spurious correlations. Our framework is end-to-end with similar time consumption to fine-tuning. Experiments show that Kernel-Whitening significantly improves the performance of BERT on out-of-distribution datasets while maintaining in-distribution accuracy.", "track": "Semantics: Lexical, Sentence level, Textual Inference and Other areas", "label": 8, "url": "https://www.semanticscholar.org/reader/f89d4d429f3689540be6ee277bc269b3b68f4938?experiments=&features=reader_skimming%3Atrue"}, {"loc": [0.7796629667282104, 8.079690933227539], "id": 839, "title": "A Unified Positive-Unlabeled Learning Framework for Document-Level Relation Extraction with Different Levels of Labeling", "authors": "Ye Wang, Xinxin Liu, Wenxin Hu and Tao Zhang", "abstract": "Document-level relation extraction (RE) aims to identify relations between entities across multiple sentences. Most previous methods focused on document-level RE under full supervision. However, in real-world scenario, it is expensive and difficult to completely label all relations in a document because the number of entity pairs in document-level RE grows quadratically with the number of entities.  To solve the common incomplete labeling problem, we propose a unified positive-unlabeled learning framework - shift and squared ranking loss positive-unlabeled (SSR-PU) learning. We use positive-unlabeled (PU) learning on document-level RE for the first time. Considering that labeled data of a dataset may lead to prior shift of unlabeled data, we introduce a PU learning under prior shift of training data. Also, using none-class score as an adaptive threshold, we propose squared ranking loss and prove its Bayesian consistency with multi-label ranking metrics.  Extensive experiments demonstrate that our method achieves an improvement of about 14 F1 points relative to the previous baseline with incomplete labeling. In addition, it outperforms previous state-of-the-art results under both fully supervised and extremely unlabeled settings as well.", "track": "Information Extraction", "label": 5, "url": "https://www.semanticscholar.org/reader/b9fc9860931eb28433d128b7b9c5f4fcd76b595f?experiments=&features=reader_skimming%3Atrue"}, {"loc": [3.5793776512145996, 4.462541103363037], "id": 866, "title": "Automatic Generation of Socratic Subquestions for Teaching Math Word Problems", "authors": "Kumar Shridhar, Jakub Macina, Mennatallah El-Assady, Tanmay Sinha, Manu Kapur and Mrinmaya Sachan", "abstract": "Socratic questioning is an educational method that allows students to discover answers to complex problems by asking them a series of thoughtful questions. \nGeneration of didactically sound questions is challenging, requiring understanding of the reasoning process involved in the problem. We hypothesize that such questioning strategy can not only enhance the human performance, but also assist the math word problem (MWP) solvers.\nIn this work, we explore the ability of large language models (LMs) in generating sequential questions for guiding math word problem-solving. We propose various guided question generation schemes based on input conditioning and reinforcement learning.\nOn both automatic and human quality evaluations, we find that LMs constrained with desirable question properties generate superior questions and improve the overall performance of a math word problem solver. We conduct a preliminary user study to examine the potential value of such question generation models in the education domain. Results suggest that the difficulty level of problems plays an important role in determining whether questioning improves or hinders human performance. \nWe discuss the future of using such questioning strategies in education.", "track": "NLP Applications", "label": 0, "url": ""}, {"loc": [8.77017593383789, 7.868949890136719], "id": 872, "title": "Mixture of Attention Heads: Selecting Attention Heads Per Token", "authors": "Xiaofeng Zhang, Yikang Shen, Zeyu Huang, Jie Zhou, Wenge Rong and Zhang Xiong", "abstract": "Mixture-of-Experts (MoE) networks have been proposed as an efficient way to scale up model capacity and implement conditional computing. However, the study of MoE components mostly focused on the feedforward layer in Transformer architecture. This paper proposes the Mixture of Attention Heads (MoA), a new architecture that combines multi-head attention with the MoE mechanism. MoA includes a set of attention heads that each has its own set of parameters. Given an input, a router dynamically selects a subset of k attention heads per token. This conditional computation schema allows MoA to achieve stronger performance than the standard multi-head attention layer. Furthermore, the sparsely gated MoA can easily scale up the number of attention heads and the number of parameters while preserving computational efficiency. Despite performance improvements, MoA also automatically differentiates heads' utilities, providing a new perspective to discuss the model's interpretability. We conducted experiments on several important tasks, including Machine Translation and Masked Language Modeling. Experiments have shown promising results on several tasks against strong baselines that involve large and very deep models.", "track": "Machine Learning for NLP", "label": 3, "url": "https://www.semanticscholar.org/reader/3820231d31540ecb05d94c74d959a2f61d3136ea?experiments=&features=reader_skimming%3Atrue"}, {"loc": [8.782752990722656, 8.166292190551758], "id": 875, "title": "The Optimal BERT Surgeon: Scalable and Accurate Second-Order Pruning for Large Language Models", "authors": "Eldar Kurtic, Daniel Campos, Tuan A. Nguyen, Elias Frantar, Mark John Kurtz, Benjamin Fineran, Michael J. Goin and Dan Alistarh", "abstract": "In this paper, we consider the problem of sparsifying BERT models, which are a key building block for natural language processing, in order to reduce their storage and computational cost. We introduce the Optimal BERT Surgeon (oBERT), an efficient and accurate pruning method based on approximate second-order information, which we show to yield state-of-the-art results in both stages of language tasks: pre-training and fine-tuning. Specifically, oBERT extends existing work on second-order pruning by allowing for pruning weight blocks, and is the first such method that is applicable at BERT scale. \nSecond, we investigate compounding compression approaches to obtain highly compressed but accurate models for deployment on edge devices. These models significantly push boundaries of the current state-of-the-art sparse BERT models with respect to all metrics: model size, inference speed and task accuracy. For example, relative to the dense BERT-base, we obtain 10x model size compression with < 1% accuracy drop, 10x CPU-inference speedup with < 2% accuracy drop, and 29x CPU-inference speedup with < 7.5% accuracy drop. Our code, fully integrated with Transformers and SparseML, is available at https://github.com/neuralmagic/sparseml/tree/main/research/optimal_BERT_surgeon_oBERT.", "track": "Efficient Methods for NLP", "label": 12, "url": "https://www.semanticscholar.org/reader/6da9a81b75e7ad02867860753d1aa276673a3a77?experiments=&features=reader_skimming%3Atrue"}, {"loc": [5.262276649475098, 11.673805236816406], "id": 876, "title": "Information-Theoretic Text Hallucination Reduction for Video-grounded Dialogue", "authors": "Sunjae Yoon, Eunseop Yoon, Hee Suk Yoon, Junyeong Kim and Chang Yoo", "abstract": "Video-grounded Dialogue (VGD) aims to decode an answer sentence to a question regarding a given video and dialogue context. Despite the recent success of multi-modal reasoning to generate answer sentences, existing dialogue systems still suffer from a text hallucination problem, which denotes indiscriminate text-copying from input texts without an understanding of the question. This is due to learning spurious correlations from the fact that answer sentences in the dataset usually include the words of input texts, thus the VGD system excessively relies on copying words from input texts by hoping those words to overlap with ground-truth texts. Hence, we design Text Hallucination Mitigating (THAM) framework, which incorporates Text Hallucination Regularization (THR) loss derived from the proposed information-theoretic text hallucination measurement approach. Applying THAM with current dialogue systems validates the effectiveness on VGD benchmarks (i.e., AVSD@DSTC7 and AVSD@DSTC8) and shows enhanced interpretability.", "track": "Dialogue and Interactive Systems", "label": 4, "url": ""}, {"loc": [1.7259498834609985, 5.424082279205322], "id": 887, "title": "DSM: Question Generation over Knowledge Base via Modeling Diverse Subgraphs with Meta-learner", "authors": "Shasha Guo, Jing Zhang, Yanling Wang, Qianyi Zhang, Cuiping Li and Hong Chen", "abstract": "Existing methods on knowledge base question generation (KBQG) learn a one-size-fits-all model by training together all subgraphs without distinguishing the diverse semantics of subgraphs. In this work, we show that making use of the past experience on semantically similar subgraphs can reduce the learning difficulty and promote the performance of KBQG models. To achieve this, we propose a novel approach to model diverse subgraphs with meta-learner (DSM). Specifically, we devise a graph contrastive learning-based retriever to identify semantically similar subgraphs, so that we can construct the semantics-aware learning tasks for the meta-learner to learn semantics-specific and semantics-agnostic knowledge on and across these tasks. Extensive experiments on two widely-adopted benchmarks for KBQG show that DSM derives new state-of-the-art performance and benefits the question answering tasks as a means of data augmentation.", "track": "Natural Language Generation", "label": 6, "url": ""}, {"loc": [0.5868709683418274, 7.674073696136475], "id": 894, "title": "RelU-Net: Syntax-aware Graph U-Net for Relational Triple Extraction", "authors": "Yunqi Zhang, Yubo Chen and Yongfeng Huang", "abstract": "Relational triple extraction is a critical task for natural language processing. Existing methods mainly focused on capturing semantic information, but suffered from ignoring the syntactic structure of the sentence, which is proved in the relation classification task to contain rich relational information. This is due to the absence of entity locations, which is the prerequisite for pruning noisy edges from the dependency tree, when extracting relational triples. In this paper, we propose a unified framework to tackle this challenge and incorporate syntactic information for relational triple extraction. First, we propose to automatically contract the dependency tree into a core relational topology and eliminate redundant information with graph pooling operations. Then, we propose a symmetrical expanding path with graph unpooling operations to fuse the contracted core syntactic interactions with the original sentence context. We also propose a bipartite graph matching objective function to capture the reflections between the core topology and golden relational facts. Since our model shares similar contracting and expanding paths with encoder-decoder models like U-Net, we name our model as Relation U-Net (RelU-Net). We conduct experiments on several datasets and the results prove the effectiveness of our method.", "track": "Information Extraction", "label": 5, "url": ""}, {"loc": [6.58177375793457, 8.390844345092773], "id": 895, "title": "Evidence > Intuition: Transferability Estimation for Encoder Selection", "authors": "Elisa Bassignana, Max M\u00fcller-Eberstein, Mike Zhang and Barbara Plank", "abstract": "With the increase in availability of large pre-trained language models (LMs) in Natural Language Processing (NLP), it becomes critical to assess their fit for a specific target task a priori\u2014as fine-tuning the entire space of available LMs is computationally prohibitive and unsustainable. However, encoder transferability estimation has received little to no attention in NLP. In this paper, we propose to generate quantitative evidence to predict which LM, out of a pool of models, will perform best on a target task without having to fine-tune all candidates. We provide a comprehensive study on LM ranking for 10 NLP tasks spanning the two fundamental problem types of classification and structured prediction. We adopt the state-of-the-art Logarithm of Maximum Evidence (LogME) measure from Computer Vision (CV) and find that \nit positively correlates with final LM performance in 94% of the setups.\nIn the first study of its kind, we further compare transferability measures with the de facto standard of human practitioner ranking, finding that evidence from quantitative metrics is more robust than pure intuition and can help identify unexpected LM candidates.", "track": "Language Modeling and Analysis of Language Models", "label": 2, "url": "https://www.semanticscholar.org/reader/504d1d9b6ecdeaadb79ad8ba80fa64ac34fca18e?experiments=&features=reader_skimming%3Atrue"}, {"loc": [10.416794776916504, 7.138895034790039], "id": 898, "title": "Chunk-based Nearest Neighbor Machine Translation", "authors": "Pedro Henrique Martins, Zita Marinho and Andr\u00e9 F. T. Martins", "abstract": "Semi-parametric models, which augment generation with retrieval, have led to impressive results in language modeling and machine translation, due to their ability to retrieve fine-grained information from a datastore of examples. One of the most prominent approaches, kNN-MT, exhibits strong domain adaptation capabilities by retrieving tokens from domain-specific datastores (Khandelwal et al., 2021). However, kNN-MT requires an expensive retrieval operation for every single generated token, leading to a very low decoding speed (around 8 times slower than a parametric model). In this paper, we introduce a chunk-based kNN-MT model which retrieves chunks of tokens from the datastore, instead of a single token. We propose several strategies for incorporating the retrieved chunks into the generation process, and for selecting the steps at which the model needs to search for neighbors in the datastore. Experiments on machine translation in two settings, static and \"on-the-fly\u201d domain adaptation, show that the chunk-based kNN-MT model leads to significant speed-ups (up to 4 times) with only a small drop in translation quality.", "track": "Machine Translation", "label": 10, "url": "https://www.semanticscholar.org/reader/1c811f618f40349e6e7130083ddbacaf78858737?experiments=&features=reader_skimming%3Atrue"}, {"loc": [2.850724458694458, 4.680685997009277], "id": 913, "title": "FiE: Building a Global Probability Space by Leveraging Early Fusion in Encoder for Open-Domain Question Answering", "authors": "Akhil Kedia, Mohd Abbas Zaidi and Haejun Lee", "abstract": "Generative models have recently started to outperform extractive models in Open Domain Question Answering, largely by leveraging their decoder to attend over multiple encoded passages and combining their information. However, generative models tend to be larger than extractive models due to the need for a decoder, run slower during inference due to auto-regressive decoder beam search, and their generated output often suffers from hallucinations. We propose to extend transformer encoders with the ability to fuse information from multiple passages, using global representation to provide cross-sample attention over all tokens across samples. Furthermore, we propose an alternative answer span probability calculation to better aggregate answer scores in the global space of all samples. Using our proposed method, we outperform the current state-of-the-art method by 2.5 Exact Match score on the Natural Question dataset while using only 25% of parameters and 35% of the latency during inference, and 4.4 Exact Match on WebQuestions dataset. When coupled with synthetic data augmentation, we outperform larger models on the TriviaQA dataset as well. The latency and parameter savings of our method make it particularly attractive for open-domain question answering, as these models are often compute-intensive.", "track": "Question Answering", "label": 11, "url": ""}, {"loc": [0.63530033826828, 7.650243759155273], "id": 916, "title": "Inductive Relation Prediction with Logical Reasoning Using Contrastive Representations", "authors": "Yudai Pan, Jun Liu, Lingling Zhang, Tianzhe Zhao, Qika Lin, Xin Hu and Qianying Wang", "abstract": "Relation prediction in knowledge graphs (KGs) aims at predicting missing relations in incomplete triples, whereas the dominant embedding paradigm has a restriction on handling unseen entities during testing. In the real-world scenario, the inductive setting is more common because entities in the training process are finite. Previous methods capture an inductive ability by implicit logic in KGs. However, it would be challenging to preciously acquire entity-independent relational semantics of compositional logic rules and to deal with the deficient supervision of logic caused by the scarcity of relational semantics. To this end, we propose a novel graph convolutional network (GCN)-based model LogCo with logical reasoning by contrastive representations. LogCo firstly extracts enclosing subgraphs and relational paths between two entities to supply the entity-independence. Then a contrastive strategy for relational path instances and the subgraph is proposed for the issue of deficient supervision. The contrastive representations are learned for a joint training regime. Finally, prediction results and logic rules for reasoning are attained. Comprehensive experiments on twelve inductive datasets show that LogCo achieves outstanding performance comparing with state-of-the-art inductive relation prediction baselines.", "track": "Semantics: Lexical, Sentence level, Textual Inference and Other areas", "label": 8, "url": ""}, {"loc": [10.830070495605469, 9.347640991210938], "id": 920, "title": "Improving Chinese Spelling Check by Character Pronunciation Prediction: The Effects of Adaptivity and Granularity", "authors": "Jiahao Li, Quan Wang, Zhendong Mao, Junbo Guo, Yanyan Yang and Yongdong Zhang", "abstract": "Chinese spelling check (CSC) is a fundamental NLP task that detects and corrects spelling errors in Chinese texts. As most of these spelling errors are caused by phonetic similarity, effectively modeling the pronunciation of Chinese characters is a key factor for CSC. In this paper, we consider introducing an auxiliary task of Chinese pronunciation prediction (CPP) to improve CSC, and, for the first time, systematically discuss the adaptivity and granularity of this auxiliary task. We propose SCOPE which builds upon a shared encoder two parallel decoders, one for the primary CSC task and the other for a fine-grained auxiliary CPP task, with a novel adaptive weighting scheme to balance the two tasks. In addition, we design a delicate iterative correction strategy for further improvements during inference. Empirical evaluation shows that SCOPE achieves new state-of-the-art on three CSC benchmarks, demonstrating the effectiveness and superiority of the auxiliary CPP task. Comprehensive ablation studies further verify the positive effects of adaptivity and granularity of the task.", "track": "NLP Applications", "label": 0, "url": "https://www.semanticscholar.org/reader/5699d5050cc5495ad3bf4d299c0285f8239224f1?experiments=&features=reader_skimming%3Atrue"}, {"loc": [10.91057014465332, 6.819715976715088], "id": 932, "title": "MT-GenEval: A Counterfactual and Contextual Dataset for Evaluating Gender Accuracy in Machine Translation", "authors": "Anna Currey, Maria Nadejde, Raghavendra Reddy Pappagari, Mia Mayer, Stanislas Lauly, Xing Niu, Benjamin Hsu and Georgiana Dinu", "abstract": "As generic machine translation (MT) quality has improved, the need for targeted benchmarks that explore fine-grained aspects of quality has increased. In particular, gender accuracy in translation can have implications in terms of output fluency, translation accuracy, and ethics. In this paper, we introduce MT-GenEval, a benchmark for evaluating gender accuracy in translation from English into eight widely-spoken languages. MT-GenEval complements existing benchmarks by providing realistic, gender-balanced, counterfactual data in eight language pairs where the gender of individuals is unambiguous in the input segment, including multi-sentence segments requiring inter-sentential gender agreement. Our data and code is publicly available under a CC BY SA 3.0 license.", "track": "Machine Translation", "label": 10, "url": "https://www.semanticscholar.org/reader/5cc12716958e39d8e432e6bcb1c434f8c2d8f51b?experiments=&features=reader_skimming%3Atrue"}, {"loc": [1.010554552078247, 10.48963451385498], "id": 933, "title": "A Span-level Bidirectional Network for Aspect Sentiment Triplet Extraction", "authors": "Yuqi Chen, Chen Keming, Xian Sun and Zequn Zhang", "abstract": "Aspect Sentiment Triplet Extraction (ASTE) is a new fine-grained sentiment analysis task that aims to extract triplets of aspect terms, sentiments, and opinion terms from review sentences. Recently, span-level models achieve gratifying results on ASTE task by taking advantage of the predictions of all possible spans.  Since all possible spans significantly increases the number of potential aspect and opinion candidates, it is crucial and challenging to efficiently extract  the triplet elements among them. In this paper, we present a span-level bidirectional network which utilizes all possible spans as input and extracts triplets from spans bidirectionally. Specifically, we devise both the aspect decoder and opinion decoder to decode the span representations and extract triples from aspect-to-opinion and opinion-to-aspect directions. With these two decoders complementing with each other, the whole network can extract triplets from spans more comprehensively. Moreover, considering that mutual exclusion cannot be guaranteed between the spans, we design a similar span separation loss to facilitate the downstream task of distinguishing the correct span by expanding the KL divergence of similar spans during the training process; in the inference process, we adopt an inference strategy to remove conflicting triplets from the results base on their confidence scores. Experimental results show that our framework not only significantly outperforms state-of-the-art methods, but achieves better performance in predicting triplets with multi-token entities and extracting triplets in sentences contain multi-triplets.", "track": "Sentiment Analysis, Stylistic Analysis, and Argument Mining", "label": 16, "url": "https://www.semanticscholar.org/reader/787526e6a7990eccc34653ae182279472e727835?experiments=&features=reader_skimming%3Atrue"}, {"loc": [9.195700645446777, 6.701645851135254], "id": 937, "title": "On the Calibration of Massively Multilingual Language Models", "authors": "Kabir Ahuja, Sunayana Sitaram, Sandipan Dandapat and Monojit Choudhury", "abstract": "Massively Multilingual Language Models (MMLMs) have recently gained popularity due to their surprising effectiveness in cross-lingual transfer. While there has been much work in evaluating these models for their performance on a variety of tasks and languages, little attention has been paid on how well calibrated these models are with respect to the confidence in their predictions. We first investigate the calibration of MMLMs in the zero-shot setting and observe a clear case of miscalibration in low-resource languages or those which are typologically diverse from English. Next, we empirically show that calibration methods like temperature scaling and label smoothing do reasonably well in improving calibration in the zero-shot scenario. We also find that few-shot examples in the language can further help reduce calibration errors, often substantially. Overall, our work contributes towards building more reliable multilingual models by highlighting the issue of their miscalibration, understanding what language and model-specific factors influence it, and pointing out the strategies to improve the same.", "track": "Multilinguality", "label": 13, "url": "https://www.semanticscholar.org/reader/a2b89d2196b4cc88797d4907ce7458bb7584f6b6?experiments=&features=reader_skimming%3Atrue"}, {"loc": [2.83474063873291, 4.647697448730469], "id": 938, "title": "Momentum Contrastive Pre-training for Question Answering", "authors": "Minda Hu, Muzhi Li, Yasheng Wang and Irwin King", "abstract": "Existing pre-training methods for extractive Question Answering (QA) generate cloze-like queries different from natural questions in syntax structure, which could overfit pre-trained models to simple keyword matching. In order to address this problem, we propose a novel Momentum Contrastive pRe-training fOr queStion anSwering (MCROSS) method for extractive QA. Specifically, MCROSS introduces a momentum contrastive learning framework to align the answer probability between cloze-like and natural query-passage sample pairs. Hence, the pre-trained models can better transfer the knowledge learned in cloze-like samples to answering natural questions. Experimental results on three benchmarking QA datasets show that our method achieves noticeable improvement compared with all baselines in both supervised and zero-shot scenarios.", "track": "Question Answering", "label": 11, "url": ""}, {"loc": [8.381734848022461, 6.529812335968018], "id": 946, "title": "A Second Wave of UD Hebrew Treebanking and Cross-Domain Parsing", "authors": "Amir Zeldes, Nick Howell, Noam Ordan and Yifat Ben Moshe", "abstract": "Foundational Hebrew NLP tasks such as segmentation, tagging and parsing, have relied to date on various versions of the Hebrew Treebank (HTB, Sima'an et al. 2001). However, the data in HTB, a single-source newswire corpus, is now over 30 years old, and does not cover many aspects of contemporary Hebrew on the web. This paper presents a new, freely available UD treebank of Hebrew stratified from a range of topics selected from Hebrew Wikipedia. In addition to introducing the corpus and evaluating the quality of its annotations, we deploy automatic validation tools based on grew (Guillaume, 2021), and conduct the first cross domain parsing experiments in Hebrew. We obtain new state-of-the-art (SOTA) results on UD NLP tasks, using a combination of the latest language modelling and some incremental improvements to existing transformer based approaches. We also release a new version of the UD HTB matching annotation scheme updates from our new corpus.", "track": "Resources and Evaluation", "label": 1, "url": ""}, {"loc": [5.812136173248291, 5.32790994644165], "id": 960, "title": "Finding Dataset Shortcuts with Grammar Induction", "authors": "Dan Friedman, Alexander Wettig and Danqi Chen", "abstract": "Many NLP datasets have been found to contain shortcuts: simple decision rules that achieve surprisingly high accuracy. However, it is difficult to discover shortcuts automatically. Prior work on automatic shortcut detection has focused on enumerating features like unigrams or bigrams, which can find only low-level shortcuts, or relied on post-hoc model interpretability methods like saliency maps, which reveal qualitative patterns without a clear statistical interpretation. In this work, we propose to use probabilistic grammars to characterize and discover shortcuts in NLP datasets. Specifically, we use a context-free grammar to model patterns in sentence classification datasets and use a synchronous context-free grammar to model datasets involving sentence pairs. The resulting grammars reveal interesting shortcut features in a number of datasets, including both simple and high-level features, and automatically identify groups of test examples on which conventional classifiers fail. Finally, we show that the features we discover can be used to generate diagnostic contrast examples and incorporated into standard robust optimization methods to improve worst-group accuracy.", "track": "Interpretability, Interactivity and Analysis of Models for NLP", "label": 9, "url": "https://www.semanticscholar.org/reader/7068acb5acca7b5915de5ee85a39586ab3f27198?experiments=&features=reader_skimming%3Atrue"}, {"loc": [4.809964656829834, 3.2975311279296875], "id": 970, "title": "Retrieval Augmentation for Commonsense Reasoning: A Unified Approach", "authors": "Wenhao Yu, Chenguang Zhu, Zhihan Zhang, Shuohang Wang, Zhuosheng Zhang, Yuwei Fang and Meng Jiang", "abstract": "A common thread of retrieval-augmented methods in the existing literature focuses on retrieving encyclopedic knowledge, such as Wikipedia, which facilitates well-defined entity and relation spaces that can be modeled. However, applying such methods to commonsense reasoning tasks faces two unique challenges, i.e., the lack of a general large-scale corpus for retrieval and a corresponding effective commonsense retriever. In this paper, we systematically investigate how to leverage commonsense knowledge retrieval to improve commonsense reasoning tasks. We proposed a unified framework of retrieval-augmented commonsense reasoning (called RACo), including a newly constructed commonsense corpus with over 20 million documents and novel strategies for training a commonsense retriever. We conducted experiments on four different commonsense reasoning tasks. Extensive evaluation results showed that our proposed RACo can significantly outperform other knowledge-enhanced method counterparts, achieving new SoTA performance on the CommonGen and CREAK leaderboards.", "track": "Commonsense Reasoning", "label": 19, "url": "https://www.semanticscholar.org/reader/d4f77cdb04d7ae02860415877cc4c463e93595a1?experiments=&features=reader_skimming%3Atrue"}, {"loc": [1.473496913909912, 7.988746643066406], "id": 979, "title": "Open World Classification with Adaptive Negative Samples", "authors": "Ke Bai, Guoyin Wang, Jiwei Li, Sunghyun Park, Sungjin Lee, Puyang Xu, Ricardo Henao and Lawrence Carin", "abstract": "Open world classification is a task in natural language processing with key practical relevance and impact.\nSince the open or unknown category data only manifests in the inference phase, finding a model with a suitable decision boundary accommodating for the identification of known classes and discrimination of the open category is challenging.\nThe performance of existing models is limited by the lack of effective open category data during the training stage or the lack of a good mechanism to learn appropriate decision boundaries.\nWe propose an approach based on Adaptive Negative Samples (ANS) designed to generate effective synthetic open category samples in the training stage and without requiring any prior knowledge or external datasets.\nEmpirically, we find a significant advantage in using auxiliary one-versus-rest binary classifiers, which \neffectively utilize the generated negative samples and avoid the complex threshold-seeking stage in previous works.\nExtensive experiments on three benchmark datasets show that ANS achieves significant improvements over state-of-the-art methods.", "track": "Semantics: Lexical, Sentence level, Textual Inference and Other areas", "label": 8, "url": ""}, {"loc": [4.61194372177124, 9.15684700012207], "id": 986, "title": "Re3: Generating Longer Stories With Recursive Reprompting and Revision", "authors": "Kevin Yang, Yuandong Tian, Nanyun Peng and Dan Klein", "abstract": "We consider the problem of automatically generating longer stories of over two thousand words. Compared to prior work on shorter stories, long-range plot coherence and relevance are more central challenges here. We propose the Recursive Reprompting and Revision framework (Re3) to address these challenges by (a) prompting a general-purpose language model to construct a structured overarching plan, and (b) generating story passages by repeatedly injecting contextual information from both the plan and current story state into a language model prompt. We then revise by (c) reranking different continuations for plot coherence and premise relevance, and finally (d) editing the best continuation for factual consistency. Compared to similar-length stories generated directly from the same base model, human evaluators judged substantially more of Re3's stories as having a coherent overarching plot (by 14% absolute increase), and relevant to the given initial premise (by 20%).", "track": "Natural Language Generation", "label": 6, "url": ""}, {"loc": [10.236653327941895, 7.6986165046691895], "id": 993, "title": "Does Joint Training Really Help Cascaded Speech Translation?", "authors": "Viet Anh Khoa Tran, David Thulke, Yingbo Gao, Christian Herold and Hermann Ney", "abstract": "Currently, in speech translation, the straightforward approach - cascading a recognition system with a translation system - delivers state-of-the-art results.\nHowever, fundamental challenges such as error propagation from the automatic speech recognition system still remain.\nTo mitigate these problems, recently, people turn their attention to direct data and propose various joint training methods.\nIn this work, we seek to answer the question of whether joint training really helps cascaded speech translation.\nWe review recent papers on the topic and also investigate a joint training criterion by marginalizing the transcription posterior probabilities.\nOur findings show that a strong cascaded baseline can diminish any improvements obtained using joint training, and we suggest alternatives to joint training.\nWe hope this work can serve as a refresher of the current speech translation landscape, and motivate research in finding more efficient and creative ways to utilize the direct data for speech translation.", "track": "Multilinguality", "label": 13, "url": ""}, {"loc": [1.7381771802902222, 9.103643417358398], "id": 999, "title": "MasakhaNER 2.0: Africa-centric Transfer Learning for Named Entity Recognition", "authors": "David Ifeoluwa Adelani, Graham Neubig, Sebastian Ruder, Shruti Rijhwani, Michael Coenraad Beukman, Chester Palen-Michel, Constantine Lignos, Jesujoba Alabi, Shamsuddeen Hassan Muhammad, Peter Nabende, Cheikh M. Bamba Dione, Andiswa Bukula, Rooweither Mabuya, Bonaventure F. P. Dossou, Blessing Sibanda, Happy Buzaaba, Jonathan Mukiibi, Godson K. KALIPE, Derguene Mbaye, Amelia Taylor, Fatoumata Ouoba Kabore, Chris Chinenye Emezue, Anuoluwapo Aremu, Perez Ogayo, Catherine Gitau, Edwin Munkoh-Buabeng, victoire Memdjokam Koagne, Allahsera Auguste Tapo, Tebogo Macucwa, Vukosi Marivate, MBONING TCHIAZE Elvis, Tajuddeen Gwadabe, Tosin Adewumi, Orevaoghene Ahia, Joyce Nakatumba-Nabende, Neo Lerato Mokono, Ignatius Ezeani, Chiamaka Chukwuneke, Mofetoluwa Oluwaseun Adeyemi, Gilles Quentin HACHEME, Idris Abdulmumin, Odunayo Ogundepo, Oreen Yousuf, Tatiana Moteu and Dietrich Klakow", "abstract": "African languages are spoken by over a billion people, but they are under-represented in NLP research and development. Multiple challenges exist, including the limited availability of annotated training and evaluation datasets as well as the lack of understanding of which settings, languages, and recently proposed methods like cross-lingual transfer will be effective. In this paper, we aim to move towards solutions for these challenges, focusing on the task of named entity recognition (NER). We present the creation of the largest to-date human-annotated NER dataset for 20 African languages. We study the behaviour of state-of-the-art cross-lingual transfer methods in an Africa-centric setting, empirically demonstrating that the choice of source transfer language significantly affects performance. While much previous work defaults to using English as the source language, our results show that choosing the best transfer language improves zero-shot F1 scores by an average of 14\\% over 20 languages as compared to using English.", "track": "Resources and Evaluation", "label": 1, "url": "https://www.semanticscholar.org/reader/7259ca612de44763678a30114b02d37c00280c86?experiments=&features=reader_skimming%3Atrue"}, {"loc": [7.9321393966674805, 6.760947227478027], "id": 1009, "title": "Ethics consideration sections in natural language processing papers", "authors": "Luciana Benotti and Patrick Blackburn", "abstract": "In this paper, we present the results of a manual classification of all ethical consideration sections for ACL 2021. We also compare how many papers had an ethics consideration section per track and per world region in ACL 2021. We classified papers according to the ethical issues covered (research benefits, potential harms, and vulnerable groups affected) and whether the paper was marked as requiring ethics review by at least one reviewer. Moreover, we discuss recurring obstacles we have observed (highlighting some interesting texts we found along the way) and conclude with three suggestions. We think that this paper may be useful for anyone who needs to write --- or review --- an ethics section and would like to get an overview of what others have done.", "track": "Ethics", "label": 21, "url": ""}, {"loc": [7.981054782867432, 9.063968658447266], "id": 1013, "title": "Continued Pretraining for Better Zero- and Few-Shot Promptability", "authors": "Zhaofeng Wu, Robert L Logan IV, Pete Walsh, Akshita Bhagia, Dirk Groeneveld, Sameer Singh and Iz Beltagy", "abstract": "Recently introduced language model prompting methods can achieve high accuracy in zero- and few-shot settings while requiring few to no learned task-specific parameters. Nevertheless, these methods still often trail behind full model finetuning. In this work, we investigate if a dedicated continued pretraining stage could improve \"promptability\", i.e., zero-shot performance with natural language prompts or few-shot performance with prompt tuning. We reveal settings where existing continued pretraining methods lack promptability. We also identify current methodological gaps, which we fill with thorough large-scale experiments. We demonstrate that a simple recipe, continued pretraining that incorporates a trainable prompt during multi-task learning, leads to improved promptability in both zero- and few-shot settings compared to existing methods, up to 31% relative. On the other hand, we find that continued pretraining using MAML-style meta-learning, a method that directly optimizes few-shot promptability, yields subpar performance. We validate our findings with two prompt tuning methods, and, based on our results, we provide concrete recommendations to optimize promptability for different use cases.", "track": "Machine Learning for NLP", "label": 3, "url": "https://www.semanticscholar.org/reader/53868a2a4caea7afc487ef08993372b186fb2ddb?experiments=&features=reader_skimming%3Atrue"}, {"loc": [6.456911087036133, 1.9210976362228394], "id": 1021, "title": "Less is More: Summary of Long Instructions is Better for Program Synthesis", "authors": "Kirby Kuznia, Swaroop Mishra, Mihir Parmar and Chitta Baral", "abstract": "Despite the success of large pre-trained language models (LMs) such as Codex, they show below-par performance on the larger and more complicated programming related questions. We show that LMs benefit from the summarized version of complicated questions. Our findings show that superfluous information often present in problem description such as human characters, background stories, and names (which are included to help humans in understanding a task) does not help models in understanding a task. To this extent, we create a meta-dataset from the frequently used APPS dataset and the newly created CodeContests dataset for the program synthesis task. Our meta-dataset consists of human and synthesized summaries of the long and complicated programming questions. Experimental results on Codex show that our proposed approach outperforms baseline by 8.13% on the APPS dataset and 11.88% on the CodeContests dataset on an average in terms of strict accuracy. Our analysis shows that summaries significantly improve performance for introductory (9.86%) and interview (11.48%) related programming questions. However, it shows improvement by a small margin (~ 2%) for competitive programming questions, implying the scope for future research direction.", "track": "Efficient Methods for NLP", "label": 12, "url": "https://www.semanticscholar.org/reader/590f6817b42407f96b079e82c935fae298196359?experiments=&features=reader_skimming%3Atrue"}, {"loc": [3.7891945838928223, 4.558401107788086], "id": 1024, "title": "Is a Question Decomposition Unit All We Need?", "authors": "Pruthvi Jayeshkumar Patel, Swaroop Mishra, Mihir Parmar and Chitta Baral", "abstract": "Large Language Models (LMs) have achieved state-of-the-art performance on many Natural Language Processing (NLP) benchmarks. With the growing number of new benchmarks, we build bigger and more complex LMs. However, building new LMs may not be an ideal option owing to the cost, time and environmental impact associated with it. We explore an alternative route: can we modify data by expressing it in terms of the model's strengths, so that a question becomes easier for models to answer? We investigate if humans can decompose a hard question into a set of simpler questions that are relatively easier for models to solve. We analyze a range of datasets involving various forms of reasoning and find that it is indeed possible to significantly improve model performance (24% for GPT3 and 29% for RoBERTa-SQuAD along with a symbolic calculator) via decomposition. Our approach provides a viable option to involve people in NLP research in a meaningful way. Our findings indicate that Human-in-the-loop Question Decomposition (HQD) can potentially provide an alternate path to building large LMs.", "track": "Efficient Methods for NLP", "label": 12, "url": "https://www.semanticscholar.org/reader/99752e255a866484291866a5ff5cf94e96d6bdc4?experiments=&features=reader_skimming%3Atrue"}, {"loc": [5.245235919952393, 8.955718994140625], "id": 1031, "title": "Discourse-Aware Soft Prompting for Text Generation", "authors": "Marjan Ghazvininejad, Vladimir Karpukhin, Vera Gor and Asli Celikyilmaz", "abstract": "Current efficient fine-tuning methods\n(e.g., adapters, prefix-tuning, etc.) \nhave optimized conditional text generation via training a small set of extra parameters of the neural language model, while freezing the rest for efficiency. While showing strong performance on some generation tasks, they don't generalize across all generation tasks. We show that soft-prompt based conditional text generation can be improved with simple and efficient methods that simulate modeling the discourse structure of human written text.\nWe investigate two design choices: \nFirst, we apply hierarchical blocking on the prefix parameters to simulate a higher-level discourse structure of human written text. Second, we apply attention sparsity on the prefix parameters at different layers of the network and learn sparse transformations on the softmax-function. We show that structured design of prefix parameters yields more coherent, faithful and relevant generations than the baseline prefix-tuning on all generation tasks.", "track": "Natural Language Generation", "label": 6, "url": "https://www.semanticscholar.org/reader/a3c8c57075dfebf7f5a57952afafb7407762cc46?experiments=&features=reader_skimming%3Atrue"}, {"loc": [4.837189674377441, 8.69967269897461], "id": 1040, "title": "ExPUNations: Augmenting Puns with Keywords and Explanations", "authors": "Jiao Sun, Anjali Narayan-Chen, Shereen Oraby, Alessandra Cervone, Tagyoung Chung, Jing Huang, Yang Liu and Nanyun Peng", "abstract": "The tasks of humor understanding and generation are challenging and subjective even for humans, requiring commonsense and real-world knowledge to master. Puns, in particular, add the challenge of fusing that knowledge with the ability to interpret lexical-semantic ambiguity. In this paper, we present the ExPUNations (ExPUN) dataset, in which we augment an existing dataset of puns with detailed crowdsourced annotations of keywords denoting the most distinctive words that make the text funny, pun explanations describing why the text is funny, and fine-grained funniness ratings. This is the first humor dataset with such extensive and fine-grained annotations specifically for puns. Based on these annotations, we propose two tasks: explanation generation to aid with pun classification and keyword-conditioned pun generation, to challenge the current state-of-the-art natural language understanding and generation models' ability to understand and generate humor. We showcase that the annotated keywords we collect are helpful for generating better novel humorous texts in human evaluation, and that our natural language explanations can be leveraged to improve both the accuracy and robustness of humor classifiers.", "track": "Resources and Evaluation", "label": 1, "url": "https://www.semanticscholar.org/reader/e078d5ea102673ba5962821c0109a08c2eddb7cf?experiments=&features=reader_skimming%3Atrue"}, {"loc": [8.813623428344727, 6.447241306304932], "id": 1041, "title": "SLING: Sino Linguistic Evaluation of Large Language Models", "authors": "Yixiao Song, Kalpesh Krishna, Rajesh Bhatt and Mohit Iyyer", "abstract": "To understand what kinds of linguistic knowledge are encoded by pretrained Chinese language models (LMs), we introduce the benchmark of Sino LINGuistics (SLING), which consists of 38K minimal sentence pairs in Mandarin Chinese grouped into 9 high-level linguistic phenomena. Each pair demonstrates the acceptability contrast of a specific syntactic or semantic phenomenon (e.g., The keys are lost vs. The keys is lost), and an LM should assign lower perplexity to the acceptable sentence. In contrast to the CLiMP dataset (Xiang et al., 2021), which also contains Chinese minimal pairs and was created by translating the vocabulary of the English BLiMP dataset, the minimal pairs in SLING are derived primarily by applying syntactic and lexical transformations to naturally-occurring, linguist-annotated sentences from the Chinese Treebank 9.0, thus addressing severe issues in CLiMP's data generation process. We test 18 publicly available pretrained monolingual (e.g., BERT-base-zh, CPM) and multi-lingual (e.g., mT5, XLM) language models on SLING. Our experiments show that the average accuracy for LMs is far below human performance (69.7% vs. 97.1%), while BERT-base-zh achieves the highest accuracy (84.8%) of all tested LMs, even much larger ones. Additionally, we find that most LMs have a strong gender and number (singular/plural) bias, and they perform better on local phenomena than hierarchical ones.", "track": "Interpretability, Interactivity and Analysis of Models for NLP", "label": 9, "url": "https://www.semanticscholar.org/reader/d2b1405ac8d17f8643ed1f8f7d801e9e406d8da6?experiments=&features=reader_skimming%3Atrue"}, {"loc": [5.3472514152526855, 8.667264938354492], "id": 1043, "title": "Context-Situated Pun Generation", "authors": "Jiao Sun, Anjali Narayan-Chen, Shereen Oraby, Shuyang Gao, Tagyoung Chung, Jing Huang, Yang Liu and Nanyun Peng", "abstract": "Previous work on pun generation commonly begins with a given pun word (a pair of homophones for heterographic pun generation and a polyseme for homographic pun generation) and seeks to generate an appropriate pun. While this may enable efficient pun generation, we believe that a pun is most entertaining if it fits appropriately within a given context, e.g., a given situation or dialogue. In this work, we propose a new task, context-situated pun generation, where a specific context represented by a set of keywords is provided, and the task is to first identify suitable pun words that are appropriate for the context, then generate puns based on the context keywords and the identified pun words. \nWe collect a new dataset, CUP (Context-sitUated Pun), containing 4.5k tuples of context words and pun pairs. Based on the new data and setup, we propose a pipeline system for context-situated pun generation, including a pun word retrieval module that identifies suitable pun words for a given context, and a pun generation module that generates puns from context keywords and pun words. \nHuman evaluation shows that 69% of our top retrieved pun words can be used to generate context-situated puns, and our generation module yields successful puns 31% of the time given a plausible tuple of context words and pun pair, almost tripling the yield of a state-of-the-art pun generation model. With an end-to-end evaluation, our pipeline system with the top-1 retrieved pun pair for a given context can generate successful puns 40% of the time, better than all other modeling variations but 32% lower than the human success rate. This highlights the difficulty of the task, and encourages more research in this direction.", "track": "Natural Language Generation", "label": 6, "url": "https://www.semanticscholar.org/reader/74f7519dec7526c104caf4e040bbb124b037243a?experiments=&features=reader_skimming%3Atrue"}, {"loc": [2.616332530975342, 7.13837194442749], "id": 1044, "title": "Retrieval-Augmented Generative Question Answering for Event Argument Extraction", "authors": "Xinya Du and Heng Ji", "abstract": "Event argument extraction has long been studied as a sequential prediction problem with extractive-based methods, tackling each argument in isolation. Although recent work proposes generation-based methods to capture cross-argument dependency, they require generating and post-processing a complicated target sequence (template). Motivated by these observations and recent pretrained language models' capabilities of learning from demonstrations. We propose a retrieval-augmented generative QA model (R-GQA) for event argument extraction. It retrieves the most similar QA pair and augments it as prompt to the current example's context, then decodes the arguments as answers. Our approach outperforms substantially prior methods across various settings (i.e. fully supervised, domain transfer, and fewshot learning). Finally, we propose a clustering-based sampling strategy (JointEnc) and conduct a thorough analysis of how different strategies influence the few-shot learning performances.", "track": "Information Extraction", "label": 5, "url": "https://www.semanticscholar.org/reader/b8a69be1ea8b1e6cad89d939a5234f0f8ce11c61?experiments=&features=reader_skimming%3Atrue"}, {"loc": [5.041406631469727, 12.435675621032715], "id": 1052, "title": "Concadia: Towards Image-Based Text Generation with a Purpose", "authors": "Elisa Kreiss, Fei Fang, Noah Goodman and Christopher Potts", "abstract": "Current deep learning models often achieve excellent results on benchmark image-to-text datasets but fail to generate texts that are useful in practice. We argue that to close this gap, it is vital to distinguish descriptions from captions based on their distinct communicative roles. Descriptions focus on visual features and are meant to replace an image (often to increase accessibility), whereas captions appear alongside an image to supply additional information. To motivate this distinction and help people put it into practice, we introduce the publicly available Wikipedia-based dataset Concadia consisting of 96,918 images with corresponding English-language descriptions, captions, and surrounding context. Using insights from Concadia, models trained on it, and a preregistered human-subjects experiment with human- and model-generated texts, we characterize the commonalities and differences between descriptions and captions. In addition, we show that, for generating both descriptions and captions, it is useful to augment image-to-text models with representations of the textual context in which the image appeared.", "track": "Discourse and Pragmatics", "label": 24, "url": ""}, {"loc": [5.185880184173584, 12.415975570678711], "id": 1055, "title": "Context Matters for Image Descriptions for Accessibility: Challenges for Referenceless Evaluation Metrics", "authors": "Elisa Kreiss, Cynthia Bennett, Shayan Hooshmand, Eric Zelikman, Meredith Ringel Morris and Christopher Potts", "abstract": "Few images on the Web receive alt-text descriptions that would make them accessible to blind and low vision (BLV) users. Image-based NLG systems have progressed to the point where they can begin to address this persistent societal problem, but these systems will not be fully successful unless we evaluate them on metrics that guide their development correctly. Here, we argue against current referenceless metrics -- those that don't rely on human-generated ground-truth descriptions -- on the grounds that they do not align with the needs of BLV users. The fundamental shortcoming of these metrics is that they do not take context into account, whereas contextual information is highly valued by BLV users. To substantiate these claims, we present a study with BLV participants who rated descriptions along a variety of dimensions. An in-depth analysis reveals that the lack of context-awareness makes current referenceless metrics inadequate for advancing image accessibility. As a proof-of-concept, we provide a contextual version of the referenceless metric CLIPScore which begins to address the disconnect to the BLV data.", "track": "Resources and Evaluation", "label": 1, "url": ""}, {"loc": [4.461729526519775, 4.284296989440918], "id": 1058, "title": "MetaLogic: Logical Reasoning Explanations with Fine-Grained Structure", "authors": "Yinya Huang, Hongming Zhang, Ruixin Hong, Xiaodan Liang, Changshui Zhang and Dong Yu", "abstract": "In this paper, we propose a comprehensive benchmark to investigate models' logical reasoning capabilities in complex real-life scenarios. Current explanation datasets often employ synthetic data with simple reasoning structures. Therefore, it cannot express more complex reasoning processes, such as the rebuttal to a reasoning step and the degree of certainty of the evidence. To this end, we propose a comprehensive logical reasoning explanation form. Based on the multi-hop chain of reasoning, the explanation form includes three main components: (1) The condition of rebuttal that the reasoning node can be challenged; (2) Logical formulae that uncover the internal texture of reasoning nodes; (3) Reasoning strength indicated by degrees of certainty. The fine-grained structure conforms to the real logical reasoning scenario, better fitting the human cognitive process but, simultaneously, is more challenging for the current models. We evaluate the current best models' performance on this new explanation form. The experimental results show that generating reasoning graphs remains a challenging task for current models, even with the help of giant pre-trained language models.", "track": "Resources and Evaluation", "label": 1, "url": "https://www.semanticscholar.org/reader/2b22a3acb3ba1581d320b70b02343d4a0f356e3e?experiments=&features=reader_skimming%3Atrue"}, {"loc": [2.296556234359741, 4.484858989715576], "id": 1061, "title": "Explicit Query Rewriting for Conversational Dense Retrieval", "authors": "Hongjin Qian and Zhicheng Dou", "abstract": "In a conversational search scenario, a query might be context-dependent because some words are referred to previous expressions or omitted. Previous works tackle the issue by either reformulating the query into a self-contained query (query rewriting) or learning a contextualized query embedding from the query context (context modelling). In this paper, we propose a model CRDR that can perform query rewriting and context modelling in a unified framework in which the query rewriting's supervision signals further enhance the context modelling. Instead of generating a new query, CRDR only performs necessary modifications on the original query, which improves both accuracy and efficiency of query rewriting. In the meantime, the query rewriting benefits the context modelling by explicitly highlighting relevant terms in the query context, which improves the quality of the learned contextualized query embedding. To verify the effectiveness of CRDR, we perform comprehensive experiments on TREC CAsT-19 and TREC CAsT-20 datasets, and the results show that our method outperforms all baseline models in terms of both quality of query rewriting and quality of context-aware ranking.", "track": "Information Retrieval and Text Mining", "label": 15, "url": ""}, {"loc": [8.020330429077148, 5.715707778930664], "id": 1064, "title": "Efficient Nearest Neighbor Emotion Classification with BERT-whitening", "authors": "Wenbiao Yin and Lin Shang", "abstract": "Retrieval-based methods have been proven effective in many NLP tasks. Previous methods use representations from the pre-trained model for similarity search directly. However, the sentence representations from the pre-trained model like BERT perform poorly in retrieving semantically similar sentences, resulting in poor performance of the retrieval-based methods. In this paper, we propose kNN-EC, a simple and efficient non-parametric emotion classification (EC) method using nearest neighbor retrieval. We use BERT-whitening to get better sentence semantics, ensuring that nearest neighbor retrieval works. Meanwhile, BERT-whitening can also reduce memory storage of datastore and accelerate retrieval speed, solving the efficiency problem of the previous methods. kNN-EC average improves the pre-trained model by 1.17 F1-macro on two emotion classification datasets.", "track": "Sentiment Analysis, Stylistic Analysis, and Argument Mining", "label": 16, "url": ""}, {"loc": [7.309751033782959, 9.64592170715332], "id": 1066, "title": "FastClass: A Time-Efficient Approach to Weakly-Supervised Text Classification", "authors": "Tingyu Xia, Yue Wang, Yuan Tian and Yi Chang", "abstract": "Weakly-supervised text classification aims to train a classifier  using only class descriptions and unlabeled data. Recent research shows that keyword-driven methods can achieve state-of-the-art performance on various tasks. However, these methods not only rely on carefully-crafted class descriptions to obtain class-specific keywords but also require substantial amount of unlabeled data and takes a long time to train. This paper proposes FastClass, an efficient weakly-supervised classification approach. It uses dense text representation to retrieve class-relevant documents from external unlabeled corpus and selects an optimal subset to train a classifier.  Compared to keyword-driven methods, our approach is less reliant on initial class descriptions as it no longer needs to expand each class description into a set of class-specific keywords.Experiments on a wide range of classification tasks show that the proposed approach frequently outperforms keyword-driven models in terms of classification accuracy and often enjoys orders-of-magnitude faster training speed.", "track": "Unsupervised and Weakly-Supervised Methods in NLP", "label": 17, "url": ""}, {"loc": [7.750030517578125, 7.052759170532227], "id": 1075, "title": "Neural-Symbolic Inference for Robust Autoregressive Graph Parsing via Compositional Uncertainty Quantification", "authors": "Zi Lin, Jeremiah Liu and Jingbo Shang", "abstract": "Pre-trained seq2seq models excel at graph semantic parsing with rich annotated data, but generalize worse to out-of-distribution (OOD) and long-tail examples. In comparison, symbolic parsers under-perform on population-level metrics, but exhibit unique strength in OOD and tail generalization. In this work, we study compositionality-aware approach to neural-symbolic inference informed by model confidence, performing fine-grained neural-symbolic reasoning at subgraph level (i.e., nodes and edges) and precisely targeting subgraph components with high uncertainty in the neural parser. As a result, the method combines the distinct strength of the neural and symbolic approaches in capturing different aspects of the graph prediction, leading to well-rounded generalization performance both across domains and in the tail. We empirically investigate the approach in the English Resource Grammar (ERG) parsing problem on a diverse suite of standard in-domain and seven OOD corpora. Our approach leads to 35.26% and 35.60% error reduction in aggregated SMATCH score over neural and symbolic approaches respectively, and 14% absolute accuracy gain in key tail linguistic categories over the neural model, outperforming prior state-of-art methods that do not account for compositionality or uncertainty.", "track": "Semantics: Lexical, Sentence level, Textual Inference and Other areas", "label": 8, "url": ""}, {"loc": [2.8263230323791504, 8.70888900756836], "id": 1080, "title": "A Speaker-Aware Co-Attention Framework for Medical Dialogue Information Extraction", "authors": "Yuan Xia, Zhenhui Shi, Jingbo Zhou, Jiayu Xu, Chao Lu, Yehui Yang, Lei Wang, Haifeng Huang, Xia Zhang and Junwei Liu", "abstract": "With the development of medical digitization, the extraction and structuring of Electronic Medical Records (EMRs) have become challenging but fundamental tasks. How to accurately and automatically extract structured information from medical dialogues is especially difficult because the information needs to be inferred from complex interactions between the doctor and the patient. To this end, in this paper, we propose a speaker-aware co-attention framework for medical dialogue information extraction. To better utilize the pre-trained language representation model to perceive the semantics of the utterance and the candidate item, we develop a speaker-aware dialogue encoder with multi-task learning, which considers the speaker's identity into account. To deal with complex interactions between different utterances and the correlations between utterances and candidate items, we propose a co-attention fusion network to aggregate the utterance information. We evaluate our framework on the public medical dialogue extraction datasets to demonstrate the superiority of our method, which can outperform the state-of-the-art methods by a large margin. Codes will be publicly available upon acceptance.", "track": "NLP Applications", "label": 0, "url": ""}, {"loc": [4.889120101928711, 4.7337141036987305], "id": 1085, "title": "Towards Interactivity and Interpretability: A Rationale-based Legal Judgment Prediction Framework", "authors": "Yiquan Wu, Yifei Liu, Weiming Lu, Yating Zhang, Jun Feng, Changlong Sun, Fei Wu and Kun Kuang", "abstract": "Legal judgment prediction (LJP) is a fundamental task in legal AI, which aims to assist the judge to hear the case and determine the judgment. The legal judgment usually consists of the law article, charge, and term of penalty. In the real trial scenario, the judge usually makes the decision step-by-step: first concludes the rationale according to the case's facts and then determines the judgment. Recently, many models have been proposed and made tremendous progress in LJP, but most of them adopt an end-to-end manner that cannot be manually intervened by the judge for practical use. Moreover, existing models lack interpretability due to the neglect of rationale in the prediction process. Following the judge's real trial logic, in this paper, we propose a novel Rationale-based Legal Judgment Prediction (RLJP) framework. In the RLJP framework, the LJP process is split into two steps. In the first phase, the model generates the rationales according to the fact description. Then it predicts the judgment based on the fact and the generated rationales. Extensive experiments on a real-world dataset show RLJP achieves the best results compared to the state-of-the-art models. Meanwhile, the proposed framework provides good interactivity and interpretability which enables practical use.", "track": "Interpretability, Interactivity and Analysis of Models for NLP", "label": 9, "url": ""}, {"loc": [5.44679594039917, 12.414607048034668], "id": 1098, "title": "RelCLIP: Adapting Language-Image Pretraining for Visual Relationship Detection via Relational Contrastive Learning", "authors": "Yi Zhu, Zhaoqing Zhu, Bingqian Lin, Xiaodan Liang, Feng Zhao and Jianzhuang Liu", "abstract": "Conventional visual relationship detection models only use the numeric ids of relation labels for training, but ignore the semantic correlation between the labels, which leads to severe training biases and harms the generalization ability of representations. In this paper, we introduce compact language information of relation labels for regularizing the representation learning of visual relations. Specifically, we propose a simple yet effective visual Relationship prediction framework that transfers natural language knowledge learned from Contrastive Language-Image Pre-training (CLIP) models to enhance the relationship prediction, termed RelCLIP. Benefiting from the powerful visual-semantic alignment ability of CLIP at image level, we introduce a novel Relational Contrastive Learning (RCL) approach which explores relation-level visual-semantic alignment via learning to match cross-modal relational embeddings. By collaboratively learning the semantic coherence and discrepancy from relation triplets, the model can generate more discriminative and robust representations. Experimental results on the Visual Genome dataset show that RelCLIP achieves significant improvements over strong baselines under full (provide accurate labels) and distant supervision (provide noise labels), demonstrating its powerful generalization ability in learning relationship representations. Code will be available at https://gitee.com/mindspore/models/tree/master/research/cv/RelCLIP.", "track": "Speech, Vision, Robotics, Multimodal Grounding", "label": 7, "url": ""}, {"loc": [10.596184730529785, 7.618668079376221], "id": 1105, "title": "Candidate Soups: Fusing Candidate Results Improves Translation Quality for Non-Autoregressive Translation", "authors": "Huanran Zheng, Wei Zhu, Pengfei Wang and Xiaoling Wang", "abstract": "Non-autoregressive translation (NAT) model achieves a much faster inference speed than the autoregressive translation (AT) model because it can simultaneously predict all tokens during inference. However, its translation quality suffers from degradation compared to AT. And existing NAT methods only focus on improving the NAT model's performance but do not fully utilize it. In this paper, we propose a simple but effective method called \"Candidate Soups,\u201d which can obtain high-quality translations while maintaining the inference speed of NAT models. Unlike previous approaches that pick the individual result and discard the remainders, Candidate Soups (CDS) can fully use the valuable information in the different candidate translations through model uncertainty. Extensive experiments on two benchmarks (WMT'14 EN\u2013DE and WMT'16 EN\u2013RO) demonstrate the effectiveness and generality of our proposed method, which can significantly improve the translation quality of various base models. More notably, our best variant outperforms the AT model on three translation tasks with 7.6\u00d7 speedup.", "track": "Machine Translation", "label": 10, "url": ""}, {"loc": [8.58010482788086, 8.370965957641602], "id": 1118, "title": "Evaluating Parameter Efficient Learning for Generation", "authors": "Peng Xu, Mostofa Patwary, Shrimai Prabhumoye, Virginia Adams, Ryan J. Prenger, Wei Ping, Nayeon Lee, Mohammad Shoeybi and Bryan Catanzaro", "abstract": "Parameter efficient learning methods (PERMs)\nhave recently gained significant attention as\nthey provide an efficient way for pre-trained\nlanguage models (PLMs) to adapt to a downstream task. However, these conclusions are\nmostly drawn from in-domain evaluations over\nthe full training set. In this paper, we present\ncomparisons between PERMs and finetuning\nfrom three new perspectives: (1) the effect of\nsample and model size to in-domain evaluations, (2) generalization to unseen domains and\nnew datasets, and (3) the faithfulness of generations. Our results show that for in-domain\nsettings (a) there is a cross point of sample\nsize for which PERMs will perform better than\nfinetuning when training with fewer samples,\nand (b) larger PLMs have larger cross points.\nFor cross-domain and cross-dataset cases, we\nshow that (a) Adapter (Houlsby et al., 2019)\nperforms the best amongst all the PERMs studied here, and (b) it outperforms finetuning if\nthe task dataset is below a certain size. We\nalso compare the faithfulness of generations\nand show that PERMs can achieve better faithfulness score than finetuning, especially for\nsmall training set, by as much as 6%. Finally,\nwe apply Adapter to MT-NLG 530b (Smith\net al., 2022) and achieve new state-of-the-art\nresults on Xsum (Narayan et al., 2018) for all\nROUGE scores (ROUGE-1 49.17, ROUGE-2\n27.20, ROUGE-L 40.98).", "track": "Natural Language Generation", "label": 6, "url": "https://www.semanticscholar.org/reader/5f25d61830314a4302cf07feaf8be221d5e2d2fc?experiments=&features=reader_skimming%3Atrue"}, {"loc": [5.636509418487549, 12.1234769821167], "id": 1119, "title": "McQueen: a Benchmark for Multimodal Conversational Query Rewrite", "authors": "Yifei Yuan, Chen Shi, Runze Wang, Liyi Chen, Feijun Jiang, Yuan You and Wai Lam", "abstract": "The task of query rewrite aims to convert an in-context query to its fully-specified version where ellipsis and coreference are completed and referred-back according to the history context. Although much progress has been made, less efforts have been paid to real scenario conversations that involve drawing information from more than one modalities. In this paper, we propose the task of multimodal conversational query rewrite (McQR), which performs query rewrite under the multimodal visual conversation setting. We collect a large-scale dataset named McQueen based on manual annotation, which contains 15k visual conversations and over 80k queries where each one is associated with a fully-specified rewrite version. In addition, for entities appearing in the rewrite, we provide the corresponding image box annotation. We then use the McQueen dataset to benchmark a state-of-the-art method for effectively tackling the McQR task, which is based on a multimodal pre-trained model with pointer generator. Extensive experiments are performed to demonstrate the effectiveness of our model on this task.", "track": "Speech, Vision, Robotics, Multimodal Grounding", "label": 7, "url": "https://www.semanticscholar.org/reader/90f9450ec1456816d46604d236c48712a29f7d08?experiments=&features=reader_skimming%3Atrue"}, {"loc": [5.541003704071045, 8.941580772399902], "id": 1126, "title": "Self-supervised Graph Masking Pre-training for Graph-to-Text Generation", "authors": "Jiuzhou Han and Ehsan Shareghi", "abstract": "Large-scale pre-trained language models (PLMs) have advanced Graph-to-Text (G2T) generation by processing the linearised version of a graph. However, the linearisation is known to ignore the structural information. Additionally, PLMs are typically pre-trained on free text which introduces domain mismatch between pre-training and downstream G2T generation tasks. To address these shortcomings, we propose graph masking pre-training strategies that neither require supervision signals nor adjust the architecture of the underlying pre-trained encoder-decoder model. When used with a pre-trained T5, our approach achieves new state-of-the-art results on WebNLG+2020 and EventNarrative G2T generation datasets. Our method also shows to be very effective in the low-resource setting.", "track": "Natural Language Generation", "label": 6, "url": "https://www.semanticscholar.org/reader/6462f367550af0dab4eda55530c854743469c1d6?experiments=&features=reader_skimming%3Atrue"}, {"loc": [8.798027992248535, 8.371423721313477], "id": 1127, "title": "Improving Stability of Fine-Tuning Pretrained Language Models via Component-Wise Gradient Norm Clipping", "authors": "Chenghao Yang and Xuezhe Ma", "abstract": "Fine-tuning over large pretrained language models (PLMs) has established many state-of-the-art results. \nDespite its superior performance, such fine-tuning can be unstable, resulting in significant variance in performance and potential risks for practical applications. Previous works have attributed such instability to the catastrophic forgetting problem in the top layers of PLMs, which indicates iteratively fine-tuning layers in a top-down manner is a promising solution. In this paper, we first point out that this method does not always work out due to the different convergence speeds of different layers/modules. Inspired by this observation, we propose a simple component-wise gradient norm clipping method to adjust the convergence speed for different components. Experiment results demonstrate that our method achieves consistent improvements in terms of generalization performance, convergence speed, and training stability. The codebase can be found at https://github.com/yangalan123/FineTuningStability.", "track": "Machine Learning for NLP", "label": 3, "url": "https://www.semanticscholar.org/reader/048a71c2b2b1fca75feff0914a375ffe5aa023c9?experiments=&features=reader_skimming%3Atrue"}, {"loc": [8.11702823638916, 3.013378620147705], "id": 1147, "title": "Differentially Private Language Models for Secure Data Sharing", "authors": "Justus Mattern, Zhijing Jin, Benjamin Weggenmann, Mrinmaya Sachan and Bernhard Schoelkopf", "abstract": "To protect the privacy of individuals whose data is being shared, it is of high importance to develop methods allowing researchers and companies to release textual data while providing formal privacy guarantees to its originators. In the field of NLP, substantial efforts have been directed at building mechanisms following the framework of local differential privacy, thereby anonymizing individual text samples before releasing them. In practice, these approaches are often dissatisfying in terms of the quality of their output language due to the strong noise required for local differential privacy. In this paper, we approach the problem at hand using global differential privacy, particularly by training a generative language model in a differentially private manner and consequently sampling data from it. Using natural language prompts and a new prompt-mismatch loss, we are able to create highly accurate and fluent textual datasets taking on specific desired attributes such as sentiment or topic and resembling statistical properties of the training data. We perform thorough experiments indicating that our synthetic datasets do not leak information from our original data and are of high language quality and highly suitable for training models for further analysis on real-world data. Notably, we also demonstrate that training classifiers on private synthetic data outperforms directly training classifiers with DP-SGD.", "track": "Natural Language Generation", "label": 6, "url": "https://www.semanticscholar.org/reader/af710ada8965f274e810053f716f966627a136d9?experiments=&features=reader_skimming%3Atrue"}, {"loc": [5.886735439300537, 8.729007720947266], "id": 1150, "title": "Conditional set generation using Seq2seq models", "authors": "Aman Madaan, Dheeraj Rajagopal, Niket Tandon, Yiming Yang and Antoine Bosselut", "abstract": "Conditional set generation learns a mapping from an input sequence of tokens to a set. Several NLP tasks, such as entity typing and dialogue emotion tagging, are instances of set generation. Seq2Seq models are a popular choice to model set generation but they treat a set as a sequence and do not fully leverage its key properties, namely order-invariance and cardinality. We propose a novel algorithm for effectively sampling informative orders over the combinatorial space of label orders. Further, we jointly model the set cardinality and output by listing the set size as the first element and taking advantage of the autoregressive factorization used by Seq2Seq models. Our method is a model-independent data augmentation approach that endows any Seq2Seq model with the signals of order-invariance and cardinality. Training a Seq2Seq model on this new augmented data~(without any additional annotations), gets an average relative improvement of 20% for four benchmarks datasets across models spanning from BART-base, T5-11B, and GPT-3. We will release all code and data upon acceptance.", "track": "Natural Language Generation", "label": 6, "url": "https://www.semanticscholar.org/reader/1cdcf5f527a887cb935eaf2a0109b40d2fc90fdb?experiments=&features=reader_skimming%3Atrue"}, {"loc": [3.6834402084350586, 8.141483306884766], "id": 1158, "title": "Analyzing and Evaluating Faithfulness in Dialogue Summarization", "authors": "Bin Wang, Chen Zhang, Yan Zhang, Yiming Chen and Haizhou Li", "abstract": "Dialogue summarization is abstractive in nature, making it suffer from factual errors. The factual correctness of summaries has the highest priority before practical applications. Many efforts have been made to improve faithfulness in text summarization. However, there is a lack of systematic study on dialogue summarization systems. In this work, we first perform the fine-grained human analysis on the faithfulness of dialogue summaries and observe that over 35% of generated summaries are faithfully inconsistent respective the source dialogues. Furthermore, we present a new model-level faithfulness evaluation method. It examines generation models with multi-choice questions created by rule-based transformations. Experimental results show that our evaluation schema is a strong proxy for the factual correctness of summarization models. The human-annotated faithfulness samples and the evaluation toolkit are released to facilitate future research toward faithful dialogue summarization.", "track": "Summarization", "label": 14, "url": "https://www.semanticscholar.org/reader/3eda2fc2dbae1d6255c54667df3e63ff39621c2d?experiments=&features=reader_skimming%3Atrue"}, {"loc": [5.488138675689697, 8.956270217895508], "id": 1169, "title": "Twist Decoding: Diverse Generators Guide Each Other", "authors": "Jungo Kasai, Keisuke Sakaguchi, Ronan Le Bras, Hao Peng, Ximing Lu, Dragomir Radev, Yejin Choi and Noah A. Smith", "abstract": "Many language generation models are now available for a wide range of generation tasks, including machine translation and summarization. Combining such diverse models may lead to further progress, but ensembling generation models is challenging during inference: conventional ensembling methods (e.g., shallow fusion) require that the models share vocabulary/tokenization schemes. We introduce Twist decoding, a simple and general text generation algorithm that benefits from diverse models at inference time. Our method does not assume the vocabulary, tokenization or even generation order is shared. Our extensive evaluations on machine translation and scientific paper summarization demonstrate that Twist decoding substantially outperforms each model decoded in isolation over various scenarios, including cases where domain-specific and general-purpose models are both available. Twist decoding also consistently outperforms the popular reranking heuristic where output candidates from one model are rescored by another. We hope that our work will encourage researchers and practitioners to examine generation models collectively, not just independently, and to seek out models with complementary strengths to the currently available models.", "track": "Natural Language Generation", "label": 6, "url": ""}, {"loc": [6.5302252769470215, 1.8606117963790894], "id": 1173, "title": "Exploring Representation-level Augmentation for Code Search", "authors": "Haochen Li, Chunyan Miao, Cyril Leung, Yanxian Huang, Yuan Huang, Hongyu Zhang and Yanlin Wang", "abstract": "Code search, which aims at retrieving the most relevant code fragment for a given natural language query, is a common activity in software development practice. Recently, contrastive learning is widely used in code search research, where many data augmentation approaches for source code (e.g., semantic-preserving program transformation) are proposed to learn better representations.  However, these augmentations are at the raw-data level, which requires additional code analysis in the preprocessing stage and additional training cost in the training stage. In this paper, we explore augmentation methods that augment data (both code and query) at representation level which does not require additional data processing and training, and based on this we propose a general format of representation-level augmentation that unifies existing methods. Then, we propose three new augmentation methods (linear extrapolation, binary interpolation, and Gaussian scaling) based on the general format. Furthermore, we theoretically analyze the advantages of the proposed augmentation methods over traditional contrastive learning methods on code search. We experimentally evaluate the proposed representation-level augmentation methods with state-of-the-art code search models on a large-scale public dataset consisting of six programming languages. The experimental results show that our approach can consistently boost the performance of the studied code search models.", "track": "Information Retrieval and Text Mining", "label": 15, "url": "https://www.semanticscholar.org/reader/d1d8660ef2e5e608e25d0a484d70e3497fc5c051?experiments=&features=reader_skimming%3Atrue"}, {"loc": [7.992883682250977, 5.770003795623779], "id": 1187, "title": "Learning Semantic Textual Similarity via Topic-informed Discrete Latent Variables", "authors": "Erxin Yu, Lan Du, YUAN JIN, Zhepei Wei and Yi Chang", "abstract": "Recently, discrete latent variable models have received a surge of interest in both Natural Language Processing (NLP) and Computer Vision (CV), attributed to their comparable performance to the continuous counterparts in representation learning, while being more interpretable in their predictions. In this paper, we develop a topic-informed discrete latent variable model for semantic textual similarity, which learns a shared latent space for sentence-pair representation via vector quantization. Compared with previous models limited to local semantic contexts, our model can explore richer semantic information via topic modeling. We further boost the performance of semantic similarity by injecting the quantized representation into a transformer-based language model with a well-designed semantic-driven attention mechanism. We demonstrate, through extensive experiments across various English language datasets, that our model is able to surpass several strong neural baselines in semantic textual similarity tasks.", "track": "Semantics: Lexical, Sentence level, Textual Inference and Other areas", "label": 8, "url": "https://www.semanticscholar.org/reader/5b8f1450584332cb81638b5823d48f3b632af511?experiments=&features=reader_skimming%3Atrue"}, {"loc": [3.7054240703582764, 7.962756156921387], "id": 1201, "title": "STRUDEL: Structured Dialogue Summarization for Dialogue Comprehension", "authors": "Borui Wang, Chengcheng Feng, Arjun Nair, Madelyn Mao, Jai Desai, Asli Celikyilmaz, Haoran Li, Yashar Mehdad and Dragomir Radev", "abstract": "Abstractive dialogue summarization has long been viewed as an important standalone task in natural language processing, but no previous work has explored the possibility of whether abstractive dialogue summarization can also be used as a means to boost an NLP system's performance on other important dialogue comprehension tasks. In this paper, we propose a novel type of dialogue summarization task - STRUctured DiaLoguE Summarization (STRUDEL) - that can help pre-trained language models to better understand dialogues and improve their performance on important dialogue comprehension tasks. In contrast to the holistic approach taken by the traditional free-form abstractive summarization task for dialogues, STRUDEL aims to decompose and imitate the hierarchical, systematic and structured mental process that we human beings usually go through when understanding and analyzing dialogues, and thus has the advantage of being more focused, specific and instructive for dialogue comprehension models to learn from. We further introduce a new STRUDEL dialogue comprehension modeling framework that integrates STRUDEL into a dialogue reasoning module over transformer encoder language models to improve their dialogue comprehension ability. In our empirical experiments on two important downstream dialogue comprehension tasks - dialogue question answering and dialogue response prediction - we demonstrate that our STRUDEL dialogue comprehension models can significantly improve the dialogue comprehension performance of transformer encoder language models.", "track": "Dialogue and Interactive Systems", "label": 4, "url": ""}, {"loc": [10.85542106628418, 6.84752082824707], "id": 1206, "title": "Competency-Aware Neural Machine Translation: Can Machine Translation Know its Own Translation Quality?", "authors": "Pei Zhang, Baosong Yang, Hao-Ran Wei, Dayiheng Liu, Kai Fan, Luo Si and Jun Xie", "abstract": "Neural machine translation (NMT) is often criticized for failures that happen\nwithout awareness. \nThe lack of competency awareness makes NMT untrustworthy. \nThis is in sharp contrast to human translators who give feedback or conduct further investigations whenever they are in doubt about predictions. \nTo fill this gap, we propose a novel competency-aware NMT by extending conventional NMT with a self-estimator, offering abilities to translate a source sentence and estimate its competency.\nThe self-estimator encodes the information of the decoding procedure and then examines whether it can reconstruct the original semantics of the source sentence. \nExperimental results on four translation tasks demonstrate that the proposed method not only carries out translation tasks intact but also delivers outstanding performance on quality estimation.\nWithout depending on any reference or annotated data typically required by state-of-the-art metric and quality estimation methods, our model yields an even higher correlation with human quality judgments than a variety of aforementioned methods, such as BLEURT, COMET, and BERTScore. \nQuantitative and qualitative analyses show better robustness of competency awareness in our model.\\footnote{Code and test sets are available at: https://github.com/xiaoyi0814/CANMT.}", "track": "Machine Translation", "label": 10, "url": ""}, {"loc": [4.4170427322387695, 4.983255386352539], "id": 1208, "title": "PASTA: Table-Operations Aware Fact Verification via Sentence-Table Cloze Pre-training", "authors": "Zihui Gu, Ju Fan, Nan Tang, Preslav Nakov, Xiaoman Zhao and Xiaoyong Du", "abstract": "Fact verification has attracted a lot of attention recently, e.g., in journalism, marketing, and policymaking, as misinformation and dis- information can sway one's opinion and affect one's actions. While fact-checking is a hard task in general, in many cases, false statements can be easily debunked based on analytics over tables with reliable information. Hence, table- based fact verification has recently emerged as an important and growing research area. Yet, progress has been limited due to the lack of datasets that can be used to pre-train language models (LMs) to be aware of common table operations, such as aggregating a column or comparing tuples. To bridge this gap, this paper introduces PASTA for table-based fact verification via pre-training with synthesized sentence\u2013table cloze questions. In particular, we design six types of common sentence\u2013table cloze tasks, including Filter, Aggregation, Superlative, Comparative, Ordinal, and Unique, based on which we synthesize a large corpus consisting of 1.2 million sentence\u2013table pairs from WikiTables. PASTA uses a recent pre-trained LM, DeBERTaV3, and further pre- trains it on our corpus. Our experimental results show that PASTA achieves new state-of-the-art (SOTA) performance on two table-based fact verification datasets TabFact and SEM-TAB- FACTS. In particular, on the complex set of TabFact, which contains multiple operations, PASTA largely outperforms previous SOTA by 4.7% (85.6% vs. 80.9%), and the gap between PASTA and human performance on the small test set is narrowed to just 1.5% (90.6% vs. 92.1%).", "track": "Unsupervised and Weakly-Supervised Methods in NLP", "label": 17, "url": "https://www.semanticscholar.org/reader/5fefc28ae503c465b1801da2b457f5a2cb5bd51f?experiments=&features=reader_skimming%3Atrue"}, {"loc": [1.077452301979065, 10.55976676940918], "id": 1216, "title": "Sentiment-Aware Word and Sentence Level Pre-training for Sentiment Analysis", "authors": "Shuai Fan, Chen Lin, Haonan Li, Zhenghao Lin, Jinsong Su, Hang Zhang, Yeyun Gong, JIan Guo and Nan Duan", "abstract": "Most existing pre-trained language representation models (PLMs) are sub-optimal in sentiment analysis tasks, as they capture the sentiment information from word-level while under-considering sentence-level information. \nIn this paper, we propose SentiWSP, a novel Sentiment-aware pre-trained language model with combined Word-level and Sentence-level Pre-training tasks.\nThe word level pre-training task detects replaced sentiment words, via a generator-discriminator framework, to enhance the PLM's knowledge about sentiment words.\nThe sentence level pre-training task further strengthens the discriminator via a contrastive learning framework, with similar sentences as negative samples, to encode sentiments in a sentence.\nExtensive experimental results show that SentiWSP achieves new state-of-the-art performance on various sentence-level and aspect-level sentiment classification benchmarks.  \nWe have made our code and model publicly available at https://github.com/XMUDM/SentiWSP.", "track": "Sentiment Analysis, Stylistic Analysis, and Argument Mining", "label": 16, "url": ""}, {"loc": [6.23079776763916, 12.178827285766602], "id": 1222, "title": "Towards Multi-Modal Sarcasm Detection via Hierarchical Congruity Modeling with Knowledge Enhancement", "authors": "Hui Liu, Wenya Wang and Haoliang Li", "abstract": "Sarcasm is a linguistic phenomenon indicating a discrepancy between literal meanings and implied intentions. Due to its sophisticated nature, it is usually difficult to be detected from the text itself. As a result, multi-modal sarcasm detection has received more and more attention in both academia and industries. However, most existing techniques only modeled the atomic-level inconsistencies between the text input and its accompanying image, ignoring more complex compositions for both modalities. Moreover, they neglected the rich information contained in external knowledge, e.g., image captions. In this paper, we propose a novel hierarchical framework for sarcasm detection by exploring both the atomic-level congruity based on multi-head cross attentions and the composition-level congruity based on graph neural networks, where a post with low congruity can be identified as sarcasm. In addition, we exploit the effect of various knowledge resources for sarcasm detection. Evaluation results on a public multi-modal sarcasm detection dataset based on Twitter demonstrate the superiority of our proposed model.", "track": "NLP Applications", "label": 0, "url": "https://www.semanticscholar.org/reader/10eabe1578e74b4fb33e53269177d78a6a02aa06?experiments=&features=reader_skimming%3Atrue"}, {"loc": [7.653224945068359, 8.598806381225586], "id": 1234, "title": "Efficiently Tuned Parameters Are Task Embeddings", "authors": "Wangchunshu Zhou, Canwen Xu and Julian McAuley", "abstract": "Intermediate-task transfer can benefit a wide range of NLP tasks with properly selected source datasets. However, it is computationally infeasible to experiment with all intermediate transfer combinations, making choosing a useful source task a challenging problem. In this paper, we anticipate that task-specific parameters updated in parameter-efficient tuning methods are likely to encode task-specific information. Therefore, such parameters can be predictive for inter-task transferability. Thus, we propose to exploit these efficiently tuned parameters as off-the-shelf task embeddings for the efficient selection of source datasets for intermediate-task transfer. We experiment with 11 text classification tasks and 11 question answering tasks. Experimental results show that our approach consistently outperforms existing inter-task transferability prediction methods while being conceptually simple and computationally efficient. Our analysis also reveals that the ability of efficiently tuned parameters on transferability prediction is disentangled with their in-task performance. This allows us to use parameters from early checkpoints as task embeddings to further improve efficiency.", "track": "Machine Learning for NLP", "label": 3, "url": "https://www.semanticscholar.org/reader/49c02199de8a9caca038282f130bebaebe58ab3b?experiments=&features=reader_skimming%3Atrue"}, {"loc": [4.997520923614502, 3.6511054039001465], "id": 1242, "title": "COPEN: Probing Conceptual Knowledge in Pre-trained Language Models", "authors": "Hao Peng, Xiaozhi Wang, Shengding Hu, Hailong Jin, Lei Hou, Juanzi Li, Zhiyuan Liu and Qun Liu", "abstract": "Conceptual knowledge is fundamental to human cognition and knowledge bases. However, existing knowledge probing works only focus on evaluating factual knowledge of pre-trained language models (PLMs) and ignore conceptual knowledge. Since conceptual knowledge often appears as implicit commonsense behind texts, designing probes for conceptual knowledge is hard. Inspired by knowledge representation schemata, we comprehensively evaluate conceptual knowledge of PLMs by designing three tasks to probe whether PLMs organize entities by conceptual similarities, learn conceptual properties, and conceptualize entities in contexts, respectively. For the tasks, we collect and annotate 24k data instances covering 393 concepts, which is COPEN, a COnceptual knowledge Probing bENchmark. Extensive experiments on different sizes and types of PLMs show that existing PLMs systematically lack conceptual knowledge and suffer from various spurious correlations. We believe this is a critical bottleneck for realizing human-like cognition in PLMs. COPEN and our codes are publicly released at https://github.com/THU-KEG/COPEN.", "track": "Language Modeling and Analysis of Language Models", "label": 2, "url": "https://www.semanticscholar.org/reader/bcec7d17e68aceb91d020dd796ece075694f77c6?experiments=&features=reader_skimming%3Atrue"}, {"loc": [1.7433269023895264, 5.299554824829102], "id": 1245, "title": "Capturing Global Structural Information in Long Document Question Answering with Compressive Graph Selector Network", "authors": "Yuxiang Nie, Heyan Huang, Wei Wei and Xian-Ling Mao", "abstract": "Long document question answering is a challenging task due to its demands for complex reasoning over long text. Previous works usually take long documents as non-structured flat texts or only consider the local structure in long documents. However, these methods usually ignore the global structure of the long document, which is essential for long-range understanding. To tackle this problem, we propose Compressive Graph Selector Network (CGSN) to capture the global structure in a compressive and iterative manner. The proposed model mainly focuses on the evidence selection phase of long document question answering. Specifically, it consists of three modules: local graph network, global graph network and evidence memory network. Firstly, the local graph network builds the graph structure of the chunked segment in token, sentence, paragraph and segment levels to capture the short-term dependency of the text. Secondly, the global graph network selectively receives the information of each level from the local graph, compresses them into the global graph nodes and applies graph attention to the global graph nodes to build the long-range reasoning over the entire text in an iterative way. Thirdly, the evidence memory network is designed to alleviate the redundancy problem in the evidence selection by saving the selected result in the previous steps. Extensive experiments show that the proposed model outperforms previous methods on two datasets.", "track": "Question Answering", "label": 11, "url": "https://www.semanticscholar.org/reader/077f3c382d0dce221cf6aaef0e7185a249b71b9f?experiments=&features=reader_skimming%3Atrue"}, {"loc": [7.311715126037598, 6.992787837982178], "id": 1247, "title": "Structural generalization is hard for sequence-to-sequence models", "authors": "Yuekun Yao and Alexander Koller", "abstract": "Sequence-to-sequence (seq2seq) models have been successful across many NLP tasks,\nincluding ones that require predicting linguistic structure. However, recent work on compositional generalization has shown that seq2seq models achieve very low accuracy in generalizing to linguistic structures that were not seen in training. We present new evidence that this is a general limitation of seq2seq models that is present not just in semantic parsing, but also in syntactic parsing and in text-to-text tasks, and that this limitation can often be overcome by neurosymbolic models that have linguistic knowledge built in. We further report on some experiments that give initial answers on the reasons for these limitations.", "track": "Theme Track", "label": 18, "url": "https://www.semanticscholar.org/reader/dbe286676d094ca588312cbfc8f699a9a2ca1cc9?experiments=&features=reader_skimming%3Atrue"}, {"loc": [5.789286136627197, 8.85915470123291], "id": 1250, "title": "Contrastive Learning enhanced Author-Style Headline Generation", "authors": "Hui Liu, Weidong Guo, Yige Chen and Xiangyang Li", "abstract": "Headline generation is a task of generating an appropriate headline for a given article, which can be further used for machine-aided writing or enhancing the click-through ratio. Current works only use the article itself in the generation, but have not taken the writing style of headlines into consideration. In this paper, we propose a novel Seq2Seq model called CLH3G (Contrastive Learning enhanced Historical Headlines based Headline Generation) which can use the historical headlines of the articles that the author wrote in the past to improve the headline generation of current articles. By taking historical headlines into account, we can integrate the stylistic features of the author into our model, and generate a headline not only appropriate for the article, but also consistent with the author's style. In order to efficiently learn the stylistic features of the author, we further introduce a contrastive learning based auxiliary task for the encoder of our model. Besides, we propose two methods to use the learned stylistic features to guide both the pointer and the decoder during the generation. Experimental results show that historical headlines of the same user can improve the headline generation significantly, and both the contrastive learning module and the two style features fusion methods can further boost the performance.", "track": "Natural Language Generation", "label": 6, "url": "https://www.semanticscholar.org/reader/2f233ddc5d6869b3d9868826d319d415463321f1?experiments=&features=reader_skimming%3Atrue"}, {"loc": [10.580215454101562, 7.632606029510498], "id": 1251, "title": "Multi-Granularity Optimization for Non-Autoregressive Translation", "authors": "Yafu Li, Leyang Cui, Yongjing Yin and Yue Zhang", "abstract": "Despite low latency, non-autoregressive machine translation (NAT) suffers severe performance deterioration due to the naive independence assumption. This assumption is further strengthened by cross-entropy loss, which encourages a strict match between the hypothesis and the reference token by token. To alleviate this issue, we propose multi-granularity optimization for NAT, which collects model behaviours on translation segments of various granularities and integrates feedback for backpropagation. Experiments on four WMT benchmarks show that the proposed method significantly outperforms the baseline models trained with cross-entropy loss, and achieves the best performance on WMT'16 En\u21d4Ro and highly competitive results on WMT'14 En\u21d4De for fully non-autoregressive translation.", "track": "Machine Translation", "label": 10, "url": "https://www.semanticscholar.org/reader/71bb0d7b5faa7c6cbcad4de8ebc4af215329f2b3?experiments=&features=reader_skimming%3Atrue"}, {"loc": [7.714637279510498, 8.228096008300781], "id": 1252, "title": "Super-NaturalInstructions: Generalization via Declarative Instructions on 1600+ NLP Tasks", "authors": "Yizhong Wang, Swaroop Mishra, Pegah Alipoormolabashi, Yeganeh Kordi, Amirreza Mirzaei, Atharva Naik, Arjun Ashok, Arut Selvan Dhanasekaran, Anjana Arunkumar, David Stap, Eshaan Pathak, Giannis Karamanolakis, Haizhi Gary Lai, Ishan Virendrabhai Purohit, Ishani Mondal, Jacob William Anderson, Kirby C. Kuznia, Krima Doshi, Kuntal Kumar Pal, Maitreya Patel, Mehrad Moradshahi, Mihir Parmar, Mirali Purohit, Neeraj Varshney, Phani Rohitha Kaza, Pulkit Verma, Ravsehaj Singh Puri, rushang karia, Savan Doshi, Shailaja Keyur Sampat, Siddhartha Mishra, Sujan Reddy A, Sumanta Patro, Tanay Dixit, Xudong Shen, Chitta Baral, Yejin Choi, Noah A. Smith, Hannaneh Hajishirzi and Daniel Khashabi", "abstract": "How well can NLP models generalize to a variety of unseen tasks when provided with task instructions? To address this question, we first introduce Super-NaturalInstructions, a benchmark of 1,616 diverse NLP tasks and their expert-written instructions. Our collection covers 76 distinct task types, including but not limited to classification, extraction, infilling, sequence tagging, text rewriting, and text composition. This large and diverse collection of tasks enables rigorous benchmarking of cross-task generalization under instructions---training models to follow instructions on a subset of tasks and evaluating them on the remaining unseen ones.\nFurthermore, we build Tk-Instruct, a transformer model trained to follow a variety of in-context instructions (plain language task definitions or k-shot examples). Our experiments show that Tk-Instruct outperforms existing instruction-following models such as InstructGPT by over 9% on our benchmark despite being an order of magnitude smaller. We further analyze generalization as a function of various scaling parameters, such as the number of observed tasks, the number of instances per task, and model sizes. We hope our dataset and model facilitate future progress towards more general-purpose NLP models.", "track": "Resources and Evaluation", "label": 1, "url": "https://www.semanticscholar.org/reader/06d7cb8c8816360feb33c3367073e0ef66d7d0b0?experiments=&features=reader_skimming%3Atrue"}, {"loc": [0.4904191195964813, 7.1760172843933105], "id": 1256, "title": "MetaFill: Text Infilling for Meta-Path Generation on Heterogeneous Information Networks", "authors": "Zequn Liu, Kefei Duan, Junwei Yang, Hanwen Xu, Ming Zhang and Sheng Wang", "abstract": "Heterogeneous information network (HIN) is essential to study complicated networks containing multiple edge types and node types. Meta-path, a sequence of node types and edge types, is the core technique to embed HINs. Since manually curating meta-paths is time-consuming, there is a pressing need to develop automated meta-path generation approaches. Existing meta-path generation approaches cannot fully exploit the rich textual information in HINs, such as node names and edge type names. To address this problem, we propose MetaFill, a text-infilling-based approach for meta-path generation. The key idea of MetaFill is to formulate meta-path identification problem as a word sequence infilling problem, which can be advanced by pretrained language models (PLMs). We observed the superior performance of MetaFill against existing meta-path generation methods and graph embedding methods that do not leverage meta-paths in both link prediction and node classification on two real-world HIN datasets. We further demonstrated how MetaFill can accurately classify edges in the zero-shot setting, where existing approaches cannot generate any meta-paths. MetaFill exploits PLMs to generate meta-paths for graph embedding, opening up new avenues for language model applications in graph analysis.", "track": "NLP Applications", "label": 0, "url": "https://www.semanticscholar.org/reader/f2dadc182d33f3ad74f95505e5b6611c3abafe02?experiments=&features=reader_skimming%3Atrue"}, {"loc": [1.740719199180603, 5.443744659423828], "id": 1258, "title": "DRLK: Dynamic Hierarchical Reasoning with Language Model and Knowledge Graph for Question Answering", "authors": "Miao Zhang, Rufeng Dai, Ming Dong and Tingting He", "abstract": "In recent years, Graph Neural Network (GNN) approaches with enhanced knowledge graphs (KG) perform well in question answering (QA) tasks. One critical challenge is how to effectively utilize interactions between the QA context and KG. However, existing work only adopts the identical QA context representation to interact with multiple layers of KG, which results in a restricted interaction. In this paper, we propose DRLK (Dynamic Hierarchical Reasoning with Language Model and Knowledge Graphs), a novel model that utilizes dynamic hierarchical interactions between the QA context and KG for reasoning. DRLK extracts dynamic hierarchical features in the QA context, and performs inter-layer and intra-layer interactions on each iteration, allowing the KG representation to be grounded with the hierarchical features of the QA context. We conduct extensive experiments on four benchmark datasets in medical QA and commonsense reasoning. The experimental results demonstrate that DRLK achieves state-of-the-art performances on two benchmark datasets and performs competitively on the others.", "track": "Question Answering", "label": 11, "url": ""}, {"loc": [3.522233486175537, 7.451706409454346], "id": 1270, "title": "AEG: Argumentative Essay Generation via A Dual-Decoder Model with Content Planning", "authors": "Jianzhu Bao, Yasheng Wang, Yitong Li, Fei Mi and Ruifeng Xu", "abstract": "Argument generation is an important but challenging task in computational argumentation.\nExisting studies have mainly focused on generating individual short arguments, while research on generating long and coherent argumentative essays is still under-explored.\nIn this paper, we propose a new task, Argumentative Essay Generation (AEG).\nGiven a writing prompt, the goal of AEG is to automatically generate an argumentative essay with strong persuasiveness.\nWe construct a large-scale dataset, ArgEssay, for this new task and establish a strong model based on a dual-decoder Transformer architecture.\nOur proposed model contains two decoders, a planning decoder (PD) and a writing decoder (WD), where PD is used to generate a sequence for essay content planning and WD incorporates the planning information to write an essay.\nFurther, we pre-train this model on a large news dataset to enhance the plan-and-write paradigm.\nAutomatic and human evaluation results show that our model can generate more coherent and persuasive essays with higher diversity and less repetition compared to several baselines.", "track": "Sentiment Analysis, Stylistic Analysis, and Argument Mining", "label": 16, "url": ""}, {"loc": [4.268440246582031, 7.363239765167236], "id": 1271, "title": "BotsTalk: Machine-sourced Framework for Automatic Curation of Large-scale Multi-skill Dialogue Datasets", "authors": "Minju Kim, Chae Hyeong Kim, Yong Ho Song, Seung-won Hwang and Jinyoung Yeo", "abstract": "To build open-domain chatbots that are able to use diverse communicative skills, we propose a novel framework BotsTalk, where multiple agents grounded to the specific target skills participate in a conversation to automatically annotate multi-skill dialogues. We further present Blended Skill BotsTalk (BSBT), a large-scale multi-skill dialogue dataset comprising 300K conversations. Through extensive experiments, we demonstrate that our dataset can be effective for multi-skill dialogue systems which require an understanding of skill blending as well as skill grounding. Our code and data are available at https://github.com/convei-lab/BotsTalk.", "track": "Dialogue and Interactive Systems", "label": 4, "url": "https://www.semanticscholar.org/reader/bca8503558471f0467e39eb2508ff11601ad9169?experiments=&features=reader_skimming%3Atrue"}, {"loc": [1.757055401802063, 9.10567855834961], "id": 1285, "title": "Wider & Closer: Mixture of Short-channel Distillers for Zero-shot Cross-lingual Named Entity Recognition", "authors": "Jun-Yu Ma, Beiduo Chen, Jia-Chen Gu, Zhenhua Ling, Wu Guo, Quan Liu, Zhigang Chen and Cong Liu", "abstract": "Zero-shot cross-lingual named entity recognition (NER) aims at transferring knowledge from annotated and rich-resource data in source languages to unlabeled and lean-resource data in target languages. Existing mainstream methods based on the teacher-student distillation framework ignore the rich and complementary information lying in the intermediate layers of  pre-trained language models, and domain-invariant information is easily lost during transfer. In this study, a mixture of short-channel distillers (MSD) method is proposed to fully interact the rich hierarchical information in the teacher model and to transfer knowledge to the student model sufficiently and efficiently. Concretely, a multi-channel distillation framework is designed for sufficient information transfer by aggregating multiple distillers as a mixture. Besides, an unsupervised method adopting parallel domain adaptation is proposed to shorten the channels between the teacher and student models to preserve domain-invariant features. Experiments on four datasets across nine languages demonstrate that the proposed method achieves new state-of-the-art performance on zero-shot cross-lingual NER and shows great generalization and compatibility across languages and fields.", "track": "Information Extraction", "label": 5, "url": ""}, {"loc": [1.9687765836715698, 5.129182815551758], "id": 1288, "title": "An Efficient Memory-Augmented Transformer for Knowledge-Intensive NLP Tasks", "authors": "Yuxiang Wu, Yu Zhao, Baotian Hu, Pasquale Minervini, Pontus Stenetorp and Sebastian Riedel", "abstract": "Access to external knowledge is essential for many natural language processing tasks, such as question answering and dialogue. Existing methods often rely on a parametric model that stores knowledge in its parameters, or use a retrieval-augmented model that has access to an external knowledge source. Parametric and retrieval-augmented models have complementary strengths in terms of computational efficiency and predictive accuracy. To combine the strength of both approaches, we propose the Efficient Memory-Augmented Transformer (EMAT) \u2013 it encodes external knowledge into a key-value memory and exploits the fast maximum inner product search for memory querying. We also introduce pre-training tasks that allow EMAT to encode informative key-value representations, and to learn an implicit strategy to integrate multiple memory slots into the transformer. Experiments on various knowledge-intensive tasks such as question answering and dialogue datasets show that, simply augmenting parametric models (T5-base) using our method produces more accurate results (e.g., 25.8 \u2192 44.3 EM on NQ) while retaining a high throughput (e.g., 1000 queries/s on NQ). Compared to retrieval-augmented models, EMAT runs substantially faster across the board and produces more accurate results on WoW and ELI5.", "track": "Efficient Methods for NLP", "label": 12, "url": ""}, {"loc": [6.504973888397217, 11.903962135314941], "id": 1299, "title": "Supervised Prototypical Contrastive Learning for Emotion Recognition in Conversation", "authors": "Xiaohui Song, Longtao Huang, Hui Xue and Songlin Hu", "abstract": "Capturing emotions within a conversation plays an essential role in modern dialogue systems. However, the weak correlation between emotions and semantics brings many challenges to emotion recognition in conversation (ERC). Even semantically similar utterances, the emotion may vary drastically depending on contexts or speakers. In this paper, we propose a Supervised Prototypical Contrastive Learning (SPCL) loss for the ERC task. Leveraging the Prototypical Network, the SPCL targets at solving the imbalanced classification problem through contrastive learning and does not require a large batch size. Meanwhile, we design a difficulty measure function based on the distance between classes and introduce curriculum learning to alleviate the impact of extreme samples. We achieve state-of-the-art results on three widely used benchmarks. Further, we conduct analytical experiments to demonstrate the effectiveness of our proposed SPCL and curriculum learning strategy.", "track": "Dialogue and Interactive Systems", "label": 4, "url": "https://www.semanticscholar.org/reader/23e59e22a4e028a519da1c44b5c9f16a41c187da?experiments=&features=reader_skimming%3Atrue"}, {"loc": [6.958658695220947, 6.0187602043151855], "id": 1314, "title": "RuCoLA: Russian Corpus of Linguistic Acceptability", "authors": "Vladislav Mikhailov, Tatiana Shamardina, Max Ryabinin, Alena Pestova, Ivan Smurov and Ekaterina Artemova", "abstract": "Linguistic acceptability (LA) attracts the attention of the research community due to its many uses, such as testing the grammatical knowledge of language models and filtering implausible texts with acceptability classifiers.\nHowever, the application scope of LA in languages other than English is limited due to the lack of high-quality resources.\nTo this end, we introduce the Russian Corpus of Linguistic Acceptability (RuCoLA), built from the ground up under the well-established binary LA approach. \nRuCoLA consists of 9.8k in-domain sentences from linguistic publications and 3.6k out-of-domain sentences produced by generative models. The out-of-domain set is created to facilitate the practical use of acceptability for improving language generation.\nOur paper describes the data collection protocol and presents a fine-grained analysis of acceptability classification experiments with a range of baseline approaches.\nIn particular, we demonstrate that the most widely used language models still fall behind humans by a large margin, especially when detecting morphological and semantic errors. We release RuCoLA, the code of experiments, and a public leaderboard to assess the linguistic competence of language models for Russian.", "track": "Resources and Evaluation", "label": 1, "url": "https://www.semanticscholar.org/reader/7c5ee8a1d360429dccf923c3e69bae1347c0106a?experiments=&features=reader_skimming%3Atrue"}, {"loc": [0.47761020064353943, 7.118537425994873], "id": 1315, "title": "Complex Hyperbolic Knowledge Graph Embeddings with Fast Fourier Transform", "authors": "Huiru Xiao, Xin Liu, Yangqiu Song, Ginny Y. Wong and Simon See", "abstract": "The choice of geometric space for knowledge graph (KG) embeddings can have significant effects on the performance of KG completion tasks. The hyperbolic geometry has been shown to capture the hierarchical patterns due to its tree-like metrics, which addressed the limitations of the Euclidean embedding models. Recent explorations of the complex hyperbolic geometry further improved the hyperbolic embeddings for capturing a variety of hierarchical structures. However, the performance of the hyperbolic KG embedding models for non-transitive relations is still unpromising, while the complex hyperbolic embeddings do not deal with multi-relations. This paper aims to utilize the representation capacity of the complex hyperbolic geometry in multi-relational KG embeddings. To apply the geometric transformations which account for different relations and the attention mechanism in the complex hyperbolic space, we propose to use the fast Fourier transform (FFT) as the conversion between the real and complex hyperbolic space. Constructing the attention-based transformations in the complex space is very challenging, while the proposed Fourier transform-based complex hyperbolic approaches provide a simple and effective solution. Experimental results show that our methods outperform the baselines, including the Euclidean and the real hyperbolic embedding models.", "track": "Machine Learning for NLP", "label": 3, "url": "https://www.semanticscholar.org/reader/8bca1f851579df9a309102063fee3bae2486d4c0?experiments=&features=reader_skimming%3Atrue"}, {"loc": [1.597752571105957, 5.320528507232666], "id": 1331, "title": "Towards Knowledge-Intensive Text-to-SQL Semantic Parsing with Formulaic Knowledge", "authors": "Longxu Dou, Yan Gao, Xuqi Liu, Mingyang Pan, Dingzirui Wang, Wanxiang Che, Dechen Zhan, Min-Yen Kan and Jian-Guang LOU", "abstract": "In this paper, we study the problem of knowledge-intensive text-to-SQL, in which domain knowledge is necessary to parse expert questions into SQL queries over domain-specific tables.  We formalize this scenario by building a new benchmark KnowSQL consisting of domain-specific questions covering various domains. We then address this problem by representing formulaic knowledge rather than by annotating additional data examples. More concretely,  we construct a formulaic knowledge bank as a domain knowledge base and propose a framework (ReGrouP) to leverage this formulaic knowledge during parsing. Experiments using ReGrouP demonstrate a significant 28.2% improvement overall on KnowSQL.", "track": "Resources and Evaluation", "label": 1, "url": ""}, {"loc": [6.13363790512085, 5.944369792938232], "id": 1332, "title": "Should We Ban English NLP for a Year?", "authors": "Anders S\u00f8gaard", "abstract": "Around two thirds of NLP research at top venues is devoted exclusively to developing technology for speakers of English, most speech data comes from young urban speakers, and most texts used to train language models come from male writers. These biases feed into consumer technologies to widen existing inequality gaps, \nnot only within, but also across, societies. Many have argued that it is almost impossible to mitigate inequality amplification. I argue that, on the contrary, it is quite simple to do so, and that counter-measures would have little-to-no negative impact, except for, perhaps, in the very short term.", "track": "Ethics", "label": 21, "url": ""}, {"loc": [2.7405519485473633, 4.682299613952637], "id": 1341, "title": "LittleBird: Efficient Faster & Longer Transformer for Question Answering", "authors": "Minchul Lee, Kijong Han and Myeong Cheol Shin", "abstract": "BERT has shown a lot of sucess in a wide variety of NLP tasks. But it has a limitation dealing with long inputs due to its attention mechanism. Longformer, ETC and BigBird addressed this issue and effectively solved the quadratic dependency problem.\nHowever we find that these models are not sufficient, and propose LittleBird, a novel model based on BigBird with improved speed and memory footprint while maintaining accuracy.\nIn particular, we devise a more flexible and efficient position representation method based on Attention with Linear Biases(ALiBi). We also show that replacing the method of global information represented in the BigBird with pack and unpack attention is more effective.\nThe proposed model can work on long inputs even after being pre-trained on short inputs, and can be trained efficiently reusing existing pre-trained language model for short inputs. This is a significant benefit for low-resource languages where large amounts of long text data are difficult to obtain.\nAs a result, our experiments show that LittleBird works very well in a variety of languages, achieving high performance in question answering tasks, particularly in KorQuAD2.0, Korean Question Answering Dataset for long paragraphs.", "track": "Efficient Methods for NLP", "label": 12, "url": "https://www.semanticscholar.org/reader/224cbd14ef4865f50f6bc6b09057c84939812e2d?experiments=&features=reader_skimming%3Atrue"}, {"loc": [10.774970054626465, 7.004262447357178], "id": 1353, "title": "WeTS: A Benchmark for Translation Suggestion", "authors": "Zhen Yang, Fandong Meng, Yingxue Zhang, Ernan Li and Jie Zhou", "abstract": "Translation suggestion (TS), which provides alternatives for specific words or phrases given the entire documents generated by machine translation (MT), has been proven to play a significant role in post-editing (PE). There are two main pitfalls for existing researches in this line. First, most conventional works only focus on the overall performance of PE but ignore the exact performance of TS, which makes the progress of PE sluggish and less explainable; Second, as no publicly available golden dataset exists to support in-depth research for TS, almost all of the previous works conduct experiments on their in-house datasets or the noisy datasets built automatically, which makes their experiments hard to be reproduced and compared. To break these limitations mentioned above and spur the research in TS,  we create a benchmark dataset, called \\emph{WeTS}, which is a golden corpus annotated by expert translators on four translation directions. Apart from the golden corpus, we also propose several methods to generate synthetic corpora which can be used to improve the performance substantially through pre-training. As for the model, we propose the segment-aware self-attention based Transformer for TS. Experimental results show that our approach achieves the best results on all four directions, including English-to-German, German-to-English, Chinese-to-English, and English-to-Chinese.\\footnote{For reviewers, codes and corpus can be found in the attached files, and we will make them publicly available after the double-blind phase.}", "track": "Machine Translation", "label": 10, "url": "https://www.semanticscholar.org/reader/e88243bbf0494313556410e7f03058c95f2ddbe2?experiments=&features=reader_skimming%3Atrue"}, {"loc": [10.105525970458984, 7.711192607879639], "id": 1361, "title": "Discrete Cross-Modal Alignment Enables Zero-Shot Speech Translation", "authors": "Chen Wang, Yuchen Liu, Boxing Chen, Jiajun Zhang, Wei Luo, Zhongqiang Huang and Chengqing Zong", "abstract": "End-to-end Speech Translation (ST) aims at translating the source language speech into target language text without generating the intermediate transcriptions. However, the training of end-to-end methods relies on parallel ST data, which are difficult and expensive to obtain.  Fortunately, the supervised data for automatic speech recognition (ASR) and machine translation (MT) are usually more accessible, making zero-shot speech translation a potential direction. Existing zero-shot methods fail to align the two modalities of speech and text into a shared semantic space, resulting in much worse performance compared to the supervised ST methods. In order to enable zero-shot ST, we propose a novel Discrete Cross-Modal Alignment (DCMA) method that employs a shared discrete vocabulary space to accommodate and match both modalities of speech and text. Specifically, we introduce a vector quantization module to discretize the continuous representations of speech and text into a finite set of virtual tokens, and use ASR data to map corresponding speech and text to the same virtual token in a shared codebook. This way, source language speech can be embedded in the same semantic space as the source language text, which can be then transformed into target language text with an MT module. Experiments on multiple language pairs demonstrate that our zero-shot ST method significantly improves the SOTA, and even performers on par with the strong supervised ST baselines.", "track": "Speech, Vision, Robotics, Multimodal Grounding", "label": 7, "url": "https://www.semanticscholar.org/reader/8abd7cd18b2d7ca06fd0a15393c8bc87490a03fa?experiments=&features=reader_skimming%3Atrue"}, {"loc": [3.801358699798584, 10.016355514526367], "id": 1363, "title": "Abstractive Summarization Guided by Latent Hierarchical Document Structure", "authors": "Yifu Qiu and Shay B. Cohen", "abstract": "Sequential abstractive neural summarizers often do not use the underlying structure in the input article or dependencies between the input sentences. This structure is essential to integrate and consolidate information from different parts of the text. To address this shortcoming, we propose a hierarchy-aware graph neural network (HierGNN) which captures such dependencies through three main steps: 1) learning a hierarchical document structure through a latent structure tree learned by a sparse matrix-tree computation; 2) propagating sentence information over this structure using a novel message-passing node propagation mechanism to identify salient information; 3) using graph-level attention to concentrate the decoder on salient information. Experiments confirm HierGNN improves strong sequence models such as BART, with a 0.55 and 0.75 margin in average ROUGE-1/2/L for CNN/DM and XSum. Further human evaluation demonstrates that summaries produced by our model are more relevant and less redundant than the baselines, into which HierGNN is incorporated. We also find HierGNN synthesizes summaries by fusing multiple source sentences more, rather than compressing a single source sentence, and that it processes long inputs more effectively.", "track": "Summarization", "label": 14, "url": "https://www.semanticscholar.org/reader/65cd44ea9086fd33c1916f94cb6eb34da66e8cf2?experiments=&features=reader_skimming%3Atrue"}, {"loc": [4.096625804901123, 4.348830223083496], "id": 1364, "title": "Explainable Question Answering based on Semantic Graph by Global Differentiable Learning and Dynamic Adaptive Reasoning", "authors": "Jianguo Mao, Wenbin Jiang, Xiangdong Wang, Hong Liu, Yu Xia, Yajuan Lyu and QiaoQiao She", "abstract": "Multi-hop Question Answering is an agent task for testing the reasoning ability. With the development of pre-trained models, the implicit reasoning ability has been surprisingly improved and can even surpass human performance. However, the nature of the black box hinders the construction of explainable intelligent systems. Several researchers have explored explainable neural-symbolic reasoning methods based on question decomposition techniques. The undifferentiable symbolic operations and the error propagation in the reasoning process lead to poor performance. To alleviate it, we propose a simple yet effective Global Differentiable Learning strategy to explore optimal reasoning paths from the latent probability space so that the model learns to solve intermediate reasoning processes without expert annotations. We further design a Dynamic Adaptive Reasoner to enhance the generalization of unseen questions. Our method achieves 17% improvements in F1-score against BreakRC and shows better interpretability. We take a step forward in building interpretable reasoning methods.", "track": "Question Answering", "label": 11, "url": ""}, {"loc": [2.132932186126709, 4.059805393218994], "id": 1368, "title": "DuReader-Retrieval: A Large-scale Chinese Benchmark for Passage Retrieval from Web Search Engine", "authors": "Yifu Qiu, Hongyu Li, Yingqi Qu, Ying Chen, QiaoQiao She, Jing Liu, Hua Wu and Haifeng Wang", "abstract": "In this paper, we present DuReader-retrieval, a large-scale Chinese dataset for passage retrieval. DuReader-retrieval contains more than 90K queries and over 8M unique passages from a commercial search engine. To alleviate the shortcomings of other datasets and ensure the quality of our benchmark, we (1) reduce the false negatives in development and test sets by manually annotating results pooled from multiple retrievers, and (2) remove the training queries that are semantically similar to the development and testing queries. Additionally, we provide two out-of-domain testing sets for cross-domain evaluation, as well as a set of human translated queries for for cross-lingual retrieval evaluation. The experiments demonstrate that DuReader-retrieval is challenging and a number of problems remain unsolved, such as the salient phrase mismatch and the syntactic mismatch between queries and paragraphs. These experiments also show that dense retrievers do not generalize well across domains, and cross-lingual retrieval is essentially challenging. DuReader-retrieval is publicly available at https://github.com/baidu/DuReader/tree/master/DuReader-Retrieval.", "track": "Information Retrieval and Text Mining", "label": 15, "url": "https://www.semanticscholar.org/reader/7a54248d35448e1c95743373ddbb9170ad7c039a?experiments=&features=reader_skimming%3Atrue"}, {"loc": [0.6319910287857056, 7.908598899841309], "id": 1383, "title": "Pair-Based Joint Encoding with Relational Graph Convolutional Networks for Emotion-Cause Pair Extraction", "authors": "Junlong Liu, Xichen Shang and Qianli Ma", "abstract": "Emotion-cause pair extraction (ECPE) aims to extract emotion clauses and corresponding cause clauses, which have recently received growing attention. Previous methods sequentially encode features with a specified order. They first encode the emotion and cause features for clause extraction and then combine them for pair extraction. This lead to an imbalance in inter-task feature interaction where features extracted later have no direct contact with the former. To address this issue, we propose a novel **P**air-**B**ased **J**oint **E**ncoding (**PBJE**) network, which generates pairs and clauses features simultaneously in a joint feature encoding manner to model the causal relationship in clauses. PBJE can balance the information flow among emotion clauses, cause clauses and pairs. From a multi-relational perspective, we construct a heterogeneous undirected graph and apply the Relational Graph Convolutional Network (RGCN) to capture the multiplex relationship between clauses and the relationship between pairs and clauses. Experimental results show that PBJE achieves state-of-the-art performance on the Chinese benchmark corpus.", "track": "Sentiment Analysis, Stylistic Analysis, and Argument Mining", "label": 16, "url": ""}, {"loc": [1.0410996675491333, 10.52194595336914], "id": 1385, "title": "Affective Knowledge Enhanced Multiple-Graph Fusion Networks for Aspect-based Sentiment Analysis", "authors": "Siyu Tang, Heyan Chai, Ziyi Yao, Ye Ding, Cuiyun Gao, Binxing Fang and Qing Liao", "abstract": "Aspect-based sentiment analysis aims to identify sentiment polarity of social media users toward different aspects. Most recent methods adopt the aspect-centric latent tree to connect aspects and their corresponding opinion words, thinking that would facilitate establishing the relationship between aspects and opinion words.\nHowever, these methods ignore the roles of syntax dependency relation labels and affective semantic information in determining the sentiment polarity, resulting in the wrong prediction.\nIn this paper, we propose a novel multi-graph fusion network (MGFN) based on latent graph to leverage the richer syntax dependency relation label information and affective semantic information of words.\nSpecifically, we construct a novel syntax-aware latent graph (SaLG) to fully leverage the syntax dependency relation label information to facilitate the learning of sentiment representations. Subsequently, a multi-graph fusion module is proposed to fuse semantic information of surrounding contexts of aspects adaptively. Furthermore, we design an affective refinement strategy to guide the MGFN to capture significant affective clues. \nExtensive experiments on three datasets demonstrate that our MGFN model outperforms all state-of-the-art methods and verify the effectiveness of our model.", "track": "NLP Applications", "label": 0, "url": ""}, {"loc": [5.338454246520996, 8.778501510620117], "id": 1391, "title": "IndicNLG Benchmark: Multilingual Datasets for Diverse NLG Tasks in Indic Languages", "authors": "Aman Mr. Kumar, Himani Shrotriya, Prachi Sahu, Amogh Mishra, Raj Dabre, Ratish Puduppully, Anoop Kunchukuttan, Mitesh M. Khapra and Pratyush Kumar", "abstract": "Natural Language Generation (NLG) for non-English languages is hampered by the scarcity of datasets in these languages. We present the IndicNLG Benchmark, a collection of datasets for benchmarking NLG for 11 Indic languages. We focus on five diverse tasks, namely, biography generation using Wikipedia infoboxes, news headline generation, sentence summarization, paraphrase generation and, question generation. We describe the created datasets and use them to benchmark the performance of several monolingual and multilingual baselines that leverage pre-trained sequence-to-sequence models. Our results exhibit the strong performance of multilingual language-specific pre-trained models, and the utility of models trained on our dataset for other related NLG tasks. Our dataset creation methods can be easily applied to modest-resource languages as they involve simple steps such as scraping news articles and Wikipedia infoboxes, light cleaning, and pivoting through machine translation data. To the best of our knowledge, the IndicNLG Benchmark is the first NLG benchmark for Indic languages and the most diverse multilingual NLG dataset, with approximately 8M examples across 5 tasks and 11 languages. The datasets and models will be publicly available.", "track": "Natural Language Generation", "label": 6, "url": ""}, {"loc": [10.711258888244629, 6.9316020011901855], "id": 1400, "title": "Improving Machine Translation with Phrase Pair Injection and Corpus Filtering", "authors": "Akshay Batheja and Pushpak Bhattacharyya", "abstract": "In this paper, we show that the combination of Phrase Pair Injection and Corpus Filtering boosts the performance of Neural Machine Translation (NMT) systems. We extract parallel phrases and sentences from the pseudo-parallel corpus and augment it with the parallel corpus to train the NMT models. With the proposed approach, we observe an improvement in the Machine Translation (MT) system for 3 low-resource language pairs, Hindi-Marathi, English-Marathi, and English-Pashto, and 6 translation directions by up to 2.7 BLEU points, on the FLORES test data. These BLEU score improvements are over the models trained using the whole pseudo-parallel corpus augmented with the parallel corpus.", "track": "Machine Translation", "label": 10, "url": ""}, {"loc": [5.844703674316406, 12.000345230102539], "id": 1405, "title": "An Anchor-based Relative Position Embedding Method for Cross-Modal Tasks", "authors": "Ya Wang, Xingwu Sun, Lian Fengzong, ZhanHui Kang and Chengzhong Xu Xu", "abstract": "Position Embedding (PE) is essential for transformer to capture the sequence ordering of input tokens. Despite its general effectiveness verified in Natural Language Processing (NLP) and Computer Vision (CV), its application in cross-modal tasks remains unexplored and suffers from two challenges: 1) the input text tokens and image patches are not aligned, 2) the encoding space of each modality is different, making it unavailable for feature comparison.  In this paper, we propose a unified position embedding method for these problems, called AnChor-basEd Relative Position Embedding (ACE-RPE), in which we first introduce an anchor locating mechanism to bridge the semantic gap and locate anchors from different modalities. Then we conduct the distance calculation of each text token and image patch by computing their shortest paths from the located anchors. Last, we embed the anchor-based distance to guide the computation of cross-attention. In this way, it calculates cross-modal relative position embedding for cross-modal transformer. Benefiting from ACE-RPE, our method obtains new SOTA results on a wide range of benchmarks, such as Image-Text Retrieval on MS-COCO and Flickr30K, Visual Entailment on SNLI-VE, Visual Reasoning on NLVR2 and Weakly-supervised Visual Grounding on RefCOCO+.", "track": "Speech, Vision, Robotics, Multimodal Grounding", "label": 7, "url": ""}, {"loc": [10.820908546447754, 6.834684371948242], "id": 1413, "title": "Norm-based Noisy Corpora Filtering and Refurbishing in Neural Machine Translation", "authors": "Yu Lu and Jiajun Zhang", "abstract": "Recent advances in neural machine translation depend on massive parallel corpora, which are collected from any open source without much guarantee of quality. It stresses the need for noisy corpora filtering, but existing methods are insufficient to solve this issue. They spend much time ensembling multiple scorers trained on clean bitexts, unavailable for low-resource languages in practice. In this paper, we propose a norm-based noisy corpora filtering and refurbishing method with no external data and costly scorers. The noisy and clean samples are separated based on how much information from the source and target sides the model requires to fit the given translation. For the unparallel sentence, the target-side history translation is much more important than the source context, contrary to the parallel ones. The amount of these two information flows can be measured by norms of source-/target-side context vectors. Moreover, we propose to reuse the discovered noisy data by generating pseudo labels via online knowledge distillation. Extensive experiments show that our proposed filtering method performs comparably with state-of-the-art noisy corpora filtering techniques but is more efficient and easier to operate. Noisy sample refurbishing further enhances the performance by making the most of the given data.", "track": "Machine Translation", "label": 10, "url": ""}, {"loc": [5.11588716506958, 8.898054122924805], "id": 1427, "title": "TeleMelody: Lyric-to-Melody Generation with a Template-Based Two-Stage Method", "authors": "Zeqian Ju, Peiling Lu, Xu Tan, Rui Wang, Chen Zhang, Songruoyao Wu, Kejun Zhang, Xiang-Yang Li, Tao Qin and Tie-Yan Liu", "abstract": "Lyric-to-melody generation is an important task in automatic songwriting. Previous lyric-to-melody generation systems usually adopt end-to-end models that directly generate melodies from lyrics, which suffer from several issues: 1) lack of paired lyric-melody training data; 2) lack of control on generated melodies. In this paper, we develop TeleMelody, a two-stage lyric-to-melody generation system with music template (e.g., tonality, chord progression, rhythm pattern, and cadence) to bridge the gap between lyrics and melodies (i.e., the system consists of a lyric-to-template module and a template-to-melody module). TeleMelody has two advantages. First, it is data efficient. The template-to-melody module is trained in a self-supervised way (i.e., the source template is extracted from the target melody) that does not need any lyric-melody paired data. The lyric-to-template module is made up of some rules and a lyric-to-rhythm model, which is trained with paired lyric-rhythm data that is easier to obtain than paired lyric-melody data. Second, it is controllable. The design of the template ensures that the generated melodies can be controlled by adjusting the musical elements in the template. Both subjective and objective experimental evaluations demonstrate that TeleMelody generates melodies with higher quality, better controllability, and less requirement on paired lyric-melody data than previous generation systems.", "track": "NLP Applications", "label": 0, "url": "https://www.semanticscholar.org/reader/e3c24c9e282f67fd77882bb0b55158023aaef59c?experiments=&features=reader_skimming%3Atrue"}, {"loc": [2.2984049320220947, 7.347108364105225], "id": 1429, "title": "SEEN: Structured Event Enhancement Network for Explainable Need Detection of Information Recall Assistance", "authors": "You-En Lin, An-Zi Yen, Hen-Hsen Huang and Hsin-Hsi Chen", "abstract": "When recalling life experiences, people often forget or confuse life events, which necessitates information recall services. Previous work on information recall focuses on providing such assistance reactively, i.e., by retrieving the life event of a given query. Proactively detecting the need for information recall services is rarely discussed. In this paper, we use a human-annotated life experience retelling dataset to detect the right time to trigger the information recall service. We propose a pilot model\u2014structured event enhancement network (SEEN) that detects life event inconsistency, additional information in life events, and forgotten events. A fusing mechanism is also proposed to incorporate event graphs of stories and enhance the textual representations. To explain the need detection results, SEEN simultaneously provides support evidence by selecting the related nodes from the event graph. Experimental results show that SEEN achieves promising performance in detecting information needs. In addition, the extracted evidence can be served as complementary information to remind users what events they may want to recall.", "track": "NLP Applications", "label": 0, "url": ""}, {"loc": [5.914653301239014, 9.159542083740234], "id": 1449, "title": "Rethinking Style Transformer with Energy-based Interpretation: Adversarial Unsupervised Style Transfer using a Pretrained Model", "authors": "Hojun Cho, Dohee Kim, Seungwoo Ryu, ChaeHun Park, Hyungjong Noh, Jeong-in Hwang, Minseok Choi, Edward Choi and Jaegul Choo", "abstract": "Style control, content preservation, and fluency determine the quality of text style transfer models. To train on a nonparallel corpus, several existing approaches aim to deceive the style discriminator with an adversarial loss. However, adversarial training significantly degrades fluency compared to the other two metrics. In this work, we explain this phenomenon using energy-based interpretation, and leverage a pretrained language model to improve fluency. Specifically, we propose a novel approach which applies the pretrained language model to the text style transfer framework by restructuring the discriminator and the model itself, allowing the generator and the discriminator to also take advantage of the power of the pretrained model. We evaluated our model on three public benchmarks GYAFC, Amazon, and Yelp and achieved state-of-the-art performance on the overall metrics.", "track": "Unsupervised and Weakly-Supervised Methods in NLP", "label": 17, "url": ""}, {"loc": [10.497294425964355, 7.165591239929199], "id": 1454, "title": "Towards Robust k-Nearest-Neighbor Machine Translation", "authors": "Hui Jiang, Ziyao Lu, Fandong Meng, Chulun Zhou, Jie Zhou, Degen Huang and Jinsong Su", "abstract": "k-Nearest-Neighbor Machine Translation (kNN-MT) becomes an important research direction of NMT in recent years. Its main idea is to retrieve useful key-value pairs from an additional datastore to modify translations without updating the NMT model. However, the underlying retrieved noisy pairs will dramatically deteriorate the model performance. In this paper, we conduct a preliminary study and find that this problem results from not fully exploiting the prediction of the NMT model. To alleviate the impact of noise, we propose a confidence-enhanced kNN-MT model with robust training. Concretely, we introduce the NMT confidence to refine the modeling of two important components of kNN-MT: kNN distribution and the interpolation weight. Meanwhile we inject two types of perturbations into the retrieved pairs for robust training. Experimental results on four benchmark datasets demonstrate that our model not only achieves significant improvements over current kNN-MT models, but also exhibits better robustness. Our code is available at https://github.com/DeepLearnXMU/Robust-knn-mt.", "track": "Machine Translation", "label": 10, "url": "https://www.semanticscholar.org/reader/4d8db2305e2d764205fccbae4122329cd1ecc89f?experiments=&features=reader_skimming%3Atrue"}, {"loc": [2.9545516967773438, 6.068011283874512], "id": 1456, "title": "Tiny-NewsRec: Effective and Efficient PLM-based News Recommendation", "authors": "Yang Yu, Fangzhao Wu, Chuhan Wu, Jingwei Yi and Qi Liu", "abstract": "News recommendation is a widely adopted technique to provide personalized news feeds for the user. Recently, pre-trained language models (PLMs) have demonstrated the great capability of natural language understanding and benefited news recommendation via improving news modeling. However, most existing works simply finetune the PLM with the news recommendation task, which may suffer from the known domain shift problem between the pre-training corpus and downstream news texts. Moreover, PLMs usually contain a large volume of parameters and have high computational overhead, which imposes a great burden on low-latency online services. In this paper, we propose Tiny-NewsRec, which can improve both the effectiveness and the efficiency of PLM-based news recommendation. We first design a self-supervised domain-specific post-training method to better adapt the general PLM to the news domain with a contrastive matching task between news titles and news bodies. We further propose a two-stage knowledge distillation method to improve the efficiency of the large PLM-based news recommendation model while maintaining its performance. Multiple teacher models originated from different time steps of our post-training procedure are used to transfer comprehensive knowledge to the student model in both its post-training stage and finetuning stage. Extensive experiments on two real-world datasets validate the effectiveness and efficiency of our method.", "track": "NLP Applications", "label": 0, "url": "https://www.semanticscholar.org/reader/ef6df260a92d903e06db6a7e7cfff302b03dd15d?experiments=&features=reader_skimming%3Atrue"}, {"loc": [7.633563995361328, 3.6134538650512695], "id": 1461, "title": "TABS: Efficient Textual Adversarial Attack for Pre-trained NL Code Model Using Semantic Beam Search", "authors": "YunSeok Choi, Hyojun Kim and Jee-Hyong Lee", "abstract": "As pre-trained models have shown successful performance in program language processing as well as natural language processing, adversarial attacks on these models also attract attention.\nHowever, previous works on black-box adversarial attacks generated adversarial examples in a very inefficient way with simple greedy search. \nThey also failed to find out better adversarial examples because it was hard to reduce the search space without performance loss.\nIn this paper, we propose TABS, an efficient beam search black-box adversarial attack method. \nWe adopt beam search to find out better adversarial examples, and contextual semantic filtering to effectively reduce the search space. \nContextual semantic filtering reduces the number of candidate adversarial words considering the surrounding context and the semantic similarity.\nOur proposed method shows good performance in terms of attack success rate, the number of queries, and semantic similarity in attacking models for two tasks: NL code search classification and retrieval tasks.", "track": "Natural Language Generation", "label": 6, "url": ""}, {"loc": [4.664431095123291, 4.674422264099121], "id": 1464, "title": "Investigating the Robustness of Natural Language Generation from Logical Forms via Counterfactual Samples", "authors": "Chengyuan Liu, Leilei Gan, Kun Kuang and Fei Wu", "abstract": "The aim of Logic2Text is to generate controllable and faithful texts conditioned on tables and logical forms, which not only requires a deep understanding of the tables and logical forms, but also warrants symbolic reasoning over the tables according to the logical forms. State-of-the-art methods based on pre-trained models have achieved remarkable performance on the standard test dataset. However, we question whether these methods really learn how to perform logical reasoning, rather than just relying on the spurious correlations between the headers of the tables and operators of the logical form. To verify this hypothesis, we manually construct a set of counterfactual samples, which modify the original logical forms to generate counterfactual logical forms with rare co-occurred headers and operators and corresponding counterfactual references. SOTA methods give much worse results on these counterfactual samples compared with the results on the original test dataset, which verifies our hypothesis. To deal with this problem, we firstly analyze this bias from a causal perspective, based on which we propose two approaches to reduce the model's reliance on the shortcut. The first one incorporates the hierarchical structure of the logical forms into the model. The second one exploits automatically generated counterfactual data for training. Automatic and manual experimental results on the original test dataset and counterfactual dataset show that our method is effective to alleviate the spurious correlation. Our work points out the weakness of current methods and takes a further step toward developing Logic2Text models with real logical reasoning ability.", "track": "Natural Language Generation", "label": 6, "url": "https://www.semanticscholar.org/reader/eaeed0144d6a8000638c884f38d2d1e046aaa400?experiments=&features=reader_skimming%3Atrue"}, {"loc": [10.582795143127441, 7.6640706062316895], "id": 1482, "title": "Helping the Weak Makes You Strong: Simple Multi-Task Learning Improves Non-Autoregressive Translators", "authors": "Xinyou Wang, Zaixiang Zheng and Shujian Huang", "abstract": "Recently, non-autoregressive (NAR) neural machine translation models have received increasing attention due to their efficient parallel decoding.\nHowever, the probabilistic framework of NAR models necessitates conditional independence assumption on target sequences, falling short of characterizing human language data.\nThis drawback results in less informative learning signals for NAR models under conventional MLE training, thereby yielding unsatisfactory accuracy compared to their autoregressive (AR) counterparts.\nIn this paper, we propose a simple and model-agnostic multi-task learning framework to provide more informative learning signals.\nDuring training stage, we introduce a set of sufficiently weak AR decoders that solely rely on the information provided by NAR decoder to make prediction, forcing the NAR decoder to become stronger or else it will be unable to support its weak AR partners.\nExperiments on WMT and IWSLT datasets show that our approach can consistently improve accuracy of multiple NAR baselines without adding any additional decoding overhead.", "track": "Machine Translation", "label": 10, "url": "https://www.semanticscholar.org/reader/921d43718376fb4e000bba8690e07b168d5f9093?experiments=&features=reader_skimming%3Atrue"}, {"loc": [6.490644454956055, 1.888877034187317], "id": 1483, "title": "RACE: Retrieval-augmented Commit Message Generation", "authors": "Ensheng Shi, Yanlin Wang, Wei Tao, Lun Du, hongyu Zhang, Shi Han, Dongmei Zhang and Hongbin Sun", "abstract": "Commit messages are important for software development and maintenance. Many neural network-based approaches have been proposed and shown promising results on automatic commit message generation. However, the generated commit messages could be repetitive or redundant. In this paper, we propose RACE, a new retrieval-augmented neural commit message generation method, which treats the retrieved similar commit as an exemplar and leverages it to generate an accurate commit message. As the retrieved commit message may not always accurately describe the content/intent of the current code diff, we also propose an exemplar guider, which learns the semantic similarity between the retrieved and current code diff and then guides the generation of commit message based on the similarity. We conduct extensive experiments on a large public dataset with five programming languages. Experimental results show that RACE can outperform all baselines. Furthermore, RACE can boost the performance of existing Seq2Seq models in commit message generation.", "track": "Summarization", "label": 14, "url": "https://www.semanticscholar.org/reader/4a26009d4ffaad428eb5cc8749510bf64fcc0cd1?experiments=&features=reader_skimming%3Atrue"}, {"loc": [4.323120594024658, 4.855645656585693], "id": 1487, "title": "PLOG: Table-to-Logic Pretraining for Logical Table-to-Text Generation", "authors": "Ao Liu, Haoyu Dong, Naoaki Okazaki, Shi Han and Dongmei Zhang", "abstract": "Logical table-to-text generation is a task that involves generating logically faithful sentences from tables, which requires models to derive logical-level facts from table records via logical inference. It raises a new challenge on the logical-level content planning of table-to-text models. However, directly learning the logical inference knowledge from table-text pairs is very difficult for neural models because of the ambiguity of natural language and the scarcity of parallel data. Hence even large-scale pre-trained language models present low logical fidelity on logical table-to-text. In this work, we propose a Pretrained Logical Form Generator (PLOG) framework to improve generation fidelity. Specifically, PLOG is first pretrained on a table-to-logical-form generation (table-to-logic) task, then finetuned on downstream table-to-text tasks. The logical forms are formally defined with unambiguous semantics. Hence we can collect a large amount of accurate logical forms from tables without human annotation. In addition, PLOG can learn logical inference from table-logic pairs much more reliably than from table-text pairs. To evaluate our model, we further collect a controlled logical table-to-text dataset CONTLOG based on an existing dataset. On two benchmarks, LOGICNLG and CONTLOG, PLOG outperforms strong baselines by a large margin on the logical fidelity, demonstrating the effectiveness of table-to-logic pretraining.", "track": "Natural Language Generation", "label": 6, "url": "https://www.semanticscholar.org/reader/39e70e5bef45c519b88f1e2cdf6b78435aff7f7e?experiments=&features=reader_skimming%3Atrue"}, {"loc": [5.797091484069824, 11.815139770507812], "id": 1488, "title": "GHAN: Graph-Based Hierarchical Aggregation Network for Text-Video Retrieval", "authors": "Yahan Yu, Bojie Hu and Yu Li", "abstract": "Text-video retrieval focuses on two aspects: cross-modality interaction and video-language encoding. Currently, the mainstream approach is to train a joint embedding space for multimodal interactions. However, there are structural and semantic differences between text and video, making this approach challenging for fine-grained understanding. In order to solve this, we propose an end-to-end graph-based hierarchical aggregation network for text-video retrieval according to the hierarchy possessed by text and video. We design a token-level weighted network to refine intra-modality representations and construct a graph-based message passing attention network for global-local alignment across modality. We conduct experiments on the public datasets MSR-VTT-9K, MSR-VTT-7K and MSVD, and achieve Recall@1 of 73.0\\%, 65.6\\%, and 64.0\\% , which is 25.7\\%, 16.5\\%, and 14.2\\% better than the current state-of-the-art model.", "track": "Speech, Vision, Robotics, Multimodal Grounding", "label": 7, "url": ""}, {"loc": [5.397482872009277, 12.171443939208984], "id": 1503, "title": "MuRAG: Multimodal Retrieval-Augmented Generator for Open Question Answering over Images and Text", "authors": "Wenhu Chen, Hexiang Hu, Xi Chen, Pat Verga and William Cohen", "abstract": "While language Models store a massive amount of world knowledge implicitly in their parameters, even very large models often fail to encode information about rare entities and events, while incurring huge computational costs. Recently, retrieval-augmented models, such as REALM, RAG, and RETRO, have incorporated world knowledge into language generation by leveraging an external non-parametric index and have demonstrated impressive performance with constrained model sizes. However, these methods are restricted to retrieving only textual knowledge, neglecting the ubiquitous amount of knowledge in other modalities like images -- much of which contains information not covered by any text. To address this limitation, we propose the first Multimodal Retrieval-Augmented Transformer (MuRAG), which accesses an external non-parametric multimodal memory to augment language generation. MuRAG is pre-trained with a mixture of large-scale image-text and text-only corpora using a joint contrastive and generative loss. We perform experiments on two different datasets that require retrieving and reasoning over both images and text to answer a given query: WebQA, and MultimodalQA. Our results show that MuRAG achieves state-of-the-art accuracy, outperforming existing models by 10-20\\% absolute on both datasets and under both distractor and full-wiki settings.", "track": "Ethic Concerns:Speech, Vision, Robotics, Multimodal Grounding", "label": 7, "url": "https://www.semanticscholar.org/reader/38b0803b59e4973f09018ce942164b02be4b8bc9?experiments=&features=reader_skimming%3Atrue"}, {"loc": [2.5010602474212646, 8.627835273742676], "id": 1507, "title": "PHEE: A Dataset for Pharmacovigilance Event Extraction from Text", "authors": "Zhaoyue Sun, Jiazheng Li, Gabriele Pergola, Byron C. Wallace, Bino John, Nigel Greene, Joseph Kim and Yulan He", "abstract": "The primary goal of drug safety researchers and regulators is to promptly identify adverse drug reactions. Doing so may in turn prevent or reduce the harm to patients and ultimately improve public health. Evaluating and monitoring drug safety (i.e., pharmacovigilance) involves analyzing an ever growing collection of spontaneous reports from health professionals, physicians, and pharmacists, and information voluntarily submitted by patients. In this scenario, facilitating analysis of such reports via automation has the potential to rapidly identify safety signals. Unfortunately, public resources for developing natural language models for this task are scant. We present PHEE, a novel dataset for pharmacovigilance comprising over 5000 annotated events from medical case reports and biomedical literature, making it the largest such public dataset to date. We describe the hierarchical event schema designed to provide coarse and fine-grained information about patients' demographics, treatments and (side) effects. Along with the discussion of the dataset, we present a thorough experimental evaluation of current state-of-the-art approaches for biomedical event extraction, point out their limitations, and highlight open challenges to foster future research in this area.", "track": "Resources and Evaluation", "label": 1, "url": "https://www.semanticscholar.org/reader/1b2f6cacaa7305df32b8c70ef5c0ecd4db69a825?experiments=&features=reader_skimming%3Atrue"}, {"loc": [7.292745590209961, 9.742696762084961], "id": 1515, "title": "OTSeq2Set: An Optimal Transport Enhanced Sequence-to-Set Model for Extreme Multi-label Text Classification", "authors": "Jie Cao and Yin Zhang", "abstract": "Extreme multi-label text classification (XMTC) is the task of finding the most relevant subset labels from an extremely large-scale label collection. Recently, some deep learning models have achieved state-of-the-art results in XMTC tasks. These models commonly predict scores for all labels by a fully connected layer as the last layer of the model. However, such models can't predict a relatively complete and variable-length label subset for each document, because they select positive labels relevant to the document by a fixed threshold or take top k labels in descending order of scores. A less popular type of deep learning models called sequence-to-sequence (Seq2Seq) focus on predicting variable-length positive labels in sequence style. However, the labels in XMTC tasks are essentially an unordered set rather than an ordered sequence, the default order of labels restrains Seq2Seq models in training. To address this limitation in Seq2Seq, we propose an autoregressive sequence-to-set model for XMTC tasks named OTSeq2Set. Our model generates predictions in student-forcing scheme and is trained by a loss function based on bipartite matching which enables permutation-invariance. Meanwhile, we use the optimal transport distance as a measurement to force the model to focus on the closest labels in semantic label space. Experiments show that OTSeq2Set outperforms other competitive baselines on 4 benchmark datasets. Especially, on the Wikipedia dataset with 31k labels, it outperforms the state-of-the-art Seq2Seq method by 16.34% in micro-F1 score. The code is available at https://github.com/caojie54/OTSeq2Set.", "track": "Information Retrieval and Text Mining", "label": 15, "url": "https://www.semanticscholar.org/reader/1196fc4f84e6e1cd2e17cffd9c28ff4a9ae0d092?experiments=&features=reader_skimming%3Atrue"}, {"loc": [10.728055953979492, 7.013880729675293], "id": 1526, "title": "SimQA: Detecting Simultaneous MT Errors through Word-by-Word Question Answering", "authors": "HyoJung Han, Marine Carpuat and Jordan Boyd-Graber", "abstract": "Detractors of neural machine translation admit that while its translations are fluent, it sometimes gets key facts wrong.\nThis is particularly important in simultaneous interpretation where translations have to be provided as fast as possible: before a sentence is complete.\nYet, evaluations of simultaneous machine translation (SimulMT) fail to capture if systems correctly translate the most salient elements of a question: people, places, and dates.\nTo address this problem, we introduce a downstream word-by-word question answering evaluation task (SimQA): given a source language question, translate the question word by word into the target language word by word, and answer as soon as possible.\nSimQA jointly measures whether the SimulMT models translates the question quickly and accurately, and can reveal shortcomings in existing neural systems\u2014hallucinating or omitting facts.", "track": "Machine Translation", "label": 10, "url": ""}, {"loc": [8.89405345916748, 6.106393814086914], "id": 1533, "title": "Discovering Low-rank Subspaces for Language-agnostic Multilingual Representations", "authors": "Zhihui Xie, Handong Zhao, Tong Yu and Shuai Li", "abstract": "Large pretrained multilingual language models (ML-LMs) have shown remarkable capabilities of zero-shot cross-lingual transfer, without direct cross-lingual supervision. While these results are promising, follow-up works found that, within the multilingual embedding spaces, there exists strong language identity information which hinders the expression of linguistic factors shared across languages. For semantic tasks like cross-lingual sentence retrieval, it is desired to remove such language identity signals to fully leverage semantic information. In this work, we provide a novel view of projecting away language-specific factors from a multilingual embedding space. Specifically, we discover that there exists a low-rank subspace that primarily encodes information irrelevant to semantics (e.g., syntactic information). To identify this subspace, we present a simple but effective unsupervised method based on singular value decomposition with multiple monolingual corpora as input. Once the subspace is found, we can directly project the original embeddings into the null space to boost language agnosticism without finetuning. We systematically evaluate our method on various tasks including the challenging language-agnostic QA retrieval task. Empirical results show that applying our method consistently leads to improvements over commonly used ML-LMs.", "track": "Multilinguality", "label": 13, "url": ""}, {"loc": [7.073671340942383, 4.818701267242432], "id": 1535, "title": "Rethinking the Authorship Verification Experimental Setups", "authors": "Florin Brad, Andrei Manolache, Elena Burceanu, Antonio Barbalau, Radu Tudor Ionescu and Marius Popescu", "abstract": "One of the main drivers of the recent advances in authorship verification is the PAN large-scale authorship dataset. Despite generating significant progress in the field, inconsistent performance differences between the closed and open test sets have been reported. To this end, we improve the experimental setup by proposing five new public splits over the PAN dataset, specifically designed to isolate and identify biases related to the text topic and to the author's writing style. We evaluate several BERT-like baselines on these splits, showing that such models are competitive with authorship verification state-of-the-art methods. Furthermore, using explainable AI, we find that these baselines are biased towards named entities. We show that models trained without the named entities obtain better results and generalize better when tested on DarkReddit, our new dataset for authorship verification.", "track": "Resources and Evaluation", "label": 1, "url": "https://www.semanticscholar.org/reader/9424d98d7805574661da1adf4f8bc682be5714da?experiments=&features=reader_skimming%3Atrue"}, {"loc": [6.403482437133789, 12.260196685791016], "id": 1551, "title": "Borrowing Human Senses: Comment-Aware Self-Training for Social Media Multimodal Classification", "authors": "Chunpu Xu and Jing Li", "abstract": "Social media is daily creating massive multimedia content with paired image and text, presenting the pressing need to automate the vision and language understanding for various multimodal classification tasks. Compared to the commonly researched visual-lingual data, social media posts tend to exhibit more implicit image-text relations. To better glue the cross-modal semantics therein, we capture hinting features from user comments, which are retrieved via jointly leveraging visual and lingual similarity. Afterwards, the classification tasks are explored via self-training in a teacher-student framework, motivated by the usually limited labeled data scales in existing benchmarks. Substantial experiments are conducted on four multimodal social media benchmarks for image-text relation classification, sarcasm detection, sentiment classification, and hate speech detection. The results show that our method further advances the performance of previous state-of-the-art models, which do not employ comment modeling or self-training.", "track": "Computational Social Science and Cultural Analytics", "label": 20, "url": ""}, {"loc": [8.798788070678711, 8.14393138885498], "id": 1552, "title": "Training Language Models with Memory Augmentation", "authors": "Zexuan Zhong, Tao Lei and Danqi Chen", "abstract": "Recent work has improved language models (LMs) remarkably by equipping them with a non-parametric memory component. However, most existing approaches only introduce mem-ories at testing time or represent them using a separately trained encoder, resulting in suboptimal training of the language model. In this work, we present TRIME, a novel yet simple training approach designed for training LMs with memory augmentation. Our approach uses a training objective that directly takes in-batch examples as accessible memory. We also present new methods for memory construction and data batching, which are used for adapting to different sets of memories\u2014local, long-term, and external memory\u2014at testing time. We evaluate TRIME on multiple language modeling and machine translation benchmarks and show that it is able to achieve significant improvements across all the settings. Concretely, TRIME reduces the perplexity from 18.70 to 15.37 on WIKITEXT-103, by effectively leveraging a large memory set from the training corpus. Compared to standard LM training, TRIME adds negligible computational overhead and is compatible with different neural architectures, making it a versatile solution for training memory-augmented LMs.", "track": "Language Modeling and Analysis of Language Models", "label": 2, "url": ""}, {"loc": [7.589925765991211, 12.355353355407715], "id": 1560, "title": "Data-Efficient Strategies for Expanding Hate Speech Detection into Under-Resourced Languages", "authors": "Paul R\u00f6ttger, Debora Nozza, Federico Bianchi and Dirk Hovy", "abstract": "Hate speech is a global phenomenon, but most hate speech datasets so far focus on English-language content. This hinders the development of more effective hate speech detection models in hundreds of languages spoken by billions across the world. More data is needed, but annotating hateful content is expensive, time-consuming and potentially harmful to annotators. To mitigate these issues, we explore data-efficient strategies for expanding hate speech detection into under-resourced languages. In a series of experiments with mono- and multilingual models across five non-English languages, we find that 1) a small amount of target-language fine-tuning data is needed to achieve strong performance, 2) the benefits of using more such data decrease exponentially, and 3) initial fine-tuning on readily-available English data can partially substitute target-language data and improve model generalisability. Based on these findings, we formulate actionable recommendations for hate speech detection in low-resource language settings.", "track": "Multilinguality", "label": 13, "url": "https://www.semanticscholar.org/reader/858dd0478bbc842953bcdddafcc274e3e1059112?experiments=&features=reader_skimming%3Atrue"}, {"loc": [1.7521641254425049, 3.8399999141693115], "id": 1570, "title": "Dimension Reduction for Efficient Dense Retrieval via Conditional Autoencoder", "authors": "Zhenghao Liu, Han Zhang, Chenyan Xiong, Zhiyuan Liu, Yu Gu and Xiaohua Li", "abstract": "Dense retrievers encode queries and documents and map them in an embedding space using pre-trained language models. These embeddings need to be high-dimensional to fit training signals and guarantee the retrieval effectiveness of dense retrievers. However, these high-dimensional embeddings lead to larger index storage and higher retrieval latency. To reduce the embedding dimensions of dense retrieval, this paper proposes a Conditional Autoencoder (ConAE) to compress the high-dimensional embeddings to maintain the same embedding distribution and better recover the ranking features. Our experiments show that ConAE is effective in compressing embeddings by achieving comparable ranking performance with its teacher model and making the retrieval system more efficient. Our further analyses show that ConAE can alleviate the redundancy of the embeddings of dense retrieval with only one linear layer. All codes of this work are available at https://github.com/NEUIR/ConAE.", "track": "Information Retrieval and Text Mining", "label": 15, "url": "https://www.semanticscholar.org/reader/7b520ec107c1b698f14d8d305edd2f7bc8a202c8?experiments=&features=reader_skimming%3Atrue"}, {"loc": [3.7965452671051025, 9.869338989257812], "id": 1584, "title": "Controlled Text Reduction", "authors": "Aviv Slobodkin, Paul Roit, Eran Hirsch, Ori Ernst and Ido Dagan", "abstract": "Producing a reduced version of a source text, as in generic or focused summarization, inherently involves two distinct subtasks: deciding on targeted content and generating a coherent text conveying it. While some popular approaches address summarization as a single end-to-end task, prominent works support decomposed modeling for individual subtasks. \nFurther, semi-automated text reduction is also very appealing, where users may identify targeted content while models would generate a corresponding coherent summary.\nIn this paper, we focus on the second subtask, of generating coherent text given pre-selected content. Concretely, we formalize \\textit{Controlled Text Reduction} as a standalone task, whose input is a source text with marked spans of targeted content (\"highlighting\").\nA model then needs to generate a coherent text that includes all and only the target information.\nWe advocate the potential of such models, both for modular fully-automatic summarization, as well as for semi-automated human-in-the-loop use cases.\nFacilitating proper research, we crowdsource high-quality dev and test datasets for the task. Further, we automatically generate a larger \"silver\" training dataset from available summarization benchmarks, leveraging a pretrained summary-source alignment model.\nFinally, employing these datasets, we present a supervised baseline model, showing promising results and insightful analyses.", "track": "Natural Language Generation", "label": 6, "url": "https://www.semanticscholar.org/reader/b3b4e7ef399f7458db537eedea9349ee6209c643?experiments=&features=reader_skimming%3Atrue"}, {"loc": [3.7452144622802734, 9.577372550964355], "id": 1589, "title": "Questioning the Validity of Summarization Datasets and Improving Their Factual Consistency", "authors": "Yanzhu Guo, Chlo\u00e9 Clavel, Moussa Kamal Eddine and michalis vazirgiannis", "abstract": "The topic of summarization evaluation has recently attracted a surge of attention due to the rapid development of abstractive summarization systems. However, the formulation of the task is rather ambiguous, neither the linguistic nor the natural language processing communities have succeeded in giving a mutually agreed-upon definition. Due to this lack of well-defined formulation, a large number of popular abstractive summarization datasets are constructed in a manner that neither guarantees validity nor meets one of the most essential criteria of summarization: factual consistency. In this paper, we address this issue by combining state-of-the-art factual consistency models to identify the problematic instances present in popular summarization datasets. We release SummFC, a filtered summarization dataset with improved factual consistency, and demonstrate that models trained on this dataset achieve improved performance in nearly all quality aspects. We argue that our dataset should become a valid benchmark for developing and evaluating summarization systems.", "track": "Theme Track", "label": 18, "url": ""}, {"loc": [8.130956649780273, 8.082945823669434], "id": 1591, "title": "Invariant Language Modeling", "authors": "Maxime Peyrard, Sarvjeet Singh Ghotra, Martin Josifoski, Vidhan Agarwal, Barun Patra, Dean Carignan, Emre Kiciman, Saurabh Tiwary and Robert West", "abstract": "Modern pretrained language models are critical components of NLP pipelines. \nYet, they suffer from spurious correlations, poor out-of-domain generalization, and biases.\nInspired by recent progress in causal machine learning, in particular the invariant risk minimization (IRM) paradigm, we propose invariant language modeling, a framework for learning invariant representations that generalize better across multiple environments. In particular, we adapt a game-theoretic implementation of IRM (IRM-games) to language models, where the invariance emerges from a specific training schedule in which all the environments compete to optimize their own environment-specific loss by updating subsets of the model in a round-robin fashion.\nWe focused on controlled experiments to precisely demonstrate the ability of our method to (i) remove structured noise, (ii) ignore specific spurious correlations without affecting global performance, and (iii) achieve better out-of-domain generalization.\nThese benefits come with a negligible computational overhead compared to standard training, do not require changing the local loss, and can be applied to any language model. We believe this framework is promising to help mitigate spurious correlations and biases in language models.", "track": "Language Modeling and Analysis of Language Models", "label": 2, "url": "https://www.semanticscholar.org/reader/0974413e05f1522615d4a84b30627418c65f980e?experiments=&features=reader_skimming%3Atrue"}, {"loc": [8.700105667114258, 8.321676254272461], "id": 1609, "title": "AdaMix: Mixture-of-Adaptations for Parameter-efficient Model Tuning", "authors": "Yaqing Wang, Sahaj Agarwal, Subhabrata Mukherjee, Xiaodong Liu, Jing Gao, Ahmed Hassan Awadallah and Jianfeng Gao", "abstract": "Standard fine-tuning of large pre-trained language models (PLMs) for downstream tasks requires updating hundreds of millions to billions of parameters, and storing a large copy of the PLM weights for every task resulting in increased cost for storing, sharing and serving the models. To address this, parameter-efficient fine-tuning (PEFT) techniques were introduced where small trainable components are injected in the PLM and updated during fine-tuning.  We propose AdaMix as a general PEFT method that tunes a mixture of adaptation modules -- given the underlying PEFT method of choice -- introduced in each Transformer layer while keeping most of the PLM weights frozen. For instance, AdaMix can leverage a mixture of adapters like Houlsby or a mixture of low rank decomposition matrices like LoRA to improve downstream task performance over the corresponding PEFT methods for fully supervised and few-shot NLU and NLG tasks. Further, we design AdaMix such that it matches the same computational cost and the number of tunable parameters as the underlying PEFT method. By only tuning 0.1-0.2% of PLM parameters, we show that AdaMix outperforms SOTA parameter-efficient fine-tuning and full model fine-tuning for both NLU and NLG tasks.", "track": "Language Modeling and Analysis of Language Models", "label": 2, "url": ""}, {"loc": [3.728872299194336, 9.557570457458496], "id": 1617, "title": "How \"Multi\" is Multi-Document Summarization?", "authors": "Ruben Wolhandler, Arie Cattan, Ori Ernst and Ido Dagan", "abstract": "The task of multi-document summarization (MDS) aims at models that, given multiple documents as input, are able to generate a summary that combines disperse information, originally spread __across__ these documents. Accordingly, it is expected that both reference summaries in MDS datasets, as well as system summaries, would indeed be based on such dispersed information. In this paper, we argue for quantifying and assessing this expectation. To that end, we propose an automated measure for evaluating the degree to which a summary is ``disperse'', in the sense of the number of source documents needed to cover its content. We apply our measure to empirically analyze several popular MDS datasets, with respect to their reference summaries, as well as the output of state-of-the-art systems. Our results show that certain MDS datasets barely require combining information from multiple documents, where a single document often covers the full summary content. Overall, we advocate using our metric for assessing and improving the degree to which summarization datasets require combining multi-document information, and similarly how summarization models actually meet this challenge.", "track": "Summarization", "label": 14, "url": "https://www.semanticscholar.org/reader/08357b63d13590dd73f0982c64bf0e0be9b64ddf?experiments=&features=reader_skimming%3Atrue"}, {"loc": [2.5044491291046143, 8.651063919067383], "id": 1620, "title": "BioReader: a Retrieval-Enhanced Text-to-Text Transformer for Biomedical Literature", "authors": "Giacomo Frisoni, Miki Mizutani, Gianluca Moro and Lorenzo Valgimigli", "abstract": "The latest batch of research has equipped language models with the ability to attend over relevant and factual information from non-parametric external sources, drawing a complementary path to architectural scaling. Besides mastering language, exploiting and contextualizing the latent world knowledge is crucial in complex domains like biomedicine. However, most works in the field rely on general-purpose models supported by databases like Wikipedia and Books. We introduce BioReader, the first retrieval-enhanced text-to-text model for biomedical natural language processing. Our domain-specific T5-based solution augments the input prompt by fetching and assembling relevant scientific literature chunks from a neural database with \u224860 million tokens centered on PubMed. We fine-tune and evaluate BioReader on a broad array of downstream tasks, significantly outperforming several state-of-the-art methods despite using up to 3x fewer parameters. In tandem with extensive ablation studies, we show that domain knowledge can be easily altered or supplemented to make the model generate correct predictions bypassing the retraining step and thus addressing the literature overload issue.", "track": "Language Modeling and Analysis of Language Models", "label": 2, "url": ""}, {"loc": [10.06582260131836, 7.613828182220459], "id": 1626, "title": "T-Modules: Translation Modules for Zero-Shot Cross-Modal Machine Translation", "authors": "Paul-Ambroise Duquenne, Hongyu Gong, Beno\u00eet Sagot and Holger Schwenk", "abstract": "We present a new approach to perform zero-shot cross-modal transfer between speech and text for translation tasks. Multilingual speech and text are encoded in a joint fixed-size representation space. Then, we compare different approaches to decode these multimodal and multilingual fixed-size representations, enabling zero-shot translation between languages and modalities. All our models are trained without the need of cross-modal labeled translation data.\nDespite a fixed-size representation, we achieve very competitive results on several text and speech translation tasks. In particular, we significantly improve the state-of-the-art for zero-shot speech translation on Must-C. Incorporating a speech decoder in our framework, we introduce the first results for zero-shot direct speech-to-speech and text-to-speech translation.", "track": "Multilinguality", "label": 13, "url": "https://www.semanticscholar.org/reader/f20e5f1f9c33974ec3352781333759929c695ea5?experiments=&features=reader_skimming%3Atrue"}, {"loc": [3.9833481311798096, 4.02597188949585], "id": 1638, "title": "LILA: A Unified Benchmark for Mathematical Reasoning", "authors": "Swaroop Mishra, Matthew Finlayson, Pan Lu, Leonard Tang, Sean Welleck, Chitta Baral, Tanmay Rajpurohit, Oyvind Tafjord, Ashish Sabharwal, Peter Clark and Ashwin K. Kalyan", "abstract": "Mathematical reasoning skills are essential for general-purpose intelligent\nsystems to perform tasks from grocery shopping to climate modeling.\nTowards evaluating and improving AI systems in this domain, we propose\nLILA, a unified mathematical reasoning benchmark consisting of 23 diverse\ntasks along four dimensions:\n(i) mathematical abilities e.g., arithmetic, calculus \n(ii) language format e.g., question-answering, fill-in-the-blanks \n(iii) language diversity e.g., no language, simple language \n(iv) external knowledge e.g., commonsense, physics. \nWe construct our benchmark by extending 20 datasets benchmark \nby collecting task instructions and solutions in the form of Python programs,\nthereby obtaining explainable solutions \nin addition to the correct answer.\nWe additionally introduce two evaluation datasets \nto measure out-of-distribution performance \nand robustness to language perturbation.\nFinally, we introduce BHASKARA,\na general-purpose mathematical reasoning model trained on LILA. \nImportantly, we find that multi-tasking leads to significant improvements \n(average relative improvement of 21.83% F1 score vs. single-task models),\nwhile the best performing model only obtains 60.40%,\nindicating the room for improvement \nin general mathematical reasoning and understanding.", "track": "Resources and Evaluation", "label": 1, "url": ""}, {"loc": [4.398414134979248, 4.489282131195068], "id": 1639, "title": "Leveraging Affirmative Interpretations from Negation Improves Natural Language Understanding", "authors": "Md Mosharaf Hossain and Eduardo Blanco", "abstract": "Negation poses a challenge in many natural language understanding tasks. Inspired by the fact that understanding a negated statement often requires humans to infer affirmative interpretations, in this paper we show that doing so benefits models for three natural language understanding tasks. We present an automated procedure to collect pairs of sentences with negation and their affirmative interpretations, resulting in over 150,000 pairs. Experimental results show that leveraging these pairs helps (a) T5 generate affirmative interpretations from negations in a previous benchmark, and (b) a RoBERTa-based classifier solve the task of natural language inference. We also leverage our pairs to build a plug-and-play neural generator that given a negated statement generates an affirmative interpretation. Then, we incorporate the pretrained generator into a RoBERTa-based classifier for sentiment analysis and show that doing so improves the results. Crucially, our proposal does not require any manual effort.", "track": "Semantics: Lexical, Sentence level, Textual Inference and Other areas", "label": 8, "url": "https://www.semanticscholar.org/reader/045836fee6da2410ba912f1a05349e1e0adaa5fe?experiments=&features=reader_skimming%3Atrue"}, {"loc": [1.6336257457733154, 5.329700946807861], "id": 1648, "title": "GraphQ IR: Unifying the Semantic Parsing of Graph Query Languages with One Intermediate Representation", "authors": "Lunyiu Nie, Shulin Cao, Jiaxin Shi, Jiuding Sun, Qi Tian, Lei Hou, Juanzi Li and Jidong Zhai", "abstract": "Subject to the huge semantic gap between natural and formal languages, neural semantic parsing is typically bottlenecked by its complexity of dealing with both input semantics and output syntax. Recent works have proposed several forms of supplementary supervision but none is generalized across multiple formal languages. This paper proposes a unified intermediate representation for graph query languages, named GraphQ IR. It has a natural-language-like expression that bridges the semantic gap and formally defined syntax that maintains the graph structure. Therefore, a neural semantic parser can more precisely convert user queries into GraphQ IR, which can be later losslessly compiled into various downstream graph query languages. Extensive experiments on several benchmarks including KQA Pro, Overnight, GrailQA, and MetaQA-Cypher under the standard i.i.d., out-of-distribution, and low-resource settings validate GraphQ IR's superiority over the previous state-of-the-arts with a maximum 11% accuracy improvement.", "track": "Semantics: Lexical, Sentence level, Textual Inference and Other areas", "label": 8, "url": "https://www.semanticscholar.org/reader/5fa148e8bfcd5fa3df05311c0ec8abb13caf1c05?experiments=&features=reader_skimming%3Atrue"}, {"loc": [8.007452011108398, 7.692874431610107], "id": 1660, "title": "InforMask: Unsupervised Informative Masking for Language Model Pretraining", "authors": "Nafis Sadeq, Canwen Xu and Julian McAuley", "abstract": "Masked language modeling is widely used for pretraining large language models for natural language understanding (NLU). However, random masking is suboptimal, allocating an equal masking rate for all tokens. In this paper, we propose InforMask, a new unsupervised masking strategy for training masked language models. InforMask exploits Pointwise Mutual Information (PMI) to select the most informative tokens to mask. We further propose two optimizations for InforMask to improve its efficiency. With a one-off preprocessing step, InforMask outperforms random masking and previously proposed masking strategies on the factual recall benchmark LAMA and the question answering benchmark SQuAD v1 and v2.", "track": "Language Modeling and Analysis of Language Models", "label": 2, "url": "https://www.semanticscholar.org/reader/c1cc7cedbee57bfb4623708e7da2f5c701501860?experiments=&features=reader_skimming%3Atrue"}, {"loc": [3.666712999343872, 9.76048755645752], "id": 1662, "title": "CTRLsum: Towards Generic Controllable Text Summarization", "authors": "Junxian He, Wojciech Kryscinski, Bryan McCann, Nazneen Rajani and Caiming Xiong", "abstract": "Current summarization systems yield generic summaries that are disconnected from users' preferences and expectations. To address this limitation, we present CTRLsum, a generic framework to control generated summaries through a set of keywords. During training keywords are extracted automatically without requiring additional human annotations. At test time CTRLsum features a control function to map control signal to keywords; through engineering the control function, the same trained model is able to be applied to control summaries on various dimensions, while neither affecting the model training process nor the pretrained models. We additionally explore the combination of keywords and text prompts for more control tasks. Experiments demonstrate the effectiveness of CTRLsum on three domains of summarization datasets and five control tasks: (1) entity-centric and (2) length-controllable summarization, (3) contribution summarization on scientific papers, (4) invention purpose summarization on patent filings, and (5) question-guided summarization on news articles. Moreover, when used in a standard, unconstrained summarization setting, CTRLsum is comparable or better than strong pretrained systems.", "track": "Summarization", "label": 14, "url": "https://www.semanticscholar.org/reader/d4e9bf1d5fab52698a3aa48c65b098ea327deea6?experiments=&features=reader_skimming%3Atrue"}, {"loc": [4.49074125289917, 5.381772041320801], "id": 1672, "title": "Missing Counter-Evidence Renders NLP Fact-Checking Unrealistic for Misinformation", "authors": "Max Glockner, Yufang Hou and Iryna Gurevych", "abstract": "Misinformation emerges in times of uncertainty when credible information is limited. This is challenging for NLP-based fact-checking as it relies on counter-evidence, which may not yet be available. Despite increasing interest in automatic fact-checking, it is still unclear if automated approaches can realistically refute harmful real-world misinformation. Here, we contrast and compare NLP fact-checking with how professional fact-checkers combat misinformation in the absence of counter-evidence. In our analysis, we show that, by design, existing NLP task definitions for fact-checking cannot refute misinformation as professional fact-checkers do for the majority of claims. We then define two requirements that the evidence in datasets must fulfill for realistic fact-checking: It must be (1) sufficient to refute the claim and (2) not leaked from existing fact-checking articles. We survey existing fact-checking datasets and find that all of them fail to satisfy both criteria. Finally, we perform experiments to demonstrate that models trained on a large-scale fact-checking dataset rely on leaked evidence, which makes them unsuitable in real-world scenarios. Taken together, we show that current NLP fact-checking cannot realistically combat real-world misinformation because it depends on unrealistic assumptions about counter-evidence in the data.", "track": "Theme Track", "label": 18, "url": "https://www.semanticscholar.org/reader/bb6f8161be27877e0299af65a6a7caf3f0a1f220?experiments=&features=reader_skimming%3Atrue"}, {"loc": [0.6077322959899902, 6.96621561050415], "id": 1687, "title": "A Framework for Adapting Pre-Trained Language Models to Knowledge Graph Completion", "authors": "Justin Lovelace and Carolyn Ros\u00e9", "abstract": "Recent work has demonstrated that entity representations can be extracted from pre-trained language models to develop knowledge graph completion models that are more robust to the naturally occurring sparsity found in knowledge graphs. In this work, we conduct a comprehensive exploration of how to best extract and incorporate those embeddings into knowledge graph completion models. We explore the suitability of the extracted embeddings for direct use in entity ranking and introduce both unsupervised and supervised processing methods that can lead to improved downstream performance. We then introduce supervised embedding extraction methods that can extract more informative representations. We then synthesize our findings and develop a knowledge graph completion model that significantly outperforms recent neural models.", "track": "Information Retrieval and Text Mining", "label": 15, "url": ""}, {"loc": [3.8418712615966797, 9.879581451416016], "id": 1689, "title": "Mutual Information Alleviates Hallucinations in Abstractive Summarization", "authors": "Liam van der Poel, Clara Meister and Ryan Cotterell", "abstract": "Despite significant progress in the quality of language generated from abstractive summarization models, these models still exhibit the tendency to hallucinate, i.e., output content not supported by the source document. A number of works have tried to fix---or at least uncover the source of---the problem with limited success. In this paper, we identify a simple criterion under which models are significantly more likely to assign more probability to hallucinated content during generation: high model uncertainty. This finding offers a potential explanation for hallucinations: models default to favoring text with high marginal probability, i.e., high-frequency occurrences in the training set,  when uncertain about a continuation. It also motivates possible routes for real-time intervention during decoding to prevent such hallucinations. We propose a decoding strategy that switches to optimizing for pointwise mutual information of the source and target token---rather than purely the probability of the target token---when the model exhibits uncertainty. Experiments on the \\xsum dataset show that our method decreases the probability of hallucinated tokens while maintaining the Rouge and BERT-S scores of top-performing decoding strategies.", "track": "Summarization", "label": 14, "url": ""}, {"loc": [9.515807151794434, 6.3575286865234375], "id": 1691, "title": "Toward the Limitation of Code-Switching in Cross-Lingual Transfer", "authors": "Yukun Feng, Feng Li and Philipp Koehn", "abstract": "Multilingual pretrained models have shown strong cross-lingual transfer ability. Some works used code-switching sentences, which consist of tokens from multiple languages, to enhance the cross-lingual representation further, and have shown success in many zero-shot cross-lingual tasks. However, code-switched tokens are likely to cause grammatical incoherence in newly substituted sentences, and negatively affect the performance on token-sensitive tasks, such as Part-of-Speech (POS) tagging and Named-Entity-Recognition (NER). This paper mitigates the limitation of the code-switching method by not only making the token replacement but considering the similarity between the context and the switched tokens so that the newly substituted sentences are grammatically consistent during both training and inference. We conduct experiments on cross-lingual POS and NER over 30+ languages, and demonstrate the effectiveness of our method by outperforming the mBERT by 0.95 and original code-switching method by 1.67 on F1 scores.", "track": "Multilinguality", "label": 13, "url": ""}, {"loc": [1.0958553552627563, 7.9238362312316895], "id": 1700, "title": "Syntactically Rich Discriminative Training: An Effective Method for Open Information Extraction", "authors": "Frank Mtumbuka and Thomas Lukasiewicz", "abstract": "Open information extraction (OIE) is the task of extracting facts \"(Subject, Relation, Object)\u201d from natural language text. We propose several new methods for training neural OIE models in this paper. First, we propose a novel method for computing syntactically rich text embeddings using the structure of dependency trees. Second, we propose a new discriminative training approach to OIE in which tokens in the generated fact are classified as \"real\u201d or \"fake\u201d, i.e., those tokens that are in both the generated and gold tuples, and those that are only in the generated tuple but not in the gold tuple. We also address the issue of repetitive tokens in generated facts and improve the models' ability to generate implicit facts. Our approach reduces repetitive tokens by a factor of 23%. Finally, we present paraphrased versions of the CaRB, OIE2016, and LSOIE datasets, and show that the models' performance substantially improves when trained on augmented datasets. Our best model beats the SOTA of IMoJIE on the recent CaRB dataset, with an improvement of 39.63% in F1 score.", "track": "Information Extraction", "label": 5, "url": ""}, {"loc": [0.7339483499526978, 7.455346584320068], "id": 1709, "title": "Transformer-based Entity Typing in Knowledge Graphs", "authors": "Zhiwei Hu, Victor Gutierrez-Basulto, Zhiliang Xiang, Ru Li and Jeff Z. Pan", "abstract": "We investigate the knowledge graph entity typing task which aims at inferring plausible entity types. In this paper, we propose a novel Transformer-based Entity Typing (TET) approach, effectively encoding the content of neighbours of an entity by means of a transformer mechanism. More precisely, TET is composed of three different mechanisms: a local transformer allowing to infer missing entity types by independently encoding the information provided by each of its neighbours; a global transformer aggregating the information of all neighbours of an entity into a single long sequence to reason about more complex entity types; and a context transformer integrating neighbours content in a differentiated way through information exchange between neighbour pairs, while preserving the graph structure. Furthermore, TET uses information about class membership of types to semantically strengthen the representation of an entity. Experiments on two real-world datasets demonstrate the superior performance of TET compared to the state-of-the-art.", "track": "Machine Learning for NLP", "label": 3, "url": "https://www.semanticscholar.org/reader/2b8f3ebcbd630a221c90049bca90e1f6081a1b38?experiments=&features=reader_skimming%3Atrue"}, {"loc": [4.487758159637451, 5.519023418426514], "id": 1734, "title": "NewsClaims: A New Benchmark for Claim Detection from News with Attribute Knowledge", "authors": "Revanth Gangi Reddy, Sai Chetan Chinthakindi, Zhenhailong Wang, Yi Fung, Kathryn Conger, Ahmed ELsayed, Martha Palmer, Preslav Nakov, Eduard Hovy, Kevin Small and Heng Ji", "abstract": "Claim detection and verification are crucial for news understanding and have emerged as promising technologies for mitigating misinformation and disinformation in the news. However, most existing work has focused on claim sentence analysis while overlooking additional crucial attributes (e.g., the claimer and the main object associated with the claim).In this work, we present NewsClaims, a new benchmark for attribute-aware claim detection in the news domain. We extend the claim detection problem to include extraction of additional attributes related to each claim and release 889 claims annotated over 143 news articles. NewsClaims aims to benchmark claim detection systems in emerging scenarios, comprising unseen topics with little or no training data. To this end, we see that zero-shot and prompt-based baselines show promising performance on this benchmark, while still considerably behind human performance.", "track": "Ethic Concerns:Resources and Evaluation", "label": 1, "url": ""}, {"loc": [9.233291625976562, 6.261379241943359], "id": 1756, "title": "IsoVec: Controlling the Relative Isomorphism of Word Embedding Spaces", "authors": "Kelly Marchisio, Neha Verma, Kevin Duh and Philipp Koehn", "abstract": "The ability to extract high-quality translation dictionaries from monolingual word embedding spaces depends critically on the geometric similarity of the spaces---their degree of \"isomorphism.\"  We address the root-cause of faulty cross-lingual mapping: that word embedding training resulted in the underlying spaces being non-isomorphic. \nWe incorporate global measures of isomorphism directly into the skipgram loss function, successfully increasing the relative isomorphism of trained word embedding spaces and improving their ability to be mapped to a shared cross-lingual space. The result is improved bilingual lexicon induction in general data conditions, under domain mismatch, and with training algorithm dissimilarities.  \nWe release IsoVec at https://github.com/kellymarchisio/isovec.", "track": "Unsupervised and Weakly-Supervised Methods in NLP", "label": 17, "url": "https://www.semanticscholar.org/reader/1d2d23adf5d468288d034f845ed15fe34883dfcd?experiments=&features=reader_skimming%3Atrue"}, {"loc": [7.721404075622559, 3.55267071723938], "id": 1772, "title": "Adversarial Concept Erasure in Kernel Space", "authors": "Shauli Ravfogel, Francisco Vargas\u202c, Yoav Goldberg and Ryan Cotterell", "abstract": "The representation space of neural models for textual data emerges in an unsupervised manner during training. Understanding how human-interpretable concepts, such as gender, are encoded in these representations would improve the ability of users to control the content of these representations and analyze the working of the models that rely on them. One prominent approach to the control problem is the identification and removal of linear concept subspaces -- subspaces in the representation space that correspond to a given concept. While those are tractable and interpretable, neural network do not necessarily represent concepts in linear subspaces. \n\nWe propose a kernelization of the recently-proposed linear concept-removal objective, and show that it is effective in guarding against the ability of certain nonlinear adversaries to recover the concept. Interestingly, our findings suggest that the division between linear and nonlinear models is overly simplistic: when considering the concept of binary gender and its neutralization, we do not find a single kernel space that exclusively contains all the concept-related information. It is therefore challenging to protect against all nonlinear adversaries at once.", "track": "Interpretability, Interactivity and Analysis of Models for NLP", "label": 9, "url": ""}, {"loc": [5.5214009284973145, 8.466492652893066], "id": 1784, "title": "The Authenticity Gap in Human Evaluation", "authors": "Kawin Ethayarajh and Dan Jurafsky", "abstract": "Human ratings are the gold standard in NLG evaluation. The standard protocol is to collect ratings of generated text, average across annotators, and rank NLG systems by their average scores. However, little consideration has been given as to whether this approach faithfully captures human preferences. Analyzing this standard protocol through the lens of utility theory in economics, we identify the implicit assumptions it makes about annotators. These assumptions are often violated in practice, in which case annotator ratings cease to reflect their preferences. The most egregious violations come from using Likert scales, which provably reverse the direction of the true preference in certain cases. We suggest improvements to the standard protocol to make it more theoretically sound, but even in its improved form, it cannot be used to evaluate open-ended tasks like story generation. For the latter, we propose a new human evaluation protocol called system-level probabilistic assessment (SPA). When human evaluation of stories is done with SPA, we can recover the ordering of GPT-3 models by size, with statistically significant results. However, when human evaluation is done with the standard protocol, less than half of the expected preferences can be recovered (e.g., there is no significant difference between curie and davinci, despite using a highly powered test).", "track": "Theme Track", "label": 18, "url": "https://www.semanticscholar.org/reader/20eca4866bb257b8d701bc7c9b19864b7c05bc23?experiments=&features=reader_skimming%3Atrue"}, {"loc": [6.422831058502197, 5.934441089630127], "id": 1790, "title": "BERT in Plutarch's Shadows", "authors": "Ivan Yamshchikov, Alexey Tikhonov, Yorgos Pantis, Charlotte Schubert and J\u00fcrgen Jost", "abstract": "The extensive surviving corpus of the ancient scholar Plutarch of Chaeronea (ca. 45-120 CE) also contains several texts which, according to current scholarly opinion, did not originate with him and are therefore attributed to an anonymous author Pseudo-Plutarch. These include, in particular, the work Placita Philosophorum (Quotations and Opinions of the Ancient Philosophers), which is extremely important for the history of ancient philosophy. Little is known about the identity of that anonymous author and its relation to other authors from the same period. This paper presents a BERT language model for Ancient Greek. The model discovers previously unknown statistical properties relevant to these literary, philosophical, and historical problems and can shed new light on this authorship question. In particular, the Placita Philosophorum, together with one of the other Pseudo-Plutarch texts, shows similarities with the texts written by authors from an Alexandrian context (2nd/3rd century CE).", "track": "NLP Applications", "label": 0, "url": "https://www.semanticscholar.org/reader/111529b3911f2adcaddc8d2b35f7c6fa562c89d2?experiments=&features=reader_skimming%3Atrue"}, {"loc": [3.834892511367798, 9.974461555480957], "id": 1798, "title": "Leveraging Locality in Abstractive Text Summarization", "authors": "Yixin Liu, Ansong Ni, Linyong Nan, Budhaditya Deb, Chenguang Zhu, Ahmed Hassan Awadallah and Dragomir Radev", "abstract": "Neural attention models have achieved significant improvements on many natural language processing tasks. However, the quadratic memory complexity of the self-attention module with respect to the input length hinders their applications in long text summarization. Instead of designing more efficient attention modules, we approach this problem by investigating if models with a restricted context can have competitive performance compared with the memory-efficient attention models that maintain a global context by treating the input as a single sequence. Our model is applied to individual pages, which contain parts of inputs grouped by the principle of locality, during both the encoding and decoding stages. We empirically investigated three kinds of locality in text summarization at different levels of granularity, ranging from sentences to documents. Our experimental results show that our model has a better performance compared with strong baseline models with efficient attention modules, and our analysis provides further insights into our locality-aware modeling strategy.", "track": "Summarization", "label": 14, "url": "https://www.semanticscholar.org/reader/81fa9a9e3e0c868e4d2fee2efed5e1d9ad62395e?experiments=&features=reader_skimming%3Atrue"}, {"loc": [3.7552075386047363, 9.785235404968262], "id": 1804, "title": "Salience Allocation as Guidance for Abstractive Summarization", "authors": "Fei Wang, Kaiqiang Song, Hongming Zhang, Lifeng Jin, Sangwoo Cho, Wenlin Yao, Xiaoyang Wang, Muhao Chen and Dong Yu", "abstract": "Abstractive summarization models typically learn to capture the salient information from scratch implicitly.\nRecent literature adds extractive summaries as guidance for abstractive summarization models to provide hints of salient content and achieves better performance.\nHowever, extractive summaries as guidance could be over strict, leading to information loss or noisy signals.\nFurthermore, it cannot easily adapt to documents with various abstractiveness.\nAs the number and allocation of salience content pieces varies, it is hard to find a fixed threshold deciding which content should be included in the guidance.\nIn this paper, we propose a novel summarization approach with a flexible and reliable salience guidance, namely SEASON (SaliencE Allocation as Guidance for Abstractive SummarizatiON).\nSEASON utilizes the allocation of salience expectation to guide abstractive summarization and adapts well to articles in different abstractiveness.\nAutomatic and human evaluations on two benchmark datasets show that the proposed method is effective and reliable.\nEmpirical results on more than one million news articles demonstrate a natural fifteen-fifty salience split for news article sentences, providing a useful insight for composing news articles.", "track": "Summarization", "label": 14, "url": "https://www.semanticscholar.org/reader/6788a8a0148421cf482cb8caa23504ee1e36798e?experiments=&features=reader_skimming%3Atrue"}, {"loc": [7.787707805633545, 8.1945219039917], "id": 1807, "title": "Fine-tuned Language Models are Continual Learners", "authors": "Thomas Scialom, Tuhin Chakrabarty and Smaranda Muresan", "abstract": "Recent work on large language models relies on the intuition that most natural language processing tasks can be described via natural language instructions and that models trained on these instructions show strong zero-shot performance on several standard datasets. However, these models even though impressive still perform poorly on a wide range of tasks outside of their respective training and evaluation sets.To address this limitation, we argue that a model should be able to keep extending its knowledge and abilities, without forgetting previous skills. In spite of the limited success of Continual Learning, we show that \\emph{Fine-tuned Language Models can be continual learners}.We empirically investigate the reason for this success and conclude that Continual Learning emerges from self-supervision pre-training. Our resulting model Continual-T0 (CT0) is able to learn 8 new diverse language generation tasks, while still maintaining good performance on previous tasks, spanning in total of 70 datasets. Finally, we show that CT0 is able to combine instructions in ways it was never trained for, demonstrating some level of instruction compositionality.", "track": "Language Modeling and Analysis of Language Models", "label": 2, "url": ""}, {"loc": [4.8568220138549805, 4.208720684051514], "id": 1814, "title": "Natural Logic-guided Autoregressive Multi-hop Document Retrieval for Fact Verification", "authors": "Rami Aly and Andreas Vlachos", "abstract": "A key component of fact verification is the evidence retrieval, often from multiple documents.  Recent approaches use dense representations and condition the retrieval of each document on the previously retrieved ones. The latter step is performed over all the documents in the collection, requiring storing their dense representations in an index, thus incurring a high memory footprint.  An alternative paradigm is retrieve-and-rerank, where documents are retrieved using methods such as BM25, their sentences are reranked, and further documents are retrieved conditioned on these sentences, reducing the memory requirements. However, such approaches can be brittle as they rely on heuristics and assume hyperlinks between documents.\n\nWe propose a novel retrieve-and-rerank method for multi-hop retrieval, that consists of a retriever that \njointly scores documents in the knowledge source and sentences from previously retrieved documents using an autoregressive formulation and is guided by a proof system based on natural logic that dynamically terminates the retrieval process if the evidence is deemed sufficient.\n\nThis method exceeds or is on par with the current state-of-the-art on FEVER, HoVer and FEVEROUS-S, \nwhile using 5 to 10 times less memory than competing systems. Evaluation on an adversarial dataset indicates improved stability of our approach compared to commonly deployed threshold-based methods. Finally, the proof system helps humans predict model decisions correctly more often than using the evidence alone.", "track": "NLP Applications", "label": 0, "url": ""}, {"loc": [1.048694133758545, 10.530959129333496], "id": 1817, "title": "AX-MABSA: A Framework for Extremely Weakly Supervised Multi-label Aspect Based Sentiment Analysis", "authors": "Sabyasachi Kamila, Walid Magdy, Sourav Dutta and MingXue Wang", "abstract": "Aspect Based Sentiment Analysis is a dominant research area with potential applications in social media analytics, business, finance, and health. Prior works in this area are primarily based on supervised methods, with a few techniques using weak supervision limited to predicting a single aspect category per review sentence. In this paper, we present an extremely weakly supervised multi-label Aspect Category Sentiment Analysis framework which does not use any labelled data. We only rely on a single word per class as an initial indicative information. We further propose an automatic word selection technique to choose these seed categories and sentiment words. We explore unsupervised language model post-training to improve the overall performance, and propose a multi-label generator model to generate multiple aspect category-sentiment pairs per review sentence. Experiments conducted on four benchmark datasets showcase our method to outperform other weakly supervised baselines by a significant margin.", "track": "Sentiment Analysis, Stylistic Analysis, and Argument Mining", "label": 16, "url": "https://www.semanticscholar.org/reader/b26b5ba7fe6d6f7c9e0d1445c01531dc4c98c0c6?experiments=&features=reader_skimming%3Atrue"}, {"loc": [5.7261576652526855, 10.876175880432129], "id": 1820, "title": "Transfer Learning with Synthetic Corpora for Spatial Role Labeling and Reasoning", "authors": "Roshanak Mirzaee and Parisa Kordjamshidi", "abstract": "Recent research shows synthetic data as a source of supervision helps pretrained language models (PLM) transfer learning to new target tasks/domains. However, this idea is less explored for spatial language. We provide two new data resources on multiple spatial language processing tasks. The first dataset is synthesized for transfer learning on spatial question answering (SQA) and spatial role labeling (SpRL). Compared to previous SQA datasets, we include a larger variety of spatial relation types and spatial expressions. Our data generation process is easily extendable with new spatial expression lexicons. The second one is a real-world SQA dataset with human-generated questions built on an existing corpus with SPRL annotations. This dataset can be used to evaluate spatial language processing models in realistic situations. We show pretraining with automatically generated data significantly improves the SOTA results on several SQA and SPRL benchmarks, particularly when the training data in the target domain is small.", "track": "Resources and Evaluation", "label": 1, "url": "https://www.semanticscholar.org/reader/e3cd9f01f87a601b274b4ef6513a84c8cde03214?experiments=&features=reader_skimming%3Atrue"}, {"loc": [7.927734851837158, 9.166131973266602], "id": 1830, "title": "A Survey of Active Learning for Natural Language Processing", "authors": "Zhisong Zhang, Emma Strubell and Eduard Hovy", "abstract": "In this work, we provide a literature review of active learning (AL) for its applications in natural language processing (NLP). In addition to a fine-grained categorization of query strategies, we also investigate several other important aspects of applying AL to NLP problems. These include AL for structured prediction tasks, annotation cost, model learning (especially with deep neural models), and starting and stopping AL. Finally, we conclude with a discussion of related topics and future directions.", "track": "Machine Learning for NLP", "label": 3, "url": "https://www.semanticscholar.org/reader/6e8c73f6bdc9aca2e5c6e8611b5b3d43a8efd843?experiments=&features=reader_skimming%3Atrue"}, {"loc": [9.09914493560791, 6.487714767456055], "id": 1840, "title": "Bernice: A Multilingual Pre-trained Encoder for Twitter", "authors": "Alexandra DeLucia, Shijie Wu, Aaron Mueller, Carlos Aguirre, Philip Resnik and Mark Dredze", "abstract": "The language of Twitter differs significantly from that of other domains commonly included in large language model training. \nWhile tweets are typically multilingual and contain informal language, including emoji and hashtags, most pre-trained language models for Twitter are either monolingual, adapted from other domains rather than trained exclusively on Twitter, or are trained on a limited amount of in-domain Twitter data.\nWe introduce Bernice, the first multilingual RoBERTa language model trained from scratch on 2.5 billion tweets with a custom tweet-focused tokenizer. \nWe evaluate on a variety of monolingual and multilingual Twitter benchmarks, finding that our model consistently exceeds or matches the performance of a variety of models adapted to social media data as well as strong multilingual baselines, despite being trained on less data overall.\nWe posit that it is more efficient compute- and data-wise to train completely on in-domain data with a specialized domain-specific tokenizer.", "track": "Language Modeling and Analysis of Language Models", "label": 2, "url": ""}, {"loc": [6.0577192306518555, 8.318950653076172], "id": 1851, "title": "CEFR-Based Sentence Difficulty Annotation and Assessment", "authors": "Yuki Arase, Satoru Uchida and Tomoyuki Kajiwara", "abstract": "Controllable text simplification is a crucial assistive technique for language learning and teaching. \nOne of the primary factors hindering its advancement is the lack of a corpus annotated with sentence difficulty levels based on language ability descriptions. \nTo address this problem, we created the CEFR-based Sentence Profile (CEFR-SP) corpus, containing 17k English sentences annotated with the levels based on the Common European Framework of Reference for Languages assigned by English-education professionals. \nIn addition, we propose a sentence-level assessment model to handle unbalanced level distribution because the most basic and highly proficient sentences are naturally scarce. \nIn the experiments in this study, our method achieved a macro-F1 score of 84.5% in the level assessment, thus outperforming strong baselines employed in readability assessment.", "track": "Resources and Evaluation", "label": 1, "url": "https://www.semanticscholar.org/reader/926b7d79283e49be14db178df998d3cbda2a4513?experiments=&features=reader_skimming%3Atrue"}, {"loc": [1.7825573682785034, 8.780869483947754], "id": 1857, "title": "Simple Questions Generate Named Entity Recognition Datasets", "authors": "Hyunjae Kim, jaehyo yoo, Seunghyun Yoon, Jinhyuk Lee and Jaewoo Kang", "abstract": "Recent named entity recognition (NER) models often rely on human-annotated datasets requiring the vast engagement of professional knowledge on the target domain and entities. This work introduces an ask-to-generate approach, which automatically generates NER datasets by asking simple natural language questions to an open-domain question answering system (e.g., \"Which disease?\"). Despite using fewer training resources, our models solely trained on the generated datasets largely outperform strong low-resource models by 19.5 F1 score across six popular NER benchmarks. Our models also show competitive performance with rich-resource models that additionally leverage in-domain dictionaries provided by domain experts. In few-shot NER, we outperform the previous best model by 5.2 F1 score on three benchmarks and achieve new state-of-the-art performance.", "track": "Information Extraction", "label": 5, "url": "https://www.semanticscholar.org/reader/49ea98fe003325b8f05e92c9a9bc22837f1a252a?experiments=&features=reader_skimming%3Atrue"}, {"loc": [8.941607475280762, 8.026017189025879], "id": 1872, "title": "TemporalWiki: A Lifelong Benchmark for Training and Evaluating Ever-Evolving Language Models", "authors": "Joel Jang, Seonghyeon Ye, Changho Lee, Sohee Yang, Joongbo Shin, Janghoon Han, Gyeonghun Kim and Minjoon Seo", "abstract": "Language Models (LMs) become outdated as the world changes; they often fail to perform tasks requiring recent factual information which was absent or different during training, a phenomenon called temporal misalignment. This is especially a challenging problem because the research community still lacks a coherent dataset for assessing the adaptability of LMs to frequently-updated knowledge corpus such as Wikipedia. To this end, we introduce TemporalWiki, a lifelong benchmark for ever-evolving LMs that utilizes the difference between consecutive snapshots of English Wikipedia and English Wikidata for training and evaluation, respectively. The benchmark hence allows researchers to periodically track an LM's ability to retain previous knowledge and acquire updated/new knowledge at each point in time. We also find that training an LM on the diff data through continual learning methods achieves similar or better perplexity than on the entire snapshot in our benchmark with 12 times less computational cost, which verifies that factual knowledge in LMs can be safely updated with minimal training data via continual learning.", "track": "Language Modeling and Analysis of Language Models", "label": 2, "url": "https://www.semanticscholar.org/reader/28394219e999fe67ee824fdfbb06c18d4342e3a8?experiments=&features=reader_skimming%3Atrue"}, {"loc": [2.4104552268981934, 7.3146233558654785], "id": 1884, "title": "Bi-Directional Iterative Prompt-Tuning for Event Argument Extraction", "authors": "Lu Dai, Bang Wang, Wei Xiang and yijun mo", "abstract": "Recently, prompt-tuning has attracted growing interests in event argument extraction (EAE). However, the existing prompt-tuning methods have not achieved satisfactory performance due to the lack of consideration of entity information. In this paper, we propose a bi-directional iterative prompt-tuning method for EAE, where the EAE task is treated as a cloze-style task to take full advantage of entity information and pre-trained language models (PLMs). Furthermore, our method explores event argument interactions by introducing the argument roles of contextual entities into prompt construction. Since template and verbalizer are two crucial components in a cloze-style prompt, we propose to utilize the role label semantic knowledge to construct a semantic verbalizer and design three kind of templates for the EAE task. Experiments on the ACE 2005 English dataset with standard and low-resource settings show that the proposed method significantly outperforms the peer state-of-the-art methods.", "track": "Information Extraction", "label": 5, "url": ""}, {"loc": [0.742217481136322, 7.943090915679932], "id": 1894, "title": "Learning Robust Representations for Continual Relation Extraction via Adversarial Class Augmentation", "authors": "Peiyi Wang, Yifan Song, Tianyu Liu, Binghuai Lin, Yunbo Cao, Sujian Li and Zhifang Sui", "abstract": "Continual relation extraction (CRE) aims to continually learn new relations from a class-incremental data stream. CRE model usually suffers from catastrophic forgetting problem, i.e., the performance of old relations seriously degrades when the model learns new relations. Most previous work attributes catastrophic forgetting to the corruption of the learned representations as new relations come, with an implicit assumption that the CRE models have adequately learned the old relations. In this paper, through empirical studies we argue that this assumption may not hold, and an important reason for catastrophic forgetting is that the learned representations do not have good robustness against the appearance of analogous relations in the subsequent learning process. To address this issue, we encourage the model to learn more precise and robust representations through a simple yet effective adversarial class augmentation mechanism (ACA), which is easy to implement and model-agnostic.\nExperimental results show that ACA can consistently improve the performance of state-of-the-art CRE models on two popular benchmarks.", "track": "Information Extraction", "label": 5, "url": "https://www.semanticscholar.org/reader/f07735d82c7013310be496faba964d785199528d?experiments=&features=reader_skimming%3Atrue"}, {"loc": [3.8870460987091064, 4.14500617980957], "id": 1895, "title": "ConvFinQA: Exploring the Chain of Numerical Reasoning in Conversational Finance Question Answering", "authors": "Zhiyu Chen, Shiyang Li, Charese Smiley, Zhiqiang Ma, Sameena Shah and William Yang Wang", "abstract": "With the recent advance in large pre-trained language models, researchers have achieved record performances in NLP tasks that mostly focus on language pattern matching. The community is experiencing the shift of the challenge from how to model language to the imitation of complex reasoning abilities like human beings. In this work, we investigate the application domain of finance that involves real-world, complex numerical reasoning. We propose a new large-scale dataset, ConvFinQA, aiming to study the chain of numerical reasoning in conversational question answering. Our dataset poses great challenge in modeling long-range, complex numerical reasoning paths in real-world conversations. We conduct comprehensive experiments and analyses with both the neural symbolic methods and the prompting-based methods, to provide insights into the reasoning mechanisms of these two divisions. We believe our new dataset should serve as a valuable resource to push forward the exploration of real-world, complex reasoning tasks as the next research focus. \nOur dataset and code is publicly available at https://github.com/czyssrs/ConvFinQA.", "track": "Question Answering", "label": 11, "url": "https://www.semanticscholar.org/reader/d96997265f8146e93b4c9350f19d55e46d1317f0?experiments=&features=reader_skimming%3Atrue"}, {"loc": [5.628740310668945, 12.70927906036377], "id": 1903, "title": "A Span-based Multimodal Variational Autoencoder for Semi-supervised Multimodal Named Entity Recognition", "authors": "Baohang Zhou, Ying Zhang, Kehui Song, Wenya Guo, Guoqing Zhao, hongbin wang and Xiaojie Yuan", "abstract": "Multimodal named entity recognition (MNER) on social media is a challenging task which aims to extract named entities in free text and incorporate images to classify them into user-defined types. However, the annotation for named entities on social media demands a mount of human efforts. The existing semi-supervised named entity recognition methods focus on the text modal and are utilized to reduce labeling costs in traditional NER. However, the previous methods are not efficient for semi-supervised MNER. Because the MNER task is defined to combine the text information with image one and needs to consider the mismatch between the posted text and image. To fuse the text and image features for MNER effectively under semi-supervised setting, we propose a novel span-based multimodal variational autoencoder (SMVAE) model for semi-supervised MNER. The proposed method exploits modal-specific VAEs to model text and image latent features, and utilizes product-of-experts to acquire multimodal features. In our approach, the implicit relations between labels and multimodal features are modeled by multimodal VAE. Thus, the useful information of unlabeled data can be exploited in our method under semi-supervised setting. Experimental results on two benchmark datasets demonstrate that our approach not only outperforms baselines under supervised setting, but also improves MNER performance with less labeled data than existing semi-supervised methods.", "track": "Speech, Vision, Robotics, Multimodal Grounding", "label": 7, "url": ""}, {"loc": [3.878812789916992, 9.94894027709961], "id": 1904, "title": "R-TeaFor: Regularized Teacher-Forcing for Abstractive Summarization", "authors": "Guan-Yu Lin and Pu-Jen Cheng", "abstract": "Teacher-forcing is widely used in training sequence generation models to improve sampling efficiency and to stabilize training. However, teacher-forcing is vulnerable to the exposure bias problem. Previous works have attempted to address exposure bias by modifying the training data to simulate model-generated results. Nevertheless, they do not consider the pairwise relationship between the original training data and the modified ones, which provides more information during training. Hence, we propose Regularized Teacher-Forcing (R-TeaFor) to utilize this relationship for better regularization. Empirically, our experiments show that R-TeaFor outperforms previous summarization state-of-the-art models, and the results can be generalized to different pre-trained models.", "track": "Summarization", "label": 14, "url": ""}, {"loc": [10.580028533935547, 7.091395378112793], "id": 1915, "title": "Modeling Consistency Preference via Lexical Chains for Document-level Neural Machine Translation", "authors": "Xinglin Lyu, Junhui Li, shimin tao, Hao Yang, Ying Qin and Min Zhang", "abstract": "In this paper we aim to relieve the issue of lexical translation inconsistency for document-level neural machine translation (NMT) by modeling consistency preference for lexical chains, which consist of repeated words in a source-side document and provide a representation of the lexical consistency structure of the document. Specifically, we first propose lexical-consistency attention to capture consistency context among words in the same lexical chains. Then for each lexical chain we define and learn a consistency-tailored latent variable, which will guide the translation of corresponding sentences to enhance lexical translation consistency. Experimental results on Chinese\u2192English and French\u2192English document-level translation tasks show that our approach not only significantly improves translation performance in BLEU, but also substantially alleviates the problem of the lexical translation inconsistency.", "track": "Machine Translation", "label": 10, "url": ""}, {"loc": [8.129496574401855, 2.99873948097229], "id": 1920, "title": "Just Fine-tune Twice: Selective Differential Privacy for Large Language Models", "authors": "Weiyan Shi, Ryan Patrick Shea, Si Chen, Chiyuan Zhang, Ruoxi Jia and Zhou Yu", "abstract": "Protecting large language models from privacy leakage is becoming increasingly crucial with their wide adoption in real-world products. Yet applying *differential privacy* (DP), a canonical notion with provable privacy guarantees for machine learning models, to those models remains challenging due to the trade-off between model utility and privacy loss. Utilizing the fact that sensitive information in language data tends to be sparse, Shi et al. (2021) formalized a DP notion extension called *Selective Differential Privacy* (SDP) to protect only the sensitive tokens defined by a policy function. However, their algorithm only works for RNN-based models. In this paper, we develop a novel framework, *Just Fine-tune Twice* (JFT), that achieves SDP for state-of-the-art large transformer-based models. Our method is easy to implement: it first fine-tunes the model with *redacted* in-domain data, and then fine-tunes it again with the *original* in-domain data using a private training mechanism. Furthermore, we study the scenario of imperfect implementation of policy functions that misses sensitive tokens and develop systematic methods to handle it. Experiments show that our method achieves strong utility compared to previous baselines. We also analyze the SDP privacy guarantee empirically with the canary insertion attack.", "track": "Ethics", "label": 21, "url": "https://www.semanticscholar.org/reader/8790088ce8fa252db117ba0b51aaf0847ba967f1?experiments=&features=reader_skimming%3Atrue"}, {"loc": [3.6276538372039795, 9.820080757141113], "id": 1922, "title": "Factorizing Content and Budget Decisions in Abstractive Summarization of Long Documents", "authors": "Marcio Fonseca, Yftah Ziser and Shay B. Cohen", "abstract": "We argue that disentangling content selection from the budget used to cover salient content improves the performance and applicability of abstractive summarizers. Our method, FactorSum, does this disentanglement by factorizing summarization into two steps through an energy function: (1) generation of abstractive summary views covering salient information in subsets of the input document (document views); (2) combination of these views into a final summary, following a budget and content guidance. This guidance may come from different sources, including from an advisor model such as BART or BigBird, or in oracle mode -- from the reference. This factorization achieves significantly higher ROUGE scores on multiple benchmarks for long document summarization, namely PubMed, arXiv, and GovReport. Most notably, our model is effective for domain adaptation. When trained only on PubMed samples, it achieves a 46.29 ROUGE-1 score on arXiv, outperforming PEGASUS trained in domain by a large margin. Our experimental results indicate that the performance gains are due to more flexible budget adaptation and processing of shorter contexts provided by partial document views.", "track": "Summarization", "label": 14, "url": ""}, {"loc": [6.068068981170654, 12.478471755981445], "id": 1926, "title": "Open-Domain Sign Language Translation Learned from Online Video", "authors": "Bowen Shi, Diane K. Brentari, Gregory Shakhnarovich and Karen Livescu", "abstract": "Existing work on sign language translation -- that is, translation from sign language videos into sentences in a written language -- has focused mainly on (1) data collected in a controlled environment or (2) data in a specific domain, which limits the applicability to real-world settings. In this paper, we introduce OpenASL, a large-scale American Sign Language (ASL) - English dataset collected from online video sites (e.g., YouTube).\nOpenASL contains 288 hours of ASL videos in multiple domains from over 200 signers and is the largest publicly available ASL translation dataset to date. To tackle the challenges of sign language translation in realistic settings and without glosses, we propose a set of techniques including sign search as a pretext task for pre-training and fusion of mouthing and handshape features. The proposed techniques produce consistent and large improvements in translation quality, over baseline models based\non prior work.", "track": "Speech, Vision, Robotics, Multimodal Grounding", "label": 7, "url": "https://www.semanticscholar.org/reader/9f9bec2b0b27fa6995940fe493418e400ebc7420?experiments=&features=reader_skimming%3Atrue"}, {"loc": [8.924873352050781, 7.937226295471191], "id": 1930, "title": "Improving Temporal Generalization of Pre-trained Language Models with Lexical Semantic Change", "authors": "Zhaochen Su, Zecheng Tang, xinyan guan, Lijun Wu, Min Zhang and Juntao Li", "abstract": "Recent research has revealed that neural language models at scale suffer from poor temporal generalization capability, i.e., language model pre-trained on static data from past years performs worse over time on emerging data. Existing methods mainly perform continual training to mitigate such a misalignment. While effective to some extent but is far from being addressed on both the language modeling and downstream tasks. In this paper, we empirically observe that temporal generalization is closely affiliated with lexical semantic change, which is one of the essential phenomena of natural languages. Based on this observation, we propose a simple yet effective lexical-level masking strategy to post-train a converged language model. Experiments on two pre-trained language models, two different classification tasks, and four benchmark datasets demonstrate the effectiveness of our proposed method over existing temporal adaptation methods, i.e., continual training with new data. Our code is available at https://github.com/zhaochen0110/LMLM.", "track": "Language Modeling and Analysis of Language Models", "label": 2, "url": ""}, {"loc": [5.691197395324707, 10.660399436950684], "id": 1934, "title": "ULN: Towards Underspecified Vision-and-Language Navigation", "authors": "Weixi Feng, Tsu-Jui Fu, Yujie Lu and William Yang Wang", "abstract": "Vision-and-Language Navigation (VLN) is a task to guide an embodied agent moving to a target position using language instructions. Despite the significant performance improvement, the wide use of fine-grained instructions fails to characterize more practical linguistic variations in reality. To fill in this gap, we introduce a new setting, namely Underspecified vision-and-Language Navigation (ULN), and associated evaluation datasets. ULN evaluates agents using multi-level underspecified instructions instead of purely fine-grained or coarse-grained, which is a more realistic and general setting. As a primary step toward ULN, we propose a VLN framework that consists of a classification module, a navigation agent, and an Exploitation-to-Exploration (E2E) module. Specifically, we propose to learn Granularity Specific Sub-networks (GSS) for the agent to ground multi-level instructions with minimal additional parameters. Then, our E2E module estimates grounding uncertainty and conducts multi-step lookahead exploration to improve the success rate further. Experimental results show that existing VLN models are still brittle to multi-level language underspecification. Our framework is more robust and outperforms the baselines on ULN by ~10% relative success rate across all levels.", "track": "Speech, Vision, Robotics, Multimodal Grounding", "label": 7, "url": "https://www.semanticscholar.org/reader/5bcbc760ceb2d288b756965836106005e1f2a271?experiments=&features=reader_skimming%3Atrue"}, {"loc": [8.085122108459473, 3.07778263092041], "id": 1935, "title": "Federated Model Decomposition with Private Vocabulary for Text Classification", "authors": "Zhuo Zhang, Xiangjing Hu, Lizhen Qu, Qifan Wang and Zenglin Xu", "abstract": "With the necessity of privacy protection, it becomes increasingly vital to train deep neural models in a federated learning manner for natural language processing (NLP) tasks. However, recent studies show eavesdroppers (i.e., dishonest servers) can still reconstruct the private input in federated learning (FL). Such a data reconstruction attack relies on the mappings between vocabulary and associated word embedding in NLP tasks, which are unfortunately less studied in current FL methods. In this paper, we propose a fedrated model decomposition method that protects the privacy of vocabularies, shorted as FEDEVOCAB. In FEDEVOCAB, each participant keeps the local embedding layer in the local device and detaches the local embedding parameters from federated aggregation. However, it is challenging to train an accurate NLP model when the private mappings are unknown and vary across participants in a cross-device FL setting. To address this problem, we further propose an adaptive updating technique to improve the performance of local models. Experimental results show that FEDEVOCAB maintains competitive performance and provides better privacy-preserving capacity compared to status quo methods.", "track": "NLP Applications", "label": 0, "url": ""}, {"loc": [5.040955543518066, 5.4097113609313965], "id": 1958, "title": "ReCo: Reliable Causal Chain Reasoning via Structural Causal Recurrent Neural Networks", "authors": "Kai Xiong, Xiao Ding, Zhongyang Li, Li Du, Ting Liu, Bing Qin, Yi Zheng and baoxing Huai", "abstract": "Causal chain reasoning (CCR) is an essential ability for many decision-making AI systems, which requires the model to build reliable causal chains by connecting causal pairs. However, CCR suffers from two main transitive problems: threshold effect and scene drift. In other words, the causal pairs to be spliced may have a conflicting threshold boundary or scenario.\nTo address these issues, we propose a novel Reliable Causal chain reasoning framework (ReCo), which introduces exogenous variables to represent the threshold and scene factors of each causal pair within the causal chain, and estimates the threshold and scene contradictions across exogenous variables via structural causal recurrent neural networks (SRNN). Experiments show that ReCo outperforms a series of strong baselines on both Chinese and English CCR datasets. Moreover, by injecting reliable causal chain knowledge distilled by ReCo, BERT can achieve better performances on four downstream causal-related tasks than BERT models enhanced by other kinds of knowledge.", "track": "Commonsense Reasoning", "label": 19, "url": ""}, {"loc": [5.542981147766113, 11.663244247436523], "id": 1961, "title": "Video Question Answering: Datasets, Algorithms and Challenges", "authors": "Yaoyao Zhong, Wei Ji, Junbin Xiao, Yicong Li, Weihong Deng and Tat-Seng Chua", "abstract": "This survey aims to sort out the recent advances in video question answering (VideoQA) and point towards future directions. We firstly categorize the datasets into 1) normal VideoQA, multi-modal VideoQA and knowledge-based VideoQA, according to the modalities invoked in the question-answer pairs, or 2) factoid VideoQA and inference VideoQA, according to the technical challenges in comprehending the questions and deriving the correct answers. We then summarize the VideoQA techniques, including those mainly designed for Factoid QA (e.g., the early spatio-temporal attention-based methods and the recently Transformer-based ones) and those targeted at explicit relation and logic inference (e.g., neural modular networks, neural symbolic methods, and graph-structured methods). Aside from the backbone techniques, we delve into the specific models and find out some common and useful insights either for video modeling, question answering, or for cross-modal correspondence learning. Finally, we point out the research trend of studying beyond factoid VideoQA to inference VideoQA, as well as towards the robustness and interpretability. Additionally, we maintain a repository, https://github.com/VRU-NExT/VideoQA, to keep trace of the latest VideoQA papers, datasets, and their open-source implementations if available. \nWith these efforts, we strongly hope this survey could shed light on the follow-up VideoQA research.", "track": "Question Answering", "label": 11, "url": "https://www.semanticscholar.org/reader/4cb65c1541acde658a95bb8a038cefdade703da5?experiments=&features=reader_skimming%3Atrue"}, {"loc": [7.972160339355469, 5.789251327514648], "id": 1962, "title": "Retrofitting Multilingual Sentence Embeddings with Abstract Meaning Representation", "authors": "Deng Cai, Xin Li, Jackie Chun-Sing Ho, Lidong Bing and Wai Lam", "abstract": "We introduce a new method to improve existing multilingual sentence embeddings with Abstract Meaning Representation (AMR). Compared with the original textual input, AMR is a structured semantic representation that presents the core concepts and relations in a sentence explicitly and unambiguously. It also helps reduce the surface variations across different expressions and languages. Unlike most prior work that only evaluates the ability to measure semantic similarity, we present a thorough evaluation of existing multilingual sentence embeddings and our improved versions, which include a collection of five transfer tasks in different downstream applications. Experiment results show that retrofitting multilingual sentence embeddings with AMR leads to better state-of-the-art performance on both semantic textual similarity and transfer tasks.", "track": "Semantics: Lexical, Sentence level, Textual Inference and Other areas", "label": 8, "url": "https://www.semanticscholar.org/reader/37fd65d01fbbde65c02800864c2f32770c30d17f?experiments=&features=reader_skimming%3Atrue"}, {"loc": [10.6474027633667, 7.39369535446167], "id": 1969, "title": "Breaking the Representation Bottleneck of Chinese Characters: Neural Machine Translation with Stroke Sequence Modeling", "authors": "Zhijun Wang, Xuebo Liu and Min Zhang", "abstract": "Existing research generally treats Chinese character as a minimum unit for representation. However, such Chinese character representation will suffer two bottlenecks: 1) Learning bottleneck, the learning cannot benefit from its rich internal features (e.g., radicals and strokes); and 2) Parameter bottleneck, each individual character has to be represented by a unique vector. In this paper, we introduce a novel representation method for Chinese characters to break the bottlenecks, namely StrokeNet, which represents a Chinese character by a Latinized stroke sequence (e.g., \"\u51f9 (concave)\" to \"ajaie\" and \"\u51f8 (convex)\" to \"aeaqe\"). Specifically, StrokeNet maps each stroke to a specific Latin character, thus allowing similar Chinese characters to have similar Latin representations. With the introduction of StrokeNet to neural machine translation (NMT), many powerful but not applicable techniques to non-Latin languages (e.g., shared subword vocabulary learning and ciphertext-based data augmentation) can now be perfectly implemented. Experiments on the widely-used NIST Chinese-English, WMT17 Chinese-English and IWSLT17 Japanese-English NMT tasks show that StrokeNet can provide a significant performance boost over the strong baselines with fewer model parameters, achieving 26.5 BLEU on the WMT17 Chinese-English task which is better than any previously reported results without using monolingual data. Code and scripts are freely available at https://github.com/zjwang21/StrokeNet.", "track": "Machine Translation", "label": 10, "url": ""}, {"loc": [0.9955535531044006, 10.487765312194824], "id": 1978, "title": "Boundary-Driven Table-Filling for Aspect Sentiment Triplet Extraction", "authors": "Yice Zhang, Yifan Yang, Yihui Li, Bin Liang, Shiwei Chen, Yixue Dang, Min Yang and Ruifeng Xu", "abstract": "Aspect Sentiment Triplet Extraction (ASTE) aims to extract the aspect terms along with the corresponding opinion terms and the expressed sentiments in the review, which is an important task in sentiment analysis. Previous research efforts generally address the ASTE task in an end-to-end fashion through the table-filling formalization, in which the triplets are represented by a two-dimensional (2D) table of word-pair relations. Under this formalization, a term-level relation is decomposed into multiple independent word-level relations, which leads to relation inconsistency and boundary insensitivity in the face of multi-word aspect terms and opinion terms. To overcome these issues, we propose Boundary-Driven Table-Filling (BDTF), which represents each triplet as a relation region in the 2D table and transforms the ASTE task into detection and classification of relation regions. We also notice that the quality of the table representation greatly affects the performance of BDTF. Therefore, we develop an effective relation representation learning approach to learn the table representation, which can fully exploit both word-to-word interactions and relation-to-relation interactions. Experiments on several public benchmarks show that the proposed approach achieves state-of-the-art performances.", "track": "NLP Applications", "label": 0, "url": ""}, {"loc": [1.708221435546875, 8.741342544555664], "id": 1990, "title": "Attention and Edge-Label Guided Graph Convolutional Networks for Named Entity Recognition", "authors": "Renjie Zhou, Zhongyi Xie, Jian Wan, Jilin Zhang, Yong Liao and Qiang Liu", "abstract": "It has been shown that named entity recognition (NER) could benefit from incorporating the long-distance structured information captured by dependency trees. However, dependency trees built by tools usually have a certain percentage of errors. Under such circumstances, how to better use relevant structured information while ignoring irrelevant or wrong structured information from the dependency trees to improve NER performance is still a challenging research problem. In this paper, we propose the Attention and Edge-Label guided Graph Convolution Network (AELGCN) model. Then, we integrate it into BiLSTM-CRF to form BiLSTM-AELGCN-CRF model. We design an edge-aware node joint update module and introduce a node-aware edge update module to explore hidden in structured information entirely and solve the wrong dependency label information to some extent. After two modules, we apply attention-guided GCN, which automatically learns how to attend to the relevant structured information selectively. We conduct extensive experiments on several standard datasets across four languages and achieve better results than previous approaches. Through experimental analysis, it is found that our proposed model can better exploit the structured information on the dependency tree to improve the recognition of long entities.", "track": "Information Extraction", "label": 5, "url": ""}, {"loc": [2.1043202877044678, 7.574521064758301], "id": 1997, "title": "Title2Event: Benchmarking Open Event Extraction with a Large-scale Chinese Title Dataset", "authors": "Haolin Deng, Yanan Zhang, Yangfan Zhang, Wangyang Ying, Changlong Yu, Jun Gao, Wei Wang, Xiaoling Bai, Nan Yang, Jin Ma, xiang chen and tianhua zhou", "abstract": "Event extraction (EE) is crucial to downstream tasks such as new aggregation and event knowledge graph construction. Most existing EE datasets manually define fixed event types and design specific schema for each of them, failing to cover diverse events emerging from the online text. Moreover, news titles, an important source of event mentions, have not gained enough attention in current EE research. In this paper, we present Title2Event, a large-scale sentence-level dataset benchmarking Open Event Extraction without restricting event types. Title2Event contains more than 42,000 news titles in 34 topics collected from Chinese web pages. To the best of our knowledge, it is currently the largest manually annotated Chinese dataset for open event extraction. We further conduct experiments on Title2Event with different models and show that the characteristics of titles make it challenging for event extraction, addressing the significance of advanced study on this problem. The dataset and baseline codes are available at https://open-event-hub.github.io/title2event.", "track": "Resources and Evaluation", "label": 1, "url": "https://www.semanticscholar.org/reader/04b2e2607000076fd9a3f63b533a0ef8732da6bc?experiments=&features=reader_skimming%3Atrue"}, {"loc": [5.632648468017578, 5.509811878204346], "id": 2018, "title": "Cascading Biases: Investigating the Effect of Heuristic Annotation Strategies on Data and Models", "authors": "Chaitanya Malaviya, Sudeep Bhatia and Mark Yatskar", "abstract": "Cognitive psychologists have documented that humans use cognitive heuristics, or mental shortcuts, to make quick decisions while expending less effort. While performing annotation work on crowdsourcing platforms, we hypothesize that such heuristic use among annotators cascades on to data quality and model robustness. In this work, we study cognitive heuristic use in the context of annotating multiple-choice reading comprehension datasets. We propose tracking annotator heuristic traces, where we tangibly measure low-effort annotation strategies that could indicate usage of various cognitive heuristics. We find evidence that annotators might be using multiple such heuristics, based on correlations with a battery of psychological tests. Importantly, heuristic use among annotators determines data quality along several dimensions: (1) known biased models, such as partial input models, more easily solve examples authored\nby annotators that rate highly on heuristic use, (2) models trained on annotators scoring highly on heuristic use don't generalize as well, and (3) heuristic-seeking annotators tend to create qualitatively less challenging examples. Our findings suggest that tracking heuristic usage among annotators can potentially help with collecting challenging datasets and diagnosing model biases.", "track": "Linguistic Theories, Cognitive Modeling and Psycholinguistics", "label": 22, "url": "https://www.semanticscholar.org/reader/a94cc2b747a8c885c6006a1181512f6488fb0bff?experiments=&features=reader_skimming%3Atrue"}, {"loc": [3.8742270469665527, 4.28428840637207], "id": 2024, "title": "Teaching Broad Reasoning Skills for Multi-Step QA by Generating Hard Contexts", "authors": "Harsh Trivedi, Niranjan Balasubramanian, Tushar Khot and Ashish Sabharwal", "abstract": "Question-answering datasets require a broad set of reasoning skills. We show how to use question decompositions to teach language models these broad reasoning skills in a robust fashion. Specifically, we use widely available QDMR representations to programmatically create hard-to-cheat synthetic contexts for real questions in six multi-step reasoning datasets. These contexts are carefully designed to avoid common reasoning shortcuts prevalent in real contexts that prevent models from learning the right skills. This results in a pretraining dataset, named TeaBReaC, containing 525K multi-step questions (with associated formal programs) covering about 900 reasoning patterns. We show that pretraining standard language models (LMs) on TeaBReaC before fine-tuning them on target datasets improves their performance by up to 13 F1 points across 4 multi-step QA datasets, with up to 21 point gain on more complex questions. The resulting models also demonstrate higher robustness, with a 5-8 F1 point improvement on two contrast sets. Furthermore, TeaBReaC pretraining substantially improves model performance and robustness even when starting with numerate LMs pretrained using recent methods (e.g., PReasM, POET). Our work thus shows how to effectively use decomposition-guided contexts to robustly teach multi-step reasoning.", "track": "Question Answering", "label": 11, "url": "https://www.semanticscholar.org/reader/3bdf6c90c694e7b5900e45e43b1a44fd4f2f0360?experiments=&features=reader_skimming%3Atrue"}, {"loc": [7.597898006439209, 3.6674375534057617], "id": 2038, "title": "ADDMU: Detection of Far-Boundary Adversarial Examples with Data and Model Uncertainty Estimation", "authors": "Fan Yin, Yao Li, Cho-Jui Hsieh and Kai-Wei Chang", "abstract": "Adversarial Examples Detection (AED) is a crucial defense technique against adversarial attacks and has drawn increasing attention from the Natural Language Processing (NLP) community. Despite the surge of new AED methods, our studies show that existing methods heavily rely on a shortcut to achieve good performance. In other words, current search-based adversarial attacks in NLP stop once model predictions change, and thus most adversarial examples generated by those attacks are located near model decision boundaries. To surpass this shortcut and fairly evaluate AED methods, we propose to test AED methods with \\textbf{F}ar \\textbf{B}oundary (\\textbf{FB}) adversarial examples. Existing methods show worse than random guess performance under this scenario. To overcome this limitation, we propose a new technique, \\textbf{ADDMU}, \\textbf{a}dversary \\textbf{d}etection with \\textbf{d}ata and \\textbf{m}odel \\textbf{u}ncertainty, which combines two types of uncertainty estimation for both regular and FB adversarial example detection. Our new method outperforms previous methods by 3.6 and 6.0 \\emph{AUC} points under each scenario. Finally, our analysis shows that the two types of uncertainty provided by \\textbf{ADDMU} can be leveraged to characterize adversarial\nexamples and identify the ones that contribute most to model's robustness in adversarial training.", "track": "Interpretability, Interactivity and Analysis of Models for NLP", "label": 9, "url": "https://www.semanticscholar.org/reader/199ccbe851168c02e41be85b51e57538f3421175?experiments=&features=reader_skimming%3Atrue"}, {"loc": [8.273724555969238, 8.698738098144531], "id": 2040, "title": "G-MAP: General Memory-Augmented Pre-trained Language Model for Domain Tasks", "authors": "Zhongwei Wan, Yichun Yin, Wei Zhang, Jiaxin Shi, Lifeng Shang, Guangyong Chen, Xin Jiang and Qun Liu", "abstract": "General pre-trained language models (PLMs), such as BERT, have achieved remarkable performance on various NLP tasks. Recently, domain-specific PLMs have been proposed to boost the task performance of specific domains (e.g., biomedical and computer science) by continuing to pre-train general PLMs with domain-specific corpora. However, this domain-adaptive pre-training (DAPT \\cite{DBLP:conf/acl/GururanganMSLBD20}) tends to forget the previous general knowledge acquired by general PLMs, which leads to a \\emph{catastrophic forgetting} phenomenon and sub-optimal performance. To alleviate this problem, we propose a new framework of \\textbf{M}emory-\\textbf{A}ugmented \\textbf{P}re-trained Language Model (\\textbf{MAP}), which augments the domain-specific PLM by a memory built from the frozen general PLM without losing the general knowledge. Specifically, we propose a new memory-augmented layer, and based on it, different augmentation strategies are explored to build memory and fusion memory into domain-specific PLM. We demonstrate the effectiveness of MAP on different domains (biomedical and computer science publications, news, and reviews) and different kinds (text classification, QA, NER) of tasks, and the extensive results show that the proposed MAP can achieve SOTA results on these tasks.", "track": "Machine Learning for NLP", "label": 3, "url": ""}, {"loc": [5.497122764587402, 12.16763973236084], "id": 2051, "title": "Towards Unifying Reference Expression Generation and Comprehension", "authors": "Duo Zheng, Tao Kong, Ya Jing, Jiaan Wang and Xiaojie WANG", "abstract": "Reference Expression Generation (REG) and Comprehension (REC) are two highly correlated tasks. Modeling REG and REC simultaneously for utilizing the relation between them is a promising way to improve both. However, the problem of distinct inputs, as well as building connections between them in a single model, brings challenges to the design and training of the joint model. To address the problems, we propose a unified model for REG and REC, named UniRef. It unifies these two tasks with the carefully-designed Image-Region-Text Fusion layer (IRTF), which fuses the image, region and text via the image cross-attention and region cross-attention. Additionally, IRTF could generate pseudo input regions for the REC task to enable a uniform way for sharing the identical representation space across the REC and REG. We further propose Vision-conditioned Masked Language Modeling (VMLM) and Text-Conditioned Region Prediction (TRP) to pre-train UniRef model on multi-granular corpora. The VMLM and TRP are directly related to REG and REC, respectively, but could help each other. We conduct extensive experiments on three benchmark datasets, RefCOCO, RefCOCO+ and RefCOCOg. Experimental results show that our model outperforms previous state-of-the-art methods on both REG and REC.", "track": "Speech, Vision, Robotics, Multimodal Grounding", "label": 7, "url": "https://www.semanticscholar.org/reader/2b2048bfe6ffb6cb390aa299ce34687a493f8c2a?experiments=&features=reader_skimming%3Atrue"}, {"loc": [7.579550266265869, 3.6938905715942383], "id": 2053, "title": "Textual Manifold-based Defense Against Natural Language Adversarial Examples", "authors": "Dang Nguyen Minh and Anh Tuan Luu", "abstract": "Despite the recent success of large pretrained language models in NLP, they are susceptible to adversarial examples. Concurrently, several studies on adversarial images have observed an intriguing property: the adversarial images tend to leave the low-dimensional natural data manifold. In this study, we find a similar phenomenon occurs in the contextualized embedding space of natural sentences induced by pretrained language models in which textual adversarial examples tend to have their embeddings diverge off the manifold of natural sentence embeddings. Based on this finding, we propose Textual Manifold-based Defense (TMD), a defense mechanism that learns the embedding space manifold of the underlying language model and projects novel inputs back to the approximated structure before classification. Through extensive experiments, we find that our method consistently and significantly outperforms previous defenses under various attack settings while remaining unaffected to the clean accuracy. To the best of our knowledge, this is the first kind of manifold-based defense adapted to the NLP domain.", "track": "Machine Learning for NLP", "label": 3, "url": "https://www.semanticscholar.org/reader/877bd47e214b858933a8e4cb53c5d74a1b095fc4?experiments=&features=reader_skimming%3Atrue"}, {"loc": [8.69739818572998, 8.289453506469727], "id": 2071, "title": "Tiny-Attention Adapter: Contexts Are More Important Than the Number of Parameters", "authors": "Hongyu Zhao, Hao Tan and Hongyuan Mei", "abstract": "Adapter-tuning is a paradigm that transfers a pretrained language model to downstream tasks by adding and tuning a small number of new parameters. Previously proposed adapter architectures are all feed-forward neural networks. In this paper, we investigate the effectiveness of using tiny-attention---i.e., attention with extremely small per-head dimensionality---as adapters. Our tiny-attention adapter learns to modify the hidden states at each position directly conditioned on the hidden states at all the other positions, which is missed by the previously proposed adapters. Moreover, we view its multiple attention heads as a mixture of experts and propose to average their weights during deployment, which further reduces its inference computation cost. On the GLUE benchmark, our tiny-attention adapter outperforms the other parameter-efficient transfer learning methods as well as full fine-tuning while only updating 0.05% of the parameters. On the FewGLUE benchmark, its performance is comparable to that of GPT-3 and PET.", "track": "Efficient Methods for NLP", "label": 12, "url": "https://www.semanticscholar.org/reader/5c919b3669aaa382daba912be0b6f7f492e6d2ef?experiments=&features=reader_skimming%3Atrue"}, {"loc": [9.85632038116455, 7.325463771820068], "id": 2072, "title": "Reduce Catastrophic Forgetting of Dense Retrieval Training with Teleportation Negatives", "authors": "Si Sun, Chenyan Xiong, Yue Yu, Arnold Overwijk, Zhiyuan Liu and Jie Bao", "abstract": "In this paper, we investigate the instability in the standard dense retrieval training, which iterates between model training and hard negative selection using the being-trained model. We show the catastrophic forgetting phenomena behind the training instability, where models learn and forget different negative groups during training iterations. We then propose ANCE-Tele, which accumulates momentum negatives from past iterations and approximates future iterations using lookahead negatives, as \"teleportations\" along the time axis to smooth the learning process. On web search and OpenQA, ANCE-Tele outperforms previous state-of-the-art systems of similar size, eliminates the dependency on sparse retrieval negatives, and is competitive among systems using significantly more (50x) parameters. Our analysis demonstrates that teleportation negatives reduce catastrophic forgetting and improve convergence speed for dense retrieval training. The source code of this paper is available at https://github.com/OpenMatch/ANCE-Tele.", "track": "Information Retrieval and Text Mining", "label": 15, "url": ""}, {"loc": [7.951879501342773, 8.736644744873047], "id": 2076, "title": "ATTEMPT: Parameter-Efficient Multi-task Tuning via Attentional Mixtures of Soft Prompts", "authors": "Akari Asai, Mohammadreza Salehi, Matthew Peters and Hannaneh Hajishirzi", "abstract": "This work introduces a new multi-task, parameter-efficient language model (LM) tuning method that learns to transfer knowledge across different tasks via a mixture of soft prompts---small prefix embedding vectors pre-trained for different tasks. Our method, called ATTEMPT (ATTEntional Mixtures of Prompt Tuning), obtains source prompts as encodings of large-scale source tasks into a small number of parameters and trains an attention module to interpolate the source prompts and a newly initialized target prompt for every instance in the target task. During training, only the target task prompt and the attention weights, which are shared between tasks in multi-task training, are updated, while the original LM and source prompts are intact. ATTEMPT is highly parameter-efficient (e.g., updates  2,300 times fewer parameters than full fine-tuning), while it overcomes instability of prompt tuning and achieves high task performance using learned knowledge from high-resource tasks. Moreover, it is modular using pre-trained soft prompts, and can flexibly add or remove source prompts for effective knowledge transfer. Our experimental results across 21 diverse NLP datasets show that ATTEMPT significantly outperforms prompt tuning and outperforms or matches fully fine-tuned or other parameter-efficient tuning approaches that use 10 times more parameters. Finally,  ATTEMPT outperforms previous work in few-shot learning settings.", "track": "Language Modeling and Analysis of Language Models", "label": 2, "url": ""}, {"loc": [5.172458171844482, 12.411921501159668], "id": 2077, "title": "Exploration of the Usage of Color Terms by Color-blind Participants in Online Discussion Platforms", "authors": "Ella Rabinovich and Boaz Carmeli", "abstract": "Prominent questions about the role of sensory vs. linguistic input in the way we acquire and use language have been extensively studied in the psycholinguistic literature. However, the relative effect of various factors in  a person's overall experience on their linguistic system remains unclear. We study this question by making a step forward towards a better understanding of the conceptual perception of colors by color-blind individuals, as reflected in their spontaneous linguistic productions. Using a novel and carefully curated dataset, we show that red-green color-blind speakers use the \"red\" and \"green\" color terms in less predictable contexts, and in linguistic environments evoking mental image to a lower extent, when compared to their normal-sighted counterparts. These findings shed some new and interesting light on the role of sensory experience on our linguistic system.", "track": "Ethic Concerns:Linguistic Theories, Cognitive Modeling and Psycholinguistics", "label": 22, "url": ""}, {"loc": [0.6542259454727173, 7.624789714813232], "id": 2079, "title": "DEER: Descriptive Knowledge Graph for Explaining Entity Relationships", "authors": "Jie Huang, Kerui Zhu, Kevin Chang, Jinjun Xiong and Wen-mei Hwu", "abstract": "We propose DEER (Descriptive Knowledge Graph for Explaining Entity Relationships) - an open and informative form of modeling entity relationships. In DEER, relationships between entities are represented by free-text relation descriptions. For instance, the relationship between entities of machine learning and algorithm can be represented as ``Machine learning explores the study and construction of algorithms that can learn from and make predictions on data.'' To construct DEER, we propose a self-supervised learning method to extract relation descriptions with the analysis of dependency patterns and generate relation descriptions with a transformer-based relation description synthesizing model, where no human labeling is required. Experiments demonstrate that our system can extract and generate high-quality relation descriptions for explaining entity relationships. The results suggest that we can build an open and informative knowledge graph without human annotation.", "track": "Semantics: Lexical, Sentence level, Textual Inference and Other areas", "label": 8, "url": "https://www.semanticscholar.org/reader/f0575b2b10e2178f9675a6d92ab7cb80015948d0?experiments=&features=reader_skimming%3Atrue"}, {"loc": [4.232655048370361, 7.570635795593262], "id": 2081, "title": "META-GUI: Towards Multi-modal Conversational Agents on Mobile GUI", "authors": "Liangtai Sun, Xingyu Chen, Lu Chen, Tianle Dai, Zichen Zhu and Kai Yu", "abstract": "Task-oriented dialogue (TOD) systems have been widely used by mobile phone intelligent assistants to accomplish tasks such as calendar scheduling or hotel reservation. Current TOD systems usually focus on multi-turn text/speech interaction, then they would call back-end APIs designed for TODs to perform the task. However, this API-based architecture greatly limits the information-searching capability of intelligent assistants and may even lead to task failure if TOD-specific APIs are not available or the task is too complicated to be executed by the provided APIs. In this paper, we propose a new TOD architecture: GUI-based task-oriented dialogue system (GUI-TOD). A GUI-TOD system can directly perform GUI operations on real APPs and execute tasks without invoking TOD-specific backend APIs. Furthermore, we release META-GUI, a dataset for training a Multi-modal convErsaTional Agent on mobile GUI. We also propose a multi-model action prediction and response model, which show promising results on META-GUI. The dataset, codes and leaderboard are publicly available.", "track": "Dialogue and Interactive Systems", "label": 4, "url": ""}, {"loc": [8.467928886413574, 7.9325056076049805], "id": 2085, "title": "Understanding and Improving Knowledge Distillation for Quantization Aware Training of Large Transformer Encoders", "authors": "Minsoo Kim, Sihwa Lee, Suk-Jin Hong, Du-Seong Chang and Jungwook Choi", "abstract": "Knowledge distillation (KD) has been a ubiquitous method for model compression to strengthen the capability of a lightweight model with the transferred knowledge from the teacher. In particular, KD has been employed in quantization-aware training (QAT) of Transformer encoders like BERT to improve the accuracy of the student model with the reduced-precision weight parameters. However, little is understood about which of the various KD approaches best fits the QAT of Transformers. In this work, we provide an in-depth analysis of the mechanism of KD on attention recovery of quantized large Transformers. In particular, we reveal that the previously adopted MSE loss on the attention score is insufficient for recovering the self-attention information. Therefore, we propose two KD methods; attention-map and attention-output losses. Furthermore, we explore the unification of both losses to address task-dependent preference between attention-map and output losses. The experimental results on various Transformer encoder models demonstrate that the proposed KD methods achieve state-of-the-art accuracy for QAT with sub-2-bit weight quantization.", "track": "Efficient Methods for NLP", "label": 12, "url": ""}, {"loc": [8.805910110473633, 8.075787544250488], "id": 2101, "title": "Exploring Mode Connectivity for Pre-trained Language Models", "authors": "Yujia Qin, Cheng Qian, Jing Yi, Weize Chen, Yankai Lin, Xu Han, Zhiyuan Liu, Maosong Sun and Jie Zhou", "abstract": "Recent years have witnessed the prevalent application of pre-trained language models (PLMs) in NLP. From the perspective of parameter space, PLMs provide generic initialization, starting from which high-performance minima could be found. Although plenty of works have studied how to effectively and efficiently adapt PLMs to high-performance minima, little is known about the connection of various minima reached under different adaptation configurations. In this paper, we investigate the geometric connections of different minima through the lens of mode connectivity, which measures whether two minima can be connected with a low-loss path. We conduct empirical analyses to investigate three questions: (1) how could hyperparameters, specific tuning methods, and training data affect PLM's mode connectivity? (2) How does mode connectivity change during pre-training? (3) How does the PLM's task knowledge change along the path connecting two minima? In general, exploring the mode connectivity of PLMs conduces to understanding the geometric connection of different minima, which may help us fathom the inner workings of PLM downstream adaptation. The codes are publicly available at https://github.com/thunlp/Mode-Connectivity-PLM.", "track": "Language Modeling and Analysis of Language Models", "label": 2, "url": "https://www.semanticscholar.org/reader/02c873a69b8702e3848f942fefb7437ec012422c?experiments=&features=reader_skimming%3Atrue"}, {"loc": [10.258220672607422, 6.747270107269287], "id": 2104, "title": "Synergy with Translation Artifacts for Training and Inference in Multilingual Tasks", "authors": "Jaehoon Oh, Jongwoo Ko and Se-Young Yun", "abstract": "Translation has played a crucial role in improving the performance on multilingual tasks: (1) to generate the target language data from the source language data for training and (2) to generate the source language data from the target language data for inference. However, prior works have not considered the use of both translations simultaneously. This paper shows that combining them can synergize the results on various multilingual sentence classification tasks. We empirically find that translation artifacts stylized by translators are the main factor of the performance gain. Based on this analysis, we adopt two training methods, SupCon and MixUp, considering translation artifacts. Furthermore, we propose a cross-lingual fine-tuning algorithm called MUSC, which uses SupCon and MixUp jointly and improves the performance. Our code is available at https://github.com/jongwooko/MUSC.", "track": "Multilinguality", "label": 13, "url": "https://www.semanticscholar.org/reader/5702dd4a04e9c998c018d58164bafedd55da0b85?experiments=&features=reader_skimming%3Atrue"}, {"loc": [6.135923862457275, 12.493571281433105], "id": 2105, "title": "Increasing Visual Awareness in Multimodal Neural Machine Translation from an Information Theoretic Perspective", "authors": "Baijun Ji, Tong Zhang, Yicheng Zou, Bojie Hu and si shen", "abstract": "Multimodal machine translation (MMT) aims to improve translation quality by equipping the source sentence with its corresponding image. Despite the promising performance, MMT models still suffer the problem of input degradation: models focus more on textual information while visual information is generally overlooked. In this paper, we endeavor to improve MMT performance by increasing visual awareness from an information theoretic perspective. In detail, we decompose the informative visual signals into two parts: source-specific information and target-specific information. We use mutual information to quantify them and propose two methods for  objective optimization to better leverage visual signals. Experiments on two datasets demonstrate that our approach can effectively enhance the visual awareness of MMT model and achieve superior results against strong baselines.", "track": "Machine Translation", "label": 10, "url": "https://www.semanticscholar.org/reader/8e1b951309ca6a5925d056d5b2a89a4f678480c0?experiments=&features=reader_skimming%3Atrue"}, {"loc": [2.221330404281616, 7.7354841232299805], "id": 2114, "title": "Improving Event Coreference Resolution Using Document-level and Topic-level Information", "authors": "Sheng Xu, Peifeng Li and Qiaoming Zhu", "abstract": "Event coreference resolution (ECR) aims to cluster event mentions that refer to the same real-world events. Deep learning methods have achieved SOTA results on the ECR task. However, due to the encoding length limitation, previous methods either adopt classical pairwise models based on sentence-level context or split each document into multiple chunks and encode them separately. They failed to capture the interactions and contextual cues among those long-distance event mentions. Besides, high-level information, such as event topics, is rarely considered to enhance representation learning for ECR. To address the above two issues, we first apply a Longformer-based encoder to obtain the document-level embeddings and an encoder with a trigger-mask mechanism to learn sentence-level embeddings based on local context. In addition, we propose an event topic generator to infer the latent topic-level representations. Finally, using the above event embeddings, we employ a multiple tensor matching method to capture their interactions at the document, sentence, and topic levels. Experimental results on the KBP 2017 dataset show that our model outperforms the SOTA baselines.", "track": "Information Extraction", "label": 5, "url": ""}, {"loc": [7.667898654937744, 8.778020858764648], "id": 2124, "title": "Vector-Quantized Input-Contextualized Soft Prompts for Natural Language Understanding", "authors": "Rishabh Bhardwaj, Amrita Saha, Steven C.H. Hoi and Soujanya Poria", "abstract": "Prompt Tuning has been largely successful as a parameter-efficient method of conditioning large-scale pre-trained language models to perform downstream tasks. Thus far, soft prompt tuning learns a fixed set of task-specific continuous vectors, i.e., soft tokens that remain static across the task samples. A fixed prompt, however, may not generalize well to the diverse kinds of inputs the task comprises. In order to address this, we propose Vector-quantized Input-contextualized Prompts (VIP) as an extension to the soft prompt tuning framework. VIP particularly focuses on two aspects---contextual prompts that learns input-specific contextualization of the soft prompt tokens through a small-scale sentence encoder and quantized prompts that maps the contextualized prompts to a set of learnable codebook vectors through a Vector quantization network. On various language understanding tasks like SuperGLUE, QA, Relation classification, NER and NLI,  VIP outperforms the soft prompt tuning (PT) baseline by an average margin of 1.19%. Further, our generalization studies show that VIP learns more robust prompt representations, surpassing PT by a margin of 0.6% - 5.3% on Out-of-domain QA and NLI tasks respectively, and by 0.75% on Multi-Task setup over 4 tasks spanning across 12 domains.", "track": "Efficient Methods for NLP", "label": 12, "url": "https://www.semanticscholar.org/reader/5bdb78fb79e54679a8bb45b05f77a8bf5989cfdf?experiments=&features=reader_skimming%3Atrue"}, {"loc": [7.8026227951049805, 8.669318199157715], "id": 2128, "title": "Boosting Natural Language Generation from Instructions with Meta-Learning", "authors": "Budhaditya Deb, Ahmed Hassan Awadallah and Guoqing Zheng", "abstract": "Recent work has shown that language models (LMs) trained with multi-task \\textit{instructional learning} (MTIL) can solve diverse NLP tasks in zero- and few-shot settings with improved performance compared to prompt tuning. MTIL illustrates that LMs can extract and use information about the task from instructions beyond the surface patterns of the inputs and outputs. This suggests that meta-learning may further enhance the utilization of instructions for effective task transfer. In this paper we investigate whether  meta-learning applied to MTIL can further improve  generalization  to unseen tasks in a zero-shot setting. Specifically, we propose to adapt meta-learning to MTIL in three directions: 1) Model Agnostic Meta Learning (MAML), 2) Hyper-Network (HNet) based adaptation to generate task specific parameters conditioned on instructions, and 3) an approach combining HNet and MAML. Through extensive experiments on the large scale Natural Instructions V2 dataset, we show that our proposed approaches significantly improve over strong baselines in zero-shot settings. In particular, meta-learning improves the effectiveness of instructions and is most impactful when the test tasks are strictly zero-shot (i.e. no similar tasks in the training set) and are \"hard\" for LMs, illustrating the potential of meta-learning for MTIL for out-of-distribution tasks.", "track": "Language Modeling and Analysis of Language Models", "label": 2, "url": "https://www.semanticscholar.org/reader/3c414e3125c12dbd23f62e6c1b85c1a4dc9a522e?experiments=&features=reader_skimming%3Atrue"}, {"loc": [4.019964218139648, 9.293288230895996], "id": 2137, "title": "Topical Segmentation of Spoken Narratives: A Test Case on Holocaust Survivor Testimonies", "authors": "Eitan Wagner, Renana Keydar, Amit Pinchevski and Omri Abend", "abstract": "The task of topical segmentation is well studied, but previous work has mostly addressed it in the context of structured, well-defined segments, such as segmentation into paragraphs, chapters, or segmenting text that originated from multiple sources. We tackle the task of segmenting running (spoken) narratives, which poses hitherto unaddressed challenges. As a test case, we address Holocaust survivor testimonies, given in English. Other than the importance of studying these testimonies for Holocaust research, we argue that they provide an interesting test case for topical segmentation, due to their unstructured surface level, relative abundance (tens of thousands of such testimonies were collected), and the relatively confined domain that they cover. We hypothesize that boundary points between segments correspond to low mutual information between the sentences proceeding and following the boundary. Based on this hypothesis, we explore a range of algorithmic approaches to the task, building on previous work on segmentation that uses generative Bayesian modeling and state-of-the-art neural machinery. Compared to manually annotated references, we find that the developed approaches show considerable improvements over previous work.", "track": "NLP Applications", "label": 0, "url": "https://www.semanticscholar.org/reader/29a037e391f29fed7a01f31a52d850eaeae8644a?experiments=&features=reader_skimming%3Atrue"}, {"loc": [10.287161827087402, 6.855659008026123], "id": 2141, "title": "Unifying the Convergences in Multilingual Neural Machine Translation", "authors": "yichong huang, Xiaocheng Feng, Xinwei Geng and Bing Qin", "abstract": "Although all-in-one-model multilingual neural machine translation (MNMT) has achieved remarkable progress, the convergence inconsistency in the joint training is ignored, i.e., different language pairs reaching convergence in different epochs. This leads to the trained MNMT model over-fitting low-resource language translations while under-fitting high-resource ones. In this paper, we propose a novel training strategy named LSSD (LanguageSpecific Self-Distillation), which can alleviate the convergence inconsistency and help MNMT models achieve the best performance on each language pair simultaneously. Specifically, LSSD picks up language-specific best checkpoints for each language pair to teach the current model on the fly. Furthermore, we systematically explore three sample-level manipulations of knowledge transferring. Experimental results on three datasets show that LSSD obtains consistent improvements towards all language pairs and achieves the state-of-the-art.", "track": "Machine Translation", "label": 10, "url": "https://www.semanticscholar.org/reader/1f32937d02f8e2665af37f7939bf6a556c7ca07b?experiments=&features=reader_skimming%3Atrue"}, {"loc": [1.583666443824768, 8.56206226348877], "id": 2153, "title": "Modeling Label Correlations for Ultra-Fine Entity Typing with Neural Pairwise Conditional Random Field", "authors": "Chengyue Jiang, Yong Jiang, Weiqi Wu, Pengjun Xie and Kewei Tu", "abstract": "Ultra-fine entity typing (UFET) aims to predict a wide range of type phrases that correctly describe the categories of a given entity mention in a sentence. \n    Most recent works infer each entity type independently, ignoring the correlations between types, e.g., when an entity is inferred as a {\\it president}, it should also be a {\\it politician} and a {\\it leader}.\n    To this end, we use an undirected graphical model called pairwise conditional random field (PCRF) to formulate the UFET problem, in which the type variables are not only unarily influenced by the input but also pairwisely relate to all the other type variables.\n    We use various modern backbones for entity typing to compute unary potentials, and derive pairwise potentials from type phrase representations that both capture prior semantic information and facilitate accelerated inference. We use mean-field variational inference for efficient type inference on very large type sets and unfold it as a neural network module to enable end-to-end training. \n    Experiments on UFET show that the Neural-PCRF consistently outperforms its backbones with little cost and results in a competitive performance against cross-encoder based SOTA while being \\emph{thousands of times} faster. We also find Neural-PCRF effective on a widely used fine-grained entity typing dataset with a smaller type set. We pack Neural-PCRF as a network module that can be plugged onto multi-label type classifiers with ease and release it in \\code.", "track": "Information Extraction", "label": 5, "url": ""}, {"loc": [5.128573894500732, 8.847064018249512], "id": 2155, "title": "Help me write a Poem - Instruction Tuning as a Vehicle for Collaborative Poetry Writing", "authors": "Tuhin Chakrabarty, Vishakh Padmakumar and He He", "abstract": "Recent work in training large language models (LLMs) to follow natural language instructions has opened up exciting opportunities for natural language interface design. Building on the prior success of large language models in the realm of computer assisted creativity, in this work, we present \\textit{CoPoet}, a collaborative poetry writing system, with the goal of to study if LLM's actually improve the quality of the generated content. In contrast to auto-completing a user's text, CoPoet is controlled by user instructions that specify the attributes of the desired text, such as \\textit{Write a sentence about 'love'} or \\textit{Write a sentence ending in 'fly'}. The core component of our system is a language model fine-tuned on a diverse collection of instructions for poetry writing. Our model is not only competitive to publicly available LLMs trained on instructions (InstructGPT), but also capable of satisfying unseen compositional instructions. A study with 15 qualified crowdworkers shows that users successfully write poems with CoPoet on diverse topics ranging from \\textit{Monarchy} to \\textit{Climate change}, which are preferred by third-party evaluators over poems written without the system.", "track": "Natural Language Generation", "label": 6, "url": "https://www.semanticscholar.org/reader/77a94f6c91ee1590dd2c6fd80b4a6d8bffdb91ac?experiments=&features=reader_skimming%3Atrue"}, {"loc": [1.1655627489089966, 7.677905559539795], "id": 2157, "title": "Open Relation and Event Type Discovery with Type Abstraction", "authors": "Sha Li, Heng Ji and Jiawei Han", "abstract": "Conventional \"closed-world\" information extraction (IE) approaches rely on human ontologies to define the scope for extraction. As a result, such approaches fall short when applied to new domains. This calls for systems that can automatically infer new types from given corpora, a task which we refer to as type discovery.\nTo tackle this problem, we introduce the idea of type abstraction, where the model is prompted to generalize and name the type. Then we use the similarity between inferred names to induce clusters. Observing that this abstraction-based representation is often complementary to the entity/trigger token representation, we set up these two representations as two views and design our model as a co-training framework. \nOur experiments on multiple relation extraction and event extraction datasets consistently show the advantage of our type abstraction approach.", "track": "Information Extraction", "label": 5, "url": ""}, {"loc": [0.7691812515258789, 6.9129719734191895], "id": 2160, "title": "Enhancing Multilingual Language Model with Massive Multilingual Knowledge Triples", "authors": "Linlin Liu, Xin Li, Ruidan He, Lidong Bing, Shafiq Joty and Luo Si", "abstract": "Knowledge-enhanced language representation learning has shown promising results across various knowledge-intensive NLP tasks. However, prior methods are limited in efficient utilization of multilingual knowledge graph (KG) data for language model (LM) pretraining. They often train LMs with KGs in indirect ways, relying on extra entity/relation embeddings to facilitate knowledge injection. In this work, we explore methods to make better use of the multilingual annotation and language agnostic property of KG triples, and present novel knowledge based multilingual language models (KMLMs) trained directly on the knowledge triples. We first generate a large amount of multilingual synthetic sentences using the Wikidata KG triples. Then based on the intra- and inter-sentence structures of the generated data, we design pretraining tasks to enable the LMs to not only memorize the factual knowledge but also learn useful logical patterns. Our pretrained KMLMs demonstrate significant performance improvements on a wide range of knowledge-intensive cross-lingual tasks, including named entity recognition (NER), factual knowledge retrieval, relation classification, and a newly designed logical reasoning task.", "track": "Multilinguality", "label": 13, "url": "https://www.semanticscholar.org/reader/a466d10b80dbdee3b130bef73ec62f3a89eb389b?experiments=&features=reader_skimming%3Atrue"}, {"loc": [10.777545928955078, 9.305002212524414], "id": 2164, "title": "Revisiting Grammatical Error Correction Evaluation and Beyond", "authors": "Peiyuan Gong, Xuebo Liu, Heyan Huang and Min Zhang", "abstract": "Pretraining-based (PT-based) automatic evaluation metrics (e.g., BERTScore and BARTScore) have been widely used in several sentence generation tasks (e.g., machine translation and text summarization) due to their better correlation with human judgments over traditional overlap-based methods. Although PT-based methods have become the de facto standard for training grammatical error correction (GEC) systems, GEC evaluation still does not benefit from pretrained knowledge. This paper takes the first step towards understanding and improving GEC evaluation with pretraining. We first find that arbitrarily applying PT-based metrics to GEC evaluation brings unsatisfactory correlation results because of the excessive attention to inessential systems outputs (e.g., unchanged parts). To alleviate the limitation, we propose a novel GEC evaluation metric to achieve the best of both worlds, namely PT-M2 which only uses PT-based metrics to score those corrected parts. Experimental results on the CoNLL14 evaluation task show that PT-M2 significantly outperforms existing methods, achieving a new state-of-the-art result of 0.949 Pearson correlation. Further analysis reveals that PT-M2 is robust to evaluate competitive GEC systems. Source code and scripts are freely available at https://github.com/pygongnlp/PT-M2.", "track": "Natural Language Generation", "label": 6, "url": "https://www.semanticscholar.org/reader/c84165f7601871997f795357c55d12523b31f3e4?experiments=&features=reader_skimming%3Atrue"}, {"loc": [5.695117950439453, 8.577905654907227], "id": 2166, "title": "R2D2: Robust Data-to-Text with Replacement Detection", "authors": "Linyong Nan, Lorenzo Jaime Flores, Yilun Zhao, Yixin Liu, Luke Benson, Weijin Zou and Dragomir Radev", "abstract": "Unfaithful text generation is a common problem for text generation systems. In the case of Data-to-Text (D2T) systems, the factuality of the generated text is particularly crucial for any real-world applications. We introduce R2D2, a training framework that addresses unfaithful Data-to-Text generation by training a system both as a generator and a faithfulness discriminator with additional replacement detection and unlikelihood learning tasks. To facilitate such training, we propose two methods for sampling unfaithful sentences. We argue that the poor entity retrieval capability of D2T systems is one of the primary sources of unfaithfulness, so in addition to the existing metrics, we further propose named entity based metrics to evaluate the fidelity of D2T generations. Our experimental results show that R2D2 systems could effectively mitigate the unfaithful text generation, and they achieve new state-of-theart results on FeTaQA, LogicNLG, and ToTTo, all with significant improvements.", "track": "Natural Language Generation", "label": 6, "url": "https://www.semanticscholar.org/reader/4c9c07ae5d81e067d3b1ecaf18a0ddcbea213fa3?experiments=&features=reader_skimming%3Atrue"}, {"loc": [2.8934531211853027, 4.71160364151001], "id": 2174, "title": "IDK-MRC: Unanswerable Questions for Indonesian Machine Reading Comprehension", "authors": "Rifki Afina Putri and Alice Oh", "abstract": "Machine Reading Comprehension (MRC) has become one of the essential tasks in Natural Language Understanding (NLU) as it is often included in several NLU benchmarks (Liang et al., 2020; Wilie et al., 2020). However, most MRC datasets only have answerable question type, overlooking the importance of unanswerable questions. MRC models trained only on answerable questions will select the span that is most likely to be the answer, even when the answer does not actually exist in the given passage (Rajpurkar et al., 2018). This problem especially remains in medium- to low-resource languages like Indonesian. Existing Indonesian MRC datasets (Purwarianti et al., 2007; Clark et al., 2020) are still inadequate because of the small size and limited question types, i.e., they only cover answerable questions. To fill this gap, we build a new Indonesian MRC dataset called I(n)don'tKnow- MRC (IDK-MRC) by combining the automatic and manual unanswerable question generation to minimize the cost of manual dataset construction while maintaining the dataset quality. Combined with the existing answerable questions, IDK-MRC consists of more than 10K questions in total. Our analysis shows that our dataset significantly improves the performance of Indonesian MRC models, showing a large improvement for unanswerable questions.", "track": "Resources and Evaluation", "label": 1, "url": "https://www.semanticscholar.org/reader/4b14fb1ae60ceeaec9ccbf2c03475d324de507b2?experiments=&features=reader_skimming%3Atrue"}, {"loc": [10.57345199584961, 7.651828289031982], "id": 2190, "title": "XLM-D: Decorate Cross-lingual Pre-training Model as Non-Autoregressive Neural Machine Translation", "authors": "Yong Wang, Shilin He, Guanhua Chen, Yun Chen and Daxin Jiang", "abstract": "Pre-training language models have achieved thriving success in numerous natural language understanding and autoregressive generation tasks, but non-autoregressive generation in applications such as machine translation has not sufficiently benefited from the pre-training paradigm. In this work, we establish the connection between a pre-trained masked language model (MLM) and non-autoregressive generation on machine translation. From this perspective, we present XLM-D, which seamlessly transforms an off-the-shelf cross-lingual pre-training model into a non-autoregressive translation (NAT) model with a lightweight yet effective decorator. Specifically, the decorator ensures the representation consistency of the pre-trained model and brings only one additional trainable parameter. Extensive experiments on typical translation datasets show that our models obtain state-of-the-art performance while realizing the inference speed-up by 19.9x. One striking result is that on WMT14 En-De, our XLM-D obtains 29.80 BLEU points with multiple iterations, which outperforms the previous mask-predict model by 2.77 points.", "track": "Machine Translation", "label": 10, "url": ""}, {"loc": [0.6945322155952454, 7.86568546295166], "id": 2212, "title": "Cross-stitching Text and Knowledge Graph Encoders for Distantly Supervised Relation Extraction", "authors": "Qin Dai, Benjamin Heinzerling and Kentaro Inui", "abstract": "Bi-encoder architectures for distantly-supervised relation extraction are designed to make use of the complementary information found in text and knowledge graphs (KG).\nHowever, current architectures suffer from two drawbacks. They either do not allow any sharing between the text encoder and the KG encoder at all, or, in case of models with KG-to-text attention, only share information in one direction. Here, we introduce cross-stitch bi-encoders, which allow full interaction between the text encoder and the KG encoder via a cross-stitch mechanism. The cross-stitch mechanism allows sharing and updating representations between the two encoders at any layer, with the amount of sharing being dynamically controlled via cross-attention-based gates. Experimental results on two relation extraction benchmarks from two different domains show that enabling full interaction between the two encoders yields strong improvements.", "track": "Information Extraction", "label": 5, "url": "https://www.semanticscholar.org/reader/10f3cf6dc50f9d52a313481f103daf959d567479?experiments=&features=reader_skimming%3Atrue"}, {"loc": [5.682833194732666, 11.834573745727539], "id": 2217, "title": "Assist Non-native Viewers: Multimodal Cross-Lingual Summarization for How2 Videos", "authors": "Nayu Liu, Kaiwen Wei, Xian Sun, Hongfeng Yu, Fanglong Yao, li jin, Guo Zhi and Guangluan Xu", "abstract": "Multimodal summarization for videos aims to generate summaries from multi-source information (videos, audio transcripts), which has achieved promising progress. However, existing works are restricted to monolingual video scenarios, ignoring the demands of non-native video viewers to understand the cross-language videos in practical applications. It stimulates us to propose a new task, named Multimodal Cross-Lingual Summarization for videos (MCLS), which aims to generate cross-lingual summaries from multimodal inputs of videos. First, to make it applicable to MCLS scenarios, we conduct a Video-guided Dual Fusion network (VDF) that integrates multimodal and cross-lingual information via diverse fusion strategies at both encoder and decoder. Moreover, to alleviate the problem of high annotation costs and limited resources in MCLS, we propose a triple-stage training framework to assist MCLS by transferring the knowledge from monolingual multimodal summarization data, which includes: 1) multimodal summarization on sufficient prevalent language videos with a VDF model; 2) knowledge distillation (KD) guided adjustment on bilingual transcripts; 3) multimodal summarization for cross-lingual videos with a KD induced VDF model. Experiment results on the reorganized How2 dataset show that the VDF model alone outperforms previous methods for multimodal summarization, and the performance further improves by a large margin via the proposed triple-stage training framework.", "track": "Summarization", "label": 14, "url": ""}, {"loc": [2.7172839641571045, 4.711459159851074], "id": 2223, "title": "PACIFIC: Towards Proactive Conversational Question Answering over Tabular and Textual Data in Finance", "authors": "Yang Deng, Wenqiang Lei, Wenxuan Zhang, Wai Lam and Tat-Seng Chua", "abstract": "To facilitate conversational question answering (CQA) over hybrid contexts in finance, we present a new dataset, named PACIFIC. Compared with existing CQA datasets, PACIFIC exhibits three key features: (i) proactivity, (ii) numerical reasoning, and (iii) hybrid context of tables and text. A new task is defined accordingly to study Proactive Conversational Question Answering (PCQA), which combines clarification question generation and CQA. In addition, we propose a novel method, namely UniPCQA, to adapt a hybrid format of input and output content in PCQA into the Seq2Seq problem, including the reformulation of the numerical reasoning process as code generation. UniPCQA performs multi-task learning over all sub-tasks in PCQA and incorporates a simple ensemble strategy to alleviate the error propagation issue in the multi-task learning by cross-validating top-$k$ sampled Seq2Seq outputs. We benchmark the PACIFIC dataset with extensive baselines and provide comprehensive evaluations on each sub-task of PCQA.", "track": "Question Answering", "label": 11, "url": "https://www.semanticscholar.org/reader/c094cfee1e93cb76f5fc867ae6d89c83ed0d55ef?experiments=&features=reader_skimming%3Atrue"}, {"loc": [4.354979515075684, 5.935750961303711], "id": 2245, "title": "Generative Data Augmentation with Contrastive Learning for Zero-Shot Stance Detection", "authors": "Yang Li and Jiawei Yuan", "abstract": "Stance detection aims to identify whether the author of an opinionated text is in favor of, against, or neutral towards a given target. \nRemarkable success has been achieved when sufficient labeled training data is available. \nHowever, it is labor-intensive to annotate sufficient data and train the model for every new target.\nTherefore, zero-shot stance detection, aiming at identifying stances of unseen targets with seen targets, has gradually attracted attention. \nAmong them, one of the important challenges is to reduce the domain transfer between seen and unseen targets.  \nTo tackle this problem, we propose a generative data augmentation approach to generate training samples containing targets and stances for testing data, and map the real samples and generated synthetic samples into the same embedding space with contrastive learning, then perform the final classification based on the augmented data. We evaluate our proposed model on two benchmark datasets. Experimental results show that our approach achieves state-of-the-art performance on most topics in the task of zero-shot stance detection.", "track": "Sentiment Analysis, Stylistic Analysis, and Argument Mining", "label": 16, "url": ""}, {"loc": [0.8079336285591125, 7.561835765838623], "id": 2249, "title": "Better Few-Shot Relation Extraction with Label Prompt Dropout", "authors": "Peiyuan Zhang and Wei Lu", "abstract": "Few-shot relation extraction aims to learn to identify the relation between two entities based on very limited training examples. Recent efforts found that textual labels (i.e., relation names and relation descriptions) could be extremely useful for learning class representations, which will benefit the few-shot learning task. However, what is the best way to leverage such label information in the learning process is an important research question. Existing works largely assume such textual labels are always present during both learning and prediction. In this work, we argue that such approaches may not always lead to optimal results. Instead, we present a novel approach called label prompt dropout, which randomly removes label descriptions in the learning process. Our experiments show that our approach is able to lead to improved class representations, yielding significantly better results on the few-shot relation extraction task.", "track": "Information Extraction", "label": 5, "url": "https://www.semanticscholar.org/reader/faf73f722cb72f6fd4a0ebf9646f5e3407a72609?experiments=&features=reader_skimming%3Atrue"}, {"loc": [8.652482986450195, 6.012907981872559], "id": 2251, "title": "Break it Down into BTS: Basic, Tiniest Subword Units for Korean", "authors": "Nayeon Kim, Jun-Hyung Park, Joon-Young Choi, Eojin JEJ Jeon, Youjin Kang and SangKeun Lee", "abstract": "We introduce Basic, Tiniest Subword (BTS) units for the Korean language, which are inspired by the invention principle of Hangeul, the Korean writing system. Instead of relying on 51 Korean consonant and vowel letters, we form the letters from BTS units by adding strokes or combining them. To examine the impact of BTS units on Korean language processing, we develop a novel BTS-based word embedding framework that is readily applicable to various models. Our experiments reveal that BTS units significantly improve the performance of Korean word embedding on all intrinsic and extrinsic tasks in our evaluation. In particular, BTS-based word embedding outperforms the state-of-theart Korean word embedding by 11.8% in word analogy. We further investigate the unique advantages provided by BTS units through indepth analysis.", "track": "Phonology, Morphology and Word Segmentation", "label": 25, "url": ""}, {"loc": [8.556219100952148, 7.872621536254883], "id": 2271, "title": "The Devil in Linear Transformer", "authors": "Zhen Qin, XiaoDong Han, Weixuan Sun, Dongxu Li, Lingpeng Kong, Nick Barnes and Yiran Zhong", "abstract": "Linear transformers aim to reduce the quadratic space-time complexity of vanilla transformers. However, they usually suffer from degraded performances on various tasks and corpus. In this paper, we examine existing kernel-based linear transformers and identify two key issues that lead to such performance gaps: 1) unbounded gradients in the attention computation adversely impact the convergence of linear transformer models; 2) attention dilution which trivially distributes attention scores over long sequences while neglecting neighbouring structures. To address these issues, we first identify that the scaling of attention matrices is the devil in unbounded gradients, which turns out unnecessary in linear attention as we show theoretically and empirically. To this end, we propose a new linear attention that replaces the scaling operation with a normalization to stabilize gradients. For the issue of attention dilution, we leverage a diagonal attention to confine attention to only neighbouring tokens in early layers. Benefiting from the stable gradients and improved attention, our new linear transformer model, transNormer, demonstrates superior performance on text classification and language modeling tasks, as well as on the challenging Long-Range Arena benchmark, surpassing vanilla transformer and existing linear variants by a clear margin while being significantly more space-time efficient. The code is available at https://github.com/OpenNLPLab/Transnormer .", "track": "Machine Learning for NLP", "label": 3, "url": "https://www.semanticscholar.org/reader/e3fc46d5f4aae2c7a8a86b6bd21ca8db5d40fcbd?experiments=&features=reader_skimming%3Atrue"}, {"loc": [7.997725009918213, 9.699125289916992], "id": 2273, "title": "Zero-Shot Learners for Natural Language Understanding via a Unified Multiple Choice Perspective", "authors": "Ping Yang, Junjie Wang, Ruyi Gan, Xinyu Zhu, Lin Zhang, Ziwei Wu, Xinyu Gao, Jiaxing Zhang and Tetsuya Sakai", "abstract": "We propose a new paradigm for zero-shot learners that is format agnostic, i.e., it is compatible with any format and applicable to a list of language tasks, such as text classification, commonsense reasoning, coreference resolution, and sentiment analysis. Zero-shot learning aims to train a model on a given task such that it can address new learning tasks without any additional training. Our approach converts zero-shot learning into multiple-choice tasks, avoiding problems in commonly used large-scale generative models such as FLAN. It not only adds generalization ability to models but also significantly reduces the number of parameters. Our method shares the merits of efficient training and deployment. Our approach shows state-of-the-art performance on several benchmarks and produces satisfactory results on tasks such as natural language inference and text classification. Our model achieves this success with only 235M parameters, which is substantially smaller than state-of-the-art models with billions of parameters. The code and pre-trained models are available at https://github.com/IDEA-CCNL/Fengshenbang-LM/tree/main/fengshen/examples/unimc .", "track": "Language Modeling and Analysis of Language Models", "label": 2, "url": "https://www.semanticscholar.org/reader/8862ed012fe06a794fda3ceae3f471a0c2a40fbe?experiments=&features=reader_skimming%3Atrue"}, {"loc": [10.549112319946289, 7.258500099182129], "id": 2280, "title": "Hypoformer: Hybrid Decomposition Transformer for Edge-friendly Neural Machine Translation", "authors": "sunzhu li, Peng Zhang, Guobing Gan, Lv Xiuqing, Benyou Wang, Junqiu Wei and Xin Jiang", "abstract": "Transformer has been demonstrated effective in Neural Machine Translation (NMT). However, it is memory-consuming and time-consuming in edge devices, resulting in some difficulties for real-time feedback. To compress and accelerate Transformer, we propose a  Hybrid Tensor-Train (HTT) decomposition, which retains full rank and meanwhile reduces operations and parameters. \nA Transformer using HTT,  named Hypoformer, consistently and notably outperforms the recent light-weight SOTA methods on three standard translation tasks under different parameter and speed scales.  In extreme low resource scenarios, Hypoformer has 7.1 points absolute improvement in  BLEU  and  1.27 X speedup than vanilla Transformer on IWSLT'14 De-En task.", "track": "Machine Translation", "label": 10, "url": ""}, {"loc": [6.460926532745361, 12.332314491271973], "id": 2281, "title": "FigMemes: A Dataset for Figurative Language Identification in Politically-Opinionated Memes", "authors": "Chen Liu, Gregor Geigle, Robin Krebs and Iryna Gurevych", "abstract": "Real-world politically-opinionated memes often rely on figurative language to cloak propaganda and radical ideas to help them spread. It is not only a scientific challenge to develop machine learning models to recognize them in memes, but also sociologically beneficial to understand hidden meanings at scale and raise awareness. These memes are fast-evolving (in both topics and visuals) and it remains unclear whether current multimodal machine learning models are robust to such distribution shifts. To enable future research into this area, we first present FigMemes, a dataset for figurative language classification in politically-opinionated memes. We evaluate the performance of state-of-the-art unimodal and multimodal models and provide comprehensive benchmark results. The key contributions of this proposed dataset include annotations of six commonly used types of figurative language in politically-opinionated memes, and a wide range of topics and visual styles.\nWe also provide analyses on the ability of multimodal models to generalize across distribution shifts in memes. Our dataset poses unique machine learning challenges and our results show that current models have significant room for improvement in both performance and robustness to distribution shifts.", "track": "Resources and Evaluation", "label": 1, "url": ""}, {"loc": [0.6469632983207703, 7.781680107116699], "id": 2289, "title": "UniRel: Unified Representation and Interaction for Joint Relational Triple Extraction", "authors": "Wei Tang, Benfeng Xu, Yuyue Zhao, Zhendong Mao, Yifeng Liu, Yong Liao and Haiyong Xie", "abstract": "Relational triple extraction is challenging for its difficulty in capturing rich correlations between entities and relations. Existing works suffer from 1) heterogeneous representations of entities and relations, and 2) heterogeneous modeling of entity-entity interactions and entity-relation interactions. Therefore, the rich correlations are not fully exploited by existing works. In this paper, we propose UniRel to address these challenges. Specifically, we unify the representations of entities and relations by jointly encoding them within a concatenated natural language sequence, and unify the modeling of interactions with a proposed Interaction Map, which is built upon the off-the-shelf self-attention mechanism within any Transformer block. With comprehensive experiments on two popular relational triple extraction datasets, we demonstrate that UniRel is more effective and computationally efficient. The source code is available at https://github.com/wtangdev/UniRel.", "track": "Information Extraction", "label": 5, "url": "https://www.semanticscholar.org/reader/c9f28c6fce7eb9f505875daa9b078f4f9d15c20a?experiments=&features=reader_skimming%3Atrue"}, {"loc": [3.7879815101623535, 9.520407676696777], "id": 2290, "title": "X-FACTOR: A Cross-metric Evaluation of Factual Correctness in Abstractive Summarization", "authors": "Subhajit Chaudhury, Sarathkrishna Swaminathan, Chulaka Gunasekara, Maxwell Crouse, Srinivas Ravishankar, Daiki Kimura, Keerthiram Murugesan, Ram\u00f3n Fernandez Astudillo, Tahira Naseem, Pavan Kapanipathi and Alexander Gray", "abstract": "Abstractive summarization models often produce factually inconsistent summaries that are not supported by the original article. Recently, a number of fact-consistent evaluation techniques have been proposed to address this issue; however, a detailed analysis of how these metrics agree with one another has yet to be conducted. In this paper, we present X-FACTOR, a cross-evaluation of three high-performing fact-aware abstractive summarization methods. First, we show that summarization models are often fine-tuned on datasets that contain factually inconsistent summaries and propose a fact-aware filtering mechanism that improves the quality of training data and, consequently, the factuality of these models. Second, we propose a corrector module that can be used to improve the factual consistency of generated summaries. Third, we present a re-ranking technique that samples summary instances from the output distribution of a summarization model and re-ranks the sampled instances based on their factuality. Finally, we provide a detailed cross-metric agreement analysis that shows how tuning a model to output summaries based on a particular factuality metric influences factuality as determined by the other metrics. Our goal in this work is to facilitate research that improves the factuality and faithfulness of abstractive summarization models.", "track": "Summarization", "label": 14, "url": ""}, {"loc": [8.136359214782715, 5.221707820892334], "id": 2302, "title": "ParaTag: A Dataset of Paraphrase Tagging for Fine-Grained Labels, NLG Evaluation, and Data Augmentation", "authors": "Shuohang Wang, Ruochen Xu, Yang Liu, Chenguang Zhu and Michael Zeng", "abstract": "Paraphrase identification has been formulated as a binary classification task to decide whether two sentences hold a paraphrase relationship. Existing paraphrase datasets only annotate a binary label for each sentence pair. However, after a systematical analysis of existing paraphrase datasets, we found that the degree of paraphrase cannot be well characterized by a single binary label. And the criteria of paraphrase are not even consistent within the same dataset. We hypothesize that such issues would limit the effectiveness of paraphrase models trained on these data. To this end, we propose a novel fine-grained paraphrase annotation schema that labels the minimum spans of tokens in a sentence that don't have the corresponding paraphrases in the other sentence. Under this setting, we frame paraphrasing as a sequence tagging task. We collect 30k sentence pairs in English with the new annotation schema, resulting in the ParaTag dataset. In addition to reporting baseline results on ParaTag using state-of-art language models, we show that ParaTag is especially useful for training an automatic scorer for language generation evaluation. Finally, we train a paraphrase generation model from ParaTag and achieve better data augmentation performance on the GLUE benchmark than other public paraphrasing datasets.", "track": "Resources and Evaluation", "label": 1, "url": ""}, {"loc": [2.8944175243377686, 9.01243782043457], "id": 2308, "title": "Factual Accuracy is not Enough: Planning Consistent Description Order for Radiology Report Generation", "authors": "Toru Nishino, Yasuhide Miura, Tomoki Taniguchi, Tomoko Ohkuma, Yuki Suzuki, Shoji Kido and Noriyuki Tomiyama", "abstract": "Radiology report generation systems have the potential to reduce the workload of radiologists by automatically describing the findings in medical images.\nTo broaden the application of the report generation system, the system should generate reports that are not only factually accurate but also chronologically consistent, describing images that are presented in time order, that is, the correct order.\nWe employ a planning-based radiology report generation system that generates the overall structure of reports as \"plans'\" prior to generating reports that are accurate and consistent in order.\nAdditionally, we propose a novel reinforcement learning and inference method, Coordinated Planning (CoPlan), that includes a content planner and a text generator to train and infer in a coordinated manner to alleviate the cascading of errors that are often inherent in planning-based models.\nWe conducted experiments with single-phase diagnostic reports in which the factual accuracy is critical and multi-phase diagnostic reports in which the description order is critical.\nOur proposed CoPlan improves the content order score by 5.1 pt in time series critical scenarios and the clinical factual accuracy F-score by 9.1 pt in time series irrelevant scenarios, compared those of the baseline models without CoPlan.", "track": "NLP Applications", "label": 0, "url": ""}, {"loc": [5.1756486892700195, 4.886245250701904], "id": 2317, "title": "FLUTE: Figurative Language Understanding through Textual Explanations", "authors": "Tuhin Chakrabarty, Arkadiy Saakyan, Debanjan Ghosh and Smaranda Muresan", "abstract": "Figurative language understanding has been recently framed as a recognizing textual entailment (RTE) task (a.k.a. natural language inference (NLI)). However, similar to classical RTE/NLI datasets they suffer from spurious correlations and annotation artifacts. To tackle this problem, work on NLI has built explanation-based datasets such as eSNLI, allowing us to probe whether language models are right for the right reasons.  Yet no such data exists for figurative language, making it harder to assess genuine understanding of such expressions. To address this issue, we release FLUTE, a dataset of 9,000 figurative NLI instances with explanations, spanning four categories: Sarcasm, Simile, Metaphor, and Idioms. We collect the data through a Human-AI collaboration framework based on GPT-3, crowd workers, and expert annotators. We show how utilizing GPT-3 in conjunction with human annotators (novices and experts) can aid in scaling up the creation of datasets even for such complex linguistic phenomena as figurative language. The baseline performance of the T5 model fine-tuned on FLUTE shows that our dataset can bring us a step closer to developing models that understand figurative language through textual explanations.", "track": "Semantics: Lexical, Sentence level, Textual Inference and Other areas", "label": 8, "url": "https://www.semanticscholar.org/reader/fd975e67a2b7b2e43943ac32a16f5fd5be80734b?experiments=&features=reader_skimming%3Atrue"}, {"loc": [5.863219738006592, 8.872162818908691], "id": 2335, "title": "Precisely the Point: Adversarial Augmentations for Faithful and Informative Text Generation", "authors": "Wenhao Wu, Wei Li, Jiachen Liu, Xinyan Xiao, Sujian Li and Yajuan Lyu", "abstract": "Though model robustness has been extensively studied in language understanding, the robustness of Seq2Seq generation remains understudied.\nIn this paper, we conduct the first quantitative analysis on the robustness of pre-trained Seq2Seq models. \nWe find that even current SOTA pre-trained Seq2Seq model (BART) is still vulnerable, which leads to significant degeneration in faithfulness and informativeness for text generation tasks.\nThis motivated us to further propose a novel adversarial augmentation framework, namely AdvSeq, for generally improving faithfulness and informativeness of Seq2Seq models via enhancing their robustness. \nAdvSeq automatically constructs two types of adversarial augmentations during training, including implicit adversarial samples by perturbing word representations and explicit adversarial samples by word swapping, both of which effectively improve Seq2Seq robustness.\nExtensive experiments on three popular text generation tasks demonstrate that AdvSeq significantly improves both the faithfulness and informativeness of Seq2Seq generation under both automatic and human evaluation settings.", "track": "Natural Language Generation", "label": 6, "url": "https://www.semanticscholar.org/reader/c4b6a269f4adfc06508104b5b792e402105a1865?experiments=&features=reader_skimming%3Atrue"}, {"loc": [4.276088237762451, 4.522980690002441], "id": 2340, "title": "RLET: A Reinforcement Learning Based Approach for Explainable QA with Entailment Trees", "authors": "Tengxiao Liu, Qipeng Guo, Xiangkun Hu, Yue Zhang, Xipeng Qiu and Zheng Zhang", "abstract": "Interpreting the reasoning process from questions to answers poses a challenge in approaching explainable QA. A recently proposed structured reasoning format, entailment tree, manages to offer explicit logical deductions with entailment steps in a tree structure. To generate entailment trees, prior single pass sequence-to-sequence models lack visible internal decision probability, while stepwise approaches are supervised with extracted single step data and cannot model the tree as a whole. In this work, we propose RLET, a Reinforcement Learning based Entailment Tree generation framework, which is trained utilising the cumulative signals across the whole tree. RLET iteratively performs single step reasoning with sentence selection and deduction generation modules, from which the training signal is accumulated across the tree with elaborately designed aligned reward function that is consistent with the evaluation. To the best of our knowledge, we are the first to introduce RL into the entailment tree generation task. Experiments on three settings of the EntailmentBank dataset demonstrate the strength of using RL framework.", "track": "Question Answering", "label": 11, "url": ""}, {"loc": [5.438992023468018, 5.092628479003906], "id": 2341, "title": "Let the CAT out of the bag: Contrastive Attributed explanations for Text", "authors": "Saneem Ahmed Chemmengath, Amar Prakash Azad, Ronny Luss and Amit Dhurandhar", "abstract": "Contrastive explanations for understanding the behavior of black box models has gained a lot of attention recently as they provide potential for recourse. In this paper, we propose a method Contrastive Attributed explanations for Text (CAT) which provides contrastive explanations for natural language text data with a novel twist as we build and exploit attribute classifiers leading to more semantically meaningful explanations. To ensure that our contrastive generated text has the fewest possible edits with respect to the original text, while also being fluent and close to a human generated contrastive, we resort to a minimal perturbation approach regularized using a BERT language model and attribute classifiers trained on available attributes. We show through qualitative examples and a user study that our method not only conveys more insight because of these attributes, but also leads to better quality (contrastive) text. Quantitatively, we show that our method outperforms other state-of-the-art methods across four data sets on four benchmark metrics.", "track": "Interpretability, Interactivity and Analysis of Models for NLP", "label": 9, "url": "https://www.semanticscholar.org/reader/27b2ee756d49840d4b0a3f050b6525332b0b5eaa?experiments=&features=reader_skimming%3Atrue"}, {"loc": [2.7155025005340576, 4.661579608917236], "id": 2342, "title": "monoQA: Multi-Task Learning of Reranking and Answer Extraction for Open-Retrieval Conversational Question Answering", "authors": "Sarawoot Kongyoung, Craig Macdonald and Iadh Ounis", "abstract": "To address the Conversational Question Answering (ORConvQA) task, previous work has considered an effective three-stage architecture, consisting of a retriever, a reranker, and a reader to extract the answers. In order to effectively answer the users' questions, a number of existing approaches have applied multi-task learning, such that the same model is shared between the reranker and the reader. Such approaches also typically tackle reranking and reading as classification tasks. On the other hand, recent text generation models, such as monoT5 and UnifiedQA, have been shown to respectively yield impressive performances in passage reranking and reading. However, no prior work has combined monoT5 and UnifiedQA to share a single text generation model that directly extracts the answers for the users instead of predicting the start/end positions in a retrieved passage. In this paper, we investigate the use of Multi-Task Learning (MTL) to improve performance on the ORConvQA task by sharing the reranker and reader's learned structure in a generative model. In particular, we propose monoQA, which uses a text generation model with multi-task learning for both the reranker and reader. Our model, which is based on the T5 text generation model, is fine-tuned simultaneously for both reranking (in order to improve the precision of the top retrieved passages) and extracting the answer. Our results on the OR-QuAC and OR-CoQA datasets demonstrate the effectiveness of our proposed model, which significantly outperforms existing strong baselines with improvements ranging from +12.31% to +19.51% in MAP and from +5.70% to +23.34% in F1 on all used test sets.", "track": "Question Answering", "label": 11, "url": ""}, {"loc": [5.176757335662842, 8.874801635742188], "id": 2356, "title": "Composing Ci with Reinforced Non-autoregressive Text Generation", "authors": "Yan Song", "abstract": "Composing Ci (also widely known as Song Ci), a special type of classical Chinese poetry, requires to follow particular format once their tune patterns are given. To automatically generate a well-formed Ci, text generation systems should strictly take into account pre-defined rigid formats (e.g., length and rhyme). Yet, most existing approaches regard Ci generation as a conventional sequence-to-sequence task and use autoregressive models, while it is challenging for such models to properly handle the constraints (according to tune patterns) of Ci during the generation process. Moreover, consider that with the format prepared, Ci generation can be operated by an efficient synchronous process, where autoregressive models are limited in doing so since they follow the character-by-character generation protocol. Therefore, in this paper, we propose to compose Ci through a non-autoregressive approach, which not only ensure that the generation process accommodates tune patterns by controlling the rhythm and essential meaning of each sentence, but also allow the model to perform synchronous generation. In addition, we further improve our approach by applying reinforcement learning to the generation process with the rigid constraints of Ci as well as the diversity in content serving as rewards, so as to further maintain the format and content requirement. Experiments on a collected Ci dataset confirm that our proposed approach outperforms strong baselines and previous studies in terms of both automatic evaluation metrics and human judgements.", "track": "Natural Language Generation", "label": 6, "url": ""}, {"loc": [0.684380054473877, 6.527635097503662], "id": 2367, "title": "MetaTKG: Learning Evolutionary Meta-Knowledge for Temporal Knowledge Graph Reasoning", "authors": "Yuwei Xia, Mengqi Zhang, Qiang Liu, Shu Wu and Xiao-Yu Zhang", "abstract": "Reasoning over Temporal Knowledge Graphs (TKGs) aims to predict future facts based on given history. One of the key challenges for prediction is to learn the evolution of facts. Most existing works focus on exploring evolutionary information in history to obtain effective temporal embeddings for entities and relations, but they ignore the variation in evolution patterns of facts, which makes them struggle to adapt to future data with different evolution patterns. Moreover, new entities continue to emerge along with the evolution of facts over time. Since existing models highly rely on historical information to learn embeddings for entities, they perform poorly on such entities with little historical information. To tackle these issues, we propose a novel Temporal Meta-learning framework for TKG reasoning, MetaTKG for brevity. Specifically, our method regards TKG prediction as many temporal meta-tasks, and utilizes the designed Temporal Meta-learner to learn evolutionary meta-knowledge from these meta-tasks. The proposed method aims to guide the backbones to learn to adapt quickly to future data and deal with entities with little historical information by the learned meta-knowledge. Specially, in temporal meta-learner, we design a Gating Integration module to adaptively establish temporal correlations between meta-tasks. Extensive experiments on four widely-used datasets and three backbones demonstrate that our method can greatly improve the performance.", "track": "Information Extraction", "label": 5, "url": ""}, {"loc": [5.438526630401611, 12.231659889221191], "id": 2369, "title": "mPLUG: Effective and Efficient Vision-Language Learning by Cross-modal Skip-connections", "authors": "Chenliang Li, Haiyang Xu, Junfeng Tian, Wei Wang, Ming Yan, Bin Bi, Jiabo Ye, He Chen, Guohai Xu, Zheng Cao, Ji Zhang, Songfang Huang, Fei Huang, Jingren Zhou and Luo Si", "abstract": "Large-scale pre-trained foundation models have been an emerging paradigm for building artificial intelligence (AI) systems,  which can be quickly adapted to a wide range of downstream tasks. This paper presents mPLUG, a new vision-language foundation model for both cross-modal understanding and generation. Most existing pre-trained models suffer from inefficiency and linguistic signal overwhelmed by long visual sequences in cross-modal alignment. To address both problems, mPLUG introduces an effective and efficient vision-language architecture with novel cross-modal skip-connections.\n\nmPLUG is pre-trained end-to-end on large-scale image-text pairs with both discriminative and generative objectives. It achieves state-of-the-art results on a wide range of vision-language downstream tasks, including image captioning, image-text retrieval, visual grounding and visual question answering. mPLUG also demonstrates strong zero-shot transferability on vision-language and video-language tasks. The code and pre-trained models are available at https://github.com/alibaba/AliceMind", "track": "Speech, Vision, Robotics, Multimodal Grounding", "label": 7, "url": "https://www.semanticscholar.org/reader/5fa8f2a40ca9daa4063af8a27518bb7b74f890f2?experiments=&features=reader_skimming%3Atrue"}, {"loc": [4.0623579025268555, 7.182478427886963], "id": 2370, "title": "Q-TOD: A Query-driven Task-oriented Dialogue System", "authors": "Xin Tian, Yingzhan Lin, Mengfei Song, Siqi Bao, Fan Wang, Huang He, Shuqi SUN and Hua Wu", "abstract": "Existing pipelined task-oriented dialogue systems usually have difficulties adapting to unseen domains, whereas end-to-end systems are plagued by large-scale knowledge bases in practice. In this paper, we introduce a novel query-driven task-oriented dialogue system, namely Q-TOD. The essential information from the dialogue context is extracted into a query, which is further employed to retrieve relevant knowledge records for response generation. Firstly, as the query is in the form of natural language and not confined to the schema of the knowledge base, the issue of domain adaption is alleviated remarkably in Q-TOD. Secondly, as the query enables the decoupling of knowledge retrieval from the generation, Q-TOD gets rid of the issue of knowledge base scalability. To evaluate the effectiveness of the proposed Q-TOD, we collect query annotations for three publicly available task-oriented dialogue datasets. Comprehensive experiments verify that Q-TOD outperforms strong baselines and establishes a new state-of-the-art performance on these datasets.", "track": "Dialogue and Interactive Systems", "label": 4, "url": "https://www.semanticscholar.org/reader/d891de52e7c58e2443199a20bba7468bdc0736ae?experiments=&features=reader_skimming%3Atrue"}, {"loc": [4.369908809661865, 7.399176597595215], "id": 2374, "title": "dial2vec: Self-Guided Contrastive Learning of Unsupervised Dialogue Embeddings", "authors": "Che Liu, Rui Wang, Junfeng Jiang, Yongbin Li and Fei Huang", "abstract": "In this paper, we introduce the task of learning unsupervised dialogue embeddings.\nTrivial approaches such as combining pre-trained word or sentence embeddings and encoding through pre-trained language models (PLMs) have been shown to be feasible for this task.\nHowever, these approaches typically ignore the conversational interactions between interlocutors, resulting in poor performance.\nTo address this issue, we proposed a self-guided contrastive learning approach named dial2vec.\nDial2vec considers a dialogue as an information exchange process.\nIt captures the interaction patterns between interlocutors and leverages them to guide the learning of the embeddings corresponding to each interlocutor.\nThen the dialogue embedding is obtained by an aggregation of the embeddings from all interlocutors.\nTo verify our approach, we establish a comprehensive benchmark consisting of six widely-used dialogue datasets.\nWe consider three evaluation tasks: domain categorization, semantic relatedness, and dialogue retrieval.\nDial2vec achieves on average 8.7, 9.0, and 14.3 points absolute improvements in terms of purity, Spearman's correlation, and mean average precision (MAP) over the strongest baseline on the three tasks respectively.\nFurther analysis shows that dial2vec obtains informative and discriminative embeddings for both interlocutors under the guidance of the conversational interactions and achieves even better performance when aggregating them through the interlocutor-level pooling strategy.\nAll codes and data are publicly available at https://github.com/AlibabaResearch/DAMO-ConvAI/tree/main/dial2vec.", "track": "Dialogue and Interactive Systems", "label": 4, "url": "https://www.semanticscholar.org/reader/35f4bc71e41ff70bbc752955c1b00e0501bc2cf7?experiments=&features=reader_skimming%3Atrue"}, {"loc": [5.117748260498047, 9.59858512878418], "id": 2379, "title": "WR-One2Set: Towards Well-Calibrated Keyphrase Generation", "authors": "Binbin Xie, Xiangpeng Wei, Baosong Yang, Huan Lin, Jun Xie, Xiaoli Wang, Min Zhang and Jinsong Su", "abstract": "Keyphrase generation aims to automatically generate short phrases summarizing an input document. The recently emerged ONE2SET paradigm (Ye et al., 2021) generates keyphrases as a set and has achieved competitive performance. Nevertheless, we observe serious calibration errors outputted by ONE2SET, especially in the over-estimation of \u2205 token (means \"no corresponding keyphrase\u201d). In this paper, we deeply analyze this limitation and identify two main reasons behind: 1) the parallel generation has to introduce excessive \u2205 as padding tokens into training instances; and 2) the training mechanism assigning target to each slot is unstable and further aggravates the \u2205 token over-estimation. To make the model well-calibrated, we propose WR-ONE2SET which extends ONE2SET with an adaptive instance-level cost Weighting strategy and a target Re-assignment mechanism. The former dynamically penalizes the over-estimated slots for different instances thus smoothing the uneven training distribution. The latter refines the original inappropriate assignment and reduces the supervisory signals of over-estimated slots. Experimental results on commonly-used datasets demonstrate the effectiveness and generality of our proposed paradigm.", "track": "Information Extraction", "label": 5, "url": "https://www.semanticscholar.org/reader/633703d7b27602fc99124564b8326008b914b8e7?experiments=&features=reader_skimming%3Atrue"}, {"loc": [8.741852760314941, 6.452250957489014], "id": 2381, "title": "Eeny, meeny, miny, moe. How to choose data for morphological inflection.", "authors": "Saliha Muradoglu and Mans Hulden", "abstract": "Data scarcity is a widespread problem for numerous natural language processing (NLP) tasks within low-resource languages. Within morphology, the labour-intensive task of tagging/glossing data is a serious bottleneck for both NLP and fieldwork. Active learning (AL) aims to reduce the cost of data annotation by selecting data that is most informative for the model. In this paper, we explore four sampling strategies for the task of morphological inflection using a Transformer model: a pair of oracle experiments where data is chosen based on correct/incorrect predictions by the model, model confidence, entropy, and random selection. We investigate the robustness of each sampling strategy across 30 typologically diverse languages, as well as a 10-cycle iteration using Nat\u00fcgu as a case study. Our results show a clear benefit to selecting data based on model confidence. Unsurprisingly, the oracle experiment, which is presented as a proxy for linguist/language informer feedback, shows the most improvement. This is followed closely by low-confidence and high-entropy forms. We also show that despite the conventional wisdom of larger data sets yielding better accuracy, introducing more instances of high-confidence, low-entropy, or forms that the model can already inflect correctly, can reduce model performance.", "track": "Phonology, Morphology and Word Segmentation", "label": 25, "url": ""}, {"loc": [0.7400525212287903, 6.518398284912109], "id": 2390, "title": "An Adaptive Logical Rule Embedding Model for Inductive Reasoning over Temporal Knowledge Graphs", "authors": "Xin Mei, Libin Yang, Xiaoyan Cai and zuowei jiang", "abstract": "Temporal knowledge graphs (TKGs) extrapolation reasoning predicts future events based on historical information, which has great research significance and broad application value. Existing methods can be divided into embedding-based methods and logical rule-based methods. Embedding-based methods rely on learned entity and relation embeddings to make predictions and thus lack interpretability. Logical rule-based methods bring scalability problems due to being limited by the learned logical rules. We combine the two methods to capture deep causal logic by learning rule embeddings, and propose an interpretable model for temporal knowledge graph reasoning called adaptive logical rule embedding model for inductive reasoning (ALRE-IR). ALRE-IR can adaptively extract and assess reasons contained in historical events, and make predictions based on causal logic. Furthermore, we propose a one-class augmented matching loss for optimization. When evaluated on the ICEWS14, ICEWS0515 and ICEWS18 datasets, the performance of ALRE-IR outperforms other state-of-the-art baselines. The results also demonstrate that ALRE-IR still shows outstanding performance when transferred to related dataset with common relation vocabulary, indicating our proposed model has good zero-shot reasoning ability.", "track": "Information Retrieval and Text Mining", "label": 15, "url": ""}, {"loc": [5.366840839385986, 7.528066158294678], "id": 2392, "title": "UniNL: Aligning Representation Learning with Scoring Function for OOD Detection via Unified Neighborhood Learning", "authors": "Yutao Mou, Pei Wang, Keqing He, Yanan Wu, Jingang Wang, Wei Wu and Weiran Xu", "abstract": "Detecting out-of-domain (OOD) intents from user queries is essential for avoiding wrong operations in task-oriented dialogue systems. The key challenge is how to distinguish in-domain (IND) and OOD intents. Previous methods ignore the alignment between representation learning and scoring function, limiting the OOD detection performance. In this paper, we propose a unified neighborhood learning framework (UniNL) to detect OOD intents. Specifically, we design a KNCL objective for representation learning, and introduce a KNN-based scoring function for OOD detection. We aim to align representation learning with scoring function. Experiments and analysis on two benchmark datasets show the effectiveness of our method.", "track": "Dialogue and Interactive Systems", "label": 4, "url": "https://www.semanticscholar.org/reader/14b414eaccf08950c2aa489ad5fd719b3a12d35e?experiments=&features=reader_skimming%3Atrue"}, {"loc": [5.003041744232178, 11.980752944946289], "id": 2398, "title": "Open-domain Video Commentary Generation", "authors": "Edison Marrese-Taylor, Yumi Hamazono, Tatsuya Ishigaki, Goran Topic, Yusuke Miyao, Ichiro Kobayashi and Hiroya Takamura", "abstract": "Live commentary plays an important role in sports broadcasts and video games, making spectators more excited and immersed. In this context, though approaches for automatically generating such commentary have been proposed in the past, they have been generally concerned with specific fields, where it is possible to leverage domain-specific information. In light of this, we propose the task of generating video commentary in an open-domain fashion. We detail the construction of a new large-scale dataset of transcribed commentary aligned with videos containing various human actions in a variety of domains, and propose approaches based on well-known neural architectures to tackle the task. To understand the strengths and limitations of current approaches, we present an in-depth empirical study based on our data. Our results suggest clear trade-offs between textual and visual inputs for the models and highlight the importance of relying on external knowledge in this open-domain setting, resulting in a set of robust baselines for our task.", "track": "Resources and Evaluation", "label": 1, "url": ""}, {"loc": [8.120742797851562, 3.018866777420044], "id": 2399, "title": "One size does not fit all: Investigating strategies for differentially-private learning across NLP tasks", "authors": "Manuel Senge, Timour Igamberdiev and Ivan Habernal", "abstract": "Preserving privacy in contemporary NLP models allows us to work with sensitive data, but unfortunately comes at a price. We know that stricter privacy guarantees in differentially-private stochastic gradient descent (DP-SGD) generally degrade model performance. However, previous research on the efficiency of DP-SGD in NLP is inconclusive or even counter-intuitive. In this short paper, we provide an extensive analysis of different privacy preserving strategies on seven downstream datasets in five different `typical' NLP tasks with varying complexity using modern neural models based on BERT and XtremeDistil architectures. We show that unlike standard non-private approaches to solving NLP tasks, where bigger is usually better, privacy-preserving strategies do not exhibit a winning pattern, and each task and privacy regime requires a special treatment to achieve adequate performance.", "track": "Interpretability, Interactivity and Analysis of Models for NLP", "label": 9, "url": "https://www.semanticscholar.org/reader/14cb3ed64cbdd11444c98c97be3ecef7394e8a56?experiments=&features=reader_skimming%3Atrue"}, {"loc": [5.556511878967285, 8.927638053894043], "id": 2401, "title": "Counterfactual Recipe Generation: Exploring Compositional Generalization in a Realistic Scenario", "authors": "Xiao Liu, Yansong Feng, Jizhi Tang, Chengang Hu and Dongyan Zhao", "abstract": "People can acquire knowledge in an unsupervised manner by reading, and compose the knowledge to make novel combinations. In this paper, we investigate whether pretrained language models can perform compositional generalization in a realistic setting: recipe generation. We design the counterfactual recipe generation task, which asks models to modify a base recipe according to the change of an ingredient. This task requires compositional generalization at two levels: the surface level of incorporating the new ingredient into the base recipe, and the deeper level of adjusting actions related to the changing ingredient. \nWe collect a large-scale recipe dataset in Chinese for models to learn culinary knowledge, and a subset of action-level fine-grained annotations for evaluation.\nWe finetune pretrained language models on the recipe corpus, and use unsupervised counterfactual generation methods to generate modified recipes.\nResults show that existing models have difficulties in modifying the ingredients while preserving the original text style, and often miss actions that need to be adjusted. Although pretrained language models can generate fluent recipe texts, they fail to truly learn and use the culinary knowledge in a compositional way. \nCode and data are available at https://github.com/xxxiaol/counterfactual-recipe-generation.", "track": "Theme Track", "label": 18, "url": "https://www.semanticscholar.org/reader/c6e4518dfd687a2a5bed4e78d5d9f999292a1746?experiments=&features=reader_skimming%3Atrue"}, {"loc": [7.699915409088135, 7.951632499694824], "id": 2406, "title": "Tutoring Helps Students Learn Better: Improving Knowledge Distillation for BERT with Tutor Network", "authors": "Junho Kim, Jun-Hyung Park, Mingyu Lee, Wing-Lam Mok, Joon-Young Choi and SangKeun Lee", "abstract": "Pre-trained language models have achieved remarkable successes in natural language processing tasks, coming at the cost of increasing model size. To address this issue, knowledge distillation (KD) has been widely applied to compress language models. However, typical KD approaches for language models have overlooked the difficulty of training examples, suffering from incorrect teacher prediction transfer and sub-efficient training. In this paper, we propose a novel KD framework, Tutor-KD, which improves the distillation effectiveness by controlling the difficulty of training examples during pre-training.  We introduce a tutor network that generates samples that are easy for the teacher but difficult for the student, with training on a carefully designed policy gradient method. Experimental results show that Tutor-KD significantly and consistently outperforms the state-of-the-art KD methods with variously sized student models on the GLUE benchmark, demonstrating that the tutor can effectively generate training examples for the student.", "track": "Efficient Methods for NLP", "label": 12, "url": ""}, {"loc": [8.79207706451416, 6.52491569519043], "id": 2414, "title": "Does Corpus Quality Really Matter for Low-Resource Languages?", "authors": "Mikel Artetxe, Itziar Aldabe, Rodrigo Agerri, Olatz Perez-de-Vi\u00f1aspre and Aitor Soroa", "abstract": "The vast majority of non-English corpora are derived from automatically filtered versions of CommonCrawl. While prior work has identified major issues on the quality of these datasets (Kreutzer et al., 2021), it is not clear how this impacts downstream performance. Taking representation learning in Basque as a case study, we explore tailored crawling (manually identifying and scraping websites with high-quality content) as an alternative to filtering CommonCrawl. Our new corpus, called EusCrawl, is similar in size to the Basque portion of popular multilingual corpora like CC100 and mC4, yet it has a much higher quality according to native annotators. For instance, 66% of documents are rated as high-quality for EusCrawl, in contrast with <33% for both mC4 and CC100. Nevertheless, we obtain similar results on downstream NLU tasks regardless of the corpus used for pre-training. Our work suggests that NLU performance in low-resource languages is not primarily constrained by the quality of the data, and other factors like corpus size and domain coverage can play a more important role.", "track": "Multilinguality", "label": 13, "url": "https://www.semanticscholar.org/reader/daade6d1d7aa018e42d3acabff1e83380d5d0f07?experiments=&features=reader_skimming%3Atrue"}, {"loc": [5.822017192840576, 5.82810115814209], "id": 2419, "title": "Unifying Data Perspectivism and Personalization: An Application to Social Norms", "authors": "Joan Plepi, B\u00e9la Neuendorf, Lucie Flek and Charles Welch", "abstract": "Instead of using a single ground truth for language processing tasks, several recent studies have examined how to represent and predict the labels of the set of annotators. However, often little or no information about annotators is known, or the set of annotators is small. In this work, we examine a corpus of social media posts about conflict from a set of 13k annotators and 210k judgements of social norms. We provide a novel experimental setup that applies personalization methods to the modeling of annotators and compare their effectiveness for predicting the perception of social norms. We further provide an analysis of performance across subsets of social situations that vary by the closeness of the relationship between parties in conflict, and assess where personalization helps the most.", "track": "Computational Social Science and Cultural Analytics", "label": 20, "url": ""}, {"loc": [5.447420597076416, 5.082921028137207], "id": 2425, "title": "Does Self-Rationalization Improve Robustness to Spurious Correlations?", "authors": "Alexis Ross, Matthew Peters and Ana Marasovic", "abstract": "Rationalization is fundamental to human reasoning and learning. NLP models trained to produce rationales along with predictions, called self-rationalization models, have been investigated for their interpretability and utility to end-users. However, the extent to which training with human-written rationales facilitates learning remains an under-explored question. We ask whether training models to self-rationalize can aid in their learning to solve tasks for the right reasons. Specifically, we evaluate how training self-rationalization models with free-text rationales affects robustness to spurious correlations in fine-tuned encoder-decoder and decoder-only models of six different sizes. We evaluate robustness to spurious correlations by measuring performance on 1) manually annotated challenge datasets and 2) subsets of original test sets where reliance on spurious correlations would fail to produce correct answers. We find that while self-rationalization can improve robustness to spurious correlations in low-resource settings, it tends to hurt robustness in higher-resource settings. Furthermore, these effects depend on model family and size, as well as on rationale content. Together, our results suggest that explainability can come at the cost of robustness; thus, appropriate care should be taken when training self-rationalizing models with the goal of creating more trustworthy models.", "track": "Interpretability, Interactivity and Analysis of Models for NLP", "label": 9, "url": "https://www.semanticscholar.org/reader/36543b4441c9d88b57b06a7ba887f409afd8141d?experiments=&features=reader_skimming%3Atrue"}, {"loc": [8.064118385314941, 7.698309898376465], "id": 2434, "title": "Efficient Pre-training of Masked Language Model via Concept-based Curriculum Masking", "authors": "Mingyu Lee, Jun-Hyung Park, Junho Kim, Kang-Min Kim and SangKeun Lee", "abstract": "Self-supervised pre-training has achieved remarkable success in extensive natural language processing tasks. Masked language modeling (MLM) has been widely used for pre-training effective bidirectional representations but comes at a substantial training cost. In this paper, we propose a novel concept-based curriculum masking (CCM) method to efficiently pre-train a language model. CCM has two key differences from existing curriculum learning approaches to effectively reflect the nature of MLM. First, we introduce a novel curriculum that evaluates the MLM difficulty of each token based on a carefully-designed linguistic difficulty criterion. Second, we construct a curriculum that masks easy words and phrases first and gradually masks related ones to the previously masked ones based on a knowledge graph. Experimental results show that CCM significantly improves pre-training efficiency. Specifically, the model trained with CCM shows comparative performance with the original BERT on the General Language Understanding Evaluation benchmark at half of the training cost.", "track": "Efficient Methods for NLP", "label": 12, "url": ""}, {"loc": [9.183977127075195, 6.353485584259033], "id": 2438, "title": "Subword Evenness (SuE) as a Predictor of Cross-lingual Transfer to Low-resource Languages", "authors": "Olga Pelloni, Anastassia Shaitarova and Tanja Samardzic", "abstract": "Pre-trained multilingual models, such as mBERT, XLM-R and mT5, are used to improve the performance on various tasks in low-resource languages via cross-lingual transfer. In this framework, English is usually seen as the most natural choice for a transfer language (for fine-tuning or continued training of a multilingual pre-trained model), but it has been revealed recently that this is often not the best choice. The success of cross-lingual transfer seems to depend on some properties of languages, which are currently hard to explain. Successful transfer often happens between unrelated languages and it often cannot be explained by data-dependent factors.\n\nIn this study, we show that languages written in non-Latin and non-alphabetic scripts (mostly Asian languages) are the best choices for improving performance on the task of Masked Language Modelling (MLM) in a diverse set of 30 low-resource languages and that the success of the transfer is well predicted by our novel measure of Subword Evenness (SuE). Transferring language models over the languages that score low on our measure results in the lowest average perplexity over target low-resource languages. Our correlation coefficients obtained with three different pre-trained multilingual models are consistently higher than all the other predictors, including text-based measures (type-token ratio, entropy) and linguistically motivated choice (genealogical and typological proximity).", "track": "Language Modeling and Analysis of Language Models", "label": 2, "url": ""}, {"loc": [6.066429138183594, 8.308318138122559], "id": 2439, "title": "A Unified Neural Network Model for Readability Assessment with Feature Projection and Length-Balanced Loss", "authors": "Wenbiao Li, Wang Ziyang and Yunfang Wu", "abstract": "Readability assessment is a basic research task in the field of education. Traditional methods mainly employ machine learning classifiers with hundreds of linguistic features. Although the deep learning model has become the prominent approach for almost all NLP tasks, it is less explored for readability assessment. In this paper, we propose a BERT-based model with feature projection and length-balanced loss (BERT-FP-LBL) to determine the difficulty level of a given text. First, we introduce topic features guided by difficulty knowledge to complement the  traditional linguistic features. From the linguistic features, we extract really useful orthogonal features to supplement BERT representations by means of projection filtering. Furthermore, we design a length-balanced loss to handle the greatly varying length distribution of the readability data. We conduct experiments on three English benchmark datasets and one Chinese dataset, and the experimental results show that our proposed model achieves significant improvements over baseline models. Interestingly, our proposed model achieves comparable results with human experts in consistency test.", "track": "Information Retrieval and Text Mining", "label": 15, "url": "https://www.semanticscholar.org/reader/dd8acd58a7df188cd871f049938f85a7e9704b4a?experiments=&features=reader_skimming%3Atrue"}, {"loc": [6.561717987060547, 11.84943675994873], "id": 2444, "title": "Speaker Overlap-aware Neural Diarization for Multi-party Meeting Analysis", "authors": "Zhihao Du, ShiLiang Zhang, Siqi Zheng and Zhi-Jie Yan", "abstract": "Recently, hybrid systems of clustering and neural diarization models have been successfully applied in multi-party meeting analysis. However, current models always treat overlapped speaker diarization as a multi-label classification problem, where speaker dependency and overlaps are not well considered. To overcome the disadvantages, we reformulate overlapped speaker diarization task as a single-label prediction problem via the proposed power set encoding (PSE). Through this formulation, speaker dependency and overlaps can be explicitly modeled. To fully leverage this formulation, we further propose the speaker overlap-aware neural diarization (SOND) model, which consists of a context-independent (CI) scorer to model global speaker discriminability, a context-dependent scorer (CD) to model local discriminability, and a speaker combining network (SCN) to combine and reassign speaker activities. Experimental results show that using the proposed formulation can outperform the state-of-the-art methods based on target speaker voice activity detection, and the performance can be further improved with SOND, resulting in a 6.30% relative diarization error reduction.", "track": "Speech, Vision, Robotics, Multimodal Grounding", "label": 7, "url": ""}, {"loc": [4.801635265350342, 5.909019947052002], "id": 2447, "title": "GREENER: Graph Neural Networks for News Media Profiling", "authors": "Panayot Panayotov, Utsav Shukla, Husrev Taha Sencar, Mohamed Nabeel and Preslav Nakov", "abstract": "We study the problem of profiling news media on the Web with respect to their factuality of reporting and bias. This is an important but under-studied problem related to disinformation and ``fake news'' detection, but it addresses the issue at a coarser granularity compared to looking at an individual article or an individual claim. This is useful as it allows to profile entire media outlets in advance. Unlike previous work, which has focused primarily on text (e.g.,~on the text of the articles published by the target website, or on the textual description in their social media profiles or in Wikipedia), here our main focus is on modeling the similarity between media outlets based on the overlap of their audience. This is motivated by homophily considerations, i.e.,~the tendency of people to have connections to people with similar interests, which we extend to media, hypothesizing that similar types of media would be read by similar kinds of users. In particular, we propose GREENER (GRaph nEural nEtwork for News mEdia pRofiling), a model that builds a graph of inter-media connections based on their audience overlap, and then uses graph neural networks to represent each medium.  We find that such representations are quite useful for predicting the factuality and the bias of news media outlets, yielding improvements over state-of-the-art results reported on two datasets.  When augmented with conventionally used representations obtained from news articles, Twitter, YouTube, Facebook, and Wikipedia, prediction accuracy is found to improve by 2.5-27 macro-F1 points for the two tasks.", "track": "NLP Applications", "label": 0, "url": "https://www.semanticscholar.org/reader/4b361b54fb8eb38539518803fbe3bef03c7899ad?experiments=&features=reader_skimming%3Atrue"}, {"loc": [0.6769068837165833, 6.5195817947387695], "id": 2452, "title": "Graph Hawkes Transformer for Extrapolated Reasoning on Temporal Knowledge Graphs", "authors": "Haohai Sun, Shangyi Geng, Jialun Zhong, Han Hu and Kun He", "abstract": "Temporal Knowledge Graph (TKG) reasoning has attracted increasing attention due to its enormous potential value, and the critical issue is how to model the complex temporal structure information effectively. Recent studies use the method of encoding graph snapshots into hidden vector space and then performing heuristic deductions, which perform well on the task of entity prediction. However, these approaches cannot predict when an event will occur and have the following limitations:  1) there are many facts not related to the query that can confuse the model; 2) there exists information forgetting caused by long-term evolutionary processes. To this end, we propose a Graph Hawkes Transformer (GHT) for both TKG entity prediction and time prediction tasks in the future time. In GHT, there are two variants of Transformer, which capture the instantaneous structural information and temporal evolution information, respectively, and a new relational continuous-time encoding function to facilitate feature evolution with the Hawkes process. Extensive experiments on four public datasets demonstrate its superior performance, especially on long-term evolutionary tasks.", "track": "Commonsense Reasoning", "label": 19, "url": ""}, {"loc": [3.9995765686035156, 4.112773895263672], "id": 2459, "title": "UniRPG: Unified Discrete Reasoning over Table and Text as Program Generation", "authors": "Yongwei Zhou, Junwei Bao, Chaoqun Duan, Youzheng Wu, Xiaodong He and Tiejun Zhao", "abstract": "Question answering requiring discrete reasoning, e.g., arithmetic computing, comparison, and counting, over knowledge is a challenging task.\nIn this paper, we propose UniRPG, a semantic-parsing-based approach advanced in interpretability and scalability, to perform Unified discrete Reasoning over heterogeneous knowledge resources, i.e., table and text, as Program Generation. \nConcretely, UniRPG consists of a neural programmer and a symbolic program executor,\nwhere a program is the composition of a set of pre-defined general atomic and higher-order operations and arguments extracted from table and text.\nFirst, the programmer parses a question into a program by generating operations and copying arguments, and then, the executor derives answers from table and text based on the program.\nTo alleviate the costly program annotation issue, we design a distant supervision approach for programmer learning, where pseudo programs are automatically constructed without annotated derivations.\nExtensive experiments on the TAT-QA dataset show that UniRPG achieves tremendous improvements and enhances interpretability and scalability compared with previous state-of-the-art methods, even without derivation annotation.\nMoreover, it achieves promising performance on the textual dataset DROP without derivation annotation.", "track": "Question Answering", "label": 11, "url": "https://www.semanticscholar.org/reader/6876e7b5526a93462f9b3e0b55a93b5561f1c993?experiments=&features=reader_skimming%3Atrue"}, {"loc": [8.113082885742188, 9.489667892456055], "id": 2464, "title": "Don't Prompt, Search! Mining-based Zero-Shot Learning with Language Models", "authors": "Mozes van de Kar, Mengzhou Xia, Danqi Chen and Mikel Artetxe", "abstract": "Masked language models like BERT can perform text classification in a zero-shot fashion by reformulating downstream tasks as text infilling. However, this approach is highly sensitive to the template used to prompt the model, yet practitioners are blind when designing them in strict zero-shot settings. In this paper, we propose an alternative mining-based approach for zero-shot learning. Instead of prompting language models, we use regular expressions to mine labeled examples from unlabeled corpora, which can optionally be filtered through prompting, and used to finetune a pretrained model. Our method is more flexible and interpretable than prompting, and outperforms it on a wide range of tasks when using comparable templates. Our results suggest that the success of prompting can partly be explained by the model being exposed to similar examples during pretraining, which can be directly retrieved through regular expressions.", "track": "Language Modeling and Analysis of Language Models", "label": 2, "url": "https://www.semanticscholar.org/reader/990026128083f5a47b061f6237b8135b2d3a41a9?experiments=&features=reader_skimming%3Atrue"}, {"loc": [1.0529420375823975, 10.533020973205566], "id": 2474, "title": "SEMGraph: Incorporating Sentiment Knowledge and Eye Movement into Graph Model for Sentiment Analysis", "authors": "Bingbing Wang, Bin Liang, Jiachen Du, Min Yang and Ruifeng Xu", "abstract": "This paper investigates the sentiment analysis task from a novel perspective by incorporating sentiment knowledge and eye movement into a graph architecture, aiming to draw the eye movement-based sentiment relationships for learning the sentiment expression of the context. To be specific, we first explore a linguistic probing eye movement paradigm to extract eye movement features based on the close relationship between linguistic features and the early and late processes of human reading behavior. Furthermore, to derive eye movement features with sentiment concepts, we devise a novel weighting strategy to integrate sentiment scores extracted from affective commonsense knowledge into eye movement features, called sentiment-eye movement weights. Then, the sentiment-eye movement weights are exploited to build the sentiment-eye movement guided graph (SEMGraph) model, so as to model the intricate sentiment relationships in the context. Experimental results on two sentiment analysis datasets with eye movement signals and three sentiment analysis datasets without eye movement signals show that the proposed SEMGraph achieves state-of-the-art performance, and can also be directly generalized to those sentiment analysis datasets without eye movement signals.", "track": "Speech, Vision, Robotics, Multimodal Grounding", "label": 7, "url": ""}, {"loc": [10.704315185546875, 6.887051582336426], "id": 2479, "title": "Cross-lingual neural fuzzy matching for exploiting target-language monolingual corpora in computer-aided translation", "authors": "Miquel Espl\u00e0-Gomis, V\u00edctor M. S\u00e1nchez-Cartagena, Juan Antonio P\u00e9rez-Ortiz and Felipe S\u00e1nchez-Mart\u00ednez", "abstract": "Computer-aided translation (CAT) tools based on translation memories (MT) play a prominent role in the translation workflow of professional translators. However, the reduced availability of in-domain TMs, as compared to in-domain monolingual corpora, limits its adoption for a number of translation tasks. In this paper, we introduce a novel neural approach aimed at overcoming this limitation by exploiting not only TMs, but also in-domain target-language (TL) monolingual corpora, and still enabling a similar functionality to that offered by conventional TM-based CAT tools. Our approach relies on cross-lingual sentence embeddings to retrieve  translation proposals from TL monolingual corpora, and on a neural model to estimate their post-editing effort. The paper presents an automatic evaluation of these techniques on four language pairs that shows that our approach can successfully exploit monolingual texts in a TM-based CAT environment, increasing the amount of useful translation proposals, and that our neural model for estimating the post-editing effort enables the combination of translation proposals obtained from monolingual corpora and from TMs in the usual way. A human evaluation performed on a single language pair confirms the results of the automatic evaluation  and  seems to indicate that the translation proposals retrieved with our approach are more useful than what the automatic evaluation shows.", "track": "NLP Applications", "label": 0, "url": ""}, {"loc": [4.404667854309082, 7.503066062927246], "id": 2491, "title": "Multi-Label Intent Detection via Contrastive Task Specialization of Sentence Encoders", "authors": "Ivan Vuli\u0107, I\u00f1igo Casanueva, Georgios Spithourakis, Avishek Mondal, Tsung-Hsien Wen and Pawe\u0142 Budzianowski", "abstract": "Deploying task-oriented dialog ToD systems for new domains and tasks requires natural language understanding models that are 1) resource-efficient and work under low-data regimes; 2) adaptable, efficient, and quick-to-train; 3) expressive and can handle complex ToD scenarios with multiple user intents in a single utterance. Motivated by these requirements, we introduce a novel framework for multi-label intent detection (mID): MultI-ConvFiT (Multi-Label Intent Detection via Contrastive Conversational Fine-Tuning). While previous work on efficient single-label intent detection learns a classifier on top of a fixed sentence encoder (SE), we propose to 1) transform general-purpose SEs into task-specialized SEs via contrastive fine-tuning on annotated multi-label data, 2) where task specialization knowledge can be stored into lightweight adapter modules without updating the original parameters of the input SE, and then 3) we build improved mID classifiers stacked on top of fixed specialized SEs. Our main results indicate that MultI-ConvFiT yields effective mID models, with large gains over non-specialized SEs reported across a spectrum of different mID datasets, both in low-data and high-data regimes.", "track": "Dialogue and Interactive Systems", "label": 4, "url": ""}, {"loc": [9.08772087097168, 6.259606838226318], "id": 2495, "title": "Discovering Language-neutral Sub-networks in Multilingual Language Models", "authors": "Negar Foroutan, Mohammadreza Banaei, R\u00e9mi Lebret, Antoine Bosselut and Karl Aberer", "abstract": "Multilingual pre-trained language models transfer remarkably well on cross-lingual downstream tasks. However, the extent to which they learn language-neutral representations (i.e., shared representations that encode similar phenomena across languages), and the effect of such representations on cross-lingual transfer performance, remain open questions.\n\nIn this work, we conceptualize language neutrality of multilingual models as a function of the overlap between language-encoding sub-networks of these models. We employ the lottery ticket hypothesis to discover sub-networks that are individually optimized for various languages and tasks. Our evaluation across three distinct tasks and eleven typologically-diverse languages demonstrates that sub-networks for different languages are topologically similar (i.e., language-neutral), making them effective initializations for cross-lingual transfer with limited performance degradation.", "track": "Multilinguality", "label": 13, "url": ""}, {"loc": [8.636474609375, 8.399713516235352], "id": 2496, "title": "Parameter-Efficient Tuning Makes a Good Classification Head", "authors": "Zhuoyi Yang, Ming Ding, Yanhui Guo, Qingsong Lv and Jie Tang", "abstract": "In recent years, pretrained models revolutionized the paradigm of natural language understanding (NLU), where we append a randomly initialized classification head after the pretrained backbone, e.g. BERT, and finetune the whole model. As the pretrained backbone makes a major contribution to the improvement, we naturally expect a good pretrained classification head can also benefit the training. However, the final-layer output of the backbone, i.e. the input of the classification head, will change greatly during finetuning, making the usual head-only pretraining ineffective. In this paper, we find that parameter-efficient tuning makes a good classification head, with which we can simply replace the randomly initialized heads for a stable performance gain. Our experiments demonstrate that the classification head jointly pretrained with parameter-efficient tuning consistently improves the performance on 9 tasks in GLUE and SuperGLUE.", "track": "Language Modeling and Analysis of Language Models", "label": 2, "url": ""}, {"loc": [7.28510856628418, 9.448281288146973], "id": 2499, "title": "STGN: an Implicit Regularization Method for Learning with Noisy Labels in Natural Language Processing", "authors": "Tingting Wu, Xiao Ding, Minji Tang, Hao Zhang, Bing Qin and Ting Liu", "abstract": "Noisy labels are ubiquitous in natural language processing (NLP) tasks. Existing work, namely learning with noisy labels in NLP, is often limited to dedicated tasks or specific training procedures, making it hard to be widely used. To address this issue, SGD noise has been explored to provide a more general way to alleviate the effect of noisy labels by involving benign noise in the process of stochastic gradient descent. \nHowever, previous studies exert identical perturbation for all samples, which may cause overfitting on incorrect ones or optimizing correct ones inadequately. To facilitate this, we propose a novel stochastic tailor-made gradient noise (STGN), mitigating the effect of inherent label noise by introducing tailor-made benign noise for each sample. Specifically, we investigate multiple principles to precisely and stably discriminate correct samples from incorrect ones and thus apply different intensities of perturbation to them. A detailed theoretical analysis shows that STGN has good properties, beneficial for model generalization. Experiments on three different NLP tasks demonstrate the effectiveness and versatility of STGN. Also, STGN can boost existing robust training methods.", "track": "Machine Learning for NLP", "label": 3, "url": ""}, {"loc": [5.308909893035889, 12.468986511230469], "id": 2506, "title": "Cross-Modal Similarity-Based Curriculum Learning for Image Captioning", "authors": "Hongkuan Zhang, Saku Sugawara, Akiko Aizawa, Lei Zhou, Ryohei Sasano and Koichi Takeda", "abstract": "Image captioning models require the high-level generalization ability to describe the contents of various images in words. Most existing approaches treat the image--caption pairs equally in their training without considering the differences in their learning difficulties. Several image captioning approaches introduce curriculum learning methods that present training data with increasing levels of difficulty. However, their difficulty measurements are either based on domain-specific features or prior model training. In this paper, we propose a simple yet efficient difficulty measurement for image captioning using cross-modal similarity calculated by a pretrained vision--language model. Experiments on the COCO and Flickr30k datasets show that our proposed approach achieves superior performance and competitive convergence speed to baselines without requiring heuristics or incurring additional training costs. Moreover, the higher model performance on difficult examples and unseen data also demonstrates the generalization ability.", "track": "Speech, Vision, Robotics, Multimodal Grounding", "label": 7, "url": ""}, {"loc": [6.291426181793213, 5.353306293487549], "id": 2513, "title": "Debiasing Masks: A New Framework for Shortcut Mitigation in NLU", "authors": "Johannes Mario Meissner, Saku Sugawara and Akiko Aizawa", "abstract": "Debiasing language models from unwanted behaviors in Natural Language Understanding (NLU) tasks is a topic with rapidly increasing interest in the NLP community. Spurious statistical correlations in the data allow models to perform shortcuts and avoid uncovering more advanced and desirable linguistic features.\nA multitude of effective debiasing approaches has been proposed, but flexibility remains a major issue. For the most part, models must be retrained to find a new set of weights with debiased behavior.\nWe propose a new debiasing method in which we identify debiased pruning masks that can be applied to a finetuned model. This enables the selective and conditional application of debiasing behaviors.\nWe assume that bias is caused by a certain subset of weights in the network; our method is, in essence, a mask search to identify and remove biased weights.\nOur masks show equivalent or superior performance to the standard counterparts, while offering important benefits.\nPruning masks can be stored with high efficiency in memory, and it becomes possible to switch among several debiasing behaviors (or revert back to the original biased model) at inference time. Finally, it opens the doors to further research on how biases are acquired by studying the generated masks. For example, we observed that the early layers and attention heads were pruned more aggressively, possibly hinting towards the location in which biases may be encoded.", "track": "Machine Learning for NLP", "label": 3, "url": "https://www.semanticscholar.org/reader/76baaa18783fbfc5c7ee99d9d44d00a6c37e1a00?experiments=&features=reader_skimming%3Atrue"}, {"loc": [5.322630405426025, 12.388042449951172], "id": 2528, "title": "Extending Phrase Grounding with Pronouns in Visual Dialogues", "authors": "Panzhong Lu, Xin Zhang, Meishan Zhang and Min Zhang", "abstract": "Conventional phrase grounding aims to localize noun phrases mentioned in a given caption to their corresponding image regions, which has achieved great success recently. Apparently, sole noun phrase grounding is not enough for cross-modal visual language understanding. Here we extend the task by considering pronouns as well. First, we construct a dataset of phrase grounding with both noun phrases and pronouns to image regions. Based on the dataset, we test the performance of phrase grounding by using a state-of-the-art literature model of this line. Then, we enhance the baseline grounding model with coreference information which should help our task potentially, modeling the coreference structures with graph convolutional networks. Experiments on our dataset, interestingly, show that pronouns are easier to ground than noun phrases, where the possible reason might be that these pronouns are much less ambiguous. Additionally, our final model with coreference information can significantly boost the grounding performance of both noun phrases and pronouns.", "track": "Speech, Vision, Robotics, Multimodal Grounding", "label": 7, "url": "https://www.semanticscholar.org/reader/44c934eb40e2fd4b2e50afbf29459f852ed5e6f9?experiments=&features=reader_skimming%3Atrue"}, {"loc": [3.7409400939941406, 9.34959888458252], "id": 2537, "title": "EUR-Lex-Sum: A Multi- and Cross-lingual Dataset for Long-form Summarization in the Legal Domain", "authors": "Dennis Aumiller, Ashish Chouhan and Michael Gertz", "abstract": "Existing summarization datasets come with two main drawbacks: \n(1) They tend to focus on overly exposed domains, such as news articles or wiki-like texts, and \n(2) are primarily monolingual, with few multilingual datasets.\nIn this work, we propose a novel dataset, called EUR-Lex-Sum, based on manually curated document summaries of legal acts from the European Union law platform (EUR-Lex). Documents and their respective summaries exist as cross-lingual paragraph-aligned data in several of the 24 official European languages, enabling access to various cross-lingual and lower-resourced summarization setups. We obtain up to 1,500 document/summary pairs per language, including a subset of 375 cross-lingually aligned legal acts with texts available in *all* 24 languages.  \nIn this work, the data acquisition process is detailed and key characteristics of the resource are compared to existing summarization resources. In particular, we illustrate challenging sub-problems and open questions on the dataset that could help the facilitation of future research in the direction of domain-specific cross-lingual summarization.\nLimited by the extreme length and language diversity of samples, we further conduct experiments with suitable extractive monolingual and cross-lingual baselines for future work.  \nCode for the extraction as well as access to our data and baselines is available online at: [https://github.com/achouhan93/eur-lex-sum](https://github.com/achouhan93/eur-lex-sum).", "track": "Resources and Evaluation", "label": 1, "url": "https://www.semanticscholar.org/reader/3a9209c66fe64e2ea67c67fa21cbed30154e309e?experiments=&features=reader_skimming%3Atrue"}, {"loc": [8.030890464782715, 5.760574817657471], "id": 2541, "title": "Differentiable Data Augmentation for Contrastive Sentence Representation Learning", "authors": "Tianduo Wang and Wei Lu", "abstract": "Fine-tuning a pre-trained language model via the contrastive learning framework with a large amount of unlabeled sentences or labeled sentence pairs is a common way to obtain high-quality sentence representations. Although the contrastive learning framework has shown its superiority on sentence representation learning over previous methods, the potential of such a framework is under-explored so far due to the simple method it used to construct positive pairs. Motivated by this, we propose a method that makes hard positives from the original training examples. A pivotal ingredient of our approach is the use of prefix that attached to a pre-trained language model, which allows for differentiable data augmentation during contrastive learning. Our method can be summarized in two steps: supervised prefix-tuning followed by joint contrastive fine-tuning with unlabeled or labeled examples. Our experiments confirm the effectiveness of our data augmentation approach. The proposed method yields significant improvements over existing methods under both semi-supervised and supervised settings. Our experiments under a low labeled data setting also show that our method is more label-efficient than the state-of-the-art contrastive learning methods.", "track": "Ethic Concerns:Unsupervised and Weakly-Supervised Methods in NLP", "label": 17, "url": ""}, {"loc": [5.9171576499938965, 9.150935173034668], "id": 2545, "title": "Text Style Transferring via Adversarial Masking and Styled Filling", "authors": "Jiarui Wang, Richong Zhang, Junfan Chen, Jaein Kim and Yongyi Mao", "abstract": "Text style transfer is an important task in natural language processing with broad applications. Existing models following the masking and filling scheme suffer two challenges: the word masking procedure may mistakenly remove unexpected words and the selected words in the word filling procedure may lack diversity and semantic consistency. To tackle both challenges, in this study, we propose a style transfer model, with an adversarial masking approach and a styled filling technique (AMSF). Specifically, AMSF first trains a mask predictor by adversarial training without manual configuration. Then two additional losses, i.e. an entropy maximization loss and a consistency regularization loss, are introduced in training the word filling module to guarantee the diversity and semantic consistency of the transferred texts. Experimental results and analysis on two benchmark text style transfer data sets demonstrate the effectiveness of the proposed approaches.", "track": "Sentiment Analysis, Stylistic Analysis, and Argument Mining", "label": 16, "url": ""}, {"loc": [7.644128322601318, 3.624854803085327], "id": 2550, "title": "Character-level White-Box Adversarial Attacks against Transformers via Attachable Subwords Substitution", "authors": "Aiwei Liu, Honghai Yu, Xuming Hu, Shu'ang Li, Li Lin, Fukun Ma, Yawen Yang and Lijie Wen", "abstract": "We propose the first character-level white-box adversarial attack method against transformer models. The intuition of our method comes from the observation that words are split into subtokens before being fed into the transformer models and the substitution between two close subtokens has a similar effect with the character modification. Our method mainly contains three steps.  First, a gradient-based method is adopted to find the most vulnerable words in the sentence. Then we split the selected words into subtokens to replace the origin tokenization result from the transformer tokenizer. Finally, we utilize an adversarial loss to guide the substitution of attachable subtokens in which the Gumbel-softmax trick is introduced to ensure gradient propagation.\nMeanwhile, we introduce the visual and length constraint in the optimization process to achieve minimum character modifications.\nExtensive experiments on both sentence-level and token-level tasks demonstrate that our method could outperform the previous attack methods in terms of success rate and edit distance. Furthermore,  human evaluation verifies our adversarial examples could preserve their origin labels.", "track": "Language Modeling and Analysis of Language Models", "label": 2, "url": ""}, {"loc": [0.6112386584281921, 7.622259140014648], "id": 2556, "title": "Query-based Instance Discrimination Network for Relational Triple Extraction", "authors": "Zeqi Tan, Yongliang Shen, Xuming Hu, Wenqi Zhang, Xiaoxia Cheng, Weiming Lu and Yueting Zhuang", "abstract": "Joint entity and relation extraction has been a core task in the field of information extraction. Recent approaches usually consider the extraction of relational triples from a stereoscopic perspective, either learning a relation-specific tagger or separate classifiers for each relation type. However, they still suffer from error propagation, relation redundancy and lack of high-level connections between triples. To address these issues, we propose a novel query-based approach to construct instance-level representations for relational triples. By metric-based comparison between query embeddings and token embeddings, we can extract all types of triples in one step, thus eliminating the error propagation problem. In addition, we learn the instance-level representation of relational triples via contrastive learning. In this way, relational triples can not only enclose rich class-level semantics but also access to high-order global connections. Experimental results show that our proposed method achieves the state of the art on five widely used benchmarks.", "track": "Information Extraction", "label": 5, "url": "https://www.semanticscholar.org/reader/949479b4fce4ceceead0d38c5a0e43672cc79dcc?experiments=&features=reader_skimming%3Atrue"}, {"loc": [0.6411269903182983, 7.273882865905762], "id": 2558, "title": "Learning Inter-Entity-Interaction for Few-Shot Knowledge Graph Completion", "authors": "Yuling Li, Kui Yu, Xiaoling Huang and Yuhong Zhang", "abstract": "Few-shot knowledge graph completion (FKGC) aims to infer unknown fact triples of a relation using its few-shot reference entity pairs. Recent FKGC studies focus on learning semantic representations of entity pairs by separately encoding the neighborhoods of head and tail entities. Such practice, however, ignores the inter-entity interaction, resulting in low-discrimination representations for entity pairs, especially when these entity pairs are associated with 1-to-N, N-to-1, and N-to-N relations. To address this issue, this paper proposes a novel FKGC model, named Cross-Interaction Attention Network (CIAN) to investigate the inter-entity interaction between head and tail entities. Specifically, we first explore the interactions within entities by computing the attention between the task relation and each entity neighbor, and then model the interactions between head and tail entities by letting an entity to attend to the neighborhood of its paired entity. In this way, CIAN can figure out the relevant semantics between head and tail entities, thereby generating more discriminative representations for entity pairs. Extensive experiments on two public datasets show that CIAN outperforms several state-of-the-art methods. The source code is available at \\url{https://github.com/cjlyl/FKGC-CIAN}.", "track": "Machine Learning for NLP", "label": 3, "url": ""}, {"loc": [4.538283824920654, 5.569461822509766], "id": 2564, "title": "Empowering the Fact-checkers! Automatic Identification of Claim Spans on Twitter", "authors": "Megha Sundriyal, Atharva Kulkarni, Vaibhav Pulastya, Md. Shad Akhtar and Tanmoy Chakraborty", "abstract": "The widespread diffusion of medical and political claims in the wake of COVID-19 has led to a voluminous rise in misinformation and fake news. The current vogue is to employ manual fact-checkers to efficiently classify and verify such data to combat this avalanche of claim-ridden misinformation. However, the rate of information dissemination is such that it vastly outpaces the fact-checkers' strength. Therefore, to aid manual fact-checkers in eliminating the superfluous content, it becomes imperative to automatically identify and extract the snippets of claim-worthy (mis)information present in a post. In this work, we introduce the novel task of Claim Span Identification (CSI). We propose CURT, a large-scale Twitter corpus with token-level claim spans on more than 7.5k tweets. Furthermore, along with the standard token classification baselines, we benchmark our dataset with DABERTa, an adapter-based variation of RoBERTa. The experimental results attest that DABERTa outperforms the baseline systems across several evaluation metrics, improving by about 1.5 points. We also report detailed error analysis to validate the model's performance along with the ablation studies. Lastly, we release our comprehensive span annotation guidelines for public use.", "track": "Computational Social Science and Cultural Analytics", "label": 20, "url": "https://www.semanticscholar.org/reader/36c0e6ef791079c03180dc61e1b3a53ed7f7320e?experiments=&features=reader_skimming%3Atrue"}, {"loc": [3.6693637371063232, 8.173981666564941], "id": 2566, "title": "ClidSum: A Benchmark Dataset for Cross-Lingual Dialogue Summarization", "authors": "Jiaan Wang, Fandong Meng, Ziyao Lu, Duo Zheng, Zhixu Li, Jianfeng Qu and Jie Zhou", "abstract": "We present ClidSum, a benchmark dataset towards building cross-lingual summarization systems on dialogue documents. It consists of 67k+ dialogue documents and 112k+ annotated summaries in different target languages. Based on the proposed ClidSum, we introduce two benchmark settings for supervised and semi-supervised scenarios, respectively. We then build various baseline systems in different paradigms (pipeline and end-to-end) and conduct extensive experiments on ClidSum to provide deeper analyses. Furthermore, we propose mDialBART which extends mBART via further pre-training, where the multiple objectives help the pre-trained model capture the structural characteristics as well as key content in dialogues and the transformation from source to the target language. Experimental results show the superiority of mDialBART, as an end-to-end model, outperforms strong pipeline models on ClidSum. Finally, we discuss specific challenges that current approaches faced with this task and give multiple promising directions for future research. We have released the dataset and code at https://github.com/krystalan/ClidSum.", "track": "Summarization", "label": 14, "url": "https://www.semanticscholar.org/reader/8de8bb09515370a44a6830b3041dd6f131d7ee3e?experiments=&features=reader_skimming%3Atrue"}, {"loc": [9.026941299438477, 6.127098560333252], "id": 2578, "title": "Spectral Probing", "authors": "Max M\u00fcller-Eberstein, Rob van der Goot and Barbara Plank", "abstract": "Linguistic information is encoded at varying timescales (subwords, phrases, etc.) and communicative levels, such as syntax and semantics. Contextualized embeddings have analogously been found to capture these phenomena at distinctive layers and frequencies. Leveraging these findings, we develop a fully learnable frequency filter to identify spectral profiles for any given task. It enables vastly more granular analyses than prior handcrafted filters, and improves on efficiency. After demonstrating the informativeness of spectral probing over manual filters in a monolingual setting, we investigate its multilingual characteristics across seven diverse NLP tasks in six languages. Our analyses identify distinctive spectral profiles which quantify cross-task similarity in a linguistically intuitive manner, while remaining consistent across languages\u2014highlighting their potential as robust, lightweight task descriptors.", "track": "Language Modeling and Analysis of Language Models", "label": 2, "url": "https://www.semanticscholar.org/reader/b99001e74f77af866c0da1aa735e74592e7c949f?experiments=&features=reader_skimming%3Atrue"}, {"loc": [3.7154057025909424, 5.4278035163879395], "id": 2580, "title": "QASem Parsing: Text-to-text Modeling of QA-based Semantics", "authors": "Ayal Klein, Eran Hirsch, Ron Eliav, Valentina Pyatkin, Avi Caciularu and Ido Dagan", "abstract": "Various works suggest the appeals of incorporating explicit semantic representations when addressing challenging realistic NLP scenarios. Common approaches offer either comprehensive linguistically-based formalisms, like AMR, or alternatively Open-IE, which provides a shallow and partial representation. More recently, an appealing trend introduces semi-structured natural-language structures as an intermediate meaning-capturing representation, often in the form of questions and answers.\n\nIn this work, we further promote this line of research by considering three prior QA-based semantic representations. These cover verbal, nominalized and discourse-based predications, regarded as jointly providing a comprehensive representation of textual information --- termed QASem. To facilitate this perspective, we investigate how to best utilize pre-trained sequence-to-sequence language models, which seem particularly promising for generating representations that consist of natural language expressions (questions and answers). In particular, we examine and analyze input and output linearization strategies, as well as data augmentation and multitask learning for a scarce training data setup. Consequently, we release the first unified QASem parsing tool, easily applicable for downstream tasks that can benefit from an explicit semi-structured account of information units in text.", "track": "Semantics: Lexical, Sentence level, Textual Inference and Other areas", "label": 8, "url": "https://www.semanticscholar.org/reader/c3a064b2ef6cb128c83e5665d0907d4356c369c5?experiments=&features=reader_skimming%3Atrue"}, {"loc": [5.0954155921936035, 9.629100799560547], "id": 2585, "title": "Keyphrase Generation via Soft and Hard Semantic Corrections", "authors": "Guangzhen Zhao, Guoshun Yin, Peng Yang and Yu Yao", "abstract": "Keyphrase generation aims to generate a set of condensed phrases given a source document. Although maximum likelihood estimation (MLE) based keyphrase generation methods have shown impressive performance, they suffer from the bias on the source-prediction sequence pair and the bias on the prediction-target pair. To tackle the above biases, we propose a novel correction model CorrKG on top of the MLE pipeline, where the biases are corrected via the optimal transport (OT) and a frequency-based filtering-and-sorting (FreqFS) strategy. Specifically, OT is introduced as soft correction to facilitate the alignment of salient information and rectify the semantic bias in the source document and predicted keyphrases pair. An adaptive semantic mass learning scheme is conducted on the vanilla OT to achieve a proper pair-wise optimal transport procedure, which promotes the OT learning brought by rectifying semantic masses dynamically. Besides, the FreqFS strategy is designed as hard correction to reduce the bias of predicted and ground truth keyphrases, and thus to generate accurate and sufficient keyphrases. Extensive experiments over multiple benchmark datasets show that our model achieves superior keyphrase generation as compared with the state-of-the-arts.", "track": "Natural Language Generation", "label": 6, "url": ""}, {"loc": [5.596837520599365, 11.664127349853516], "id": 2589, "title": "Modal-specific Pseudo Query Generation for Video Corpus Moment Retrieval", "authors": "MinJoon Jung, SeongHo Choi, JooChan Kim, Jin-Hwa Kim and Byoung-Tak Zhang", "abstract": "Video corpus moment retrieval (VCMR) is the task to retrieve the most relevant video moment from a large video corpus using a natural language query.\nFor narrative videos, e.g., drama or movies, the holistic understanding of temporal dynamics and multimodal reasoning are crucial.\nPrevious works have shown promising results; however, they relied on the expensive query annotations for the VCMR, i.e., the corresponding moment intervals.\nTo overcome this problem, we propose a self-supervised learning framework: Modal-specific Pseudo Query Generation Network (MPGN).\nFirst, MPGN selects candidate temporal moments via subtitle-based moment sampling.\nThen, it generates pseudo queries exploiting both visual\nand textual information from the selected temporal moments.\nThrough the multimodal information in the pseudo queries, we show that MPGN successfully learns to localize the video corpus moment without any explicit annotation.\nWe validate the effectiveness of MPGN on TVR dataset, showing the competitive results compared with both supervised models and unsupervised setting models.", "track": "Unsupervised and Weakly-Supervised Methods in NLP", "label": 17, "url": "https://www.semanticscholar.org/reader/42d0c43d016b1cc1b8bf0fb01cbad17bdbb16400?experiments=&features=reader_skimming%3Atrue"}, {"loc": [3.35899019241333, 4.05472469329834], "id": 2606, "title": "DuQM: A Chinese Dataset of Linguistically Perturbed Natural Questions for Evaluating the Robustness of Question Matching Models", "authors": "Hongyu Zhu, Yan Chen, Jing Yan, Jing Liu, Yu Hong, Ying Chen, Hua Wu and Haifeng Wang", "abstract": "In this paper, we focus on the robustness evaluation of Chinese Question Matching (QM) models. Most of the previous work on analyzing robustness issues focus on just one or a few types of artificial adversarial examples. Instead, we argue that a comprehensive evaluation should be conducted on natural texts, which takes into account the fine-grained linguistic capabilities of QM models. For this purpose, we create a Chinese dataset namely DuQM which contains natural questions with linguistic perturbations to evaluate the robustness of QM models. DuQM contains 3 categories and 13 subcategories with 32 linguistic perturbations. The extensive experiments demonstrate that DuQM has a better ability to distinguish different models. Importantly, the detailed breakdown of evaluation by the linguistic phenomena in DuQM helps us easily diagnose the strength and weakness of different models. Additionally, our experiment results show that the effect of artificial adversarial examples does not work on natural texts. Our baseline codes and a leaderboard are now publicly available.", "track": "Question Answering", "label": 11, "url": "https://www.semanticscholar.org/reader/3d9c624ce3a4c968f901d17c507b06fa5abe4c5b?experiments=&features=reader_skimming%3Atrue"}, {"loc": [10.882485389709473, 6.780794620513916], "id": 2609, "title": "DivEMT: Neural Machine Translation Post-Editing Effort Across Typologically Diverse Languages", "authors": "Gabriele Sarti, Arianna Bisazza, Ana Guerberof and Antonio Toral", "abstract": "We introduce DivEMT, the first publicly available post-editing study of Neural Machine Translation (NMT) over a typologically diverse set of target languages. Using a strictly controlled setup, 18 professional translators were instructed to translate or post-edit the same set of English documents into Arabic, Dutch, Italian, Turkish, Ukrainian, and Vietnamese. During the process, their edits, keystrokes, editing times and pauses were recorded, enabling an in-depth, cross-lingual evaluation of NMT quality and post-editing effectiveness. Using this new dataset, we assess the impact of two state-of-the-art NMT systems, Google Translate and the multilingual mBART-50 model, on translation productivity. We find that post-editing is consistently faster than translation from scratch. However, the magnitude of productivity gains varies widely across systems and languages, highlighting major disparities in post-editing effectiveness for languages at different degrees of typological relatedness to English, even when controlling for system architecture and training data size. We publicly release the complete dataset including all collected behavioral data, to foster new research on the translation capabilities of NMT systems for typologically diverse languages.", "track": "Resources and Evaluation", "label": 1, "url": "https://www.semanticscholar.org/reader/457987f1e7c22e193a8d0dd3704781b3a51b977f?experiments=&features=reader_skimming%3Atrue"}, {"loc": [6.295383453369141, 5.520113945007324], "id": 2616, "title": "Bridging Fairness and Environmental Sustainability in Natural Language Processing", "authors": "Marius Hessenthaler, Emma Strubell, Dirk Hovy and Anne Lauscher", "abstract": "Fairness and environmental impact are important research directions for the sustainable development of artificial intelligence. However, while each topic is an active research area in natural language processing (NLP), there is a surprising lack of research on the interplay between the two fields. \nThis lacuna is highly problematic, since there is increasing evidence that an exclusive focus on fairness can actually hinder environmental sustainability, and vice versa. \nIn this work, we shed light on this crucial intersection in NLP by (1) investigating the efficiency of current fairness approaches through surveying example methods for reducing unfair stereotypical bias from the literature, and (2) evaluating a common technique to reduce energy consumption (and thus environmental impact) of English NLP models, knowledge distillation (KD), for its impact on fairness. \nIn this case study, we evaluate the effect of important KD factors, including layer and dimensionality reduction, with respect to: (a) performance on the distillation task (natural language inference and semantic similarity prediction), and (b) multiple measures and dimensions of stereotypical bias (e.g., gender bias measured via the Word Embedding Association Test). \nOur results lead us to clarify current assumptions regarding the effect of KD on unfair bias: contrary to other findings, we show that KD can actually decrease model fairness.", "track": "Theme Track", "label": 18, "url": "https://www.semanticscholar.org/reader/a8c09c41f39d798dc4201eeec1452fe617e428df?experiments=&features=reader_skimming%3Atrue"}, {"loc": [6.517040252685547, 12.039569854736328], "id": 2620, "title": "UniMSE: Towards Unified Multimodal Sentiment Analysis and Emotion Recognition", "authors": "Guimin Hu, Ting-En Lin, Yi Zhao, Guangming Lu, Yuchuan Wu and Yongbin Li", "abstract": "Multimodal sentiment analysis (MSA) and emotion recognition in conversation (ERC) are key research topics for computers to understand human behaviors. From a psychological perspective, emotions are the expression of affect or feelings during a short period, while sentiments are formed and held for a longer period. However, most existing works study sentiment and emotion separately and do not fully exploit the complementary knowledge behind the two. In this paper, we propose a multimodal sentiment knowledge-sharing framework (UniMSE) that unifies MSA and ERC tasks from features, labels, and models. We perform modality fusion at the syntactic and semantic levels and introduce contrastive learning between modalities and samples to better capture the difference and consistency between sentiments and emotions. Experiments on four public benchmark datasets, MOSI, MOSEI, MELD, and IEMOCAP, demonstrate the effectiveness of the proposed method and achieve consistent improvements compared with state-of-the-art methods.", "track": "Sentiment Analysis, Stylistic Analysis, and Argument Mining", "label": 16, "url": ""}, {"loc": [6.962857723236084, 6.344462871551514], "id": 2626, "title": "Is the Brain Mechanism for Hierarchical Structure Building Universal Across Languages? An fMRI Study of Chinese and English", "authors": "Xiaohan Zhang, Shaonan Wang, Nan Lin and Chengqing Zong", "abstract": "Evidence from psycholinguistic studies suggests that the human brain builds a hierarchical syntactic structure during language comprehension. However, it is still unknown whether the neural basis of such structures is universal across languages. In this paper, we first analyze the differences in language structure between two diverse languages: Chinese and English. \nBy computing the working memory requirements when applying parsing strategies to different language structures, we find that top-down parsing generates less memory load for the right-branching English and bottom-up parsing is less memory-demanding for Chinese.\nThen we use functional magnetic resonance imaging (fMRI) to investigate whether the brain has different syntactic adaptation strategies in processing Chinese and English. Specifically, for both Chinese and English, we extract predictors from the implementations of different parsing strategies, i.e., bottom-up and top-down. Then, these predictors are separately associated with fMRI signals. \nResults show that for Chinese and English, the brain utilizes bottom-up and top-down parsing strategies separately. These results reveal that the brain adopts parsing strategies with less memory processing load according to different language structures.", "track": "Linguistic Theories, Cognitive Modeling and Psycholinguistics", "label": 22, "url": ""}, {"loc": [8.561875343322754, 7.85040807723999], "id": 2630, "title": "HashFormers: Towards Vocabulary-independent Pre-trained Transformers", "authors": "Huiyin Xue and Nikolaos Aletras", "abstract": "Transformer-based pre-trained language models are vocabulary-dependent, mapping by default each token to its corresponding embedding. This one-to-one mapping results into embedding matrices that occupy a lot of memory (i.e. millions of parameters) and grow linearly with the size of the vocabulary. Previous work on on-device transformers dynamically generate token embeddings on-the-fly without embedding matrices using locality-sensitive hashing over morphological information. These embeddings are subsequently fed into transformer layers for text classification. However, these methods are not pre-trained. Inspired by this line of work, we propose HashFormers, a new family of vocabulary-independent pre-trained transformers that support an unlimited vocabulary (i.e. all possible tokens in a corpus) given a substantially smaller fixed-sized embedding matrix. We achieve this by first introducing computationally cheap hashing functions that bucket together individual tokens to embeddings. We also propose three variants that do not require an embedding matrix at all, further reducing the memory requirements. We empirically demonstrate that HashFormers are more memory efficient compared to standard pre-trained transformers while achieving comparable predictive performance when fine-tuned on multiple text classification tasks. For example, our most efficient HashFormer variant has a negligible performance degradation (0.4% on GLUE) using only 99.1K parameters for representing the embeddings compared to 12.3-38M parameters of state-of-the-art models.", "track": "Efficient Methods for NLP", "label": 12, "url": ""}, {"loc": [0.7850092649459839, 7.930887222290039], "id": 2634, "title": "MatchPrompt: Prompt-based Open Relation Extraction with Semantic Consistency Guided Clustering", "authors": "Jiaxin Wang, Lingling Zhang, Jun Liu, Liang Xi, Yujie Zhong and Yaqiang Wu", "abstract": "Relation clustering is a general approach for open relation extraction (OpenRE). Current methods have two major problems. One is that their good performance relies on large amounts of labeled and pre-defined relational instances for pre-training, which are costly to acquire in reality. The other is that they only focus on learning a high-dimensional metric space to measure the similarity of novel relations and ignore the specific relational representations of clusters. In this work, we propose a new prompt-based framework named MatchPrompt, which can realize OpenRE with efficient knowledge transfer from only a few pre-defined relational instances as well as mine the specific meanings for cluster interpretability. To our best knowledge, we are the first to introduce a prompt-based framework for unlabeled clustering. Experimental results on different datasets show that MatchPrompt achieves the new SOTA results for OpenRE.", "track": "Information Extraction", "label": 5, "url": ""}, {"loc": [1.045127511024475, 10.527294158935547], "id": 2638, "title": "Improving Aspect Sentiment Quad Prediction via Template-Order Data Augmentation", "authors": "Mengting Hu, Yike Wu, Hang Gao, Yinhao Bai and Shiwan Zhao", "abstract": "Recently, aspect sentiment quad prediction (ASQP) has become a popular task in the field of aspect-level sentiment analysis. Previous work utilizes a predefined template to paraphrase the original sentence into a structure target sequence, which can be easily decoded as quadruplets of the form (aspect category, aspect term, opinion term, sentiment polarity). The template involves the four elements in a fixed order. However, we observe that this solution contradicts with the order-free property of the ASQP task, since there is no need to fix the template order as long as the quadruplet is extracted correctly. Inspired by the observation, we study the effects of template orders and find that some orders help the generative model achieve better performance. It is hypothesized that different orders provide various views of the quadruplet. Therefore, we propose a simple but effective method to identify the most proper orders, and further combine multiple proper templates as data augmentation to improve the ASQP task. Specifically, we use the pre-trained language model to select the orders with minimal entropy. By fine-tuning the pre-trained language model with these template orders, our approach improves the performance of quad prediction, and outperforms state-of-the-art methods significantly in low-resource settings.", "track": "Sentiment Analysis, Stylistic Analysis, and Argument Mining", "label": 16, "url": "https://www.semanticscholar.org/reader/d8cf0c34bc0e986a71a0a01472d124261172cd7f?experiments=&features=reader_skimming%3Atrue"}, {"loc": [6.105708599090576, 5.932534217834473], "id": 2639, "title": "SocioProbe: What, When, and Where Language Models Learn about Sociodemographics", "authors": "Anne Lauscher, Federico Bianchi, Samuel R. Bowman and Dirk Hovy", "abstract": "Pre-trained language models (PLMs) have outperformed other NLP models on a wide range of tasks.  \nOpting for a more thorough understanding of their capabilities and inner workings, researchers have established the extend to which they capture lower-level knowledge like grammaticality, and mid-level semantic knowledge like factual understanding. However, there is still little understanding of their knowledge of  higher-level aspects of language. In particular, despite the importance of sociodemographic aspects in shaping our language, the questions of whether, where, and how PLMs encode these aspects, e.g., gender or age, is still unexplored. \nWe address this research gap by probing the sociodemographic knowledge of different single-GPU PLMs on multiple English data sets via traditional classifier probing and information-theoretic minimum description length probing. Our results show that PLMs do encode these sociodemographics, and that this knowledge is sometimes spread across the layers of some of the tested PLMs. We further conduct a multilingual analysis and investigate the effect of supplementary training to further explore to what extent, where, and with what amount of pre-training data the knowledge is encoded. \nOur overall results indicate that sociodemographic knowledge is still a major challenge for NLP. PLMs require large amounts of pre-training data to acquire the knowledge and models that excel in general language understanding do not seem to own more knowledge about these aspects.", "track": "Language Modeling and Analysis of Language Models", "label": 2, "url": "https://www.semanticscholar.org/reader/1d4d3bdbc70ab400d206ae209546f267f85817c4?experiments=&features=reader_skimming%3Atrue"}, {"loc": [10.391593933105469, 7.04047966003418], "id": 2642, "title": "When does Parameter-Efficient Transfer Learning Work for Machine Translation?", "authors": "Ahmet \u00dcst\u00fcn and Asa Cooper Stickland", "abstract": "Parameter-efficient fine-tuning methods (PEFTs) offer the promise of adapting large pre-trained models while only tuning a small number of parameters. They have been shown to be competitive with full model fine-tuning for many downstream tasks. However, prior work indicates that PEFTs may not work as well for machine translation (MT), and there is no comprehensive study showing when PEFTs work for MT. We conduct a comprehensive empirical study of PEFTs for MT, considering (1) various parameter budgets, (2) a diverse set of language-pairs, and (3) different pre-trained models. \nWe find that 'adapters', in which small feed-forward networks are added after every layer, are indeed on par with full model fine-tuning when the parameter budget corresponds to 10% of total model parameters. Nevertheless, as the number of tuned parameters decreases, the performance of PEFTs decreases. The magnitude of this decrease depends on the language pair, with PEFTs particularly struggling for distantly related language-pairs. We find that using PEFTs with a larger pre-trained model outperforms full fine-tuning with a smaller model, and for smaller training data sizes, PEFTs outperform full fine-tuning for the same pre-trained model.", "track": "Machine Translation", "label": 10, "url": "https://www.semanticscholar.org/reader/4f68042a0aa40f34027a49ceec64ad2bbe2211aa?experiments=&features=reader_skimming%3Atrue"}, {"loc": [9.229597091674805, 6.99232816696167], "id": 2650, "title": "Hyper-X: A Unified Hypernetwork for Multi-Task Multilingual Transfer", "authors": "Ahmet \u00dcst\u00fcn, Arianna Bisazza, Gosse Bouma, Gertjan van Noord and Sebastian Ruder", "abstract": "Massively multilingual models are promising for transfer learning across tasks and languages. However, existing methods are unable to fully leverage training data when it is available in different task-language combinations. To exploit such heterogeneous supervision, we propose Hyper-X, a single hypernetwork that unifies multi-task and multilingual learning with efficient adaptation. It generates weights for adapter modules conditioned on both tasks and language embeddings. By learning to combine task and language-specific knowledge, our model enables zero-shot transfer for unseen languages and task-language combinations. Our experiments on a diverse set of languages demonstrate that Hyper-X achieves the best or competitive gain when a mixture of multiple resources is available, while on par with strong baseline in the standard scenario. Hyper-X is also considerably more efficient in terms of parameters and resources compared to methods that train separate adapters. Finally, Hyper-X consistently produces strong results in few-shot scenarios for new languages, showing the versatility of our approach beyond zero-shot transfer.", "track": "Multilinguality", "label": 13, "url": "https://www.semanticscholar.org/reader/6aeb1469188354fbf572f6039822dde06b8e65bc?experiments=&features=reader_skimming%3Atrue"}, {"loc": [3.39912748336792, 4.042390823364258], "id": 2652, "title": "Towards Robust Numerical Question Answering: Diagnosing Numerical Capabilities of NLP Systems", "authors": "Jialiang Xu, Mengyu Zhou, Xinyi He, Shi Han and Dongmei Zhang", "abstract": "Numerical Question Answering is the task of answering questions that require numerical capabilities. Previous works introduce general adversarial attacks to Numerical Question Answering, while not systematically exploring numerical capabilities specific to the topic. In this paper, we propose to conduct numerical capability diagnosis on a series of Numerical Question Answering systems and datasets. A series of numerical capabilities are highlighted, and corresponding dataset perturbations are designed. Empirical results indicate that existing systems are severely challenged by these perturbations. E.g., Graph2Tree experienced a 53.83% absolute accuracy drop against the \"Extra\u201d perturbation on ASDiv-a, and BART experienced 13.80% accuracy drop against the \"Language\u201d perturbation on the numerical subset of DROP. As a counteracting approach, we also investigate the effectiveness of applying perturbations as data augmentation to relieve systems' lack of robust numerical capabilities. With experiment analysis and empirical studies, it is demonstrated that Numerical Question Answering with robust numerical capabilities is still to a large extent an open question. We discuss future directions of Numerical Question Answering and summarize guidelines on future dataset collection and system design.", "track": "Theme Track", "label": 18, "url": "https://www.semanticscholar.org/reader/1a174b63d294f96568517b91f2c8d6c9362118b5?experiments=&features=reader_skimming%3Atrue"}, {"loc": [6.915184020996094, 9.573827743530273], "id": 2659, "title": "Enhancing Joint Multiple Intent Detection and Slot Filling with Global Intent-Slot Co-occurrence", "authors": "Mengxiao Song, Bowen Yu, Li Quangang, Wang Yubin, Tingwen Liu and Hongbo Xu", "abstract": "Multi-intent detection and slot filling joint model attracts more and more attention since it can handle multi-intent utterances, which is closer to complex real-world scenarios. Most existing joint models rely entirely on the training procedure to obtain the implicit correlation between intents and slots. However, they ignore the fact that leveraging the rich global knowledge in the corpus can determine the intuitive and explicit correlation between intents and slots. \nIn this paper, we aim to make full use of the statistical co-occurrence frequency between intents and slots as prior knowledge to enhance joint multiple intent detection and slot filling. To be specific, an intent-slot co-occurrence graph is constructed based on the entire training corpus to globally discover correlation between intents and slots. Based on the global intent-slot co-occurrence, we propose a novel graph neural network to model the interaction between the two subtasks. \nExperimental results on two public multi-intent datasets demonstrate that our approach outperforms the state-of-the-art models.", "track": "Dialogue and Interactive Systems", "label": 4, "url": ""}, {"loc": [4.176275253295898, 8.134502410888672], "id": 2660, "title": "Towards Pragmatic Production Strategies for Natural Language Generation Tasks", "authors": "Mario Giulianelli", "abstract": "This position paper proposes a conceptual framework for the design of Natural Language Generation (NLG) systems that follow efficient and effective production strategies in order to achieve complex communicative goals. In this general framework, efficiency is characterised as the parsimonious regulation of production and comprehension costs while effectiveness is measured with respect to task-oriented and contextually grounded communicative goals. \nWe provide concrete suggestions for the estimation of goals, costs, and utility via modern statistical methods, demonstrating applications of our framework to the classic pragmatic task of visually grounded referential games and to abstractive text summarisation, two popular generation tasks with real-world applications. In sum, we advocate for the development of NLG systems that learn to make pragmatic production decisions from experience, by reasoning about goals, costs, and utility in a human-like way.", "track": "Theme Track", "label": 18, "url": "https://www.semanticscholar.org/reader/d1670333cd0e264f5b45b4c94f14fa741bd5066b?experiments=&features=reader_skimming%3Atrue"}, {"loc": [5.7520575523376465, 11.786705017089844], "id": 2670, "title": "LiteVL: Efficient Video-Language Learning with Enhanced Spatial-Temporal Modeling", "authors": "Dongsheng Chen, Chaofan Tao, Lu Hou, Lifeng Shang, Xin Jiang and Qun Liu", "abstract": "Recent large-scale video-language pre-trained models have shown appealing performance on various downstream tasks. However, the pre-training process is computationally expensive due to the requirement of millions of video-text pairs and the redundant data structure of each video. To mitigate these problems, we propose LiteVL, which adapts a pre-trained image-language model BLIP into a video-text model directly on downstream tasks, without heavy pre-training. To enhance the temporal modeling lacking in the image-language model, we propose to add temporal attention modules in the image encoder of BLIP with dynamic temporal scaling. Besides the model-wise adaptation, we also propose a non-parametric pooling mechanism to adaptively reweight the fine-grained video embedding conditioned on the text. Experimental results on text-video retrieval and video question answering show that the proposed LiteVL even outperforms previous video-language pre-trained models by a clear margin, though without any video-language pre-training.", "track": "Speech, Vision, Robotics, Multimodal Grounding", "label": 7, "url": "https://www.semanticscholar.org/reader/60979e2ae04a61dac30b5198784c0c2fb5cd8039?experiments=&features=reader_skimming%3Atrue"}, {"loc": [5.195528984069824, 12.423458099365234], "id": 2676, "title": "Communication breakdown: On the low mutual intelligibility between human and neural captioning", "authors": "Roberto Dess\u00ec, Eleonora Gualdoni, Francesca Franzon, Gemma Boleda and Marco Baroni", "abstract": "We compare the 0-shot performance of a neural caption-based image retriever when given as input either human-produced captions or captions generated by a neural captioner. We conduct this comparison on the recently introduced ImageCoDe data-set (Krojer et al. 2022), which contains hard distractors nearly identical to the images to be retrieved. We find that the neural retriever has much higher performance when fed neural rather than human captions, despite the fact that the former, unlike the latter, were generated without awareness of the distractors that make the task hard. Even more remarkably, when the same neural captions are given to human subjects, their retrieval performance is almost at chance level. Our results thus add to the growing body of evidence that, even when the ``language'' of neural models resembles English, this superficial resemblance might be deeply misleading.", "track": "Interpretability, Interactivity and Analysis of Models for NLP", "label": 9, "url": "https://www.semanticscholar.org/reader/338e338149b12d820f92609f8886ddfb9c37d124?experiments=&features=reader_skimming%3Atrue"}, {"loc": [10.670960426330566, 6.964401721954346], "id": 2688, "title": "Normalizing Mutual Information for Robust Adaptive Training for Translation", "authors": "Youngwon Lee, Changmin Lee, Hojin Lee and Seung-won Hwang", "abstract": "Despite the success of neural machine translation models, tensions between fluency of optimizing target language modeling and source-faithfulness remain as challenges. Previously, Conditional Bilingual Mutual Information (CBMI), a scoring metric for the importance of target sentences and tokens, was proposed to encourage fluent and faithful translations. The score is obtained by combining the probability from the translation model and the target language model, which is then used to assign different weights to losses from sentences and tokens. Meanwhile, we argue this metric is not properly normalized, for which we propose Normalized Pointwise Mutual Information (NPMI). NPMI utilizes an additional language model on source language to approximate the joint likelihood of source-target pair and the likelihood of the source, which is then used for normalizing the score. We showed that NPMI better captures the dependence between source-target and that NPMI-based token-level adaptive training brings improvements over baselines with empirical results from En-De, De-En, and En-Ro translation tasks.", "track": "Machine Translation", "label": 10, "url": ""}, {"loc": [10.632492065429688, 6.878334999084473], "id": 2690, "title": "Bilingual Synchronization: Restoring Translational Relationships with Editing Operations", "authors": "Jitao Xu, Josep Crego and Fran\u00e7ois Yvon", "abstract": "Machine Translation (MT) is usually viewed as a one-shot process that generates the target language equivalent of some source text from scratch. We consider here a more general setting which assumes an initial target sequence, that must be transformed into a valid translation of the source, thereby restoring parallelism between source and target. For this bilingual synchronization task, we consider several architectures (both autoregressive and non-autoregressive) and training regimes, and experiment with multiple practical settings such as simulated interactive MT, translating with Translation Memory (TM) and TM cleaning. Our results suggest that one single generic edit-based system, once fine-tuned, can compare with, or even outperform, dedicated systems specifically trained for these tasks.", "track": "Machine Translation", "label": 10, "url": "https://www.semanticscholar.org/reader/c9d382d9960f5d7d54ca260ffa2e3bff7092f0be?experiments=&features=reader_skimming%3Atrue"}, {"loc": [7.550704479217529, 12.359099388122559], "id": 2696, "title": "Human-Machine Collaboration Approaches to Build a Dialogue Dataset for Hate Speech Countering", "authors": "Helena Bonaldi, Sara Dellantonio, Serra Sinem Tekiro\u011flu and Marco Guerini", "abstract": "Fighting online hate speech is a challenge that is usually addressed using Natural Language Processing via automatic detection and removal of hate content. Besides this approach, counter narratives have emerged as an effective tool employed by NGOs to respond to online hate on social media platforms. For this reason, Natural Language Generation is currently being studied as a way to automatize counter narrative writing. However, the existing resources necessary to train NLG models are limited to 2-turn interactions (a hate speech and a counter narrative as response), while in real life, interactions can consist of multiple turns. In this paper, we present a hybrid approach for dialogical data collection, which combines the intervention of human expert annotators over machine generated dialogues obtained using 19 different configurations. The result of this work is DIALOCONAN, the first dataset comprising over 3000 fictitious multi-turn dialogues between a hater and an NGO operator, covering 6 targets of hate.", "track": "Resources and Evaluation", "label": 1, "url": "https://www.semanticscholar.org/reader/b22a61395dd47f74c3c05c9e801deaec3f01f482?experiments=&features=reader_skimming%3Atrue"}, {"loc": [10.46934700012207, 7.771413803100586], "id": 2710, "title": "JANUS: Joint Autoregressive and Non-autoregressive Training with Auxiliary Loss for Sequence Generation", "authors": "Xiaobo Liang, Lijun Wu, Juntao Li and Min Zhang", "abstract": "Transformer-based autoregressive and non-autoregressive models have played an essential role in sequence generation tasks. The autoregressive model can obtain excellent performance, while the non-autoregressive model brings fast decoding speed for inference. In this paper, we propose \\textbf{JANUS}, a \\textbf{J}oint \\textbf{A}utoregressive and \\textbf{N}on-autoregressive training method using a\\textbf{U}xiliary los\\textbf{S} to enhance the model performance in both AR and NAR manner simultaneously and effectively alleviate the problem of distribution discrepancy.\nFurther, we pre-train BART with JANUS on a large corpus with minimal cost (16 GPU days) and make the BART-JANUS capable of non-autoregressive generation, demonstrating that our approach can transfer the AR knowledge to NAR. Empirically, we show our approach and BART-JANUS can achieve significant improvement on multiple generation tasks, including machine translation and GLGE benchmarks. Our code is available at Github\\footnote{\\url{https://github.com/dropreg/JANUS}}.", "track": "Natural Language Generation", "label": 6, "url": ""}, {"loc": [5.427000522613525, 12.192925453186035], "id": 2725, "title": "Entity-Focused Dense Passage Retrieval for Outside-Knowledge Visual Question Answering", "authors": "Jialin Wu and Raymond Mooney", "abstract": "Most Outside-Knowledge Visual Question Answering (OK-VQA) systems employ a two-stage framework that first retrieves external knowledge given the visual question and then predicts the answer based on the retrieved content. However, the retrieved knowledge is often inadequate. Retrievals are frequently too general and fail to cover specific knowledge needed to answer the question. Also, the naturally available supervision (whether the passage contains the correct answer) is weak and does not guarantee question relevancy. To address these issues, we propose an Entity-Focused Retrieval (EnFoRe) model that provides stronger supervision during training and recognizes question-relevant entities to help retrieve more specific knowledge. Experiments show that our EnFoRe model achieves superior retrieval performance on OK-VQA, the currently largest outside-knowledge VQA dataset. We also combine the retrieved  knowledge with state-of-the-art VQA models, and achieve a new state-of-the-art performance on OK-VQA.", "track": "Speech, Vision, Robotics, Multimodal Grounding", "label": 7, "url": "https://www.semanticscholar.org/reader/915db407b5bbeb0ca9a9f33668533450d8e54af4?experiments=&features=reader_skimming%3Atrue"}, {"loc": [9.146728515625, 6.326391696929932], "id": 2728, "title": "Cross-Linguistic Syntactic Difference in Multilingual BERT: How Good is It and How Does It Affect Transfer?", "authors": "Ningyu Xu, Tao Gui, Ruotian Ma, Qi Zhang, Jingting Ye, Menghan Zhang and Xuanjing Huang", "abstract": "Multilingual BERT (mBERT) has demonstrated considerable cross-lingual syntactic ability, whereby it enables effective zero-shot cross-lingual transfer of syntactic knowledge. The transfer is more successful between some languages, but it is not well understood what leads to this variation and whether it fairly reflects difference between languages. In this work, we investigate the distributions of grammatical relations induced from mBERT in the context of 24 typologically different languages. We demonstrate that the distance between the distributions of different languages is highly consistent with the syntactic difference in terms of linguistic formalisms. Such difference learnt via self-supervision plays a crucial role in the zero-shot transfer performance and can be predicted by variation in morphosyntactic properties between languages. These results suggest that mBERT properly encodes languages in a way consistent with linguistic diversity and provide insights into the mechanism of cross-lingual transfer.", "track": "Interpretability, Interactivity and Analysis of Models for NLP", "label": 9, "url": ""}, {"loc": [7.562887668609619, 12.31489372253418], "id": 2734, "title": "\"It's Not Just Hate\": A Multi-Dimensional Perspective on Detecting Harmful Speech Online", "authors": "Federico Bianchi, Stefanie HIlls, Patricia Rossini, Dirk Hovy, Rebekah Tromble and Nava Tintarev", "abstract": "Well-annotated data is a prerequisite for good Natural Language Processing models. Too often, though, annotation decisions are governed by optimizing time or annotator agreement. We make a case for nuanced efforts in an interdisciplinary setting for annotating offensive online speech. Detecting offensive content is rapidly becoming one of the most important real-world NLP tasks. However, most datasets use a single binary label, e.g., for hate or incivility, even though each concept is multi-faceted. This modeling choice severely limits nuanced insights, but also performance.\nWe show that a more fine-grained multi-label approach to predicting incivility and hateful or intolerant content addresses both conceptual and performance issues.\nWe release a novel dataset of over 40,000 tweets about immigration from the US and UK, annotated with six labels for different aspects of incivility and intolerance.\nOur dataset not only allows for a more nuanced understanding of harmful speech online, models trained on it also outperform or match performance on benchmark datasets", "track": "NLP Applications", "label": 0, "url": "https://www.semanticscholar.org/reader/1daf323d06fc68feba72d8826ea3372ef50aee14?experiments=&features=reader_skimming%3Atrue"}, {"loc": [4.907902240753174, 9.007170677185059], "id": 2758, "title": "Long Text Generation with Topic-aware Discrete Latent Variable Model", "authors": "Erguang Yang, Mingtong Liu, Deyi Xiong, YUJIE ZHANG, Yufeng Chen and Jinan Xu", "abstract": "Generating coherent long texts is an important yet challenging task, particularly for\nthe open-ended generation. Prior work based on discrete latent codes focuses on the modeling of discourse relation, resulting in discrete codes only learning shallow semantics (Ji and Huang, 2021). \nA natural text always revolves around several related topics and the transition across them is natural and smooth.\nIn this work, we investigate whether discrete latent codes can learn information of topics. To this end, we build a topic-aware latent code-guided text generation model. To encourage discrete codes to model information about topics, we propose a span-level bag-of-words training objective for the model. Automatic and manual evaluation experiments show that our method can generate more topic-relevant and coherent texts.", "track": "Natural Language Generation", "label": 6, "url": ""}, {"loc": [1.796485185623169, 5.315113544464111], "id": 2761, "title": "TIARA: Multi-grained Retrieval for Robust Question Answering over Large Knowledge Base", "authors": "Yiheng Shu, Zhiwei Yu, Yuhan Li, B\u00f6rje Karlsson, Tingting Ma, Yuzhong Qu and Chin-Yew Lin", "abstract": "Pre-trained language models (PLMs) have shown their effectiveness in multiple scenarios. However, KBQA remains challenging, especially regarding coverage and generalization settings. This is due to two main factors: i) understanding the semantics of both questions and relevant knowledge from the KB; ii) generating executable logical forms with both semantic and syntactic correctness. In this paper, we present a new KBQA model, TIARA, which addresses those issues by applying multi-grained retrieval to help the PLM focus on the most relevant KB context, viz., entities, exemplary logical forms, and schema items. Moreover, constrained decoding is used to control the output space and reduce generation errors. Experiments over important benchmarks demonstrate the effectiveness of our approach. TIARA outperforms previous SOTA, including those using PLMs or oracle entity annotations, by at least 4.1 and 1.1 F1 points on GrailQA and WebQuestionsSP, respectively. Specifically on GrailQA, TIARA outperforms previous models in all categories, with an improvement of 4.7 F1 points in zero-shot generalization.", "track": "Question Answering", "label": 11, "url": "https://www.semanticscholar.org/reader/dbc6622b8c70bc1a3cc290fdb166229d80ec8f83?experiments=&features=reader_skimming%3Atrue"}, {"loc": [4.028550624847412, 3.9718105792999268], "id": 2767, "title": "Structure-Unified M-Tree Coding Solver for Math Word Problem", "authors": "bin wang, Jiangzhou Ju, Yang Fan, Xinyu Dai, Shujian Huang and Jiajun CHEN", "abstract": "As one of the challenging NLP tasks, designing math word problem (MWP) solvers has attracted increasing research attention for the past few years. In previous work, models designed by taking into account the properties of the binary tree structure of mathematical expressions at the output side have achieved better performance. However, the expressions corresponding to a MWP are often diverse (e.g., $n_1+n_2 \\times n_3-n_4$, $n_3\\times n_2-n_4+n_1$, etc.), and so are the corresponding binary trees, which creates difficulties in model learning due to the non-deterministic output space. In this paper, we propose the Structure-Unified M-Tree Coding Solver (SUMC-Solver), which applies a tree with any M branches (M-tree) to unify the output structures. To learn the M-tree, we use a mapping to convert the M-tree into the M-tree codes, where codes store the information of the paths from tree root to leaf nodes and the information of leaf nodes themselves, and then devise a Sequence-to-Code (seq2code) model to generate the codes. Experimental results on the widely used MAWPS and Math23K datasets have demonstrated that SUMC-Solver not only outperforms several state-of-the-art models under similar experimental settings but also performs much better under low-resource conditions.", "track": "Question Answering", "label": 11, "url": ""}, {"loc": [2.6793723106384277, 4.819819450378418], "id": 2773, "title": "FormLM: Recommending Creation Ideas for Online Forms by Modelling Semantic and Structural Information", "authors": "Yijia Shao, Mengyu Zhou, Yifan Zhong, Tao Wu, Hongwei Han, Shi Han, Gideon Huang and Dongmei Zhang", "abstract": "Online forms are widely used to collect data from human and have a multi-billion market. Many software products provide online services for creating semi-structured forms where questions and descriptions are organized by predefined structures. However, the design and creation process of forms is still tedious and requires expert knowledge. To assist form designers, in this work we present FormLM to model online forms (by enhancing pre-trained language model with form structural information) and recommend form creation ideas (including question / options recommendations and block type suggestion). For model training and evaluation, we collect the first public online form dataset with 62K online forms. Experiment results show that FormLM significantly outperforms general-purpose language models on all tasks, with an improvement by 4.71 on Question Recommendation and 10.6 on Block Type Suggestion in terms of ROUGE-1 and Macro-F1, respectively.", "track": "NLP Applications", "label": 0, "url": "https://www.semanticscholar.org/reader/c9d90133c08a92d3d99cddee5d107933cf241367?experiments=&features=reader_skimming%3Atrue"}, {"loc": [8.031818389892578, 5.735328197479248], "id": 2785, "title": "Generate, Discriminate and Contrast: A Semi-Supervised Sentence Representation Learning Framework", "authors": "Yiming Chen, Yan Zhang, Bin Wang, ZUOZHU LIU and Haizhou Li", "abstract": "Most sentence embedding techniques heavily rely on expensive human-annotated sentence pairs as the supervised signals. Despite the use of large-scale unlabeled data, the performance of unsupervised methods typically lags far behind that of the supervised counterparts in most downstream tasks. In this work, we propose a semi-supervised sentence embedding framework, GenSE, that effectively leverages large-scale unlabeled data. Our method include three parts: 1) Generate: A generator/discriminator model is jointly trained to synthesize sentence pairs from open-domain unlabeled corpus; 2) Discriminate: Noisy sentence pairs are filtered out by the discriminator to acquire high-quality positive and negative sentence pairs; 3) Contrast: A prompt-based contrastive approach is presented for sentence representation learning with both annotated and synthesized data. Comprehensive experiments show that GenSE achieves an average correlation score of 85.19 on the  STS datasets and consistent performance improvement on four domain adaptation tasks, significantly surpassing the state-of-the-art methods and convincingly corroborating its effectiveness and generalization ability.", "track": "Semantics: Lexical, Sentence level, Textual Inference and Other areas", "label": 8, "url": ""}, {"loc": [8.112783432006836, 9.416691780090332], "id": 2786, "title": "GPS: Genetic Prompt Search for Efficient Few-Shot Learning", "authors": "Hanwei Xu, Yujun Chen, Yulun Du, Nan Shao, wang yanggang, Haiyu Li and Zhilin Yang", "abstract": "Prompt-based techniques have demostrated great potential for improving the few-shot generalization of pretrained language models. However, their performance heavily relies on the manual design of prompts and thus requiring a lot of human efforts. In this paper, we introduce Genetic Prompt Search (GPS) to improve few-shot learning with prompts, which utilizes a genetic algorithm to automatically search for the best prompt.\nGPS is gradient-free and requires no update of model parameters but only a small validation set. \nExperiments on diverse datasets proved the effectiveness of GPS, which outperforms manual prompts by a large margin of 2.6 points. \nOur method is also better than other parameter-efficient tuning methods such as prompt tuning.", "track": "Language Modeling and Analysis of Language Models", "label": 2, "url": ""}, {"loc": [4.210636615753174, 5.173218250274658], "id": 2793, "title": "Multitask Instruction-based Prompting for Fallacy Recognition", "authors": "Tariq Alhindi, Tuhin Chakrabarty, Elena Musi and Smaranda Muresan", "abstract": "Fallacies are used as seemingly valid arguments to support a position and persuade the audience about its validity. Recognizing fallacies is an intrinsically difficult task both for humans and machines. Moreover, a big challenge for computational models lies in the fact that fallacies are formulated differently across the datasets with differences in the input format (e.g., question-answer pair, sentence with fallacy fragment), genre (e.g., social media, dialogue, news), as well as types and number of fallacies (from 5 to 18 types per dataset). To move towards solving the fallacy recognition task, we approach these differences across datasets as multiple tasks and show how instruction-based prompting in a multitask setup based on the T5 model improves the results against approaches built for a specific dataset such as T5, BERT or GPT-3. We show the ability of this multitask prompting approach to recognize 28 unique fallacies across domains and genres and study the effect of model size and prompt choice by analyzing the per-class (i.e., fallacy type) results. Finally, we analyze the effect of annotation quality on model performance, and the feasibility of complementing this approach with external knowledge.", "track": "NLP Applications", "label": 0, "url": ""}, {"loc": [5.596348285675049, 11.634411811828613], "id": 2804, "title": "Rethinking Multi-Modal Alignment in Multi-Choice VideoQA from Feature and Sample Perspectives", "authors": "Shaoning Xiao, Long Chen, Kaifeng Gao, Zhao Wang, Yi Yang, Zhimeng Zhang and Jun Xiao", "abstract": "Reasoning about causal and temporal event relations in videos is a new destination of Video Question Answering (VideoQA). The major stumbling block to achieve this purpose is the semantic gap between language and video since they are at different levels of abstraction. Existing efforts mainly focus on designing sophisticated architectures while utilizing frame- or object-level visual representations. In this paper, we reconsider the multi-modal alignment problem in VideoQA from feature and sample perspectives to achieve better performance. From the view of feature, we break down the video into trajectories and first leverage trajectory feature in VideoQA to enhance the alignment between two modalities. Moreover, we adopt a heterogeneous graph architecture and design a hierarchical framework to align both trajectory-level and frame-level visual feature with language feature. In addition, we found that VideoQA models are largely dependent on language\npriors and always neglect visual-language interactions. Thus, two effective yet portable training augmentation strategies are designed to strengthen the cross-modal correspondence ability of our model from the view of sample. Extensive results show that our method outperforms all the state-of the-art models on the challenging NExT-QA benchmark.", "track": "Question Answering", "label": 11, "url": ""}, {"loc": [4.305737495422363, 4.950861930847168], "id": 2808, "title": "Towards Table-to-Text Generation with Pretrained Language Model: A Table Structure Understanding and Text Deliberating Approach", "authors": "Miao Chen, Xinjiang Lu, Tong Xu, Yanyan Li, zhou jingbo, Dejing Dou and Hui Xiong", "abstract": "Although remarkable progress on the neural table-to-text methods has been made, the generalization issues hinder the applicability of these models due to the limited source tables. Large-scale pretrained language models sound like a promising solution to tackle such issues. However, how to effectively bridge the gap between the structured table and the text input by fully leveraging table information to fuel the pretrained model is still not well explored. Besides, another challenge of integrating the deliberation mechanism into the text-to-text pretrained model for solving the table-to-text task remains seldom studied. In this paper, to implement the table-to-text generation with pretrained language model, we propose a table structure understanding and text deliberating approach, namely TASD. To be specific, we devise a three-layered multi-head attention network to realize the table-structureaware text generation model with the help of the pretrained language model. Furthermore, a multi-pass decoder framework is adopted to enhance the capability of polishing generated text for table descriptions. The empirical studies, as well as human evaluation, on two public datasets, validate that our approach can generate faithful and fluent descriptive texts for different types of tables.", "track": "Natural Language Generation", "label": 6, "url": ""}, {"loc": [10.352788925170898, 7.4744648933410645], "id": 2820, "title": "Hierarchical Phrase-Based Sequence-to-Sequence Learning", "authors": "Bailin Wang, Ivan Titov, Jacob Andreas and Yoon Kim", "abstract": "This paper describes a neural transducer that maintains the flexibility of standard sequence-to-sequence (seq2seq) models while incorporating hierarchical phrases as a source of inductive bias during training and as explicit constraints during inference. Our approach trains two models: a discriminative parser based on a  bracketing transduction grammar  whose derivation tree hierarchically aligns source and target phrases, and a neural seq2seq model that learns to translate the aligned phrases one-by-one.  We use the same seq2seq model to translate at all phrase scales, which results in two  inference modes: one mode in which the parser is discarded and only the seq2seq component is used at the sequence-level, and another in which the parser is combined with the seq2seq model. Decoding in the latter mode is done with the cube-pruned CKY algorithm, which is more involved but can make use of  new translation rules during inference. We formalize our model as a source-conditioned synchronous grammar and develop an efficient variational inference algorithm for training. When applied on top of both randomly initialized and pretrained seq2seq models, we find that it performs well compared to baselines on small scale machine translation benchmarks.", "track": "Machine Learning for NLP", "label": 3, "url": "https://www.semanticscholar.org/reader/eb88ec94470df34af2a49d768f3dd6a1a8316c2b?experiments=&features=reader_skimming%3Atrue"}, {"loc": [4.5952630043029785, 4.592576503753662], "id": 2832, "title": "Natural Language Deduction with Incomplete Information", "authors": "Zayne R. Sprague, Kaj Bostrom, Swarat Chaudhuri and Greg Durrett", "abstract": "A growing body of work studies how to answer a question or verify a claim by generating a natural language \"proof:\u201d a chain of deductive inferences yielding the answer based on a set of premises. However, these methods can only make sound deductions when they follow from evidence that is given. We propose a new system that can handle the underspecified setting where not all premises are stated at the outset; that is, additional assumptions need to be materialized to prove a claim. By using a natural language generation model to abductively infer a premise given another premise and a conclusion, we can impute missing pieces of evidence needed for the conclusion to be true. Our system searches over two fringes in a bidirectional fashion, interleaving deductive (forward-chaining) and abductive (backward-chaining) generation steps. We sample multiple possible outputs for each step to achieve coverage of the search space, at the same time ensuring correctness by filtering low-quality generations with a round-trip validation procedure. Results on a modified version of the EntailmentBank dataset and a new dataset called Everyday Norms: Why Not? Show that abductive generation with validation can recover premises across in- and out-of-domain settings.", "track": "Semantics: Lexical, Sentence level, Textual Inference and Other areas", "label": 8, "url": ""}, {"loc": [4.92696475982666, 12.451148986816406], "id": 2833, "title": "Character-centric Story Visualization via Visual Planning and Token Alignment", "authors": "Hong Chen, Rujun Han, Te-Lin Wu, Hideki Nakayama and Nanyun Peng", "abstract": "Story visualization advances the traditional text-to-image generation by enabling multiple image generation based on a complete story. This task requires machines to 1) understand long text inputs, and 2) produce a globally consistent image sequence that illustrates the contents of the story. A key challenge of consistent story visualization is to preserve characters that are essential in stories. To tackle the challenge, we propose to adapt a recent work that augments VQ-VAE with a text-to-visual-token (transformer) architecture. Specifically, we modify the text-to-visual-token module with a two-stage framework: 1) character token planning model that predicts the visual tokens for characters only; 2) visual token completion model that generates the remaining visual token sequence, which is sent to VQ-VAE for finalizing image generations. To encourage characters to appear in the images, we further train the two-stage framework with a character-token alignment objective. Extensive experiments and evaluations demonstrate that the proposed method excels at preserving characters and can produce higher quality image sequences compared with the strong baselines.", "track": "Speech, Vision, Robotics, Multimodal Grounding", "label": 7, "url": "https://www.semanticscholar.org/reader/a6238191cc43c41a544caadcf8b00947293cf099?experiments=&features=reader_skimming%3Atrue"}, {"loc": [3.5250167846679688, 4.648708343505859], "id": 2834, "title": "ASQA: Factoid Questions Meet Long-Form Answers", "authors": "Ivan Stelmakh, Yi Luan, Bhuwan Dhingra and Ming-Wei Chang", "abstract": "Recent progress on open domain factoid question answering (QA) does not easily transfer to the task of long-form QA, where the goal is to answer questions that require in-depth explanations. The hurdles include a lack of high-quality data and the absence of a well-defined notion of an answer's quality. In this work, we address these problems by releasing a novel dataset and a task that we call ASQA (Answer Summaries for Questions which are Ambiguous); and proposing a reliable metric for measuring performance on ASQA. Our task focuses on ambiguous factoid questions which have different correct answers depending on the interpretation. Answers to ambiguous questions should combine factual information from multiple sources into a coherent long-form summary that resolves the ambiguity. In contrast to existing long-form QA tasks (such as ELI5), ASQA admits a clear notion of correctness: a user faced with a good summary should be able to answer different interpretations of the original ambiguous question. Our analysis demonstrates an agreement between this metric and human judgments, and reveals a considerable gap between human performance and strong baselines.", "track": "Question Answering", "label": 11, "url": "https://www.semanticscholar.org/reader/203636315f7c9526189d88c541bedf623d63ea7c?experiments=&features=reader_skimming%3Atrue"}, {"loc": [8.257851600646973, 6.715014934539795], "id": 2837, "title": "Algorithms for Acyclic Weighted Finite-State Automata with Failure Arcs", "authors": "Anej Svete, Benjamin Dayan, Ryan Cotterell, Tim Vieira and Jason Eisner", "abstract": "Weighted finite-state automata (WSFAs) are\ncommonly used in NLP. Failure transitions are\na useful extension for compactly representing\nbackoffs or interpolation in n-gram models\nand CRFs, which are special cases of WFSAs.\nUnfortunately, applying standard algorithms\nfor computing the pathsum requires expand-\ning these compact failure transitions. As a\nresult, na \u0308\u0131ve computation of the pathsum in\nacyclic WFSAs with failure transitions runs in\nO(|Q|2|\u03a3|) (O(|Q||\u03a3|) for deterministic WF-\nSAs) while the equivalent algorithm in normal\nWFSAs runs in O(|E|), where E represents\nthe set of transitions, Q the set of states, and\n\u03a3 the alphabet. In this work, we present more\nefficient algorithms for computing the pathsum\nin sparse acyclic WFSAs, i.e., WFSAs with av-\nerage out symbol fraction s \u226a 1. In those,\nbackward runs in O(s|Q||\u03a3|). We propose\nan algorithm for semiring-weighted automata\nwhich runs in O(|E| + s|\u03a3||Q||Tmax| log |\u03a3|),\nwhere |Tmax| is the size of the largest con-\nnected component of failure transitions. Ad-\nditionally, we propose faster algorithms for\ntwo specific cases. For ring-weighted WF-\nSAs we propose an algorithm with complex-\nity O(|E| + s|\u03a3||Q||\u03c0max|), where |\u03c0max| de-\nnotes the longest path length of failure transi-\ntions stemming from q and \u03a3(q) the set of sym-\nbols on the outgoing transitions from q. For\nsemiring-weighted WFSAs whose failure tran-\nsition topology satisfies a condition exemplified\nby CRFs, we propose an algorithm with com-\nplexity O(|E| + s|\u03a3||Q| log |\u03a3|).", "track": "Syntax, Parsing and their Applications", "label": 23, "url": ""}, {"loc": [0.7406312227249146, 8.00481128692627], "id": 2847, "title": "Towards Better Document-level Relation Extraction via Iterative Inference", "authors": "Liang Zhang, Jinsong Su, Yidong Chen, Zhongjian Miao, Min Zijun, Hu Qingguo and xiaodong shi", "abstract": "Document-level relation extraction (RE) aims to extract the relations between entities from the input document that usually containing many difficultly-predicted entity pairs whose relations can only be predicted through relational inference. Existing methods usually directly predict the relations of all entity pairs of input document in a one-pass manner, ignoring the fact that predictions of some entity pairs heavily depend on the predicted results of other pairs. To deal with this issue, in this paper, we propose a novel document-level RE model with iterative inference. Our model is mainly composed of two modules: 1) a base module expected to provide preliminary relation predictions on entity pairs; 2) an inference module introduced to refine these preliminary predictions by iteratively dealing with difficultly-predicted entity pairs depending on other pairs in an easy-to-hard manner. Unlike previous methods which only consider feature information of entity pairs, our inference module is equipped with two Extended Cross Attention units, allowing it to exploit both feature information and previous predictions of entity pairs during relational inference. Furthermore, we adopt a two-stage strategy to train our model. At the first stage, we only train our base module. During the second stage, we train the whole model, where contrastive learning is introduced to enhance the training of inference module. Experimental results on three commonly-used datasets show that our model consistently outperforms other competitive baselines.", "track": "Information Extraction", "label": 5, "url": ""}, {"loc": [7.580563068389893, 3.696763753890991], "id": 2864, "title": "Efficient Adversarial Training with Robust Early-Bird Tickets", "authors": "zhiheng xi, rui zheng, Tao Gui, Qi Zhang and Xuanjing Huang", "abstract": "Adversarial training is one of the most powerful methods to improve the robustness of pre-trained language models (PLMs). However, this approach is typically more expensive than traditional fine-tuning because of the necessity to generate adversarial examples via gradient descent. Delving into the optimization process of adversarial training, we find that robust connectivity patterns emerge in the early training phase (typically $0.15\\sim0.3$ epochs), far before parameters converge. Inspired by this finding, we dig out robust early-bird tickets (i.e., subnetworks) to develop an efficient adversarial training method: (1) searching for robust tickets with structured sparsity in the early stage; (2) fine-tuning robust tickets in the remaining time. To extract the robust tickets as early as possible, we design a ticket convergence metric to automatically terminate the searching process. Experiments show that the proposed efficient adversarial training method can achieve up to $7\\times \\sim 13 \\times$ training speedups while maintaining comparable or even better robustness compared to the most competitive state-of-the-art adversarial training methods.", "track": "Interpretability, Interactivity and Analysis of Models for NLP", "label": 9, "url": ""}, {"loc": [10.199402809143066, 6.763775825500488], "id": 2867, "title": "SMaLL-100: Introducing Shallow Multilingual Machine Translation Model for Low-Resource Languages", "authors": "Alireza Mohammadshahi, Vassilina Nikoulina, Alexandre Berard, Caroline Brun, James Henderson and Laurent Besacier", "abstract": "In recent years,  multilingual machine translation models have achieved promising performance on low-resource language pairs by sharing information between similar languages, thus enabling zero-shot translation.  To overcome the \"curse of multilinguality\", these models often opt for scaling up the number of parameters, which makes their use in resource-constrained environments challenging. We introduce SMaLL-100, a distilled version of the M2M-100(12B) model, a massively multilingual machine translation model covering 100 languages. We train SMaLL-100 with uniform sampling across all language pairs and therefore focus on preserving the performance of low-resource languages.  We evaluate SMaLL-100 on different low-resource benchmarks: FLORES-101, Tatoeba, and TICO-19 and demonstrate that it outperforms previous massively multilingual models of comparable sizes (200-600M) while improving inference latency and memory usage. Additionally, our model achieves comparable results to M2M-100 (1.2B), while being 3.6x smaller and 4.3x faster at inference.", "track": "Machine Translation", "label": 10, "url": "https://www.semanticscholar.org/reader/83608aadb17443beba22c4087030c8704ccd7c64?experiments=&features=reader_skimming%3Atrue"}, {"loc": [8.111284255981445, 3.0337202548980713], "id": 2869, "title": "TextFusion: Privacy-Preserving Pre-trained Model Inference via Token Fusion", "authors": "Xin Zhou, Jinzhu Lu, Tao Gui, Ruotian Ma, Zichu Fei, Yuran Wang, Yong Ding, Yibo Cheung, Qi Zhang and Xuanjing Huang", "abstract": "Recently, more and more pre-trained language models are released as a cloud service. It allows users who lack computing resources to perform inference with a powerful model by uploading data to the cloud. The plain text may contain private information, as the result, users prefer to do partial computations locally and upload intermediate representations to the cloud for subsequent inference.\nHowever, recent studies have shown that intermediate representations can also be recovered to plain text with reasonable accuracy, thus the risk of privacy leakage still exists. \nTo address this issue, we propose  TextFusion, a novel method for preserving inference privacy.\nSpecifically, we train a Fusion Predictor to dynamically fuse token representations, which hides multiple private token representations behind an unrecognizable one.\nFurthermore, an adversarial training regime is employed to privatize these representations. In this way, the cloud only receives incomplete and perturbed representations, making it difficult to accurately recover the complete plain text.\nThe experimental results on diverse classification tasks show that our approach can effectively preserve inference privacy without significantly sacrificing performance in different scenarios.", "track": "Ethics", "label": 21, "url": ""}, {"loc": [5.1357526779174805, 4.940208911895752], "id": 2877, "title": "Learning to Explain Selectively: A Case Study on Question Answering", "authors": "Shi Feng and Jordan Boyd-Graber", "abstract": "Explanations promise to bridge the gap between humans and AI, yet it remains difficult to achieve consistent improvement in AI-augmented human decision making. The usefulness of AI explanations depends on many factors, and always showing the same type of explanation in all cases is suboptimal\u2014so is relying on heuristics to adapt explanations for each scenario. We propose learning to explain selectively: for each decision that the user makes, we use a model to choose the best explanation from a set of candidates, and update this model with feedback to optimize human performance. We experiment on a question answering task, Quizbowl, and show that selective explanations improve human performance for both experts and crowdworkers.", "track": "Interpretability, Interactivity and Analysis of Models for NLP", "label": 9, "url": ""}, {"loc": [10.37665843963623, 7.070738315582275], "id": 2878, "title": "ConsistTL: Modeling Consistency in Transfer Learning for Low-Resource Neural Machine Translation", "authors": "Zhaocong Li, Xuebo Liu, Derek F. Wong, Lidia S. Chao and Min Zhang", "abstract": "Transfer learning is a simple and powerful method that can be used to boost model performance of low-resource neural machine translation (NMT). Existing transfer learning methods for NMT are static, which simply transfer knowledge from a parent model to a child model once via parameter initialization. In this paper, we propose a novel transfer learning method for NMT, namely ConsistTL, which can continuously transfer knowledge from the parent model during the training of the child model. Specifically, for each training instance of the child model, ConsistTL constructs the semantically-equivalent instance for the parent model and encourages prediction consistency between the parent and child for this instance, which is equivalent to the child model learning each instance under the guidance of the parent model. Experimental results on five low-resource NMT tasks demonstrate that ConsistTL results in significant improvements over strong transfer learning baselines, with a gain up to 1.7 BLEU over the existing back-translation model on the widely-used WMT17 Turkish-English benchmark. Further analysis reveals that ConsistTL can improve the inference calibration of the child model. Code and scripts are freely available at https://github.com/NLP2CT/ConsistTL.", "track": "Machine Translation", "label": 10, "url": ""}, {"loc": [6.13837194442749, 5.379065990447998], "id": 2894, "title": "Better Hit the Nail on the Head than Beat around the Bush: Removing Protected Attributes with a Single Projection", "authors": "Pantea Haghighatkhah, Antske Fokkens, Pia Sommerauer, Bettina Speckmann and Kevin Verbeek", "abstract": "Bias elimination and recent probing studies attempt to remove specific information from embedding spaces. \nHere it is important to remove as much of the target information as possible, while preserving any other information present. \nINLP is a popular recent method which removes specific information through iterative nullspace projections.\nMultiple iterations, however, increase the risk that information other than the target is negatively affected.\nWe introduce two methods that find a single targeted projection: Mean Projection (MP, more efficient) and Tukey Median Projection (TMP, with theoretical guarantees). \nOur comparison between MP and INLP shows that (1) one MP projection removes linear separability based on the target and (2) MP has less impact on the overall space.\nFurther analysis shows that applying random projections after MP leads to the same overall effects on the embedding space as the multiple projections of INLP. \nApplying one targeted (MP) projection hence is methodologically cleaner than applying multiple (INLP) projections that introduce random effects.", "track": "Interpretability, Interactivity and Analysis of Models for NLP", "label": 9, "url": ""}, {"loc": [0.9153674840927124, 7.923649787902832], "id": 2896, "title": "IELM: An Open Information Extraction Benchmark for Pre-Trained Language Models", "authors": "Chenguang Wang, Xiao Liu and Dawn Song", "abstract": "We introduce a new open information extraction (OIE) benchmark for pre-trained language models (LM). Recent studies have demonstrated that pre-trained LMs, such as BERT and GPT, may store linguistic and relational knowledge. In particular, LMs are able to answer \"fill-in-the-blank\" questions when given a pre-defined relation category. Instead of focusing on pre-defined relations, we create an OIE benchmark aiming to fully examine the open relational information present in the pre-trained LMs. We accomplish this by turning pre-trained LMs into zero-shot OIE systems. Surprisingly, pre-trained LMs are able to obtain competitive performance on both standard OIE datasets (CaRB and Re-OIE2016) and two new large-scale factual OIE datasets (TAC KBP-OIE and Wikidata-OIE) that we establish via distant supervision. For instance, the zero-shot pre-trained LMs outperform the F1 score of the state-of-the-art supervised OIE methods on our factual OIE datasets without needing to use any training sets.", "track": "Information Extraction", "label": 5, "url": "https://www.semanticscholar.org/reader/1933a0ef47f8d2ba4a8277d702d522a06319302c?experiments=&features=reader_skimming%3Atrue"}, {"loc": [1.7339813709259033, 9.104886054992676], "id": 2898, "title": "ConNER: Consistency Training for Cross-lingual Named Entity Recognition", "authors": "Ran Zhou, Xin Li, Lidong Bing, Erik Cambria, Luo Si and Chunyan Miao", "abstract": "Cross-lingual named entity recognition (NER) suffers from data scarcity in the target languages, especially under zero-shot settings. \nExisting translate-train or knowledge distillation methods attempt to bridge the language gap, but often introduce a high level of noise. To solve this problem, consistency training methods regularize the model to be robust towards perturbations on data or hidden states.\nHowever, such methods are likely to violate the consistency hypothesis, or mainly focus on coarse-grain consistency.\nWe propose ConNER as a novel consistency training framework for cross-lingual NER, which comprises of: (1) translation-based consistency training on unlabeled target-language data, and (2) dropout-based consistency training on labeled source-language data. \nConNER effectively leverages unlabeled target-language data and alleviates overfitting on the source language to enhance the cross-lingual adaptability. \nExperimental results show our ConNER achieves consistent improvement over various baseline methods.", "track": "Multilinguality", "label": 13, "url": "https://www.semanticscholar.org/reader/91e24327e4502a95a2ed7f2ac4c36cf0139284cb?experiments=&features=reader_skimming%3Atrue"}, {"loc": [1.6994454860687256, 5.383082389831543], "id": 2915, "title": "A Sequential Flow Control Framework for Multi-hop Knowledge Base Question Answering", "authors": "Minghui Xie, Chuzhan Hao and Peng Zhang", "abstract": "One of the key challenges of knowledge base question answering (KBQA) is the multi-hop reasoning. Since in different hops, one attends to different parts of question, it is important to dynamically represent the question semantics for each hop. Existing methods, however, (i) infer the dynamic question representation only through coarse-grained attention mechanisms, which may bring information loss,  (ii) and have not effectively modeled the sequential logic, which is crucial for the multi-hop reasoning process in KBQA.\nTo address these issues, we propose a sequential reasoning self-attention mechanism to capture the crucial reasoning information of  each single hop in a more fine-grained way. Based on Gated Recurrent Unit (GRU) which is good at modeling sequential process, we propose a simple but effective GRU-inspired Flow Control (GFC) framework to model sequential logic in  the whole multi-hop process.\nExtensive experiments on three popular benchmark datasets have demonstrated the superior effectiveness of our model. In particular, GFC achieves new state-of-the-art Hits@1 of 76.8% on WebQSP and is also  effective when KB is incomplete.  Our code and data are available at https://github.com/Xie-Minghui/GFC.", "track": "Commonsense Reasoning", "label": 19, "url": ""}, {"loc": [4.749297618865967, 3.271265745162964], "id": 2916, "title": "ACENet: Attention Guided Commonsense Reasoning on Hybrid Knowledge Graph", "authors": "Chuzhan Hao, Minghui Xie and Peng Zhang", "abstract": "Augmenting pre-trained language models (PLMs) with knowledge graphs (KGs) has demonstrated superior performance on commonsense reasoning. Given a commonsense based QA context (question and multiple choices), existing approaches usually estimate the plausibility of candidate choices separately based on their respective retrieved KGs, without considering the interference among different choices. \nIn this paper, we propose an Attention guided Commonsense rEasoning Network (ACENet)\\footnote{\\url{https://github.com/HAOChuzhan/ACENet}.}  to endow the neural network with the capability of integrating hybrid knowledge. Specifically, our model applies the multi-layer interaction of answer choices to continually strengthen correct choice information and guide the  message passing of GNN. In addition, we also design a mix attention mechanism of nodes and edges to iteratively select supporting evidence on hybrid knowledge graph. Experimental results demonstrate the effectiveness of our proposed model through considerable performance gains across CommonsenseQA and OpenbookQA datasets.", "track": "Commonsense Reasoning", "label": 19, "url": ""}, {"loc": [0.7506502270698547, 7.994113922119141], "id": 2935, "title": "Revisiting DocRED - Addressing the False Negative Problem in Relation Extraction", "authors": "Qingyu Tan, Lu Xu, Lidong Bing, Hwee Tou Ng and Sharifah Mahani Aljunied", "abstract": "The DocRED dataset is one of the most popular and widely used benchmarks for document-level relation extraction (RE). It adopts a recommend-revise annotation scheme so as to have  a large-scale annotated dataset. However, we find that the annotation of DocRED is incomplete, i.e., false negative samples are prevalent. We analyze the causes and effects of the overwhelming false negative problem in the DocRED dataset. To address the shortcoming, we re-annotate 4,053 documents in the DocRED dataset by adding the missed relation triples back to the original DocRED. We name our revised DocRED dataset Re-DocRED. We conduct extensive experiments with state-of-the-art neural models on both datasets, and the experimental results show that the models trained and evaluated on our Re-DocRED achieve performance improvements of around 13 F1 points. Moreover, we conduct a comprehensive analysis to identify the potential areas for further improvement.", "track": "Resources and Evaluation", "label": 1, "url": "https://www.semanticscholar.org/reader/982dad9a1dfbaddc8bd83ad09fc79be71fa3187f?experiments=&features=reader_skimming%3Atrue"}, {"loc": [3.804398775100708, 9.940906524658203], "id": 2938, "title": "Towards Summary Candidates Fusion", "authors": "Mathieu Ravaut, Shafiq Joty and Nancy Chen", "abstract": "Sequence-to-sequence deep neural models fine-tuned for abstractive summarization can achieve great performance on datasets with enough human annotations. Yet, it has been shown that they have not reached their full potential, with a wide gap between the top beam search output and the oracle beam. Recently, re-ranking methods have been proposed, to learn to select a better summary candidate. However, such methods are limited by the summary quality aspects captured by the first-stage candidates. To bypass this limitation, we propose a new paradigm in second-stage abstractive summarization called SummaFusion that fuses several summary candidates to produce a novel abstractive second-stage summary. Our method works well on several summarization datasets, improving both the ROUGE scores and qualitative properties of fused summaries. It is especially good when the candidates to fuse are worse, such as in the few-shot setup where we set a new state-of-the art. We will make our code and checkpoints available at https://github.com/ntunlp/SummaFusion/.", "track": "Summarization", "label": 14, "url": "https://www.semanticscholar.org/reader/b9330420dfa9756b7d71652103bd33ae2a34db24?experiments=&features=reader_skimming%3Atrue"}, {"loc": [6.224789142608643, 12.408352851867676], "id": 2942, "title": "Multimodal Robustness for Neural Machine Translation", "authors": "Yuting Zhao and Ioan Calapodescu", "abstract": "In this paper, we look at the case of a Generic text-to-text NMT model that has to deal with data coming from various modalities, like speech, images, or noisy text extracted from the web. We propose a two-step method, based on composable adapters, to deal with this problem of Multimodal Robustness. In a first step, we separately learn domain adapters and modality specific adapters, to deal with noisy input coming from various sources: ASR, OCR, or noisy text (UGC). In a second step, we combine these components at runtime via dynamic routing or, when the source of noise is unknown, via two new transfer learning mechanisms (Fast Fusion and Multi Fusion). We show that our method provides a flexible, state-of-the-art, architecture able to deal with noisy multimodal inputs.", "track": "Machine Translation", "label": 10, "url": ""}, {"loc": [0.46370312571525574, 7.119673252105713], "id": 2950, "title": "TranSHER: Translating Knowledge Graph Embedding with Hyper-Ellipsoidal Restriction", "authors": "Yizhi Li, Wei Fan, Chao Liu, Chenghua Lin and Jiang Qian", "abstract": "Knowledge graph embedding methods are important for the knowledge graph completion (or link prediction) task.\nOne state-of-the-art method, PairRE, leverages two separate vectors to model complex relations (i.e., 1-to-N, N-to-1, and N-to-N) in knowledge graphs. \nHowever, such a method strictly restricts entities on the hyper-ellipsoid surfaces which limits the optimization of entity distribution, leading to suboptimal performance of knowledge graph completion. \nTo address this issue, we propose a novel score function TranSHER, which leverages relation-specific translations between head and tail entities to relax the constraint of hyper-ellipsoid restrictions. \nBy introducing an intuitive and simple relation-specific translation, TranSHER can provide more direct guidance on optimization and capture more semantic characteristics of entities with complex relations. \nExperimental results show that TranSHER achieves state-of-the-art performance on link prediction and generalizes well to datasets in different domains and scales. \nOur codes are public available at\nhttps://github.com/yizhilll/TranSHER.", "track": "Commonsense Reasoning", "label": 19, "url": "https://www.semanticscholar.org/reader/4a3dfe9f4085591e17c19d6a5438c1bb94279183?experiments=&features=reader_skimming%3Atrue"}, {"loc": [3.9468207359313965, 7.264837265014648], "id": 2966, "title": "IRRGN: An Implicit Relational Reasoning Graph Network for Multi-turn Response Selection", "authors": "Jingcheng Deng, Hengwei Dai, Xuewei Guo, Yuanchen Ju and Wei Peng", "abstract": "The task of response selection in multi-turn dialogue is to find the best option from all candidates. In order to improve the reasoning ability of the model, previous studies pay more attention to using explicit algorithms to model the dependencies between utterances, which are deterministic, limited and inflexible. In addition, few studies consider differences between the options before and after reasoning. In this paper, we propose an Implicit Relational Reasoning Graph Network to address these issues, which consists of the Utterance Relational Reasoner (URR) and the Option Dual Comparator (ODC). URR aims to implicitly extract dependencies between utterances, as well as utterances and options, and make reasoning with relational graph convolutional networks. ODC focuses on perceiving the difference between the options through dual comparison, which can eliminate the interference of the noise options. Experimental results on two multi-turn dialogue reasoning benchmark datasets MuTual and MuTualplus show that our method significantly improves the baseline of four pre-trained language models and achieves state-of-the-art performance. The model surpasses human performance for the first time on the MuTual dataset.", "track": "Dialogue and Interactive Systems", "label": 4, "url": ""}, {"loc": [0.626977264881134, 6.9304022789001465], "id": 2997, "title": "Predicting Prerequisite Relations for Unseen Concepts", "authors": "Yaxin Zhu and Hamed Zamani", "abstract": "Concept prerequisite learning (CPL) plays a key role in developing technologies that assist people to learn a new complex topic or concept. Previous work commonly assumes that all concepts are given at training time and solely focuses on predicting the unseen prerequisite relationships between them. However, many real-world scenarios deal with concepts that are left undiscovered at training time, which is relatively unexplored. This paper studies this problem and proposes a novel alternating knowledge distillation approach to take advantage of both content- and graph-based models for this task. Extensive experiments on three public benchmarks demonstrate up to 10% improvements in terms of F1 score.", "track": "Information Extraction", "label": 5, "url": ""}, {"loc": [5.374624729156494, 12.481864929199219], "id": 3013, "title": "Contrastive Learning with Expectation-Maximization for Weakly Supervised Phrase Grounding", "authors": "Keqin Chen, Richong Zhang, Samuel Mensah and Yongyi Mao", "abstract": "Weakly supervised phrase grounding aims to learn an alignment between phrases in a caption and objects in a corresponding image using only caption-image annotations, i.e., without phrase-object annotations. Previous methods typically use a caption-image contrastive loss to indirectly supervise the alignment between phrases and objects, which hinders the maximum use of the intrinsic structure of the multimodal data and leads to unsatisfactory performance. In this work, we directly use the phrase-object contrastive loss in the condition that no positive annotation is available in the first place. Specifically, we propose a novel contrastive learning framework based on the expectation-maximization algorithm that adaptively refines the target prediction. Experiments on two widely used benchmarks, Flickr30K Entities and RefCOCO+, demonstrate the effectiveness of our framework. We obtain 63.05% top-1 accuracy on Flickr30K Entities and 59.51%/43.46% on RefCOCO+ TestA/TestB, outperforming the previous methods by a large margin, even surpassing a previous SoTA that uses a pre-trained vision-language model. Furthermore, we deliver a theoretical analysis of the effectiveness of our method from the perspective of the maximum likelihood estimate with latent variables.", "track": "Speech, Vision, Robotics, Multimodal Grounding", "label": 7, "url": ""}, {"loc": [8.06466293334961, 9.64835262298584], "id": 3019, "title": "Beyond prompting: Making Pre-trained Language Models Better Zero-shot Learners by Clustering Representations", "authors": "Yu Fei, Zhao Meng, Ping Nie, Roger Wattenhofer and Mrinmaya Sachan", "abstract": "Recent work has demonstrated that pre-trained language models (PLMs) are zero-shot learners. However, most existing zero-shot methods involve heavy human engineering or complicated self-training pipelines, hindering their application to new situations. In this work, we show that zero-shot text classification can be improved simply by clustering texts in the embedding spaces of PLMs. Specifically, we fit the unlabeled texts with a Bayesian Gaussian Mixture Model after initializing cluster positions and shapes using class names. Despite its simplicity, this approach achieves superior or comparable performance on both topic and sentiment classification datasets and outperforms prior works significantly on unbalanced datasets. We further explore the applicability of our clustering approach by evaluating it on 14 datasets with more diverse topics, text lengths, and numbers of classes. Our approach achieves an average of 20% absolute improvement over prompt-based zero-shot learning. Finally, we compare different PLM embedding spaces and find that texts are well-clustered by topics even if the PLM is not explicitly pre-trained to generate meaningful sentence embeddings. This work indicates that PLM embeddings can categorize texts without task-specific fine-tuning, thus providing a new way to analyze and utilize their knowledge and zero-shot learning ability.", "track": "Unsupervised and Weakly-Supervised Methods in NLP", "label": 17, "url": ""}, {"loc": [2.3667678833007812, 8.667073249816895], "id": 3021, "title": "Generalizing over Long Tail Concepts for Medical Term Normalization", "authors": "Beatrice Portelli, Simone Scaboro, Enrico Santus, Hooman Sedghamiz, Emmanuele Chersoni and Giuseppe Serra", "abstract": "Medical term normalization consists in mapping a piece of text to a large number of output classes.\nGiven the small size of the annotated datasets and the extremely long tail distribution of the concepts, it is of utmost importance to develop models that are capable to generalize to scarce or unseen concepts.\nAn important attribute of most target ontologies is their hierarchical structure. In this paper we introduce a simple and effective learning strategy that leverages such information to enhance the generalizability of both discriminative and generative models.\nThe evaluation shows that the proposed strategy produces state-of-the-art performance on seen concepts and consistent improvements on unseen ones, allowing also for efficient zero-shot knowledge transfer across text typologies and datasets.", "track": "NLP Applications", "label": 0, "url": ""}, {"loc": [3.6964547634124756, 9.903865814208984], "id": 3028, "title": "Unsupervised Opinion Summarisation in the Wasserstein Space", "authors": "Jiayu Song, Iman Munire Bilal, Adam Tsakalidis, Rob Procter and Maria Liakata", "abstract": "Opinion summarisation synthesises opinions expressed in a group of documents discussing\nthe same topic to produce a single summary. Recent work has looked at opinion summarisation of clusters of social media posts. Such posts are noisy and have unpredictable structure, posing additional challenges for the construction of the summary distribution and the preservation of meaning compared to online reviews, which has been so far the focus on opinion summarisation. To address these \nchallenges we present WassOS, an unsupervised abstractive summarization model which makes\nuse of the Wasserstein distance. A Variational Autoencoder is first used to obtain the distribution of documents/posts, and the summary distribution is obtained as the Wasserstein barycenter. We create separate disentangled latent semantic and syntactic representations of the summary, which are fed into a GRU decoder with a transformer layer to produce the final summary. Our experiments on\nmultiple datasets including reviews, Twitter clusters and Reddit threads show that WassOS\nalmost always outperforms the state-of-the-art on ROUGE metrics and consistently produces\nthe best summaries with respect to meaning preservation according to human evaluations.", "track": "Summarization", "label": 14, "url": ""}, {"loc": [6.057355880737305, 12.322936058044434], "id": 3033, "title": "Bloom Library: Multimodal Datasets in 300+ Languages for a Variety of Downstream Tasks", "authors": "Colin Leong, Joshua Nemecek, Jacob Mansdorfer, Anna Filighera, Abraham Owodunni and Daniel Whitenack", "abstract": "We present Bloom Library, a linguistically diverse set of multimodal and multilingual datasets for language modeling, image captioning, visual storytelling, and speech synthesis/recognition. These datasets represent either the most, or among the most, multilingual datasets for each of the included downstream tasks. In total, the initial release of the Bloom Library datasets covers 363 languages across 32 language families. We train downstream task models for various languages represented in the data, showing the viability of the data for future work in low-resource, multimodal NLP and establishing the first known baselines for these downstream tasks in certain languages (e.g., Bisu [bzi], with an estimated population of 700 users). Some of these first-of-their-kind baselines are comparable to state-of-the-art performance for higher-resourced languages. The Bloom Library datasets are released under Creative Commons licenses on the Hugging Face datasets hub to catalyze more linguistically diverse research in the included downstream tasks.", "track": "Resources and Evaluation", "label": 1, "url": "https://www.semanticscholar.org/reader/fddaeb14ae30217ee7cd77a1043fb98884ab927b?experiments=&features=reader_skimming%3Atrue"}, {"loc": [10.709479331970215, 6.9167304039001465], "id": 3045, "title": "Disentangling Uncertainty in Machine Translation Evaluation", "authors": "Chrysoula Zerva, Taisiya Glushkova, Ricardo Rei and Andr\u00e9 F. T. Martins", "abstract": "Trainable evaluation metrics for machine translation (MT) exhibit strong correlation with human judgements, but they are often hard to interpret and might produce unreliable scores \nunder noisy or out-of-domain data. \nRecent work has attempted to mitigate this with simple uncertainty quantification techniques (Monte Carlo dropout and deep ensembles), however these techniques (as we show) are limited in several ways \u2013 for example, they are unable to distinguish between different kinds of uncertainty, and they are time and memory consuming. \nIn this paper, we propose more powerful and efficient uncertainty predictors for MT evaluation, and we assess their ability to target different sources of aleatoric and epistemic uncertainty. \nTo this end, we develop and compare training objectives for the COMET metric to enhance it with an uncertainty prediction output, including heteroscedastic regression, divergence minimization, and direct uncertainty prediction.\nOur experiments show improved results on uncertainty prediction for the WMT metrics task datasets, with a substantial reduction in computational costs. Moreover, they demonstrate the ability of these predictors to address specific uncertainty causes in MT evaluation, such as low quality references and \nout-of-domain data.", "track": "Machine Translation", "label": 10, "url": ""}, {"loc": [1.605499029159546, 8.59281063079834], "id": 3048, "title": "Does Your Model Classify Entities Reasonably? Diagnosing and Mitigating Spurious Correlations in Entity Typing", "authors": "Nan Xu, Fei Wang, Bangzheng Li, Mingtao Dong and Muhao Chen", "abstract": "Entity typing aims at predicting one or more words that describe the type(s) of a specific mention in a sentence. Due to shortcuts from surface patterns to annotated entity labels and biased training, existing entity typing models are subject to the problem of spurious correlations. To comprehensively investigate the faithfulness and reliability of entity typing methods, we first systematically define distinct kinds of model biases that are reflected mainly from spurious correlations. Particularly, we identify six types of existing model biases, including mention-context bias, lexical overlapping bias, named entity bias, pronoun bias, dependency bias, and overgeneralization bias. To mitigate model biases, we then introduce a counterfactual data augmentation method. By augmenting the original training set with their debiased\ncounterparts, models are forced to fully comprehend sentences and discover the fundamental cues for entity typing, rather than relying on spurious correlations for shortcuts. Experimental results on the UFET dataset show our counterfactual data augmentation approach helps improve generalization of different entity typing models with consistently better performance on both the original and debiased test sets.", "track": "Interpretability, Interactivity and Analysis of Models for NLP", "label": 9, "url": "https://www.semanticscholar.org/reader/467c5ef31db6639fc6cd7aa9a3f0cbd151313673?experiments=&features=reader_skimming%3Atrue"}, {"loc": [1.628932237625122, 8.60616397857666], "id": 3049, "title": "EDIN: An End-to-end Benchmark and Pipeline for Unknown Entity Discovery and Indexing", "authors": "Nora Kassner, Fabio Petroni, Mikhail Plekhanov, Sebastian Riedel and Nicola Cancedda", "abstract": "Existing work on Entity Linking mostly assumes that the reference knowledge base is complete, and therefore all mentions can be linked. In practice this is hardly ever the case, as knowledge bases are incomplete and because novel concepts arise constantly. We introduce the temporally segmented Unknown Entity Discovery and Indexing (EDIN)-benchmark where unknown entities, that is entities not part of the knowledge base and without descriptions and labeled mentions, have to be integrated into an existing entity linking system. By contrasting EDIN with zero-shot entity linking, we provide insight on the additional challenges it poses. Building on dense-retrieval based entity linking, we introduce the end-to-end EDIN-pipeline that detects, clusters, and indexes mentions of unknown entities in context. Experiments show that indexing a single embedding per entity unifying the information of multiple mentions works better than indexing mentions independently.", "track": "Information Extraction", "label": 5, "url": "https://www.semanticscholar.org/reader/65d217468f1f3fd7088da17d8e81afc408a8c235?experiments=&features=reader_skimming%3Atrue"}, {"loc": [2.472520351409912, 7.201533317565918], "id": 3059, "title": "POQue: Asking Participant-specific Outcome Questions for a Deeper Understanding of Complex Events", "authors": "Sai P. Vallurupalli, Sayontan Ghosh, Katrin Erk, Niranjan Balasubramanian and Francis Ferraro", "abstract": "Knowledge about outcomes is critical for complex event understanding but is hard to acquire.\nWe show that by pre-identifying a participant in a complex event, crowdworkers are able\nto (1) infer the collective impact of salient events that make up the situation, (2) annotate the volitional engagement of participants in causing the situation, and (3) ground the\noutcome of the situation in state changes of the participants. By creating a multi-step interface and a careful quality control strategy, we collect a high quality annotated dataset of\n8K short newswire narratives and ROCStories with high inter-annotator agreement (0.74-0.96\nweighted Fleiss Kappa). Our dataset, POQUe (Participant Outcome Questions), enables the\nexploration and development of models that address multiple aspects of semantic understanding. Experimentally, we show that current language models lag behind human performance in subtle ways through our task formulations that target abstract and specific comprehension of a complex event, its outcome, and a participant's influence over the event culmination.", "track": "Ethic Concerns:Resources and Evaluation", "label": 1, "url": ""}, {"loc": [5.481792449951172, 5.1186113357543945], "id": 3060, "title": "Measuring the Mixing of Contextual Information in the Transformer", "authors": "Javier Ferrando, Gerard I. G\u00e1llego and Marta R. Costa-juss", "abstract": "The Transformer architecture aggregates input information through the self-attention mechanism, but there is no clear understanding of how this information is mixed across the entire model. Additionally, recent works have demonstrated that attention weights alone are not enough to describe the flow of information. In this paper, we consider the whole attention block --multi-head attention, residual connection, and layer normalization-- and define a metric to measure token-to-token interactions within each layer. Then, we aggregate layer-wise interpretations to provide input attribution scores for model predictions. Experimentally, we show that our method, ALTI (Aggregation of Layer-wise Token-to-token Interactions), provides more faithful explanations and increased robustness than gradient-based methods.", "track": "Interpretability, Interactivity and Analysis of Models for NLP", "label": 9, "url": "https://www.semanticscholar.org/reader/bb1c9cb431e771660cffdda1d80a7f15ff40c764?experiments=&features=reader_skimming%3Atrue"}, {"loc": [8.255373001098633, 6.907346248626709], "id": 3070, "title": "Dealing with Abbreviations in the Slovenian Biographical Lexicon", "authors": "Angel Daza, Antske Fokkens and Toma\u017e Erjavec", "abstract": "Abbreviations present a significant challenge for NLP systems because they cause tokenization and out-of-vocabulary errors. They can also make the text less readable, especially in reference printed books, where they are extensively used. Abbreviations are especially problematic in low-resource settings, where systems are less robust to begin with. In this paper, we propose a new method for addressing the problems caused by a high density of domain-specific abbreviations in a text. We apply this method to the case of a Slovenian biographical lexicon and evaluate it on a newly developed gold-standard dataset of 51 Slovenian biographies. Our abbreviation identification method performs significantly better than commonly used ad-hoc solutions, especially at identifying unseen abbreviations. We also propose and present the results of a method for expanding the identified abbreviations in context.", "track": "Computational Social Science and Cultural Analytics", "label": 20, "url": "https://www.semanticscholar.org/reader/09677c42e427a6593df78926831b56f4bb83b17a?experiments=&features=reader_skimming%3Atrue"}, {"loc": [2.11199688911438, 4.051860809326172], "id": 3071, "title": "AfriCLIRMatrix: Enabling Cross-Lingual Information Retrieval for African Languages", "authors": "Odunayo Jude Ogundepo, Xinyu Zhang, Shuo Sun, Kevin Duh and Jimmy Lin", "abstract": "Language diversity in NLP is critical in enabling the development of tools for a wide range of users.\nHowever, there are limited resources for building such tools for many languages, particularly those spoken in Africa.\nFor search, most existing datasets feature few or no African languages, directly impacting researchers' ability to build and improve information access capabilities in those languages.\nMotivated by this, we created AfriCLIRMatrix, a test collection for cross-lingual information retrieval research in 15 diverse African languages.\nIn total, our dataset contains 6 million queries in English and 23 million relevance judgments automatically mined from Wikipedia inter-language links, covering many more African languages than any existing information retrieval test collection.\nIn addition, we release BM25, dense retrieval, and sparse--dense hybrid baselines to provide a starting point for the development of future systems.\nWe hope that these efforts can spur additional work in search for African languages.\nAfriCLIRMatrix can be downloaded at https://github.com/castorini/africlirmatrix.", "track": "Resources and Evaluation", "label": 1, "url": ""}, {"loc": [3.8146071434020996, 4.76609468460083], "id": 3072, "title": "CONDAQA: A Contrastive Reading Comprehension Dataset for Reasoning about Negation", "authors": "Abhilasha Ravichander, Matt Gardner and Ana Marasovic", "abstract": "The full power of human language-based communication cannot be realized without negation. All human languages have some form of negation. Despite this, negation remains a challenging phenomenon for current natural language understanding systems. To facilitate the future development of models that can process negation effectively, we present CONDAQA, the first English reading comprehension dataset which requires reasoning about the implications of negated statements in paragraphs. We collect paragraphs with diverse negation cues, then have crowdworkers ask questions about the implications of the negated statement in the passage.  We also have workers make three kinds of edits to the passage---paraphrasing the negated statement, changing the scope of the negation, and reversing the negation---resulting in clusters of question-answer pairs that are difficult for models to answer with spurious shortcuts. CONDAQA features 14,182 question-answer pairs with over 200 unique negation cues and is challenging for current state-of-the-art models. We release our dataset, along with both supervised and few-shot evaluations, to facilitate the development of future NLP methods that work on negated language.", "track": "Theme Track", "label": 18, "url": ""}, {"loc": [10.605592727661133, 7.075927257537842], "id": 3075, "title": "Towards Opening the Black Box of Neural Machine Translation: Source and Target Interpretations of the Transformer", "authors": "Javier Ferrando, Gerard I. G\u00e1llego, Belen Alastruey, Carlos Escolano and Marta R. Costa-juss", "abstract": "In Neural Machine Translation (NMT), each token prediction is conditioned on the source sentence and the target prefix (what has been previously translated at a decoding step). However, previous work on interpretability in NMT has mainly focused solely on source sentence tokens' attributions. Therefore, we lack a full understanding of the influences of every input token (source sentence and target prefix) in the model predictions. In this work, we propose an interpretability method that tracks input tokens' attributions for both contexts. Our method, which can be extended to any encoder-decoder Transformer-based model, allows us to better comprehend the inner workings of current NMT models. We apply the proposed method to both bilingual and multilingual Transformers and present insights into their behaviour.", "track": "Machine Translation", "label": 10, "url": "https://www.semanticscholar.org/reader/fd06e7aaf9131c9a625d374841844adce6e0ed09?experiments=&features=reader_skimming%3Atrue"}, {"loc": [6.119662284851074, 12.33460521697998], "id": 3101, "title": "ArtELingo: A Million Emotion Annotations of WikiArt with Emphasis on Diversity over Language and Culture", "authors": "Youssef Sherif Mansour Mohamed, Mohamed Abdelfattah, Shyma Yaser Alhuwaider, Feifan Li, Xiangliang Zhang, Kenneth Ward Church and Mohamed Elhoseiny", "abstract": "This paper introduces ArtELingo, a new benchmark and dataset, designed to encourage work on diversity across languages and cultures. Following ArtEmis, a collection of 80k artworks from WikiArt with 0.45M emotion labels and English-only captions, ArtELingo adds another 0.79M annotations in Arabic and Chinese, plus 4.8K in Spanish to evaluate \"cultural-transfer\u201d performance. 51K artworks have 5 annotations or more in 3 languages. This diversity makes it possible to study similarities and differences across languages and cultures. Further, we investigate captioning tasks, and find diversity improves the performance of baseline models. ArtELingo is publicly available at `www.artelingo.org` with standard splits and baseline models. We hope our work will help ease future research on multilinguality and culturally-aware AI.", "track": "Ethic Concerns:Multilinguality", "label": 13, "url": ""}, {"loc": [1.844874382019043, 3.929999589920044], "id": 3119, "title": "Decoding a Neural Retriever's Latent Space for Query Suggestion", "authors": "Leonard Adolphs, Michelle Chen Huebscher, Christian Buck, Sertan Girgin, Olivier Bachem, Massimiliano Ciaramita and Thomas Hofmann", "abstract": "Neural retrieval models have superseded classic bag-of-words methods such as BM25 as the retrieval framework of choice. However, neural systems lack the interpretability of bag-of-words models; it is not trivial to connect a query change to a change in the latent space that ultimately determines the retrieval results. To shed light on this embedding space, we learn a \"query decoder\" that, given a latent representation of a neural search engine, generates the corresponding query. We show that it is possible to decode a meaningful query from its latent representation and, when moving in the right direction in latent space, to decode a query that retrieves the relevant paragraph. In particular, the query decoder can be useful to understand \"what should have been asked\" to retrieve a particular paragraph from the collection. We employ the query decoder to generate a large synthetic dataset of query reformulations for MSMarco, leading to improved retrieval performance. On this data, we train a pseudo-relevance feedback (PRF) T5 model for the application of query suggestion that outperforms both query reformulation and PRF information retrieval baselines.", "track": "Interpretability, Interactivity and Analysis of Models for NLP", "label": 9, "url": "https://www.semanticscholar.org/reader/02ab15d5a21715724889cf2a34242a330972fbb5?experiments=&features=reader_skimming%3Atrue"}, {"loc": [5.928468227386475, 9.183683395385742], "id": 3123, "title": "T-STAR: Truthful Style Transfer using AMR Graph as Intermediate Representation", "authors": "Anubhav Jangra, Preksha Nema and Aravindan Raghuveer", "abstract": "Unavailability of parallel corpora for training text style transfer  (TST) models is a very challenging yet common scenario. Also, TST models implicitly need to preserve the content  while transforming a source sentence into the target style.  To tackle these problems,  an intermediate representation is often constructed that is devoid of style while still preserving the meaning of the source sentence.  In this work, we study the usefulness of Abstract Meaning Representation (AMR) graph as the intermediate style agnostic representation. We posit that semantic notations like AMR are a natural choice for an intermediate representation. Hence, we propose T-STAR: a model comprising of two components, text-to-AMR encoder and a AMR-to-text decoder. We propose several modeling improvements to enhance the style agnosticity of the generated AMR. To the best of our knowledge, T-STAR is the first work that uses AMR as an intermediate representation for TST.  With thorough experimental evaluation we show T-STAR significantly outperforms state of the art techniques by achieving on an average 15.2% higher content preservation with negligible loss (~3%) in style accuracy. Through detailed human evaluation with 90,000 ratings, we also show that T-STAR has upto 50% lesser hallucinations compared to state of the art TST models.", "track": "Natural Language Generation", "label": 6, "url": ""}, {"loc": [8.046353340148926, 5.7361249923706055], "id": 3128, "title": "PromptBERT: Improving BERT Sentence Embeddings with Prompts", "authors": "Ting Jiang, Jian Jiao, Shaohan Huang, Zihan Zhang, deqing wang, Fuzhen Zhuang, Furu Wei, Haizhen Huang, Denvy Deng and Qi Zhang", "abstract": "We propose PromptBERT, a novel contrastive learning method for learning better sentence representation. We firstly analysis the drawback of current sentence embedding from original BERT and find that it is mainly due to the static token embedding bias and ineffective BERT layers. Then we propose the first prompt-based sentence embeddings method and discuss two prompt representing methods and three prompt searching methods to make BERT achieve better sentence embeddings .Moreover, we propose a novel unsupervised training objective by the technology of template denoising, which substantially shortens the performance gap between the supervised and unsupervised settings. Extensive experiments show the effectiveness of our method. Compared to SimCSE, PromptBert achieves 2.29 and 2.58 points of improvement based on BERT and RoBERTa in the unsupervised setting.", "track": "Semantics: Lexical, Sentence level, Textual Inference and Other areas", "label": 8, "url": "https://www.semanticscholar.org/reader/27b6acf6bbb8fcad1f6bf1b90331b49489bd5ff1?experiments=&features=reader_skimming%3Atrue"}, {"loc": [5.469510078430176, 5.113385200500488], "id": 3132, "title": "Extending Logic Explained Networks to Text Classification", "authors": "Rishabh Jain, Gabriele Ciravegna, Pietro Barbiero, Francesco Giannini, Davide Buffelli and Pietro Lio", "abstract": "Recently, Logic Explained Networks (LENs) have been proposed as explainable-by-design neural models providing logic explanations for their predictions.\nHowever, these models have only been applied to vision and tabular data, and they mostly favour the generation of global explanations, while local ones tend to be noisy and verbose.\nFor these reasons, we propose LEN<sup>p</sup>, improving local explanations by perturbing input words, and we test it on text classification. Our results show that (i) LEN<sup>p</sup> provides better local explanations than LIME in terms of sensitivity and faithfulness, and (ii) its logic explanations are more useful and user-friendly than the feature scoring provided by LIME as attested by a human survey.", "track": "Interpretability, Interactivity and Analysis of Models for NLP", "label": 9, "url": "https://www.semanticscholar.org/reader/c336eb89564889fb1720e792f7cdd31122b4ffb4?experiments=&features=reader_skimming%3Atrue"}, {"loc": [1.673538088798523, 5.361381530761719], "id": 3137, "title": "Uni-Parser: Unified Semantic Parser for Question Answering on Knowledge Base and Database", "authors": "Ye Liu, Semih Yavuz, Rui Meng, Dragomir Radev, caiming xiong and Yingbo Zhou", "abstract": "Parsing natural language questions into executable logical forms is a useful and interpretable way to perform question answering on structured data such as knowledge bases (KB) or databases (DB). \nHowever, existing approaches on semantic parsing cannot adapt to both modalities, as they suffer from the exponential growth of the logical form candidates and can hardly generalize to unseen data.\nIn this work, we propose Uni-Parser, a unified semantic parser for question answering (QA) on both KB and DB. We define the primitive (relation and entity in KB, and table name, column name and cell value in DB) as the essential element in our framework. The number of primitives grows only at a linear rate to the number of retrieved relations in KB and DB, preventing us from exponential logic form candidates. \nWe leverage the generator to predict final logical forms by altering and composing top-ranked primitives with different operations (e.g. select, where, count). With sufficiently pruned search space by a contrastive primitive ranker, the generator is empowered to capture the composition of primitives enhancing its generalization ability. We achieve competitive results on multiple KB and DB QA benchmarks with more efficiency, especially in the compositional and zero-shot settings.", "track": "Question Answering", "label": 11, "url": "https://www.semanticscholar.org/reader/4dbd5febea8968acda097642e3daf2c312618bed?experiments=&features=reader_skimming%3Atrue"}, {"loc": [9.369523048400879, 6.256190776824951], "id": 3138, "title": "RAPO: An Adaptive Ranking Paradigm for Bilingual Lexicon Induction", "authors": "Zhoujin Tian, Chaozhuo Li, Shuo Ren, Zhiqiang Zuo, Zengxuan Wen, Xinyue Hu, Xiao Han, Haizhen Huang, Denvy Deng, Qi Zhang and Xing Xie", "abstract": "Bilingual lexicon induction induces the word translations by aligning independently trained word embeddings in two languages. Existing approaches generally focus on minimizing the distances between words in the aligned pairs, while suffering from low discriminative capability to distinguish the relative orders between positive and negative candidates. In addition, the mapping function is globally shared by all words, whose performance might be hindered by the deviations in the distributions of different languages. In this work, we propose a novel ranking-oriented induction model RAPO to learn personalized mapping function for each word. RAPO is capable of enjoying the merits from the unique characteristics of a single word and the cross-language isomorphism simultaneously. Extensive experimental results on public datasets including both rich-resource and low-resource languages demonstrate the superiority of our proposal. Our code is publicly available in \\url{https://github.com/Jlfj345wf/RAPO}.", "track": "Machine Translation", "label": 10, "url": "https://www.semanticscholar.org/reader/4b3c82cff291cb4be1e5405d05264d001cfc1e83?experiments=&features=reader_skimming%3Atrue"}, {"loc": [8.40419864654541, 6.5087056159973145], "id": 3146, "title": "On Parsing as Tagging", "authors": "Afra Amini and Ryan Cotterell", "abstract": "There are many proposals to reduce constituency parsing to tagging. To figure out what these approaches have in common, we offer a unifying pipeline, which consists of three steps: linearization, learning, and decoding. We prove that classic shift\u2013reduce parsing can be reduced to tetratagging---the state-of-the-art constituency tagger---under two assumptions: right-corner transformation in the linearization step and factored scoring in the learning step. We ask what is the most critical factor that makes parsing-as-tagging methods accurate while being efficient. To answer this question, we empirically evaluate a taxonomy of tagging pipelines with different choices of linearizers, learners, and decoders. Based on the results in English as well as a set of 8 typologically diverse languages, we conclude that the linearization of the derivation tree and its alignment with the input sequence is the most critical factor in achieving accurate parsers as taggers.", "track": "Syntax, Parsing and their Applications", "label": 23, "url": ""}, {"loc": [5.4511332511901855, 12.183195114135742], "id": 3147, "title": "Distilled Dual-Encoder Model for Vision-Language Understanding", "authors": "Zekun Wang, Wenhui Wang, Haichao Zhu, ming liu, Bing Qin and Furu Wei", "abstract": "On vision-language understanding (VLU) tasks, fusion-encoder vision-language models achieve superior results but sacrifice efficiency because of the simultaneous encoding of images and text. On the contrary, the dual encoder model that separately encodes images and text has the advantage in efficiency, while failing on VLU tasks due to the lack of deep cross-modal interactions. To get the best of both worlds, we propose DiDE, a framework that distills the knowledge of the fusion-encoder teacher model into the dual-encoder student model. Since the cross-modal interaction is the key to the superior performance of teacher model but is absent in the student model, we encourage the student not only to mimic the predictions of teacher, but also to calculate the cross-modal attention distributions and align with the teacher. Experimental results demonstrate that DiDE is competitive with the fusion-encoder teacher model in performance (only a 1% drop) while enjoying 4 times faster inference. Further analyses reveal that the proposed cross-modal attention distillation is crucial to the success of our framework.", "track": "Speech, Vision, Robotics, Multimodal Grounding", "label": 7, "url": "https://www.semanticscholar.org/reader/96362c3467d70ff1b471f74e0f83085b52afec34?experiments=&features=reader_skimming%3Atrue"}, {"loc": [1.3589158058166504, 10.333742141723633], "id": 3152, "title": "Argument Mining for Review Helpfulness Prediction", "authors": "Zaiqian Chen, Daniel Verdi do Amarante, Jenna Donaldson, Yohan Jo and Joonsuk Park", "abstract": "The importance of reliably determining the helpfulness of product reviews is rising as both helpful and unhelpful reviews continue to accumulate on e-commerce websites. And argumentational features---such as the structure of arguments and the types of underlying elementary units---have shown to be promising indicators of product review helpfulness. However, their adoption has been limited due to the lack of sufficient resources and large-scale experiments investigating their utility. To this end, we present the AMazon Argument Mining (AM$^2$) corpus---a corpus of 878 Amazon reviews on headphones annotated according to a theoretical argumentation model designed to evaluate argument quality.\nExperiments show that employing argumentational features leads to statistically significant improvements over the state-of-the-art review helpfulness predictors under both text-only and text-and-image settings.", "track": "Sentiment Analysis, Stylistic Analysis, and Argument Mining", "label": 16, "url": ""}, {"loc": [7.2147088050842285, 9.769562721252441], "id": 3172, "title": "Hierarchical Multi-Label Classification of Scientific Documents", "authors": "Mobashir Sadat and Cornelia Caragea", "abstract": "Automatic topic classification has been studied extensively to assist managing and indexing scientific documents in a digital collection. With the large number of topics being available in recent years, it has become necessary to arrange them in a hierarchy. Therefore, the automatic classification systems need to be able to classify the documents hierarchically. In addition, each paper is often assigned to more than one relevant topic. For example, a paper can be assigned to several topics in a hierarchy tree. In this paper, we introduce a new dataset for hierarchical multi-label text classification (HMLTC) of scientific papers called SciHTC, which contains 186,160 papers and 1,234 categories from the ACM CCS tree. We establish strong baselines for HMLTC and propose a multi-task learning approach for topic classification with keyword labeling as an auxiliary task. Our best model achieves a Macro-F1 score of 34.57%  which shows that this dataset provides significant research opportunities on hierarchical scientific topic classification. We make our dataset and code for all experiments publicly available.", "track": "Resources and Evaluation", "label": 1, "url": "https://www.semanticscholar.org/reader/8f066cdf7a5a37834b147dfa8e21e3275008ae8c?experiments=&features=reader_skimming%3Atrue"}, {"loc": [4.765139579772949, 3.3717100620269775], "id": 3182, "title": "Rainier: Reinforced Knowledge Introspector for Commonsense Question Answering", "authors": "Jiacheng Liu, Skyler R. Hallinan, Ximing Lu, Pengfei He, Sean Welleck, Hannaneh Hajishirzi and Yejin Choi", "abstract": "Knowledge underpins reasoning. Recent research demonstrates that when relevant knowledge is provided as additional context to commonsense question answering (QA), it can substantially enhance the performance even on top of state-of-the-art. The fundamental challenge is where and how to find such knowledge that is high quality and on point with respect to the question; knowledge retrieved from knowledge bases are incomplete and knowledge generated from language models are inconsistent.\n\nWe present Rainier, or Reinforced Knowledge Introspector, that learns to generate contextually relevant knowledge in response to given questions. Our approach starts by imitating knowledge generated by GPT-3, then learns to generate its own knowledge via reinforcement learning where rewards are shaped based on the increased performance on the resulting question answering. Rainier demonstrates substantial and consistent performance gains when tested over 9 different commonsense benchmarks: including 5 datasets that are seen during model training, as well as 4 datasets that are kept unseen. Our work is the first to report that knowledge generated by models that are orders of magnitude smaller than GPT-3, even without direct supervision on the knowledge itself, can exceed the quality of commonsense knowledge elicited from GPT-3.", "track": "Commonsense Reasoning", "label": 19, "url": "https://www.semanticscholar.org/reader/2591c66c6006c9c275a3dc7108a487934bc1c06f?experiments=&features=reader_skimming%3Atrue"}, {"loc": [8.202903747558594, 7.217472076416016], "id": 3187, "title": "A Major Obstacle for NLP Research: Let's Talk about Time Allocation!", "authors": "Katharina Kann, Shiran Dudy and Arya D. McCarthy", "abstract": "The field of natural language processing (NLP) has grown over the last few years: conferences have become larger, we have published an incredible amount of papers, and state-of-the-art research has been implemented in a large variety of customer-facing products. However, this paper argues that we have been less successful than we *should* have been and reflects on where and how the field fails to tap its full potential. \nSpecifically, we demonstrate that, in recent years, **subpar time allocation has been a major obstacle for NLP research**. We outline multiple concrete problems together with their negative consequences and, importantly, suggest remedies to improve the status quo. We hope that this paper will be a starting point for discussions around which common practices are -- or are *not* -- beneficial for NLP research.", "track": "Theme Track", "label": 18, "url": ""}, {"loc": [4.650156497955322, 9.133790969848633], "id": 3190, "title": "Towards Inter-character Relationship-driven Story Generation", "authors": "Anvesh Rao Vijjini, Faeze Brahman and Snigdha Chaturvedi", "abstract": "In this paper, we introduce the task of modeling interpersonal relationships for story generation. For addressing this task, we propose Relationships as Latent Variables for Story Generation, (ReLiSt). ReLiSt generates stories sentence by sentence and has two major components - a relationship selector and a story continuer. The relationship selector specifies a latent variable to pick the relationship to exhibit in the next sentence and the story continuer generates the next sentence while expressing the selected relationship in a coherent way. Our automatic and human evaluations demonstrate that ReLiSt is able to generate stories with relationships that are more faithful to desired relationships while maintaining the content quality. The relationship assignments to sentences during inference brings interpretability to ReLiSt.", "track": "Natural Language Generation", "label": 6, "url": "https://www.semanticscholar.org/reader/684e0925aa11628a165a6faf2095e45447258769?experiments=&features=reader_skimming%3Atrue"}, {"loc": [1.8694096803665161, 3.9563591480255127], "id": 3201, "title": "Incorporating Relevance Feedback for Information-Seeking Retrieval using Few-Shot Document Re-Ranking", "authors": "Tim Baumg\u00e4rtner, Leonardo F. R. Ribeiro, Nils Reimers and Iryna Gurevych", "abstract": "Pairing a lexical retriever with a neural re-ranking model has set state-of-the-art performance on large-scale information retrieval datasets. This pipeline covers scenarios like question answering or navigational queries, however, for information-seeking scenarios, users often provide information on whether a document is relevant to their query in form of clicks or explicit feedback. Therefore, in this work, we explore how relevance feedback can be directly integrated into neural re-ranking models by adopting few-shot and parameter-efficient learning techniques. Specifically, we introduce a kNN approach that re-ranks documents based on their similarity with the query and the documents the user considers relevant. Further, we explore Cross-Encoder models that we pre-train using meta-learning and subsequently fine-tune for each query, training only on the feedback documents. To evaluate our different integration strategies, we transform four existing information retrieval datasets into the relevance feedback scenario. Extensive experiments demonstrate that integrating relevance feedback directly in neural re-ranking models improves their performance, and fusing lexical ranking with our best performing neural re-ranker outperforms all other methods by 5.2% nDCG@20.", "track": "Information Retrieval and Text Mining", "label": 15, "url": "https://www.semanticscholar.org/reader/036e81bc9ef13272c74e9a504be23676dcce1d9d?experiments=&features=reader_skimming%3Atrue"}, {"loc": [4.315304279327393, 4.844986915588379], "id": 3202, "title": "ReasTAP: Injecting Table Reasoning Skills During Pre-training via Synthetic Reasoning Examples", "authors": "Yilun Zhao, Linyong Nan, Zhenting Qi, Rui Zhang and Dragomir Radev", "abstract": "Reasoning over tabular data requires both table structure understanding and a broad set of table reasoning skills. Current models with table-specific architectures and pre-training methods perform well on understanding table structures, but they still struggle with tasks that require various table reasoning skills. In this work, we develop ReasTAP to show that high-level table reasoning skills can be injected into models during pre-training without a complex table-specific architecture design. We define 7 table reasoning skills, such as numerical operation, temporal comparison, and conjunction. Each reasoning skill is associated with one example generator, which synthesizes questions over semi-structured tables according to the sampled templates. We model the table pre-training task as a sequence generation task and pre-train ReasTAP to generate precise answers of the synthetic examples. ReasTAP is evaluated on four benchmarks covering three downstream tasks including 1) WikiSQL-Weak and WikiTQ for Table Question Answering, 2) TabFact for Table Fact Verification, and 3) LogicNLG for Faithful Table-to-Text Generation. Experimental results demonstrate that ReasTAP achieves new state-of-the-art results on all of them and delivers a significant improvement under low-resource setting. Our code is publicly available at https://github.com/Yale-LILY/ReasTAP.", "track": "Question Answering", "label": 11, "url": "https://www.semanticscholar.org/reader/e1801f68d42f4a1a96d580b73706733883bf6af8?experiments=&features=reader_skimming%3Atrue"}, {"loc": [9.20965576171875, 7.070419788360596], "id": 3205, "title": "Few-shot Learning with Multilingual Generative Language Models", "authors": "Xi Victoria Lin, Todor Mihaylov, Mikel Artetxe, Tianlu Wang, Shuohui Chen, Daniel Simig, Myle Ott, Naman Goyal, Shruti Bhosale, Jingfei Du, Ramakanth Pasunuru, Sam Shleifer, Punit Singh Koura, Vishrav Chaudhary, Brian O'Horo, Jeff Wang, Luke Zettlemoyer, Zornitsa Kozareva, Mona Diab, Veselin Stoyanov and Xian Li", "abstract": "Large-scale generative language models such as GPT-3 are competitive few-shot learners. While these models are known to be able to jointly represent many different languages, their training data is dominated by English, potentially limiting their cross-lingual generalization. In this work, we train multilingual generative language models on a corpus covering a diverse set of languages, and study their few- and zero-shot learning capabilities in a wide range of tasks. Our largest model with 7.5 billion parameters sets new state of the art in few-shot learning in more than 20 representative languages, outperforming GPT-3 of comparable size in multilingual commonsense reasoning (with +7.4% absolute accuracy improvement in 0-shot settings and +9.4% in 4-shot settings) and natural language inference (+5.4% in each of 0-shot and 4-shot settings). On the FLORES-101 machine translation benchmark, our model outperforms GPT-3 on 171 out of 182 directions with 32 training examples, while surpassing the official supervised baseline in 45 directions. We conduct an in-depth analysis of different multilingual prompting approaches, showing in particular that strong few-shot learning performance across languages can be achieved via cross-lingual transfer through both templates and demonstration examples.", "track": "Multilinguality", "label": 13, "url": "https://www.semanticscholar.org/reader/4724ebee34ca2cd0a19c3a1ddb83d6d870dd7904?experiments=&features=reader_skimming%3Atrue"}, {"loc": [6.868297576904297, 6.257011890411377], "id": 3219, "title": "Are representations built from the ground up? An empirical examination of local composition in language models", "authors": "Emmy Liu and Graham Neubig", "abstract": "Compositionality, the phenomenon where the meaning of a phrase can be derived from its constituent parts, is a hallmark of human language. At the same time, many phrases are non-compositional, carrying a meaning beyond that of each part in isolation. Representing both of these types of phrases is critical for language understanding, but it is an open question whether modern language models (LMs) learn to do so; in this work we examine this question. We first formulate a problem of predicting the LM-internal representations of longer phrases given those of their constituents. We find that the representation of a parent phrase can be predicted with some accuracy given an affine transformation of its children. While we would expect the predictive accuracy to correlate with human judgments of semantic compositionality, we find this is largely not the case, indicating that LMs may not accurately distinguish between compositional and non-compositional phrases. We perform a variety of analyses, shedding light on when different varieties of LMs do and do not generate compositional representations, and discuss implications for future modeling work.", "track": "Semantics: Lexical, Sentence level, Textual Inference and Other areas", "label": 8, "url": "https://www.semanticscholar.org/reader/ee5895aa70bb4dbbdda256e23cada2d2ad1b15ae?experiments=&features=reader_skimming%3Atrue"}, {"loc": [7.198393821716309, 9.317082405090332], "id": 3224, "title": "Detecting Label Errors by Using Pre-Trained Language Models", "authors": "Derek Chong, Jenny Hong and Christopher D. Manning", "abstract": "We show that large pre-trained language models are inherently highly capable of identifying label errors in natural language datasets: simply examining out-of-sample data points in descending order of fine-tuned task loss significantly outperforms more complex error-detection mechanisms proposed in previous work. \nTo this end, we contribute a novel method for introducing realistic, human-originated label noise into existing crowdsourced datasets such as SNLI and TweetNLP. \nWe show that this noise has similar properties to real, hand-verified label errors, and is harder to detect than existing synthetic noise, creating challenges for model robustness.\nWe argue that human-originated noise is a better standard for evaluation than synthetic noise. Finally, we use crowdsourced verification to evaluate the detection of real errors on IMDB, Amazon Reviews, and Recon, and confirm that pre-trained models perform at a 9--36% higher absolute Area Under the Precision-Recall Curve than existing models.", "track": "Resources and Evaluation", "label": 1, "url": "https://www.semanticscholar.org/reader/a4429dd1276f16e696cd8ffb7b9a07a913e770eb?experiments=&features=reader_skimming%3Atrue"}, {"loc": [8.996356964111328, 8.176201820373535], "id": 3236, "title": "Intriguing Properties of Compression on Multilingual Models", "authors": "Kelechi Ogueji, Orevaoghene Ahia, Gbemileke A. Onilude, Sebastian Gehrmann, Sara Hooker and Julia Kreutzer", "abstract": "Multilingual models are often particularly dependent on scaling to generalize to a growing number of languages. Compression techniques are widely relied upon to reconcile the growth in model size with real world resource constraints, but compression can have a disparate effect on model performance for low-resource languages. It is thus crucial to understand the trade-offs between scale, multilingualism, and compression. In this work, we propose an experimental framework to characterize the impact of sparsifying multilingual pre-trained language models during fine-tuning.\nApplying this framework to mBERT named entity recognition models  across 40 languages, we find that compression confers several intriguing and previously unknown generalization properties. In contrast to prior findings, we find that compression may improve model robustness over dense models. We additionally observe that under certain sparsification regimes compression may aid, rather than disproportionately impact the performance of low-resource languages.", "track": "Multilinguality", "label": 13, "url": ""}, {"loc": [4.13213586807251, 9.340680122375488], "id": 3242, "title": "Sequence Models for Document Structure Identification in an Undeciphered Script", "authors": "Logan Born, M. Monroe, Kathryn Kelley and Anoop Sarkar", "abstract": "This work describes the first thorough analysis of \"header\u201d signs in proto-Elamite, an undeciphered script from 3100-2900 BCE. Headers are a category of signs which have been provisionally identified through painstaking manual analysis of this script by domain experts. We use unsupervised neural and statistical sequence modeling techniques to provide new and independent evidence for the existence of headers, without supervision from domain experts. Having affirmed the existence of headers as a legitimate structural feature, we next arrive at a richer understanding of their possible meaning and purpose by (i) examining which features predict their presence; (ii) identifying correlations between these features and other document properties; and (iii) examining cases where these features predict the presence of a header in texts where domain experts do not expect one (or vice versa). We provide more concrete processes for labeling headers in this corpus and a clearer justification for existing intuitions about document structure in proto-Elamite.", "track": "Computational Social Science and Cultural Analytics", "label": 20, "url": ""}, {"loc": [8.656522750854492, 5.997016906738281], "id": 3254, "title": "English Contrastive Learning Can Learn Universal Cross-lingual Sentence Embeddings", "authors": "Yaushian Wang, Ashley Wu and Graham Neubig", "abstract": "Universal cross-lingual sentence embeddings map semantically similar cross-lingual sentences into a shared embedding space. Aligning cross-lingual sentence embeddings usually requires supervised cross-lingual parallel sentences. In this work, we propose mSimCSE, which extends SimCSE to multilingual settings and reveal that contrastive learning on English data can surprisingly learn high-quality universal cross-lingual sentence embeddings without any parallel data.\nIn unsupervised and weakly supervised settings, mSimCSE significantly improves previous sentence embedding methods on cross-lingual retrieval and multilingual STS tasks. The performance of unsupervised mSimCSE is comparable to fully supervised methods in retrieving low-resource languages and multilingual STS.\nThe performance can be further enhanced when cross-lingual NLI data is available.", "track": "Multilinguality", "label": 13, "url": "https://www.semanticscholar.org/reader/1fec9a1c1d28228b1d23874c74de7315928dea6f?experiments=&features=reader_skimming%3Atrue"}, {"loc": [7.594743728637695, 9.035468101501465], "id": 3260, "title": "Active Example Selection for In-Context Learning", "authors": "Yiming Zhang, Shi Feng and Chenhao Tan", "abstract": "With a handful of demonstration examples, large-scale language models demonstrate strong capability to perform various tasks by in-context learning from these examples, without any fine-tuning. We demonstrate that in-context learning performance can be highly unstable across samples of examples, indicating the idiosyncrasies of how language models acquire information. We formulate example selection for in-context learning as a sequential decision problem, and propose a reinforcement learning algorithm for identifying generalizable policies to select demonstration examples. For GPT-2, our learned policies demonstrate strong abilities of generalizing to unseen tasks in training, with a 5.8% improvement on average. Examples selected from our learned policies can even achieve a small improvement on GPT-3 Ada. However, the improvement diminishes on larger GPT-3 models, suggesting emerging capabilities of large language models.", "track": "Language Modeling and Analysis of Language Models", "label": 2, "url": "https://www.semanticscholar.org/reader/b8bd29a6104d26a16687400049a4e7e026ae6258?experiments=&features=reader_skimming%3Atrue"}, {"loc": [3.7692370414733887, 9.596522331237793], "id": 3262, "title": "Improving Factual Consistency in Summarization with Compression-Based Post-Editing", "authors": "Alex Fabbri, Prafulla Kumar Choubey, Jesse Vig, Chien-Sheng Wu and caiming xiong", "abstract": "State-of-the-art summarization models still struggle to be factually consistent with the input text. A model-agnostic way to address this problem is post-editing the generated summaries. However, existing approaches typically fail to remove entity errors if a suitable input entity replacement is not available or may insert erroneous content. In our work, we focus on removing extrinsic entity errors, or entities not in the source, to improve consistency while retaining the summary's essential information and form. We propose to use sentence-compression data to train the post-editing model to take a summary with extrinsic entity errors marked with special tokens and output a compressed, well-formed summary with those errors removed. We show that this model improves factual consistency while maintaining ROUGE, improving entity precision by up to 30% on XSum, and that this model can be applied on top of another post-editor, improving entity precision by up to a total of 38%. We perform an extensive comparison of post-editing approaches that demonstrate trade-offs between factual consistency, informativeness, and grammaticality, and we analyze settings where post-editors show the largest improvements.", "track": "Summarization", "label": 14, "url": "https://www.semanticscholar.org/reader/7cf1944c133679356afd75d735abcbe5332d76e7?experiments=&features=reader_skimming%3Atrue"}, {"loc": [7.270824909210205, 6.932460784912109], "id": 3272, "title": "Evaluating the Impact of Model Scale for Compositional Generalization in Semantic Parsing", "authors": "Linlu Qiu, Peter Shaw, Panupong Pasupat, Tianze Shi, Jonathan Herzig, Emily Pitler, Fei Sha and Kristina Toutanova", "abstract": "Despite their strong performance on many tasks, pre-trained language models have been shown to struggle on out-of-distribution compositional generalization. Meanwhile, recent work has shown considerable improvements on many NLP tasks from model scaling. Can scaling up model size also improve compositional generalization in semantic parsing? We evaluate encoder-decoder models up to 11B parameters and decoder-only models up to 540B parameters, and compare model scaling curves for three different methods for applying a pre-trained language model to a new task: fine-tuning all parameters, prompt tuning, and in-context learning. We observe that fine-tuning generally has flat or negative scaling curves on out-of-distribution compositional generalization in semantic parsing evaluations. In-context learning has positive scaling curves, but is generally outperformed by much smaller fine-tuned models. Prompt-tuning can outperform fine-tuning, suggesting further potential improvements from scaling as it exhibits a more positive scaling curve. Additionally, we identify several error trends that vary with model scale. For example, larger models are generally better at modeling the syntax of the output space, but are also more prone to certain types of overfitting. Overall, our study highlights limitations of current techniques for effectively leveraging model scale for compositional generalization, while our analysis also suggests promising directions for future work.", "track": "Semantics: Lexical, Sentence level, Textual Inference and Other areas", "label": 8, "url": "https://www.semanticscholar.org/reader/6e10343767ab09dde83cf99ea3442907402a9810?experiments=&features=reader_skimming%3Atrue"}, {"loc": [6.146089553833008, 5.792469024658203], "id": 3277, "title": "\"I'm sorry to hear that\": Finding New Biases in Language Models with a Holistic Descriptor Dataset", "authors": "Eric Michael Smith, Melissa Hall, Melanie Kambadur, Eleonora Presani and Adina Williams", "abstract": "As language models grow in popularity, it becomes increasingly important to clearly measure all possible markers of demographic identity in order to avoid perpetuating existing societal harms. Many datasets for measuring bias currently exist, but they are restricted in their coverage of demographic axes and are commonly used with preset bias tests that presuppose which types of biases models can exhibit. In this work, we present a new, more inclusive bias measurement dataset, HolisticBias, which includes nearly 600 descriptor terms across 13 different demographic axes. HolisticBias was assembled in a participatory process including experts and community members with lived experience of these terms. These descriptors combine with a set of bias measurement templates to produce over 450,000 unique sentence prompts, which we use to explore, identify, and reduce novel forms of bias in several generative models. We demonstrate that HolisticBias is effective at measuring previously undetectable biases in token likelihoods from language models, as well as in an offensiveness classifier. We will invite additions and amendments to the dataset, which we hope will serve as a basis for more easy-to-use and standardized methods for evaluating bias in NLP models.", "track": "Ethic Concerns:Ethics", "label": 21, "url": ""}, {"loc": [5.240553379058838, 12.152050018310547], "id": 3286, "title": "Understanding ME? Multimodal Evaluation for Fine-grained Visual Commonsense", "authors": "Zhecan Wang, Haoxuan You, Yicheng He, Wenhao Li, Kai-Wei Chang and Shih-Fu Chang", "abstract": "Visual commonsense understanding requires Vision Language (VL) models to not only understand image and text but also cross-reference in-between to fully integrate and achieve comprehension of the visual scene described. Recently, various approaches have been developed and have achieved high performance on visual commonsense benchmarks. However, it is unclear whether the models really understand the visual scene and underlying commonsense knowledge due to limited evaluation data resources. To provide an in-depth analysis, we present a Multimodal Evaluation (ME) pipeline to automatically generate question-answer pairs to test models' understanding of the visual scene, text, and related knowledge. We then take a step further to show that training with the ME data boosts the model's performance in standard VCR evaluation. Lastly, our in-depth analysis and comparison reveal interesting findings: (1) semantically low-level information can assist the learning of high-level information but not the opposite; (2) visual information is generally under utilization compared with text.", "track": "Commonsense Reasoning", "label": 19, "url": "https://www.semanticscholar.org/reader/4ec418f72f831b0d3c4591e7da8d4369b12a7ec2?experiments=&features=reader_skimming%3Atrue"}, {"loc": [6.6946797370910645, 9.844232559204102], "id": 3298, "title": "Semantic Novelty Detection and Characterization in Factual Text Involving Named Entities", "authors": "Nianzu Ma, Sahisnu Mazumder, Alexander Politowicz, Bing Liu, Eric Robertson and Scott Grigsby", "abstract": "Much of the existing work on text novelty detection has been studied at the topic level, i.e., identifying whether the topic of a document or a sentence is novel or not. Little work has been done at the fine-grained semantic level (or contextual level). For example, given that we know Elon Musk is the CEO of a technology company, the sentence \"Elon Musk acted in the sitcom The Big Bang Theory'' is novel and surprising because normally a CEO would not be an actor. Existing topic-based novelty detection methods work poorly on this problem because they do not perform semantic reasoning involving relations between named entities in the text and their background knowledge. This paper proposes an effective model (called PAT-SND) to solve the problem, which can also characterize the novelty. An annotated dataset is also created. Evaluation shows that PAT-SND outperforms 10 baselines by large margins.", "track": "NLP Applications", "label": 0, "url": ""}, {"loc": [4.888962268829346, 3.3746895790100098], "id": 3304, "title": "CN-AutoMIC: Distilling Chinese Commonsense Knowledge from Pretrained Language Models", "authors": "Chenhao Wang, Jiachun Li, Yubo Chen, Kang Liu and Jun Zhao", "abstract": "Commonsense knowledge graphs (CKGs) are increasingly applied in various natural language processing tasks. However, most existing CKGs are limited to English, which hinders related research in non-English languages. Meanwhile, directly generating commonsense knowledge from pretrained language models has recently received attention, yet it has not been explored in non-English languages. In this paper, we propose a large-scale Chinese CKG generated from multilingual PLMs, named as **CN-AutoMIC**, aiming to fill the research gap of non-English CKGs. To improve the efficiency, we propose generate-by-category strategy to reduce invalid generation. To ensure the filtering quality, we develop cascaded filters to discard low-quality results. To further increase the diversity and density, we introduce a bootstrapping iteration process to reuse generated results. Finally, we conduct detailed analyses on CN-AutoMIC from different aspects. Empirical results show the proposed CKG has high quality and diversity, surpassing the direct translation version of similar English CKGs. We also find some interesting deficiency patterns and differences between relations, which reveal pending problems in commonsense knowledge generation. We share the resources and related models for further study.", "track": "Resources and Evaluation", "label": 1, "url": ""}, {"loc": [7.648690700531006, 7.889715194702148], "id": 3306, "title": "Calibrating Student Models for Emotion-related Tasks", "authors": "Mahshid Hosseini and Cornelia Caragea", "abstract": "Knowledge Distillation (KD) is an effective method to transfer knowledge from one network (a.k.a. teacher) to another (a.k.a. student). In this paper, we study KD on the emotion-related tasks from a new perspective: calibration. We further explore the impact of the mixup data augmentation technique on the distillation objective and propose to use a simple yet effective mixup method informed by training dynamics for calibrating the student models. Underpinned by the regularization impact of the mixup process by providing better training signals to the student models using training dynamics, our proposed mixup strategy gradually enhances the student model's calibration while effectively improving its performance. We evaluate the calibration of pre-trained language models through knowledge distillation over three tasks of emotion detection, sentiment analysis, and empathy detection. By conducting extensive experiments on different datasets, with both in-domain and out-of-domain test sets, we demonstrate that student models distilled from teacher models trained using our proposed mixup method obtained the lowest Expected Calibration Errors (ECEs) and best performance on both in-domain and out-of-domain test sets.", "track": "Efficient Methods for NLP", "label": 12, "url": ""}, {"loc": [9.256805419921875, 7.054654598236084], "id": 3313, "title": "Overcoming Catastrophic Forgetting in Zero-Shot Cross-Lingual Generation", "authors": "Tu Vu, Aditya Barua, Brian Lester, Daniel Cer, Mohit Iyyer and Noah Constant", "abstract": "In this paper, we explore the challenging problem of performing a generative task in a target language when labeled data is only available in English, using summarization as a case study. We assume a strict setting with no access to parallel data or machine translation and find that common transfer learning approaches struggle in this setting, as a generative multilingual model fine-tuned purely on English catastrophically forgets how to generate non-English. Given the recent rise of parameter-efficient adaptation techniques, we conduct the first investigation into how one such method, prompt tuning (Lester et al., 2021), can overcome catastrophic forgetting to enable zero-shot cross-lingual generation. Our experiments show that parameter-efficient prompt tuning provides gains over standard fine-tuning when transferring between less-related languages, e.g., from English to Thai. However, a significant gap still remains between these methods and fully-supervised baselines. To improve cross-lingual transfer further, we explore several approaches, including: (1) mixing in unlabeled multilingual data, and (2) explicitly factoring prompts into recombinable language and task components. Our approaches can provide further quality gains, suggesting that robust zero-shot cross-lingual generation is within reach.", "track": "Efficient Methods for NLP", "label": 12, "url": "https://www.semanticscholar.org/reader/d05a071b35112e306cd01853ca9a8f899b8dedc2?experiments=&features=reader_skimming%3Atrue"}, {"loc": [8.096649169921875, 5.16565465927124], "id": 3320, "title": "Improving Large-scale Paraphrase Acquisition and Generation", "authors": "Yao Dou, Chao Jiang and Wei Xu", "abstract": "This paper addresses the quality issues in existing Twitter-based paraphrase datasets, and discusses the necessity of using two separate definitions of paraphrase for identification and generation tasks. We present a new Multi-Topic Paraphrase in Twitter (MultiPIT) corpus that consists of a total of 130k sentence pairs with crowdsoursing (MultiPIT_crowd) and expert (MultiPIT_expert) annotations using two different paraphrase definitions for paraphrase identification, in addition to a multi-reference test set (MultiPIT_NMR) and a large automatically constructed training set (MultiPIT_Auto) for paraphrase generation. With improved data annotation quality and task-specific paraphrase definition, the best pre-trained language model fine-tuned on our dataset achieves the state-of-the-art performance of 84.2 F1 for automatic paraphrase identification. Furthermore, our empirical results also demonstrate that the paraphrase generation models trained on MultiPIT_Auto generate more diverse and high-quality paraphrases compared to their counterparts fine-tuned on other corpora such as Quora, MSCOCO, and ParaNMT.", "track": "Resources and Evaluation", "label": 1, "url": "https://www.semanticscholar.org/reader/dc62b87f2eae1683f5dc667d5035ffbd36bbe011?experiments=&features=reader_skimming%3Atrue"}, {"loc": [8.023735046386719, 9.056941032409668], "id": 3322, "title": "Entropy- and Distance-Based Predictors From GPT-2 Attention Patterns Predict Reading Times Over and Above GPT-2 Surprisal", "authors": "Byung-Doh Oh and William Schuler", "abstract": "Transformer-based large language models are trained to make predictions about the next word by aggregating representations of previous tokens through their self-attention mechanism. In the field of cognitive modeling, such attention patterns have recently been interpreted as embodying the process of cue-based retrieval, in which attention over multiple targets is taken to generate interference and latency during retrieval. Under this framework, this work first defines an entropy-based predictor that quantifies the diffuseness of self-attention, as well as distance-based predictors that capture the incremental change in attention patterns across timesteps. Moreover, following recent studies that question the informativeness of attention weights, we also experiment with alternative methods for incorporating vector norms into attention weights. Regression experiments using predictors calculated from the GPT-2 language model show that these predictors deliver a substantially better fit to held-out self-paced reading and eye-tracking data over a rigorous baseline including GPT-2 surprisal.", "track": "Linguistic Theories, Cognitive Modeling and Psycholinguistics", "label": 22, "url": ""}, {"loc": [4.876716136932373, 5.931199550628662], "id": 3340, "title": "A Survey of Computational Framing Analysis Approaches", "authors": "Mohammad Ali and Naeemul Hassan", "abstract": "Framing analysis is predominantly qualitative and quantitative, examining a small dataset with manual coding. Easy access to digital data in the last two decades prompts scholars in both computation and social sciences to utilize various computational tools to explore frames in large-scale datasets. The growing scholarship, however, lacks a comprehensive understanding and resources of computational framing analysis methods. Aiming to address the gap, this article surveys existing computational framing analysis approaches and puts them together. The research is expected to help scholars and journalists gain a deeper understanding of how frames are being explored computationally, better equip them to analyze frames in large-scale datasets, and, finally, work on advancing the methodological approaches.", "track": "Resources and Evaluation", "label": 1, "url": ""}, {"loc": [1.3934751749038696, 8.112939834594727], "id": 3344, "title": "Learning Cross-Task Dependencies for Joint Extraction of Entities, Events, Event Arguments, and Relations", "authors": "Minh Van Nguyen, Bonan Min, Franck Dernoncourt and Thien Huu Nguyen", "abstract": "Extracting entities, events, event arguments, and relations (i.e., task instances) from text represents four main challenging tasks in information extraction (IE), which have been solved jointly (JointIE) to boost the overall performance for IE. As such, previous work often leverages two types of dependencies between the tasks, i.e., cross-instance and cross-type dependencies representing relatedness between task instances and correlations between information types of the tasks. However, the cross-task dependencies in prior work are not optimal as they are only designed manually according to some task heuristics. To address this issue, we propose a novel model for JointIE that aims to learn cross-task dependencies from data. In particular, we treat each task instance as a node in a dependency graph where edges between the instances are inferred through information from different layers of a pretrained language model (e.g., BERT). Furthermore, we utilize the Chow-Liu algorithm to learn a dependency tree between information types for JointIE by seeking to approximate the joint distribution of the types from data. Finally, the Chow-Liu dependency tree is used to generate cross-type patterns, serving as anchor knowledge to guide the learning of representations and dependencies between instances for JointIE. Experimental results show that our proposed model significantly outperforms strong JointIE baselines over four datasets with different languages.", "track": "Information Extraction", "label": 5, "url": ""}, {"loc": [4.244668483734131, 7.392948627471924], "id": 3352, "title": "Don't Copy the Teacher: Data and Model Challenges in Embodied Dialogue", "authors": "So Yeon Min, Hao Zhu, Ruslan Salakhutdinov and Yonatan Bisk", "abstract": "Embodied dialogue instruction following requires an agent to complete a complex sequence of tasks from a natural language exchange. The recent introduction of benchmarks raises the question of how best to train and evaluate models for this multi-turn, multi-agent, long-horizon task. This paper contributes to that conversation, by arguing that imitation learning (IL) and related low-level metrics are actually misleading and do not align with the goals of embodied dialogue research and may hinder progress.\n\nWe provide empirical comparisons of metrics, analysis of three models, and make suggestions for how the field might best progress. First, we observe that models trained with IL take spurious actions during evaluation. Second, we find that existing models fail to ground query utterances, which are essential for task completion. Third, we argue evaluation should focus on higher-level semantic goals. We will release code to additionally filter the data and benchmark models for improved evaluation.", "track": "Speech, Vision, Robotics, Multimodal Grounding", "label": 7, "url": "https://www.semanticscholar.org/reader/a19a9b3db8b67e91b45724e349aa2ab3f2006437?experiments=&features=reader_skimming%3Atrue"}, {"loc": [5.6887712478637695, 10.785508155822754], "id": 3353, "title": "ALFRED-L: Investigating the Role of Language for Action Learning in Interactive Visual Environments", "authors": "Arjun Akula, Spandana Gella, Aishwarya Padmakumar, Mahdi Namazifar, Mohit Bansal, Jesse Thomason and Dilek Hakkani-Tur", "abstract": "Embodied Vision and Language Task Completion requires an embodied agent to interpret natural language instructions and egocentric visual observations to navigate through and interact with environments. In this work, we examine ALFRED, a challenging benchmark for embodied task completion, with the goal of gaining insight into how effectively models utilize language. We find evidence that sequence-to-sequence and transformer-based models trained on this benchmark are not sufficiently sensitive to changes in input language instructions. Next, we construct a new test split -- ALFRED-L to test whether ALFRED models can generalize to task structures not seen during training that intuitively require the same types of language understanding required in ALFRED. Evaluation of existing models on ALFRED-L suggests that (a) models are overly reliant on the sequence in which objects are visited in typical ALFRED trajectories and fail to adapt to modifications of this sequence and (b) models trained with additional augmented trajectories are able to adapt relatively better to such changes in input language instructions.", "track": "Speech, Vision, Robotics, Multimodal Grounding", "label": 7, "url": ""}, {"loc": [4.124453544616699, 7.540177822113037], "id": 3357, "title": "Dungeons and Dragons as a Dialog Challenge for Artificial Intelligence", "authors": "Chris Callison-Burch, Gaurav Singh Tomar, Lara Martin, Daphne Ippolito, Suma Bailis and David Reitter", "abstract": "AI researchers have posited Dungeons and Dragons (D&D) as a challenge problem to test systems on various language-related capabilities. In this paper, we frame D&D specifically as a dialogue system challenge, where the tasks are to both generate the next conversational turn in the game and predict the state of the game given the dialogue history.  We create a gameplay dataset consisting of nearly 900 games, with a total of 7,000 players, 800,000 dialogue turns, 500,000 dice rolls, and 58 million words.  We automatically annotate the data with partial state information about the game play.  We train a large language model (LM) to generate the next game turn, conditioning it on different information.  The LM can respond as a particular character or as the player who runs the game\u2014i.e., the Dungeon Master (DM). It is trained to produce dialogue that is either in-character (roleplaying in the fictional world) or out-of-character (discussing rules or strategy).  We perform a human evaluation to determine what factors make the generated output plausible and interesting.  We further perform an automatic evaluation to determine how well the model can predict the game state given the history and examine how well tracking the game state improves its ability to produce plausible conversational output.", "track": "Dialogue and Interactive Systems", "label": 4, "url": "https://www.semanticscholar.org/reader/22d34b881d64523da54f13d01fc3c6d93a8412e3?experiments=&features=reader_skimming%3Atrue"}, {"loc": [1.5910078287124634, 8.584247589111328], "id": 3371, "title": "Unsupervised Entity Linking with Guided Summarization and Multiple-Choice Selection", "authors": "Young Min Cho, Li Zhang and Chris Callison-Burch", "abstract": "Entity linking, the task of linking potentially ambiguous mentions in texts to corresponding knowledge-base entities, is an important component for language understanding. We address two challenge in entity linking: how to leverage wider contexts surrounding a mention, and how to deal with limited training data. We propose a fully unsupervised model called SumMC that first generates a guided summary of the contexts conditioning on the mention, and then casts the task to a multiple-choice problem where the model chooses an entity from a list of candidates. In addition to evaluating our model on existing datasets that focus on named entities, we create a new dataset that links noun phrases from WikiHow to Wikidata. We show that our SumMC model achieves state-of-the-art unsupervised performance on our new dataset and on exiting datasets.", "track": "Unsupervised and Weakly-Supervised Methods in NLP", "label": 17, "url": ""}, {"loc": [5.575639724731445, 11.72941780090332], "id": 3376, "title": "Weakly-Supervised Temporal Article Grounding", "authors": "Long Chen, Yulei Niu, Brian Chen, Xudong Lin, Guangxing Han, Christopher Thomas, Hammad Ayyubi, Heng Ji and Shih-Fu Chang", "abstract": "Given a long untrimmed video and natural language queries, video grounding (VG) aims to temporally localize the semantically-aligned video segments. Almost all existing VG work holds two simple but unrealistic assumptions: 1) All query sentences can be grounded in the corresponding video. 2) All query sentences for the same video are always at the same semantic scale. Unfortunately, both assumptions make today's VG models fail to work in practice. For example, in real-world multimodal assets (eg, news articles), most of the sentences in the article can not be grounded in their affiliated videos, and they typically have rich hierarchical relations (ie, at different semantic scales). To this end, we propose a new challenging grounding task: Weakly-Supervised temporal Article Grounding (WSAG). Specifically, given an article and a relevant video, WSAG aims to localize all ``groundable'' sentences to the video, and these sentences are possibly at different semantic scales. Accordingly, we collect the first WSAG dataset to facilitate this task: YouwikiHow, which borrows the inherent multi-scale descriptions in wikiHow articles and plentiful YouTube videos. In addition, we propose a simple but effective method DualMIL for WSAG, which consists of a two-level MIL loss and a single-/cross- sentence constraint loss. These training objectives are carefully designed for these relaxed assumptions. Extensive ablations have verified the effectiveness of DualMIL.", "track": "Speech, Vision, Robotics, Multimodal Grounding", "label": 7, "url": "https://www.semanticscholar.org/reader/2186518e9b94cb7a3ae13e2cc8633bb9bd6209fd?experiments=&features=reader_skimming%3Atrue"}, {"loc": [2.531998634338379, 4.610751628875732], "id": 3378, "title": "Exploring Dual Encoder Architectures for Question Answering", "authors": "Zhe Dong, Jianmo Ni, Dan Bikel, Enrique Alfonseca, Yuan Wang, Chen Qu and Imed Zitouni", "abstract": "Dual encoders have been used for question-answering (QA) and information retrieval (IR) tasks with good results. There are two major types of dual encoders, Siamese Dual Encoders (SDE), with parameters shared across two encoders, and Asymmetric Dual Encoder (ADE), with two distinctly parameterized encoders. In this work, we explore the dual encoder architectures for QA retrieval tasks. By evaluating on MS MARCO, open domain NQ, and the MultiReQA benchmarks, we show that SDE performs significantly better than ADE. We further propose three different improved versions of ADEs. Based on the evaluation of QA retrieval tasks and direct analysis of the embeddings, we demonstrate that sharing parameters in projection layers would enable ADEs to perform competitively with SDEs.", "track": "Information Retrieval and Text Mining", "label": 15, "url": "https://www.semanticscholar.org/reader/b9a7a565c0af63f467595f69263974f2e5bc0bbe?experiments=&features=reader_skimming%3Atrue"}, {"loc": [6.19614315032959, 7.879395484924316], "id": 3385, "title": "arXivEdits: Understanding the Human Revision Process in Scientific Writing", "authors": "Chao Jiang, Wei Xu and Samuel Stevens", "abstract": "Scientific publications are the primary means to communicate research discoveries, where the writing quality is of crucial importance. However,  prior work studying the human editing process in this domain mainly focused on the abstract or introduction sections, resulting in an incomplete picture. In this work, we provide a complete computational framework for studying text revision for scientific writing. We first introduce arXivEdits, a new annotated corpus of 751 full papers from arXiv with gold sentence alignment across their multiple versions of revision, as well as fine-grained span-level edits and their underlying intentions for 1,000 sentence pairs. It supports our data-driven analysis to unveil the common strategies practiced by researchers for revising their papers. To scale up the analysis, we also develop automatic methods to extract revision at document-, sentence-, and word-levels. A neural CRF sentence alignment model trained on our corpus achieves 93.8 F1, enabling the reliable matching of sentences between different versions.  We formulate the edit extraction task as a span alignment problem, and our proposed method extracts more fine-grained and explainable edits, compared to the commonly used diff  algorithm. An intention classifier trained on our dataset achieves 78.9 F1 on the fine-grained intent classification task. Our data and systems are released at tiny.one/arxivedits.", "track": "Resources and Evaluation", "label": 1, "url": ""}, {"loc": [3.9896295070648193, 8.993953704833984], "id": 3390, "title": "Why Do You Feel This Way? Summarizing Triggers of Emotions in Social Media Posts", "authors": "Hongli Zhan, Tiberiu Sosea, Cornelia Caragea and Junyi Jessy Li", "abstract": "Crises such as the COVID-19 pandemic continuously threaten our world and emotionally affect billions of people worldwide in distinct ways. Understanding the triggers leading to people's emotions is of crucial importance. Social media posts can be a good source of such analysis, yet these texts tend to be charged with multiple emotions, with triggers scattering across multiple sentences. This paper takes a novel angle, namely, emotion detection and trigger summarization, aiming to both detect perceived emotions in text, and summarize events and their appraisals that trigger each emotion. To support this goal, we introduce CovidET (Emotions and their Triggers during Covid-19), a dataset of ~1,900 English Reddit posts related to COVID-19, which contains manual annotations of perceived emotions and abstractive summaries of their triggers described in the post. We develop strong baselines to jointly detect emotions and summarize emotion triggers. Our analyses show that CovidET presents new challenges in emotion-specific summarization, as well as multi-emotion detection in long social media posts.", "track": "Summarization", "label": 14, "url": "https://www.semanticscholar.org/reader/bb6bbc8f5dd79e06b85be269603a38dcc1799436?experiments=&features=reader_skimming%3Atrue"}, {"loc": [4.0564093589782715, 3.9607183933258057], "id": 3393, "title": "Analogical Math Word Problems Solving with Enhanced Problem-Solution Association", "authors": "Zhenwen Liang, Jipeng Zhang and Xiangliang Zhang", "abstract": "Math word problem (MWP) solving is an important task in question answering which requires human-like reasoning ability. Analogical reasoning has long been used in mathematical education, as it enables students to apply common relational structures of mathematical situations to solve new problems. In this paper, we propose to build a novel MWP solver by leveraging analogical MWPs, which advance the solver's generalization ability across different kinds of MWPs. The key idea, named analogy identification,  is to associate the analogical MWP pairs in a latent space, i.e.,  encoding an MWP close to another analogical MWP, while leaving away from the non-analogical ones. Moreover, a solution discriminator is integrated into the MWP solver to enhance the association between an MWP and its true solution. The evaluation results verify that our proposed analogical learning strategy promotes the performance of MWP-BERT on Math23k over the state-of-the-art model Generate2Rank, with 5 times fewer parameters in the encoder. We also find that our model has a stronger generalization ability in solving difficult MWPs due to the analogical learning from easy MWPs.", "track": "Question Answering", "label": 11, "url": ""}, {"loc": [3.8607699871063232, 4.542219161987305], "id": 3399, "title": "Towards Teachable Reasoning Systems: Using a Dynamic Memory of User Feedback for Continual System Improvement", "authors": "Bhavana Dalvi Mishra, Oyvind Tafjord and Peter Clark", "abstract": "Our goal is a teachable reasoning system for question-answering (QA), where a user can interact with faithful answer explanations, and correct its errors so that the system improves over time. Our approach is to augment a QA model with a dynamic memory of user feedback, containing user-supplied corrections to\nerroneous model beliefs that users identify during interaction. Retrievals from memory are used as additional context for QA, to help avoid previous mistakes in similar new situations - a novel application of memory-based continuous learning. With simulated feedback, we find that our system (called TeachMe) continually improves with time, and without model retraining, requiring feedback on only 25% of training examples to reach within 1% of the upper-bound (feedback on all examples). Similarly, in experiments with real users, we observe a similar trend, with performance improving by over 15% on a hidden test set after teaching. This suggests new opportunities for using frozen language models in an interactive setting where users can inspect, debug, and correct the model's beliefs, leading to improved system's performance over time.", "track": "Interpretability, Interactivity and Analysis of Models for NLP", "label": 9, "url": "https://www.semanticscholar.org/reader/e7d75b80e0fa3ae190ff91676dbf18a006d3a311?experiments=&features=reader_skimming%3Atrue"}, {"loc": [2.9380671977996826, 4.642478942871094], "id": 3436, "title": "Knowledge Transfer from Answer Ranking to Answer Generation", "authors": "Matteo Gabburo, Rik Koncel-Kedziorski, Siddhant Garg, Luca Soldaini and Alessandro Moschitti", "abstract": "Recent studies show that Question Answering (QA) based on Answer Sentence Selection (AS2) can be improved by generating an improved answer from the top-k ranked answer sentences (termed GenQA). This allows for synthesizing the information from multiple candidates into a concise, natural-sounding answer. However, creating large-scale supervised training data for GenQA models is very challenging. In this paper, we propose to train a GenQA model by transferring  knowledge from a trained AS2 model, to overcome the aforementioned issue. First, we use an AS2 model to produce a ranking over answer candidates for a set of questions. Then, we use the top ranked candidate as the generation target, and the next k top ranked candidates as context for training a GenQA model. We also propose to use the AS2 model prediction scores for loss weighting and score-conditioned input/output shaping, to aid the knowledge transfer. Our evaluation on three public and one large industrial datasets demonstrates the superiority of our approach over the AS2 baseline, and GenQA trained using supervised data.", "track": "Question Answering", "label": 11, "url": "https://www.semanticscholar.org/reader/27202f962798d08b39601a36127360c5ccd9c625?experiments=&features=reader_skimming%3Atrue"}, {"loc": [6.293747901916504, 5.413885593414307], "id": 3450, "title": "Perturbation Augmentation for Fairer NLP", "authors": "Rebecca Qian, Candace Ross, Jude Fernandes, Eric Michael Smith, Douwe Kiela and Adina Williams", "abstract": "Unwanted and often harmful social biases are becoming ever more salient in NLP research, affecting both models and datasets. In this work, we ask whether training on demographically perturbed data leads to fairer language models. We collect a large dataset of human annotated text perturbations and train a neural perturbation model, which we show outperforms heuristic alternatives. We find that (i) language models (LMs) pre-trained on demographically perturbed corpora are typically more fair, and (ii) LMs finetuned on perturbed GLUE datasets exhibit less demographic bias on downstream tasks, and (iii) fairness improvements do not come at the expense of performance on downstream tasks. Lastly, we discuss outstanding questions about how best to evaluate the (un)fairness of large language models. We hope that this exploration of neural demographic perturbation will help drive more improvement towards fairer NLP.", "track": "Ethics", "label": 21, "url": "https://www.semanticscholar.org/reader/011095a0082e5e301f9bf30267b193c1c9e7e370?experiments=&features=reader_skimming%3Atrue"}, {"loc": [6.624654293060303, 8.357181549072266], "id": 3451, "title": "Automatic Document Selection for Efficient Encoder Pretraining", "authors": "Yukun Feng, Patrick Xia, Benjamin Van Durme and Jo\u00e3o Sedoc", "abstract": "Building pretrained language models is considered expensive and data-intensive, but must we increase dataset size to achieve better performance? We propose an alternative to larger training sets by automatically identifying smaller yet domain-representative subsets. We extend Cynical Data Selection, a statistical sentence scoring method that conditions on a representative target domain corpus. As an example, we treat the OntoNotes corpus as a target domain and pretrain a RoBERTa-like encoder from a cynically selected subset of the Pile. On both perplexity and across several downstream tasks in the target domain, it consistently outperforms random selection with 20x less data, 3x fewer training iterations, and 2x less estimated cloud compute cost, validating the recipe of automatic document selection for LM pretraining.", "track": "Efficient Methods for NLP", "label": 12, "url": "https://www.semanticscholar.org/reader/4bef9d46209ac8988ea5ab83547149760d4af65e?experiments=&features=reader_skimming%3Atrue"}, {"loc": [6.069704055786133, 12.048501014709473], "id": 3453, "title": "The Aligned Multimodal Movie Treebank: An audio, video, dependency-parse treebank", "authors": "Adam Yaari, Jan DeWitt, Henry Hu, Bennett Stankovits, Sue Felshin, Yevgeni Berzak, Helena Aparicio, Boris Katz, Ignacio Cases and Andrei Barbu", "abstract": "Treebanks have traditionally included only text and were derived from written sources such as newspapers or the web. We introduce the Aligned Multimodal Movie Treebank (AMMT), an English language treebank derived from dialog in Hollywood movies which includes transcriptions of the audio-visual streams with word-level alignment, as well as part of speech tags and dependency parses in the Universal Dependencies formalism. AMMT consists of 31,264 sentences and 218,090 words, that will amount to the 3rd largest UD English treebank and the only multimodal treebank in UD.  To help with the web-based annotation effort, we also introduce the Efficient Audio Alignment Annotator (EAAA), a companion tool that enables annotators to significantly speed-up their annotation processes.", "track": "Resources and Evaluation", "label": 1, "url": ""}, {"loc": [10.940399169921875, 6.7785210609436035], "id": 3460, "title": "\ud83c\udf3e DEMETR: Diagnosing Evaluation Metrics for Translation", "authors": "Marzena Karpinska, Nishant Raj, Katherine Thai, Yixiao Song, Ankita Gupta and Mohit Iyyer", "abstract": "While machine translation evaluation metrics based on string overlap (e.g., BLEU) have their limitations, their computations are transparent: the BLEU score assigned to a particular candidate translation can be traced back to the presence or absence of certain words. The operations of newer learned metrics (e.g., BLEURT, COMET), which leverage pretrained language models to achieve higher correlations with human quality judgments than BLEU, are opaque in comparison.  In this paper, we shed light on the behavior of these learned metrics by creating DEMETR, a diagnostic dataset with 31K English examples (translated from 10 source languages) for evaluating the sensitivity of MT evaluation metrics to 35 different linguistic perturbations spanning semantic, syntactic, and morphological error categories. All perturbations were carefully designed to form minimal pairs with the actual translation (i.e., differ in only one aspect). We find that learned metrics perform substantially better than string-based metrics on DEMETR. Additionally, learned metrics differ in their sensitivity to various phenomena (e.g., BERTScore is sensitive to untranslated words but relatively insensitive to gender manipulation, while COMET is much more sensitive to word repetition than to aspectual changes). We publicly release DEMETR to spur more informed future development of machine translation evaluation metrics", "track": "Resources and Evaluation", "label": 1, "url": "https://www.semanticscholar.org/reader/9443a623d6e0d423adb9c61b5d225f0077f38767?experiments=&features=reader_skimming%3Atrue"}, {"loc": [1.6587108373641968, 5.436682224273682], "id": 3478, "title": "Empowering Language Models with Knowledge Graph Reasoning for Open-Domain Question Answering", "authors": "Ziniu Hu, Yichong Xu, Wenhao Yu, Shuohang Wang, Ziyi Yang, Chenguang Zhu, Kai-Wei Chang and Yizhou Sun", "abstract": "Answering open-domain questions requires world knowledge about in-context entities. As pre-trained Language Models (LMs) lack the power to store all required knowledge, external knowledge sources, such as knowledge graphs, are often used to augment LMs. \nIn this work, we propose knOwledge REasOning empowered Language Model\n(OREO-LM), which consists of a novel Knowledge Interaction Layer that can be flexibly plugged into existing Transformer-based LMs to interact with a differentiable Knowledge Graph Reasoning module collaboratively. In this way, LM guides KG to walk towards the desired answer, while the retrieved knowledge improves LM.\nBy adopting OREO-LM to RoBERTa and T5, we show significant performance gain, achieving state-of-art results in the Closed-Book setting. The performance enhancement is mainly from the KG reasoning's capacity to infer missing relational facts. In addition, OREO-LM provides reasoning paths as rationales to interpret the model's decision.", "track": "Question Answering", "label": 11, "url": ""}, {"loc": [6.33575439453125, 5.516512870788574], "id": 3480, "title": "Debiasing Pretrained Text Encoders by Paying Attention to Paying Attention", "authors": "Yacine Gaci, Boualem Benatallah, Fabio Casati and Khalid Benabdeslem", "abstract": "Natural Language Processing (NLP) models are found to exhibit discriminatory stereotypes across many social constructs, e.g. gender and race. In comparison to the progress made in reducing bias from static word embeddings, fairness in sentence-level text encoders received little consideration despite their wider applicability in contemporary NLP tasks. In this paper, we propose a debiasing method for pre-trained text encoders that both reduces social stereotypes, and inflicts next to no semantic damage. Unlike previous studies that directly manipulate the embeddings, we suggest to dive deeper into the operation of these encoders, and pay more attention to the way they pay attention to different social groups. We find that stereotypes are also encoded in the attention layer. Then, we work on model debiasing by redistributing the attention scores of a text encoder such that it forgets any preference to historically advantaged groups, and attends to all social classes with the same intensity. Our experiments confirm that reducing bias from attention effectively mitigates it from the model's text representations.", "track": "Ethics", "label": 21, "url": ""}, {"loc": [2.1277928352355957, 7.572661399841309], "id": 3486, "title": "MEE: A Novel Multilingual Event Extraction Dataset", "authors": "Amir Pouran Ben Veyseh, Javid Ebrahimi, Franck Dernoncourt and Thien Huu Nguyen", "abstract": "Event Extraction (EE) is one of the fundamental tasks in Information Extraction (IE) that aims to recognize event mentions and their arguments (i.e., participants) from text. Due to its importance, extensive methods and resources have been developed for Event Extraction. However, one limitation of current research for EE involves the under-exploration for non-English languages in which the lack of high-quality multilingual EE datasets for model training and evaluation has been the main hindrance. To address this limitation, we propose a novel Multilingual Event Extraction dataset (MEE) that provides annotation for more than 50K event mentions in 8 typologically different languages. MEE comprehensively annotates data for entity mentions, event triggers and event arguments. We conduct extensive experiments on the proposed dataset to reveal challenges and opportunities for multilingual EE. To foster future research in this direction, our dataset will be publicly available.", "track": "Ethic Concerns:Resources and Evaluation", "label": 1, "url": ""}, {"loc": [4.560649871826172, 4.40165901184082], "id": 3487, "title": "RobustLR: A Diagnostic Benchmark for Evaluating Logical Robustness of Deductive Reasoners", "authors": "Soumya Sanyal, Zeyi Liao and Xiang Ren", "abstract": "Transformers have been shown to be able to perform deductive reasoning on inputs containing rules and statements written in the English natural language. However, it is unclear if these models indeed follow rigorous logical reasoning to arrive at the prediction or rely on spurious correlation patterns in making decisions. A strong deductive reasoning model should consistently understand the semantics of different logical operators. To this end, we present RobustLR, a diagnostic benchmark that evaluates the robustness of language models to minimal logical edits in the inputs and different logical equivalence conditions. In our experiments with RoBERTa, T5, and GPT3 we show that the models trained on deductive reasoning datasets do not perform consistently on the RobustLR test set, thus showing that the models are not robust to our proposed logical perturbations. Further, we observe that the models find it especially hard to learn logical negation operators. Our results demonstrate the shortcomings of current language models in logical reasoning and call for the development of better inductive biases to teach the logical semantics to language models. All the datasets and code base have been made publicly available.", "track": "Resources and Evaluation", "label": 1, "url": ""}, {"loc": [3.773984670639038, 9.92845630645752], "id": 3488, "title": "Evaluating and Improving Factuality in Multimodal Abstractive Summarization", "authors": "David Wan and Mohit Bansal", "abstract": "Current metrics for evaluating factuality for abstractive document summarization have achieved high correlations with human judgment, but they do not account for the vision modality and thus are not adequate for vision-and-language summarization. We propose CLIPBERTSCORE, a simple weighted combination of CLIPScore and BERTScore to leverage the robustness and strong factuality detection performance between image-summary and document-summary, respectively. Next, due to the lack of meta-evaluation benchmarks to evaluate the quality of multimodal factuality metrics, we collect human judgments of factuality with respect to documents and images. We show that this simple combination of two metrics in the zero-shot setting achieves higher correlations than existing factuality metrics for document summarization, outperforms an existing multimodal summarization metric, and performs competitively with strong multimodal factuality metrics specifically fine-tuned for the task. Our thorough analysis demonstrates the robustness and high correlation of CLIPBERTSCORE and its components on four factuality metric-evaluation benchmarks. Finally, we demonstrate two practical downstream applications of our CLIPBERTSCORE metric: for selecting important images to focus on during training, and as a reward for reinforcement learning to improve factuality of multimodal summary generation w.r.t automatic and human evaluation.", "track": "Summarization", "label": 14, "url": "https://www.semanticscholar.org/reader/10edd3ef21ad148ac1517fbc5a31a944e78b7d63?experiments=&features=reader_skimming%3Atrue"}, {"loc": [3.7909786701202393, 9.949275016784668], "id": 3518, "title": "Referee: Reference-Free Sentence Summarization with Sharper Controllability through Symbolic Knowledge Distillation", "authors": "Melanie Sclar, Peter West, Sachin Kumar, Yulia Tsvetkov and Yejin Choi", "abstract": "We present Referee, a novel framework for sentence summarization that can be trained reference-free (i.e., requiring no gold summaries for supervision), while allowing direct control for compression ratio. Our work is the first to demonstrate that reference-free, controlled sentence summarization is feasible via the conceptual framework of Symbolic Knowledge Distillation (West et al., 2022), where latent knowledge in pre-trained language models is distilled via explicit examples sampled from the teacher models, further purified with three types of filters: length, fidelity, and Information Bottleneck. Moreover, we uniquely propose iterative distillation of knowledge, where student models from the previous iteration of distillation serve as teacher models in the next iteration. Starting off from a relatively modest set of GPT3-generated summaries, we demonstrate how iterative knowledge distillation can lead to considerably smaller, but better summarizers with sharper controllability. A useful by-product of this iterative distillation process is a high-quality dataset of sentence-summary pairs with varying degrees of compression ratios. Empirical results demonstrate that the final student models vastly outperform the much larger GPT3-Instruct model in terms of the controllability of compression ratios, without compromising the quality of resulting summarization.", "track": "Summarization", "label": 14, "url": "https://www.semanticscholar.org/reader/78d3955e30d99650d078ba3ce1a523745da31040?experiments=&features=reader_skimming%3Atrue"}, {"loc": [8.260405540466309, 6.632893085479736], "id": 3519, "title": "Algorithms for Weighted Pushdown Automata", "authors": "Alexandra Butoi, Brian DuSell, Tim Vieira, Ryan Cotterell and David Chiang", "abstract": "Weighted pushdown automata (WPDAs) are at the core of many natural language processing tasks, like syntax-based statistical machine translation and transition-based dependency parsing. As most existing dynamic programming algorithms are designed for context-free grammars (CFGs), algorithms for PDAs often resort to a PDA-to-CFG conversion. In this paper, we develop novel algorithms that operate directly on WPDAs. Our algorithms are inspired by Lang's algorithm, but use a more general definition of pushdown automaton and either reduce the space requirements by a factor of |Gamma| (the size of the stack alphabet) or reduce the runtime by a factor of more than |Q| (the number of states). When run on the same class of PDAs as Lang's algorithm, our algorithm is both more space-efficient by a factor of |Gamma| and more time-efficient by a factor of |Q| x |Gamma|.", "track": "Syntax, Parsing and their Applications", "label": 23, "url": ""}, {"loc": [6.22494649887085, 5.49954891204834], "id": 3529, "title": "MABEL: Attenuating Gender Bias using Textual Entailment Data", "authors": "Jacqueline He, Mengzhou Xia, Christiane Fellbaum and Danqi Chen", "abstract": "Pre-trained language models encode undesirable social biases, which are further exacerbated in downstream use. To this end, we propose MABEL (a Method for Attenuating Gender Bias using Entailment Labels), an intermediate pre-training approach for mitigating gender bias in contextualized representations. Key to our approach is the use of a contrastive learning objective on counterfactually augmented, gender-balanced entailment pairs from natural language inference (NLI) datasets. We also introduce an alignment regularizer that pulls identical entailment pairs along opposite gender directions closer. We extensively evaluate our approach on intrinsic and extrinsic metrics, and show that MABEL outperforms previous task-agnostic debiasing approaches in terms of fairness. It also preserves task performance after fine-tuning on downstream tasks. Together, these findings demonstrate the suitability of NLI data as an effective means of bias mitigation, as opposed to only using unlabeled sentences in the literature. Finally, we identify that existing approaches often use evaluation settings that are insufficient or inconsistent. We make an effort to reproduce and compare previous methods, and call for unifying the evaluation settings across gender debiasing methods for better future comparison.", "track": "Ethics", "label": 21, "url": "https://www.semanticscholar.org/reader/20e1ef6a126bd9bc0b4e899debbf65c6baa21652?experiments=&features=reader_skimming%3Atrue"}, {"loc": [4.536043167114258, 4.406488418579102], "id": 3539, "title": "Breakpoint Transformers for Modeling and Tracking Intermediate Beliefs", "authors": "Kyle Richardson, Ronen Tamari, Oren Sultan, Dafna Shahaf, Reut Tsarfaty and Ashish Sabharwal", "abstract": "Can we teach models designed for language understanding tasks to track and improve their beliefs through intermediate points in text? Besides making their inner workings more transparent, this would also help make models more reliable and consistent. To this end, we propose a representation learning framework called breakpoint modeling that allows for efficient and robust learning of this type. Given any text encoder and data marked with intermediate states (breakpoints) along with corresponding textual queries viewed as true/false propositions (i.e., the candidate intermediate beliefs of a model), our approach trains models in an efficient and end-to-end fashion to build intermediate representations that facilitate direct querying and training of beliefs at arbitrary points in text, alongside solving other end-tasks. We evaluate breakpoint modeling on a diverse set of NLU tasks including relation reasoning on Cluttr and narrative understanding on bAbI. Using novel proposition prediction tasks alongside these end-tasks, we show the benefit of our T5-based breakpoint transformer over strong conventional representation learning approaches in terms of processing efficiency, belief accuracy, and belief consistency, all with minimal to no degradation on the end-task. To show the feasibility of incorporating our belief tracker into more complex reasoning pipelines, we also obtain state-of-the-art performance on the three-tiered reasoning challenge for the recent TRIP benchmark (23-32% absolute improvement on Tasks 2-3).", "track": "Semantics: Lexical, Sentence level, Textual Inference and Other areas", "label": 8, "url": "https://www.semanticscholar.org/reader/fee5088cc8242189f298be604114e8b8e9f7ce28?experiments=&features=reader_skimming%3Atrue"}, {"loc": [6.280261039733887, 12.314812660217285], "id": 3548, "title": "Late Fusion with Triplet Margin Objective for Multimodal Ideology Prediction and Analysis", "authors": "Changyuan Qiu, Winston Wu, Xinliang Frederick Zhang and Lu Wang", "abstract": "Prior work on ideology prediction has largely focused on single modalities, i.e., text or images. In this work, we introduce the task of multimodal ideology prediction, where a model predicts binary or five-point scale ideological leanings, given a text-image pair with political content. We first collect five new large-scale datasets with English documents and images along with their ideological leanings, covering news articles from a wide range of mainstream media in US and social media posts from Reddit and Twitter. We conduct in-depth analyses on news articles and reveal differences in image content and usage across the political spectrum. Furthermore, we perform extensive experiments and ablation studies, demonstrating the effectiveness of targeted pretraining objectives on different model components. Our best-performing model, a late-fusion architecture pretrained with a triplet objective over multimodal content, outperforms the state-of-the-art text-only model by almost 4% and a strong multimodal baseline with no pretraining by over 3%.", "track": "Ethic Concerns:Sentiment Analysis, Stylistic Analysis, and Argument Mining", "label": 16, "url": "https://www.semanticscholar.org/reader/9272a06ea006171f34d29d46319230438fd531a7?experiments=&features=reader_skimming%3Atrue"}, {"loc": [3.1196937561035156, 4.853527545928955], "id": 3552, "title": "Leveraging QA Datasets to Improve Generative Data Augmentation", "authors": "Dheeraj Mekala, Tu Vu, Timo Schick and Jingbo Shang", "abstract": "The ability of generative language models (GLMs) to generate text has improved considerably in the last few years, enabling their use for generative data augmentation. In this work, we propose CONDA, an approach to further improve GLM's ability to generate synthetic data by reformulating data generation as context generation for a given question-answer (QA) pair and leveraging QA datasets for training context generators. Then, we cast downstream tasks into the same question answering format and adapt the fine-tuned context generators to the target task domain. Finally, we use the fine-tuned GLM to generate relevant contexts, which are in turn used as synthetic training data for their corresponding tasks. We perform extensive experiments on multiple classification datasets and demonstrate substantial improvements in performance for both few- and zero-shot settings. Our analysis reveals that QA datasets that require high-level reasoning abilities (e.g., abstractive and common-sense QA datasets) tend to give the best boost in performance in both few-shot and zero-shot settings.", "track": "Efficient Methods for NLP", "label": 12, "url": "https://www.semanticscholar.org/reader/889045714af6c2e9c187dd5347f1b308447edcc9?experiments=&features=reader_skimming%3Atrue"}, {"loc": [8.76574993133545, 8.01485538482666], "id": 3561, "title": "Meta-Learning Fast Weight Language Models", "authors": "Kevin Clark, Kelvin Guu, Ming-Wei Chang, Panupong Pasupat, Geoffrey Hinton and Mohammad Norouzi", "abstract": "Dynamic evaluation of language models (LMs) adapts model parameters at test time using gradient information from previous tokens and substantially improves LM performance. However, it requires over 3x more compute than standard inference. We present Fast Weight Layers (FWLs), a neural component that provides the benefits of dynamic evaluation much more efficiently by expressing gradient updates as linear attention. A key improvement over dynamic evaluation is that FWLs can also be applied at training time, so the model learns to make good use of gradient updates. FWLs can easily be added on top of existing transformer models, require relatively little extra compute or memory to run, and significantly improve language modeling perplexity.", "track": "Efficient Methods for NLP", "label": 12, "url": ""}, {"loc": [7.351504325866699, 7.093067169189453], "id": 3565, "title": "CTL++: Evaluating Generalization on Never-Seen Compositional Patterns of Known Functions, and Compatibility of Neural Representations", "authors": "R\u00f3bert Csord\u00e1s, Kazuki Irie and Juergen Schmidhuber", "abstract": "Well-designed diagnostic tasks have played a key role in studying the failure of neural nets (NNs) to generalize systematically. Famous examples include SCAN and Compositional Table Lookup (CTL). Here we introduce CTL++, a new diagnostic dataset based on compositions of unary symbolic functions. While the original CTL is used to test length generalization or productivity, CTL++ is designed to test systematicity of NNs, that is, their capability to generalize to unseen compositions of known functions. CTL++ splits functions into groups and tests performance on group elements composed in a way not seen during training. We show that recent CTL-solving Transformer variants fail on CTL++. The simplicity of the task design allows for fine-grained control of task difficulty, as well as many insightful analyses. For example, we measure how much overlap between groups is needed by tested NNs for learning to compose. We also visualize how learned symbol representations in outputs of functions from different groups are compatible in case of success but not in case of failure. These results provide insights into failure cases reported on more complex compositions in the natural language domain. Our code is public.", "track": "Machine Learning for NLP", "label": 3, "url": "https://www.semanticscholar.org/reader/b1f33e956e36bf25e118c0d537dcc519cfe52e60?experiments=&features=reader_skimming%3Atrue"}, {"loc": [3.8445467948913574, 9.875969886779785], "id": 3568, "title": "Learning with Rejection for Abstractive Text Summarization", "authors": "Meng Cao, Yue Dong, Jingyi He and Jackie Chi Kit Cheung", "abstract": "State-of-the-art abstractive summarization systems frequently hallucinate content that is not supported by the source document, mainly due to noise in the training dataset.\nExisting methods opt to drop the noisy samples or tokens from the training set entirely, reducing the effective training set size and creating an artificial propensity to copy words from the source. \nIn this work, we propose a training objective for abstractive summarization based on rejection learning, in which the model learns whether or not to reject potentially noisy tokens. We further propose a regularized decoding objective that penalizes non-factual candidate summaries during inference by using the rejection probability learned during training.\nWe show that our method considerably improves the factuality of generated summaries in automatic and human evaluations when compared to five baseline models, and that it does so while increasing the abstractiveness of the generated summaries.", "track": "Summarization", "label": 14, "url": ""}, {"loc": [7.621102333068848, 7.825701713562012], "id": 3573, "title": "Adaptive Label Smoothing with Self-Knowledge in Natural Language Generation", "authors": "Dongkyu Lee, Ka Chun Cheung and Nevin L. Zhang", "abstract": "Overconfidence has been shown to impair generalization and calibration of a neural network. Previous studies remedy this issue by adding a regularization term to a loss function, preventing a model from making a peaked distribution. Label smoothing smoothes target labels with a pre-defined prior label distribution; as a result, a model is learned to maximize the likelihood of predicting the soft label. Nonetheless, the amount of smoothing is the same in all samples and remains fixed in training. In other words, label smoothing does not reflect the change in probability distribution mapped by a model over the course of training. To address this issue, we propose a regularization scheme that brings dynamic nature into the smoothing parameter by taking model probability distribution into account, thereby varying the parameter per instance. A model in training self-regulates the extent of smoothing on the fly during forward propagation. Furthermore, inspired by recent work in bridging label smoothing and knowledge distillation, our work utilizes self-knowledge as a prior label distribution in softening target labels, and presents theoretical support for the regularization effect by knowledge distillation and the dynamic smoothing parameter. Our regularizer is validated comprehensively, and the result illustrates marked improvements in model generalization and calibration, enhancing robustness and trustworthiness of a model.", "track": "Machine Learning for NLP", "label": 3, "url": "https://www.semanticscholar.org/reader/40b0d9e116c46bd8d6813712f013c54c2790c17c?experiments=&features=reader_skimming%3Atrue"}, {"loc": [7.767879009246826, 7.770246505737305], "id": 3581, "title": "Hard Gate Knowledge Distillation - Leverage Calibration for Robust and Reliable Language Model", "authors": "Dongkyu Lee, Zhiliang Tian, Yingxiu Zhao, Ka Chun Cheung and Nevin L. Zhang", "abstract": "In knowledge distillation, a student model is trained with supervisions from both knowledge from a teacher and observations drawn from a training data distribution. Knowledge of a teacher is considered a subject that holds inter-class relations which send a meaningful supervision to a student; hence, much effort has been put to find such knowledge to be distilled. In this paper, we explore a question that has been given little attention: \"when to distill such knowledge.\" The question is answered in our work with the concept of model calibration; we view a teacher model not only as a source of knowledge but also as a gauge to detect miscalibration of a student. This simple and yet novel view leads to a hard gate knowledge distillation scheme that switches between learning from a teacher model and training data. We verify the gating mechanism in the context of natural language generation at both the token-level and the sentence-level. Empirical comparisons with strong baselines show that hard gate knowledge distillation not only improves model generalization, but also significantly lowers model calibration error.", "track": "Natural Language Generation", "label": 6, "url": "https://www.semanticscholar.org/reader/0514444cd3564a7d7a561c4e5851c854000adb9f?experiments=&features=reader_skimming%3Atrue"}, {"loc": [5.960874557495117, 5.220243453979492], "id": 3596, "title": "Are All Spurious Features in Natural Language Alike? An Analysis through a Causal Lens", "authors": "Nitish Joshi, Xiang Pan and He He", "abstract": "The term \u2018spurious correlations' has been used in NLP to informally denote any undesirable feature-label correlations. However, a correlation can be undesirable because (i) the feature is irrelevant to the label (e.g. punctuation in a review), or (ii) the feature's effect on the label depends on the context (e.g. negation words in a review), which is ubiquitous in language tasks. In case (i), we want the model to be invariant to the feature, which is neither necessary nor sufficient for prediction. But in case (ii), even an ideal model (e.g. humans) must rely on the feature, since it is necessary (but not sufficient) for prediction. Therefore, a more fine-grained treatment of spurious features is needed to specify the desired model behavior. We formalize this distinction using a causal model and probabilities of necessity and sufficiency, which delineates the causal relations between a feature and a label. We then show that this distinction helps explain results of existing debiasing methods on different spurious features, and demystifies surprising results such as the encoding of spurious features in model representations after debiasing.", "track": "Interpretability, Interactivity and Analysis of Models for NLP", "label": 9, "url": "https://www.semanticscholar.org/reader/b135144dd8853b7c515f15da1ce943a5be789c1e?experiments=&features=reader_skimming%3Atrue"}, {"loc": [3.9087600708007812, 9.773994445800781], "id": 3602, "title": "Correcting Diverse Factual Errors in Abstractive Summarization via Post-Editing and Language Model Infilling", "authors": "Vidhisha Balachandran, Hannaneh Hajishirzi, William Cohen and Yulia Tsvetkov", "abstract": "Abstractive summarization models often generate inconsistent summaries containing factual errors or hallucinated content. Recent works focus on correcting factual errors in generated summaries via post-editing. Such correction models are trained using adversarial non-factual summaries constructed using heuristic rules for injecting errors. However, generating non-factual summaries using heuristics often does not generalize well to actual model errors. In this work, we propose to generate hard, representative synthetic examples of non-factual summaries through infilling language models. With this data, we train a more robust fact-correction model to post-edit the summaries to improve factual consistency. Through quantitative and qualitative experiments on two popular summarization datasets--- CNN/DM and XSum---we show that our approach vastly outperforms prior methods in correcting  erroneous summaries. Our model---FactEdit---improves factuality scores by over ~11 points \non CNN/DM and over ~31 points on XSum on average across multiple summarization models, producing more factual summaries while maintaining competitive summarization quality.", "track": "Summarization", "label": 14, "url": ""}, {"loc": [6.900367259979248, 9.903382301330566], "id": 3621, "title": "Coordinated Topic Modeling", "authors": "Pritom Saha Akash, Jie Huang and Kevin Chang", "abstract": "We propose a new problem called coordinated topic modeling that imitates human behavior while describing a text corpus. It considers a set of well-defined topics like the axes of a semantic space with a reference representation. It then uses the axes to model a corpus for easily understandable representation. This new task helps represent a corpus more interpretably by reusing existing knowledge and benefits the corpora comparison task. We design ECTM, an embedding-based coordinated topic model that effectively uses the reference representation to capture the target corpus-specific aspects while maintaining each topic's global semantics. In ECTM, we introduce the topic- and document-level supervision with a self-training mechanism to solve the problem. Finally, extensive experiments on multiple domains show the superiority of our model over other baselines.", "track": "Information Retrieval and Text Mining", "label": 15, "url": "https://www.semanticscholar.org/reader/20aa75f5ca65e4b11d4285d00ed4945e59a5b38c?experiments=&features=reader_skimming%3Atrue"}, {"loc": [1.8579953908920288, 3.9646143913269043], "id": 3627, "title": "Large Dual Encoders Are Generalizable Retrievers", "authors": "Jianmo Ni, Chen Qu, Jing Lu, Zhuyun Dai, Gustavo Hernandez Abrego, Ji Ma, Vincent Zhao, Yi Luan, Keith Hall, Ming-Wei Chang and Yinfei Yang", "abstract": "It has been shown that dual encoders trained on one domain often fail to generalize to other domains for retrieval tasks. One widespread belief is that the bottleneck layer of a dual encoder, where the final score is simply a dot-product between a query vector and a passage vector, is too limited compared to models with fine-grained interactions between the query and the passage. In this paper, we challenge this belief by scaling up the size of the dual encoder model {\\em while keeping the bottleneck layer as a single dot-product with a fixed size.} With multi-stage training, scaling up the model size brings significant improvement on a variety of retrieval tasks, especially for out-of-domain generalization. We further analyze the impact of the bottleneck layer and demonstrate diminishing improvement when scaling up the embedding size. Experimental results show that our dual encoders, \\textbf{G}eneralizable \\textbf{T}5-based dense \\textbf{R}etrievers (GTR), outperform previous sparse and dense retrievers on the BEIR dataset significantly. Most surprisingly, our ablation study finds that GTR is very data efficient, as it only needs 10\\% of MS Marco supervised data to match the out-of-domain performance of using all supervised data.", "track": "Information Retrieval and Text Mining", "label": 15, "url": "https://www.semanticscholar.org/reader/9f2cf7b35224aad3a8d261e4456fe2d65a5f5d3e?experiments=&features=reader_skimming%3Atrue"}, {"loc": [5.51492977142334, 11.582144737243652], "id": 3631, "title": "CRIPP-VQA: Counterfactual Reasoning about Implicit Physical Properties via Video Question Answering", "authors": "Maitreya Patel, Tejas Gokhale, Chitta Baral and Yezhou Yang", "abstract": "Videos often capture objects, their visible properties, their motion, and the interactions between different objects. Objects also have physical properties such as mass, which the imaging pipeline is unable to directly capture. However, these properties can be estimated by utilizing cues from relative object motion and the dynamics introduced by collisions. In this paper, we introduce CRIPP-VQA, a new video question answering dataset for reasoning about the implicit physical properties of objects in a scene. CRIPP-VQA contains videos of objects in motion, annotated with questions that involve counterfactual reasoning about the effect of actions, questions about planning in order to reach a goal, and descriptive questions about visible properties of objects. The CRIPP-VQA test set enables evaluation under several out-of-distribution settings -- videos with objects with masses, coefficients of friction, and initial velocities that are not observed in the training distribution. Our experiments reveal a surprising and significant performance gap in terms of answering questions about implicit properties (the focus of this paper) and explicit properties of objects (the focus of prior work).", "track": "Resources and Evaluation", "label": 1, "url": "https://www.semanticscholar.org/reader/e881cc29a647bf5f0c9edcbd710ef56e3e2b2a7a?experiments=&features=reader_skimming%3Atrue"}, {"loc": [0.8489496111869812, 8.135937690734863], "id": 3641, "title": "Entity-centered Cross-document Relation Extraction", "authors": "Fengqi Wang, Fei Li, Hao Fei, Jingye Li, Shengqiong Wu, Fangfang Su, Wenxuan Shi, Donghong Ji and Bo Cai", "abstract": "Relation Extraction (RE) is a fundamental task of information extraction, which has attracted a large amount of research attention. Previous studies focus on extracting the relations within a sentence or document, while currently researchers begin to explore cross-document RE. However, current cross-document RE methods directly utilize text snippets surrounding target entities in multiple given documents, which brings considerable noisy and non-relevant sentences. Moreover, they utilize all the text paths in a document bag in a coarse-grained way, without considering the connections between these text paths.In this paper, we aim to address both of these shortages and push the state-of-the-art for cross-document RE. First, we focus on input construction for our RE model and propose an entity-based document-context filter to retain useful information in the given documents by using the bridge entities in the text paths. Second, we propose a cross-document RE model based on cross-path entity relation attention, which allow the entity relations across text paths to interact with each other. We compare our cross-document RE method with the state-of-the-art methods in the dataset CodRED. Our method outperforms them by at least  10% in F1, thus demonstrating its effectiveness.", "track": "Information Extraction", "label": 5, "url": ""}, {"loc": [10.884037017822266, 6.772087097167969], "id": 3642, "title": "Exploring Document-Level Literary Machine Translation with Parallel Paragraphs from World Literature", "authors": "Katherine Thai, Marzena Karpinska, Kalpesh Krishna, Bill Ray, Moira Inghilleri, John Wieting and Mohit Iyyer", "abstract": "Literary translation is a culturally significant task, but it is bottlenecked by the small number of qualified literary translators relative to the many untranslated works published around the world. Machine translation (MT) holds potential to complement the work of human translators by improving both training procedures and their overall efficiency. Literary translation is less constrained than more traditional MT settings since translators must balance meaning equivalence, readability, and critical interpretability in the target language. This property, along with the complex discourse-level context present in literary texts, also makes literary MT more challenging to computationally model and evaluate. To explore this task, we collect a dataset (Par3) of non-English language novels in the public domain, each aligned at the paragraph level to both human and automatic English translations. Using Par3, we discover that expert literary translators prefer reference human translations over machine-translated paragraphs at a rate of 84\\%, while state-of-the-art automatic MT metrics do not correlate with those preferences. The experts note that MT outputs contain not only mistranslations, but also discourse-disrupting errors and stylistic inconsistencies. To address these problems, we train a post-editing model whose output is preferred over normal MT output at a rate of 69% by experts. We publicly release Par3 to spur future research into literary MT.", "track": "Resources and Evaluation", "label": 1, "url": "https://www.semanticscholar.org/reader/671e84e7001bdc590281009e5f83072342c7d8b3?experiments=&features=reader_skimming%3Atrue"}, {"loc": [9.314061164855957, 6.698742389678955], "id": 3654, "title": "Label-aware Multi-level Contrastive Learning for Cross-lingual Spoken Language Understanding", "authors": "Shining Liang, Linjun Shou, Jian Pei, Ming Gong, Wanli Zuo, Xianglin Zuo and Daxin Jiang", "abstract": "Despite the great success of spoken language understanding (SLU) in high-resource languages, it remains challenging in low-resource languages mainly due to the lack of labeled training data. The recent multilingual code-switching approach achieves better alignments of model representations across languages by constructing a mixed-language context in zero-shot cross-lingual SLU. However, current code-switching methods are limited to implicit alignment and disregard the inherent semantic structure in SLU, i.e., the hierarchical inclusion of utterances, slots and words. In this paper, we propose to model the utterance-slot-word structure by a multi-level contrastive learning framework at the utterance, slot and word levels to facilitate explicit alignment. Novel code-switching schemes are introduced to generate hard negative examples for our contrastive learning framework. Furthermore, we develop a label-aware joint model leveraging label semantics to enhance the implicit alignment and feed to contrastive learning. Our experimental results show that our proposed methods significantly improve the performance compared with the strong baselines on two zero-shot cross-lingual SLU benchmark datasets.", "track": "Multilinguality", "label": 13, "url": "https://www.semanticscholar.org/reader/c8eb8822f70f48d025119bd2b274d1bd4f595730?experiments=&features=reader_skimming%3Atrue"}, {"loc": [9.016339302062988, 6.935932636260986], "id": 3658, "title": "Polyglot Prompt: Multilingual Multitask Prompt Training", "authors": "Jinlan Fu, See-Kiong Ng and Pengfei Liu", "abstract": "This paper aims for a potential architectural improvement for multilingual learning and asks: Can different tasks from different languages be modeled in a monolithic framework, i.e. without any task/language-specific module? The benefit of achieving this could open new doors for future multilingual research, including allowing systems trained on low resources to be further assisted by other languages as well as other tasks. We approach this goal by developing a learning framework named Polyglot Prompting to exploit prompting methods for learning a unified semantic space for different languages and tasks with multilingual prompt engineering. We performed a comprehensive evaluation of 6 tasks, namely topic classification, sentiment classification, named entity recognition, question answering, natural language inference, and summarization, covering 24 datasets and 49 languages. The experimental results demonstrated the efficacy of multilingual multitask prompt-based learning and led to inspiring observations. We also present an interpretable multilingual evaluation methodology and show how the proposed framework, multilingual multitask prompt training, works. We release all datasets prompted in the best setting and code.", "track": "Multilinguality", "label": 13, "url": "https://www.semanticscholar.org/reader/15437760a28d528bb1b76794aa4b1d15e7ba2a16?experiments=&features=reader_skimming%3Atrue"}, {"loc": [5.006961345672607, 12.456103324890137], "id": 3672, "title": "VisToT: Vision-Augmented Table-to-Text Generation", "authors": "Prajwal Gatti, Anand Mishra, Manish Gupta and Mithun Das Gupta", "abstract": "Table-to-text generation has been widely studied in the Natural Language Processing community in the recent years. We give a new perspective to this problem by incorporating signals from both tables as well as associated images to generate relevant text. While tables contain a structured list of facts, images are a rich source of unstructured visual information. For example, in the tourism domain, images can be used to infer knowledge such as the type of landmark (e.g., church), its architecture (e.g., Ancient Roman), and composition (e.g., white marble). Therefore, in this paper, we introduce the novel task of Vision-augmented Table-To-Text Generation (VisToT, defined as follows: given a table and an associated image, produce a descriptive sentence conditioned on the multimodal input. For the task, we present a novel multimodal table-to-text dataset, WikiLandmarks, covering 73,084 unique world landmarks. Further, we also present a competitive architecture, namely, VT3 that generates accurate sentences conditioned on the image and table pairs. Through extensive analyses and experiments, we show that visual cues from images are helpful in (i) inferring missing information from incomplete or sparse tables, and (ii) strengthening the importance of useful information from noisy tables for natural language generation. We make the code and data publicly available.", "track": "Natural Language Generation", "label": 6, "url": ""}, {"loc": [4.619162082672119, 5.92115592956543], "id": 3676, "title": "Generative Entity-to-Entity Stance Detection with Knowledge Graph Augmentation", "authors": "Xinliang Frederick Zhang, Nick Beauchamp and Lu Wang", "abstract": "Stance detection is typically framed as predicting the sentiment in a given text towards a target entity. However, this setup overlooks the importance of the source entity, i.e., who is expressing the opinion. In this paper, we emphasize the imperative need for studying interactions among entities when inferring stances. We first introduce a new task, entity-to-entity (E2E) stance detection, which primes models to identify entities in their canonical names and discern stances jointly. To support this study, we curate a new dataset with 10,641 annotations labeled at the sentence level from news articles of different ideological leanings. We present a novel generative framework to allow the generation of canonical names for entities as well as stances among them. We further enhance the model with a graph encoder to summarize entity activities and external knowledge surrounding the entities. Experiments show that our model outperforms strong comparisons by large margins. Further analyses demonstrate the usefulness of E2E stance detection for understanding media quotation and stance landscape as well as inferring entity ideology.", "track": "Sentiment Analysis, Stylistic Analysis, and Argument Mining", "label": 16, "url": "https://www.semanticscholar.org/reader/2f09e6722eea9be4f80b4ff6bb66469a09c2fc98?experiments=&features=reader_skimming%3Atrue"}, {"loc": [5.673434734344482, 6.2658257484436035], "id": 3694, "title": "Symptom Identification for Interpretable Detection of Multiple Mental Disorders on Social Media", "authors": "Zhiling Zhang, Siyuan Chen, Mengyue Wu and Kenny Zhu", "abstract": "Mental disease detection (MDD) from social media has suffered from poor generalizability and \ninterpretability, due to lack of symptom modeling. This paper introduces PsySym, the first annotated symptom identification corpus of multiple psychiatric disorders, to facilitate further research progress. PsySym is annotated according to a knowledge graph of the 38 symptom classes related to 7 mental diseases complied from established clinical manuals and scales, and a novel annotation framework for diversity and quality. Experiments show that symptom-assisted MDD enabled by PsySym can outperform strong pure-text baselines. We also exhibit the convincing MDD explanations provided by symptom predictions with case studies, and point to their further potential applications.", "track": "Sentiment Analysis, Stylistic Analysis, and Argument Mining", "label": 16, "url": "https://www.semanticscholar.org/reader/3979f023b328c766c9ef3e1174a84a23619fedec?experiments=&features=reader_skimming%3Atrue"}, {"loc": [6.043289661407471, 8.350300788879395], "id": 3713, "title": "Improving Iterative Text Revision by Learning Where to Edit from Other Revision Tasks", "authors": "Zae Myung Kim, Wanyu Du, Vipul Raheja, Dhruv Kumar and Dongyeop Kang", "abstract": "Iterative text revision improves text quality by fixing grammatical errors, rephrasing for better readability or contextual appropriateness, or reorganizing sentence structures throughout a document.\nMost recent research has focused on understanding and classifying different types of edits in the iterative revision process from human-written text instead of building accurate and robust systems for iterative text revision.\nIn this work, we aim to build an end-to-end text revision system that can iteratively generate helpful edits by explicitly detecting editable spans (where-to-edit) with their corresponding edit intents and then instructing a revision model to revise the detected edit spans.\nLeveraging datasets from other related text editing NLP tasks, combined with the specification of editable spans, leads our system to more accurately model the process of iterative text refinement, as evidenced by empirical results and human evaluations.\nOur system significantly outperforms previous baselines on our text revision tasks and other standard text revision tasks, including grammatical error correction, text simplification, sentence fusion, and style transfer.\nThrough extensive qualitative and quantitative analysis, we make vital connections between edit intentions and writing quality, and better computational modeling of iterative text revisions.", "track": "Natural Language Generation", "label": 6, "url": ""}, {"loc": [2.438755750656128, 4.692685604095459], "id": 3716, "title": "CONQRR: Conversational Query Rewriting for Retrieval with Reinforcement Learning", "authors": "Zeqiu Wu, Yi Luan, Hannah Rashkin, David Reitter, Hannaneh Hajishirzi, Mari Ostendorf and Gaurav Singh Tomar", "abstract": "Compared to standard retrieval tasks, passage retrieval for conversational question answering (CQA) poses new challenges in understanding the current user question, as each question needs to be interpreted within the dialogue context. Moreover, it can be expensive to re-train well-established retrievers such as search engines that are originally developed for non-conversational queries. To facilitate their use, we develop a query rewriting model CONQRR that rewrites a conversational question in the context into a standalone question. It is trained with a novel reward function to directly optimize towards retrieval using reinforcement learning and can be adapted to any off-the-shelf retriever. CONQRR achieves state-of-the-art results on a recent open-domain CQA dataset containing conversations from three different sources, and is effective for two different off-the-shelf retrievers. Our extensive analysis also shows the robustness of CONQRR to out-of-domain dialogues as well as to zero query rewriting supervision.", "track": "Dialogue and Interactive Systems", "label": 4, "url": ""}, {"loc": [10.37282943725586, 7.03346061706543], "id": 3735, "title": "Specializing Multi-domain NMT via Penalizing Low Mutual Information", "authors": "Jiyoung Lee, Hantae Kim, Hyunchang Cho, Edward Choi and Cheonbok Park", "abstract": "Multi-domain Neural Machine Translation (NMT) trains a single model with multiple domains. It is appealing because of its efficacy in handling multiple domains within one model. An ideal multi-domain NMT learns distinctive domain characteristics simultaneously, however, grasping the domain peculiarity is a non-trivial task. In this paper, we investigate domain-specific information through the lens of mutual information (MI) and propose a new objective that penalizes low MI to become higher.Our method achieved the state-of-the-art performance among the current competitive multi-domain NMT models. Also, we show our objective promotes low MI to be higher resulting in domain-specialized multi-domain NMT.", "track": "Machine Translation", "label": 10, "url": "https://www.semanticscholar.org/reader/a3949033c9bc075d34e5c9aa9c7a49f763b295b0?experiments=&features=reader_skimming%3Atrue"}, {"loc": [2.763380527496338, 7.11945915222168], "id": 3736, "title": "A Simple Contrastive Learning Framework for Interactive Argument Pair Identification via Argument-Context Extraction", "authors": "Lida Shi, fausto giunchiglia, Rui Song, daqian Shi, Tongtong Liu, Xiaolei Diao and Hao Xu", "abstract": "Interactive argument pair identification is an emerging research task for argument mining, aiming to identify whether two arguments are interactively related. It is pointed out that the context of the argument is essential to improve identification performance. However, current context-based methods achieve limited improvements since the entire context typically contains much irrelevant information. In this paper, we propose a simple contrastive learning framework to solve this problem by extracting valuable information from the context. This framework can construct hard argument-context samples and obtain a robust and uniform representation by introducing contrastive learning. We also propose an argument-context extraction module to enhance information extraction by discarding irrelevant blocks. The experimental results show that our method achieves the state-of-the-art performance on the benchmark dataset. Further analysis demonstrates the effectiveness of our proposed modules and visually displays more compact semantic representations.", "track": "Sentiment Analysis, Stylistic Analysis, and Argument Mining", "label": 16, "url": ""}, {"loc": [4.9890265464782715, 5.880360126495361], "id": 3743, "title": "Sentence-level Media Bias Analysis Informed by Discourse Structures", "authors": "Yuanyuan Lei, Ruihong Huang, Lu Wang and Nick Beauchamp", "abstract": "As polarization continues to rise among both the public and the news media, increasing attention has been devoted to detecting media bias. Most recent work in the NLP community, however, identify bias at the level of individual articles. However, each article itself comprises multiple sentences, which vary in their ideological bias. In this paper, we aim to identify sentences within an article that can illuminate and explain the overall bias of the entire article. We show that understanding the discourse role of a sentence in telling a news story, as well as its relation with nearby sentences, can reveal the ideological leanings of an author even when the sentence itself appears merely neutral. In particular, we consider using a functional news discourse structure and PDTB discourse relations to inform bias sentence identification, and distill the auxiliary knowledge from the two types of discourse structure into our bias sentence identification system. Experimental results on benchmark datasets show that incorporating both the global functional discourse structure and local rhetorical discourse relations can effectively increase the recall of bias sentence identification by 8.27% - 8.62%, as well as increase the precision by 2.82% - 3.48%.", "track": "Computational Social Science and Cultural Analytics", "label": 20, "url": ""}, {"loc": [4.046543121337891, 7.578782081604004], "id": 3755, "title": "Towards Efficient Dialogue Pre-training with Transferable and Interpretable Latent Structure", "authors": "Xueliang Zhao, Lemao Liu, Tingchen Fu, Shuming Shi, Dongyan Zhao and Rui Yan", "abstract": "With the availability of massive general-domain dialogue data, pre-trained dialogue generation appears to be super appealing to transfer knowledge from the general domain to downstream applications. In most existing work, such transferable ability is mainly obtained by fitting a large model with hundreds of millions of parameters on massive data in an exhaustive way, leading to inefficient running and poor interpretability. This paper proposes a novel dialogue generation model with a latent structure that is easily transferable from the general domain to downstream tasks in a lightweight and transparent way. Experiments on two benchmarks validate the effectiveness of the proposed model. Thanks to the transferable latent structure, our model is able to yield better dialogue responses than four strong baselines in terms of both automatic and human evaluations, and our model with about 22% parameters particularly delivers a 5x speedup in running time compared with the strongest baseline. Moreover, the proposed model is explainable by interpreting the discrete latent variables.", "track": "Dialogue and Interactive Systems", "label": 4, "url": "https://www.semanticscholar.org/reader/e13c88ebe339573f01251e68a8e5def84b6651a8?experiments=&features=reader_skimming%3Atrue"}, {"loc": [7.450122356414795, 7.52590274810791], "id": 3770, "title": "An Empirical Revisiting of Linguistic Knowledge Fusion in Language Understanding Tasks", "authors": "Changlong Yu, Tianyi Xiao, Lingpeng Kong, Yangqiu Song and Wilfred Ng", "abstract": "Though linguistic knowledge emerges during large-scale language model pretraining, recent work attempt to explicitly incorporate human-defined linguistic priors into task-specific fine-tuning. Infusing language models with syntactic or semantic knowledge from parsers has shown improvements on many language understanding tasks. To further investigate the effectiveness of structural linguistic priors, we conduct empirical study of replacing parsed graphs or trees with trivial ones (rarely carrying linguistic knowledge e.g., balanced tree) for tasks in the GLUE benchmark. Encoding with trivial graphs achieves competitive or even better performance in fully-supervised and few-shot settings. It reveals that the gains might not be significantly attributed to explicit linguistic priors but rather to more feature interactions brought by fusion layers. Hence we call for attention to using trivial graphs as necessary baselines to design advanced knowledge fusion methods in the future.", "track": "Semantics: Lexical, Sentence level, Textual Inference and Other areas", "label": 8, "url": "https://www.semanticscholar.org/reader/511e69bfa4213442e0afa35d7bbc503aa5d93405?experiments=&features=reader_skimming%3Atrue"}, {"loc": [7.856321334838867, 3.4646196365356445], "id": 3772, "title": "Unsupervised Non-transferable Text Classification", "authors": "Guangtao Zeng and Wei Lu", "abstract": "Training a good deep learning model requires substantial data and computing resources, which makes the resulting neural model a valuable intellectual property. To prevent the neural network from being undesirably exploited, non-transferable learning has been proposed to reduce the model generalization ability in specific target domains. However, existing approaches require labeled data for the target domain which can be difficult to obtain. Furthermore, they do not have the mechanism to still recover the model's ability to access the target domain.\nIn this paper, we propose a novel unsupervised non-transferable learning method for the text classification task that does not require annotated target domain data. We further introduce a secret key component in our approach for recovering the access to the target domain, where we design both an explicit and an implicit method for doing so. Extensive experiments demonstrate the effectiveness of our approach.", "track": "NLP Applications", "label": 0, "url": "https://www.semanticscholar.org/reader/3f901a4d05cff66d0582bca5a798f2cf9936eef0?experiments=&features=reader_skimming%3Atrue"}, {"loc": [6.381520748138428, 12.14233684539795], "id": 3783, "title": "Adaptive Contrastive Learning on Multimodal Transformer for Review Helpfulness Prediction", "authors": "Thong Nguyen, Xiaobao Wu, Anh Tuan Luu, Zhen Hai and Lidong Bing", "abstract": "Modern Review Helpfulness Prediction systems are dependent upon multiple modalities, typically texts and images. Unfortunately, those contemporary approaches pay scarce attention to polish representations of cross-modal relations and tend to suffer from inferior optimization. This might cause harm to model's predictions in numerous cases. To overcome the aforementioned issues, we propose Multi-modal Contrastive Learning for Multimodal Review Helpfulness Prediction (MRHP) problem, concentrating on mutual information between input modalities to explicitly elaborate cross-modal relations. In addition, we introduce Adaptive Weighting scheme for our contrastive learning approach in order to increase flexibility in optimization. Lastly, we propose Multimodal Interaction module to address the unalignment nature of multimodal data, thereby assisting the model in producing more reasonable multimodal representations. Experimental results show that our method outperforms prior baselines and achieves state-of-the-art results on two publicly available benchmark datasets for MRHP problem.", "track": "Speech, Vision, Robotics, Multimodal Grounding", "label": 7, "url": "https://www.semanticscholar.org/reader/c28d44774cca23cbaf9e9fcb8fb76e13c09260d9?experiments=&features=reader_skimming%3Atrue"}, {"loc": [10.06380844116211, 6.84252405166626], "id": 3792, "title": "Adaptive Token-level Cross-lingual Feature Mixing for Multilingual Neural Machine Translation", "authors": "Junpeng Liu, Kaiyu Huang, Jiuyi Li, Huan Liu, Jinsong Su and Degen Huang", "abstract": "Multilingual neural machine translation aims to translate multiple language pairs in a single model and has shown great success thanks to the knowledge transfer across languages with the shared parameters. Despite promising, this share-all paradigm suffers from insufficient ability to capture language-specific features. Currently, the common practice is to insert or search language-specific networks to balance the shared and specific features. However, those two types of features are not sufficient enough to model the complex commonality and divergence across languages, such as the locally shared features among similar languages, which leads to sub-optimal transfer, especially in massively multilingual translation. In this paper, we propose a novel token-level feature mixing method that enables the model to capture different features and dynamically determine the feature sharing across languages. Based on the observation that the tokens in the multilingual model are usually shared by different languages, we we insert a feature mixing layer into each Transformer sublayer and model each token representation as a mix of different features, with a proportion indicating its feature preference. In this way, we can perform fine-grained feature sharing and achieve better multilingual transfer. Experimental results on multilingual datasets show that our method outperforms various strong baselines and can be extended to zero-shot translation. Further analyses reveal that our method can capture different linguistic features and bridge the representation gap across languages.", "track": "Machine Translation", "label": 10, "url": ""}, {"loc": [0.6801319122314453, 7.780095100402832], "id": 3794, "title": "A Dataset for Hyper-Relational Extraction and a Cube-Filling Approach", "authors": "Yew Ken Chia, Lidong Bing, Sharifah Mahani Aljunied, Luo Si and Soujanya Poria", "abstract": "Relation extraction has the potential for large-scale knowledge graph construction, but current methods do not consider the qualifier attributes for each relation triplet, such as time, quantity or location. The qualifiers form hyper-relational facts which better capture the rich and complex knowledge graph structure. For example, the relation triplet (Leonard Parker, Educated At, Harvard University) can be factually enriched by including the qualifier (End Time, 1967). Hence, we propose the task of hyper-relational extraction to extract more specific and complete facts from text. To support the task, we construct HyperRED, a large-scale and general-purpose dataset. Existing models cannot perform hyper-relational extraction as it requires a model to consider the interaction between three entities. Hence, we propose CubeRE, a cube-filling model inspired by table-filling approaches and explicitly considers the interaction between relation triplets and qualifiers. To improve model scalability and reduce negative class imbalance, we further propose a cube-pruning method. Our experiments show that CubeRE outperforms strong baselines and reveal possible directions for future research. Our code and data are available at github.com/declare-lab/HyperRED.", "track": "Resources and Evaluation", "label": 1, "url": ""}, {"loc": [6.189095973968506, 12.562711715698242], "id": 3796, "title": "Low-resource Neural Machine Translation with Cross-modal Alignment", "authors": "Zhe Yang, Qingkai Fang and Yang Feng", "abstract": "How to achieve neural machine translation with limited parallel data? Existing techniques often rely on large-scale monolingual corpus, which is impractical for some low-resource languages. In this paper, we turn to connect several low-resource languages to a particular high-resource one by additional visual modality. Specifically, we propose a cross-modal contrastive learning method to learn a shared space for all languages, where both a coarse-grained sentence-level objective and a fine-grained token-level one are introduced. Experimental results and further analysis show that our method can effectively learn the cross-modal and cross-lingual alignment with a small amount of image-text pairs, and achieves significant improvements over the text-only baseline under both zero-shot and few-shot scenarios.", "track": "Machine Translation", "label": 10, "url": "https://www.semanticscholar.org/reader/2108f664b992e8f3be4ad376f172aca29b33e31e?experiments=&features=reader_skimming%3Atrue"}, {"loc": [8.050834655761719, 8.721470832824707], "id": 3798, "title": "Prompt-based Distribution Alignment for Domain Generalization in Text Classification", "authors": "Chen Jia and Yue Zhang", "abstract": "Prompt-based learning (a.k.a. prompting) achieves high performance by bridging the gap between the objectives of language modeling and downstream tasks. Domain generalization ability can be improved by prompting since classification across different domains can be unified into the prediction of the same set of label words. The remaining challenge for domain generalization by prompting comes from discrepancies between the data distribution of different domains. To improve domain generalization with prompting, we learn distributional invariance across source domains via two alignment regularization loss functions. The first is vocabulary distribution alignment, which uses a Kullback-Leibler divergence regularization on source-domain vocabulary distributions. The second is feature distribution alignment, which uses a novel adversarial training strategy to learn domain invariant representation across source domains. Experiments on sentiment analysis and natural language inference show the effectiveness of our method and achieve state-of-the-art results on six datasets.", "track": "Sentiment Analysis, Stylistic Analysis, and Argument Mining", "label": 16, "url": ""}, {"loc": [3.466515302658081, 4.555367946624756], "id": 3842, "title": "Two is Better than Many? Binary Classification as an Effective Approach to Multi-Choice Question Answering", "authors": "Deepanway Ghosal, Navonil Majumder, Rada Mihalcea and Soujanya Poria", "abstract": "We propose a simple refactoring of multi-choice question answering (MCQA) tasks as a series of binary classifications. The MCQA task is generally performed by scoring each (question, answer) pair normalized over all the pairs, and then selecting the answer from the pair that yield the highest score. For n answer choices, this is equivalent to an n-class classification setup where only one class (true answer) is correct. We instead show that classifying (question, true answer) as positive instances and (question, false answer) as negative instances is significantly more effective across various models and datasets. We show the efficacy of our proposed approach in different tasks -- abductive reasoning, commonsense question answering, science question answering, and sentence completion. Our DeBERTa binary classification model reaches the top or close to the top performance on public leaderboards for these tasks. The source code of the proposed approach is available at https://github.com/declare-lab/TEAM.", "track": "Commonsense Reasoning", "label": 19, "url": "https://www.semanticscholar.org/reader/40e3cd767c9520171ac8ecbd2e27f3a1bf043b61?experiments=&features=reader_skimming%3Atrue"}, {"loc": [3.7342336177825928, 9.956724166870117], "id": 3845, "title": "HEGEL: Hypergraph Transformer for Long Document Summarization", "authors": "Haopeng Zhang, Xiao Liu and Jiawei Zhang", "abstract": "Extractive summarization for long documents is challenging due to the extended structured input context. The long-distance sentence dependency hinders cross-sentence relations modeling, the critical step of extractive summarization. This paper proposes HEGEL, a hypergraph neural network for long document summarization by capturing high-order cross-sentence relations. HEGEL updates and learns effective sentence representations with hypergraph transformer layers and fuses different types of sentence dependencies, including latent topics, keywords coreference, and section structure. We validate HEGEL by conducting extensive experiments on two benchmark datasets, and experimental results demonstrate the effectiveness and efficiency of HEGEL.", "track": "Summarization", "label": 14, "url": "https://www.semanticscholar.org/reader/1df0d9c553aee087fe3a7dd1c5f9e03556eb1fe4?experiments=&features=reader_skimming%3Atrue"}, {"loc": [8.202272415161133, 8.762166023254395], "id": 3848, "title": "Adapting a Language Model While Preserving its General Knowledge", "authors": "Zixuan Ke, Yijia Shao, Haowei Lin, Hu Xu, Lei Shu and Bing Liu", "abstract": "Domain-adaptive pre-training (or DA-training for short), also known as post-training, aims\nto train a pre-trained general-purpose language model (LM) using an unlabeled corpus of a\nparticular domain to adapt the LM so that end-tasks in the domain can give improved performances. However, existing DA-training methods are in some sense blind as they do not explicitly identify what knowledge in the LM should be preserved and what should be changed by the domain corpus. This paper shows that the existing methods are suboptimal and proposes a novel method to perform a more informed adaptation of the knowledge in the LM by (1) soft-masking the attention heads based on their importance to best preserve the general knowledge in the LM and (2) contrasting the representations of the general and the full (both general and domain knowledge) to learn an integrated representation with both general and domain-specific knowledge. Experimental results will demonstrate the effectiveness of the proposed approach.", "track": "Language Modeling and Analysis of Language Models", "label": 2, "url": ""}, {"loc": [3.8815696239471436, 9.929330825805664], "id": 3850, "title": "Human Guided Exploitation of Interpretable Attention Patterns in Summarization and Topic Segmentation", "authors": "Raymond Li, Wen Xiao, Linzi Xing, Lanjun Wang, Gabriel Murray and Giuseppe Carenini", "abstract": "The multi-head self-attention mechanism of the transformer model has been thoroughly investigated recently. In one vein of study, researchers are interested in understanding why and how transformers work. In another vein, researchers propose new attention augmentation methods to make transformers more accurate, efficient and interpretable. In this paper, we combine these two lines of research in a human-in-the-loop pipeline to first discover important task-specific attention patterns. Then those patterns are injected, not only to smaller models, but also to the original model. The benefits of our pipeline and discovered patterns are demonstrated in two case studies with extractive summarization and topic segmentation. After discovering interpretable patterns in BERT-based models fine-tuned for the two downstream tasks, experiments indicate that when we inject the patterns into attention heads, the models show considerable improvements in accuracy and efficiency.", "track": "Interpretability, Interactivity and Analysis of Models for NLP", "label": 9, "url": "https://www.semanticscholar.org/reader/571469045c49877f78a4522f7f21e8c30e2f5c89?experiments=&features=reader_skimming%3Atrue"}, {"loc": [8.120949745178223, 9.335439682006836], "id": 3858, "title": "Continual Training of Language Models for Few-Shot Learning", "authors": "Zixuan Ke, Haowei Lin, Yijia Shao, Hu Xu, Lei Shu and Bing Liu", "abstract": "Recent work on applying large language models (LMs) achieves impressive performance in many NLP applications. Adapting or posttraining an LM using an unlabeled domain corpus can produce even better performance for end-tasks in the domain. This paper proposes the problem of continually extending an LM by incrementally post-train the LM with a sequence of unlabeled domain corpora to expand its knowledge without forgetting its previous skills. The goal is to improve the few-shot end-task learning in these domains. The resulting system is called CPT (Continual PostTraining), which to our knowledge, is the first continual post-training system. Experimental results verify its effectiveness.", "track": "Machine Learning for NLP", "label": 3, "url": "https://www.semanticscholar.org/reader/e053be7f36a0772b68eaaa14f15650c14071e4ab?experiments=&features=reader_skimming%3Atrue"}, {"loc": [8.04325008392334, 9.715804100036621], "id": 3877, "title": "Dictionary-Assisted Supervised Contrastive Learning", "authors": "Patrick Y. Wu, Richard Bonneau, Joshua Tucker and Jonathan Nagler", "abstract": "Text analysis in the social sciences often involves using specialized dictionaries to reason with abstract concepts, such as perceptions about the economy or abuse on social media. These dictionaries allow researchers to impart domain knowledge and note subtle usages of words relating to a concept(s) of interest. We introduce the dictionary-assisted supervised contrastive learning (DASCL) objective, allowing researchers to leverage specialized dictionaries when fine-tuning pretrained language models. The text is first keyword simplified: a common, fixed token replaces any word in the corpus that appears in the dictionary(ies) relevant to the concept of interest. During fine-tuning, a supervised contrastive objective draws closer the embeddings of the original and keyword-simplified texts of the same class while pushing further apart the embeddings of different classes. The keyword-simplified texts of the same class are more textually similar than their original text counterparts, which additionally draws the embeddings of the same class closer together. Combining DASCL and cross-entropy improves classification performance metrics in few-shot learning settings and social science applications compared to using cross-entropy alone and alternative contrastive and data augmentation methods.", "track": "Computational Social Science and Cultural Analytics", "label": 20, "url": "https://www.semanticscholar.org/reader/441c3a6e37d0b8dda0b00effda7552f3bc71d92a?experiments=&features=reader_skimming%3Atrue"}, {"loc": [8.573674201965332, 7.906438827514648], "id": 3888, "title": "Fine-Tuning Pre-trained Transformers into Decaying Fast Weights", "authors": "Huanru Henry Mao", "abstract": "Autoregressive Transformers are strong language models but incur O(T) complexity during per-token generation due to the self-attention mechanism. Recent work proposes kernel-based methods to approximate causal self-attention by replacing it with recurrent formulations with various update rules and feature maps to achieve O(1) time and memory complexity. We explore these approaches and find that they are unnecessarily complex, and propose a simple alternative - decaying fast weights - that runs fast on GPU, outperforms prior methods, and retains 99% of attention's performance for GPT-2. We also show competitive performance on WikiText-103 against more complex attention substitutes.", "track": "Language Modeling and Analysis of Language Models", "label": 2, "url": "https://www.semanticscholar.org/reader/f6d8beb02771791d628f7e0773d8906261ce707c?experiments=&features=reader_skimming%3Atrue"}, {"loc": [9.666714668273926, 6.312001705169678], "id": 3891, "title": "PRO-CS : An Instance-Based Prompt Composition Technique for Code-Switched Tasks", "authors": "SRIJAN BANSAL, Suraj Tripathi, Sumit Agarwal, Teruko Mitamura and Eric Nyberg", "abstract": "Code-switched (CS) data is ubiquitous in today's globalized world, but the dearth of annotated datasets in code-switching poses a significant challenge for learning diverse tasks across different language pairs. Parameter-efficient prompt-tuning approaches conditioned on frozen language models have shown promise for transfer learning in limited-resource setups. In this paper, we propose a novel instance-based prompt composition technique, PRO-CS, for CS tasks that combine language and task knowledge. We compare our approach with prompt-tuning and fine-tuning for code-switched tasks on 10 datasets across 4 language pairs. Our model outperforms the prompt-tuning approach by significant margins across all datasets and outperforms or remains at par with fine-tuning by using just 0.18% of total parameters. We also achieve competitive results when compared with the fine-tuned model in the low-resource cross-lingual and cross-task setting, indicating the effectiveness of our approach to incorporate new code-switched tasks.", "track": "Multilinguality", "label": 13, "url": ""}, {"loc": [3.865253210067749, 9.926995277404785], "id": 3906, "title": "SentBS: Sentence-level Beam Search for Controllable Summarization", "authors": "Chenhui Shen, Liying Cheng, Lidong Bing, Yang You and Luo Si", "abstract": "A wide range of control perspectives have been explored in controllable text generation. Structure-controlled summarization is recently proposed as a useful and interesting research direction. However, current structure-controlling methods have limited effectiveness in enforcing the desired structure. To address this limitation, we propose a sentence-level beam search generation method (SentBS), where evaluation is conducted throughout the generation process to select suitable sentences for subsequent generations. We experiment with different combinations of decoding methods to be used as sub-components by SentBS and evaluate results on the structure-controlled dataset MReD. Experiments show that all explored combinations for SentBS can improve the agreement between the generated text and the desired structure, with the best method significantly reducing the structural discrepancies suffered by the existing model, by approximately 68%.", "track": "Summarization", "label": 14, "url": ""}, {"loc": [8.11849594116211, 3.0038015842437744], "id": 3925, "title": "A Fine-grained Chinese Software Privacy Policy Dataset for Sequence Labeling and Regulation Compliant Identification", "authors": "Kaifa Zhao, Le Yu, Shiyao Zhou, Jing Li, Xiapu Luo, Yat Fei Aemon Chiu and Yutong Liu", "abstract": "Privacy protection raises great attention on both legal levels and user awareness. To protect user privacy, countries enact laws and regulations requiring software privacy policies to regulate their behavior. However, privacy policies are written in professional languages with many legal terms and software jargon that prevent users from understanding and even reading them. It is necessary and urgent to use NLP techniques to analyze privacy policies. However, existing datasets ignore law requirements and are limited to English. In this paper, we construct the first Chinese privacy policy dataset, namely CA4P-483, to facilitate the sequence labeling tasks and regulation compliance identification between privacy policies and software. Our dataset includes 483 Chinese Android application privacy policies, over 11K sentences, and 52K fine-grained annotations. We evaluate families of robust and representative baseline models on our dataset. Based on baseline performance, we provide findings and potential research directions on our dataset. Finally, we investigate the potential applications of CA4P-483 combing regulation requirements and program analysis.", "track": "Resources and Evaluation", "label": 1, "url": ""}, {"loc": [2.3505373001098633, 4.523759841918945], "id": 3926, "title": "Saving Dense Retriever from Shortcut Dependency in Conversational Search", "authors": "Sungdong Kim and Gangwoo Kim", "abstract": "Conversational search (CS) needs a holistic understanding of conversational inputs to retrieve relevant passages. In this paper, we demonstrate the existence of a \\textit{retrieval shortcut} in CS, which causes models to retrieve passages solely relying on partial history while disregarding the latest question. With in-depth analysis, we first show that naively trained dense retrievers heavily exploit the shortcut and hence perform poorly when asked to answer history-independent questions. To build more robust models against shortcut dependency, we explore various hard negative mining strategies. Experimental results show that training with the model-based hard negatives effectively mitigates the dependency on the shortcut, significantly improving dense retrievers on recent CS benchmarks. In particular, our retriever outperforms the previous state-of-the-art model by 11.0 in Recall@10 on QReCC.", "track": "Information Retrieval and Text Mining", "label": 15, "url": "https://www.semanticscholar.org/reader/c2f9a27ab32bff87573e31594c97742af90f11b2?experiments=&features=reader_skimming%3Atrue"}, {"loc": [1.672010064125061, 5.309196949005127], "id": 3929, "title": "Graph-Induced Transformers for Efficient Multi-Hop Question Answering", "authors": "Giwon Hong, Jeonghwan Kim, Junmo Kang and Sung-Hyon Myaeng", "abstract": "A graph is a suitable data structure to represent the structural information of text. Recently, multi-hop question answering (MHQA) tasks, which require inter-paragraph/sentence linkages, have come to exploit such properties of a graph. Previous approaches to MHQA relied on leveraging the graph information along with the pre-trained language model (PLM) encoders. However, this trend exhibits the following drawbacks: (i) sample inefficiency while training in a low-resource setting; (ii) lack of reusability due to changes in the model structure or input. Our work proposes the Graph-Induced Transformer (GIT) that applies graph-derived attention patterns directly into a PLM, without the need to employ external graph modules. GIT can leverage the useful inductive bias of graphs while retaining the unperturbed Transformer structure and parameters. Our experiments on HotpotQA successfully demonstrate both the sample efficient characteristic of GIT and its capacity to replace the graph modules while preserving model performance.", "track": "Question Answering", "label": 11, "url": ""}, {"loc": [4.8394341468811035, 3.405543565750122], "id": 3930, "title": "DiscoSense: Commonsense Reasoning with Discourse Connectives", "authors": "Prajjwal Bhargava and Vincent Ng", "abstract": "We present DiscoSense, a benchmark for commonsense reasoning via understanding a wide variety of discourse connectives. We generate compelling distractors in DiscoSense using Conditional Adversarial Filtering, an extension of Adversarial Filtering that employs conditional generation. We show that state-of-the-art pre-trained language models struggle to perform well on DiscoSense, which makes this dataset ideal for evaluating next-generation commonsense reasoning systems.", "track": "Resources and Evaluation", "label": 1, "url": "https://www.semanticscholar.org/reader/1a5f48161df983a0e9485425495121201902433b?experiments=&features=reader_skimming%3Atrue"}, {"loc": [0.6899417042732239, 7.923322677612305], "id": 3933, "title": "Boosting Document-Level Relation Extraction by Mining and Injecting Logical Rules", "authors": "Shengda Fan, Shasha Mo and Jianwei Niu", "abstract": "Document-level relation extraction (DocRE) aims at extracting relations of all entity pairs in a document. A key challenge to DocRE lies in the complex interdependency between the relations of entity pairs. Unlike most prior efforts focusing on implicitly powerful representations, the recently proposed LogiRE (Ru et al., 2021) explicitly captures the interdependency by learning logical rules. However, LogiRE requires extra parameterized modules to reason merely after training backbones, and this disjointed optimization of backbones and extra modules may lead to sub-optimal results. In this paper, we propose MILR, a logic enhanced framework that boosts DocRE by Mining and Injecting Logical Rules. MILR first mines logical rules from annotations based on frequencies. Then in training, consistency regularization\nis leveraged as an auxiliary loss to penalize instances that violate mined rules. Finally, MILR infers from a global perspective based on integer programming. Compared with LogiRE, MILR does not introduce extra parameters and injects logical rules during both training and inference. Extensive experiments on two benchmarks demonstrate that MILR not only improves the relation extraction performance (1.1%-3.8% F1) but also makes predictions more logically consistent (over 4.5% Logic). More importantly, MILR also consistently outperforms LogiRE on both counts. Code is available at https://github.com/XingYing-stack/MILR.", "track": "Information Extraction", "label": 5, "url": ""}, {"loc": [5.069385051727295, 8.885894775390625], "id": 3937, "title": "MOCHA: A Multi-Task Training Approach for Coherent Text Generation from Cognitive Perspective", "authors": "Zhe Hu, Hou Pong Chan and Lifu Huang", "abstract": "Teaching neural models to generate narrative coherent texts is a critical problem. Recent pre-trained language models have achieved promising results, but there is still a gap between human written texts and machine-generated outputs. In this work, we propose a novel multi-task training strategy for long text generation grounded on the cognitive theory of writing, which empowers the model to learn essential subskills needed for writing including planning and reviewing besides end-to-end generation. \nWe extensively evaluate our model on three open-ended generation tasks including story generation, news article writing and argument generation. Experiments show that our model achieves better results on both few-shot and fully-supervised settings than strong baselines, and human evaluations confirm that our model can generate more coherent outputs.", "track": "Natural Language Generation", "label": 6, "url": "https://www.semanticscholar.org/reader/ffa0032150e2edf21633b6a6867b54ea121cb9d9?experiments=&features=reader_skimming%3Atrue"}, {"loc": [6.484869480133057, 9.078019142150879], "id": 3942, "title": "Variational Autoencoder with Disentanglement Priors for Low-Resource Task-Specific Natural Language Generation", "authors": "Zhuang Li, Lizhen Qu, Qiongkai Xu, Tongtong Wu, Tianyang Zhan and Gholamreza Haffari", "abstract": "In this paper, we propose a variational autoencoder with disentanglement priors, VAE-Dprior, for task-specific natural language generation with none or a handful of task-specific labeled examples. In order to tackle compositional generalization across tasks, our model performs disentangled representation learning by introducing a conditional prior for the latent content space and another conditional prior for the latent label space. Both types of priors satisfy a novel property called $\\epsilon$-disentangled. We show both empirically and theoretically that the novel priors can disentangle representations even without specific regularizations as in the prior work. The content prior enables directly sampling diverse content representations from the content space learned from the seen tasks, and fuse them with the representations of novel tasks for generating semantically diverse texts in the low-resource settings. Our extensive experiments demonstrate the superior performance of our model over competitive baselines in terms of i) data augmentation in continuous zero/few-shot learning, and ii) text style transfer in the few-shot setting.", "track": "Machine Learning for NLP", "label": 3, "url": ""}, {"loc": [5.967228889465332, 12.417194366455078], "id": 3946, "title": "CISLR: Corpus for Indian Sign Language Recognition", "authors": "Abhinav Joshi, Ashwani Bhat, Pradeep S, Priya Gole, Shashwat Gupta, Shreyansh Agarwal and Ashutosh Modi", "abstract": "Indian Sign Language, though used by a diverse community, still lacks well-annotated resources for developing systems that would enable sign language processing. In recent years researchers have actively worked for sign languages like American Sign Languages, however, Indian Sign language is still far from data-driven tasks like machine translation. To address this gap, in this paper, we introduce a new dataset CISLR (Corpus for Indian Sign Language Recognition) for word-level recognition in Indian Sign Language using videos. The corpus has a large vocabulary of around  4700 words covering different topics and domains. Further, we propose a baseline model for word recognition from sign language videos. To handle the low resource problem in the Indian Sign Language, the proposed model consists of a prototype-based one-shot learner that leverages resource rich American Sign Language to learn generalized features for improving predictions in Indian Sign Language. Our experiments show that gesture features learned in another sign language can help perform one-shot predictions in CISLR.", "track": "Resources and Evaluation", "label": 1, "url": ""}, {"loc": [10.80941104888916, 9.3197660446167], "id": 3951, "title": "Mask the Correct Tokens: An Embarrassingly Simple Approach for Error Correction", "authors": "Kai Shen, Yichong Leng, Xu Tan, Siliang Tang, Yuan Zhang, Wenjie Liu and Edward Lin", "abstract": "Text error correction aims to correct the errors in text sequences such as those typed by humans or generated by speech recognition models.\nPrevious error correction methods usually take the source (incorrect) sentence as encoder input and generate the target (correct) sentence through the decoder. Since the error rate of the incorrect sentence is usually low (e.g., 10\\%), the correction model can only learn to correct on limited error tokens but trivially copy on most tokens (correct tokens), which harms the effective training of error correction. In this paper, we argue that the correct tokens should be better utilized to facilitate effective training and then propose a simple yet effective masking strategy to achieve this goal.\nSpecifically, we randomly mask out a part of the correct tokens in the source sentence and let the model learn to not only correct the original error tokens but also predict the masked tokens based on their context information. Our method enjoys several advantages: 1) it alleviates trivial copy; 2) it leverages effective training signals from correct tokens; 3) it is a plug-and-play module and can be applied to different models and tasks. Experiments on spelling error correction and speech recognition error correction on Mandarin datasets and grammar error correction on English datasets with both autoregressive and non-autoregressive generation models show that our method improves the correction\naccuracy consistently.", "track": "NLP Applications", "label": 0, "url": ""}, {"loc": [8.0003080368042, 9.69007682800293], "id": 3953, "title": "AMAL: Meta Knowledge-Driven Few-Shot Adapter Learning", "authors": "S. K. Hong and Tae Young Jang", "abstract": "NLP has advanced greatly together with the proliferation of Transformer-based pre-trained language models. To adapt to a downstream task, the pre-trained language models need to be fine-tuned with a sufficient supply of annotated examples. In recent years, Adapter-based fine-tuning methods have expanded the applicability of pre-trained language models by substantially lowering the required amount of annotated examples. However, existing Adapter-based methods still fail to yield meaningful results in the few-shot regime where only a few annotated examples are provided. In this study, we present a meta-learning-driven low-rank adapter pooling method, called AMAL, for leveraging pre-trained language models even with just a few data points. We evaluate our method on five text classification benchmark datasets. The results show that AMAL significantly outperforms previous few-shot learning methods and achieves a new state-of-the-art.", "track": "Efficient Methods for NLP", "label": 12, "url": ""}, {"loc": [6.883059978485107, 6.2786688804626465], "id": 3956, "title": "Discourse Context Predictability Effects in Hindi Word Order", "authors": "Sidharth Ranjan, Marten van Schijndel, Sumeet Agarwal and Rajakrishnan Rajkumar", "abstract": "We test the hypothesis that discourse predictability influences Hindi syntactic choice. While prior work has shown that a number of factors (e.g., information status, dependency length, and syntactic surprisal) influence Hindi word order preferences, the role of discourse predictability is underexplored in the literature. Inspired by prior work on syntactic priming, we investigate how the words and syntactic structures in a sentence influence the word order of the following sentences. Specifically, we extract sentences from the Hindi-Urdu Treebank corpus (HUTB), permute the preverbal constituents of those sentences, and build a classifier to predict which sentences actually occurred in the corpus against artificially generated distractors. The classifier uses a number of discourse-based features and cognitive features to make its predictions, including dependency length, surprisal, and information status. We find that information status and LSTM-based discourse predictability influence word order choices, especially for non-canonical object-fronted orders. We conclude by situating our results within the broader syntactic priming literature.", "track": "Linguistic Theories, Cognitive Modeling and Psycholinguistics", "label": 22, "url": "https://www.semanticscholar.org/reader/26674f055f75c494f3e39913a5f986f6e74bba29?experiments=&features=reader_skimming%3Atrue"}, {"loc": [5.22320032119751, 5.23854398727417], "id": 3970, "title": "\"Covid vaccine is against Covid but Oxford vaccine is made at Oxford!\" Semantic Interpretation of Proper Noun Compounds", "authors": "Keshav Kolluru, Gabriel Stanovsky and Mausam", "abstract": "Proper noun compounds, e.g., \"Covid vaccine\", convey information in a succinct manner (a \"Covid vaccine\" is a \"vaccine that immunizes against the Covid disease\"). These are commonly used in short-form domains, such as news headlines, but are largely ignored in information-seeking applications. To address this limitation, we release a new manually annotated dataset, ProNCI, consisting of 22.5K proper noun compounds along with their free-form semantic interpretations. ProNCI is 60 times larger than prior noun compound datasets and also includes non-compositional examples, which have not been previously explored. We experiment with various neural models for automatically generating the semantic interpretations from proper noun compounds, ranging from few-shot prompting to supervised learning, with varying degrees of knowledge about the constituent nouns. We find that adding targeted knowledge, particularly about the common noun, results in performance gains of upto 2.8%. Finally, we integrate our model generated interpretations with an existing Open IE system and observe an 7.5% increase in yield at a precision of 85%. The dataset and code are available at https://github.com/dair-iitd/pronci.", "track": "Information Extraction", "label": 5, "url": "https://www.semanticscholar.org/reader/33285e02758788b681754d283df20971fef6e31f?experiments=&features=reader_skimming%3Atrue"}, {"loc": [6.933262825012207, 6.333314895629883], "id": 3981, "title": "Context Limitations Make Neural Language Models More Human-Like", "authors": "Tatsuki Kuribayashi, Yohei Oseki, Ana Brassard and Kentaro Inui", "abstract": "Language models (LMs) have been used in cognitive modeling as well as engineering studies---they compute information-theoretic complexity metrics that simulate humans' cognitive load during reading.\nThis study highlights a limitation of modern neural LMs as the model of choice for this purpose: there is a discrepancy between their context access capacities and that of humans.\nOur results showed that constraining the LMs' context access improved their simulation of human reading behavior.\nWe also showed that LM-human gaps in context access were associated with specific syntactic constructions; incorporating syntactic biases into LMs' context access might enhance their cognitive plausibility.", "track": "Linguistic Theories, Cognitive Modeling and Psycholinguistics", "label": 22, "url": ""}, {"loc": [2.8015122413635254, 7.134524822235107], "id": 3983, "title": "A Generative Model for End-to-End Argument Mining with Reconstructed Positional Encoding and Constrained Pointer Mechanism", "authors": "Jianzhu Bao, Yuhang He, Yang Sun, Bin Liang, Jiachen Du, Bing Qin, Min Yang and Ruifeng Xu", "abstract": "Argument mining (AM) is a challenging task as it requires recognizing the complex argumentation structures involving multiple subtasks.\nTo handle all subtasks of AM in an end-to-end fashion, previous works generally transform AM into a dependency parsing task.\nHowever, such methods largely require complex pre- and post-processing to realize the task transformation.\nIn this paper, we investigate the end-to-end AM task from a novel perspective by proposing a generative framework, in which the expected outputs of AM are framed as a simple target sequence. \nThen, we employ a pre-trained sequence-to-sequence language model with a constrained pointer mechanism (CPM) to model the clues for all the subtasks of AM in the light of the target sequence. Furthermore, we devise a reconstructed positional encoding (RPE) to alleviate the order biases induced by the autoregressive generation paradigm.\nExperimental results show that our proposed framework achieves new state-of-the-art performance on two AM benchmarks.", "track": "Sentiment Analysis, Stylistic Analysis, and Argument Mining", "label": 16, "url": ""}, {"loc": [4.174262046813965, 7.014216899871826], "id": 3997, "title": "Reflect, Not Reflex: Inference-Based Common Ground Improves Dialogue Response Quality", "authors": "Pei Zhou, Hyundong J. Cho, Pegah Jandaghi, Dong-Ho Lee, Bill Yuchen Lin, Jay Pujara and Xiang Ren", "abstract": "Human communication relies on common ground (CG), the mutual knowledge and beliefs shared by participants, to produce coherent and interesting conversations. In this paper, we demonstrate that current response generation (RG) models produce generic and dull responses in dialogues because they act reflexively, failing to explicitly model CG, both due to the lack of CG in training data and the standard RG training procedure. We introduce Reflect, a dataset that annotates dialogues with explicit CG (materialized as inferences approximating shared knowledge and beliefs) and solicits 9k diverse human-generated responses each following one common ground. Using Reflect, we showcase the limitations of current dialogue data and RG models: less than half of the responses in current data is rated as high quality (sensible, specific, and interesting) and models trained using this data have even lower quality, while most Reflect responses are judged high quality. Next, we analyze whether CG can help models produce better quality responses by using Reflect CG to guide RG models. Surprisingly, we find that simply prompting GPT3 to \"think\" about CG generates 30% more quality responses, showing promising benefits to integrating CG into the RG process.", "track": "Dialogue and Interactive Systems", "label": 4, "url": "https://www.semanticscholar.org/reader/ddbbf78334ef65d412520236e5d9067c82ef8984?experiments=&features=reader_skimming%3Atrue"}, {"loc": [4.272122383117676, 7.322163105010986], "id": 4002, "title": "FlowEval: A Consensus-Based Dialogue Evaluation Framework Using Segment Act Flows", "authors": "Jianqiao Zhao, Yanyang Li, Wanyu Du, Yangfeng Ji, Dong Yu, Michael Lyu and Liwei Wang", "abstract": "Despite recent progress in open-domain dialogue evaluation, how to develop automatic metrics remains an open problem. We explore the potential of dialogue evaluation featuring dialog act information, which was hardly explicitly modeled in previous methods. However, defined at the utterance level in general, dialog act is of coarse granularity, as an utterance can contain multiple segments possessing different functions. Hence, we propose segment act, an extension of dialog act from utterance level to segment level, and crowdsource a large-scale dataset for it. To utilize segment act flows, sequences of segment acts, for evaluation, we develop the first consensus-based dialogue evaluation framework, FlowEval. This framework provides a reference-free approach for dialog evaluation by finding pseudo-references. Extensive experiments against strong baselines on three benchmark datasets demonstrate the effectiveness and other desirable characteristics of our FlowEval, pointing out a potential path for better dialogue evaluation.", "track": "Dialogue and Interactive Systems", "label": 4, "url": "https://www.semanticscholar.org/reader/e0af8f2dd390fabcdf2c373640833efc62faa530?experiments=&features=reader_skimming%3Atrue"}, {"loc": [5.92603874206543, 12.239973068237305], "id": 4022, "title": "FaD-VLP: Fashion Vision-and-Language Pre-training towards Unified Retrieval and Captioning", "authors": "Suvir Mirchandani, Licheng Yu, Mengjiao Wang, Animesh Sinha, Wenwen Jiang, Tao Xiang and Ning Zhang", "abstract": "Multimodal tasks in the fashion domain have significant potential for e-commerce, but involve challenging vision-and-language learning problems\u2014e.g., retrieving a fashion item given a reference image plus text feedback from a user. Prior works on multimodal fashion tasks have either been limited by the data in individual benchmarks, or have leveraged generic vision-and-language pre-training but have not taken advantage of the characteristics of fashion data. Additionally, these works have mainly been restricted to multimodal understanding tasks. To address these gaps, we make two key contributions. First, we propose a novel fashion-specific pre-training framework based on weakly-supervised triplets constructed from fashion image-text pairs. We show the triplet-based tasks are an effective addition to standard multimodal pre-training tasks. Second, we propose a flexible decoder-based model architecture capable of both fashion retrieval and captioning tasks. Together, our model design and pre-training approach are competitive on a diverse set of fashion tasks, including cross-modal retrieval, image retrieval with text feedback, image captioning, relative image captioning, and multimodal categorization.", "track": "Speech, Vision, Robotics, Multimodal Grounding", "label": 7, "url": "https://www.semanticscholar.org/reader/1cc512fc89651dc4e9a1998447a6693d90b73ee0?experiments=&features=reader_skimming%3Atrue"}, {"loc": [6.141786575317383, 12.412346839904785], "id": 4024, "title": "MM-Align: Learning Optimal Transport-based Alignment Dynamics for Fast and Accurate Inference on Missing Modality Sequences", "authors": "Wei Han, Hui Chen, Min-Yen Kan and Soujanya Poria", "abstract": "Existing multimodal tasks mostly target at the complete input modality setting, i.e., each modality is either complete or completely missing in both training and test sets. However, the randomly missing situations have still been underexplored. In this paper, we present a novel approach named MM-Align to address the missing-modality inference problem. Concretely, we propose 1) an alignment dynamics learning module based on the theory of optimal transport (OT) for missing data imputation; 2) a denoising training algorithm to enhance the quality of imputation as well as the accuracy of model predictions. Compared with previous generative methods which devote to restoring the missing inputs, MM-Align learns to capture and imitate the alignment dynamics between modality sequences. Results of comprehensive experiments on two multimodal tasks empirically demonstrate that our method can perform more accurate and faster inference and alleviate the overfitting issue under different missing conditions.", "track": "Machine Learning for NLP", "label": 3, "url": "https://www.semanticscholar.org/reader/69f4f0d587197a00179637ae9e747f662ada9c38?experiments=&features=reader_skimming%3Atrue"}, {"loc": [3.489875555038452, 4.533748626708984], "id": 4038, "title": "Evaluating the Knowledge Dependency of Questions", "authors": "Hyeongdon Moon, Yoonseok Yang, Hangyeol Yu, Seunghyun Lee, Myeongho Jeong, juneyoung park, Jamin Shin, Minsam Kim and Seungtaek Choi", "abstract": "The automatic generation of Multiple Choice Questions (MCQ) has the potential to reduce the time educators spend on student assessment significantly. However, existing evaluation metrics for MCQ generation, such as BLEU, ROUGE, and METEOR, focus on the n-gram based similarity of the generated MCQ to the gold sample in the dataset and disregard their educational value.\nThey fail to evaluate the MCQ's ability to assess the student's knowledge of the corresponding target fact. To tackle this issue, we propose a novel automatic evaluation metric, coined Knowledge Dependent Answerability (KDA), which measures the MCQ's answerability given knowledge of the target fact. Specifically, we first show how to measure KDA based on student responses from a human survey.\nThen, we propose two automatic evaluation metrics, KDA_disc and KDA_cont, that approximate KDA by leveraging pre-trained language models to imitate students' problem-solving behavior.\nThrough our human studies, we show that KDA_disc and KDA_soft have strong correlations with both (1) KDA and (2) usability in an actual classroom setting, labeled by experts. Furthermore, when combined with n-gram based similarity metrics, KDA_disc and KDA_cont are shown to have a strong predictive power for various expert-labeled MCQ quality measures.", "track": "Resources and Evaluation", "label": 1, "url": ""}, {"loc": [0.4601297080516815, 7.090707778930664], "id": 4044, "title": "MoSE: Modality Split and Ensemble for Multimodal Knowledge Graph Completion", "authors": "Yu Zhao, Xiangrui Cai, Yike Wu, Haiwei Zhang, Ying Zhang, Guoqing Zhao and Ning Jiang", "abstract": "Multimodal knowledge graph completion (MKGC) aims to predict missing entities in MKGs. Previous works usually share relation representation across modalities. This results in mutual interference between modalities during training, since for a pair of entities, the relation from one modality probably contradicts that from another modality. Furthermore, making a unified prediction based on the shared relation representation treats the input in different modalities equally, while their importance to the MKGC task should be different. In this paper, we propose MoSE, a Modality Split representation learning and Ensemble inference framework for MKGC. Specifically, in the training phase, we learn modality-split relation embeddings for each modality instead of a single modality-shared one, which alleviates the modality interference. Based on these embeddings, in the inference phase, we first make modality-split predictions and then exploit various ensemble methods to combine the predictions with different weights, which models the modality importance dynamically. Experimental results on three KG datasets show that MoSE outperforms state-of-the-art MKGC methods. Codes are available at https://github.com/OreOZhao/MoSE4MKGC.", "track": "NLP Applications", "label": 0, "url": ""}, {"loc": [10.188883781433105, 7.005106449127197], "id": 4059, "title": "Entropy-Based Vocabulary Substitution for Incremental Learning in Multilingual Neural Machine Translation", "authors": "Kaiyu Huang, Peng Li, Jin Ma and Yang Liu", "abstract": "In a practical real-world scenario, the longstanding goal is that a universal multilingual translation model can be incrementally updated when new language pairs arrive. Specifically, the initial vocabulary only covers some of the words in new languages, which hurts the translation quality for incremental learning. Although existing approaches attempt to address this issue by replacing the original vocabulary with a rebuilt vocabulary or constructing independent language-specific vocabularies, these methods can not meet the following three demands simultaneously: (1) High translation quality for original and incremental languages, (2) low cost for model training, (3) low time overhead for preprocessing. In this work, we propose an entropy-based vocabulary substitution (EVS) method that just needs to walk through new language pairs for incremental learning in a large-scale multilingual data updating while remaining the size of the vocabulary. Our method has access to learn new knowledge from updated training samples incrementally while keeping high translation quality for original language pairs, alleviating the issue of catastrophic forgetting. Results of experiments show that EVS can achieve better performance and save excess overhead for incremental learning in the multilingual machine translation task.", "track": "Machine Translation", "label": 10, "url": ""}, {"loc": [4.077825546264648, 6.998421669006348], "id": 4070, "title": "Eliciting Knowledge from Large Pre-Trained Models for Unsupervised Knowledge-Grounded Conversation", "authors": "Yanyang Li, Jianqiao Zhao, Michael Lyu and Liwei Wang", "abstract": "Recent advances in large-scale pre-training provide large models with the potential to learn knowledge from the raw text. It is thus natural to ask whether it is possible to leverage these large models as knowledge bases for downstream tasks. In this work, we answer the aforementioned question in unsupervised knowledge-grounded conversation. We explore various methods that best elicit knowledge from large models. Our human study indicates that, though hallucinations exist, large models post the unique advantage of being able to output common sense and summarize facts that cannot be directly retrieved from the search engine. To better exploit such generated knowledge in dialogue generation, we treat the generated knowledge as a noisy knowledge source and propose the posterior-based reweighing as well as the noisy training strategy. Empirical results on two benchmarks show advantages over the state-of-the-art methods.", "track": "Dialogue and Interactive Systems", "label": 4, "url": "https://www.semanticscholar.org/reader/0f7a6c557e376d8c77d684bcda0daee74fc29acf?experiments=&features=reader_skimming%3Atrue"}, {"loc": [7.050638675689697, 5.9171223640441895], "id": 4085, "title": "An Unsupervised, Geometric and Syntax-aware Quantification of Polysemy", "authors": "Anmol Goel, Charu Sharma and Ponnurangam Kumaraguru", "abstract": "Polysemy is the phenomenon where a single word form possesses two or more related senses. It is an extremely ubiquitous part of natural language and analyzing it has sparked rich discussions in the linguistics, psychology and philosophy communities alike. With scarce attention paid to polysemy in computational linguistics, and even scarcer attention toward quantifying polysemy, in this paper, we propose a novel, unsupervised framework to compute and estimate polysemy scores for words in multiple languages. We infuse our proposed quantification with syntactic knowledge in the form of dependency structures. This informs the final polysemy scores of the lexicon motivated by recent linguistic findings that suggest there is an implicit relation between syntax and ambiguity/polysemy. We adopt a graph based approach by computing the discrete Ollivier Ricci curvature on a graph of the contextual nearest neighbors. We test our framework on curated datasets controlling for different sense distributions of words in 3 typologically diverse languages - English, French and Spanish. The effectiveness of our framework is demonstrated by significant correlations of our quantification with expert human annotated language resources like WordNet. We observe a 0.3 point increase in the correlation coefficient as compared to previous quantification studies in English. Our research leverages contextual language models and syntactic structures to empirically support the widely held theoretical linguistic notion that syntax is intricately linked to ambiguity/polysemy.", "track": "Discourse and Pragmatics", "label": 24, "url": ""}, {"loc": [8.320326805114746, 6.569927215576172], "id": 4088, "title": "Reorder and then Parse, Fast and Accurate Discontinuous Constituency Parsing", "authors": "Kailai Sun, Zuchao Li and Hai Zhao", "abstract": "Discontinuous constituency parsing is still kept developing for its efficiency and accuracy are far behind its continuous counterparts. Motivated by the observation that a discontinuous constituent tree can be simply transformed into a pseudo-continuous one by artificially reordering words in the sentence, we propose a novel reordering method, thereby construct fast and accurate discontinuous constituency parsing systems working in continuous way. Specifically, we model the relative position changes of words as a list of actions. By parsing and performing this actions, the corresponding pseudo-continuous sequence is derived. Discontinuous parse tree can be further inferred via integrating a high-performance pseudo-continuous constituency parser. Our systems are evaluated on three classical discontinuous constituency treebanks, achieving new state-of-the-art on two treebanks and showing a distinct advantage in speed.", "track": "Syntax, Parsing and their Applications", "label": 23, "url": ""}, {"loc": [3.4574875831604004, 9.518741607666016], "id": 4102, "title": "Making Science Simple: Corpora for the Lay Summarisation of Scientific Literature", "authors": "Tomas Goldsack, Zhihao Zhang, Chenghua Lin and Carolina Scarton", "abstract": "Lay summarisation aims to jointly summarise and simplify a given text, thus making its content more comprehensible to non-experts.\nAutomatic approaches for lay summarisation can provide significant value in broadening access to scientific literature, enabling a greater degree of both interdisciplinary knowledge sharing and public understanding when it comes to research findings. However, current corpora for this task are limited in their size and scope, hindering the development of broadly applicable data-driven approaches. \nAiming to rectify these issues, we present two novel lay summarisation datasets, PLOS (large-scale) and eLife (medium-scale), each of which contains biomedical journal articles alongside expert-written lay summaries.\nWe provide a thorough characterisation of our lay summaries, \nhighlighting differing levels of readability and abstractiveness\nbetween datasets that can be leveraged to support the needs of different applications.\nFinally, we benchmark our datasets using mainstream summarisation approaches and perform a manual evaluation with domain experts, demonstrating their utility and casting light on the key challenges of this task.", "track": "Resources and Evaluation", "label": 1, "url": "https://www.semanticscholar.org/reader/73bf67f9ac4a28c5618f8df32cb64d810f57a9b9?experiments=&features=reader_skimming%3Atrue"}, {"loc": [5.826259136199951, 5.1483612060546875], "id": 4106, "title": "Looking at the Overlooked: An Analysis on the Word-Overlap Bias in Natural Language Inference", "authors": "Sara Rajaee, Yadollah Yaghoobzadeh and Mohammad Taher Pilehvar", "abstract": "It has been shown that NLI models are usually biased with respect to the word-overlap between the premise and the hypothesis, as they take this feature as a primary cue for predicting the entailment label. \nIn this paper, we focus on an overlooked aspect of the overlap bias in the NLI models: the reverse word-overlap bias. \nOur experimental results demonstrate that current NLI systems are also highly biased towards the non-entailment label on instances with low overlap and that existing debiasing methods, which are reportedly successful on challenge datasets, are generally ineffective in addressing this category of bias.\nThrough a set of analyses, we investigate the reasons for the emergence of the overlap bias and the role of minority examples in mitigating this bias.\nFor the former, we find that the word overlap bias does not stem from pre-training, and in the latter, we observe that in contrast to the accepted assumption, eliminating minority examples does not affect the generalizability of debiasing methods with respect to the overlap bias.", "track": "Semantics: Lexical, Sentence level, Textual Inference and Other areas", "label": 8, "url": "https://www.semanticscholar.org/reader/86ea35528a2b9ed59834c23a5cb0e47c5e6d876d?experiments=&features=reader_skimming%3Atrue"}, {"loc": [8.720785140991211, 8.399993896484375], "id": 4109, "title": "An Empirical Study on the Transferability of Transformer Modules in Parameter-efficient Fine-tuning", "authors": "Mohammad A. Tajari, Sara Rajaee and Mohammad Taher Pilehvar", "abstract": "Parameter-efficient fine-tuning has garnered lots of attention in recent studies.\nOn this subject, we investigate the capability of different transformer modules in transferring knowledge from a pre-trained model to a downstream task. \nOur empirical results suggest that every transformer module is a winning ticket such that fine-tuning the specific module while the rest of the network is frozen achieves a comparable performance to the full fine-tuning case. \nAmong different modules in LMs, LayerNorms exhibit a significant capacity for transfer learning to the extent that with only 0.003% updateable parameters in the layer-wise analysis, they can show acceptable performance on various target tasks.\nWe argue that the performance of LayerNorms could be attributed to their high-magnitude weights compared to other components in a pre-trained model.", "track": "Efficient Methods for NLP", "label": 12, "url": ""}, {"loc": [1.7835698127746582, 3.8761324882507324], "id": 4135, "title": "CODER: An efficient framework for improving retrieval through COntextual Document Embedding Reranking", "authors": "George Zerveas, Navid Rekabsaz, Daniel Cohen and Carsten Eickhoff", "abstract": "Contrastive learning has been the dominant approach to training dense retrieval models. In this work, we investigate the impact of ranking context - an often overlooked aspect of learning dense retrieval models. In particular, we examine the effect of its constituent parts: jointly scoring a large number of negatives per query, using retrieved (query-specific) instead of random negatives, and a fully list-wise loss.\n\nTo incorporate these factors into training, we introduce Contextual Document Embedding Reranking (CODER), a highly efficient retrieval framework. When reranking, it incurs only a negligible computational overhead on top of a first-stage method at run time (approx. 5 ms delay per query), allowing it to be easily combined with any state-of-the-art dual encoder method. Models trained through CODER can also be used as stand-alone retrievers.\n\nEvaluating CODER in a large set of experiments on the MS MARCO and TripClick collections, we show that the contextual reranking of precomputed document embeddings leads to a significant improvement in retrieval performance. This improvement becomes even more pronounced when more relevance information per query is available, shown in the TripClick collection, where we establish new state-of-the-art results by a large margin.", "track": "Information Retrieval and Text Mining", "label": 15, "url": "https://www.semanticscholar.org/reader/6b259f83ca9a23fc0c0f8c53ae1268be16cbf037?experiments=&features=reader_skimming%3Atrue"}, {"loc": [7.674646377563477, 8.559362411499023], "id": 4141, "title": "AdapterShare: Task Correlation Modeling with Adapter Differentiation", "authors": "Zhi Chen, Bei Chen, Lu Chen, Kai Yu and Jian-Guang LOU", "abstract": "Thanks to the development of pre-trained language models, multitask learning (MTL) methods achieve a great success in natural language understanding area.\nHowever, current MTL methods pay more attention to task selection or model design to fuse as much knowledge as possible, while intrinsic task correlation is often neglected. It is important to learn sharing strategy among multiple tasks rather than sharing everything.\n%The MTL model is directly shared among all the tasks. \n%For example, in traditional MTL methods, the last classification layers or the decoder layers are manually separated. More deeply, \nIn this paper, we propose AdapterShare, an adapter differentiation method to explicitly model the task correlation among multiple tasks. AdapterShare is automatically learned based on the gradients on tiny held-out validation data. Compared to single-task learning and fully shared MTL methods, our proposed method obtains obvious performance improvement. Compared to the existing MTL method AdapterFusion, AdapterShare achieves absolute 1.90 average points improvement on five dialogue understanding tasks and 2.33 points gain on NLU tasks.", "track": "Efficient Methods for NLP", "label": 12, "url": ""}, {"loc": [7.705076694488525, 7.960129737854004], "id": 4146, "title": "Rethinking Task-Specific Knowledge Distillation: Contextualized Corpus as Better Textbook", "authors": "Chang Liu, Chongyang Tao, Jianxin Liang, Tao Shen, Jiazhan Feng, Quzhe Huang and Dongyan Zhao", "abstract": "Knowledge distillation has been proven effective when customizing small language models for specific tasks. Here, a corpus as `textbook' plays an indispensable role, only through which the teacher can teach the student. Prevailing methods adopt a two-stage distillation paradigm: general distillation first with task-agnostic general corpus and task-specific distillation next with augmented task-specific corpus. We argue that such a paradigm may not be optimal. In general distillation, it's extravagant to let the diverse but desultory general knowledge overwhelms the limited model capacity of the student. While in task-specific distillation, the task corpus is usually limited and narrow, preventing the student from learning enough knowledge. To mitigate the issues in the two gapped corpora, we present a better textbook for the student to learn: contextualized corpus that contextualizes task corpus with large-scale general corpus through relevance-based text retrieval. Experimental results on GLUE benchmark demonstrate that contextualized corpus is the better textbook compared with jointly using general corpus and augmented task-specific corpus. Surprisingly, it enables task-specific distillation from scratch without general distillation while maintaining comparable performance, making it more flexible to customize the student model with desired model size under various computation constraints.", "track": "Efficient Methods for NLP", "label": 12, "url": ""}, {"loc": [2.0560696125030518, 4.054901599884033], "id": 4154, "title": "Recovering Gold from Black Sand: Multilingual Dense Passage Retrieval with Hard and False Negative Samples", "authors": "Tianhao Shen, Mingtong Liu, Ming Zhou and Deyi Xiong", "abstract": "Negative samples have not been efficiently explored in multilingual dense passage retrieval. In this paper, we propose a novel multilingual dense passage retrieval framework, mHFN, to recover and utilize hard and false negative samples. mHFN consists of three key components: 1) a multilingual hard negative sample augmentation module that allows knowledge of indistinguishable passages to be shared across multiple languages and synthesizes new hard negative samples by interpolating representations of queries and existing hard negative samples,  2) a multilingual negative sample cache queue that stores negative samples from previous batches in each language to increase the number of multilingual negative samples used in training beyond the batch size limit, and 3) a lightweight adaptive false negative sample filter that uses generated pseudo labels to separate unlabeled false negative samples and converts them into positive passages in training. We evaluate mHFN on Mr. TyDi, a high-quality multilingual dense passage retrieval dataset covering eleven typologically diverse languages, and experimental results show that mHFN outperforms strong sparse, dense and hybrid baselines and achieves new state-of-the-art performance on all languages. Our source code is available at https://github.com/Magnetic2014/mHFN.", "track": "Information Retrieval and Text Mining", "label": 15, "url": ""}, {"loc": [5.873255729675293, 5.7732672691345215], "id": 4155, "title": "The \"Problem\u201d of Human Label Variation: On Ground Truth in Data, Modeling and Evaluation", "authors": "Barbara Plank", "abstract": "Human variation in labeling is often considered noise. Annotation projects for machine learning (ML) aim at minimizing human label variation, with the assumption to maximize data quality and in turn optimize and maximize machine learning metrics. However, this\nconventional practice assumes that there exists a *ground truth*, and neglects that there exists genuine human variation in labeling due to disagreement, subjectivity in annotation or multiple plausible answers.\nIn this position paper, we argue that this big open problem of \\textit{human label variation} persists and critically needs more attention to move our field forward. This is because human label variation impacts all stages of the ML pipeline: *data, modeling and evaluation*. However, few works consider all of these dimensions jointly; and existing research is fragmented.  We reconcile different previously proposed notions of human label variation, provide a repository of publicly-available datasets with un-aggregated labels, depict approaches proposed so far, identify gaps and suggest ways forward. As datasets are becoming increasingly available, we hope that this synthesized view on the ``problem'' will lead to an open discussion on possible strategies to devise fundamentally new directions.", "track": "Theme Track", "label": 18, "url": "https://www.semanticscholar.org/reader/aea731e7cf33aa3d482b13f42cedbc1adb3271c6?experiments=&features=reader_skimming%3Atrue"}, {"loc": [10.87709903717041, 6.870487213134766], "id": 4176, "title": "Quality Scoring of Source Words in Neural Translation Models", "authors": "Priyesh Jain, Sunita Sarawagi and Tushar Tomar", "abstract": "Word-level quality scores on input source sentences can provide useful feedback to an end-user when translating into an unfamiliar target language.  Recent approaches either require training special word-scoring models based on synthetic data or require repeated invocation of the translation model. We propose a simple approach based on comparing the difference of probabilities from two language models.  The basic premise of our method is to reason how well each source word is explained by the target sentence as against the source language model.  Our approach provides up to five points higher F1 scores and is significantly faster than the state of the art methods on three language pairs.  Also, our method does not require training any new model.  We release a public dataset on word omissions and mistranslations on a new language pair.", "track": "Machine Translation", "label": 10, "url": ""}, {"loc": [4.682380199432373, 7.255197048187256], "id": 4194, "title": "Pneg: Prompt-based Negative Response Generation for Dialogue Response Selection Task", "authors": "Nyoungwoo Lee, ChaeHun Park, Ho-Jin Choi and Jaegul Choo", "abstract": "In retrieval-based dialogue systems, a response selection model acts as a ranker to select the most appropriate response among several candidates. However, such selection models tend to rely on context-response content similarity, which makes models vulnerable to adversarial responses that are semantically similar but not relevant to the dialogue context. Recent studies have shown that leveraging these adversarial responses as negative training samples is useful for improving the discriminating power of the selection model. Nevertheless, collecting human-written adversarial responses is expensive, and existing synthesizing methods often have limited scalability. To overcome these limitations, this paper proposes a simple but efficient method for generating adversarial negative responses leveraging a large-scale language model. Experimental results on dialogue selection tasks show that our method outperforms other methods of synthesizing adversarial negative responses. These results suggest that our method can be an effective alternative to human annotators in generating adversarial responses. Our code and dataset will be released if the paper is accepted.", "track": "Dialogue and Interactive Systems", "label": 4, "url": ""}, {"loc": [3.816869020462036, 5.820551872253418], "id": 4197, "title": "Facilitating Contrastive Learning of Discourse Relational Senses by Exploiting the Hierarchy of Sense Relations", "authors": "Wanqiu Long and Bonnie Webber", "abstract": "Implicit discourse relation recognition is a challenging task that involves identifying the sense or senses that hold between two adjacent spans of text, in the absense of an explicit connective between them. In both PDTB-2 (prasad et al., 2008)  and PDTB-3  (Webber et al., 2019), discourse relational senses are organized into a three-level hierarchy ranging from four broad top-level senses, to more specific senses below them. Most previous work on implicitf discourse relation recognition have used the sense hierarchy simply to indicate what sense labels were available. Here we do more --- incorporating the sense hierarchy into the recognition process itself and using it to select the negative examples used in contrastive learning. With no additional effort, the approach achieves state-of-the-art performance on the task. Our code is released in\nhttps://github.com/wanqiulong 0923/Contrastive\\_IDRR.", "track": "Discourse and Pragmatics", "label": 24, "url": ""}, {"loc": [7.287219047546387, 7.856777191162109], "id": 4199, "title": "Simplified Graph Learning for Inductive Short Text Classification", "authors": "Kaixin Zheng, Yaqing Wang, Quanming Yao and Dejing Dou", "abstract": "Short text classification (STC) is hard as short texts lack context information and labeled data is not enough. Graph neural networks obtain the state-of-the-art on STC since they can merge various auxiliary information via the message passing framework. However, existing works conduct transductive learning, which requires retraining to accommodate new samples and takes large memory. In this paper, we present SimpleSTC which handles inductive STC problem but only leverages words. We construct word graph from an external large corpus to compensate for the lack of semantic information, and learn text graph to handle the lack of labeled data. Results show that SimpleSTC obtains state-of-the-art performance with lower memory consumption and faster inference speed.", "track": "Machine Learning for NLP", "label": 3, "url": ""}, {"loc": [9.276308059692383, 7.001067161560059], "id": 4202, "title": "Don't Stop Fine-Tuning: On Training Regimes for Few-Shot Cross-Lingual Transfer with Multilingual Language Models", "authors": "Fabian David Schmidt, Ivan Vuli\u0107 and Goran Glava\u0161", "abstract": "A large body of recent work highlights the fallacies of zero-shot cross-lingual transfer (ZS-XLT) with large multilingual language models. Namely, their performance varies substantially for different target languages and is the weakest where needed the most: for low-resource languages distant to the source language. One remedy is few-shot transfer (FS-XLT), where leveraging only a few task-annotated instances in the target language(s) may yield sizable performance gains. However, FS-XLT also succumbs to large variation, as models easily overfit to the small datasets. In this work, we present a systematic study focused on a spectrum of FS-XLT fine-tuning regimes, analyzing key properties such as effectiveness, (in)stability, and modularity. We conduct extensive experiments on both higher-level (NLI, paraphrasing) and lower-level tasks (NER, POS), presenting new FS-XLT strategies that yield both improved and more stable FS-XLT across the board. \nOur findings challenge established FS-XLT methods: e.g., we propose to replace sequential fine-tuning with joint fine-tuning on source and target language instances, offering consistent gains with different number of shots (including resource-rich scenarios). We also show that further gains can be achieved with multi-stage FS-XLT training in which joint multilingual fine-tuning precedes the bilingual source-target specialization.", "track": "Multilinguality", "label": 13, "url": ""}, {"loc": [6.511099338531494, 1.849408745765686], "id": 4226, "title": "Towards Compositional Generalization in Code Search", "authors": "Hojae Han, Seung-won Hwang, Shuai Lu, Nan Duan and Seungtaek Choi", "abstract": "We study compositional generalization, which aims to generalize on unseen combinations of seen structural elements, for code search. Unlike existing approaches of partially pursuing this goal, we study how to extract structural elements, which we name a template that directly targets compositional generalization. Thus we propose CTBERT, or Code Template BERT, representing codes using automatically extracted templates as building blocks. We empirically validate CTBERT on two public code search benchmarks, AdvTest and CSN. Further, we show that templates are complementary to data flow graphs in GraphCodeBERT, by enhancing structural context around variables.", "track": "NLP Applications", "label": 0, "url": ""}, {"loc": [0.848892867565155, 8.112730026245117], "id": 4227, "title": "Towards relation extraction from speech", "authors": "Tongtong Wu, Guitao Wang, Jinming Zhao, Zhaoran Liu, Guilin Qi, Yuan-Fang Li and Gholamreza Haffari", "abstract": "Relation extraction typically aims to extract semantic relationships between entities from the unstructured text.\nOne of the most essential data sources for relation extraction is the spoken language, such as interviews and dialogues.\nHowever, the error propagation introduced in automatic speech recognition (ASR) has been ignored in relation extraction, and the end-to-end speech-based relation extraction method has been rarely explored.\nIn this paper, we propose a new listening information extraction task, i.e.,  speech relation extraction.\nWe construct the training dataset for speech relation extraction via text-to-speech systems, and we construct the testing dataset via crowd-sourcing with native English speakers.\nWe explore speech relation extraction via two approaches: the pipeline approach conducting text-based extraction with a pretrained ASR module, and the end2end approach via a new proposed encoder-decoder model, or what we called SpeechRE.\nWe conduct comprehensive experiments to distinguish the challenges in speech relation extraction, which may shed light on future explorations. We share the code and data on https://github.com/wutong8023/SpeechRE.", "track": "Information Extraction", "label": 5, "url": "https://www.semanticscholar.org/reader/4bdcfb8bc450987c4f91c1cb6598fab04a96cf5c?experiments=&features=reader_skimming%3Atrue"}, {"loc": [4.064045429229736, 7.129462718963623], "id": 4230, "title": "Structural Constraints and Natural Language Inference for End-to-End Flowchart Grounded Dialog Response Generation", "authors": "Dinesh Raghu, Suraj Joshi, Sachindra Joshi and Mausam", "abstract": "Flowchart grounded dialog systems converse with users by following a given flowchart and a corpus of FAQs.  The existing state-of-the-art approach (Raghu et al, 2021) for learning such a dialog system, named FLONET, has two main limitations. (1) It uses a Retrieval Augmented Generation (RAG) framework which represents a flowchart as a bag of nodes. By doing so, it loses the connectivity structure between nodes that can aid in better response generation. (2) Typically dialogs progress with the agent asking polar (Y/N) questions, but users often respond indirectly without the explicit use of polar words.  In such cases, it fails to understand the correct polarity of the answer. To overcome these issues, we propose Structure-Aware FLONET (SA-FLONET) which infuses structural constraints derived from the connectivity structure of flowcharts into the RAG framework. It uses natural language inference to better predict the polarity of indirect Y/N answers. We find that SA-FLONET outperforms FLONET, with a success rate improvement of 68% and 123% in flowchart grounded response generation and zero-shot flowchart grounded response generation tasks respectively.", "track": "Dialogue and Interactive Systems", "label": 4, "url": ""}, {"loc": [1.754991054534912, 9.100829124450684], "id": 4234, "title": "SLICER: Sliced Fine-Tuning for Low-Resource Cross-Lingual Transfer for Named Entity Recognition", "authors": "Fabian David Schmidt, Ivan Vuli\u0107 and Goran Glava\u0161", "abstract": "Large multilingual language models generally demonstrate impressive results in zero-shot cross-lingual transfer, yet often fail to successfully transfer to low-resource languages, even for token-level prediction tasks like named entity recognition (NER). In this work, we introduce a simple yet highly effective approach for improving zero-shot transfer for NER to low-resource languages. We observe that NER fine-tuning in the source language decontextualizes token representations, i.e., tokens increasingly attend to themselves. This increased reliance on token information itself, we hypothesize, triggers a type of overfitting to properties that NE tokens within the source languages share, but are generally not present in NE mentions of target languages. As a remedy, we propose a simple yet very effective sliced fine-tuning for NER (SLICER) that forces stronger token contextualization in the Transformer: we divide the transformed token representations and classifier into disjoint slices that are then independently classified during training. We evaluate SLICER on two standard benchmarks for NER that involve low-resource languages, WikiANN and MasakhaNER, and show that it (i) indeed reduces decontextualization (i.e., extent to which NE tokens attend to themselves), consequently (ii) yielding consistent transfer gains, especially prominent for low-resource target languages distant from the source language.", "track": "Multilinguality", "label": 13, "url": ""}, {"loc": [5.8835883140563965, 8.87955379486084], "id": 4260, "title": "EdgeFormer: A Parameter-Efficient Transformer for On-Device Seq2seq Generation", "authors": "Tao Ge, Si-Qing Chen and Furu Wei", "abstract": "We introduce EdgeFormer -- a parameter-efficient Transformer for on-device seq2seq generation under the strict computation and memory constraints. Compared with the previous parameter-efficient Transformers, EdgeFormer applies two novel principles for cost-effective parameterization, allowing it to perform better given the same parameter budget; moreover, EdgeFormer is further enhanced by layer adaptation innovation that is proposed for improving the network with shared layers.\n\nExtensive experiments show EdgeFormer can effectively outperform previous parameter-efficient Transformer baselines and achieve competitive results under both the computation and memory constraints. Given the promising results, we release EdgeLM -- the pretrained version of EdgeFormer, which is the first publicly available pretrained on-device seq2seq model that can be easily fine-tuned for seq2seq tasks with strong results, facilitating on-device seq2seq generation in practice.", "track": "Efficient Methods for NLP", "label": 12, "url": "https://www.semanticscholar.org/reader/3322426d4d12dc319ca82caf5545527f1783f1db?experiments=&features=reader_skimming%3Atrue"}, {"loc": [5.495899200439453, 12.272038459777832], "id": 4267, "title": "End-to-End Unsupervised Vision-and-Language Pre-training with Referring Expression Matching", "authors": "Chi Chen, Peng Li, Maosong Sun and Yang Liu", "abstract": "Recently there has been an emerging interest in unsupervised vision-and-language pre-training (VLP) that learns multimodal representations without parallel image-caption data. These pioneering works significantly reduce the cost of VLP on data collection and achieve promising results compared to supervised VLP. However, existing unsupervised VLP methods take as input pre-extracted region-based visual features from external object detectors, which both limits flexibility and reduces computational efficiency. In this paper, we explore end-to-end unsupervised VLP with a vision encoder to directly encode images. The vision encoder is pre-trained on image-only data and jointly optimized during multimodal pre-training. To further enhance the learned cross-modal features, we propose a novel pre-training task that predicts which patches contain an object referred to in natural language from the encoded visual features. Extensive experiments on four vision-and-language tasks show that our approach outperforms previous unsupervised VLP methods and obtains new state-of-the-art results.", "track": "Speech, Vision, Robotics, Multimodal Grounding", "label": 7, "url": ""}, {"loc": [4.724325656890869, 3.404350757598877], "id": 4268, "title": "Faithful Knowledge Graph Explanations in Commonsense Question Answering", "authors": "Guy Aglionby and Simone Teufel", "abstract": "Knowledge graphs are commonly used as sources of information in commonsense question answering, and can also be used to express explanations for the model's answer choice. A common way of incorporating facts from the graph is to encode them separately from the question, and then combine the two representations to select an answer. In this paper, we argue that highly faithful graph-based explanations cannot be extracted from existing models of this type. Such explanations will not include reasoning done by the transformer encoding the question, so will be incomplete. We confirm this theory with a novel proxy measure for faithfulness and propose two architecture changes to address the problem. Our findings suggest a path forward for developing architectures for faithful graph-based explanations.", "track": "Interpretability, Interactivity and Analysis of Models for NLP", "label": 9, "url": ""}, {"loc": [7.5805559158325195, 12.31023120880127], "id": 4292, "title": "KOLD: Korean Offensive Language Dataset", "authors": "Younghoon Jeong, Juhyun Oh, Jongwon Lee, Jaimeen Ahn, Jihyung Moon, Sungjoon Park and Alice Oh", "abstract": "Recent directions for offensive language detection are hierarchical modeling, identifying the type and the target of offensive language, and interpretability with offensive span annotation and prediction. These improvements are focused on English and do not transfer well to other languages because of cultural and linguistic differences. In this paper, we present the Korean Offensive Language Dataset (KOLD) comprising 40,429 comments, which are annotated hierarchically with the type and the target of offensive language, accompanied by annotations of the corresponding text spans. We collect the comments from NAVER news and YouTube platform and provide the titles of the articles and videos as the context information for the annotation process. We use these annotated comments as training data for Korean BERT and RoBERTa models and find that they are effective at offensiveness detection, target classification, and target span detection while having room for improvement for target group classification and offensive span detection. We discover that the target group distribution differs drastically from the existing English datasets, and observe that providing the context information improves the model performance in offensiveness detection (+0.3), target classification (+1.5), and target group classification (+13.1). We publicly release the dataset and baseline models.", "track": "Resources and Evaluation", "label": 1, "url": "https://www.semanticscholar.org/reader/82159bec7a4f9e399af1b632d56bb7f98439810e?experiments=&features=reader_skimming%3Atrue"}, {"loc": [6.035600185394287, 8.883742332458496], "id": 4294, "title": "Evade the Trap of Mediocrity: Promoting Diversity and Novelty in Text Generation via Concentrating Attention", "authors": "Wenhao Li, Xiaoyuan Yi, Jinyi Hu, Maosong Sun and Xing Xie", "abstract": "Recently, powerful Transformer architectures have proven superior in generating high-quality sentences. Nevertheless, these models tend to produce dull high-frequency phrases, severely hurting the diversity and novelty of generated text. In this work, we dig into the intrinsic mechanism of this problem and found that sparser attention values in Transformer could improve diversity. To understand such a phenomenon, we first conduct both empirical and theoretical analysis and then attribute it to representation degeneration caused by the attentive mixture of the hidden states during training. We term this process the Trap of Mediocrity. To escape from such a trap, we introduce a novel attention regularization loss to control the sharpness of the attention distribution, which is transparent to model structures and can be easily implemented within 20 lines of python code. We prove that this method could be mathematically regarded as learning a Bayesian approximation of posterior attention. Experiments show that our method improved the diversity and novelty of the generated text while maintaining comparable quality on a variety of conditional and unconditional generation tasks.", "track": "Natural Language Generation", "label": 6, "url": "https://www.semanticscholar.org/reader/82df0e8419fe147a6c0fa9a8c7f69d6b85931865?experiments=&features=reader_skimming%3Atrue"}, {"loc": [6.872811794281006, 6.209075927734375], "id": 4295, "title": "The better your Syntax, the better your Semantics? Probing Pretrained Language Models for the English Comparative Correlative", "authors": "Leonie Weissweiler, Valentin Hofmann, Abdullatif K\u00f6ksal and Hinrich Sch\u00fctze", "abstract": "Construction Grammar (CxG) is a paradigm from cognitive linguistics emphasising the connection between syntax and semantics. Rather than rules that operate on lexical items, it posits constructions as the central building blocks of language, i.e., linguistic units of different granularity that combine syntax and semantics. As a first step towards assessing the compatibility of CxG with the syntactic and semantic knowledge demonstrated by state-of-the-art pretrained language models (PLMs), we present an investigation of their capability to classify and understand one of the most commonly studied constructions, the English comparative correlative (CC). We conduct experiments examining the classification accuracy of a syntactic probe on the one hand and the models' behaviour in a semantic application task on the other, with BERT, RoBERTa, and DeBERTa as the example PLMs. Our results show that all three investigated PLMs are able to recognise the structure of the CC but fail to use its meaning. While human-like performance of PLMs on many NLP tasks has been alleged, this indicates that PLMs still suffer from substantial shortcomings in central domains of linguistic knowledge.", "track": "Linguistic Theories, Cognitive Modeling and Psycholinguistics", "label": 22, "url": "https://www.semanticscholar.org/reader/21fc58eea259e101318a9a4c8ddb03c001b3ada7?experiments=&features=reader_skimming%3Atrue"}, {"loc": [4.528491497039795, 4.4971842765808105], "id": 4299, "title": "ProofInfer: Generating Proof via Iterative Hierarchical Inference", "authors": "Zichu Fei, Qi Zhang, Xin Zhou, Tao Gui and Xuanjing Huang", "abstract": "Proof generation focuses on deductive reasoning: given a hypothesis and a set of theories, including some supporting facts and logical rules expressed in natural language, the model generates a proof tree indicating how to deduce the hypothesis from given theories.\nCurrent models with state-of-the-art performance employ the stepwise method that adds an individual node to the proof step-by-step.\nHowever, these methods actually focus on generating several proof paths rather than a whole tree.\nDuring generation, they focus on the most relevant areas of the currently generated node while neglecting the rest of the proof tree. \nTo address this problem, we propose ProofInfer, which generates the proof tree via iterative hierarchical inference.\nAt each step, ProofInfer adds the entire layer to the proof, where all nodes in this layer are generated simultaneously. \nSince the conventional autoregressive generation architecture cannot simultaneously predict multiple nodes, ProofInfer employs text-to-text paradigm.\nTo this end, we propose a divide-and-conquer algorithm to encode the proof tree as the plain text without losing structure information.\nExperimental results show that ProofInfer significantly improves performance on several widely-used datasets.\nIn addition, ProofInfer still performs well with data-limited, achieving comparable performance to the state-of-the-art model with about 40% of the training data.", "track": "Natural Language Generation", "label": 6, "url": ""}, {"loc": [3.7223188877105713, 9.365842819213867], "id": 4300, "title": "ECTSum: A New Benchmark Dataset For Bullet Point Summarization of Long Earnings Call Transcripts", "authors": "Rajdeep Mukherjee, Abhinav Bohra, Akash Banerjee, Soumya Sharma, Manjunath Hegde, Afreen Shaikh, Shivani Shrivastava, Koustuv Dasgupta, Niloy Ganguly, Saptarshi Ghosh and Pawan Goyal", "abstract": "Despite tremendous progress in automatic summarization, state-of-the-art methods are predominantly trained to excel in summarizing short newswire articles, or documents with strong layout biases such as scientific articles or government reports. Efficient techniques to summarize financial documents, discussing facts and figures, have largely been unexplored, majorly due to the unavailability of suitable datasets. In this work, we present ECTSum, a new dataset with transcripts of earnings calls (ECTs), hosted by publicly traded companies, as documents, and experts-written short telegram-style bullet point summaries derived from corresponding Reuters articles. ECTs are long unstructured documents without any prescribed length limit or format. We benchmark our dataset with state-of-the-art summarization methods across various metrics evaluating the content quality and factual consistency of the generated summaries. Finally, we present a simple yet effective approach, ECT-BPS, to generate a set of bullet points that precisely capture the important facts discussed in the calls.", "track": "Resources and Evaluation", "label": 1, "url": ""}, {"loc": [7.340866565704346, 6.84141206741333], "id": 4348, "title": "Cross-domain Generalization for AMR Parsing", "authors": "Xuefeng Bai, Sen Yang, Leyang Cui, Linfeng Song and Yue Zhang", "abstract": "Abstract Meaning Representation (AMR) parsing aims to predict an AMR graph from textual input. \nRecently, there has been notable growth in AMR parsing performance. However, most existing work focuses on improving the performance in the specific domain, ignoring the potential domain dependence of AMR parsing systems. To address this, we extensively evaluate five representative AMR parsers on five domains and analyze challenges to cross-domain AMR parsing. We observe that challenges to cross-domain AMR parsing mainly arise from the distribution shift of words and AMR concepts. Based on our observation, we investigate two approaches to reduce the domain distribution divergence of text and AMR features, respectively.  Experimental results on two out-of-domain test sets show the superiority of our method.", "track": "Semantics: Lexical, Sentence level, Textual Inference and Other areas", "label": 8, "url": "https://www.semanticscholar.org/reader/53607fe723da15a943a39631c00b43e34a306511?experiments=&features=reader_skimming%3Atrue"}, {"loc": [3.598658561706543, 9.731589317321777], "id": 4352, "title": "CiteSum: Citation Text-guided Scientific Extreme Summarization and Domain Adaptation with Limited Supervision", "authors": "Yuning Mao, Ming Zhong and Jiawei Han", "abstract": "Scientific extreme summarization (TLDR) aims to form ultra-short summaries of scientific papers. Previous efforts on curating scientific TLDR datasets failed to scale up due to the heavy human annotation and domain expertise required. In this paper, we propose a simple yet effective approach to automatically extracting TLDR summaries for scientific papers from their citation texts. Based on the proposed approach, we create a new benchmark CiteSum without human annotation, which is around 30 times larger than the previous human-curated dataset SciTLDR. We conduct a comprehensive analysis of CiteSum, examining its data characteristics and establishing strong baselines. We further demonstrate the usefulness of CiteSum by adapting models pre-trained on CiteSum (named CITES) to new tasks and domains with limited supervision. For scientific extreme summarization, CITES outperforms most fully-supervised methods on SciTLDR without any fine-tuning and obtains state-of-the-art results with only 128 examples. For news extreme summarization, CITES achieves significant gains on XSum over its base model (not pre-trained on CiteSum), e.g., +7.2 ROUGE-1 zero-shot performance and state-of-the-art few-shot performance. For news headline generation, CITES performs the best among unsupervised and zero-shot methods on Gigaword.", "track": "Summarization", "label": 14, "url": ""}, {"loc": [4.251677989959717, 7.323694229125977], "id": 4356, "title": "FETA: A Benchmark for Few-Sample Task Transfer in Open-Domain Dialogue", "authors": "Alon Albalak, Yi-Lin Tuan, Pegah Jandaghi, Connor Pryor, Luke Yoffe, Deepak Ramachandran, Lise Getoor, Jay Pujara and William Yang Wang", "abstract": "Task transfer, transferring knowledge contained in related tasks, holds the promise of reducing the quantity of labeled data required to fine-tune language models. Dialogue understanding encompasses many diverse tasks, yet task transfer has not been thoroughly studied in conversational AI. This work explores conversational task transfer by introducing FETA: a benchmark for FEw-sample TAsk transfer in open-domain dialogue.\nFETA contains two underlying sets of conversations upon which there are 10 and 7 tasks annotated, enabling the study of intra-dataset task transfer; task transfer without domain adaptation. We utilize three popular language models and three learning algorithms to analyze the transferability between 132 source-target task pairs and create a baseline for future work.\nWe run experiments in the single- and multi-source settings and report valuable findings, e.g., most performance trends are model-specific, and span extraction and multiple-choice tasks benefit the most from task transfer.\nIn addition to task transfer, FETA can be a valuable resource for future research into the efficiency and generalizability of pre-training datasets and model architectures, as well as for learning settings such as continual and multitask learning.", "track": "Dialogue and Interactive Systems", "label": 4, "url": "https://www.semanticscholar.org/reader/59707fbd3308257628470d94e56c8165bf4e1cff?experiments=&features=reader_skimming%3Atrue"}, {"loc": [4.882094860076904, 3.3823673725128174], "id": 4357, "title": "Do Children Texts Hold The Key To Commonsense Knowledge?", "authors": "Julien Romero and Simon Razniewski", "abstract": "Compiling comprehensive repositories of commonsense knowledge is a long-standing problem in AI. Many concerns revolve around the issue of reporting bias, i.e., that frequency in text sources is not a good proxy for relevance or truth. This paper explores whether children's texts hold the key to commonsense knowledge compilation, based on the hypothesis that such content makes fewer assumptions on the reader's knowledge, and therefore spells out commonsense more explicitly. An analysis with several corpora shows that children's texts indeed contain much more, and more typical commonsense assertions. Moreover, experiments show that this advantage can be leveraged in popular language-model-based commonsense knowledge extraction settings, where task-unspecific fine-tuning on small amounts of children texts (childBERT) already yields significant improvements. This provides a refreshing perspective different from the common trend of deriving progress from ever larger models and corpora.", "track": "Unsupervised and Weakly-Supervised Methods in NLP", "label": 17, "url": "https://www.semanticscholar.org/reader/eaec704a9a2ebe5b045dc23246640e6561bc276e?experiments=&features=reader_skimming%3Atrue"}, {"loc": [5.56419038772583, 8.528447151184082], "id": 4360, "title": "On the Limitations of Reference-Free Evaluations of Generated Text", "authors": "Daniel Deutsch, Rotem Dror and Dan Roth", "abstract": "There is significant interest in developing evaluation metrics which accurately estimate the quality of generated text without the aid of a human-written reference text, which can be time consuming and expensive to collect or entirely unavailable in online applications. However, in this work, we demonstrate that these reference-free metrics are inherently biased and limited in their ability to evaluate generated text, and we argue that they should not be used to measure progress on tasks like machine translation or summarization. We show how reference-free metrics are equivalent to using one generation model to evaluate another, which has several limitations: (1) the metrics can be optimized at test time to find the approximate best-possible output, (2) they are inherently biased toward models which are more similar to their own, and (3) they can be biased against higher-quality outputs, including those written by humans. Therefore, we recommend that reference-free metrics should be used as diagnostic tools for analyzing and understanding model behavior instead of measures of how well models perform a task, in which the goal is to achieve as high of a score as possible.", "track": "Resources and Evaluation", "label": 1, "url": "https://www.semanticscholar.org/reader/b5306e0217eb51e1fbaee1c39522750f9f294b1a?experiments=&features=reader_skimming%3Atrue"}, {"loc": [10.788838386535645, 6.927899360656738], "id": 4363, "title": "Sampling-Based Approximations to Minimum Bayes Risk Decoding for Neural Machine Translation", "authors": "Bryan Eikema and Wilker Aziz", "abstract": "In NMT we search for the mode of the model distribution to form predictions. The mode and other high-probability translations found by beam search have been shown to often be inadequate in a number of ways. This prevents improving translation quality through better search, as these idiosyncratic translations end up selected by the decoding algorithm, a problem known as the beam search curse. Recently, an approximation to minimum Bayes risk (MBR) decoding has been proposed as an alternative decision rule that would likely not suffer from the same problems. We analyse this approximation and establish that it has no equivalent to the beam search curse. We then design approximations that decouple the cost of exploration from the cost of robust estimation of expected utility. This allows for much larger hypothesis spaces, which we show to be beneficial. We also show that mode-seeking strategies can aid in constructing compact sets of promising hypotheses and that MBR is effective in identifying good translations in them. We conduct experiments on three language pairs varying in amounts of resources available: English into and from German, Romanian, and Nepali.", "track": "Machine Translation", "label": 10, "url": "https://www.semanticscholar.org/reader/f65a1b74daf26ac495982ba8e3b4484cdd0688ae?experiments=&features=reader_skimming%3Atrue"}, {"loc": [9.128528594970703, 6.429752826690674], "id": 4369, "title": "IndicXNLI: Evaluating Multilingual Inference for Indian Languages", "authors": "Divyanshu Aggarwal, Vivek Gupta and Anoop Kunchukuttan", "abstract": "While Indic NLP has made rapid advances recently in terms of the availability of corpora and pre-trained models, benchmark datasets on standard NLU tasks are limited. To this end, we introduce INDICXNLI, an NLI dataset for 11 Indic languages. It has been created by high-quality machine translation of the original English XNLI dataset and our analysis attests to the quality of INDICXNLI. By finetuning different pre-trained LMs on this INDICXNLI, we analyze various cross-lingual transfer techniques with respect to the impact of the choice of language models, languages, multi-linguality, mix-language input, etc. These experiments provide us with useful insights into the behaviour of pre-trained models for a diverse set of languages.", "track": "Semantics: Lexical, Sentence level, Textual Inference and Other areas", "label": 8, "url": "https://www.semanticscholar.org/reader/1141aa5ee59a19844e00611c97efa39689906a69?experiments=&features=reader_skimming%3Atrue"}, {"loc": [8.537271499633789, 8.126812934875488], "id": 4374, "title": "Model Cascading: Towards Jointly Improving Efficiency and Accuracy of NLP Systems", "authors": "Neeraj Varshney and Chitta Baral", "abstract": "Do all instances need inference through the big models for a correct prediction? Perhaps not; some instances are easy and can be answered correctly by even small capacity models. This provides opportunities for improving the computational efficiency of systems. In this work, we present an explorative study on 'model cascading', a simple technique that utilizes a collection of models of varying capacities to accurately yet efficiently output predictions. Through comprehensive experiments in multiple task settings that differ in the number of models available for cascading (K value), we show that cascading improves both the computational efficiency and the prediction accuracy. For instance, in K=3 setting, cascading saves up to 88.93% computation cost and consistently achieves superior prediction accuracy with an improvement of up to 2.18%. We also study the impact of introducing additional models in the cascade and show that it further increases the efficiency improvements. Finally, we hope that our work will facilitate development of efficient NLP systems making their widespread adoption in real-world applications possible.", "track": "Efficient Methods for NLP", "label": 12, "url": "https://www.semanticscholar.org/reader/5bb42863524b0ae4e5a47c46c53d9e7ec9552fef?experiments=&features=reader_skimming%3Atrue"}, {"loc": [1.0585951805114746, 10.530745506286621], "id": 4377, "title": "Semantic Simplification for Sentiment Classification", "authors": "Xiaotong Jiang, Zhongqing Wang and Guodong Zhou", "abstract": "Recent work on document-level sentiment classification has shown that the sentiment in the original text is often hard to capture, since the sentiment is usually either expressed implicitly or shifted due to the occurrences of negation and rhetorical words. To this end, we enhance the original text with a sentiment-driven simplified clause to intensify its sentiment. The simplified clause shares the same opinion with the original text but expresses the opinion much more simply. Meanwhile, we employ Abstract Meaning Representation (AMR) for generating simplified clauses, since AMR explicitly provides core semantic knowledge, and potentially offers core concepts and explicit structures of original texts. Empirical studies show the effectiveness of our proposed model over several strong baselines. The results also indicate the importance of simplified clauses for sentiment classification.", "track": "Sentiment Analysis, Stylistic Analysis, and Argument Mining", "label": 16, "url": ""}, {"loc": [8.60241413116455, 8.419034957885742], "id": 4380, "title": "XPrompt: Exploring the Extreme of Prompt Tuning", "authors": "Fang Ma, Chen Zhang, Lei Ren, Jingang Wang, Qifan Wang, Wei Wu, Xiaojun Quan and Dawei Song", "abstract": "Prompt tuning learns soft prompts to condition the frozen Pre-trained Language Models (PLMs) for performing downstream tasks in a parameter-efficient manner. While prompt tuning has gradually reached the performance level of fine-tuning as the model scale increases, there is still a large performance gap between prompt tuning and fine-tuning for models of moderate and small scales (typically less than 11B parameters). In this paper, we empirically show that the trained prompt tokens can have a negative impact on a downstream task and thus degrade its performance. To bridge the gap, we propose a novel Prompt tuning model with an eXtremely small scale (XPrompt) under the regime of lottery tickets hypothesis. Specifically, XPrompt eliminates the negative prompt tokens at different granularity levels through a hierarchical structured pruning, yielding a more parameter-efficient prompt yet with a competitive performance. Comprehensive experiments are carried out on the SuperGLUE tasks, and the results indicate that XPrompt is able to close the performance gap at smaller model scales.", "track": "Language Modeling and Analysis of Language Models", "label": 2, "url": "https://www.semanticscholar.org/reader/40e49ba41eca31f9c2661cc65f2c13dc4f2c7859?experiments=&features=reader_skimming%3Atrue"}, {"loc": [7.549868106842041, 9.047859191894531], "id": 4382, "title": "Rethinking the Role of Demonstrations: What Makes In-Context Learning Work?", "authors": "Sewon Min, Xinxi Lyu, Ari Holtzman, Mikel Artetxe, Mike Lewis, Hannaneh Hajishirzi and Luke Zettlemoyer", "abstract": "Large language models (LMs) are able to in-context learn\u2014perform a new task via inference alone by conditioning on a few input-label pairs (demonstrations) and making predictions for new inputs. However, there has been little understanding of how the model learns and which aspects of the demonstrations contribute to end task performance. In this paper, we show that ground truth demonstrations are in fact not required\u2014randomly replacing labels in the demonstrations barely hurts performance on a range of classification and multi-choce tasks, consistently over 12 different models including GPT-3. Instead, we find that other aspects of the demonstrations are the key drivers of end\ntask performance, including the fact that they provide a few examples of (1) the label space, (2) the distribution of the input text, and (3) the overall format of the sequence. Together, our analysis provides a new way of understanding how and why in-context learning works, while opening up new questions about how much can be learned from large language models through inference alone.", "track": "Language Modeling and Analysis of Language Models", "label": 2, "url": "https://www.semanticscholar.org/reader/87e02a265606f31e65986f3c1c448a3e3a3a066e?experiments=&features=reader_skimming%3Atrue"}, {"loc": [6.823146343231201, 6.184777736663818], "id": 4384, "title": "The Curious Case of Control", "authors": "Elias Stengel-Eskin and Benjamin Van Durme", "abstract": "Children acquiring English make systematic errors on subject control sentences even after they have reached near-adult competence (Chomsky, 1969), possibly due to heuristics based on semantic roles (Maratsos, 1974).\nGiven the advanced fluency of large generative language models, we ask whether model outputs are consistent with these heuristics, and to what degree different models are consistent with each other. We find that models can be categorized by behavior into three separate groups, with broad differences between the groups. The outputs of models in the largest group are consistent with positional heuristics that succeed on subject control but fail on object control. This result is surprising, given that object control is orders of magnitude more frequent in the text data used to train such models. We examine to what degree the models are sensitive to prompting with agent-patient information, finding that raising the salience of agent and patient relations results in significant changes in the outputs of most models. Based on this observation, we leverage an existing dataset of semantic proto-role annotations (White et al. 2020) to explore the connections between  control and labeling event participants with properties typically associated with agents and patients.", "track": "Linguistic Theories, Cognitive Modeling and Psycholinguistics", "label": 22, "url": "https://www.semanticscholar.org/reader/a3780e8f45b6c1ab3e27c0ad87c3ea23176dc8a7?experiments=&features=reader_skimming%3Atrue"}, {"loc": [5.572396278381348, 8.836969375610352], "id": 4385, "title": "SHARE: a System for Hierarchical Assistive Recipe Editing", "authors": "Shuyang Li, Yufei Li, Jianmo Ni and Julian McAuley", "abstract": "The large population of home cooks with dietary restrictions is under-served by existing cooking resources and recipe generation models. To help them, we propose the task of controllable recipe editing: adapt a base recipe to satisfy a user-specified dietary constraint. This task is challenging, and cannot be adequately solved with human-written ingredient substitution rules or existing end-to-end recipe generation models. We tackle this problem with SHARE: a System for Hierarchical Assistive Recipe Editing, which performs simultaneous ingredient substitution before generating natural-language steps using the edited ingredients. By decoupling ingredient and step editing, our step generator can explicitly integrate the available ingredients. Experiments on the novel RecipePairs dataset---83K pairs of similar recipes where each recipe satisfies one of seven dietary constraints---demonstrate that SHARE produces convincing, coherent recipes that are appropriate for a target dietary constraint. We further show through human evaluations and real-world cooking trials that recipes edited by SHARE can be easily followed by home cooks to create appealing dishes.", "track": "NLP Applications", "label": 0, "url": "https://www.semanticscholar.org/reader/5480cf7fd2fb7f62153bd7c1a6b7edbef0744e26?experiments=&features=reader_skimming%3Atrue"}, {"loc": [4.349253177642822, 7.272778034210205], "id": 4392, "title": "IM^2: an Interpretable and Multi-category Integrated Metric Framework for Automatic Dialogue Evaluation", "authors": "Zhihua Jiang, Guanghui Ye, Dongning Rao, Di Wang and Xin Miao", "abstract": "Evaluation metrics shine the light on the best models and thus strongly influence the research directions, such as the recently developed dialogue metrics USR, FED, and GRADE. However, most current metrics evaluate the dialogue data as isolated and static because they only focus on a single quality or several qualities. To mitigate the problem, this paper proposes an interpretable, multi-faceted, and controllable framework IM^2 (Interpretable and Multi-category Integrated Metric) to combine a large number of metrics which are good at measuring different qualities. The IM^2 framework first divides current popular dialogue qualities into different categories and then applies or proposes dialogue metrics to measure the qualities within each category and finally generates an overall IM^2 score. An initial version of IM^2 was submitted to the AAAI 2022 Track5.1@DSTC10 challenge and took the 2^nd place on both of the development and test leaderboard. After the competition, we develop more metrics and improve the performance of our model. We compare IM^2 with other 13 current dialogue metrics and experimental results show that IM^2 correlates more strongly with human judgments than any of them on each evaluated dataset.", "track": "Dialogue and Interactive Systems", "label": 4, "url": ""}, {"loc": [5.348541259765625, 12.146551132202148], "id": 4394, "title": "PEVL: Position-enhanced Pre-training and Prompt Tuning for Vision-language Models", "authors": "Yuan Yao, qianyu chen, Ao Zhang, Wei Ji, Zhiyuan Liu, Tat-Seng Chua and Maosong Sun", "abstract": "Vision-language pre-training (VLP) has shown impressive performance on a wide range of cross-modal tasks, where VLP models without reliance on object detectors are becoming the mainstream due to their superior computation efficiency and competitive performance. However, the removal of object detectors also deprives the capability of VLP models in explicit object modeling, which is essential to various position-sensitive vision-language (VL) tasks, such as referring expression comprehension and visual commonsense reasoning. To address the challenge, we introduce PEVL that enhances the pre-training and prompt tuning of VLP models with explicit object position modeling. Specifically, PEVL reformulates discretized object positions and language in a unified language modeling framework, which facilitates explicit VL alignment during pre-training, and also enables flexible prompt tuning for various downstream tasks. We show that PEVL enables state-of-the-art performance of detector-free VLP models on position-sensitive tasks such as referring expression comprehension and phrase grounding, and also improves the performance on position-insensitive tasks with grounded inputs. We make the data and code for this paper publicly available at https://github.com/thunlp/PEVL.", "track": "Speech, Vision, Robotics, Multimodal Grounding", "label": 7, "url": ""}, {"loc": [5.0212883949279785, 3.7368695735931396], "id": 4396, "title": "Pre-training Language Models with Deterministic Factual Knowledge", "authors": "Shaobo Li, Xiaoguang Li, Lifeng Shang, Chengjie Sun, Bingquan Liu, zhenzhou Ji, Xin Jiang and Qun Liu", "abstract": "Previous works show that Pre-trained Language Models (PLMs) can capture factual knowledge. However, some analyses reveal that PLMs fail to perform it robustly, e.g., being sensitive to the changes of prompts when extracting factual knowledge. To mitigate this issue, we propose to let PLMs learn the deterministic relationship between the remaining context and the masked content. The deterministic relationship ensures that the masked factual content can be deterministically inferable based on the existing clues in the context. That would provide more stable patterns for PLMs to capture factual knowledge than randomly masking. Two pre-training tasks are further introduced to motivate PLMs to rely on the deterministic relationship when filling masks. Specifically, we use an external Knowledge Base (KB) to identify deterministic relationships and continuously pre-train PLMs with the proposed methods. The factual knowledge probing experiments indicate that the continuously pre-trained PLMs achieve better robustness in factual knowledge capturing. Further experiments on question-answering datasets show that trying to learn a deterministic relationship with the proposed methods can also help other knowledge-intensive tasks.", "track": "Question Answering", "label": 11, "url": "https://www.semanticscholar.org/reader/118e5b53976a69da9277cdb8d9ffcefa5a081340?experiments=&features=reader_skimming%3Atrue"}, {"loc": [8.280447006225586, 7.92151403427124], "id": 4397, "title": "Finding Skill Neurons in Pre-trained Transformer-based Language Models", "authors": "Xiaozhi Wang, Kaiyue Wen, Zhengyan Zhang, Lei Hou, Zhiyuan Liu and Juanzi Li", "abstract": "Transformer-based pre-trained language models have demonstrated superior performance on various natural language processing tasks. However, it remains unclear how the skills required to handle these tasks distribute among model parameters. In this paper, we find that after prompt tuning for specific tasks, the activations of some neurons within pre-trained Transformers are highly predictive of the task labels. We dub these neurons skill neurons and confirm they encode task-specific skills by finding that: (1) Skill neurons are crucial for handling tasks. Performances of pre-trained Transformers on a task significantly drop when corresponding skill neurons are perturbed. (2) Skill neurons are task-specific. Similar tasks tend to have similar distributions of skill neurons. Furthermore, we demonstrate the skill neurons are most likely generated in pre-training rather than fine-tuning by showing that the skill neurons found with prompt tuning are also crucial for other fine-tuning methods freezing neuron weights, such as the adapter-based tuning and BitFit. We also explore the applications of skill neurons, including accelerating Transformers with network pruning and building better transferability indicators. These findings may promote further research on understanding Transformers. The source code can be obtained from https://github.com/THU-KEG/Skill-Neuron.", "track": "Language Modeling and Analysis of Language Models", "label": 2, "url": "https://www.semanticscholar.org/reader/5d3cf0909ba206cd6bc2e86610f77ca25d9b2d1c?experiments=&features=reader_skimming%3Atrue"}, {"loc": [7.779642105102539, 8.905840873718262], "id": 4398, "title": "Prompt Conditioned VAE: Enhancing Generative Replay for Lifelong Learning in Task-Oriented Dialogue", "authors": "Yingxiu Zhao, Yinhe Zheng, Zhiliang Tian, Chang Gao, Jian Sun and Nevin L. Zhang", "abstract": "Lifelong learning (LL) is vital for advanced task-oriented dialogue (ToD) systems. To address the catastrophic forgetting issue of LL, generative replay methods are widely employed to consolidate past knowledge with generated pseudo samples. However, most existing generative replay methods use only a single task-specific token to control their models. This scheme is usually not strong enough to constrain the generative model due to insufficient information involved. In this paper, we propose a novel method, prompt conditioned VAE for lifelong learning (PCLL), to enhance generative replay by incorporating tasks' statistics. PCLL captures task-specific distributions with a conditional variational autoencoder, conditioned on natural language prompts to guide the pseudo-sample generation. Moreover, it leverages a distillation process to further consolidate past knowledge by alleviating the noise in pseudo samples. Experiments on natural language understanding tasks of ToD systems demonstrate that PCLL significantly outperforms competitive baselines in building lifelong learning models.", "track": "Dialogue and Interactive Systems", "label": 4, "url": ""}, {"loc": [10.87362289428711, 6.844954967498779], "id": 4401, "title": "PreQuEL: Quality Estimation of Machine Translation Outputs in Advance", "authors": "Shachar Don-Yehiya, Leshem Choshen and Omri Abend", "abstract": "We present the task of PreQuEL, Pre-(Quality-Estimation) Learning. A PreQuEL system predicts how well a given sentence will be translated, without recourse to the actual translation, thus eschewing unnecessary resource allocation when translation quality is bound to be low. \nPreQuEL can be defined relative to a given MT system (e.g., some industry service) or generally relative to the state-of-the-art.\nFrom a theoretical perspective, PreQuEL places the focus on the source text, tracing properties, possibly linguistic features, that make a sentence harder to machine translate.\n\nWe develop a baseline model for the task and analyze its performance. We also develop a data augmentation method (from parallel corpora), that improves results substantially. We show that this augmentation method can improve the performance of the Quality-Estimation task as well.\nWe investigate the properties of the input text that our model is sensitive to, by testing it on challenge sets and different languages. We conclude that it is aware of syntactic and semantic distinctions, and correlates and even over-emphasizes the importance of standard NLP features.", "track": "Machine Translation", "label": 10, "url": "https://www.semanticscholar.org/reader/5f2d58c97ad103d0c804e951168cb1d339830bca?experiments=&features=reader_skimming%3Atrue"}, {"loc": [4.525197982788086, 4.387191295623779], "id": 4407, "title": "Can Transformers Reason in Fragments of Natural Language?", "authors": "Viktor Schlegel, Kamen V. Pavlov and Ian Pratt-Hartmann", "abstract": "State-of-the-art deep-learning-based approaches to Natural Language Processing (NLP) are credited with various capabilities that involve reasoning with natural language texts. %However, reasoning in this setting is often ill-defined and shallow. \nIn this paper we carry out a large-scale empirical study investigating the detection of formally valid inferences in controlled fragments of natural language for which the satisfiability problem becomes increasingly complex. We find that, while transformer-based language models perform surprisingly well in these scenarios, a deeper analysis reveals that they appear to overfit to superficial patterns in the data rather than acquiring the logical principles governing the reasoning in these fragments.", "track": "Interpretability, Interactivity and Analysis of Models for NLP", "label": 9, "url": "https://www.semanticscholar.org/reader/8ee376114a43432399554be39a79c1a2b6c65d51?experiments=&features=reader_skimming%3Atrue"}, {"loc": [9.875997543334961, 7.881039142608643], "id": 4408, "title": "Textless Speech Emotion Conversion using Discrete & Decomposed Representations", "authors": "Felix Kreuk, Adam Polyak, Jade Copet, Eugene Kharitonov, Tu Anh Nguyen, Morgan Rivi\u00e8re, Wei-Ning Hsu, Abdelrahman Mohamed, Emmanuel Dupoux and Yossi Adi", "abstract": "Speech emotion conversion is the task of modifying the perceived emotion of a speech utterance while preserving the lexical content and speaker identity. In this study, we cast the problem of emotion conversion as a spoken language translation task. We use a decomposition of the speech signal into discrete learned representations, consisting of phonetic-content units, prosodic features, speaker, and emotion. First, we modify the speech content by translating the phonetic-content units to a target emotion, and then predict the prosodic features based on these units. Finally, the speech waveform is generated by feeding the predicted representations into a neural vocoder. Such a paradigm allows us to go beyond spectral and parametric changes of the signal, and model non-verbal vocalizations, such as laughter insertion, yawning removal, etc. We demonstrate objectively and subjectively that the proposed method is vastly superior to current approaches and even beats text-based systems in terms of perceived emotion and audio quality. We rigorously evaluate all components of such a complex system and conclude with an extensive model analysis and ablation study to better emphasize the architectural choices, strengths and weaknesses of the proposed method. Samples are available under the following link: https://speechbot.github.io/emotion", "track": "Speech, Vision, Robotics, Multimodal Grounding", "label": 7, "url": "https://www.semanticscholar.org/reader/1e65b340e239efee1f9951758edae38b1bb56738?experiments=&features=reader_skimming%3Atrue"}, {"loc": [7.917130470275879, 3.2991676330566406], "id": 4409, "title": "Textual Backdoor Attacks Can Be More Harmful via Two Simple Tricks", "authors": "Yangyi Chen, Fanchao Qi, Hongcheng Gao, Zhiyuan Liu and Maosong Sun", "abstract": "Backdoor attacks are a kind of emergent security threat in deep learning. After being injected with a backdoor, a deep neural model will behave normally on standard inputs but give adversary-specified predictions once the input contains specific backdoor triggers. In this paper, we find two simple tricks that can make existing textual backdoor attacks much more harmful. The first trick is to add an extra training task to distinguish poisoned and clean data during the training of the victim model, and the second one is to use all the clean training data rather than remove the original clean data corresponding to the poisoned data. These two tricks are universally applicable to different attack models. We conduct experiments in three tough situations including clean data fine-tuning, low-poisoning-rate, and label-consistent attacks. Experimental results show that the two tricks can significantly improve attack performance. This paper exhibits the great potential harmfulness of backdoor attacks. All the code and data can be obtained at \\url{https://github.com/thunlp/StyleAttack}.", "track": "Interpretability, Interactivity and Analysis of Models for NLP", "label": 9, "url": "https://www.semanticscholar.org/reader/51f177a28b3c5918b6dfef7112859f1e433f33f7?experiments=&features=reader_skimming%3Atrue"}, {"loc": [7.623270034790039, 3.6370835304260254], "id": 4413, "title": "Why Should Adversarial Perturbations be Imperceptible? Rethink the Research Paradigm in Adversarial NLP", "authors": "Yangyi Chen, Hongcheng Gao, Ganqu CUI, Fanchao Qi, Longtao Huang, Zhiyuan Liu and Maosong Sun", "abstract": "Textual adversarial samples play important roles in multiple subfields of NLP research, including security, evaluation, explainability, and data augmentation. However, most work mixes all these roles, obscuring the problem definitions and research goals of the security role that aims to reveal the practical concerns of NLP models. In this paper, we rethink the research paradigm of textual adversarial samples in security scenarios. We discuss the deficiencies in previous work and propose our suggestions that the research on the Security-oriented adversarial NLP (SoadNLP) should: (1) evaluate their methods on security tasks to demonstrate the real-world concerns; (2) consider real-world attackers' goals, instead of developing impractical methods. To this end, we first collect, process, and release a security datasets collection Advbench. Then, we reformalize the task and adjust the emphasis on different goals in SoadNLP. Next, we propose a simple method based on heuristic rules that can easily fulfill the actual adversarial goals to simulate real-world attack methods. We conduct experiments on both the attack and the defense sides on Advbench. Experimental results show that our method has higher practical value, indicating that the research paradigm in SoadNLP may start from our new benchmark. All the code and data of Advbench can be obtained at \\url{https://github.com/thunlp/Advbench}.", "track": "Interpretability, Interactivity and Analysis of Models for NLP", "label": 9, "url": "https://www.semanticscholar.org/reader/e6c832118529361cd2e8ae834767a8ab79a9ec19?experiments=&features=reader_skimming%3Atrue"}, {"loc": [5.42486572265625, 12.172715187072754], "id": 4414, "title": "Retrieval Augmented Visual Question Answering with Outside Knowledge", "authors": "Weizhe Lin and Bill Byrne", "abstract": "Outside-Knowledge Visual Question Answering (OK-VQA) is a challenging VQA task that requires retrieval of external knowledge to answer questions about images. Recent OK-VQA systems use Dense Passage Retrieval (DPR) to retrieve documents from external knowledge bases, such as Wikipedia, but with DPR trained separately from answer generation, introducing a potential limit on the overall system performance.\nInstead, we propose a joint training scheme which includes differentiable DPR integrated with answer generation so that the system can be trained in an end-to-end fashion. Our experiments show that our scheme outperforms recent OK-VQA systems with strong DPR for retrieval. We also introduce new diagnostic metrics to analyze how retrieval and generation interact. The strong retrieval ability of our model significantly reduces the number of retrieved documents needed in training, yielding significant benefits in answer quality and computation required for training.", "track": "Speech, Vision, Robotics, Multimodal Grounding", "label": 7, "url": ""}, {"loc": [7.232288837432861, 7.949219226837158], "id": 4415, "title": "Instance Regularization for Discriminative Language Model Pre-training", "authors": "Zhuosheng Zhang, Hai Zhao and Ming Zhou", "abstract": "Discriminative pre-trained language models (PrLMs) can be generalized as denoising auto-encoders that work with two procedures, ennoising and denoising. First, an ennoising process corrupts texts with arbitrary noising functions to construct training instances. Then, a denoising language model is trained to restore the corrupted tokens. Existing studies have made progress by optimizing independent strategies of either ennoising or denosing. They treat training instances equally throughout the training process, with little attention on the individual contribution of those instances. To model explicit signals of instance contribution, this work proposes to estimate the complexity of restoring the original sentences from corrupted ones in language model pre-training. The estimations involve the corruption degree in the ennoising data construction process and the prediction confidence in the denoising counterpart. Experimental results on natural language understanding and reading comprehension benchmarks show that our approach improves pre-training efficiency, effectiveness, and robustness. Code is publicly available at https://github.com/cooelf/InstanceReg.", "track": "Language Modeling and Analysis of Language Models", "label": 2, "url": "https://www.semanticscholar.org/reader/8350f6e01b22cd6ba85450f52572a022543e0f53?experiments=&features=reader_skimming%3Atrue"}, {"loc": [10.833569526672363, 6.820982456207275], "id": 4416, "title": "GuoFeng: A Benchmark for Zero Pronoun Recovery and Translation", "authors": "Mingzhou Xu, Longyue Wang, Derek F. Wong, Hongye Liu, Linfeng Song, Lidia S. Chao, Shuming Shi and Zhaopeng Tu", "abstract": "The phenomenon of zero pronoun (ZP) has attracted increasing interest in the machine translation (MT) community due to its importance and difficulty. However, previous studies generally evaluate the quality of translating ZPs with BLEU scores on MT testsets, which is not expressive or sensitive enough for accurate assessment. To bridge the data and evaluation gaps, we propose a benchmark testset for target evaluation on Chinese-English ZP translation. The human-annotated testset covers five challenging genres, which reveal different characteristics of ZPs for comprehensive evaluation. We systematically revisit eight advanced models on ZP translation and identify current challenges for future exploration. We release data, code, models and annotation guidelines, which we hope can significantly promote research in this field (https://github.com/longyuewangdcu/mZPRT).", "track": "Resources and Evaluation", "label": 1, "url": ""}, {"loc": [3.8936052322387695, 4.447811603546143], "id": 4418, "title": "ScienceWorld: Is your Agent Smarter than a 5th Grader?", "authors": "Ruoyao Wang, Peter Jansen, Marc-Alexandre C\u00f4t\u00e9 and Prithviraj Ammanabrolu", "abstract": "We present ScienceWorld, a benchmark to test agents' scientific reasoning abilities in a new interactive text environment at the level of a standard elementary school science curriculum. Despite the transformer-based progress seen in question-answering and scientific text processing, we find that current models cannot reason about or explain learned science concepts in novel contexts. For instance, models can easily answer what the conductivity of a known material is but struggle when asked how they would conduct an experiment in a grounded environment to find the conductivity of an unknown material. This begs the question of whether current models are simply retrieving answers by way of seeing a large number of similar examples or if they have learned to reason about concepts in a reusable manner. We hypothesize that agents need to be grounded in interactive environments to achieve such reasoning capabilities. Our experiments provide empirical evidence supporting this hypothesis -- showing that a 1.5 million parameter agent trained interactively for 100k steps outperforms a 11 billion parameter model statically trained for scientific question-answering and reasoning from millions of expert demonstrations.", "track": "NLP Applications", "label": 0, "url": "https://www.semanticscholar.org/reader/0e41fd22d483047bd8fdb1757d90c7702493567e?experiments=&features=reader_skimming%3Atrue"}, {"loc": [6.53921365737915, 7.393195629119873], "id": 4421, "title": "Improving Embeddings Representations for Comparing Higher Education Curricula: A Use Case in Computing", "authors": "Jeffri Murrugarra-Llerena, Fernando Alva-Manchego and Nils Murrugarra-LLerena", "abstract": "We propose an approach for comparing curricula of study programs in higher education. Pre-trained word embeddings are fine-tuned in a study program classification task, where each curriculum is represented by the names and content of its courses. By combining metric learning with a novel course-guided attention mechanism, our method obtains more accurate curriculum representations than strong baselines. Experiments on a new dataset with curricula of computing programs demonstrate the intuitive power of our approach via attention weights, topic modeling, and embeddings visualizations. We also present a use case comparing computing curricula from USA and Latin America to showcase the capabilities of our improved embeddings representations.", "track": "Interpretability, Interactivity and Analysis of Models for NLP", "label": 9, "url": ""}, {"loc": [5.952273845672607, 5.208144187927246], "id": 4425, "title": "Mitigating Spurious Correlation in Natural Language Understanding with Counterfactual Inference", "authors": "Can Udomcharoenchaikit, Wuttikorn Ponwitayarat, Patomporn Payoungkhamdee, Kanruethai Masuk, Weerayut Buaphet, Ekapol Chuangsuwanich and Sarana Nutanong", "abstract": "Despite their promising results on standard benchmarks, NLU models are still prone to make predictions based on shortcuts caused by unintended bias in the dataset. For example, an NLI model may use lexical overlap as a shortcut to make entailment predictions due to repetitive data generation patterns from annotators, also called annotation artifacts. In this paper, we propose a causal analysis framework to help debias NLU models. We show that (1) by defining causal relationships, we can introspect how much annotation artifacts affect the outcomes. (2) We can utilize counterfactual inference to mitigate bias with this knowledge. We found that viewing a model as a treatment can mitigate bias more effectively than viewing annotation artifacts as treatment. (3) In addition to bias mitigation, we can interpret how much each debiasing strategy is affected by annotation artifacts. Our experimental results show that using counterfactual inference can improve out-of-distribution performance in all settings while maintaining high in-distribution performance.", "track": "Semantics: Lexical, Sentence level, Textual Inference and Other areas", "label": 8, "url": ""}, {"loc": [6.557802200317383, 12.023564338684082], "id": 4430, "title": "Federated Meta-Learning for Emotion and Sentiment Aware Multi-modal Complaint Identification", "authors": "Apoorva Singh, C Siddarth, Sriparna Saha and Tanmay Sen", "abstract": "", "track": "NLP Applications", "label": 0, "url": ""}, {"loc": [3.3298754692077637, 7.8765997886657715], "id": 4431, "title": "End-to-End Neural Discourse Deixis Resolution in Dialogue", "authors": "Shengjie Li and Vincent Ng", "abstract": "We adapt Lee et al.'s (2018) span-based entity coreference model to the task of end-to-end discourse deixis resolution in dialogue, specifically by proposing extensions to their model that exploit task-specific characteristics. The resulting model, dd-utt, achieves state-of-the-art results on the four datasets in the CODI-CRAC 2021 shared task.", "track": "Dialogue and Interactive Systems", "label": 4, "url": ""}, {"loc": [6.224602222442627, 5.552917957305908], "id": 4442, "title": "Balancing out Bias: Achieving Fairness Through Balanced Training", "authors": "Xudong Han, Timothy Baldwin and Trevor Cohn", "abstract": "Group bias in natural language processing tasks manifests as disparities in system error rates across texts authorized by different demographic groups, typically disadvantaging minority groups. Dataset balancing has been shown to be effective at mitigating bias, however existing approaches do not directly account for correlations between author demographics and linguistic variables, limiting their effectiveness. To achieve Equal Opportunity fairness, such as equal job opportunity without regard to demographics, this paper introduces a simple, but highly effective, objective for countering bias using balanced training.\nWe extend the method in the form of a gated model, which incorporates protected attributes as input, and show that it is effective at reducing bias in predictions through demographic input perturbation, outperforming all other bias mitigation techniques when combined with balanced training.", "track": "Ethics", "label": 21, "url": "https://www.semanticscholar.org/reader/5b0926522572161dd10fb35b229b3dfb2014faee?experiments=&features=reader_skimming%3Atrue"}, {"loc": [8.093547821044922, 9.465882301330566], "id": 4449, "title": "Prompting ELECTRA: Few-Shot Learning with Discriminative Pre-Trained Models", "authors": "Mengzhou Xia, Mikel Artetxe, Jingfei Du, Danqi Chen and Veselin Stoyanov", "abstract": "Pre-trained masked language models successfully perform few-shot learning by formulating downstream tasks as text infilling. How- ever, as a strong alternative in full-shot settings, discriminative pre-trained models like ELECTRA do not fit into the paradigm. In this work, we adapt prompt-based few-shot learning to ELECTRA and show that it outperforms masked language models in a wide range of tasks. ELECTRA is pre-trained to distinguish if a token is generated or original. We naturally extend that to prompt-based few-shot learning by training to score the originality of the target options without introducing new parameters. Our method can be easily adapted to tasks involving multi-token predictions without extra computation overhead. Analysis shows that ELECTRA learns distributions that align better with downstream tasks.", "track": "Language Modeling and Analysis of Language Models", "label": 2, "url": "https://www.semanticscholar.org/reader/94f09dd93d278e80e342168eee9973830af6fd5c?experiments=&features=reader_skimming%3Atrue"}, {"loc": [4.948933124542236, 3.554842472076416], "id": 4450, "title": "Identifying Physical Object Use in Sentences", "authors": "Tianyu Jiang and Ellen Riloff", "abstract": "Commonsense knowledge about the typical\nfunctions of physical objects allows people to\nmake inferences during sentence understanding.\nFor example, we infer that \"Sam enjoyed\nthe book\" means that Sam enjoyed reading the\nbook, even though the action is implicit. Prior\nresearch has focused on learning the prototypical\nfunctions of physical objects in order to\nenable inferences about implicit actions. But\nmany sentences refer to objects even when they\nare not used (e.g., \"The book fell\"). We argue\nthat NLP systems need to recognize whether an\nobject is being used before inferring how the\nobject is used. We define a new task called Object\nUse Classification that determines whether\na physical object mentioned in a sentence was\nused or likely will be used. We introduce a new\ndataset for this task and present a classification\nmodel that exploits data augmentation methods\nand FrameNet when fine-tuning a pre-trained\nlanguage model. We also show that object use\nclassification combined with knowledge about\nthe prototypical functions of objects has the\npotential to yield very good inferences about\nimplicit and anticipated actions.", "track": "Commonsense Reasoning", "label": 19, "url": ""}, {"loc": [4.290769100189209, 7.503115177154541], "id": 4452, "title": "CDialog: A Multi-turn Covid-19 Conversation Dataset for Entity-Aware Dialog Generation", "authors": "Deeksha Varshney, Aizan Zafar, Niranshu Kumar Behera and Asif Ekbal", "abstract": "", "track": "Dialogue and Interactive Systems", "label": 4, "url": ""}, {"loc": [5.941260814666748, 5.118440628051758], "id": 4454, "title": "Robustifying Sentiment Classification by Maximally Exploiting Few Counterfactuals", "authors": "Maarten De Raedt, Fr\u00e9deric Godin, Chris Develder and Thomas Demeester", "abstract": "For text classification tasks, finetuned language models perform remarkably well. Yet, they tend to rely on spurious patterns in training data, thus limiting their performance on out-of-distribution (OOD) test data. Among recent models aiming to avoid this spurious pattern problem, adding extra counterfactual samples to the training data has proven to be very effective. Yet, counterfactual data generation is costly since it relies on human annotation. Thus, we propose a novel solution that only requires annotation of a small fraction (e.g., 1%) of the original training data, and uses automatic generation of extra counterfactuals in an encoding vector space. We demonstrate the effectiveness of our approach in sentiment classification, using IMDb data for training and other sets for OOD tests (i.e., Amazon, SemEval and Yelp). We achieve noticeable accuracy improvements by adding only 1% manual counterfactuals: +3% compared to adding +100% in-distribution training samples, +1.3% compared to alternate counterfactual approaches.", "track": "Unsupervised and Weakly-Supervised Methods in NLP", "label": 17, "url": "https://www.semanticscholar.org/reader/b03bc940f673eba0fdc78df053d5fa6c5f5c3a14?experiments=&features=reader_skimming%3Atrue"}, {"loc": [4.957622051239014, 9.10991096496582], "id": 4455, "title": "Data-Efficient Playlist Captioning With Musical and Linguistic Knowledge", "authors": "Giovanni Gabbolini, Romain Hennequin and Elena V. Epure", "abstract": "Music streaming services feature billions of playlists created by users, professional editors or algorithms. In this content overload scenario, it is crucial to characterise playlists, so that music can be effectively organised and accessed. Playlist titles and descriptions are proposed in natural language either manually by music editors and users or automatically from pre-defined templates. However, the former is time-consuming while the latter is limited by the vocabulary and covered music themes. \nIn this work, we propose PlayNTell, a data-efficient multi-modal encoder-decoder model for automatic playlist captioning. Compared to existing music captioning algorithms, PlayNTell leverages also linguistic and musical knowledge to generate correct and thematic captions. We benchmark PlayNTell on a new editorial playlists dataset collected from two major music streaming services.\nPlayNTell yields 2x-3x higher BLEU@4 and CIDEr than state of the art captioning algorithms.", "track": "NLP Applications", "label": 0, "url": ""}, {"loc": [10.811177253723145, 9.330028533935547], "id": 4457, "title": "Improved grammatical error correction by ranking elementary edits", "authors": "Alexey Sorokin", "abstract": "We offer a two-stage reranking method for grammatical error correction: the first model serves as edit generator, while the second classifies the proposed edits as correct or false. We show how to use both encoder-decoder and sequence labeling models for the first step of our pipeline. We achieve state-of-the-art quality on BEA 2019 English dataset even using weak BERT-GEC edit generator. Combining our roberta-base scorer with state-of-the-art GECToR edit generator, we surpass GECToR by 2-3\\%. With a larger model we establish a new SOTA on BEA development and test sets. Our model also sets a new SOTA on Russian, despite using smaller models and less data than the previous approaches.", "track": "NLP Applications", "label": 0, "url": ""}, {"loc": [8.523696899414062, 6.956820964813232], "id": 4459, "title": "Improving Tokenisation by Alternative Treatment of Spaces", "authors": "Edward Gow-Smith, Harish Tayyar Madabushi, Carolina Scarton and Aline Villavicencio", "abstract": "", "track": "Phonology, Morphology and Word Segmentation", "label": 25, "url": ""}, {"loc": [5.485447406768799, 8.540998458862305], "id": 4463, "title": "GENIE: Toward Reproducible and Standardized Human Evaluation for Text Generation", "authors": "Daniel Khashabi, Gabriel Stanovsky, Jonathan Bragg, Nicholas Lourie, Jungo Kasai, Yejin Choi, Noah A. Smith and Daniel Weld", "abstract": "While often assumed a gold standard, effective human evaluation of text generation remains an important, open area for research.\nWe revisit this problem with a focus on producing consistent evaluations that are reproducible---over time and across different populations. \nWe study this goal in different stages of the human evaluation pipeline. \nIn particular, we consider design choices for the annotation interface used to elicit human judgments and their impact on reproducibility. \nFurthermore, we develop an automated mechanism for maintaining annotator quality via a probabilistic model that detects and excludes noisy annotators. \nPutting these lessons together, we introduce GENIE: a system for running standardized human evaluations across different generation tasks.\nWe instantiate GENIE with datasets representing four core challenges in text generation: machine translation, summarization, commonsense reasoning, and machine comprehension.\nFor each task, GENIE offers a leaderboard that automatically crowdsources annotations for submissions, evaluating them along axes such as correctness, conciseness, and fluency.\nWe have made the GENIE leaderboards publicly available, and have already ranked 50 submissions from 10 different research groups. We hope GENIE encourages further progress toward effective, standardized evaluations for text generation.", "track": "Resources and Evaluation", "label": 1, "url": ""}, {"loc": [6.086878776550293, 5.376801490783691], "id": 4464, "title": "Attentional Probe: Estimating a Module's Functional Potential", "authors": "Tiago Pimentel, Josef Valvoda, Niklas Stoehr and Ryan Cotterell", "abstract": "", "track": "Interpretability, Interactivity and Analysis of Models for NLP", "label": 9, "url": ""}, {"loc": [7.174093723297119, 6.870387554168701], "id": 4466, "title": "When More Data Hurts: A Troubling Quirk in Developing Broad-Coverage Natural Language Understanding Systems", "authors": "Elias Stengel-Eskin, Emmanouil Antonios Platanios, Adam Pauls, Sam Thomson, Hao Fang, Benjamin Van Durme, Jason Eisner and Yu Su", "abstract": "In natural language understanding (NLU) production systems, users' evolving needs necessitate the addition of new features over time, indexed by new symbols added to the meaning representation space. This requires additional training data and results in ever-growing datasets. We present the first systematic investigation into this incremental symbol learning scenario. Our analysis reveals a troubling quirk in building broad-coverage NLU systems: as the training dataset grows, performance on a small set of new symbols often decreases. We show that this trend holds for multiple mainstream models on two common NLU tasks: intent recognition and semantic parsing. Rejecting class imbalance as the sole culprit, we reveal that the trend is closely associated with an effect we call source signal dilution, where strong lexical cues for the new symbol become diluted as the training dataset grows. Selectively dropping training examples to prevent dilution often reverses the trend, showing the over-reliance of mainstream neural NLU models on simple lexical cues.", "track": "Dialogue and Interactive Systems", "label": 4, "url": "https://www.semanticscholar.org/reader/1a5fcd44ebba0aaecc0397b26957fcc5e5476033?experiments=&features=reader_skimming%3Atrue"}, {"loc": [9.129129409790039, 6.927538871765137], "id": 4469, "title": "Zero-shot Cross-lingual Transfer of Prompt-based Tuning with a Unified Multilingual Prompt", "authors": "Lianzhe Huang, Shuming Ma, Dongdong Zhang, Furu Wei and Houfeng Wang", "abstract": "Prompt-based tuning has been proven effective for pretrained language models (PLMs). While most of the existing work focuses on the monolingual prompts, we study the multilingual prompts for multilingual PLMs, especially in the zero-shot cross-lingual setting. To alleviate the effort of designing different prompts for multiple languages, we propose a novel model that uses a unified prompt for all languages, called UniPrompt. Different from the discrete prompts and soft prompts, the unified prompt is model-based and language-agnostic. Specifically, the unified prompt is initialized by a multilingual PLM to produce language-independent representation, after which is fused with the text input. During inference, the prompts can be pre-computed so that no extra computation cost is needed. To collocate with the unified prompt, we propose a new initialization method for the target label word to further improve the model's transferability across languages. Extensive experiments show that our proposed methods can significantly outperform the strong baselines across different languages. We release data and code to facilitate future research.", "track": "Multilinguality", "label": 13, "url": "https://www.semanticscholar.org/reader/437533a111ac08d3860829ff4aadb6aa759bd3e2?experiments=&features=reader_skimming%3Atrue"}, {"loc": [6.477760314941406, 7.508520126342773], "id": 4473, "title": "Three Real-World Datasets and Neural Computational Models for Classification Tasks in Patent Landscaping", "authors": "Subhash C. Pujari, Jannik Str\u00f6tgen, Mark Giereth, Michael Gertz and Annemarie Friedrich", "abstract": "Patent Landscaping, one of the central tasks of intellectual property management, includes selecting and grouping patents according to user-defined technical or application-oriented criteria. While recent transformer-based models have been shown to be effective for classifying patents into taxonomies such as CPC or IPC, there is yet little research on how to support real-world Patent Landscape Studies (PLSs) using natural language processing methods. With this paper, we release three labeled datasets for PLS-oriented classification tasks covering two diverse domains. We provide a qualitative analysis and report detailed corpus statistics.\n\nMost research on neural models for patents has been restricted to leveraging titles and abstracts. We compare strong neural and non-neural baselines, proposing a novel model that takes into account textual information from the patents' full texts as well as embeddings created based on the patents' CPC labels. We find that for PLS-oriented classification tasks, going beyond title and abstract is crucial, CPC labels are an effective source of information, and combining all features yields the best results.", "track": "Resources and Evaluation", "label": 1, "url": ""}, {"loc": [6.893301963806152, 9.926328659057617], "id": 4474, "title": "Topic Modeling With Topological Data Analysis", "authors": "Ciar\u00e1n Byrne, Danijela Horak, Karo Moilanen and Amandla Mabona", "abstract": "Recent unsupervised topic modelling ap-\nproaches that use clustering techniques on\nword, token or document embeddings can ex-\ntract coherent topics. A common limitation\nof such approaches is that they reveal noth-\ning about inter-topic relationships which are\nessential in many real-world application do-\nmains. We present an unsupervised topic mod-\nelling method which harnesses Topological\nData Analysis (TDA) to extract a topological\nskeleton of the manifold upon which contextu-\nalised word embeddings lie. We demonstrate\nthat our approach, which performs on par with\na recent baseline, is able to construct a network\nof coherent topics together with meaningful\nrelationships between them.", "track": "Information Retrieval and Text Mining", "label": 15, "url": ""}, {"loc": [8.490314483642578, 8.280784606933594], "id": 4484, "title": "Predicting Fine-Tuning Performance with Probing", "authors": "Zining Zhu, Soroosh Shahtalebi and Frank Rudzicz", "abstract": "Large NLP models have recently shown impressive performance in language understanding tasks, typically evaluated by their fine-tuned performance. Alternatively, probing has received increasing attention as being a lightweight method for interpreting the intrinsic mechanisms of large NLP models. In probing, post-hoc classifiers are trained on \"out-of-domain\" datasets that diagnose specific abilities. While probing the language models has led to insightful findings, they appear disjointed from the development of models. This paper explores the utility of probing deep NLP models to extract a proxy signal widely used in model development -- the fine-tuning performance. We find that it is possible to use the accuracies of only three probing tests to predict the fine-tuning performance with errors 40% - 80% smaller than baselines. We further discuss possible avenues where probing can empower the development of deep NLP models.", "track": "Interpretability, Interactivity and Analysis of Models for NLP", "label": 9, "url": ""}, {"loc": [1.3252894878387451, 4.922028064727783], "id": 4493, "title": "Diverse Parallel Data Synthesis for Cross-Database Adaptation of Text-to-SQL Parsers", "authors": "Abhijeet Awasthi, Ashutosh Sathe and Sunita Sarawagi", "abstract": "Text-to-SQL parsers often struggle with database schemas unseen during the train time. Adapting Text-to-SQL parsers to new schemas is a challenging problem owing to a huge diversity of schemas and zero availability of natural language queries in the new schema. We present ReFill, a framework for synthesizing high-quality and textually diverse parallel datasets for adapting Text-to-SQL parsers. Unlike the prior SQL-to-Text generation methods, ReFill learns to retrieve-and-edit text queries from existing schemas and transfer them to the new schema. ReFill uses a novel method of retrieving diverse existing text, masking their schema-specific tokens, and refilling with tokens relevant to the target schema. We show that this process leads to significantly more diverse text queries than achievable by a standard SQL-to-Text generation model. Through experiments on several databases, we show that adapting a parser by finetuning on datasets synthesized using ReFill consistently outperforms prior data-augmentation methods.", "track": "Machine Learning for NLP", "label": 3, "url": ""}, {"loc": [2.225458860397339, 7.405486583709717], "id": 4494, "title": "Agent-Specific Deontic Modality Detection in Legal Language", "authors": "Abhilasha Sancheti, Aparna Garimella, Balaji Vasan Srinivasan and Rachel Rudinger", "abstract": "Legal documents are typically long and written in legalese, which makes it particularly difficult for laypeople to understand their rights and duties. While natural language understanding technologies can be valuable in supporting such understanding in the legal domain, the limited availability of datasets annotated for deontic modalities in the legal domain, due to the cost of hiring experts and privacy issues, is a bottleneck. To this end, we introduce, LEXDEMOD, a corpus of English contracts annotated\nwith deontic modality expressed with respect to a contracting party or agent along with the modal triggers. We benchmark this dataset on two tasks: (i) agent-specific multi-label deontic modality classification, and (ii) agent-specific deontic modality and trigger span detection using Transformer-based (Vaswani et al., 2017) language models. Transfer learning experiments show that the linguistic diversity of modal expressions in LEXDEMOD generalizes reasonably from lease to employment and\nrental agreements. A small case study indicates that a model trained on LEXDEMOD can detect red flags with high recall. We believe our work offers a new research direction for deontic modality detection in the legal domain.", "track": "Resources and Evaluation", "label": 1, "url": ""}, {"loc": [7.592691898345947, 12.30020809173584], "id": 4495, "title": "COLD: A Benchmark for Chinese Offensive Language Detection", "authors": "Jiawen Deng, Jingyan ZHOU, Hao Sun, Chujie Zheng, Fei Mi, Helen Meng and Minlie Huang", "abstract": "Offensive language detection is increasingly crucial for maintaining a civilized social media platform and deploying pre-trained language models. However, this task in Chinese is still under exploration due to the scarcity of reliable datasets. To this end, we propose a benchmark --COLD for Chinese offensive language analysis, including a Chinese Offensive Language Dataset --COLDATASET and a baseline detector --COLDETECTOR which is trained on the dataset. We show that the COLD benchmark contributes to Chinese offensive language detection which is challenging for existing resources. We then deploy the COLDETECTOR and conduct detailed analyses on popular Chinese pre-trained language models. We first analyze the offensiveness of existing generative models and show that these models inevitably expose varying degrees of offensive issues. Furthermore, we investigate the factors that influence the offensive generations, and we find that anti-bias contents and keywords referring to certain groups or revealing negative attitudes trigger offensive outputs easier.", "track": "Ethics", "label": 21, "url": "https://www.semanticscholar.org/reader/3664cceee40f91c75d1ee2d2e17a050e846e52bb?experiments=&features=reader_skimming%3Atrue"}, {"loc": [6.366693496704102, 2.063981533050537], "id": 4505, "title": "Fixing Model Bugs with Natural Language Patches", "authors": "Shikhar Murty, Christopher D. Manning, Scott Lundberg and Marco Tulio Ribeiro", "abstract": "Current approaches for fixing systematic problems in NLP models (e.g., regex patches, finetuning on more data) are either brittle, or labor-intensive and liable to shortcuts. In contrast, humans often provide corrections to each other through natural language. Taking inspiration from this, we explore natural language patches---declarative statements that allow developers to provide corrective feedback at the right level of abstraction, either overriding the model (``if a review gives 2 stars, the sentiment is negative'') or providing additional information the model may lack (``if something is described as the bomb, then it is good''). We model the task of determining if a patch applies separately from the task of integrating patch information, and show that with a small amount of synthetic data, we can teach models to effectively use real patches on real data---1 to 7 patches improve accuracy by ~1--4 accuracy points on different slices of a sentiment analysis dataset, and F1 by 7 points on a relation extraction dataset. Finally, we show that finetuning on as many as 100 labeled examples may be needed to match the performance of a small set of language patches.", "track": "Machine Learning for NLP", "label": 3, "url": "https://www.semanticscholar.org/reader/61ddf932488405ab1c7b275460d2b3c5dfa274a0?experiments=&features=reader_skimming%3Atrue"}, {"loc": [7.921070575714111, 3.2946479320526123], "id": 4508, "title": "WeDef: Weakly Supervised Backdoor Defense for Text Classification", "authors": "Lesheng Jin, Zihan Wang and Jingbo Shang", "abstract": "Existing backdoor defense methods are only effective for limited trigger types. To defend different trigger types at once, we start from the class-irrelevant nature of the poisoning process and propose a novel weakly supervised backdoor defense framework WeDef. Recent advances in weak supervision make it possible to train a reasonably accurate text classifier using only a small number of user-provided, class-indicative seed words. Such seed words shall be considered independent of the triggers. Therefore, a weakly supervised text classifier trained by only the poisoned documents without their labels will likely have no backdoor. Inspired by this observation, in WeDef, we define the reliability of samples based on whether the predictions of the weak classifier agree with their labels in the poisoned training set. We further improve the results through a two-phase sanitization: (1) iteratively refine the weak classifier based on the reliable samples and (2) train a binary poison classifier by distinguishing the most unreliable samples from the most reliable samples. Finally, we train the sanitized model on the samples that the poison classifier predicts as benign. Extensive experiments show that WeDef is effective against popular trigger-based attacks (e.g., words, sentences, and paraphrases), outperforming existing defense methods.", "track": "Information Retrieval and Text Mining", "label": 15, "url": ""}, {"loc": [6.059531211853027, 5.279592514038086], "id": 4512, "title": "Interventional Training for Out-Of-Distribution Natural Language Understanding", "authors": "Sicheng Yu, Jing Jiang, Hao Zhang, Yulei Niu, Qianru Sun and Lidong Bing", "abstract": "Out-of-distribution (OOD) settings are used to measure a model's performance when the distribution of the test data is different from that of the training data. NLU models are known to suffer in OOD. We study this issue from the perspective of causality, which sees confounding bias as the reason for models to learn spurious correlations. While a common solution is to perform intervention, existing methods handle only known and single confounder, but in many NLU tasks the confounders can be both unknown and multifactorial. In this paper, we propose a novel interventional training method called Bottom-up Automatic Intervention (BAI) that performs multi-granular intervention with identified multifactorial confounders. Our experiments on three NLU tasks, namely, natural language inference, fact verification and paraphrase identification, show the effectiveness of BAI for tackling OOD settings.", "track": "Machine Learning for NLP", "label": 3, "url": ""}, {"loc": [1.740082859992981, 3.8306288719177246], "id": 4514, "title": "Pseudo-Relevance for Enhancing Document Representation", "authors": "Jihyuk Kim, Seung-won Hwang, Seoho Song, Hyeseon Ko and Young-In Song", "abstract": "This paper studies how to enhance the document representation for the bi-encoder approach in dense document retrieval. The bi-encoder,  separately encoding a query and a document as a single vector, is favored for high efficiency in large-scale information retrieval, compared to more effective but complex architectures. To combine the strength of the two,  the multi-vector representation of documents for bi-encoder, such as ColBERT preserving all token embeddings, has been widely adopted. Our contribution is to reduce the size of the multi-vector representation, without compromising the effectiveness, supervised by query logs. Our proposed solution decreases the latency and the memory footprint, up to 8- and 3-fold, validated on MSMARCO and real-world search query logs.", "track": "Information Retrieval and Text Mining", "label": 15, "url": ""}, {"loc": [7.7016825675964355, 9.640179634094238], "id": 4515, "title": "ZeroGen: Efficient Zero-shot Learning via Dataset Generation", "authors": "Jiacheng Ye, Jiahui Gao, Qintong Li, Hang XU, Jiangtao Feng, Zhiyong Wu, Tao Yu and Lingpeng Kong", "abstract": "There is a growing interest in dataset generation recently due to the superior generative capacity of large pre-trained language models (PLMs). In this paper, we study a flexible and efficient zero-short learning method, ZeroGen.\nGiven a zero-shot task, we first generate a dataset from scratch using PLMs in an unsupervised manner. Then, we train a tiny task model (e.g., LSTM) under the supervision of the synthesized dataset. This approach allows highly efficient inference as the final task model only has orders of magnitude fewer parameters comparing to PLMs (e.g., GPT2-XL).\nApart from being annotation-free and efficient, we argue that ZeroGen can also provide useful insights from the perspective of data-free model-agnostic knowledge distillation, and unreferenced text generation evaluation. \nExperiments and analysis on different NLP tasks, namely, text  classification,  question  answering, and natural language inference, show the effectiveness of ZeroGen.", "track": "Language Modeling and Analysis of Language Models", "label": 2, "url": "https://www.semanticscholar.org/reader/2145fcceeb69385e108bf1796d52f974854d4c0b?experiments=&features=reader_skimming%3Atrue"}, {"loc": [6.472930908203125, 7.461972713470459], "id": 4525, "title": "Neighborhood Contrastive Learning for Scientific Document Representations with Citation Embeddings", "authors": "Malte Ostendorff, Nils Rethmeier, Isabelle Augenstein, Bela Gipp and Georg Rehm", "abstract": "Learning scientific document representations can be substantially improved through contrastive learning objectives, where the challenge lies in creating positive and negative training samples that encode the desired similarity semantics. Prior work relies on discrete citation relations to generate contrast samples. However, discrete citations enforce a hard cut-off to similarity. This is counter-intuitive to similarity-based learning and ignores that scientific papers can be very similar despite lacking a direct citation - a core problem of finding related research. Instead, we use controlled nearest neighbor sampling over citation graph embeddings for contrastive learning. This control allows us to learn continuous similarity, to sample hard-to-learn negatives and positives, and also to avoid collisions between negative and positive samples by controlling the sampling margin between them. The resulting method SciNCL outperforms the state-of-the-art on the SciDocs benchmark. Furthermore, we demonstrate that it can train (or tune) language models sample-efficiently and that it can be combined with recent training-efficient methods. Perhaps surprisingly, even training a general-domain language model this way outperforms baselines pretrained in-domain.", "track": "NLP Applications", "label": 0, "url": "https://www.semanticscholar.org/reader/72d5bd1095f9719742212f81a2a3790583e95796?experiments=&features=reader_skimming%3Atrue"}, {"loc": [5.019529342651367, 3.7464747428894043], "id": 4528, "title": "SPE: Symmetrical Prompt Enhancement for Fact Probing", "authors": "Yiyuan Li, Tong Che, Yezhen Wang, Zhengbao Jiang, Caiming Xiong and Snigdha Chaturvedi", "abstract": "Pretrained language models (PLMs) have been shown to accumulate factual knowledge during pretraining (Petroni et al. 2019). Recent works probe PLMs for the extent of this knowledge through prompts either in discrete or continuous forms. However, these methods do not consider symmetry of the task: object prediction and subject prediction. In this work, we propose Symmetrical Prompt Enhancement (SPE), a continuous prompt-based method for factual probing in PLMs that leverages the symmetry of the task by constructing symmetrical prompts for subject and object prediction. Our results on a popular factual probing dataset, LAMA,  show significant improvement of SPE over previous probing methods.", "track": "Interpretability, Interactivity and Analysis of Models for NLP", "label": 9, "url": "https://www.semanticscholar.org/reader/872748081a8fb66703a3b89fb46840642565513d?experiments=&features=reader_skimming%3Atrue"}, {"loc": [8.537823677062988, 8.273076057434082], "id": 4535, "title": "Efficient Large Scale Language Modeling with Mixtures of Experts", "authors": "Mikel Artetxe, Shruti Bhosale, Naman Goyal, Todor Mihaylov, Myle Ott, Sam Shleifer, Xi Victoria Lin, Jingfei Du, Srinivasan Iyer, Ramakanth Pasunuru, Giridharan Anantharaman, Xian Li, Shuohui Chen, Halil Akin, Mandeep Baines, Louis Rapha\u00ebl Th\u00e9o Martin, Xing Zhou, Punit Singh Koura, Brian O'Horo, Jeffrey Wang, Luke Zettlemoyer, Mona Diab, Zornitsa Kozareva and Veselin Stoyanov", "abstract": "Mixture of Experts layers (MoEs) enable efficient scaling of language models through conditional computation. This paper presents a detailed empirical study of how autoregressive MoE language models scale in comparison with dense models in a wide range of settings: in- and out-of-domain language modeling, zero- and few-shot priming, and full-shot fine-tuning. With the exception of fine-tuning, we find MoEs to be substantially more compute efficient. At more modest training budgets, MoEs can match the performance of dense models using ~4 times less compute. This gap narrows at scale, but our largest MoE model (1.1T parameters) consistently outperforms a compute-equivalent dense model (6.7B parameters). Overall, this performance gap varies greatly across tasks and domains, suggesting that MoE and dense models generalize differently in ways that are worthy of future study. We make our code and models publicly available for research use.", "track": "Language Modeling and Analysis of Language Models", "label": 2, "url": "https://www.semanticscholar.org/reader/fb01415a0decfa3f3d6339930e95028ae1ff4170?experiments=&features=reader_skimming%3Atrue"}, {"loc": [2.5252745151519775, 8.720478057861328], "id": 4546, "title": "MedJEx: A Medical Jargon Extraction Model with Wiki's Hyperlink Span and Contextualized Masked Language Model Score", "authors": "Sunjae Kwon, Zonghai Yao, Harmon S. Jordan, David A. Levy, Brian Corner and hong yu", "abstract": "This paper proposes a new natural language processing (NLP) application for identifying medical jargon terms potentially difficult for patients to comprehend from electronic health record (EHR) notes. We first present a novel and publicly available dataset with expert-annotated medical jargon terms from 18K+ EHR note sentences (MedJ). Then, we introduce a novel medical jargon extraction (MedJEx) model which has been shown to outperform existing state-of-the-art NLP models. First, MedJEx improved the overall performance when it was trained on an auxiliary Wikipedia hyperlink span dataset, where hyperlink spans provide additional Wikipedia articles to explain the spans (or terms), and then fine-tuned on the annotated MedJ data. Secondly, we found that a contextualized masked language model score was beneficial for detecting domain-specific unfamiliar jargon terms. Moreover, our results show that training on the auxiliary Wikipedia hyperlink span datasets improved six out of eight biomedical named entity recognition benchmark datasets. MedJEx is publicly available.", "track": "NLP Applications", "label": 0, "url": "https://www.semanticscholar.org/reader/38e995753f222ba7d198d6d54033058de84a77f1?experiments=&features=reader_skimming%3Atrue"}, {"loc": [3.6228268146514893, 5.14925479888916], "id": 4548, "title": "Discourse Comprehension: A Question Answering Framework to Represent Sentence Connections", "authors": "Wei-Jen Ko, Cutter J. Dalton, Mark Joseph Simmons, Eliza Fisher, Greg Durrett and Junyi Jessy Li", "abstract": "While there has been substantial progress in text comprehension through simple factoid question answering, more holistic comprehension of a discourse still presents a major challenge (Dunietz et al., 2020). Someone critically reflecting on a text as they read it will pose curiosity-driven, often open-ended questions, which reflect deep understanding of the content and require complex reasoning to answer (Ko et al., 2020; Westera et al., 2020). A key challenge in building and evaluating models for this type of discourse comprehension is the lack of annotated data, especially since collecting answers to such questions requires high cognitive load for annotators.\n\nThis paper presents a novel paradigm that enables scalable data collection targeting the comprehension of news documents, viewing these questions through the lens of discourse. The resulting corpus, DCQA (Discourse Comprehension by Question Answering), captures both discourse and semantic links between sentences in the form of free-form, open-ended questions. On an evaluation set that we annotated on questions from Ko et al. (2020), we show that DCQA provides valuable supervision for answering open-ended questions. We additionally design pre-training methods utilizing existing question-answering resources, and use synthetic data to accommodate unanswerable questions.", "track": "Discourse and Pragmatics", "label": 24, "url": "https://www.semanticscholar.org/reader/192f2b973840791d2fc2aa638db3ca157f3401b7?experiments=&features=reader_skimming%3Atrue"}, {"loc": [4.112943649291992, 9.315643310546875], "id": 4551, "title": "Learning to Generate Overlap Summaries through Noisy Synthetic Data", "authors": "Naman Bansal, Mousumi Akter and Shubhra Kanti Karmaker", "abstract": "Semantic Overlap Summarization (SOS) is a novel and relatively under-explored seq-to-seq task which entails summarizing common information from multiple alternate narratives. One of the major challenges for solving this task is the lack of existing datasets for supervised training. To address this challenge, we propose a novel data augmentation technique, which allows us to create large amount of synthetic data for training a seq-to-seq model that can perform the SOS task. Through extensive experiments using narratives from the news domain, we show that the models fine-tuned using the synthetic dataset provide significant performance improvements over the pre-trained vanilla summarization techniques and are close to the models fine-tuned on the golden training data; which essentially demonstrates the effectiveness of out proposed data augmentation technique for training seq-to-seq models on the SOS task.", "track": "Summarization", "label": 14, "url": ""}, {"loc": [7.34815788269043, 7.068229675292969], "id": 4554, "title": "Mutual Exclusivity Training and Primitive Augmentation to Induce Compositionality", "authors": "Yichen Jiang, Xiang Zhou and Mohit Bansal", "abstract": "Recent datasets expose the lack of the systematic generalization ability in standard sequence-to-sequence models. In this work, we analyze this behavior of seq2seq models and identify two contributing factors: a lack of mutual exclusivity bias (one target sequence can only be mapped to one source sequence), and the tendency to memorize whole examples rather than separating structures from contents. We propose two techniques to address these two issues respectively: Mutual Exclusivity Training that prevents the model from producing seen generations when facing novel examples via an unlikelihood-based loss, and prim2primX data augmentation that automatically diversifies the arguments of every syntactic function to prevent memorizing and provide a compositional inductive bias without exposing test-set data. Combining these two techniques, we show substantial empirical improvements using standard sequence-to-sequence models (LSTMs and Transformers) on two widely-used compositionality datasets: SCAN and COGS. Finally, we provide analysis characterizing the improvements as well as the remaining challenges, and provide detailed ablations of our method.", "track": "Semantics: Lexical, Sentence level, Textual Inference and Other areas", "label": 8, "url": ""}, {"loc": [7.591396808624268, 12.346772193908691], "id": 4560, "title": "Directions for NLP Practices Applied to Online Hate Speech Detection", "authors": "Paula Fortuna, Monica Dominguez, Leo Wanner and Zeerak Talat", "abstract": "Addressing hate speech in online spaces has been conceptualized as a classification task that uses Natural Language Processing (NLP) techniques. Through this conceptualization, the hate speech detection task has relied on common conventions and practices from NLP. For instance, inter-annotator agreement is conceptualized as a way to measure dataset quality and certain metrics and benchmarks are used to assure model generalization. However, hate speech is a deeply complex and situated concept that eludes such static and disembodied practices. In this position paper, we critically reflect on these methodologies for hate speech detection, we argue that many conventions in NLP are poorly suited for the problem and encourage researchers to develop methods that are more appropriate for the task.", "track": "Theme Track", "label": 18, "url": ""}, {"loc": [2.9587690830230713, 4.6016526222229], "id": 4562, "title": "Pre-training Transformer Models with Sentence-Level Objectives for Answer Sentence Selection", "authors": "Luca Di Liello, Siddhant Garg, Luca Soldaini and Alessandro Moschitti", "abstract": "An important task for designing QA systems is answer sentence selection (AS2): selecting the sentence containing (or constituting) the answer to a question from a set of retrieved relevant documents. In this paper, we propose three novel sentence-level transformer pre-training objectives that incorporate paragraph-level semantics within and across documents, to improve the performance of transformers for AS2, and mitigate the requirement of large labeled datasets. Specifically, the model is tasked to predict whether: (i) two sentences are extracted from the same paragraph, (ii) a given sentence is extracted from a given paragraph, and (iii) two paragraphs are extracted from the same document. Our experiments on three public and one industrial AS2 datasets demonstrate the empirical superiority of our pre-trained transformers over baseline models such as RoBERTa and ELECTRA for AS2.", "track": "Question Answering", "label": 11, "url": "https://www.semanticscholar.org/reader/c6dbd9577212838d66c28ac446712cfe04ef28a8?experiments=&features=reader_skimming%3Atrue"}, {"loc": [3.725797653198242, 4.802581310272217], "id": 4564, "title": "OpenCQA: Open-ended Question Answering with Charts", "authors": "Shankar Kantharaj, Xuan Long Do, Rixie Tiffany Leong, Jia Qing Tan, Enamul Hoque and Shafiq Joty", "abstract": "Charts are very popular to analyze data and convey important insights. People often analyze visualizations to answer open-ended questions that require explanatory answers. Answering such questions are often difficult and time-consuming as it requires a lot of cognitive and perceptual efforts. To address this challenge, we introduce a new task called OpenCQA, where the goal is to answer an open-ended question about a chart with descriptive texts. We present the annotation process and an in-depth analysis of our dataset. We implement and evaluate a set of baselines under three practical settings. In the first setting, a chart and the accompanying article is provided as input to the model. The second setting provides only the relevant paragraph(s) to the chart instead of the entire article, whereas the third setting requires the model to generate an answer solely based on the chart. Our analysis of the results show that the top performing models generally produce fluent and coherent text while they struggle to perform complex logical and arithmetic reasoning.", "track": "Question Answering", "label": 11, "url": "https://www.semanticscholar.org/reader/6c52c74debc49cd3ed58a74658655c30adc59d42?experiments=&features=reader_skimming%3Atrue"}, {"loc": [4.856136322021484, 3.4252820014953613], "id": 4566, "title": "A Systematic Investigation of Commonsense Knowledge in Large Language Models", "authors": "Xiang Lorraine Li, Adhiguna Kuncoro, Jordan Hoffmann, Cyprien de Masson d'Autume, Phil Blunsom and Aida Nematzadeh", "abstract": "Language models (LMs) trained on large amounts of data have shown impressive performance on many NLP tasks under the zero-shot and few-shot setup. Here we aim to better understand the extent to which such models learn commonsense knowledge --- a critical component of many NLP applications. We conduct a systematic and rigorous zero-shot and few-shot commonsense evaluation of large pre-trained LMs, where we: (i) carefully control for the LMs' ability to exploit potential surface cues and annotation artefacts, and (ii) account for variations in performance that arise from factors that are not related to commonsense knowledge. Our findings highlight the limitations of pre-trained LMs in acquiring commonsense knowledge without task-specific supervision; furthermore, using larger models or few-shot evaluation is insufficient to achieve human-level commonsense performance.", "track": "Commonsense Reasoning", "label": 19, "url": ""}, {"loc": [8.981797218322754, 7.146712779998779], "id": 4573, "title": "Transforming Sequence Tagging Into A Seq2Seq Task", "authors": "Karthik Raman, Iftekhar Naim, Jiecao Chen, Kazuma Hashimoto, Kiran Yalasangi and Krishna Srinivasan", "abstract": "Pretrained, large, generative language models (LMs) have had great success in a wide range of sequence tagging and structured prediction tasks. Casting a sequence tagging task as a Seq2Seq one requires deciding the formats of the input and output sequences. However, we lack a principled understanding of the trade-offs associated with these formats (such as the effect on model accuracy, sequence length, multilingual generalization, hallucination). In this paper, we rigorously study different formats one could use for casting input text sentences and their output labels into the input and target (i.e., output) of a Seq2Seq model. Along the way, we introduce a new format, which we show to to be both simpler and more effective. Additionally the new format demonstrates significant gains in the multilingual settings -- both zero-shot transfer learning and joint training. Lastly, we find that the new format is more robust and almost completely devoid of hallucination -- an issue we find common in existing formats. With well over a 1000 experiments studying 14 different formats, over 7 diverse public benchmarks -- including 3 multilingual datasets spanning 7 languages -- we believe our findings provide a strong empirical basis in understanding how we should tackle sequence tagging tasks.", "track": "Multilinguality", "label": 13, "url": "https://www.semanticscholar.org/reader/7f9eb2a4e79671445ebee0c2c55de44b80481f14?experiments=&features=reader_skimming%3Atrue"}, {"loc": [2.2859129905700684, 4.920640468597412], "id": 4576, "title": "CycleKQR: Unsupervised Bidirectional Keyword-Question Rewriting", "authors": "Andrea Iovine, Anjie Fang, Besnik Fetahu, Jie Zhao, Oleg Rokhlenko and Shervin Malmasi", "abstract": "Users expect their queries to be answered by search systems, regardless of the query's surface form, which include keyword queries and natural questions. Natural Language Understanding (NLU) components of Search and QA systems may fail to correctly interpret semantically equivalent inputs if this deviates from how the system was trained, leading to suboptimal understanding capabilities. We propose the keyword-question rewriting task to improve query understanding capabilities of NLU systems for all surface forms. To achieve this, we present CycleKQR, an unsupervised approach, enabling effective rewriting between keyword and question queries using non-parallel data.\n\nEmpirically we show the impact on QA performance of unfamiliar query forms for open domain and Knowledge Base QA systems (trained on either keywords or natural language questions). We demonstrate how CycleKQR significantly improves QA performance by rewriting queries into the appropriate form, while at the same time retaining the original semantic meaning of input queries, allowing CycleKQR to improve performance by up to 3% over supervised baselines. Finally, we release a dataset\nof 66k keyword-question pairs.", "track": "Unsupervised and Weakly-Supervised Methods in NLP", "label": 17, "url": ""}, {"loc": [4.82905912399292, 9.073969841003418], "id": 4583, "title": "Model Criticism for Long-Form Text Generation", "authors": "Yuntian Deng, Volodymyr Kuleshov and Alexander Rush", "abstract": "Language models have demonstrated the ability to generate highly fluent text; however, it remains unclear whether their output retains coherent high-level structure (e.g., story progression). Here, we propose to apply a statistical tool, model criticism in latent space, to evaluate the high-level structure of the generated text. Model criticism compares the distributions between real and generated data in a latent space obtained according to an assumptive generative process. Different generative processes identify specific failure modes of the underlying model. We perform experiments on three representative aspects of high-level discourse---coherence, coreference, and topicality---and find that transformer-based language models are able to capture topical structures but have a harder time maintaining structural coherence or modeling coreference.", "track": "Language Modeling and Analysis of Language Models", "label": 2, "url": "https://www.semanticscholar.org/reader/d9d12205007ac48b03d921225f9cdaf90f7c3fdd?experiments=&features=reader_skimming%3Atrue"}, {"loc": [3.926274299621582, 9.760669708251953], "id": 4586, "title": "Improving Faithfulness by Augmenting Negative Summaries from Fake Documents", "authors": "Tianshu Wang, Faisal Ladhak, Esin Durmus and He He", "abstract": "Current abstractive summarization systems tend to hallucinate content that is unfaithful to the source document, posing a risk of misinformation. To mitigate hallucination, we must teach the model to distinguish hallucinated summaries from faithful ones. However, the commonly used maximum likelihood training does not disentangle factual errors from other model errors. To address this issue,\nwe propose a back-translation-style approach to augment negative samples that mimic factual errors made by the model. Specifically, we train an elaboration model that generates hallucinated documents given the reference summaries, and then generates negative summaries from the fake documents. We incorporate the negative samples into training through a controlled generator, which produces faithful/unfaithful summaries conditioned on the control codes. Additionally, we find that adding textual entailment data through multitasking further boosts the performance. Experiments on three datasets (XSum, Gigaword, and WikiHow) show that our method consistently improves faithfulness without sacrificing informativeness according to both human and automatic evaluation", "track": "Summarization", "label": 14, "url": ""}, {"loc": [0.5536993145942688, 7.035636901855469], "id": 4589, "title": "Joint Completion and Alignment of Multilingual Knowledge Graphs", "authors": "Soumen Chakrabarti, Harkanwar Singh, Shubham Lohiya, Prachi Jain and Mausam", "abstract": "Knowledge Graph Completion (KGC) predicts missing facts in an incomplete Knowledge Graph (KG). Multilingual KGs associate entities and relations with surface forms written in different languages. An entity or relation may be associated with distinct IDs in different KGs, necessitating entity alignment (EA) and relation alignment (RA). Many effective algorithms have been proposed for completion and alignment as separate tasks. Here we show that these tasks are synergistic and best solved together. Our multitask approach starts with a state-of-the-art KG embedding scheme, but adds a novel relation representation based on sets of embeddings of (subject, object) entity pairs. This representation leads to a new relation alignment loss term based on a maximal bipartite matching between two sets of embedding vectors.  This loss is combined with traditional KGC loss and optionally, losses based on text embeddings of entity (and relation) names. In experiments over KGs in seven languages, we find that our system achieves large improvements in KGC compared to a strong completion model that combines known facts in all languages. It also outperforms strong EA and RA baselines, underscoring the value of joint alignment and completion.", "track": "Multilinguality", "label": 13, "url": ""}, {"loc": [4.616734504699707, 6.277368545532227], "id": 4592, "title": "Offer a Different Perspective: Modeling the Belief Alignment of Arguments in Multi-party Debates", "authors": "Suzanna Sia, Kokil Jaidka, Hansin Ahuja, Niyati Chhaya and Kevin Duh", "abstract": "In contexts where debate and deliberation are the norm, the participants are regularly presented with new information that conflicts with their original beliefs. When required to update their beliefs (belief alignment), they may choose arguments that align with their worldview (confirmation bias). We test this and competing hypotheses in a constraint-based modeling approach to predict the winning arguments in multi-party interactions in the Reddit Change My View and Intelligence Squared debates datasets. We adopt a hierarchical generative Variational Autoencoder as our model and impose structural constraints that reflect competing hypotheses about the nature of argumentation. Our findings suggest that in most settings, predictive models that anticipate winning arguments to be further from the initial argument of the opinion holder are more likely to succeed.", "track": "Computational Social Science and Cultural Analytics", "label": 20, "url": ""}, {"loc": [7.500738143920898, 12.303512573242188], "id": 4594, "title": "A Federated Approach to Predicting Emojis in Hindi Tweets", "authors": "Deep Rajesh Gandhi, Jash Jayesh Mehta, Nirali Parekh, Karan Waghela, Lynette D'Mello and Zeerak Talat", "abstract": "The use of emojis affords a visual modality to, often private, textual communication.\nThe task of predicting emojis however provides a challenge for machine learning as emoji use tends to cluster into the frequently used and the rarely used emojis.\nMuch of the machine learning research on emoji use has focused on high resource languages and has conceptualised the task of predicting emojis around traditional server-side machine learning approaches.\nHowever, traditional machine learning approaches for private communication can introduce privacy concerns, as these approaches require all data to be transmitted to a central storage.\nIn this paper, we seek to address the dual concerns of emphasising high resource languages for emoji prediction and risking the privacy of people's data.\nWe introduce a new dataset of 118k tweets (augmented from 25k unique tweets) for emoji prediction in Hindi, and propose a modification to the federated learning algorithm, CausalFedGSD, which aims to strike a balance between model performance and user privacy. We show that our approach obtains comparative scores with more complex centralised models while reducing the amount of data required to optimise the models and minimising risks to user privacy.", "track": "NLP Applications", "label": 0, "url": "https://www.semanticscholar.org/reader/e4f2265f020ca0f9d5cb6ad0178313dc2e1871e9?experiments=&features=reader_skimming%3Atrue"}, {"loc": [4.06273078918457, 7.032609939575195], "id": 4595, "title": "Injecting Domain Knowledge in Language Models for Task-oriented Dialogue Systems", "authors": "Denis Emelin, Daniele Bonadiman, Sawsan Alqahtani, Yi Zhang and Saab Mansour", "abstract": "Pre-trained language models (PLM) have advanced the state-of-the-art across NLP applications, but lack domain-specific knowledge that does not naturally occur in pre-training data. Previous studies augmented PLMs with symbolic knowledge for different downstream NLP tasks. However, knowledge bases (KBs) utilized in these studies are usually large-scale and static, in contrast to small, domain-specific, and modifiable knowledge bases that are prominent in real-world task-oriented dialogue (TOD) systems. In this paper, we showcase the advantages of injecting domain-specific knowledge prior to fine-tuning on TOD tasks. To this end, we utilize light-weight adapters that can be easily integrated with PLMs and serve as a repository for facts learned from different KBs. To measure the efficacy of proposed knowledge injection methods, we introduce Knowledge Probing using Response Selection (KPRS) -- a probe designed specifically for TOD models. Experiments on KPRS and the response generation task show improvements of knowledge injection with adapters over strong baselines.", "track": "Dialogue and Interactive Systems", "label": 4, "url": ""}, {"loc": [3.3480262756347656, 4.083223819732666], "id": 4603, "title": "TASA: Deceiving Question Answering Models by Twin Answer Sentences Attack", "authors": "Yu Cao, Dianqi Li, Meng Fang, Tianyi Zhou, Jun Gao, Yibing Zhan and Dacheng Tao", "abstract": "We present Twin Answer Sentences Attack (TASA), an adversarial attack method for question answering (QA) models that produces fluent and grammatical adversarial contexts while maintaining gold answers. Despite phenomenal progress on general adversarial attacks, few works have investigated the vulnerability and attack specifically for QA models. In this work, we first explore the biases in the existing models and discover that they mainly rely on keyword matching between the question and context, and ignore the relevant contextual relations for answer prediction.\nBased on two biases above, TASA attacks the target model in two folds: (1) lowering the model's confidence on the gold answer with a perturbed answer sentence; \n(2) misguiding the model towards a wrong answer with a distracting answer sentence. Equipped with designed beam search and filtering methods, TASA can generate more effective attacks than existing textual attack methods while sustaining the quality of contexts, in extensive experiments on five QA datasets and human evaluations.", "track": "Interpretability, Interactivity and Analysis of Models for NLP", "label": 9, "url": "https://www.semanticscholar.org/reader/fe36f5fa06eabc57a59c5da95887c33d8c67efa1?experiments=&features=reader_skimming%3Atrue"}, {"loc": [9.21965217590332, 6.348487377166748], "id": 4604, "title": "Improving Low-Resource Languages in Pre-Trained Multilingual Language Models", "authors": "Viktor Hangya, Hossain Shaikh Saadi and Alexander Fraser", "abstract": "Pre-trained multilingual language models are the foundation of many NLP approaches, including cross-lingual transfer solutions. However, languages with small available monolingual corpora are often not well-supported by these models leading to poor performance. We propose an unsupervised approach to improve the cross-lingual representations of low-resource languages by bootstrapping word translation pairs from monolingual corpora and using them to improve language alignment in pre-trained language models. We perform experiments on nine languages, using contextual word retrieval and zero-shot named entity recognition to measure both intrinsic cross-lingual word representation quality and downstream task performance, showing improvements on both tasks. Our results show that it is possible to improve pre-trained multilingual language models by relying only on non-parallel resources.", "track": "Multilinguality", "label": 13, "url": ""}, {"loc": [3.967482566833496, 9.883973121643066], "id": 4607, "title": "SCROLLS: Standardized CompaRison Over Long Language Sequences", "authors": "Uri Shaham, Elad Segal, Maor Ivgi, Avia Efrat, Ori Yoran, Adi Haviv, Ankit Gupta, Wenhan Xiong, Mor Geva, Jonathan Berant and Omer Levy", "abstract": "NLP benchmarks have largely focused on short texts, such as sentences and paragraphs, even though long texts comprise a considerable amount of natural language in the wild. We introduce SCROLLS, a suite of tasks that require reasoning over long texts. We examine existing long-text datasets, and handpick ones where the text is naturally long, while prioritizing tasks that involve synthesizing information across the input. SCROLLS contains summarization, question answering, and natural language inference tasks, covering multiple domains, including literature, science, business, and entertainment. Initial baselines, including Longformer Encoder-Decoder, indicate that there is ample room for improvement on SCROLLS. We make all datasets available in a unified text-to-text format and host a live leaderboard to facilitate research on model architecture and pretraining methods.", "track": "Resources and Evaluation", "label": 1, "url": "https://www.semanticscholar.org/reader/6281c40c66febca1d8003bcc6fdfd2189b30c38f?experiments=&features=reader_skimming%3Atrue"}, {"loc": [4.681589603424072, 6.0058979988098145], "id": 4608, "title": "PAR: Political Actor Representation Learning with Social Context and Expert Knowledge", "authors": "Shangbin Feng, Zhaoxuan Tan, Zilong Chen, Ningnan Wang, Peisheng Yu, Qinghua Zheng, Xiaojun Chang and Minnan Luo", "abstract": "Modeling the ideological perspectives of political actors is an essential task in computational political science with applications in many downstream tasks. Existing approaches are generally limited to textual data and voting records, while they neglect the rich social context and valuable expert knowledge for holistic ideological analysis. In this paper, we propose PAR, a Political Actor Representation learning framework that jointly leverages social context and expert knowledge. Specifically, we retrieve and extract factual statements about legislators to leverage social context information. We then construct a heterogeneous information network to incorporate social context and use relational graph neural networks to learn legislator representations. Finally, we train PAR with three objectives to align representation learning with expert knowledge, model ideological stance consistency, and simulate the echo chamber phenomenon. Extensive experiments demonstrate that PAR is better at augmenting political text understanding and successfully advances the state-of-the-art in political perspective detection and roll call vote prediction. Further analysis proves that PAR learns representations that reflect the political reality and provide new insights into political behavior.", "track": "NLP Applications", "label": 0, "url": "https://www.semanticscholar.org/reader/b4c9b57c0d9aacfa98db6247015def1826172bbd?experiments=&features=reader_skimming%3Atrue"}, {"loc": [5.776094913482666, 12.05517578125], "id": 4613, "title": "JDDC 2.1: A Multimodal Chinese Dialogue Dataset with Joint Tasks of Query Rewriting, Response Generation, Discourse Parsing, and  Summarization", "authors": "Nan Zhao, Haoran Li, Youzheng Wu and Xiaodong He", "abstract": "The popularity of multimodal dialogue has stimulated the need for a new generation of dialogue agents with multimodal interactivity.\nWhen users communicate with customer service, they may express their requirements by means of text, images, or even videos. \nVisual information usually acts as discriminators for product models, or indicators of product failures, which play an important role in the E-commerce scenario.\nOn the other hand, detailed information provided by the images is limited, and typically, customer service systems cannot understand the intent of users without the input text.\nThus, bridging the gap between the image and text is crucial for communicating with customers.\nIn this paper, we construct JDDC 2.1, a large-scale multimodal multi-turn dialogue dataset collected from a mainstream Chinese E-commerce platform, containing about 246K dialogue sessions, 3M utterances, and 507K images, along with product knowledge bases and image category annotations. \nOver our dataset, we jointly define four tasks: \nthe multimodal dialogue response generation task,\nthe multimodal query rewriting task, the multimodal dialogue discourse parsing task, and the multimodal dialogue summarization task.\nJDDC 2.1 is the first corpus with annotations for all the above tasks over the same dialogue sessions, which facilitates the comprehensive research around the dialogue.\nIn addition, we present several text-only and multimodal baselines and show the importance of visual information for these tasks. Our dataset and implements will be publicly available.", "track": "Resources and Evaluation", "label": 1, "url": ""}, {"loc": [8.05459213256836, 5.738705158233643], "id": 4618, "title": "PCL: Peer-Contrastive Learning with Diverse Augmentations for Unsupervised Sentence Embeddings", "authors": "Qiyu Wu, Chongyang Tao, Tao Shen, Can Xu, Xiubo Geng and Daxin Jiang", "abstract": "Learning sentence embeddings in an unsupervised manner is fundamental in natural language processing. Recent common practice is to couple pre-trained language models with unsupervised contrastive learning, whose success relies on augmenting a sentence with a semantically-close positive instance to construct contrastive pairs. Nonetheless, existing approaches usually depend on a mono-augmenting strategy, which causes learning shortcuts towards the augmenting biases and thus corrupts the quality of sentence embeddings. A straightforward solution is resorting to more diverse positives from a multi-augmenting strategy, while an open question remains about how to unsupervisedly learn from the diverse positives but with uneven augmenting qualities in the text field. As one answer, we propose a novel Peer-Contrastive Learning (PCL) with diverse augmentations. PCL constructs diverse contrastive positives and negatives at the group level for unsupervised sentence embeddings. PCL performs peer-positive contrast as well as peer-network cooperation, which offers an inherent anti-bias ability and an effective way to learn from diverse augmentations. Experiments on STS benchmarks verify the effectiveness of PCL against its competitors in unsupervised sentence embeddings.", "track": "Semantics: Lexical, Sentence level, Textual Inference and Other areas", "label": 8, "url": "https://www.semanticscholar.org/reader/11500f6a5a5f00969b7600a8047e0c08ece4d9d2?experiments=&features=reader_skimming%3Atrue"}, {"loc": [10.770026206970215, 6.930694103240967], "id": 4621, "title": "Digging Errors in NMT: Evaluating and Understanding Model Errors from Partial Hypothesis Space", "authors": "Jianhao Yan, Chenming Wu, Fandong Meng and Jie Zhou", "abstract": "Solid evaluation of neural machine translation (NMT) is key to its understanding and improvement. Current evaluation of an NMT system is usually built upon a heuristic decoding algorithm (e.g., beam search) and an evaluation metric assessing similarity between the translation and golden reference. However, this system-level evaluation framework is limited by evaluating only one best hypothesis and search errors brought by heuristic decoding algorithms. To better understand NMT models, we propose a novel evaluation protocol, which defines model errors with model's ranking capability over hypothesis space. To tackle the problem of exponentially large space, we propose two approximation methods, top region evaluation along with an exact top-k decoding algorithm, which finds top-ranked hypotheses in the whole hypothesis space, and Monte Carlo sampling evaluation, which simulates hypothesis space from a broader perspective. To quantify errors, we define our NMT model errors by measuring distance between the hypothesis array ranked by the model and the ideally ranked hypothesis array. After confirming the strong correlation with human judgment, we apply our evaluation to various NMT benchmarks and model architectures. We show that the state-of-the-art Transformer models face serious ranking issues and only perform at the random chance level in the top region. We further analyze model errors on architectures with different depths and widths, as well as different data-augmentation techniques, showing how these factors affect model errors. Finally, we connect model errors with the search algorithms and provide interesting findings of beam search inductive bias and correlation with Minimum Bayes Risk (MBR) decoding.", "track": "Machine Translation", "label": 10, "url": "https://www.semanticscholar.org/reader/90f7cbdc6f649f1b058df0bab1b9e52a86c28d76?experiments=&features=reader_skimming%3Atrue"}, {"loc": [4.0284504890441895, 7.303844928741455], "id": 4622, "title": "DialogConv: A Lightweight Fully Convolutional Network for Multi-view Response Selection", "authors": "Yongkang Liu, Shi Feng, Wei Gao, Daling Wang and Yifei Zhang", "abstract": "Current end-to-end retrieval-based dialogue systems are mainly based on Recurrent Neural Networks or Transformers with attention \nmechanisms. Although promising results have been achieved, these models often suffer from slow inference or huge number of parameters. In this paper, we propose a novel lightweight fully convolutional architecture, called DialogConv, for response selection. DialogConv is exclusively built on top of convolution to extract matching features of context and response. Dialogues are modeled in 3D views, where DialogConv performs convolution operations on embedding view, word view and utterance view to capture richer semantic information from multiple contextual views. On the four benchmark datasets, compared with state-of-the-art baselines, DialogConv is on average about 8.5x smaller in size, and 79.39x and 10.64x faster on CPU and GPU devices, respectively. At the same time, DialogConv achieves the competitive effectiveness of response selection.", "track": "Dialogue and Interactive Systems", "label": 4, "url": "https://www.semanticscholar.org/reader/36b1bb9d1149586ae4e9a1867a179760051028e9?experiments=&features=reader_skimming%3Atrue"}]
-var labels = ["NLP Applications", "Resources and Evaluation", "Language Modeling and Analysis of Language Models", "Machine Learning for NLP", "Dialogue and Interactive Systems", "Information Extraction", "Natural Language Generation", "Speech, Vision, Robotics, Multimodal Grounding", "Semantics: Lexical, Sentence level, Textual Inference and Other areas", "Interpretability, Interactivity and Analysis of Models for NLP", "Machine Translation", "Question Answering", "Efficient Methods for NLP", "Multilinguality", "Summarization", "Information Retrieval and Text Mining", "Sentiment Analysis, Stylistic Analysis, and Argument Mining", "Unsupervised and Weakly-Supervised Methods in NLP", "Theme Track", "Commonsense Reasoning", "Computational Social Science and Cultural Analytics", "Ethics", "Linguistic Theories, Cognitive Modeling and Psycholinguistics", "Syntax, Parsing and their Applications", "Discourse and Pragmatics", "Phonology, Morphology and Word Segmentation", "Ethic Concerns:Ethics", "Ethic Concerns:Resources and Evaluation", "Ethic Concerns:Speech, Vision, Robotics, Multimodal Grounding", "Ethic Concerns:Unsupervised and Weakly-Supervised Methods in NLP", "Ethic Concerns:Language Modeling and Analysis of Language Models", "Ethic Concerns:Dialogue and Interactive Systems", "Ethic Concerns:Multilinguality", "Ethic Concerns:Linguistic Theories, Cognitive Modeling and Psycholinguistics", "Ethic Concerns:NLP Applications", "Ethic Concerns:Efficient Methods for NLP", "Ethic Concerns:Theme Track", "Ethic Concerns:Summarization", "Ethic Concerns:Discourse and Pragmatics", "Ethic Concerns:Computational Social Science and Cultural Analytics", "Ethic Concerns:Sentiment Analysis, Stylistic Analysis, and Argument Mining"];
diff --git a/spaces/manavisrani07/gradio-lipsync-wav2lip/basicsr/utils/registry.py b/spaces/manavisrani07/gradio-lipsync-wav2lip/basicsr/utils/registry.py
deleted file mode 100644
index 5e72ef7ff21b94f50e6caa8948f69ca0b04bc968..0000000000000000000000000000000000000000
--- a/spaces/manavisrani07/gradio-lipsync-wav2lip/basicsr/utils/registry.py
+++ /dev/null
@@ -1,88 +0,0 @@
-# Modified from: https://github.com/facebookresearch/fvcore/blob/master/fvcore/common/registry.py  # noqa: E501
-
-
-class Registry():
-    """
-    The registry that provides name -> object mapping, to support third-party
-    users' custom modules.
-
-    To create a registry (e.g. a backbone registry):
-
-    .. code-block:: python
-
-        BACKBONE_REGISTRY = Registry('BACKBONE')
-
-    To register an object:
-
-    .. code-block:: python
-
-        @BACKBONE_REGISTRY.register()
-        class MyBackbone():
-            ...
-
-    Or:
-
-    .. code-block:: python
-
-        BACKBONE_REGISTRY.register(MyBackbone)
-    """
-
-    def __init__(self, name):
-        """
-        Args:
-            name (str): the name of this registry
-        """
-        self._name = name
-        self._obj_map = {}
-
-    def _do_register(self, name, obj, suffix=None):
-        if isinstance(suffix, str):
-            name = name + '_' + suffix
-
-        assert (name not in self._obj_map), (f"An object named '{name}' was already registered "
-                                             f"in '{self._name}' registry!")
-        self._obj_map[name] = obj
-
-    def register(self, obj=None, suffix=None):
-        """
-        Register the given object under the the name `obj.__name__`.
-        Can be used as either a decorator or not.
-        See docstring of this class for usage.
-        """
-        if obj is None:
-            # used as a decorator
-            def deco(func_or_class):
-                name = func_or_class.__name__
-                self._do_register(name, func_or_class, suffix)
-                return func_or_class
-
-            return deco
-
-        # used as a function call
-        name = obj.__name__
-        self._do_register(name, obj, suffix)
-
-    def get(self, name, suffix='basicsr'):
-        ret = self._obj_map.get(name)
-        if ret is None:
-            ret = self._obj_map.get(name + '_' + suffix)
-            print(f'Name {name} is not found, use name: {name}_{suffix}!')
-        if ret is None:
-            raise KeyError(f"No object named '{name}' found in '{self._name}' registry!")
-        return ret
-
-    def __contains__(self, name):
-        return name in self._obj_map
-
-    def __iter__(self):
-        return iter(self._obj_map.items())
-
-    def keys(self):
-        return self._obj_map.keys()
-
-
-DATASET_REGISTRY = Registry('dataset')
-ARCH_REGISTRY = Registry('arch')
-MODEL_REGISTRY = Registry('model')
-LOSS_REGISTRY = Registry('loss')
-METRIC_REGISTRY = Registry('metric')
diff --git a/spaces/marcusj83/MusicGenbruh/tests/common_utils/temp_utils.py b/spaces/marcusj83/MusicGenbruh/tests/common_utils/temp_utils.py
deleted file mode 100644
index d1e0367e979c8b9fea65472c373916d956ad5aaa..0000000000000000000000000000000000000000
--- a/spaces/marcusj83/MusicGenbruh/tests/common_utils/temp_utils.py
+++ /dev/null
@@ -1,56 +0,0 @@
-# Copyright (c) Meta Platforms, Inc. and affiliates.
-# All rights reserved.
-#
-# This source code is licensed under the license found in the
-# LICENSE file in the root directory of this source tree.
-
-import os
-import tempfile
-
-
-class TempDirMixin:
-    """Mixin to provide easy access to temp dir.
-    """
-
-    temp_dir_ = None
-
-    @classmethod
-    def get_base_temp_dir(cls):
-        # If AUDIOCRAFT_TEST_DIR is set, use it instead of temporary directory.
-        # this is handy for debugging.
-        key = "AUDIOCRAFT_TEST_DIR"
-        if key in os.environ:
-            return os.environ[key]
-        if cls.temp_dir_ is None:
-            cls.temp_dir_ = tempfile.TemporaryDirectory()
-        return cls.temp_dir_.name
-
-    @classmethod
-    def tearDownClass(cls):
-        if cls.temp_dir_ is not None:
-            try:
-                cls.temp_dir_.cleanup()
-                cls.temp_dir_ = None
-            except PermissionError:
-                # On Windows there is a know issue with `shutil.rmtree`,
-                # which fails intermittenly.
-                # https://github.com/python/cpython/issues/74168
-                # Following the above thread, we ignore it.
-                pass
-        super().tearDownClass()
-
-    @property
-    def id(self):
-        return self.__class__.__name__
-
-    def get_temp_path(self, *paths):
-        temp_dir = os.path.join(self.get_base_temp_dir(), self.id)
-        path = os.path.join(temp_dir, *paths)
-        os.makedirs(os.path.dirname(path), exist_ok=True)
-        return path
-
-    def get_temp_dir(self, *paths):
-        temp_dir = os.path.join(self.get_base_temp_dir(), self.id)
-        path = os.path.join(temp_dir, *paths)
-        os.makedirs(path, exist_ok=True)
-        return path
diff --git a/spaces/marlenezw/audio-driven-animations/MakeItTalk/main_end2end.py b/spaces/marlenezw/audio-driven-animations/MakeItTalk/main_end2end.py
deleted file mode 100644
index e1368d5e748aa234fab4e5a12b0fd4466fb636ec..0000000000000000000000000000000000000000
--- a/spaces/marlenezw/audio-driven-animations/MakeItTalk/main_end2end.py
+++ /dev/null
@@ -1,183 +0,0 @@
-"""
- # Copyright 2020 Adobe
- # All Rights Reserved.
- 
- # NOTICE: Adobe permits you to use, modify, and distribute this file in
- # accordance with the terms of the Adobe license agreement accompanying
- # it.
- 
-"""
-
-import sys
-sys.path.append('thirdparty/AdaptiveWingLoss')
-import os, glob
-import numpy as np
-import cv2
-import argparse
-from src.approaches.train_image_translation import Image_translation_block
-import torch
-import pickle
-import face_alignment
-from src.autovc.AutoVC_mel_Convertor_retrain_version import AutoVC_mel_Convertor
-import shutil
-import util.utils as util
-from scipy.signal import savgol_filter
-from download import download_file
-
-from src.approaches.train_audio2landmark import Audio2landmark_model
-
-default_head_name = 'dali'
-ADD_NAIVE_EYE = True
-CLOSE_INPUT_FACE_MOUTH = False
-
-auto_vc_model_path = download_file(repo_name='marlenezw/AutoVC_Voice_Conversion', filename='ckpt_autovc.pth')
-speaker_model_path = download_file(repo_name='marlenezw/Self_Attention_Network', filename='ckpt_speaker_branch.pth')
-
-
-parser = argparse.ArgumentParser()
-parser.add_argument('--jpg', type=str, default='{}.jpg'.format(default_head_name))
-parser.add_argument('--close_input_face_mouth', default=CLOSE_INPUT_FACE_MOUTH, action='store_true')
-
-parser.add_argument('--load_AUTOVC_name', type=str, default=auto_vc_model_path)
-parser.add_argument('--load_a2l_G_name', type=str, default=speaker_model_path)
-parser.add_argument('--load_a2l_C_name', type=str, default='MakeItTalk/examples/ckpt/ckpt_content_branch.pth') #ckpt_audio2landmark_c.pth')
-parser.add_argument('--load_G_name', type=str, default='MakeItTalk/examples/ckpt/ckpt_116_i2i_comb.pth') #ckpt_image2image.pth') #ckpt_i2i_finetune_150.pth') #c
-
-parser.add_argument('--amp_lip_x', type=float, default=2.)
-parser.add_argument('--amp_lip_y', type=float, default=2.)
-parser.add_argument('--amp_pos', type=float, default=.5)
-parser.add_argument('--reuse_train_emb_list', type=str, nargs='+', default=[]) #  ['iWeklsXc0H8']) #['45hn7-LXDX8']) #['E_kmpT-EfOg']) #'iWeklsXc0H8', '29k8RtSUjE0', '45hn7-LXDX8',
-parser.add_argument('--add_audio_in', default=False, action='store_true')
-parser.add_argument('--comb_fan_awing', default=False, action='store_true')
-parser.add_argument('--output_folder', type=str, default='MakeItTalk/examples')
-
-parser.add_argument('--test_end2end', default=True, action='store_true')
-parser.add_argument('--dump_dir', type=str, default='', help='')
-parser.add_argument('--pos_dim', default=7, type=int)
-parser.add_argument('--use_prior_net', default=True, action='store_true')
-parser.add_argument('--transformer_d_model', default=32, type=int)
-parser.add_argument('--transformer_N', default=2, type=int)
-parser.add_argument('--transformer_heads', default=2, type=int)
-parser.add_argument('--spk_emb_enc_size', default=16, type=int)
-parser.add_argument('--init_content_encoder', type=str, default='')
-parser.add_argument('--lr', type=float, default=1e-3, help='learning rate')
-parser.add_argument('--reg_lr', type=float, default=1e-6, help='weight decay')
-parser.add_argument('--write', default=False, action='store_true')
-parser.add_argument('--segment_batch_size', type=int, default=1, help='batch size')
-parser.add_argument('--emb_coef', default=3.0, type=float)
-parser.add_argument('--lambda_laplacian_smooth_loss', default=1.0, type=float)
-parser.add_argument('--use_11spk_only', default=False, action='store_true')
-
-opt_parser = parser.parse_args()
-
-''' STEP 1: preprocess input single image '''
-img =cv2.imread('MakeItTalk/examples/' + opt_parser.jpg)
-predictor = face_alignment.FaceAlignment(face_alignment.LandmarksType._3D, device='cuda', flip_input=True)
-shapes = predictor.get_landmarks(img)
-if (not shapes or len(shapes) != 1):
-    print('Cannot detect face landmarks. Exit.')
-    exit(-1)
-shape_3d = shapes[0]
-
-if(opt_parser.close_input_face_mouth):
-    util.close_input_face_mouth(shape_3d)
-
-
-''' Additional manual adjustment to input face landmarks (slimmer lips and wider eyes) '''
-# shape_3d[48:, 0] = (shape_3d[48:, 0] - np.mean(shape_3d[48:, 0])) * 0.95 + np.mean(shape_3d[48:, 0])
-shape_3d[49:54, 1] += 1.
-shape_3d[55:60, 1] -= 1.
-shape_3d[[37,38,43,44], 1] -=2
-shape_3d[[40,41,46,47], 1] +=2
-
-
-''' STEP 2: normalize face as input to audio branch '''
-shape_3d, scale, shift = util.norm_input_face(shape_3d)
-
-
-''' STEP 3: Generate audio data as input to audio branch '''
-# audio real data
-au_data = []
-au_emb = []
-ains = glob.glob1('MakeItTalk/examples', '*.wav')
-ains = [item for item in ains if item != 'tmp.wav']
-ains.sort()
-for ain in ains:
-    os.system('ffmpeg -y -loglevel error -i MakeItTalk/examples/{} -ar 16000 MakeItTalk/examples/tmp.wav'.format(ain))
-    shutil.copyfile('MakeItTalk/examples/tmp.wav', 'MakeItTalk/examples/{}'.format(ain))
-
-    # au embedding
-    from thirdparty.resemblyer_util.speaker_emb import get_spk_emb
-    me, ae = get_spk_emb('MakeItTalk/examples/{}'.format(ain))
-    au_emb.append(me.reshape(-1))
-
-    print('Processing audio file', ain)
-    c = AutoVC_mel_Convertor('MakeItTalk/examples')
-
-    au_data_i = c.convert_single_wav_to_autovc_input(audio_filename=os.path.join('MakeItTalk/examples', ain),
-           autovc_model_path=opt_parser.load_AUTOVC_name)
-    au_data += au_data_i
-if(os.path.isfile('MakeItTalk/examples/tmp.wav')):
-    os.remove('MakeItTalk/examples/tmp.wav')
-
-# landmark fake placeholder
-fl_data = []
-rot_tran, rot_quat, anchor_t_shape = [], [], []
-for au, info in au_data:
-    au_length = au.shape[0]
-    fl = np.zeros(shape=(au_length, 68 * 3))
-    fl_data.append((fl, info))
-    rot_tran.append(np.zeros(shape=(au_length, 3, 4)))
-    rot_quat.append(np.zeros(shape=(au_length, 4)))
-    anchor_t_shape.append(np.zeros(shape=(au_length, 68 * 3)))
-
-if(os.path.exists(os.path.join('MakeItTalk/examples', 'dump', 'random_val_fl.pickle'))):
-    os.remove(os.path.join('MakeItTalk/examples', 'dump', 'random_val_fl.pickle'))
-if(os.path.exists(os.path.join('MakeItTalk/examples', 'dump', 'random_val_fl_interp.pickle'))):
-    os.remove(os.path.join('MakeItTalk/examples', 'dump', 'random_val_fl_interp.pickle'))
-if(os.path.exists(os.path.join('MakeItTalk/examples', 'dump', 'random_val_au.pickle'))):
-    os.remove(os.path.join('MakeItTalk/examples', 'dump', 'random_val_au.pickle'))
-if (os.path.exists(os.path.join('MakeItTalk/examples', 'dump', 'random_val_gaze.pickle'))):
-    os.remove(os.path.join('MakeItTalk/examples', 'dump', 'random_val_gaze.pickle'))
-
-with open(os.path.join('MakeItTalk/examples', 'dump', 'random_val_fl.pickle'), 'wb') as fp:
-    pickle.dump(fl_data, fp)
-with open(os.path.join('MakeItTalk/examples', 'dump', 'random_val_au.pickle'), 'wb') as fp:
-    pickle.dump(au_data, fp)
-with open(os.path.join('MakeItTalk/examples', 'dump', 'random_val_gaze.pickle'), 'wb') as fp:
-    gaze = {'rot_trans':rot_tran, 'rot_quat':rot_quat, 'anchor_t_shape':anchor_t_shape}
-    pickle.dump(gaze, fp)
-
-
-''' STEP 4: RUN audio->landmark network'''
-model = Audio2landmark_model(opt_parser, jpg_shape=shape_3d)
-if(len(opt_parser.reuse_train_emb_list) == 0):
-    model.test(au_emb=au_emb)
-else:
-    model.test(au_emb=None)
-
-
-''' STEP 5: de-normalize the output to the original image scale '''
-fls = glob.glob1('MakeItTalk/examples', 'pred_fls_*.txt') #it looks like fls is the name of our desired output video but as a group of numpy arrays in a txt file 
-fls.sort()
-
-for i in range(0,len(fls)):
-    fl = np.loadtxt(os.path.join('MakeItTalk/examples', fls[i])).reshape((-1, 68,3)) #this is our desired image loaded into numpy ndarray. Data read from the text file.
-    fl[:, :, 0:2] = -fl[:, :, 0:2] #i think this is adjusting the color
-    fl[:, :, 0:2] = fl[:, :, 0:2] / scale - shift #an ndarray image array is (H, W, D) i.e. (height, width, depth), so we are adjusting depth here 
-
-    if (ADD_NAIVE_EYE):
-        fl = util.add_naive_eye(fl)
-
-    # additional smooth
-    fl = fl.reshape((-1, 204))
-    fl[:, :48 * 3] = savgol_filter(fl[:, :48 * 3], 15, 3, axis=0)
-    fl[:, 48*3:] = savgol_filter(fl[:, 48*3:], 5, 3, axis=0)
-    fl = fl.reshape((-1, 68, 3))
-
-    ''' STEP 6: Imag2image translation '''
-    model = Image_translation_block(opt_parser, single_test=True)
-    with torch.no_grad():
-        model.single_test(jpg=img, fls=fl, filename=fls[i], prefix=opt_parser.jpg.split('.')[0]) #fls is the video we want
-        print('finish image2image gen')
-    os.remove(os.path.join('MakeItTalk/examples', fls[i]))
diff --git a/spaces/matthoffner/chatbot-mini/components/Chat/SystemPrompt.tsx b/spaces/matthoffner/chatbot-mini/components/Chat/SystemPrompt.tsx
deleted file mode 100644
index 821840bc3a50160847c07571666ea5868bb39458..0000000000000000000000000000000000000000
--- a/spaces/matthoffner/chatbot-mini/components/Chat/SystemPrompt.tsx
+++ /dev/null
@@ -1,243 +0,0 @@
-import {
-  FC,
-  KeyboardEvent,
-  useCallback,
-  useEffect,
-  useRef,
-  useState,
-} from 'react';
-
-import { useTranslation } from 'next-i18next';
-
-import { DEFAULT_SYSTEM_PROMPT } from '@/utils/app/const';
-
-import { Conversation } from '@/types/chat';
-import { Prompt } from '@/types/prompt';
-
-import { PromptList } from './PromptList';
-import { VariableModal } from './VariableModal';
-
-interface Props {
-  conversation: Conversation;
-  prompts: Prompt[];
-  onChangePrompt: (prompt: string) => void;
-}
-
-export const SystemPrompt: FC<Props> = ({
-  conversation,
-  prompts,
-  onChangePrompt,
-}) => {
-  const { t } = useTranslation('chat');
-
-  const [value, setValue] = useState<string>('');
-  const [activePromptIndex, setActivePromptIndex] = useState(0);
-  const [showPromptList, setShowPromptList] = useState(false);
-  const [promptInputValue, setPromptInputValue] = useState('');
-  const [variables, setVariables] = useState<string[]>([]);
-  const [isModalVisible, setIsModalVisible] = useState(false);
-
-  const textareaRef = useRef<HTMLTextAreaElement>(null);
-  const promptListRef = useRef<HTMLUListElement | null>(null);
-
-  const filteredPrompts = prompts.filter((prompt) =>
-    prompt.name.toLowerCase().includes(promptInputValue.toLowerCase()),
-  );
-
-  const handleChange = (e: React.ChangeEvent<HTMLTextAreaElement>) => {
-    const value = e.target.value;
-    const maxLength = conversation.model.maxLength;
-
-    if (value.length > maxLength) {
-      alert(
-        t(
-          `Prompt limit is {{maxLength}} characters. You have entered {{valueLength}} characters.`,
-          { maxLength, valueLength: value.length },
-        ),
-      );
-      return;
-    }
-
-    setValue(value);
-    updatePromptListVisibility(value);
-
-    if (value.length > 0) {
-      onChangePrompt(value);
-    }
-  };
-
-  const handleInitModal = () => {
-    const selectedPrompt = filteredPrompts[activePromptIndex];
-    setValue((prevVal) => {
-      const newContent = prevVal?.replace(/\/\w*$/, selectedPrompt.content);
-      return newContent;
-    });
-    handlePromptSelect(selectedPrompt);
-    setShowPromptList(false);
-  };
-
-  const parseVariables = (content: string) => {
-    const regex = /{{(.*?)}}/g;
-    const foundVariables = [];
-    let match;
-
-    while ((match = regex.exec(content)) !== null) {
-      foundVariables.push(match[1]);
-    }
-
-    return foundVariables;
-  };
-
-  const updatePromptListVisibility = useCallback((text: string) => {
-    const match = text.match(/\/\w*$/);
-
-    if (match) {
-      setShowPromptList(true);
-      setPromptInputValue(match[0].slice(1));
-    } else {
-      setShowPromptList(false);
-      setPromptInputValue('');
-    }
-  }, []);
-
-  const handlePromptSelect = (prompt: Prompt) => {
-    const parsedVariables = parseVariables(prompt.content);
-    setVariables(parsedVariables);
-
-    if (parsedVariables.length > 0) {
-      setIsModalVisible(true);
-    } else {
-      const updatedContent = value?.replace(/\/\w*$/, prompt.content);
-
-      setValue(updatedContent);
-      onChangePrompt(updatedContent);
-
-      updatePromptListVisibility(prompt.content);
-    }
-  };
-
-  const handleSubmit = (updatedVariables: string[]) => {
-    const newContent = value?.replace(/{{(.*?)}}/g, (match, variable) => {
-      const index = variables.indexOf(variable);
-      return updatedVariables[index];
-    });
-
-    setValue(newContent);
-    onChangePrompt(newContent);
-
-    if (textareaRef && textareaRef.current) {
-      textareaRef.current.focus();
-    }
-  };
-
-  const handleKeyDown = (e: KeyboardEvent<HTMLTextAreaElement>) => {
-    if (showPromptList) {
-      if (e.key === 'ArrowDown') {
-        e.preventDefault();
-        setActivePromptIndex((prevIndex) =>
-          prevIndex < prompts.length - 1 ? prevIndex + 1 : prevIndex,
-        );
-      } else if (e.key === 'ArrowUp') {
-        e.preventDefault();
-        setActivePromptIndex((prevIndex) =>
-          prevIndex > 0 ? prevIndex - 1 : prevIndex,
-        );
-      } else if (e.key === 'Tab') {
-        e.preventDefault();
-        setActivePromptIndex((prevIndex) =>
-          prevIndex < prompts.length - 1 ? prevIndex + 1 : 0,
-        );
-      } else if (e.key === 'Enter') {
-        e.preventDefault();
-        handleInitModal();
-      } else if (e.key === 'Escape') {
-        e.preventDefault();
-        setShowPromptList(false);
-      } else {
-        setActivePromptIndex(0);
-      }
-    }
-  };
-
-  useEffect(() => {
-    if (textareaRef && textareaRef.current) {
-      textareaRef.current.style.height = 'inherit';
-      textareaRef.current.style.height = `${textareaRef.current?.scrollHeight}px`;
-    }
-  }, [value]);
-
-  useEffect(() => {
-    if (conversation.prompt) {
-      setValue(conversation.prompt);
-    } else {
-      setValue(DEFAULT_SYSTEM_PROMPT);
-    }
-  }, [conversation]);
-
-  useEffect(() => {
-    const handleOutsideClick = (e: MouseEvent) => {
-      if (
-        promptListRef.current &&
-        !promptListRef.current.contains(e.target as Node)
-      ) {
-        setShowPromptList(false);
-      }
-    };
-
-    window.addEventListener('click', handleOutsideClick);
-
-    return () => {
-      window.removeEventListener('click', handleOutsideClick);
-    };
-  }, []);
-
-  return (
-    <div className="flex flex-col">
-      <label className="mb-2 text-left text-neutral-700 dark:text-neutral-400">
-        {t('System Prompt')}
-      </label>
-      <textarea
-        ref={textareaRef}
-        className="w-full rounded-lg border border-neutral-200 bg-transparent px-4 py-3 text-neutral-900 dark:border-neutral-600 dark:text-neutral-100"
-        style={{
-          resize: 'none',
-          bottom: `${textareaRef?.current?.scrollHeight}px`,
-          maxHeight: '300px',
-          overflow: `${
-            textareaRef.current && textareaRef.current.scrollHeight > 400
-              ? 'auto'
-              : 'hidden'
-          }`,
-        }}
-        placeholder={
-          t(`Enter a prompt`) || ''
-        }
-        value={t(value) || ''}
-        rows={1}
-        onChange={handleChange}
-        onKeyDown={handleKeyDown}
-      />
-
-      {showPromptList && filteredPrompts.length > 0 && (
-        <div>
-          <PromptList
-            activePromptIndex={activePromptIndex}
-            prompts={filteredPrompts}
-            onSelect={handleInitModal}
-            onMouseOver={setActivePromptIndex}
-            promptListRef={promptListRef}
-          />
-        </div>
-      )}
-
-      {isModalVisible && (
-        <VariableModal
-          prompt={prompts[activePromptIndex]}
-          variables={variables}
-          onSubmit={handleSubmit}
-          onClose={() => setIsModalVisible(false)}
-        />
-      )}
-    </div>
-  );
-};
diff --git a/spaces/mbazaNLP/Kinyarwanda-text-to-speech/README.md b/spaces/mbazaNLP/Kinyarwanda-text-to-speech/README.md
deleted file mode 100644
index 7d993234b860e675775cb630d538aa80bab9b724..0000000000000000000000000000000000000000
--- a/spaces/mbazaNLP/Kinyarwanda-text-to-speech/README.md
+++ /dev/null
@@ -1,11 +0,0 @@
----
-title: Kinyarwanda Text To Speech
-emoji: 👀
-colorFrom: pink
-colorTo: gray
-sdk: gradio
-sdk_version: 3.17.0
-app_file: app.py
-pinned: false
-license: apache-2.0
----
diff --git a/spaces/meeww/Minecraft_Skin_Generator/README.md b/spaces/meeww/Minecraft_Skin_Generator/README.md
deleted file mode 100644
index b960d3da004ab927a682324ebc457dbaeb858564..0000000000000000000000000000000000000000
--- a/spaces/meeww/Minecraft_Skin_Generator/README.md
+++ /dev/null
@@ -1,13 +0,0 @@
----
-title: Minecraft Skin Generator
-emoji: 🔥
-colorFrom: red
-colorTo: purple
-sdk: gradio
-sdk_version: 3.0.13
-app_file: app.py
-pinned: false
-license: mit
----
-
-Check out the configuration reference at https://huggingface.co/docs/hub/spaces-config-reference
diff --git a/spaces/meraih/English-Japanese-Anime-TTS/ONNXVITS_models.py b/spaces/meraih/English-Japanese-Anime-TTS/ONNXVITS_models.py
deleted file mode 100644
index acd00238895d57ba878fd0211d5654250fb10061..0000000000000000000000000000000000000000
--- a/spaces/meraih/English-Japanese-Anime-TTS/ONNXVITS_models.py
+++ /dev/null
@@ -1,509 +0,0 @@
-import copy
-import math
-import torch
-from torch import nn
-from torch.nn import functional as F
-
-import commons
-import ONNXVITS_modules as modules
-import attentions
-import monotonic_align
-
-from torch.nn import Conv1d, ConvTranspose1d, AvgPool1d, Conv2d
-from torch.nn.utils import weight_norm, remove_weight_norm, spectral_norm
-from commons import init_weights, get_padding
-
-
-class StochasticDurationPredictor(nn.Module):
-  def __init__(self, in_channels, filter_channels, kernel_size, p_dropout, n_flows=4, gin_channels=0):
-    super().__init__()
-    filter_channels = in_channels # it needs to be removed from future version.
-    self.in_channels = in_channels
-    self.filter_channels = filter_channels
-    self.kernel_size = kernel_size
-    self.p_dropout = p_dropout
-    self.n_flows = n_flows
-    self.gin_channels = gin_channels
-
-    self.log_flow = modules.Log()
-    self.flows = nn.ModuleList()
-    self.flows.append(modules.ElementwiseAffine(2))
-    for i in range(n_flows):
-      self.flows.append(modules.ConvFlow(2, filter_channels, kernel_size, n_layers=3))
-      self.flows.append(modules.Flip())
-
-    self.post_pre = nn.Conv1d(1, filter_channels, 1)
-    self.post_proj = nn.Conv1d(filter_channels, filter_channels, 1)
-    self.post_convs = modules.DDSConv(filter_channels, kernel_size, n_layers=3, p_dropout=p_dropout)
-    self.post_flows = nn.ModuleList()
-    self.post_flows.append(modules.ElementwiseAffine(2))
-    for i in range(4):
-      self.post_flows.append(modules.ConvFlow(2, filter_channels, kernel_size, n_layers=3))
-      self.post_flows.append(modules.Flip())
-
-    self.pre = nn.Conv1d(in_channels, filter_channels, 1)
-    self.proj = nn.Conv1d(filter_channels, filter_channels, 1)
-    self.convs = modules.DDSConv(filter_channels, kernel_size, n_layers=3, p_dropout=p_dropout)
-    if gin_channels != 0:
-      self.cond = nn.Conv1d(gin_channels, filter_channels, 1)
-
-    self.w = None
-    self.reverse = None
-    self.noise_scale = None
-  def forward(self, x, x_mask, g=None):
-    w = self.w
-    reverse = self.reverse
-    noise_scale = self.noise_scale
-
-    x = torch.detach(x)
-    x = self.pre(x)
-    if g is not None:
-      g = torch.detach(g)
-      x = x + self.cond(g)
-    x = self.convs(x, x_mask)
-    x = self.proj(x) * x_mask
-
-    if not reverse:
-      flows = self.flows
-      assert w is not None
-
-      logdet_tot_q = 0 
-      h_w = self.post_pre(w)
-      h_w = self.post_convs(h_w, x_mask)
-      h_w = self.post_proj(h_w) * x_mask
-      e_q = torch.randn(w.size(0), 2, w.size(2)).to(device=x.device, dtype=x.dtype) * x_mask
-      z_q = e_q
-      for flow in self.post_flows:
-        z_q, logdet_q = flow(z_q, x_mask, g=(x + h_w))
-        logdet_tot_q += logdet_q
-      z_u, z1 = torch.split(z_q, [1, 1], 1) 
-      u = torch.sigmoid(z_u) * x_mask
-      z0 = (w - u) * x_mask
-      logdet_tot_q += torch.sum((F.logsigmoid(z_u) + F.logsigmoid(-z_u)) * x_mask, [1,2])
-      logq = torch.sum(-0.5 * (math.log(2*math.pi) + (e_q**2)) * x_mask, [1,2]) - logdet_tot_q
-
-      logdet_tot = 0
-      z0, logdet = self.log_flow(z0, x_mask)
-      logdet_tot += logdet
-      z = torch.cat([z0, z1], 1)
-      for flow in flows:
-        z, logdet = flow(z, x_mask, g=x, reverse=reverse)
-        logdet_tot = logdet_tot + logdet
-      nll = torch.sum(0.5 * (math.log(2*math.pi) + (z**2)) * x_mask, [1,2]) - logdet_tot
-      return nll + logq # [b]
-    else:
-      flows = list(reversed(self.flows))
-      flows = flows[:-2] + [flows[-1]] # remove a useless vflow
-      z = torch.randn(x.size(0), 2, x.size(2)).to(device=x.device, dtype=x.dtype) * noise_scale
-      for flow in flows:
-        z = flow(z, x_mask, g=x, reverse=reverse)
-      z0, z1 = torch.split(z, [1, 1], 1)
-      logw = z0
-      return logw
-
-
-class TextEncoder(nn.Module):
-  def __init__(self,
-      n_vocab,
-      out_channels,
-      hidden_channels,
-      filter_channels,
-      n_heads,
-      n_layers,
-      kernel_size,
-      p_dropout):
-    super().__init__()
-    self.n_vocab = n_vocab
-    self.out_channels = out_channels
-    self.hidden_channels = hidden_channels
-    self.filter_channels = filter_channels
-    self.n_heads = n_heads
-    self.n_layers = n_layers
-    self.kernel_size = kernel_size
-    self.p_dropout = p_dropout
-
-    self.emb = nn.Embedding(n_vocab, hidden_channels)
-    nn.init.normal_(self.emb.weight, 0.0, hidden_channels**-0.5)
-
-    self.encoder = attentions.Encoder(
-      hidden_channels,
-      filter_channels,
-      n_heads,
-      n_layers,
-      kernel_size,
-      p_dropout)
-    self.proj= nn.Conv1d(hidden_channels, out_channels * 2, 1)
-
-  def forward(self, x, x_lengths):
-    x = self.emb(x) * math.sqrt(self.hidden_channels) # [b, t, h]
-    x = torch.transpose(x, 1, -1) # [b, h, t]
-    x_mask = torch.unsqueeze(commons.sequence_mask(x_lengths, x.size(2)), 1).to(x.dtype)
-
-    x = self.encoder(x * x_mask, x_mask)
-    stats = self.proj(x) * x_mask
-
-    m, logs = torch.split(stats, self.out_channels, dim=1)
-    return x, m, logs, x_mask
-
-
-class ResidualCouplingBlock(nn.Module):
-  def __init__(self,
-      channels,
-      hidden_channels,
-      kernel_size,
-      dilation_rate,
-      n_layers,
-      n_flows=4,
-      gin_channels=0):
-    super().__init__()
-    self.channels = channels
-    self.hidden_channels = hidden_channels
-    self.kernel_size = kernel_size
-    self.dilation_rate = dilation_rate
-    self.n_layers = n_layers
-    self.n_flows = n_flows
-    self.gin_channels = gin_channels
-
-    self.flows = nn.ModuleList()
-    for i in range(n_flows):
-      self.flows.append(modules.ResidualCouplingLayer(channels, hidden_channels, kernel_size, dilation_rate, n_layers, gin_channels=gin_channels, mean_only=True))
-      self.flows.append(modules.Flip())
-
-    self.reverse = None
-  def forward(self, x, x_mask, g=None):
-    reverse = self.reverse 
-    if not reverse:
-      for flow in self.flows:
-        x, _ = flow(x, x_mask, g=g, reverse=reverse)
-    else:
-      for flow in reversed(self.flows):
-        x = flow(x, x_mask, g=g, reverse=reverse)
-    return x
-
-
-class PosteriorEncoder(nn.Module):
-  def __init__(self,
-      in_channels,
-      out_channels,
-      hidden_channels,
-      kernel_size,
-      dilation_rate,
-      n_layers,
-      gin_channels=0):
-    super().__init__()
-    self.in_channels = in_channels
-    self.out_channels = out_channels
-    self.hidden_channels = hidden_channels
-    self.kernel_size = kernel_size
-    self.dilation_rate = dilation_rate
-    self.n_layers = n_layers
-    self.gin_channels = gin_channels
-
-    self.pre = nn.Conv1d(in_channels, hidden_channels, 1)
-    self.enc = modules.WN(hidden_channels, kernel_size, dilation_rate, n_layers, gin_channels=gin_channels)
-    self.proj = nn.Conv1d(hidden_channels, out_channels * 2, 1)
-
-  def forward(self, x, x_lengths, g=None):
-    x_mask = torch.unsqueeze(commons.sequence_mask(x_lengths, x.size(2)), 1).to(x.dtype)
-    x = self.pre(x) * x_mask # x_in : [b, c, t] -> [b, h, t] 
-    x = self.enc(x, x_mask, g=g) # x_in : [b, h, t], g : [b, h, 1],  x = x_in + g
-    stats = self.proj(x) * x_mask
-    m, logs = torch.split(stats, self.out_channels, dim=1)
-    z = (m + torch.randn_like(m) * torch.exp(logs)) * x_mask
-    return z, m, logs, x_mask # z, m, logs : [b, h, t]
-
-
-class Generator(torch.nn.Module):
-    def __init__(self, initial_channel, resblock, resblock_kernel_sizes, resblock_dilation_sizes, upsample_rates, upsample_initial_channel, upsample_kernel_sizes, gin_channels=0):
-        super(Generator, self).__init__()
-        self.num_kernels = len(resblock_kernel_sizes)
-        self.num_upsamples = len(upsample_rates)
-        self.conv_pre = Conv1d(initial_channel, upsample_initial_channel, 7, 1, padding=3)
-        resblock = modules.ResBlock1 if resblock == '1' else modules.ResBlock2
-
-        self.ups = nn.ModuleList()
-        for i, (u, k) in enumerate(zip(upsample_rates, upsample_kernel_sizes)):
-            self.ups.append(weight_norm(
-                ConvTranspose1d(upsample_initial_channel//(2**i), upsample_initial_channel//(2**(i+1)),
-                                k, u, padding=(k-u)//2)))
-
-        self.resblocks = nn.ModuleList()
-        for i in range(len(self.ups)):
-            ch = upsample_initial_channel//(2**(i+1))
-            for j, (k, d) in enumerate(zip(resblock_kernel_sizes, resblock_dilation_sizes)):
-                self.resblocks.append(resblock(ch, k, d))
-
-        self.conv_post = Conv1d(ch, 1, 7, 1, padding=3, bias=False)
-        self.ups.apply(init_weights)
-
-        if gin_channels != 0:
-            self.cond = nn.Conv1d(gin_channels, upsample_initial_channel, 1)
-
-    def forward(self, x, g=None):
-        x = self.conv_pre(x)
-        if g is not None:
-          x = x + self.cond(g)
-
-        for i in range(self.num_upsamples):
-            x = F.leaky_relu(x, modules.LRELU_SLOPE)
-            x = self.ups[i](x)
-            xs = None
-            for j in range(self.num_kernels):
-                if xs is None:
-                    xs = self.resblocks[i*self.num_kernels+j](x)
-                else:
-                    xs += self.resblocks[i*self.num_kernels+j](x)
-            x = xs / self.num_kernels
-        x = F.leaky_relu(x)
-        x = self.conv_post(x)
-        x = torch.tanh(x)
-
-        return x
-
-    def remove_weight_norm(self):
-        print('Removing weight norm...')
-        for l in self.ups:
-            remove_weight_norm(l)
-        for l in self.resblocks:
-            l.remove_weight_norm()
-
-
-class DiscriminatorP(torch.nn.Module):
-    def __init__(self, period, kernel_size=5, stride=3, use_spectral_norm=False):
-        super(DiscriminatorP, self).__init__()
-        self.period = period
-        self.use_spectral_norm = use_spectral_norm
-        norm_f = weight_norm if use_spectral_norm == False else spectral_norm
-        self.convs = nn.ModuleList([
-            norm_f(Conv2d(1, 32, (kernel_size, 1), (stride, 1), padding=(get_padding(kernel_size, 1), 0))),
-            norm_f(Conv2d(32, 128, (kernel_size, 1), (stride, 1), padding=(get_padding(kernel_size, 1), 0))),
-            norm_f(Conv2d(128, 512, (kernel_size, 1), (stride, 1), padding=(get_padding(kernel_size, 1), 0))),
-            norm_f(Conv2d(512, 1024, (kernel_size, 1), (stride, 1), padding=(get_padding(kernel_size, 1), 0))),
-            norm_f(Conv2d(1024, 1024, (kernel_size, 1), 1, padding=(get_padding(kernel_size, 1), 0))),
-        ])
-        self.conv_post = norm_f(Conv2d(1024, 1, (3, 1), 1, padding=(1, 0)))
-
-    def forward(self, x):
-        fmap = []
-
-        # 1d to 2d
-        b, c, t = x.shape
-        if t % self.period != 0: # pad first
-            n_pad = self.period - (t % self.period)
-            x = F.pad(x, (0, n_pad), "reflect")
-            t = t + n_pad
-        x = x.view(b, c, t // self.period, self.period)
-
-        for l in self.convs:
-            x = l(x)
-            x = F.leaky_relu(x, modules.LRELU_SLOPE)
-            fmap.append(x)
-        x = self.conv_post(x)
-        fmap.append(x)
-        x = torch.flatten(x, 1, -1)
-
-        return x, fmap
-
-
-class DiscriminatorS(torch.nn.Module):
-    def __init__(self, use_spectral_norm=False):
-        super(DiscriminatorS, self).__init__()
-        norm_f = weight_norm if use_spectral_norm == False else spectral_norm
-        self.convs = nn.ModuleList([
-            norm_f(Conv1d(1, 16, 15, 1, padding=7)),
-            norm_f(Conv1d(16, 64, 41, 4, groups=4, padding=20)),
-            norm_f(Conv1d(64, 256, 41, 4, groups=16, padding=20)),
-            norm_f(Conv1d(256, 1024, 41, 4, groups=64, padding=20)),
-            norm_f(Conv1d(1024, 1024, 41, 4, groups=256, padding=20)),
-            norm_f(Conv1d(1024, 1024, 5, 1, padding=2)),
-        ])
-        self.conv_post = norm_f(Conv1d(1024, 1, 3, 1, padding=1))
-
-    def forward(self, x):
-        fmap = []
-
-        for l in self.convs:
-            x = l(x)
-            x = F.leaky_relu(x, modules.LRELU_SLOPE)
-            fmap.append(x)
-        x = self.conv_post(x)
-        fmap.append(x)
-        x = torch.flatten(x, 1, -1)
-
-        return x, fmap
-
-
-class MultiPeriodDiscriminator(torch.nn.Module):
-    def __init__(self, use_spectral_norm=False):
-        super(MultiPeriodDiscriminator, self).__init__()
-        periods = [2,3,5,7,11]
-
-        discs = [DiscriminatorS(use_spectral_norm=use_spectral_norm)]
-        discs = discs + [DiscriminatorP(i, use_spectral_norm=use_spectral_norm) for i in periods]
-        self.discriminators = nn.ModuleList(discs)
-
-    def forward(self, y, y_hat):
-        y_d_rs = []
-        y_d_gs = []
-        fmap_rs = []
-        fmap_gs = []
-        for i, d in enumerate(self.discriminators):
-            y_d_r, fmap_r = d(y)
-            y_d_g, fmap_g = d(y_hat)
-            y_d_rs.append(y_d_r)
-            y_d_gs.append(y_d_g)
-            fmap_rs.append(fmap_r)
-            fmap_gs.append(fmap_g)
-
-        return y_d_rs, y_d_gs, fmap_rs, fmap_gs
-
-
-
-class SynthesizerTrn(nn.Module):
-  """
-  Synthesizer for Training
-  """
-
-  def __init__(self, 
-    n_vocab,
-    spec_channels,
-    segment_size,
-    inter_channels,
-    hidden_channels,
-    filter_channels,
-    n_heads,
-    n_layers,
-    kernel_size,
-    p_dropout,
-    resblock, 
-    resblock_kernel_sizes, 
-    resblock_dilation_sizes, 
-    upsample_rates, 
-    upsample_initial_channel, 
-    upsample_kernel_sizes,
-    n_speakers=0,
-    gin_channels=0,
-    use_sdp=True,
-    **kwargs):
-
-    super().__init__()
-    self.n_vocab = n_vocab
-    self.spec_channels = spec_channels
-    self.inter_channels = inter_channels
-    self.hidden_channels = hidden_channels
-    self.filter_channels = filter_channels
-    self.n_heads = n_heads
-    self.n_layers = n_layers
-    self.kernel_size = kernel_size
-    self.p_dropout = p_dropout
-    self.resblock = resblock
-    self.resblock_kernel_sizes = resblock_kernel_sizes
-    self.resblock_dilation_sizes = resblock_dilation_sizes
-    self.upsample_rates = upsample_rates
-    self.upsample_initial_channel = upsample_initial_channel
-    self.upsample_kernel_sizes = upsample_kernel_sizes
-    self.segment_size = segment_size
-    self.n_speakers = n_speakers
-    self.gin_channels = gin_channels
-
-    self.use_sdp = use_sdp
-
-    self.enc_p = TextEncoder(n_vocab,
-        inter_channels,
-        hidden_channels,
-        filter_channels,
-        n_heads,
-        n_layers,
-        kernel_size,
-        p_dropout)
-    self.dec = Generator(inter_channels, resblock, resblock_kernel_sizes, resblock_dilation_sizes, upsample_rates, upsample_initial_channel, upsample_kernel_sizes, gin_channels=gin_channels)
-    self.enc_q = PosteriorEncoder(spec_channels, inter_channels, hidden_channels, 5, 1, 16, gin_channels=gin_channels)
-    self.flow = ResidualCouplingBlock(inter_channels, hidden_channels, 5, 1, 4, gin_channels=gin_channels)
-
-    self.dp = StochasticDurationPredictor(hidden_channels, 192, 3, 0.5, 4, gin_channels=gin_channels)
-
-    if n_speakers > 0:
-      self.emb_g = nn.Embedding(n_speakers, gin_channels)
-
-  def forward(self, x, x_lengths, sid=None, noise_scale=.667, length_scale=1, noise_scale_w=.8, max_len=None):
-    torch.onnx.export(
-        self.enc_p,
-        (x, x_lengths),
-        "ONNX_net/enc_p.onnx",
-        input_names=["x", "x_lengths"],
-        output_names=["xout", "m_p", "logs_p", "x_mask"],
-        dynamic_axes={
-          "x" : [1],
-          "xout" : [2],
-          "m_p" : [2],
-          "logs_p" : [2],
-          "x_mask" : [2]
-        },
-        verbose=True,
-    )
-    x, m_p, logs_p, x_mask = self.enc_p(x, x_lengths)
-
-    if self.n_speakers > 0:
-      g = self.emb_g(sid).unsqueeze(-1) # [b, h, 1]
-    else:
-      g = None
-
-    self.dp.reverse = True
-    self.dp.noise_scale = noise_scale_w
-    torch.onnx.export(
-        self.dp,
-        (x, x_mask, g),
-        "ONNX_net/dp.onnx",
-        input_names=["x", "x_mask", "g"],
-        output_names=["logw"],
-        dynamic_axes={
-          "x" : [2],
-          "x_mask" : [2],
-          "logw" : [2]
-        },
-        verbose=True,
-    )
-    logw = self.dp(x, x_mask, g=g)
-    w = torch.exp(logw) * x_mask * length_scale
-    w_ceil = torch.ceil(w)
-    y_lengths = torch.clamp_min(torch.sum(w_ceil, [1, 2]), 1).long()
-    y_mask = torch.unsqueeze(commons.sequence_mask(y_lengths, None), 1).to(x_mask.dtype)
-    attn_mask = torch.unsqueeze(x_mask, 2) * torch.unsqueeze(y_mask, -1)
-    attn = commons.generate_path(w_ceil, attn_mask)
-
-    m_p = torch.matmul(attn.squeeze(1), m_p.transpose(1, 2)).transpose(1, 2) # [b, t', t], [b, t, d] -> [b, d, t']
-    logs_p = torch.matmul(attn.squeeze(1), logs_p.transpose(1, 2)).transpose(1, 2) # [b, t', t], [b, t, d] -> [b, d, t']
-
-    z_p = m_p + torch.randn_like(m_p) * torch.exp(logs_p) * noise_scale
-
-    self.flow.reverse = True
-    torch.onnx.export(
-        self.flow,
-        (z_p, y_mask, g),
-        "ONNX_net/flow.onnx",
-        input_names=["z_p", "y_mask", "g"],
-        output_names=["z"],
-        dynamic_axes={
-          "z_p" : [2],
-          "y_mask" : [2],
-          "z" : [2]
-        },
-        verbose=True,
-    )
-    z = self.flow(z_p, y_mask, g=g)
-    z_in = (z * y_mask)[:,:,:max_len]
-
-    torch.onnx.export(
-        self.dec,
-        (z_in, g),
-        "ONNX_net/dec.onnx",
-        input_names=["z_in", "g"],
-        output_names=["o"],
-        dynamic_axes={
-          "z_in" : [2],
-          "o" : [2]
-        },
-        verbose=True,
-    )
-    o = self.dec(z_in, g=g)
-    return o
diff --git a/spaces/mertguvencli/trending-techs-on-data-science/app.py b/spaces/mertguvencli/trending-techs-on-data-science/app.py
deleted file mode 100644
index 29335afebfcb314184cc83efdebcab8d53f797a4..0000000000000000000000000000000000000000
--- a/spaces/mertguvencli/trending-techs-on-data-science/app.py
+++ /dev/null
@@ -1,29 +0,0 @@
-import spacy
-import streamlit as st
-from spacy_streamlit import visualize_ner
-
-try:
-    spacy.load("en_core_web_sm")
-except:
-    spacy.cli.download("en_core_web_sm")
-
-st.write("""
-# Extract the tech keywords on Data Science jobs using NER.
-""")
-
-
-nlp = spacy.load("en_core_web_sm")
-ruler = nlp.add_pipe("entity_ruler", before="ner")
-ruler.from_disk("patterns.jsonl")
-
-description = "Built with love 💙 Python, Spacy, Streamlit and Huggingface 🤗"
-text = st.text_area(label='Job Description', value=description, placeholder='Please enter a job description')
-
-doc = nlp(text)
-visualize_ner(doc, labels=nlp.get_pipe("ner").labels)
-
-st.subheader('Tech Keywords')
-st.json(
-    [{'label': entity.label_, 'text': entity.text, 'start': entity.start, 'end': entity.end} \
-        for entity in doc.ents if entity.ent_id_ == 'SKILLS']
-)
diff --git a/spaces/merve/data-leak/public/third_party/recirc.js b/spaces/merve/data-leak/public/third_party/recirc.js
deleted file mode 100644
index 37b65f4b8cf3c3ba504a0a3b906f8c19befc6730..0000000000000000000000000000000000000000
--- a/spaces/merve/data-leak/public/third_party/recirc.js
+++ /dev/null
@@ -1,58 +0,0 @@
-/* Copyright 2020 Google LLC. All Rights Reserved.
-
-Licensed under the Apache License, Version 2.0 (the "License");
-you may not use this file except in compliance with the License.
-You may obtain a copy of the License at
-
-    http://www.apache.org/licenses/LICENSE-2.0
-
-Unless required by applicable law or agreed to in writing, software
-distributed under the License is distributed on an "AS IS" BASIS,
-WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-See the License for the specific language governing permissions and
-limitations under the License.
-==============================================================================*/
-
-
-
-
-d3.loadData('../posts.json', (err, res) => {
-  var posts = res[0]
-    .filter(d => !window.location.href.includes(d.permalink))
-    .filter(d => d.shareimg.includes('http'))
-  posts = d3.shuffle(posts)
-
-  var isMobile = innerWidth < 900 
-  var postSel = d3.select('#recirc').html('').appendMany('a.post', posts)
-    .st({
-      width: isMobile ? '100%' : '330px', 
-      display: 'inline-block', 
-      verticalAlign: 'top',
-      marginRight: isMobile ? 0 : 30,
-      textDecoration: 'none',
-    })
-    .at({href: d => '..' + d.permalink})
-
-
-  postSel.append('div.img')
-    .st({
-      width: '100%', 
-      height: 200,
-      backgroundImage: d => `url(${d.shareimgabstract || d.shareimg})`,
-      backgroundSize: 'cover',
-      backgroundPosition: 'center',
-    })
-
-  postSel.append('p.title')
-    .text(d => d.shorttitle || d.title)
-    .st({
-      verticalAlign: 'top',
-      marginTop: 10,
-      textDecoration: 'none',
-    })
-
-  postSel.append('p.summary')
-    .text(d => d.socialsummary || d.summary)
-
-
-})
\ No newline at end of file
diff --git a/spaces/merve/dataset-worldviews/public/fill-in-the-blank/post.js b/spaces/merve/dataset-worldviews/public/fill-in-the-blank/post.js
deleted file mode 100644
index e546aef207dab4014e05732814a1f4b2ff78896a..0000000000000000000000000000000000000000
--- a/spaces/merve/dataset-worldviews/public/fill-in-the-blank/post.js
+++ /dev/null
@@ -1,44 +0,0 @@
-/* Copyright 2021 Google LLC. All Rights Reserved.
-
-Licensed under the Apache License, Version 2.0 (the "License");
-you may not use this file except in compliance with the License.
-You may obtain a copy of the License at
-
-    http://www.apache.org/licenses/LICENSE-2.0
-
-Unless required by applicable law or agreed to in writing, software
-distributed under the License is distributed on an "AS IS" BASIS,
-WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-See the License for the specific language governing permissions and
-limitations under the License.
-==============================================================================*/
-
-
-async function post(route, obj){
-  var body = JSON.stringify(obj)
-  var cacheKey = body + route
-  // if (route == 'embed_zari_cda') return
-  // if (route != 'embed_group_top') return
-  // route = 'embed_group'
-
-  if (!window.postCache) postCache = {}
-  if (postCache[cacheKey]) return postCache[cacheKey]
-
-
-  if (cacheKey2filename[cacheKey]){
-    var res = await fetch('data/' + cacheKey2filename[cacheKey])
-  } else {
-    // var root = 'http://' + location.hostname + ':5004/'
-    var root = 'https://helloworld-66dm2fxl4a-uk.a.run.app/'
-    var res = await fetch(root + route, {method: 'POST', body})
-  }
-
-
-  var rv = await res.json()
-  postCache[cacheKey] = rv
-
-  return rv
-}
-
-// copy(postCache)
-// data/post-cache.json
\ No newline at end of file
diff --git a/spaces/microsoft/unicl-img-recog-demo/model/templates.py b/spaces/microsoft/unicl-img-recog-demo/model/templates.py
deleted file mode 100644
index b49b6c7afa2532e05b71e213aee30e728d12c1a6..0000000000000000000000000000000000000000
--- a/spaces/microsoft/unicl-img-recog-demo/model/templates.py
+++ /dev/null
@@ -1,83 +0,0 @@
-DEFAULT_TEMPLATES = [
-    '{}.',
-    'a bad photo of a {}.',
-    'a photo of many {}.',
-    'a sculpture of a {}.',
-    'a photo of the hard to see {}.',
-    'a low resolution photo of the {}.',
-    'a rendering of a {}.',
-    'graffiti of a {}.',
-    'a bad photo of the {}.',
-    'a cropped photo of the {}.',
-    'a tattoo of a {}.',
-    'the embroidered {}.',
-    'a photo of a hard to see {}.',
-    'a bright photo of a {}.',
-    'a photo of a clean {}.',
-    'a photo of a dirty {}.',
-    'a dark photo of the {}.',
-    'a drawing of a {}.',
-    'a photo of my {}.',
-    'the plastic {}.',
-    'a photo of the cool {}.',
-    'a close-up photo of a {}.',
-    'a black and white photo of the {}.',
-    'a painting of the {}.',
-    'a painting of a {}.',
-    'a pixelated photo of the {}.',
-    'a sculpture of the {}.',
-    'a bright photo of the {}.',
-    'a cropped photo of a {}.',
-    'a plastic {}.',
-    'a photo of the dirty {}.',
-    'a jpeg corrupted photo of a {}.',
-    'a blurry photo of the {}.',
-    'a photo of the {}.',
-    'a good photo of the {}.',
-    'a rendering of the {}.',
-    'a {} in a video game.',
-    'a photo of one {}.',
-    'a doodle of a {}.',
-    'a close-up photo of the {}.',
-    'a photo of a {}.',
-    'the origami {}.',
-    'the {} in a video game.',
-    'a sketch of a {}.',
-    'a doodle of the {}.',
-    'a origami {}.',
-    'a low resolution photo of a {}.',
-    'the toy {}.',
-    'a rendition of the {}.',
-    'a photo of the clean {}.',
-    'a photo of a large {}.',
-    'a rendition of a {}.',
-    'a photo of a nice {}.',
-    'a photo of a weird {}.',
-    'a blurry photo of a {}.',
-    'a cartoon {}.',
-    'art of a {}.',
-    'a sketch of the {}.',
-    'a embroidered {}.',
-    'a pixelated photo of a {}.',
-    'itap of the {}.',
-    'a jpeg corrupted photo of the {}.',
-    'a good photo of a {}.',
-    'a plushie {}.',
-    'a photo of the nice {}.',
-    'a photo of the small {}.',
-    'a photo of the weird {}.',
-    'the cartoon {}.',
-    'art of the {}.',
-    'a drawing of the {}.',
-    'a photo of the large {}.',
-    'a black and white photo of a {}.',
-    'the plushie {}.',
-    'a dark photo of a {}.',
-    'itap of a {}.',
-    'graffiti of the {}.',
-    'a toy {}.',
-    'itap of my {}.',
-    'a photo of a cool {}.',
-    'a photo of a small {}.',
-    'a tattoo of the {}.',
-]
diff --git a/spaces/mikeee/radiobee-dev/docs/run-make.bat b/spaces/mikeee/radiobee-dev/docs/run-make.bat
deleted file mode 100644
index dce56bf99cfd30c5ab01cb9667436282579e9adf..0000000000000000000000000000000000000000
--- a/spaces/mikeee/radiobee-dev/docs/run-make.bat
+++ /dev/null
@@ -1 +0,0 @@
-make clean && make html
\ No newline at end of file
diff --git a/spaces/missmeyet/Translate_Text_In_Images/README.md b/spaces/missmeyet/Translate_Text_In_Images/README.md
deleted file mode 100644
index 384419599571476d8bf9b1714bff3c1f9d4ff5d4..0000000000000000000000000000000000000000
--- a/spaces/missmeyet/Translate_Text_In_Images/README.md
+++ /dev/null
@@ -1,13 +0,0 @@
----
-title: Translate Text In Images
-emoji: ⚡
-colorFrom: blue
-colorTo: red
-sdk: gradio
-sdk_version: 3.0.26
-app_file: app.py
-pinned: false
-license: apache-2.0
----
-
-Check out the configuration reference at https://huggingface.co/docs/hub/spaces-config-reference
diff --git a/spaces/mmecheri/Rakuten_Streamlit/page_descriptions/models_text_txt.md b/spaces/mmecheri/Rakuten_Streamlit/page_descriptions/models_text_txt.md
deleted file mode 100644
index 6f6ddd9e904f1737f5ce369ea4f8a5bd5327e83f..0000000000000000000000000000000000000000
--- a/spaces/mmecheri/Rakuten_Streamlit/page_descriptions/models_text_txt.md
+++ /dev/null
@@ -1,32 +0,0 @@
-#### Machine learning 
-Ci-dessous un récapitulatif comparatif des résultats d’entrainement en choisissant dans un premier temps seulement 
-la colonne « designation » et dans un second temps en utilisant les deux colonnes « designation » et « description », combinées en une colonne « text »:
----Insersetion---
-Les modèles de Machine Learning ont montré leurs limites pour atteindre des performances satisfaisantes. Nous nous sommes donc orientés vers des modèles de Deep Learning.
-#### Deep learning 
-
-Voici les modèles utilisés et les résulats obetenus:
----Insersetion---
-Choix des paramètres:
->-&nbsp;Batch size: 200</br>
->-&nbsp;Epochs: 5 epochs</br>
->-&nbsp;Learning Rate: 0.001</br>
->-&nbsp;Optimizer: “adam”</br>
-
----Insersetion---
-Les classes de produits les moins bien prédites sont globalement les mêmes pour les deux modèles Conv1D et Simple DNN, sauf pour les  classes de produits: 1302, 50, 2220 et 2462 
-qui sont mieux prédites par le modèle Simple DNN
-
----Insersetion---
-#### Conclusion
-Les modèles Conv1D et DNN (Deep Neural Network) donnent les meilleurs scores. Le modèle LinearSVC a également donné des résultats de scoring intéressants. En fait, nous avons constaté que le modèle Conv1D présente la particularité d’être beaucoup plus rapide à l’entraînement
----Insersetion---
-#### Démo - Prédictions
-Pour les prédictions , nous intéresserons uniquement aux deux meilleurs modèles: **Conv1D** et **DNN**
----Insersetion---
-
-
-
-
-
-
diff --git a/spaces/monra/freegpt-webui/client/css/theme-toggler.css b/spaces/monra/freegpt-webui/client/css/theme-toggler.css
deleted file mode 100644
index b673b5920a24693e7ea15b873e46731b388ec527..0000000000000000000000000000000000000000
--- a/spaces/monra/freegpt-webui/client/css/theme-toggler.css
+++ /dev/null
@@ -1,33 +0,0 @@
-.theme-toggler-container {
-    margin: 24px 0px 8px 0px;
-    justify-content: center;
-}
-
-.theme-toggler-container.checkbox input + label,
-.theme-toggler-container.checkbox input:checked + label:after {
-	background: var(--colour-1);
-}
-
-.theme-toggler-container.checkbox input + label:after,
-.theme-toggler-container.checkbox input:checked + label {
-	background: var(--colour-3);
-}
-
-.theme-toggler-container.checkbox span {
-    font-size: 0.75rem;
-}
-
-.theme-toggler-container.checkbox label {
-    width: 24px;
-    height: 16px;
-}
-
-.theme-toggler-container.checkbox label:after {
-    left: 2px;
-    width: 10px;
-    height: 10px;
-}
-
-.theme-toggler-container.checkbox input:checked + label:after {
-    left: calc(100% - 2px - 10px);
-}
\ No newline at end of file
diff --git a/spaces/moumeneb1/asr_model/README.md b/spaces/moumeneb1/asr_model/README.md
deleted file mode 100644
index 05a2336e0fd1314c91fda1b82c99d6f0cdcaba17..0000000000000000000000000000000000000000
--- a/spaces/moumeneb1/asr_model/README.md
+++ /dev/null
@@ -1,37 +0,0 @@
----
-title: Asr_model
-emoji: 🗣️
-colorFrom: yellow
-colorTo: purple
-sdk: gradio
-app_file: app.py
-pinned: false
----
-
-# Configuration
-
-`title`: _string_  
-Display title for the Space
-
-`emoji`: _string_  
-Space emoji (emoji-only character allowed)
-
-`colorFrom`: _string_  
-Color for Thumbnail gradient (red, yellow, green, blue, indigo, purple, pink, gray)
-
-`colorTo`: _string_  
-Color for Thumbnail gradient (red, yellow, green, blue, indigo, purple, pink, gray)
-
-`sdk`: _string_  
-Can be either `gradio` or `streamlit`
-
-`sdk_version` : _string_  
-Only applicable for `streamlit` SDK.  
-See [doc](https://hf.co/docs/hub/spaces) for more info on supported versions.
-
-`app_file`: _string_  
-Path to your main application file (which contains either `gradio` or `streamlit` Python code).  
-Path is relative to the root of the repository.
-
-`pinned`: _boolean_  
-Whether the Space stays on top of your list.
diff --git a/spaces/mshukor/UnIVAL/app.py b/spaces/mshukor/UnIVAL/app.py
deleted file mode 100644
index 12756e50cad6574ba56b3000a34ebbd2962a66b8..0000000000000000000000000000000000000000
--- a/spaces/mshukor/UnIVAL/app.py
+++ /dev/null
@@ -1,505 +0,0 @@
-import os
-
-os.system('cd fairseq;'
-          'pip install ./; cd ..')
-os.system('ls -l')
-
-import torch
-import numpy as np
-import gradio as gr
-import cv2
-from PIL import Image
-from torchvision import transforms
-
-from fairseq import utils, tasks, options
-from fairseq import checkpoint_utils
-from fairseq.dataclass.utils import convert_namespace_to_omegaconf
-
-from tasks.mm_tasks.caption import CaptionTask
-from tasks.mm_tasks.refcoco import RefcocoTask
-from tasks.mm_tasks.vqa_gen import VqaGenTask
-
-
-from utils.zero_shot_utils import zero_shot_step
-
-# video
-from  data.video_utils import VIDEO_READER_FUNCS
-
-# audio
-import torchaudio
-from data.audio_utils import get_audio_features, int16_to_float32, float32_to_int16, AUDIO_CFG
-
-def move2gpu(models, cfg):
-    for model in models:
-        model.eval()
-        if use_fp16:
-            model.half()
-        if use_cuda and not cfg.distributed_training.pipeline_model_parallel:
-            model.cuda()
-        model.prepare_for_inference_(cfg)
-
-
-def construct_transform(patch_image_size):
-    mean = [0.5, 0.5, 0.5]
-    std = [0.5, 0.5, 0.5]
-
-    patch_resize_transform = transforms.Compose([
-        lambda image: image.convert("RGB"),
-        transforms.Resize((patch_image_size, patch_image_size), interpolation=Image.BICUBIC),
-        transforms.ToTensor(),
-        transforms.Normalize(mean=mean, std=std),
-    ])
-
-    return patch_resize_transform
-
-
-# Register tasks
-tasks.register_task('caption', CaptionTask)
-tasks.register_task('refcoco', RefcocoTask)
-tasks.register_task('vqa_gen', VqaGenTask)
-tasks.register_task('video_caption', CaptionTask)
-tasks.register_task('audio_caption', CaptionTask)
-
-
-# turn on cuda if GPU is available
-use_cuda = torch.cuda.is_available()
-# use fp16 only when GPU is available
-use_fp16 = False
-
-# download checkpoints
-os.system('mkdir -p checkpoints; ')
-
-# os.system('wget https://data.isir.upmc.fr/unival/models/unival_s2_hs/checkpoint1.pt; '
-#           'mkdir -p checkpoints/unival_s2_hs; mv checkpoint1.pt checkpoints/unival_s2_hs/')
-
-# os.system('wget https://data.isir.upmc.fr/unival/models/unival_vqa/checkpoint_best.pt; '
-#           'mkdir -p checkpoints/unival_vqa; mv checkpoint_best.pt checkpoints/unival_vqa/')
-# os.system('wget https://data.isir.upmc.fr/unival/models/unival_caption_stage_1/checkpoint_best_test.pt; '
-#           'mkdir -p checkpoints/unival_caption_stage_1; mv checkpoint_best_test.pt checkpoints/unival_caption_stage_1/')
-# os.system('wget https://data.isir.upmc.fr/unival/models/unival_refcocog/checkpoint_best.pt; '
-#           'mkdir -p checkpoints/unival_refcocog; mv checkpoint_best.pt checkpoints/unival_refcocog/')
-# os.system('wget https://data.isir.upmc.fr/unival/models/unival_video_caption_stage_1/checkpoint_best.pt; '
-#           'mkdir -p checkpoints/unival_video_caption_stage_1; mv checkpoint_best.pt checkpoints/unival_video_caption_stage_1/')
-# os.system('wget https://data.isir.upmc.fr/unival/models/unival_audio_caption/checkpoint_best.pt; '
-#           'mkdir -p checkpoints/unival_audio_caption; mv checkpoint_best.pt checkpoints/unival_audio_caption/')
-
-# Load ckpt & config for Image Captioning
-checkpoint_path = 'checkpoints/unival_caption_stage_1/checkpoint_best_test.pt'
-
-caption_overrides={"eval_cider":False, "beam":5, "max_len_b":22, "no_repeat_ngram_size":3, "seed":7, "unnormalized": False,
-           "bpe_dir":"utils/BPE", "video_model_path": None, "video_model_path": None, "resnet_model_path": None}
-
-caption_models, caption_cfg, caption_task = checkpoint_utils.load_model_ensemble_and_task(
-    utils.split_paths(checkpoint_path),
-    arg_overrides=caption_overrides
-)
-
-# Load ckpt & config for Video Captioning
-checkpoint_path = 'checkpoints/unival_video_caption_stage_1/checkpoint_best.pt'
-
-caption_overrides={"eval_cider":False, "beam":5, "max_len_b":22, "no_repeat_ngram_size":3, "seed":7, "unnormalized": False,
-           "bpe_dir":"utils/BPE", "video_model_path": None, "video_model_path": None, "resnet_model_path": None}
-
-video_caption_models, video_caption_cfg, video_caption_task = checkpoint_utils.load_model_ensemble_and_task(
-    utils.split_paths(checkpoint_path),
-    arg_overrides=caption_overrides
-)
-
-
-# Load ckpt & config for Audio Captioning
-checkpoint_path = 'checkpoints/unival_audio_caption/checkpoint_best.pt'
-
-caption_overrides={"eval_cider":False, "beam":5, "max_len_b":22, "no_repeat_ngram_size":3, "seed":7, "unnormalized": False,
-           "bpe_dir":"utils/BPE", "video_model_path": None, "video_model_path": None, "resnet_model_path": None,  "audio_model_path": None}
-
-audio_caption_models, audio_caption_cfg, audio_caption_task = checkpoint_utils.load_model_ensemble_and_task(
-    utils.split_paths(checkpoint_path),
-    arg_overrides=caption_overrides
-)
-
-# Load ckpt & config for Refcoco
-checkpoint_path = 'checkpoints/unival_refcocog/checkpoint_best.pt'
-
-refcoco_overrides = {"bpe_dir":"utils/BPE", "video_model_path": None, "resnet_model_path": None}
-
-refcoco_models, refcoco_cfg, refcoco_task = checkpoint_utils.load_model_ensemble_and_task(
-    utils.split_paths(checkpoint_path),
-    arg_overrides=refcoco_overrides
-)
-refcoco_cfg.common.seed = 7
-refcoco_cfg.generation.beam = 5
-refcoco_cfg.generation.min_len = 4
-refcoco_cfg.generation.max_len_a = 0
-refcoco_cfg.generation.max_len_b = 4
-refcoco_cfg.generation.no_repeat_ngram_size = 3
-
-
-# Load pretrained ckpt & config for VQA
-checkpoint_path = 'checkpoints/unival_vqa/checkpoint_best.pt'
-
-overrides={"video_model_path": None, "resnet_model_path": None}
-parser = options.get_generation_parser()
-input_args = ["", "--task=vqa_gen", "--beam=100", "--unnormalized", f"--path={checkpoint_path}", "--bpe-dir=utils/BPE"]
-args = options.parse_args_and_arch(parser, input_args)
-vqa_cfg = convert_namespace_to_omegaconf(args)
-vqa_task = tasks.setup_task(vqa_cfg.task)
-vqa_models, vqa_cfg = checkpoint_utils.load_model_ensemble(
-    utils.split_paths(vqa_cfg.common_eval.path),
-    task=vqa_task,
-    arg_overrides=overrides
-)
-
-# Load pretrained ckpt & config for Generic Interface
-checkpoint_path = 'checkpoints/unival_s2_hs/checkpoint1.pt'
-
-parser = options.get_generation_parser()
-input_args = ["", "--task=refcoco", "--beam=10", f"--path={checkpoint_path}", "--bpe-dir=utils/BPE", "--no-repeat-ngram-size=3", "--patch-image-size=384"]
-args = options.parse_args_and_arch(parser, input_args)
-general_cfg = convert_namespace_to_omegaconf(args)
-general_task = tasks.setup_task(general_cfg.task)
-
-overrides={"video_model_path": None, "resnet_model_path": None}
-
-general_models, general_cfg = checkpoint_utils.load_model_ensemble(
-    utils.split_paths(general_cfg.common_eval.path),
-    task=general_task,
-    arg_overrides=overrides
-)
-
-# move models to gpu
-move2gpu(caption_models, caption_cfg)
-move2gpu(refcoco_models, refcoco_cfg)
-move2gpu(vqa_models, vqa_cfg)
-move2gpu(general_models, general_cfg)
-move2gpu(video_caption_models, general_cfg)
-move2gpu(audio_caption_models, general_cfg)
-
-# # Initialize generator
-caption_generator = caption_task.build_generator(caption_models, caption_cfg.generation)
-refcoco_generator = refcoco_task.build_generator(refcoco_models, refcoco_cfg.generation)
-vqa_generator = vqa_task.build_generator(vqa_models, vqa_cfg.generation)
-# vqa_generator.zero_shot = True
-# vqa_generator.constraint_trie = None
-general_generator = general_task.build_generator(general_models, general_cfg.generation)
-
-video_caption_generator = caption_task.build_generator(video_caption_models, video_caption_cfg.generation)
-audio_caption_generator = caption_task.build_generator(audio_caption_models, audio_caption_cfg.generation)
-
-# Construct image transforms
-caption_transform = construct_transform(caption_cfg.task.patch_image_size)
-refcoco_transform = construct_transform(refcoco_cfg.task.patch_image_size)
-vqa_transform = construct_transform(vqa_cfg.task.patch_image_size)
-general_transform = construct_transform(general_cfg.task.patch_image_size)
-
-
-# Text preprocess
-bos_item = torch.LongTensor([general_task.src_dict.bos()])
-eos_item = torch.LongTensor([general_task.src_dict.eos()])
-pad_idx = general_task.src_dict.pad()
-
-# Video process
-
-mean = [0.5, 0.5, 0.5]
-std = [0.5, 0.5, 0.5]
-
-type_transform = transforms.Lambda(lambda x: x.float().div(255.0))
-patch_video_resize_transform = transforms.Compose([
-                    transforms.CenterCrop(video_caption_cfg.task.patch_frame_size),
-                    type_transform, 
-                    transforms.Normalize(mean=mean, std=std),
-                ])
-
-# video process
-video_reader = VIDEO_READER_FUNCS['decord'] 
-
-def process_video(video_path, max_num_frames=16, num_frames=16, sample_type='rand',):
-    
-    # video 
-    data_path = os.path.join(video_path)
-
-    frames, frame_indices, video_duration = video_reader(
-        data_path, num_frames, sample_type, max_num_frames=max_num_frames
-    )
-
-    patch_video = patch_video_resize_transform(frames)
-    patch_video = patch_video.permute(1, 0, 2, 3) # -> (C, T, h, w)
-
-    return patch_video.unsqueeze(0)
-
-def construct_video_sample(video_path):
-    
-    patch_video = process_video(video_path, max_num_frames=16, num_frames=video_caption_cfg.task.num_frames, sample_type=video_caption_cfg.task.sample_type,)
-    patch_image = torch.zeros((3, video_caption_cfg.task.patch_image_size, video_caption_cfg.task.patch_image_size))   
-    
-    patch_type = torch.tensor([1])
-    patch_mask = torch.tensor([True])
-    src_text = encode_text(" what does the video describe?", append_bos=True, append_eos=True).unsqueeze(0)
-    src_length = torch.LongTensor([s.ne(pad_idx).long().sum() for s in src_text])
-    sample = {
-        "id":np.array(['42']),
-        "net_input": {
-            "src_tokens": src_text,
-            "src_lengths": src_length,
-            "patch_videos": patch_video,
-            "patch_images": patch_image,
-            "patch_masks": patch_mask,
-            "patch_types": patch_type,
-        }
-    }
-    return sample
-
-#####
-
-# audio process
-mean = [0.5, 0.5, 0.5]
-std = [0.5, 0.5, 0.5]
-
-
-def process_audio(audio_path, sample_rate=48000, max_audio_len=480000, audio_cfg=AUDIO_CFG):
-
-    # audio 
-    data_path = audio_path
-
-
-
-    audio_data, orig_sr = torchaudio.load(data_path)
-    audio_data = torchaudio.transforms.Resample(orig_sr, sample_rate)(audio_data[0])
-
-    sample = {}
-
-    sample = get_audio_features(
-        sample, audio_data, max_audio_len, 
-        data_truncating='rand_trunc', 
-        data_filling='repeatpad',
-        audio_cfg=audio_cfg
-    )
-
-
-    waveform = sample['waveform']
-    patch_audio = waveform
-    
-    return patch_audio.unsqueeze(0)
-
-
-def construct_audio_sample(audio_path):
-    
-    
-    patch_audio = process_audio(audio_path, sample_rate=48000, max_audio_len=480000, audio_cfg=AUDIO_CFG)
-    patch_image = torch.zeros((3, audio_caption_cfg.task.patch_image_size, audio_caption_cfg.task.patch_image_size))   
-    
-    patch_type = torch.tensor([2])
-    patch_mask = torch.tensor([True])
-    src_text = encode_text(" what does the image describe?", append_bos=True, append_eos=True).unsqueeze(0)
-    src_length = torch.LongTensor([s.ne(pad_idx).long().sum() for s in src_text])
-    sample = {
-        "id":np.array(['42']),
-        "net_input": {
-            "src_tokens": src_text,
-            "src_lengths": src_length,
-            "patch_images": patch_image,
-            "patch_audios": patch_audio,
-            "patch_masks": patch_mask,
-            "patch_types": patch_type,
-        }
-    }
-    return sample
-    
-#####
-
-def get_symbols_to_strip_from_output(generator):
-    if hasattr(generator, "symbols_to_strip_from_output"):
-        return generator.symbols_to_strip_from_output
-    else:
-        return {generator.bos, generator.eos}
-
-
-def decode_fn(x, tgt_dict, bpe, generator, tokenizer=None):
-    x = tgt_dict.string(x.int().cpu(), extra_symbols_to_ignore=get_symbols_to_strip_from_output(generator))
-    token_result = []
-    bin_result = []
-    img_result = []
-    for token in x.strip().split():
-      if token.startswith('<bin_'):
-        bin_result.append(token)
-      elif token.startswith('<code_'):
-        img_result.append(token)
-      else:
-        if bpe is not None:
-          token = bpe.decode('{}'.format(token))
-        if tokenizer is not None:
-          token = tokenizer.decode(token)
-        if token.startswith(' ') or len(token_result) == 0:
-          token_result.append(token.strip())
-        else:
-          token_result[-1] += token
-
-    return ' '.join(token_result), ' '.join(bin_result), ' '.join(img_result)
-
-
-def bin2coord(bins, w_resize_ratio, h_resize_ratio, cfg):
-    bin_list = [int(bin[5:-1]) for bin in bins.strip().split()]
-    coord_list = []
-    coord_list += [bin_list[0] / (cfg.task.num_bins - 1) * cfg.task.max_image_size / w_resize_ratio]
-    coord_list += [bin_list[1] / (cfg.task.num_bins - 1) * cfg.task.max_image_size / h_resize_ratio]
-    coord_list += [bin_list[2] / (cfg.task.num_bins - 1) * cfg.task.max_image_size / w_resize_ratio]
-    coord_list += [bin_list[3] / (cfg.task.num_bins - 1) * cfg.task.max_image_size / h_resize_ratio]
-    return coord_list
-
-
-def encode_text(text, length=None, append_bos=False, append_eos=False):
-    line = [
-        general_task.bpe.encode(' {}'.format(word.strip()))
-        if not word.startswith('<code_') and not word.startswith('<bin_') else word
-        for word in text.strip().split()
-    ]
-    line = ' '.join(line)
-    s = general_task.tgt_dict.encode_line(
-        line=line,
-        add_if_not_exist=False,
-        append_eos=False
-    ).long()
-    if length is not None:
-        s = s[:length]
-    if append_bos:
-        s = torch.cat([bos_item, s])
-    if append_eos:
-        s = torch.cat([s, eos_item])
-    return s
-
-# image
-def construct_sample(image: Image, instruction: str, transform):
-    patch_image = transform(image).unsqueeze(0)
-    patch_mask = torch.tensor([True])
-
-    instruction = encode_text(' {}'.format(instruction.lower().strip()), append_bos=True, append_eos=True).unsqueeze(0)
-    instruction_length = torch.LongTensor([s.ne(pad_idx).long().sum() for s in instruction])
-    ref_dict = np.array([{'yes': 1.0}]) # just placeholder
-    sample = {
-        "id": np.array(['42']),
-        "net_input": {
-            "src_tokens": instruction,
-            "src_lengths": instruction_length,
-            "patch_images": patch_image,
-            "patch_masks": patch_mask,
-            
-        },
-        "ref_dict": ref_dict,
-    }
-    return sample
-
-
-# Function to turn FP32 to FP16
-def apply_half(t):
-    if t.dtype is torch.float32:
-        return t.to(dtype=torch.half)
-    return t
-
-
-def inference(image, audio, video, task_type, instruction):
-    if task_type == 'Image Captioning':
-        task = caption_task
-        models = caption_models
-        generator = caption_generator
-        instruction = 'what does the image describe?'
-        transform = caption_transform
-        cfg = caption_cfg
-    elif task_type == 'Video Captioning':
-        task = video_caption_task
-        models = video_caption_models
-        generator = video_caption_generator
-        instruction = 'what does the video describe?'
-        cfg = video_caption_cfg
-    elif task_type == 'Audio Captioning':
-        task = audio_caption_task
-        models = audio_caption_models
-        generator = audio_caption_generator
-        instruction = 'what does the audio describe?'
-        cfg = audio_caption_cfg
-    elif task_type == 'Visual Question Answering':
-        task = vqa_task
-        models = vqa_models
-        generator = vqa_generator
-        transform = vqa_transform
-        cfg = vqa_cfg
-    elif task_type == 'Visual Grounding':
-        task = refcoco_task
-        models = refcoco_models
-        generator = refcoco_generator
-        instruction = 'which region does the text " {} " describe?'.format(instruction)
-        transform = refcoco_transform
-        cfg = refcoco_cfg
-    elif task_type in ['General', 'General Video']:
-        task = general_task
-        models = general_models
-        generator = general_generator
-        transform = general_transform
-        cfg = general_cfg
-    # elif task_type == 'General Video':
-    #     task = general_task
-    #     models = video_general_models
-    #     generator = video_general_generator
-    #     transform = general_transform
-    #     cfg = video_general_cfg
-    else:
-        raise NotImplementedError
-
-    # Construct input sample & preprocess for GPU if cuda available
-    if "Video" in task_type:
-        sample = construct_video_sample(video)
-    elif "Audio" in task_type:
-        sample = construct_audio_sample(audio)
-    else:
-        sample = construct_sample(image, instruction, transform)
-    sample = utils.move_to_cuda(sample) if use_cuda else sample
-    sample = utils.apply_to_sample(apply_half, sample) if use_fp16 else sample
-
-    # Generate result
-    with torch.no_grad():
-        if task_type == 'Visual Question Answering':
-            result, scores = zero_shot_step(vqa_task, generator, models, sample)
-            tokens = result[0]['answer']
-            bins = ''
-        else:
-            hypos = task.inference_step(generator, models, sample)
-            tokens, bins, imgs = decode_fn(hypos[0][0]["tokens"], task.tgt_dict, task.bpe, generator)
-
-    if bins.strip() != '':
-        w, h = image.size
-        w_resize_ratio = task.cfg.patch_image_size / w
-        h_resize_ratio = task.cfg.patch_image_size / h
-        img = np.asarray(image)
-        coord_list = bin2coord(bins, w_resize_ratio, h_resize_ratio, cfg)
-        cv2.rectangle(
-            img,
-            (int(coord_list[0]), int(coord_list[1])),
-            (int(coord_list[2]), int(coord_list[3])),
-            (0, 255, 0),
-            3
-        )
-        return img, None
-    else:
-        return None, tokens
-
-inputs = [gr.inputs.Image(type='pil'), gr.Audio(source="upload", type="filepath"), gr.Video(source="upload", type="filepath"), gr.inputs.Radio(choices=['Image Captioning', 'Video Captioning', 'Audio Captioning', "Visual Grounding", "General", "General Video"], type="value", default="Image Captioning", label="Task"), gr.inputs.Textbox(lines=1, label="Instruction")]
-outputs = [gr.outputs.Image(type='pil'), 'text']
-examples = [
-    ['examples/images/soccer.jpg', None, None, 'Image Captioning', None],
-    # ['examples/images/woman_inblack.jpg', None, None, 'Visual Question Answering', 'what does the woman wearing black do?'],
-    ['examples/images/banana.jpg', None, None, 'Visual Grounding', 'the detached banana'],
-    ['examples/images/skateboard.jpg', None, None, 'Visual Grounding', 'which region does the text " a yellow bird " describe?'],
-    ['examples/images/baseball.jpg', None, None, 'General', 'what is this sport?'],
-    [None, None, 'examples/videos/video7014.mp4', 'Video Captioning', None], 
-    [None, None, 'examples/videos/video7017.mp4', 'Video Captioning', None], 
-    [None, None, 'examples/videos/video7019.mp4', 'Video Captioning', None], 
-    [None, None, 'examples/videos/video7021.mp4', 'Video Captioning', None], 
-    [None, 'examples/audios/6cS0FsUM-cQ.wav', None, 'Audio Captioning', None],
-    [None, 'examples/audios/AJtNitYMa1I.wav', None, 'Audio Captioning', None],
-]
-
-title = "UnIVAL"
-description = "Gradio Demo for UnIVAL:"
-article = "<p style='text-align: center'><a href='https://arxiv.org/abs/2307.16184' target='_blank'>Paper</a> | <a href='https://github.com/mshukor/UnIVAL' target='_blank'>Github Repo</a></p>"
-
-io = gr.Interface(fn=inference, inputs=inputs, outputs=outputs,
-                  title=title, description=description, article=article, examples=examples, cache_examples=False)
-io.launch()
\ No newline at end of file
diff --git a/spaces/mshukor/UnIVAL/fairseq/fairseq/data/multilingual/__init__.py b/spaces/mshukor/UnIVAL/fairseq/fairseq/data/multilingual/__init__.py
deleted file mode 100644
index 6264236915a7269a4d920ee8213004374dd86a9a..0000000000000000000000000000000000000000
--- a/spaces/mshukor/UnIVAL/fairseq/fairseq/data/multilingual/__init__.py
+++ /dev/null
@@ -1,4 +0,0 @@
-# Copyright (c) Facebook, Inc. and its affiliates.
-#
-# This source code is licensed under the MIT license found in the
-# LICENSE file in the root directory of this source tree.
diff --git a/spaces/musicians/deepharmony/lib/Generator.py b/spaces/musicians/deepharmony/lib/Generator.py
deleted file mode 100644
index 4ac91919ba78d30ca54c44d174e55b1046c9c95f..0000000000000000000000000000000000000000
--- a/spaces/musicians/deepharmony/lib/Generator.py
+++ /dev/null
@@ -1,116 +0,0 @@
-import tensorflow as tf
-import numpy as np
-import joblib
-import os
-import sys
-
-module_path = os.path.abspath(os.path.join('./lib'))
-
-if module_path not in sys.path:
-    sys.path.append(module_path)
-
-from MusicXMLParser import MusicXMLDocument as Parser
-
-model = tf.keras.models.load_model('./content/model.h5')
-tokenizer = joblib.load("./content/tokenizer.pkl")
-
-class Generator:
-    NOTES = {
-        "Cb": 11,
-        "C":  0,
-        "C#": 1,
-        "Db": 1,
-        "D":  2,
-        "D#": 3,
-        "Eb": 3,
-        "E":  4,
-        "E#": 5,
-        "Fb": 4,
-        "F":  5,
-        "F#": 6,
-        "Gb": 6,
-        "G":  7,
-        "G#": 8,
-        "Ab": 8,
-        "A": 9,
-        "A#": 10,
-        "Bb": 10,
-        "B": 11,
-        "B#": 0,
-    }
-
-    NUM_TO_NOTE = {
-        0: "C",
-        1: "Db",
-        2: "D",
-        3: "Eb",
-        4: "E",
-        5: "F",
-        6: "Gb",
-        7: "G",
-        8: "Ab",
-        9: "A",
-        10: "Bb",
-        11: "B",
-        -1: "",
-    }
-
-    NUM_TO_QUALITY = {
-        1: "^7",
-        2: "-7",
-        3: "7",
-        -1: "",
-    }
-
-    def decode_tokens(self, numpy_array):
-        total = []
-        for i in numpy_array:
-            total.append([i])
-        return tokenizer.sequences_to_texts(total)
-
-    def decode_chords(self, chords):
-        res = []
-        for chord in chords:
-            res.append(
-                Generator.NUM_TO_NOTE[chord[0]] + Generator.NUM_TO_QUALITY[chord[1]])
-        return res
-
-    def encode_chords(self, chords):
-        res = []
-        for chord in chords:
-            if not chord:
-                continue
-            c = []
-            if len(chord) > 2 and chord[0] + chord[1] in Generator.NOTES:
-                c.append(Generator.NOTES[chord[:2]])
-            else:
-                c.append(Generator.NOTES[chord[0]])
-
-            if "^" in chord or "maj" in chord:
-                c.append(1)
-            elif "-" in chord or "m" in chord:
-                c.append(2)
-            elif "7" in chord or "alt" in chord or "11" in chord:
-                c.append(3)
-            else:
-                c.append(1)
-            res.append(c)
-        return res
-
-    def generateChords(self, chordsBefore, numGenerate = 10):
-        chordsBefore = self.decode_chords(self.encode_chords(chordsBefore))
-        input_eval = [tokenizer.word_index[chord] for chord in chordsBefore]
-
-        input_eval = tf.expand_dims(input_eval, 0)
-        temperature = .1
-
-        newChords = []
-        for i in range(int(numGenerate)):
-            predictions = model(input_eval)
-            predictions = tf.squeeze(predictions, 0)
-            predictions = predictions / temperature
-            predicted_id = tf.random.categorical(
-                predictions, num_samples=1)[-1, 0].numpy()
-            input_eval = tf.expand_dims([predicted_id], 0)
-            newChords.append(predicted_id)
-        return self.decode_tokens(newChords)
diff --git a/spaces/myway1990/text2video/app.py b/spaces/myway1990/text2video/app.py
deleted file mode 100644
index 364251d170fb21913db526ff6e7ee6ec616c658a..0000000000000000000000000000000000000000
--- a/spaces/myway1990/text2video/app.py
+++ /dev/null
@@ -1,55 +0,0 @@
-import gradio as gr
-import os
-import api_get
-from modules.ui_components import FormRow, FormGroup, ToolButton, FormHTML
-# a = os.path.join(os.path.dirname(__file__), "files/world.mp4")  # Video
-# b = os.path.join(os.path.dirname(__file__), "files/a.mp4")  # Video
-# c = os.path.join(os.path.dirname(__file__), "files/b.mp4")  # Video
-clear_prompt_symbol = '\U0001f5d1\ufe0f'  # 🗑️
-def generate_video(text = "<break time=\"5000\"/>，大家奖fsdfdf，房间号是吗？<break time=\"5000\"/>"):
-    # gr.Warning("fjskdf=======")
-    return api_get.generate_video( text = text)
-
-def generate_audio(text = "<break time=\"5000\"/>，大家奖fsdfdf，房间号是吗？<break time=\"5000\"/>"):
-    # gr.Warning("fjskdf=======")
-    return api_get.generate_audio( text = text)
-
-
-with gr.Blocks() as demo:
-    # gr.Markdown("Flip text or image files using this demo.")
-    with gr.Tab("文生视频"):
-        id_part1 = "text_to_video"
-        with gr.Row():
-            with gr.Column():
-                text2video_input = gr.Textbox(placeholder = "输入文案", label = "文字")
-                with gr.Row():
-                    text2video_button2 = gr.Button("插入停顿",  variant='secondary')
-                    text2video_button3 = gr.Button("插入数量",  variant='secondary')
-                    cancel_button1 = gr.ClearButton(variant='stop')
-                    text2video_button = gr.Button("生成",  variant='primary')
-
-            video_output = gr.Video( label = "视频")
-            text2video_button.click(generate_video, inputs=text2video_input, outputs=video_output)   
-            cancel_button1.click(lambda x: "", inputs = text2video_input,  outputs=text2video_input)   
-            text2video_button2.click(lambda x: x+"<break time=\"5000\"/>,", inputs = text2video_input,  outputs=text2video_input)
-            text2video_button3.click(lambda x: x+"<say-as interpret-as=\"cardinal\">123456</say-as>,", inputs = text2video_input,  outputs=text2video_input)
-    with gr.Tab("文生音频"):
-        id_part2 = "text_to_audio"
-        with gr.Row():
-            with gr.Column():
-                text2audio_input = gr.Textbox(placeholder = "输入文案", label = "文字")
-                with gr.Row():
-                    text2audio_button2 = gr.Button("插入停顿",  variant='secondary')
-                    text2audio_button3 = gr.Button("插入数量",  variant='secondary')
-                    cancel_button2 = gr.ClearButton(variant='stop')
-                    text2audio_button = gr.Button("生成",  variant='primary')
-
-            audio_output = gr.Audio(label = "音频")
-            text2audio_button.click(generate_audio, inputs=text2audio_input, outputs=audio_output)   
-            cancel_button2.click(lambda x: "", inputs = text2audio_input,  outputs=text2audio_input)   
-            text2audio_button2.click(lambda x: x+"<break time=\"5000\"/>,", inputs = text2audio_input,  outputs=text2audio_input)
-            text2audio_button3.click(lambda x: x+"<say-as interpret-as=\"cardinal\">123456</say-as>,", inputs = text2audio_input,  outputs=text2audio_input)
-
-if __name__ == "__main__":
-    demo.launch()
-
diff --git a/spaces/nakamura196/yolov5-kunshujo/ultralytics/yolov5/Dockerfile b/spaces/nakamura196/yolov5-kunshujo/ultralytics/yolov5/Dockerfile
deleted file mode 100644
index 304e8b2801a93b6f1676375948469c443612fce3..0000000000000000000000000000000000000000
--- a/spaces/nakamura196/yolov5-kunshujo/ultralytics/yolov5/Dockerfile
+++ /dev/null
@@ -1,65 +0,0 @@
-# YOLOv5 🚀 by Ultralytics, GPL-3.0 license
-
-# Start FROM Nvidia PyTorch image https://ngc.nvidia.com/catalog/containers/nvidia:pytorch
-FROM nvcr.io/nvidia/pytorch:21.10-py3
-
-# Install linux packages
-RUN apt update && apt install -y zip htop screen libgl1-mesa-glx
-
-# Install python dependencies
-COPY requirements.txt .
-RUN python -m pip install --upgrade pip
-RUN pip uninstall -y torch torchvision torchtext
-RUN pip install --no-cache -r requirements.txt albumentations wandb gsutil notebook \
-    torch==1.11.0+cu113 torchvision==0.12.0+cu113 -f https://download.pytorch.org/whl/cu113/torch_stable.html
-# RUN pip install --no-cache -U torch torchvision
-
-# Create working directory
-RUN mkdir -p /usr/src/app
-WORKDIR /usr/src/app
-
-# Copy contents
-RUN git clone https://github.com/ultralytics/yolov5 /usr/src/app
-# COPY . /usr/src/app
-
-# Downloads to user config dir
-ADD https://ultralytics.com/assets/Arial.ttf /root/.config/Ultralytics/
-
-# Set environment variables
-# ENV HOME=/usr/src/app
-
-
-# Usage Examples -------------------------------------------------------------------------------------------------------
-
-# Build and Push
-# t=ultralytics/yolov5:latest && sudo docker build -t $t . && sudo docker push $t
-
-# Pull and Run
-# t=ultralytics/yolov5:latest && sudo docker pull $t && sudo docker run -it --ipc=host --gpus all $t
-
-# Pull and Run with local directory access
-# t=ultralytics/yolov5:latest && sudo docker pull $t && sudo docker run -it --ipc=host --gpus all -v "$(pwd)"/datasets:/usr/src/datasets $t
-
-# Kill all
-# sudo docker kill $(sudo docker ps -q)
-
-# Kill all image-based
-# sudo docker kill $(sudo docker ps -qa --filter ancestor=ultralytics/yolov5:latest)
-
-# Bash into running container
-# sudo docker exec -it 5a9b5863d93d bash
-
-# Bash into stopped container
-# id=$(sudo docker ps -qa) && sudo docker start $id && sudo docker exec -it $id bash
-
-# Clean up
-# docker system prune -a --volumes
-
-# Update Ubuntu drivers
-# https://www.maketecheasier.com/install-nvidia-drivers-ubuntu/
-
-# DDP test
-# python -m torch.distributed.run --nproc_per_node 2 --master_port 1 train.py --epochs 3
-
-# GCP VM from Image
-# docker.io/ultralytics/yolov5:latest
diff --git a/spaces/nanom/to_passive_voice/modules/m_datetime.py b/spaces/nanom/to_passive_voice/modules/m_datetime.py
deleted file mode 100644
index 1325724d2ef7020d4cb650de919f7e7d66da8e87..0000000000000000000000000000000000000000
--- a/spaces/nanom/to_passive_voice/modules/m_datetime.py
+++ /dev/null
@@ -1,24 +0,0 @@
-import pytz
-from datetime import datetime
-
-class Datetime:
-    def __init__(
-        self, 
-        zone: str = "America/Argentina/Cordoba"
-    ) -> None:
-
-        self.time_zone = pytz.timezone(zone)
-        
-    def full(
-        self
-    ) -> str:
-
-        now = datetime.now(self.time_zone)
-        return now.strftime("%H:%M:%S %d-%m-%Y")
-    
-    def day(
-        self
-    ) -> str:
-
-        now = datetime.now(self.time_zone)
-        return now.strftime("%d-%m-%Y")
\ No newline at end of file
diff --git a/spaces/nazneen/seal/seal/utils/inference_utils.py b/spaces/nazneen/seal/seal/utils/inference_utils.py
deleted file mode 100644
index 9457424ca5bfaca92b63a4a33662c92d710e530b..0000000000000000000000000000000000000000
--- a/spaces/nazneen/seal/seal/utils/inference_utils.py
+++ /dev/null
@@ -1,24 +0,0 @@
-import pickle
-from dataclasses import dataclass
-import torch
-
-@dataclass
-class InferenceResults:
-    """
-    Class for storing embeddings and losses from running inference on a model.
-    
-    Fields:
-    - embeddings: (num_examples x num_dimensions) tensor of last-layer embeddings
-    - losses: (num_examples x 1) tensor of losses
-    - outputs: optional (num_examples x num_classes) tensor of output logits
-    - labels: optional (num_examples x 1) tensor of labels
-    """
-    
-    embeddings: torch.Tensor
-    losses: torch.Tensor
-    outputs: torch.Tensor = None
-    labels: torch.Tensor = None 
-
-def saveResults(fname, results):
-    with open(fname, 'wb+') as f:
-        pickle.dump(results, f)
\ No newline at end of file
diff --git a/spaces/netiMophi/DreamlikeArt-Diffusion-1.0/Particle Designer 2.9 VERIFIED Crack For Mac OSX.md b/spaces/netiMophi/DreamlikeArt-Diffusion-1.0/Particle Designer 2.9 VERIFIED Crack For Mac OSX.md
deleted file mode 100644
index a911f7a3e6a49337e8cf68bef0e2916a60a2e679..0000000000000000000000000000000000000000
--- a/spaces/netiMophi/DreamlikeArt-Diffusion-1.0/Particle Designer 2.9 VERIFIED Crack For Mac OSX.md	
+++ /dev/null
@@ -1,15 +0,0 @@
-<br />
-<h1>How to Download Particle Designer 2.9 Crack For Mac OSX</h1>
-<p>Particle Designer 2.9 is a powerful particle effects editor designed specifically for Mac OS X. It allows you to create stunning particle systems for your games and apps, with multiple particle emitters, definable backgrounds, zooming, full-screen, and more. You can also export your particle systems to over 11 frameworks, including Corona SDK, Cocos 2D, Starling, and Marmalade.</p>
-<p>If you want to download Particle Designer 2.9 crack for Mac OSX, you might be tempted to look for some websites that offer cracked software for free. However, this is not a good idea, as you might end up with malware, viruses, or legal issues. Cracked software is illegal and unethical, and it can harm your computer and your data.</p>
-<h2>Particle Designer 2.9 Crack For Mac OSX</h2><br /><p><b><b>DOWNLOAD</b> - <a href="https://urlcod.com/2uIbOU">https://urlcod.com/2uIbOU</a></b></p><br /><br />
-<p>The best way to download Particle Designer 2.9 crack for Mac OSX is to buy it from the official website[^1^]. It costs only $49.99, and you get lifetime updates and support. You also get access to hundreds of free particle emitters submitted by other users. By buying Particle Designer 2.9, you support the developers and help them create more amazing software for Mac users.</p>
-<p>So don't waste your time and money on cracked software that might not work or might damage your system. Download Particle Designer 2.9 crack for Mac OSX from the official website[^1^] and enjoy creating amazing particle effects for your projects.</p>
-
-<p>Particle effects are not only useful for creating realistic simulations of natural phenomena, but also for adding some flair and interactivity to your web design. Particle animation can create stunning visual effects that can impress your visitors and enhance your brand image. There are many examples of particle animation in web design, ranging from subtle backgrounds to eye-catching logos.</p>
-<p></p>
-<p>One of the most popular tools for creating particle animation is particles.js[^1^], a lightweight JavaScript library that can render thousands of particles with high performance and ease of use. You can customize the size, shape, color, movement, and interaction of the particles using a simple JSON configuration file. You can also use the online editor to tweak the parameters and see the results in real time.</p>
-<p>Another option for creating particle animation is using CSS or SVG. These methods can produce more complex and creative effects, such as text or image particles, geometric shapes, or 3D transformations. However, they may require more coding skills and browser compatibility testing. Some examples of CSS or SVG particle animation are Fish in Water[^2^], Interactive Particle Logo[^3^], and Particle Text Animation[^4^].</p>
-<p>Particle animation can be a great way to add some dynamism and personality to your web design, but it should be used with caution. Too many or too large particles can slow down your website performance and distract your visitors from your main content. You should also consider the accessibility and usability of your website, and provide alternative content for users who cannot see or interact with the particles.</p> 7b8c122e87<br />
-<br />
-<br />
\ No newline at end of file
diff --git a/spaces/nikitaPDL2023/assignment4/detectron2/detectron2/modeling/roi_heads/rotated_fast_rcnn.py b/spaces/nikitaPDL2023/assignment4/detectron2/detectron2/modeling/roi_heads/rotated_fast_rcnn.py
deleted file mode 100644
index 1e7bfabdedff5c5a826d8d4f551ea96b541f2cb6..0000000000000000000000000000000000000000
--- a/spaces/nikitaPDL2023/assignment4/detectron2/detectron2/modeling/roi_heads/rotated_fast_rcnn.py
+++ /dev/null
@@ -1,271 +0,0 @@
-# Copyright (c) Facebook, Inc. and its affiliates.
-import logging
-import numpy as np
-import torch
-
-from detectron2.config import configurable
-from detectron2.layers import ShapeSpec, batched_nms_rotated
-from detectron2.structures import Instances, RotatedBoxes, pairwise_iou_rotated
-from detectron2.utils.events import get_event_storage
-
-from ..box_regression import Box2BoxTransformRotated
-from ..poolers import ROIPooler
-from ..proposal_generator.proposal_utils import add_ground_truth_to_proposals
-from .box_head import build_box_head
-from .fast_rcnn import FastRCNNOutputLayers
-from .roi_heads import ROI_HEADS_REGISTRY, StandardROIHeads
-
-logger = logging.getLogger(__name__)
-
-"""
-Shape shorthand in this module:
-
-    N: number of images in the minibatch
-    R: number of ROIs, combined over all images, in the minibatch
-    Ri: number of ROIs in image i
-    K: number of foreground classes. E.g.,there are 80 foreground classes in COCO.
-
-Naming convention:
-
-    deltas: refers to the 5-d (dx, dy, dw, dh, da) deltas that parameterize the box2box
-    transform (see :class:`box_regression.Box2BoxTransformRotated`).
-
-    pred_class_logits: predicted class scores in [-inf, +inf]; use
-        softmax(pred_class_logits) to estimate P(class).
-
-    gt_classes: ground-truth classification labels in [0, K], where [0, K) represent
-        foreground object classes and K represents the background class.
-
-    pred_proposal_deltas: predicted rotated box2box transform deltas for transforming proposals
-        to detection box predictions.
-
-    gt_proposal_deltas: ground-truth rotated box2box transform deltas
-"""
-
-
-def fast_rcnn_inference_rotated(
-    boxes, scores, image_shapes, score_thresh, nms_thresh, topk_per_image
-):
-    """
-    Call `fast_rcnn_inference_single_image_rotated` for all images.
-
-    Args:
-        boxes (list[Tensor]): A list of Tensors of predicted class-specific or class-agnostic
-            boxes for each image. Element i has shape (Ri, K * 5) if doing
-            class-specific regression, or (Ri, 5) if doing class-agnostic
-            regression, where Ri is the number of predicted objects for image i.
-            This is compatible with the output of :meth:`FastRCNNOutputLayers.predict_boxes`.
-        scores (list[Tensor]): A list of Tensors of predicted class scores for each image.
-            Element i has shape (Ri, K + 1), where Ri is the number of predicted objects
-            for image i. Compatible with the output of :meth:`FastRCNNOutputLayers.predict_probs`.
-        image_shapes (list[tuple]): A list of (width, height) tuples for each image in the batch.
-        score_thresh (float): Only return detections with a confidence score exceeding this
-            threshold.
-        nms_thresh (float):  The threshold to use for box non-maximum suppression. Value in [0, 1].
-        topk_per_image (int): The number of top scoring detections to return. Set < 0 to return
-            all detections.
-
-    Returns:
-        instances: (list[Instances]): A list of N instances, one for each image in the batch,
-            that stores the topk most confidence detections.
-        kept_indices: (list[Tensor]): A list of 1D tensor of length of N, each element indicates
-            the corresponding boxes/scores index in [0, Ri) from the input, for image i.
-    """
-    result_per_image = [
-        fast_rcnn_inference_single_image_rotated(
-            boxes_per_image, scores_per_image, image_shape, score_thresh, nms_thresh, topk_per_image
-        )
-        for scores_per_image, boxes_per_image, image_shape in zip(scores, boxes, image_shapes)
-    ]
-    return [x[0] for x in result_per_image], [x[1] for x in result_per_image]
-
-
-@torch.no_grad()
-def fast_rcnn_inference_single_image_rotated(
-    boxes, scores, image_shape, score_thresh, nms_thresh, topk_per_image
-):
-    """
-    Single-image inference. Return rotated bounding-box detection results by thresholding
-    on scores and applying rotated non-maximum suppression (Rotated NMS).
-
-    Args:
-        Same as `fast_rcnn_inference_rotated`, but with rotated boxes, scores, and image shapes
-        per image.
-
-    Returns:
-        Same as `fast_rcnn_inference_rotated`, but for only one image.
-    """
-    valid_mask = torch.isfinite(boxes).all(dim=1) & torch.isfinite(scores).all(dim=1)
-    if not valid_mask.all():
-        boxes = boxes[valid_mask]
-        scores = scores[valid_mask]
-
-    B = 5  # box dimension
-    scores = scores[:, :-1]
-    num_bbox_reg_classes = boxes.shape[1] // B
-    # Convert to Boxes to use the `clip` function ...
-    boxes = RotatedBoxes(boxes.reshape(-1, B))
-    boxes.clip(image_shape)
-    boxes = boxes.tensor.view(-1, num_bbox_reg_classes, B)  # R x C x B
-    # Filter results based on detection scores
-    filter_mask = scores > score_thresh  # R x K
-    # R' x 2. First column contains indices of the R predictions;
-    # Second column contains indices of classes.
-    filter_inds = filter_mask.nonzero()
-    if num_bbox_reg_classes == 1:
-        boxes = boxes[filter_inds[:, 0], 0]
-    else:
-        boxes = boxes[filter_mask]
-    scores = scores[filter_mask]
-
-    # Apply per-class Rotated NMS
-    keep = batched_nms_rotated(boxes, scores, filter_inds[:, 1], nms_thresh)
-    if topk_per_image >= 0:
-        keep = keep[:topk_per_image]
-    boxes, scores, filter_inds = boxes[keep], scores[keep], filter_inds[keep]
-
-    result = Instances(image_shape)
-    result.pred_boxes = RotatedBoxes(boxes)
-    result.scores = scores
-    result.pred_classes = filter_inds[:, 1]
-
-    return result, filter_inds[:, 0]
-
-
-class RotatedFastRCNNOutputLayers(FastRCNNOutputLayers):
-    """
-    Two linear layers for predicting Rotated Fast R-CNN outputs.
-    """
-
-    @classmethod
-    def from_config(cls, cfg, input_shape):
-        args = super().from_config(cfg, input_shape)
-        args["box2box_transform"] = Box2BoxTransformRotated(
-            weights=cfg.MODEL.ROI_BOX_HEAD.BBOX_REG_WEIGHTS
-        )
-        return args
-
-    def inference(self, predictions, proposals):
-        """
-        Returns:
-            list[Instances]: same as `fast_rcnn_inference_rotated`.
-            list[Tensor]: same as `fast_rcnn_inference_rotated`.
-        """
-        boxes = self.predict_boxes(predictions, proposals)
-        scores = self.predict_probs(predictions, proposals)
-        image_shapes = [x.image_size for x in proposals]
-
-        return fast_rcnn_inference_rotated(
-            boxes,
-            scores,
-            image_shapes,
-            self.test_score_thresh,
-            self.test_nms_thresh,
-            self.test_topk_per_image,
-        )
-
-
-@ROI_HEADS_REGISTRY.register()
-class RROIHeads(StandardROIHeads):
-    """
-    This class is used by Rotated Fast R-CNN to detect rotated boxes.
-    For now, it only supports box predictions but not mask or keypoints.
-    """
-
-    @configurable
-    def __init__(self, **kwargs):
-        """
-        NOTE: this interface is experimental.
-        """
-        super().__init__(**kwargs)
-        assert (
-            not self.mask_on and not self.keypoint_on
-        ), "Mask/Keypoints not supported in Rotated ROIHeads."
-        assert not self.train_on_pred_boxes, "train_on_pred_boxes not implemented for RROIHeads!"
-
-    @classmethod
-    def _init_box_head(cls, cfg, input_shape):
-        # fmt: off
-        in_features       = cfg.MODEL.ROI_HEADS.IN_FEATURES
-        pooler_resolution = cfg.MODEL.ROI_BOX_HEAD.POOLER_RESOLUTION
-        pooler_scales     = tuple(1.0 / input_shape[k].stride for k in in_features)
-        sampling_ratio    = cfg.MODEL.ROI_BOX_HEAD.POOLER_SAMPLING_RATIO
-        pooler_type       = cfg.MODEL.ROI_BOX_HEAD.POOLER_TYPE
-        # fmt: on
-        assert pooler_type in ["ROIAlignRotated"], pooler_type
-        # assume all channel counts are equal
-        in_channels = [input_shape[f].channels for f in in_features][0]
-
-        box_pooler = ROIPooler(
-            output_size=pooler_resolution,
-            scales=pooler_scales,
-            sampling_ratio=sampling_ratio,
-            pooler_type=pooler_type,
-        )
-        box_head = build_box_head(
-            cfg, ShapeSpec(channels=in_channels, height=pooler_resolution, width=pooler_resolution)
-        )
-        # This line is the only difference v.s. StandardROIHeads
-        box_predictor = RotatedFastRCNNOutputLayers(cfg, box_head.output_shape)
-        return {
-            "box_in_features": in_features,
-            "box_pooler": box_pooler,
-            "box_head": box_head,
-            "box_predictor": box_predictor,
-        }
-
-    @torch.no_grad()
-    def label_and_sample_proposals(self, proposals, targets):
-        """
-        Prepare some proposals to be used to train the RROI heads.
-        It performs box matching between `proposals` and `targets`, and assigns
-        training labels to the proposals.
-        It returns `self.batch_size_per_image` random samples from proposals and groundtruth boxes,
-        with a fraction of positives that is no larger than `self.positive_sample_fraction.
-
-        Args:
-            See :meth:`StandardROIHeads.forward`
-
-        Returns:
-            list[Instances]: length `N` list of `Instances`s containing the proposals
-                sampled for training. Each `Instances` has the following fields:
-                - proposal_boxes: the rotated proposal boxes
-                - gt_boxes: the ground-truth rotated boxes that the proposal is assigned to
-                  (this is only meaningful if the proposal has a label > 0; if label = 0
-                   then the ground-truth box is random)
-                - gt_classes: the ground-truth classification lable for each proposal
-        """
-        if self.proposal_append_gt:
-            proposals = add_ground_truth_to_proposals(targets, proposals)
-
-        proposals_with_gt = []
-
-        num_fg_samples = []
-        num_bg_samples = []
-        for proposals_per_image, targets_per_image in zip(proposals, targets):
-            has_gt = len(targets_per_image) > 0
-            match_quality_matrix = pairwise_iou_rotated(
-                targets_per_image.gt_boxes, proposals_per_image.proposal_boxes
-            )
-            matched_idxs, matched_labels = self.proposal_matcher(match_quality_matrix)
-            sampled_idxs, gt_classes = self._sample_proposals(
-                matched_idxs, matched_labels, targets_per_image.gt_classes
-            )
-
-            proposals_per_image = proposals_per_image[sampled_idxs]
-            proposals_per_image.gt_classes = gt_classes
-
-            if has_gt:
-                sampled_targets = matched_idxs[sampled_idxs]
-                proposals_per_image.gt_boxes = targets_per_image.gt_boxes[sampled_targets]
-
-            num_bg_samples.append((gt_classes == self.num_classes).sum().item())
-            num_fg_samples.append(gt_classes.numel() - num_bg_samples[-1])
-            proposals_with_gt.append(proposals_per_image)
-
-        # Log the number of fg/bg samples that are selected for training ROI heads
-        storage = get_event_storage()
-        storage.put_scalar("roi_head/num_fg_samples", np.mean(num_fg_samples))
-        storage.put_scalar("roi_head/num_bg_samples", np.mean(num_bg_samples))
-
-        return proposals_with_gt
diff --git a/spaces/nikitaPDL2023/assignment4/detectron2/dev/run_inference_tests.sh b/spaces/nikitaPDL2023/assignment4/detectron2/dev/run_inference_tests.sh
deleted file mode 100644
index bc9dcc56f06f79fc5efa42c04ffdc07c2787e3ac..0000000000000000000000000000000000000000
--- a/spaces/nikitaPDL2023/assignment4/detectron2/dev/run_inference_tests.sh
+++ /dev/null
@@ -1,44 +0,0 @@
-#!/bin/bash -e
-# Copyright (c) Facebook, Inc. and its affiliates.
-
-BIN="python tools/train_net.py"
-OUTPUT="inference_test_output"
-NUM_GPUS=2
-
-CFG_LIST=( "${@:1}" )
-
-if [ ${#CFG_LIST[@]} -eq 0 ]; then
-  CFG_LIST=( ./configs/quick_schedules/*inference_acc_test.yaml )
-fi
-
-echo "========================================================================"
-echo "Configs to run:"
-echo "${CFG_LIST[@]}"
-echo "========================================================================"
-
-
-for cfg in "${CFG_LIST[@]}"; do
-    echo "========================================================================"
-    echo "Running $cfg ..."
-    echo "========================================================================"
-    $BIN \
-      --eval-only \
-      --num-gpus $NUM_GPUS \
-      --config-file "$cfg" \
-      OUTPUT_DIR $OUTPUT
-      rm -rf $OUTPUT
-done
-
-
-echo "========================================================================"
-echo "Running demo.py ..."
-echo "========================================================================"
-DEMO_BIN="python demo/demo.py"
-COCO_DIR=datasets/coco/val2014
-mkdir -pv $OUTPUT
-
-set -v
-
-$DEMO_BIN --config-file ./configs/quick_schedules/panoptic_fpn_R_50_inference_acc_test.yaml \
-  --input $COCO_DIR/COCO_val2014_0000001933* --output $OUTPUT
-rm -rf $OUTPUT
diff --git a/spaces/nikitaPDL2023/assignment4/detectron2/projects/DeepLab/deeplab/resnet.py b/spaces/nikitaPDL2023/assignment4/detectron2/projects/DeepLab/deeplab/resnet.py
deleted file mode 100644
index 2cc277b24630a9425f4c37e1abc3352b49e1a031..0000000000000000000000000000000000000000
--- a/spaces/nikitaPDL2023/assignment4/detectron2/projects/DeepLab/deeplab/resnet.py
+++ /dev/null
@@ -1,158 +0,0 @@
-# Copyright (c) Facebook, Inc. and its affiliates.
-import fvcore.nn.weight_init as weight_init
-import torch.nn.functional as F
-
-from detectron2.layers import CNNBlockBase, Conv2d, get_norm
-from detectron2.modeling import BACKBONE_REGISTRY
-from detectron2.modeling.backbone.resnet import (
-    BasicStem,
-    BottleneckBlock,
-    DeformBottleneckBlock,
-    ResNet,
-)
-
-
-class DeepLabStem(CNNBlockBase):
-    """
-    The DeepLab ResNet stem (layers before the first residual block).
-    """
-
-    def __init__(self, in_channels=3, out_channels=128, norm="BN"):
-        """
-        Args:
-            norm (str or callable): norm after the first conv layer.
-                See :func:`layers.get_norm` for supported format.
-        """
-        super().__init__(in_channels, out_channels, 4)
-        self.in_channels = in_channels
-        self.conv1 = Conv2d(
-            in_channels,
-            out_channels // 2,
-            kernel_size=3,
-            stride=2,
-            padding=1,
-            bias=False,
-            norm=get_norm(norm, out_channels // 2),
-        )
-        self.conv2 = Conv2d(
-            out_channels // 2,
-            out_channels // 2,
-            kernel_size=3,
-            stride=1,
-            padding=1,
-            bias=False,
-            norm=get_norm(norm, out_channels // 2),
-        )
-        self.conv3 = Conv2d(
-            out_channels // 2,
-            out_channels,
-            kernel_size=3,
-            stride=1,
-            padding=1,
-            bias=False,
-            norm=get_norm(norm, out_channels),
-        )
-        weight_init.c2_msra_fill(self.conv1)
-        weight_init.c2_msra_fill(self.conv2)
-        weight_init.c2_msra_fill(self.conv3)
-
-    def forward(self, x):
-        x = self.conv1(x)
-        x = F.relu_(x)
-        x = self.conv2(x)
-        x = F.relu_(x)
-        x = self.conv3(x)
-        x = F.relu_(x)
-        x = F.max_pool2d(x, kernel_size=3, stride=2, padding=1)
-        return x
-
-
-@BACKBONE_REGISTRY.register()
-def build_resnet_deeplab_backbone(cfg, input_shape):
-    """
-    Create a ResNet instance from config.
-    Returns:
-        ResNet: a :class:`ResNet` instance.
-    """
-    # need registration of new blocks/stems?
-    norm = cfg.MODEL.RESNETS.NORM
-    if cfg.MODEL.RESNETS.STEM_TYPE == "basic":
-        stem = BasicStem(
-            in_channels=input_shape.channels,
-            out_channels=cfg.MODEL.RESNETS.STEM_OUT_CHANNELS,
-            norm=norm,
-        )
-    elif cfg.MODEL.RESNETS.STEM_TYPE == "deeplab":
-        stem = DeepLabStem(
-            in_channels=input_shape.channels,
-            out_channels=cfg.MODEL.RESNETS.STEM_OUT_CHANNELS,
-            norm=norm,
-        )
-    else:
-        raise ValueError("Unknown stem type: {}".format(cfg.MODEL.RESNETS.STEM_TYPE))
-
-    # fmt: off
-    freeze_at           = cfg.MODEL.BACKBONE.FREEZE_AT
-    out_features        = cfg.MODEL.RESNETS.OUT_FEATURES
-    depth               = cfg.MODEL.RESNETS.DEPTH
-    num_groups          = cfg.MODEL.RESNETS.NUM_GROUPS
-    width_per_group     = cfg.MODEL.RESNETS.WIDTH_PER_GROUP
-    bottleneck_channels = num_groups * width_per_group
-    in_channels         = cfg.MODEL.RESNETS.STEM_OUT_CHANNELS
-    out_channels        = cfg.MODEL.RESNETS.RES2_OUT_CHANNELS
-    stride_in_1x1       = cfg.MODEL.RESNETS.STRIDE_IN_1X1
-    res4_dilation       = cfg.MODEL.RESNETS.RES4_DILATION
-    res5_dilation       = cfg.MODEL.RESNETS.RES5_DILATION
-    deform_on_per_stage = cfg.MODEL.RESNETS.DEFORM_ON_PER_STAGE
-    deform_modulated    = cfg.MODEL.RESNETS.DEFORM_MODULATED
-    deform_num_groups   = cfg.MODEL.RESNETS.DEFORM_NUM_GROUPS
-    res5_multi_grid     = cfg.MODEL.RESNETS.RES5_MULTI_GRID
-    # fmt: on
-    assert res4_dilation in {1, 2}, "res4_dilation cannot be {}.".format(res4_dilation)
-    assert res5_dilation in {1, 2, 4}, "res5_dilation cannot be {}.".format(res5_dilation)
-    if res4_dilation == 2:
-        # Always dilate res5 if res4 is dilated.
-        assert res5_dilation == 4
-
-    num_blocks_per_stage = {50: [3, 4, 6, 3], 101: [3, 4, 23, 3], 152: [3, 8, 36, 3]}[depth]
-
-    stages = []
-
-    # Avoid creating variables without gradients
-    # It consumes extra memory and may cause allreduce to fail
-    out_stage_idx = [{"res2": 2, "res3": 3, "res4": 4, "res5": 5}[f] for f in out_features]
-    max_stage_idx = max(out_stage_idx)
-    for idx, stage_idx in enumerate(range(2, max_stage_idx + 1)):
-        if stage_idx == 4:
-            dilation = res4_dilation
-        elif stage_idx == 5:
-            dilation = res5_dilation
-        else:
-            dilation = 1
-        first_stride = 1 if idx == 0 or dilation > 1 else 2
-        stage_kargs = {
-            "num_blocks": num_blocks_per_stage[idx],
-            "stride_per_block": [first_stride] + [1] * (num_blocks_per_stage[idx] - 1),
-            "in_channels": in_channels,
-            "out_channels": out_channels,
-            "norm": norm,
-        }
-        stage_kargs["bottleneck_channels"] = bottleneck_channels
-        stage_kargs["stride_in_1x1"] = stride_in_1x1
-        stage_kargs["dilation"] = dilation
-        stage_kargs["num_groups"] = num_groups
-        if deform_on_per_stage[idx]:
-            stage_kargs["block_class"] = DeformBottleneckBlock
-            stage_kargs["deform_modulated"] = deform_modulated
-            stage_kargs["deform_num_groups"] = deform_num_groups
-        else:
-            stage_kargs["block_class"] = BottleneckBlock
-        if stage_idx == 5:
-            stage_kargs.pop("dilation")
-            stage_kargs["dilation_per_block"] = [dilation * mg for mg in res5_multi_grid]
-        blocks = ResNet.make_stage(**stage_kargs)
-        in_channels = out_channels
-        out_channels *= 2
-        bottleneck_channels *= 2
-        stages.append(blocks)
-    return ResNet(stem, stages, out_features=out_features).freeze(freeze_at)
diff --git a/spaces/nikitaPDL2023/assignment4/detectron2/projects/TensorMask/tensormask/layers/csrc/vision.cpp b/spaces/nikitaPDL2023/assignment4/detectron2/projects/TensorMask/tensormask/layers/csrc/vision.cpp
deleted file mode 100644
index ed1ed0b3d5911021bf7b4a03126b5140b5286970..0000000000000000000000000000000000000000
--- a/spaces/nikitaPDL2023/assignment4/detectron2/projects/TensorMask/tensormask/layers/csrc/vision.cpp
+++ /dev/null
@@ -1,19 +0,0 @@
-// Copyright (c) Facebook, Inc. and its affiliates.
-
-#include <torch/extension.h>
-#include "SwapAlign2Nat/SwapAlign2Nat.h"
-
-namespace tensormask {
-
-PYBIND11_MODULE(TORCH_EXTENSION_NAME, m) {
-  m.def(
-      "swap_align2nat_forward",
-      &SwapAlign2Nat_forward,
-      "SwapAlign2Nat_forward");
-  m.def(
-      "swap_align2nat_backward",
-      &SwapAlign2Nat_backward,
-      "SwapAlign2Nat_backward");
-}
-
-} // namespace tensormask
diff --git a/spaces/nmitchko/AI-in-Healthcare/style.css b/spaces/nmitchko/AI-in-Healthcare/style.css
deleted file mode 100644
index 7babc81a203c64c6b220e09b7734a591a80447be..0000000000000000000000000000000000000000
--- a/spaces/nmitchko/AI-in-Healthcare/style.css
+++ /dev/null
@@ -1,44 +0,0 @@
-body {
-	padding: 2rem;
-	font-family: -apple-system, BlinkMacSystemFont, "Arial", sans-serif;
-}
-
-h1 {
-	font-size: 16px;
-	margin-top: 0;
-}
-
-    body {
-        margin: 0;
-        padding: 0;
-    }
-
-    iframe {
-        display: block;
-        width: 100vw;
-        height: 100vh;
-        max-width: 100%;
-        margin: 0;
-        padding: 0;
-        border: 0 none;
-        box-sizing: border-box;
-    }
-
-p {
-	color: rgb(107, 114, 128);
-	font-size: 15px;
-	margin-bottom: 10px;
-	margin-top: 5px;
-}
-
-.card {
-	max-width: 620px;
-	margin: 0 auto;
-	padding: 16px;
-	border: 1px solid lightgray;
-	border-radius: 16px;
-}
-
-.card p:last-child {
-	margin-bottom: 0;
-}
diff --git a/spaces/nomic-ai/hakurei_open-instruct-v1/README.md b/spaces/nomic-ai/hakurei_open-instruct-v1/README.md
deleted file mode 100644
index 8391487778d88cee16621af25ffeec6be567d53c..0000000000000000000000000000000000000000
--- a/spaces/nomic-ai/hakurei_open-instruct-v1/README.md
+++ /dev/null
@@ -1,8 +0,0 @@
----
-title: hakurei/open-instruct-v1
-emoji: 🗺️
-colorFrom: purple
-colorTo: red
-sdk: static
-pinned: false
----
diff --git a/spaces/oguzakif/video-object-remover/FGT_codes/FGT/models/model.py b/spaces/oguzakif/video-object-remover/FGT_codes/FGT/models/model.py
deleted file mode 100644
index fe3cef1f2d1fafdbea4ad2b504187ca701d927f8..0000000000000000000000000000000000000000
--- a/spaces/oguzakif/video-object-remover/FGT_codes/FGT/models/model.py
+++ /dev/null
@@ -1,284 +0,0 @@
-from models.BaseNetwork import BaseNetwork
-from models.transformer_base.ffn_base import FusionFeedForward
-from models.transformer_base.attention_flow import SWMHSA_depthGlobalWindowConcatLN_qkFlow_reweightFlow
-from models.transformer_base.attention_base import TMHSA
-
-import torch
-import torch.nn as nn
-from functools import reduce
-import torch.nn.functional as F
-
-
-class Model(nn.Module):
-    def __init__(self, config):
-        super(Model, self).__init__()
-        self.net = FGT(config['tw'], config['sw'], config['gd'], config['input_resolution'], config['in_channel'],
-                        config['cnum'], config['flow_inChannel'], config['flow_cnum'], config['frame_hidden'],
-                        config['flow_hidden'], config['PASSMASK'],
-                        config['numBlocks'], config['kernel_size'], config['stride'], config['padding'],
-                        config['num_head'], config['conv_type'], config['norm'],
-                        config['use_bias'], config['ape'],
-                        config['mlp_ratio'], config['drop'], config['init_weights'])
-
-    def forward(self, frames, flows, masks):
-        ret = self.net(frames, flows, masks)
-        return ret
-
-
-class Encoder(nn.Module):
-    def __init__(self, in_channels):
-        super(Encoder, self).__init__()
-        self.group = [1, 2, 4, 8, 1]
-        self.layers = nn.ModuleList([
-            nn.Conv2d(in_channels, 64, kernel_size=3, stride=2, padding=1),
-            nn.LeakyReLU(0.2, inplace=True),
-            nn.Conv2d(64, 64, kernel_size=3, stride=1, padding=1),
-            nn.LeakyReLU(0.2, inplace=True),
-            nn.Conv2d(64, 128, kernel_size=3, stride=2, padding=1),
-            nn.LeakyReLU(0.2, inplace=True),
-            nn.Conv2d(128, 256, kernel_size=3, stride=1, padding=1),
-            nn.LeakyReLU(0.2, inplace=True),
-            nn.Conv2d(256, 384, kernel_size=3, stride=1, padding=1, groups=1),
-            nn.LeakyReLU(0.2, inplace=True),
-            nn.Conv2d(640, 512, kernel_size=3, stride=1, padding=1, groups=2),
-            nn.LeakyReLU(0.2, inplace=True),
-            nn.Conv2d(768, 384, kernel_size=3, stride=1, padding=1, groups=4),
-            nn.LeakyReLU(0.2, inplace=True),
-            nn.Conv2d(640, 256, kernel_size=3, stride=1, padding=1, groups=8),
-            nn.LeakyReLU(0.2, inplace=True),
-            nn.Conv2d(512, 128, kernel_size=3, stride=1, padding=1, groups=1),
-            nn.LeakyReLU(0.2, inplace=True)
-        ])
-
-    def forward(self, x):
-        bt, c, h, w = x.size()
-        h, w = h // 4, w // 4
-        out = x
-        for i, layer in enumerate(self.layers):
-            if i == 8:
-                x0 = out
-            if i > 8 and i % 2 == 0:
-                g = self.group[(i - 8) // 2]
-                x = x0.view(bt, g, -1, h, w)
-                o = out.view(bt, g, -1, h, w)
-                out = torch.cat([x, o], 2).view(bt, -1, h, w)
-            out = layer(out)
-        return out
-
-
-class AddPosEmb(nn.Module):
-    def __init__(self, h, w, in_channels, out_channels):
-        super(AddPosEmb, self).__init__()
-        self.proj = nn.Conv2d(in_channels, out_channels, 3, 1, 1, bias=True, groups=out_channels)
-        self.h, self.w = h, w
-
-    def forward(self, x, h=0, w=0):
-        B, N, C = x.shape
-        if h == 0 and w == 0:
-            assert N == self.h * self.w, 'Wrong input size'
-        else:
-            assert N == h * w, 'Wrong input size during inference'
-        feat_token = x
-        if h == 0 and w == 0:
-            cnn_feat = feat_token.transpose(1, 2).view(B, C, self.h, self.w)
-        else:
-            cnn_feat = feat_token.transpose(1, 2).view(B, C, h, w)
-        x = self.proj(cnn_feat) + cnn_feat
-        x = x.flatten(2).transpose(1, 2)
-        return x
-
-
-class Vec2Patch(nn.Module):
-    def __init__(self, channel, hidden, output_size, kernel_size, stride, padding):
-        super(Vec2Patch, self).__init__()
-        self.relu = nn.LeakyReLU(0.2, inplace=True)
-        c_out = reduce((lambda x, y: x * y), kernel_size) * channel
-        self.embedding = nn.Linear(hidden, c_out)
-        self.restore = nn.Fold(output_size=output_size, kernel_size=kernel_size, stride=stride, padding=padding)
-        self.kernel_size = kernel_size
-        self.stride = stride
-        self.padding = padding
-
-    def forward(self, x, output_h=0, output_w=0):
-        feat = self.embedding(x)
-        feat = feat.permute(0, 2, 1)
-        if output_h != 0 or output_w != 0:
-            feat = F.fold(feat, output_size=(output_h, output_w), kernel_size=self.kernel_size, stride=self.stride,
-                          padding=self.padding)
-        else:
-            feat = self.restore(feat)
-        return feat
-
-
-class TemporalTransformer(nn.Module):
-    def __init__(self, token_size, frame_hidden, num_heads, t_groupSize, mlp_ratio, dropout, n_vecs,
-                 t2t_params):
-        super(TemporalTransformer, self).__init__()
-        self.attention = TMHSA(token_size=token_size, group_size=t_groupSize, d_model=frame_hidden, head=num_heads,
-                               p=dropout)
-        self.ffn = FusionFeedForward(frame_hidden, mlp_ratio, n_vecs, t2t_params, p=dropout)
-        self.norm1 = nn.LayerNorm(frame_hidden)
-        self.norm2 = nn.LayerNorm(frame_hidden)
-        self.dropout = nn.Dropout(p=dropout)
-
-    def forward(self, x, t, h, w, output_size):
-        token_size = h * w
-        s = self.norm1(x)
-        x = x + self.dropout(self.attention(s, t, h, w))
-        y = self.norm2(x)
-        x = x + self.ffn(y, token_size, output_size[0], output_size[1])
-        return x
-
-
-class SpatialTransformer(nn.Module):
-    def __init__(self, token_size, frame_hidden, flow_hidden, num_heads, s_windowSize, g_downSize, mlp_ratio,
-                 dropout, n_vecs, t2t_params):
-        super(SpatialTransformer, self).__init__()
-        self.attention = SWMHSA_depthGlobalWindowConcatLN_qkFlow_reweightFlow(token_size=token_size, window_size=s_windowSize,
-                                                                kernel_size=g_downSize, d_model=frame_hidden,
-                                                                flow_dModel=flow_hidden, head=num_heads, p=dropout)
-        self.ffn = FusionFeedForward(frame_hidden, mlp_ratio, n_vecs, t2t_params, p=dropout)
-        self.norm = nn.LayerNorm(frame_hidden)
-        self.dropout = nn.Dropout(p=dropout)
-
-    def forward(self, x, f, t, h, w, output_size):
-        token_size = h * w
-        x = x + self.dropout(self.attention(x, f, t, h, w))
-        y = self.norm(x)
-        x = x + self.ffn(y, token_size, output_size[0], output_size[1])
-        return x
-
-
-class TransformerBlock(nn.Module):
-    def __init__(self, token_size, frame_hidden, flow_hidden, num_heads, t_groupSize, s_windowSize, g_downSize,
-                 mlp_ratio,
-                 dropout, n_vecs,
-                 t2t_params):
-        super(TransformerBlock, self).__init__()
-        self.t_transformer = TemporalTransformer(token_size=token_size, frame_hidden=frame_hidden, num_heads=num_heads,
-                                                 t_groupSize=t_groupSize, mlp_ratio=mlp_ratio,
-                                                 dropout=dropout, n_vecs=n_vecs,
-                                                 t2t_params=t2t_params)  # temporal multi-head self attention
-        self.s_transformer = SpatialTransformer(token_size=token_size, frame_hidden=frame_hidden,
-                                                flow_hidden=flow_hidden, num_heads=num_heads, s_windowSize=s_windowSize,
-                                                g_downSize=g_downSize, mlp_ratio=mlp_ratio,
-                                                dropout=dropout, n_vecs=n_vecs, t2t_params=t2t_params)
-
-    def forward(self, inputs):
-        x, f, t = inputs['x'], inputs['f'], inputs['t']
-        h, w = inputs['h'], inputs['w']
-        output_size = inputs['output_size']
-        x = self.t_transformer(x, t, h, w, output_size)
-        x = self.s_transformer(x, f, t, h, w, output_size)
-        return {'x': x, 'f': f, 't': t, 'h': h, 'w': w, 'output_size': output_size}
-
-
-class Decoder(BaseNetwork):
-    def __init__(self, conv_type, in_channels, out_channels, use_bias, norm=None):
-        super(Decoder, self).__init__(conv_type)
-        self.layer1 = self.DeconvBlock(in_channels, in_channels, kernel_size=3, padding=1, norm=norm,
-                                       bias=use_bias)
-        self.layer2 = self.ConvBlock(in_channels, in_channels // 2, kernel_size=3, stride=1, padding=1, norm=norm,
-                                     bias=use_bias)
-        self.layer3 = self.DeconvBlock(in_channels // 2, in_channels // 2, kernel_size=3, padding=1, norm=norm,
-                                       bias=use_bias)
-        self.final = self.ConvBlock(in_channels // 2, out_channels, kernel_size=3, stride=1, padding=1, norm=norm,
-                                    bias=use_bias, activation=None)
-
-    def forward(self, features):
-        feat1 = self.layer1(features)
-        feat2 = self.layer2(feat1)
-        feat3 = self.layer3(feat2)
-        output = self.final(feat3)
-        return output
-
-
-class FGT(BaseNetwork):
-    def __init__(self, t_groupSize, s_windowSize, g_downSize, input_resolution, in_channels, cnum, flow_inChannel,
-                 flow_cnum,
-                 frame_hidden, flow_hidden, passmask, numBlocks, kernel_size, stride, padding, num_heads, conv_type,
-                 norm, use_bias, ape, mlp_ratio=4, drop=0, init_weights=True):
-        super(FGT, self).__init__(conv_type)
-        self.in_channels = in_channels
-        self.passmask = passmask
-        self.ape = ape
-        self.frame_endoder = Encoder(in_channels)
-        self.flow_encoder = nn.Sequential(
-            nn.ReplicationPad2d(2),
-            self.ConvBlock(flow_inChannel, flow_cnum, kernel_size=5, stride=1, padding=0, bias=use_bias, norm=norm),
-            self.ConvBlock(flow_cnum, flow_cnum * 2, kernel_size=3, stride=2, padding=1, bias=use_bias, norm=norm),
-            self.ConvBlock(flow_cnum * 2, flow_cnum * 2, kernel_size=3, stride=1, padding=1, bias=use_bias, norm=norm),
-            self.ConvBlock(flow_cnum * 2, flow_cnum * 2, kernel_size=3, stride=2, padding=1, bias=use_bias, norm=norm)
-        )
-        # patch to vector operation
-        self.patch2vec = nn.Conv2d(cnum * 2, frame_hidden, kernel_size=kernel_size, stride=stride, padding=padding)
-        self.f_patch2vec = nn.Conv2d(flow_cnum * 2, flow_hidden, kernel_size=kernel_size, stride=stride,
-                                     padding=padding)
-        # initialize transformer blocks for frame completion
-        n_vecs = 1
-        token_size = []
-        output_shape = (input_resolution[0] // 4, input_resolution[1] // 4)
-        for i, d in enumerate(kernel_size):
-            token_nums = int((output_shape[i] + 2 * padding[i] - kernel_size[i]) / stride[i] + 1)
-            n_vecs *= token_nums
-            token_size.append(token_nums)
-        # Add positional embedding to the encode features
-        if self.ape:
-            self.add_pos_emb = AddPosEmb(token_size[0], token_size[1], frame_hidden, frame_hidden)
-        self.token_size = token_size
-        # initialize transformer blocks
-        blocks = []
-        t2t_params = {'kernel_size': kernel_size, 'stride': stride, 'padding': padding, 'output_size': output_shape}
-        for i in range(numBlocks // 2 - 1):
-            layer = TransformerBlock(token_size, frame_hidden, flow_hidden, num_heads, t_groupSize, s_windowSize,
-                                     g_downSize, mlp_ratio, drop, n_vecs, t2t_params)
-            blocks.append(layer)
-        self.first_t_transformer = TemporalTransformer(token_size, frame_hidden, num_heads, t_groupSize, mlp_ratio,
-                                                       drop, n_vecs, t2t_params)
-        self.first_s_transformer = SpatialTransformer(token_size, frame_hidden, flow_hidden, num_heads, s_windowSize,
-                                                      g_downSize, mlp_ratio, drop, n_vecs, t2t_params)
-        self.transformer = nn.Sequential(*blocks)
-        # vector to patch operation
-        self.vec2patch = Vec2Patch(cnum * 2, frame_hidden, output_shape, kernel_size, stride, padding)
-        # decoder
-        self.decoder = Decoder(conv_type, cnum * 2, 3, use_bias, norm)
-
-        if init_weights:
-            self.init_weights()
-
-    def forward(self, masked_frames, flows, masks):
-        b, t, c, h, w = masked_frames.shape
-        cf = flows.shape[2]
-        output_shape = (h // 4, w // 4)
-        if self.passmask:
-            inputs = torch.cat((masked_frames, masks), dim=2)
-        else:
-            inputs = masked_frames
-        inputs = inputs.view(b * t, self.in_channels, h, w)
-        flows = flows.view(b * t, cf, h, w)
-        enc_feats = self.frame_endoder(inputs)
-        flow_feats = self.flow_encoder(flows)
-        trans_feat = self.patch2vec(enc_feats)
-        flow_patches = self.f_patch2vec(flow_feats)
-        _, c, h, w = trans_feat.shape
-        cf = flow_patches.shape[1]
-        if h != self.token_size[0] or w != self.token_size[1]:
-            new_h, new_w = h, w
-        else:
-            new_h, new_w = 0, 0
-            output_shape = (0, 0)
-        trans_feat = trans_feat.view(b * t, c, -1).permute(0, 2, 1)
-        flow_patches = flow_patches.view(b * t, cf, -1).permute(0, 2, 1)
-        trans_feat = self.first_t_transformer(trans_feat, t, new_h, new_w, output_shape)
-        trans_feat = self.add_pos_emb(trans_feat, new_h, new_w)
-        trans_feat = self.first_s_transformer(trans_feat, flow_patches, t, new_h, new_w, output_shape)
-        inputs_trans_feat = {'x': trans_feat, 'f': flow_patches, 't': t, 'h': new_h, 'w': new_w,
-                             'output_size': output_shape}
-        trans_feat = self.transformer(inputs_trans_feat)['x']
-        trans_feat = self.vec2patch(trans_feat, output_shape[0], output_shape[1])
-        enc_feats = enc_feats + trans_feat
-
-        output = self.decoder(enc_feats)
-        output = torch.tanh(output)
-        return output
-
diff --git a/spaces/oluyemitosin/YOLO/app.py b/spaces/oluyemitosin/YOLO/app.py
deleted file mode 100644
index 2dc4312f93c1d6660d43a4ed83edcbf9b0761c57..0000000000000000000000000000000000000000
--- a/spaces/oluyemitosin/YOLO/app.py
+++ /dev/null
@@ -1,25 +0,0 @@
-from ultralytics import YOLO 
-
-
-model = YOLO('yolov8x.pt')
-
-import gradio as gr
-from PIL import Image
-
-def fn(inputs):
-    res = model(inputs)
-    return Image.fromarray(res[0].plot())
-
-
-    
-    
-demo = gr.Interface(
-    fn=fn,
-    inputs=gr.Image(),
-    outputs=gr.Image(),
-    title='YOLO - You Look Once',
-    description = 'YOLO is an object-detection '
-    # article = 'This is the article.'
-)
-
-demo.launch()
\ No newline at end of file
diff --git a/spaces/openaccess-ai-collective/arena-archived/calculate_elo.py b/spaces/openaccess-ai-collective/arena-archived/calculate_elo.py
deleted file mode 100644
index 98f1a37d50b21ca46e0ff6023f2be460d4bf2a2d..0000000000000000000000000000000000000000
--- a/spaces/openaccess-ai-collective/arena-archived/calculate_elo.py
+++ /dev/null
@@ -1,307 +0,0 @@
-import logging
-import os
-from datetime import datetime
-from decimal import Decimal
-
-import boto3
-from boto3.dynamodb.conditions import Attr, Key
-from datasets import Dataset
-
-logging.basicConfig(level=os.getenv("LOG_LEVEL", "INFO"))
-
-# Create a DynamoDB client
-dynamodb = boto3.resource('dynamodb', region_name='us-east-1')
-
-
-def _create_arena_table():
-    table = dynamodb.create_table(
-        TableName='oaaic_chatbot_arena',
-        KeySchema=[
-            {
-                'AttributeName': 'arena_battle_id',
-                'KeyType': 'HASH'
-            },
-        ],
-        AttributeDefinitions=[
-            {
-                'AttributeName': 'arena_battle_id',
-                'AttributeType': 'S'
-            },
-            {
-                'AttributeName': 'timestamp',
-                'AttributeType': 'S'
-            },
-        ],
-        ProvisionedThroughput={
-            'ReadCapacityUnits': 5,
-            'WriteCapacityUnits': 5
-        },
-        GlobalSecondaryIndexes=[
-            {
-                'IndexName': 'TimestampIndex',
-                'KeySchema': [
-                    {
-                        'AttributeName': 'arena_battle_id',
-                        'KeyType': 'HASH'
-                    },
-                    {
-                        'AttributeName': 'timestamp',
-                        'KeyType': 'RANGE'
-                    },
-                ],
-                'Projection': {
-                    'ProjectionType': 'ALL',
-                },
-                'ProvisionedThroughput': {
-                    'ReadCapacityUnits': 5,
-                    'WriteCapacityUnits': 5,
-                }
-            },
-        ]
-    )
-
-def _create_elo_scores_table():
-    dynamodb.create_table(
-        TableName='elo_scores',
-        KeySchema=[
-            {
-                'AttributeName': 'chatbot_name',
-                'KeyType': 'HASH'  # Partition key
-            },
-        ],
-        AttributeDefinitions=[
-            {
-                'AttributeName': 'chatbot_name',
-                'AttributeType': 'S'
-            },
-        ],
-        ProvisionedThroughput={
-            'ReadCapacityUnits': 5,
-            'WriteCapacityUnits': 5
-        }
-    )
-
-
-def _create_elo_logs_table():
-    dynamodb.create_table(
-        TableName='elo_logs',
-        KeySchema=[
-            {
-                'AttributeName': 'arena_battle_id',
-                'KeyType': 'HASH'  # Partition key
-            },
-            {
-                'AttributeName': 'battle_timestamp',
-                'KeyType': 'RANGE'  # Sort key
-            },
-        ],
-        AttributeDefinitions=[
-            {
-                'AttributeName': 'arena_battle_id',
-                'AttributeType': 'S'
-            },
-            {
-                'AttributeName': 'battle_timestamp',
-                'AttributeType': 'S'
-            },
-            {
-                'AttributeName': 'all',
-                'AttributeType': 'S'
-            }
-        ],
-        ProvisionedThroughput={
-            'ReadCapacityUnits': 10,
-            'WriteCapacityUnits': 10
-        },
-        GlobalSecondaryIndexes=[
-            {
-                'IndexName': 'AllTimestampIndex',
-                'KeySchema': [
-                    {
-                        'AttributeName': 'all',
-                        'KeyType': 'HASH'  # Partition key for the GSI
-                    },
-                    {
-                        'AttributeName': 'battle_timestamp',
-                        'KeyType': 'RANGE'  # Sort key for the GSI
-                    }
-                ],
-                'Projection': {
-                    'ProjectionType': 'ALL'
-                },
-                'ProvisionedThroughput': {
-                    'ReadCapacityUnits': 10,
-                    'WriteCapacityUnits': 10
-                }
-            },
-        ]
-    )
-
-
-def get_unprocessed_battles(last_processed_timestamp):
-    # Use boto3 to create a DynamoDB resource and reference the table
-    table = dynamodb.Table('oaaic_chatbot_arena')
-
-    # Use a query to retrieve unprocessed battles in temporal order
-    response = table.scan(
-        FilterExpression=Attr('timestamp').gt(last_processed_timestamp),
-        # ScanIndexForward=True
-    )
-
-    return response['Items']
-
-
-def calculate_elo(rating1, rating2, result, K=32):
-    # Convert ratings to float
-    rating1 = float(rating1)
-    rating2 = float(rating2)
-
-    # Calculate the expected outcomes
-    expected_outcome1 = 1.0 / (1.0 + 10.0 ** ((rating2 - rating1) / 400.0))
-    expected_outcome2 = 1.0 - expected_outcome1
-
-    # Calculate the new Elo ratings
-    new_rating1 = rating1 + K * (result - expected_outcome1)
-    new_rating2 = rating2 + K * ((1.0 - result) - expected_outcome2)
-
-    return Decimal(new_rating1).quantize(Decimal('0.00')), Decimal(new_rating2).quantize(Decimal('0.00'))
-
-
-def get_last_processed_timestamp():
-    table = dynamodb.Table('elo_logs')
-
-    # Scan the table sorted by timestamp in descending order
-    response = table.query(
-        IndexName='AllTimestampIndex',
-        KeyConditionExpression=Key('all').eq('ALL'),
-        ScanIndexForward=False,
-        Limit=1
-    )
-
-    # If there are no items in the table, return a default timestamp
-    if not response['Items']:
-        return '1970-01-01T00:00:00'
-
-    # Otherwise, return the timestamp of the latest item
-    return response['Items'][0]['battle_timestamp']
-
-
-def log_elo_update(arena_battle_id, battle_timestamp, new_rating1, new_rating2):
-    # Reference the elo_logs table
-    table = dynamodb.Table('elo_logs')
-
-    # Update the table
-    table.put_item(
-        Item={
-            'arena_battle_id': arena_battle_id,
-            'battle_timestamp': battle_timestamp,  # Use the timestamp of the battle
-            'log_timestamp': datetime.now().isoformat(),  # Also store the timestamp of the log for completeness
-            'new_rating1': new_rating1,
-            'new_rating2': new_rating2,
-            'all': 'ALL',
-        }
-    )
-
-
-def get_elo_score(chatbot_name, elo_scores):
-    if chatbot_name in elo_scores:
-        return elo_scores[chatbot_name]
-
-    table = dynamodb.Table('elo_scores')
-    response = table.get_item(Key={'chatbot_name': chatbot_name})
-
-    # If there is no item in the table, return a default score
-    if 'Item' not in response:
-        return 1500
-
-    return response['Item']['elo_score']
-
-
-def update_elo_score(chatbot_name, new_elo_score):
-    table = dynamodb.Table('elo_scores')
-
-    # This will create a new item if it doesn't exist
-    table.put_item(
-        Item={
-            'chatbot_name': chatbot_name,
-            'elo_score': Decimal(str(new_elo_score)),
-        }
-    )
-
-
-def get_elo_scores():
-    table = dynamodb.Table('elo_scores')
-
-    response = table.scan()
-    data = response['Items']
-
-    return data
-
-
-def _backfill_logs():
-    table = dynamodb.Table('elo_logs')
-
-    # Initialize the scan operation
-    response = table.scan()
-
-    for item in response['Items']:
-        table.update_item(
-            Key={
-                'arena_battle_id': item['arena_battle_id'],
-                'battle_timestamp': item['battle_timestamp']
-            },
-            UpdateExpression="SET #all = :value",
-            ExpressionAttributeNames={
-                '#all': 'all'
-            },
-            ExpressionAttributeValues={
-                ':value': 'ALL'
-            }
-        )
-
-def main():
-    last_processed_timestamp = get_last_processed_timestamp()
-    battles = get_unprocessed_battles(last_processed_timestamp)
-
-    elo_scores = {}
-
-    for battle in battles:
-        if battle['label'] in {0, 1, 2}:
-            outcome = battle['label']
-            for chatbot_name in [battle['choice1_name'], battle['choice2_name']]:
-                if chatbot_name not in elo_scores:
-                    elo_scores[chatbot_name] = get_elo_score(chatbot_name, elo_scores)
-            # 1: This means that the first player (or team) won the match.
-            # 0.5: This means that the match ended in a draw.
-            # 0: This means that the first player (or team) lost the match.
-            if outcome == 0:
-                elo_result = 0.5
-            elif outcome == 1:
-                elo_result = 1
-            else:
-                elo_result = 0
-
-            new_rating1, new_rating2 = calculate_elo(elo_scores[battle['choice1_name']], elo_scores[battle['choice2_name']], elo_result)
-            logging.info(f"{battle['choice1_name']}: {elo_scores[battle['choice1_name']]} -> {new_rating1} | {battle['choice2_name']}: {elo_scores[battle['choice2_name']]} -> {new_rating2}")
-            elo_scores[battle['choice1_name']] = new_rating1
-            elo_scores[battle['choice2_name']] = new_rating2
-            log_elo_update(battle['arena_battle_id'], battle['timestamp'], new_rating1, new_rating2)
-            update_elo_score(battle['choice1_name'], new_rating1)
-            update_elo_score(battle['choice2_name'], new_rating2)
-            elo_scores[battle['choice1_name']] = new_rating1
-            elo_scores[battle['choice2_name']] = new_rating2
-
-    elo_scores = get_elo_scores()
-    for i, j in enumerate(elo_scores):
-        j["elo_score"] = float(j["elo_score"])
-        elo_scores[i] = j
-    print(elo_scores)
-
-    if battles:
-        # Convert the data into a format suitable for Hugging Face Dataset
-        elo_dataset = Dataset.from_list(elo_scores)
-        elo_dataset.push_to_hub("openaccess-ai-collective/chatbot-arena-elo-scores", private=False)
-
-
-if __name__ == "__main__":
-    main()
diff --git a/spaces/owaiskha9654/Custom_Yolov7/utils/aws/userdata.sh b/spaces/owaiskha9654/Custom_Yolov7/utils/aws/userdata.sh
deleted file mode 100644
index 5762ae575f5b64df9b438180840fce0a2bafec42..0000000000000000000000000000000000000000
--- a/spaces/owaiskha9654/Custom_Yolov7/utils/aws/userdata.sh
+++ /dev/null
@@ -1,27 +0,0 @@
-#!/bin/bash
-# AWS EC2 instance startup script https://docs.aws.amazon.com/AWSEC2/latest/UserGuide/user-data.html
-# This script will run only once on first instance start (for a re-start script see mime.sh)
-# /home/ubuntu (ubuntu) or /home/ec2-user (amazon-linux) is working dir
-# Use >300 GB SSD
-
-cd home/ubuntu
-if [ ! -d yolor ]; then
-  echo "Running first-time script." # install dependencies, download COCO, pull Docker
-  git clone -b paper https://github.com/WongKinYiu/yolor && sudo chmod -R 777 yolor
-  cd yolor
-  bash data/scripts/get_coco.sh && echo "Data done." &
-  sudo docker pull nvcr.io/nvidia/pytorch:21.08-py3 && echo "Docker done." &
-  python -m pip install --upgrade pip && pip install -r requirements.txt && python detect.py && echo "Requirements done." &
-  wait && echo "All tasks done." # finish background tasks
-else
-  echo "Running re-start script." # resume interrupted runs
-  i=0
-  list=$(sudo docker ps -qa) # container list i.e. $'one\ntwo\nthree\nfour'
-  while IFS= read -r id; do
-    ((i++))
-    echo "restarting container $i: $id"
-    sudo docker start $id
-    # sudo docker exec -it $id python train.py --resume # single-GPU
-    sudo docker exec -d $id python utils/aws/resume.py # multi-scenario
-  done <<<"$list"
-fi
diff --git a/spaces/pablodawson/ldm3d-inpainting/diffuserslocal/docs/source/en/training/create_dataset.md b/spaces/pablodawson/ldm3d-inpainting/diffuserslocal/docs/source/en/training/create_dataset.md
deleted file mode 100644
index 9c4f4de5390439ca09a2ee8965ad31a4cafa793b..0000000000000000000000000000000000000000
--- a/spaces/pablodawson/ldm3d-inpainting/diffuserslocal/docs/source/en/training/create_dataset.md
+++ /dev/null
@@ -1,90 +0,0 @@
-# Create a dataset for training
-
-There are many datasets on the [Hub](https://huggingface.co/datasets?task_categories=task_categories:text-to-image&sort=downloads) to train a model on, but if you can't find one you're interested in or want to use your own, you can create a dataset with the 🤗 [Datasets](hf.co/docs/datasets) library. The dataset structure depends on the task you want to train your model on. The most basic dataset structure is a directory of images for tasks like unconditional image generation. Another dataset structure may be a directory of images and a text file containing their corresponding text captions for tasks like text-to-image generation.
-
-This guide will show you two ways to create a dataset to finetune on:
-
-- provide a folder of images to the `--train_data_dir` argument
-- upload a dataset to the Hub and pass the dataset repository id to the `--dataset_name` argument
-
-<Tip>
-
-💡 Learn more about how to create an image dataset for training in the [Create an image dataset](https://huggingface.co/docs/datasets/image_dataset) guide. 
-
-</Tip>
-
-## Provide a dataset as a folder
-
-For unconditional generation, you can provide your own dataset as a folder of images. The training script uses the [`ImageFolder`](https://huggingface.co/docs/datasets/en/image_dataset#imagefolder) builder from 🤗 Datasets to automatically build a dataset from the folder. Your directory structure should look like:
-
-```bash
-data_dir/xxx.png
-data_dir/xxy.png
-data_dir/[...]/xxz.png
-```
-
-Pass the path to the dataset directory to the `--train_data_dir` argument, and then you can start training:
-
-```bash
-accelerate launch train_unconditional.py \
-    --train_data_dir <path-to-train-directory> \
-    <other-arguments>
-```
-
-## Upload your data to the Hub
-
-<Tip>
-
-💡 For more details and context about creating and uploading a dataset to the Hub, take a look at the [Image search with 🤗 Datasets](https://huggingface.co/blog/image-search-datasets) post.
-
-</Tip>
-
-Start by creating a dataset with the [`ImageFolder`](https://huggingface.co/docs/datasets/image_load#imagefolder) feature, which creates an `image` column containing the PIL-encoded images. 
-
-You can use the `data_dir` or `data_files` parameters to specify the location of the dataset. The `data_files` parameter supports mapping specific files to dataset splits like `train` or `test`:
-
-```python
-from datasets import load_dataset
-
-# example 1: local folder
-dataset = load_dataset("imagefolder", data_dir="path_to_your_folder")
-
-# example 2: local files (supported formats are tar, gzip, zip, xz, rar, zstd)
-dataset = load_dataset("imagefolder", data_files="path_to_zip_file")
-
-# example 3: remote files (supported formats are tar, gzip, zip, xz, rar, zstd)
-dataset = load_dataset(
-    "imagefolder",
-    data_files="https://download.microsoft.com/download/3/E/1/3E1C3F21-ECDB-4869-8368-6DEBA77B919F/kagglecatsanddogs_3367a.zip",
-)
-
-# example 4: providing several splits
-dataset = load_dataset(
-    "imagefolder", data_files={"train": ["path/to/file1", "path/to/file2"], "test": ["path/to/file3", "path/to/file4"]}
-)
-```
-
-Then use the [`~datasets.Dataset.push_to_hub`] method to upload the dataset to the Hub:
-
-```python
-# assuming you have ran the huggingface-cli login command in a terminal
-dataset.push_to_hub("name_of_your_dataset")
-
-# if you want to push to a private repo, simply pass private=True:
-dataset.push_to_hub("name_of_your_dataset", private=True)
-```
-
-Now the dataset is available for training by passing the dataset name to the `--dataset_name` argument:
-
-```bash
-accelerate launch --mixed_precision="fp16"  train_text_to_image.py \
-  --pretrained_model_name_or_path="runwayml/stable-diffusion-v1-5" \
-  --dataset_name="name_of_your_dataset" \
-  <other-arguments>
-```
-
-## Next steps
-
-Now that you've created a dataset, you can plug it into the `train_data_dir` (if your dataset is local) or `dataset_name` (if your dataset is on the Hub) arguments of a training script.
-
-For your next steps, feel free to try and use your dataset to train a model for [unconditional generation](uncondtional_training) or [text-to-image generation](text2image)!
\ No newline at end of file
diff --git a/spaces/pablodawson/ldm3d-inpainting/diffuserslocal/docs/source/ko/optimization/coreml.md b/spaces/pablodawson/ldm3d-inpainting/diffuserslocal/docs/source/ko/optimization/coreml.md
deleted file mode 100644
index 5ce81a20889bafb00228c7f6bc31f263c5cc4c1f..0000000000000000000000000000000000000000
--- a/spaces/pablodawson/ldm3d-inpainting/diffuserslocal/docs/source/ko/optimization/coreml.md
+++ /dev/null
@@ -1,168 +0,0 @@
-<!--Copyright 2023 The HuggingFace Team. All rights reserved.
-
-Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with
-the License. You may obtain a copy of the License at
-
-http://www.apache.org/licenses/LICENSE-2.0
-
-Unless required by applicable law or agreed to in writing, software distributed under the License is distributed on
-an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the License for the
-specific language governing permissions and limitations under the License.
--->
-
-# Core ML로 Stable Diffusion을 실행하는 방법
-
-[Core ML](https://developer.apple.com/documentation/coreml)은 Apple 프레임워크에서 지원하는 모델 형식 및 머신 러닝 라이브러리입니다. macOS 또는 iOS/iPadOS 앱 내에서 Stable Diffusion 모델을 실행하는 데 관심이 있는 경우, 이 가이드에서는 기존 PyTorch 체크포인트를 Core ML 형식으로 변환하고 이를 Python 또는 Swift로 추론에 사용하는 방법을 설명합니다.
-
-Core ML 모델은 Apple 기기에서 사용할 수 있는 모든 컴퓨팅 엔진들, 즉 CPU, GPU, Apple Neural Engine(또는 Apple Silicon Mac 및 최신 iPhone/iPad에서 사용할 수 있는 텐서 최적화 가속기인 ANE)을 활용할 수 있습니다. 모델과 실행 중인 기기에 따라 Core ML은 컴퓨팅 엔진도 혼합하여 사용할 수 있으므로, 예를 들어 모델의 일부가 CPU에서 실행되는 반면 다른 부분은 GPU에서 실행될 수 있습니다.
-
-<Tip>
-
-PyTorch에 내장된 `mps` 가속기를 사용하여 Apple Silicon Macs에서 `diffusers` Python 코드베이스를 실행할 수도 있습니다. 이 방법은 [mps 가이드]에 자세히 설명되어 있지만 네이티브 앱과 호환되지 않습니다.
-
-</Tip>
-
-## Stable Diffusion Core ML 체크포인트
-
-Stable Diffusion 가중치(또는 체크포인트)는 PyTorch 형식으로 저장되기 때문에 네이티브 앱에서 사용하기 위해서는 Core ML 형식으로 변환해야 합니다.
-
-다행히도 Apple 엔지니어들이 `diffusers`를 기반으로 한 [변환 툴](https://github.com/apple/ml-stable-diffusion#-converting-models-to-core-ml)을 개발하여 PyTorch 체크포인트를 Core ML로 변환할 수 있습니다.
-
-모델을 변환하기 전에 잠시 시간을 내어 Hugging Face Hub를 살펴보세요. 관심 있는 모델이 이미 Core ML 형식으로 제공되고 있을 가능성이 높습니다:
-
-- [Apple](https://huggingface.co/apple) organization에는 Stable Diffusion 버전 1.4, 1.5, 2.0 base 및 2.1 base가 포함되어 있습니다.
-- [coreml](https://huggingface.co/coreml) organization에는 커스텀 DreamBooth가 적용되거나, 파인튜닝된 모델이 포함되어 있습니다.
-- 이 [필터](https://huggingface.co/models?pipeline_tag=text-to-image&library=coreml&p=2&sort=likes)를 사용하여 사용 가능한 모든 Core ML 체크포인트들을 반환합니다.
-
-원하는 모델을 찾을 수 없는 경우 Apple의 [모델을 Core ML로 변환하기](https://github.com/apple/ml-stable-diffusion#-converting-models-to-core-ml) 지침을 따르는 것이 좋습니다.
-
-## 사용할 Core ML 변형(Variant) 선택하기
-
-Stable Diffusion 모델은 다양한 목적에 따라 다른 Core ML 변형으로 변환할 수 있습니다:
-
-- 사용되는 어텐션 블록 유형. 어텐션 연산은 이미지 표현의 여러 영역 간의 관계에 '주의를 기울이고' 이미지와 텍스트 표현이 어떻게 연관되어 있는지 이해하는 데 사용됩니다. 어텐션 연산은 컴퓨팅 및 메모리 집약적이므로 다양한 장치의 하드웨어 특성을 고려한 다양한 구현이 존재합니다. Core ML Stable Diffusion 모델의 경우 두 가지 주의 변형이 있습니다:
-    * `split_einsum` ([Apple에서 도입](https://machinelearning.apple.com/research/neural-engine-transformers)은 최신 iPhone, iPad 및 M 시리즈 컴퓨터에서 사용할 수 있는 ANE 장치에 최적화되어 있습니다.
-    * "원본" 어텐션(`diffusers`에 사용되는 기본 구현)는 CPU/GPU와만 호환되며 ANE와는 호환되지 않습니다. "원본" 어텐션을 사용하여 CPU + GPU에서 모델을 실행하는 것이 ANE보다 *더* 빠를 수 있습니다. 자세한 내용은 [이 성능 벤치마크](https://huggingface.co/blog/fast-mac-diffusers#performance-benchmarks)와 커뮤니티에서 제공하는 일부 [추가 측정](https://github.com/huggingface/swift-coreml-diffusers/issues/31)을 참조하십시오.
-
-- 지원되는 추론 프레임워크
-    * `packages`는 Python 추론에 적합합니다. 네이티브 앱에 통합하기 전에 변환된 Core ML 모델을 테스트하거나, Core ML 성능을 알고 싶지만 네이티브 앱을 지원할 필요는 없는 경우에 사용할 수 있습니다. 예를 들어, 웹 UI가 있는 애플리케이션은 Python Core ML 백엔드를 완벽하게 사용할 수 있습니다.
-    * Swift 코드에는 `컴파일된` 모델이 필요합니다. Hub의 `컴파일된` 모델은 iOS 및 iPadOS 기기와의 호환성을 위해 큰 UNet 모델 가중치를 여러 파일로 분할합니다. 이는 [`--chunk-unet` 변환 옵션](https://github.com/apple/ml-stable-diffusion#-converting-models-to-core-ml)에 해당합니다. 네이티브 앱을 지원하려면 `컴파일된` 변형을 선택해야 합니다.
-
-공식 Core ML Stable Diffusion [모델](https://huggingface.co/apple/coreml-stable-diffusion-v1-4/tree/main)에는 이러한 변형이 포함되어 있지만 커뮤니티 버전은 다를 수 있습니다:
-
-```
-coreml-stable-diffusion-v1-4
-├── README.md
-├── original
-│   ├── compiled
-│   └── packages
-└── split_einsum
-    ├── compiled
-    └── packages
-```
-
-아래와 같이 필요한 변형을 다운로드하여 사용할 수 있습니다.
-
-## Python에서 Core ML 추론
-
-Python에서 Core ML 추론을 실행하려면 다음 라이브러리를 설치하세요:
-
-```bash
-pip install huggingface_hub
-pip install git+https://github.com/apple/ml-stable-diffusion
-```
-
-### 모델 체크포인트 다운로드하기
-
-`컴파일된` 버전은 Swift와만 호환되므로 Python에서 추론을 실행하려면 `packages` 폴더에 저장된 버전 중 하나를 사용하세요. `원본` 또는 `split_einsum` 어텐션 중 어느 것을 사용할지 선택할 수 있습니다.
-
-다음은 Hub에서 'models'라는 디렉토리로 'original' 어텐션 변형을 다운로드하는 방법입니다:
-
-```Python
-from huggingface_hub import snapshot_download
-from pathlib import Path
-
-repo_id = "apple/coreml-stable-diffusion-v1-4"
-variant = "original/packages"
-
-model_path = Path("./models") / (repo_id.split("/")[-1] + "_" + variant.replace("/", "_"))
-snapshot_download(repo_id, allow_patterns=f"{variant}/*", local_dir=model_path, local_dir_use_symlinks=False)
-print(f"Model downloaded at {model_path}")
-```
-
-
-### 추론[[python-inference]]
-
-모델의 snapshot을 다운로드한 후에는 Apple의 Python 스크립트를 사용하여 테스트할 수 있습니다.
-
-```shell
-python -m python_coreml_stable_diffusion.pipeline --prompt "a photo of an astronaut riding a horse on mars" -i models/coreml-stable-diffusion-v1-4_original_packages -o </path/to/output/image> --compute-unit CPU_AND_GPU --seed 93
-```
-
-`<output-mlpackages-directory>`는 위 단계에서 다운로드한 체크포인트를 가리켜야 하며, `--compute-unit`은 추론을 허용할 하드웨어를 나타냅니다. 이는 다음 옵션 중 하나이어야 합니다: `ALL`, `CPU_AND_GPU`, `CPU_ONLY`, `CPU_AND_NE`. 선택적 출력 경로와 재현성을 위한 시드를 제공할 수도 있습니다.
-
-추론 스크립트에서는 Stable Diffusion 모델의 원래 버전인 `CompVis/stable-diffusion-v1-4`를 사용한다고 가정합니다. 다른 모델을 사용하는 경우 추론 명령줄에서 `--model-version` 옵션을 사용하여 해당 허브 ID를 *지정*해야 합니다. 이는 이미 지원되는 모델과 사용자가 직접 학습하거나 파인튜닝한 사용자 지정 모델에 적용됩니다.
-
-예를 들어, [`runwayml/stable-diffusion-v1-5`](https://huggingface.co/runwayml/stable-diffusion-v1-5)를 사용하려는 경우입니다:
-
-```shell
-python -m python_coreml_stable_diffusion.pipeline --prompt "a photo of an astronaut riding a horse on mars" --compute-unit ALL -o output --seed 93 -i models/coreml-stable-diffusion-v1-5_original_packages --model-version runwayml/stable-diffusion-v1-5
-```
-
-
-## Swift에서 Core ML 추론하기
-
-Swift에서 추론을 실행하는 것은 모델이 이미 `mlmodelc` 형식으로 컴파일되어 있기 때문에 Python보다 약간 빠릅니다. 이는 앱이 시작될 때 모델이 불러와지는 것이 눈에 띄지만, 이후 여러 번 실행하면 눈에 띄지 않을 것입니다.
-
-### 다운로드
-
-Mac에서 Swift에서 추론을 실행하려면 `컴파일된` 체크포인트 버전 중 하나가 필요합니다. 이전 예제와 유사하지만 `컴파일된` 변형 중 하나를 사용하여 Python 코드를 로컬로 다운로드하는 것이 좋습니다:
-
-```Python
-from huggingface_hub import snapshot_download
-from pathlib import Path
-
-repo_id = "apple/coreml-stable-diffusion-v1-4"
-variant = "original/compiled"
-
-model_path = Path("./models") / (repo_id.split("/")[-1] + "_" + variant.replace("/", "_"))
-snapshot_download(repo_id, allow_patterns=f"{variant}/*", local_dir=model_path, local_dir_use_symlinks=False)
-print(f"Model downloaded at {model_path}")
-```
-
-### 추론[[swift-inference]]
-
-추론을 실행하기 위해서, Apple의 리포지토리를 복제하세요:
-
-```bash
-git clone https://github.com/apple/ml-stable-diffusion
-cd ml-stable-diffusion
-```
-
-그 다음 Apple의 명령어 도구인 [Swift 패키지 관리자](https://www.swift.org/package-manager/#)를 사용합니다:
-
-```bash
-swift run StableDiffusionSample --resource-path models/coreml-stable-diffusion-v1-4_original_compiled --compute-units all "a photo of an astronaut riding a horse on mars"
-```
-
-`--resource-path`에 이전 단계에서 다운로드한 체크포인트 중 하나를 지정해야 하므로 확장자가 `.mlmodelc`인 컴파일된 Core ML 번들이 포함되어 있는지 확인하시기 바랍니다. `--compute-units`는 다음 값 중 하나이어야 합니다: `all`, `cpuOnly`, `cpuAndGPU`, `cpuAndNeuralEngine`.
-
-자세한 내용은 [Apple의 리포지토리 안의 지침](https://github.com/apple/ml-stable-diffusion)을 참고하시기 바랍니다.
-
-
-## 지원되는 Diffusers 기능
-
-Core ML 모델과 추론 코드는 🧨 Diffusers의 많은 기능, 옵션 및 유연성을 지원하지 않습니다. 다음은 유의해야 할 몇 가지 제한 사항입니다:
-
-- Core ML 모델은 추론에만 적합합니다. 학습이나 파인튜닝에는 사용할 수 없습니다.
-- Swift에 포팅된 스케줄러는 Stable Diffusion에서 사용하는 기본 스케줄러와 `diffusers` 구현에서 Swift로 포팅한 `DPMSolverMultistepScheduler` 두 개뿐입니다. 이들 중 약 절반의 스텝으로 동일한 품질을 생성하는 `DPMSolverMultistepScheduler`를 사용하는 것이 좋습니다.
-- 추론 코드에서 네거티브 프롬프트, classifier-free guidance scale 및 image-to-image 작업을 사용할 수 있습니다. depth guidance, ControlNet, latent upscalers와 같은 고급 기능은 아직 사용할 수 없습니다.
-
-Apple의 [변환 및 추론 리포지토리](https://github.com/apple/ml-stable-diffusion)와 자체 [swift-coreml-diffusers](https://github.com/huggingface/swift-coreml-diffusers) 리포지토리는 다른 개발자들이 구축할 수 있는 기술적인 데모입니다. 
-
-누락된 기능이 있다고 생각되면 언제든지 기능을 요청하거나, 더 좋은 방법은 기여 PR을 열어주세요. :)
-
-
-## 네이티브 Diffusers Swift 앱
-
-자체 Apple 하드웨어에서 Stable Diffusion을 실행하는 쉬운 방법 중 하나는 `diffusers`와 Apple의 변환 및 추론 리포지토리를 기반으로 하는 [자체 오픈 소스 Swift 리포지토리](https://github.com/huggingface/swift-coreml-diffusers)를 사용하는 것입니다. 코드를 공부하고 [Xcode](https://developer.apple.com/xcode/)로 컴파일하여 필요에 맞게 조정할 수 있습니다. 편의를 위해 앱스토어에 [독립형 Mac 앱](https://apps.apple.com/app/diffusers/id1666309574)도 있으므로 코드나 IDE를 다루지 않고도 사용할 수 있습니다. 개발자로서 Core ML이 Stable Diffusion 앱을 구축하는 데 가장 적합한 솔루션이라고 판단했다면, 이 가이드의 나머지 부분을 사용하여 프로젝트를 시작할 수 있습니다. 여러분이 무엇을 빌드할지 기대됩니다. :)
\ No newline at end of file
diff --git a/spaces/pablodawson/ldm3d-inpainting/diffuserslocal/scripts/conversion_ldm_uncond.py b/spaces/pablodawson/ldm3d-inpainting/diffuserslocal/scripts/conversion_ldm_uncond.py
deleted file mode 100644
index d2ebb3934b6696fd427c9bf09eb051cf7befe7f4..0000000000000000000000000000000000000000
--- a/spaces/pablodawson/ldm3d-inpainting/diffuserslocal/scripts/conversion_ldm_uncond.py
+++ /dev/null
@@ -1,56 +0,0 @@
-import argparse
-
-import OmegaConf
-import torch
-
-from diffusers import DDIMScheduler, LDMPipeline, UNetLDMModel, VQModel
-
-
-def convert_ldm_original(checkpoint_path, config_path, output_path):
-    config = OmegaConf.load(config_path)
-    state_dict = torch.load(checkpoint_path, map_location="cpu")["model"]
-    keys = list(state_dict.keys())
-
-    # extract state_dict for VQVAE
-    first_stage_dict = {}
-    first_stage_key = "first_stage_model."
-    for key in keys:
-        if key.startswith(first_stage_key):
-            first_stage_dict[key.replace(first_stage_key, "")] = state_dict[key]
-
-    # extract state_dict for UNetLDM
-    unet_state_dict = {}
-    unet_key = "model.diffusion_model."
-    for key in keys:
-        if key.startswith(unet_key):
-            unet_state_dict[key.replace(unet_key, "")] = state_dict[key]
-
-    vqvae_init_args = config.model.params.first_stage_config.params
-    unet_init_args = config.model.params.unet_config.params
-
-    vqvae = VQModel(**vqvae_init_args).eval()
-    vqvae.load_state_dict(first_stage_dict)
-
-    unet = UNetLDMModel(**unet_init_args).eval()
-    unet.load_state_dict(unet_state_dict)
-
-    noise_scheduler = DDIMScheduler(
-        timesteps=config.model.params.timesteps,
-        beta_schedule="scaled_linear",
-        beta_start=config.model.params.linear_start,
-        beta_end=config.model.params.linear_end,
-        clip_sample=False,
-    )
-
-    pipeline = LDMPipeline(vqvae, unet, noise_scheduler)
-    pipeline.save_pretrained(output_path)
-
-
-if __name__ == "__main__":
-    parser = argparse.ArgumentParser()
-    parser.add_argument("--checkpoint_path", type=str, required=True)
-    parser.add_argument("--config_path", type=str, required=True)
-    parser.add_argument("--output_path", type=str, required=True)
-    args = parser.parse_args()
-
-    convert_ldm_original(args.checkpoint_path, args.config_path, args.output_path)
diff --git a/spaces/pappymu/question-gen/README.md b/spaces/pappymu/question-gen/README.md
deleted file mode 100644
index 187ed82b309ae9be2f2edcf6bc20224fe0883adc..0000000000000000000000000000000000000000
--- a/spaces/pappymu/question-gen/README.md
+++ /dev/null
@@ -1,13 +0,0 @@
----
-title: Question Gen
-emoji: 😻
-colorFrom: green
-colorTo: green
-sdk: streamlit
-sdk_version: 1.10.0
-app_file: app.py
-pinned: false
-license: gpl-3.0
----
-
-Check out the configuration reference at https://huggingface.co/docs/hub/spaces-config-reference
diff --git a/spaces/penguin2023/vncs/Dockerfile b/spaces/penguin2023/vncs/Dockerfile
deleted file mode 100644
index 3bfa4298f40a22887c40335cd392a7b729849ca9..0000000000000000000000000000000000000000
--- a/spaces/penguin2023/vncs/Dockerfile
+++ /dev/null
@@ -1,36 +0,0 @@
-FROM christian773/xfce-vnc
-WORKDIR /content
-USER root
-RUN apt-get install chromium-browser sudo -y
-RUN sudo apt-get install filezilla -y
-
-# User
-RUN adduser --disabled-password --gecos '' admin
-RUN adduser admin sudo
-RUN echo '%sudo ALL=(ALL) NOPASSWD:ALL' >> /etc/sudoers
-
-RUN sudo apt-get install qbittorrent -y
-RUN sudo apt-get install vlc -y
-
-RUN apt-get update -y && apt-get upgrade -y && apt-get install -y sudo && apt-get install -y python3-pip && pip3 install --upgrade pip
-RUN apt-get install -y curl gnupg wget htop sudo git git-lfs software-properties-common build-essential libgl1 zip unzip
-RUN sudo chmod a+w /bin && sudo chmod -R a+rwx /root && sudo chmod a+rwx /var/lib/dpkg/lock-frontend && sudo chmod a+rwx /var/lib/dpkg && \
-    sudo chmod a+rwx /var/lib/dpkg/lock
-RUN sudo chmod -R 777 /headless/ && sudo chmod -R 777 /var/lib/dpkg && sudo chmod -R 777 /content/
-RUN sudo chmod -R 777 /var/cache/apt && sudo chmod -R 777 /var/lib/apt/lists/lock && sudo chmod -R 777 /var/lib/apt/lists/
-RUN sudo find /var -type d -exec chmod 777 {} \;
-RUN sudo find /var -type f -exec chmod 777 {} \;
-RUN sudo find /headless -type d -exec chmod 777 {} \;
-RUN sudo find /headless -type f -exec chmod 777 {} \;
-
-RUN wget https://downloads.mongodb.com/compass/mongodb-compass_1.40.2_amd64.deb
-RUN sudo apt install ./mongodb-compass_*_amd64.deb -y
-
-#install  jsql-injection
-RUN sudo apt install default-jdk -y
-RUN sudo apt install default-jre -y
-
-RUN sudo apt-get install sqlmap -y
-
-EXPOSE 6901
-ENTRYPOINT ["/dockerstartup/desktop_startup.sh"]
diff --git a/spaces/perilli/tortoise-tts-v2/api.py b/spaces/perilli/tortoise-tts-v2/api.py
deleted file mode 100644
index 6aa94cf693effabbd192db1e6f6fd3e2dc546702..0000000000000000000000000000000000000000
--- a/spaces/perilli/tortoise-tts-v2/api.py
+++ /dev/null
@@ -1,373 +0,0 @@
-import argparse
-import os
-import random
-from urllib import request
-
-import torch
-import torch.nn.functional as F
-import progressbar
-import torchaudio
-
-from models.classifier import AudioMiniEncoderWithClassifierHead
-from models.cvvp import CVVP
-from models.diffusion_decoder import DiffusionTts
-from models.autoregressive import UnifiedVoice
-from tqdm import tqdm
-
-from models.arch_util import TorchMelSpectrogram
-from models.clvp import CLVP
-from models.vocoder import UnivNetGenerator
-from utils.audio import load_audio, wav_to_univnet_mel, denormalize_tacotron_mel
-from utils.diffusion import SpacedDiffusion, space_timesteps, get_named_beta_schedule
-from utils.tokenizer import VoiceBpeTokenizer, lev_distance
-
-
-pbar = None
-
-
-def download_models(specific_models=None):
-    """
-    Call to download all the models that Tortoise uses.
-    """
-    MODELS = {
-        'autoregressive.pth': 'https://huggingface.co/jbetker/tortoise-tts-v2/resolve/hf/.models/autoregressive.pth',
-        'classifier.pth': 'https://huggingface.co/jbetker/tortoise-tts-v2/resolve/hf/.models/classifier.pth',
-        'clvp.pth': 'https://huggingface.co/jbetker/tortoise-tts-v2/resolve/hf/.models/clvp.pth',
-        'cvvp.pth': 'https://huggingface.co/jbetker/tortoise-tts-v2/resolve/hf/.models/cvvp.pth',
-        'diffusion_decoder.pth': 'https://huggingface.co/jbetker/tortoise-tts-v2/resolve/hf/.models/diffusion_decoder.pth',
-        'vocoder.pth': 'https://huggingface.co/jbetker/tortoise-tts-v2/resolve/hf/.models/vocoder.pth',
-    }
-    os.makedirs('.models', exist_ok=True)
-    def show_progress(block_num, block_size, total_size):
-        global pbar
-        if pbar is None:
-            pbar = progressbar.ProgressBar(maxval=total_size)
-            pbar.start()
-
-        downloaded = block_num * block_size
-        if downloaded < total_size:
-            pbar.update(downloaded)
-        else:
-            pbar.finish()
-            pbar = None
-    for model_name, url in MODELS.items():
-        if specific_models is not None and model_name not in specific_models:
-            continue
-        if os.path.exists(f'.models/{model_name}'):
-            continue
-        print(f'Downloading {model_name} from {url}...')
-        request.urlretrieve(url, f'.models/{model_name}', show_progress)
-        print('Done.')
-
-
-def pad_or_truncate(t, length):
-    """
-    Utility function for forcing <t> to have the specified sequence length, whether by clipping it or padding it with 0s.
-    """
-    if t.shape[-1] == length:
-        return t
-    elif t.shape[-1] < length:
-        return F.pad(t, (0, length-t.shape[-1]))
-    else:
-        return t[..., :length]
-
-
-def load_discrete_vocoder_diffuser(trained_diffusion_steps=4000, desired_diffusion_steps=200, cond_free=True, cond_free_k=1):
-    """
-    Helper function to load a GaussianDiffusion instance configured for use as a vocoder.
-    """
-    return SpacedDiffusion(use_timesteps=space_timesteps(trained_diffusion_steps, [desired_diffusion_steps]), model_mean_type='epsilon',
-                           model_var_type='learned_range', loss_type='mse', betas=get_named_beta_schedule('linear', trained_diffusion_steps),
-                           conditioning_free=cond_free, conditioning_free_k=cond_free_k)
-
-
-def format_conditioning(clip, cond_length=132300):
-    """
-    Converts the given conditioning signal to a MEL spectrogram and clips it as expected by the models.
-    """
-    gap = clip.shape[-1] - cond_length
-    if gap < 0:
-        clip = F.pad(clip, pad=(0, abs(gap)))
-    elif gap > 0:
-        rand_start = random.randint(0, gap)
-        clip = clip[:, rand_start:rand_start + cond_length]
-    mel_clip = TorchMelSpectrogram()(clip.unsqueeze(0)).squeeze(0)
-    return mel_clip.unsqueeze(0).cuda()
-
-
-def fix_autoregressive_output(codes, stop_token, complain=True):
-    """
-    This function performs some padding on coded audio that fixes a mismatch issue between what the diffusion model was
-    trained on and what the autoregressive code generator creates (which has no padding or end).
-    This is highly specific to the DVAE being used, so this particular coding will not necessarily work if used with
-    a different DVAE. This can be inferred by feeding a audio clip padded with lots of zeros on the end through the DVAE
-    and copying out the last few codes.
-
-    Failing to do this padding will produce speech with a harsh end that sounds like "BLAH" or similar.
-    """
-    # Strip off the autoregressive stop token and add padding.
-    stop_token_indices = (codes == stop_token).nonzero()
-    if len(stop_token_indices) == 0:
-        if complain:
-            print("No stop tokens found, enjoy that output of yours!")
-        return codes
-    else:
-        codes[stop_token_indices] = 83
-    stm = stop_token_indices.min().item()
-    codes[stm:] = 83
-    if stm - 3 < codes.shape[0]:
-        codes[-3] = 45
-        codes[-2] = 45
-        codes[-1] = 248
-
-    return codes
-
-
-def do_spectrogram_diffusion(diffusion_model, diffuser, latents, conditioning_samples, temperature=1, verbose=True):
-    """
-    Uses the specified diffusion model to convert discrete codes into a spectrogram.
-    """
-    with torch.no_grad():
-        cond_mels = []
-        for sample in conditioning_samples:
-            # The diffuser operates at a sample rate of 24000 (except for the latent inputs)
-            sample = torchaudio.functional.resample(sample, 22050, 24000)
-            sample = pad_or_truncate(sample, 102400)
-            cond_mel = wav_to_univnet_mel(sample.to(latents.device), do_normalization=False)
-            cond_mels.append(cond_mel)
-        cond_mels = torch.stack(cond_mels, dim=1)
-
-        output_seq_len = latents.shape[1] * 4 * 24000 // 22050  # This diffusion model converts from 22kHz spectrogram codes to a 24kHz spectrogram signal.
-        output_shape = (latents.shape[0], 100, output_seq_len)
-        precomputed_embeddings = diffusion_model.timestep_independent(latents, cond_mels, output_seq_len, False)
-
-        noise = torch.randn(output_shape, device=latents.device) * temperature
-        mel = diffuser.p_sample_loop(diffusion_model, output_shape, noise=noise,
-                                      model_kwargs={'precomputed_aligned_embeddings': precomputed_embeddings},
-                                     progress=verbose)
-        return denormalize_tacotron_mel(mel)[:,:,:output_seq_len]
-
-
-def classify_audio_clip(clip):
-    """
-    Returns whether or not Tortoises' classifier thinks the given clip came from Tortoise.
-    :param clip: torch tensor containing audio waveform data (get it from load_audio)
-    :return: True if the clip was classified as coming from Tortoise and false if it was classified as real.
-    """
-    download_models(['classifier.pth'])
-    classifier = AudioMiniEncoderWithClassifierHead(2, spec_dim=1, embedding_dim=512, depth=5, downsample_factor=4,
-                                                    resnet_blocks=2, attn_blocks=4, num_attn_heads=4, base_channels=32,
-                                                    dropout=0, kernel_size=5, distribute_zero_label=False)
-    classifier.load_state_dict(torch.load('.models/classifier.pth', map_location=torch.device('cpu')))
-    clip = clip.cpu().unsqueeze(0)
-    results = F.softmax(classifier(clip), dim=-1)
-    return results[0][0]
-
-
-class TextToSpeech:
-    """
-    Main entry point into Tortoise.
-    :param autoregressive_batch_size: Specifies how many samples to generate per batch. Lower this if you are seeing
-                                      GPU OOM errors. Larger numbers generates slightly faster.
-    """
-    def __init__(self, autoregressive_batch_size=16):
-        self.autoregressive_batch_size = autoregressive_batch_size
-        self.tokenizer = VoiceBpeTokenizer()
-        download_models()
-
-        self.autoregressive = UnifiedVoice(max_mel_tokens=604, max_text_tokens=402, max_conditioning_inputs=2, layers=30,
-                                      model_dim=1024,
-                                      heads=16, number_text_tokens=255, start_text_token=255, checkpointing=False,
-                                      train_solo_embeddings=False,
-                                      average_conditioning_embeddings=True).cpu().eval()
-        self.autoregressive.load_state_dict(torch.load('.models/autoregressive.pth'))
-
-        self.clvp = CLVP(dim_text=512, dim_speech=512, dim_latent=512, num_text_tokens=256, text_enc_depth=12,
-                         text_seq_len=350, text_heads=8,
-                         num_speech_tokens=8192, speech_enc_depth=12, speech_heads=8, speech_seq_len=430,
-                         use_xformers=True).cpu().eval()
-        self.clvp.load_state_dict(torch.load('.models/clvp.pth'))
-
-        self.cvvp = CVVP(model_dim=512, transformer_heads=8, dropout=0, mel_codes=8192, conditioning_enc_depth=8, cond_mask_percentage=0,
-                         speech_enc_depth=8, speech_mask_percentage=0, latent_multiplier=1).cpu().eval()
-        self.cvvp.load_state_dict(torch.load('.models/cvvp.pth'))
-
-        self.diffusion = DiffusionTts(model_channels=1024, num_layers=10, in_channels=100, out_channels=200,
-                                      in_latent_channels=1024, in_tokens=8193, dropout=0, use_fp16=False, num_heads=16,
-                                      layer_drop=0, unconditioned_percentage=0).cpu().eval()
-        self.diffusion.load_state_dict(torch.load('.models/diffusion_decoder.pth'))
-
-        self.vocoder = UnivNetGenerator().cpu()
-        self.vocoder.load_state_dict(torch.load('.models/vocoder.pth')['model_g'])
-        self.vocoder.eval(inference=True)
-
-    def tts_with_preset(self, text, voice_samples, preset='fast', **kwargs):
-        """
-        Calls TTS with one of a set of preset generation parameters. Options:
-            'ultra_fast': Produces speech at a speed which belies the name of this repo. (Not really, but it's definitely fastest).
-            'fast': Decent quality speech at a decent inference rate. A good choice for mass inference.
-            'standard': Very good quality. This is generally about as good as you are going to get.
-            'high_quality': Use if you want the absolute best. This is not really worth the compute, though.
-        """
-        # Use generally found best tuning knobs for generation.
-        kwargs.update({'temperature': .8, 'length_penalty': 1.0, 'repetition_penalty': 2.0,
-                       #'typical_sampling': True,
-                       'top_p': .8,
-                       'cond_free_k': 2.0, 'diffusion_temperature': 1.0})
-        # Presets are defined here.
-        presets = {
-            'ultra_fast': {'num_autoregressive_samples': 32, 'diffusion_iterations': 16, 'cond_free': False},
-            'fast': {'num_autoregressive_samples': 96, 'diffusion_iterations': 32},
-            'standard': {'num_autoregressive_samples': 256, 'diffusion_iterations': 128},
-            'high_quality': {'num_autoregressive_samples': 512, 'diffusion_iterations': 1024},
-        }
-        kwargs.update(presets[preset])
-        return self.tts(text, voice_samples, **kwargs)
-
-    def tts(self, text, voice_samples, k=1, verbose=True,
-            # autoregressive generation parameters follow
-            num_autoregressive_samples=512, temperature=.8, length_penalty=1, repetition_penalty=2.0, top_p=.8, max_mel_tokens=500,
-            typical_sampling=False, typical_mass=.9,
-            # CLVP & CVVP parameters
-            clvp_cvvp_slider=.5,
-            # diffusion generation parameters follow
-            diffusion_iterations=100, cond_free=True, cond_free_k=2, diffusion_temperature=1.0,
-            **hf_generate_kwargs):
-        """
-        Produces an audio clip of the given text being spoken with the given reference voice.
-        :param text: Text to be spoken.
-        :param voice_samples: List of 2 or more ~10 second reference clips which should be torch tensors containing 22.05kHz waveform data.
-        :param k: The number of returned clips. The most likely (as determined by Tortoises' CLVP and CVVP models) clips are returned.
-        :param verbose: Whether or not to print log messages indicating the progress of creating a clip. Default=true.
-        ~~AUTOREGRESSIVE KNOBS~~
-        :param num_autoregressive_samples: Number of samples taken from the autoregressive model, all of which are filtered using CLVP+CVVP.
-               As Tortoise is a probabilistic model, more samples means a higher probability of creating something "great".
-        :param temperature: The softmax temperature of the autoregressive model.
-        :param length_penalty: A length penalty applied to the autoregressive decoder. Higher settings causes the model to produce more terse outputs.
-        :param repetition_penalty: A penalty that prevents the autoregressive decoder from repeating itself during decoding. Can be used to reduce the incidence
-                                   of long silences or "uhhhhhhs", etc.
-        :param top_p: P value used in nucleus sampling. (0,1]. Lower values mean the decoder produces more "likely" (aka boring) outputs.
-        :param max_mel_tokens: Restricts the output length. (0,600] integer. Each unit is 1/20 of a second.
-        :param typical_sampling: Turns typical sampling on or off. This sampling mode is discussed in this paper: https://arxiv.org/abs/2202.00666
-                                 I was interested in the premise, but the results were not as good as I was hoping. This is off by default, but
-                                 could use some tuning.
-        :param typical_mass: The typical_mass parameter from the typical_sampling algorithm.
-        ~~CLVP-CVVP KNOBS~~
-        :param clvp_cvvp_slider: Controls the influence of the CLVP and CVVP models in selecting the best output from the autoregressive model.
-                                [0,1]. Values closer to 1 will cause Tortoise to emit clips that follow the text more. Values closer to
-                                0 will cause Tortoise to emit clips that more closely follow the reference clip (e.g. the voice sounds more
-                                similar).
-        ~~DIFFUSION KNOBS~~
-        :param diffusion_iterations: Number of diffusion steps to perform. [0,4000]. More steps means the network has more chances to iteratively refine
-                                     the output, which should theoretically mean a higher quality output. Generally a value above 250 is not noticeably better,
-                                     however.
-        :param cond_free: Whether or not to perform conditioning-free diffusion. Conditioning-free diffusion performs two forward passes for
-                          each diffusion step: one with the outputs of the autoregressive model and one with no conditioning priors. The output
-                          of the two is blended according to the cond_free_k value below. Conditioning-free diffusion is the real deal, and
-                          dramatically improves realism.
-        :param cond_free_k: Knob that determines how to balance the conditioning free signal with the conditioning-present signal. [0,inf].
-                            As cond_free_k increases, the output becomes dominated by the conditioning-free signal.
-                            Formula is: output=cond_present_output*(cond_free_k+1)-cond_absenct_output*cond_free_k
-        :param diffusion_temperature: Controls the variance of the noise fed into the diffusion model. [0,1]. Values at 0
-                                      are the "mean" prediction of the diffusion network and will sound bland and smeared.
-        ~~OTHER STUFF~~
-        :param hf_generate_kwargs: The huggingface Transformers generate API is used for the autoregressive transformer.
-                                   Extra keyword args fed to this function get forwarded directly to that API. Documentation
-                                   here: https://huggingface.co/docs/transformers/internal/generation_utils
-        :return: Generated audio clip(s) as a torch tensor. Shape 1,S if k=1 else, (k,1,S) where S is the sample length.
-                 Sample rate is 24kHz.
-        """
-        text = torch.IntTensor(self.tokenizer.encode(text)).unsqueeze(0).cuda()
-        text = F.pad(text, (0, 1))  # This may not be necessary.
-
-        conds = []
-        if not isinstance(voice_samples, list):
-            voice_samples = [voice_samples]
-        for vs in voice_samples:
-            conds.append(format_conditioning(vs))
-        conds = torch.stack(conds, dim=1)
-
-        diffuser = load_discrete_vocoder_diffuser(desired_diffusion_steps=diffusion_iterations, cond_free=cond_free, cond_free_k=cond_free_k)
-
-        with torch.no_grad():
-            samples = []
-            num_batches = num_autoregressive_samples // self.autoregressive_batch_size
-            stop_mel_token = self.autoregressive.stop_mel_token
-            calm_token = 83  # This is the token for coding silence, which is fixed in place with "fix_autoregressive_output"
-            self.autoregressive = self.autoregressive.cuda()
-            if verbose:
-                print("Generating autoregressive samples..")
-            for b in tqdm(range(num_batches), disable=not verbose):
-                codes = self.autoregressive.inference_speech(conds, text,
-                                                             do_sample=True,
-                                                             top_p=top_p,
-                                                             temperature=temperature,
-                                                             num_return_sequences=self.autoregressive_batch_size,
-                                                             length_penalty=length_penalty,
-                                                             repetition_penalty=repetition_penalty,
-                                                             max_generate_length=max_mel_tokens,
-                                                             **hf_generate_kwargs)
-                padding_needed = max_mel_tokens - codes.shape[1]
-                codes = F.pad(codes, (0, padding_needed), value=stop_mel_token)
-                samples.append(codes)
-            self.autoregressive = self.autoregressive.cpu()
-
-            clip_results = []
-            self.clvp = self.clvp.cuda()
-            self.cvvp = self.cvvp.cuda()
-            if verbose:
-                print("Computing best candidates using CLVP and CVVP")
-            for batch in tqdm(samples, disable=not verbose):
-                for i in range(batch.shape[0]):
-                    batch[i] = fix_autoregressive_output(batch[i], stop_mel_token)
-                clvp = self.clvp(text.repeat(batch.shape[0], 1), batch, return_loss=False)
-                cvvp_accumulator = 0
-                for cl in range(conds.shape[1]):
-                    cvvp_accumulator = cvvp_accumulator + self.cvvp(conds[:, cl].repeat(batch.shape[0], 1, 1), batch, return_loss=False )
-                cvvp = cvvp_accumulator / conds.shape[1]
-                clip_results.append(clvp * clvp_cvvp_slider + cvvp * (1-clvp_cvvp_slider))
-            clip_results = torch.cat(clip_results, dim=0)
-            samples = torch.cat(samples, dim=0)
-            best_results = samples[torch.topk(clip_results, k=k).indices]
-            self.clvp = self.clvp.cpu()
-            self.cvvp = self.cvvp.cpu()
-            del samples
-
-            # The diffusion model actually wants the last hidden layer from the autoregressive model as conditioning
-            # inputs. Re-produce those for the top results. This could be made more efficient by storing all of these
-            # results, but will increase memory usage.
-            self.autoregressive = self.autoregressive.cuda()
-            best_latents = self.autoregressive(conds, text, torch.tensor([text.shape[-1]], device=conds.device), best_results,
-                                               torch.tensor([best_results.shape[-1]*self.autoregressive.mel_length_compression], device=conds.device),
-                                               return_latent=True, clip_inputs=False)
-            self.autoregressive = self.autoregressive.cpu()
-
-            if verbose:
-                print("Transforming autoregressive outputs into audio..")
-            wav_candidates = []
-            self.diffusion = self.diffusion.cuda()
-            self.vocoder = self.vocoder.cuda()
-            for b in range(best_results.shape[0]):
-                codes = best_results[b].unsqueeze(0)
-                latents = best_latents[b].unsqueeze(0)
-
-                # Find the first occurrence of the "calm" token and trim the codes to that.
-                ctokens = 0
-                for k in range(codes.shape[-1]):
-                    if codes[0, k] == calm_token:
-                        ctokens += 1
-                    else:
-                        ctokens = 0
-                    if ctokens > 8:  # 8 tokens gives the diffusion model some "breathing room" to terminate speech.
-                        latents = latents[:, :k]
-                        break
-
-                mel = do_spectrogram_diffusion(self.diffusion, diffuser, latents, voice_samples, temperature=diffusion_temperature, verbose=verbose)
-                wav = self.vocoder.inference(mel)
-                wav_candidates.append(wav.cpu())
-            self.diffusion = self.diffusion.cpu()
-            self.vocoder = self.vocoder.cpu()
-
-            if len(wav_candidates) > 1:
-                return wav_candidates
-            return wav_candidates[0]
diff --git a/spaces/pinkq/Newbing/src/lib/bots/bing/index.ts b/spaces/pinkq/Newbing/src/lib/bots/bing/index.ts
deleted file mode 100644
index 2c4afae01a345b8415935228566cb30d695e768d..0000000000000000000000000000000000000000
--- a/spaces/pinkq/Newbing/src/lib/bots/bing/index.ts
+++ /dev/null
@@ -1,421 +0,0 @@
-import { fetch, WebSocket, debug } from '@/lib/isomorphic'
-import WebSocketAsPromised from 'websocket-as-promised'
-import {
-  SendMessageParams,
-  BingConversationStyle,
-  ConversationResponse,
-  ChatResponseMessage,
-  ConversationInfo,
-  InvocationEventType,
-  ChatError,
-  ErrorCode,
-  ChatUpdateCompleteResponse,
-  ImageInfo,
-  KBlobResponse
-} from './types'
-
-import { convertMessageToMarkdown, websocketUtils, streamAsyncIterable } from './utils'
-import { WatchDog, createChunkDecoder } from '@/lib/utils'
-
-type Params = SendMessageParams<{ bingConversationStyle: BingConversationStyle }>
-
-const OPTIONS_SETS = [
-  'nlu_direct_response_filter',
-  'deepleo',
-  'disable_emoji_spoken_text',
-  'responsible_ai_policy_235',
-  'enablemm',
-  'iycapbing',
-  'iyxapbing',
-  'objopinion',
-  'rweasgv2',
-  'dagslnv1',
-  'dv3sugg',
-  'autosave',
-  'iyoloxap',
-  'iyoloneutral',
-  'clgalileo',
-  'gencontentv3',
-]
-
-export class BingWebBot {
-  protected conversationContext?: ConversationInfo
-  protected cookie: string
-  protected ua: string
-  protected endpoint = ''
-  private lastText = ''
-  private asyncTasks: Array<Promise<any>> = []
-
-  constructor(opts: {
-    cookie: string
-    ua: string
-    bingConversationStyle?: BingConversationStyle
-    conversationContext?: ConversationInfo
-  }) {
-    const { cookie, ua, conversationContext } = opts
-    this.cookie = cookie?.includes(';') ? cookie : `_EDGE_V=1; _U=${cookie}`
-    this.ua = ua
-    this.conversationContext = conversationContext
-  }
-
-  static buildChatRequest(conversation: ConversationInfo) {
-    const optionsSets = OPTIONS_SETS
-    if (conversation.conversationStyle === BingConversationStyle.Precise) {
-      optionsSets.push('h3precise')
-    } else if (conversation.conversationStyle === BingConversationStyle.Creative) {
-      optionsSets.push('h3imaginative')
-    }
-    return {
-      arguments: [
-        {
-          source: 'cib',
-          optionsSets,
-          allowedMessageTypes: [
-            'Chat',
-            'InternalSearchQuery',
-            'Disengaged',
-            'InternalLoaderMessage',
-            'SemanticSerp',
-            'GenerateContentQuery',
-            'SearchQuery',
-          ],
-          sliceIds: [
-            'winmuid1tf',
-            'anssupfor_c',
-            'imgchatgptv2',
-            'tts2cf',
-            'contansperf',
-            'mlchatpc8500w',
-            'mlchatpc2',
-            'ctrlworkpay',
-            'winshortmsgtf',
-            'cibctrl',
-            'sydtransctrl',
-            'sydconfigoptc',
-            '0705trt4',
-            '517opinion',
-            '628ajcopus0',
-            '330uaugs0',
-            '529rwea',
-            '0626snptrcs0',
-            '424dagslnv1',
-          ],
-          isStartOfSession: conversation.invocationId === 0,
-          message: {
-            author: 'user',
-            inputMethod: 'Keyboard',
-            text: conversation.prompt,
-            imageUrl: conversation.imageUrl,
-            messageType: 'Chat',
-          },
-          conversationId: conversation.conversationId,
-          conversationSignature: conversation.conversationSignature,
-          participant: { id: conversation.clientId },
-        },
-      ],
-      invocationId: conversation.invocationId.toString(),
-      target: 'chat',
-      type: InvocationEventType.StreamInvocation,
-    }
-  }
-
-  async createConversation(): Promise<ConversationResponse> {
-    const headers = {
-      'Accept-Encoding': 'gzip, deflate, br, zsdch',
-      'User-Agent': this.ua,
-      'x-ms-useragent': 'azsdk-js-api-client-factory/1.0.0-beta.1 core-rest-pipeline/1.10.0 OS/Win32',
-      cookie: this.cookie,
-    }
-
-    let resp: ConversationResponse | undefined
-    try {
-      const response = await fetch(this.endpoint + '/api/create', { method: 'POST', headers, redirect: 'error', mode: 'cors', credentials: 'include' })
-      if (response.status === 404) {
-        throw new ChatError('Not Found', ErrorCode.NOTFOUND_ERROR)
-      }
-      resp = await response.json() as ConversationResponse
-    } catch (err) {
-      console.error('create conversation error', err)
-    }
-
-    if (!resp?.result) {
-      throw new ChatError('Invalid response', ErrorCode.UNKOWN_ERROR)
-    }
-
-    const { value, message } = resp.result || {}
-    if (value !== 'Success') {
-      const errorMsg = `${value}: ${message}`
-      if (value === 'UnauthorizedRequest') {
-        throw new ChatError(errorMsg, ErrorCode.BING_UNAUTHORIZED)
-      }
-      if (value === 'Forbidden') {
-        throw new ChatError(errorMsg, ErrorCode.BING_FORBIDDEN)
-      }
-      throw new ChatError(errorMsg, ErrorCode.UNKOWN_ERROR)
-    }
-    return resp
-  }
-
-  private async createContext(conversationStyle: BingConversationStyle) {
-    if (!this.conversationContext) {
-      const conversation = await this.createConversation()
-      this.conversationContext = {
-        conversationId: conversation.conversationId,
-        conversationSignature: conversation.conversationSignature,
-        clientId: conversation.clientId,
-        invocationId: 0,
-        conversationStyle,
-        prompt: '',
-      }
-    }
-    return this.conversationContext
-  }
-
-  async sendMessage(params: Params) {
-    try {
-      await this.createContext(params.options.bingConversationStyle)
-      Object.assign(this.conversationContext!, { prompt: params.prompt, imageUrl: params.imageUrl })
-      return this.sydneyProxy(params)
-    } catch (error) {
-      params.onEvent({
-        type: 'ERROR',
-        error: error instanceof ChatError ? error : new ChatError('Catch Error', ErrorCode.UNKOWN_ERROR),
-      })
-    }
-  }
-
-  private async sydneyProxy(params: Params) {
-    const abortController = new AbortController()
-    const response = await fetch(this.endpoint + '/api/sydney', {
-      method: 'POST',
-      headers: {
-        'Content-Type': 'application/json',
-      },
-      signal: abortController.signal,
-      body: JSON.stringify(this.conversationContext!)
-    })
-    if (response.status !== 200) {
-      params.onEvent({
-        type: 'ERROR',
-        error: new ChatError(
-          'Unknown error',
-          ErrorCode.UNKOWN_ERROR,
-        ),
-      })
-    }
-    params.signal?.addEventListener('abort', () => {
-      abortController.abort()
-    })
-
-    const textDecoder = createChunkDecoder()
-    for await (const chunk of streamAsyncIterable(response.body!)) {
-      this.parseEvents(params, websocketUtils.unpackMessage(textDecoder(chunk)))
-    }
-  }
-
-  async sendWs() {
-    const wsConfig: ConstructorParameters<typeof WebSocketAsPromised>[1] = {
-      packMessage: websocketUtils.packMessage,
-      unpackMessage: websocketUtils.unpackMessage,
-      createWebSocket: (url) => new WebSocket(url, {
-        headers: {
-          'accept-language': 'zh-CN,zh;q=0.9',
-          'cache-control': 'no-cache',
-          'User-Agent': this.ua,
-          pragma: 'no-cache',
-          cookie: this.cookie,
-        }
-      })
-    }
-    const wsp = new WebSocketAsPromised('wss://sydney.bing.com/sydney/ChatHub', wsConfig)
-
-    wsp.open().then(() => {
-      wsp.sendPacked({ protocol: 'json', version: 1 })
-      wsp.sendPacked({ type: 6 })
-      wsp.sendPacked(BingWebBot.buildChatRequest(this.conversationContext!))
-    })
-
-    return wsp
-  }
-
-  private async useWs(params: Params) {
-    const wsp = await this.sendWs()
-    const watchDog = new WatchDog()
-    wsp.onUnpackedMessage.addListener((events) => {
-      watchDog.watch(() => {
-        wsp.sendPacked({ type: 6 })
-      })
-      this.parseEvents(params, events)
-    })
-
-    wsp.onClose.addListener(() => {
-      watchDog.reset()
-      params.onEvent({ type: 'DONE' })
-      wsp.removeAllListeners()
-    })
-
-    params.signal?.addEventListener('abort', () => {
-      wsp.removeAllListeners()
-      wsp.close()
-    })
-  }
-
-  private async createImage(prompt: string, id: string) {
-    try {
-      const headers = {
-        'Accept-Encoding': 'gzip, deflate, br, zsdch',
-        'User-Agent': this.ua,
-        'x-ms-useragent': 'azsdk-js-api-client-factory/1.0.0-beta.1 core-rest-pipeline/1.10.0 OS/Win32',
-        cookie: this.cookie,
-      }
-      const query = new URLSearchParams({
-        prompt,
-        id
-      })
-      const response = await fetch(this.endpoint + '/api/image?' + query.toString(),
-        {
-          method: 'POST',
-          headers,
-          mode: 'cors',
-          credentials: 'include'
-        })
-        .then(res => res.text())
-      if (response) {
-        this.lastText += '\n' + response
-      }
-    } catch (err) {
-      console.error('Create Image Error', err)
-    }
-  }
-
-  private buildKnowledgeApiPayload(imageUrl: string, conversationStyle: BingConversationStyle) {
-    const imageInfo: ImageInfo = {}
-    let imageBase64: string | undefined = undefined
-    const knowledgeRequest = {
-      imageInfo,
-      knowledgeRequest: {
-        invokedSkills: [
-          'ImageById'
-        ],
-        subscriptionId: 'Bing.Chat.Multimodal',
-        invokedSkillsRequestData: {
-            enableFaceBlur: true
-        },
-        convoData: {
-          convoid: this.conversationContext?.conversationId,
-          convotone: conversationStyle,
-        }
-      },
-    }
-
-    if (imageUrl.startsWith('data:image/')) {
-      imageBase64 = imageUrl.replace('data:image/', '');
-      const partIndex = imageBase64.indexOf(',')
-      if (partIndex) {
-        imageBase64 = imageBase64.substring(partIndex + 1)
-      }
-    } else {
-      imageInfo.url = imageUrl
-    }
-    return { knowledgeRequest, imageBase64 }
-  }
-
-  async uploadImage(imageUrl: string, conversationStyle: BingConversationStyle = BingConversationStyle.Creative): Promise<KBlobResponse | undefined> {
-    if (!imageUrl) {
-      return
-    }
-    await this.createContext(conversationStyle)
-    const payload = this.buildKnowledgeApiPayload(imageUrl, conversationStyle)
-
-    const response = await fetch(this.endpoint + '/api/kblob',
-      {
-        headers: {
-          'Content-Type': 'application/json',
-        },
-        method: 'POST',
-        mode: 'cors',
-        credentials: 'include',
-        body: JSON.stringify(payload),
-      })
-      .then(res => res.json())
-      .catch(e => {
-        console.log('Error', e)
-      })
-    return response
-  }
-
-  private async generateContent(message: ChatResponseMessage) {
-    if (message.contentType === 'IMAGE') {
-      this.asyncTasks.push(this.createImage(message.text, message.messageId))
-    }
-  }
-
-  private async parseEvents(params: Params, events: any) {
-    const conversation = this.conversationContext!
-
-    events?.forEach(async (event: ChatUpdateCompleteResponse) => {
-      debug('bing event', event)
-      if (event.type === 3) {
-        await Promise.all(this.asyncTasks)
-        this.asyncTasks = []
-        params.onEvent({ type: 'UPDATE_ANSWER', data: { text: this.lastText } })
-        params.onEvent({ type: 'DONE' })
-        conversation.invocationId = parseInt(event.invocationId, 10) + 1
-      } else if (event.type === 1) {
-        const messages = event.arguments[0].messages
-        if (messages) {
-          const text = convertMessageToMarkdown(messages[0])
-          this.lastText = text
-          params.onEvent({ type: 'UPDATE_ANSWER', data: { text, spokenText: messages[0].text, throttling: event.arguments[0].throttling } })
-        }
-      } else if (event.type === 2) {
-        const messages = event.item.messages as ChatResponseMessage[] | undefined
-        if (!messages) {
-          params.onEvent({
-            type: 'ERROR',
-            error: new ChatError(
-              event.item.result.error || 'Unknown error',
-              event.item.result.value === 'Throttled' ? ErrorCode.THROTTLE_LIMIT
-                : event.item.result.value === 'CaptchaChallenge' ? (this.conversationContext?.conversationId?.includes('BingProdUnAuthenticatedUsers') ? ErrorCode.BING_UNAUTHORIZED : ErrorCode.BING_CAPTCHA)
-                  : ErrorCode.UNKOWN_ERROR
-            ),
-          })
-          return
-        }
-        const limited = messages.some((message) =>
-          message.contentOrigin === 'TurnLimiter'
-          || message.messageType === 'Disengaged'
-        )
-        if (limited) {
-          params.onEvent({
-            type: 'ERROR',
-            error: new ChatError(
-              'Sorry, you have reached chat limit in this conversation.',
-              ErrorCode.CONVERSATION_LIMIT,
-            ),
-          })
-          return
-        }
-
-        const lastMessage = event.item.messages.at(-1) as ChatResponseMessage
-        const specialMessage = event.item.messages.find(message => message.author === 'bot' && message.contentType === 'IMAGE')
-        if (specialMessage) {
-          this.generateContent(specialMessage)
-        }
-
-        if (lastMessage) {
-          const text = convertMessageToMarkdown(lastMessage)
-          this.lastText = text
-          params.onEvent({
-            type: 'UPDATE_ANSWER',
-            data: { text, throttling: event.item.throttling, suggestedResponses: lastMessage.suggestedResponses, sourceAttributions: lastMessage.sourceAttributions },
-          })
-        }
-      }
-    })
-  }
-
-  resetConversation() {
-    this.conversationContext = undefined
-  }
-}
diff --git a/spaces/pinkq/Newbing/src/pages/api/kblob.ts b/spaces/pinkq/Newbing/src/pages/api/kblob.ts
deleted file mode 100644
index 0ce7e6063cdc06838e76f1cff1d5982d34ef52de..0000000000000000000000000000000000000000
--- a/spaces/pinkq/Newbing/src/pages/api/kblob.ts
+++ /dev/null
@@ -1,56 +0,0 @@
-'use server'
-
-import { NextApiRequest, NextApiResponse } from 'next'
-import FormData from 'form-data'
-import { fetch } from '@/lib/isomorphic'
-import { KBlobRequest } from '@/lib/bots/bing/types'
-
-const API_DOMAIN = 'https://bing.vcanbb.top'
-
-export const config = {
-  api: {
-    bodyParser: {
-      sizeLimit: '10mb' // Set desired value here
-    }
-  }
-}
-
-export default async function handler(req: NextApiRequest, res: NextApiResponse) {
-  try {
-    const { knowledgeRequest, imageBase64 } = req.body as KBlobRequest
-
-    const formData = new FormData()
-    formData.append('knowledgeRequest', JSON.stringify(knowledgeRequest))
-    if (imageBase64) {
-      formData.append('imageBase64', imageBase64)
-    }
-
-    const response = await fetch(`${API_DOMAIN}/images/kblob`,
-      {
-        method: 'POST',
-        body: formData.getBuffer(),
-        headers: {
-          "sec-ch-ua": "\"Not/A)Brand\";v=\"99\", \"Google Chrome\";v=\"115\", \"Chromium\";v=\"115\"",
-          "sec-ch-ua-mobile": "?0",
-          "sec-ch-ua-platform": "\"Windows\"",
-          "Referer": `${API_DOMAIN}/web/index.html`,
-          "Referrer-Policy": "origin-when-cross-origin",
-          'x-ms-useragent': 'azsdk-js-api-client-factory/1.0.0-beta.1 core-rest-pipeline/1.10.0 OS/Win32',
-          ...formData.getHeaders()
-        }
-      }
-    ).then(res => res.text())
-
-    res.writeHead(200, {
-      'Content-Type': 'application/json',
-    })
-    res.end(response || JSON.stringify({ result: { value: 'UploadFailed', message: '请更换 IP 或代理后重试' } }))
-  } catch (e) {
-    return res.json({
-      result: {
-        value: 'UploadFailed',
-        message: `${e}`
-      }
-    })
-  }
-}
diff --git a/spaces/pknez/face-swap-docker/mynewshinyroop/Lib/site-packages/setuptools/_distutils/unixccompiler.py b/spaces/pknez/face-swap-docker/mynewshinyroop/Lib/site-packages/setuptools/_distutils/unixccompiler.py
deleted file mode 100644
index 6ca2332ae16a575a850fe97e5bc1e42d33b7b2f2..0000000000000000000000000000000000000000
--- a/spaces/pknez/face-swap-docker/mynewshinyroop/Lib/site-packages/setuptools/_distutils/unixccompiler.py
+++ /dev/null
@@ -1,400 +0,0 @@
-"""distutils.unixccompiler
-
-Contains the UnixCCompiler class, a subclass of CCompiler that handles
-the "typical" Unix-style command-line C compiler:
-  * macros defined with -Dname[=value]
-  * macros undefined with -Uname
-  * include search directories specified with -Idir
-  * libraries specified with -lllib
-  * library search directories specified with -Ldir
-  * compile handled by 'cc' (or similar) executable with -c option:
-    compiles .c to .o
-  * link static library handled by 'ar' command (possibly with 'ranlib')
-  * link shared library handled by 'cc -shared'
-"""
-
-import os
-import sys
-import re
-import shlex
-import itertools
-
-from . import sysconfig
-from .dep_util import newer
-from .ccompiler import CCompiler, gen_preprocess_options, gen_lib_options
-from .errors import DistutilsExecError, CompileError, LibError, LinkError
-from ._log import log
-from ._macos_compat import compiler_fixup
-
-# XXX Things not currently handled:
-#   * optimization/debug/warning flags; we just use whatever's in Python's
-#     Makefile and live with it.  Is this adequate?  If not, we might
-#     have to have a bunch of subclasses GNUCCompiler, SGICCompiler,
-#     SunCCompiler, and I suspect down that road lies madness.
-#   * even if we don't know a warning flag from an optimization flag,
-#     we need some way for outsiders to feed preprocessor/compiler/linker
-#     flags in to us -- eg. a sysadmin might want to mandate certain flags
-#     via a site config file, or a user might want to set something for
-#     compiling this module distribution only via the setup.py command
-#     line, whatever.  As long as these options come from something on the
-#     current system, they can be as system-dependent as they like, and we
-#     should just happily stuff them into the preprocessor/compiler/linker
-#     options and carry on.
-
-
-def _split_env(cmd):
-    """
-    For macOS, split command into 'env' portion (if any)
-    and the rest of the linker command.
-
-    >>> _split_env(['a', 'b', 'c'])
-    ([], ['a', 'b', 'c'])
-    >>> _split_env(['/usr/bin/env', 'A=3', 'gcc'])
-    (['/usr/bin/env', 'A=3'], ['gcc'])
-    """
-    pivot = 0
-    if os.path.basename(cmd[0]) == "env":
-        pivot = 1
-        while '=' in cmd[pivot]:
-            pivot += 1
-    return cmd[:pivot], cmd[pivot:]
-
-
-def _split_aix(cmd):
-    """
-    AIX platforms prefix the compiler with the ld_so_aix
-    script, so split that from the linker command.
-
-    >>> _split_aix(['a', 'b', 'c'])
-    ([], ['a', 'b', 'c'])
-    >>> _split_aix(['/bin/foo/ld_so_aix', 'gcc'])
-    (['/bin/foo/ld_so_aix'], ['gcc'])
-    """
-    pivot = os.path.basename(cmd[0]) == 'ld_so_aix'
-    return cmd[:pivot], cmd[pivot:]
-
-
-def _linker_params(linker_cmd, compiler_cmd):
-    """
-    The linker command usually begins with the compiler
-    command (possibly multiple elements), followed by zero or more
-    params for shared library building.
-
-    If the LDSHARED env variable overrides the linker command,
-    however, the commands may not match.
-
-    Return the best guess of the linker parameters by stripping
-    the linker command. If the compiler command does not
-    match the linker command, assume the linker command is
-    just the first element.
-
-    >>> _linker_params('gcc foo bar'.split(), ['gcc'])
-    ['foo', 'bar']
-    >>> _linker_params('gcc foo bar'.split(), ['other'])
-    ['foo', 'bar']
-    >>> _linker_params('ccache gcc foo bar'.split(), 'ccache gcc'.split())
-    ['foo', 'bar']
-    >>> _linker_params(['gcc'], ['gcc'])
-    []
-    """
-    c_len = len(compiler_cmd)
-    pivot = c_len if linker_cmd[:c_len] == compiler_cmd else 1
-    return linker_cmd[pivot:]
-
-
-class UnixCCompiler(CCompiler):
-    compiler_type = 'unix'
-
-    # These are used by CCompiler in two places: the constructor sets
-    # instance attributes 'preprocessor', 'compiler', etc. from them, and
-    # 'set_executable()' allows any of these to be set.  The defaults here
-    # are pretty generic; they will probably have to be set by an outsider
-    # (eg. using information discovered by the sysconfig about building
-    # Python extensions).
-    executables = {
-        'preprocessor': None,
-        'compiler': ["cc"],
-        'compiler_so': ["cc"],
-        'compiler_cxx': ["cc"],
-        'linker_so': ["cc", "-shared"],
-        'linker_exe': ["cc"],
-        'archiver': ["ar", "-cr"],
-        'ranlib': None,
-    }
-
-    if sys.platform[:6] == "darwin":
-        executables['ranlib'] = ["ranlib"]
-
-    # Needed for the filename generation methods provided by the base
-    # class, CCompiler.  NB. whoever instantiates/uses a particular
-    # UnixCCompiler instance should set 'shared_lib_ext' -- we set a
-    # reasonable common default here, but it's not necessarily used on all
-    # Unices!
-
-    src_extensions = [".c", ".C", ".cc", ".cxx", ".cpp", ".m"]
-    obj_extension = ".o"
-    static_lib_extension = ".a"
-    shared_lib_extension = ".so"
-    dylib_lib_extension = ".dylib"
-    xcode_stub_lib_extension = ".tbd"
-    static_lib_format = shared_lib_format = dylib_lib_format = "lib%s%s"
-    xcode_stub_lib_format = dylib_lib_format
-    if sys.platform == "cygwin":
-        exe_extension = ".exe"
-
-    def preprocess(
-        self,
-        source,
-        output_file=None,
-        macros=None,
-        include_dirs=None,
-        extra_preargs=None,
-        extra_postargs=None,
-    ):
-        fixed_args = self._fix_compile_args(None, macros, include_dirs)
-        ignore, macros, include_dirs = fixed_args
-        pp_opts = gen_preprocess_options(macros, include_dirs)
-        pp_args = self.preprocessor + pp_opts
-        if output_file:
-            pp_args.extend(['-o', output_file])
-        if extra_preargs:
-            pp_args[:0] = extra_preargs
-        if extra_postargs:
-            pp_args.extend(extra_postargs)
-        pp_args.append(source)
-
-        # reasons to preprocess:
-        # - force is indicated
-        # - output is directed to stdout
-        # - source file is newer than the target
-        preprocess = self.force or output_file is None or newer(source, output_file)
-        if not preprocess:
-            return
-
-        if output_file:
-            self.mkpath(os.path.dirname(output_file))
-
-        try:
-            self.spawn(pp_args)
-        except DistutilsExecError as msg:
-            raise CompileError(msg)
-
-    def _compile(self, obj, src, ext, cc_args, extra_postargs, pp_opts):
-        compiler_so = compiler_fixup(self.compiler_so, cc_args + extra_postargs)
-        try:
-            self.spawn(compiler_so + cc_args + [src, '-o', obj] + extra_postargs)
-        except DistutilsExecError as msg:
-            raise CompileError(msg)
-
-    def create_static_lib(
-        self, objects, output_libname, output_dir=None, debug=0, target_lang=None
-    ):
-        objects, output_dir = self._fix_object_args(objects, output_dir)
-
-        output_filename = self.library_filename(output_libname, output_dir=output_dir)
-
-        if self._need_link(objects, output_filename):
-            self.mkpath(os.path.dirname(output_filename))
-            self.spawn(self.archiver + [output_filename] + objects + self.objects)
-
-            # Not many Unices required ranlib anymore -- SunOS 4.x is, I
-            # think the only major Unix that does.  Maybe we need some
-            # platform intelligence here to skip ranlib if it's not
-            # needed -- or maybe Python's configure script took care of
-            # it for us, hence the check for leading colon.
-            if self.ranlib:
-                try:
-                    self.spawn(self.ranlib + [output_filename])
-                except DistutilsExecError as msg:
-                    raise LibError(msg)
-        else:
-            log.debug("skipping %s (up-to-date)", output_filename)
-
-    def link(
-        self,
-        target_desc,
-        objects,
-        output_filename,
-        output_dir=None,
-        libraries=None,
-        library_dirs=None,
-        runtime_library_dirs=None,
-        export_symbols=None,
-        debug=0,
-        extra_preargs=None,
-        extra_postargs=None,
-        build_temp=None,
-        target_lang=None,
-    ):
-        objects, output_dir = self._fix_object_args(objects, output_dir)
-        fixed_args = self._fix_lib_args(libraries, library_dirs, runtime_library_dirs)
-        libraries, library_dirs, runtime_library_dirs = fixed_args
-
-        lib_opts = gen_lib_options(self, library_dirs, runtime_library_dirs, libraries)
-        if not isinstance(output_dir, (str, type(None))):
-            raise TypeError("'output_dir' must be a string or None")
-        if output_dir is not None:
-            output_filename = os.path.join(output_dir, output_filename)
-
-        if self._need_link(objects, output_filename):
-            ld_args = objects + self.objects + lib_opts + ['-o', output_filename]
-            if debug:
-                ld_args[:0] = ['-g']
-            if extra_preargs:
-                ld_args[:0] = extra_preargs
-            if extra_postargs:
-                ld_args.extend(extra_postargs)
-            self.mkpath(os.path.dirname(output_filename))
-            try:
-                # Select a linker based on context: linker_exe when
-                # building an executable or linker_so (with shared options)
-                # when building a shared library.
-                building_exe = target_desc == CCompiler.EXECUTABLE
-                linker = (self.linker_exe if building_exe else self.linker_so)[:]
-
-                if target_lang == "c++" and self.compiler_cxx:
-                    env, linker_ne = _split_env(linker)
-                    aix, linker_na = _split_aix(linker_ne)
-                    _, compiler_cxx_ne = _split_env(self.compiler_cxx)
-                    _, linker_exe_ne = _split_env(self.linker_exe)
-
-                    params = _linker_params(linker_na, linker_exe_ne)
-                    linker = env + aix + compiler_cxx_ne + params
-
-                linker = compiler_fixup(linker, ld_args)
-
-                self.spawn(linker + ld_args)
-            except DistutilsExecError as msg:
-                raise LinkError(msg)
-        else:
-            log.debug("skipping %s (up-to-date)", output_filename)
-
-    # -- Miscellaneous methods -----------------------------------------
-    # These are all used by the 'gen_lib_options() function, in
-    # ccompiler.py.
-
-    def library_dir_option(self, dir):
-        return "-L" + dir
-
-    def _is_gcc(self):
-        cc_var = sysconfig.get_config_var("CC")
-        compiler = os.path.basename(shlex.split(cc_var)[0])
-        return "gcc" in compiler or "g++" in compiler
-
-    def runtime_library_dir_option(self, dir):
-        # XXX Hackish, at the very least.  See Python bug #445902:
-        # http://sourceforge.net/tracker/index.php
-        #   ?func=detail&aid=445902&group_id=5470&atid=105470
-        # Linkers on different platforms need different options to
-        # specify that directories need to be added to the list of
-        # directories searched for dependencies when a dynamic library
-        # is sought.  GCC on GNU systems (Linux, FreeBSD, ...) has to
-        # be told to pass the -R option through to the linker, whereas
-        # other compilers and gcc on other systems just know this.
-        # Other compilers may need something slightly different.  At
-        # this time, there's no way to determine this information from
-        # the configuration data stored in the Python installation, so
-        # we use this hack.
-        if sys.platform[:6] == "darwin":
-            from distutils.util import get_macosx_target_ver, split_version
-
-            macosx_target_ver = get_macosx_target_ver()
-            if macosx_target_ver and split_version(macosx_target_ver) >= [10, 5]:
-                return "-Wl,-rpath," + dir
-            else:  # no support for -rpath on earlier macOS versions
-                return "-L" + dir
-        elif sys.platform[:7] == "freebsd":
-            return "-Wl,-rpath=" + dir
-        elif sys.platform[:5] == "hp-ux":
-            return [
-                "-Wl,+s" if self._is_gcc() else "+s",
-                "-L" + dir,
-            ]
-
-        # For all compilers, `-Wl` is the presumed way to
-        # pass a compiler option to the linker and `-R` is
-        # the way to pass an RPATH.
-        if sysconfig.get_config_var("GNULD") == "yes":
-            # GNU ld needs an extra option to get a RUNPATH
-            # instead of just an RPATH.
-            return "-Wl,--enable-new-dtags,-R" + dir
-        else:
-            return "-Wl,-R" + dir
-
-    def library_option(self, lib):
-        return "-l" + lib
-
-    @staticmethod
-    def _library_root(dir):
-        """
-        macOS users can specify an alternate SDK using'-isysroot'.
-        Calculate the SDK root if it is specified.
-
-        Note that, as of Xcode 7, Apple SDKs may contain textual stub
-        libraries with .tbd extensions rather than the normal .dylib
-        shared libraries installed in /.  The Apple compiler tool
-        chain handles this transparently but it can cause problems
-        for programs that are being built with an SDK and searching
-        for specific libraries.  Callers of find_library_file need to
-        keep in mind that the base filename of the returned SDK library
-        file might have a different extension from that of the library
-        file installed on the running system, for example:
-          /Applications/Xcode.app/Contents/Developer/Platforms/
-              MacOSX.platform/Developer/SDKs/MacOSX10.11.sdk/
-              usr/lib/libedit.tbd
-        vs
-          /usr/lib/libedit.dylib
-        """
-        cflags = sysconfig.get_config_var('CFLAGS')
-        match = re.search(r'-isysroot\s*(\S+)', cflags)
-
-        apply_root = (
-            sys.platform == 'darwin'
-            and match
-            and (
-                dir.startswith('/System/')
-                or (dir.startswith('/usr/') and not dir.startswith('/usr/local/'))
-            )
-        )
-
-        return os.path.join(match.group(1), dir[1:]) if apply_root else dir
-
-    def find_library_file(self, dirs, lib, debug=0):
-        r"""
-        Second-guess the linker with not much hard
-        data to go on: GCC seems to prefer the shared library, so
-        assume that *all* Unix C compilers do,
-        ignoring even GCC's "-static" option.
-
-        >>> compiler = UnixCCompiler()
-        >>> compiler._library_root = lambda dir: dir
-        >>> monkeypatch = getfixture('monkeypatch')
-        >>> monkeypatch.setattr(os.path, 'exists', lambda d: 'existing' in d)
-        >>> dirs = ('/foo/bar/missing', '/foo/bar/existing')
-        >>> compiler.find_library_file(dirs, 'abc').replace('\\', '/')
-        '/foo/bar/existing/libabc.dylib'
-        >>> compiler.find_library_file(reversed(dirs), 'abc').replace('\\', '/')
-        '/foo/bar/existing/libabc.dylib'
-        >>> monkeypatch.setattr(os.path, 'exists',
-        ...     lambda d: 'existing' in d and '.a' in d)
-        >>> compiler.find_library_file(dirs, 'abc').replace('\\', '/')
-        '/foo/bar/existing/libabc.a'
-        >>> compiler.find_library_file(reversed(dirs), 'abc').replace('\\', '/')
-        '/foo/bar/existing/libabc.a'
-        """
-        lib_names = (
-            self.library_filename(lib, lib_type=type)
-            for type in 'dylib xcode_stub shared static'.split()
-        )
-
-        roots = map(self._library_root, dirs)
-
-        searched = (
-            os.path.join(root, lib_name)
-            for root, lib_name in itertools.product(roots, lib_names)
-        )
-
-        found = filter(os.path.exists, searched)
-
-        # Return None if it could not be found in any dir.
-        return next(found, None)
diff --git a/spaces/podsni/Coverter-PDF-to-TXT/app.py b/spaces/podsni/Coverter-PDF-to-TXT/app.py
deleted file mode 100644
index 9e644ac29a32ac895d173d20aace657bcdc16e05..0000000000000000000000000000000000000000
--- a/spaces/podsni/Coverter-PDF-to-TXT/app.py
+++ /dev/null
@@ -1,136 +0,0 @@
-import streamlit as st
-import pdf2image
-import pytesseract
-from pytesseract import Output, TesseractError
-from functions import convert_pdf_to_txt_pages, convert_pdf_to_txt_file, save_pages, displayPDF, images_to_txt
-
-st.set_page_config(page_title="PDF to Text")
-
-
-html_temp = """
-            <div style="background-color:{};padding:1px">
-            
-            </div>
-            """
-
-# st.markdown("""
-#     ## :outbox_tray: Text data extractor: PDF to Text
-    
-# """)
-# st.markdown(html_temp.format("rgba(55, 53, 47, 0.16)"),unsafe_allow_html=True)
-st.markdown("""
-    ## Text data extractor: PDF to Text
-    
-""")
-languages = {
-    'English': 'eng',
-    'French': 'fra',
-    'Arabic': 'ara',
-    'Spanish': 'spa',
-}
-
-with st.sidebar:
-    st.title(":outbox_tray: PDF to Text")
-    textOutput = st.selectbox(
-        "How do you want your output text?",
-        ('One text file (.txt)', 'Text file per page (ZIP)'))
-    ocr_box = st.checkbox('Enable OCR (scanned document)')
-    
-    st.markdown(html_temp.format("rgba(55, 53, 47, 0.16)"),unsafe_allow_html=True)
-    st.markdown("""
-    # How does it work?
-    Simply load your PDF and convert it to single-page or multi-page text.
-    """)
-    st.markdown(html_temp.format("rgba(55, 53, 47, 0.16)"),unsafe_allow_html=True)
-    st.markdown("""
-    Made by [@nainia_ayoub](https://twitter.com/nainia_ayoub) 
-    """)
-    
-
-pdf_file = st.file_uploader("Load your PDF", type="pdf")
-hide="""
-<style>
-footer{
-	visibility: hidden;
-    	position: relative;
-}
-.viewerBadge_container__1QSob{
-  	visibility: hidden;
-}
-#MainMenu{
-	visibility: hidden;
-}
-<style>
-"""
-st.markdown(hide, unsafe_allow_html=True)
-if pdf_file:
-    path = pdf_file.read()
-    # display document
-    with st.expander("Display document"):
-        displayPDF(path)
-    if ocr_box:
-        option = st.selectbox('Select the document language', list(languages.keys()))
-    # pdf to text
-    if textOutput == 'One text file (.txt)':
-        if ocr_box:
-            texts, nbPages = images_to_txt(path, languages[option])
-            totalPages = "Pages: "+str(nbPages)+" in total"
-            text_data_f = "\n\n".join(texts)
-        else:
-            text_data_f, nbPages = convert_pdf_to_txt_file(pdf_file)
-            totalPages = "Pages: "+str(nbPages)+" in total"
-
-        st.info(totalPages)
-        st.download_button("Download txt file", text_data_f)
-    else:
-        if ocr_box:
-            text_data, nbPages = images_to_txt(path, languages[option])
-            totalPages = "Pages: "+str(nbPages)+" in total"
-        else:
-            text_data, nbPages = convert_pdf_to_txt_pages(pdf_file)
-            totalPages = "Pages: "+str(nbPages)+" in total"
-        st.info(totalPages)
-        zipPath = save_pages(text_data)
-        # download text data   
-        with open(zipPath, "rb") as fp:
-            btn = st.download_button(
-                label="Download ZIP (txt)",
-                data=fp,
-                file_name="pdf_to_txt.zip",
-                mime="application/zip"
-            )
-
-    st.markdown('''
-    <a target="_blank" style="color: black" href="https://twitter.com/intent/tweet?text=You%20can%20extract%20text%20from%20your%20PDF%20using%20this%20PDF%20to%20Text%20streamlit%20app%20by%20@nainia_ayoub!%0A%0Ahttps://nainiayoub-pdf-text-data-extractor-app-p6hy0z.streamlit.app/">
-        <button class="btn">
-            Spread the word!
-        </button>
-    </a>
-    <style>
-    .btn{
-        display: inline-flex;
-        -moz-box-align: center;
-        align-items: center;
-        -moz-box-pack: center;
-        justify-content: center;
-        font-weight: 400;
-        padding: 0.25rem 0.75rem;
-        border-radius: 0.25rem;
-        margin: 0px;
-        line-height: 1.6;
-        color: rgb(49, 51, 63);
-        background-color: #fff;
-        width: auto;
-        user-select: none;
-        border: 1px solid rgba(49, 51, 63, 0.2);
-        }
-    .btn:hover{
-        color: #00acee;
-        background-color: #fff;
-        border: 1px solid #00acee;
-    }
-    </style>
-    ''',
-    unsafe_allow_html=True
-    )
-    
diff --git a/spaces/pojitha/sinhala_hate_speech/app.py b/spaces/pojitha/sinhala_hate_speech/app.py
deleted file mode 100644
index d441a935d5a1a70f49db6f5c00490d29bf8a0946..0000000000000000000000000000000000000000
--- a/spaces/pojitha/sinhala_hate_speech/app.py
+++ /dev/null
@@ -1,125 +0,0 @@
-
-import numpy
-from sklearn.pipeline import Pipeline
-from sklearn.feature_extraction.text import TfidfVectorizer
-from sklearn.svm import SVC
-from sklearn.metrics import accuracy_score
-import pandas as pd 
-import numpy as np
-import streamlit as st
-
-
-df1 = pd.read_csv('sinhala-hate-speech-dataset.csv')
-df2 = pd.read_csv('Sinhala_Singlish_Hate_Speech.csv')
-
-df2.columns= ["id","comment","label"]
-
-df2['label'] = df2['label'].apply(lambda x: 1 if x == "YES" else 0)
-
-df = pd.concat([df1, df2], sort=False)
-
-
-
-df.isnull().sum()
-
-import re
-
-exclude = set(",.:;'\"-?!/´`%")
-def remove_punctutation(text):
-  return ''.join([(i if i not in exclude else " ") for i in text])
-
-def remove_numbers(text):
-  return ''.join(c for c in text if not c.isnumeric())
-
-df['clean_data'] = df['comment'].apply(lambda x: remove_punctutation((x)))
-
-df['cleand'] = df['clean_data'].apply(lambda x: remove_numbers(x))
-
-import nltk
-from nltk.tokenize import word_tokenize
-nltk.download('punkt')
-
-df['tokens'] = df['cleand'].apply(word_tokenize)
-
-with open("StopWords_425.txt", "r",encoding="utf-16") as file:
-    # Read the contents of the file
-    contents = file.read()
-stop_word = contents.split()
-stop_word = [word for word in stop_word if not any(char.isdigit() for char in word)]
-print(stop_word)
-
-df['tokens'] = df['tokens'].apply(lambda x: [item for item in x if item not in stop_word])
-
-import nltk
-from nltk.tokenize import word_tokenize
-
-with open('Suffixes-413.txt', 'r', encoding='utf-16') as f:
-    stemmed_words = f.readlines()
-
-stemmed_words = [word for word in stemmed_words if not any(char.isdigit() for char in word)]
-stemmed_words = [word.strip() for word in stemmed_words]
-stemmed_words = set(stemmed_words)
-
-def stem_word(word):
-    if word in stemmed_words:
-        return word
-    else:
-        return nltk.stem.PorterStemmer().stem(word)
-
-df['cleaneddata'] = df['tokens'].apply(lambda x: [stem_word(word) for word in x])
-
-
-pipeline = Pipeline([
-    ('tfidf', TfidfVectorizer(stop_words=stop_word, token_pattern=r'\b\w+\b')),
-    ('svm', SVC())
-])
-
-from sklearn.model_selection import train_test_split
-
-X_train, X_test, y_train, y_test = train_test_split(df['comment'], df['label'], test_size=0.3)
-
-pipeline.fit(X_train, y_train)
-
-
-
-st.title("Sinhala Hate Speech Identifier")
-
-st.markdown("This NLP model still on training process, Please give true values.")
-st.markdown("Please refresh the page, before enter the new sentence. Thank you")
-
-# Define the user input section
-user_input = st.text_input("Enter a sentence")
-
-# Define the model output section
-if user_input:
-    # Check if the sentence is hate or not
-    user_pred = pipeline.predict([user_input])[0]
-    if user_pred == 1:
-        st.write("This sentence is hate.")
-        add_to_df = st.selectbox("Is this correct?", ["Choose a Option","Yes", "No"],index=0)
-        if add_to_df == "Yes":
-            st.write("Thank you")
-        else:
-            processed_text = pd.Series(user_input)
-            df = df.append({'comment': user_input, 'label': 0}, ignore_index=True)
-            df.to_csv("sinhala-hate-speech-dataset", index=False)
-            X_train, X_test, y_train, y_test = train_test_split(df['comment'], df['label'], test_size=0.3)
-            X_train = X_train.append(processed_text, ignore_index=True)
-            y_train = y_train.append(pd.Series([0]))
-            pipeline.fit(X_train, y_train)
-            st.write("Thank you for your contribution. We added that word into our system.")
-    else:
-        st.write("This sentence is not hate.")
-        add_to_df = st.selectbox("Is this correct?", ["Choose a Option","Yes", "No"],index=0)
-        if add_to_df == "Yes":
-            st.write("Thank you")
-        else:
-            processed_text = pd.Series(user_input)
-            df = df.append({'comment': user_input, 'label': 1}, ignore_index=True)
-            df.to_csv("sinhala-hate-speech-dataset.csv",index=True)
-            X_train, X_test, y_train, y_test = train_test_split(df['comment'], df['label'], test_size=0.3)
-            X_train = X_train.append(processed_text, ignore_index=True)
-            y_train = y_train.append(pd.Series([1]))
-            pipeline.fit(X_train, y_train)
-            st.write("Thank you for your contribution. We added that word into our system.")
-
diff --git a/spaces/ppsantiago/chatGPT/run_Windows.bat b/spaces/ppsantiago/chatGPT/run_Windows.bat
deleted file mode 100644
index 4c18f9ccaeea0af972301ffdf48778641221f76d..0000000000000000000000000000000000000000
--- a/spaces/ppsantiago/chatGPT/run_Windows.bat
+++ /dev/null
@@ -1,5 +0,0 @@
-@echo off
-echo Opening ChuanhuChatGPT...
-
-REM Open powershell via bat
-start powershell.exe -NoExit -Command "python ./ChuanhuChatbot.py"
diff --git a/spaces/prodia/sdxl-stable-diffusion-xl/README.md b/spaces/prodia/sdxl-stable-diffusion-xl/README.md
deleted file mode 100644
index a4b0216439d96ab59299af5666b64efeb3901673..0000000000000000000000000000000000000000
--- a/spaces/prodia/sdxl-stable-diffusion-xl/README.md
+++ /dev/null
@@ -1,13 +0,0 @@
----
-title: Fast Stable Diffusion XL (SDXL)
-emoji: 🔥
-colorFrom: yellow
-colorTo: gray
-sdk: gradio
-sdk_version: 3.42.0
-app_file: app.py
-pinned: false
-license: mit
----
-
-Prodia's Stable Diffusion XL Space.
diff --git a/spaces/profayle/TerrapinTalk/myenv/lib/python3.9/site-packages/click/termui.py b/spaces/profayle/TerrapinTalk/myenv/lib/python3.9/site-packages/click/termui.py
deleted file mode 100644
index db7a4b286174fdf26f3251631a2066eda2fa5bea..0000000000000000000000000000000000000000
--- a/spaces/profayle/TerrapinTalk/myenv/lib/python3.9/site-packages/click/termui.py
+++ /dev/null
@@ -1,784 +0,0 @@
-import inspect
-import io
-import itertools
-import sys
-import typing as t
-from gettext import gettext as _
-
-from ._compat import isatty
-from ._compat import strip_ansi
-from .exceptions import Abort
-from .exceptions import UsageError
-from .globals import resolve_color_default
-from .types import Choice
-from .types import convert_type
-from .types import ParamType
-from .utils import echo
-from .utils import LazyFile
-
-if t.TYPE_CHECKING:
-    from ._termui_impl import ProgressBar
-
-V = t.TypeVar("V")
-
-# The prompt functions to use.  The doc tools currently override these
-# functions to customize how they work.
-visible_prompt_func: t.Callable[[str], str] = input
-
-_ansi_colors = {
-    "black": 30,
-    "red": 31,
-    "green": 32,
-    "yellow": 33,
-    "blue": 34,
-    "magenta": 35,
-    "cyan": 36,
-    "white": 37,
-    "reset": 39,
-    "bright_black": 90,
-    "bright_red": 91,
-    "bright_green": 92,
-    "bright_yellow": 93,
-    "bright_blue": 94,
-    "bright_magenta": 95,
-    "bright_cyan": 96,
-    "bright_white": 97,
-}
-_ansi_reset_all = "\033[0m"
-
-
-def hidden_prompt_func(prompt: str) -> str:
-    import getpass
-
-    return getpass.getpass(prompt)
-
-
-def _build_prompt(
-    text: str,
-    suffix: str,
-    show_default: bool = False,
-    default: t.Optional[t.Any] = None,
-    show_choices: bool = True,
-    type: t.Optional[ParamType] = None,
-) -> str:
-    prompt = text
-    if type is not None and show_choices and isinstance(type, Choice):
-        prompt += f" ({', '.join(map(str, type.choices))})"
-    if default is not None and show_default:
-        prompt = f"{prompt} [{_format_default(default)}]"
-    return f"{prompt}{suffix}"
-
-
-def _format_default(default: t.Any) -> t.Any:
-    if isinstance(default, (io.IOBase, LazyFile)) and hasattr(default, "name"):
-        return default.name
-
-    return default
-
-
-def prompt(
-    text: str,
-    default: t.Optional[t.Any] = None,
-    hide_input: bool = False,
-    confirmation_prompt: t.Union[bool, str] = False,
-    type: t.Optional[t.Union[ParamType, t.Any]] = None,
-    value_proc: t.Optional[t.Callable[[str], t.Any]] = None,
-    prompt_suffix: str = ": ",
-    show_default: bool = True,
-    err: bool = False,
-    show_choices: bool = True,
-) -> t.Any:
-    """Prompts a user for input.  This is a convenience function that can
-    be used to prompt a user for input later.
-
-    If the user aborts the input by sending an interrupt signal, this
-    function will catch it and raise a :exc:`Abort` exception.
-
-    :param text: the text to show for the prompt.
-    :param default: the default value to use if no input happens.  If this
-                    is not given it will prompt until it's aborted.
-    :param hide_input: if this is set to true then the input value will
-                       be hidden.
-    :param confirmation_prompt: Prompt a second time to confirm the
-        value. Can be set to a string instead of ``True`` to customize
-        the message.
-    :param type: the type to use to check the value against.
-    :param value_proc: if this parameter is provided it's a function that
-                       is invoked instead of the type conversion to
-                       convert a value.
-    :param prompt_suffix: a suffix that should be added to the prompt.
-    :param show_default: shows or hides the default value in the prompt.
-    :param err: if set to true the file defaults to ``stderr`` instead of
-                ``stdout``, the same as with echo.
-    :param show_choices: Show or hide choices if the passed type is a Choice.
-                         For example if type is a Choice of either day or week,
-                         show_choices is true and text is "Group by" then the
-                         prompt will be "Group by (day, week): ".
-
-    .. versionadded:: 8.0
-        ``confirmation_prompt`` can be a custom string.
-
-    .. versionadded:: 7.0
-        Added the ``show_choices`` parameter.
-
-    .. versionadded:: 6.0
-        Added unicode support for cmd.exe on Windows.
-
-    .. versionadded:: 4.0
-        Added the `err` parameter.
-
-    """
-
-    def prompt_func(text: str) -> str:
-        f = hidden_prompt_func if hide_input else visible_prompt_func
-        try:
-            # Write the prompt separately so that we get nice
-            # coloring through colorama on Windows
-            echo(text.rstrip(" "), nl=False, err=err)
-            # Echo a space to stdout to work around an issue where
-            # readline causes backspace to clear the whole line.
-            return f(" ")
-        except (KeyboardInterrupt, EOFError):
-            # getpass doesn't print a newline if the user aborts input with ^C.
-            # Allegedly this behavior is inherited from getpass(3).
-            # A doc bug has been filed at https://bugs.python.org/issue24711
-            if hide_input:
-                echo(None, err=err)
-            raise Abort() from None
-
-    if value_proc is None:
-        value_proc = convert_type(type, default)
-
-    prompt = _build_prompt(
-        text, prompt_suffix, show_default, default, show_choices, type
-    )
-
-    if confirmation_prompt:
-        if confirmation_prompt is True:
-            confirmation_prompt = _("Repeat for confirmation")
-
-        confirmation_prompt = _build_prompt(confirmation_prompt, prompt_suffix)
-
-    while True:
-        while True:
-            value = prompt_func(prompt)
-            if value:
-                break
-            elif default is not None:
-                value = default
-                break
-        try:
-            result = value_proc(value)
-        except UsageError as e:
-            if hide_input:
-                echo(_("Error: The value you entered was invalid."), err=err)
-            else:
-                echo(_("Error: {e.message}").format(e=e), err=err)  # noqa: B306
-            continue
-        if not confirmation_prompt:
-            return result
-        while True:
-            value2 = prompt_func(confirmation_prompt)
-            is_empty = not value and not value2
-            if value2 or is_empty:
-                break
-        if value == value2:
-            return result
-        echo(_("Error: The two entered values do not match."), err=err)
-
-
-def confirm(
-    text: str,
-    default: t.Optional[bool] = False,
-    abort: bool = False,
-    prompt_suffix: str = ": ",
-    show_default: bool = True,
-    err: bool = False,
-) -> bool:
-    """Prompts for confirmation (yes/no question).
-
-    If the user aborts the input by sending a interrupt signal this
-    function will catch it and raise a :exc:`Abort` exception.
-
-    :param text: the question to ask.
-    :param default: The default value to use when no input is given. If
-        ``None``, repeat until input is given.
-    :param abort: if this is set to `True` a negative answer aborts the
-                  exception by raising :exc:`Abort`.
-    :param prompt_suffix: a suffix that should be added to the prompt.
-    :param show_default: shows or hides the default value in the prompt.
-    :param err: if set to true the file defaults to ``stderr`` instead of
-                ``stdout``, the same as with echo.
-
-    .. versionchanged:: 8.0
-        Repeat until input is given if ``default`` is ``None``.
-
-    .. versionadded:: 4.0
-        Added the ``err`` parameter.
-    """
-    prompt = _build_prompt(
-        text,
-        prompt_suffix,
-        show_default,
-        "y/n" if default is None else ("Y/n" if default else "y/N"),
-    )
-
-    while True:
-        try:
-            # Write the prompt separately so that we get nice
-            # coloring through colorama on Windows
-            echo(prompt.rstrip(" "), nl=False, err=err)
-            # Echo a space to stdout to work around an issue where
-            # readline causes backspace to clear the whole line.
-            value = visible_prompt_func(" ").lower().strip()
-        except (KeyboardInterrupt, EOFError):
-            raise Abort() from None
-        if value in ("y", "yes"):
-            rv = True
-        elif value in ("n", "no"):
-            rv = False
-        elif default is not None and value == "":
-            rv = default
-        else:
-            echo(_("Error: invalid input"), err=err)
-            continue
-        break
-    if abort and not rv:
-        raise Abort()
-    return rv
-
-
-def echo_via_pager(
-    text_or_generator: t.Union[t.Iterable[str], t.Callable[[], t.Iterable[str]], str],
-    color: t.Optional[bool] = None,
-) -> None:
-    """This function takes a text and shows it via an environment specific
-    pager on stdout.
-
-    .. versionchanged:: 3.0
-       Added the `color` flag.
-
-    :param text_or_generator: the text to page, or alternatively, a
-                              generator emitting the text to page.
-    :param color: controls if the pager supports ANSI colors or not.  The
-                  default is autodetection.
-    """
-    color = resolve_color_default(color)
-
-    if inspect.isgeneratorfunction(text_or_generator):
-        i = t.cast(t.Callable[[], t.Iterable[str]], text_or_generator)()
-    elif isinstance(text_or_generator, str):
-        i = [text_or_generator]
-    else:
-        i = iter(t.cast(t.Iterable[str], text_or_generator))
-
-    # convert every element of i to a text type if necessary
-    text_generator = (el if isinstance(el, str) else str(el) for el in i)
-
-    from ._termui_impl import pager
-
-    return pager(itertools.chain(text_generator, "\n"), color)
-
-
-def progressbar(
-    iterable: t.Optional[t.Iterable[V]] = None,
-    length: t.Optional[int] = None,
-    label: t.Optional[str] = None,
-    show_eta: bool = True,
-    show_percent: t.Optional[bool] = None,
-    show_pos: bool = False,
-    item_show_func: t.Optional[t.Callable[[t.Optional[V]], t.Optional[str]]] = None,
-    fill_char: str = "#",
-    empty_char: str = "-",
-    bar_template: str = "%(label)s  [%(bar)s]  %(info)s",
-    info_sep: str = "  ",
-    width: int = 36,
-    file: t.Optional[t.TextIO] = None,
-    color: t.Optional[bool] = None,
-    update_min_steps: int = 1,
-) -> "ProgressBar[V]":
-    """This function creates an iterable context manager that can be used
-    to iterate over something while showing a progress bar.  It will
-    either iterate over the `iterable` or `length` items (that are counted
-    up).  While iteration happens, this function will print a rendered
-    progress bar to the given `file` (defaults to stdout) and will attempt
-    to calculate remaining time and more.  By default, this progress bar
-    will not be rendered if the file is not a terminal.
-
-    The context manager creates the progress bar.  When the context
-    manager is entered the progress bar is already created.  With every
-    iteration over the progress bar, the iterable passed to the bar is
-    advanced and the bar is updated.  When the context manager exits,
-    a newline is printed and the progress bar is finalized on screen.
-
-    Note: The progress bar is currently designed for use cases where the
-    total progress can be expected to take at least several seconds.
-    Because of this, the ProgressBar class object won't display
-    progress that is considered too fast, and progress where the time
-    between steps is less than a second.
-
-    No printing must happen or the progress bar will be unintentionally
-    destroyed.
-
-    Example usage::
-
-        with progressbar(items) as bar:
-            for item in bar:
-                do_something_with(item)
-
-    Alternatively, if no iterable is specified, one can manually update the
-    progress bar through the `update()` method instead of directly
-    iterating over the progress bar.  The update method accepts the number
-    of steps to increment the bar with::
-
-        with progressbar(length=chunks.total_bytes) as bar:
-            for chunk in chunks:
-                process_chunk(chunk)
-                bar.update(chunks.bytes)
-
-    The ``update()`` method also takes an optional value specifying the
-    ``current_item`` at the new position. This is useful when used
-    together with ``item_show_func`` to customize the output for each
-    manual step::
-
-        with click.progressbar(
-            length=total_size,
-            label='Unzipping archive',
-            item_show_func=lambda a: a.filename
-        ) as bar:
-            for archive in zip_file:
-                archive.extract()
-                bar.update(archive.size, archive)
-
-    :param iterable: an iterable to iterate over.  If not provided the length
-                     is required.
-    :param length: the number of items to iterate over.  By default the
-                   progressbar will attempt to ask the iterator about its
-                   length, which might or might not work.  If an iterable is
-                   also provided this parameter can be used to override the
-                   length.  If an iterable is not provided the progress bar
-                   will iterate over a range of that length.
-    :param label: the label to show next to the progress bar.
-    :param show_eta: enables or disables the estimated time display.  This is
-                     automatically disabled if the length cannot be
-                     determined.
-    :param show_percent: enables or disables the percentage display.  The
-                         default is `True` if the iterable has a length or
-                         `False` if not.
-    :param show_pos: enables or disables the absolute position display.  The
-                     default is `False`.
-    :param item_show_func: A function called with the current item which
-        can return a string to show next to the progress bar. If the
-        function returns ``None`` nothing is shown. The current item can
-        be ``None``, such as when entering and exiting the bar.
-    :param fill_char: the character to use to show the filled part of the
-                      progress bar.
-    :param empty_char: the character to use to show the non-filled part of
-                       the progress bar.
-    :param bar_template: the format string to use as template for the bar.
-                         The parameters in it are ``label`` for the label,
-                         ``bar`` for the progress bar and ``info`` for the
-                         info section.
-    :param info_sep: the separator between multiple info items (eta etc.)
-    :param width: the width of the progress bar in characters, 0 means full
-                  terminal width
-    :param file: The file to write to. If this is not a terminal then
-        only the label is printed.
-    :param color: controls if the terminal supports ANSI colors or not.  The
-                  default is autodetection.  This is only needed if ANSI
-                  codes are included anywhere in the progress bar output
-                  which is not the case by default.
-    :param update_min_steps: Render only when this many updates have
-        completed. This allows tuning for very fast iterators.
-
-    .. versionchanged:: 8.0
-        Output is shown even if execution time is less than 0.5 seconds.
-
-    .. versionchanged:: 8.0
-        ``item_show_func`` shows the current item, not the previous one.
-
-    .. versionchanged:: 8.0
-        Labels are echoed if the output is not a TTY. Reverts a change
-        in 7.0 that removed all output.
-
-    .. versionadded:: 8.0
-       Added the ``update_min_steps`` parameter.
-
-    .. versionchanged:: 4.0
-        Added the ``color`` parameter. Added the ``update`` method to
-        the object.
-
-    .. versionadded:: 2.0
-    """
-    from ._termui_impl import ProgressBar
-
-    color = resolve_color_default(color)
-    return ProgressBar(
-        iterable=iterable,
-        length=length,
-        show_eta=show_eta,
-        show_percent=show_percent,
-        show_pos=show_pos,
-        item_show_func=item_show_func,
-        fill_char=fill_char,
-        empty_char=empty_char,
-        bar_template=bar_template,
-        info_sep=info_sep,
-        file=file,
-        label=label,
-        width=width,
-        color=color,
-        update_min_steps=update_min_steps,
-    )
-
-
-def clear() -> None:
-    """Clears the terminal screen.  This will have the effect of clearing
-    the whole visible space of the terminal and moving the cursor to the
-    top left.  This does not do anything if not connected to a terminal.
-
-    .. versionadded:: 2.0
-    """
-    if not isatty(sys.stdout):
-        return
-
-    # ANSI escape \033[2J clears the screen, \033[1;1H moves the cursor
-    echo("\033[2J\033[1;1H", nl=False)
-
-
-def _interpret_color(
-    color: t.Union[int, t.Tuple[int, int, int], str], offset: int = 0
-) -> str:
-    if isinstance(color, int):
-        return f"{38 + offset};5;{color:d}"
-
-    if isinstance(color, (tuple, list)):
-        r, g, b = color
-        return f"{38 + offset};2;{r:d};{g:d};{b:d}"
-
-    return str(_ansi_colors[color] + offset)
-
-
-def style(
-    text: t.Any,
-    fg: t.Optional[t.Union[int, t.Tuple[int, int, int], str]] = None,
-    bg: t.Optional[t.Union[int, t.Tuple[int, int, int], str]] = None,
-    bold: t.Optional[bool] = None,
-    dim: t.Optional[bool] = None,
-    underline: t.Optional[bool] = None,
-    overline: t.Optional[bool] = None,
-    italic: t.Optional[bool] = None,
-    blink: t.Optional[bool] = None,
-    reverse: t.Optional[bool] = None,
-    strikethrough: t.Optional[bool] = None,
-    reset: bool = True,
-) -> str:
-    """Styles a text with ANSI styles and returns the new string.  By
-    default the styling is self contained which means that at the end
-    of the string a reset code is issued.  This can be prevented by
-    passing ``reset=False``.
-
-    Examples::
-
-        click.echo(click.style('Hello World!', fg='green'))
-        click.echo(click.style('ATTENTION!', blink=True))
-        click.echo(click.style('Some things', reverse=True, fg='cyan'))
-        click.echo(click.style('More colors', fg=(255, 12, 128), bg=117))
-
-    Supported color names:
-
-    * ``black`` (might be a gray)
-    * ``red``
-    * ``green``
-    * ``yellow`` (might be an orange)
-    * ``blue``
-    * ``magenta``
-    * ``cyan``
-    * ``white`` (might be light gray)
-    * ``bright_black``
-    * ``bright_red``
-    * ``bright_green``
-    * ``bright_yellow``
-    * ``bright_blue``
-    * ``bright_magenta``
-    * ``bright_cyan``
-    * ``bright_white``
-    * ``reset`` (reset the color code only)
-
-    If the terminal supports it, color may also be specified as:
-
-    -   An integer in the interval [0, 255]. The terminal must support
-        8-bit/256-color mode.
-    -   An RGB tuple of three integers in [0, 255]. The terminal must
-        support 24-bit/true-color mode.
-
-    See https://en.wikipedia.org/wiki/ANSI_color and
-    https://gist.github.com/XVilka/8346728 for more information.
-
-    :param text: the string to style with ansi codes.
-    :param fg: if provided this will become the foreground color.
-    :param bg: if provided this will become the background color.
-    :param bold: if provided this will enable or disable bold mode.
-    :param dim: if provided this will enable or disable dim mode.  This is
-                badly supported.
-    :param underline: if provided this will enable or disable underline.
-    :param overline: if provided this will enable or disable overline.
-    :param italic: if provided this will enable or disable italic.
-    :param blink: if provided this will enable or disable blinking.
-    :param reverse: if provided this will enable or disable inverse
-                    rendering (foreground becomes background and the
-                    other way round).
-    :param strikethrough: if provided this will enable or disable
-        striking through text.
-    :param reset: by default a reset-all code is added at the end of the
-                  string which means that styles do not carry over.  This
-                  can be disabled to compose styles.
-
-    .. versionchanged:: 8.0
-        A non-string ``message`` is converted to a string.
-
-    .. versionchanged:: 8.0
-       Added support for 256 and RGB color codes.
-
-    .. versionchanged:: 8.0
-        Added the ``strikethrough``, ``italic``, and ``overline``
-        parameters.
-
-    .. versionchanged:: 7.0
-        Added support for bright colors.
-
-    .. versionadded:: 2.0
-    """
-    if not isinstance(text, str):
-        text = str(text)
-
-    bits = []
-
-    if fg:
-        try:
-            bits.append(f"\033[{_interpret_color(fg)}m")
-        except KeyError:
-            raise TypeError(f"Unknown color {fg!r}") from None
-
-    if bg:
-        try:
-            bits.append(f"\033[{_interpret_color(bg, 10)}m")
-        except KeyError:
-            raise TypeError(f"Unknown color {bg!r}") from None
-
-    if bold is not None:
-        bits.append(f"\033[{1 if bold else 22}m")
-    if dim is not None:
-        bits.append(f"\033[{2 if dim else 22}m")
-    if underline is not None:
-        bits.append(f"\033[{4 if underline else 24}m")
-    if overline is not None:
-        bits.append(f"\033[{53 if overline else 55}m")
-    if italic is not None:
-        bits.append(f"\033[{3 if italic else 23}m")
-    if blink is not None:
-        bits.append(f"\033[{5 if blink else 25}m")
-    if reverse is not None:
-        bits.append(f"\033[{7 if reverse else 27}m")
-    if strikethrough is not None:
-        bits.append(f"\033[{9 if strikethrough else 29}m")
-    bits.append(text)
-    if reset:
-        bits.append(_ansi_reset_all)
-    return "".join(bits)
-
-
-def unstyle(text: str) -> str:
-    """Removes ANSI styling information from a string.  Usually it's not
-    necessary to use this function as Click's echo function will
-    automatically remove styling if necessary.
-
-    .. versionadded:: 2.0
-
-    :param text: the text to remove style information from.
-    """
-    return strip_ansi(text)
-
-
-def secho(
-    message: t.Optional[t.Any] = None,
-    file: t.Optional[t.IO[t.AnyStr]] = None,
-    nl: bool = True,
-    err: bool = False,
-    color: t.Optional[bool] = None,
-    **styles: t.Any,
-) -> None:
-    """This function combines :func:`echo` and :func:`style` into one
-    call.  As such the following two calls are the same::
-
-        click.secho('Hello World!', fg='green')
-        click.echo(click.style('Hello World!', fg='green'))
-
-    All keyword arguments are forwarded to the underlying functions
-    depending on which one they go with.
-
-    Non-string types will be converted to :class:`str`. However,
-    :class:`bytes` are passed directly to :meth:`echo` without applying
-    style. If you want to style bytes that represent text, call
-    :meth:`bytes.decode` first.
-
-    .. versionchanged:: 8.0
-        A non-string ``message`` is converted to a string. Bytes are
-        passed through without style applied.
-
-    .. versionadded:: 2.0
-    """
-    if message is not None and not isinstance(message, (bytes, bytearray)):
-        message = style(message, **styles)
-
-    return echo(message, file=file, nl=nl, err=err, color=color)
-
-
-def edit(
-    text: t.Optional[t.AnyStr] = None,
-    editor: t.Optional[str] = None,
-    env: t.Optional[t.Mapping[str, str]] = None,
-    require_save: bool = True,
-    extension: str = ".txt",
-    filename: t.Optional[str] = None,
-) -> t.Optional[t.AnyStr]:
-    r"""Edits the given text in the defined editor.  If an editor is given
-    (should be the full path to the executable but the regular operating
-    system search path is used for finding the executable) it overrides
-    the detected editor.  Optionally, some environment variables can be
-    used.  If the editor is closed without changes, `None` is returned.  In
-    case a file is edited directly the return value is always `None` and
-    `require_save` and `extension` are ignored.
-
-    If the editor cannot be opened a :exc:`UsageError` is raised.
-
-    Note for Windows: to simplify cross-platform usage, the newlines are
-    automatically converted from POSIX to Windows and vice versa.  As such,
-    the message here will have ``\n`` as newline markers.
-
-    :param text: the text to edit.
-    :param editor: optionally the editor to use.  Defaults to automatic
-                   detection.
-    :param env: environment variables to forward to the editor.
-    :param require_save: if this is true, then not saving in the editor
-                         will make the return value become `None`.
-    :param extension: the extension to tell the editor about.  This defaults
-                      to `.txt` but changing this might change syntax
-                      highlighting.
-    :param filename: if provided it will edit this file instead of the
-                     provided text contents.  It will not use a temporary
-                     file as an indirection in that case.
-    """
-    from ._termui_impl import Editor
-
-    ed = Editor(editor=editor, env=env, require_save=require_save, extension=extension)
-
-    if filename is None:
-        return ed.edit(text)
-
-    ed.edit_file(filename)
-    return None
-
-
-def launch(url: str, wait: bool = False, locate: bool = False) -> int:
-    """This function launches the given URL (or filename) in the default
-    viewer application for this file type.  If this is an executable, it
-    might launch the executable in a new session.  The return value is
-    the exit code of the launched application.  Usually, ``0`` indicates
-    success.
-
-    Examples::
-
-        click.launch('https://click.palletsprojects.com/')
-        click.launch('/my/downloaded/file', locate=True)
-
-    .. versionadded:: 2.0
-
-    :param url: URL or filename of the thing to launch.
-    :param wait: Wait for the program to exit before returning. This
-        only works if the launched program blocks. In particular,
-        ``xdg-open`` on Linux does not block.
-    :param locate: if this is set to `True` then instead of launching the
-                   application associated with the URL it will attempt to
-                   launch a file manager with the file located.  This
-                   might have weird effects if the URL does not point to
-                   the filesystem.
-    """
-    from ._termui_impl import open_url
-
-    return open_url(url, wait=wait, locate=locate)
-
-
-# If this is provided, getchar() calls into this instead.  This is used
-# for unittesting purposes.
-_getchar: t.Optional[t.Callable[[bool], str]] = None
-
-
-def getchar(echo: bool = False) -> str:
-    """Fetches a single character from the terminal and returns it.  This
-    will always return a unicode character and under certain rare
-    circumstances this might return more than one character.  The
-    situations which more than one character is returned is when for
-    whatever reason multiple characters end up in the terminal buffer or
-    standard input was not actually a terminal.
-
-    Note that this will always read from the terminal, even if something
-    is piped into the standard input.
-
-    Note for Windows: in rare cases when typing non-ASCII characters, this
-    function might wait for a second character and then return both at once.
-    This is because certain Unicode characters look like special-key markers.
-
-    .. versionadded:: 2.0
-
-    :param echo: if set to `True`, the character read will also show up on
-                 the terminal.  The default is to not show it.
-    """
-    global _getchar
-
-    if _getchar is None:
-        from ._termui_impl import getchar as f
-
-        _getchar = f
-
-    return _getchar(echo)
-
-
-def raw_terminal() -> t.ContextManager[int]:
-    from ._termui_impl import raw_terminal as f
-
-    return f()
-
-
-def pause(info: t.Optional[str] = None, err: bool = False) -> None:
-    """This command stops execution and waits for the user to press any
-    key to continue.  This is similar to the Windows batch "pause"
-    command.  If the program is not run through a terminal, this command
-    will instead do nothing.
-
-    .. versionadded:: 2.0
-
-    .. versionadded:: 4.0
-       Added the `err` parameter.
-
-    :param info: The message to print before pausing. Defaults to
-        ``"Press any key to continue..."``.
-    :param err: if set to message goes to ``stderr`` instead of
-                ``stdout``, the same as with echo.
-    """
-    if not isatty(sys.stdin) or not isatty(sys.stdout):
-        return
-
-    if info is None:
-        info = _("Press any key to continue...")
-
-    try:
-        if info:
-            echo(info, nl=False, err=err)
-        try:
-            getchar()
-        except (KeyboardInterrupt, EOFError):
-            pass
-    finally:
-        if info:
-            echo(err=err)
diff --git a/spaces/profayle/TerrapinTalk/myenv/lib/python3.9/site-packages/fontTools/ttLib/removeOverlaps.py b/spaces/profayle/TerrapinTalk/myenv/lib/python3.9/site-packages/fontTools/ttLib/removeOverlaps.py
deleted file mode 100644
index 624cd47b4076a95cbc7c2124550371f6ffa5ea37..0000000000000000000000000000000000000000
--- a/spaces/profayle/TerrapinTalk/myenv/lib/python3.9/site-packages/fontTools/ttLib/removeOverlaps.py
+++ /dev/null
@@ -1,248 +0,0 @@
-""" Simplify TrueType glyphs by merging overlapping contours/components.
-
-Requires https://github.com/fonttools/skia-pathops
-"""
-
-import itertools
-import logging
-from typing import Callable, Iterable, Optional, Mapping
-
-from fontTools.misc.roundTools import otRound
-from fontTools.ttLib import ttFont
-from fontTools.ttLib.tables import _g_l_y_f
-from fontTools.ttLib.tables import _h_m_t_x
-from fontTools.pens.ttGlyphPen import TTGlyphPen
-
-import pathops
-
-
-__all__ = ["removeOverlaps"]
-
-
-class RemoveOverlapsError(Exception):
-    pass
-
-
-log = logging.getLogger("fontTools.ttLib.removeOverlaps")
-
-_TTGlyphMapping = Mapping[str, ttFont._TTGlyph]
-
-
-def skPathFromGlyph(glyphName: str, glyphSet: _TTGlyphMapping) -> pathops.Path:
-    path = pathops.Path()
-    pathPen = path.getPen(glyphSet=glyphSet)
-    glyphSet[glyphName].draw(pathPen)
-    return path
-
-
-def skPathFromGlyphComponent(
-    component: _g_l_y_f.GlyphComponent, glyphSet: _TTGlyphMapping
-):
-    baseGlyphName, transformation = component.getComponentInfo()
-    path = skPathFromGlyph(baseGlyphName, glyphSet)
-    return path.transform(*transformation)
-
-
-def componentsOverlap(glyph: _g_l_y_f.Glyph, glyphSet: _TTGlyphMapping) -> bool:
-    if not glyph.isComposite():
-        raise ValueError("This method only works with TrueType composite glyphs")
-    if len(glyph.components) < 2:
-        return False  # single component, no overlaps
-
-    component_paths = {}
-
-    def _get_nth_component_path(index: int) -> pathops.Path:
-        if index not in component_paths:
-            component_paths[index] = skPathFromGlyphComponent(
-                glyph.components[index], glyphSet
-            )
-        return component_paths[index]
-
-    return any(
-        pathops.op(
-            _get_nth_component_path(i),
-            _get_nth_component_path(j),
-            pathops.PathOp.INTERSECTION,
-            fix_winding=False,
-            keep_starting_points=False,
-        )
-        for i, j in itertools.combinations(range(len(glyph.components)), 2)
-    )
-
-
-def ttfGlyphFromSkPath(path: pathops.Path) -> _g_l_y_f.Glyph:
-    # Skia paths have no 'components', no need for glyphSet
-    ttPen = TTGlyphPen(glyphSet=None)
-    path.draw(ttPen)
-    glyph = ttPen.glyph()
-    assert not glyph.isComposite()
-    # compute glyph.xMin (glyfTable parameter unused for non composites)
-    glyph.recalcBounds(glyfTable=None)
-    return glyph
-
-
-def _round_path(
-    path: pathops.Path, round: Callable[[float], float] = otRound
-) -> pathops.Path:
-    rounded_path = pathops.Path()
-    for verb, points in path:
-        rounded_path.add(verb, *((round(p[0]), round(p[1])) for p in points))
-    return rounded_path
-
-
-def _simplify(path: pathops.Path, debugGlyphName: str) -> pathops.Path:
-    # skia-pathops has a bug where it sometimes fails to simplify paths when there
-    # are float coordinates and control points are very close to one another.
-    # Rounding coordinates to integers works around the bug.
-    # Since we are going to round glyf coordinates later on anyway, here it is
-    # ok(-ish) to also round before simplify. Better than failing the whole process
-    # for the entire font.
-    # https://bugs.chromium.org/p/skia/issues/detail?id=11958
-    # https://github.com/google/fonts/issues/3365
-    # TODO(anthrotype): remove once this Skia bug is fixed
-    try:
-        return pathops.simplify(path, clockwise=path.clockwise)
-    except pathops.PathOpsError:
-        pass
-
-    path = _round_path(path)
-    try:
-        path = pathops.simplify(path, clockwise=path.clockwise)
-        log.debug(
-            "skia-pathops failed to simplify '%s' with float coordinates, "
-            "but succeded using rounded integer coordinates",
-            debugGlyphName,
-        )
-        return path
-    except pathops.PathOpsError as e:
-        if log.isEnabledFor(logging.DEBUG):
-            path.dump()
-        raise RemoveOverlapsError(
-            f"Failed to remove overlaps from glyph {debugGlyphName!r}"
-        ) from e
-
-    raise AssertionError("Unreachable")
-
-
-def removeTTGlyphOverlaps(
-    glyphName: str,
-    glyphSet: _TTGlyphMapping,
-    glyfTable: _g_l_y_f.table__g_l_y_f,
-    hmtxTable: _h_m_t_x.table__h_m_t_x,
-    removeHinting: bool = True,
-) -> bool:
-    glyph = glyfTable[glyphName]
-    # decompose composite glyphs only if components overlap each other
-    if (
-        glyph.numberOfContours > 0
-        or glyph.isComposite()
-        and componentsOverlap(glyph, glyphSet)
-    ):
-        path = skPathFromGlyph(glyphName, glyphSet)
-
-        # remove overlaps
-        path2 = _simplify(path, glyphName)
-
-        # replace TTGlyph if simplified path is different (ignoring contour order)
-        if {tuple(c) for c in path.contours} != {tuple(c) for c in path2.contours}:
-            glyfTable[glyphName] = glyph = ttfGlyphFromSkPath(path2)
-            # simplified glyph is always unhinted
-            assert not glyph.program
-            # also ensure hmtx LSB == glyph.xMin so glyph origin is at x=0
-            width, lsb = hmtxTable[glyphName]
-            if lsb != glyph.xMin:
-                hmtxTable[glyphName] = (width, glyph.xMin)
-            return True
-
-    if removeHinting:
-        glyph.removeHinting()
-    return False
-
-
-def removeOverlaps(
-    font: ttFont.TTFont,
-    glyphNames: Optional[Iterable[str]] = None,
-    removeHinting: bool = True,
-    ignoreErrors=False,
-) -> None:
-    """Simplify glyphs in TTFont by merging overlapping contours.
-
-    Overlapping components are first decomposed to simple contours, then merged.
-
-    Currently this only works with TrueType fonts with 'glyf' table.
-    Raises NotImplementedError if 'glyf' table is absent.
-
-    Note that removing overlaps invalidates the hinting. By default we drop hinting
-    from all glyphs whether or not overlaps are removed from a given one, as it would
-    look weird if only some glyphs are left (un)hinted.
-
-    Args:
-        font: input TTFont object, modified in place.
-        glyphNames: optional iterable of glyph names (str) to remove overlaps from.
-            By default, all glyphs in the font are processed.
-        removeHinting (bool): set to False to keep hinting for unmodified glyphs.
-        ignoreErrors (bool): set to True to ignore errors while removing overlaps,
-            thus keeping the tricky glyphs unchanged (fonttools/fonttools#2363).
-    """
-    try:
-        glyfTable = font["glyf"]
-    except KeyError:
-        raise NotImplementedError("removeOverlaps currently only works with TTFs")
-
-    hmtxTable = font["hmtx"]
-    # wraps the underlying glyf Glyphs, takes care of interfacing with drawing pens
-    glyphSet = font.getGlyphSet()
-
-    if glyphNames is None:
-        glyphNames = font.getGlyphOrder()
-
-    # process all simple glyphs first, then composites with increasing component depth,
-    # so that by the time we test for component intersections the respective base glyphs
-    # have already been simplified
-    glyphNames = sorted(
-        glyphNames,
-        key=lambda name: (
-            glyfTable[name].getCompositeMaxpValues(glyfTable).maxComponentDepth
-            if glyfTable[name].isComposite()
-            else 0,
-            name,
-        ),
-    )
-    modified = set()
-    for glyphName in glyphNames:
-        try:
-            if removeTTGlyphOverlaps(
-                glyphName, glyphSet, glyfTable, hmtxTable, removeHinting
-            ):
-                modified.add(glyphName)
-        except RemoveOverlapsError:
-            if not ignoreErrors:
-                raise
-            log.error("Failed to remove overlaps for '%s'", glyphName)
-
-    log.debug("Removed overlaps for %s glyphs:\n%s", len(modified), " ".join(modified))
-
-
-def main(args=None):
-    import sys
-
-    if args is None:
-        args = sys.argv[1:]
-
-    if len(args) < 2:
-        print(
-            f"usage: fonttools ttLib.removeOverlaps INPUT.ttf OUTPUT.ttf [GLYPHS ...]"
-        )
-        sys.exit(1)
-
-    src = args[0]
-    dst = args[1]
-    glyphNames = args[2:] or None
-
-    with ttFont.TTFont(src) as f:
-        removeOverlaps(f, glyphNames)
-        f.save(dst)
-
-
-if __name__ == "__main__":
-    main()
diff --git a/spaces/profayle/TerrapinTalk/myenv/lib/python3.9/site-packages/fontTools/ttLib/tables/J_S_T_F_.py b/spaces/profayle/TerrapinTalk/myenv/lib/python3.9/site-packages/fontTools/ttLib/tables/J_S_T_F_.py
deleted file mode 100644
index 111c700710e56f1f92703b212b530267313293ba..0000000000000000000000000000000000000000
--- a/spaces/profayle/TerrapinTalk/myenv/lib/python3.9/site-packages/fontTools/ttLib/tables/J_S_T_F_.py
+++ /dev/null
@@ -1,5 +0,0 @@
-from .otBase import BaseTTXConverter
-
-
-class table_J_S_T_F_(BaseTTXConverter):
-    pass
diff --git a/spaces/profayle/TerrapinTalk/myenv/lib/python3.9/site-packages/numpy/distutils/tests/test_fcompiler_gnu.py b/spaces/profayle/TerrapinTalk/myenv/lib/python3.9/site-packages/numpy/distutils/tests/test_fcompiler_gnu.py
deleted file mode 100644
index 0817ae58c2140e912eaf3d61e040050016dede54..0000000000000000000000000000000000000000
--- a/spaces/profayle/TerrapinTalk/myenv/lib/python3.9/site-packages/numpy/distutils/tests/test_fcompiler_gnu.py
+++ /dev/null
@@ -1,55 +0,0 @@
-from numpy.testing import assert_
-
-import numpy.distutils.fcompiler
-
-g77_version_strings = [
-    ('GNU Fortran 0.5.25 20010319 (prerelease)', '0.5.25'),
-    ('GNU Fortran (GCC 3.2) 3.2 20020814 (release)', '3.2'),
-    ('GNU Fortran (GCC) 3.3.3 20040110 (prerelease) (Debian)', '3.3.3'),
-    ('GNU Fortran (GCC) 3.3.3 (Debian 20040401)', '3.3.3'),
-    ('GNU Fortran (GCC 3.2.2 20030222 (Red Hat Linux 3.2.2-5)) 3.2.2'
-       ' 20030222 (Red Hat Linux 3.2.2-5)', '3.2.2'),
-]
-
-gfortran_version_strings = [
-    ('GNU Fortran 95 (GCC 4.0.3 20051023 (prerelease) (Debian 4.0.2-3))',
-     '4.0.3'),
-    ('GNU Fortran 95 (GCC) 4.1.0', '4.1.0'),
-    ('GNU Fortran 95 (GCC) 4.2.0 20060218 (experimental)', '4.2.0'),
-    ('GNU Fortran (GCC) 4.3.0 20070316 (experimental)', '4.3.0'),
-    ('GNU Fortran (rubenvb-4.8.0) 4.8.0', '4.8.0'),
-    ('4.8.0', '4.8.0'),
-    ('4.0.3-7', '4.0.3'),
-    ("gfortran: warning: couldn't understand kern.osversion '14.1.0\n4.9.1",
-     '4.9.1'),
-    ("gfortran: warning: couldn't understand kern.osversion '14.1.0\n"
-     "gfortran: warning: yet another warning\n4.9.1",
-     '4.9.1'),
-    ('GNU Fortran (crosstool-NG 8a21ab48) 7.2.0', '7.2.0')
-]
-
-class TestG77Versions:
-    def test_g77_version(self):
-        fc = numpy.distutils.fcompiler.new_fcompiler(compiler='gnu')
-        for vs, version in g77_version_strings:
-            v = fc.version_match(vs)
-            assert_(v == version, (vs, v))
-
-    def test_not_g77(self):
-        fc = numpy.distutils.fcompiler.new_fcompiler(compiler='gnu')
-        for vs, _ in gfortran_version_strings:
-            v = fc.version_match(vs)
-            assert_(v is None, (vs, v))
-
-class TestGFortranVersions:
-    def test_gfortran_version(self):
-        fc = numpy.distutils.fcompiler.new_fcompiler(compiler='gnu95')
-        for vs, version in gfortran_version_strings:
-            v = fc.version_match(vs)
-            assert_(v == version, (vs, v))
-
-    def test_not_gfortran(self):
-        fc = numpy.distutils.fcompiler.new_fcompiler(compiler='gnu95')
-        for vs, _ in g77_version_strings:
-            v = fc.version_match(vs)
-            assert_(v is None, (vs, v))
diff --git a/spaces/profayle/TerrapinTalk/myenv/lib/python3.9/site-packages/numpy/f2py/tests/test_common.py b/spaces/profayle/TerrapinTalk/myenv/lib/python3.9/site-packages/numpy/f2py/tests/test_common.py
deleted file mode 100644
index 8a4b221ef8bd51c7e6b9528fc10215a4c8fdbcdb..0000000000000000000000000000000000000000
--- a/spaces/profayle/TerrapinTalk/myenv/lib/python3.9/site-packages/numpy/f2py/tests/test_common.py
+++ /dev/null
@@ -1,18 +0,0 @@
-import os
-import sys
-import pytest
-
-import numpy as np
-from . import util
-
-
-class TestCommonBlock(util.F2PyTest):
-    sources = [util.getpath("tests", "src", "common", "block.f")]
-
-    @pytest.mark.skipif(sys.platform == "win32",
-                        reason="Fails with MinGW64 Gfortran (Issue #9673)")
-    def test_common_block(self):
-        self.module.initcb()
-        assert self.module.block.long_bn == np.array(1.0, dtype=np.float64)
-        assert self.module.block.string_bn == np.array("2", dtype="|S1")
-        assert self.module.block.ok == np.array(3, dtype=np.int32)
diff --git a/spaces/profayle/TerrapinTalk/myenv/lib/python3.9/site-packages/openai/api_resources/abstract/paginatable_api_resource.py b/spaces/profayle/TerrapinTalk/myenv/lib/python3.9/site-packages/openai/api_resources/abstract/paginatable_api_resource.py
deleted file mode 100644
index 2d75744f2320721bcbb378c7a3358f027fbe0788..0000000000000000000000000000000000000000
--- a/spaces/profayle/TerrapinTalk/myenv/lib/python3.9/site-packages/openai/api_resources/abstract/paginatable_api_resource.py
+++ /dev/null
@@ -1,125 +0,0 @@
-from openai import api_requestor, error, util
-from openai.api_resources.abstract.listable_api_resource import ListableAPIResource
-from openai.util import ApiType
-
-
-class PaginatableAPIResource(ListableAPIResource):
-    @classmethod
-    def auto_paging_iter(cls, *args, **params):
-        next_cursor = None
-        has_more = True
-        if not params.get("limit"):
-            params["limit"] = 20
-        while has_more:
-            if next_cursor:
-                params["after"] = next_cursor
-            response = cls.list(*args, **params)
-
-            for item in response.data:
-                yield item
-
-            if response.data:
-                next_cursor = response.data[-1].id
-            has_more = response.has_more
-
-    @classmethod
-    def __prepare_list_requestor(
-        cls,
-        api_key=None,
-        api_version=None,
-        organization=None,
-        api_base=None,
-        api_type=None,
-    ):
-        requestor = api_requestor.APIRequestor(
-            api_key,
-            api_base=api_base or cls.api_base(),
-            api_version=api_version,
-            api_type=api_type,
-            organization=organization,
-        )
-
-        typed_api_type, api_version = cls._get_api_type_and_version(
-            api_type, api_version
-        )
-
-        if typed_api_type in (ApiType.AZURE, ApiType.AZURE_AD):
-            base = cls.class_url()
-            url = "/%s%s?api-version=%s" % (cls.azure_api_prefix, base, api_version)
-        elif typed_api_type == ApiType.OPEN_AI:
-            url = cls.class_url()
-        else:
-            raise error.InvalidAPIType("Unsupported API type %s" % api_type)
-        return requestor, url
-
-    @classmethod
-    def list(
-        cls,
-        limit=None,
-        starting_after=None,
-        api_key=None,
-        request_id=None,
-        api_version=None,
-        organization=None,
-        api_base=None,
-        api_type=None,
-        **params,
-    ):
-        requestor, url = cls.__prepare_list_requestor(
-            api_key,
-            api_version,
-            organization,
-            api_base,
-            api_type,
-        )
-
-        params = {
-            **params,
-            "limit": limit,
-            "starting_after": starting_after,
-        }
-
-        response, _, api_key = requestor.request(
-            "get", url, params, request_id=request_id
-        )
-        openai_object = util.convert_to_openai_object(
-            response, api_key, api_version, organization
-        )
-        openai_object._retrieve_params = params
-        return openai_object
-
-    @classmethod
-    async def alist(
-        cls,
-        limit=None,
-        starting_after=None,
-        api_key=None,
-        request_id=None,
-        api_version=None,
-        organization=None,
-        api_base=None,
-        api_type=None,
-        **params,
-    ):
-        requestor, url = cls.__prepare_list_requestor(
-            api_key,
-            api_version,
-            organization,
-            api_base,
-            api_type,
-        )
-
-        params = {
-            **params,
-            "limit": limit,
-            "starting_after": starting_after,
-        }
-
-        response, _, api_key = await requestor.arequest(
-            "get", url, params, request_id=request_id
-        )
-        openai_object = util.convert_to_openai_object(
-            response, api_key, api_version, organization
-        )
-        openai_object._retrieve_params = params
-        return openai_object
diff --git a/spaces/profayle/TerrapinTalk/myenv/lib/python3.9/site-packages/pandas/tests/dtypes/cast/test_construct_object_arr.py b/spaces/profayle/TerrapinTalk/myenv/lib/python3.9/site-packages/pandas/tests/dtypes/cast/test_construct_object_arr.py
deleted file mode 100644
index cb44f91f34dec80c090d3ce3fc9a2dbd4578bb57..0000000000000000000000000000000000000000
--- a/spaces/profayle/TerrapinTalk/myenv/lib/python3.9/site-packages/pandas/tests/dtypes/cast/test_construct_object_arr.py
+++ /dev/null
@@ -1,20 +0,0 @@
-import pytest
-
-from pandas.core.dtypes.cast import construct_1d_object_array_from_listlike
-
-
-@pytest.mark.parametrize("datum1", [1, 2.0, "3", (4, 5), [6, 7], None])
-@pytest.mark.parametrize("datum2", [8, 9.0, "10", (11, 12), [13, 14], None])
-def test_cast_1d_array(datum1, datum2):
-    data = [datum1, datum2]
-    result = construct_1d_object_array_from_listlike(data)
-
-    # Direct comparison fails: https://github.com/numpy/numpy/issues/10218
-    assert result.dtype == "object"
-    assert list(result) == data
-
-
-@pytest.mark.parametrize("val", [1, 2.0, None])
-def test_cast_1d_array_invalid_scalar(val):
-    with pytest.raises(TypeError, match="has no len()"):
-        construct_1d_object_array_from_listlike(val)
diff --git a/spaces/profayle/TerrapinTalk/myenv/lib/python3.9/site-packages/pandas/tests/extension/conftest.py b/spaces/profayle/TerrapinTalk/myenv/lib/python3.9/site-packages/pandas/tests/extension/conftest.py
deleted file mode 100644
index 7b7945b15ed83be7ad8093dcbb6ccb7e9bcd4e72..0000000000000000000000000000000000000000
--- a/spaces/profayle/TerrapinTalk/myenv/lib/python3.9/site-packages/pandas/tests/extension/conftest.py
+++ /dev/null
@@ -1,221 +0,0 @@
-import operator
-
-import pytest
-
-from pandas import (
-    Series,
-    options,
-)
-
-
-@pytest.fixture
-def dtype():
-    """A fixture providing the ExtensionDtype to validate."""
-    raise NotImplementedError
-
-
-@pytest.fixture
-def data():
-    """
-    Length-100 array for this type.
-
-    * data[0] and data[1] should both be non missing
-    * data[0] and data[1] should not be equal
-    """
-    raise NotImplementedError
-
-
-@pytest.fixture
-def data_for_twos(dtype):
-    """
-    Length-100 array in which all the elements are two.
-
-    Call pytest.skip in your fixture if the dtype does not support divmod.
-    """
-    if not (dtype._is_numeric or dtype.kind == "m"):
-        # Object-dtypes may want to allow this, but for the most part
-        #  only numeric and timedelta-like dtypes will need to implement this.
-        pytest.skip("Not a numeric dtype")
-
-    raise NotImplementedError
-
-
-@pytest.fixture
-def data_missing():
-    """Length-2 array with [NA, Valid]"""
-    raise NotImplementedError
-
-
-@pytest.fixture(params=["data", "data_missing"])
-def all_data(request, data, data_missing):
-    """Parametrized fixture giving 'data' and 'data_missing'"""
-    if request.param == "data":
-        return data
-    elif request.param == "data_missing":
-        return data_missing
-
-
-@pytest.fixture
-def data_repeated(data):
-    """
-    Generate many datasets.
-
-    Parameters
-    ----------
-    data : fixture implementing `data`
-
-    Returns
-    -------
-    Callable[[int], Generator]:
-        A callable that takes a `count` argument and
-        returns a generator yielding `count` datasets.
-    """
-
-    def gen(count):
-        for _ in range(count):
-            yield data
-
-    return gen
-
-
-@pytest.fixture
-def data_for_sorting():
-    """
-    Length-3 array with a known sort order.
-
-    This should be three items [B, C, A] with
-    A < B < C
-
-    For boolean dtypes (for which there are only 2 values available),
-    set B=C=True
-    """
-    raise NotImplementedError
-
-
-@pytest.fixture
-def data_missing_for_sorting():
-    """
-    Length-3 array with a known sort order.
-
-    This should be three items [B, NA, A] with
-    A < B and NA missing.
-    """
-    raise NotImplementedError
-
-
-@pytest.fixture
-def na_cmp():
-    """
-    Binary operator for comparing NA values.
-
-    Should return a function of two arguments that returns
-    True if both arguments are (scalar) NA for your type.
-
-    By default, uses ``operator.is_``
-    """
-    return operator.is_
-
-
-@pytest.fixture
-def na_value(dtype):
-    """The scalar missing value for this type. Default dtype.na_value"""
-    return dtype.na_value
-
-
-@pytest.fixture
-def data_for_grouping():
-    """
-    Data for factorization, grouping, and unique tests.
-
-    Expected to be like [B, B, NA, NA, A, A, B, C]
-
-    Where A < B < C and NA is missing.
-
-    If a dtype has _is_boolean = True, i.e. only 2 unique non-NA entries,
-    then set C=B.
-    """
-    raise NotImplementedError
-
-
-@pytest.fixture(params=[True, False])
-def box_in_series(request):
-    """Whether to box the data in a Series"""
-    return request.param
-
-
-@pytest.fixture(
-    params=[
-        lambda x: 1,
-        lambda x: [1] * len(x),
-        lambda x: Series([1] * len(x)),
-        lambda x: x,
-    ],
-    ids=["scalar", "list", "series", "object"],
-)
-def groupby_apply_op(request):
-    """
-    Functions to test groupby.apply().
-    """
-    return request.param
-
-
-@pytest.fixture(params=[True, False])
-def as_frame(request):
-    """
-    Boolean fixture to support Series and Series.to_frame() comparison testing.
-    """
-    return request.param
-
-
-@pytest.fixture(params=[True, False])
-def as_series(request):
-    """
-    Boolean fixture to support arr and Series(arr) comparison testing.
-    """
-    return request.param
-
-
-@pytest.fixture(params=[True, False])
-def use_numpy(request):
-    """
-    Boolean fixture to support comparison testing of ExtensionDtype array
-    and numpy array.
-    """
-    return request.param
-
-
-@pytest.fixture(params=["ffill", "bfill"])
-def fillna_method(request):
-    """
-    Parametrized fixture giving method parameters 'ffill' and 'bfill' for
-    Series.fillna(method=<method>) testing.
-    """
-    return request.param
-
-
-@pytest.fixture(params=[True, False])
-def as_array(request):
-    """
-    Boolean fixture to support ExtensionDtype _from_sequence method testing.
-    """
-    return request.param
-
-
-@pytest.fixture
-def invalid_scalar(data):
-    """
-    A scalar that *cannot* be held by this ExtensionArray.
-
-    The default should work for most subclasses, but is not guaranteed.
-
-    If the array can hold any item (i.e. object dtype), then use pytest.skip.
-    """
-    return object.__new__(object)
-
-
-@pytest.fixture
-def using_copy_on_write() -> bool:
-    """
-    Fixture to check if Copy-on-Write is enabled.
-    """
-    return options.mode.copy_on_write and options.mode.data_manager == "block"
diff --git a/spaces/profayle/TerrapinTalk/myenv/lib/python3.9/site-packages/pandas/tests/frame/methods/test_align.py b/spaces/profayle/TerrapinTalk/myenv/lib/python3.9/site-packages/pandas/tests/frame/methods/test_align.py
deleted file mode 100644
index 87a56c07362879e54ef03e28d1b2b06cdb4236dd..0000000000000000000000000000000000000000
--- a/spaces/profayle/TerrapinTalk/myenv/lib/python3.9/site-packages/pandas/tests/frame/methods/test_align.py
+++ /dev/null
@@ -1,490 +0,0 @@
-from datetime import timezone
-
-import numpy as np
-import pytest
-
-import pandas as pd
-from pandas import (
-    DataFrame,
-    Index,
-    Series,
-    date_range,
-)
-import pandas._testing as tm
-
-
-class TestDataFrameAlign:
-    def test_align_asfreq_method_raises(self):
-        df = DataFrame({"A": [1, np.nan, 2]})
-        msg = "Invalid fill method"
-        msg2 = "The 'method', 'limit', and 'fill_axis' keywords"
-        with pytest.raises(ValueError, match=msg):
-            with tm.assert_produces_warning(FutureWarning, match=msg2):
-                df.align(df.iloc[::-1], method="asfreq")
-
-    def test_frame_align_aware(self):
-        idx1 = date_range("2001", periods=5, freq="H", tz="US/Eastern")
-        idx2 = date_range("2001", periods=5, freq="2H", tz="US/Eastern")
-        df1 = DataFrame(np.random.default_rng(2).standard_normal((len(idx1), 3)), idx1)
-        df2 = DataFrame(np.random.default_rng(2).standard_normal((len(idx2), 3)), idx2)
-        new1, new2 = df1.align(df2)
-        assert df1.index.tz == new1.index.tz
-        assert df2.index.tz == new2.index.tz
-
-        # different timezones convert to UTC
-
-        # frame with frame
-        df1_central = df1.tz_convert("US/Central")
-        new1, new2 = df1.align(df1_central)
-        assert new1.index.tz is timezone.utc
-        assert new2.index.tz is timezone.utc
-
-        # frame with Series
-        new1, new2 = df1.align(df1_central[0], axis=0)
-        assert new1.index.tz is timezone.utc
-        assert new2.index.tz is timezone.utc
-
-        df1[0].align(df1_central, axis=0)
-        assert new1.index.tz is timezone.utc
-        assert new2.index.tz is timezone.utc
-
-    def test_align_float(self, float_frame, using_copy_on_write):
-        af, bf = float_frame.align(float_frame)
-        assert af._mgr is not float_frame._mgr
-
-        af, bf = float_frame.align(float_frame, copy=False)
-        if not using_copy_on_write:
-            assert af._mgr is float_frame._mgr
-        else:
-            assert af._mgr is not float_frame._mgr
-
-        # axis = 0
-        other = float_frame.iloc[:-5, :3]
-        af, bf = float_frame.align(other, axis=0, fill_value=-1)
-
-        tm.assert_index_equal(bf.columns, other.columns)
-
-        # test fill value
-        join_idx = float_frame.index.join(other.index)
-        diff_a = float_frame.index.difference(join_idx)
-        diff_a_vals = af.reindex(diff_a).values
-        assert (diff_a_vals == -1).all()
-
-        af, bf = float_frame.align(other, join="right", axis=0)
-        tm.assert_index_equal(bf.columns, other.columns)
-        tm.assert_index_equal(bf.index, other.index)
-        tm.assert_index_equal(af.index, other.index)
-
-        # axis = 1
-        other = float_frame.iloc[:-5, :3].copy()
-        af, bf = float_frame.align(other, axis=1)
-        tm.assert_index_equal(bf.columns, float_frame.columns)
-        tm.assert_index_equal(bf.index, other.index)
-
-        # test fill value
-        join_idx = float_frame.index.join(other.index)
-        diff_a = float_frame.index.difference(join_idx)
-        diff_a_vals = af.reindex(diff_a).values
-
-        assert (diff_a_vals == -1).all()
-
-        af, bf = float_frame.align(other, join="inner", axis=1)
-        tm.assert_index_equal(bf.columns, other.columns)
-
-        msg = (
-            "The 'method', 'limit', and 'fill_axis' keywords in DataFrame.align "
-            "are deprecated"
-        )
-        with tm.assert_produces_warning(FutureWarning, match=msg):
-            af, bf = float_frame.align(other, join="inner", axis=1, method="pad")
-        tm.assert_index_equal(bf.columns, other.columns)
-
-        msg = (
-            "The 'method', 'limit', and 'fill_axis' keywords in DataFrame.align "
-            "are deprecated"
-        )
-        with tm.assert_produces_warning(FutureWarning, match=msg):
-            af, bf = float_frame.align(
-                other.iloc[:, 0], join="inner", axis=1, method=None, fill_value=None
-            )
-        tm.assert_index_equal(bf.index, Index([]))
-
-        msg = (
-            "The 'method', 'limit', and 'fill_axis' keywords in DataFrame.align "
-            "are deprecated"
-        )
-        with tm.assert_produces_warning(FutureWarning, match=msg):
-            af, bf = float_frame.align(
-                other.iloc[:, 0], join="inner", axis=1, method=None, fill_value=0
-            )
-        tm.assert_index_equal(bf.index, Index([]))
-
-        # Try to align DataFrame to Series along bad axis
-        msg = "No axis named 2 for object type DataFrame"
-        with pytest.raises(ValueError, match=msg):
-            float_frame.align(af.iloc[0, :3], join="inner", axis=2)
-
-    def test_align_frame_with_series(self, float_frame):
-        # align dataframe to series with broadcast or not
-        idx = float_frame.index
-        s = Series(range(len(idx)), index=idx)
-
-        left, right = float_frame.align(s, axis=0)
-        tm.assert_index_equal(left.index, float_frame.index)
-        tm.assert_index_equal(right.index, float_frame.index)
-        assert isinstance(right, Series)
-
-        msg = "The 'broadcast_axis' keyword in DataFrame.align is deprecated"
-        with tm.assert_produces_warning(FutureWarning, match=msg):
-            left, right = float_frame.align(s, broadcast_axis=1)
-        tm.assert_index_equal(left.index, float_frame.index)
-        expected = {c: s for c in float_frame.columns}
-        expected = DataFrame(
-            expected, index=float_frame.index, columns=float_frame.columns
-        )
-        tm.assert_frame_equal(right, expected)
-
-    def test_align_series_condition(self):
-        # see gh-9558
-        df = DataFrame({"a": [1, 2, 3], "b": [4, 5, 6]})
-        result = df[df["a"] == 2]
-        expected = DataFrame([[2, 5]], index=[1], columns=["a", "b"])
-        tm.assert_frame_equal(result, expected)
-
-        result = df.where(df["a"] == 2, 0)
-        expected = DataFrame({"a": [0, 2, 0], "b": [0, 5, 0]})
-        tm.assert_frame_equal(result, expected)
-
-    def test_align_int(self, int_frame):
-        # test other non-float types
-        other = DataFrame(index=range(5), columns=["A", "B", "C"])
-
-        msg = (
-            "The 'method', 'limit', and 'fill_axis' keywords in DataFrame.align "
-            "are deprecated"
-        )
-        with tm.assert_produces_warning(FutureWarning, match=msg):
-            af, bf = int_frame.align(other, join="inner", axis=1, method="pad")
-        tm.assert_index_equal(bf.columns, other.columns)
-
-    def test_align_mixed_type(self, float_string_frame):
-        msg = (
-            "The 'method', 'limit', and 'fill_axis' keywords in DataFrame.align "
-            "are deprecated"
-        )
-        with tm.assert_produces_warning(FutureWarning, match=msg):
-            af, bf = float_string_frame.align(
-                float_string_frame, join="inner", axis=1, method="pad"
-            )
-        tm.assert_index_equal(bf.columns, float_string_frame.columns)
-
-    def test_align_mixed_float(self, mixed_float_frame):
-        # mixed floats/ints
-        other = DataFrame(index=range(5), columns=["A", "B", "C"])
-
-        msg = (
-            "The 'method', 'limit', and 'fill_axis' keywords in DataFrame.align "
-            "are deprecated"
-        )
-        with tm.assert_produces_warning(FutureWarning, match=msg):
-            af, bf = mixed_float_frame.align(
-                other.iloc[:, 0], join="inner", axis=1, method=None, fill_value=0
-            )
-        tm.assert_index_equal(bf.index, Index([]))
-
-    def test_align_mixed_int(self, mixed_int_frame):
-        other = DataFrame(index=range(5), columns=["A", "B", "C"])
-
-        msg = (
-            "The 'method', 'limit', and 'fill_axis' keywords in DataFrame.align "
-            "are deprecated"
-        )
-        with tm.assert_produces_warning(FutureWarning, match=msg):
-            af, bf = mixed_int_frame.align(
-                other.iloc[:, 0], join="inner", axis=1, method=None, fill_value=0
-            )
-        tm.assert_index_equal(bf.index, Index([]))
-
-    @pytest.mark.parametrize(
-        "l_ordered,r_ordered,expected",
-        [
-            [True, True, pd.CategoricalIndex],
-            [True, False, Index],
-            [False, True, Index],
-            [False, False, pd.CategoricalIndex],
-        ],
-    )
-    def test_align_categorical(self, l_ordered, r_ordered, expected):
-        # GH-28397
-        df_1 = DataFrame(
-            {
-                "A": np.arange(6, dtype="int64"),
-                "B": Series(list("aabbca")).astype(
-                    pd.CategoricalDtype(list("cab"), ordered=l_ordered)
-                ),
-            }
-        ).set_index("B")
-        df_2 = DataFrame(
-            {
-                "A": np.arange(5, dtype="int64"),
-                "B": Series(list("babca")).astype(
-                    pd.CategoricalDtype(list("cab"), ordered=r_ordered)
-                ),
-            }
-        ).set_index("B")
-
-        aligned_1, aligned_2 = df_1.align(df_2)
-        assert isinstance(aligned_1.index, expected)
-        assert isinstance(aligned_2.index, expected)
-        tm.assert_index_equal(aligned_1.index, aligned_2.index)
-
-    def test_align_multiindex(self):
-        # GH#10665
-        # same test cases as test_align_multiindex in test_series.py
-
-        midx = pd.MultiIndex.from_product(
-            [range(2), range(3), range(2)], names=("a", "b", "c")
-        )
-        idx = Index(range(2), name="b")
-        df1 = DataFrame(np.arange(12, dtype="int64"), index=midx)
-        df2 = DataFrame(np.arange(2, dtype="int64"), index=idx)
-
-        # these must be the same results (but flipped)
-        res1l, res1r = df1.align(df2, join="left")
-        res2l, res2r = df2.align(df1, join="right")
-
-        expl = df1
-        tm.assert_frame_equal(expl, res1l)
-        tm.assert_frame_equal(expl, res2r)
-        expr = DataFrame([0, 0, 1, 1, np.nan, np.nan] * 2, index=midx)
-        tm.assert_frame_equal(expr, res1r)
-        tm.assert_frame_equal(expr, res2l)
-
-        res1l, res1r = df1.align(df2, join="right")
-        res2l, res2r = df2.align(df1, join="left")
-
-        exp_idx = pd.MultiIndex.from_product(
-            [range(2), range(2), range(2)], names=("a", "b", "c")
-        )
-        expl = DataFrame([0, 1, 2, 3, 6, 7, 8, 9], index=exp_idx)
-        tm.assert_frame_equal(expl, res1l)
-        tm.assert_frame_equal(expl, res2r)
-        expr = DataFrame([0, 0, 1, 1] * 2, index=exp_idx)
-        tm.assert_frame_equal(expr, res1r)
-        tm.assert_frame_equal(expr, res2l)
-
-    def test_align_series_combinations(self):
-        df = DataFrame({"a": [1, 3, 5], "b": [1, 3, 5]}, index=list("ACE"))
-        s = Series([1, 2, 4], index=list("ABD"), name="x")
-
-        # frame + series
-        res1, res2 = df.align(s, axis=0)
-        exp1 = DataFrame(
-            {"a": [1, np.nan, 3, np.nan, 5], "b": [1, np.nan, 3, np.nan, 5]},
-            index=list("ABCDE"),
-        )
-        exp2 = Series([1, 2, np.nan, 4, np.nan], index=list("ABCDE"), name="x")
-
-        tm.assert_frame_equal(res1, exp1)
-        tm.assert_series_equal(res2, exp2)
-
-        # series + frame
-        res1, res2 = s.align(df)
-        tm.assert_series_equal(res1, exp2)
-        tm.assert_frame_equal(res2, exp1)
-
-    def test_multiindex_align_to_series_with_common_index_level(self):
-        #  GH-46001
-        foo_index = Index([1, 2, 3], name="foo")
-        bar_index = Index([1, 2], name="bar")
-
-        series = Series([1, 2], index=bar_index, name="foo_series")
-        df = DataFrame(
-            {"col": np.arange(6)},
-            index=pd.MultiIndex.from_product([foo_index, bar_index]),
-        )
-
-        expected_r = Series([1, 2] * 3, index=df.index, name="foo_series")
-        result_l, result_r = df.align(series, axis=0)
-
-        tm.assert_frame_equal(result_l, df)
-        tm.assert_series_equal(result_r, expected_r)
-
-    def test_multiindex_align_to_series_with_common_index_level_missing_in_left(self):
-        #  GH-46001
-        foo_index = Index([1, 2, 3], name="foo")
-        bar_index = Index([1, 2], name="bar")
-
-        series = Series(
-            [1, 2, 3, 4], index=Index([1, 2, 3, 4], name="bar"), name="foo_series"
-        )
-        df = DataFrame(
-            {"col": np.arange(6)},
-            index=pd.MultiIndex.from_product([foo_index, bar_index]),
-        )
-
-        expected_r = Series([1, 2] * 3, index=df.index, name="foo_series")
-        result_l, result_r = df.align(series, axis=0)
-
-        tm.assert_frame_equal(result_l, df)
-        tm.assert_series_equal(result_r, expected_r)
-
-    def test_multiindex_align_to_series_with_common_index_level_missing_in_right(self):
-        #  GH-46001
-        foo_index = Index([1, 2, 3], name="foo")
-        bar_index = Index([1, 2, 3, 4], name="bar")
-
-        series = Series([1, 2], index=Index([1, 2], name="bar"), name="foo_series")
-        df = DataFrame(
-            {"col": np.arange(12)},
-            index=pd.MultiIndex.from_product([foo_index, bar_index]),
-        )
-
-        expected_r = Series(
-            [1, 2, np.nan, np.nan] * 3, index=df.index, name="foo_series"
-        )
-        result_l, result_r = df.align(series, axis=0)
-
-        tm.assert_frame_equal(result_l, df)
-        tm.assert_series_equal(result_r, expected_r)
-
-    def test_multiindex_align_to_series_with_common_index_level_missing_in_both(self):
-        #  GH-46001
-        foo_index = Index([1, 2, 3], name="foo")
-        bar_index = Index([1, 3, 4], name="bar")
-
-        series = Series(
-            [1, 2, 3], index=Index([1, 2, 4], name="bar"), name="foo_series"
-        )
-        df = DataFrame(
-            {"col": np.arange(9)},
-            index=pd.MultiIndex.from_product([foo_index, bar_index]),
-        )
-
-        expected_r = Series([1, np.nan, 3] * 3, index=df.index, name="foo_series")
-        result_l, result_r = df.align(series, axis=0)
-
-        tm.assert_frame_equal(result_l, df)
-        tm.assert_series_equal(result_r, expected_r)
-
-    def test_multiindex_align_to_series_with_common_index_level_non_unique_cols(self):
-        #  GH-46001
-        foo_index = Index([1, 2, 3], name="foo")
-        bar_index = Index([1, 2], name="bar")
-
-        series = Series([1, 2], index=bar_index, name="foo_series")
-        df = DataFrame(
-            np.arange(18).reshape(6, 3),
-            index=pd.MultiIndex.from_product([foo_index, bar_index]),
-        )
-        df.columns = ["cfoo", "cbar", "cfoo"]
-
-        expected = Series([1, 2] * 3, index=df.index, name="foo_series")
-        result_left, result_right = df.align(series, axis=0)
-
-        tm.assert_series_equal(result_right, expected)
-        tm.assert_index_equal(result_left.columns, df.columns)
-
-    def test_missing_axis_specification_exception(self):
-        df = DataFrame(np.arange(50).reshape((10, 5)))
-        series = Series(np.arange(5))
-
-        with pytest.raises(ValueError, match=r"axis=0 or 1"):
-            df.align(series)
-
-    def _check_align(self, a, b, axis, fill_axis, how, method, limit=None):
-        msg = (
-            "The 'method', 'limit', and 'fill_axis' keywords in DataFrame.align "
-            "are deprecated"
-        )
-
-        with tm.assert_produces_warning(FutureWarning, match=msg):
-            aa, ab = a.align(
-                b, axis=axis, join=how, method=method, limit=limit, fill_axis=fill_axis
-            )
-
-        join_index, join_columns = None, None
-
-        ea, eb = a, b
-        if axis is None or axis == 0:
-            join_index = a.index.join(b.index, how=how)
-            ea = ea.reindex(index=join_index)
-            eb = eb.reindex(index=join_index)
-
-        if axis is None or axis == 1:
-            join_columns = a.columns.join(b.columns, how=how)
-            ea = ea.reindex(columns=join_columns)
-            eb = eb.reindex(columns=join_columns)
-
-        msg = "DataFrame.fillna with 'method' is deprecated"
-        with tm.assert_produces_warning(FutureWarning, match=msg):
-            ea = ea.fillna(axis=fill_axis, method=method, limit=limit)
-            eb = eb.fillna(axis=fill_axis, method=method, limit=limit)
-
-        tm.assert_frame_equal(aa, ea)
-        tm.assert_frame_equal(ab, eb)
-
-    @pytest.mark.parametrize("meth", ["pad", "bfill"])
-    @pytest.mark.parametrize("ax", [0, 1, None])
-    @pytest.mark.parametrize("fax", [0, 1])
-    @pytest.mark.parametrize("how", ["inner", "outer", "left", "right"])
-    def test_align_fill_method(self, how, meth, ax, fax, float_frame):
-        df = float_frame
-        self._check_align_fill(df, how, meth, ax, fax)
-
-    def _check_align_fill(self, frame, kind, meth, ax, fax):
-        left = frame.iloc[0:4, :10]
-        right = frame.iloc[2:, 6:]
-        empty = frame.iloc[:0, :0]
-
-        self._check_align(left, right, axis=ax, fill_axis=fax, how=kind, method=meth)
-        self._check_align(
-            left, right, axis=ax, fill_axis=fax, how=kind, method=meth, limit=1
-        )
-
-        # empty left
-        self._check_align(empty, right, axis=ax, fill_axis=fax, how=kind, method=meth)
-        self._check_align(
-            empty, right, axis=ax, fill_axis=fax, how=kind, method=meth, limit=1
-        )
-
-        # empty right
-        self._check_align(left, empty, axis=ax, fill_axis=fax, how=kind, method=meth)
-        self._check_align(
-            left, empty, axis=ax, fill_axis=fax, how=kind, method=meth, limit=1
-        )
-
-        # both empty
-        self._check_align(empty, empty, axis=ax, fill_axis=fax, how=kind, method=meth)
-        self._check_align(
-            empty, empty, axis=ax, fill_axis=fax, how=kind, method=meth, limit=1
-        )
-
-    def test_align_series_check_copy(self):
-        # GH#
-        df = DataFrame({0: [1, 2]})
-        ser = Series([1], name=0)
-        expected = ser.copy()
-        result, other = df.align(ser, axis=1)
-        ser.iloc[0] = 100
-        tm.assert_series_equal(other, expected)
-
-    def test_align_identical_different_object(self):
-        # GH#51032
-        df = DataFrame({"a": [1, 2]})
-        ser = Series([3, 4])
-        result, result2 = df.align(ser, axis=0)
-        tm.assert_frame_equal(result, df)
-        tm.assert_series_equal(result2, ser)
-        assert df is not result
-        assert ser is not result2
-
-    def test_align_identical_different_object_columns(self):
-        # GH#51032
-        df = DataFrame({"a": [1, 2]})
-        ser = Series([1], index=["a"])
-        result, result2 = df.align(ser, axis=1)
-        tm.assert_frame_equal(result, df)
-        tm.assert_series_equal(result2, ser)
-        assert df is not result
-        assert ser is not result2
diff --git a/spaces/profayle/TerrapinTalk/myenv/lib/python3.9/site-packages/pandas/tests/indexes/datetimes/methods/test_isocalendar.py b/spaces/profayle/TerrapinTalk/myenv/lib/python3.9/site-packages/pandas/tests/indexes/datetimes/methods/test_isocalendar.py
deleted file mode 100644
index 128a8b3e10eb32b2bb3fdac596e2775f86446279..0000000000000000000000000000000000000000
--- a/spaces/profayle/TerrapinTalk/myenv/lib/python3.9/site-packages/pandas/tests/indexes/datetimes/methods/test_isocalendar.py
+++ /dev/null
@@ -1,20 +0,0 @@
-from pandas import (
-    DataFrame,
-    DatetimeIndex,
-)
-import pandas._testing as tm
-
-
-def test_isocalendar_returns_correct_values_close_to_new_year_with_tz():
-    # GH#6538: Check that DatetimeIndex and its TimeStamp elements
-    # return the same weekofyear accessor close to new year w/ tz
-    dates = ["2013/12/29", "2013/12/30", "2013/12/31"]
-    dates = DatetimeIndex(dates, tz="Europe/Brussels")
-    result = dates.isocalendar()
-    expected_data_frame = DataFrame(
-        [[2013, 52, 7], [2014, 1, 1], [2014, 1, 2]],
-        columns=["year", "week", "day"],
-        index=dates,
-        dtype="UInt32",
-    )
-    tm.assert_frame_equal(result, expected_data_frame)
diff --git a/spaces/profayle/TerrapinTalk/myenv/lib/python3.9/site-packages/pandas/tests/indexes/multi/test_indexing.py b/spaces/profayle/TerrapinTalk/myenv/lib/python3.9/site-packages/pandas/tests/indexes/multi/test_indexing.py
deleted file mode 100644
index 78b2c493ec116ae022eef1762469b3a1888a2764..0000000000000000000000000000000000000000
--- a/spaces/profayle/TerrapinTalk/myenv/lib/python3.9/site-packages/pandas/tests/indexes/multi/test_indexing.py
+++ /dev/null
@@ -1,973 +0,0 @@
-from datetime import timedelta
-import re
-
-import numpy as np
-import pytest
-
-from pandas.errors import (
-    InvalidIndexError,
-    PerformanceWarning,
-)
-
-import pandas as pd
-from pandas import (
-    Categorical,
-    Index,
-    MultiIndex,
-    date_range,
-)
-import pandas._testing as tm
-
-
-class TestSliceLocs:
-    def test_slice_locs_partial(self, idx):
-        sorted_idx, _ = idx.sortlevel(0)
-
-        result = sorted_idx.slice_locs(("foo", "two"), ("qux", "one"))
-        assert result == (1, 5)
-
-        result = sorted_idx.slice_locs(None, ("qux", "one"))
-        assert result == (0, 5)
-
-        result = sorted_idx.slice_locs(("foo", "two"), None)
-        assert result == (1, len(sorted_idx))
-
-        result = sorted_idx.slice_locs("bar", "baz")
-        assert result == (2, 4)
-
-    def test_slice_locs(self):
-        df = tm.makeTimeDataFrame()
-        stacked = df.stack(future_stack=True)
-        idx = stacked.index
-
-        slob = slice(*idx.slice_locs(df.index[5], df.index[15]))
-        sliced = stacked[slob]
-        expected = df[5:16].stack(future_stack=True)
-        tm.assert_almost_equal(sliced.values, expected.values)
-
-        slob = slice(
-            *idx.slice_locs(
-                df.index[5] + timedelta(seconds=30),
-                df.index[15] - timedelta(seconds=30),
-            )
-        )
-        sliced = stacked[slob]
-        expected = df[6:15].stack(future_stack=True)
-        tm.assert_almost_equal(sliced.values, expected.values)
-
-    def test_slice_locs_with_type_mismatch(self):
-        df = tm.makeTimeDataFrame()
-        stacked = df.stack(future_stack=True)
-        idx = stacked.index
-        with pytest.raises(TypeError, match="^Level type mismatch"):
-            idx.slice_locs((1, 3))
-        with pytest.raises(TypeError, match="^Level type mismatch"):
-            idx.slice_locs(df.index[5] + timedelta(seconds=30), (5, 2))
-        df = tm.makeCustomDataframe(5, 5)
-        stacked = df.stack(future_stack=True)
-        idx = stacked.index
-        with pytest.raises(TypeError, match="^Level type mismatch"):
-            idx.slice_locs(timedelta(seconds=30))
-        # TODO: Try creating a UnicodeDecodeError in exception message
-        with pytest.raises(TypeError, match="^Level type mismatch"):
-            idx.slice_locs(df.index[1], (16, "a"))
-
-    def test_slice_locs_not_sorted(self):
-        index = MultiIndex(
-            levels=[Index(np.arange(4)), Index(np.arange(4)), Index(np.arange(4))],
-            codes=[
-                np.array([0, 0, 1, 2, 2, 2, 3, 3]),
-                np.array([0, 1, 0, 0, 0, 1, 0, 1]),
-                np.array([1, 0, 1, 1, 0, 0, 1, 0]),
-            ],
-        )
-        msg = "[Kk]ey length.*greater than MultiIndex lexsort depth"
-        with pytest.raises(KeyError, match=msg):
-            index.slice_locs((1, 0, 1), (2, 1, 0))
-
-        # works
-        sorted_index, _ = index.sortlevel(0)
-        # should there be a test case here???
-        sorted_index.slice_locs((1, 0, 1), (2, 1, 0))
-
-    def test_slice_locs_not_contained(self):
-        # some searchsorted action
-
-        index = MultiIndex(
-            levels=[[0, 2, 4, 6], [0, 2, 4]],
-            codes=[[0, 0, 0, 1, 1, 2, 3, 3, 3], [0, 1, 2, 1, 2, 2, 0, 1, 2]],
-        )
-
-        result = index.slice_locs((1, 0), (5, 2))
-        assert result == (3, 6)
-
-        result = index.slice_locs(1, 5)
-        assert result == (3, 6)
-
-        result = index.slice_locs((2, 2), (5, 2))
-        assert result == (3, 6)
-
-        result = index.slice_locs(2, 5)
-        assert result == (3, 6)
-
-        result = index.slice_locs((1, 0), (6, 3))
-        assert result == (3, 8)
-
-        result = index.slice_locs(-1, 10)
-        assert result == (0, len(index))
-
-    @pytest.mark.parametrize(
-        "index_arr,expected,start_idx,end_idx",
-        [
-            ([[np.nan, "a", "b"], ["c", "d", "e"]], (0, 3), np.nan, None),
-            ([[np.nan, "a", "b"], ["c", "d", "e"]], (0, 3), np.nan, "b"),
-            ([[np.nan, "a", "b"], ["c", "d", "e"]], (0, 3), np.nan, ("b", "e")),
-            ([["a", "b", "c"], ["d", np.nan, "e"]], (1, 3), ("b", np.nan), None),
-            ([["a", "b", "c"], ["d", np.nan, "e"]], (1, 3), ("b", np.nan), "c"),
-            ([["a", "b", "c"], ["d", np.nan, "e"]], (1, 3), ("b", np.nan), ("c", "e")),
-        ],
-    )
-    def test_slice_locs_with_missing_value(
-        self, index_arr, expected, start_idx, end_idx
-    ):
-        # issue 19132
-        idx = MultiIndex.from_arrays(index_arr)
-        result = idx.slice_locs(start=start_idx, end=end_idx)
-        assert result == expected
-
-
-class TestPutmask:
-    def test_putmask_with_wrong_mask(self, idx):
-        # GH18368
-
-        msg = "putmask: mask and data must be the same size"
-        with pytest.raises(ValueError, match=msg):
-            idx.putmask(np.ones(len(idx) + 1, np.bool_), 1)
-
-        with pytest.raises(ValueError, match=msg):
-            idx.putmask(np.ones(len(idx) - 1, np.bool_), 1)
-
-        with pytest.raises(ValueError, match=msg):
-            idx.putmask("foo", 1)
-
-    def test_putmask_multiindex_other(self):
-        # GH#43212 `value` is also a MultiIndex
-
-        left = MultiIndex.from_tuples([(np.nan, 6), (np.nan, 6), ("a", 4)])
-        right = MultiIndex.from_tuples([("a", 1), ("a", 1), ("d", 1)])
-        mask = np.array([True, True, False])
-
-        result = left.putmask(mask, right)
-
-        expected = MultiIndex.from_tuples([right[0], right[1], left[2]])
-        tm.assert_index_equal(result, expected)
-
-    def test_putmask_keep_dtype(self, any_numeric_ea_dtype):
-        # GH#49830
-        midx = MultiIndex.from_arrays(
-            [pd.Series([1, 2, 3], dtype=any_numeric_ea_dtype), [10, 11, 12]]
-        )
-        midx2 = MultiIndex.from_arrays(
-            [pd.Series([5, 6, 7], dtype=any_numeric_ea_dtype), [-1, -2, -3]]
-        )
-        result = midx.putmask([True, False, False], midx2)
-        expected = MultiIndex.from_arrays(
-            [pd.Series([5, 2, 3], dtype=any_numeric_ea_dtype), [-1, 11, 12]]
-        )
-        tm.assert_index_equal(result, expected)
-
-    def test_putmask_keep_dtype_shorter_value(self, any_numeric_ea_dtype):
-        # GH#49830
-        midx = MultiIndex.from_arrays(
-            [pd.Series([1, 2, 3], dtype=any_numeric_ea_dtype), [10, 11, 12]]
-        )
-        midx2 = MultiIndex.from_arrays(
-            [pd.Series([5], dtype=any_numeric_ea_dtype), [-1]]
-        )
-        result = midx.putmask([True, False, False], midx2)
-        expected = MultiIndex.from_arrays(
-            [pd.Series([5, 2, 3], dtype=any_numeric_ea_dtype), [-1, 11, 12]]
-        )
-        tm.assert_index_equal(result, expected)
-
-
-class TestGetIndexer:
-    def test_get_indexer(self):
-        major_axis = Index(np.arange(4))
-        minor_axis = Index(np.arange(2))
-
-        major_codes = np.array([0, 0, 1, 2, 2, 3, 3], dtype=np.intp)
-        minor_codes = np.array([0, 1, 0, 0, 1, 0, 1], dtype=np.intp)
-
-        index = MultiIndex(
-            levels=[major_axis, minor_axis], codes=[major_codes, minor_codes]
-        )
-        idx1 = index[:5]
-        idx2 = index[[1, 3, 5]]
-
-        r1 = idx1.get_indexer(idx2)
-        tm.assert_almost_equal(r1, np.array([1, 3, -1], dtype=np.intp))
-
-        r1 = idx2.get_indexer(idx1, method="pad")
-        e1 = np.array([-1, 0, 0, 1, 1], dtype=np.intp)
-        tm.assert_almost_equal(r1, e1)
-
-        r2 = idx2.get_indexer(idx1[::-1], method="pad")
-        tm.assert_almost_equal(r2, e1[::-1])
-
-        rffill1 = idx2.get_indexer(idx1, method="ffill")
-        tm.assert_almost_equal(r1, rffill1)
-
-        r1 = idx2.get_indexer(idx1, method="backfill")
-        e1 = np.array([0, 0, 1, 1, 2], dtype=np.intp)
-        tm.assert_almost_equal(r1, e1)
-
-        r2 = idx2.get_indexer(idx1[::-1], method="backfill")
-        tm.assert_almost_equal(r2, e1[::-1])
-
-        rbfill1 = idx2.get_indexer(idx1, method="bfill")
-        tm.assert_almost_equal(r1, rbfill1)
-
-        # pass non-MultiIndex
-        r1 = idx1.get_indexer(idx2.values)
-        rexp1 = idx1.get_indexer(idx2)
-        tm.assert_almost_equal(r1, rexp1)
-
-        r1 = idx1.get_indexer([1, 2, 3])
-        assert (r1 == [-1, -1, -1]).all()
-
-        # create index with duplicates
-        idx1 = Index(list(range(10)) + list(range(10)))
-        idx2 = Index(list(range(20)))
-
-        msg = "Reindexing only valid with uniquely valued Index objects"
-        with pytest.raises(InvalidIndexError, match=msg):
-            idx1.get_indexer(idx2)
-
-    def test_get_indexer_nearest(self):
-        midx = MultiIndex.from_tuples([("a", 1), ("b", 2)])
-        msg = (
-            "method='nearest' not implemented yet for MultiIndex; "
-            "see GitHub issue 9365"
-        )
-        with pytest.raises(NotImplementedError, match=msg):
-            midx.get_indexer(["a"], method="nearest")
-        msg = "tolerance not implemented yet for MultiIndex"
-        with pytest.raises(NotImplementedError, match=msg):
-            midx.get_indexer(["a"], method="pad", tolerance=2)
-
-    def test_get_indexer_categorical_time(self):
-        # https://github.com/pandas-dev/pandas/issues/21390
-        midx = MultiIndex.from_product(
-            [
-                Categorical(["a", "b", "c"]),
-                Categorical(date_range("2012-01-01", periods=3, freq="H")),
-            ]
-        )
-        result = midx.get_indexer(midx)
-        tm.assert_numpy_array_equal(result, np.arange(9, dtype=np.intp))
-
-    @pytest.mark.parametrize(
-        "index_arr,labels,expected",
-        [
-            (
-                [[1, np.nan, 2], [3, 4, 5]],
-                [1, np.nan, 2],
-                np.array([-1, -1, -1], dtype=np.intp),
-            ),
-            ([[1, np.nan, 2], [3, 4, 5]], [(np.nan, 4)], np.array([1], dtype=np.intp)),
-            ([[1, 2, 3], [np.nan, 4, 5]], [(1, np.nan)], np.array([0], dtype=np.intp)),
-            (
-                [[1, 2, 3], [np.nan, 4, 5]],
-                [np.nan, 4, 5],
-                np.array([-1, -1, -1], dtype=np.intp),
-            ),
-        ],
-    )
-    def test_get_indexer_with_missing_value(self, index_arr, labels, expected):
-        # issue 19132
-        idx = MultiIndex.from_arrays(index_arr)
-        result = idx.get_indexer(labels)
-        tm.assert_numpy_array_equal(result, expected)
-
-    def test_get_indexer_methods(self):
-        # https://github.com/pandas-dev/pandas/issues/29896
-        # test getting an indexer for another index with different methods
-        # confirms that getting an indexer without a filling method, getting an
-        # indexer and backfilling, and getting an indexer and padding all behave
-        # correctly in the case where all of the target values fall in between
-        # several levels in the MultiIndex into which they are getting an indexer
-        #
-        # visually, the MultiIndexes used in this test are:
-        # mult_idx_1:
-        #  0: -1 0
-        #  1:    2
-        #  2:    3
-        #  3:    4
-        #  4:  0 0
-        #  5:    2
-        #  6:    3
-        #  7:    4
-        #  8:  1 0
-        #  9:    2
-        # 10:    3
-        # 11:    4
-        #
-        # mult_idx_2:
-        #  0: 0 1
-        #  1:   3
-        #  2:   4
-        mult_idx_1 = MultiIndex.from_product([[-1, 0, 1], [0, 2, 3, 4]])
-        mult_idx_2 = MultiIndex.from_product([[0], [1, 3, 4]])
-
-        indexer = mult_idx_1.get_indexer(mult_idx_2)
-        expected = np.array([-1, 6, 7], dtype=indexer.dtype)
-        tm.assert_almost_equal(expected, indexer)
-
-        backfill_indexer = mult_idx_1.get_indexer(mult_idx_2, method="backfill")
-        expected = np.array([5, 6, 7], dtype=backfill_indexer.dtype)
-        tm.assert_almost_equal(expected, backfill_indexer)
-
-        # ensure the legacy "bfill" option functions identically to "backfill"
-        backfill_indexer = mult_idx_1.get_indexer(mult_idx_2, method="bfill")
-        expected = np.array([5, 6, 7], dtype=backfill_indexer.dtype)
-        tm.assert_almost_equal(expected, backfill_indexer)
-
-        pad_indexer = mult_idx_1.get_indexer(mult_idx_2, method="pad")
-        expected = np.array([4, 6, 7], dtype=pad_indexer.dtype)
-        tm.assert_almost_equal(expected, pad_indexer)
-
-        # ensure the legacy "ffill" option functions identically to "pad"
-        pad_indexer = mult_idx_1.get_indexer(mult_idx_2, method="ffill")
-        expected = np.array([4, 6, 7], dtype=pad_indexer.dtype)
-        tm.assert_almost_equal(expected, pad_indexer)
-
-    def test_get_indexer_three_or_more_levels(self):
-        # https://github.com/pandas-dev/pandas/issues/29896
-        # tests get_indexer() on MultiIndexes with 3+ levels
-        # visually, these are
-        # mult_idx_1:
-        #  0: 1 2 5
-        #  1:     7
-        #  2:   4 5
-        #  3:     7
-        #  4:   6 5
-        #  5:     7
-        #  6: 3 2 5
-        #  7:     7
-        #  8:   4 5
-        #  9:     7
-        # 10:   6 5
-        # 11:     7
-        #
-        # mult_idx_2:
-        #  0: 1 1 8
-        #  1: 1 5 9
-        #  2: 1 6 7
-        #  3: 2 1 6
-        #  4: 2 7 6
-        #  5: 2 7 8
-        #  6: 3 6 8
-        mult_idx_1 = MultiIndex.from_product([[1, 3], [2, 4, 6], [5, 7]])
-        mult_idx_2 = MultiIndex.from_tuples(
-            [
-                (1, 1, 8),
-                (1, 5, 9),
-                (1, 6, 7),
-                (2, 1, 6),
-                (2, 7, 7),
-                (2, 7, 8),
-                (3, 6, 8),
-            ]
-        )
-        # sanity check
-        assert mult_idx_1.is_monotonic_increasing
-        assert mult_idx_1.is_unique
-        assert mult_idx_2.is_monotonic_increasing
-        assert mult_idx_2.is_unique
-
-        # show the relationships between the two
-        assert mult_idx_2[0] < mult_idx_1[0]
-        assert mult_idx_1[3] < mult_idx_2[1] < mult_idx_1[4]
-        assert mult_idx_1[5] == mult_idx_2[2]
-        assert mult_idx_1[5] < mult_idx_2[3] < mult_idx_1[6]
-        assert mult_idx_1[5] < mult_idx_2[4] < mult_idx_1[6]
-        assert mult_idx_1[5] < mult_idx_2[5] < mult_idx_1[6]
-        assert mult_idx_1[-1] < mult_idx_2[6]
-
-        indexer_no_fill = mult_idx_1.get_indexer(mult_idx_2)
-        expected = np.array([-1, -1, 5, -1, -1, -1, -1], dtype=indexer_no_fill.dtype)
-        tm.assert_almost_equal(expected, indexer_no_fill)
-
-        # test with backfilling
-        indexer_backfilled = mult_idx_1.get_indexer(mult_idx_2, method="backfill")
-        expected = np.array([0, 4, 5, 6, 6, 6, -1], dtype=indexer_backfilled.dtype)
-        tm.assert_almost_equal(expected, indexer_backfilled)
-
-        # now, the same thing, but forward-filled (aka "padded")
-        indexer_padded = mult_idx_1.get_indexer(mult_idx_2, method="pad")
-        expected = np.array([-1, 3, 5, 5, 5, 5, 11], dtype=indexer_padded.dtype)
-        tm.assert_almost_equal(expected, indexer_padded)
-
-        # now, do the indexing in the other direction
-        assert mult_idx_2[0] < mult_idx_1[0] < mult_idx_2[1]
-        assert mult_idx_2[0] < mult_idx_1[1] < mult_idx_2[1]
-        assert mult_idx_2[0] < mult_idx_1[2] < mult_idx_2[1]
-        assert mult_idx_2[0] < mult_idx_1[3] < mult_idx_2[1]
-        assert mult_idx_2[1] < mult_idx_1[4] < mult_idx_2[2]
-        assert mult_idx_2[2] == mult_idx_1[5]
-        assert mult_idx_2[5] < mult_idx_1[6] < mult_idx_2[6]
-        assert mult_idx_2[5] < mult_idx_1[7] < mult_idx_2[6]
-        assert mult_idx_2[5] < mult_idx_1[8] < mult_idx_2[6]
-        assert mult_idx_2[5] < mult_idx_1[9] < mult_idx_2[6]
-        assert mult_idx_2[5] < mult_idx_1[10] < mult_idx_2[6]
-        assert mult_idx_2[5] < mult_idx_1[11] < mult_idx_2[6]
-
-        indexer = mult_idx_2.get_indexer(mult_idx_1)
-        expected = np.array(
-            [-1, -1, -1, -1, -1, 2, -1, -1, -1, -1, -1, -1], dtype=indexer.dtype
-        )
-        tm.assert_almost_equal(expected, indexer)
-
-        backfill_indexer = mult_idx_2.get_indexer(mult_idx_1, method="bfill")
-        expected = np.array(
-            [1, 1, 1, 1, 2, 2, 6, 6, 6, 6, 6, 6], dtype=backfill_indexer.dtype
-        )
-        tm.assert_almost_equal(expected, backfill_indexer)
-
-        pad_indexer = mult_idx_2.get_indexer(mult_idx_1, method="pad")
-        expected = np.array(
-            [0, 0, 0, 0, 1, 2, 5, 5, 5, 5, 5, 5], dtype=pad_indexer.dtype
-        )
-        tm.assert_almost_equal(expected, pad_indexer)
-
-    def test_get_indexer_crossing_levels(self):
-        # https://github.com/pandas-dev/pandas/issues/29896
-        # tests a corner case with get_indexer() with MultiIndexes where, when we
-        # need to "carry" across levels, proper tuple ordering is respected
-        #
-        # the MultiIndexes used in this test, visually, are:
-        # mult_idx_1:
-        #  0: 1 1 1 1
-        #  1:       2
-        #  2:     2 1
-        #  3:       2
-        #  4: 1 2 1 1
-        #  5:       2
-        #  6:     2 1
-        #  7:       2
-        #  8: 2 1 1 1
-        #  9:       2
-        # 10:     2 1
-        # 11:       2
-        # 12: 2 2 1 1
-        # 13:       2
-        # 14:     2 1
-        # 15:       2
-        #
-        # mult_idx_2:
-        #  0: 1 3 2 2
-        #  1: 2 3 2 2
-        mult_idx_1 = MultiIndex.from_product([[1, 2]] * 4)
-        mult_idx_2 = MultiIndex.from_tuples([(1, 3, 2, 2), (2, 3, 2, 2)])
-
-        # show the tuple orderings, which get_indexer() should respect
-        assert mult_idx_1[7] < mult_idx_2[0] < mult_idx_1[8]
-        assert mult_idx_1[-1] < mult_idx_2[1]
-
-        indexer = mult_idx_1.get_indexer(mult_idx_2)
-        expected = np.array([-1, -1], dtype=indexer.dtype)
-        tm.assert_almost_equal(expected, indexer)
-
-        backfill_indexer = mult_idx_1.get_indexer(mult_idx_2, method="bfill")
-        expected = np.array([8, -1], dtype=backfill_indexer.dtype)
-        tm.assert_almost_equal(expected, backfill_indexer)
-
-        pad_indexer = mult_idx_1.get_indexer(mult_idx_2, method="ffill")
-        expected = np.array([7, 15], dtype=pad_indexer.dtype)
-        tm.assert_almost_equal(expected, pad_indexer)
-
-    def test_get_indexer_kwarg_validation(self):
-        # GH#41918
-        mi = MultiIndex.from_product([range(3), ["A", "B"]])
-
-        msg = "limit argument only valid if doing pad, backfill or nearest"
-        with pytest.raises(ValueError, match=msg):
-            mi.get_indexer(mi[:-1], limit=4)
-
-        msg = "tolerance argument only valid if doing pad, backfill or nearest"
-        with pytest.raises(ValueError, match=msg):
-            mi.get_indexer(mi[:-1], tolerance="piano")
-
-    def test_get_indexer_nan(self):
-        # GH#37222
-        idx1 = MultiIndex.from_product([["A"], [1.0, 2.0]], names=["id1", "id2"])
-        idx2 = MultiIndex.from_product([["A"], [np.nan, 2.0]], names=["id1", "id2"])
-        expected = np.array([-1, 1])
-        result = idx2.get_indexer(idx1)
-        tm.assert_numpy_array_equal(result, expected, check_dtype=False)
-        result = idx1.get_indexer(idx2)
-        tm.assert_numpy_array_equal(result, expected, check_dtype=False)
-
-
-def test_getitem(idx):
-    # scalar
-    assert idx[2] == ("bar", "one")
-
-    # slice
-    result = idx[2:5]
-    expected = idx[[2, 3, 4]]
-    assert result.equals(expected)
-
-    # boolean
-    result = idx[[True, False, True, False, True, True]]
-    result2 = idx[np.array([True, False, True, False, True, True])]
-    expected = idx[[0, 2, 4, 5]]
-    assert result.equals(expected)
-    assert result2.equals(expected)
-
-
-def test_getitem_group_select(idx):
-    sorted_idx, _ = idx.sortlevel(0)
-    assert sorted_idx.get_loc("baz") == slice(3, 4)
-    assert sorted_idx.get_loc("foo") == slice(0, 2)
-
-
-@pytest.mark.parametrize("ind1", [[True] * 5, Index([True] * 5)])
-@pytest.mark.parametrize(
-    "ind2",
-    [[True, False, True, False, False], Index([True, False, True, False, False])],
-)
-def test_getitem_bool_index_all(ind1, ind2):
-    # GH#22533
-    idx = MultiIndex.from_tuples([(10, 1), (20, 2), (30, 3), (40, 4), (50, 5)])
-    tm.assert_index_equal(idx[ind1], idx)
-
-    expected = MultiIndex.from_tuples([(10, 1), (30, 3)])
-    tm.assert_index_equal(idx[ind2], expected)
-
-
-@pytest.mark.parametrize("ind1", [[True], Index([True])])
-@pytest.mark.parametrize("ind2", [[False], Index([False])])
-def test_getitem_bool_index_single(ind1, ind2):
-    # GH#22533
-    idx = MultiIndex.from_tuples([(10, 1)])
-    tm.assert_index_equal(idx[ind1], idx)
-
-    expected = MultiIndex(
-        levels=[np.array([], dtype=np.int64), np.array([], dtype=np.int64)],
-        codes=[[], []],
-    )
-    tm.assert_index_equal(idx[ind2], expected)
-
-
-class TestGetLoc:
-    def test_get_loc(self, idx):
-        assert idx.get_loc(("foo", "two")) == 1
-        assert idx.get_loc(("baz", "two")) == 3
-        with pytest.raises(KeyError, match=r"^\('bar', 'two'\)$"):
-            idx.get_loc(("bar", "two"))
-        with pytest.raises(KeyError, match=r"^'quux'$"):
-            idx.get_loc("quux")
-
-        # 3 levels
-        index = MultiIndex(
-            levels=[Index(np.arange(4)), Index(np.arange(4)), Index(np.arange(4))],
-            codes=[
-                np.array([0, 0, 1, 2, 2, 2, 3, 3]),
-                np.array([0, 1, 0, 0, 0, 1, 0, 1]),
-                np.array([1, 0, 1, 1, 0, 0, 1, 0]),
-            ],
-        )
-        with pytest.raises(KeyError, match=r"^\(1, 1\)$"):
-            index.get_loc((1, 1))
-        assert index.get_loc((2, 0)) == slice(3, 5)
-
-    def test_get_loc_duplicates(self):
-        index = Index([2, 2, 2, 2])
-        result = index.get_loc(2)
-        expected = slice(0, 4)
-        assert result == expected
-
-        index = Index(["c", "a", "a", "b", "b"])
-        rs = index.get_loc("c")
-        xp = 0
-        assert rs == xp
-
-        with pytest.raises(KeyError, match="2"):
-            index.get_loc(2)
-
-    def test_get_loc_level(self):
-        index = MultiIndex(
-            levels=[Index(np.arange(4)), Index(np.arange(4)), Index(np.arange(4))],
-            codes=[
-                np.array([0, 0, 1, 2, 2, 2, 3, 3]),
-                np.array([0, 1, 0, 0, 0, 1, 0, 1]),
-                np.array([1, 0, 1, 1, 0, 0, 1, 0]),
-            ],
-        )
-        loc, new_index = index.get_loc_level((0, 1))
-        expected = slice(1, 2)
-        exp_index = index[expected].droplevel(0).droplevel(0)
-        assert loc == expected
-        assert new_index.equals(exp_index)
-
-        loc, new_index = index.get_loc_level((0, 1, 0))
-        expected = 1
-        assert loc == expected
-        assert new_index is None
-
-        with pytest.raises(KeyError, match=r"^\(2, 2\)$"):
-            index.get_loc_level((2, 2))
-        # GH 22221: unused label
-        with pytest.raises(KeyError, match=r"^2$"):
-            index.drop(2).get_loc_level(2)
-        # Unused label on unsorted level:
-        with pytest.raises(KeyError, match=r"^2$"):
-            index.drop(1, level=2).get_loc_level(2, level=2)
-
-        index = MultiIndex(
-            levels=[[2000], list(range(4))],
-            codes=[np.array([0, 0, 0, 0]), np.array([0, 1, 2, 3])],
-        )
-        result, new_index = index.get_loc_level((2000, slice(None, None)))
-        expected = slice(None, None)
-        assert result == expected
-        assert new_index.equals(index.droplevel(0))
-
-    @pytest.mark.parametrize("dtype1", [int, float, bool, str])
-    @pytest.mark.parametrize("dtype2", [int, float, bool, str])
-    def test_get_loc_multiple_dtypes(self, dtype1, dtype2):
-        # GH 18520
-        levels = [np.array([0, 1]).astype(dtype1), np.array([0, 1]).astype(dtype2)]
-        idx = MultiIndex.from_product(levels)
-        assert idx.get_loc(idx[2]) == 2
-
-    @pytest.mark.parametrize("level", [0, 1])
-    @pytest.mark.parametrize("dtypes", [[int, float], [float, int]])
-    def test_get_loc_implicit_cast(self, level, dtypes):
-        # GH 18818, GH 15994 : as flat index, cast int to float and vice-versa
-        levels = [["a", "b"], ["c", "d"]]
-        key = ["b", "d"]
-        lev_dtype, key_dtype = dtypes
-        levels[level] = np.array([0, 1], dtype=lev_dtype)
-        key[level] = key_dtype(1)
-        idx = MultiIndex.from_product(levels)
-        assert idx.get_loc(tuple(key)) == 3
-
-    @pytest.mark.parametrize("dtype", [bool, object])
-    def test_get_loc_cast_bool(self, dtype):
-        # GH 19086 : int is casted to bool, but not vice-versa (for object dtype)
-        #  With bool dtype, we don't cast in either direction.
-        levels = [Index([False, True], dtype=dtype), np.arange(2, dtype="int64")]
-        idx = MultiIndex.from_product(levels)
-
-        if dtype is bool:
-            with pytest.raises(KeyError, match=r"^\(0, 1\)$"):
-                assert idx.get_loc((0, 1)) == 1
-            with pytest.raises(KeyError, match=r"^\(1, 0\)$"):
-                assert idx.get_loc((1, 0)) == 2
-        else:
-            # We use python object comparisons, which treat 0 == False and 1 == True
-            assert idx.get_loc((0, 1)) == 1
-            assert idx.get_loc((1, 0)) == 2
-
-        with pytest.raises(KeyError, match=r"^\(False, True\)$"):
-            idx.get_loc((False, True))
-        with pytest.raises(KeyError, match=r"^\(True, False\)$"):
-            idx.get_loc((True, False))
-
-    @pytest.mark.parametrize("level", [0, 1])
-    def test_get_loc_nan(self, level, nulls_fixture):
-        # GH 18485 : NaN in MultiIndex
-        levels = [["a", "b"], ["c", "d"]]
-        key = ["b", "d"]
-        levels[level] = np.array([0, nulls_fixture], dtype=type(nulls_fixture))
-        key[level] = nulls_fixture
-        idx = MultiIndex.from_product(levels)
-        assert idx.get_loc(tuple(key)) == 3
-
-    def test_get_loc_missing_nan(self):
-        # GH 8569
-        idx = MultiIndex.from_arrays([[1.0, 2.0], [3.0, 4.0]])
-        assert isinstance(idx.get_loc(1), slice)
-        with pytest.raises(KeyError, match=r"^3$"):
-            idx.get_loc(3)
-        with pytest.raises(KeyError, match=r"^nan$"):
-            idx.get_loc(np.nan)
-        with pytest.raises(InvalidIndexError, match=r"\[nan\]"):
-            # listlike/non-hashable raises TypeError
-            idx.get_loc([np.nan])
-
-    def test_get_loc_with_values_including_missing_values(self):
-        # issue 19132
-        idx = MultiIndex.from_product([[np.nan, 1]] * 2)
-        expected = slice(0, 2, None)
-        assert idx.get_loc(np.nan) == expected
-
-        idx = MultiIndex.from_arrays([[np.nan, 1, 2, np.nan]])
-        expected = np.array([True, False, False, True])
-        tm.assert_numpy_array_equal(idx.get_loc(np.nan), expected)
-
-        idx = MultiIndex.from_product([[np.nan, 1]] * 3)
-        expected = slice(2, 4, None)
-        assert idx.get_loc((np.nan, 1)) == expected
-
-    def test_get_loc_duplicates2(self):
-        # TODO: de-duplicate with test_get_loc_duplicates above?
-        index = MultiIndex(
-            levels=[["D", "B", "C"], [0, 26, 27, 37, 57, 67, 75, 82]],
-            codes=[[0, 0, 0, 1, 2, 2, 2, 2, 2, 2], [1, 3, 4, 6, 0, 2, 2, 3, 5, 7]],
-            names=["tag", "day"],
-        )
-
-        assert index.get_loc("D") == slice(0, 3)
-
-    def test_get_loc_past_lexsort_depth(self):
-        # GH#30053
-        idx = MultiIndex(
-            levels=[["a"], [0, 7], [1]],
-            codes=[[0, 0], [1, 0], [0, 0]],
-            names=["x", "y", "z"],
-            sortorder=0,
-        )
-        key = ("a", 7)
-
-        with tm.assert_produces_warning(PerformanceWarning):
-            # PerformanceWarning: indexing past lexsort depth may impact performance
-            result = idx.get_loc(key)
-
-        assert result == slice(0, 1, None)
-
-    def test_multiindex_get_loc_list_raises(self):
-        # GH#35878
-        idx = MultiIndex.from_tuples([("a", 1), ("b", 2)])
-        msg = r"\[\]"
-        with pytest.raises(InvalidIndexError, match=msg):
-            idx.get_loc([])
-
-    def test_get_loc_nested_tuple_raises_keyerror(self):
-        # raise KeyError, not TypeError
-        mi = MultiIndex.from_product([range(3), range(4), range(5), range(6)])
-        key = ((2, 3, 4), "foo")
-
-        with pytest.raises(KeyError, match=re.escape(str(key))):
-            mi.get_loc(key)
-
-
-class TestWhere:
-    def test_where(self):
-        i = MultiIndex.from_tuples([("A", 1), ("A", 2)])
-
-        msg = r"\.where is not supported for MultiIndex operations"
-        with pytest.raises(NotImplementedError, match=msg):
-            i.where(True)
-
-    def test_where_array_like(self, listlike_box):
-        mi = MultiIndex.from_tuples([("A", 1), ("A", 2)])
-        cond = [False, True]
-        msg = r"\.where is not supported for MultiIndex operations"
-        with pytest.raises(NotImplementedError, match=msg):
-            mi.where(listlike_box(cond))
-
-
-class TestContains:
-    def test_contains_top_level(self):
-        midx = MultiIndex.from_product([["A", "B"], [1, 2]])
-        assert "A" in midx
-        assert "A" not in midx._engine
-
-    def test_contains_with_nat(self):
-        # MI with a NaT
-        mi = MultiIndex(
-            levels=[["C"], date_range("2012-01-01", periods=5)],
-            codes=[[0, 0, 0, 0, 0, 0], [-1, 0, 1, 2, 3, 4]],
-            names=[None, "B"],
-        )
-        assert ("C", pd.Timestamp("2012-01-01")) in mi
-        for val in mi.values:
-            assert val in mi
-
-    def test_contains(self, idx):
-        assert ("foo", "two") in idx
-        assert ("bar", "two") not in idx
-        assert None not in idx
-
-    def test_contains_with_missing_value(self):
-        # GH#19132
-        idx = MultiIndex.from_arrays([[1, np.nan, 2]])
-        assert np.nan in idx
-
-        idx = MultiIndex.from_arrays([[1, 2], [np.nan, 3]])
-        assert np.nan not in idx
-        assert (1, np.nan) in idx
-
-    def test_multiindex_contains_dropped(self):
-        # GH#19027
-        # test that dropped MultiIndex levels are not in the MultiIndex
-        # despite continuing to be in the MultiIndex's levels
-        idx = MultiIndex.from_product([[1, 2], [3, 4]])
-        assert 2 in idx
-        idx = idx.drop(2)
-
-        # drop implementation keeps 2 in the levels
-        assert 2 in idx.levels[0]
-        # but it should no longer be in the index itself
-        assert 2 not in idx
-
-        # also applies to strings
-        idx = MultiIndex.from_product([["a", "b"], ["c", "d"]])
-        assert "a" in idx
-        idx = idx.drop("a")
-        assert "a" in idx.levels[0]
-        assert "a" not in idx
-
-    def test_contains_td64_level(self):
-        # GH#24570
-        tx = pd.timedelta_range("09:30:00", "16:00:00", freq="30 min")
-        idx = MultiIndex.from_arrays([tx, np.arange(len(tx))])
-        assert tx[0] in idx
-        assert "element_not_exit" not in idx
-        assert "0 day 09:30:00" in idx
-
-    @pytest.mark.slow
-    def test_large_mi_contains(self):
-        # GH#10645
-        result = MultiIndex.from_arrays([range(10**6), range(10**6)])
-        assert (10**6, 0) not in result
-
-
-def test_timestamp_multiindex_indexer():
-    # https://github.com/pandas-dev/pandas/issues/26944
-    idx = MultiIndex.from_product(
-        [
-            date_range("2019-01-01T00:15:33", periods=100, freq="H", name="date"),
-            ["x"],
-            [3],
-        ]
-    )
-    df = pd.DataFrame({"foo": np.arange(len(idx))}, idx)
-    result = df.loc[pd.IndexSlice["2019-1-2":, "x", :], "foo"]
-    qidx = MultiIndex.from_product(
-        [
-            date_range(
-                start="2019-01-02T00:15:33",
-                end="2019-01-05T03:15:33",
-                freq="H",
-                name="date",
-            ),
-            ["x"],
-            [3],
-        ]
-    )
-    should_be = pd.Series(data=np.arange(24, len(qidx) + 24), index=qidx, name="foo")
-    tm.assert_series_equal(result, should_be)
-
-
-@pytest.mark.parametrize(
-    "index_arr,expected,target,algo",
-    [
-        ([[np.nan, "a", "b"], ["c", "d", "e"]], 0, np.nan, "left"),
-        ([[np.nan, "a", "b"], ["c", "d", "e"]], 1, (np.nan, "c"), "right"),
-        ([["a", "b", "c"], ["d", np.nan, "d"]], 1, ("b", np.nan), "left"),
-    ],
-)
-def test_get_slice_bound_with_missing_value(index_arr, expected, target, algo):
-    # issue 19132
-    idx = MultiIndex.from_arrays(index_arr)
-    result = idx.get_slice_bound(target, side=algo)
-    assert result == expected
-
-
-@pytest.mark.parametrize(
-    "index_arr,expected,start_idx,end_idx",
-    [
-        ([[np.nan, 1, 2], [3, 4, 5]], slice(0, 2, None), np.nan, 1),
-        ([[np.nan, 1, 2], [3, 4, 5]], slice(0, 3, None), np.nan, (2, 5)),
-        ([[1, 2, 3], [4, np.nan, 5]], slice(1, 3, None), (2, np.nan), 3),
-        ([[1, 2, 3], [4, np.nan, 5]], slice(1, 3, None), (2, np.nan), (3, 5)),
-    ],
-)
-def test_slice_indexer_with_missing_value(index_arr, expected, start_idx, end_idx):
-    # issue 19132
-    idx = MultiIndex.from_arrays(index_arr)
-    result = idx.slice_indexer(start=start_idx, end=end_idx)
-    assert result == expected
-
-
-def test_pyint_engine():
-    # GH#18519 : when combinations of codes cannot be represented in 64
-    # bits, the index underlying the MultiIndex engine works with Python
-    # integers, rather than uint64.
-    N = 5
-    keys = [
-        tuple(arr)
-        for arr in [
-            [0] * 10 * N,
-            [1] * 10 * N,
-            [2] * 10 * N,
-            [np.nan] * N + [2] * 9 * N,
-            [0] * N + [2] * 9 * N,
-            [np.nan] * N + [2] * 8 * N + [0] * N,
-        ]
-    ]
-    # Each level contains 4 elements (including NaN), so it is represented
-    # in 2 bits, for a total of 2*N*10 = 100 > 64 bits. If we were using a
-    # 64 bit engine and truncating the first levels, the fourth and fifth
-    # keys would collide; if truncating the last levels, the fifth and
-    # sixth; if rotating bits rather than shifting, the third and fifth.
-
-    for idx, key_value in enumerate(keys):
-        index = MultiIndex.from_tuples(keys)
-        assert index.get_loc(key_value) == idx
-
-        expected = np.arange(idx + 1, dtype=np.intp)
-        result = index.get_indexer([keys[i] for i in expected])
-        tm.assert_numpy_array_equal(result, expected)
-
-    # With missing key:
-    idces = range(len(keys))
-    expected = np.array([-1] + list(idces), dtype=np.intp)
-    missing = tuple([0, 1] * 5 * N)
-    result = index.get_indexer([missing] + [keys[i] for i in idces])
-    tm.assert_numpy_array_equal(result, expected)
-
-
-@pytest.mark.parametrize(
-    "keys,expected",
-    [
-        ((slice(None), [5, 4]), [1, 0]),
-        ((slice(None), [4, 5]), [0, 1]),
-        (([True, False, True], [4, 6]), [0, 2]),
-        (([True, False, True], [6, 4]), [0, 2]),
-        ((2, [4, 5]), [0, 1]),
-        ((2, [5, 4]), [1, 0]),
-        (([2], [4, 5]), [0, 1]),
-        (([2], [5, 4]), [1, 0]),
-    ],
-)
-def test_get_locs_reordering(keys, expected):
-    # GH48384
-    idx = MultiIndex.from_arrays(
-        [
-            [2, 2, 1],
-            [4, 5, 6],
-        ]
-    )
-    result = idx.get_locs(keys)
-    expected = np.array(expected, dtype=np.intp)
-    tm.assert_numpy_array_equal(result, expected)
-
-
-def test_get_indexer_for_multiindex_with_nans(nulls_fixture):
-    # GH37222
-    idx1 = MultiIndex.from_product([["A"], [1.0, 2.0]], names=["id1", "id2"])
-    idx2 = MultiIndex.from_product([["A"], [nulls_fixture, 2.0]], names=["id1", "id2"])
-
-    result = idx2.get_indexer(idx1)
-    expected = np.array([-1, 1], dtype=np.intp)
-    tm.assert_numpy_array_equal(result, expected)
-
-    result = idx1.get_indexer(idx2)
-    expected = np.array([-1, 1], dtype=np.intp)
-    tm.assert_numpy_array_equal(result, expected)
diff --git a/spaces/profayle/TerrapinTalk/myenv/lib/python3.9/site-packages/pandas/tests/util/test_assert_attr_equal.py b/spaces/profayle/TerrapinTalk/myenv/lib/python3.9/site-packages/pandas/tests/util/test_assert_attr_equal.py
deleted file mode 100644
index bbbb0bf2172b12f93c9f0f6a97751854d1566a99..0000000000000000000000000000000000000000
--- a/spaces/profayle/TerrapinTalk/myenv/lib/python3.9/site-packages/pandas/tests/util/test_assert_attr_equal.py
+++ /dev/null
@@ -1,33 +0,0 @@
-from types import SimpleNamespace
-
-import pytest
-
-from pandas.core.dtypes.common import is_float
-
-import pandas._testing as tm
-
-
-def test_assert_attr_equal(nulls_fixture):
-    obj = SimpleNamespace()
-    obj.na_value = nulls_fixture
-    tm.assert_attr_equal("na_value", obj, obj)
-
-
-def test_assert_attr_equal_different_nulls(nulls_fixture, nulls_fixture2):
-    obj = SimpleNamespace()
-    obj.na_value = nulls_fixture
-
-    obj2 = SimpleNamespace()
-    obj2.na_value = nulls_fixture2
-
-    if nulls_fixture is nulls_fixture2:
-        tm.assert_attr_equal("na_value", obj, obj2)
-    elif is_float(nulls_fixture) and is_float(nulls_fixture2):
-        # we consider float("nan") and np.float64("nan") to be equivalent
-        tm.assert_attr_equal("na_value", obj, obj2)
-    elif type(nulls_fixture) is type(nulls_fixture2):
-        # e.g. Decimal("NaN")
-        tm.assert_attr_equal("na_value", obj, obj2)
-    else:
-        with pytest.raises(AssertionError, match='"na_value" are different'):
-            tm.assert_attr_equal("na_value", obj, obj2)
diff --git a/spaces/profayle/TerrapinTalk/myenv/lib/python3.9/site-packages/pip/_vendor/rich/filesize.py b/spaces/profayle/TerrapinTalk/myenv/lib/python3.9/site-packages/pip/_vendor/rich/filesize.py
deleted file mode 100644
index b3a0996b05ef985e64ce69225e1347c1603dc023..0000000000000000000000000000000000000000
--- a/spaces/profayle/TerrapinTalk/myenv/lib/python3.9/site-packages/pip/_vendor/rich/filesize.py
+++ /dev/null
@@ -1,89 +0,0 @@
-# coding: utf-8
-"""Functions for reporting filesizes. Borrowed from https://github.com/PyFilesystem/pyfilesystem2
-
-The functions declared in this module should cover the different
-usecases needed to generate a string representation of a file size
-using several different units. Since there are many standards regarding
-file size units, three different functions have been implemented.
-
-See Also:
-    * `Wikipedia: Binary prefix <https://en.wikipedia.org/wiki/Binary_prefix>`_
-
-"""
-
-__all__ = ["decimal"]
-
-from typing import Iterable, List, Tuple, Optional
-
-
-def _to_str(
-    size: int,
-    suffixes: Iterable[str],
-    base: int,
-    *,
-    precision: Optional[int] = 1,
-    separator: Optional[str] = " ",
-) -> str:
-    if size == 1:
-        return "1 byte"
-    elif size < base:
-        return "{:,} bytes".format(size)
-
-    for i, suffix in enumerate(suffixes, 2):  # noqa: B007
-        unit = base ** i
-        if size < unit:
-            break
-    return "{:,.{precision}f}{separator}{}".format(
-        (base * size / unit),
-        suffix,
-        precision=precision,
-        separator=separator,
-    )
-
-
-def pick_unit_and_suffix(size: int, suffixes: List[str], base: int) -> Tuple[int, str]:
-    """Pick a suffix and base for the given size."""
-    for i, suffix in enumerate(suffixes):
-        unit = base ** i
-        if size < unit * base:
-            break
-    return unit, suffix
-
-
-def decimal(
-    size: int,
-    *,
-    precision: Optional[int] = 1,
-    separator: Optional[str] = " ",
-) -> str:
-    """Convert a filesize in to a string (powers of 1000, SI prefixes).
-
-    In this convention, ``1000 B = 1 kB``.
-
-    This is typically the format used to advertise the storage
-    capacity of USB flash drives and the like (*256 MB* meaning
-    actually a storage capacity of more than *256 000 000 B*),
-    or used by **Mac OS X** since v10.6 to report file sizes.
-
-    Arguments:
-        int (size): A file size.
-        int (precision): The number of decimal places to include (default = 1).
-        str (separator): The string to separate the value from the units (default = " ").
-
-    Returns:
-        `str`: A string containing a abbreviated file size and units.
-
-    Example:
-        >>> filesize.decimal(30000)
-        '30.0 kB'
-        >>> filesize.decimal(30000, precision=2, separator="")
-        '30.00kB'
-
-    """
-    return _to_str(
-        size,
-        ("kB", "MB", "GB", "TB", "PB", "EB", "ZB", "YB"),
-        1000,
-        precision=precision,
-        separator=separator,
-    )
diff --git a/spaces/profayle/TerrapinTalk/myenv/lib/python3.9/site-packages/tqdm/contrib/slack.py b/spaces/profayle/TerrapinTalk/myenv/lib/python3.9/site-packages/tqdm/contrib/slack.py
deleted file mode 100644
index d4c850ca403c2337d50bdc0acaad6ba7d9c39666..0000000000000000000000000000000000000000
--- a/spaces/profayle/TerrapinTalk/myenv/lib/python3.9/site-packages/tqdm/contrib/slack.py
+++ /dev/null
@@ -1,120 +0,0 @@
-"""
-Sends updates to a Slack app.
-
-Usage:
->>> from tqdm.contrib.slack import tqdm, trange
->>> for i in trange(10, token='{token}', channel='{channel}'):
-...     ...
-
-![screenshot](https://tqdm.github.io/img/screenshot-slack.png)
-"""
-import logging
-from os import getenv
-
-try:
-    from slack_sdk import WebClient
-except ImportError:
-    raise ImportError("Please `pip install slack-sdk`")
-
-from ..auto import tqdm as tqdm_auto
-from .utils_worker import MonoWorker
-
-__author__ = {"github.com/": ["0x2b3bfa0", "casperdcl"]}
-__all__ = ['SlackIO', 'tqdm_slack', 'tsrange', 'tqdm', 'trange']
-
-
-class SlackIO(MonoWorker):
-    """Non-blocking file-like IO using a Slack app."""
-    def __init__(self, token, channel):
-        """Creates a new message in the given `channel`."""
-        super(SlackIO, self).__init__()
-        self.client = WebClient(token=token)
-        self.text = self.__class__.__name__
-        try:
-            self.message = self.client.chat_postMessage(channel=channel, text=self.text)
-        except Exception as e:
-            tqdm_auto.write(str(e))
-            self.message = None
-
-    def write(self, s):
-        """Replaces internal `message`'s text with `s`."""
-        if not s:
-            s = "..."
-        s = s.replace('\r', '').strip()
-        if s == self.text:
-            return  # skip duplicate message
-        message = self.message
-        if message is None:
-            return
-        self.text = s
-        try:
-            future = self.submit(self.client.chat_update, channel=message['channel'],
-                                 ts=message['ts'], text='`' + s + '`')
-        except Exception as e:
-            tqdm_auto.write(str(e))
-        else:
-            return future
-
-
-class tqdm_slack(tqdm_auto):
-    """
-    Standard `tqdm.auto.tqdm` but also sends updates to a Slack app.
-    May take a few seconds to create (`__init__`).
-
-    - create a Slack app with the `chat:write` scope & invite it to a
-      channel: <https://api.slack.com/authentication/basics>
-    - copy the bot `{token}` & `{channel}` and paste below
-    >>> from tqdm.contrib.slack import tqdm, trange
-    >>> for i in tqdm(iterable, token='{token}', channel='{channel}'):
-    ...     ...
-    """
-    def __init__(self, *args, **kwargs):
-        """
-        Parameters
-        ----------
-        token  : str, required. Slack token
-            [default: ${TQDM_SLACK_TOKEN}].
-        channel  : int, required. Slack channel
-            [default: ${TQDM_SLACK_CHANNEL}].
-        mininterval  : float, optional.
-          Minimum of [default: 1.5] to avoid rate limit.
-
-        See `tqdm.auto.tqdm.__init__` for other parameters.
-        """
-        if not kwargs.get('disable'):
-            kwargs = kwargs.copy()
-            logging.getLogger("HTTPClient").setLevel(logging.WARNING)
-            self.sio = SlackIO(
-                kwargs.pop('token', getenv("TQDM_SLACK_TOKEN")),
-                kwargs.pop('channel', getenv("TQDM_SLACK_CHANNEL")))
-            kwargs['mininterval'] = max(1.5, kwargs.get('mininterval', 1.5))
-        super(tqdm_slack, self).__init__(*args, **kwargs)
-
-    def display(self, **kwargs):
-        super(tqdm_slack, self).display(**kwargs)
-        fmt = self.format_dict
-        if fmt.get('bar_format', None):
-            fmt['bar_format'] = fmt['bar_format'].replace(
-                '<bar/>', '`{bar:10}`').replace('{bar}', '`{bar:10u}`')
-        else:
-            fmt['bar_format'] = '{l_bar}`{bar:10}`{r_bar}'
-        if fmt['ascii'] is False:
-            fmt['ascii'] = [":black_square:", ":small_blue_diamond:", ":large_blue_diamond:",
-                            ":large_blue_square:"]
-            fmt['ncols'] = 336
-        self.sio.write(self.format_meter(**fmt))
-
-    def clear(self, *args, **kwargs):
-        super(tqdm_slack, self).clear(*args, **kwargs)
-        if not self.disable:
-            self.sio.write("")
-
-
-def tsrange(*args, **kwargs):
-    """Shortcut for `tqdm.contrib.slack.tqdm(range(*args), **kwargs)`."""
-    return tqdm_slack(range(*args), **kwargs)
-
-
-# Aliases
-tqdm = tqdm_slack
-trange = tsrange
diff --git a/spaces/profayle/TerrapinTalk/myenv/lib/python3.9/site-packages/websockets/http11.py b/spaces/profayle/TerrapinTalk/myenv/lib/python3.9/site-packages/websockets/http11.py
deleted file mode 100644
index ec4e3b8b7d5b84c9db160dbb725b83e457ad4424..0000000000000000000000000000000000000000
--- a/spaces/profayle/TerrapinTalk/myenv/lib/python3.9/site-packages/websockets/http11.py
+++ /dev/null
@@ -1,364 +0,0 @@
-from __future__ import annotations
-
-import dataclasses
-import re
-import warnings
-from typing import Callable, Generator, Optional
-
-from . import datastructures, exceptions
-
-
-# Maximum total size of headers is around 128 * 8 KiB = 1 MiB.
-MAX_HEADERS = 128
-
-# Limit request line and header lines. 8KiB is the most common default
-# configuration of popular HTTP servers.
-MAX_LINE = 8192
-
-# Support for HTTP response bodies is intended to read an error message
-# returned by a server. It isn't designed to perform large file transfers.
-MAX_BODY = 2**20  # 1 MiB
-
-
-def d(value: bytes) -> str:
-    """
-    Decode a bytestring for interpolating into an error message.
-
-    """
-    return value.decode(errors="backslashreplace")
-
-
-# See https://www.rfc-editor.org/rfc/rfc7230.html#appendix-B.
-
-# Regex for validating header names.
-
-_token_re = re.compile(rb"[-!#$%&\'*+.^_`|~0-9a-zA-Z]+")
-
-# Regex for validating header values.
-
-# We don't attempt to support obsolete line folding.
-
-# Include HTAB (\x09), SP (\x20), VCHAR (\x21-\x7e), obs-text (\x80-\xff).
-
-# The ABNF is complicated because it attempts to express that optional
-# whitespace is ignored. We strip whitespace and don't revalidate that.
-
-# See also https://www.rfc-editor.org/errata_search.php?rfc=7230&eid=4189
-
-_value_re = re.compile(rb"[\x09\x20-\x7e\x80-\xff]*")
-
-
-@dataclasses.dataclass
-class Request:
-    """
-    WebSocket handshake request.
-
-    Attributes:
-        path: Request path, including optional query.
-        headers: Request headers.
-    """
-
-    path: str
-    headers: datastructures.Headers
-    # body isn't useful is the context of this library.
-
-    _exception: Optional[Exception] = None
-
-    @property
-    def exception(self) -> Optional[Exception]:  # pragma: no cover
-        warnings.warn(
-            "Request.exception is deprecated; "
-            "use ServerProtocol.handshake_exc instead",
-            DeprecationWarning,
-        )
-        return self._exception
-
-    @classmethod
-    def parse(
-        cls,
-        read_line: Callable[[int], Generator[None, None, bytes]],
-    ) -> Generator[None, None, Request]:
-        """
-        Parse a WebSocket handshake request.
-
-        This is a generator-based coroutine.
-
-        The request path isn't URL-decoded or validated in any way.
-
-        The request path and headers are expected to contain only ASCII
-        characters. Other characters are represented with surrogate escapes.
-
-        :meth:`parse` doesn't attempt to read the request body because
-        WebSocket handshake requests don't have one. If the request contains a
-        body, it may be read from the data stream after :meth:`parse` returns.
-
-        Args:
-            read_line: generator-based coroutine that reads a LF-terminated
-                line or raises an exception if there isn't enough data
-
-        Raises:
-            EOFError: if the connection is closed without a full HTTP request.
-            SecurityError: if the request exceeds a security limit.
-            ValueError: if the request isn't well formatted.
-
-        """
-        # https://www.rfc-editor.org/rfc/rfc7230.html#section-3.1.1
-
-        # Parsing is simple because fixed values are expected for method and
-        # version and because path isn't checked. Since WebSocket software tends
-        # to implement HTTP/1.1 strictly, there's little need for lenient parsing.
-
-        try:
-            request_line = yield from parse_line(read_line)
-        except EOFError as exc:
-            raise EOFError("connection closed while reading HTTP request line") from exc
-
-        try:
-            method, raw_path, version = request_line.split(b" ", 2)
-        except ValueError:  # not enough values to unpack (expected 3, got 1-2)
-            raise ValueError(f"invalid HTTP request line: {d(request_line)}") from None
-
-        if method != b"GET":
-            raise ValueError(f"unsupported HTTP method: {d(method)}")
-        if version != b"HTTP/1.1":
-            raise ValueError(f"unsupported HTTP version: {d(version)}")
-        path = raw_path.decode("ascii", "surrogateescape")
-
-        headers = yield from parse_headers(read_line)
-
-        # https://www.rfc-editor.org/rfc/rfc7230.html#section-3.3.3
-
-        if "Transfer-Encoding" in headers:
-            raise NotImplementedError("transfer codings aren't supported")
-
-        if "Content-Length" in headers:
-            raise ValueError("unsupported request body")
-
-        return cls(path, headers)
-
-    def serialize(self) -> bytes:
-        """
-        Serialize a WebSocket handshake request.
-
-        """
-        # Since the request line and headers only contain ASCII characters,
-        # we can keep this simple.
-        request = f"GET {self.path} HTTP/1.1\r\n".encode()
-        request += self.headers.serialize()
-        return request
-
-
-@dataclasses.dataclass
-class Response:
-    """
-    WebSocket handshake response.
-
-    Attributes:
-        status_code: Response code.
-        reason_phrase: Response reason.
-        headers: Response headers.
-        body: Response body, if any.
-
-    """
-
-    status_code: int
-    reason_phrase: str
-    headers: datastructures.Headers
-    body: Optional[bytes] = None
-
-    _exception: Optional[Exception] = None
-
-    @property
-    def exception(self) -> Optional[Exception]:  # pragma: no cover
-        warnings.warn(
-            "Response.exception is deprecated; "
-            "use ClientProtocol.handshake_exc instead",
-            DeprecationWarning,
-        )
-        return self._exception
-
-    @classmethod
-    def parse(
-        cls,
-        read_line: Callable[[int], Generator[None, None, bytes]],
-        read_exact: Callable[[int], Generator[None, None, bytes]],
-        read_to_eof: Callable[[int], Generator[None, None, bytes]],
-    ) -> Generator[None, None, Response]:
-        """
-        Parse a WebSocket handshake response.
-
-        This is a generator-based coroutine.
-
-        The reason phrase and headers are expected to contain only ASCII
-        characters. Other characters are represented with surrogate escapes.
-
-        Args:
-            read_line: generator-based coroutine that reads a LF-terminated
-                line or raises an exception if there isn't enough data.
-            read_exact: generator-based coroutine that reads the requested
-                bytes or raises an exception if there isn't enough data.
-            read_to_eof: generator-based coroutine that reads until the end
-                of the stream.
-
-        Raises:
-            EOFError: if the connection is closed without a full HTTP response.
-            SecurityError: if the response exceeds a security limit.
-            LookupError: if the response isn't well formatted.
-            ValueError: if the response isn't well formatted.
-
-        """
-        # https://www.rfc-editor.org/rfc/rfc7230.html#section-3.1.2
-
-        try:
-            status_line = yield from parse_line(read_line)
-        except EOFError as exc:
-            raise EOFError("connection closed while reading HTTP status line") from exc
-
-        try:
-            version, raw_status_code, raw_reason = status_line.split(b" ", 2)
-        except ValueError:  # not enough values to unpack (expected 3, got 1-2)
-            raise ValueError(f"invalid HTTP status line: {d(status_line)}") from None
-
-        if version != b"HTTP/1.1":
-            raise ValueError(f"unsupported HTTP version: {d(version)}")
-        try:
-            status_code = int(raw_status_code)
-        except ValueError:  # invalid literal for int() with base 10
-            raise ValueError(
-                f"invalid HTTP status code: {d(raw_status_code)}"
-            ) from None
-        if not 100 <= status_code < 1000:
-            raise ValueError(f"unsupported HTTP status code: {d(raw_status_code)}")
-        if not _value_re.fullmatch(raw_reason):
-            raise ValueError(f"invalid HTTP reason phrase: {d(raw_reason)}")
-        reason = raw_reason.decode()
-
-        headers = yield from parse_headers(read_line)
-
-        # https://www.rfc-editor.org/rfc/rfc7230.html#section-3.3.3
-
-        if "Transfer-Encoding" in headers:
-            raise NotImplementedError("transfer codings aren't supported")
-
-        # Since websockets only does GET requests (no HEAD, no CONNECT), all
-        # responses except 1xx, 204, and 304 include a message body.
-        if 100 <= status_code < 200 or status_code == 204 or status_code == 304:
-            body = None
-        else:
-            content_length: Optional[int]
-            try:
-                # MultipleValuesError is sufficiently unlikely that we don't
-                # attempt to handle it. Instead we document that its parent
-                # class, LookupError, may be raised.
-                raw_content_length = headers["Content-Length"]
-            except KeyError:
-                content_length = None
-            else:
-                content_length = int(raw_content_length)
-
-            if content_length is None:
-                try:
-                    body = yield from read_to_eof(MAX_BODY)
-                except RuntimeError:
-                    raise exceptions.SecurityError(
-                        f"body too large: over {MAX_BODY} bytes"
-                    )
-            elif content_length > MAX_BODY:
-                raise exceptions.SecurityError(
-                    f"body too large: {content_length} bytes"
-                )
-            else:
-                body = yield from read_exact(content_length)
-
-        return cls(status_code, reason, headers, body)
-
-    def serialize(self) -> bytes:
-        """
-        Serialize a WebSocket handshake response.
-
-        """
-        # Since the status line and headers only contain ASCII characters,
-        # we can keep this simple.
-        response = f"HTTP/1.1 {self.status_code} {self.reason_phrase}\r\n".encode()
-        response += self.headers.serialize()
-        if self.body is not None:
-            response += self.body
-        return response
-
-
-def parse_headers(
-    read_line: Callable[[int], Generator[None, None, bytes]],
-) -> Generator[None, None, datastructures.Headers]:
-    """
-    Parse HTTP headers.
-
-    Non-ASCII characters are represented with surrogate escapes.
-
-    Args:
-        read_line: generator-based coroutine that reads a LF-terminated line
-            or raises an exception if there isn't enough data.
-
-    Raises:
-        EOFError: if the connection is closed without complete headers.
-        SecurityError: if the request exceeds a security limit.
-        ValueError: if the request isn't well formatted.
-
-    """
-    # https://www.rfc-editor.org/rfc/rfc7230.html#section-3.2
-
-    # We don't attempt to support obsolete line folding.
-
-    headers = datastructures.Headers()
-    for _ in range(MAX_HEADERS + 1):
-        try:
-            line = yield from parse_line(read_line)
-        except EOFError as exc:
-            raise EOFError("connection closed while reading HTTP headers") from exc
-        if line == b"":
-            break
-
-        try:
-            raw_name, raw_value = line.split(b":", 1)
-        except ValueError:  # not enough values to unpack (expected 2, got 1)
-            raise ValueError(f"invalid HTTP header line: {d(line)}") from None
-        if not _token_re.fullmatch(raw_name):
-            raise ValueError(f"invalid HTTP header name: {d(raw_name)}")
-        raw_value = raw_value.strip(b" \t")
-        if not _value_re.fullmatch(raw_value):
-            raise ValueError(f"invalid HTTP header value: {d(raw_value)}")
-
-        name = raw_name.decode("ascii")  # guaranteed to be ASCII at this point
-        value = raw_value.decode("ascii", "surrogateescape")
-        headers[name] = value
-
-    else:
-        raise exceptions.SecurityError("too many HTTP headers")
-
-    return headers
-
-
-def parse_line(
-    read_line: Callable[[int], Generator[None, None, bytes]],
-) -> Generator[None, None, bytes]:
-    """
-    Parse a single line.
-
-    CRLF is stripped from the return value.
-
-    Args:
-        read_line: generator-based coroutine that reads a LF-terminated line
-            or raises an exception if there isn't enough data.
-
-    Raises:
-        EOFError: if the connection is closed without a CRLF.
-        SecurityError: if the response exceeds a security limit.
-
-    """
-    try:
-        line = yield from read_line(MAX_LINE)
-    except RuntimeError:
-        raise exceptions.SecurityError("line too long")
-    # Not mandatory but safe - https://www.rfc-editor.org/rfc/rfc7230.html#section-3.5
-    if not line.endswith(b"\r\n"):
-        raise EOFError("line without CRLF")
-    return line[:-2]
diff --git a/spaces/quidiaMuxgu/Expedit-SAM/Beersmith 2 Version 2.1.02 Activation Key __EXCLUSIVE__.md b/spaces/quidiaMuxgu/Expedit-SAM/Beersmith 2 Version 2.1.02 Activation Key __EXCLUSIVE__.md
deleted file mode 100644
index d32dd3545f8c9d7b168e430efe080ea166bcd480..0000000000000000000000000000000000000000
--- a/spaces/quidiaMuxgu/Expedit-SAM/Beersmith 2 Version 2.1.02 Activation Key __EXCLUSIVE__.md	
+++ /dev/null
@@ -1,11 +0,0 @@
-<h2>beersmith 2 version 2.1.02 activation key</h2><br /><p><b><b>Download File</b> &#10042; <a href="https://geags.com/2uCq07">https://geags.com/2uCq07</a></b></p><br /><br />
-
-Apr 18, 2563 BE - beersmith 2 version 2.1.02 activation key. Mar 24 .... ShowStars - Arina and Oxi avi.rar 172.80 MB. oxi anya,age not too sure . ShowStars ... Arina - ShowStars Ariane, showstars anya, arina showstars, arina & oxi ...
-Ariane, showstars anya, arina showstars, arina & oxi ...
-Showstars, ShowStars Ariane (showstars anya), showstars arina, arina ...
-Showstars, ShowStars Ariane, showstars anya, arina showstars, arina & oxi...
-Ariane, showstars anya, arina showstars, arina & oxi...
-Ariane, showstars anya, arina showstars, arina & oxi... 8a78ff9644<br />
-<br />
-<br />
-<p></p>
diff --git a/spaces/quidiaMuxgu/Expedit-SAM/FC2 PPV 389339 Mp4 [TOP].md b/spaces/quidiaMuxgu/Expedit-SAM/FC2 PPV 389339 Mp4 [TOP].md
deleted file mode 100644
index 29c513270c4c10590662da6b1d7f5647b48b09d5..0000000000000000000000000000000000000000
--- a/spaces/quidiaMuxgu/Expedit-SAM/FC2 PPV 389339 Mp4 [TOP].md	
+++ /dev/null
@@ -1,6 +0,0 @@
-<h2>FC2 PPV 389339 Mp4</h2><br /><p><b><b>DOWNLOAD</b> &#9889; <a href="https://geags.com/2uCq6Q">https://geags.com/2uCq6Q</a></b></p><br /><br />
-<br />
- 3cee63e6c2<br />
-<br />
-<br />
-<p></p>
diff --git a/spaces/quidiaMuxgu/Expedit-SAM/Flash Loader 7.4.7 Ssg V0.1 Lite Exe Blood Bordell Deutsc.md b/spaces/quidiaMuxgu/Expedit-SAM/Flash Loader 7.4.7 Ssg V0.1 Lite Exe Blood Bordell Deutsc.md
deleted file mode 100644
index b0b6a255453d57fdd219baf75711c991c64ec0c5..0000000000000000000000000000000000000000
--- a/spaces/quidiaMuxgu/Expedit-SAM/Flash Loader 7.4.7 Ssg V0.1 Lite Exe Blood Bordell Deutsc.md	
+++ /dev/null
@@ -1,9 +0,0 @@
-<h2>Flash Loader 7.4.7 Ssg V0.1 Lite Exe blood bordell deutsc</h2><br /><p><b><b>Download</b> &#8250;&#8250;&#8250; <a href="https://geags.com/2uCreE">https://geags.com/2uCreE</a></b></p><br /><br />
-<br />
-Flash Loader 7.4.7 Ssg V0.1 Lite Exe blood bordell deutsc · LOADING: · 372a6038bc. Related · X Force X32 Exe Product Design Suite 2010 ... X Force X32 Exe Product Design Suite 2010 Free Download Without Registration . ...
-Download X Force X32 Exe Product Design Suite 2010 Download ...
-Download X Force X32 Exe Product Design Suite 2010 Free Download Without ...
-X force X32 exe product design su 8a78ff9644<br />
-<br />
-<br />
-<p></p>
diff --git a/spaces/quidiaMuxgu/Expedit-SAM/GridinSoft Anti-Malware 4.1 Crack.md b/spaces/quidiaMuxgu/Expedit-SAM/GridinSoft Anti-Malware 4.1 Crack.md
deleted file mode 100644
index 5861bbc43ba602eb97cb8ad8180ce3091cd817ab..0000000000000000000000000000000000000000
--- a/spaces/quidiaMuxgu/Expedit-SAM/GridinSoft Anti-Malware 4.1 Crack.md	
+++ /dev/null
@@ -1,38 +0,0 @@
-<h2>GridinSoft Anti-Malware 4.1 Crack</h2><br /><p><b><b>DOWNLOAD</b> &gt; <a href="https://geags.com/2uCr12">https://geags.com/2uCr12</a></b></p><br /><br />
-
-It can detect malware which are hiding in your system, removing malicious entries, block access to malicious websites and can find and kill malware using a malware database. This powerful anti-malware tool will clean your computer from any malware and will keep your computer safe.
-
-GridinSoft Anti-Malware 4.1.89.5255 full version is free to download and use for all versions of Windows operating systems, including Windows 10, 8.1, 8, 7, Vista and XP. This free anti-malware solution is easy to use and can be installed in a few simple steps. You can install GridinSoft Anti-Malware 4.1.89.5255 full version on your PC for free. It will remove all types of malware and will keep your computer secure by protecting it against malware. It includes database of malicious entries, which will help you to remove malicious applications and files from your system. With the help of this anti-malware software you will keep your computer safe. This anti-malware tool will monitor your system for malware and will update its database to find new threats. It will keep your system safe and can identify viruses and worms.
-
-Key Features of GridinSoft Anti-Malware 4.1.89.5255:-
-
-The program is one of the best anti-malware software which has the ability to identify and remove malicious applications.
-
-The program supports all the versions of Windows operating systems, including Windows XP, Vista, 7, 8, 8.1 and 10.
-
-The GridinSoft Anti-Malware 4.1.89.5255 can identify threats and remove them from your computer.
-
-It is a free anti-malware tool which can easily remove threats.
-
-This software can remove any type of malware.
-
-The software can be easily installed on your computer.
-
-The program is safe and can protect your system from malicious attacks.
-
-It includes the inbuilt scanner which will keep your system secure by protecting against known and unknown threats.
-
-This software is easy to use and can easily scan your system to detect all kinds of threats.
-
-It can be used for free of cost.
-
-This anti-malware software includes a database of known threats.
-
-It is one of the best anti-malware software which can easily remove threats from your computer.
-
-A database of unknown threats will help you to identify threats and remove them from your system.
-
-The 4fefd39f24<br />
-<br />
-<br />
-<p></p>
diff --git a/spaces/quidiaMuxgu/Expedit-SAM/Just Cause 4 Gold Edition RePack [Full] _HOT_.md b/spaces/quidiaMuxgu/Expedit-SAM/Just Cause 4 Gold Edition RePack [Full] _HOT_.md
deleted file mode 100644
index 66564703bef26635cf9ce0f4d1c9f1e5e622deaf..0000000000000000000000000000000000000000
--- a/spaces/quidiaMuxgu/Expedit-SAM/Just Cause 4 Gold Edition RePack [Full] _HOT_.md	
+++ /dev/null
@@ -1,9 +0,0 @@
-<br />
-<p>welcome to solis, a huge south american world home of conflict, oppression and extreme weather conditions. just cause 4 sees rogue agent rico rodriguez land in solis to hunt down the truth about his past, at any cost. strap into your wingsuit, equip your fully customizable grappling hook, and get ready to bring the thunder!</p>
-<h2>Just Cause 4: Gold Edition RePack [Full]</h2><br /><p><b><b>Download File</b>  <a href="https://geags.com/2uCsWe">https://geags.com/2uCsWe</a></b></p><br /><br />
-<p>the ultimate just cause experience is expanded to four additional locations. own the mountain, discover the island of solis, and obliterate your enemies. just cause 4 delivers the most extreme game you will ever play. the last just cause, just cause 3, was one of the best games that i had played. solis - solis is a big, bright and beautiful island; is a tropical environment where you explore, blow things up, steal cars and drive through deserted areas. it’s a simple game, but it’s just awesome. just cause 2 is where you’ll fight against the military. it’s a sandbox game where you can steal their vehicles, blow up their helicopters, blow up their car bombs, destroy their bases, and finally drive into their military camp and destroy their vehicles.</p>
-<p>it's a simulation and sandbox game. it lets the player to do, explore, blow up, demolish, fly over and inside a world of toys to see how it all works. with full modding support and easy community support, it's the most user-friendly game with the most content. the game never gets boring. you can go at any speed you want, jump any height, fly any model, steal any car, blow up any car, blow up houses, blow up tanks. just cause is about you.</p>
-<p>you think you are on the right track? cause 2 comes in an extensive and deep story mode, which lets the player to play cooperatively with up to three friends and fight alongside of them on the island. just cause is a self-contained story, but the two just cause games are a great expansion for the original game. just cause is a free to play game that you can buy in-game items with real money. the game never gets boring. you can go at any speed you want, jump any height, fly any model, steal any car, blow up any car, blow up houses, blow up tanks. just cause is about you.</p>
-<p></p> 899543212b<br />
-<br />
-<br />
\ No newline at end of file
diff --git a/spaces/quidiaMuxgu/Expedit-SAM/MY.WIFE.IS.A.GANGSTER.2001.DVDrip.Swesub.XviD.AC3-Mr KeFF.md b/spaces/quidiaMuxgu/Expedit-SAM/MY.WIFE.IS.A.GANGSTER.2001.DVDrip.Swesub.XviD.AC3-Mr KeFF.md
deleted file mode 100644
index dd9cf9bd3db9e8910d6fac76967c7e3c499f2dbd..0000000000000000000000000000000000000000
--- a/spaces/quidiaMuxgu/Expedit-SAM/MY.WIFE.IS.A.GANGSTER.2001.DVDrip.Swesub.XviD.AC3-Mr KeFF.md	
+++ /dev/null
@@ -1,6 +0,0 @@
-<h2>MY.WIFE.IS.A.GANGSTER.2001.DVDrip.Swesub.XviD.AC3-Mr KeFF</h2><br /><p><b><b>DOWNLOAD</b> &gt;&gt;&gt; <a href="https://geags.com/2uCrGy">https://geags.com/2uCrGy</a></b></p><br /><br />
-<br />
-Aga Khan University School of Nursing: Established in 1980, Aga Khan University School of Nursing (AKU-SON) was the first academic ... 1fdad05405<br />
-<br />
-<br />
-<p></p>
diff --git a/spaces/quidiaMuxgu/Expedit-SAM/Molebox Virtualization Solution 4.5411 Crack.md b/spaces/quidiaMuxgu/Expedit-SAM/Molebox Virtualization Solution 4.5411 Crack.md
deleted file mode 100644
index c57886d4ad5b017573fb0d4a5951ee19048cce70..0000000000000000000000000000000000000000
--- a/spaces/quidiaMuxgu/Expedit-SAM/Molebox Virtualization Solution 4.5411 Crack.md	
+++ /dev/null
@@ -1,30 +0,0 @@
-<br />
-<h1>What is Molebox Virtualization Solution 4.5411 and How Does It Work?</h1>
-<p>Molebox Virtualization Solution 4.5411 is a software tool that allows developers to create portable and secure applications that run without installation or dependencies on any Windows system. It works by creating a virtual environment for the application and embedding all the necessary files, components, registry entries and settings into a single executable file. This way, the application can run independently from the underlying operating system and other software installed on the host device.</p>
-<p>Molebox Virtualization Solution 4.5411 has many benefits for both developers and end-users. For developers, it simplifies the software distribution process, reduces the testing and support costs, protects the application from unauthorized modifications and reverse engineering, and avoids conflicts with other applications or versions. For end-users, it enables them to run the application from any source, such as a USB device, a CD-ROM, or a network drive, without requiring administrator privileges or altering the host device file system or registry.</p>
-<h2>Molebox Virtualization Solution 4.5411 Crack</h2><br /><p><b><b>Download Zip</b> &#9675;&#9675;&#9675; <a href="https://geags.com/2uCrED">https://geags.com/2uCrED</a></b></p><br /><br />
-<p>Molebox Virtualization Solution 4.5411 supports a wide range of applications, including .NET, Visual Basic, Delphi, C++, Java, and more. It also supports various types of files, such as DLLs, ActiveX components, media files, fonts, and data files. Molebox Virtualization Solution 4.5411 can create stand-alone executables or multiple packages that can be delivered as updates or add-ons. Molebox Virtualization Solution 4.5411 also compresses and encrypts the embedded files, reducing the size of the executable and enhancing its security.</p>
-<p>Molebox Virtualization Solution 4.5411 is a product of Teggo Software Ltd., a company that specializes in software protection and virtualization solutions. The latest version of Molebox Virtualization Solution is 4.5411, which was released in 2012. The product is no longer supported or updated by the company[^3^] . However, it is still available for download from various sources on the web[^1^] [^2^].</p>
-
-<p>How to use Molebox Virtualization Solution 4.5411</p>
-<p>To use Molebox Virtualization Solution 4.5411, you need to download and install the software from a reliable source[^1^] . After installation, you can launch the Molebox VS GUI application, which provides a user-friendly interface for creating and managing your packages. Alternatively, you can use the Molebox VS command-line tool, which allows you to automate the packaging process using scripts or batch files.</p>
-<p>The basic steps for creating a package with Molebox VS are as follows:</p>
-<ol>
-<li>Select the main executable file of your application and specify its parameters.</li>
-<li>Add any additional files or folders that your application requires, such as DLLs, media files, data files, etc.</li>
-<li>Configure the virtual file system and registry settings for your package.</li>
-<li>Choose the output options, such as compression level, encryption key, splash screen, icon, etc.</li>
-<li>Build the package and test it on different systems.</li>
-</ol>
-<p>Molebox VS provides various options and features that allow you to customize your package according to your needs. For example, you can:</p>
-<ul>
-<li>Create multiple packages for different versions or editions of your application.</li>
-<li>Create updates or add-ons for your existing packages.</li>
-<li>Embed license keys or serial numbers into your packages.</li>
-<li>Protect your packages with passwords or hardware IDs.</li>
-<li>Use custom scripts or plugins to extend the functionality of your packages.</li>
-</ul>
-<p>Molebox VS also provides a comprehensive help file and a user manual that explain how to use the software in detail. You can also find tutorials and examples on the official website[^1^] or on other online sources[^2^] .</p>
-<p></p> d5da3c52bf<br />
-<br />
-<br />
\ No newline at end of file
diff --git a/spaces/qwe3107231/Real-CUGAN/app.py b/spaces/qwe3107231/Real-CUGAN/app.py
deleted file mode 100644
index 6b4b12aa54a7d3b79ece546421c6b9a01f7dd0c3..0000000000000000000000000000000000000000
--- a/spaces/qwe3107231/Real-CUGAN/app.py
+++ /dev/null
@@ -1,74 +0,0 @@
-from upcunet_v3 import RealWaifuUpScaler
-import argparse
-import gradio as gr
-import time
-import logging
-import os
-from PIL import ImageOps
-import numpy as np
-import math
-
-def parse_args() -> argparse.Namespace:
-    parser = argparse.ArgumentParser()
-    parser.add_argument('--disable-queue',
-                        dest='enable_queue',
-                        action='store_false')
-    return parser.parse_args()
-
-
-
-
-def greet(input_img, input_model_name, input_tile_mode):
-    # if input_img.size[0] * input_img.size[1] > 256 * 256:
-    #     y = int(math.sqrt(256*256/input_img.size[0]*input_img.size[1]))
-    #     x = int(input_img.size[0]/input_img.size[1]*y)
-    #     input_img = ImageOps.fit(input_img, (x, y))
-    input_img = np.array(input_img)
-    if input_model_name not in model_cache:
-        t1 = time.time()
-        upscaler = RealWaifuUpScaler(input_model_name[2], ModelPath + input_model_name, half=False, device="cpu")
-        t2 = time.time()
-        logger.info(f'load model time, {t2 - t1}')
-        model_cache[input_model_name] = upscaler
-    else:
-        upscaler = model_cache[input_model_name]
-        logger.info(f'load model from cache')
-
-    start = time.time()
-    result = upscaler(input_img, tile_mode=input_tile_mode)
-    end = time.time()
-    logger.info(f'input_model_name, {input_model_name}')
-    logger.info(f'input_tile_mode, {input_tile_mode}')
-    logger.info(f'input shape, {input_img.shape}')
-    logger.info(f'output shape, {result.shape}')
-    logger.info(f'speed time, {end - start}')
-    return result
-
-
-if __name__ == '__main__':
-    logging.basicConfig(level=logging.INFO, format="[%(asctime)s] [%(process)d] [%(levelname)s] %(message)s")
-    logger = logging.getLogger()
-    args = parse_args()
-    ModelPath = "weights_v3/"
-    model_cache = {}
-
-    input_model_name = gr.inputs.Dropdown(os.listdir(ModelPath), default="up2x-latest-denoise2x.pth", label='选择model')
-    input_tile_mode = gr.inputs.Dropdown([0, 1, 2, 3, 4], default=2, label='选择tile_mode')
-    input_img = gr.inputs.Image(label='image', type='pil')
-
-    inputs = [input_img, input_model_name, input_tile_mode]
-    outputs = "image"
-    iface = gr.Interface(fn=greet,
-                         inputs=inputs,
-                         outputs=outputs,
-                         allow_screenshot=False,
-                         allow_flagging='never',
-                         examples=[['test-img.jpg', "up2x-latest-denoise2x.pth", 2]],
-                         article='[https://github.com/bilibili/ailab/tree/main/Real-CUGAN](https://github.com/bilibili/ailab/tree/main/Real-CUGAN)<br>'
-                                 '感谢b站开源的项目，图片过大会导致内存不足，所有我将图片裁剪小，想体验大图片的效果请自行前往上面的链接。<br>'
-                                 '修改bbb'
-                                 'The large image will lead to memory limit exceeded. So I crop and resize image. '
-                                 'If you want to experience the large image, please go to the link above.')
-    iface.launch(
-      enable_queue=args.enable_queue
-    )
diff --git a/spaces/r3gm/Aesthetic_RVC_Inference_HF/lib/tools/torchgate/torchgate.py b/spaces/r3gm/Aesthetic_RVC_Inference_HF/lib/tools/torchgate/torchgate.py
deleted file mode 100644
index 086f2ab38e4ad79e432a51c38ed7e59defae0acd..0000000000000000000000000000000000000000
--- a/spaces/r3gm/Aesthetic_RVC_Inference_HF/lib/tools/torchgate/torchgate.py
+++ /dev/null
@@ -1,264 +0,0 @@
-import torch
-from torch.nn.functional import conv1d, conv2d
-from typing import Union, Optional
-from .utils import linspace, temperature_sigmoid, amp_to_db
-
-
-class TorchGate(torch.nn.Module):
-    """
-    A PyTorch module that applies a spectral gate to an input signal.
-
-    Arguments:
-        sr {int} -- Sample rate of the input signal.
-        nonstationary {bool} -- Whether to use non-stationary or stationary masking (default: {False}).
-        n_std_thresh_stationary {float} -- Number of standard deviations above mean to threshold noise for
-                                           stationary masking (default: {1.5}).
-        n_thresh_nonstationary {float} -- Number of multiplies above smoothed magnitude spectrogram. for
-                                        non-stationary masking (default: {1.3}).
-        temp_coeff_nonstationary {float} -- Temperature coefficient for non-stationary masking (default: {0.1}).
-        n_movemean_nonstationary {int} -- Number of samples for moving average smoothing in non-stationary masking
-                                          (default: {20}).
-        prop_decrease {float} -- Proportion to decrease signal by where the mask is zero (default: {1.0}).
-        n_fft {int} -- Size of FFT for STFT (default: {1024}).
-        win_length {[int]} -- Window length for STFT. If None, defaults to `n_fft` (default: {None}).
-        hop_length {[int]} -- Hop length for STFT. If None, defaults to `win_length` // 4 (default: {None}).
-        freq_mask_smooth_hz {float} -- Frequency smoothing width for mask (in Hz). If None, no smoothing is applied
-                                     (default: {500}).
-        time_mask_smooth_ms {float} -- Time smoothing width for mask (in ms). If None, no smoothing is applied
-                                     (default: {50}).
-    """
-
-    @torch.no_grad()
-    def __init__(
-        self,
-        sr: int,
-        nonstationary: bool = False,
-        n_std_thresh_stationary: float = 1.5,
-        n_thresh_nonstationary: float = 1.3,
-        temp_coeff_nonstationary: float = 0.1,
-        n_movemean_nonstationary: int = 20,
-        prop_decrease: float = 1.0,
-        n_fft: int = 1024,
-        win_length: bool = None,
-        hop_length: int = None,
-        freq_mask_smooth_hz: float = 500,
-        time_mask_smooth_ms: float = 50,
-    ):
-        super().__init__()
-
-        # General Params
-        self.sr = sr
-        self.nonstationary = nonstationary
-        assert 0.0 <= prop_decrease <= 1.0
-        self.prop_decrease = prop_decrease
-
-        # STFT Params
-        self.n_fft = n_fft
-        self.win_length = self.n_fft if win_length is None else win_length
-        self.hop_length = self.win_length // 4 if hop_length is None else hop_length
-
-        # Stationary Params
-        self.n_std_thresh_stationary = n_std_thresh_stationary
-
-        # Non-Stationary Params
-        self.temp_coeff_nonstationary = temp_coeff_nonstationary
-        self.n_movemean_nonstationary = n_movemean_nonstationary
-        self.n_thresh_nonstationary = n_thresh_nonstationary
-
-        # Smooth Mask Params
-        self.freq_mask_smooth_hz = freq_mask_smooth_hz
-        self.time_mask_smooth_ms = time_mask_smooth_ms
-        self.register_buffer("smoothing_filter", self._generate_mask_smoothing_filter())
-
-    @torch.no_grad()
-    def _generate_mask_smoothing_filter(self) -> Union[torch.Tensor, None]:
-        """
-        A PyTorch module that applies a spectral gate to an input signal using the STFT.
-
-        Returns:
-            smoothing_filter (torch.Tensor): a 2D tensor representing the smoothing filter,
-            with shape (n_grad_freq, n_grad_time), where n_grad_freq is the number of frequency
-            bins to smooth and n_grad_time is the number of time frames to smooth.
-            If both self.freq_mask_smooth_hz and self.time_mask_smooth_ms are None, returns None.
-        """
-        if self.freq_mask_smooth_hz is None and self.time_mask_smooth_ms is None:
-            return None
-
-        n_grad_freq = (
-            1
-            if self.freq_mask_smooth_hz is None
-            else int(self.freq_mask_smooth_hz / (self.sr / (self.n_fft / 2)))
-        )
-        if n_grad_freq < 1:
-            raise ValueError(
-                f"freq_mask_smooth_hz needs to be at least {int((self.sr / (self._n_fft / 2)))} Hz"
-            )
-
-        n_grad_time = (
-            1
-            if self.time_mask_smooth_ms is None
-            else int(self.time_mask_smooth_ms / ((self.hop_length / self.sr) * 1000))
-        )
-        if n_grad_time < 1:
-            raise ValueError(
-                f"time_mask_smooth_ms needs to be at least {int((self.hop_length / self.sr) * 1000)} ms"
-            )
-
-        if n_grad_time == 1 and n_grad_freq == 1:
-            return None
-
-        v_f = torch.cat(
-            [
-                linspace(0, 1, n_grad_freq + 1, endpoint=False),
-                linspace(1, 0, n_grad_freq + 2),
-            ]
-        )[1:-1]
-        v_t = torch.cat(
-            [
-                linspace(0, 1, n_grad_time + 1, endpoint=False),
-                linspace(1, 0, n_grad_time + 2),
-            ]
-        )[1:-1]
-        smoothing_filter = torch.outer(v_f, v_t).unsqueeze(0).unsqueeze(0)
-
-        return smoothing_filter / smoothing_filter.sum()
-
-    @torch.no_grad()
-    def _stationary_mask(
-        self, X_db: torch.Tensor, xn: Optional[torch.Tensor] = None
-    ) -> torch.Tensor:
-        """
-        Computes a stationary binary mask to filter out noise in a log-magnitude spectrogram.
-
-        Arguments:
-            X_db (torch.Tensor): 2D tensor of shape (frames, freq_bins) containing the log-magnitude spectrogram.
-            xn (torch.Tensor): 1D tensor containing the audio signal corresponding to X_db.
-
-        Returns:
-            sig_mask (torch.Tensor): Binary mask of the same shape as X_db, where values greater than the threshold
-            are set to 1, and the rest are set to 0.
-        """
-        if xn is not None:
-            XN = torch.stft(
-                xn,
-                n_fft=self.n_fft,
-                hop_length=self.hop_length,
-                win_length=self.win_length,
-                return_complex=True,
-                pad_mode="constant",
-                center=True,
-                window=torch.hann_window(self.win_length).to(xn.device),
-            )
-
-            XN_db = amp_to_db(XN).to(dtype=X_db.dtype)
-        else:
-            XN_db = X_db
-
-        # calculate mean and standard deviation along the frequency axis
-        std_freq_noise, mean_freq_noise = torch.std_mean(XN_db, dim=-1)
-
-        # compute noise threshold
-        noise_thresh = mean_freq_noise + std_freq_noise * self.n_std_thresh_stationary
-
-        # create binary mask by thresholding the spectrogram
-        sig_mask = X_db > noise_thresh.unsqueeze(2)
-        return sig_mask
-
-    @torch.no_grad()
-    def _nonstationary_mask(self, X_abs: torch.Tensor) -> torch.Tensor:
-        """
-        Computes a non-stationary binary mask to filter out noise in a log-magnitude spectrogram.
-
-        Arguments:
-            X_abs (torch.Tensor): 2D tensor of shape (frames, freq_bins) containing the magnitude spectrogram.
-
-        Returns:
-            sig_mask (torch.Tensor): Binary mask of the same shape as X_abs, where values greater than the threshold
-            are set to 1, and the rest are set to 0.
-        """
-        X_smoothed = (
-            conv1d(
-                X_abs.reshape(-1, 1, X_abs.shape[-1]),
-                torch.ones(
-                    self.n_movemean_nonstationary,
-                    dtype=X_abs.dtype,
-                    device=X_abs.device,
-                ).view(1, 1, -1),
-                padding="same",
-            ).view(X_abs.shape)
-            / self.n_movemean_nonstationary
-        )
-
-        # Compute slowness ratio and apply temperature sigmoid
-        slowness_ratio = (X_abs - X_smoothed) / (X_smoothed + 1e-6)
-        sig_mask = temperature_sigmoid(
-            slowness_ratio, self.n_thresh_nonstationary, self.temp_coeff_nonstationary
-        )
-
-        return sig_mask
-
-    def forward(
-        self, x: torch.Tensor, xn: Optional[torch.Tensor] = None
-    ) -> torch.Tensor:
-        """
-        Apply the proposed algorithm to the input signal.
-
-        Arguments:
-            x (torch.Tensor): The input audio signal, with shape (batch_size, signal_length).
-            xn (Optional[torch.Tensor]): The noise signal used for stationary noise reduction. If `None`, the input
-                                         signal is used as the noise signal. Default: `None`.
-
-        Returns:
-            torch.Tensor: The denoised audio signal, with the same shape as the input signal.
-        """
-        assert x.ndim == 2
-        if x.shape[-1] < self.win_length * 2:
-            raise Exception(f"x must be bigger than {self.win_length * 2}")
-
-        assert xn is None or xn.ndim == 1 or xn.ndim == 2
-        if xn is not None and xn.shape[-1] < self.win_length * 2:
-            raise Exception(f"xn must be bigger than {self.win_length * 2}")
-
-        # Compute short-time Fourier transform (STFT)
-        X = torch.stft(
-            x,
-            n_fft=self.n_fft,
-            hop_length=self.hop_length,
-            win_length=self.win_length,
-            return_complex=True,
-            pad_mode="constant",
-            center=True,
-            window=torch.hann_window(self.win_length).to(x.device),
-        )
-
-        # Compute signal mask based on stationary or nonstationary assumptions
-        if self.nonstationary:
-            sig_mask = self._nonstationary_mask(X.abs())
-        else:
-            sig_mask = self._stationary_mask(amp_to_db(X), xn)
-
-        # Propagate decrease in signal power
-        sig_mask = self.prop_decrease * (sig_mask * 1.0 - 1.0) + 1.0
-
-        # Smooth signal mask with 2D convolution
-        if self.smoothing_filter is not None:
-            sig_mask = conv2d(
-                sig_mask.unsqueeze(1),
-                self.smoothing_filter.to(sig_mask.dtype),
-                padding="same",
-            )
-
-        # Apply signal mask to STFT magnitude and phase components
-        Y = X * sig_mask.squeeze(1)
-
-        # Inverse STFT to obtain time-domain signal
-        y = torch.istft(
-            Y,
-            n_fft=self.n_fft,
-            hop_length=self.hop_length,
-            win_length=self.win_length,
-            center=True,
-            window=torch.hann_window(self.win_length).to(Y.device),
-        )
-
-        return y.to(dtype=x.dtype)
diff --git a/spaces/r3gm/Ultimate-Vocal-Remover-WebUI/lib_v5/vr_network/layers_new.py b/spaces/r3gm/Ultimate-Vocal-Remover-WebUI/lib_v5/vr_network/layers_new.py
deleted file mode 100644
index 33181dd8cdd244f91a684698e075da2ab3ef668e..0000000000000000000000000000000000000000
--- a/spaces/r3gm/Ultimate-Vocal-Remover-WebUI/lib_v5/vr_network/layers_new.py
+++ /dev/null
@@ -1,126 +0,0 @@
-import torch
-from torch import nn
-import torch.nn.functional as F
-
-from lib_v5 import spec_utils
-
-class Conv2DBNActiv(nn.Module):
-
-    def __init__(self, nin, nout, ksize=3, stride=1, pad=1, dilation=1, activ=nn.ReLU):
-        super(Conv2DBNActiv, self).__init__()
-        self.conv = nn.Sequential(
-            nn.Conv2d(
-                nin, nout,
-                kernel_size=ksize,
-                stride=stride,
-                padding=pad,
-                dilation=dilation,
-                bias=False),
-            nn.BatchNorm2d(nout),
-            activ()
-        )
-
-    def __call__(self, x):
-        return self.conv(x)
-
-class Encoder(nn.Module):
-
-    def __init__(self, nin, nout, ksize=3, stride=1, pad=1, activ=nn.LeakyReLU):
-        super(Encoder, self).__init__()
-        self.conv1 = Conv2DBNActiv(nin, nout, ksize, stride, pad, activ=activ)
-        self.conv2 = Conv2DBNActiv(nout, nout, ksize, 1, pad, activ=activ)
-
-    def __call__(self, x):
-        h = self.conv1(x)
-        h = self.conv2(h)
-
-        return h
-
-
-class Decoder(nn.Module):
-
-    def __init__(self, nin, nout, ksize=3, stride=1, pad=1, activ=nn.ReLU, dropout=False):
-        super(Decoder, self).__init__()
-        self.conv1 = Conv2DBNActiv(nin, nout, ksize, 1, pad, activ=activ)
-        # self.conv2 = Conv2DBNActiv(nout, nout, ksize, 1, pad, activ=activ)
-        self.dropout = nn.Dropout2d(0.1) if dropout else None
-
-    def __call__(self, x, skip=None):
-        x = F.interpolate(x, scale_factor=2, mode='bilinear', align_corners=True)
-
-        if skip is not None:
-            skip = spec_utils.crop_center(skip, x)
-            x = torch.cat([x, skip], dim=1)
-
-        h = self.conv1(x)
-        # h = self.conv2(h)
-
-        if self.dropout is not None:
-            h = self.dropout(h)
-
-        return h
-
-
-class ASPPModule(nn.Module):
-
-    def __init__(self, nin, nout, dilations=(4, 8, 12), activ=nn.ReLU, dropout=False):
-        super(ASPPModule, self).__init__()
-        self.conv1 = nn.Sequential(
-            nn.AdaptiveAvgPool2d((1, None)),
-            Conv2DBNActiv(nin, nout, 1, 1, 0, activ=activ)
-        )
-        self.conv2 = Conv2DBNActiv(nin, nout, 1, 1, 0, activ=activ)
-        self.conv3 = Conv2DBNActiv(
-            nin, nout, 3, 1, dilations[0], dilations[0], activ=activ
-        )
-        self.conv4 = Conv2DBNActiv(
-            nin, nout, 3, 1, dilations[1], dilations[1], activ=activ
-        )
-        self.conv5 = Conv2DBNActiv(
-            nin, nout, 3, 1, dilations[2], dilations[2], activ=activ
-        )
-        self.bottleneck = Conv2DBNActiv(nout * 5, nout, 1, 1, 0, activ=activ)
-        self.dropout = nn.Dropout2d(0.1) if dropout else None
-
-    def forward(self, x):
-        _, _, h, w = x.size()
-        feat1 = F.interpolate(self.conv1(x), size=(h, w), mode='bilinear', align_corners=True)
-        feat2 = self.conv2(x)
-        feat3 = self.conv3(x)
-        feat4 = self.conv4(x)
-        feat5 = self.conv5(x)
-        out = torch.cat((feat1, feat2, feat3, feat4, feat5), dim=1)
-        out = self.bottleneck(out)
-
-        if self.dropout is not None:
-            out = self.dropout(out)
-
-        return out
-
-
-class LSTMModule(nn.Module):
-
-    def __init__(self, nin_conv, nin_lstm, nout_lstm):
-        super(LSTMModule, self).__init__()
-        self.conv = Conv2DBNActiv(nin_conv, 1, 1, 1, 0)
-        self.lstm = nn.LSTM(
-            input_size=nin_lstm,
-            hidden_size=nout_lstm // 2,
-            bidirectional=True
-        )
-        self.dense = nn.Sequential(
-            nn.Linear(nout_lstm, nin_lstm),
-            nn.BatchNorm1d(nin_lstm),
-            nn.ReLU()
-        )
-
-    def forward(self, x):
-        N, _, nbins, nframes = x.size()
-        h = self.conv(x)[:, 0]  # N, nbins, nframes
-        h = h.permute(2, 0, 1)  # nframes, N, nbins
-        h, _ = self.lstm(h)
-        h = self.dense(h.reshape(-1, h.size()[-1]))  # nframes * N, nbins
-        h = h.reshape(nframes, N, 1, nbins)
-        h = h.permute(1, 2, 3, 0)
-
-        return h
diff --git a/spaces/raedeXanto/academic-chatgpt-beta/Be2works Rizal Rar 15.md b/spaces/raedeXanto/academic-chatgpt-beta/Be2works Rizal Rar 15.md
deleted file mode 100644
index deeba17f9a2633ad2e7e7d4f1dbe772544cb2a08..0000000000000000000000000000000000000000
--- a/spaces/raedeXanto/academic-chatgpt-beta/Be2works Rizal Rar 15.md	
+++ /dev/null
@@ -1,100 +0,0 @@
-
-<h1>What is Be2works Rizal Rar 15 and why you need it</h1>
-<p>If you have a laptop, you probably know how frustrating it is when your battery dies or stops working properly. You may have to replace it with a new one, which can be expensive and wasteful. Or you may have to deal with poor performance, short runtime, and inaccurate readings.</p>
-<h2>Be2works Rizal Rar 15</h2><br /><p><b><b>Download File</b> > <a href="https://tinourl.com/2uL2CX">https://tinourl.com/2uL2CX</a></b></p><br /><br />
-<p>But what if there was a way to repair and reset your laptop battery without spending a fortune or throwing it away? That's where Be2works Rizal Rar 15 comes in.</p>
-<p>Be2works Rizal Rar 15 is a software tool that allows you to fix and restore your laptop battery in minutes. It works with most laptop brands and models, including Dell, HP, Lenovo, Acer, Asus, Toshiba, Sony, Samsung, and more. It supports various types of batteries, such as Li-ion, Li-polymer, Ni-MH, Ni-Cd, and SLA.</p>
-<p>With Be2works Rizal Rar 15, you can:</p>
-<p></p>
-<ul>
-<li>Save money by repairing your old battery instead of buying a new one.</li>
-<li>Extend your battery life by increasing its capacity and reducing its internal resistance.</li>
-<li>Improve your battery performance by eliminating errors and restoring its original settings.</li>
-<li>Get accurate readings of your battery status by resetting its cycle count, charge level, and calibration.</li>
-</ul>
-<p>Be2works Rizal Rar 15 is easy to use and requires no special skills or equipment. All you need is a computer, a USB cable or an adapter, and a few minutes of your time.</p>
-<h1>How to download and install Be2works Rizal R <h2>How to download and install Be2works Rizal Rar 15</h2>
-<p>Before you can use Be2works Rizal Rar 15 to repair and reset your laptop battery, you need to download and install it on your computer. Here are the steps to follow:</p>
-<h3>Requirements</h3>
-<p>Be2works Rizal Rar 15 is compatible with Windows XP, Vista, 7, 8, and 10. It requires at least 512 MB of RAM and 50 MB of free disk space. It also requires a USB port or an adapter to connect your laptop battery to your computer.</p>
-<p>Be2works Rizal Rar 15 supports most laptop battery models, but not all. You can check the list of supported models on the official website. If your battery model is not on the list, you can contact the support team and request them to add it.</p>
-<h3>Download</h3>
-<p>You can download Be2works Rizal Rar 15 for free from the official website. The file size is about 25 MB and the download time depends on your internet speed. You can also scan the file with your antivirus software before opening it.</p>
-<h3>Installation</h3>
-<p>Once you have downloaded Be2works Rizal Rar 15, you can install it on your computer by following these steps:</p>
-<ol>
-<li>Double-click on the downloaded file and click "Run" to start the installation wizard.</li>
-<li>Choose your preferred language and click "Next".</li>
-<li>Read and accept the license agreement and click "Next".</li>
-<li>Select the destination folder where you want to install Be2works Rizal Rar 15 and click "Next".</li>
-<li>Click "Install" to begin the installation process.</li>
-<li>Wait for a few minutes until the installation is complete and click "Finish".</li>
-</ol>
-<p>Congratulations! You have successfully installed Be2works Rizal Rar 15 on your computer. You can now launch it from the desktop shortcut or the start menu.</p> <h2>How to use Be2works Rizal Rar 15 to repair and reset laptop batteries</h2>
-<p>Now that you have downloaded and installed Be2works Rizal Rar 15 on your computer, you can use it to repair and reset your laptop battery. Here are the steps to follow:</p>
-<h3>Preparation</h3>
-<p>The first thing you need to do is to connect your laptop battery to your computer using a USB cable or an adapter. You can use any USB cable or adapter that fits your battery connector. Make sure that your computer is plugged into a power source and that your battery is fully charged.</p>
-<p>Once you have connected your battery to your computer, you need to remove it from your laptop. You can do this by turning off your laptop, unplugging it from the power source, and flipping it over. Then, you need to locate the battery compartment and slide the latch or push the button to release the battery. Carefully pull out the battery and set it aside.</p>
-<h3>Detection</h3>
-<p>The next thing you need to do is to launch Be2works Rizal Rar 15 on your computer. You can do this by double-clicking on the desktop shortcut or the start menu icon. You will see a window with a menu bar, a toolbar, and a status bar.</p>
-<p>Be2works Rizal Rar 15 will automatically detect your battery information and display it on the status bar. You will see the battery model, serial number, manufacturer, voltage, capacity, cycle count, charge level, and temperature. If Be2works Rizal Rar 15 cannot detect your battery information, you may need to check your connection or contact the support team.</p>
-<h3>Repair</h3>
-<p>The main function of Be2works Rizal Rar 15 is to repair common battery problems that affect its performance and lifespan. These problems include low capacity, high internal resistance, and short circuit. Be2works Rizal Rar 15 can fix these problems by applying a series of pulses and charges to the battery cells.</p>
-<p>To repair your battery problems, you need to click on the "Repair" button on the toolbar. You will see a window with a progress bar and a log. Be2works Rizal Rar 15 will start repairing your battery problems and show you the results on the log. You will see messages such as "Low capacity fixed", "High internal resistance fixed", and "Short circuit fixed". The repair process may take several minutes depending on the severity of the problems.</p>
-<p>When the repair process is complete, you will see a message saying "Repair finished" on the log. You can click on the "Close" button to exit the window. You can also click on the "Save" button to save the log as a text file for future reference.</p>
-<h3>Reset</h3>
-<p>The other function of Be2works Rizal Rar 15 is to reset your battery data that affect its accuracy and calibration. These data include cycle count, charge level, and calibration. Be2works Rizal Rar 15 can reset these data by writing new values to the battery chip.</p>
-<p>To reset your battery data, you need to click on the "Reset" button on the toolbar. You will see a window with three tabs: "Cycle count", "Charge level", and "Calibration". You can choose which data you want to reset by clicking on the corresponding tab.</p>
-<p>On each tab, you will see a slider that allows you to adjust the value of the data. For example, on the "Cycle count" tab, you can slide the slider to set the cycle count value from 0 to 9999. On the "Charge level" tab, you can slide the slider to set the charge level value from 0% to 100%. On the "Calibration" tab, you can slide the slider to set the calibration value from -100% to +100%.</p>
-<p>After you have adjusted the values of the data you want to reset, you need to click on the "Write" button on each tab. Be2works Rizal Rar 15 will write the new values to your battery chip and show you a message saying "Write successful" on each tab.</p>
-<p>When you have finished resetting your battery data, you can click on the "Close" button to exit the window.</p> <h2>Tips and tricks for using Be2works Rizal Rar 15 effectively</h2>
-<p>Be2works Rizal Rar 15 is a powerful and useful tool that can help you repair and reset your laptop battery. However, to get the best results, you need to follow some tips and tricks that can enhance your experience and prevent any issues. Here are some of them:</p>
-<h3>Safety</h3>
-<p>Laptop batteries are sensitive and potentially dangerous devices that can cause fire, explosion, or injury if mishandled. Therefore, you need to follow some safety precautions when using Be2works Rizal Rar 15, such as:</p>
-<ul>
-<li>Wear gloves and eye protection when handling laptop batteries.</li>
-<li>Avoid contact with water, moisture, or metal objects when connecting or disconnecting laptop batteries.</li>
-<li>Keep laptop batteries away from heat sources, flames, sparks, or direct sunlight.</li>
-<li>Do not puncture, crush, bend, or damage laptop batteries in any way.</li>
-<li>Do not attempt to open or modify laptop batteries or their components.</li>
-<li>Dispose of laptop batteries properly according to local regulations.</li>
-</ul>
-<h3>Backup</h3>
-<p>Be2works Rizal Rar 15 is designed to repair and reset your laptop battery without causing any harm or data loss. However, sometimes things can go wrong or you may want to restore your original battery settings. Therefore, it is advisable to backup your battery data before using Be2works Rizal Rar 15, in case you need to recover it later.</p>
-<p>To backup your battery data, you need to click on the "Backup" button on the toolbar. You will see a window where you can choose the destination folder where you want to save your battery data as a file. You can also name the file as you wish. Then, click on the "Save" button and wait for a few seconds until the backup process is complete. You will see a message saying "Backup successful" on the window. You can click on the "Close" button to exit the window.</p>
-<p>To restore your battery data from a backup file, you need to click on the "Restore" button on the toolbar. You will see a window where you can browse and select the backup file that you want to use. Then, click on the "Open" button and wait for a few seconds until the restore process is complete. You will see a message saying "Restore successful" on the window. You can click on the "Close" button to exit the window.</p>
-<h3>Optimization</h3>
-<p>Be2works Rizal Rar 15 can help you improve your battery performance by repairing and resetting it. However, there are also some other ways to optimize your battery performance after using Be2works Rizal Rar 15, such as:</p>
-<ul>
-<li>Adjust your power settings to reduce the energy consumption of your laptop. You can do this by choosing a power plan that suits your needs, such as balanced, power saver, or high performance.</li>
-<li>Reduce your screen brightness to save battery power. You can do this by using the function keys on your keyboard or the display settings on your laptop.</li>
-<li>Close unnecessary programs and processes that run in the background and consume battery power. You can do this by using the task manager on your laptop or a third-party software tool.</li>
-<li>Unplug any external devices that you don't need, such as USB drives, printers, speakers, or cameras. These devices can drain your battery power even when they are not in use.</li>
-<li>Avoid exposing your laptop to extreme temperatures or humidity that can affect your battery performance. Keep your laptop in a cool and dry place when not in use.</li>
-</ul>
-<h1>Conclusion</h1>
-<p>Be2works Rizal Rar 15 is a software tool that allows you to repair and reset your laptop battery in minutes. It works with most laptop brands and models and supports various types of batteries. It can help you save money, extend battery life, improve performance, and get accurate readings of your battery status.</p>
-<p>To use Be2works Rizal Rar 15, you need to download and install it on your computer, connect your laptop battery to your computer using a USB cable or an adapter, launch Be2works Rizal Rar 15 and let it detect your battery information automatically, click on the "Repair" button to fix common battery problems, click on the "Reset" button to reset your battery data, and follow some tips and tricks to optimize your battery performance after using Be2works Rizal Rar 15.</p>
-<p>If you want to repair and reset your laptop battery easily and quickly, Be2works Rizal Rar Rar 15 is the tool you need. You can download it for free from the official website and try it for yourself. You will be amazed by the results and the difference it can make for your laptop battery.</p>
-<p>We hope you found this article helpful and informative. If you have any questions, comments, or feedback, please feel free to share them with us. We would love to hear from you and help you with any issues you may have.</p>
-<p>Thank you for reading and happy battery repairing and resetting!</p>
-<h2>FAQs</h2>
-<p>Here are some of the frequently asked questions about Be2works Rizal Rar 15 and their answers:</p>
-<h3>Q: Is Be2works Rizal Rar 15 safe to use?</h3>
-<p>A: Yes, Be2works Rizal Rar 15 is safe to use as long as you follow the instructions and precautions provided in this article. Be2works Rizal Rar 15 does not harm your battery or your computer in any way. It only modifies the data on your battery chip, not the physical structure or the chemical composition of your battery cells.</p>
-<h3>Q: How often should I use Be2works Rizal Rar 15?</h3>
-<p>A: You can use Be2works Rizal Rar 15 whenever you notice a decline in your battery performance or accuracy. However, you should not use it too frequently or unnecessarily, as this may cause unnecessary wear and tear on your battery. We recommend using Be2works Rizal Rar 15 once every six months or once every 100 cycles, whichever comes first.</p>
-<h3>Q: Does Be2works Rizal Rar 15 work with all laptop batteries?</h3>
-<p>A: Be2works Rizal Rar 15 works with most laptop batteries, but not all. It supports various types of batteries, such as Li-ion, Li-polymer, Ni-MH, Ni-Cd, and SLA. It also supports most laptop brands and models, such as Dell, HP, Lenovo, Acer, Asus, Toshiba, Sony, Samsung, and more. However, some laptop batteries may have different or incompatible chipsets that prevent Be2works Rizal Rar 15 from working properly. You can check the list of supported models on the official website. If your battery model is not on the list, you can contact the support team and request them to add it.</p>
-<h3>Q: What if Be2works Rizal Rar 15 does not work or causes problems?</h3>
-<p>A: If Be2works Rizal Rar 15 does not work or causes problems, you can try the following solutions:</p>
-<ul>
-<li>Check your connection and make sure that your battery is properly connected to your computer using a USB cable or an adapter.</li>
-<li>Check your settings and make sure that you have selected the correct battery model and data values before writing them to your battery chip.</li>
-<li>Check your backup and restore your original battery data if you have saved it before using Be2works Rizal Rar 15.</li>
-<li>Contact the support team and report your issue. They will help you troubleshoot and solve your problem as soon as possible.</li>
-</ul>
-<h3>Q: Where can I get more information about Be2works Rizal Rar 15?</h3>
-<p>A: You can get more information about Be2works Rizal Rar 15 from the official website. There you can find more details about the features, functions, requirements, and compatibility of Be2works Rizal Rar 15. You can also find more resources, such as tutorials, videos, manuals, and forums. You can also contact the support team if you have any questions or feedback.</p> b2dd77e56b<br />
-<br />
-<br />
\ No newline at end of file
diff --git a/spaces/ramiin2/AutoGPT/autogpt/logs.py b/spaces/ramiin2/AutoGPT/autogpt/logs.py
deleted file mode 100644
index 35037404a98f7be9b7d577b625cc190ca27f4566..0000000000000000000000000000000000000000
--- a/spaces/ramiin2/AutoGPT/autogpt/logs.py
+++ /dev/null
@@ -1,332 +0,0 @@
-"""Logging module for Auto-GPT."""
-import json
-import logging
-import os
-import random
-import re
-import time
-import traceback
-from logging import LogRecord
-
-from colorama import Fore, Style
-
-from autogpt.config import Config, Singleton
-from autogpt.speech import say_text
-
-CFG = Config()
-
-
-class Logger(metaclass=Singleton):
-    """
-    Logger that handle titles in different colors.
-    Outputs logs in console, activity.log, and errors.log
-    For console handler: simulates typing
-    """
-
-    def __init__(self):
-        # create log directory if it doesn't exist
-        this_files_dir_path = os.path.dirname(__file__)
-        log_dir = os.path.join(this_files_dir_path, "../logs")
-        if not os.path.exists(log_dir):
-            os.makedirs(log_dir)
-
-        log_file = "activity.log"
-        error_file = "error.log"
-
-        console_formatter = AutoGptFormatter("%(title_color)s %(message)s")
-
-        # Create a handler for console which simulate typing
-        self.typing_console_handler = TypingConsoleHandler()
-        self.typing_console_handler.setLevel(logging.INFO)
-        self.typing_console_handler.setFormatter(console_formatter)
-
-        # Create a handler for console without typing simulation
-        self.console_handler = ConsoleHandler()
-        self.console_handler.setLevel(logging.DEBUG)
-        self.console_handler.setFormatter(console_formatter)
-
-        # Info handler in activity.log
-        self.file_handler = logging.FileHandler(
-            os.path.join(log_dir, log_file), "a", "utf-8"
-        )
-        self.file_handler.setLevel(logging.DEBUG)
-        info_formatter = AutoGptFormatter(
-            "%(asctime)s %(levelname)s %(title)s %(message_no_color)s"
-        )
-        self.file_handler.setFormatter(info_formatter)
-
-        # Error handler error.log
-        error_handler = logging.FileHandler(
-            os.path.join(log_dir, error_file), "a", "utf-8"
-        )
-        error_handler.setLevel(logging.ERROR)
-        error_formatter = AutoGptFormatter(
-            "%(asctime)s %(levelname)s %(module)s:%(funcName)s:%(lineno)d %(title)s"
-            " %(message_no_color)s"
-        )
-        error_handler.setFormatter(error_formatter)
-
-        self.typing_logger = logging.getLogger("TYPER")
-        self.typing_logger.addHandler(self.typing_console_handler)
-        self.typing_logger.addHandler(self.file_handler)
-        self.typing_logger.addHandler(error_handler)
-        self.typing_logger.setLevel(logging.DEBUG)
-
-        self.logger = logging.getLogger("LOGGER")
-        self.logger.addHandler(self.console_handler)
-        self.logger.addHandler(self.file_handler)
-        self.logger.addHandler(error_handler)
-        self.logger.setLevel(logging.DEBUG)
-
-    def typewriter_log(
-        self, title="", title_color="", content="", speak_text=False, level=logging.INFO
-    ):
-        if speak_text and CFG.speak_mode:
-            say_text(f"{title}. {content}")
-
-        if content:
-            if isinstance(content, list):
-                content = " ".join(content)
-        else:
-            content = ""
-
-        self.typing_logger.log(
-            level, content, extra={"title": title, "color": title_color}
-        )
-
-    def debug(
-        self,
-        message,
-        title="",
-        title_color="",
-    ):
-        self._log(title, title_color, message, logging.DEBUG)
-
-    def warn(
-        self,
-        message,
-        title="",
-        title_color="",
-    ):
-        self._log(title, title_color, message, logging.WARN)
-
-    def error(self, title, message=""):
-        self._log(title, Fore.RED, message, logging.ERROR)
-
-    def _log(self, title="", title_color="", message="", level=logging.INFO):
-        if message:
-            if isinstance(message, list):
-                message = " ".join(message)
-        self.logger.log(level, message, extra={"title": title, "color": title_color})
-
-    def set_level(self, level):
-        self.logger.setLevel(level)
-        self.typing_logger.setLevel(level)
-
-    def double_check(self, additionalText=None):
-        if not additionalText:
-            additionalText = (
-                "Please ensure you've setup and configured everything"
-                " correctly. Read https://github.com/Torantulino/Auto-GPT#readme to "
-                "double check. You can also create a github issue or join the discord"
-                " and ask there!"
-            )
-
-        self.typewriter_log("DOUBLE CHECK CONFIGURATION", Fore.YELLOW, additionalText)
-
-
-"""
-Output stream to console using simulated typing
-"""
-
-
-class TypingConsoleHandler(logging.StreamHandler):
-    def emit(self, record):
-        min_typing_speed = 0.05
-        max_typing_speed = 0.01
-
-        msg = self.format(record)
-        try:
-            words = msg.split()
-            for i, word in enumerate(words):
-                print(word, end="", flush=True)
-                if i < len(words) - 1:
-                    print(" ", end="", flush=True)
-                typing_speed = random.uniform(min_typing_speed, max_typing_speed)
-                time.sleep(typing_speed)
-                # type faster after each word
-                min_typing_speed = min_typing_speed * 0.95
-                max_typing_speed = max_typing_speed * 0.95
-            print()
-        except Exception:
-            self.handleError(record)
-
-
-class ConsoleHandler(logging.StreamHandler):
-    def emit(self, record) -> None:
-        msg = self.format(record)
-        try:
-            print(msg)
-        except Exception:
-            self.handleError(record)
-
-
-class AutoGptFormatter(logging.Formatter):
-    """
-    Allows to handle custom placeholders 'title_color' and 'message_no_color'.
-    To use this formatter, make sure to pass 'color', 'title' as log extras.
-    """
-
-    def format(self, record: LogRecord) -> str:
-        if hasattr(record, "color"):
-            record.title_color = (
-                getattr(record, "color")
-                + getattr(record, "title")
-                + " "
-                + Style.RESET_ALL
-            )
-        else:
-            record.title_color = getattr(record, "title")
-        if hasattr(record, "msg"):
-            record.message_no_color = remove_color_codes(getattr(record, "msg"))
-        else:
-            record.message_no_color = ""
-        return super().format(record)
-
-
-def remove_color_codes(s: str) -> str:
-    ansi_escape = re.compile(r"\x1B(?:[@-Z\\-_]|\[[0-?]*[ -/]*[@-~])")
-    return ansi_escape.sub("", s)
-
-
-logger = Logger()
-
-
-def print_assistant_thoughts(ai_name, assistant_reply):
-    """Prints the assistant's thoughts to the console"""
-    from autogpt.json_utils.json_fix_llm import (
-        attempt_to_fix_json_by_finding_outermost_brackets,
-        fix_and_parse_json,
-    )
-
-    try:
-        try:
-            # Parse and print Assistant response
-            assistant_reply_json = fix_and_parse_json(assistant_reply)
-        except json.JSONDecodeError:
-            logger.error("Error: Invalid JSON in assistant thoughts\n", assistant_reply)
-            assistant_reply_json = attempt_to_fix_json_by_finding_outermost_brackets(
-                assistant_reply
-            )
-            if isinstance(assistant_reply_json, str):
-                assistant_reply_json = fix_and_parse_json(assistant_reply_json)
-
-        # Check if assistant_reply_json is a string and attempt to parse
-        # it into a JSON object
-        if isinstance(assistant_reply_json, str):
-            try:
-                assistant_reply_json = json.loads(assistant_reply_json)
-            except json.JSONDecodeError:
-                logger.error("Error: Invalid JSON\n", assistant_reply)
-                assistant_reply_json = (
-                    attempt_to_fix_json_by_finding_outermost_brackets(
-                        assistant_reply_json
-                    )
-                )
-
-        assistant_thoughts_reasoning = None
-        assistant_thoughts_plan = None
-        assistant_thoughts_speak = None
-        assistant_thoughts_criticism = None
-        if not isinstance(assistant_reply_json, dict):
-            assistant_reply_json = {}
-        assistant_thoughts = assistant_reply_json.get("thoughts", {})
-        assistant_thoughts_text = assistant_thoughts.get("text")
-
-        if assistant_thoughts:
-            assistant_thoughts_reasoning = assistant_thoughts.get("reasoning")
-            assistant_thoughts_plan = assistant_thoughts.get("plan")
-            assistant_thoughts_criticism = assistant_thoughts.get("criticism")
-            assistant_thoughts_speak = assistant_thoughts.get("speak")
-
-        logger.typewriter_log(
-            f"{ai_name.upper()} THOUGHTS:", Fore.YELLOW, f"{assistant_thoughts_text}"
-        )
-        logger.typewriter_log(
-            "REASONING:", Fore.YELLOW, f"{assistant_thoughts_reasoning}"
-        )
-
-        if assistant_thoughts_plan:
-            logger.typewriter_log("PLAN:", Fore.YELLOW, "")
-            # If it's a list, join it into a string
-            if isinstance(assistant_thoughts_plan, list):
-                assistant_thoughts_plan = "\n".join(assistant_thoughts_plan)
-            elif isinstance(assistant_thoughts_plan, dict):
-                assistant_thoughts_plan = str(assistant_thoughts_plan)
-
-            # Split the input_string using the newline character and dashes
-            lines = assistant_thoughts_plan.split("\n")
-            for line in lines:
-                line = line.lstrip("- ")
-                logger.typewriter_log("- ", Fore.GREEN, line.strip())
-
-        logger.typewriter_log(
-            "CRITICISM:", Fore.YELLOW, f"{assistant_thoughts_criticism}"
-        )
-        # Speak the assistant's thoughts
-        if CFG.speak_mode and assistant_thoughts_speak:
-            say_text(assistant_thoughts_speak)
-        else:
-            logger.typewriter_log("SPEAK:", Fore.YELLOW, f"{assistant_thoughts_speak}")
-
-        return assistant_reply_json
-    except json.decoder.JSONDecodeError:
-        logger.error("Error: Invalid JSON\n", assistant_reply)
-        if CFG.speak_mode:
-            say_text(
-                "I have received an invalid JSON response from the OpenAI API."
-                " I cannot ignore this response."
-            )
-
-    # All other errors, return "Error: + error message"
-    except Exception:
-        call_stack = traceback.format_exc()
-        logger.error("Error: \n", call_stack)
-
-
-def print_assistant_thoughts(
-    ai_name: object, assistant_reply_json_valid: object
-) -> None:
-    assistant_thoughts_reasoning = None
-    assistant_thoughts_plan = None
-    assistant_thoughts_speak = None
-    assistant_thoughts_criticism = None
-
-    assistant_thoughts = assistant_reply_json_valid.get("thoughts", {})
-    assistant_thoughts_text = assistant_thoughts.get("text")
-    if assistant_thoughts:
-        assistant_thoughts_reasoning = assistant_thoughts.get("reasoning")
-        assistant_thoughts_plan = assistant_thoughts.get("plan")
-        assistant_thoughts_criticism = assistant_thoughts.get("criticism")
-        assistant_thoughts_speak = assistant_thoughts.get("speak")
-    logger.typewriter_log(
-        f"{ai_name.upper()} THOUGHTS:", Fore.YELLOW, f"{assistant_thoughts_text}"
-    )
-    logger.typewriter_log("REASONING:", Fore.YELLOW, f"{assistant_thoughts_reasoning}")
-    if assistant_thoughts_plan:
-        logger.typewriter_log("PLAN:", Fore.YELLOW, "")
-        # If it's a list, join it into a string
-        if isinstance(assistant_thoughts_plan, list):
-            assistant_thoughts_plan = "\n".join(assistant_thoughts_plan)
-        elif isinstance(assistant_thoughts_plan, dict):
-            assistant_thoughts_plan = str(assistant_thoughts_plan)
-
-        # Split the input_string using the newline character and dashes
-        lines = assistant_thoughts_plan.split("\n")
-        for line in lines:
-            line = line.lstrip("- ")
-            logger.typewriter_log("- ", Fore.GREEN, line.strip())
-    logger.typewriter_log("CRITICISM:", Fore.YELLOW, f"{assistant_thoughts_criticism}")
-    # Speak the assistant's thoughts
-    if CFG.speak_mode and assistant_thoughts_speak:
-        say_text(assistant_thoughts_speak)
diff --git a/spaces/rayan-saleh/whisper2notion/server/node_modules/debug/README.md b/spaces/rayan-saleh/whisper2notion/server/node_modules/debug/README.md
deleted file mode 100644
index f67be6b317c19952bb506a9e15e797615eea4533..0000000000000000000000000000000000000000
--- a/spaces/rayan-saleh/whisper2notion/server/node_modules/debug/README.md
+++ /dev/null
@@ -1,312 +0,0 @@
-# debug
-[![Build Status](https://travis-ci.org/visionmedia/debug.svg?branch=master)](https://travis-ci.org/visionmedia/debug)  [![Coverage Status](https://coveralls.io/repos/github/visionmedia/debug/badge.svg?branch=master)](https://coveralls.io/github/visionmedia/debug?branch=master)  [![Slack](https://visionmedia-community-slackin.now.sh/badge.svg)](https://visionmedia-community-slackin.now.sh/) [![OpenCollective](https://opencollective.com/debug/backers/badge.svg)](#backers) 
-[![OpenCollective](https://opencollective.com/debug/sponsors/badge.svg)](#sponsors)
-
-
-
-A tiny node.js debugging utility modelled after node core's debugging technique.
-
-**Discussion around the V3 API is under way [here](https://github.com/visionmedia/debug/issues/370)**
-
-## Installation
-
-```bash
-$ npm install debug
-```
-
-## Usage
-
-`debug` exposes a function; simply pass this function the name of your module, and it will return a decorated version of `console.error` for you to pass debug statements to. This will allow you to toggle the debug output for different parts of your module as well as the module as a whole.
-
-Example _app.js_:
-
-```js
-var debug = require('debug')('http')
-  , http = require('http')
-  , name = 'My App';
-
-// fake app
-
-debug('booting %s', name);
-
-http.createServer(function(req, res){
-  debug(req.method + ' ' + req.url);
-  res.end('hello\n');
-}).listen(3000, function(){
-  debug('listening');
-});
-
-// fake worker of some kind
-
-require('./worker');
-```
-
-Example _worker.js_:
-
-```js
-var debug = require('debug')('worker');
-
-setInterval(function(){
-  debug('doing some work');
-}, 1000);
-```
-
- The __DEBUG__ environment variable is then used to enable these based on space or comma-delimited names. Here are some examples:
-
-  ![debug http and worker](http://f.cl.ly/items/18471z1H402O24072r1J/Screenshot.png)
-
-  ![debug worker](http://f.cl.ly/items/1X413v1a3M0d3C2c1E0i/Screenshot.png)
-
-#### Windows note
-
- On Windows the environment variable is set using the `set` command.
-
- ```cmd
- set DEBUG=*,-not_this
- ```
-
- Note that PowerShell uses different syntax to set environment variables.
-
- ```cmd
- $env:DEBUG = "*,-not_this"
-  ```
-
-Then, run the program to be debugged as usual.
-
-## Millisecond diff
-
-  When actively developing an application it can be useful to see when the time spent between one `debug()` call and the next. Suppose for example you invoke `debug()` before requesting a resource, and after as well, the "+NNNms" will show you how much time was spent between calls.
-
-  ![](http://f.cl.ly/items/2i3h1d3t121M2Z1A3Q0N/Screenshot.png)
-
-  When stdout is not a TTY, `Date#toUTCString()` is used, making it more useful for logging the debug information as shown below:
-
-  ![](http://f.cl.ly/items/112H3i0e0o0P0a2Q2r11/Screenshot.png)
-
-## Conventions
-
-  If you're using this in one or more of your libraries, you _should_ use the name of your library so that developers may toggle debugging as desired without guessing names. If you have more than one debuggers you _should_ prefix them with your library name and use ":" to separate features. For example "bodyParser" from Connect would then be "connect:bodyParser".
-
-## Wildcards
-
-  The `*` character may be used as a wildcard. Suppose for example your library has debuggers named "connect:bodyParser", "connect:compress", "connect:session", instead of listing all three with `DEBUG=connect:bodyParser,connect:compress,connect:session`, you may simply do `DEBUG=connect:*`, or to run everything using this module simply use `DEBUG=*`.
-
-  You can also exclude specific debuggers by prefixing them with a "-" character.  For example, `DEBUG=*,-connect:*` would include all debuggers except those starting with "connect:".
-
-## Environment Variables
-
-  When running through Node.js, you can set a few environment variables that will
-  change the behavior of the debug logging:
-
-| Name      | Purpose                                         |
-|-----------|-------------------------------------------------|
-| `DEBUG`   | Enables/disables specific debugging namespaces. |
-| `DEBUG_COLORS`| Whether or not to use colors in the debug output. |
-| `DEBUG_DEPTH` | Object inspection depth. |
-| `DEBUG_SHOW_HIDDEN` | Shows hidden properties on inspected objects. |
-
-
-  __Note:__ The environment variables beginning with `DEBUG_` end up being
-  converted into an Options object that gets used with `%o`/`%O` formatters.
-  See the Node.js documentation for
-  [`util.inspect()`](https://nodejs.org/api/util.html#util_util_inspect_object_options)
-  for the complete list.
-
-## Formatters
-
-
-  Debug uses [printf-style](https://wikipedia.org/wiki/Printf_format_string) formatting. Below are the officially supported formatters:
-
-| Formatter | Representation |
-|-----------|----------------|
-| `%O`      | Pretty-print an Object on multiple lines. |
-| `%o`      | Pretty-print an Object all on a single line. |
-| `%s`      | String. |
-| `%d`      | Number (both integer and float). |
-| `%j`      | JSON. Replaced with the string '[Circular]' if the argument contains circular references. |
-| `%%`      | Single percent sign ('%'). This does not consume an argument. |
-
-### Custom formatters
-
-  You can add custom formatters by extending the `debug.formatters` object. For example, if you wanted to add support for rendering a Buffer as hex with `%h`, you could do something like:
-
-```js
-const createDebug = require('debug')
-createDebug.formatters.h = (v) => {
-  return v.toString('hex')
-}
-
-// …elsewhere
-const debug = createDebug('foo')
-debug('this is hex: %h', new Buffer('hello world'))
-//   foo this is hex: 68656c6c6f20776f726c6421 +0ms
-```
-
-## Browser support
-  You can build a browser-ready script using [browserify](https://github.com/substack/node-browserify),
-  or just use the [browserify-as-a-service](https://wzrd.in/) [build](https://wzrd.in/standalone/debug@latest),
-  if you don't want to build it yourself.
-
-  Debug's enable state is currently persisted by `localStorage`.
-  Consider the situation shown below where you have `worker:a` and `worker:b`,
-  and wish to debug both. You can enable this using `localStorage.debug`:
-
-```js
-localStorage.debug = 'worker:*'
-```
-
-And then refresh the page.
-
-```js
-a = debug('worker:a');
-b = debug('worker:b');
-
-setInterval(function(){
-  a('doing some work');
-}, 1000);
-
-setInterval(function(){
-  b('doing some work');
-}, 1200);
-```
-
-#### Web Inspector Colors
-
-  Colors are also enabled on "Web Inspectors" that understand the `%c` formatting
-  option. These are WebKit web inspectors, Firefox ([since version
-  31](https://hacks.mozilla.org/2014/05/editable-box-model-multiple-selection-sublime-text-keys-much-more-firefox-developer-tools-episode-31/))
-  and the Firebug plugin for Firefox (any version).
-
-  Colored output looks something like:
-
-  ![](https://cloud.githubusercontent.com/assets/71256/3139768/b98c5fd8-e8ef-11e3-862a-f7253b6f47c6.png)
-
-
-## Output streams
-
-  By default `debug` will log to stderr, however this can be configured per-namespace by overriding the `log` method:
-
-Example _stdout.js_:
-
-```js
-var debug = require('debug');
-var error = debug('app:error');
-
-// by default stderr is used
-error('goes to stderr!');
-
-var log = debug('app:log');
-// set this namespace to log via console.log
-log.log = console.log.bind(console); // don't forget to bind to console!
-log('goes to stdout');
-error('still goes to stderr!');
-
-// set all output to go via console.info
-// overrides all per-namespace log settings
-debug.log = console.info.bind(console);
-error('now goes to stdout via console.info');
-log('still goes to stdout, but via console.info now');
-```
-
-
-## Authors
-
- - TJ Holowaychuk
- - Nathan Rajlich
- - Andrew Rhyne
- 
-## Backers
-
-Support us with a monthly donation and help us continue our activities. [[Become a backer](https://opencollective.com/debug#backer)]
-
-<a href="https://opencollective.com/debug/backer/0/website" target="_blank"><img src="https://opencollective.com/debug/backer/0/avatar.svg"></a>
-<a href="https://opencollective.com/debug/backer/1/website" target="_blank"><img src="https://opencollective.com/debug/backer/1/avatar.svg"></a>
-<a href="https://opencollective.com/debug/backer/2/website" target="_blank"><img src="https://opencollective.com/debug/backer/2/avatar.svg"></a>
-<a href="https://opencollective.com/debug/backer/3/website" target="_blank"><img src="https://opencollective.com/debug/backer/3/avatar.svg"></a>
-<a href="https://opencollective.com/debug/backer/4/website" target="_blank"><img src="https://opencollective.com/debug/backer/4/avatar.svg"></a>
-<a href="https://opencollective.com/debug/backer/5/website" target="_blank"><img src="https://opencollective.com/debug/backer/5/avatar.svg"></a>
-<a href="https://opencollective.com/debug/backer/6/website" target="_blank"><img src="https://opencollective.com/debug/backer/6/avatar.svg"></a>
-<a href="https://opencollective.com/debug/backer/7/website" target="_blank"><img src="https://opencollective.com/debug/backer/7/avatar.svg"></a>
-<a href="https://opencollective.com/debug/backer/8/website" target="_blank"><img src="https://opencollective.com/debug/backer/8/avatar.svg"></a>
-<a href="https://opencollective.com/debug/backer/9/website" target="_blank"><img src="https://opencollective.com/debug/backer/9/avatar.svg"></a>
-<a href="https://opencollective.com/debug/backer/10/website" target="_blank"><img src="https://opencollective.com/debug/backer/10/avatar.svg"></a>
-<a href="https://opencollective.com/debug/backer/11/website" target="_blank"><img src="https://opencollective.com/debug/backer/11/avatar.svg"></a>
-<a href="https://opencollective.com/debug/backer/12/website" target="_blank"><img src="https://opencollective.com/debug/backer/12/avatar.svg"></a>
-<a href="https://opencollective.com/debug/backer/13/website" target="_blank"><img src="https://opencollective.com/debug/backer/13/avatar.svg"></a>
-<a href="https://opencollective.com/debug/backer/14/website" target="_blank"><img src="https://opencollective.com/debug/backer/14/avatar.svg"></a>
-<a href="https://opencollective.com/debug/backer/15/website" target="_blank"><img src="https://opencollective.com/debug/backer/15/avatar.svg"></a>
-<a href="https://opencollective.com/debug/backer/16/website" target="_blank"><img src="https://opencollective.com/debug/backer/16/avatar.svg"></a>
-<a href="https://opencollective.com/debug/backer/17/website" target="_blank"><img src="https://opencollective.com/debug/backer/17/avatar.svg"></a>
-<a href="https://opencollective.com/debug/backer/18/website" target="_blank"><img src="https://opencollective.com/debug/backer/18/avatar.svg"></a>
-<a href="https://opencollective.com/debug/backer/19/website" target="_blank"><img src="https://opencollective.com/debug/backer/19/avatar.svg"></a>
-<a href="https://opencollective.com/debug/backer/20/website" target="_blank"><img src="https://opencollective.com/debug/backer/20/avatar.svg"></a>
-<a href="https://opencollective.com/debug/backer/21/website" target="_blank"><img src="https://opencollective.com/debug/backer/21/avatar.svg"></a>
-<a href="https://opencollective.com/debug/backer/22/website" target="_blank"><img src="https://opencollective.com/debug/backer/22/avatar.svg"></a>
-<a href="https://opencollective.com/debug/backer/23/website" target="_blank"><img src="https://opencollective.com/debug/backer/23/avatar.svg"></a>
-<a href="https://opencollective.com/debug/backer/24/website" target="_blank"><img src="https://opencollective.com/debug/backer/24/avatar.svg"></a>
-<a href="https://opencollective.com/debug/backer/25/website" target="_blank"><img src="https://opencollective.com/debug/backer/25/avatar.svg"></a>
-<a href="https://opencollective.com/debug/backer/26/website" target="_blank"><img src="https://opencollective.com/debug/backer/26/avatar.svg"></a>
-<a href="https://opencollective.com/debug/backer/27/website" target="_blank"><img src="https://opencollective.com/debug/backer/27/avatar.svg"></a>
-<a href="https://opencollective.com/debug/backer/28/website" target="_blank"><img src="https://opencollective.com/debug/backer/28/avatar.svg"></a>
-<a href="https://opencollective.com/debug/backer/29/website" target="_blank"><img src="https://opencollective.com/debug/backer/29/avatar.svg"></a>
-
-
-## Sponsors
-
-Become a sponsor and get your logo on our README on Github with a link to your site. [[Become a sponsor](https://opencollective.com/debug#sponsor)]
-
-<a href="https://opencollective.com/debug/sponsor/0/website" target="_blank"><img src="https://opencollective.com/debug/sponsor/0/avatar.svg"></a>
-<a href="https://opencollective.com/debug/sponsor/1/website" target="_blank"><img src="https://opencollective.com/debug/sponsor/1/avatar.svg"></a>
-<a href="https://opencollective.com/debug/sponsor/2/website" target="_blank"><img src="https://opencollective.com/debug/sponsor/2/avatar.svg"></a>
-<a href="https://opencollective.com/debug/sponsor/3/website" target="_blank"><img src="https://opencollective.com/debug/sponsor/3/avatar.svg"></a>
-<a href="https://opencollective.com/debug/sponsor/4/website" target="_blank"><img src="https://opencollective.com/debug/sponsor/4/avatar.svg"></a>
-<a href="https://opencollective.com/debug/sponsor/5/website" target="_blank"><img src="https://opencollective.com/debug/sponsor/5/avatar.svg"></a>
-<a href="https://opencollective.com/debug/sponsor/6/website" target="_blank"><img src="https://opencollective.com/debug/sponsor/6/avatar.svg"></a>
-<a href="https://opencollective.com/debug/sponsor/7/website" target="_blank"><img src="https://opencollective.com/debug/sponsor/7/avatar.svg"></a>
-<a href="https://opencollective.com/debug/sponsor/8/website" target="_blank"><img src="https://opencollective.com/debug/sponsor/8/avatar.svg"></a>
-<a href="https://opencollective.com/debug/sponsor/9/website" target="_blank"><img src="https://opencollective.com/debug/sponsor/9/avatar.svg"></a>
-<a href="https://opencollective.com/debug/sponsor/10/website" target="_blank"><img src="https://opencollective.com/debug/sponsor/10/avatar.svg"></a>
-<a href="https://opencollective.com/debug/sponsor/11/website" target="_blank"><img src="https://opencollective.com/debug/sponsor/11/avatar.svg"></a>
-<a href="https://opencollective.com/debug/sponsor/12/website" target="_blank"><img src="https://opencollective.com/debug/sponsor/12/avatar.svg"></a>
-<a href="https://opencollective.com/debug/sponsor/13/website" target="_blank"><img src="https://opencollective.com/debug/sponsor/13/avatar.svg"></a>
-<a href="https://opencollective.com/debug/sponsor/14/website" target="_blank"><img src="https://opencollective.com/debug/sponsor/14/avatar.svg"></a>
-<a href="https://opencollective.com/debug/sponsor/15/website" target="_blank"><img src="https://opencollective.com/debug/sponsor/15/avatar.svg"></a>
-<a href="https://opencollective.com/debug/sponsor/16/website" target="_blank"><img src="https://opencollective.com/debug/sponsor/16/avatar.svg"></a>
-<a href="https://opencollective.com/debug/sponsor/17/website" target="_blank"><img src="https://opencollective.com/debug/sponsor/17/avatar.svg"></a>
-<a href="https://opencollective.com/debug/sponsor/18/website" target="_blank"><img src="https://opencollective.com/debug/sponsor/18/avatar.svg"></a>
-<a href="https://opencollective.com/debug/sponsor/19/website" target="_blank"><img src="https://opencollective.com/debug/sponsor/19/avatar.svg"></a>
-<a href="https://opencollective.com/debug/sponsor/20/website" target="_blank"><img src="https://opencollective.com/debug/sponsor/20/avatar.svg"></a>
-<a href="https://opencollective.com/debug/sponsor/21/website" target="_blank"><img src="https://opencollective.com/debug/sponsor/21/avatar.svg"></a>
-<a href="https://opencollective.com/debug/sponsor/22/website" target="_blank"><img src="https://opencollective.com/debug/sponsor/22/avatar.svg"></a>
-<a href="https://opencollective.com/debug/sponsor/23/website" target="_blank"><img src="https://opencollective.com/debug/sponsor/23/avatar.svg"></a>
-<a href="https://opencollective.com/debug/sponsor/24/website" target="_blank"><img src="https://opencollective.com/debug/sponsor/24/avatar.svg"></a>
-<a href="https://opencollective.com/debug/sponsor/25/website" target="_blank"><img src="https://opencollective.com/debug/sponsor/25/avatar.svg"></a>
-<a href="https://opencollective.com/debug/sponsor/26/website" target="_blank"><img src="https://opencollective.com/debug/sponsor/26/avatar.svg"></a>
-<a href="https://opencollective.com/debug/sponsor/27/website" target="_blank"><img src="https://opencollective.com/debug/sponsor/27/avatar.svg"></a>
-<a href="https://opencollective.com/debug/sponsor/28/website" target="_blank"><img src="https://opencollective.com/debug/sponsor/28/avatar.svg"></a>
-<a href="https://opencollective.com/debug/sponsor/29/website" target="_blank"><img src="https://opencollective.com/debug/sponsor/29/avatar.svg"></a>
-
-## License
-
-(The MIT License)
-
-Copyright (c) 2014-2016 TJ Holowaychuk &lt;tj@vision-media.ca&gt;
-
-Permission is hereby granted, free of charge, to any person obtaining
-a copy of this software and associated documentation files (the
-'Software'), to deal in the Software without restriction, including
-without limitation the rights to use, copy, modify, merge, publish,
-distribute, sublicense, and/or sell copies of the Software, and to
-permit persons to whom the Software is furnished to do so, subject to
-the following conditions:
-
-The above copyright notice and this permission notice shall be
-included in all copies or substantial portions of the Software.
-
-THE SOFTWARE IS PROVIDED 'AS IS', WITHOUT WARRANTY OF ANY KIND,
-EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
-MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
-IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY
-CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
-TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
-SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
diff --git a/spaces/realfill-library/RealFill-Training-UI/trainer.py b/spaces/realfill-library/RealFill-Training-UI/trainer.py
deleted file mode 100644
index 01919fa0516ec9c4ac4834ac2d316638ad6a1543..0000000000000000000000000000000000000000
--- a/spaces/realfill-library/RealFill-Training-UI/trainer.py
+++ /dev/null
@@ -1,172 +0,0 @@
-from __future__ import annotations
-
-import datetime
-import os
-import pathlib
-import shlex
-import shutil
-import subprocess
-
-import gradio as gr
-import slugify
-import torch
-from PIL import Image
-from huggingface_hub import HfApi
-
-from app_upload import ModelUploader
-from utils import save_model_card
-
-URL_TO_JOIN_LIBRARY_ORG = 'https://huggingface.co/organizations/realfill-library/share/WctmaLvDHWxnuWoJxagTrzVXbGwxoqoJoG'
-
-class Trainer:
-    def __init__(self, hf_token: str | None = None):
-        self.hf_token = hf_token
-        self.api = HfApi(token=hf_token)
-        self.model_uploader = ModelUploader(hf_token)
-
-    def prepare_dataset(self, reference_images: list,
-                        target_image: Image.Image, target_mask: Image.Image,
-                        train_data_dir: pathlib.Path, output_dir: pathlib.Path) -> None:
-        shutil.rmtree(train_data_dir, ignore_errors=True)
-        train_data_dir.mkdir(parents=True)
-        
-        (train_data_dir / 'ref').mkdir(parents=True)
-        (train_data_dir / 'target').mkdir(parents=True)
-
-        for i, temp_path in enumerate(reference_images):
-            image = Image.open(temp_path.name)
-            image = image.convert('RGB')
-            out_path = train_data_dir / 'ref' / f'{i:03d}.jpg'
-            image.save(out_path, format='JPEG', quality=100)
-
-        target_image = Image.open(target_image[0].name)
-        target_image = target_image.convert('RGB')
-        out_path = train_data_dir / 'target' / f'target.jpg'
-        target_image.save(out_path, format='JPEG', quality=100)
-        out_path = output_dir / f'target.jpg'
-        target_image.save(out_path, format='JPEG', quality=100)
-
-        target_mask = Image.open(target_mask[0].name)
-        target_mask = target_mask.convert('L')
-        out_path = train_data_dir / 'target' / f'mask.jpg'
-        target_mask.save(out_path, format='JPEG', quality=100)
-        out_path = output_dir / f'mask.jpg'
-        target_mask.save(out_path, format='JPEG', quality=100)
-
-    def join_library_org(self) -> None:
-        subprocess.run(
-            shlex.split(
-                f'curl -X POST -H "Authorization: Bearer {self.hf_token}" -H "Content-Type: application/json" {URL_TO_JOIN_LIBRARY_ORG}'
-            ))
-
-    def run(
-        self,
-        reference_images: list | None,
-        target_image: Image.Image | None,
-        target_mask: Image.Image | None,
-        output_model_name: str,
-        overwrite_existing_model: bool,
-        base_model: str,
-        resolution_s: str,
-        n_steps: int,
-        unet_learning_rate: float,
-        text_encoder_learning_rate: float,
-        lora_rank: int,
-        lora_dropout: float,
-        lora_alpha: int,
-        gradient_accumulation: int,
-        seed: int,
-        fp16: bool,
-        use_8bit_adam: bool,
-        checkpointing_steps: int,
-        use_wandb: bool,
-        validation_steps: int,
-        upload_to_hub: bool,
-        use_private_repo: bool,
-        delete_existing_repo: bool,
-        upload_to: str,
-        remove_gpu_after_training: bool,
-    ) -> str:
-        if not torch.cuda.is_available():
-            raise gr.Error('CUDA is not available.')
-        if reference_images is None:
-            raise gr.Error('You need to upload reference images.')
-        if target_image is None:
-            raise gr.Error('The instance prompt is missing.')
-
-        resolution = int(resolution_s)
-
-        if not output_model_name:
-            timestamp = datetime.datetime.now().strftime('%Y-%m-%d-%H-%M-%S')
-            output_model_name = f'realfill-{timestamp}'
-        output_model_name = slugify.slugify(output_model_name)
-
-        repo_dir = pathlib.Path(__file__).parent
-        output_dir = repo_dir / 'experiments' / output_model_name
-        if overwrite_existing_model or upload_to_hub:
-            shutil.rmtree(output_dir, ignore_errors=True)
-        output_dir.mkdir(parents=True)
-
-        train_data_dir = repo_dir / 'training_data' / output_model_name
-        self.prepare_dataset(reference_images, target_image, target_mask, train_data_dir, output_dir)
-
-        if upload_to_hub:
-            self.join_library_org()
-
-        command = f'''
-        python train_realfill.py \
-          --pretrained_model_name_or_path={base_model}  \
-          --train_data_dir={train_data_dir} \
-          --output_dir={output_dir} \
-          --resolution={resolution} \
-          --train_batch_size=16 \
-          --gradient_accumulation_steps={gradient_accumulation} --gradient_checkpointing \
-          --unet_learning_rate={unet_learning_rate} \
-          --text_encoder_learning_rate={text_encoder_learning_rate} \
-          --lr_scheduler=constant \
-          --lr_warmup_steps=100 \
-          --set_grads_to_none \
-          --max_train_steps={n_steps} \
-          --checkpointing_steps={checkpointing_steps} \
-          --validation_steps={validation_steps} \
-          --lora_rank={lora_rank} \
-          --lora_dropout={lora_dropout} \
-          --lora_alpha={lora_alpha} \
-          --seed={seed}
-        '''
-        if fp16:
-            command += ' --mixed_precision fp16'
-        if use_8bit_adam:
-            command += ' --use_8bit_adam'
-        if use_wandb:
-            command += ' --report_to wandb'
-
-        with open(output_dir / 'train.sh', 'w') as f:
-            command_s = ' '.join(command.split())
-            f.write(command_s)
-        subprocess.run(shlex.split(command))
-        save_model_card(save_dir=output_dir,
-                        base_model=base_model,
-                        target_image=output_dir / 'target.jpg',
-                        target_mask=output_dir / 'mask.jpg')
-
-        message = 'Training completed!'
-        print(message)
-
-        if upload_to_hub:
-            upload_message = self.model_uploader.upload_model(
-                folder_path=output_dir.as_posix(),
-                repo_name=output_model_name,
-                upload_to=upload_to,
-                private=use_private_repo,
-                delete_existing_repo=delete_existing_repo)
-            print(upload_message)
-            message = message + '\n' + upload_message
-
-        if remove_gpu_after_training:
-            space_id = os.getenv('SPACE_ID')
-            if space_id:
-                self.api.request_space_hardware(repo_id=space_id,
-                                                hardware='cpu-basic')
-
-        return message
diff --git a/spaces/recenWmenso/ChatGPT-with-Voice-Cloning-for-All/datasets/Command And Conquer 3 Kanes Wrath Patch 1.02 Crack 12 UPD.md b/spaces/recenWmenso/ChatGPT-with-Voice-Cloning-for-All/datasets/Command And Conquer 3 Kanes Wrath Patch 1.02 Crack 12 UPD.md
deleted file mode 100644
index 2e1e3ca5a34eb480bfddf1eadbd7f618829f8021..0000000000000000000000000000000000000000
--- a/spaces/recenWmenso/ChatGPT-with-Voice-Cloning-for-All/datasets/Command And Conquer 3 Kanes Wrath Patch 1.02 Crack 12 UPD.md	
+++ /dev/null
@@ -1,100 +0,0 @@
-<br />
-<h1>Command And Conquer 3 Kane's Wrath Patch 1.02 Crack 12: Everything You Need to Know</h1>
-
-<p>If you are a fan of Command and Conquer 3: Kane's Wrath, you might be interested in downloading and installing the patch 1.02 crack 12. This patch fixes several bugs, makes balance changes across all nine factions, and adds some new features to the game. In this article, we will tell you everything you need to know about Command and Conquer 3 Kane's Wrath patch 1.02 crack 12, including where to download it, how to install it, and what it does.</p>
-
-<h2>Where to Download Command and Conquer 3 Kane's Wrath Patch 1.02 Crack 12</h2>
-
-<p>There are several websites that offer the patch 1.02 crack 12 for Command and Conquer 3: Kane's Wrath. Some of the most popular ones are:</p>
-<h2>Command And Conquer 3 Kane's Wrath Patch 1.02 Crack 12</h2><br /><p><b><b>Download</b> &#128505; <a href="https://urlgoal.com/2uCLsi">https://urlgoal.com/2uCLsi</a></b></p><br /><br />
-
-<ul>
-<li><a href="https://www.moddb.com/games/cc-kanes-wrath/downloads/cc-3-kanes-wrath-102-english-patch">Mod DB</a>: This is a website that hosts mods and patches for various games. You can find the patch 1.02 crack 12 for the English version of Command and Conquer 3: Kane's Wrath here.</li>
-<li><a href="https://megagames.com/fixes/command-conquer-3-kanes-wrath-2">MegaGames</a>: This is a website that provides game fixes, trainers, cheats, and cracks for various games. You can find the patch 1.02 crack 12 for Command and Conquer 3: Kane's Wrath here.</li>
-<li><a href="https://cnc.fandom.com/wiki/Kane%27s_Wrath_Unofficial_Patch_1.02%2B">C&C Wiki</a>: This is a wiki that covers everything related to the Command and Conquer franchise. You can find the unofficial patch 1.02+ for Command and Conquer 3: Kane's Wrath here. This patch is a community-made patch that aims to fix bugs and errors left over after the official patch while having as little impact to the game balance as possible.</li>
-</ul>
-
-<p>Before you download any patch or crack, make sure you have a backup of your original game files in case something goes wrong. Also, be careful of viruses and malware that might be hidden in some downloads.</p>
-
-<h2>How to Install Command and Conquer 3 Kane's Wrath Patch 1.02 Crack 12</h2>
-
-<p>Installing the patch 1.02 crack 12 for Command and Conquer 3: Kane's Wrath is not very difficult. Here are the steps you need to follow:</p>
-
-<ol>
-<li>Download the patch file from one of the websites mentioned above.</li>
-<li>Extract the file using a program like WinRAR or 7-Zip.</li>
-<li>Copy the extracted file to your game directory, where you installed Command and Conquer 3: Kane's Wrath.</li>
-<li>Replace the original file when prompted.</li>
-<li>Run the game and enjoy!</li>
-</ol>
-
-<p>Note that some patches or cracks might require you to run them as administrator or disable your antivirus software before installing them.</p>
-
-<h2>What Does Command and Conquer 3 Kane's Wrath Patch 1.02 Crack 12 Do</h2>
-
-<p>The patch 1.02 crack 12 for Command and Conquer 3: Kane's Wrath does a lot of things to improve the game experience. Here are some of the main changes:</p>
-
-<ul>
-<li>It fixes an error that sometimes caused players to unexpectedly select multiple control groups at once when rapidly switching between control groups.</li>
-<li>It makes beacons work again for subfactions.</li>
-<li>It swaps the GDI Slingshot and Shatterer icons at the Reclamator Hub to mirror the War Factory.</li>
-<li>It makes the Watch tower correctly autotarget units at maximum range.</li>
-<li>It prevents the ZOCOM Shatterer from bypassing the overload beam power down by using Call for Transport.</li>
-<li>It prevents the Sonic fencing from disappearing from the armory when healing infantry.</li>
-<li>It prevents the Decoy Specters from dealing full non-decoy damage if the decoy dies while the weapon shell is in flight.</li>
-<li>It prevents the Specters from damaging airborne units.</li>
-<li>It allows the Nod Crane to build the Voice of Kane.</li>
-<li>It prevents units from retaining the mothership catalyst effect when transported through a wormhole.</li>
-<li>It prevents Decoy Tripods from EMPing.</li>
-<li>It fixes an exploit that allowed small units to walk along the map border, outside of normal detection, on the Tournament Tower map.</li>
-<li>It resets meta-unit hardpoints at the beginning of each Global Conquest battle.</li>
-<li>It allows strike forces to have spaces in their names.</li>
-<li>It increases level 2 veterancy bonus from +20% damage, +30% health to +25% damage, +40% health.</li>
-<li>It reduces all harvesters' cost to 1600, build time to 16s.</li>
-<li>It makes balance changes across all nine factions, affecting units, abilities, upgrades, and powers.</li>
-</ul>
-
-<p>You can read more details about each change in the text file description that comes with each patch or crack download.</p>
-
-<h2>Conclusion</h2>
-
-<p>The patch 1.02 crack 12 for Command and Conquer 3: Kane's Wrath is a great way to enhance your game experience and enjoy one of the best real-time strategy games ever made. Whether you want to play as GDI, Nod, or Scrin, you will find something new and exciting in this patch. You can download it from various websites, install it easily, and see what it does for yourself. Just remember to backup your original game files before applying any patch or crack, and be careful of viruses and malware that might be lurking in some downloads.</p>
-
-<p>We hope this article was helpful and informative for you. If you have any questions or comments about Command and Conquer 3 Kane's Wrath patch 1.02 crack 12, feel free to leave them below. Thank you for reading!</p>
-<h2>Why You Should Play Command and Conquer 3 Kane's Wrath with Patch 1.02 Crack 12</h2>
-
-<p>Command and Conquer 3: Kane's Wrath is a real-time strategy game that expands on the story and gameplay of Command and Conquer 3: Tiberium Wars. It features a new single-player campaign that spans 20 years of the Tiberium saga, from the rebirth of the Brotherhood of Nod after the Second Tiberium War to the dramatic events of the Third Tiberium War and beyond. You can play as one of the three main factions: GDI, Nod, or Scrin, or choose from six subfactions, each with their own unique units, abilities, and strategies.</p>
-<p></p>
-
-<p>Playing Command and Conquer 3: Kane's Wrath with patch 1.02 crack 12 will enhance your game experience in many ways. You will be able to enjoy a smoother and more balanced gameplay, with fewer bugs and glitches that might ruin your fun. You will also be able to access some new features that were not available in the original game, such as:</p>
-
-<ul>
-<li>A new game mode called Global Conquest, where you can fight for world domination on a strategic map with meta-units and special powers.</li>
-<li>A new unit for each faction, such as the GDI Slingshot anti-air vehicle, the Nod Specter artillery stealth tank, and the Scrin Mechapede segmented walker.</li>
-<li>A new epic unit for each faction, such as the GDI MARV super-heavy tank, the Nod Redeemer cyborg walker, and the Scrin Eradicator hexapod.</li>
-<li>A new voice-over for Kane, the charismatic leader of Nod, performed by Joe Kucan himself.</li>
-<li>A new soundtrack composed by Steve Jablonsky and Trevor Morris.</li>
-</ul>
-
-<p>If you are a fan of Command and Conquer 3: Kane's Wrath, or if you are looking for a challenging and exciting real-time strategy game, you should definitely try playing it with patch 1.02 crack 12. You will not regret it!</p>
-<h2>How to Play Command and Conquer 3 Kane's Wrath with Patch 1.02 Crack 12 Online</h2>
-
-<p>One of the best features of Command and Conquer 3: Kane's Wrath is its online multiplayer mode, where you can compete with other players from around the world in various game modes and maps. You can play as any of the nine factions, and use your skills and strategies to defeat your opponents. You can also join clans, chat with other players, and rank up on the leaderboards.</p>
-
-<p>However, playing Command and Conquer 3: Kane's Wrath with patch 1.02 crack 12 online might be a bit tricky, since the official servers have been shut down by EA in 2014. Fortunately, there are still some ways to enjoy the online multiplayer mode of this game, such as:</p>
-
-<ul>
-<li>Using a third-party service like GameRanger or C&C:Online, which allow you to host and join online games with other players who have the same patch and crack as you.</li>
-<li>Using a LAN emulator like Hamachi or Tunngle, which allow you to create a virtual network with other players who have the same patch and crack as you, and play as if you were on a local area network.</li>
-<li>Using a VPN service like NordVPN or ExpressVPN, which allow you to connect to a server in a different region where there might be more players who have the same patch and crack as you.</li>
-</ul>
-
-<p>Before you use any of these methods, make sure you have a stable internet connection and a firewall that does not block your game traffic. Also, be aware of the possible risks of using unofficial services or cracks, such as viruses, malware, or bans.</p>
-
-<h2>Conclusion</h2>
-
-<p>Command and Conquer 3: Kane's Wrath is a fantastic real-time strategy game that offers hours of fun and challenge for both single-player and multiplayer modes. With patch 1.02 crack 12, you can enjoy the game even more, with improved performance, balance, and features. You can download and install the patch and crack easily from various websites, and play online with other players using different methods. Just remember to backup your original game files before applying any patch or crack, and be careful of viruses and malware that might be lurking in some downloads.</p>
-
-<p>We hope this article was helpful and informative for you. If you have any questions or comments about Command and Conquer 3 Kane's Wrath patch 1.02 crack 12, feel free to leave them below. Thank you for reading!</p> 3cee63e6c2<br />
-<br />
-<br />
\ No newline at end of file
diff --git a/spaces/rockeycoss/Prompt-Segment-Anything-Demo/mmdet/utils/__init__.py b/spaces/rockeycoss/Prompt-Segment-Anything-Demo/mmdet/utils/__init__.py
deleted file mode 100644
index b5a2b6b3a0e6031954b434686dd49d87de331baa..0000000000000000000000000000000000000000
--- a/spaces/rockeycoss/Prompt-Segment-Anything-Demo/mmdet/utils/__init__.py
+++ /dev/null
@@ -1,22 +0,0 @@
-# Copyright (c) OpenMMLab. All rights reserved.
-from .ascend_util import (batch_images_to_levels,
-                          get_max_num_gt_division_factor, masked_fill)
-from .collect_env import collect_env
-from .compat_config import compat_cfg
-from .logger import get_caller_name, get_root_logger, log_img_scale
-from .memory import AvoidCUDAOOM, AvoidOOM
-from .misc import find_latest_checkpoint, update_data_root
-from .replace_cfg_vals import replace_cfg_vals
-from .rfnext import rfnext_init_model
-from .setup_env import setup_multi_processes
-from .split_batch import split_batch
-from .util_distribution import build_ddp, build_dp, get_device
-
-__all__ = [
-    'get_root_logger', 'collect_env', 'find_latest_checkpoint',
-    'update_data_root', 'setup_multi_processes', 'get_caller_name',
-    'log_img_scale', 'compat_cfg', 'split_batch', 'build_ddp', 'build_dp',
-    'get_device', 'replace_cfg_vals', 'AvoidOOM', 'AvoidCUDAOOM',
-    'get_max_num_gt_division_factor', 'masked_fill', 'batch_images_to_levels',
-    'rfnext_init_model'
-]
diff --git a/spaces/ronvolutional/iframe-test/static/index.js b/spaces/ronvolutional/iframe-test/static/index.js
deleted file mode 100644
index da58d658fda06c7aed1a8384db3cd19e5f8f7a3e..0000000000000000000000000000000000000000
--- a/spaces/ronvolutional/iframe-test/static/index.js
+++ /dev/null
@@ -1,126 +0,0 @@
-if (document.location.search.includes('dark-theme=true')) {
-  document.body.classList.add('dark-theme');
-}
-
-let cursor = 0;
-const RANGE = 5;
-const LIMIT = 16_000;
-
-const textToImage = async (text) => {
-  const inferenceResponse = await fetch(`infer_biggan?input=${text}`);
-  const inferenceBlob = await inferenceResponse.blob();
-
-  return URL.createObjectURL(inferenceBlob);
-};
-
-const translateText = async (text) => {
-  const inferResponse = await fetch(`infer_t5?input=${text}`);
-  const inferJson = await inferResponse.json();
-
-  return inferJson.output;
-};
-
-const queryDataset = async (start, end) => {
-  const queryResponse = await fetch(`query_emotion?start=${start}&end=${end}`);
-  const queryJson = await queryResponse.json();
-
-  return queryJson.output;
-};
-
-const updateTable = async (cursor, range = RANGE) => {
-  const table = document.querySelector('.dataset-output');
-
-  const fragment = new DocumentFragment();
-
-  const observations = await queryDataset(cursor, cursor + range);
-
-  for (const observation of observations) {
-    let row = document.createElement('tr');
-    let text = document.createElement('td');
-    let emotion = document.createElement('td');
-
-    text.textContent = observation.text;
-    emotion.textContent = observation.emotion;
-
-    row.appendChild(text);
-    row.appendChild(emotion);
-    fragment.appendChild(row);
-  }
-
-  table.innerHTML = '';
-
-  table.appendChild(fragment);
-
-  table.insertAdjacentHTML(
-    'afterbegin',
-    `<thead>
-      <tr>
-        <td>text</td>
-        <td>emotion</td>
-      </tr>
-    </thead>`
-  );
-};
-
-const imageGenSelect = document.getElementById('image-gen-input');
-const imageGenImage = document.querySelector('.image-gen-output');
-const textGenForm = document.querySelector('.text-gen-form');
-const tableButtonPrev = document.querySelector('.table-previous');
-const tableButtonNext = document.querySelector('.table-next');
-
-imageGenSelect.addEventListener('change', async (event) => {
-  const value = event.target.value;
-
-  try {
-    imageGenImage.src = await textToImage(value);
-    imageGenImage.alt = value + ' generated from BigGAN AI model';
-  } catch (err) {
-    console.error(err);
-  }
-});
-
-textGenForm.addEventListener('submit', async (event) => {
-  event.preventDefault();
-
-  const textGenInput = document.getElementById('text-gen-input');
-  const textGenParagraph = document.querySelector('.text-gen-output');
-
-  try {
-    textGenParagraph.textContent = await translateText(textGenInput.value);
-  } catch (err) {
-    console.error(err);
-  }
-});
-
-tableButtonPrev.addEventListener('click', () => {
-  cursor = cursor > RANGE ? cursor - RANGE : 0;
-
-  if (cursor < RANGE) {
-    tableButtonPrev.classList.add('hidden');
-  }
-  if (cursor < LIMIT - RANGE) {
-    tableButtonNext.classList.remove('hidden');
-  }
-
-  updateTable(cursor);
-});
-
-tableButtonNext.addEventListener('click', () => {
-  cursor = cursor < LIMIT - RANGE ? cursor + RANGE : cursor;
-
-  if (cursor >= RANGE) {
-    tableButtonPrev.classList.remove('hidden');
-  }
-  if (cursor >= LIMIT - RANGE) {
-    tableButtonNext.classList.add('hidden');
-  }
-
-  updateTable(cursor);
-});
-
-textToImage(imageGenSelect.value)
-  .then((image) => (imageGenImage.src = image))
-  .catch(console.error);
-
-updateTable(cursor)
-  .catch(console.error);
diff --git a/spaces/rorallitri/biomedical-language-models/logs/Delphi Programming For Dummies Pdf Free 317.md b/spaces/rorallitri/biomedical-language-models/logs/Delphi Programming For Dummies Pdf Free 317.md
deleted file mode 100644
index 36b3187146db6eb79e42fc80f4d01cf0190ac1a4..0000000000000000000000000000000000000000
--- a/spaces/rorallitri/biomedical-language-models/logs/Delphi Programming For Dummies Pdf Free 317.md	
+++ /dev/null
@@ -1,6 +0,0 @@
-<h2>delphi programming for dummies pdf free 317</h2><br /><p><b><b>Download</b> &#11088; <a href="https://tinurll.com/2uzmAM">https://tinurll.com/2uzmAM</a></b></p><br /><br />
-<br />
-Target the biggest app market with over 1 bln. application program interface (API): An ... FREE fully-featured visual database schema designer. ... AC Apps 317. ... Create personal and business database/spreadsheet apps. pdf), Text File (. ... This unique introductory SQL tutorial not only provides easy-to-understand SQL ... 4d29de3e1b<br />
-<br />
-<br />
-<p></p>
diff --git a/spaces/rorallitri/biomedical-language-models/logs/Download and watch Main Hoon Surya SINGHAM II 2015 movie with english subtitles The easiest way to enjoy the Hindi blockbuster.md b/spaces/rorallitri/biomedical-language-models/logs/Download and watch Main Hoon Surya SINGHAM II 2015 movie with english subtitles The easiest way to enjoy the Hindi blockbuster.md
deleted file mode 100644
index 18bd3fc2624730bcee547abe28f944a84c1280d6..0000000000000000000000000000000000000000
--- a/spaces/rorallitri/biomedical-language-models/logs/Download and watch Main Hoon Surya SINGHAM II 2015 movie with english subtitles The easiest way to enjoy the Hindi blockbuster.md	
+++ /dev/null
@@ -1,6 +0,0 @@
-<h2>english subtitles download Main Hoon Surya SINGHAM II 2015 movie</h2><br /><p><b><b>Download File</b> &#128279; <a href="https://tinurll.com/2uzoGY">https://tinurll.com/2uzoGY</a></b></p><br /><br />
-<br />
- aaccfb2cb3<br />
-<br />
-<br />
-<p></p>
diff --git a/spaces/rorallitri/biomedical-language-models/logs/Garritan Jazz And Big Band 3 V3.0 HAPPY NEW YEAR - R2R [deepstat The PC Music Software that Will Make You a Jazz Master.md b/spaces/rorallitri/biomedical-language-models/logs/Garritan Jazz And Big Band 3 V3.0 HAPPY NEW YEAR - R2R [deepstat The PC Music Software that Will Make You a Jazz Master.md
deleted file mode 100644
index 99b292f2c4c78aee5fd9e2d61a45eb49b1e016b1..0000000000000000000000000000000000000000
--- a/spaces/rorallitri/biomedical-language-models/logs/Garritan Jazz And Big Band 3 V3.0 HAPPY NEW YEAR - R2R [deepstat The PC Music Software that Will Make You a Jazz Master.md	
+++ /dev/null
@@ -1,6 +0,0 @@
-<h2>Happy Bhag Jayegi 2015 movie download 720p</h2><br /><p><b><b>Download Zip</b> &mdash; <a href="https://tinurll.com/2uzoJ1">https://tinurll.com/2uzoJ1</a></b></p><br /><br />
-
- aaccfb2cb3<br />
-<br />
-<br />
-<p></p>
diff --git a/spaces/rorallitri/biomedical-language-models/logs/LINK Downloadhirenboot115iso.md b/spaces/rorallitri/biomedical-language-models/logs/LINK Downloadhirenboot115iso.md
deleted file mode 100644
index 47768da04969534a1b6dfb3ab42e058994a3c12b..0000000000000000000000000000000000000000
--- a/spaces/rorallitri/biomedical-language-models/logs/LINK Downloadhirenboot115iso.md	
+++ /dev/null
@@ -1,102 +0,0 @@
-<br />
-<h1>How to Download Hiren Boot 11.5 ISO and Use It for System Recovery</h1>
-
-<p>If you are looking for a reliable and versatile tool to backup, restore, repair and troubleshoot your PC, you might want to download Hiren Boot 11.5 ISO and create a bootable media with it. Hiren Boot 11.5 ISO is an image file that contains a collection of useful utilities and software that can help you with various tasks related to your system.</p>
-<h2>downloadhirenboot115iso</h2><br /><p><b><b>Download File</b> &#10037;&#10037;&#10037; <a href="https://tinurll.com/2uzmVM">https://tinurll.com/2uzmVM</a></b></p><br /><br />
-
-<p>In this article, we will show you how to download Hiren Boot 11.5 ISO and use it for system recovery. We will also explain what Hiren Boot 11.5 ISO can do and why you need it.</p>
-
-<h2>What is Hiren Boot 11.5 ISO?</h2>
-
-<p>Hiren Boot 11.5 ISO is the latest version of Hiren's BootCD, a popular bootable CD that contains a variety of tools and software for system recovery and maintenance. Hiren's BootCD was originally created by Hiren Pankaj, an Indian IT professional, who compiled and updated it regularly until 2012.</p>
-
-<p>Hiren Boot 11.5 ISO is based on Hiren's BootCD PE (Preinstallation Environment), which is a Windows 10 PE x64 environment that supports UEFI booting from DVD and USB flash drives. Hiren Boot 11.5 ISO includes many useful utilities and software, such as:</p>
-<p></p>
-
-<ul>
-<li>BCD-MBR Tools: Tools to manage boot configuration data and master boot record.</li>
-<li>Hard Disk Tools: Tools to perform data recovery, defragmentation, diagnostics, imaging, partitioning and security tasks on hard disks.</li>
-<li>Windows Recovery: Tools to recover Windows system files and settings.</li>
-<li>Other Tools: Tools to view files, edit documents, compare files, burn CDs/DVDs, create bootable USB drives, scan for viruses, malware and spyware, find product keys, reset passwords, change system settings and more.</li>
-</ul>
-
-<p>You can find the full list of tools and software included in Hiren Boot 11.5 ISO on the official website: <a href="https://www.hirensbootcd.org/download/">https://www.hirensbootcd.org/download/</a></p>
-
-<h2>Why Do You Need Hiren Boot 11.5 ISO?</h2>
-
-<p>Hiren Boot 11.5 ISO is a handy tool to have in case you encounter any problems with your PC or need to perform some maintenance tasks on it. For example, you can use Hiren Boot 11.5 ISO to:</p>
-
-<ul>
-<li>Backup and restore your data and partitions.</li>
-<li>Clone or image your hard disk or partition.</li>
-<li>Repair corrupted or damaged files or sectors.</li>
-<li>Recover deleted or lost files or partitions.</li>
-<li>Defrag or optimize your hard disk or partition.</li>
-<li>Test or diagnose your hard disk or memory.</li>
-<li>Erase or wipe your hard disk or partition securely.</li>
-<li>Create or resize your partitions.</li>
-<li>Fix boot problems or errors.</li>
-<li>Restore Windows system files or settings.</li>
-<li>Remove viruses, malware or spyware.</li>
-<li>Find product keys or serial numbers.</li>
-<li>Reset Windows passwords or unlock accounts.</li>
-<li>Change Windows settings or registry entries.</li>
-<li>And more...</li>
-</ul>
-
-<p>Hiren Boot 11.5 ISO can also be used to access your PC when Windows fails to boot or when you forget your password. You can also use it to run various tests or benchmarks on your PC or to troubleshoot hardware issues.</p>
-
-<h2>How to Download Hiren Boot 11.5 ISO?</h2>
-
-<p>To download Hiren Boot 11.5 ISO, you need to visit the official website: <a href="https://www.hirensbootcd.org/download/">https://www.hirensbootcd.org/download/</a></p>
-
-<p>You will see a download link for HBCD_PE_x64.iso file, which is the Hiren Boot 11.5 ISO file. You can also see the file size, MD5, SHA1 and SHA-256 checksums for verification purposes.</p>
-
-<p>You can click on the download link or right-click on it and choose "Save link as..." to save the file to your computer. The file size is about 2.88 GB, so it may take some time depending on your internet speed.</p>
-
-<h2>How to Use Hiren Boot 11.5 ISO for System Recovery?</h2>
-
-<p>To use Hiren Boot 11.5 ISO for system recovery, you need to create a bootable media with it first. You can use a DVD or a USB flash drive for this purpose.</p>
-
-<p>To create a bootable DVD with Hiren Boot 11.5 ISO, you need a DVD burner software such as InfraRecorder (included in Hiren Boot 11.5 ISO) or CDBurnerXP (also included in Hiren Boot 11.5 ISO). You also need a blank DVD disc with enough capacity (at least 4 GB).</p>
-
-<p>To create a bootable USB flash drive with Hiren Boot 11.5 ISO, you need a USB flash drive with enough capacity (at least 4 GB) and a tool called Hiren's BootCD PE - ISO2USB (also included in Hiren Boot 11.5 ISO). This tool will format, re-partition and copy the ISO content into your USB flash drive properly.</p>
-
-<p>You can find detailed instructions on how to create a bootable DVD or USB flash drive with Hiren Boot 11.5 ISO on the official website: <a href="https://www.hirensbootcd.org/usb-booting/">https://www.hirensbootcd.org/usb-booting/</a></p>
-
-<p>Once you have created a bootable media with Hiren Boot 11.5 ISO, you can insert it into your PC and restart it. You may need to change the boot order in your BIOS settings to make your PC boot from the DVD or USB flash drive first.</p>
-
-<p>You will see a menu with various options to choose from. You can select "HBCD Menu" to access the tools and software included in Hiren Boot 11.5 ISO. You can also select "Mini Windows XP" or "Mini Windows 10" to load a minimal Windows environment with some basic functions and drivers.</p>
-
-<p>You can then use the tools and software in Hiren Boot 11.5 ISO according to your needs and preferences. You can find more information on how to use them on the official website: <a href="https://www.hirensbootcd.org/howtos/">https://www.hirensbootcd.org/howtos/</a></p>
-
-<h2>Conclusion</h2>
-
-<p>Hiren Boot 11.5 ISO is a powerful and versatile tool that can help you with various system recovery and maintenance tasks on your PC. You can download it from the official website and create a bootable media with it easily using the tools provided in the package.</p>
-
-<p>You can then use the tools and software in Hiren Boot 11.5 ISO to backup, restore, repair and troubleshoot your PC as well as perform other useful tasks such as removing viruses, resetting passwords, finding product keys and more.</p>
-
-<p>We hope this article has helped you understand how to download hiren boot 11.5 iso and use it for system recovery.</p>
-</p>
-
-<p>You can also join the Hiren's BootCD community on Facebook and Twitter to get the latest updates, news and tips about Hiren Boot 11.5 ISO. You can also share your feedback, suggestions and questions with other users and experts.</p>
-
-<h2>How to Download Hiren Boot 11.5 ISO Safely and Securely?</h2>
-
-<p>When you download Hiren Boot 11.5 ISO from the official website, you can be sure that you are getting a safe and secure file that is free from any viruses, malware or spyware. You can also verify the integrity of the file by checking the MD5, SHA1 and SHA-256 checksums provided on the website.</p>
-
-<p>However, if you download Hiren Boot 11.5 ISO from other sources, you may not be sure about the quality and safety of the file. You may end up with a corrupted, modified or infected file that can harm your PC or compromise your data.</p>
-
-<p>Therefore, we recommend that you always download Hiren Boot 11.5 ISO from the official website: <a href="https://www.hirensbootcd.org/download/">https://www.hirensbootcd.org/download/</a></p>
-
-<p>You can also support the development and maintenance of Hiren Boot 11.5 ISO by making a donation or becoming a mirror on the website.</p>
-
-<h2>Conclusion</h2>
-
-<p>Hiren Boot 11.5 ISO is a powerful and versatile tool that can help you with various system recovery and maintenance tasks on your PC. You can download it from the official website and create a bootable media with it easily using the tools provided in the package.</p>
-
-<p>You can then use the tools and software in Hiren Boot 11.5 ISO to backup, restore, repair and troubleshoot your PC as well as perform other useful tasks such as removing viruses, resetting passwords, finding product keys and more.</p>
-
-<p>We hope this article has helped you understand how to download hiren boot 11.5 iso and use it for system recovery.</p> 3cee63e6c2<br />
-<br />
-<br />
\ No newline at end of file
diff --git a/spaces/sarinam/speaker-anonymization-gan/anonymization/plda_model.py b/spaces/sarinam/speaker-anonymization-gan/anonymization/plda_model.py
deleted file mode 100644
index 059258cffb633e748bb06a64ec82d231163190dd..0000000000000000000000000000000000000000
--- a/spaces/sarinam/speaker-anonymization-gan/anonymization/plda_model.py
+++ /dev/null
@@ -1,82 +0,0 @@
-# This code is based on the descriptions in https://github.com/speechbrain/speechbrain/blob/develop/speechbrain/processing/PLDA_LDA.py
-from pathlib import Path
-from speechbrain.processing.PLDA_LDA import PLDA, StatObject_SB, Ndx, fast_PLDA_scoring
-import numpy as np
-import torch
-
-
-class PLDAModel:
-
-    def __init__(self, train_embeddings, results_path: Path=None):
-        self.mean, self.F, self.Sigma = None, None, None
-
-        files_exist = False
-        if results_path and results_path.exists():
-            files_exist = self.load_parameters(results_path)
-        if not files_exist:
-            self._train_plda(train_embeddings)
-            self.save_parameters(results_path)
-
-    def compute_distance(self, enrollment_vectors, trial_vectors):
-        enrol_vecs = enrollment_vectors.cpu().numpy()
-        en_sets, en_s, en_stat0 = self._get_vector_stats(enrol_vecs, sg_tag='en')
-        en_stat = StatObject_SB(modelset=en_sets, segset=en_sets, start=en_s, stop=en_s, stat0=en_stat0,
-                                stat1=enrol_vecs)
-
-        trial_vecs = trial_vectors.cpu().numpy()
-        te_sets, te_s, te_stat0 = self._get_vector_stats(trial_vecs, sg_tag='te')
-        te_stat = StatObject_SB(modelset=te_sets, segset=te_sets, start=te_s, stop=te_s, stat0=te_stat0,
-                                stat1=trial_vecs)
-
-        ndx = Ndx(models=en_sets, testsegs=te_sets)
-        scores_plda = fast_PLDA_scoring(en_stat, te_stat, ndx, self.mean, self.F, self.Sigma)
-        return scores_plda.scoremat
-
-    def save_parameters(self, filename):
-        filename.parent.mkdir(parents=True, exist_ok=True)
-        np.save(filename / 'plda_mean.npy', self.mean)
-        np.save(filename / 'plda_F.npy', self.F)
-        np.save(filename / 'plda_Sigma.npy', self.Sigma)
-
-    def load_parameters(self, dir_path):
-        existing_files = [x.name for x in dir_path.glob('*')]
-        files_exist = True
-        if 'plda_mean.npy' in existing_files:
-            self.mean = np.load(dir_path / 'plda_mean.npy')
-        else:
-            files_exist = False
-
-        if 'plda_F.npy' in existing_files:
-            self.F = np.load(dir_path / 'plda_F.npy')
-        else:
-            files_exist = False
-
-        if 'plda_Sigma.npy' in existing_files:
-            self.Sigma = np.load(dir_path / 'plda_Sigma.npy')
-        else:
-            files_exist = False
-        return files_exist
-
-    def _train_plda(self, train_embeddings):
-        vectors = train_embeddings.speaker_vectors.to(torch.float64)
-        speakers = train_embeddings.speakers
-
-        modelset = np.array([f'md{speaker}' for speaker in speakers], dtype="|O")
-        segset, s, stat0 = self._get_vector_stats(vectors, sg_tag='sg')
-
-        xvectors_stat = StatObject_SB(modelset=modelset, segset=segset, start=s, stop=s, stat0=stat0,
-                                      stat1=vectors.cpu().numpy())
-
-        plda = PLDA(rank_f=100)
-        plda.plda(xvectors_stat)
-
-        self.mean = plda.mean
-        self.F = plda.F
-        self.Sigma = plda.Sigma
-
-    def _get_vector_stats(self, vectors, sg_tag='sg'):
-        N, dim = vectors.shape
-        segset = np.array([f'{sg_tag}{i}' for i in range(N)], dtype="|O")
-        s = np.array([None] * N)
-        stat0 = np.array([[1.0]] * N)
-        return segset, s, stat0
\ No newline at end of file
diff --git a/spaces/scedlatioru/img-to-music/example/Contoh Program Kerja Tata Usaha Sekolah Google Drive !!INSTALL!!.md b/spaces/scedlatioru/img-to-music/example/Contoh Program Kerja Tata Usaha Sekolah Google Drive !!INSTALL!!.md
deleted file mode 100644
index 9136aa969fc647bdba83abdb32c9625b38871bd6..0000000000000000000000000000000000000000
--- a/spaces/scedlatioru/img-to-music/example/Contoh Program Kerja Tata Usaha Sekolah Google Drive !!INSTALL!!.md	
+++ /dev/null
@@ -1,10 +0,0 @@
-
-<p>apabila suatu perawatan harus tersedia semua pembicara yang penting, orang lain tidak bisa menggunakan teknologi pada sinyal peniruan dan jauh lebih banyak orang tidak bisa mendapatkan suatu pengamanan. jadi tim kerja ini, tetapi juga tim diketahui itu penyesuaian teknologi akan menjadi solusi untuk melakukan perawatan yang sangat tepat, bisa berfungsi di semua penjaga, dan tidak tak perlu mengalami surveil. dengan alasan itu, orang bisa merasakan suatu kepuasan.</p>
-<h2>Contoh Program Kerja Tata Usaha Sekolah Google Drive</h2><br /><p><b><b>Download File</b> ---> <a href="https://gohhs.com/2uEzgS">https://gohhs.com/2uEzgS</a></b></p><br /><br />
-<p>sekolah, tak berpikir,tak berdasarkan sebagaimana sastera musaesman dan sastera hidayah, <em>itulah yang disebut dengan, “egito-egito-egito”. </em> sebagai rasis, jika tidak ada nama binasi itu disebut dengan “nama iblis”. jika tidak ada kebenaran umat islam ia disebut dengan kebohongan. boleh kita sekali lagi tulis ini di atas-atas saya?</p>
-<p>keamanan pelayanan mau didalami secara bersamaan dengan keaslian berdoa, atau dengan program kerja dan nilai, dan praktis dan komunitas. salah satu cara untuk memenuhi kebutuhan pelayanan, keamanan, tetap tinggi, dan memperkirakan apa yang kita akan lakukan. bila keamanan berada di hampirinya, maka kami akan berusaha keras untuk dilakukan. </p>
-<p>istrinya telah memeriksa daerah depan rekamah dan terlambat. tetapi, pemerintah melihat kebutuhan terhad. istrinya memiliki pengurangan produk rekamah yang akan terbatas pada satu tahun sekarang. hal ini hanya akan menarik rekamahnya.</p>
-<p></p>
-<p>jika produt anda tidak menjadi produk yang diinginkan, maka dapat menentukan jumlah produk untuk dipasok kepada pelanggan atau murahnya sebagai teratas. memiliki produk yang diinginkan itu akan berarti menjamin jumlah dokumen atau fasilitas yang harus diperoleh. jika produk yang anda miliki jelas ada jumlah yang lebih banyak dari jumlahnya yang diinginkan, maka hal ini akan membuat anda lebih "berbayar" mereka.</p> 899543212b<br />
-<br />
-<br />
\ No newline at end of file
diff --git a/spaces/scedlatioru/img-to-music/example/Nisekoi Ova 4 720p Film.md b/spaces/scedlatioru/img-to-music/example/Nisekoi Ova 4 720p Film.md
deleted file mode 100644
index 5c9c1a1c9690153b18ed5d50078b40179694fb82..0000000000000000000000000000000000000000
--- a/spaces/scedlatioru/img-to-music/example/Nisekoi Ova 4 720p Film.md	
+++ /dev/null
@@ -1,6 +0,0 @@
-<h2>Nisekoi Ova 4 720p Film</h2><br /><p><b><b>Download Zip</b> ---> <a href="https://gohhs.com/2uEz1t">https://gohhs.com/2uEz1t</a></b></p><br /><br />
-<br />
- 4d29de3e1b<br />
-<br />
-<br />
-<p></p>
diff --git a/spaces/sebby5/eeeeee/README.md b/spaces/sebby5/eeeeee/README.md
deleted file mode 100644
index bf03bdb0c701083b58b2ab333f00e68c67209201..0000000000000000000000000000000000000000
--- a/spaces/sebby5/eeeeee/README.md
+++ /dev/null
@@ -1,10 +0,0 @@
----
-title: Eeeeee
-emoji: 💻
-colorFrom: blue
-colorTo: red
-sdk: docker
-pinned: false
----
-
-Check out the configuration reference at https://huggingface.co/docs/hub/spaces-config-reference
diff --git a/spaces/shgao/EditAnything/ldm/modules/distributions/distributions.py b/spaces/shgao/EditAnything/ldm/modules/distributions/distributions.py
deleted file mode 100644
index f2b8ef901130efc171aa69742ca0244d94d3f2e9..0000000000000000000000000000000000000000
--- a/spaces/shgao/EditAnything/ldm/modules/distributions/distributions.py
+++ /dev/null
@@ -1,92 +0,0 @@
-import torch
-import numpy as np
-
-
-class AbstractDistribution:
-    def sample(self):
-        raise NotImplementedError()
-
-    def mode(self):
-        raise NotImplementedError()
-
-
-class DiracDistribution(AbstractDistribution):
-    def __init__(self, value):
-        self.value = value
-
-    def sample(self):
-        return self.value
-
-    def mode(self):
-        return self.value
-
-
-class DiagonalGaussianDistribution(object):
-    def __init__(self, parameters, deterministic=False):
-        self.parameters = parameters
-        self.mean, self.logvar = torch.chunk(parameters, 2, dim=1)
-        self.logvar = torch.clamp(self.logvar, -30.0, 20.0)
-        self.deterministic = deterministic
-        self.std = torch.exp(0.5 * self.logvar)
-        self.var = torch.exp(self.logvar)
-        if self.deterministic:
-            self.var = self.std = torch.zeros_like(self.mean).to(device=self.parameters.device)
-
-    def sample(self):
-        x = self.mean + self.std * torch.randn(self.mean.shape).to(device=self.parameters.device)
-        return x
-
-    def kl(self, other=None):
-        if self.deterministic:
-            return torch.Tensor([0.])
-        else:
-            if other is None:
-                return 0.5 * torch.sum(torch.pow(self.mean, 2)
-                                       + self.var - 1.0 - self.logvar,
-                                       dim=[1, 2, 3])
-            else:
-                return 0.5 * torch.sum(
-                    torch.pow(self.mean - other.mean, 2) / other.var
-                    + self.var / other.var - 1.0 - self.logvar + other.logvar,
-                    dim=[1, 2, 3])
-
-    def nll(self, sample, dims=[1,2,3]):
-        if self.deterministic:
-            return torch.Tensor([0.])
-        logtwopi = np.log(2.0 * np.pi)
-        return 0.5 * torch.sum(
-            logtwopi + self.logvar + torch.pow(sample - self.mean, 2) / self.var,
-            dim=dims)
-
-    def mode(self):
-        return self.mean
-
-
-def normal_kl(mean1, logvar1, mean2, logvar2):
-    """
-    source: https://github.com/openai/guided-diffusion/blob/27c20a8fab9cb472df5d6bdd6c8d11c8f430b924/guided_diffusion/losses.py#L12
-    Compute the KL divergence between two gaussians.
-    Shapes are automatically broadcasted, so batches can be compared to
-    scalars, among other use cases.
-    """
-    tensor = None
-    for obj in (mean1, logvar1, mean2, logvar2):
-        if isinstance(obj, torch.Tensor):
-            tensor = obj
-            break
-    assert tensor is not None, "at least one argument must be a Tensor"
-
-    # Force variances to be Tensors. Broadcasting helps convert scalars to
-    # Tensors, but it does not work for torch.exp().
-    logvar1, logvar2 = [
-        x if isinstance(x, torch.Tensor) else torch.tensor(x).to(tensor)
-        for x in (logvar1, logvar2)
-    ]
-
-    return 0.5 * (
-        -1.0
-        + logvar2
-        - logvar1
-        + torch.exp(logvar1 - logvar2)
-        + ((mean1 - mean2) ** 2) * torch.exp(-logvar2)
-    )
diff --git a/spaces/shgao/EditAnything/ldm/modules/midas/midas/transforms.py b/spaces/shgao/EditAnything/ldm/modules/midas/midas/transforms.py
deleted file mode 100644
index 350cbc11662633ad7f8968eb10be2e7de6e384e9..0000000000000000000000000000000000000000
--- a/spaces/shgao/EditAnything/ldm/modules/midas/midas/transforms.py
+++ /dev/null
@@ -1,234 +0,0 @@
-import numpy as np
-import cv2
-import math
-
-
-def apply_min_size(sample, size, image_interpolation_method=cv2.INTER_AREA):
-    """Rezise the sample to ensure the given size. Keeps aspect ratio.
-
-    Args:
-        sample (dict): sample
-        size (tuple): image size
-
-    Returns:
-        tuple: new size
-    """
-    shape = list(sample["disparity"].shape)
-
-    if shape[0] >= size[0] and shape[1] >= size[1]:
-        return sample
-
-    scale = [0, 0]
-    scale[0] = size[0] / shape[0]
-    scale[1] = size[1] / shape[1]
-
-    scale = max(scale)
-
-    shape[0] = math.ceil(scale * shape[0])
-    shape[1] = math.ceil(scale * shape[1])
-
-    # resize
-    sample["image"] = cv2.resize(
-        sample["image"], tuple(shape[::-1]), interpolation=image_interpolation_method
-    )
-
-    sample["disparity"] = cv2.resize(
-        sample["disparity"], tuple(shape[::-1]), interpolation=cv2.INTER_NEAREST
-    )
-    sample["mask"] = cv2.resize(
-        sample["mask"].astype(np.float32),
-        tuple(shape[::-1]),
-        interpolation=cv2.INTER_NEAREST,
-    )
-    sample["mask"] = sample["mask"].astype(bool)
-
-    return tuple(shape)
-
-
-class Resize(object):
-    """Resize sample to given size (width, height).
-    """
-
-    def __init__(
-        self,
-        width,
-        height,
-        resize_target=True,
-        keep_aspect_ratio=False,
-        ensure_multiple_of=1,
-        resize_method="lower_bound",
-        image_interpolation_method=cv2.INTER_AREA,
-    ):
-        """Init.
-
-        Args:
-            width (int): desired output width
-            height (int): desired output height
-            resize_target (bool, optional):
-                True: Resize the full sample (image, mask, target).
-                False: Resize image only.
-                Defaults to True.
-            keep_aspect_ratio (bool, optional):
-                True: Keep the aspect ratio of the input sample.
-                Output sample might not have the given width and height, and
-                resize behaviour depends on the parameter 'resize_method'.
-                Defaults to False.
-            ensure_multiple_of (int, optional):
-                Output width and height is constrained to be multiple of this parameter.
-                Defaults to 1.
-            resize_method (str, optional):
-                "lower_bound": Output will be at least as large as the given size.
-                "upper_bound": Output will be at max as large as the given size. (Output size might be smaller than given size.)
-                "minimal": Scale as least as possible.  (Output size might be smaller than given size.)
-                Defaults to "lower_bound".
-        """
-        self.__width = width
-        self.__height = height
-
-        self.__resize_target = resize_target
-        self.__keep_aspect_ratio = keep_aspect_ratio
-        self.__multiple_of = ensure_multiple_of
-        self.__resize_method = resize_method
-        self.__image_interpolation_method = image_interpolation_method
-
-    def constrain_to_multiple_of(self, x, min_val=0, max_val=None):
-        y = (np.round(x / self.__multiple_of) * self.__multiple_of).astype(int)
-
-        if max_val is not None and y > max_val:
-            y = (np.floor(x / self.__multiple_of) * self.__multiple_of).astype(int)
-
-        if y < min_val:
-            y = (np.ceil(x / self.__multiple_of) * self.__multiple_of).astype(int)
-
-        return y
-
-    def get_size(self, width, height):
-        # determine new height and width
-        scale_height = self.__height / height
-        scale_width = self.__width / width
-
-        if self.__keep_aspect_ratio:
-            if self.__resize_method == "lower_bound":
-                # scale such that output size is lower bound
-                if scale_width > scale_height:
-                    # fit width
-                    scale_height = scale_width
-                else:
-                    # fit height
-                    scale_width = scale_height
-            elif self.__resize_method == "upper_bound":
-                # scale such that output size is upper bound
-                if scale_width < scale_height:
-                    # fit width
-                    scale_height = scale_width
-                else:
-                    # fit height
-                    scale_width = scale_height
-            elif self.__resize_method == "minimal":
-                # scale as least as possbile
-                if abs(1 - scale_width) < abs(1 - scale_height):
-                    # fit width
-                    scale_height = scale_width
-                else:
-                    # fit height
-                    scale_width = scale_height
-            else:
-                raise ValueError(
-                    f"resize_method {self.__resize_method} not implemented"
-                )
-
-        if self.__resize_method == "lower_bound":
-            new_height = self.constrain_to_multiple_of(
-                scale_height * height, min_val=self.__height
-            )
-            new_width = self.constrain_to_multiple_of(
-                scale_width * width, min_val=self.__width
-            )
-        elif self.__resize_method == "upper_bound":
-            new_height = self.constrain_to_multiple_of(
-                scale_height * height, max_val=self.__height
-            )
-            new_width = self.constrain_to_multiple_of(
-                scale_width * width, max_val=self.__width
-            )
-        elif self.__resize_method == "minimal":
-            new_height = self.constrain_to_multiple_of(scale_height * height)
-            new_width = self.constrain_to_multiple_of(scale_width * width)
-        else:
-            raise ValueError(f"resize_method {self.__resize_method} not implemented")
-
-        return (new_width, new_height)
-
-    def __call__(self, sample):
-        width, height = self.get_size(
-            sample["image"].shape[1], sample["image"].shape[0]
-        )
-
-        # resize sample
-        sample["image"] = cv2.resize(
-            sample["image"],
-            (width, height),
-            interpolation=self.__image_interpolation_method,
-        )
-
-        if self.__resize_target:
-            if "disparity" in sample:
-                sample["disparity"] = cv2.resize(
-                    sample["disparity"],
-                    (width, height),
-                    interpolation=cv2.INTER_NEAREST,
-                )
-
-            if "depth" in sample:
-                sample["depth"] = cv2.resize(
-                    sample["depth"], (width, height), interpolation=cv2.INTER_NEAREST
-                )
-
-            sample["mask"] = cv2.resize(
-                sample["mask"].astype(np.float32),
-                (width, height),
-                interpolation=cv2.INTER_NEAREST,
-            )
-            sample["mask"] = sample["mask"].astype(bool)
-
-        return sample
-
-
-class NormalizeImage(object):
-    """Normlize image by given mean and std.
-    """
-
-    def __init__(self, mean, std):
-        self.__mean = mean
-        self.__std = std
-
-    def __call__(self, sample):
-        sample["image"] = (sample["image"] - self.__mean) / self.__std
-
-        return sample
-
-
-class PrepareForNet(object):
-    """Prepare sample for usage as network input.
-    """
-
-    def __init__(self):
-        pass
-
-    def __call__(self, sample):
-        image = np.transpose(sample["image"], (2, 0, 1))
-        sample["image"] = np.ascontiguousarray(image).astype(np.float32)
-
-        if "mask" in sample:
-            sample["mask"] = sample["mask"].astype(np.float32)
-            sample["mask"] = np.ascontiguousarray(sample["mask"])
-
-        if "disparity" in sample:
-            disparity = sample["disparity"].astype(np.float32)
-            sample["disparity"] = np.ascontiguousarray(disparity)
-
-        if "depth" in sample:
-            depth = sample["depth"].astype(np.float32)
-            sample["depth"] = np.ascontiguousarray(depth)
-
-        return sample
diff --git a/spaces/shgao/EditAnything/sam_train_sd21.py b/spaces/shgao/EditAnything/sam_train_sd21.py
deleted file mode 100644
index 75d76a6371d20e643bb4de6fd4637ab895b60f4d..0000000000000000000000000000000000000000
--- a/spaces/shgao/EditAnything/sam_train_sd21.py
+++ /dev/null
@@ -1,39 +0,0 @@
-from share import *
-
-import pytorch_lightning as pl
-from torch.utils.data import DataLoader
-from utils.sam_dataset import SAMDataset
-from cldm.logger import ImageLogger
-from cldm.model import create_model, load_state_dict
-import torch
-
-
-# Configs
-resume_path = './models/control_sd21_ini.ckpt'
-batch_size = 4
-logger_freq = 300
-learning_rate = 1e-5
-sd_locked = True
-only_mid_control = False
-data_path = '../data/files'
-txt_path = '../data/data_85616.txt'
-
-
-# First use cpu to load models. Pytorch Lightning will automatically move it to GPUs.
-model = create_model('./models/cldm_v21.yaml').cpu()
-model.load_state_dict(load_state_dict(resume_path, location='cpu'))
-model.learning_rate = learning_rate
-model.sd_locked = sd_locked
-model.only_mid_control = only_mid_control
-
-
-# Misc
-dataset = SAMDataset(data_path=data_path, txt_path=txt_path)
-dataloader = DataLoader(dataset, num_workers=16,
-                        batch_size=batch_size, shuffle=True)
-logger = ImageLogger(batch_frequency=logger_freq)
-trainer = pl.Trainer(gpus=8, strategy="ddp", precision=32, callbacks=[logger])
-
-
-# Train!
-trainer.fit(model, dataloader)
diff --git a/spaces/shgao/EditAnything/vlpart/vlpart.py b/spaces/shgao/EditAnything/vlpart/vlpart.py
deleted file mode 100644
index 1c15ae7b591d908153e6a751b64babaca9fe96de..0000000000000000000000000000000000000000
--- a/spaces/shgao/EditAnything/vlpart/vlpart.py
+++ /dev/null
@@ -1,185 +0,0 @@
-import logging
-import numpy as np
-import itertools
-from typing import Dict, List, Optional, Tuple
-import torch
-import torch.nn.functional as F
-from torch import nn
-
-from detectron2.config import configurable
-from detectron2.data.detection_utils import convert_image_to_rgb
-from detectron2.layers import move_device_like, batched_nms
-from detectron2.structures import ImageList, Boxes, Instances, BitMasks, ROIMasks
-
-from detectron2.modeling.backbone import Backbone, build_backbone
-from detectron2.modeling.proposal_generator import build_proposal_generator
-from detectron2.config import get_cfg
-
-
-import clip
-from vlpart.text_encoder import build_text_encoder
-from vlpart.swintransformer import build_swinbase_fpn_backbone
-from vlpart.vlpart_roi_heads import build_vlpart_roi_heads
-
-
-def build_vlpart(checkpoint=None):
-    cfg = get_cfg()
-    cfg.merge_from_list(['MODEL.RPN.IN_FEATURES', ["p2", "p3", "p4", "p5", "p6"],
-                         'MODEL.ROI_HEADS.IN_FEATURES', ["p2", "p3", "p4", "p5"],
-                         'MODEL.ROI_BOX_CASCADE_HEAD.IOUS', [0.5, 0.6, 0.7],
-                         'MODEL.ROI_BOX_HEAD.CLS_AGNOSTIC_BBOX_REG', True,
-                         'MODEL.ROI_BOX_HEAD.NAME', "FastRCNNConvFCHead",
-                         'MODEL.ROI_BOX_HEAD.POOLER_RESOLUTION', 7,
-                         'MODEL.ROI_BOX_HEAD.NUM_FC', 2,
-                         'MODEL.ANCHOR_GENERATOR.SIZES', [[32], [64], [128], [256], [512]],
-                         'MODEL.ANCHOR_GENERATOR.ASPECT_RATIOS', [[0.5, 1.0, 2.0]],
-    ])
-    backbone = build_swinbase_fpn_backbone()
-    vlpart = VLPart(
-        backbone=backbone,
-        proposal_generator=build_proposal_generator(cfg, backbone.output_shape()),
-        roi_heads=build_vlpart_roi_heads(cfg, backbone.output_shape()),
-    )
-    vlpart.eval()
-    if checkpoint is not None:
-        with open(checkpoint, "rb") as f:
-            state_dict = torch.load(f)
-        vlpart.load_state_dict(state_dict['model'], strict=False)
-
-    return vlpart
-
-
-class VLPart(nn.Module):
-    def __init__(
-        self,
-        backbone: Backbone,
-        proposal_generator: nn.Module,
-        roi_heads: nn.Module,
-    ):
-        super().__init__()
-
-        self.backbone = backbone
-        self.proposal_generator = proposal_generator
-        self.roi_heads = roi_heads
-        self.text_encoder = build_text_encoder(pretrain=True, visual_type='RN50')
-
-        self.register_buffer("pixel_mean",
-                             torch.tensor([123.675, 116.280, 103.530]).view(-1, 1, 1), False)
-        self.register_buffer("pixel_std",
-                             torch.tensor([58.395, 57.120, 57.375]).view(-1, 1, 1), False)
-
-    @property
-    def device(self):
-        return self.pixel_mean.device
-
-    def _move_to_current_device(self, x):
-        return move_device_like(x, self.pixel_mean)
-
-    def get_text_embeddings(self, vocabulary, prefix_prompt='a '):
-        vocabulary = vocabulary.split('.')
-        texts = [prefix_prompt + x.lower().replace(':', ' ') for x in vocabulary]
-        texts_aug = texts + ['background']
-        emb = self.text_encoder(texts_aug).permute(1, 0)
-        emb = F.normalize(emb, p=2, dim=0)
-        return emb
-
-    def inference(
-        self,
-        batched_inputs: List[Dict[str, torch.Tensor]],
-        do_postprocess: bool = True,
-        text_prompt: str = 'dog',
-    ):
-        assert not self.training
-
-        images = self.preprocess_image(batched_inputs)
-        features = self.backbone(images.tensor)
-        proposals, _ = self.proposal_generator(images, features)
-        text_embed = self.get_text_embeddings(text_prompt)
-        results, _ = self.roi_heads(images, features, proposals, text_embed)
-        if do_postprocess:
-            assert not torch.jit.is_scripting(), "Scripting is not supported for postprocess."
-            max_shape = images.tensor.shape[2:]
-            return VLPart._postprocess(results, batched_inputs, images.image_sizes, max_shape)
-        else:
-            return results
-
-
-    def preprocess_image(self, batched_inputs: List[Dict[str, torch.Tensor]]):
-        """
-        Normalize, pad and batch the input images.
-        """
-        original_images = [self._move_to_current_device(x["image"]) for x in batched_inputs]
-        images = [(x - self.pixel_mean) / self.pixel_std for x in original_images]
-        images = ImageList.from_tensors(
-            images,
-            self.backbone.size_divisibility,
-            padding_constraints=self.backbone.padding_constraints,
-        )
-        return images
-
-    @staticmethod
-    def _postprocess(instances, batched_inputs: List[Dict[str, torch.Tensor]], image_sizes, max_shape):
-        """
-        Rescale the output instances to the target size.
-        """
-        # note: private function; subject to changes
-        processed_results = []
-        for results_per_image, input_per_image, image_size in zip(
-                instances, batched_inputs, image_sizes
-        ):
-            height = input_per_image.get("height", image_size[0])
-            width = input_per_image.get("width", image_size[1])
-            r = custom_detector_postprocess(results_per_image, height, width, max_shape)
-            processed_results.append({"instances": r})
-        return processed_results
-
-
-def custom_detector_postprocess(
-        results: Instances, output_height: int, output_width: int,
-        max_shape, mask_threshold: float = 0.5
-):
-    """
-    detector_postprocess with support on global_masks
-    """
-    if isinstance(output_width, torch.Tensor):
-        # This shape might (but not necessarily) be tensors during tracing.
-        # Converts integer tensors to float temporaries to ensure true
-        # division is performed when computing scale_x and scale_y.
-        output_width_tmp = output_width.float()
-        output_height_tmp = output_height.float()
-        new_size = torch.stack([output_height, output_width])
-    else:
-        new_size = (output_height, output_width)
-        output_width_tmp = output_width
-        output_height_tmp = output_height
-
-    scale_x, scale_y = (
-        output_width_tmp / results.image_size[1],
-        output_height_tmp / results.image_size[0],
-    )
-
-    resized_h, resized_w = results.image_size
-    results = Instances(new_size, **results.get_fields())
-
-    if results.has("pred_boxes"):
-        output_boxes = results.pred_boxes
-    else:
-        output_boxes = None
-    assert output_boxes is not None, "Predictions must contain boxes!"
-
-    output_boxes.scale(scale_x, scale_y)
-    output_boxes.clip(results.image_size)
-
-    results = results[output_boxes.nonempty()]
-
-    if results.has("pred_masks"):
-        if isinstance(results.pred_masks, ROIMasks):
-            roi_masks = results.pred_masks
-        else:
-            # pred_masks is a tensor of shape (N, 1, M, M)
-            roi_masks = ROIMasks(results.pred_masks[:, 0, :, :])
-        results.pred_masks = roi_masks.to_bitmasks(
-            results.pred_boxes, output_height, output_width, mask_threshold
-        ).tensor  # TODO return ROIMasks/BitMask object in the future
-
-    return results
diff --git a/spaces/simple0urra/skops-model-card-creator-2a23515a-d54e-4804-b365-27ed6e938735/example/Download Criminal Case Indonesia Mod APK and Become a Detective.md b/spaces/simple0urra/skops-model-card-creator-2a23515a-d54e-4804-b365-27ed6e938735/example/Download Criminal Case Indonesia Mod APK and Become a Detective.md
deleted file mode 100644
index 2120e756d3c23f4fffc3742a2dd9c14063bc12cd..0000000000000000000000000000000000000000
--- a/spaces/simple0urra/skops-model-card-creator-2a23515a-d54e-4804-b365-27ed6e938735/example/Download Criminal Case Indonesia Mod APK and Become a Detective.md	
+++ /dev/null
@@ -1,112 +0,0 @@
-<br />
-<h1>Criminal Case Indonesia Mod Apk: A Guide for Detective Game Lovers</h1>
- <p>If you are a fan of detective games, you might have heard of Criminal Case, a popular game where you can solve crimes and catch criminals. But did you know that there is a modified version of this game that gives you unlimited benefits and access to all the features? In this article, we will tell you everything you need to know about Criminal Case Indonesia Mod Apk, a game that will make you feel like a real detective.</p>
- <h2>What is Criminal Case?</h2>
- <h3>A brief introduction to the game and its features</h3>
- <p>Criminal Case is a game developed by Pretty Simple, a French studio that specializes in casual games. It was released in 2012 for Facebook, and later for iOS and Android devices. The game has over 100 million downloads and has won several awards, such as the Facebook Game of the Year in 2013.</p>
-<h2>criminal case indonesia mod apk</h2><br /><p><b><b>Download File</b> ---> <a href="https://ssurll.com/2uNXC0">https://ssurll.com/2uNXC0</a></b></p><br /><br />
- <p>The game is set in the fictional city of Grimsborough, where you play as a rookie detective who works for the Grimsborough Police Department. Your job is to investigate various crime scenes, collect clues, analyze evidence, interrogate suspects, and arrest the culprits. You can also customize your avatar, choose your outfits, and decorate your office.</p>
- <h3>How to play Criminal Case?</h3>
- <h4>The basics of investigation and evidence collection</h4>
- <p>To start a case, you need to select a crime scene from the map. Each crime scene has a list of items that you need to find in a limited time. The faster you find them, the more points you get. You can also use hints or tools to help you find the items. Some items are clues that you need to send to the lab for analysis. You can also collect fingerprints, DNA samples, or blood samples from the crime scene.</p>
- <h4>The different types of scenes and cases</h4>
- <p>There are six types of scenes in Criminal Case: regular scenes, hidden object scenes, puzzle scenes, matching scenes, spot the difference scenes, and time attack scenes. Each scene has a different gameplay and difficulty level. You can also replay the scenes to improve your score and earn more stars.</p>
- <p>There are also different types of cases in Criminal Case: regular cases, special cases, elite cases, bonus cases, and limited edition cases. Each case has a different storyline and theme. You can also choose the difficulty level of each case: easy, medium, hard, or expert.</p>
- <h4>The role of teammates and pets</h4>
- <p>You can also invite your friends to join your team in Criminal Case. Your teammates can help you by sending you energy, hints, tools, or reports. You can also visit their offices and send them gifts. You can also chat with them and share your progress.</p>
-<p>criminal case indonesia mod apk unlimited money<br />
-criminal case indonesia mod apk unlimited energy<br />
-criminal case indonesia mod apk unlocked all<br />
-criminal case indonesia mod apk latest version<br />
-criminal case indonesia mod apk download 2023<br />
-criminal case indonesia mod apk offline<br />
-criminal case indonesia mod apk no root<br />
-criminal case indonesia mod apk free shopping<br />
-criminal case indonesia mod apk android 1<br />
-criminal case indonesia mod apk revdl<br />
-criminal case indonesia mod apk rexdl<br />
-criminal case indonesia mod apk happymod<br />
-criminal case indonesia mod apk pure<br />
-criminal case indonesia mod apk apkpure<br />
-criminal case indonesia mod apk apkmody<br />
-criminal case indonesia mod apk an1<br />
-criminal case indonesia mod apk mob.org<br />
-criminal case indonesia mod apk samudranesia.id<br />
-criminal case indonesia mod apk cheat<br />
-criminal case indonesia mod apk hack<br />
-criminal case indonesia mod apk terbaru<br />
-criminal case indonesia mod apk versi lama<br />
-criminal case indonesia mod apk update<br />
-criminal case indonesia mod apk 2022<br />
-criminal case indonesia mod apk 2021<br />
-download game criminal case indonesia mod apk<br />
-cara download criminal case indonesia mod apk<br />
-link download criminal case indonesia mod apk<br />
-review criminal case indonesia mod apk<br />
-fitur-fitur unggulan criminal case indonesia mod apk<br />
-perbandingan criminal case original & mod apk<br />
-cara instal criminal case indonesia mod apk<br />
-cara main criminal case indonesia mod apk<br />
-tips dan trik bermain criminal case indonesia mod apk<br />
-gameplay video of criminal case indonesia mod apk<br />
-screenshot of criminal case indonesia mod apk<br />
-rating and review of criminal case indonesia mod apk on google play store<br />
-how to get free star and energy in criminal case indonesia mod apk<br />
-how to unlock all cases in criminal case indonesia mod apk<br />
-how to solve all puzzles in criminal case indonesia mod apk<br />
-how to play with friends in criminal case indonesia mod apk<br />
-how to join a team in criminal case indonesia mod apk<br />
-how to earn more coins in criminal case indonesia mod apk<br />
-how to customize your avatar in criminal case indonesia mod apk<br />
-how to collect all trophies in criminal case indonesia mod apk<br />
-how to access the elite mode in criminal case indonesia mod apk<br />
-how to get more hints in criminal case indonesia mod apk<br />
-how to use the crime scene analyzer in criminal case indonesia mod apk<br />
-how to upgrade your lab equipment in criminal case indonesia mod apk</p>
- <p>You can also adopt pets in Criminal Case. Pets can help you by finding items or clues in the crime scenes. You can also feed them, play with them, and dress them up.</p>
- <h2>What is Criminal Case Indonesia Mod Apk?</h2>
- <h3>A modified version of the original game with unlimited benefits</h3>
- <p>Criminal Case Indonesia Mod Apk is a version of the original game that has been modified by some developers to give you unlimited benefits and access to all the features. With this mod apk, you can enjoy the game without any limitations or restrictions.</p>
- <h3>How to download and install Criminal Case <h3>How to download and install Criminal Case Indonesia Mod Apk?</h3>
- <h4>The steps to get the mod apk on your device</h4>
- <p>To download and install Criminal Case Indonesia Mod Apk, you need to follow these steps:</p>
- <ol>
-<li>Find a reliable source that offers the mod apk file. You can use a search engine or a website that specializes in modded games. For example, you can check out [this link](^1^) for the latest version of the mod apk.</li>
-<li>Download the mod apk file to your device. You may need to enable the option to allow downloads from unknown sources in your settings. This will let you install apps that are not from the Google Play Store.</li>
-<li>Locate the downloaded file in your file manager or browser. Tap on it to start the installation process. You may need to grant some permissions to the app, such as access to storage, network, and device information.</li>
-<li>Wait for the installation to finish. You should see a confirmation message that the app has been installed successfully.</li>
-<li>Launch the app and enjoy the game with unlimited benefits and features.</li>
-</ol>
- <h4>The precautions to take before installing the mod apk</h4>
- <p>Before you install Criminal Case Indonesia Mod Apk, you should take some precautions to avoid any problems or risks. Here are some tips to keep in mind:</p>
- <ul>
-<li>Make sure you have enough space on your device for the mod apk file and the game data. The mod apk file is about 70 MB, while the game data is about 500 MB.</li>
-<li>Make sure you have a stable internet connection for downloading and installing the mod apk file and the game data. You may also need an internet connection to play some cases and access some features.</li>
-<li>Make sure you have a backup of your original game data and progress. You can use a cloud service or a local storage to save your game data. This will help you restore your game if something goes wrong with the mod apk.</li>
-<li>Make sure you have a good antivirus or security app on your device. This will help you scan the mod apk file for any viruses or malware that may harm your device or steal your data.</li>
-<li>Make sure you read the reviews and comments of other users who have downloaded and installed the mod apk file. This will help you know if the mod apk works well and if there are any issues or bugs with it.</li>
-</ul> <h2>What are the advantages of using Criminal Case Indonesia Mod Apk?</h2>
- <h3>Unlimited energy and money</h3>
- <p>One of the main advantages of using Criminal Case Indonesia Mod Apk is that you get unlimited energy and money. Energy is used to play the scenes and cases, while money is used to buy items and tools. Normally, you have to wait for your energy to refill or watch ads to get more. You also have to earn money by completing tasks or achievements. But with the mod apk, you don't have to worry about running out of energy or money. You can play as much as you want and buy whatever you need.</p>
- <h3>Unlock all scenes and cases</h3>
- <p>Another advantage of using Criminal Case Indonesia Mod Apk is that you can unlock all the scenes and cases in the game. Normally, you have to progress through the game and earn stars to unlock new scenes and cases. You also have to wait for some cases to be released or updated. But with the mod apk, you can access all the scenes and cases from the start. You can also skip the waiting time and play the new cases as soon as they are available.</p>
- <h3>Access to premium features and items</h3>
- <p>A third advantage of using Criminal Case Indonesia Mod Apk is that you can access all the premium features and items in the game. Normally, you have to pay real money or use in-game currency to get these features and items. Some of them include extra hints, tools, outfits, pets, badges, stickers, and wallpapers. But with the mod apk, you can get all these features and items for free. You can also use them without any limitations or restrictions.</p>
- <h2>Conclusion</h2>
- <p>Criminal Case Indonesia Mod Apk is a great option for detective game lovers who want to enjoy the game without any limitations or restrictions. With this mod apk, you can get unlimited energy and money, unlock all scenes and cases, and access all premium features and items. You can also download and install the mod apk easily by following some simple steps and precautions. However, you should also be careful about the source of the mod apk and the security of your device. If you are ready to become a real detective, download Criminal Case Indonesia Mod Apk today and start solving crimes!</p>
- <h2>FAQs</h2>
- <p>Here are some frequently asked questions about Criminal Case Indonesia Mod Apk:</p>
- <ol>
-<li>Is Criminal Case Indonesia Mod Apk safe to use?</li>
-<p>Criminal Case Indonesia Mod Apk is generally safe to use if you download it from a reliable source and scan it for any viruses or malware. However, you should also be aware that using a mod apk may violate the terms of service of the original game and may result in your account being banned or suspended.</p>
-<li>Is Criminal Case Indonesia Mod Apk compatible with my device?</li>
-<p>Criminal Case Indonesia Mod Apk is compatible with most Android devices that have Android 4.1 or higher. However, some devices may not support the mod apk or may experience some glitches or errors. You should also make sure that your device has enough space and memory for the mod apk file and the game data.</p>
-<li>Can I play Criminal Case Indonesia Mod Apk offline?</li>
-<p>Criminal Case Indonesia Mod Apk can be played offline for some scenes and cases that do not require an internet connection. However, some features and functions may not work properly or may be disabled when you play offline. You may also need an internet connection to update the game or access new content.</p>
-<li>Can I play Criminal Case Indonesia Mod Apk with my friends?</li>
-<p>Criminal Case Indonesia Mod Apk can be played with your friends who also have the mod apk installed on their devices. You can invite them to join your team, send them gifts, chat with them, and share your progress. However, you may not be able to play with your friends who have the original game installed on their devices.</p>
-<li>Can I update Criminal Case Indonesia Mod Apk?</li>
-<p>Criminal Case Indonesia Mod Apk can be updated by downloading and installing the latest version of the mod apk file from the same source that you used before. You should also make sure that you backup your game data before updating the mod apk. However, you may not be able to update the mod apk if the developers of the original game release a new version that is incompatible with the mod apk.</p>
-</ol></p> 197e85843d<br />
-<br />
-<br />
\ No newline at end of file
diff --git a/spaces/sky1/sky/README.md b/spaces/sky1/sky/README.md
deleted file mode 100644
index d673114edadba73e80f33a3c71bc0dbee8758cc8..0000000000000000000000000000000000000000
--- a/spaces/sky1/sky/README.md
+++ /dev/null
@@ -1,14 +0,0 @@
----
-title: Real CUGAN
-emoji: 🐢
-colorFrom: gray
-colorTo: green
-sdk: gradio
-sdk_version: 3.6
-app_file: app.py
-pinned: false
-license: gpl-3.0
-duplicated_from: DianXian/Real-CUGAN
----
-
-Check out the configuration reference at https://huggingface.co/docs/hub/spaces-config-reference
diff --git a/spaces/sriramelango/Social_Classification_Public/fairseq/examples/roberta/multiprocessing_bpe_encoder.py b/spaces/sriramelango/Social_Classification_Public/fairseq/examples/roberta/multiprocessing_bpe_encoder.py
deleted file mode 100644
index 43fe0451bf4d5762d734314075b1402c2a8db2bb..0000000000000000000000000000000000000000
--- a/spaces/sriramelango/Social_Classification_Public/fairseq/examples/roberta/multiprocessing_bpe_encoder.py
+++ /dev/null
@@ -1,130 +0,0 @@
-#!/usr/bin/env python
-# Copyright (c) Facebook, Inc. and its affiliates.
-# All rights reserved.
-#
-# This source code is licensed under the license found in the
-# LICENSE file in the root directory of this source tree.
-
-import argparse
-import contextlib
-import sys
-from collections import Counter
-from multiprocessing import Pool
-
-from fairseq.data.encoders.gpt2_bpe import get_encoder
-
-
-def main():
-    """
-    Helper script to encode raw text with the GPT-2 BPE using multiple processes.
-
-    The encoder.json and vocab.bpe files can be obtained here:
-    - https://dl.fbaipublicfiles.com/fairseq/gpt2_bpe/encoder.json
-    - https://dl.fbaipublicfiles.com/fairseq/gpt2_bpe/vocab.bpe
-    """
-    parser = argparse.ArgumentParser()
-    parser.add_argument(
-        "--encoder-json",
-        help="path to encoder.json",
-    )
-    parser.add_argument(
-        "--vocab-bpe",
-        type=str,
-        help="path to vocab.bpe",
-    )
-    parser.add_argument(
-        "--inputs",
-        nargs="+",
-        default=["-"],
-        help="input files to filter/encode",
-    )
-    parser.add_argument(
-        "--outputs",
-        nargs="+",
-        default=["-"],
-        help="path to save encoded outputs",
-    )
-    parser.add_argument(
-        "--keep-empty",
-        action="store_true",
-        help="keep empty lines",
-    )
-    parser.add_argument("--workers", type=int, default=20)
-    args = parser.parse_args()
-
-    assert len(args.inputs) == len(
-        args.outputs
-    ), "number of input and output paths should match"
-
-    with contextlib.ExitStack() as stack:
-        inputs = [
-            stack.enter_context(open(input, "r", encoding="utf-8"))
-            if input != "-"
-            else sys.stdin
-            for input in args.inputs
-        ]
-        outputs = [
-            stack.enter_context(open(output, "w", encoding="utf-8"))
-            if output != "-"
-            else sys.stdout
-            for output in args.outputs
-        ]
-
-        encoder = MultiprocessingEncoder(args)
-        pool = Pool(args.workers, initializer=encoder.initializer)
-        encoded_lines = pool.imap(encoder.encode_lines, zip(*inputs), 100)
-
-        stats = Counter()
-        for i, (filt, enc_lines) in enumerate(encoded_lines, start=1):
-            if filt == "PASS":
-                for enc_line, output_h in zip(enc_lines, outputs):
-                    print(enc_line, file=output_h)
-            else:
-                stats["num_filtered_" + filt] += 1
-            if i % 10000 == 0:
-                print("processed {} lines".format(i), file=sys.stderr)
-
-        for k, v in stats.most_common():
-            print("[{}] filtered {} lines".format(k, v), file=sys.stderr)
-
-
-class MultiprocessingEncoder(object):
-    def __init__(self, args):
-        self.args = args
-
-    def initializer(self):
-        global bpe
-        bpe = get_encoder(self.args.encoder_json, self.args.vocab_bpe)
-
-    def encode(self, line):
-        global bpe
-        ids = bpe.encode(line)
-        return list(map(str, ids))
-
-    def decode(self, tokens):
-        global bpe
-        return bpe.decode(tokens)
-
-    def encode_lines(self, lines):
-        """
-        Encode a set of lines. All lines will be encoded together.
-        """
-        enc_lines = []
-        for line in lines:
-            line = line.strip()
-            if len(line) == 0 and not self.args.keep_empty:
-                return ["EMPTY", None]
-            tokens = self.encode(line)
-            enc_lines.append(" ".join(tokens))
-        return ["PASS", enc_lines]
-
-    def decode_lines(self, lines):
-        dec_lines = []
-        for line in lines:
-            tokens = map(int, line.strip().split())
-            dec_lines.append(self.decode(tokens))
-        return ["PASS", dec_lines]
-
-
-if __name__ == "__main__":
-    main()
diff --git a/spaces/sriramelango/Social_Classification_Public/fairseq/tests/test_file_io.py b/spaces/sriramelango/Social_Classification_Public/fairseq/tests/test_file_io.py
deleted file mode 100644
index 425812bf1672489093941e5fa09f9da3171559ee..0000000000000000000000000000000000000000
--- a/spaces/sriramelango/Social_Classification_Public/fairseq/tests/test_file_io.py
+++ /dev/null
@@ -1,58 +0,0 @@
-# This source code is licensed under the MIT license found in the
-# LICENSE file in the root directory of this source tree.
-
-import os
-import shutil
-import sys
-import tempfile
-import unittest
-from typing import Optional
-from unittest.mock import MagicMock
-
-
-class TestFileIO(unittest.TestCase):
-
-    _tmpdir: Optional[str] = None
-    _tmpfile: Optional[str] = None
-    _tmpfile_contents = "Hello, World"
-
-    @classmethod
-    def setUpClass(cls) -> None:
-        cls._tmpdir = tempfile.mkdtemp()
-        with open(os.path.join(cls._tmpdir, "test.txt"), "w") as f:
-            cls._tmpfile = f.name
-            f.write(cls._tmpfile_contents)
-            f.flush()
-
-    @classmethod
-    def tearDownClass(cls) -> None:
-        # Cleanup temp working dir.
-        if cls._tmpdir is not None:
-            shutil.rmtree(cls._tmpdir)  # type: ignore
-
-    def test_file_io(self):
-        from fairseq.file_io import PathManager
-
-        with PathManager.open(os.path.join(self._tmpdir, "test.txt"), "r") as f:
-            s = f.read()
-        self.assertEqual(s, self._tmpfile_contents)
-
-    def test_file_io_oss(self):
-        # Mock iopath to simulate oss environment.
-        sys.modules["iopath"] = MagicMock()
-        from fairseq.file_io import PathManager
-
-        with PathManager.open(os.path.join(self._tmpdir, "test.txt"), "r") as f:
-            s = f.read()
-        self.assertEqual(s, self._tmpfile_contents)
-
-    def test_file_io_async(self):
-        # ioPath `PathManager` is initialized after the first `opena` call.
-        try:
-            from fairseq.file_io import IOPathManager, PathManager
-            _asyncfile = os.path.join(self._tmpdir, "async.txt")
-            f = PathManager.opena(_asyncfile, "wb")
-            f.close()
-
-        finally:
-            self.assertTrue(PathManager.async_close())
diff --git a/spaces/stomexserde/gpt4-ui/Examples/Audirvana Plus 1.4.6 License Crack.md b/spaces/stomexserde/gpt4-ui/Examples/Audirvana Plus 1.4.6 License Crack.md
deleted file mode 100644
index 4ba641b2c922caf139990690099700fbe3c65b31..0000000000000000000000000000000000000000
--- a/spaces/stomexserde/gpt4-ui/Examples/Audirvana Plus 1.4.6 License Crack.md	
+++ /dev/null
@@ -1,34 +0,0 @@
-
-Here is a possible title and article with SEO optimization and HTML formatting for the keyword "Audirvana Plus 1.4.6 License Crack":
-
-<h1>Audirvana Plus 1.4.6 License Crack: How to Download and Activate the Best Audio Player for Mac</h1>
-
-<p>If you are looking for a high-quality audio player for your Mac, you might have heard of Audirvana Plus. Audirvana Plus is a software that claims to deliver the best sound quality possible from your computer, by bypassing the operating system's audio mixer and sending the audio directly to your DAC (digital-to-analog converter). Audirvana Plus also supports a wide range of audio formats, including high-resolution files up to 32-bit/384 kHz, DSD files, and MQA files.</p>
-<h2>Audirvana Plus 1.4.6 License Crack</h2><br /><p><b><b>DOWNLOAD</b> ->>->>->> <a href="https://urlgoal.com/2uI82c">https://urlgoal.com/2uI82c</a></b></p><br /><br />
-
-<p>However, Audirvana Plus is not a free software. You need to purchase a license to use it on your Mac, which costs $74. If you don't want to pay that much, you might be tempted to look for a crack or a patch that can activate Audirvana Plus without a license. But is that a good idea? And how can you find a reliable and safe Audirvana Plus 1.4.6 license crack?</p>
-
-<h2>The Risks of Using an Audirvana Plus 1.4.6 License Crack</h2>
-
-<p>Before you download any crack or patch for Audirvana Plus, you should be aware of the risks involved. First of all, using a cracked software is illegal and unethical. You are violating the terms and conditions of the software developer, and you are depriving them of their rightful income. You are also disrespecting their hard work and creativity.</p>
-
-<p>Secondly, using a cracked software can expose your computer to malware and viruses. Many cracks and patches are distributed by hackers who want to infect your system with malicious code. They can steal your personal information, damage your files, or take control of your device. You might end up paying more than the price of the license to fix your computer or recover your data.</p>
-<p></p>
-
-<p>Thirdly, using a cracked software can compromise the performance and quality of the software itself. Cracks and patches can introduce bugs, errors, or glitches that can affect the functionality of Audirvana Plus. You might experience crashes, freezes, or distortions in your audio playback. You might also miss out on the latest updates and features that the official version offers.</p>
-
-<h2>The Best Way to Download and Activate Audirvana Plus 1.4.6</h2>
-
-<p>So what is the best way to download and activate Audirvana Plus 1.4.6? The answer is simple: buy a license from the official website. This way, you can enjoy all the benefits of Audirvana Plus without any risks or drawbacks.</p>
-
-<p>To buy a license, you need to visit <a href="https://audirvana.com/buy/">https://audirvana.com/buy/</a> and choose your preferred payment method. You can pay with PayPal, credit card, or Apple Pay. After you complete the payment, you will receive an email with your license key and a download link for Audirvana Plus 1.4.6.</p>
-
-<p>To activate Audirvana Plus 1.4.6, you need to download and install the software on your Mac. Then, you need to launch it and enter your license key when prompted. You can also activate Audirvana Plus on up to two Macs with the same license key.</p>
-
-<h2>Conclusion</h2>
-
-<p>Audirvana Plus 1.4.6 is one of the best audio players for Mac users who want to enjoy high-quality sound from their computer. However, it is not a free software, and using a crack or a patch to activate it is not advisable.</p>
-
-<p>If you want to use Audirvana Plus 1.4.6 legally and safely, you should buy a license from the official website and activate it with your license key. This way, you can support the developer, protect your computer from malware, and enjoy all the features and updates of Audirvana Plus.</p> 7196e7f11a<br />
-<br />
-<br />
\ No newline at end of file
diff --git a/spaces/stomexserde/gpt4-ui/Examples/Barbara Ann Brennan Luz Emergente Download Pdf REPACK.md b/spaces/stomexserde/gpt4-ui/Examples/Barbara Ann Brennan Luz Emergente Download Pdf REPACK.md
deleted file mode 100644
index 03de9cd8c9c305a3173028030488f23d81c026cb..0000000000000000000000000000000000000000
--- a/spaces/stomexserde/gpt4-ui/Examples/Barbara Ann Brennan Luz Emergente Download Pdf REPACK.md	
+++ /dev/null
@@ -1,22 +0,0 @@
-
-<h1>Luz Emergente: A Jornada da Cura Pessoal</h1>
-<p>Luz Emergente é um livro de Barbara Ann Brennan, uma renomada curadora energética e espiritual, que explica como o processo de cura se dá em diferentes níveis de consciência e como cada um de nós pode participar ativamente dele. O livro apresenta uma visão holística da saúde, baseada na ciência da holografia, e oferece insights sobre os níveis do hara e do núcleo estelar, que são aspectos essenciais da nossa natureza multidimensional. Luz Emergente é uma obra pioneira e inspiradora, que nos convida a explorar o potencial de cura que existe em cada um de nós.</p>
-<h2>barbara ann brennan luz emergente download pdf</h2><br /><p><b><b>Download Zip</b> &#10084; <a href="https://urlgoal.com/2uIaWw">https://urlgoal.com/2uIaWw</a></b></p><br /><br />
-<p>Para baixar o livro em formato PDF, você pode acessar um dos seguintes links:</p>
-<ul>
-<li><a href="https://www.scribd.com/document/486514537/Luz-Emergente-Barbara-Ann-Brennan-1-2018-11-21-10-52-58-UTC-pdf">Luz Emergente - Barbara Ann Brennan (1) (2018 - 11 - 21 10 - 52 - 58 UTC) PDF</a> (Scribd)</li>
-<li><a href="https://archive.org/details/barbara-brennan-light-emerging-journey-of-personal-healing">Light Emerging: The Journey of Personal Healing</a> (Internet Archive)</li>
-<li><a href="https://docs.google.com/file/d/0B19i53RbeZt-NGE0YTc1OWQtOThkNi00NzQwLTlhNjctNTdjNmUxMTNhYTgz/edit?num=50&sort=name&layout=list&pli=1">Barbara Ann Brennan - Mãos de Luz.pdf</a> (Google Drive)</li>
-</ul>
-<p>Espero que você aproveite a leitura e que ela lhe traga benefícios para a sua saúde e bem-estar. 😊</p><p>O livro Luz Emergente é dividido em quatro partes, que abordam os seguintes temas:</p>
-<p></p>
-<ol>
-<li>A anatomia do campo energético humano, que inclui os sete chakras principais, as camadas da aura, os cordões energéticos e os meridianos.</li>
-<li>Os princípios da cura energética, que envolvem a percepção sensorial, a intenção, a ressonância, a transferência de energia e a integração.</li>
-<li>As técnicas de cura energética, que ensinam como fazer o diagnóstico, a limpeza, o equilíbrio, a reparação e a reestruturação do campo energético.</li>
-<li>A jornada da cura pessoal, que mostra como cada nível de consciência afeta a nossa saúde física, emocional, mental e espiritual.</li>
-</ol>
-<p>O livro também contém ilustrações coloridas que facilitam o entendimento dos conceitos e dos processos de cura. Além disso, o livro traz vários exemplos práticos e casos reais de pessoas que se beneficiaram da cura energética.</p><p>Um exemplo de caso real que o livro Luz Emergente apresenta é o de uma mulher chamada Susan, que sofria de depressão e baixa autoestima. Ela procurou a ajuda de Barbara Ann Brennan, que fez uma sessão de cura energética com ela. Durante a sessão, Barbara percebeu que o campo energético de Susan estava muito fraco e desorganizado, especialmente na região do terceiro chakra, que está relacionado ao poder pessoal e à identidade. Barbara também notou que Susan tinha vários cordões energéticos negativos ligados a pessoas do seu passado, que a drenavam e a manipulavam. Barbara então limpou e equilibrou o campo energético de Susan, cortou os cordões negativos e reforçou o seu terceiro chakra. Após a sessão, Susan se sentiu mais leve, mais confiante e mais feliz. Ela continuou o tratamento com Barbara e conseguiu superar a sua depressão e melhorar a sua autoestima.</p>
-<p>Uma técnica de cura energética que o livro Luz Emergente ensina é a da imposição de mãos, que consiste em colocar as mãos sobre ou próximo ao corpo da pessoa que se deseja curar, com a intenção de transmitir energia positiva e amorosa. Essa técnica pode ser usada para aliviar dores, acalmar emoções, estimular a circulação sanguínea, fortalecer o sistema imunológico e harmonizar os chakras. Para fazer a imposição de mãos, é preciso estar em um estado de relaxamento e concentração, respirar profundamente e visualizar uma luz branca entrando pelo topo da cabeça e saindo pelas palmas das mãos. Em seguida, é preciso colocar as mãos sobre ou próximo à área do corpo que se quer curar, mantendo uma atitude de compaixão e respeito. A imposição de mãos pode durar alguns minutos ou mais, dependendo da necessidade da pessoa.</p> 7b8c122e87<br />
-<br />
-<br />
\ No newline at end of file
diff --git a/spaces/superdup95/su/Dockerfile b/spaces/superdup95/su/Dockerfile
deleted file mode 100644
index eef259fa372a804549fb0af0913718a13344da34..0000000000000000000000000000000000000000
--- a/spaces/superdup95/su/Dockerfile
+++ /dev/null
@@ -1,11 +0,0 @@
-FROM node:18-bullseye-slim
-RUN apt-get update && \
-    apt-get install -y git
-RUN git clone https://gitgud.io/khanon/oai-reverse-proxy.git /app
-WORKDIR /app
-RUN npm install
-COPY Dockerfile greeting.md* .env* ./
-RUN npm run build
-EXPOSE 7860
-ENV NODE_ENV=production
-CMD [ "npm", "start" ]
diff --git a/spaces/suppsumstagza/text-to-image-stable-diffusion-v1-5/scripts/Phoenix Bios Editor 2.2 Download TOP.md b/spaces/suppsumstagza/text-to-image-stable-diffusion-v1-5/scripts/Phoenix Bios Editor 2.2 Download TOP.md
deleted file mode 100644
index e6e351dae2ba0da93a8711b78604983a5596f9a6..0000000000000000000000000000000000000000
--- a/spaces/suppsumstagza/text-to-image-stable-diffusion-v1-5/scripts/Phoenix Bios Editor 2.2 Download TOP.md	
+++ /dev/null
@@ -1,74 +0,0 @@
-
-<h1>Phoenix Bios Editor 2.2: A Powerful Tool for AMD Graphics Card Users</h1>
-<p>If you are looking for a software tool that can help you edit the BIOS of your AMD graphics card, you might want to check out Phoenix Bios Editor 2.2. This software allows you to modify various parameters of your graphics card, such as memory timings, fan settings, core and memory frequencies, and voltage settings. By doing so, you can optimize the performance of your graphics card for mining and gaming purposes.</p>
-<h2>What is Phoenix Bios Editor 2.2?</h2>
-<p>Phoenix Bios Editor 2.2 is a software tool developed by Phoenix Technologies, a leading company in PC innovation since 1979. The software is designed to edit the BIOS of AMD graphics cards, which are small programs that control the basic functions of the hardware. The software supports a wide range of AMD graphics cards, including the Radeon HD 7000, Radeon R7, Radeon R9, Radeon RX 400, and Radeon RX 500 series.</p>
-<h2>phoenix bios editor 2.2 download</h2><br /><p><b><b>Download</b> &#128504; <a href="https://cinurl.com/2uEZ2E">https://cinurl.com/2uEZ2E</a></b></p><br /><br />
-<h2>What are the features of Phoenix Bios Editor 2.2?</h2>
-<p>Phoenix Bios Editor 2.2 has a user-friendly interface that makes it easy to navigate and use. The software has several features that allow you to adjust the various parameters of your graphics card, such as:</p>
-<ul>
-<li><b>Memory Timing Editor:</b> This feature allows you to adjust the memory timings of your graphics card, which can improve the card’s performance in mining and gaming. Memory timings are the intervals between different operations performed by the memory chips.</li>
-<li><b>Voltage Editor:</b> The voltage editor allows you to adjust the voltage settings of your graphics card, which can increase the card’s stability and performance. Voltage settings are the amount of electric current supplied to the components of the graphics card.</li>
-<li><b>Fan Control:</b> Phoenix Bios Editor 2.2 allows you to adjust the fan speed of your graphics card, which can help to reduce the temperature of the card and increase its performance. Fan speed is the rate at which the fan rotates to cool down the graphics card.</li>
-<li><b>Core and Memory Clock Editor:</b> The software also allows you to adjust the core and memory clock settings of your graphics card, which can improve the card’s overall performance. Core and memory clock settings are the frequencies at which the core and memory chips operate.</li>
-<li><b>Power Limit Editor:</b> This feature allows you to adjust the power limit of your graphics card, which can help to increase the card’s performance while staying within safe power consumption levels. Power limit is the maximum amount of power that the graphics card can draw from the power supply.</li>
-</ul>
-<h2>How to use Phoenix Bios Editor 2.2?</h2>
-<p>To use Phoenix Bios Editor 2.2, you need to download and install it on your computer. You can download it from <a href="https://phoenix-bios-editor-pro.software.informer.com/2.2/">here</a>. After installing it, you need to follow these steps:</p>
-<ol>
-<li>Open the software and click on the “Open BIOS” button to load the BIOS file of your graphics card.</li>
-<li>Once the BIOS file is loaded, you can start editing the various parameters using the options available on the left-hand side of the screen.</li>
-<li>To edit the memory timings, click on the “Memory Timings” tab and adjust the settings to your preferred values.</li>
-<li>To adjust the voltage settings, click on the “Voltage” tab and make the necessary changes.</li>
-<li>To adjust the fan speed, click on the “Fan” tab and adjust the fan curve to your preferred settings.</li>
-<li>To adjust the core and memory clock settings, click on the “Core/Memory Clock” tab and make the necessary changes.</li>
-<li>Once you have made all the necessary changes, click on the “Save BIOS” button to save the edited BIOS file.</li>
-<li>Restart your computer to apply the changes to your graphics card.</li>
-</ol>
-<p>It is important to note that editing the BIOS of your graphics card can be risky and may void your warranty. It is recommended that you backup your original BIOS before making any changes and proceed with caution.</p>
-<h2>Conclusion</h2>
-<p>Phoenix Bios Editor 2.2 is a powerful tool for AMD graphics card users who want to optimize their cards for mining and gaming purposes. The software allows you to modify various parameters of your graphics card, such as memory timings, fan settings, core and memory frequencies, and voltage settings. By doing so, you can improve the performance of your graphics card while staying within safe power consumption levels. You can download Phoenix Bios Editor 2.2 from <a href="https://phoenix-bios-editor-pro.software.informer.com/2.2/">here</a>. However, be careful when editing your BIOS as it can be risky and may void your warranty.</p>
-<h2>Why use Phoenix Bios Editor 2.2?</h2>
-<p>There are many reasons why you might want to use Phoenix Bios Editor 2.2 to edit the BIOS of your AMD graphics card. Some of the benefits include:</p>
-<ul>
-<li><b>Improved performance:</b> By tweaking the parameters of your graphics card, you can improve its performance in various tasks, such as mining and gaming. For example, you can increase the core and memory clock frequencies to boost the speed of your graphics card, or you can adjust the memory timings to reduce the latency of your memory chips.</li>
-<li><b>Customization:</b> Phoenix Bios Editor 2.2 allows you to customize your graphics card according to your preferences and needs. For example, you can adjust the fan speed to control the noise and temperature of your graphics card, or you can adjust the voltage settings to increase or decrease the power consumption of your graphics card.</li>
-<li><b>Compatibility:</b> Phoenix Bios Editor 2.2 is compatible with a wide range of AMD graphics cards, so you can use it for different models and generations of AMD GPUs. The software also supports various BIOS formats, such as ROM, BIN, CAP, and WPH.</li>
-</ul>
-<h2>Where to download Phoenix Bios Editor 2.2?</h2>
-<p>If you are interested in using Phoenix Bios Editor 2.2 to edit the BIOS of your AMD graphics card, you can download it from <a href="https://phoenix-bios-editor-pro.software.informer.com/2.2/">here</a>. This is a trusted and reliable source that offers the latest version of the software for free. You can also find other sources online that offer Phoenix Bios Editor 2.2 for download, but be careful as some of them might contain malware or viruses.</p>
-<h2>How to backup your original BIOS?</h2>
-<p>Before you use Phoenix Bios Editor 2.2 to edit the BIOS of your AMD graphics card, it is highly recommended that you backup your original BIOS first. This way, you can restore your original BIOS in case something goes wrong or you are not satisfied with the changes. To backup your original BIOS, you need to follow these steps:</p>
-<p></p>
-<ol>
-<li>Download and install GPU-Z on your computer. You can download it from <a href="https://www.techpowerup.com/download/techpowerup-gpu-z/">here</a>.</li>
-<li>Open GPU-Z and click on the “Advanced” tab.</li>
-<li>Select “BIOS” from the drop-down menu.</li>
-<li>Click on the “Save” icon next to “BIOS Version”.</li>
-<li>Select a location and a name for your BIOS file and click on “Save”.</li>
-<li>You have successfully backed up your original BIOS.</li>
-</ol>
-<p>You can use GPU-Z to restore your original BIOS as well. Just click on the “Load” icon next to “BIOS Version” and select your backup file.</p>
-<h2>What are the advantages of Phoenix Bios Editor 2.2 over other BIOS editing tools?</h2>
-<p>Phoenix Bios Editor 2.2 is not the only BIOS editing tool available for AMD graphics card users. There are other tools that can perform similar functions, such as Polaris Bios Editor, Red Bios Editor, and SRBPolaris. However, Phoenix Bios Editor 2.2 has some advantages over these tools, such as:</p>
-<ul>
-<li><b>Compliance with industry standards:</b> Phoenix Bios Editor 2.2 is compliant with various industry standards, such as UEFI and PI specifications, ACPI, SMBIOS, TCG, TPM, WUFU, and LVFS. This ensures that the software is compatible with different operating systems and platforms.</li>
-<li><b>Native EDKII support:</b> Phoenix Bios Editor 2.2 supports EDKII, which is a development environment for UEFI applications and firmware. This allows users to access advanced features and functions of UEFI.</li>
-<li><b>Wide range of supported BIOS formats:</b> Phoenix Bios Editor 2.2 supports various BIOS formats, such as ROM, BIN, CAP, and WPH. This allows users to edit different types of BIOS files without any hassle.</li>
-<li><b>User-friendly interface:</b> Phoenix Bios Editor 2.2 has a user-friendly interface that makes it easy to navigate and use. The software has clear and intuitive options that allow users to edit the parameters of their graphics card with ease.</li>
-</ul>
-<h2>What are the risks of using Phoenix Bios Editor 2.2?</h2>
-<p>While Phoenix Bios Editor 2.2 can offer many benefits to AMD graphics card users, it also comes with some risks that users should be aware of before using it. Some of the risks include:</p>
-<ul>
-<li><b>Possible damage to your graphics card:</b> Editing the BIOS of your graphics card can potentially damage your graphics card if you make incorrect or incompatible changes. For example, if you increase the voltage settings too much, you might overheat or burn your graphics card.</li>
-<li><b>Possible loss of warranty:</b> Editing the BIOS of your graphics card might void your warranty from the manufacturer or the seller. This means that you might not be able to get a refund or a replacement if your graphics card malfunctions or breaks down.</li>
-<li><b>Possible instability or performance issues:</b> Editing the BIOS of your graphics card might cause instability or performance issues if you make unsuitable or excessive changes. For example, if you increase the core and memory clock frequencies too much, you might experience crashes or artifacts on your screen.</li>
-</ul>
-<p>Therefore, it is important that you use Phoenix Bios Editor 2.2 with caution and care. You should always backup your original BIOS before making any changes and test your changes carefully before applying them permanently.</p>
-<h2>Phoenix Bios Editor 2.2: A Summary</h2>
-<p>Phoenix Bios Editor 2.2 is a software tool that can help you edit the BIOS of your AMD graphics card. The software allows you to modify various parameters of your graphics card, such as memory timings, fan settings, core and memory frequencies, and voltage settings. By doing so, you can optimize the performance of your graphics card for mining and gaming purposes.</p>
-<p>Phoenix Bios Editor 2.2 has many features that make it a powerful and user-friendly tool for AMD graphics card users. The software is compliant with industry standards, supports native EDKII, supports various BIOS formats, and has a user-friendly interface. The software also supports a wide range of AMD graphics cards, including the Radeon HD 7000, Radeon R7, Radeon R9, Radeon RX 400, and Radeon RX 500 series.</p>
-<p>However, Phoenix Bios Editor 2.2 also comes with some risks that you should be aware of before using it. Editing the BIOS of your graphics card can potentially damage your graphics card, void your warranty, or cause instability or performance issues. Therefore, you should always backup your original BIOS before making any changes and proceed with caution.</p>
-<p>If you are interested in using Phoenix Bios Editor 2.2 to edit the BIOS of your AMD graphics card, you can download it from <a href="https://phoenix-bios-editor-pro.software.informer.com/2.2/">here</a>. However, be careful when editing your BIOS as it can be risky and may void your warranty.</p> 3cee63e6c2<br />
-<br />
-<br />
\ No newline at end of file
diff --git a/spaces/suppsumstagza/text-to-image-stable-diffusion-v1-5/scripts/Ranchi Diaries Movie Download In Hd.md b/spaces/suppsumstagza/text-to-image-stable-diffusion-v1-5/scripts/Ranchi Diaries Movie Download In Hd.md
deleted file mode 100644
index 91a1ec9d4234636b04700d09764f7eb5bbae3c04..0000000000000000000000000000000000000000
--- a/spaces/suppsumstagza/text-to-image-stable-diffusion-v1-5/scripts/Ranchi Diaries Movie Download In Hd.md	
+++ /dev/null
@@ -1,10 +0,0 @@
-<h2>Ranchi Diaries movie download in hd</h2><br /><p><b><b>DOWNLOAD</b> &#9675;&#9675;&#9675; <a href="https://cinurl.com/2uEYKY">https://cinurl.com/2uEYKY</a></b></p><br /><br />
-<br />
-Follow us for more funny videos: full promotional video of the upcoming . "Does anyone remember what they did to start their new day?"
-(Yes, I'm talking about people creating this on a Sunday at 8 a.m.!)
-“They will try to figure out where they are if they can't remember when they were last.
-They wake up like they don't even know how it's done," he said.
-“They only eat when they feel very hungry, they wear what they feel comfortable with, and they never leave the house without asking permission. 8a78ff9644<br />
-<br />
-<br />
-<p></p>
diff --git a/spaces/suppsumstagza/text-to-image-stable-diffusion-v1-5/scripts/Windows 7 Professional Key License Key All In One In 32-64 Bit [BETTER].md b/spaces/suppsumstagza/text-to-image-stable-diffusion-v1-5/scripts/Windows 7 Professional Key License Key All In One In 32-64 Bit [BETTER].md
deleted file mode 100644
index 671154081260094318dbbee7a46558198f692c30..0000000000000000000000000000000000000000
--- a/spaces/suppsumstagza/text-to-image-stable-diffusion-v1-5/scripts/Windows 7 Professional Key License Key All In One In 32-64 Bit [BETTER].md	
+++ /dev/null
@@ -1,16 +0,0 @@
-<h2>Windows 7 Professional Key License Key All in One In 32-64 Bit</h2><br /><p><b><b>Download File</b> &#9913; <a href="https://cinurl.com/2uEXfb">https://cinurl.com/2uEXfb</a></b></p><br /><br />
-
-May 9, 2020 - Windows 7 Professional product key for 32/64-bit - EHY4Q-VB55H-XK8VD-5Y68P-RFQ43 - 2666Q-HGXKH-DFP6M-7YGBB-BQ7Q7 - 74T2M-DKDBC-788W3-H689G-6P6GT ... 0/5
-How to check the Windows 7 key on the ...
-1 Apr 2016 ...
-How to check the Windows 7 key on the Microsoft website ...
-On Microsoft's official website, in the "licensing" section, you can check the Windows 7 product key ... Windows 8 and 8.1 (product key).
-How do I know my Windows 7 key?
-Windows 7 Professional OEM E8440Y-BDC4H-2TP9V-D97VC-2W7CQ
-How to know the key or serial number of the Windows ...
-29 Jun 2012 ...
-Where is the Windows 7 product key?
-How do I find out the Windows 7 product key? .... 8a78ff9644<br />
-<br />
-<br />
-<p></p>
diff --git a/spaces/tang155/bingo/src/pages/api/image.ts b/spaces/tang155/bingo/src/pages/api/image.ts
deleted file mode 100644
index 4b894bea86050c0f3888cc56f60c0cb7f8b57cfc..0000000000000000000000000000000000000000
--- a/spaces/tang155/bingo/src/pages/api/image.ts
+++ /dev/null
@@ -1,40 +0,0 @@
-'use server'
-
-import { NextApiRequest, NextApiResponse } from 'next'
-import { debug } from '@/lib/isomorphic'
-import { createHeaders } from '@/lib/utils'
-import { createImage } from '@/lib/bots/bing/utils'
-
-export default async function handler(req: NextApiRequest, res: NextApiResponse) {
-  const { prompt, id } = req.query
-  if (!prompt) {
-    return res.json({
-      result: {
-        value: 'Image',
-        message: 'No Prompt'
-      }
-    })
-  }
-  try {
-    const headers = createHeaders(req.cookies, {
-      IMAGE_BING_COOKIE: process.env.IMAGE_BING_COOKIE
-    })
-
-    debug('headers', headers)
-    const response = await createImage(String(prompt), String(id), {
-      ...headers,
-      'x-ms-useragent': 'azsdk-js-api-client-factory/1.0.0-beta.1 core-rest-pipeline/1.10.0 OS/Win32',
-    })
-    res.writeHead(200, {
-      'Content-Type': 'text/plain; charset=UTF-8',
-    })
-    return res.end(response)
-  } catch (e) {
-    return res.json({
-      result: {
-        value: 'Error',
-        message: `${e}`
-      }
-    })
-  }
-}
diff --git a/spaces/tbvl/Fake_Face_Detection/dataset/real_n_fake_dataloader.py b/spaces/tbvl/Fake_Face_Detection/dataset/real_n_fake_dataloader.py
deleted file mode 100644
index f15f0d20a2adb24c4b466acf7c7fae7ef8a7612f..0000000000000000000000000000000000000000
--- a/spaces/tbvl/Fake_Face_Detection/dataset/real_n_fake_dataloader.py
+++ /dev/null
@@ -1,119 +0,0 @@
-# We will use this file to create a dataloader for the real and fake dataset
-import os
-import json
-import torch
-from torchvision import transforms
-from torch.utils.data import DataLoader, Dataset
-from PIL import Image
-import numpy as np
-import pandas as pd
-import cv2
-
-import cv2
-import numpy as np
-import matplotlib.pyplot as plt
-import pywt
-
-class Extracted_Frames_Dataset(Dataset):
-    def __init__(self, root_dir, split = "train", transform = None, extend = 'None', multi_modal = "dct"):
-        """
-        Args:   
-        returns:
-            """
-        AssertionError(split in ["train", "val", "test"]), "Split must be one of (train, val, test)"
-        self.multi_modal = multi_modal
-        self.root_dir = root_dir
-        self.split = split
-        self.transform = transform
-        if extend == 'faceswap':
-            self.dataset = pd.read_csv(os.path.join(root_dir, f"faceswap_extended_{self.split}.csv"))
-        elif extend == 'fsgan':
-            self.dataset = pd.read_csv(os.path.join(root_dir, f"fsgan_extended_{self.split}.csv"))
-        else:
-            self.dataset = pd.read_csv(os.path.join(root_dir, f"{self.split}.csv"))
-                
-
-    def __len__(self):
-        return len(self.dataset)
-
-    def __getitem__(self, idx):
-        sample_input = self.get_sample_input(idx)
-        return sample_input
-    
-
-    def get_sample_input(self, idx):
-        rgb_image = self.get_rgb_image(idx)
-        label = self.get_label(idx) 
-        if self.multi_modal == "dct":
-            dct_image = self.get_dct_image(idx)
-            sample_input = {"rgb_image": rgb_image, "dct_image": dct_image, "label": label}
-
-        # dct_image = self.get_dct_image(idx)
-        elif self.multi_modal == "fft":
-            fft_image = self.get_fft_image(idx)
-            sample_input = {"rgb_image": rgb_image, "dct_image": fft_image, "label": label}
-        elif self.multi_modal == "hh":
-            hh_image = self.get_hh_image(idx)
-            sample_input = {"rgb_image": rgb_image, "dct_image": hh_image, "label": label}
-        else:
-            AssertionError("multi_modal must be one of (dct:discrete cosine transform, fft: fast forier transform, hh)")
-
-        return sample_input
-
-    
-    def get_fft_image(self, idx):
-        gray_image_path = self.dataset.iloc[idx, 0]
-        gray_image = cv2.imread(gray_image_path, cv2.IMREAD_GRAYSCALE)
-        fft_image = self.compute_fft(gray_image)
-        if self.transform:
-            fft_image = self.transform(fft_image)
-        
-        return fft_image
-
-    
-    def compute_fft(self, image):
-        f = np.fft.fft2(image)
-        fshift = np.fft.fftshift(f)
-        magnitude_spectrum = 20 * np.log(np.abs(fshift) + 1)  # Add 1 to avoid log(0)
-        return magnitude_spectrum
-
-
-    def get_hh_image(self, idx):
-        gray_image_path = self.dataset.iloc[idx, 0]
-        gray_image = cv2.imread(gray_image_path, cv2.IMREAD_GRAYSCALE)
-        hh_image = self.compute_hh(gray_image)
-        if self.transform:
-            hh_image = self.transform(hh_image)
-        return hh_image
-    
-    def compute_hh(self, image):
-        coeffs2 = pywt.dwt2(image, 'haar')
-        LL, (LH, HL, HH) = coeffs2
-        return HH
-        
-    def get_rgb_image(self, idx):
-        rgb_image_path = self.dataset.iloc[idx, 0]
-        rgb_image = Image.open(rgb_image_path)
-        if self.transform:
-            rgb_image = self.transform(rgb_image)
-        return rgb_image
-    
-    def get_dct_image(self, idx):
-        rgb_image_path = self.dataset.iloc[idx, 0]
-        rgb_image = cv2.imread(rgb_image_path)
-        dct_image = self.compute_dct_color(rgb_image)
-        if self.transform:
-            dct_image = self.transform(dct_image)
-        
-        return dct_image
-    
-    def get_label(self, idx):
-        return self.dataset.iloc[idx, 1]
-    
-
-    def compute_dct_color(self, image):
-        image_float = np.float32(image)
-        dct_image = np.zeros_like(image_float)
-        for i in range(3):  
-            dct_image[:, :, i] = cv2.dct(image_float[:, :, i])
-        return dct_image
diff --git a/spaces/terfces0erbo/CollegeProjectV2/Crack Licence Topsolid 7.7.md b/spaces/terfces0erbo/CollegeProjectV2/Crack Licence Topsolid 7.7.md
deleted file mode 100644
index 2f3ef9bc6ccb612cf2c6c5248672d599ff581dba..0000000000000000000000000000000000000000
--- a/spaces/terfces0erbo/CollegeProjectV2/Crack Licence Topsolid 7.7.md	
+++ /dev/null
@@ -1,6 +0,0 @@
-<h2>Crack licence topsolid 7.7</h2><br /><p><b><b>Download Zip</b> &#128504;&#128504;&#128504; <a href="https://bytlly.com/2uGkJL">https://bytlly.com/2uGkJL</a></b></p><br /><br />
-
- d5da3c52bf<br />
-<br />
-<br />
-<p></p>
diff --git a/spaces/theaster/RVC-New-Arknights/infer_pack/models.py b/spaces/theaster/RVC-New-Arknights/infer_pack/models.py
deleted file mode 100644
index 96165f73644e6fb92d0ffedb4a3c9e1a457cb989..0000000000000000000000000000000000000000
--- a/spaces/theaster/RVC-New-Arknights/infer_pack/models.py
+++ /dev/null
@@ -1,982 +0,0 @@
-import math, pdb, os
-from time import time as ttime
-import torch
-from torch import nn
-from torch.nn import functional as F
-from infer_pack import modules
-from infer_pack import attentions
-from infer_pack import commons
-from infer_pack.commons import init_weights, get_padding
-from torch.nn import Conv1d, ConvTranspose1d, AvgPool1d, Conv2d
-from torch.nn.utils import weight_norm, remove_weight_norm, spectral_norm
-from infer_pack.commons import init_weights
-import numpy as np
-from infer_pack import commons
-
-
-class TextEncoder256(nn.Module):
-    def __init__(
-        self,
-        out_channels,
-        hidden_channels,
-        filter_channels,
-        n_heads,
-        n_layers,
-        kernel_size,
-        p_dropout,
-        f0=True,
-    ):
-        super().__init__()
-        self.out_channels = out_channels
-        self.hidden_channels = hidden_channels
-        self.filter_channels = filter_channels
-        self.n_heads = n_heads
-        self.n_layers = n_layers
-        self.kernel_size = kernel_size
-        self.p_dropout = p_dropout
-        self.emb_phone = nn.Linear(256, hidden_channels)
-        self.lrelu = nn.LeakyReLU(0.1, inplace=True)
-        if f0 == True:
-            self.emb_pitch = nn.Embedding(256, hidden_channels)  # pitch 256
-        self.encoder = attentions.Encoder(
-            hidden_channels, filter_channels, n_heads, n_layers, kernel_size, p_dropout
-        )
-        self.proj = nn.Conv1d(hidden_channels, out_channels * 2, 1)
-
-    def forward(self, phone, pitch, lengths):
-        if pitch == None:
-            x = self.emb_phone(phone)
-        else:
-            x = self.emb_phone(phone) + self.emb_pitch(pitch)
-        x = x * math.sqrt(self.hidden_channels)  # [b, t, h]
-        x = self.lrelu(x)
-        x = torch.transpose(x, 1, -1)  # [b, h, t]
-        x_mask = torch.unsqueeze(commons.sequence_mask(lengths, x.size(2)), 1).to(
-            x.dtype
-        )
-        x = self.encoder(x * x_mask, x_mask)
-        stats = self.proj(x) * x_mask
-
-        m, logs = torch.split(stats, self.out_channels, dim=1)
-        return m, logs, x_mask
-
-
-class TextEncoder256Sim(nn.Module):
-    def __init__(
-        self,
-        out_channels,
-        hidden_channels,
-        filter_channels,
-        n_heads,
-        n_layers,
-        kernel_size,
-        p_dropout,
-        f0=True,
-    ):
-        super().__init__()
-        self.out_channels = out_channels
-        self.hidden_channels = hidden_channels
-        self.filter_channels = filter_channels
-        self.n_heads = n_heads
-        self.n_layers = n_layers
-        self.kernel_size = kernel_size
-        self.p_dropout = p_dropout
-        self.emb_phone = nn.Linear(256, hidden_channels)
-        self.lrelu = nn.LeakyReLU(0.1, inplace=True)
-        if f0 == True:
-            self.emb_pitch = nn.Embedding(256, hidden_channels)  # pitch 256
-        self.encoder = attentions.Encoder(
-            hidden_channels, filter_channels, n_heads, n_layers, kernel_size, p_dropout
-        )
-        self.proj = nn.Conv1d(hidden_channels, out_channels, 1)
-
-    def forward(self, phone, pitch, lengths):
-        if pitch == None:
-            x = self.emb_phone(phone)
-        else:
-            x = self.emb_phone(phone) + self.emb_pitch(pitch)
-        x = x * math.sqrt(self.hidden_channels)  # [b, t, h]
-        x = self.lrelu(x)
-        x = torch.transpose(x, 1, -1)  # [b, h, t]
-        x_mask = torch.unsqueeze(commons.sequence_mask(lengths, x.size(2)), 1).to(
-            x.dtype
-        )
-        x = self.encoder(x * x_mask, x_mask)
-        x = self.proj(x) * x_mask
-        return x, x_mask
-
-
-class ResidualCouplingBlock(nn.Module):
-    def __init__(
-        self,
-        channels,
-        hidden_channels,
-        kernel_size,
-        dilation_rate,
-        n_layers,
-        n_flows=4,
-        gin_channels=0,
-    ):
-        super().__init__()
-        self.channels = channels
-        self.hidden_channels = hidden_channels
-        self.kernel_size = kernel_size
-        self.dilation_rate = dilation_rate
-        self.n_layers = n_layers
-        self.n_flows = n_flows
-        self.gin_channels = gin_channels
-
-        self.flows = nn.ModuleList()
-        for i in range(n_flows):
-            self.flows.append(
-                modules.ResidualCouplingLayer(
-                    channels,
-                    hidden_channels,
-                    kernel_size,
-                    dilation_rate,
-                    n_layers,
-                    gin_channels=gin_channels,
-                    mean_only=True,
-                )
-            )
-            self.flows.append(modules.Flip())
-
-    def forward(self, x, x_mask, g=None, reverse=False):
-        if not reverse:
-            for flow in self.flows:
-                x, _ = flow(x, x_mask, g=g, reverse=reverse)
-        else:
-            for flow in reversed(self.flows):
-                x = flow(x, x_mask, g=g, reverse=reverse)
-        return x
-
-    def remove_weight_norm(self):
-        for i in range(self.n_flows):
-            self.flows[i * 2].remove_weight_norm()
-
-
-class PosteriorEncoder(nn.Module):
-    def __init__(
-        self,
-        in_channels,
-        out_channels,
-        hidden_channels,
-        kernel_size,
-        dilation_rate,
-        n_layers,
-        gin_channels=0,
-    ):
-        super().__init__()
-        self.in_channels = in_channels
-        self.out_channels = out_channels
-        self.hidden_channels = hidden_channels
-        self.kernel_size = kernel_size
-        self.dilation_rate = dilation_rate
-        self.n_layers = n_layers
-        self.gin_channels = gin_channels
-
-        self.pre = nn.Conv1d(in_channels, hidden_channels, 1)
-        self.enc = modules.WN(
-            hidden_channels,
-            kernel_size,
-            dilation_rate,
-            n_layers,
-            gin_channels=gin_channels,
-        )
-        self.proj = nn.Conv1d(hidden_channels, out_channels * 2, 1)
-
-    def forward(self, x, x_lengths, g=None):
-        x_mask = torch.unsqueeze(commons.sequence_mask(x_lengths, x.size(2)), 1).to(
-            x.dtype
-        )
-        x = self.pre(x) * x_mask
-        x = self.enc(x, x_mask, g=g)
-        stats = self.proj(x) * x_mask
-        m, logs = torch.split(stats, self.out_channels, dim=1)
-        z = (m + torch.randn_like(m) * torch.exp(logs)) * x_mask
-        return z, m, logs, x_mask
-
-    def remove_weight_norm(self):
-        self.enc.remove_weight_norm()
-
-
-class Generator(torch.nn.Module):
-    def __init__(
-        self,
-        initial_channel,
-        resblock,
-        resblock_kernel_sizes,
-        resblock_dilation_sizes,
-        upsample_rates,
-        upsample_initial_channel,
-        upsample_kernel_sizes,
-        gin_channels=0,
-    ):
-        super(Generator, self).__init__()
-        self.num_kernels = len(resblock_kernel_sizes)
-        self.num_upsamples = len(upsample_rates)
-        self.conv_pre = Conv1d(
-            initial_channel, upsample_initial_channel, 7, 1, padding=3
-        )
-        resblock = modules.ResBlock1 if resblock == "1" else modules.ResBlock2
-
-        self.ups = nn.ModuleList()
-        for i, (u, k) in enumerate(zip(upsample_rates, upsample_kernel_sizes)):
-            self.ups.append(
-                weight_norm(
-                    ConvTranspose1d(
-                        upsample_initial_channel // (2**i),
-                        upsample_initial_channel // (2 ** (i + 1)),
-                        k,
-                        u,
-                        padding=(k - u) // 2,
-                    )
-                )
-            )
-
-        self.resblocks = nn.ModuleList()
-        for i in range(len(self.ups)):
-            ch = upsample_initial_channel // (2 ** (i + 1))
-            for j, (k, d) in enumerate(
-                zip(resblock_kernel_sizes, resblock_dilation_sizes)
-            ):
-                self.resblocks.append(resblock(ch, k, d))
-
-        self.conv_post = Conv1d(ch, 1, 7, 1, padding=3, bias=False)
-        self.ups.apply(init_weights)
-
-        if gin_channels != 0:
-            self.cond = nn.Conv1d(gin_channels, upsample_initial_channel, 1)
-
-    def forward(self, x, g=None):
-        x = self.conv_pre(x)
-        if g is not None:
-            x = x + self.cond(g)
-
-        for i in range(self.num_upsamples):
-            x = F.leaky_relu(x, modules.LRELU_SLOPE)
-            x = self.ups[i](x)
-            xs = None
-            for j in range(self.num_kernels):
-                if xs is None:
-                    xs = self.resblocks[i * self.num_kernels + j](x)
-                else:
-                    xs += self.resblocks[i * self.num_kernels + j](x)
-            x = xs / self.num_kernels
-        x = F.leaky_relu(x)
-        x = self.conv_post(x)
-        x = torch.tanh(x)
-
-        return x
-
-    def remove_weight_norm(self):
-        for l in self.ups:
-            remove_weight_norm(l)
-        for l in self.resblocks:
-            l.remove_weight_norm()
-
-
-class SineGen(torch.nn.Module):
-    """Definition of sine generator
-    SineGen(samp_rate, harmonic_num = 0,
-            sine_amp = 0.1, noise_std = 0.003,
-            voiced_threshold = 0,
-            flag_for_pulse=False)
-    samp_rate: sampling rate in Hz
-    harmonic_num: number of harmonic overtones (default 0)
-    sine_amp: amplitude of sine-wavefrom (default 0.1)
-    noise_std: std of Gaussian noise (default 0.003)
-    voiced_thoreshold: F0 threshold for U/V classification (default 0)
-    flag_for_pulse: this SinGen is used inside PulseGen (default False)
-    Note: when flag_for_pulse is True, the first time step of a voiced
-        segment is always sin(np.pi) or cos(0)
-    """
-
-    def __init__(
-        self,
-        samp_rate,
-        harmonic_num=0,
-        sine_amp=0.1,
-        noise_std=0.003,
-        voiced_threshold=0,
-        flag_for_pulse=False,
-    ):
-        super(SineGen, self).__init__()
-        self.sine_amp = sine_amp
-        self.noise_std = noise_std
-        self.harmonic_num = harmonic_num
-        self.dim = self.harmonic_num + 1
-        self.sampling_rate = samp_rate
-        self.voiced_threshold = voiced_threshold
-
-    def _f02uv(self, f0):
-        # generate uv signal
-        uv = torch.ones_like(f0)
-        uv = uv * (f0 > self.voiced_threshold)
-        return uv
-
-    def forward(self, f0, upp):
-        """sine_tensor, uv = forward(f0)
-        input F0: tensor(batchsize=1, length, dim=1)
-                  f0 for unvoiced steps should be 0
-        output sine_tensor: tensor(batchsize=1, length, dim)
-        output uv: tensor(batchsize=1, length, 1)
-        """
-        with torch.no_grad():
-            f0 = f0[:, None].transpose(1, 2)
-            f0_buf = torch.zeros(f0.shape[0], f0.shape[1], self.dim, device=f0.device)
-            # fundamental component
-            f0_buf[:, :, 0] = f0[:, :, 0]
-            for idx in np.arange(self.harmonic_num):
-                f0_buf[:, :, idx + 1] = f0_buf[:, :, 0] * (
-                    idx + 2
-                )  # idx + 2: the (idx+1)-th overtone, (idx+2)-th harmonic
-            rad_values = (f0_buf / self.sampling_rate) % 1  ###%1意味着n_har的乘积无法后处理优化
-            rand_ini = torch.rand(
-                f0_buf.shape[0], f0_buf.shape[2], device=f0_buf.device
-            )
-            rand_ini[:, 0] = 0
-            rad_values[:, 0, :] = rad_values[:, 0, :] + rand_ini
-            tmp_over_one = torch.cumsum(rad_values, 1)  # % 1  #####%1意味着后面的cumsum无法再优化
-            tmp_over_one *= upp
-            tmp_over_one = F.interpolate(
-                tmp_over_one.transpose(2, 1),
-                scale_factor=upp,
-                mode="linear",
-                align_corners=True,
-            ).transpose(2, 1)
-            rad_values = F.interpolate(
-                rad_values.transpose(2, 1), scale_factor=upp, mode="nearest"
-            ).transpose(
-                2, 1
-            )  #######
-            tmp_over_one %= 1
-            tmp_over_one_idx = (tmp_over_one[:, 1:, :] - tmp_over_one[:, :-1, :]) < 0
-            cumsum_shift = torch.zeros_like(rad_values)
-            cumsum_shift[:, 1:, :] = tmp_over_one_idx * -1.0
-            sine_waves = torch.sin(
-                torch.cumsum(rad_values + cumsum_shift, dim=1) * 2 * np.pi
-            )
-            sine_waves = sine_waves * self.sine_amp
-            uv = self._f02uv(f0)
-            uv = F.interpolate(
-                uv.transpose(2, 1), scale_factor=upp, mode="nearest"
-            ).transpose(2, 1)
-            noise_amp = uv * self.noise_std + (1 - uv) * self.sine_amp / 3
-            noise = noise_amp * torch.randn_like(sine_waves)
-            sine_waves = sine_waves * uv + noise
-        return sine_waves, uv, noise
-
-
-class SourceModuleHnNSF(torch.nn.Module):
-    """SourceModule for hn-nsf
-    SourceModule(sampling_rate, harmonic_num=0, sine_amp=0.1,
-                 add_noise_std=0.003, voiced_threshod=0)
-    sampling_rate: sampling_rate in Hz
-    harmonic_num: number of harmonic above F0 (default: 0)
-    sine_amp: amplitude of sine source signal (default: 0.1)
-    add_noise_std: std of additive Gaussian noise (default: 0.003)
-        note that amplitude of noise in unvoiced is decided
-        by sine_amp
-    voiced_threshold: threhold to set U/V given F0 (default: 0)
-    Sine_source, noise_source = SourceModuleHnNSF(F0_sampled)
-    F0_sampled (batchsize, length, 1)
-    Sine_source (batchsize, length, 1)
-    noise_source (batchsize, length 1)
-    uv (batchsize, length, 1)
-    """
-
-    def __init__(
-        self,
-        sampling_rate,
-        harmonic_num=0,
-        sine_amp=0.1,
-        add_noise_std=0.003,
-        voiced_threshod=0,
-        is_half=True,
-    ):
-        super(SourceModuleHnNSF, self).__init__()
-
-        self.sine_amp = sine_amp
-        self.noise_std = add_noise_std
-        self.is_half = is_half
-        # to produce sine waveforms
-        self.l_sin_gen = SineGen(
-            sampling_rate, harmonic_num, sine_amp, add_noise_std, voiced_threshod
-        )
-
-        # to merge source harmonics into a single excitation
-        self.l_linear = torch.nn.Linear(harmonic_num + 1, 1)
-        self.l_tanh = torch.nn.Tanh()
-
-    def forward(self, x, upp=None):
-        sine_wavs, uv, _ = self.l_sin_gen(x, upp)
-        if self.is_half:
-            sine_wavs = sine_wavs.half()
-        sine_merge = self.l_tanh(self.l_linear(sine_wavs))
-        return sine_merge, None, None  # noise, uv
-
-
-class GeneratorNSF(torch.nn.Module):
-    def __init__(
-        self,
-        initial_channel,
-        resblock,
-        resblock_kernel_sizes,
-        resblock_dilation_sizes,
-        upsample_rates,
-        upsample_initial_channel,
-        upsample_kernel_sizes,
-        gin_channels,
-        sr,
-        is_half=False,
-    ):
-        super(GeneratorNSF, self).__init__()
-        self.num_kernels = len(resblock_kernel_sizes)
-        self.num_upsamples = len(upsample_rates)
-
-        self.f0_upsamp = torch.nn.Upsample(scale_factor=np.prod(upsample_rates))
-        self.m_source = SourceModuleHnNSF(
-            sampling_rate=sr, harmonic_num=0, is_half=is_half
-        )
-        self.noise_convs = nn.ModuleList()
-        self.conv_pre = Conv1d(
-            initial_channel, upsample_initial_channel, 7, 1, padding=3
-        )
-        resblock = modules.ResBlock1 if resblock == "1" else modules.ResBlock2
-
-        self.ups = nn.ModuleList()
-        for i, (u, k) in enumerate(zip(upsample_rates, upsample_kernel_sizes)):
-            c_cur = upsample_initial_channel // (2 ** (i + 1))
-            self.ups.append(
-                weight_norm(
-                    ConvTranspose1d(
-                        upsample_initial_channel // (2**i),
-                        upsample_initial_channel // (2 ** (i + 1)),
-                        k,
-                        u,
-                        padding=(k - u) // 2,
-                    )
-                )
-            )
-            if i + 1 < len(upsample_rates):
-                stride_f0 = np.prod(upsample_rates[i + 1 :])
-                self.noise_convs.append(
-                    Conv1d(
-                        1,
-                        c_cur,
-                        kernel_size=stride_f0 * 2,
-                        stride=stride_f0,
-                        padding=stride_f0 // 2,
-                    )
-                )
-            else:
-                self.noise_convs.append(Conv1d(1, c_cur, kernel_size=1))
-
-        self.resblocks = nn.ModuleList()
-        for i in range(len(self.ups)):
-            ch = upsample_initial_channel // (2 ** (i + 1))
-            for j, (k, d) in enumerate(
-                zip(resblock_kernel_sizes, resblock_dilation_sizes)
-            ):
-                self.resblocks.append(resblock(ch, k, d))
-
-        self.conv_post = Conv1d(ch, 1, 7, 1, padding=3, bias=False)
-        self.ups.apply(init_weights)
-
-        if gin_channels != 0:
-            self.cond = nn.Conv1d(gin_channels, upsample_initial_channel, 1)
-
-        self.upp = np.prod(upsample_rates)
-
-    def forward(self, x, f0, g=None):
-        har_source, noi_source, uv = self.m_source(f0, self.upp)
-        har_source = har_source.transpose(1, 2)
-        x = self.conv_pre(x)
-        if g is not None:
-            x = x + self.cond(g)
-
-        for i in range(self.num_upsamples):
-            x = F.leaky_relu(x, modules.LRELU_SLOPE)
-            x = self.ups[i](x)
-            x_source = self.noise_convs[i](har_source)
-            x = x + x_source
-            xs = None
-            for j in range(self.num_kernels):
-                if xs is None:
-                    xs = self.resblocks[i * self.num_kernels + j](x)
-                else:
-                    xs += self.resblocks[i * self.num_kernels + j](x)
-            x = xs / self.num_kernels
-        x = F.leaky_relu(x)
-        x = self.conv_post(x)
-        x = torch.tanh(x)
-        return x
-
-    def remove_weight_norm(self):
-        for l in self.ups:
-            remove_weight_norm(l)
-        for l in self.resblocks:
-            l.remove_weight_norm()
-
-
-sr2sr = {
-    "32k": 32000,
-    "40k": 40000,
-    "48k": 48000,
-}
-
-
-class SynthesizerTrnMs256NSFsid(nn.Module):
-    def __init__(
-        self,
-        spec_channels,
-        segment_size,
-        inter_channels,
-        hidden_channels,
-        filter_channels,
-        n_heads,
-        n_layers,
-        kernel_size,
-        p_dropout,
-        resblock,
-        resblock_kernel_sizes,
-        resblock_dilation_sizes,
-        upsample_rates,
-        upsample_initial_channel,
-        upsample_kernel_sizes,
-        spk_embed_dim,
-        gin_channels,
-        sr,
-        **kwargs
-    ):
-        super().__init__()
-        if type(sr) == type("strr"):
-            sr = sr2sr[sr]
-        self.spec_channels = spec_channels
-        self.inter_channels = inter_channels
-        self.hidden_channels = hidden_channels
-        self.filter_channels = filter_channels
-        self.n_heads = n_heads
-        self.n_layers = n_layers
-        self.kernel_size = kernel_size
-        self.p_dropout = p_dropout
-        self.resblock = resblock
-        self.resblock_kernel_sizes = resblock_kernel_sizes
-        self.resblock_dilation_sizes = resblock_dilation_sizes
-        self.upsample_rates = upsample_rates
-        self.upsample_initial_channel = upsample_initial_channel
-        self.upsample_kernel_sizes = upsample_kernel_sizes
-        self.segment_size = segment_size
-        self.gin_channels = gin_channels
-        # self.hop_length = hop_length#
-        self.spk_embed_dim = spk_embed_dim
-        self.enc_p = TextEncoder256(
-            inter_channels,
-            hidden_channels,
-            filter_channels,
-            n_heads,
-            n_layers,
-            kernel_size,
-            p_dropout,
-        )
-        self.dec = GeneratorNSF(
-            inter_channels,
-            resblock,
-            resblock_kernel_sizes,
-            resblock_dilation_sizes,
-            upsample_rates,
-            upsample_initial_channel,
-            upsample_kernel_sizes,
-            gin_channels=gin_channels,
-            sr=sr,
-            is_half=kwargs["is_half"],
-        )
-        self.enc_q = PosteriorEncoder(
-            spec_channels,
-            inter_channels,
-            hidden_channels,
-            5,
-            1,
-            16,
-            gin_channels=gin_channels,
-        )
-        self.flow = ResidualCouplingBlock(
-            inter_channels, hidden_channels, 5, 1, 3, gin_channels=gin_channels
-        )
-        self.emb_g = nn.Embedding(self.spk_embed_dim, gin_channels)
-        print("gin_channels:", gin_channels, "self.spk_embed_dim:", self.spk_embed_dim)
-
-    def remove_weight_norm(self):
-        self.dec.remove_weight_norm()
-        self.flow.remove_weight_norm()
-        self.enc_q.remove_weight_norm()
-
-    def forward(
-        self, phone, phone_lengths, pitch, pitchf, y, y_lengths, ds
-    ):  # 这里ds是id，[bs,1]
-        # print(1,pitch.shape)#[bs,t]
-        g = self.emb_g(ds).unsqueeze(-1)  # [b, 256, 1]##1是t，广播的
-        m_p, logs_p, x_mask = self.enc_p(phone, pitch, phone_lengths)
-        z, m_q, logs_q, y_mask = self.enc_q(y, y_lengths, g=g)
-        z_p = self.flow(z, y_mask, g=g)
-        z_slice, ids_slice = commons.rand_slice_segments(
-            z, y_lengths, self.segment_size
-        )
-        # print(-1,pitchf.shape,ids_slice,self.segment_size,self.hop_length,self.segment_size//self.hop_length)
-        pitchf = commons.slice_segments2(pitchf, ids_slice, self.segment_size)
-        # print(-2,pitchf.shape,z_slice.shape)
-        o = self.dec(z_slice, pitchf, g=g)
-        return o, ids_slice, x_mask, y_mask, (z, z_p, m_p, logs_p, m_q, logs_q)
-
-    def infer(self, phone, phone_lengths, pitch, nsff0, sid, max_len=None):
-        g = self.emb_g(sid).unsqueeze(-1)
-        m_p, logs_p, x_mask = self.enc_p(phone, pitch, phone_lengths)
-        z_p = (m_p + torch.exp(logs_p) * torch.randn_like(m_p) * 0.66666) * x_mask
-        z = self.flow(z_p, x_mask, g=g, reverse=True)
-        o = self.dec((z * x_mask)[:, :, :max_len], nsff0, g=g)
-        return o, x_mask, (z, z_p, m_p, logs_p)
-
-
-class SynthesizerTrnMs256NSFsid_nono(nn.Module):
-    def __init__(
-        self,
-        spec_channels,
-        segment_size,
-        inter_channels,
-        hidden_channels,
-        filter_channels,
-        n_heads,
-        n_layers,
-        kernel_size,
-        p_dropout,
-        resblock,
-        resblock_kernel_sizes,
-        resblock_dilation_sizes,
-        upsample_rates,
-        upsample_initial_channel,
-        upsample_kernel_sizes,
-        spk_embed_dim,
-        gin_channels,
-        sr=None,
-        **kwargs
-    ):
-        super().__init__()
-        self.spec_channels = spec_channels
-        self.inter_channels = inter_channels
-        self.hidden_channels = hidden_channels
-        self.filter_channels = filter_channels
-        self.n_heads = n_heads
-        self.n_layers = n_layers
-        self.kernel_size = kernel_size
-        self.p_dropout = p_dropout
-        self.resblock = resblock
-        self.resblock_kernel_sizes = resblock_kernel_sizes
-        self.resblock_dilation_sizes = resblock_dilation_sizes
-        self.upsample_rates = upsample_rates
-        self.upsample_initial_channel = upsample_initial_channel
-        self.upsample_kernel_sizes = upsample_kernel_sizes
-        self.segment_size = segment_size
-        self.gin_channels = gin_channels
-        # self.hop_length = hop_length#
-        self.spk_embed_dim = spk_embed_dim
-        self.enc_p = TextEncoder256(
-            inter_channels,
-            hidden_channels,
-            filter_channels,
-            n_heads,
-            n_layers,
-            kernel_size,
-            p_dropout,
-            f0=False,
-        )
-        self.dec = Generator(
-            inter_channels,
-            resblock,
-            resblock_kernel_sizes,
-            resblock_dilation_sizes,
-            upsample_rates,
-            upsample_initial_channel,
-            upsample_kernel_sizes,
-            gin_channels=gin_channels,
-        )
-        self.enc_q = PosteriorEncoder(
-            spec_channels,
-            inter_channels,
-            hidden_channels,
-            5,
-            1,
-            16,
-            gin_channels=gin_channels,
-        )
-        self.flow = ResidualCouplingBlock(
-            inter_channels, hidden_channels, 5, 1, 3, gin_channels=gin_channels
-        )
-        self.emb_g = nn.Embedding(self.spk_embed_dim, gin_channels)
-        print("gin_channels:", gin_channels, "self.spk_embed_dim:", self.spk_embed_dim)
-
-    def remove_weight_norm(self):
-        self.dec.remove_weight_norm()
-        self.flow.remove_weight_norm()
-        self.enc_q.remove_weight_norm()
-
-    def forward(self, phone, phone_lengths, y, y_lengths, ds):  # 这里ds是id，[bs,1]
-        g = self.emb_g(ds).unsqueeze(-1)  # [b, 256, 1]##1是t，广播的
-        m_p, logs_p, x_mask = self.enc_p(phone, None, phone_lengths)
-        z, m_q, logs_q, y_mask = self.enc_q(y, y_lengths, g=g)
-        z_p = self.flow(z, y_mask, g=g)
-        z_slice, ids_slice = commons.rand_slice_segments(
-            z, y_lengths, self.segment_size
-        )
-        o = self.dec(z_slice, g=g)
-        return o, ids_slice, x_mask, y_mask, (z, z_p, m_p, logs_p, m_q, logs_q)
-
-    def infer(self, phone, phone_lengths, sid, max_len=None):
-        g = self.emb_g(sid).unsqueeze(-1)
-        m_p, logs_p, x_mask = self.enc_p(phone, None, phone_lengths)
-        z_p = (m_p + torch.exp(logs_p) * torch.randn_like(m_p) * 0.66666) * x_mask
-        z = self.flow(z_p, x_mask, g=g, reverse=True)
-        o = self.dec((z * x_mask)[:, :, :max_len], g=g)
-        return o, x_mask, (z, z_p, m_p, logs_p)
-
-
-class SynthesizerTrnMs256NSFsid_sim(nn.Module):
-    """
-    Synthesizer for Training
-    """
-
-    def __init__(
-        self,
-        spec_channels,
-        segment_size,
-        inter_channels,
-        hidden_channels,
-        filter_channels,
-        n_heads,
-        n_layers,
-        kernel_size,
-        p_dropout,
-        resblock,
-        resblock_kernel_sizes,
-        resblock_dilation_sizes,
-        upsample_rates,
-        upsample_initial_channel,
-        upsample_kernel_sizes,
-        spk_embed_dim,
-        # hop_length,
-        gin_channels=0,
-        use_sdp=True,
-        **kwargs
-    ):
-        super().__init__()
-        self.spec_channels = spec_channels
-        self.inter_channels = inter_channels
-        self.hidden_channels = hidden_channels
-        self.filter_channels = filter_channels
-        self.n_heads = n_heads
-        self.n_layers = n_layers
-        self.kernel_size = kernel_size
-        self.p_dropout = p_dropout
-        self.resblock = resblock
-        self.resblock_kernel_sizes = resblock_kernel_sizes
-        self.resblock_dilation_sizes = resblock_dilation_sizes
-        self.upsample_rates = upsample_rates
-        self.upsample_initial_channel = upsample_initial_channel
-        self.upsample_kernel_sizes = upsample_kernel_sizes
-        self.segment_size = segment_size
-        self.gin_channels = gin_channels
-        # self.hop_length = hop_length#
-        self.spk_embed_dim = spk_embed_dim
-        self.enc_p = TextEncoder256Sim(
-            inter_channels,
-            hidden_channels,
-            filter_channels,
-            n_heads,
-            n_layers,
-            kernel_size,
-            p_dropout,
-        )
-        self.dec = GeneratorNSF(
-            inter_channels,
-            resblock,
-            resblock_kernel_sizes,
-            resblock_dilation_sizes,
-            upsample_rates,
-            upsample_initial_channel,
-            upsample_kernel_sizes,
-            gin_channels=gin_channels,
-            is_half=kwargs["is_half"],
-        )
-
-        self.flow = ResidualCouplingBlock(
-            inter_channels, hidden_channels, 5, 1, 3, gin_channels=gin_channels
-        )
-        self.emb_g = nn.Embedding(self.spk_embed_dim, gin_channels)
-        print("gin_channels:", gin_channels, "self.spk_embed_dim:", self.spk_embed_dim)
-
-    def remove_weight_norm(self):
-        self.dec.remove_weight_norm()
-        self.flow.remove_weight_norm()
-        self.enc_q.remove_weight_norm()
-
-    def forward(
-        self, phone, phone_lengths, pitch, pitchf, y_lengths, ds
-    ):  # y是spec不需要了现在
-        g = self.emb_g(ds).unsqueeze(-1)  # [b, 256, 1]##1是t，广播的
-        x, x_mask = self.enc_p(phone, pitch, phone_lengths)
-        x = self.flow(x, x_mask, g=g, reverse=True)
-        z_slice, ids_slice = commons.rand_slice_segments(
-            x, y_lengths, self.segment_size
-        )
-
-        pitchf = commons.slice_segments2(pitchf, ids_slice, self.segment_size)
-        o = self.dec(z_slice, pitchf, g=g)
-        return o, ids_slice
-
-    def infer(
-        self, phone, phone_lengths, pitch, pitchf, ds, max_len=None
-    ):  # y是spec不需要了现在
-        g = self.emb_g(ds).unsqueeze(-1)  # [b, 256, 1]##1是t，广播的
-        x, x_mask = self.enc_p(phone, pitch, phone_lengths)
-        x = self.flow(x, x_mask, g=g, reverse=True)
-        o = self.dec((x * x_mask)[:, :, :max_len], pitchf, g=g)
-        return o, o
-
-
-class MultiPeriodDiscriminator(torch.nn.Module):
-    def __init__(self, use_spectral_norm=False):
-        super(MultiPeriodDiscriminator, self).__init__()
-        periods = [2, 3, 5, 7, 11, 17]
-        # periods = [3, 5, 7, 11, 17, 23, 37]
-
-        discs = [DiscriminatorS(use_spectral_norm=use_spectral_norm)]
-        discs = discs + [
-            DiscriminatorP(i, use_spectral_norm=use_spectral_norm) for i in periods
-        ]
-        self.discriminators = nn.ModuleList(discs)
-
-    def forward(self, y, y_hat):
-        y_d_rs = []  #
-        y_d_gs = []
-        fmap_rs = []
-        fmap_gs = []
-        for i, d in enumerate(self.discriminators):
-            y_d_r, fmap_r = d(y)
-            y_d_g, fmap_g = d(y_hat)
-            # for j in range(len(fmap_r)):
-            #     print(i,j,y.shape,y_hat.shape,fmap_r[j].shape,fmap_g[j].shape)
-            y_d_rs.append(y_d_r)
-            y_d_gs.append(y_d_g)
-            fmap_rs.append(fmap_r)
-            fmap_gs.append(fmap_g)
-
-        return y_d_rs, y_d_gs, fmap_rs, fmap_gs
-
-
-class DiscriminatorS(torch.nn.Module):
-    def __init__(self, use_spectral_norm=False):
-        super(DiscriminatorS, self).__init__()
-        norm_f = weight_norm if use_spectral_norm == False else spectral_norm
-        self.convs = nn.ModuleList(
-            [
-                norm_f(Conv1d(1, 16, 15, 1, padding=7)),
-                norm_f(Conv1d(16, 64, 41, 4, groups=4, padding=20)),
-                norm_f(Conv1d(64, 256, 41, 4, groups=16, padding=20)),
-                norm_f(Conv1d(256, 1024, 41, 4, groups=64, padding=20)),
-                norm_f(Conv1d(1024, 1024, 41, 4, groups=256, padding=20)),
-                norm_f(Conv1d(1024, 1024, 5, 1, padding=2)),
-            ]
-        )
-        self.conv_post = norm_f(Conv1d(1024, 1, 3, 1, padding=1))
-
-    def forward(self, x):
-        fmap = []
-
-        for l in self.convs:
-            x = l(x)
-            x = F.leaky_relu(x, modules.LRELU_SLOPE)
-            fmap.append(x)
-        x = self.conv_post(x)
-        fmap.append(x)
-        x = torch.flatten(x, 1, -1)
-
-        return x, fmap
-
-
-class DiscriminatorP(torch.nn.Module):
-    def __init__(self, period, kernel_size=5, stride=3, use_spectral_norm=False):
-        super(DiscriminatorP, self).__init__()
-        self.period = period
-        self.use_spectral_norm = use_spectral_norm
-        norm_f = weight_norm if use_spectral_norm == False else spectral_norm
-        self.convs = nn.ModuleList(
-            [
-                norm_f(
-                    Conv2d(
-                        1,
-                        32,
-                        (kernel_size, 1),
-                        (stride, 1),
-                        padding=(get_padding(kernel_size, 1), 0),
-                    )
-                ),
-                norm_f(
-                    Conv2d(
-                        32,
-                        128,
-                        (kernel_size, 1),
-                        (stride, 1),
-                        padding=(get_padding(kernel_size, 1), 0),
-                    )
-                ),
-                norm_f(
-                    Conv2d(
-                        128,
-                        512,
-                        (kernel_size, 1),
-                        (stride, 1),
-                        padding=(get_padding(kernel_size, 1), 0),
-                    )
-                ),
-                norm_f(
-                    Conv2d(
-                        512,
-                        1024,
-                        (kernel_size, 1),
-                        (stride, 1),
-                        padding=(get_padding(kernel_size, 1), 0),
-                    )
-                ),
-                norm_f(
-                    Conv2d(
-                        1024,
-                        1024,
-                        (kernel_size, 1),
-                        1,
-                        padding=(get_padding(kernel_size, 1), 0),
-                    )
-                ),
-            ]
-        )
-        self.conv_post = norm_f(Conv2d(1024, 1, (3, 1), 1, padding=(1, 0)))
-
-    def forward(self, x):
-        fmap = []
-
-        # 1d to 2d
-        b, c, t = x.shape
-        if t % self.period != 0:  # pad first
-            n_pad = self.period - (t % self.period)
-            x = F.pad(x, (0, n_pad), "reflect")
-            t = t + n_pad
-        x = x.view(b, c, t // self.period, self.period)
-
-        for l in self.convs:
-            x = l(x)
-            x = F.leaky_relu(x, modules.LRELU_SLOPE)
-            fmap.append(x)
-        x = self.conv_post(x)
-        fmap.append(x)
-        x = torch.flatten(x, 1, -1)
-
-        return x, fmap
diff --git a/spaces/thecho7/deepfake/training/zoo/unet.py b/spaces/thecho7/deepfake/training/zoo/unet.py
deleted file mode 100644
index e190ea7f341a176d44aa5da472a2753502163b77..0000000000000000000000000000000000000000
--- a/spaces/thecho7/deepfake/training/zoo/unet.py
+++ /dev/null
@@ -1,151 +0,0 @@
-from functools import partial
-
-import torch
-from timm.models.efficientnet import tf_efficientnet_b3_ns, tf_efficientnet_b5_ns
-from torch import nn
-from torch.nn import Dropout2d, Conv2d
-from torch.nn.modules.dropout import Dropout
-from torch.nn.modules.linear import Linear
-from torch.nn.modules.pooling import AdaptiveAvgPool2d
-from torch.nn.modules.upsampling import UpsamplingBilinear2d
-
-encoder_params = {
-    "tf_efficientnet_b3_ns": {
-        "features": 1536,
-        "filters": [40, 32, 48, 136, 1536],
-        "decoder_filters": [64, 128, 256, 256],
-        "init_op": partial(tf_efficientnet_b3_ns, pretrained=True, drop_path_rate=0.2)
-    },
-    "tf_efficientnet_b5_ns": {
-        "features": 2048,
-        "filters": [48, 40, 64, 176, 2048],
-        "decoder_filters": [64, 128, 256, 256],
-        "init_op": partial(tf_efficientnet_b5_ns, pretrained=True, drop_path_rate=0.2)
-    },
-}
-
-
-class DecoderBlock(nn.Module):
-    def __init__(self, in_channels, out_channels):
-        super().__init__()
-        self.layer = nn.Sequential(
-            nn.Upsample(scale_factor=2),
-            nn.Conv2d(in_channels, out_channels, 3, padding=1),
-            nn.ReLU(inplace=True)
-        )
-
-    def forward(self, x):
-        return self.layer(x)
-
-
-class ConcatBottleneck(nn.Module):
-    def __init__(self, in_channels, out_channels):
-        super().__init__()
-        self.seq = nn.Sequential(
-            nn.Conv2d(in_channels, out_channels, 3, padding=1),
-            nn.ReLU(inplace=True)
-        )
-
-    def forward(self, dec, enc):
-        x = torch.cat([dec, enc], dim=1)
-        return self.seq(x)
-
-
-class Decoder(nn.Module):
-    def __init__(self, decoder_filters, filters, upsample_filters=None,
-                 decoder_block=DecoderBlock, bottleneck=ConcatBottleneck, dropout=0):
-        super().__init__()
-        self.decoder_filters = decoder_filters
-        self.filters = filters
-        self.decoder_block = decoder_block
-        self.decoder_stages = nn.ModuleList([self._get_decoder(idx) for idx in range(0, len(decoder_filters))])
-        self.bottlenecks = nn.ModuleList([bottleneck(self.filters[-i - 2] + f, f)
-                                          for i, f in enumerate(reversed(decoder_filters))])
-        self.dropout = Dropout2d(dropout) if dropout > 0 else None
-        self.last_block = None
-        if upsample_filters:
-            self.last_block = decoder_block(decoder_filters[0], out_channels=upsample_filters)
-        else:
-            self.last_block = UpsamplingBilinear2d(scale_factor=2)
-
-    def forward(self, encoder_results: list):
-        x = encoder_results[0]
-        bottlenecks = self.bottlenecks
-        for idx, bottleneck in enumerate(bottlenecks):
-            rev_idx = - (idx + 1)
-            x = self.decoder_stages[rev_idx](x)
-            x = bottleneck(x, encoder_results[-rev_idx])
-        if self.last_block:
-            x = self.last_block(x)
-        if self.dropout:
-            x = self.dropout(x)
-        return x
-
-    def _get_decoder(self, layer):
-        idx = layer + 1
-        if idx == len(self.decoder_filters):
-            in_channels = self.filters[idx]
-        else:
-            in_channels = self.decoder_filters[idx]
-        return self.decoder_block(in_channels, self.decoder_filters[max(layer, 0)])
-
-
-def _initialize_weights(module):
-    for m in module.modules():
-        if isinstance(m, nn.Conv2d) or isinstance(m, nn.ConvTranspose2d) or isinstance(m, nn.Linear):
-            m.weight.data = nn.init.kaiming_normal_(m.weight.data)
-            if m.bias is not None:
-                m.bias.data.zero_()
-        elif isinstance(m, nn.BatchNorm2d):
-            m.weight.data.fill_(1)
-            m.bias.data.zero_()
-
-
-class EfficientUnetClassifier(nn.Module):
-    def __init__(self, encoder, dropout_rate=0.5) -> None:
-        super().__init__()
-        self.decoder = Decoder(decoder_filters=encoder_params[encoder]["decoder_filters"],
-                               filters=encoder_params[encoder]["filters"])
-        self.avg_pool = AdaptiveAvgPool2d((1, 1))
-        self.dropout = Dropout(dropout_rate)
-        self.fc = Linear(encoder_params[encoder]["features"], 1)
-        self.final = Conv2d(encoder_params[encoder]["decoder_filters"][0], out_channels=1, kernel_size=1, bias=False)
-        _initialize_weights(self)
-        self.encoder = encoder_params[encoder]["init_op"]()
-
-    def get_encoder_features(self, x):
-        encoder_results = []
-        x = self.encoder.conv_stem(x)
-        x = self.encoder.bn1(x)
-        x = self.encoder.act1(x)
-        encoder_results.append(x)
-        x = self.encoder.blocks[:2](x)
-        encoder_results.append(x)
-        x = self.encoder.blocks[2:3](x)
-        encoder_results.append(x)
-        x = self.encoder.blocks[3:5](x)
-        encoder_results.append(x)
-        x = self.encoder.blocks[5:](x)
-        x = self.encoder.conv_head(x)
-        x = self.encoder.bn2(x)
-        x = self.encoder.act2(x)
-        encoder_results.append(x)
-        encoder_results = list(reversed(encoder_results))
-        return encoder_results
-
-    def forward(self, x):
-        encoder_results = self.get_encoder_features(x)
-        seg = self.final(self.decoder(encoder_results))
-        x = encoder_results[0]
-        x = self.avg_pool(x).flatten(1)
-        x = self.dropout(x)
-        x = self.fc(x)
-        return x, seg
-
-
-if __name__ == '__main__':
-    model = EfficientUnetClassifier("tf_efficientnet_b5_ns")
-    model.eval()
-    with torch.no_grad():
-        input = torch.rand(4, 3, 224, 224)
-        print(model(input))
diff --git a/spaces/thelou1s/yamnet_test/python/__init__.py b/spaces/thelou1s/yamnet_test/python/__init__.py
deleted file mode 100644
index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000
diff --git a/spaces/tialenAdioni/chat-gpt-api/logs/Atelier Sophie The Alchemist Of The Mysterious Book Update 1 Fitgirl Repack - Meet Plachta the Sentient Book.md b/spaces/tialenAdioni/chat-gpt-api/logs/Atelier Sophie The Alchemist Of The Mysterious Book Update 1 Fitgirl Repack - Meet Plachta the Sentient Book.md
deleted file mode 100644
index 95e579f36649a97b91b31a3e08f0de2231008d8d..0000000000000000000000000000000000000000
--- a/spaces/tialenAdioni/chat-gpt-api/logs/Atelier Sophie The Alchemist Of The Mysterious Book Update 1 Fitgirl Repack - Meet Plachta the Sentient Book.md	
+++ /dev/null
@@ -1,78 +0,0 @@
-
-<h1>Atelier Sophie: The Alchemist of the Mysterious Book Update 1 Fitgirl Repack</h1>
-<p>If you are a fan of JRPGs, anime, or alchemy, you might want to check out Atelier Sophie: The Alchemist of the Mysterious Book Update 1 Fitgirl Repack. This is a definitive edition of the first game in the Atelier Mysterious series, with brand new content and various DLCs included. In this article, we will tell you everything you need to know about this game and this update, from what it is, what it offers, and how to install it. Let's get started!</p>
-<h2>Atelier Sophie: The Alchemist Of The Mysterious Book Update 1 Fitgirl Repack</h2><br /><p><b><b>Download</b> &#10040; <a href="https://urlcod.com/2uK69p">https://urlcod.com/2uK69p</a></b></p><br /><br />
- <h2>What is Atelier Sophie: The Alchemist of the Mysterious Book?</h2>
-<p>Atelier Sophie: The Alchemist of the Mysterious Book is a 2015 Japanese role-playing game developed by Gust for PlayStation 3, PlayStation 4, PlayStation Vita, Microsoft Windows, and Nintendo Switch. It is the 17th main game in the Atelier series and the first game of the Mysterious storyline. </p>
-<p>The game follows Sophie Neuenmuller, a young alchemist who lives in a small town called Kirchen Bell. She has a mysterious power that allows her to combine items together to form entirely different items. However, without a mentor or reference guide to teach her, her alchemy attempts repeatedly fail time and time again. </p>
-<p>One day, she finds a talking book in her atelier. The book introduces itself as Plachta, a former alchemist who lost her memories and became a book. Plachta agrees to help Sophie improve her alchemy skills by teaching her recipes and techniques. Together, they embark on an adventure to recover Plachta's memories and gain alchemic knowledge. </p>
-<p>The game features a completely reformed worldview from earlier titles within the series, in addition to a new alchemy-centric system. Sophie is able to obtain ideas for recipes from activities such as harvesting, exploring, battling, or from events. These ideas are used as a basis of improving her knowledge of alchemy. When she performs alchemy, she arranges various shapes representing the ingredients on a puzzle board that represents the cauldron. This process involves visual trial-and-error, and if the shapes are arranged perfectly, she receives a bonus. The materials selected affect the quality of the item synthesized.  </p>
-<p>The game also features a day-night cycle that affects various aspects such as monster appearance rates, item availability, weather effects, etc. The game has no time limit or deadline for completing quests or objectives, allowing players to play at their own pace.  </p>
- <h3>The Mysterious Book</h3>
-<p>Plachta is not just an ordinary book. She is a sentient being who used to be a human alchemist before she was turned into a book by an unknown force. She has lost most of her memories and can only recall fragments of her past through alchemy recipes. She can also communicate with Sophie telepathically and give her advice during battles or exploration. </p>
-<p>Plachta is also able to transform into a human-like form once Sophie restores enough of her memories. In this form, she can join Sophie in battles as a playable character. She can use various weapons such as swords or guns depending on her equipment. She can also use powerful magic attacks based on her alchemic knowledge. </p>
- <h3>The Alchemy System</h3>
-<p>Alchemy is the core mechanic of the game. It allows Sophie to create various items such as potions, bombs, weapons, armor, accessories, etc. by combining different ingredients together in a cauldron. Alchemy can be performed at any time in Sophie's atelier or at certain locations outside. </p>
-<p>Atelier Sophie DX Steam download<br />
-Atelier Sophie 2 release date and features<br />
-How to play Atelier Sophie on Nintendo Switch<br />
-Atelier Sophie character guide and walkthrough<br />
-Best alchemy recipes in Atelier Sophie<br />
-Atelier Sophie DLC and bonus content<br />
-Atelier Sophie review and rating by IGN<br />
-How to fix Atelier Sophie errors and crashes<br />
-Atelier Sophie vs other Atelier games<br />
-Atelier Sophie soundtrack and art book<br />
-How to get the best ending in Atelier Sophie<br />
-Atelier Sophie tips and tricks for beginners<br />
-Atelier Sophie system requirements and performance<br />
-Atelier Sophie cheats and secrets<br />
-Atelier Sophie modding and customization<br />
-How to unlock all costumes in Atelier Sophie<br />
-Atelier Sophie romance options and events<br />
-Atelier Sophie achievements and trophies<br />
-How to backup and restore Atelier Sophie save files<br />
-Atelier Sophie lore and history<br />
-How to change language and subtitles in Atelier Sophie<br />
-Atelier Sophie combat gameplay and strategy<br />
-How to craft the best weapons and items in Atelier Sophie<br />
-Atelier Sophie new episodes and content in DX version<br />
-How to get Plachta's memories in Atelier Sophie<br />
-How long is Atelier Sophie and how many endings are there?<br />
-How to get the best deal on Atelier Sophie DX bundle<br />
-How to play Atelier Sophie co-op or multiplayer<br />
-How to stream or record Atelier Sophie gameplay<br />
-How to use photo mode in Atelier Sophie DX<br />
-How to update or patch Atelier Sophie on PC or console<br />
-How to transfer Atelier Sophie save data across devices<br />
-How to get free or discounted DLC for Atelier Sophie DX<br />
-How to access the bonus dungeon in Atelier Sophie DX<br />
-How to get the rarest materials in Atelier Sophie DX<br />
-How to level up fast and easy in Atelier Sophie DX<br />
-How to master all skills and abilities in Atelier Sophie DX<br />
-How to find all hidden items and secrets in Atelier Sophie DX<br />
-How to enjoy the story and characters of Atelier Sophie DX<br />
-How to customize the difficulty and settings of Atelier Sophie DX</p>
-<p>To perform alchemy, Sophie needs three things: an idea for a recipe, ingredients for that recipe, and a cauldron to mix them in. Ideas for recipes can be obtained from various sources such as books, events, conversations, etc. Ingredients can be gathered from fields or dungeons by harvesting plants or defeating monsters. Cauldrons can be bought or crafted by Sophie using alchemy as well.</p>
-<p>Once Sophie has everything ready, she can start alchemy by selecting a cauldron and applying ingredients to it. Each ingredient has a shape that represents its size and quality on a puzzle board that represents the cauldron. Sophie has to arrange these shapes on the board in such a way that they fit together without overlapping or leaving gaps.</p>
-<p>The arrangement of shapes affects various aspects of the item being created such as its quality level (from E to S), its traits (special effects that can be transferred or inherited), its elements (fire ? , water ? , earth ? , wind ?️ , etc.), its cost (how much MP it consumes when used), etc.</p>
-<p>Sophie can also use various tools such as hammers or scissors to modify or cut shapes on the board to make them fit better or create new shapes.</p>
-<p>Once Sophie is satisfied with her arrangement, she can review the bonuses she acquired from it such as extra traits or elements.</p>
-<p>Finally, she can select which bonuses she wants to keep for her item.</p>
-<p>The result is an item that reflects Sophie's creativity and skill as an alchemist.</p>
- <h3>The Dollmake Feature</h3>
-<p>The Dollmake feature allows Sophie to freely customize Plachta's appearance and abilities using costume items crafted by Sophie via alchemy.</p>
-<p>Sophie can equip up to four categories of items on Plachta: headgear (such as hats ? , ribbons ? , glasses ? , etc.), bodywear (such as dresses ? , coats ? , shirts ? , etc.), armwear (such as gloves ? , bracelets ? , rings ? , etc.), and legwear (such as shoes ? , socks ? , boots ? , etc.).</p>
-<p>Each item has its own design and color that changes Plachta's appearance accordingly.</p>
-<p>Each item also has its own stats and traits that affect Plachta's performance in battles.</p>
-<p>Sophie can mix and match different items to create various combinations that suit her preferences.</p>
- <h2>What is Update 1 Fitgirl Repack?</h2>
-<p>Update 1 Fitgirl Repack is an enhanced version of Atelier Sophie: The Alchemist of the Mysterious Book that includes brand new content and various DLCs.</p>
-<p>This update offers:</p>
-<ul>
-<li>New episodes of Sophie's growth and a new costume that will help her follow in her grandmother's steps</li>
-<li>Three new cauldrons to assist in your adventures</li>
-<li>All previously released DLCs such as costumes ? , background music ? , items ? , etc.</li>
-<li>A reduced file size (from 5 GB to 2 GB) thanks to Fitgirl's repacking technique</p> 0a6ba089eb<br />
-<br />
-<br />
\ No newline at end of file
diff --git a/spaces/tialenAdioni/chat-gpt-api/logs/Kafka On The Shore Audiobook Tor Discover the Secrets and Mysteries of Haruki Murakamis World.md b/spaces/tialenAdioni/chat-gpt-api/logs/Kafka On The Shore Audiobook Tor Discover the Secrets and Mysteries of Haruki Murakamis World.md
deleted file mode 100644
index 577dfe3b0d18d74d0ab04bfadbbfacc20723aeca..0000000000000000000000000000000000000000
--- a/spaces/tialenAdioni/chat-gpt-api/logs/Kafka On The Shore Audiobook Tor Discover the Secrets and Mysteries of Haruki Murakamis World.md	
+++ /dev/null
@@ -1,129 +0,0 @@
-<br />
-<h1>Kafka on the Shore Audiobook Tor: A Magical Journey into Murakami's World</h1>
-<p>Have you ever wondered what it would be like to enter the mind of one of the most acclaimed and imaginative writers of our time? If so, you might want to listen to <strong>Kafka on the Shore</strong> audiobook tor, a captivating adaptation of Haruki Murakami's bestselling novel.</p>
-<p>In this article, we will tell you everything you need to know about <strong>Kafka on the Shore</strong> audiobook tor, including what it is, why you should listen to it, and how you can do it. By the end of this article, you will be ready to embark on a magical journey into Murakami's world.</p>
-<h2>Kafka On The Shore Audiobook Tor</h2><br /><p><b><b>Download File</b> >> <a href="https://urlcod.com/2uK9tL">https://urlcod.com/2uK9tL</a></b></p><br /><br />
-<h2>What is Kafka on the Shore?</h2>
-<p><strong>Kafka on the Shore</strong> is a novel by Haruki Murakami, a Japanese author who has won numerous awards and honors for his works, such as <em>The Wind-Up Bird Chronicle</em>, <em>Norwegian Wood</em>, and <em>1Q84</em>. Murakami is known for his distinctive style of blending realism with fantasy, humor with melancholy, and philosophy with pop culture.</p>
-<p><strong>Kafka on the Shore</strong> is one of his most popular and acclaimed novels, published in 2002 in Japan and translated into English in 2005. It tells the story of two seemingly unrelated characters who embark on parallel odysseys across Japan.</p>
-<p>The first character is Kafka Tamura, a 15-year-old boy who runs away from home to escape a dark prophecy made by his father. He ends up in a mysterious library in Takamatsu, where he meets an enigmatic woman named Miss Saeki, who may or may not be his long-lost mother.</p>
-<p>Kafka On The Shore Audio Book Torrent Download<br />
-How To Listen To Kafka On The Shore Audiobook Online<br />
-Kafka On The Shore By Haruki Murakami Audiobook Free<br />
-Best Sites To Find Kafka On The Shore Audiobook Tor<br />
-Kafka On The Shore Mp3 Audiobook Torrent Link<br />
-Kafka On The Shore Unabridged Audiobook Torrent Magnet<br />
-Kafka On The Shore Audiobook Review And Summary<br />
-Kafka On The Shore Audiobook Narrator And Cast<br />
-Kafka On The Shore Audiobook Length And File Size<br />
-Kafka On The Shore Audiobook Streaming And Downloading Options<br />
-Kafka On The Shore Audiobook Tor For Android And IOS Devices<br />
-Kafka On The Shore Audiobook Tor With Subtitles And Transcripts<br />
-Kafka On The Shore Audiobook Tor Vs Physical Book Comparison<br />
-Kafka On The Shore Audiobook Tor In Different Languages<br />
-Kafka On The Shore Audiobook Tor Quality And Format<br />
-Kafka On The Shore Audiobook Tor Legal And Safe Issues<br />
-Kafka On The Shore Audiobook Tor Alternatives And Recommendations<br />
-Kafka On The Shore Audiobook Tor Discussion And Analysis<br />
-Kafka On The Shore Audiobook Tor Themes And Symbols<br />
-Kafka On The Shore Audiobook Tor Quotes And Trivia<br />
-Kafka On The Shore Audiobook Tor Fan Art And Merchandise<br />
-Kafka On The Shore Audiobook Tor Adaptations And Spin-offs<br />
-Kafka On The Shore Audiobook Tor Background And Context<br />
-Kafka On The Shore Audiobook Tor Author Biography And Works<br />
-Kafka On The Shore Audiobook Tor Awards And Recognition<br />
-Kafka On The Shore Full Audiobook Torrent Free Download<br />
-Where To Get Kafka On The Shore Audiobook Torrent File<br />
-Is Kafka On The Shore Audiobook Torrent Worth Listening To<br />
-Tips And Tricks For Downloading Kafka On The Shore Audiobook Torrent<br />
-Pros And Cons Of Listening To Kafka On The Shore Audiobook Torrent<br />
-How To Enjoy Kafka On The Shore Audiobook Torrent More<br />
-What To Expect From Kafka On The Shore Audiobook Torrent<br />
-How To Share Kafka On The Shore Audiobook Torrent With Friends<br />
-How To Delete Kafka On The Shore Audiobook Torrent After Listening<br />
-How To Support The Author Of Kafka On The Shore After Listening To The Audiobook Torrent<br />
-How To Find More Books Like Kafka On The Shore After Listening To The Audiobook Torrent<br />
-How To Learn From Kafka On The Shore After Listening To The Audiobook Torrent<br />
-How To Write A Review For Kafka On The Shore After Listening To The Audiobook Torrent<br />
-How To Rate Kafka On The Shore After Listening To The Audiobook Torrent<br />
-How To Join A Book Club For Kafka On The Shore After Listening To The Audiobook Torrent<br />
-How To Create A Playlist For Kafka On The Shore After Listening To The Audiobook Torrent<br />
-How To Make A Podcast About Kafka On The Shore After Listening To The Audiobook Torrent<br />
-How To Make A Video About Kafka On The Shore After Listening To The Audiobook Torrent<br />
-How To Make A Blog About Kafka On The Shore After Listening To The Audiobook Torrent<br />
-How To Make A Quiz About Kafka On The Shore After Listening To The Audiobook Torrent<br />
-How To Make A Game About Kafka On The Shore After Listening To The Audiobook Torrent<br />
-How To Make A Comic About Kafka On The Shore After Listening To The Audiobook Torrent<br />
-How To Make A Meme About Kafka On The Shore After Listening To the Audiobook Torrent<br />
-How To Make A Fan Fiction About Kafka On The Shore After Listening To</p>
-<p>The second character is Nakata, an elderly man who can talk to cats but has lost most of his memory and intelligence due to a wartime incident. He becomes involved in a series of strange events that lead him to cross paths with Kafka.</p>
-<p>As their journeys unfold, they encounter various characters and phenomena that challenge their perception of reality, such as a ghostly pimp, a fish rain, a talking crow, and a portal to another world.</p>
-<p><strong>Kafka on the Shore</strong> is a novel that explores themes such as fate, free will, identity, love, and art. It is full of memorable scenes and quotes that will stay with you long after you finish reading it.</p>
-<h2>Why Listen to Kafka on the Shore Audiobook Tor?</h2>
-<h3>Experience Murakami's Unique Voice and Imagination</h3>
-<p>One of the reasons why you should listen to <strong>Kafka on the Shore</strong> audiobook tor is that it allows you to experience Murakami's unique voice and imagination in a new way.</p>
-<p>An audiobook tor is not just a regular audiobook. It is an enhanced version that adds sound effects, music, and other features that enhance the mood and atmosphere of the story.</p>
-<p>For example, when you listen to <strong>Kafka on the Shore</strong> audiobook tor, you will hear the sound of waves crashing on the shore, the voice of Nakata's cat friends, the music that Miss Saeki plays in her library, and more.</p>
-<p>You will also hear the narration by Sean Barrett and Oliver Le Sueur, two talented actors who bring the characters to life with their voices. They capture the tone and emotion of the dialogue perfectly, making you feel like you are listening to real conversations.</p>
-<p>Moreover, you will hear the translation by Philip Gabriel, one of Murakami's most trusted translators who has worked with him for many years. He preserves the originality and beauty of Murakami's language while making it accessible and enjoyable for English speakers.</p>
-<h3>Escape into a Magical Realism World</h3>
-<p>Another reason why you should listen to <strong>Kafka on the Shore</strong> audiobook tor is that it helps you escape into a magical realism world where anything can happen.</p>
-<p>Murakami is a master of magical realism, a genre that combines realistic elements with fantastical ones. He creates worlds that are familiar yet strange, ordinary yet extraordinary.</p>
-<p>When you listen to <strong>Kafka on the Shore</strong> audiobook tor, you will be transported to such a world where cats converse with people, fish tumble from the sky, a ghost-like pimp deploys a Hegel-spouting girl of the night, ```html It also offers various features and benefits, such as narration speed control, sleep timer, bookmarks, and ratings. You can listen to <strong>Kafka on the Shore</strong> audiobook tor on Audible.com by signing up for a free trial or a membership plan. You can also buy the audiobook tor individually or as part of a bundle. The audiobook tor is 19 hours and 8 minutes long and costs $19.95 or 1 credit.</li>
-<li><strong>Audiobooks.com</strong>: This is another popular platform for audiobooks. It also offers a large selection of titles, genres, and languages. It also offers some features and benefits, such as narration speed control, sleep timer, bookmarks, and recommendations. You can listen to <strong>Kafka on the Shore</strong> audiobook tor on Audiobooks.com by signing up for a free trial or a membership plan. You can also buy the audiobook tor individually or as part of a bundle. The audiobook tor is 19 hours and 6 minutes long and costs $24.99 or 1 credit.</li>
-<li><strong>Other platforms</strong>: There are also other platforms that offer <strong>Kafka on the Shore</strong> audiobook tor, such as Google Play, Apple Books, Kobo, Scribd, and more. Each platform has its own features, benefits, prices, and availability. You can compare and contrast them to find the one that suits your preferences and needs.</li>
-</ul>
-<p>The format of the audiobook tor depends on the platform you choose. Some platforms offer only digital formats, such as MP3, M4B, or AAC. Some platforms offer both digital and physical formats, such as CD or cassette. You can choose the format that is compatible with your device and convenient for you.</p>
-<h3>Download or Stream the Audiobook Tor</h3>
-<p>The next step is to download or stream the audiobook tor from your chosen platform and format. The process may vary slightly depending on the platform and format you choose, but here are some general steps:</p>
-<ol>
-<li>Go to the website or app of your chosen platform and log in with your account.</li>
-<li>Search for <strong>Kafka on the Shore</strong> audiobook tor and select it.</li>
-<li>If you have not purchased or redeemed the audiobook tor yet, do so by following the instructions on the screen.</li>
-<li>If you have purchased or redeemed the audiobook tor already, you can either download it to your device or stream it online.</li>
-<li>If you want to download it to your device, click on the download button and choose the location where you want to save it. Wait for the download to finish and then open it with your preferred media player.</li>
-<li>If you want to stream it online, click on the play button and enjoy listening to it with your internet connection.</li>
-</ol>
-<p>Once you have downloaded or streamed the audiobook tor, you can adjust some settings to optimize your listening experience. For example, you can change the volume, speed, and playback settings according to your preference. You can also use some features such as bookmarks, sleep timer, and ratings to enhance your enjoyment.</p>
-<h3>Enjoy Your Magical Journey into Murakami's World</h3>
-<p>The final step is to enjoy your magical journey into Murakami's world by listening to <strong>Kafka on the Shore</strong> audiobook tor. Here are some tips for doing so:</p>
-<ul>
-```html find a place that is comfortable and relaxing for you. Make sure you have enough space, light, and ventilation. You can also use some accessories such as headphones, speakers, pillows, blankets, or snacks to make yourself more cozy.</li>
-<li>Set aside enough time to immerse yourself in the story. <strong>Kafka on the Shore</strong> audiobook tor is a long and complex story that requires your full attention and concentration. It is not a good idea to listen to it while doing other tasks or activities that might distract you or interrupt you. Instead, set aside enough time to listen to it without any distractions or interruptions. You can listen to it in one sitting or in several sessions, depending on your preference and schedule.</li>
-<li>Take breaks if needed. While listening to <strong>Kafka on the Shore</strong> audiobook tor can be an enjoyable and rewarding experience, it can also be mentally and emotionally exhausting. The story can be intense, confusing, and disturbing at times, and it can affect your mood and feelings. If you feel tired, bored, or overwhelmed by the story, you can take breaks if needed. You can pause the audiobook tor, take a nap, stretch your body, drink some water, or do something else that can refresh your mind and spirit.</li>
-<li>Reflect on your thoughts and feelings after listening. After listening to <strong>Kafka on the Shore</strong> audiobook tor, you might have a lot of thoughts and feelings about the story. You might have questions, opinions, insights, or emotions that you want to express or explore. You can reflect on your thoughts and feelings by writing them down in a journal, talking to someone else who has listened to the audiobook tor, joining an online discussion forum or group, or doing some research on the author or the book.</li>
-</ul>
-<h2>Conclusion</h2>
-<p>In conclusion, <strong>Kafka on the Shore</strong> audiobook tor is a magical journey into Murakami's world that you should not miss. It is a novel that combines realism with fantasy, humor with melancholy, and philosophy with pop culture. It is an audiobook tor that enhances the reading experience by bringing out Murakami's unique voice and imagination, helping you escape into a magical realism world, and inspiring you to learn from Murakami's wisdom and philosophy.</p>
-<p>To listen to <strong>Kafka on the Shore</strong> audiobook tor, you need to choose your preferred platform and format, download or stream the audiobook tor from your chosen platform and format, and enjoy your magical journey into Murakami's world.</p>
-<p>So what are you waiting for? Get your copy of <strong>Kafka on the Shore</strong> audiobook tor today and start listening to it right away. You will not regret it.</p>
-<h2>FAQs</h2>
-<p>Here are some FAQs that answer some common questions or concerns that you might have about listening to <strong>Kafka on the Shore</strong> audiobook tor:</p>
-<ol>
-<li><strong>Is Kafka on the Shore suitable for all ages?</strong></li>
-<p>No, <strong>Kafka on the Shore</strong> is not suitable for all ages. It contains some scenes and topics that are violent, sexual, or disturbing, such as murder, rape, incest, and cannibalism. It also uses some language that is vulgar, profane, or offensive. It is recommended for mature readers who are 18 years old or above.</p>
-<li><strong>Do I need to read Murakami's other works before listening to Kafka on the Shore?</strong></li>
-<p>No, you do not need to read Murakami's other works before listening to <strong>Kafka on the Shore</strong>. It is a standalone novel that does not require any prior knowledge of Murakami's works. However, if you want to appreciate Murakami's style and themes more fully, you might want to read some of his other works, such as <em>The Wind-Up Bird Chronicle</em>, <em>Norwegian Wood</em>, and <em>1Q84</em>.</p>
-<li><strong>What is the meaning of Kafka on the Shore?</strong></li>
-<p><strong>Kafka on the Shore</strong> does not have one definitive meaning. It is a novel that is open to interpretation and analysis by each reader. It has multiple layers of meaning and symbolism that can be explored in different ways. Some of the possible meanings of <strong>Kafka on the Shore</strong> are:</p>
-<ul>
-<li>A coming-of-age story that follows Kafka's quest for his identity and his place in the world.</li>
-<li>A metaphysical mystery that explores the connection between Kafka and Nakata and their roles in fulfilling a prophecy.</li>
-<li>A philosophical inquiry that examines the concepts of fate, free will, reality, and truth.</li>
-<li>A literary homage that references various works of art, literature, music, and history.</li>
-<li>A cultural critique that challenges the norms and values of modern society.</li>
-</ul>
-<p>You can find your own meaning of <strong>Kafka on the Shore</strong> by listening to it carefully and critically.</p>
-<li><strong>Who is Kafka Tamura named after?</strong></li>
-<p>Kafka Tamura is named after Franz Kafka, ```html the most influential and important writers of the 20th century. Kafka is known for his works that depict the absurdity and alienation of modern life, such as <em>The Trial</em>, <em>The Metamorphosis</em>, and <em>The Castle</em>. Kafka Tamura shares some similarities with Franz Kafka, such as his sense of isolation, his search for meaning, and his fascination with literature.</p>
-<li><strong>What is the significance of the title Kafka on the Shore?</strong></li>
-<p>The title <strong>Kafka on the Shore</strong> has several possible significances. Some of them are:</p>
-<ul>
-<li>It refers to a song by Miss Saeki, who is a singer and a librarian. The song is called "Kafka on the Shore" and it is about a boy who waits for his lover on the shore. The song is symbolic of Miss Saeki's love for Kafka and her longing for him.</li>
-<li>It refers to a painting by Komura, who is Miss Saeki's deceased husband. The painting is also called "Kafka on the Shore" and it depicts a boy on the shore with a crow. The painting is symbolic of Komura's connection to Kafka and his role in his destiny.</li>
-<li>It refers to a scene in the novel where Kafka wakes up on the shore after a storm. The scene is symbolic of Kafka's transformation and awakening after his ordeal.</li>
-<li>It refers to a metaphor for Kafka's journey and identity. The shore is a place where two worlds meet: the land and the sea. It is also a place where one can see both the past and the future: the horizon and the waves. Kafka is on the shore because he is between two worlds: reality and fantasy, childhood and adulthood, fate and free will. He is also on the shore because he can see both his past and his future: his prophecy and his choice.</li>
-</ul>
-<p>You can find your own significance of the title <strong>Kafka on the Shore</strong> by listening to it closely and creatively.</p> 0a6ba089eb<br />
-<br />
-<br />
\ No newline at end of file
diff --git a/spaces/ticomspire/turkey-syria-earthquake-tweets/logs/Download Hitman Sniper Hack and Become the Ultimate Assassin.md b/spaces/ticomspire/turkey-syria-earthquake-tweets/logs/Download Hitman Sniper Hack and Become the Ultimate Assassin.md
deleted file mode 100644
index 0bf2ac521788649353ea9805598774d7f23f4a15..0000000000000000000000000000000000000000
--- a/spaces/ticomspire/turkey-syria-earthquake-tweets/logs/Download Hitman Sniper Hack and Become the Ultimate Assassin.md	
+++ /dev/null
@@ -1,118 +0,0 @@
-
-<h1>Download Hitman Sniper Hack: How to Unlock All Weapons and Missions</h1>
- <p>Hitman Sniper is one of the most popular and addictive sniper games on mobile devices. It lets you step into the shoes of Agent 47, the ultimate silent assassin, and complete various tactical missions in Montenegro and Death Valley. You can also compete against your friends and other players on the leaderboard and collect different weapons and perks. But what if you want to unlock all the weapons and missions in the game without spending real money or hours of gameplay? In this article, we will show you how to download Hitman Sniper hack and enjoy the game with unlimited resources.</p>
-<h2>download hitman sniper hack</h2><br /><p><b><b>DOWNLOAD</b> &#10004; <a href="https://bltlly.com/2uOkcP">https://bltlly.com/2uOkcP</a></b></p><br /><br />
- <h2>What is Hitman Sniper?</h2>
- <h3>A brief introduction to the game and its features</h3>
- <p>Hitman Sniper is a mobile game developed by CDE Entertainment Ltd. and based on the Hitman franchise. It was released in 2015 for iOS and Android devices. The game features over 150 missions and 11 contracts, where you have to eliminate targets, collect weapon parts, and discover secrets. You can also play in zombie mode, where you have to survive waves of undead enemies. The game has stunning graphics, realistic physics, and immersive sound effects that make you feel like a real sniper.</p>
- <h3>Why would you want to hack Hitman Sniper?</h3>
- <p>Hitman Sniper is a fun and challenging game, but it can also be frustrating and expensive. The game requires you to spend money or tokens to buy new weapons, upgrade them, or unlock new missions. Tokens are earned by completing achievements or watching ads, but they are not enough to get everything you want. Money can be purchased with real cash, but that can be costly and not everyone can afford it. Moreover, some missions are very hard to complete or require specific weapons or perks that you may not have. That's why many players look for ways to hack Hitman Sniper and get unlimited money, tokens, ammo, and other resources.</p>
- <h3>The benefits of hacking Hitman Sniper</h3>
- <p>By hacking Hitman Sniper, you can enjoy the game without any limitations or restrictions. You can unlock all the weapons and missions in the game, customize your rifle with any perk or ability, earn tokens faster without ever reloading, set off fireworks and launch mortar rounds, and more. You can also improve your strategy and skills as a sniper, as you can experiment with different weapons and scenarios. You can also dominate the leaderboard and impress your friends with your high scores and achievements.</p>
- <h2>How to download Hitman Sniper hack?</h2>
- <h3>The requirements and precautions for hacking the game</h3>
- <p>Before you download Hitman Sniper hack, there are some requirements and precautions that you need to follow. First of all, you need to have a compatible device that runs on Android 4.1 or higher or iOS 8.0 or later. You also need to have enough storage space on your device to install the hack file. Secondly, you need to uninstall the original version of Hitman Sniper from your device, as it may interfere with the hack file. You also need to enable unknown sources on your device settings, so that you can install apps from outside the official app store. <h3>The requirements and precautions for hacking the game</h3>
- <p>Before you download Hitman Sniper hack, there are some requirements and precautions that you need to follow. First of all, you need to have a compatible device that runs on Android 4.1 or higher or iOS 8.0 or later. You also need to have enough storage space on your device to install the hack file. Secondly, you need to uninstall the original version of Hitman Sniper from your device, as it may interfere with the hack file. You also need to enable unknown sources on your device settings, so that you can install apps from outside the official app store.</p>
- <h3>The steps to download and install the hack apk or mod file</h3>
- <p>There are many websites that offer Hitman Sniper hack apk or mod files for free download, but not all of them are safe and reliable. Some of them may contain viruses, malware, or spyware that can harm your device or steal your personal information. Therefore, you should be careful and choose a trusted source to download the hack file. Here are some steps to download and install the hack apk or mod file:</p>
- <ol>
-<li>Go to a website that provides Hitman Sniper hack apk or mod file, such as [Hitman Sniper Mod APK (Unlimited Money) V1.7.193827 Download](^1^) . Make sure to read the description and reviews of the file before downloading it.</li>
-<li>Click on the download button and wait for the file to be downloaded on your device.</li>
-<li>Locate the downloaded file on your device and tap on it to start the installation process.</li>
-<li>Follow the instructions on the screen and grant the necessary permissions to the app.</li>
-<li>Wait for the installation to be completed and then launch the app.</li>
-<li>Enjoy the game with unlimited money, tokens, ammo, and other resources.</li>
-</ol>
- <h3>The alternative methods to hack the game, such as using Game Guardian or cheat codes</h3>
- <p>If you don't want to download and install a hack apk or mod file, there are other ways to hack Hitman Sniper and get unlimited resources. One of them is using Game Guardian, a powerful tool that allows you to modify games on your device. You can use Game Guardian to change the values of money, tokens, ammo, and other variables in Hitman Sniper. However, you need to have a rooted device and some technical skills to use Game Guardian. Here are some steps to use Game Guardian to hack Hitman Sniper:</p>
- <ol>
-<li>Download and install Game Guardian from its official website [GameGuardian](^2^)  or from other sources.</li>
-<li>Launch Game Guardian and grant it root access.</li>
-<li>Open Hitman Sniper and start a mission.</li>
-<li>Open Game Guardian and select Hitman Sniper from the list of processes.</li>
-<li>Search for the value of money, tokens, ammo, or any other resource that you want to change.</li>
-<li>Change the value to any number that you want and confirm the changes.</li>
-<li>Go back to Hitman Sniper and see the changes in your resources.</li>
-</ol>
- <p>Another way to hack Hitman Sniper is using cheat codes, which are secret codes that can activate various effects in the game. Cheat codes can be entered in the game settings or in the pause menu. However, cheat codes are not officially supported by the game developers and may not work on all devices or versions of the game. Some cheat codes may also cause glitches or errors in the game. Here are some examples of cheat codes for Hitman Sniper:</p>
-<p>download hitman sniper mod apk unlimited money<br />
-download hitman sniper hack version for android<br />
-download hitman sniper cheat codes for ios<br />
-download hitman sniper mod menu with unlimited ammo<br />
-download hitman sniper hack tool no survey<br />
-download hitman sniper cracked apk free<br />
-download hitman sniper hack online generator<br />
-download hitman sniper mod apk latest version<br />
-download hitman sniper cheat engine for pc<br />
-download hitman sniper hack apk obb data<br />
-download hitman sniper mod apk revdl<br />
-download hitman sniper hack without root<br />
-download hitman sniper cheat sheet for beginners<br />
-download hitman sniper mod apk offline<br />
-download hitman sniper hack apk 1.7.193827<br />
-download hitman sniper mod apk rexdl<br />
-download hitman sniper hack for iphone<br />
-download hitman sniper cheat mod for windows 10<br />
-download hitman sniper mod apk android 1<br />
-download hitman sniper hack apk pure<br />
-download hitman sniper mod apk happymod<br />
-download hitman sniper hack with lucky patcher<br />
-download hitman sniper cheat trainer for mac<br />
-download hitman sniper mod apk 2023<br />
-download hitman sniper hack apk mirror</p>
- <ul>
-<li>To get unlimited money, enter <code>MONEY4ME</code>.</li>
-<li>To get unlimited tokens, enter <code>TOKENS4ME</code>.</li>
-<li>To get unlimited ammo, enter <code>AMMO4ME</code>.</li>
-<li>To unlock all weapons and missions, enter <code>UNLOCK4ME</code>.</li>
-<li>To set off fireworks and launch mortar rounds, enter <code>FIREWORKS4ME</code>.</li>
-</ul>
- <h2>How to unlock all weapons and missions in Hitman Sniper?</h2>
- <h3>The types and features of different weapons in the game</h3>
- <p>In Hitman Sniper, there are over 20 different weapons that you can use to complete your missions. Each weapon has its own stats, such as damage, fire rate, stability, clip size, maximum zoom, passive ability, and active ability. Passive abilities are effects that are always active when using a weapon, such as increased headshot damage or reduced reload time. Active abilities are effects that can be activated by tapping on an icon on the screen, such as slowing down time or marking multiple targets. You can also <p>You can also upgrade your weapons by collecting weapon parts, which can be found in missions or bought with tokens. Upgrading your weapons can improve their stats and abilities, making them more effective and versatile. Some of the most powerful and popular weapons in the game are:</p>
- <ul>
-<li>The Jaeger 7, which is the default weapon that you start with. It has a high fire rate, stability, and clip size, and a passive ability that increases your score multiplier by 1 for each consecutive kill.</li>
-<li>The Aria, which is a silenced weapon that has a high damage, stability, and maximum zoom, and a passive ability that reduces the alert level of nearby guards by 50%.</li>
-<li>The Kazo TRG, which is a sniper rifle that has a very high damage, stability, and maximum zoom, and an active ability that allows you to shoot through walls and objects.</li>
-<li>The Jaeger 7 Lancer, which is a special weapon that has a very high damage, fire rate, and stability, and an active ability that fires explosive rounds that can kill multiple targets.</li>
-</ul>
- <h3>The tips and tricks to complete different missions and challenges in the game</h3>
- <p>In Hitman Sniper, there are over 150 missions and 11 contracts that you can play in Montenegro and Death Valley. Each mission has a primary objective, such as eliminating a specific target or protecting a VIP, and several secondary objectives, such as killing a certain number of guards or using a certain weapon or ability. Each contract has a theme, such as stealth or chaos, and a set of challenges that you can complete to earn extra tokens and achievements. To complete different missions and challenges in the game, you need to use your skills, strategy, and creativity as a sniper. Here are some tips and tricks to help you:</p>
- <ul>
-<li>Use the environment to your advantage. You can shoot objects such as gas tanks, fire extinguishers, chandeliers, or cars to cause explosions or distractions that can kill or stun your targets or guards.</li>
-<li>Use your abilities wisely. You can use your active abilities to slow down time, mark multiple targets, shoot through walls, or fire explosive rounds. However, each ability has a cooldown time or a limited number of uses, so you need to use them at the right moment and situation.</li>
-<li>Be stealthy and silent. You can use silenced weapons or abilities to kill your targets without alerting nearby guards. You can also use body disposal points or water bodies to hide the bodies of your victims. You can also use lures such as coins or radios to distract guards or lure them into traps.</li>
-<li>Be quick and accurate. You can earn bonus points for killing your targets quickly and accurately. You can also earn bonus points for killing multiple targets with one shot or performing headshots or heartshots. You can also earn bonus points for completing missions without missing any shots or using any abilities.</li>
-</ul>
- <h3>The ways to unlock all weapons and missions using the hack or other methods</h3>
- <p>If you want to unlock all the weapons and missions in Hitman Sniper without spending money or tokens, you can use the hack apk or mod file that we mentioned earlier. By using the hack file, you can get unlimited money and tokens that you can use to buy and upgrade any weapon or unlock any mission in the game. You can also get unlimited ammo and other resources that can help you complete your missions easily. However, if you don't want to use the hack file or if it doesn't work on your device or version of the game, there are other methods that you can try to unlock all the weapons and missions in Hitman Sniper. Some of them are:</p>
- <ul>
-<li>Completing achievements. You can earn tokens by completing achievements in the game, such as killing a certain number of targets or using a certain weapon or ability. You can use these tokens to buy new weapons or unlock new missions.</li>
-<li>Watching ads. You can watch ads in the game to earn tokens or money that you can use to buy new weapons or unlock new missions.</li>
-<li>Using cheat codes. You can enter cheat codes in the game settings or in the pause menu to unlock all the weapons and missions in the game.</li>
-</ul>
- <h2>Conclusion</h2>
- <p>Hitman Sniper is an amazing game that lets you experience the thrill and challenge of being a sniper. However, if you want to enjoy the game without any limitations or restrictions, you may want to download Hitman Sniper hack and get unlimited resources. In this article, we showed you how to download Hitman Sniper hack apk or mod file from a trusted source and install it on your device. We also showed you how to unlock all the weapons and missions in the game using the hack file or other methods. We hope that this article was helpful and informative for you. If If you have any questions or feedback about Hitman Sniper or the hack file, feel free to leave a comment below. We would love to hear from you and help you out. Thank you for reading and happy sniping!</p>
- <h2>FAQs</h2>
- <h3>Is Hitman Sniper hack safe to use?</h3>
- <p>Hitman Sniper hack apk or mod file is generally safe to use, as long as you download it from a trusted source and follow the instructions carefully. However, there is always a risk of getting banned or detected by the game developers or the app store, so you should use the hack file at your own discretion and responsibility.</p>
- <h3>How can I update Hitman Sniper hack?</h3>
- <p>Hitman Sniper hack apk or mod file may not work on newer versions of the game or the app store, so you may need to update it regularly. To update Hitman Sniper hack, you need to uninstall the old version of the hack file from your device and download and install the new version of the hack file from the same source or a different one.</p>
- <h3>Can I play Hitman Sniper online with the hack file?</h3>
- <p>Hitman Sniper hack apk or mod file may allow you to play Hitman Sniper online with other players, but it may also cause problems or errors in the game. You may also get reported or banned by other players or the game developers if they notice that you are using a hack file. Therefore, it is advisable to play Hitman Sniper offline with the hack file or use it sparingly and discreetly online.</p>
- <h3>What are some other games like Hitman Sniper?</h3>
- <p>If you enjoy playing Hitman Sniper, you may also like some other games that are similar to it in terms of genre, theme, or gameplay. Some of them are:</p>
- <ul>
-<li>Sniper 3D: Fun Free Online FPS Shooting Game, which is a free online sniper game that lets you shoot criminals, zombies, and terrorists in various locations and scenarios.</li>
-<li>Sniper Fury: Online 3D FPS & Sniper Shooter Game, which is an online 3D sniper game that lets you join a global war against evil forces and use advanced weapons and gear.</li>
-<li>Sniper Elite 4, which is a console and PC sniper game that lets you infiltrate Nazi-occupied Italy and use stealth, strategy, and skill to complete your missions.</li>
-</ul>
- <h3>How can I contact the developers of Hitman Sniper?</h3>
- <p>If you have any questions, suggestions, complaints, or compliments about Hitman Sniper, you can contact the developers of the game by using the following methods:</p>
- <ul>
-<li>Email: support@hitmansniper.com</li>
-<li>Facebook: [Hitman Sniper] </li>
-<li>Twitter: [@HitmanSniper] </li>
-</ul></p> 197e85843d<br />
-<br />
-<br />
\ No newline at end of file
diff --git a/spaces/tillyu/Emojimotion/README.md b/spaces/tillyu/Emojimotion/README.md
deleted file mode 100644
index 7fa1576921802efa56a05436302dbcaa224bf13f..0000000000000000000000000000000000000000
--- a/spaces/tillyu/Emojimotion/README.md
+++ /dev/null
@@ -1,13 +0,0 @@
----
-title: Emojimotion
-emoji: 🏃
-colorFrom: red
-colorTo: pink
-sdk: gradio
-sdk_version: 3.12.0
-app_file: app.py
-pinned: false
-license: other
----
-
-Check out the configuration reference at https://huggingface.co/docs/hub/spaces-config-reference
diff --git a/spaces/tioseFevbu/cartoon-converter/scripts/Coolorus Serial Number Crack TOP Keygen.md b/spaces/tioseFevbu/cartoon-converter/scripts/Coolorus Serial Number Crack TOP Keygen.md
deleted file mode 100644
index 42a005e81bc8422479bca297dd57caefd81fb326..0000000000000000000000000000000000000000
--- a/spaces/tioseFevbu/cartoon-converter/scripts/Coolorus Serial Number Crack TOP Keygen.md	
+++ /dev/null
@@ -1,78 +0,0 @@
-
-<h1>Coolorus Serial Number Crack Keygen: How to Get It for Free</h1>
-<p>If you are a digital artist, designer, or photographer who uses Photoshop, you may have heard of Coolorus. It is a color wheel plugin that helps you choose better colors for your projects. But what if you don't want to pay for it? Is there a way to get Coolorus serial number crack keygen for free? In this article, we will answer these questions and more. We will explain what Coolorus is, how to install and activate it, how to use it, and how to avoid potential risks and problems with Coolorus crack/keygen.</p>
- <h2>What is Coolorus and why do you need it?</h2>
-<p>Coolorus is a color wheel plugin for Adobe Photoshop, inspired by Corel Painter color picker. It is compatible with Photoshop CS5, CS6, CC 2014.2.2 and above on Windows and Mac. It is also compatible with Flash Professional CS5 and CS6 on Windows and Mac.</p>
-<h2>Coolorus Serial Number Crack Keygen</h2><br /><p><b><b>Download</b> &#9733;&#9733;&#9733; <a href="https://urlcod.com/2uHwuw">https://urlcod.com/2uHwuw</a></b></p><br /><br />
-<p>Coolorus is designed for creative people who want to improve their painting workflow. It saves time, and helps you choose better colors thanks to Color Schemes, Gamut Lock, Color Mixer, Color Sliders, Color Harmonies, Luminosity Lock, RGB/RYB Modes, Save/Load Mixers, Color Modes, and more.</p>
-<p>Some of the features and benefits of Coolorus are:  </p>
-<ul>
-<li>It allows you to pick colors from a circular or triangular color wheel that shows hue, saturation, and brightness.</li>
-<li>It lets you adjust colors using six color spaces (RGB, HSV, LAB, CMYK, LCH, XYZ) that you can organize as you like.</li>
-<li>It enables you to change text and solid shapes fill color with ease.</li>
-<li>It helps you create consistent and harmonious color palettes by limiting your gamut or using predefined color schemes.</li>
-<li>It allows you to keep picked colors or share them with others using the Color Mixer panel.</li>
-<li>It simplifies the user interface by hiding or showing elements as needed.</li>
-</ul>
-<p>With Coolorus, you can create stunning color combinations and harmonies that will make your artwork stand out. Whether you are painting landscapes, portraits, comics, or anything else, Coolorus can help you achieve your desired results.</p>
- <h2>How to install and activate Coolorus on your computer</h2>
-<p>If you want to use Coolor us on your computer, you have two options: buy a license key or use a crack/keygen. Here are the steps for both methods:</p>
- <h3>Download the installer from the official website or a trusted source</h3>
-<p>The first step is to download the Coolorus installer from the official website or a trusted source. You can get the latest version of Coolorus from <a href="">https://www.coolorus.com/</a>. The installer is about 10 MB in size and works for both Windows and Mac. Alternatively, you can search for Coolorus on other websites that offer software downloads, but make sure they are safe and reliable.</p>
- <h3>Run the installer and follow the instructions</h3>
-<p>The next step is to run the installer and follow the instructions. The installation process is simple and straightforward. You just need to agree to the terms and conditions, choose the destination folder, and select the Photoshop version you want to install Coolorus on. The installer will automatically detect your Photoshop location and copy the necessary files. After the installation is complete, you can launch Photoshop and start using Coolorus.</p>
- <h3>Enter your license key or use a crack/keygen to generate one</h3>
-<p>The final step is to enter your license key or use a crack/keygen to generate one. If you have bought a license key from the official website, you can enter it in the Coolorus settings panel by clicking on the gear icon in the upper right corner of the color wheel. You will need to enter your email address and your license key, and then click on "Activate". You will see a confirmation message that your license has been activated successfully.</p>
-<p></p>
-<p>If you have not bought a license key, you can use a crack/keygen to generate one. A crack/keygen is a tool that can create a valid license key for Coolorus by bypassing its security system. You can find many crack/keygen files online, but be careful of their sources and quality. Some of them may not work properly, or may contain malware, viruses, or spyware that can harm your computer. To use a crack/keygen, you need to download it from a reputable website, run it on your computer, and follow its instructions. Usually, you will need to copy and paste the generated license key into the Coolorus settings panel, or replace some files in the Coolorus installation folder. After that, you should be able to use Coolorus without any limitations.</p> <h2>How to use Coolorus to improve your digital painting workflow</h2>
-<p>Now that you have installed and activated Coolorus on your computer, you can start using it to improve your digital painting workflow. Coolorus is easy to use and intuitive, but it also has many options and features that you can explore and customize. Here are some tips on how to use Coolorus effectively:</p>
- <h3>Access Coolorus from the Window menu or the Extensions panel in Photoshop</h3>
-<p>To access Coolorus, you can either go to the Window menu in Photoshop and select Coolorus, or open the Extensions panel and click on the Coolorus icon. You will see the Coolorus color wheel appear on your screen, which you can move and resize as you wish. You can also dock Coolorus to any side of your Photoshop window, or make it float above or below other panels.</p>
- <h3>Customize Coolorus settings and preferences according to your needs</h3>
-<p>To customize Coolorus settings and preferences, you can click on the gear icon in the upper right corner of the color wheel. You will see a panel with various tabs and options that you can adjust according to your needs. For example, you can change the color wheel shape, size, and mode, the color space sliders order and visibility, the color mixer layout and behavior, the color schemes presets and rules, the keyboard shortcuts and mouse actions, and more. You can also save and load your settings as presets, or reset them to default values.</p>
- <h3>Use Coolorus color wheel, sliders, mixer, gamut lock, and other tools to pick and manage colors</h3>
-<p>To use Coolorus color wheel, sliders, mixer, gamut lock, and other tools to pick and manage colors, you can simply click or drag on them with your mouse or stylus. You can also use keyboard shortcuts or mouse actions to perform various functions. For example, you can:</p>
-<ul>
-<li>Pick a color from the color wheel by clicking on it or dragging the cursor around it.</li>
-<li>Change the hue, saturation, brightness, or any other color attribute by dragging the sliders or using the arrow keys.</li>
-<li>Add a color to the color mixer by clicking on the plus icon or pressing Ctrl/Cmd + C.</li>
-<li>Remove a color from the color mixer by clicking on the minus icon or pressing Ctrl/Cmd + X.</li>
-<li>Blend two colors in the color mixer by dragging one over another or using the scroll wheel.</li>
-<li>Lock your gamut to a specific range of colors by clicking on the lock icon or pressing Ctrl/Cmd + L.</li>
-<li>Select a predefined color scheme by clicking on one of the icons at the bottom of the color wheel or pressing Ctrl/Cmd + 1-9.</li>
-<li>Sample a color from your image by holding Alt/Option and clicking on it.</li>
-<li>Change the foreground or background color by clicking on the corresponding swatch at the top of the color wheel.</li>
-</ul>
-<p>With these tools, you can easily pick and manage colors for your painting project. You can also see how your colors look on different backgrounds by using the preview panel at the bottom right corner of the color wheel.</p> <h2>How to avoid potential risks and problems with Coolorus crack/keygen</h2>
-<p>While using Coolorus crack/keygen may seem like a good idea to save money and get Coolorus for free, you should also be aware of the potential risks and problems that may come with it. Using cracked software is not only illegal and unethical, but also dangerous and unreliable. Here are some of the things you should consider before using Coolorus crack/keygen:</p>
- <h3>Be aware of the legal and ethical issues of using cracked software</h3>
-<p>Using cracked software is a form of software piracy, which is a violation of intellectual property rights and laws. Software piracy is a serious crime that can result in fines, lawsuits, or even jail time. By using cracked software, you are not only stealing from the developers who created it, but also from the customers who paid for it. You are also depriving yourself of the benefits of legitimate software, such as updates, support, and warranty. </p>
-<p>Using cracked software is also unethical and unfair. It shows a lack of respect and appreciation for the hard work and creativity of the developers who made the software. It also harms the software industry and the economy by reducing the revenue and incentives for innovation and quality. It also affects other users who may suffer from reduced performance, security, and compatibility due to cracked software. </p>
- <h3>Be careful of malware, viruses, and spyware that may come with crack/keygen files</h3>
-<p>Another risk of using cracked software is that it may contain malware, viruses, or spyware that can infect your computer and compromise your data and privacy. Malware, viruses, and spyware are malicious programs that can damage your system, steal your information, monitor your activity, or take control of your device. They can also spread to other devices or networks that you connect to. </p>
-<p>Many crack/keygen files are hosted on shady websites or peer-to-peer networks that are not secure or trustworthy. They may be disguised as legitimate files, but they may actually contain harmful code that can execute when you run them. Some of them may also require you to disable your antivirus or firewall software, which makes your computer more vulnerable to attacks. </p>
- <h3>Be prepared for possible errors, bugs, and compatibility issues with Photoshop updates</h3>
-<p>A third problem with using cracked software is that it may not work properly or at all. Cracked software is often unstable, buggy, or outdated. It may cause errors, crashes, or glitches that can ruin your work or experience. It may also lack some features or functions that are available in the original software. </p>
-<p>Cracked software is also not compatible with Photoshop updates. Photoshop updates are released regularly to fix bugs, improve performance, add new features, and enhance security. However, cracked software may not be able to receive or install these updates, or may stop working after updating Photoshop. This means that you will miss out on the latest improvements and innovations that Photoshop offers. </p> <h2>Conclusion and FAQs</h2>
-<p>In conclusion, Coolorus is a great plugin for Photoshop that can enhance your color choices and save you time. It has many features and benefits that make it worth buying. However, if you want to get Coolorus for free, you can use a crack/keygen to generate a license key. But you should be aware of the risks and drawbacks of using cracked software, such as legal and ethical issues, malware and viruses, and errors and compatibility issues. You should also be careful of the sources and quality of the crack/keygen files you download. If you want to enjoy Coolorus without any problems, we recommend that you buy a license key from the official website and support the developers.</p>
-<p>Here are some FAQs that may help you with Coolorus:</p>
-<h3>How much does Coolorus cost?</h3>
-<p>Coolorus costs $14.99 for a single license key that can be used on up to two computers. You can buy it from the official website using PayPal or credit card. You will receive an email with your license key and download link after your purchase.</p>
-<h3>How can I update Coolorus?</h3>
-<p>You can update Coolorus by downloading the latest installer from the official website or from the email you received after your purchase. You can also check for updates from the Coolorus settings panel by clicking on the "Check for updates" button. You will need to enter your license key again after updating Coolorus.</p>
-<h3>How can I contact Coolorus support?</h3>
-<p>You can contact Coolorus support by sending an email to <a href="mailto:support@coolorus.com">support@coolorus.com</a>. You can also visit their <a href="https://www.coolorus.com/support/">support page</a> for more information and resources.</p>
-<h3>How can I uninstall Coolorus?</h3>
-<p>You can uninstall Coolorus by running the uninstaller from the Coolorus installation folder or from the Windows Control Panel. You can also delete the Coolorus files manually from the Photoshop plugins folder.</p>
-<h3>What are some alternatives to Coolorus?</h3>
-<p>If you are looking for other color wheel plugins for Photoshop, you may want to check out these alternatives:</p>
-<table>
-<tr><th>Name</th><th>Description</th><th>Price</th></tr>
-<tr><td>MagicPicker</td><td>A color wheel plugin that also offers color temperature, tone lock, color history, and more.</td><td>$19</td></tr>
-<tr><td>Color Wheel Pro</td><td>A color wheel plugin that also shows color schemes, previews, and harmonies.</td><td>$39.95</td></tr>
-<tr><td>ColorSchemer Studio</td><td>A color wheel plugin that also helps you create and manage color palettes.</td><td>$49.99</td></tr>
-<tr><td>Kuler</td><td>A free online tool that lets you create and share color themes.</td><td>Free</td></tr>
-<tr><td>ColorZilla</td><td>A free browser extension that lets you pick colors from web pages.</td><td>Free</td></tr>
-</table></p> b2dd77e56b<br />
-<br />
-<br />
\ No newline at end of file
diff --git a/spaces/tioseFevbu/cartoon-converter/scripts/Copytrans Photo __TOP__ Free Download Full Version.md b/spaces/tioseFevbu/cartoon-converter/scripts/Copytrans Photo __TOP__ Free Download Full Version.md
deleted file mode 100644
index 16a84b5faf95eddba199450fa91b673c6f711601..0000000000000000000000000000000000000000
--- a/spaces/tioseFevbu/cartoon-converter/scripts/Copytrans Photo __TOP__ Free Download Full Version.md	
+++ /dev/null
@@ -1,74 +0,0 @@
-<br />
-<h1>Copytrans Photo Free Download Full Version: How to Transfer and Manage Your iPhone Photos Easily</h1> | | H2: What is Copytrans Photo? | <h2>What is Copytrans Photo?</h2> | | P: A brief introduction to Copytrans Photo and its features | <p>A brief introduction to Copytrans Photo and its features</p> | | H2: Why do you need Copytrans Photo? | <h2>Why do you need Copytrans Photo?</h2> | | P: A paragraph explaining the benefits of using Copytrans Photo for iPhone photo transfer and management | <p>A paragraph explaining the benefits of using Copytrans Photo for iPhone photo transfer and management</p>
-<h2>Copytrans Photo Free Download Full Version</h2><br /><p><b><b>Download</b> &#9675;&#9675;&#9675; <a href="https://urlcod.com/2uHvEq">https://urlcod.com/2uHvEq</a></b></p><br /><br /> | | H2: How to download Copytrans Photo for free? | <h2>How to download Copytrans Photo for free?</h2> | | P: A paragraph with a link to the official website of Copytrans Photo and instructions on how to download and install it for free | <p>A paragraph with a link to the official website of Copytrans Photo and instructions on how to download and install it for free</p> | | H2: How to use Copytrans Photo to transfer photos between iPhone and PC? | <h2>How to use Copytrans Photo to transfer photos between iPhone and PC?</h2> | | P: A paragraph with step-by-step instructions on how to transfer photos and videos from iPhone to PC and back using Copytrans Photo | <p>A paragraph with step-by-step instructions on how to transfer photos and videos from iPhone to PC and back using Copytrans Photo</p> | | H3: How to transfer photos from iPhone to PC? | <h3>How to transfer photos from iPhone to PC?</h3> | | P: A sub-paragraph with screenshots and tips on how to transfer photos from iPhone to PC using Copytrans Photo | <p>A sub-paragraph with screenshots and tips on how to transfer photos from iPhone to PC using Copytrans Photo</p> | | H3: How to transfer photos from PC to iPhone? | <h3>How to transfer photos from PC to iPhone?</h3> | | P: A sub-paragraph with screenshots and tips on how to transfer photos from PC to iPhone using Copytrans Photo | <p>A sub-paragraph with screenshots and tips on how to transfer photos from PC to iPhone using Copytrans Photo</p> | | H2: How to use Copytrans Photo to create, edit, and manage iPhone albums? | <h2>How to use Copytrans Photo to create, edit, and manage iPhone albums?</h2> | | P: A paragraph with step-by-step instructions on how to create, edit, and manage iPhone albums using Copytrans Photo | <p>A paragraph with step-by-step instructions on how to create, edit, and manage iPhone albums using Copytrans Photo</p> | | H3: How to create a new album on iPhone? | <h3>How to create a new album on iPhone?</h3> | <h1>Copytrans Photo Free Download Full Version: How to Transfer and Manage Your iPhone Photos Easily</h1>
- <p>Do you have a lot of photos and videos on your iPhone that you want to transfer to your PC or vice versa? Do you want to create, edit, and manage your iPhone albums without using iTunes or iCloud? Do you want to do all these things for free and with a simple and user-friendly interface? If you answered yes to any of these questions, then you need Copytrans Photo.</p>
- <h2>What is Copytrans Photo?</h2>
- <p>Copytrans Photo is a powerful and easy-to-use software that allows you to transfer and manage your iPhone photos and videos on your PC. With Copytrans Photo, you can:</p>
-<p></p>
- <ul>
-<li>Transfer photos and videos from iPhone to PC and back in a few clicks</li>
-<li>Create, edit, and delete iPhone albums on your PC</li>
-<li>Organize your iPhone photos by date, location, or name</li>
-<li>View your iPhone photos in full resolution on your PC</li>
-<li>Convert HEIC photos to JPG format on your PC</li>
-<li>Backup your iPhone photos and videos to an external drive or cloud service</li>
-<li>Free up space on your iPhone by deleting unwanted photos and videos</li>
-</ul>
- <p>Copytrans Photo supports all iPhone models, from iPhone 4 to iPhone 13, and all iOS versions, from iOS 7 to iOS 15. It also works with iPad and iPod touch devices. Copytrans Photo is compatible with Windows 10, 8.1, 8, 7, Vista, and XP.</p>
- <h2>Why do you need Copytrans Photo?</h2>
- <p>If you are an iPhone user, you probably know how frustrating it can be to transfer and manage your photos and videos using iTunes or iCloud. iTunes is slow, complicated, and often syncs or deletes your photos without your consent. iCloud is limited in storage space, requires an internet connection, and does not let you organize your albums on your PC. Moreover, both iTunes and iCloud do not support HEIC format, which is the default format for iPhone photos since iOS 11.</p>
- <p>That's why you need Copytrans Photo. Copytrans Photo is a smart alternative to iTunes and iCloud that gives you full control over your iPhone photos and videos. You can transfer them to your PC or back to your iPhone without any hassle. You can create, edit, and manage your albums on your PC with drag-and-drop functionality. You can view your photos in full resolution and convert them to JPG format if needed. You can backup your photos and videos to any location you want. And you can free up space on your iPhone by deleting unwanted photos and videos.</p>
- <p>Copytrans Photo is fast, reliable, and secure. It does not require an internet connection or an Apple ID. It does not modify or erase your original photos or videos. It preserves the quality and metadata of your photos and videos. And it respects your privacy and does not collect or share any of your data.</p>
- <h2>How to download Copytrans Photo for free?</h2>
- <p>If you are interested in trying Copytrans Photo for free, you can download it from the official website of Copytrans Photo: <a href="">https://www.copytrans.net/copytransphoto/</a>. There you will find the latest version of Copytrans Photo that you can install on your PC in a few minutes.</p>
- <p>To download Copytrans Photo for free, follow these steps:</p>
- <ol>
-<li>Go to <a href="">https://www.copytrans.net/copytransphoto/</a> and click on the "Download" button.</li>
-<li>Save the file "CopyTransPhoto_Installer.exe" on your PC.</li>
-<li>Run the file "CopyTransPhoto_Installer.exe" and follow the instructions on the screen.</li>
-<li>Launch Copytrans Photo from the desktop shortcut or the start menu.</li>
-</ol>
- <p>Congratulations! You have successfully downloaded and installed Copytrans Photo for free on your PC. You can now use it to transfer and manage your iPhone photos and videos.</p>
- <h2>How to use Copytrans Photo to transfer photos between iPhone and PC?</h2>
- <p>One of the main features of Copytrans Photo is that it allows you to transfer photos and videos between your iPhone and PC in a few clicks. You can transfer them in both directions: from iPhone to PC or from PC to iPhone. You can also choose which albums or folders you want to transfer.</p>
- <h3>How to transfer photos from iPhone to PC?</h3>
- <p>To transfer photos and videos from your iPhone to your PC using Copy Copytrans Photo to create, edit, and manage iPhone albums?</h2>
- <p>Another feature of Copytrans Photo is that it allows you to create, edit, and manage your iPhone albums on your PC. You can create new albums, rename existing albums, delete unwanted albums, and move photos and videos between albums. You can also sort your albums by name, date, or size.</p>
- <h3>How to create a new album on iPhone?</h3>
- <p>To create a new album on your iPhone using Copytrans Photo, follow these steps:</p>
- <ol>
-<li>Connect your iPhone to your PC using a USB cable. Make sure to unlock your iPhone and trust your PC if prompted.</li>
-<li>Launch Copytrans Photo on your PC. It will automatically detect your iPhone and display its photos and videos on the left panel.</li>
-<li>Click on the "New Album" button at the top left corner. A pop-up window will appear where you can enter the name of the new album.</li>
-<li>Click on the "OK" button to create the new album. It will appear on the left panel under the "Albums" section.</li>
-<li>Drag and drop the photos and videos that you want to add to the new album from the right panel or from another album on the left panel.</li>
-<li>Click on the "Apply changes" button at the top right corner to save the new album on your iPhone. Wait until it is completed and check the progress bar at the bottom.</li>
-</ol>
- <p>That's it! You have successfully created a new album on your iPhone using Copytrans Photo. You can now view it on your iPhone or edit it as you wish.</p>
- <h3>How to edit an existing album on iPhone?</h3>
- <p>To edit an existing album on your iPhone using Copytrans Photo, follow these steps:</p>
- <ol>
-<li>Connect your iPhone to your PC using a USB cable. Make sure to unlock your iPhone and trust your PC if prompted.</li>
-<li>Launch Copytrans Photo on your PC. It will automatically detect your iPhone and display its photos and videos on the left panel.</li>
-<li>Select the album that you want to edit from the left panel. You can use the search box or the filter options to find it quickly.</li>
-<li>To rename the album, right-click on it and select "Rename". A pop-up window will appear where you can enter the new name of the album.</li>
-<li>To delete the album, right-click on it and select "Delete". A confirmation message will appear where you can click on "Yes" to delete the album.</li>
-<li>To move photos and videos between albums, drag and drop them from one album to another on the left panel.</li>
-<li>Click on the "Apply changes" button at the top right corner to save the changes on your iPhone. Wait until it is completed and check the progress bar at the bottom.</li>
-</ol>
- <p>That's it! You have successfully edited an existing album on your iPhone using Copytrans Photo. You can now view it on your iPhone or edit it as you wish.</p>
- <h2>Conclusion</h2>
- <p>In this article, we have shown you how to download Copytrans Photo for free and how to use it to transfer and manage your iPhone photos and videos on your PC. We have also explained why Copytrans Photo is a smart alternative to iTunes and iCloud for iPhone photo transfer and management. We hope that you have found this article helpful and informative. If you have any questions or feedback, please feel free to leave a comment below or contact us through our website: <a href="">https://www.copytrans.net/support/</a>.</p>
- <h2>FAQs</h2>
- <h4>Is Copytrans Photo safe to use?</h4>
- <p>Yes, Copytrans Photo is safe to use. It does not contain any viruses, malware, or spyware. It does not modify or erase your original photos or videos. It does not collect or share any of your data. It respects your privacy and security.</p>
- <h4>Is Copytrans Photo free to use?</h4>
- <p>Yes, Copytrans Photo is free to use for a limited time. You can download it from the official website of Copytrans Photo: <a href="">https://www.copytrans.net/copytransphoto/</a>. You can use it for 100 actions (such as transferring or deleting photos) without any limitations. After that, you can either purchase a license or continue using it for free with some limitations (such as transferring only 20 photos per day).</p>
- <h4>How can I purchase a license for Copytrans Photo?</h4>
- <p>If you want to purchase a license for Copytrans Photo, you can do so from the official website of Copytrans Photo: <a href="">https://www.copytrans.net/copytransphoto </a>. There you will find different options for purchasing a license, such as a single license, a family license, or a bundle license. You can also find discounts and offers for loyal customers. You can pay with a credit card, PayPal, or other methods. Once you purchase a license, you will receive an activation code that you can enter in Copytrans Photo to unlock all the features.</p>
- <h4>How can I update Copytrans Photo to the latest version?</h4>
- <p>If you want to update Copytrans Photo to the latest version, you can do so from the official website of Copytrans Photo: <a href="">https://www.copytrans.net/copytransphoto</a>. There you will find the latest version of Copytrans Photo that you can download and install on your PC. You can also check for updates from within Copytrans Photo by clicking on the "Help" menu and selecting "Check for updates". If there is a new version available, you will be prompted to download and install it.</p>
- <h4>How can I contact the support team of Copytrans Photo?</h4>
- <p>If you have any questions, problems, or suggestions regarding Copytrans Photo, you can contact the support team of Copytrans Photo by visiting their website: <a href="">https://www.copytrans.net/support/</a>. There you will find various ways to contact them, such as email, phone, chat, or social media. You can also find a comprehensive FAQ section, a user manual, and a video tutorial that can help you with common issues.</p> b2dd77e56b<br />
-<br />
-<br />
\ No newline at end of file
diff --git a/spaces/tioseFevbu/cartoon-converter/scripts/Creative ALchemy Universal 1.00.08 By Daniel Kawakami 64 Bit UPDATED.md b/spaces/tioseFevbu/cartoon-converter/scripts/Creative ALchemy Universal 1.00.08 By Daniel Kawakami 64 Bit UPDATED.md
deleted file mode 100644
index 42e546dbd38fa651eea1e2d81820fe8b72eafe8a..0000000000000000000000000000000000000000
--- a/spaces/tioseFevbu/cartoon-converter/scripts/Creative ALchemy Universal 1.00.08 By Daniel Kawakami 64 Bit UPDATED.md	
+++ /dev/null
@@ -1,45 +0,0 @@
-
-<h1>Creative ALchemy Universal 1.00.08 By Daniel Kawakami 64 Bit: What Is It and Why You Need It</h1>
- <p>If you are a fan of old PC games that use DirectSound3D for immersive 3D audio and EAX effects, you may have noticed that they don't sound as good or even work at all on Windows Vista and newer operating systems. This is because Microsoft removed the hardware acceleration for DirectSound3D in these versions of Windows, resulting in degraded sound quality, loss of EAX features, or no sound at all.</p>
- <p>Fortunately, there is a way to restore the original sound quality and functionality of these games on modern Windows systems, thanks to a tool called Creative ALchemy Universal. This tool was created by Daniel Kawakami (daniel_k), a modder and hacker who is well-known for his unofficial drivers and patches for Creative sound cards. Creative ALchemy Universal is a modified version of the official Creative ALchemy tool that works on all sound cards, not just Creative's products.</p>
-<h2>Creative ALchemy Universal 1.00.08 By Daniel Kawakami 64 Bit</h2><br /><p><b><b>Download Zip</b> &#127383; <a href="https://urlcod.com/2uHwSo">https://urlcod.com/2uHwSo</a></b></p><br /><br />
- <p>In this article, we will explain what Creative ALchemy Universal is, how it works, how to install and use it on your PC, how to troubleshoot and optimize it for better performance, and answer some frequently asked questions about it. By the end of this article, you will be able to enjoy your favorite DirectSound3D games with full 3D audio and EAX effects on your Windows Vista or newer system.</p>
- <h2>What Is Creative ALchemy Universal and How Does It Work?</h2>
- <h3>The Problem with DirectSound3D Games on Windows Vista and Newer</h3>
- <p>DirectSound3D was a technology developed by Microsoft that allowed PC games to produce realistic 3D audio effects using hardware acceleration from sound cards. It was widely used by many games in the late 1990s and early 2000s, such as Half-Life, Deus Ex, Unreal Tournament, Baldur's Gate, and many more.</p>
- <p>EAX (Environmental Audio Extensions) was a technology developed by Creative that enhanced DirectSound3D with additional features, such as reverb, occlusion, obstruction, environmental presets, and more. EAX was supported by many Creative sound cards, such as Sound Blaster Live!, Audigy, X-Fi, and others. EAX was also widely used by many games in the same era as DirectSound3D, such as Thief, System Shock 2, Doom 3, F.E.A.R., and many more.</p>
- <p>Both DirectSound3D and EAX relied on hardware acceleration from sound cards to produce high-quality 3D audio effects with low CPU usage. However, this also meant that they were dependent on the drivers and APIs provided by Microsoft and Creative.</p>
- <p>In Windows Vista and newer operating systems, Microsoft removed the hardware acceleration for DirectSound3D in favor of a new audio architecture called WASAPI (Windows Audio Session API). This meant that DirectSound3D games could no longer access the hardware features of sound cards directly, resulting in degraded sound quality, loss of EAX features, or no sound at all.</p>
-<p></p>
- <p>Creative tried to solve this problem by releasing a tool called Creative ALchemy that restored the hardware acceleration for DirectSound3D games on Windows Vista and newer systems. However, this tool only worked on Creative sound cards, not on other brands or onboard audio devices. Moreover, Creative ALchemy required a paid license for some sound cards, such as X-Fi and Audigy 4. This meant that many users who wanted to play DirectSound3D games on Windows Vista and newer systems were out of luck.</p>
- <h3>The Solution: Creative ALchemy Universal by Daniel Kawakami</h3>
- <p>Daniel Kawakami (daniel_k) is a modder and hacker who is well-known for his unofficial drivers and patches for Creative sound cards. He has released many modified versions of Creative's drivers and software that enable features and functions that are not officially supported by Creative, such as Dolby Digital Live, DTS Connect, ASIO, OpenAL, and more.</p>
- <p>One of his most popular creations is Creative ALchemy Universal, a modified version of the official Creative ALchemy tool that works on all sound cards, not just Creative's products. Creative ALchemy Universal does not require a paid license or activation, and it supports both 32-bit and 64-bit versions of Windows Vista and newer systems.</p>
- <p>Creative ALchemy Universal works by intercepting the calls from DirectSound3D games to the sound card driver and redirecting them to OpenAL, an open-source audio API that supports hardware acceleration and EAX effects. OpenAL then communicates with the sound card driver using WASAPI, the new audio architecture in Windows Vista and newer systems. This way, Creative ALchemy Universal restores the original sound quality and functionality of DirectSound3D games on modern Windows systems.</p>
- <h3>The Features and Benefits of Creative ALchemy Universal</h3>
- <p>Creative ALchemy Universal has many features and benefits that make it a must-have tool for any PC gamer who wants to play old DirectSound3D games on Windows Vista and newer systems. Some of these features and benefits are:</p>
- - It works on all sound cards, not just Creative's products. This means that you can use any sound card that supports OpenAL or has an OpenAL driver available, such as Realtek, ASUS, C-Media, VIA, and others. - It supports both 32-bit and 64-bit versions of Windows Vista and newer systems. This means that you can use it on any modern Windows system without compatibility issues. - It does not require a paid license or activation. This means that you can use it for free without any limitations or restrictions. - It supports all EAX versions up to EAX 5.0. This means that you can enjoy the full range of EAX effects that were available in DirectSound3D games, such as reverb, occlusion, obstruction, environmental presets, and more. - It supports up to 128 hardware-accelerated voices. This means that you can hear more sounds at the same time without compromising the sound quality or performance. - It supports up to 7.1 surround sound output. This means that you can experience immersive 3D audio effects with your surround sound speakers or headphones. - It supports custom buffer sizes and sample rates. This means that you can adjust the settings to suit your preferences and system capabilities. - It supports multiple instances of the same game. This means that you can run more than one copy of the same game at the same time with different settings. - It supports manual editing of the alchemy.ini file. This means that you can tweak the settings for each game individually or globally using a text editor. - It supports backup and restore functions. This means that you can save and load your settings easily without losing them. <h2>How to Install and Use Creative ALchemy Universal on Your PC</h2>
- <h3>Downloading and Extracting the File</h3>
- <p>The first step to install and use Creative ALchemy Universal on your PC is to download the file from the official website or from a mirror site. The file name is alchemy_universal_1_00_08.zip and it is about 9 MB in size.</p>
- <p>Once you have downloaded the file, you need to extract it using a program like WinRAR or 7-Zip. You can extract it to any folder you want, but we recommend creating a new folder called "Creative ALchemy Universal" in your Program Files directory for convenience.</p>
- <h3>Running the Creative ALchemy Universal Configuration Tool</h3>
- <p>The next step is to run the Creative ALchemy Universal configuration tool. To do this, go to the folder where you extracted the file and double-click on the file called "ALchemy.exe". This will launch the configuration tool window.</p>
- <p>The configuration tool window has four tabs: Games List, Settings, About, and Help. The Games List tab shows the list of games that are supported by Creative ALchemy Universal. The Settings tab shows the global settings for Creative ALchemy Universal. The About <p>You can also remove the games from the Games List by clicking on the "Remove" button or pressing the Delete key. You can also clear the Games List by clicking on the "Clear" button.</p>
- <p>Once you have configured the Games List, you can close the configuration tool window and launch the games from their original shortcuts or launchers. You should be able to hear the 3D audio and EAX effects as they were intended by the game developers.</p>
- <h2>How to Troubleshoot and Optimize Creative ALchemy Universal for Better Performance</h2>
- <h3>Common Issues and Fixes with Creative ALchemy Universal</h3>
- <p>Although Creative ALchemy Universal is a very useful and powerful tool, it is not perfect and it may not work for every game or system. Here are some of the common issues that users may encounter with Creative ALchemy Universal and how to fix them:</p>
- - No sound or distorted sound: This may be caused by an incompatible or outdated sound card driver, a wrong buffer size or sample rate setting, or a conflict with another audio program. To fix this, try updating your sound card driver, changing the buffer size or sample rate setting, or closing any other audio programs that may interfere with Creative ALchemy Universal. - No EAX effects or wrong EAX effects: This may be caused by an incorrect EAX version setting, a missing or corrupted OpenAL driver, or a game that does not support EAX at all. To fix this, try changing the EAX version setting, installing or reinstalling the OpenAL driver, or checking if the game actually supports EAX. - Game crashes or freezes: This may be caused by a corrupted game file, a compatibility issue with Creative ALchemy Universal, or a lack of system resources. To fix this, try verifying the integrity of the game file, disabling Creative ALchemy Universal for that game, or freeing up some system resources by closing other programs or lowering the game settings. - Game does not launch or does not recognize Creative ALchemy Universal: This may be caused by an incorrect game path, a missing or blocked alchemy.ini file, or a security program that prevents Creative ALchemy Universal from running. To fix this, try correcting the game path, restoring or unblocking the alchemy.ini file, or adding Creative ALchemy Universal to the exception list of your security program. <h3>Tips and Tricks to Improve Sound Quality and Stability with Creative ALchemy Universal</h3>
- <p>Here are some tips and tricks that can help you improve the sound quality and stability of Creative ALchemy Universal and enjoy your DirectSound3D games better:</p>
- - Use a sound card that supports OpenAL or has an OpenAL driver available. This will ensure that Creative ALchemy Universal can communicate with your sound card properly and enable hardware acceleration and EAX effects. - Use a buffer size of 4096 samples and a sample rate of 44100 Hz for most games. These are the default settings for Creative ALchemy Universal and they work well for most games. However, you can experiment with different values to find the best ones for your system and preferences. - Use a speaker configuration that matches your sound output device. For example, if you are using a 5.1 surround sound speaker system, use a 5.1 speaker configuration in Creative ALchemy Universal. This will ensure that the sound is distributed correctly among your speakers. - Use EAX 2.0 for most games. This is the most common and compatible version of EAX that works with most games. However, you can also try other versions of EAX if your game supports them and you want to hear different effects. - Use multiple instances of Creative ALchemy Universal for different games. This will allow you to customize the settings for each game individually and avoid conflicts between them. - Backup and restore your settings regularly. This will help you save and load your settings easily without losing them. <h2>Conclusion and FAQs</h2>
- <h3>Conclusion</h3>
- <p>Creative ALchemy Universal is a great tool that allows you to play old DirectSound3D games with full 3D audio and EAX effects on Windows Vista and newer systems. It works on all sound cards, not just Creative's products, and it does not require a paid license or activation. It supports both 32-bit and 64-bit versions of Windows Vista and newer systems, and it supports all EAX versions up to EAX 5.0.</p>
- <p>To use Creative ALchemy Universal, you need to download and extract the file from the official website or from a mirror site, run the configuration tool, add and edit the games that you want to enable EAX support for, and launch them from their original shortcuts or launchers.</p>
- <p>If you encounter any issues with Creative ALchemy Universal, you can try some of the common fixes that we have provided in this article, such as updating your sound card driver, changing the buffer size or sample rate setting, or disabling Creative ALchemy Universal for that game. You can also try some of the tips and tricks that we have provided in this article, such as using a sound card that supports OpenAL, using a buffer size of 4096 samples and a sample rate of 44100 Hz, or using multiple instances of Creative ALchemy Universal for different games.</p>
- <p>We hope that this article has helped you understand what Creative ALchemy Universal is, how it works, how to install and use it on your PC, how to troubleshoot and optimize it for better performance, and answer some frequently asked questions about it. If you have any further questions or comments, please feel free to contact us or leave a comment below.</p>
- <p>Thank you for reading and happy gaming!</p>
- <h3>FAQs</h3>
- <p>Here are some of the frequently asked questions about Creative ALchemy Universal and their answers:</p>
- - Q: Where can I download Creative ALchemy Universal? - A: You can download Creative ALchemy Universal from the official website or from a mirror site. The official website is https://danielkawakami.blogspot.com/2017/05/creative-alchemy-universal.html and the mirror site is https://www.techpowerup.com/download/creative-alchemy-universal/. - Q: Is Creative ALchemy Universal legal and safe to use? - A: Creative ALchemy Universal is legal and safe to use as long as you own the original games and sound cards that you are using it with. However, Creative ALchemy Universal is not officially supported or endorsed by Creative or Microsoft, so use it at your own risk. - Q: Does Creative ALchemy Universal work with Windows 10? - A: Yes, Creative ALchemy Universal works with Windows 10 as well as Windows Vista, Windows 7, Windows 8, and Windows 8.1. - Q: Does Creative ALchemy Universal work with Steam games? - A: Yes, Creative ALchemy Universal works with Steam games as well as non-Steam games. However, you may need to disable the Steam overlay or run the games in compatibility mode for some games to work properly. - Q: Does Creative ALchemy Universal work with all DirectSound3D games? - A: No, Creative ALchemy Universal does not work with all DirectSound3D games. Some games may not be compatible with Creative ALchemy Universal or may require additional steps or patches to work. You can check the compatibility list on the official website or on the PC Gaming Wiki for more information.</p> b2dd77e56b<br />
-<br />
-<br />
\ No newline at end of file
diff --git a/spaces/tioseFevbu/cartoon-converter/scripts/Descargar Mybusiness Pos 2011 Con Crackl.md b/spaces/tioseFevbu/cartoon-converter/scripts/Descargar Mybusiness Pos 2011 Con Crackl.md
deleted file mode 100644
index b23356c7b8474b0e533ab3c6c0bb439050d0385d..0000000000000000000000000000000000000000
--- a/spaces/tioseFevbu/cartoon-converter/scripts/Descargar Mybusiness Pos 2011 Con Crackl.md	
+++ /dev/null
@@ -1,25 +0,0 @@
-<br />
-<h1>¿Cómo descargar e instalar Mybusiness Pos 2011 con crack?</h1>
-<p>Mybusiness Pos 2011 es un software de punto de venta que te permite gestionar tu negocio de forma fácil y eficiente. Con este programa podrás controlar el inventario, las ventas, los clientes, los proveedores, los reportes y mucho más. Además, cuenta con una interfaz amigable y compatible con diversos dispositivos como impresoras, lectores de código de barras, cajones de dinero y básculas.</p>
-<h2>Descargar Mybusiness Pos 2011 Con Crackl</h2><br /><p><b><b>DOWNLOAD</b> &gt; <a href="https://urlcod.com/2uHwpO">https://urlcod.com/2uHwpO</a></b></p><br /><br />
-<p>Si quieres descargar e instalar Mybusiness Pos 2011 con crack, es decir, sin necesidad de pagar una licencia, te explicamos los pasos que debes seguir:</p>
-<ol>
-<li>Descarga el instalador del programa desde el siguiente enlace: <a href="https://mega.nz/folder/KNV2FKIR#K6yyi...">Instalador punto de venta</a>. Este archivo contiene el programa y el generador de licencias.</li>
-<li>Descomprime el archivo ZIP y ejecuta el instalador como administrador. Sigue las instrucciones que aparecen en pantalla para completar la instalación.</li>
-<li>Una vez instalado el programa, abre el generador de licencias que se encuentra en la carpeta "Crack". Ingresa tu nombre y tu correo electrónico y haz clic en "Generar". Copia el código que se genera.</li>
-<li>Abre el programa Mybusiness Pos 2011 y haz clic en "Activar". Pega el código que copiaste en el campo "Licencia" y haz clic en "Activar". El programa quedará activado y listo para usar.</li>
-</ol>
-<p>Así de fácil puedes descargar e instalar Mybusiness Pos 2011 con crack. Recuerda que este método no es legal ni seguro, ya que puede traer problemas con la ley o con virus informáticos. Te recomendamos que adquieras una licencia original del programa desde su página oficial: <a href="https://www.mybusinesspos.com/">MyBusiness POS</a>.</p>
-
-<p>Mybusiness Pos 2011 es un software de punto de venta que te ofrece muchas ventajas para tu negocio. Algunas de ellas son:</p>
-<ul>
-<li>Te permite llevar un control detallado de tu inventario, con alertas de stock mínimo, máximos y mínimos por producto, entradas y salidas de mercancía, etc.</li>
-<li>Te ayuda a mejorar el servicio al cliente, con un sistema de facturación rápida y sencilla, un módulo de fidelización de clientes, un historial de compras y devoluciones, etc.</li>
-<li>Te facilita la administración de tu negocio, con reportes e indicadores de ventas, utilidades, costos, impuestos, etc. Además, puedes exportar los datos a Excel o PDF para su análisis.</li>
-<li>Te permite integrar tu negocio con otros servicios como bancos, tarjetas de crédito, plataformas de comercio electrónico, etc.</li>
-<li>Te ofrece seguridad y respaldo de tu información, con un sistema de encriptación y protección de datos, una opción de copia de seguridad y restauración, etc.</li>
-</ul>
-<p>Como puedes ver, Mybusiness Pos 2011 es un software de punto de venta que te brinda todo lo que necesitas para gestionar tu negocio de forma eficiente y rentable. Si quieres conocer más sobre este programa o adquirir una licencia original, visita su página oficial: <a href="https://www.mybusinesspos.com/">MyBusiness POS</a>.</p>
-<p></p> 7b8c122e87<br />
-<br />
-<br />
\ No newline at end of file
diff --git a/spaces/tioseFevbu/cartoon-converter/scripts/It Perfectly Normal Full Pdf 136.md b/spaces/tioseFevbu/cartoon-converter/scripts/It Perfectly Normal Full Pdf 136.md
deleted file mode 100644
index df55fe3beec173ede373dfd627b746655222a010..0000000000000000000000000000000000000000
--- a/spaces/tioseFevbu/cartoon-converter/scripts/It Perfectly Normal Full Pdf 136.md	
+++ /dev/null
@@ -1,22 +0,0 @@
-<br />
-<h1>It's Perfectly Normal: A Comprehensive Book on Sexuality for Children</h1>
-
-<p>If you are looking for a book that covers everything from puberty to sexual health, you might want to check out <strong>It's Perfectly Normal</strong> by Robie H. Harris and Michael Emberley. This book is a <strong>trusted resource</strong> that has been <strong>updated</strong> with the latest information and language on sex, sexuality, bodies, and puberty. It also features <strong>colorful illustrations</strong> that are playful and realistic, showing the diversity of human bodies and experiences.</p>
-
-<p><strong>It's Perfectly Normal</strong> is designed for children 10 and older, but it can also be helpful for parents, teachers, librarians, and health professionals who want to <strong>educate</strong> and <strong>support</strong> young people as they grow up. The book answers nearly every imaginable question about sex, from conception and birth control to AIDS and adoption. It also explores topics such as gender identity, sexual orientation, relationships, consent, abuse, and online safety.</p>
-<h2>it perfectly normal full pdf 136</h2><br /><p><b><b>Download</b> &#10084; <a href="https://urlcod.com/2uHw2U">https://urlcod.com/2uHw2U</a></b></p><br /><br />
-
-<p>The book has won multiple <strong>awards</strong> and <strong>praise</strong> for its accurate and inclusive approach to sexual health. It has also been translated into 27 languages and used in 25 countries around the world. However, it has also been a source of <strong>controversy</strong> and <strong>censorship</strong> because of its graphic images and frank discussions of sex. Some people consider it inappropriate or offensive for the targeted age range.</p>
-
-<p>If you want to read <strong>It's Perfectly Normal</strong>, you can find it in many libraries and bookstores. You can also download a full PDF version of the book online. However, be aware that some websites may offer illegal or unsafe downloads that could harm your device or expose your personal information. To avoid this, make sure you use a reputable and secure website that offers legal downloads of the book.</p>
-
-<p><strong>It's Perfectly Normal</strong> is a book that aims to <strong>inform</strong>, <strong>reassure</strong>, and <strong>empower</strong> young people about their sexuality and their bodies. It is a book that celebrates the fact that everyone is different and that each variation is perfectly normal.</p>
-<p></p>
-
-<p>One of the reasons why <strong>It's Perfectly Normal</strong> is so popular and useful is that it is based on <strong>scientific research</strong> and <strong>expert advice</strong>. The author, Robie H. Harris, is a former teacher and a renowned writer of children's books on sexuality. She has consulted with many doctors, nurses, psychologists, educators, and parents to make sure that the information in the book is accurate, up-to-date, and appropriate for the intended audience. She has also received feedback from young readers themselves, who have shared their questions, concerns, and opinions about the book.</p>
-
-<p>The illustrator, Michael Emberley, is also a well-known children's book author and artist. He has worked with Harris on several other books on sexuality, such as <em>It's So Amazing!</em> and <em>It's Not the Stork!</em>. He has used his artistic skills to create illustrations that are <strong>funny</strong>, <strong>friendly</strong>, and <strong>informative</strong>. He has also made sure that the illustrations reflect the diversity of people's skin colors, body shapes, sizes, and abilities. He has also included some cartoon characters, such as a bird and a bee, who provide additional commentary and humor throughout the book.</p>
-
-<p><strong>It's Perfectly Normal</strong> is not only a book about sex, but also a book about <strong>life</strong>. It helps young people understand how their bodies change and grow, how their feelings and emotions develop, how their relationships with others evolve, and how their choices and actions affect their health and happiness. It also encourages young people to respect themselves and others, to communicate honestly and kindly, to seek help when they need it, and to enjoy their sexuality in a safe and responsible way.</p> 7b8c122e87<br />
-<br />
-<br />
\ No newline at end of file
diff --git a/spaces/tomofi/MMOCR/configs/textrecog/robust_scanner/README.md b/spaces/tomofi/MMOCR/configs/textrecog/robust_scanner/README.md
deleted file mode 100644
index 60ea38e546bc8ec2bdb451c3c5c155812927170c..0000000000000000000000000000000000000000
--- a/spaces/tomofi/MMOCR/configs/textrecog/robust_scanner/README.md
+++ /dev/null
@@ -1,61 +0,0 @@
-# RobustScanner
-
->[RobustScanner: Dynamically Enhancing Positional Clues for Robust Text Recognition](https://arxiv.org/abs/2007.07542)
-
-<!-- [ALGORITHM] -->
-
-## Abstract
-
-The attention-based encoder-decoder framework has recently achieved impressive results for scene text recognition, and many variants have emerged with improvements in recognition quality. However, it performs poorly on contextless texts (e.g., random character sequences) which is unacceptable in most of real application scenarios. In this paper, we first deeply investigate the decoding process of the decoder. We empirically find that a representative character-level sequence decoder utilizes not only context information but also positional information. Contextual information, which the existing approaches heavily rely on, causes the problem of attention drift. To suppress such side-effect, we propose a novel position enhancement branch, and dynamically fuse its outputs with those of the decoder attention module for scene text recognition. Specifically, it contains a position aware module to enable the encoder to output feature vectors encoding their own spatial positions, and an attention module to estimate glimpses using the positional clue (i.e., the current decoding time step) only. The dynamic fusion is conducted for more robust feature via an element-wise gate mechanism. Theoretically, our proposed method, dubbed \emph{RobustScanner}, decodes individual characters with dynamic ratio between context and positional clues, and utilizes more positional ones when the decoding sequences with scarce context, and thus is robust and practical. Empirically, it has achieved new state-of-the-art results on popular regular and irregular text recognition benchmarks while without much performance drop on contextless benchmarks, validating its robustness in both contextual and contextless application scenarios.
-
-<div align=center>
-<img src="https://user-images.githubusercontent.com/22607038/142798010-eee8795e-8cda-4a7f-a81d-ff9c94af58dc.png"/>
-</div>
-
-## Dataset
-
-### Train Dataset
-
-|  trainset  | instance_num | repeat_num |          source          |
-| :--------: | :----------: | :--------: | :----------------------: |
-| icdar_2011 |     3567     |     20     |           real           |
-| icdar_2013 |     848      |     20     |           real           |
-| icdar2015  |     4468     |     20     |           real           |
-| coco_text  |    42142     |     20     |           real           |
-|   IIIT5K   |     2000     |     20     |           real           |
-| SynthText  |   2400000    |     1      |          synth           |
-|  SynthAdd  |   1216889    |     1      | synth, 1.6m in [[1]](#1) |
-|   Syn90k   |   2400000    |     1      |          synth           |
-
-### Test Dataset
-
-| testset | instance_num |            type             |
-| :-----: | :----------: | :-------------------------: |
-| IIIT5K  |     3000     |           regular           |
-|   SVT   |     647      |           regular           |
-|  IC13   |     1015     |           regular           |
-|  IC15   |     2077     |          irregular          |
-|  SVTP   |     645      | irregular, 639 in [[1]](#1) |
-|  CT80   |     288      |          irregular          |
-
-## Results and Models
-
-|                                     Methods                                     | GPUs  |        | Regular Text |       |       |       | Irregular Text |       |                                                                                                   download                                                                                                    |
-| :-----------------------------------------------------------------------------: | :---: | :----: | :----------: | :---: | :---: | :---: | :------------: | :---: | :-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------: |
-|                                                                                 |       | IIIT5K |     SVT      | IC13  |       | IC15  |      SVTP      | CT80  |
-| [RobustScanner](configs/textrecog/robust_scanner/robustscanner_r31_academic.py) |  16   |  95.1  |     89.2     | 93.1  |       | 77.8  |      80.3      | 90.3  | [model](https://download.openmmlab.com/mmocr/textrecog/robustscanner/robustscanner_r31_academic-5f05874f.pth) \| [log](https://download.openmmlab.com/mmocr/textrecog/robustscanner/20210401_170932.log.json) |
-
-## References
-
-<a id="1">[1]</a> Li, Hui and Wang, Peng and Shen, Chunhua and Zhang, Guyu. Show, attend and read: A simple and strong baseline for irregular text recognition. In AAAI 2019.
-
-## Citation
-
-```bibtex
-@inproceedings{yue2020robustscanner,
-  title={RobustScanner: Dynamically Enhancing Positional Clues for Robust Text Recognition},
-  author={Yue, Xiaoyu and Kuang, Zhanghui and Lin, Chenhao and Sun, Hongbin and Zhang, Wayne},
-  booktitle={European Conference on Computer Vision},
-  year={2020}
-}
-```
diff --git a/spaces/tomofi/MaskTextSpotterV3-OCR/maskrcnn_benchmark/modeling/roi_heads/roi_heads.py b/spaces/tomofi/MaskTextSpotterV3-OCR/maskrcnn_benchmark/modeling/roi_heads/roi_heads.py
deleted file mode 100644
index 899b3a27515079606278030e1ffbd98148718ed6..0000000000000000000000000000000000000000
--- a/spaces/tomofi/MaskTextSpotterV3-OCR/maskrcnn_benchmark/modeling/roi_heads/roi_heads.py
+++ /dev/null
@@ -1,58 +0,0 @@
-#!/usr/bin/env python3
-# Copyright (c) Facebook, Inc. and its affiliates. All Rights Reserved.
-import torch
-
-from .box_head.box_head import build_roi_box_head
-from .mask_head.mask_head import build_roi_mask_head
-
-
-class CombinedROIHeads(torch.nn.ModuleDict):
-    """
-    Combines a set of individual heads (for box prediction or masks) into a single
-    head.
-    """
-
-    def __init__(self, cfg, heads):
-        super(CombinedROIHeads, self).__init__(heads)
-        self.cfg = cfg.clone()
-        if cfg.MODEL.MASK_ON and cfg.MODEL.ROI_MASK_HEAD.SHARE_BOX_FEATURE_EXTRACTOR:
-            self.mask.feature_extractor = self.box.feature_extractor
-
-    def forward(self, features, proposals, targets=None):
-        losses = {}
-        # TODO rename x to roi_box_features, if it doesn't increase memory consumption
-        x, detections, loss_box = self.box(features, proposals, targets)
-        losses.update(loss_box)
-        if self.cfg.MODEL.MASK_ON or self.cfg.SEQUENCE.SEQ_ON:
-            mask_features = features
-            # optimization: during training, if we share the feature extractor between
-            # the box and the mask heads,
-            # then we can reuse the features already computed
-            if (
-                self.training
-                and self.cfg.MODEL.ROI_MASK_HEAD.SHARE_BOX_FEATURE_EXTRACTOR
-            ):
-                mask_features = x
-            # During training, self.box() will return
-            # the unaltered proposals as "detections"
-            # this makes the API consistent during training and testing
-            x, detections, loss_mask = self.mask(mask_features, detections, targets)
-            if loss_mask is not None:
-                losses.update(loss_mask)
-        return x, detections, losses
-
-
-def build_roi_heads(cfg):
-    # individually create the heads, that will be combined together
-    # afterwards
-    roi_heads = []
-    if not cfg.MODEL.RPN_ONLY:
-        roi_heads.append(("box", build_roi_box_head(cfg)))
-    if cfg.MODEL.MASK_ON or cfg.SEQUENCE.SEQ_ON:
-        roi_heads.append(("mask", build_roi_mask_head(cfg)))
-
-    # combine individual heads in a single module
-    if roi_heads:
-        roi_heads = CombinedROIHeads(cfg, roi_heads)
-
-    return roi_heads
diff --git a/spaces/tomofi/NDLOCR/src/ndl_layout/mmdetection/configs/_base_/models/faster_rcnn_r50_caffe_dc5.py b/spaces/tomofi/NDLOCR/src/ndl_layout/mmdetection/configs/_base_/models/faster_rcnn_r50_caffe_dc5.py
deleted file mode 100644
index 5089f0e33a5736a34435c6a3f37b996c32542c8c..0000000000000000000000000000000000000000
--- a/spaces/tomofi/NDLOCR/src/ndl_layout/mmdetection/configs/_base_/models/faster_rcnn_r50_caffe_dc5.py
+++ /dev/null
@@ -1,103 +0,0 @@
-# model settings
-norm_cfg = dict(type='BN', requires_grad=False)
-model = dict(
-    type='FasterRCNN',
-    pretrained='open-mmlab://detectron2/resnet50_caffe',
-    backbone=dict(
-        type='ResNet',
-        depth=50,
-        num_stages=4,
-        strides=(1, 2, 2, 1),
-        dilations=(1, 1, 1, 2),
-        out_indices=(3, ),
-        frozen_stages=1,
-        norm_cfg=norm_cfg,
-        norm_eval=True,
-        style='caffe'),
-    rpn_head=dict(
-        type='RPNHead',
-        in_channels=2048,
-        feat_channels=2048,
-        anchor_generator=dict(
-            type='AnchorGenerator',
-            scales=[2, 4, 8, 16, 32],
-            ratios=[0.5, 1.0, 2.0],
-            strides=[16]),
-        bbox_coder=dict(
-            type='DeltaXYWHBBoxCoder',
-            target_means=[.0, .0, .0, .0],
-            target_stds=[1.0, 1.0, 1.0, 1.0]),
-        loss_cls=dict(
-            type='CrossEntropyLoss', use_sigmoid=True, loss_weight=1.0),
-        loss_bbox=dict(type='L1Loss', loss_weight=1.0)),
-    roi_head=dict(
-        type='StandardRoIHead',
-        bbox_roi_extractor=dict(
-            type='SingleRoIExtractor',
-            roi_layer=dict(type='RoIAlign', output_size=7, sampling_ratio=0),
-            out_channels=2048,
-            featmap_strides=[16]),
-        bbox_head=dict(
-            type='Shared2FCBBoxHead',
-            in_channels=2048,
-            fc_out_channels=1024,
-            roi_feat_size=7,
-            num_classes=80,
-            bbox_coder=dict(
-                type='DeltaXYWHBBoxCoder',
-                target_means=[0., 0., 0., 0.],
-                target_stds=[0.1, 0.1, 0.2, 0.2]),
-            reg_class_agnostic=False,
-            loss_cls=dict(
-                type='CrossEntropyLoss', use_sigmoid=False, loss_weight=1.0),
-            loss_bbox=dict(type='L1Loss', loss_weight=1.0))),
-    # model training and testing settings
-    train_cfg=dict(
-        rpn=dict(
-            assigner=dict(
-                type='MaxIoUAssigner',
-                pos_iou_thr=0.7,
-                neg_iou_thr=0.3,
-                min_pos_iou=0.3,
-                match_low_quality=True,
-                ignore_iof_thr=-1),
-            sampler=dict(
-                type='RandomSampler',
-                num=256,
-                pos_fraction=0.5,
-                neg_pos_ub=-1,
-                add_gt_as_proposals=False),
-            allowed_border=0,
-            pos_weight=-1,
-            debug=False),
-        rpn_proposal=dict(
-            nms_pre=12000,
-            max_per_img=2000,
-            nms=dict(type='nms', iou_threshold=0.7),
-            min_bbox_size=0),
-        rcnn=dict(
-            assigner=dict(
-                type='MaxIoUAssigner',
-                pos_iou_thr=0.5,
-                neg_iou_thr=0.5,
-                min_pos_iou=0.5,
-                match_low_quality=False,
-                ignore_iof_thr=-1),
-            sampler=dict(
-                type='RandomSampler',
-                num=512,
-                pos_fraction=0.25,
-                neg_pos_ub=-1,
-                add_gt_as_proposals=True),
-            pos_weight=-1,
-            debug=False)),
-    test_cfg=dict(
-        rpn=dict(
-            nms=dict(type='nms', iou_threshold=0.7),
-            nms_pre=6000,
-            max_per_img=1000,
-            min_bbox_size=0),
-        rcnn=dict(
-            score_thr=0.05,
-            nms=dict(type='nms', iou_threshold=0.5),
-            max_per_img=100)))
diff --git a/spaces/tomofi/NDLOCR/src/ndl_layout/mmdetection/configs/pascal_voc/faster_rcnn_r50_fpn_1x_voc0712_cocofmt.py b/spaces/tomofi/NDLOCR/src/ndl_layout/mmdetection/configs/pascal_voc/faster_rcnn_r50_fpn_1x_voc0712_cocofmt.py
deleted file mode 100644
index 12eee2c1ecdaa5f9e84a3bd2084b00493f2f76c0..0000000000000000000000000000000000000000
--- a/spaces/tomofi/NDLOCR/src/ndl_layout/mmdetection/configs/pascal_voc/faster_rcnn_r50_fpn_1x_voc0712_cocofmt.py
+++ /dev/null
@@ -1,75 +0,0 @@
-_base_ = [
-    '../_base_/models/faster_rcnn_r50_fpn.py', '../_base_/datasets/voc0712.py',
-    '../_base_/default_runtime.py'
-]
-model = dict(roi_head=dict(bbox_head=dict(num_classes=20)))
-
-CLASSES = ('aeroplane', 'bicycle', 'bird', 'boat', 'bottle', 'bus', 'car',
-           'cat', 'chair', 'cow', 'diningtable', 'dog', 'horse', 'motorbike',
-           'person', 'pottedplant', 'sheep', 'sofa', 'train', 'tvmonitor')
-
-# dataset settings
-dataset_type = 'CocoDataset'
-data_root = 'data/VOCdevkit/'
-img_norm_cfg = dict(
-    mean=[123.675, 116.28, 103.53], std=[58.395, 57.12, 57.375], to_rgb=True)
-train_pipeline = [
-    dict(type='LoadImageFromFile'),
-    dict(type='LoadAnnotations', with_bbox=True),
-    dict(type='Resize', img_scale=(1000, 600), keep_ratio=True),
-    dict(type='RandomFlip', flip_ratio=0.5),
-    dict(type='Normalize', **img_norm_cfg),
-    dict(type='Pad', size_divisor=32),
-    dict(type='DefaultFormatBundle'),
-    dict(type='Collect', keys=['img', 'gt_bboxes', 'gt_labels']),
-]
-test_pipeline = [
-    dict(type='LoadImageFromFile'),
-    dict(
-        type='MultiScaleFlipAug',
-        img_scale=(1000, 600),
-        flip=False,
-        transforms=[
-            dict(type='Resize', keep_ratio=True),
-            dict(type='RandomFlip'),
-            dict(type='Normalize', **img_norm_cfg),
-            dict(type='Pad', size_divisor=32),
-            dict(type='ImageToTensor', keys=['img']),
-            dict(type='Collect', keys=['img']),
-        ])
-]
-data = dict(
-    samples_per_gpu=2,
-    workers_per_gpu=2,
-    train=dict(
-        type='RepeatDataset',
-        times=3,
-        dataset=dict(
-            type=dataset_type,
-            ann_file='data/voc0712_trainval.json',
-            img_prefix='data/VOCdevkit',
-            pipeline=train_pipeline,
-            classes=CLASSES)),
-    val=dict(
-        type=dataset_type,
-        ann_file='data/voc07_test.json',
-        img_prefix='data/VOCdevkit',
-        pipeline=test_pipeline,
-        classes=CLASSES),
-    test=dict(
-        type=dataset_type,
-        ann_file='data/voc07_test.json',
-        img_prefix='data/VOCdevkit',
-        pipeline=test_pipeline,
-        classes=CLASSES))
-evaluation = dict(interval=1, metric='bbox')
-
-# optimizer
-optimizer = dict(type='SGD', lr=0.01, momentum=0.9, weight_decay=0.0001)
-optimizer_config = dict(grad_clip=None)
-# learning policy
-# actual epoch = 3 * 3 = 9
-lr_config = dict(policy='step', step=[3])
-# runtime settings
-runner = dict(
-    type='EpochBasedRunner', max_epochs=4)  # actual epoch = 4 * 3 = 12
diff --git a/spaces/tomofi/NDLOCR/src/text_recognition/deep-text-recognition-benchmark/create_lmdb_dataset.py b/spaces/tomofi/NDLOCR/src/text_recognition/deep-text-recognition-benchmark/create_lmdb_dataset.py
deleted file mode 100644
index a58d1374efe6c2b6427e5b6a253aad15e02942a9..0000000000000000000000000000000000000000
--- a/spaces/tomofi/NDLOCR/src/text_recognition/deep-text-recognition-benchmark/create_lmdb_dataset.py
+++ /dev/null
@@ -1,87 +0,0 @@
-""" a modified version of CRNN torch repository https://github.com/bgshih/crnn/blob/master/tool/create_dataset.py """
-
-import fire
-import os
-import lmdb
-import cv2
-
-import numpy as np
-
-
-def checkImageIsValid(imageBin):
-    if imageBin is None:
-        return False
-    imageBuf = np.frombuffer(imageBin, dtype=np.uint8)
-    img = cv2.imdecode(imageBuf, cv2.IMREAD_GRAYSCALE)
-    imgH, imgW = img.shape[0], img.shape[1]
-    if imgH * imgW == 0:
-        return False
-    return True
-
-
-def writeCache(env, cache):
-    with env.begin(write=True) as txn:
-        for k, v in cache.items():
-            txn.put(k, v)
-
-
-def createDataset(inputPath, gtFile, outputPath, checkValid=True):
-    """
-    Create LMDB dataset for training and evaluation.
-    ARGS:
-        inputPath  : input folder path where starts imagePath
-        outputPath : LMDB output path
-        gtFile     : list of image path and label
-        checkValid : if true, check the validity of every image
-    """
-    os.makedirs(outputPath, exist_ok=True)
-    env = lmdb.open(outputPath, map_size=1099511627776)
-    cache = {}
-    cnt = 1
-
-    with open(gtFile, 'r', encoding='utf-8') as data:
-        datalist = data.readlines()
-
-    nSamples = len(datalist)
-    for i in range(nSamples):
-        imagePath, label = datalist[i].strip('\n').split('\t')
-        imagePath = os.path.join(inputPath, imagePath)
-
-        # # only use alphanumeric data
-        # if re.search('[^a-zA-Z0-9]', label):
-        #     continue
-
-        if not os.path.exists(imagePath):
-            print('%s does not exist' % imagePath)
-            continue
-        with open(imagePath, 'rb') as f:
-            imageBin = f.read()
-        if checkValid:
-            try:
-                if not checkImageIsValid(imageBin):
-                    print('%s is not a valid image' % imagePath)
-                    continue
-            except:
-                print('error occured', i)
-                with open(outputPath + '/error_image_log.txt', 'a') as log:
-                    log.write('%s-th image data occured error\n' % str(i))
-                continue
-
-        imageKey = 'image-%09d'.encode() % cnt
-        labelKey = 'label-%09d'.encode() % cnt
-        cache[imageKey] = imageBin
-        cache[labelKey] = label.encode()
-
-        if cnt % 1000 == 0:
-            writeCache(env, cache)
-            cache = {}
-            print('Written %d / %d' % (cnt, nSamples))
-        cnt += 1
-    nSamples = cnt-1
-    cache['num-samples'.encode()] = str(nSamples).encode()
-    writeCache(env, cache)
-    print('Created dataset with %d samples' % nSamples)
-
-
-if __name__ == '__main__':
-    fire.Fire(createDataset)
diff --git a/spaces/tsi-org/tts/app.py b/spaces/tsi-org/tts/app.py
deleted file mode 100644
index 51cc5b4094b44c30bdc9bf66546e701a5d4c3099..0000000000000000000000000000000000000000
--- a/spaces/tsi-org/tts/app.py
+++ /dev/null
@@ -1,163 +0,0 @@
-import random 
-import gradio as gr 
-import numpy as np 
-from elevenlabs import voices, generate, set_api_key, UnauthenticatedRateLimitError
-
-def pad_buffer(audio):
-    # Pad buffer to multiple of 2 bytes
-    buffer_size = len(audio)
-    element_size = np.dtype(np.int16).itemsize
-    if buffer_size % element_size != 0:
-        audio = audio + b'\0' * (element_size - (buffer_size % element_size))
-    return audio 
-
-def generate_voice(text, voice_name):
-    try:
-        audio = generate(
-            text[:250], # Limit to 250 characters
-            voice=voice_name, 
-            model="eleven_multilingual_v2"
-        )
-        return (44100, np.frombuffer(pad_buffer(audio), dtype=np.int16))
-    except UnauthenticatedRateLimitError as e:
-        raise gr.Error("Thanks for trying out ElevenLabs TTS! You've reached the free tier limit. Please provide an API key to continue.") 
-    except Exception as e:
-        raise gr.Error(e)
-    
-# Login function for authentication
-def custom_auth(username, password):
-    return password == "aitutor"
-
-
-badges = """
-"""
-menu = """
-<style>
-    /* Existing styles */
-    .gradio-container-3-40-1 .prose a {
-        color: #ffffff!important;
-        text-decoration: auto!important;
-    }
-    .menu-bar {
-        display: flex;
-        justify-content: space-between;
-        align-items: center;
-        background-color: #333;
-        padding: 10px;
-        color: white;
-        font-family: 'sans-serif';
-    }
-    .menu-bar a, .menu-bar a:visited {
-        color: white;
-        text-decoration: none;
-    }
-    .menu-icon {
-        font-size: 24px;
-        background-color: #ffffff;
-        border-radius: 50%;
-        padding: 5px;
-    }
-    .menu-items {
-        display: flex;
-        gap: 15px;
-        color: white;
-    }
-    .menu-item {
-        padding: 8px 16px;
-        background-color: #555;
-        border-radius: 4px;
-        transition: background-color 0.3s;
-        font-weight: bold;
-        font-size: 12px;
-    }
-    .menu-item:hover {
-        background-color: #777;
-    }
-    /* Responsive styles for mobile */
-    @media (max-width: 768px) {
-        .menu-item {
-            font-size: 12px;  /* Shrink text size */
-        }
-        .menu-icon {
-            font-size: 18px;  /* Shrink icon size */
-        }
-    }
-</style>
-<div class="menu-bar">
-    <a href="#" class="menu-icon">🎵</a>
-    <div class="menu-items">
-        <span class="menu-item"><a href="#">Dashboard</a></span>
-        <span class="menu-item"><a href="#">Premium</a></span>
-        <span class="menu-item"><a href="#">Account</a></span>
-        <span class="menu-item"><a href="#">Voices</a></span>
-    </div>
-</div>
-"""
-
-description = """
-<style>
-    .notification {
-        text-align: left;  /* Left-align the text */
-        background-color: #ffffff;  /* White Background */
-        color: #000;  /* Black text */
-        padding: 20px;  /* Padding */
-        margin: 20px;  /* Margin */
-        margin-bottom: 40px;  /* Additional space below the notification */
-        border: 2px solid #000000;  /* Black border */
-        border-radius: 20px;  /* Rounded corners */
-        font-size: 18px;  /* Font size */
-        font-family: 'Arial', sans-serif;  /* Font family */
-        box-shadow: 0 4px 8px 0 rgba(0,0,0,0.1);  /* Subtle box shadow for depth */
-    }
-</style>
-<div class="notification">
-    Welcome to Text to Voice, single foundational model supporting 28 languages including: English, Chinese, Spanish, Hindi, Portuguese, French, German, Japanese, Arabic, Korean, Indonesian, Italian, Dutch, Turkish, Polish, Swedish, Filipino, Malay, Romanian, Ukrainian, Greek, Czech, Danish, Finnish, Bulgarian, Croatian, Slovak, and Tamil.
-</div>
-"""
-
-
-
-with gr.Blocks() as block:
-    gr.Markdown('')
-    gr.Markdown(menu)
-    gr.Markdown(badges)
-    gr.Markdown(description)
-
-    input_text = gr.Textbox(
-        label="Input Text (250 characters max)",
-        lines=2,
-        value="Hello! 你好! Hola! नमस्ते! Bonjour! こんにちは! مرحبا! 안녕하세요! Ciao! Cześć! Привіт! Γειά σας! Здравей! வணக்கம்!",
-        elem_id="input_text"
-    )
-
-    all_voices = voices()
-    input_voice = gr.Dropdown(
-        [voice.name for voice in all_voices],
-        value="Bella",
-        label="Voice",
-        elem_id="input_voice"
-    )
-
-    run_button = gr.Button(
-        text="Generate Voice",
-        type="button"
-    )
-
-    out_audio = gr.Audio(
-        label="Generated Voice",
-        type="numpy",
-        elem_id="out_audio",
-        format="mp3"
-    )
-
-    inputs = [input_text, input_voice]
-    outputs = [out_audio]
-
-    run_button.click(
-        fn=generate_voice,
-        inputs=inputs,
-        outputs=outputs,
-        queue=True
-    )
-
-block.queue(concurrency_count=5).launch(debug=True, auth=custom_auth)
\ No newline at end of file
diff --git a/spaces/ttt246/brain/Brain/src/gradio_debug.py b/spaces/ttt246/brain/Brain/src/gradio_debug.py
deleted file mode 100644
index a1f1ce0e8eefeca9f35d856644c6fc81bafed6dd..0000000000000000000000000000000000000000
--- a/spaces/ttt246/brain/Brain/src/gradio_debug.py
+++ /dev/null
@@ -1,47 +0,0 @@
-"""gradio implementaion"""
-# import gradio as gr
-# import requests
-# import json
-# from gradio.components import Textbox, Number
-#
-# DEFAULT_UUID = "c40a09075d11940f"
-#
-#
-# def gradio_send_notification(uuid: str, query: str):
-#     url = "http://localhost:7860/sendNotification"
-#     data = {
-#         "confs": {
-#             "openai_key": "",
-#             "pinecone_key": "",
-#             "pinecone_env": "",
-#             "firebase_key": "",
-#             "settings": {"temperature": 0.6},
-#             "token": "eSyP3i7ITZuq8hWn2qutTl:APA91bH1FtWkaTSJwuX4WKWAl3Q-ZFyrOw4UtMP4IfwuvNrHOThH7EvEGIhtguilLRyQNlLiXatEN0xntHAc8bbKobSGjge3wxIHlspbIWY_855CzONqaVdl3y3zOmgKZNnuhYi4gwbh",
-#             "uuid": uuid,
-#         },
-#         "message": query,
-#     }
-#
-#     response = requests.post(
-#         url, data=json.dumps(data), headers={"Content-Type": "application/json"}
-#     )
-#     response = response.json()
-#     return json.dumps(response["result"]), response["status_code"]
-#
-#
-# debug_send_notification = gr.Interface(
-#     fn=gradio_send_notification,
-#     inputs=[
-#         Textbox(
-#             label="UUID",
-#             placeholder="Please input your UUID.",
-#             value="c40a09075d11940f",
-#         ),
-#         Textbox(label="query", placeholder="Please input your prompt."),
-#     ],
-#     outputs=[
-#         Textbox(label="Result"),
-#         Number(label="Status Code"),
-#     ],
-#     allow_flagging="never",
-# )
diff --git a/spaces/ucalyptus/PTI/torch_utils/ops/__init__.py b/spaces/ucalyptus/PTI/torch_utils/ops/__init__.py
deleted file mode 100644
index ece0ea08fe2e939cc260a1dafc0ab5b391b773d9..0000000000000000000000000000000000000000
--- a/spaces/ucalyptus/PTI/torch_utils/ops/__init__.py
+++ /dev/null
@@ -1,9 +0,0 @@
-# Copyright (c) 2021, NVIDIA CORPORATION.  All rights reserved.
-#
-# NVIDIA CORPORATION and its licensors retain all intellectual property
-# and proprietary rights in and to this software, related documentation
-# and any modifications thereto.  Any use, reproduction, disclosure or
-# distribution of this software and related documentation without an express
-# license agreement from NVIDIA CORPORATION is strictly prohibited.
-
-# empty
diff --git a/spaces/ulysses115/Nogizaka46-so/vdecoder/hifigan/env.py b/spaces/ulysses115/Nogizaka46-so/vdecoder/hifigan/env.py
deleted file mode 100644
index 2bdbc95d4f7a8bad8fd4f5eef657e2b51d946056..0000000000000000000000000000000000000000
--- a/spaces/ulysses115/Nogizaka46-so/vdecoder/hifigan/env.py
+++ /dev/null
@@ -1,15 +0,0 @@
-import os
-import shutil
-
-
-class AttrDict(dict):
-    def __init__(self, *args, **kwargs):
-        super(AttrDict, self).__init__(*args, **kwargs)
-        self.__dict__ = self
-
-
-def build_env(config, config_name, path):
-    t_path = os.path.join(path, config_name)
-    if config != t_path:
-        os.makedirs(path, exist_ok=True)
-        shutil.copyfile(config, os.path.join(path, config_name))
diff --git a/spaces/umichVision/virtex-redcaps/virtex/data/datasets/masked_lm.py b/spaces/umichVision/virtex-redcaps/virtex/data/datasets/masked_lm.py
deleted file mode 100644
index 7721321a8dce4e35ed962f894d6c4f6b4c22b8cf..0000000000000000000000000000000000000000
--- a/spaces/umichVision/virtex-redcaps/virtex/data/datasets/masked_lm.py
+++ /dev/null
@@ -1,132 +0,0 @@
-import math
-import os
-import random
-from typing import Callable, Dict, List
-
-import albumentations as alb
-import numpy as np
-import torch
-from torch.utils.data import Dataset
-
-from virtex.data.readers import LmdbReader
-from virtex.data.tokenizers import SentencePieceBPETokenizer
-from virtex.data import transforms as T
-
-
-class MaskedLmDataset(Dataset):
-    def __init__(
-        self,
-        data_root: str,
-        split: str,
-        tokenizer: SentencePieceBPETokenizer,
-        image_transform: Callable = T.DEFAULT_IMAGE_TRANSFORM,
-        mask_proportion: float = 0.15,
-        mask_probability: float = 0.80,
-        replace_probability: float = 0.10,
-        max_caption_length: int = 30,
-        use_single_caption: bool = False,
-        percentage: float = 100.0,
-    ):
-        lmdb_path = os.path.join(data_root, f"serialized_{split}.lmdb")
-        self.reader = LmdbReader(lmdb_path, percentage=percentage)
-
-        self.image_transform = image_transform
-        self.caption_transform = alb.Compose(
-            [
-                T.NormalizeCaption(),
-                T.TokenizeCaption(tokenizer),
-                T.TruncateCaptionTokens(max_caption_length),
-            ]
-        )
-        self.use_single_caption = use_single_caption
-        self.padding_idx = tokenizer.token_to_id("<unk>")
-
-        # Handles to commonly used variables for word masking.
-        self._vocab_size = tokenizer.get_vocab_size()
-        self._mask_index = tokenizer.token_to_id("[MASK]")
-        self._mask_proportion = mask_proportion
-        self._mask_prob = mask_probability
-        self._repl_prob = replace_probability
-
-    def __len__(self):
-        return len(self.reader)
-
-    def __getitem__(self, idx: int) -> Dict[str, torch.Tensor]:
-
-        image_id, image, captions = self.reader[idx]
-
-        # Pick a random caption or first caption and process (transform) it.
-        if self.use_single_caption:
-            caption = captions[0]
-        else:
-            caption = random.choice(captions)
-
-        # Transform image-caption pair and convert image from HWC to CHW format.
-        # Pass in caption to image_transform due to paired horizontal flip.
-        # Caption won't be tokenized/processed here.
-        image_caption = self.image_transform(image=image, caption=caption)
-        image, caption = image_caption["image"], image_caption["caption"]
-        image = np.transpose(image, (2, 0, 1))
-
-        caption_tokens = self.caption_transform(caption=caption)["caption"]
-
-        # ---------------------------------------------------------------------
-        #  Mask some tokens randomly.
-        # ---------------------------------------------------------------------
-        masked_labels = [self.padding_idx] * len(caption_tokens)
-
-        # Indices in `caption_tokens` list to mask (minimum 1 index).
-        # Leave out first and last indices (boundary tokens).
-        tokens_to_mask: List[int] = random.sample(
-            list(range(1, len(caption_tokens) - 1)),
-            math.ceil((len(caption_tokens) - 2) * self._mask_proportion),
-        )
-        for i in tokens_to_mask:
-            # Whether to replace with [MASK] or random word.
-            # If only one token, always [MASK].
-            if len(tokens_to_mask) == 1:
-                masked_labels[i] = caption_tokens[i]
-                caption_tokens[i] = self._mask_index
-            else:
-                _flag: float = random.random()
-                if _flag <= self._mask_prob + self._repl_prob:
-                    if _flag <= self._mask_prob:
-                        masked_labels[i] = caption_tokens[i]
-                        caption_tokens[i] = self._mask_index
-                    else:
-                        caption_tokens[i] = self._random_token_index()
-        # ---------------------------------------------------------------------
-
-        return {
-            "image_id": torch.tensor(image_id, dtype=torch.long),
-            "image": torch.tensor(image, dtype=torch.float),
-            "caption_tokens": torch.tensor(caption_tokens, dtype=torch.long),
-            "masked_labels": torch.tensor(masked_labels, dtype=torch.long),
-            "caption_lengths": torch.tensor(len(caption_tokens), dtype=torch.long),
-        }
-
-    def collate_fn(
-        self, data: List[Dict[str, torch.Tensor]]
-    ) -> Dict[str, torch.Tensor]:
-
-        # Pad `caption_tokens` and `masked_labels` up to this length.
-        caption_tokens = torch.nn.utils.rnn.pad_sequence(
-            [d["caption_tokens"] for d in data],
-            batch_first=True,
-            padding_value=self.padding_idx,
-        )
-        masked_labels = torch.nn.utils.rnn.pad_sequence(
-            [d["masked_labels"] for d in data],
-            batch_first=True,
-            padding_value=self.padding_idx,
-        )
-        return {
-            "image_id": torch.stack([d["image_id"] for d in data], dim=0),
-            "image": torch.stack([d["image"] for d in data], dim=0),
-            "caption_tokens": caption_tokens,
-            "masked_labels": masked_labels,
-            "caption_lengths": torch.stack([d["caption_lengths"] for d in data]),
-        }
-
-    def _random_token_index(self) -> int:
-        return random.randint(0, self._vocab_size - 1)
diff --git a/spaces/usbethFlerru/sovits-modelsV2/example/Assassins Creed Black Flag Multiplayer Crack ((NEW)).md b/spaces/usbethFlerru/sovits-modelsV2/example/Assassins Creed Black Flag Multiplayer Crack ((NEW)).md
deleted file mode 100644
index 401938298c65f9fd2b3056059b274e45c1caadd0..0000000000000000000000000000000000000000
--- a/spaces/usbethFlerru/sovits-modelsV2/example/Assassins Creed Black Flag Multiplayer Crack ((NEW)).md	
+++ /dev/null
@@ -1,8 +0,0 @@
-<br />
-<p>assassin's creed made the familiar historical setting of the crusades a little less familiar for its players. the missions are easy to follow and the ships are easy to maneuver. the multiplayer mode is short and contains almost no tutorial. the tutorial that does exist is mostly for players who have never played a game of naval warfare before. the tutorial and the tutorial missions are perfect for a first-time player to get through, but veterans can use these missions to find their way around the multiplayer.</p>
-<p>ubisoft announced the inclusion of naval missions in <em>assassin's creed unity</em> in february. the decision was made to include naval missions to "put players in the most historically accurate vessels in assassin's creed history. from the <em>macedonian</em> galleys to the <em>spanish</em> galleons, players can fight on board these powerful ships and become a member of the assassin's brotherhood. </p>
-<h2>Assassin's Creed Black Flag Multiplayer Crack</h2><br /><p><b><b>Download</b> ->>->>->> <a href="https://urlcod.com/2uyWKC">https://urlcod.com/2uyWKC</a></b></p><br /><br />
-<p>in the making of <em>assassin's creed black flag</em>, ubisoft added an adventure mode for multiplayer. in this mode, players can play as any of the assassins and their boats. this means that players can play as ezio, aguilar, altair, haytham, saavedro, jack, or yusuf. there are 30 different ships to choose from, ranging from the larger ships, like galleons and carracks, to the smaller ones, like the galleasses.</p>
-<p>you can also download the assassin's creed black flag multiplayer crack, and get the game's online features working perfectly with fortnite. fortnite cross-play was added in the game's newest update, which also included the ability to link the multiplayer of black flag with players in other games. it appears that the two games are now sharing the same map, allowing players to seamlessly move from game to game.</p> 899543212b<br />
-<br />
-<br />
\ No newline at end of file
diff --git a/spaces/usbethFlerru/sovits-modelsV2/example/Basiccolor Display 5 Crack Mac and Cheese A Savory and Satisfying Treat.md b/spaces/usbethFlerru/sovits-modelsV2/example/Basiccolor Display 5 Crack Mac and Cheese A Savory and Satisfying Treat.md
deleted file mode 100644
index e587918c131f7f513d8ac5019365dfb38ed5d594..0000000000000000000000000000000000000000
--- a/spaces/usbethFlerru/sovits-modelsV2/example/Basiccolor Display 5 Crack Mac and Cheese A Savory and Satisfying Treat.md	
+++ /dev/null
@@ -1,6 +0,0 @@
-<h2>basiccolor display 5 crack mac and cheese</h2><br /><p><b><b>DOWNLOAD</b> &#10004;&#10004;&#10004; <a href="https://urlcod.com/2uyUAO">https://urlcod.com/2uyUAO</a></b></p><br /><br />
-<br />
- aaccfb2cb3<br />
-<br />
-<br />
-<p></p>
diff --git a/spaces/usbethFlerru/sovits-modelsV2/example/Deutz Serpic 2012.md b/spaces/usbethFlerru/sovits-modelsV2/example/Deutz Serpic 2012.md
deleted file mode 100644
index 369aad77d4a577c530262548ebf451f2911d7b14..0000000000000000000000000000000000000000
--- a/spaces/usbethFlerru/sovits-modelsV2/example/Deutz Serpic 2012.md	
+++ /dev/null
@@ -1,34 +0,0 @@
-<h2>Deutz Serpic 2012</h2><br /><p><b><b>Download File</b> &#10084; <a href="https://urlcod.com/2uyUNj">https://urlcod.com/2uyUNj</a></b></p><br /><br />
-
-Auslogics Roxio and Disc Dr - If you're looking to backup your MP3 music CDs and you have an older version of Roxio than 1.0 (which Roxio has discontinued support for), you can use DiscDr instead of iTunes or Roxio for free to backup CDs. It can also back up DVD or Blu-ray discs as well as a few other CD types.
-
-Afterburner 1.0.6 - Afterburner 1.0.6 is released, a few bug fixes have been made that you should check out. See the release notes for more details.
-
-The PicNic Trial Free Catalog - Designed as a tool to help users create and manage commercial catalogs for a small business using the text book approach of collaborative authoring, the PicNic Trial Free Catalog is a great tool for starting out with a small catalog. It works with Adobe Indesign and Acrobat and can be used in conjunction with your InDesign template for a more automated workflow.Image: Jussi Nukari / Lehtikuva
-
-Finland's governing National Coalition on Monday evening announced its Cabinet of 14 ministers.
-
-This is the most junior-level government that Finland has had since the fall of communism.
-
-The new government, headed by Center Party Prime Minister Juha Sipilä, will serve until the autumn.
-
-Some of the Cabinet members' portfolios have changed compared to the previous government led by Alexander Stubb, including the ministries of defence, justice, finance and foreign affairs.
-
-Päivi Räsänen (SDP) will remain in her position as Finnish Minister for European Union Affairs.
-
-The junior ministerial roles were allocated among the parties on the basis of a quota system, with the Social Democrats getting five portfolios and the Center Party getting three.
-
-The SDP, Finns Party and the Greens each got one portfolio.
-
-The outgoing government had a total of 19 ministers.
-
-More Cabinet changes expected
-
-All opposition parties have welcomed the new Cabinet and the coalition's decision to leave politics after the 2017 election.
-
-However, several issues still need to be resolved, including an ongoing reform of the Cabinet system and parliamentary rules, which will involve changing the size of the government.
-
-Some parties, such as the Centre Party and the Finnish Centre, have urged that the number of ministers should be increased to 20, with no changes to the portfolios allotted to the parties. 4fefd39f24<br />
-<br />
-<br />
-<p></p>
diff --git a/spaces/v-nemala/similar-images/README.md b/spaces/v-nemala/similar-images/README.md
deleted file mode 100644
index 3ccf3fcd70b21de902457326b083fb454632143d..0000000000000000000000000000000000000000
--- a/spaces/v-nemala/similar-images/README.md
+++ /dev/null
@@ -1,13 +0,0 @@
----
-title: Similar Images
-emoji: 📚
-colorFrom: green
-colorTo: yellow
-sdk: streamlit
-sdk_version: 1.17.0
-app_file: app.py
-pinned: false
----
-
-# CS482-Assignments
-CS 482 Assignments -- Vaisnavi Nemala
diff --git a/spaces/victor/models-inference/style.css b/spaces/victor/models-inference/style.css
deleted file mode 100644
index 114adf441e9032febb46bc056b2a8bb651075f0d..0000000000000000000000000000000000000000
--- a/spaces/victor/models-inference/style.css
+++ /dev/null
@@ -1,28 +0,0 @@
-body {
-	padding: 2rem;
-	font-family: -apple-system, BlinkMacSystemFont, "Arial", sans-serif;
-}
-
-h1 {
-	font-size: 16px;
-	margin-top: 0;
-}
-
-p {
-	color: rgb(107, 114, 128);
-	font-size: 15px;
-	margin-bottom: 10px;
-	margin-top: 5px;
-}
-
-.card {
-	max-width: 620px;
-	margin: 0 auto;
-	padding: 16px;
-	border: 1px solid lightgray;
-	border-radius: 16px;
-}
-
-.card p:last-child {
-	margin-bottom: 0;
-}
diff --git a/spaces/vinthony/SadTalker/src/face3d/visualize.py b/spaces/vinthony/SadTalker/src/face3d/visualize.py
deleted file mode 100644
index 23a1110806a0ddf37d4aa549c023d1c3f7114e3e..0000000000000000000000000000000000000000
--- a/spaces/vinthony/SadTalker/src/face3d/visualize.py
+++ /dev/null
@@ -1,48 +0,0 @@
-# check the sync of 3dmm feature and the audio
-import cv2
-import numpy as np
-from src.face3d.models.bfm import ParametricFaceModel
-from src.face3d.models.facerecon_model import FaceReconModel
-import torch
-import subprocess, platform
-import scipy.io as scio
-from tqdm import tqdm 
-
-# draft
-def gen_composed_video(args, device, first_frame_coeff, coeff_path, audio_path, save_path, exp_dim=64):
-    
-    coeff_first = scio.loadmat(first_frame_coeff)['full_3dmm']
-
-    coeff_pred = scio.loadmat(coeff_path)['coeff_3dmm']
-
-    coeff_full = np.repeat(coeff_first, coeff_pred.shape[0], axis=0) # 257
-
-    coeff_full[:, 80:144] = coeff_pred[:, 0:64]
-    coeff_full[:, 224:227]  = coeff_pred[:, 64:67] # 3 dim translation
-    coeff_full[:, 254:]  = coeff_pred[:, 67:] # 3 dim translation
-
-    tmp_video_path = '/tmp/face3dtmp.mp4'
-
-    facemodel = FaceReconModel(args)
-    
-    video = cv2.VideoWriter(tmp_video_path, cv2.VideoWriter_fourcc(*'mp4v'), 25, (224, 224))
-
-    for k in tqdm(range(coeff_pred.shape[0]), 'face3d rendering:'):
-        cur_coeff_full = torch.tensor(coeff_full[k:k+1], device=device)
-
-        facemodel.forward(cur_coeff_full, device)
-
-        predicted_landmark = facemodel.pred_lm # TODO.
-        predicted_landmark = predicted_landmark.cpu().numpy().squeeze()
-
-        rendered_img = facemodel.pred_face
-        rendered_img = 255. * rendered_img.cpu().numpy().squeeze().transpose(1,2,0)
-        out_img = rendered_img[:, :, :3].astype(np.uint8)
-
-        video.write(np.uint8(out_img[:,:,::-1]))
-
-    video.release()
-
-    command = 'ffmpeg -v quiet -y -i {} -i {} -strict -2 -q:v 1 {}'.format(audio_path, tmp_video_path, save_path)
-    subprocess.call(command, shell=platform.system() != 'Windows')
-
diff --git a/spaces/vivien/clip-owlvit/README.md b/spaces/vivien/clip-owlvit/README.md
deleted file mode 100644
index cfaf263bbcdd83e683dfa50dd8faeb517a83c2c4..0000000000000000000000000000000000000000
--- a/spaces/vivien/clip-owlvit/README.md
+++ /dev/null
@@ -1,13 +0,0 @@
----
-title: Search and Detect (CLIP/OWL-ViT)
-emoji: 🦉
-colorFrom: indigo
-colorTo: red
-sdk: streamlit
-sdk_version: 1.10.0
-app_file: app.py
-pinned: false
-license: mit
----
-
-Check out the configuration reference at https://huggingface.co/docs/hub/spaces-config-reference
diff --git a/spaces/vivym/image-matting-app/ppmatting/core/__init__.py b/spaces/vivym/image-matting-app/ppmatting/core/__init__.py
deleted file mode 100644
index 78060ba48aac1fd7d8cb32eccc7ccddadd74017f..0000000000000000000000000000000000000000
--- a/spaces/vivym/image-matting-app/ppmatting/core/__init__.py
+++ /dev/null
@@ -1,4 +0,0 @@
-from .val import evaluate
-from .val_ml import evaluate_ml
-from .train import train
-from .predict import predict
\ No newline at end of file
diff --git a/spaces/vumichien/Generate_human_motion/VQ-Trans/visualize/joints2smpl/src/prior.py b/spaces/vumichien/Generate_human_motion/VQ-Trans/visualize/joints2smpl/src/prior.py
deleted file mode 100644
index 7f13806dd1f6607507b0c7e5ad463b3fb0026be8..0000000000000000000000000000000000000000
--- a/spaces/vumichien/Generate_human_motion/VQ-Trans/visualize/joints2smpl/src/prior.py
+++ /dev/null
@@ -1,230 +0,0 @@
-# -*- coding: utf-8 -*-
-
-# Max-Planck-Gesellschaft zur Förderung der Wissenschaften e.V. (MPG) is
-# holder of all proprietary rights on this computer program.
-# You can only use this computer program if you have closed
-# a license agreement with MPG or you get the right to use the computer
-# program from someone who is authorized to grant you that right.
-# Any use of the computer program without a valid license is prohibited and
-# liable to prosecution.
-#
-# Copyright©2019 Max-Planck-Gesellschaft zur Förderung
-# der Wissenschaften e.V. (MPG). acting on behalf of its Max Planck Institute
-# for Intelligent Systems. All rights reserved.
-#
-# Contact: ps-license@tuebingen.mpg.de
-
-from __future__ import absolute_import
-from __future__ import print_function
-from __future__ import division
-
-import sys
-import os
-
-import time
-import pickle
-
-import numpy as np
-
-import torch
-import torch.nn as nn
-
-DEFAULT_DTYPE = torch.float32
-
-
-def create_prior(prior_type, **kwargs):
-    if prior_type == 'gmm':
-        prior = MaxMixturePrior(**kwargs)
-    elif prior_type == 'l2':
-        return L2Prior(**kwargs)
-    elif prior_type == 'angle':
-        return SMPLifyAnglePrior(**kwargs)
-    elif prior_type == 'none' or prior_type is None:
-        # Don't use any pose prior
-        def no_prior(*args, **kwargs):
-            return 0.0
-        prior = no_prior
-    else:
-        raise ValueError('Prior {}'.format(prior_type) + ' is not implemented')
-    return prior
-
-
-class SMPLifyAnglePrior(nn.Module):
-    def __init__(self, dtype=torch.float32, **kwargs):
-        super(SMPLifyAnglePrior, self).__init__()
-
-        # Indices for the roration angle of
-        # 55: left elbow,  90deg bend at -np.pi/2
-        # 58: right elbow, 90deg bend at np.pi/2
-        # 12: left knee,   90deg bend at np.pi/2
-        # 15: right knee,  90deg bend at np.pi/2
-        angle_prior_idxs = np.array([55, 58, 12, 15], dtype=np.int64)
-        angle_prior_idxs = torch.tensor(angle_prior_idxs, dtype=torch.long)
-        self.register_buffer('angle_prior_idxs', angle_prior_idxs)
-
-        angle_prior_signs = np.array([1, -1, -1, -1],
-                                     dtype=np.float32 if dtype == torch.float32
-                                     else np.float64)
-        angle_prior_signs = torch.tensor(angle_prior_signs,
-                                         dtype=dtype)
-        self.register_buffer('angle_prior_signs', angle_prior_signs)
-
-    def forward(self, pose, with_global_pose=False):
-        ''' Returns the angle prior loss for the given pose
-
-        Args:
-            pose: (Bx[23 + 1] * 3) torch tensor with the axis-angle
-            representation of the rotations of the joints of the SMPL model.
-        Kwargs:
-            with_global_pose: Whether the pose vector also contains the global
-            orientation of the SMPL model. If not then the indices must be
-            corrected.
-        Returns:
-            A sze (B) tensor containing the angle prior loss for each element
-            in the batch.
-        '''
-        angle_prior_idxs = self.angle_prior_idxs - (not with_global_pose) * 3
-        return torch.exp(pose[:, angle_prior_idxs] *
-                         self.angle_prior_signs).pow(2)
-
-
-class L2Prior(nn.Module):
-    def __init__(self, dtype=DEFAULT_DTYPE, reduction='sum', **kwargs):
-        super(L2Prior, self).__init__()
-
-    def forward(self, module_input, *args):
-        return torch.sum(module_input.pow(2))
-
-
-class MaxMixturePrior(nn.Module):
-
-    def __init__(self, prior_folder='prior',
-                 num_gaussians=6, dtype=DEFAULT_DTYPE, epsilon=1e-16,
-                 use_merged=True,
-                 **kwargs):
-        super(MaxMixturePrior, self).__init__()
-
-        if dtype == DEFAULT_DTYPE:
-            np_dtype = np.float32
-        elif dtype == torch.float64:
-            np_dtype = np.float64
-        else:
-            print('Unknown float type {}, exiting!'.format(dtype))
-            sys.exit(-1)
-
-        self.num_gaussians = num_gaussians
-        self.epsilon = epsilon
-        self.use_merged = use_merged
-        gmm_fn = 'gmm_{:02d}.pkl'.format(num_gaussians)
-
-        full_gmm_fn = os.path.join(prior_folder, gmm_fn)
-        if not os.path.exists(full_gmm_fn):
-            print('The path to the mixture prior "{}"'.format(full_gmm_fn) +
-                  ' does not exist, exiting!')
-            sys.exit(-1)
-
-        with open(full_gmm_fn, 'rb') as f:
-            gmm = pickle.load(f, encoding='latin1')
-
-        if type(gmm) == dict:
-            means = gmm['means'].astype(np_dtype)
-            covs = gmm['covars'].astype(np_dtype)
-            weights = gmm['weights'].astype(np_dtype)
-        elif 'sklearn.mixture.gmm.GMM' in str(type(gmm)):
-            means = gmm.means_.astype(np_dtype)
-            covs = gmm.covars_.astype(np_dtype)
-            weights = gmm.weights_.astype(np_dtype)
-        else:
-            print('Unknown type for the prior: {}, exiting!'.format(type(gmm)))
-            sys.exit(-1)
-
-        self.register_buffer('means', torch.tensor(means, dtype=dtype))
-
-        self.register_buffer('covs', torch.tensor(covs, dtype=dtype))
-
-        precisions = [np.linalg.inv(cov) for cov in covs]
-        precisions = np.stack(precisions).astype(np_dtype)
-
-        self.register_buffer('precisions',
-                             torch.tensor(precisions, dtype=dtype))
-
-        # The constant term:
-        sqrdets = np.array([(np.sqrt(np.linalg.det(c)))
-                            for c in gmm['covars']])
-        const = (2 * np.pi)**(69 / 2.)
-
-        nll_weights = np.asarray(gmm['weights'] / (const *
-                                                   (sqrdets / sqrdets.min())))
-        nll_weights = torch.tensor(nll_weights, dtype=dtype).unsqueeze(dim=0)
-        self.register_buffer('nll_weights', nll_weights)
-
-        weights = torch.tensor(gmm['weights'], dtype=dtype).unsqueeze(dim=0)
-        self.register_buffer('weights', weights)
-
-        self.register_buffer('pi_term',
-                             torch.log(torch.tensor(2 * np.pi, dtype=dtype)))
-
-        cov_dets = [np.log(np.linalg.det(cov.astype(np_dtype)) + epsilon)
-                    for cov in covs]
-        self.register_buffer('cov_dets',
-                             torch.tensor(cov_dets, dtype=dtype))
-
-        # The dimensionality of the random variable
-        self.random_var_dim = self.means.shape[1]
-
-    def get_mean(self):
-        ''' Returns the mean of the mixture '''
-        mean_pose = torch.matmul(self.weights, self.means)
-        return mean_pose
-
-    def merged_log_likelihood(self, pose, betas):
-        diff_from_mean = pose.unsqueeze(dim=1) - self.means
-
-        prec_diff_prod = torch.einsum('mij,bmj->bmi',
-                                      [self.precisions, diff_from_mean])
-        diff_prec_quadratic = (prec_diff_prod * diff_from_mean).sum(dim=-1)
-
-        curr_loglikelihood = 0.5 * diff_prec_quadratic - \
-            torch.log(self.nll_weights)
-        #  curr_loglikelihood = 0.5 * (self.cov_dets.unsqueeze(dim=0) +
-        #  self.random_var_dim * self.pi_term +
-        #  diff_prec_quadratic
-        #  ) - torch.log(self.weights)
-
-        min_likelihood, _ = torch.min(curr_loglikelihood, dim=1)
-        return min_likelihood
-
-    def log_likelihood(self, pose, betas, *args, **kwargs):
-        ''' Create graph operation for negative log-likelihood calculation
-        '''
-        likelihoods = []
-
-        for idx in range(self.num_gaussians):
-            mean = self.means[idx]
-            prec = self.precisions[idx]
-            cov = self.covs[idx]
-            diff_from_mean = pose - mean
-
-            curr_loglikelihood = torch.einsum('bj,ji->bi',
-                                              [diff_from_mean, prec])
-            curr_loglikelihood = torch.einsum('bi,bi->b',
-                                              [curr_loglikelihood,
-                                               diff_from_mean])
-            cov_term = torch.log(torch.det(cov) + self.epsilon)
-            curr_loglikelihood += 0.5 * (cov_term +
-                                         self.random_var_dim *
-                                         self.pi_term)
-            likelihoods.append(curr_loglikelihood)
-
-        log_likelihoods = torch.stack(likelihoods, dim=1)
-        min_idx = torch.argmin(log_likelihoods, dim=1)
-        weight_component = self.nll_weights[:, min_idx]
-        weight_component = -torch.log(weight_component)
-
-        return weight_component + log_likelihoods[:, min_idx]
-
-    def forward(self, pose, betas):
-        if self.use_merged:
-            return self.merged_log_likelihood(pose, betas)
-        else:
-            return self.log_likelihood(pose, betas)
\ No newline at end of file
diff --git a/spaces/vumichien/canvas_controlnet/annotator/uniformer/mmseg/core/utils/__init__.py b/spaces/vumichien/canvas_controlnet/annotator/uniformer/mmseg/core/utils/__init__.py
deleted file mode 100644
index f2678b321c295bcceaef945111ac3524be19d6e4..0000000000000000000000000000000000000000
--- a/spaces/vumichien/canvas_controlnet/annotator/uniformer/mmseg/core/utils/__init__.py
+++ /dev/null
@@ -1,3 +0,0 @@
-from .misc import add_prefix
-
-__all__ = ['add_prefix']
diff --git a/spaces/wasertech/French_Wav2Vec2_ASR/app.py b/spaces/wasertech/French_Wav2Vec2_ASR/app.py
deleted file mode 100644
index 5573675d4bff48212ac2bb173086a3709063eff5..0000000000000000000000000000000000000000
--- a/spaces/wasertech/French_Wav2Vec2_ASR/app.py
+++ /dev/null
@@ -1,67 +0,0 @@
-#References: 1. https://www.kdnuggets.com/2021/03/speech-text-wav2vec.html 
-            #2. https://www.youtube.com/watch?v=4CoVcsxZphE 
-            #3. https://www.analyticsvidhya.com/blog/2021/02/hugging-face-introduces-the-first-automatic-speech-recognition-model-wav2vec2/ 
-
-#Importing all the necessary packages
-import nltk
-import librosa
-import torch
-import gradio as gr
-from transformers import Wav2Vec2Tokenizer, Wav2Vec2ForCTC
-nltk.download("punkt")
-
-#Loading the model and the tokenizer
-model_name = "bofenghuang/asr-wav2vec2-ctc-french" #"wasertech/wav2vec2-cv-fr-9"
-tokenizer = Wav2Vec2Tokenizer.from_pretrained(model_name)
-model = Wav2Vec2ForCTC.from_pretrained(model_name)
-
-
-def load_data(input_file):
-  
-  """ Function for resampling to ensure that the speech input is sampled at 16KHz.
-  """
-  #read the file
-  speech, sample_rate = librosa.load(input_file)
-  #make it 1-D
-  if len(speech.shape) > 1: 
-      speech = speech[:,0] + speech[:,1]
-  #Resampling at 16KHz since wav2vec2-base-960h is pretrained and fine-tuned on speech audio sampled at 16 KHz.
-  if sample_rate !=16000:
-    speech = librosa.resample(speech, orig_sr=sample_rate, target_sr=16000)
-  return speech
-  
-  
-
-def correct_casing(input_sentence):
-  """ This function is for correcting the casing of the generated transcribed text
-  """
-  sentences = nltk.sent_tokenize(input_sentence)
-  return (' '.join([s.replace(s[0],s[0].capitalize(),1) for s in sentences]))
-  
-
-
-def asr_transcript(input_file):
-  """This function generates transcripts for the provided audio input
-  """
-  speech = load_data(input_file)
-  
-  #Tokenize
-  input_values = tokenizer(speech, return_tensors="pt").input_values
-  #Take logits
-  logits = model(input_values).logits
-  #Take argmax
-  predicted_ids = torch.argmax(logits, dim=-1)
-  #Get the words from predicted word ids
-  transcription = tokenizer.decode(predicted_ids[0])
-  #Output is all upper case
-  transcription = correct_casing(transcription.lower())
-  return transcription
-  
-
-gr.Interface(asr_transcript,
-             inputs = gr.inputs.Audio(source="microphone", type="filepath", optional=True, label="Démarrer l'enregistrement"),
-             outputs = gr.outputs.Textbox(label="Transcription"),
-             title="🎙️ Parlez, on vous écoute !",
-             description = "Enregistrez un audio ou utilisez les examples pour interagir avec notre dernier modèle.",
-             examples = [["wav/1.wav"], ["wav/2.wav"], ["wav/3.wav"], ["wav/4.wav"], ["wav/5.wav"]], theme="grass").launch()
-
diff --git a/spaces/wendys-llc/panoptic-segment-anything/GroundingDINO/groundingdino/models/GroundingDINO/bertwarper.py b/spaces/wendys-llc/panoptic-segment-anything/GroundingDINO/groundingdino/models/GroundingDINO/bertwarper.py
deleted file mode 100644
index f0cf9779b270e1aead32845006f8b881fcba37ad..0000000000000000000000000000000000000000
--- a/spaces/wendys-llc/panoptic-segment-anything/GroundingDINO/groundingdino/models/GroundingDINO/bertwarper.py
+++ /dev/null
@@ -1,273 +0,0 @@
-# ------------------------------------------------------------------------
-# Grounding DINO
-# url: https://github.com/IDEA-Research/GroundingDINO
-# Copyright (c) 2023 IDEA. All Rights Reserved.
-# Licensed under the Apache License, Version 2.0 [see LICENSE for details]
-# ------------------------------------------------------------------------
-
-import torch
-import torch.nn.functional as F
-import torch.utils.checkpoint as checkpoint
-from torch import Tensor, nn
-from torchvision.ops.boxes import nms
-from transformers import BertConfig, BertModel, BertPreTrainedModel
-from transformers.modeling_outputs import BaseModelOutputWithPoolingAndCrossAttentions
-
-
-class BertModelWarper(nn.Module):
-    def __init__(self, bert_model):
-        super().__init__()
-        # self.bert = bert_modelc
-
-        self.config = bert_model.config
-        self.embeddings = bert_model.embeddings
-        self.encoder = bert_model.encoder
-        self.pooler = bert_model.pooler
-
-        self.get_extended_attention_mask = bert_model.get_extended_attention_mask
-        self.invert_attention_mask = bert_model.invert_attention_mask
-        self.get_head_mask = bert_model.get_head_mask
-
-    def forward(
-        self,
-        input_ids=None,
-        attention_mask=None,
-        token_type_ids=None,
-        position_ids=None,
-        head_mask=None,
-        inputs_embeds=None,
-        encoder_hidden_states=None,
-        encoder_attention_mask=None,
-        past_key_values=None,
-        use_cache=None,
-        output_attentions=None,
-        output_hidden_states=None,
-        return_dict=None,
-    ):
-        r"""
-        encoder_hidden_states  (:obj:`torch.FloatTensor` of shape :obj:`(batch_size, sequence_length, hidden_size)`, `optional`):
-            Sequence of hidden-states at the output of the last layer of the encoder. Used in the cross-attention if
-            the model is configured as a decoder.
-        encoder_attention_mask (:obj:`torch.FloatTensor` of shape :obj:`(batch_size, sequence_length)`, `optional`):
-            Mask to avoid performing attention on the padding token indices of the encoder input. This mask is used in
-            the cross-attention if the model is configured as a decoder. Mask values selected in ``[0, 1]``:
-
-            - 1 for tokens that are **not masked**,
-            - 0 for tokens that are **masked**.
-        past_key_values (:obj:`tuple(tuple(torch.FloatTensor))` of length :obj:`config.n_layers` with each tuple having 4 tensors of shape :obj:`(batch_size, num_heads, sequence_length - 1, embed_size_per_head)`):
-            Contains precomputed key and value hidden states of the attention blocks. Can be used to speed up decoding.
-
-            If :obj:`past_key_values` are used, the user can optionally input only the last :obj:`decoder_input_ids`
-            (those that don't have their past key value states given to this model) of shape :obj:`(batch_size, 1)`
-            instead of all :obj:`decoder_input_ids` of shape :obj:`(batch_size, sequence_length)`.
-        use_cache (:obj:`bool`, `optional`):
-            If set to :obj:`True`, :obj:`past_key_values` key value states are returned and can be used to speed up
-            decoding (see :obj:`past_key_values`).
-        """
-        output_attentions = (
-            output_attentions if output_attentions is not None else self.config.output_attentions
-        )
-        output_hidden_states = (
-            output_hidden_states
-            if output_hidden_states is not None
-            else self.config.output_hidden_states
-        )
-        return_dict = return_dict if return_dict is not None else self.config.use_return_dict
-
-        if self.config.is_decoder:
-            use_cache = use_cache if use_cache is not None else self.config.use_cache
-        else:
-            use_cache = False
-
-        if input_ids is not None and inputs_embeds is not None:
-            raise ValueError("You cannot specify both input_ids and inputs_embeds at the same time")
-        elif input_ids is not None:
-            input_shape = input_ids.size()
-            batch_size, seq_length = input_shape
-        elif inputs_embeds is not None:
-            input_shape = inputs_embeds.size()[:-1]
-            batch_size, seq_length = input_shape
-        else:
-            raise ValueError("You have to specify either input_ids or inputs_embeds")
-
-        device = input_ids.device if input_ids is not None else inputs_embeds.device
-
-        # past_key_values_length
-        past_key_values_length = (
-            past_key_values[0][0].shape[2] if past_key_values is not None else 0
-        )
-
-        if attention_mask is None:
-            attention_mask = torch.ones(
-                ((batch_size, seq_length + past_key_values_length)), device=device
-            )
-        if token_type_ids is None:
-            token_type_ids = torch.zeros(input_shape, dtype=torch.long, device=device)
-
-        # We can provide a self-attention mask of dimensions [batch_size, from_seq_length, to_seq_length]
-        # ourselves in which case we just need to make it broadcastable to all heads.
-        extended_attention_mask: torch.Tensor = self.get_extended_attention_mask(
-            attention_mask, input_shape, device
-        )
-
-        # If a 2D or 3D attention mask is provided for the cross-attention
-        # we need to make broadcastable to [batch_size, num_heads, seq_length, seq_length]
-        if self.config.is_decoder and encoder_hidden_states is not None:
-            encoder_batch_size, encoder_sequence_length, _ = encoder_hidden_states.size()
-            encoder_hidden_shape = (encoder_batch_size, encoder_sequence_length)
-            if encoder_attention_mask is None:
-                encoder_attention_mask = torch.ones(encoder_hidden_shape, device=device)
-            encoder_extended_attention_mask = self.invert_attention_mask(encoder_attention_mask)
-        else:
-            encoder_extended_attention_mask = None
-        # if os.environ.get('IPDB_SHILONG_DEBUG', None) == 'INFO':
-        #     import ipdb; ipdb.set_trace()
-
-        # Prepare head mask if needed
-        # 1.0 in head_mask indicate we keep the head
-        # attention_probs has shape bsz x n_heads x N x N
-        # input head_mask has shape [num_heads] or [num_hidden_layers x num_heads]
-        # and head_mask is converted to shape [num_hidden_layers x batch x num_heads x seq_length x seq_length]
-        head_mask = self.get_head_mask(head_mask, self.config.num_hidden_layers)
-
-        embedding_output = self.embeddings(
-            input_ids=input_ids,
-            position_ids=position_ids,
-            token_type_ids=token_type_ids,
-            inputs_embeds=inputs_embeds,
-            past_key_values_length=past_key_values_length,
-        )
-
-        encoder_outputs = self.encoder(
-            embedding_output,
-            attention_mask=extended_attention_mask,
-            head_mask=head_mask,
-            encoder_hidden_states=encoder_hidden_states,
-            encoder_attention_mask=encoder_extended_attention_mask,
-            past_key_values=past_key_values,
-            use_cache=use_cache,
-            output_attentions=output_attentions,
-            output_hidden_states=output_hidden_states,
-            return_dict=return_dict,
-        )
-        sequence_output = encoder_outputs[0]
-        pooled_output = self.pooler(sequence_output) if self.pooler is not None else None
-
-        if not return_dict:
-            return (sequence_output, pooled_output) + encoder_outputs[1:]
-
-        return BaseModelOutputWithPoolingAndCrossAttentions(
-            last_hidden_state=sequence_output,
-            pooler_output=pooled_output,
-            past_key_values=encoder_outputs.past_key_values,
-            hidden_states=encoder_outputs.hidden_states,
-            attentions=encoder_outputs.attentions,
-            cross_attentions=encoder_outputs.cross_attentions,
-        )
-
-
-class TextEncoderShell(nn.Module):
-    def __init__(self, text_encoder):
-        super().__init__()
-        self.text_encoder = text_encoder
-        self.config = self.text_encoder.config
-
-    def forward(self, **kw):
-        # feed into text encoder
-        return self.text_encoder(**kw)
-
-
-def generate_masks_with_special_tokens(tokenized, special_tokens_list, tokenizer):
-    """Generate attention mask between each pair of special tokens
-    Args:
-        input_ids (torch.Tensor): input ids. Shape: [bs, num_token]
-        special_tokens_mask (list): special tokens mask.
-    Returns:
-        torch.Tensor: attention mask between each special tokens.
-    """
-    input_ids = tokenized["input_ids"]
-    bs, num_token = input_ids.shape
-    # special_tokens_mask: bs, num_token. 1 for special tokens. 0 for normal tokens
-    special_tokens_mask = torch.zeros((bs, num_token), device=input_ids.device).bool()
-    for special_token in special_tokens_list:
-        special_tokens_mask |= input_ids == special_token
-
-    # idxs: each row is a list of indices of special tokens
-    idxs = torch.nonzero(special_tokens_mask)
-
-    # generate attention mask and positional ids
-    attention_mask = (
-        torch.eye(num_token, device=input_ids.device).bool().unsqueeze(0).repeat(bs, 1, 1)
-    )
-    position_ids = torch.zeros((bs, num_token), device=input_ids.device)
-    previous_col = 0
-    for i in range(idxs.shape[0]):
-        row, col = idxs[i]
-        if (col == 0) or (col == num_token - 1):
-            attention_mask[row, col, col] = True
-            position_ids[row, col] = 0
-        else:
-            attention_mask[row, previous_col + 1 : col + 1, previous_col + 1 : col + 1] = True
-            position_ids[row, previous_col + 1 : col + 1] = torch.arange(
-                0, col - previous_col, device=input_ids.device
-            )
-
-        previous_col = col
-
-    # # padding mask
-    # padding_mask = tokenized['attention_mask']
-    # attention_mask = attention_mask & padding_mask.unsqueeze(1).bool() & padding_mask.unsqueeze(2).bool()
-
-    return attention_mask, position_ids.to(torch.long)
-
-
-def generate_masks_with_special_tokens_and_transfer_map(tokenized, special_tokens_list, tokenizer):
-    """Generate attention mask between each pair of special tokens
-    Args:
-        input_ids (torch.Tensor): input ids. Shape: [bs, num_token]
-        special_tokens_mask (list): special tokens mask.
-    Returns:
-        torch.Tensor: attention mask between each special tokens.
-    """
-    input_ids = tokenized["input_ids"]
-    bs, num_token = input_ids.shape
-    # special_tokens_mask: bs, num_token. 1 for special tokens. 0 for normal tokens
-    special_tokens_mask = torch.zeros((bs, num_token), device=input_ids.device).bool()
-    for special_token in special_tokens_list:
-        special_tokens_mask |= input_ids == special_token
-
-    # idxs: each row is a list of indices of special tokens
-    idxs = torch.nonzero(special_tokens_mask)
-
-    # generate attention mask and positional ids
-    attention_mask = (
-        torch.eye(num_token, device=input_ids.device).bool().unsqueeze(0).repeat(bs, 1, 1)
-    )
-    position_ids = torch.zeros((bs, num_token), device=input_ids.device)
-    cate_to_token_mask_list = [[] for _ in range(bs)]
-    previous_col = 0
-    for i in range(idxs.shape[0]):
-        row, col = idxs[i]
-        if (col == 0) or (col == num_token - 1):
-            attention_mask[row, col, col] = True
-            position_ids[row, col] = 0
-        else:
-            attention_mask[row, previous_col + 1 : col + 1, previous_col + 1 : col + 1] = True
-            position_ids[row, previous_col + 1 : col + 1] = torch.arange(
-                0, col - previous_col, device=input_ids.device
-            )
-            c2t_maski = torch.zeros((num_token), device=input_ids.device).bool()
-            c2t_maski[previous_col + 1 : col] = True
-            cate_to_token_mask_list[row].append(c2t_maski)
-        previous_col = col
-
-    cate_to_token_mask_list = [
-        torch.stack(cate_to_token_mask_listi, dim=0)
-        for cate_to_token_mask_listi in cate_to_token_mask_list
-    ]
-
-    # # padding mask
-    # padding_mask = tokenized['attention_mask']
-    # attention_mask = attention_mask & padding_mask.unsqueeze(1).bool() & padding_mask.unsqueeze(2).bool()
-
-    return attention_mask, position_ids.to(torch.long), cate_to_token_mask_list
diff --git a/spaces/yanli01/wrwj/ChuanhuChatbot.py b/spaces/yanli01/wrwj/ChuanhuChatbot.py
deleted file mode 100644
index 790da17fe3d60c1b3b9e074da6574099defae4d6..0000000000000000000000000000000000000000
--- a/spaces/yanli01/wrwj/ChuanhuChatbot.py
+++ /dev/null
@@ -1,423 +0,0 @@
-# -*- coding:utf-8 -*-
-import os
-import logging
-import sys
-
-import gradio as gr
-
-from modules import config
-from modules.config import *
-from modules.utils import *
-from modules.presets import *
-from modules.overwrites import *
-from modules.chat_func import *
-from modules.openai_func import get_usage
-
-gr.Chatbot.postprocess = postprocess
-PromptHelper.compact_text_chunks = compact_text_chunks
-
-with open("assets/custom.css", "r", encoding="utf-8") as f:
-    customCSS = f.read()
-
-with gr.Blocks(css=customCSS, theme=small_and_beautiful_theme) as demo:
-    user_name = gr.State("")
-    history = gr.State([])
-    token_count = gr.State([])
-    promptTemplates = gr.State(load_template(get_template_names(plain=True)[0], mode=2))
-    user_api_key = gr.State(my_api_key)
-    user_question = gr.State("")
-    outputing = gr.State(False)
-    topic = gr.State("未命名对话历史记录")
-
-    with gr.Row():
-        with gr.Column():
-            gr.HTML(title)
-            user_info = gr.Markdown(value="", elem_id="user_info")
-        
-        status_display = gr.Markdown(get_geoip(), elem_id="status_display")
-
-        # https://github.com/gradio-app/gradio/pull/3296
-        def create_greeting(request: gr.Request):
-            if hasattr(request, "username") and request.username: # is not None or is not ""
-                logging.info(f"Get User Name: {request.username}")
-                return gr.Markdown.update(value=f"User: {request.username}"), request.username
-            else:
-                return gr.Markdown.update(value=f"User: default", visible=False), ""
-        demo.load(create_greeting, inputs=None, outputs=[user_info, user_name])
-
-    with gr.Row().style(equal_height=True):
-        with gr.Column(scale=5):
-            with gr.Row():
-                chatbot = gr.Chatbot(elem_id="chuanhu_chatbot").style(height="100%")
-            with gr.Row():
-                with gr.Column(scale=12):
-                    user_input = gr.Textbox(
-                        elem_id="user_input_tb",
-                        show_label=False, placeholder="在这里输入"
-                    ).style(container=False)
-                with gr.Column(min_width=70, scale=1):
-                    submitBtn = gr.Button("发送", variant="primary")
-                    cancelBtn = gr.Button("取消", variant="secondary", visible=False)
-            with gr.Row():
-                emptyBtn = gr.Button(
-                    "🧹 新的对话",
-                )
-                retryBtn = gr.Button("🔄 重新生成")
-                delFirstBtn = gr.Button("🗑️ 删除旧对话")
-                delLastBtn = gr.Button("🗑️ 删除新对话")
-                reduceTokenBtn = gr.Button("♻️ 总结对话")
-
-        with gr.Column():
-            with gr.Column(min_width=50, scale=1):
-                with gr.Tab(label="ChatGPT"):
-                    keyTxt = gr.Textbox(
-                        show_label=True,
-                        placeholder=f"OpenAI API-key...",
-                        value=hide_middle_chars(my_api_key),
-                        type="password",
-                        visible=not HIDE_MY_KEY,
-                        label="你的API-Key",
-                    )
-                    if multi_api_key:
-                        usageTxt = gr.Markdown("多账号模式已开启，无需输入key，可直接开始对话", elem_id="usage_display")
-                    else:
-                        usageTxt = gr.Markdown("**发送消息** 或 **提交key** 以显示额度", elem_id="usage_display")
-                    model_select_dropdown = gr.Dropdown(
-                        label="选择模型", choices=MODELS, multiselect=False, value=MODELS[0]
-                    )
-                    use_streaming_checkbox = gr.Checkbox(
-                        label="实时传输回答", value=True, visible=enable_streaming_option
-                    )
-                    use_websearch_checkbox = gr.Checkbox(label="使用在线搜索", value=False)
-                    language_select_dropdown = gr.Dropdown(
-                        label="选择回复语言（针对搜索&索引功能）",
-                        choices=REPLY_LANGUAGES,
-                        multiselect=False,
-                        value=REPLY_LANGUAGES[0],
-                    )
-                    index_files = gr.Files(label="上传索引文件", type="file", multiple=True)
-                    two_column = gr.Checkbox(label="双栏pdf", value=advance_docs["pdf"].get("two_column", False))
-                    # TODO: 公式ocr
-                    # formula_ocr = gr.Checkbox(label="识别公式", value=advance_docs["pdf"].get("formula_ocr", False))
-
-                with gr.Tab(label="Prompt"):
-                    systemPromptTxt = gr.Textbox(
-                        show_label=True,
-                        placeholder=f"在这里输入System Prompt...",
-                        label="System prompt",
-                        value=initial_prompt,
-                        lines=10,
-                    ).style(container=False)
-                    with gr.Accordion(label="加载Prompt模板", open=True):
-                        with gr.Column():
-                            with gr.Row():
-                                with gr.Column(scale=6):
-                                    templateFileSelectDropdown = gr.Dropdown(
-                                        label="选择Prompt模板集合文件",
-                                        choices=get_template_names(plain=True),
-                                        multiselect=False,
-                                        value=get_template_names(plain=True)[0],
-                                    ).style(container=False)
-                                with gr.Column(scale=1):
-                                    templateRefreshBtn = gr.Button("🔄 刷新")
-                            with gr.Row():
-                                with gr.Column():
-                                    templateSelectDropdown = gr.Dropdown(
-                                        label="从Prompt模板中加载",
-                                        choices=load_template(
-                                            get_template_names(plain=True)[0], mode=1
-                                        ),
-                                        multiselect=False,
-                                    ).style(container=False)
-
-                with gr.Tab(label="保存/加载"):
-                    with gr.Accordion(label="保存/加载对话历史记录", open=True):
-                        with gr.Column():
-                            with gr.Row():
-                                with gr.Column(scale=6):
-                                    historyFileSelectDropdown = gr.Dropdown(
-                                        label="从列表中加载对话",
-                                        choices=get_history_names(plain=True),
-                                        multiselect=False,
-                                        value=get_history_names(plain=True)[0],
-                                    )
-                                with gr.Column(scale=1):
-                                    historyRefreshBtn = gr.Button("🔄 刷新")
-                            with gr.Row():
-                                with gr.Column(scale=6):
-                                    saveFileName = gr.Textbox(
-                                        show_label=True,
-                                        placeholder=f"设置文件名: 默认为.json，可选为.md",
-                                        label="设置保存文件名",
-                                        value="对话历史记录",
-                                    ).style(container=True)
-                                with gr.Column(scale=1):
-                                    saveHistoryBtn = gr.Button("💾 保存对话")
-                                    exportMarkdownBtn = gr.Button("📝 导出为Markdown")
-                                    gr.Markdown("默认保存于history文件夹")
-                            with gr.Row():
-                                with gr.Column():
-                                    downloadFile = gr.File(interactive=True)
-
-                with gr.Tab(label="高级"):
-                    gr.Markdown("# ⚠️ 务必谨慎更改 ⚠️\n\n如果无法使用请恢复默认设置")
-                    default_btn = gr.Button("🔙 恢复默认设置")
-
-                    with gr.Accordion("参数", open=False):
-                        top_p = gr.Slider(
-                            minimum=-0,
-                            maximum=1.0,
-                            value=1.0,
-                            step=0.05,
-                            interactive=True,
-                            label="Top-p",
-                        )
-                        temperature = gr.Slider(
-                            minimum=-0,
-                            maximum=2.0,
-                            value=1.0,
-                            step=0.1,
-                            interactive=True,
-                            label="Temperature",
-                        )
-
-                    with gr.Accordion("网络设置", open=False, visible=False):
-                        # 优先展示自定义的api_host
-                        apihostTxt = gr.Textbox(
-                            show_label=True,
-                            placeholder=f"在这里输入API-Host...",
-                            label="API-Host",
-                            value=config.api_host or shared.API_HOST,
-                            lines=1,
-                        )
-                        changeAPIURLBtn = gr.Button("🔄 切换API地址")
-                        proxyTxt = gr.Textbox(
-                            show_label=True,
-                            placeholder=f"在这里输入代理地址...",
-                            label="代理地址（示例：http://127.0.0.1:10809）",
-                            value="",
-                            lines=2,
-                        )
-                        changeProxyBtn = gr.Button("🔄 设置代理地址")
-
-    gr.Markdown(description)
-    gr.HTML(footer.format(versions=versions_html()), elem_id="footer")
-    chatgpt_predict_args = dict(
-        fn=predict,
-        inputs=[
-            user_api_key,
-            systemPromptTxt,
-            history,
-            user_question,
-            chatbot,
-            token_count,
-            top_p,
-            temperature,
-            use_streaming_checkbox,
-            model_select_dropdown,
-            use_websearch_checkbox,
-            index_files,
-            language_select_dropdown,
-        ],
-        outputs=[chatbot, history, status_display, token_count],
-        show_progress=True,
-    )
-
-    start_outputing_args = dict(
-        fn=start_outputing,
-        inputs=[],
-        outputs=[submitBtn, cancelBtn],
-        show_progress=True,
-    )
-
-    end_outputing_args = dict(
-        fn=end_outputing, inputs=[], outputs=[submitBtn, cancelBtn]
-    )
-
-    reset_textbox_args = dict(
-        fn=reset_textbox, inputs=[], outputs=[user_input]
-    )
-
-    transfer_input_args = dict(
-        fn=transfer_input, inputs=[user_input], outputs=[user_question, user_input, submitBtn, cancelBtn], show_progress=True
-    )
-
-    get_usage_args = dict(
-        fn=get_usage, inputs=[user_api_key], outputs=[usageTxt], show_progress=False
-    )
-
-
-    # Chatbot
-    cancelBtn.click(cancel_outputing, [], [])
-
-    user_input.submit(**transfer_input_args).then(**chatgpt_predict_args).then(**end_outputing_args)
-    user_input.submit(**get_usage_args)
-
-    submitBtn.click(**transfer_input_args).then(**chatgpt_predict_args).then(**end_outputing_args)
-    submitBtn.click(**get_usage_args)
-
-    emptyBtn.click(
-        reset_state,
-        outputs=[chatbot, history, token_count, status_display],
-        show_progress=True,
-    )
-    emptyBtn.click(**reset_textbox_args)
-
-    retryBtn.click(**start_outputing_args).then(
-        retry,
-        [
-            user_api_key,
-            systemPromptTxt,
-            history,
-            chatbot,
-            token_count,
-            top_p,
-            temperature,
-            use_streaming_checkbox,
-            model_select_dropdown,
-            language_select_dropdown,
-        ],
-        [chatbot, history, status_display, token_count],
-        show_progress=True,
-    ).then(**end_outputing_args)
-    retryBtn.click(**get_usage_args)
-
-    delFirstBtn.click(
-        delete_first_conversation,
-        [history, token_count],
-        [history, token_count, status_display],
-    )
-
-    delLastBtn.click(
-        delete_last_conversation,
-        [chatbot, history, token_count],
-        [chatbot, history, token_count, status_display],
-        show_progress=True,
-    )
-
-    reduceTokenBtn.click(
-        reduce_token_size,
-        [
-            user_api_key,
-            systemPromptTxt,
-            history,
-            chatbot,
-            token_count,
-            top_p,
-            temperature,
-            gr.State(sum(token_count.value[-4:])),
-            model_select_dropdown,
-            language_select_dropdown,
-        ],
-        [chatbot, history, status_display, token_count],
-        show_progress=True,
-    )
-    reduceTokenBtn.click(**get_usage_args)
-
-    two_column.change(update_doc_config, [two_column], None)
-
-    # ChatGPT
-    keyTxt.change(submit_key, keyTxt, [user_api_key, status_display]).then(**get_usage_args)
-    keyTxt.submit(**get_usage_args)
-
-    # Template
-    templateRefreshBtn.click(get_template_names, None, [templateFileSelectDropdown])
-    templateFileSelectDropdown.change(
-        load_template,
-        [templateFileSelectDropdown],
-        [promptTemplates, templateSelectDropdown],
-        show_progress=True,
-    )
-    templateSelectDropdown.change(
-        get_template_content,
-        [promptTemplates, templateSelectDropdown, systemPromptTxt],
-        [systemPromptTxt],
-        show_progress=True,
-    )
-
-    # S&L
-    saveHistoryBtn.click(
-        save_chat_history,
-        [saveFileName, systemPromptTxt, history, chatbot, user_name],
-        downloadFile,
-        show_progress=True,
-    )
-    saveHistoryBtn.click(get_history_names, [gr.State(False), user_name], [historyFileSelectDropdown])
-    exportMarkdownBtn.click(
-        export_markdown,
-        [saveFileName, systemPromptTxt, history, chatbot, user_name],
-        downloadFile,
-        show_progress=True,
-    )
-    historyRefreshBtn.click(get_history_names, [gr.State(False), user_name], [historyFileSelectDropdown])
-    historyFileSelectDropdown.change(
-        load_chat_history,
-        [historyFileSelectDropdown, systemPromptTxt, history, chatbot, user_name],
-        [saveFileName, systemPromptTxt, history, chatbot],
-        show_progress=True,
-    )
-    downloadFile.change(
-        load_chat_history,
-        [downloadFile, systemPromptTxt, history, chatbot, user_name],
-        [saveFileName, systemPromptTxt, history, chatbot],
-    )
-
-    # Advanced
-    default_btn.click(
-        reset_default, [], [apihostTxt, proxyTxt, status_display], show_progress=True
-    )
-    changeAPIURLBtn.click(
-        change_api_host,
-        [apihostTxt],
-        [status_display],
-        show_progress=True,
-    )
-    changeProxyBtn.click(
-        change_proxy,
-        [proxyTxt],
-        [status_display],
-        show_progress=True,
-    )
-
-logging.info(
-    colorama.Back.GREEN
-    + "\n川虎的温馨提示：访问 http://localhost:7860 查看界面"
-    + colorama.Style.RESET_ALL
-)
-# 默认开启本地服务器，默认可以直接从IP访问，默认不创建公开分享链接
-demo.title = "🚀无人问津的GPT"
-
-if __name__ == "__main__":
-    reload_javascript()
-    # if running in Docker
-    if dockerflag:
-        if authflag:
-            demo.queue(concurrency_count=CONCURRENT_COUNT).launch(
-                server_name="0.0.0.0",
-                server_port=7860,
-                auth=auth_list,
-                favicon_path="./assets/favicon.ico",
-            )
-        else:
-            demo.queue(concurrency_count=CONCURRENT_COUNT).launch(
-                server_name="0.0.0.0",
-                server_port=7860,
-                share=False,
-                favicon_path="./assets/favicon.ico",
-            )
-    # if not running in Docker
-    else:
-        if authflag:
-            demo.queue(concurrency_count=CONCURRENT_COUNT).launch(
-                share=False,
-                auth=auth_list,
-                favicon_path="./assets/favicon.ico",
-                inbrowser=True,
-            )
-        else:
-            demo.queue(concurrency_count=CONCURRENT_COUNT).launch(
-                share=False, favicon_path="./assets/favicon.ico", inbrowser=True
-            )  # 改为 share=True 可以创建公开分享链接
-        # demo.queue(concurrency_count=CONCURRENT_COUNT).launch(server_name="0.0.0.0", server_port=7860, share=False) # 可自定义端口
-        # demo.queue(concurrency_count=CONCURRENT_COUNT).launch(server_name="0.0.0.0", server_port=7860,auth=("在这里填写用户名", "在这里填写密码")) # 可设置用户名与密码
-        # demo.queue(concurrency_count=CONCURRENT_COUNT).launch(auth=("在这里填写用户名", "在这里填写密码")) # 适合Nginx反向代理
diff --git a/spaces/yash-srivastava19/insta_captions/app.py b/spaces/yash-srivastava19/insta_captions/app.py
deleted file mode 100644
index b448901bc97e0b8300192b86b53ae593a6b29496..0000000000000000000000000000000000000000
--- a/spaces/yash-srivastava19/insta_captions/app.py
+++ /dev/null
@@ -1,59 +0,0 @@
-import os
-import cohere
-import gradio as gr
-from transformers import AutoTokenizer, ViTFeatureExtractor, VisionEncoderDecoderModel
-
-COHERE_API_KEY = os.getenv('COHERE_API_KEY')
-
-co_client = cohere.Client(COHERE_API_KEY)
-
-device = 'cpu'
-encoder_checkpoint = "nlpconnect/vit-gpt2-image-captioning"
-decoder_checkpoint = "nlpconnect/vit-gpt2-image-captioning"
-model_checkpoint = "nlpconnect/vit-gpt2-image-captioning"
-feature_extractor = ViTFeatureExtractor.from_pretrained(encoder_checkpoint)
-
-tokenizer = AutoTokenizer.from_pretrained(decoder_checkpoint)
-model = VisionEncoderDecoderModel.from_pretrained(model_checkpoint).to(device)
-
-
-def predict(image):
-    """Predict the generic image caption from the image """
-    # image = image.convert('RGB')
-    image = feature_extractor(image, return_tensors="pt").pixel_values.to(device)
-    clean_text = lambda x: x.replace('<|endoftext|>', '').split('\n')[0]
-    caption_ids = model.generate(image, max_length=125)[0]
-    img_caption_text = clean_text(tokenizer.decode(caption_ids))
-    
-    caption_text = creative_caption(img_caption_text)
-    hashtags = caption_hashtags(img_caption_text)
-    
-    return caption_text, hashtags
-
-
-def creative_caption(text):
-    return co_client.generate(prompt=f"Write some trendy instagram captions for the following prompt - {text}").generations[0].text
-
-
-def caption_hashtags(text):
-    return co_client.generate(prompt=f"Write some trendy instagram hashtags for the following prompt - {text}").generations[0].text
-
-
-input_upload = gr.Image(label="Upload any Image")
-output = [
-    gr.Textbox(label="Captions"),
-    gr.Textbox(label="Hashtags"),
-]
-
-title = "Instagram Image Captioning"
-description = "Made for Linesh"
-interface = gr.Interface(
-
-    fn=predict,
-    description=description,
-    inputs=input_upload,
-    theme="grass",
-    outputs=output,
-    title=title,
-)
-interface.launch(debug=True)
diff --git a/spaces/ygtxr1997/ReliableSwap_Demo/third_party/arcface/__init__.py b/spaces/ygtxr1997/ReliableSwap_Demo/third_party/arcface/__init__.py
deleted file mode 100644
index 200977ca26d600f3e01e008f3bea870f98b92bb1..0000000000000000000000000000000000000000
--- a/spaces/ygtxr1997/ReliableSwap_Demo/third_party/arcface/__init__.py
+++ /dev/null
@@ -1,2 +0,0 @@
-from third_party.arcface.iresnet import iresnet18, iresnet34, iresnet50, iresnet100
-from third_party.arcface.mouth_net import MouthNet
diff --git a/spaces/yizhangliu/Grounded-Segment-Anything/segment_anything/modeling/image_encoder.py b/spaces/yizhangliu/Grounded-Segment-Anything/segment_anything/modeling/image_encoder.py
deleted file mode 100644
index a6ad9ad2938842308e482a05c9d35ab08db9b2c3..0000000000000000000000000000000000000000
--- a/spaces/yizhangliu/Grounded-Segment-Anything/segment_anything/modeling/image_encoder.py
+++ /dev/null
@@ -1,395 +0,0 @@
-# Copyright (c) Meta Platforms, Inc. and affiliates.
-# All rights reserved.
-
-# This source code is licensed under the license found in the
-# LICENSE file in the root directory of this source tree.
-
-import torch
-import torch.nn as nn
-import torch.nn.functional as F
-
-from typing import Optional, Tuple, Type
-
-from .common import LayerNorm2d, MLPBlock
-
-
-# This class and its supporting functions below lightly adapted from the ViTDet backbone available at: https://github.com/facebookresearch/detectron2/blob/main/detectron2/modeling/backbone/vit.py # noqa
-class ImageEncoderViT(nn.Module):
-    def __init__(
-        self,
-        img_size: int = 1024,
-        patch_size: int = 16,
-        in_chans: int = 3,
-        embed_dim: int = 768,
-        depth: int = 12,
-        num_heads: int = 12,
-        mlp_ratio: float = 4.0,
-        out_chans: int = 256,
-        qkv_bias: bool = True,
-        norm_layer: Type[nn.Module] = nn.LayerNorm,
-        act_layer: Type[nn.Module] = nn.GELU,
-        use_abs_pos: bool = True,
-        use_rel_pos: bool = False,
-        rel_pos_zero_init: bool = True,
-        window_size: int = 0,
-        global_attn_indexes: Tuple[int, ...] = (),
-    ) -> None:
-        """
-        Args:
-            img_size (int): Input image size.
-            patch_size (int): Patch size.
-            in_chans (int): Number of input image channels.
-            embed_dim (int): Patch embedding dimension.
-            depth (int): Depth of ViT.
-            num_heads (int): Number of attention heads in each ViT block.
-            mlp_ratio (float): Ratio of mlp hidden dim to embedding dim.
-            qkv_bias (bool): If True, add a learnable bias to query, key, value.
-            norm_layer (nn.Module): Normalization layer.
-            act_layer (nn.Module): Activation layer.
-            use_abs_pos (bool): If True, use absolute positional embeddings.
-            use_rel_pos (bool): If True, add relative positional embeddings to the attention map.
-            rel_pos_zero_init (bool): If True, zero initialize relative positional parameters.
-            window_size (int): Window size for window attention blocks.
-            global_attn_indexes (list): Indexes for blocks using global attention.
-        """
-        super().__init__()
-        self.img_size = img_size
-
-        self.patch_embed = PatchEmbed(
-            kernel_size=(patch_size, patch_size),
-            stride=(patch_size, patch_size),
-            in_chans=in_chans,
-            embed_dim=embed_dim,
-        )
-
-        self.pos_embed: Optional[nn.Parameter] = None
-        if use_abs_pos:
-            # Initialize absolute positional embedding with pretrain image size.
-            self.pos_embed = nn.Parameter(
-                torch.zeros(1, img_size // patch_size, img_size // patch_size, embed_dim)
-            )
-
-        self.blocks = nn.ModuleList()
-        for i in range(depth):
-            block = Block(
-                dim=embed_dim,
-                num_heads=num_heads,
-                mlp_ratio=mlp_ratio,
-                qkv_bias=qkv_bias,
-                norm_layer=norm_layer,
-                act_layer=act_layer,
-                use_rel_pos=use_rel_pos,
-                rel_pos_zero_init=rel_pos_zero_init,
-                window_size=window_size if i not in global_attn_indexes else 0,
-                input_size=(img_size // patch_size, img_size // patch_size),
-            )
-            self.blocks.append(block)
-
-        self.neck = nn.Sequential(
-            nn.Conv2d(
-                embed_dim,
-                out_chans,
-                kernel_size=1,
-                bias=False,
-            ),
-            LayerNorm2d(out_chans),
-            nn.Conv2d(
-                out_chans,
-                out_chans,
-                kernel_size=3,
-                padding=1,
-                bias=False,
-            ),
-            LayerNorm2d(out_chans),
-        )
-
-    def forward(self, x: torch.Tensor) -> torch.Tensor:
-        x = self.patch_embed(x)
-        if self.pos_embed is not None:
-            x = x + self.pos_embed
-
-        for blk in self.blocks:
-            x = blk(x)
-
-        x = self.neck(x.permute(0, 3, 1, 2))
-
-        return x
-
-
-class Block(nn.Module):
-    """Transformer blocks with support of window attention and residual propagation blocks"""
-
-    def __init__(
-        self,
-        dim: int,
-        num_heads: int,
-        mlp_ratio: float = 4.0,
-        qkv_bias: bool = True,
-        norm_layer: Type[nn.Module] = nn.LayerNorm,
-        act_layer: Type[nn.Module] = nn.GELU,
-        use_rel_pos: bool = False,
-        rel_pos_zero_init: bool = True,
-        window_size: int = 0,
-        input_size: Optional[Tuple[int, int]] = None,
-    ) -> None:
-        """
-        Args:
-            dim (int): Number of input channels.
-            num_heads (int): Number of attention heads in each ViT block.
-            mlp_ratio (float): Ratio of mlp hidden dim to embedding dim.
-            qkv_bias (bool): If True, add a learnable bias to query, key, value.
-            norm_layer (nn.Module): Normalization layer.
-            act_layer (nn.Module): Activation layer.
-            use_rel_pos (bool): If True, add relative positional embeddings to the attention map.
-            rel_pos_zero_init (bool): If True, zero initialize relative positional parameters.
-            window_size (int): Window size for window attention blocks. If it equals 0, then
-                use global attention.
-            input_size (int or None): Input resolution for calculating the relative positional
-                parameter size.
-        """
-        super().__init__()
-        self.norm1 = norm_layer(dim)
-        self.attn = Attention(
-            dim,
-            num_heads=num_heads,
-            qkv_bias=qkv_bias,
-            use_rel_pos=use_rel_pos,
-            rel_pos_zero_init=rel_pos_zero_init,
-            input_size=input_size if window_size == 0 else (window_size, window_size),
-        )
-
-        self.norm2 = norm_layer(dim)
-        self.mlp = MLPBlock(embedding_dim=dim, mlp_dim=int(dim * mlp_ratio), act=act_layer)
-
-        self.window_size = window_size
-
-    def forward(self, x: torch.Tensor) -> torch.Tensor:
-        shortcut = x
-        x = self.norm1(x)
-        # Window partition
-        if self.window_size > 0:
-            H, W = x.shape[1], x.shape[2]
-            x, pad_hw = window_partition(x, self.window_size)
-
-        x = self.attn(x)
-        # Reverse window partition
-        if self.window_size > 0:
-            x = window_unpartition(x, self.window_size, pad_hw, (H, W))
-
-        x = shortcut + x
-        x = x + self.mlp(self.norm2(x))
-
-        return x
-
-
-class Attention(nn.Module):
-    """Multi-head Attention block with relative position embeddings."""
-
-    def __init__(
-        self,
-        dim: int,
-        num_heads: int = 8,
-        qkv_bias: bool = True,
-        use_rel_pos: bool = False,
-        rel_pos_zero_init: bool = True,
-        input_size: Optional[Tuple[int, int]] = None,
-    ) -> None:
-        """
-        Args:
-            dim (int): Number of input channels.
-            num_heads (int): Number of attention heads.
-            qkv_bias (bool:  If True, add a learnable bias to query, key, value.
-            rel_pos (bool): If True, add relative positional embeddings to the attention map.
-            rel_pos_zero_init (bool): If True, zero initialize relative positional parameters.
-            input_size (int or None): Input resolution for calculating the relative positional
-                parameter size.
-        """
-        super().__init__()
-        self.num_heads = num_heads
-        head_dim = dim // num_heads
-        self.scale = head_dim**-0.5
-
-        self.qkv = nn.Linear(dim, dim * 3, bias=qkv_bias)
-        self.proj = nn.Linear(dim, dim)
-
-        self.use_rel_pos = use_rel_pos
-        if self.use_rel_pos:
-            assert (
-                input_size is not None
-            ), "Input size must be provided if using relative positional encoding."
-            # initialize relative positional embeddings
-            self.rel_pos_h = nn.Parameter(torch.zeros(2 * input_size[0] - 1, head_dim))
-            self.rel_pos_w = nn.Parameter(torch.zeros(2 * input_size[1] - 1, head_dim))
-
-    def forward(self, x: torch.Tensor) -> torch.Tensor:
-        B, H, W, _ = x.shape
-        # qkv with shape (3, B, nHead, H * W, C)
-        qkv = self.qkv(x).reshape(B, H * W, 3, self.num_heads, -1).permute(2, 0, 3, 1, 4)
-        # q, k, v with shape (B * nHead, H * W, C)
-        q, k, v = qkv.reshape(3, B * self.num_heads, H * W, -1).unbind(0)
-
-        attn = (q * self.scale) @ k.transpose(-2, -1)
-
-        if self.use_rel_pos:
-            attn = add_decomposed_rel_pos(attn, q, self.rel_pos_h, self.rel_pos_w, (H, W), (H, W))
-
-        attn = attn.softmax(dim=-1)
-        x = (attn @ v).view(B, self.num_heads, H, W, -1).permute(0, 2, 3, 1, 4).reshape(B, H, W, -1)
-        x = self.proj(x)
-
-        return x
-
-
-def window_partition(x: torch.Tensor, window_size: int) -> Tuple[torch.Tensor, Tuple[int, int]]:
-    """
-    Partition into non-overlapping windows with padding if needed.
-    Args:
-        x (tensor): input tokens with [B, H, W, C].
-        window_size (int): window size.
-
-    Returns:
-        windows: windows after partition with [B * num_windows, window_size, window_size, C].
-        (Hp, Wp): padded height and width before partition
-    """
-    B, H, W, C = x.shape
-
-    pad_h = (window_size - H % window_size) % window_size
-    pad_w = (window_size - W % window_size) % window_size
-    if pad_h > 0 or pad_w > 0:
-        x = F.pad(x, (0, 0, 0, pad_w, 0, pad_h))
-    Hp, Wp = H + pad_h, W + pad_w
-
-    x = x.view(B, Hp // window_size, window_size, Wp // window_size, window_size, C)
-    windows = x.permute(0, 1, 3, 2, 4, 5).contiguous().view(-1, window_size, window_size, C)
-    return windows, (Hp, Wp)
-
-
-def window_unpartition(
-    windows: torch.Tensor, window_size: int, pad_hw: Tuple[int, int], hw: Tuple[int, int]
-) -> torch.Tensor:
-    """
-    Window unpartition into original sequences and removing padding.
-    Args:
-        x (tensor): input tokens with [B * num_windows, window_size, window_size, C].
-        window_size (int): window size.
-        pad_hw (Tuple): padded height and width (Hp, Wp).
-        hw (Tuple): original height and width (H, W) before padding.
-
-    Returns:
-        x: unpartitioned sequences with [B, H, W, C].
-    """
-    Hp, Wp = pad_hw
-    H, W = hw
-    B = windows.shape[0] // (Hp * Wp // window_size // window_size)
-    x = windows.view(B, Hp // window_size, Wp // window_size, window_size, window_size, -1)
-    x = x.permute(0, 1, 3, 2, 4, 5).contiguous().view(B, Hp, Wp, -1)
-
-    if Hp > H or Wp > W:
-        x = x[:, :H, :W, :].contiguous()
-    return x
-
-
-def get_rel_pos(q_size: int, k_size: int, rel_pos: torch.Tensor) -> torch.Tensor:
-    """
-    Get relative positional embeddings according to the relative positions of
-        query and key sizes.
-    Args:
-        q_size (int): size of query q.
-        k_size (int): size of key k.
-        rel_pos (Tensor): relative position embeddings (L, C).
-
-    Returns:
-        Extracted positional embeddings according to relative positions.
-    """
-    max_rel_dist = int(2 * max(q_size, k_size) - 1)
-    # Interpolate rel pos if needed.
-    if rel_pos.shape[0] != max_rel_dist:
-        # Interpolate rel pos.
-        rel_pos_resized = F.interpolate(
-            rel_pos.reshape(1, rel_pos.shape[0], -1).permute(0, 2, 1),
-            size=max_rel_dist,
-            mode="linear",
-        )
-        rel_pos_resized = rel_pos_resized.reshape(-1, max_rel_dist).permute(1, 0)
-    else:
-        rel_pos_resized = rel_pos
-
-    # Scale the coords with short length if shapes for q and k are different.
-    q_coords = torch.arange(q_size)[:, None] * max(k_size / q_size, 1.0)
-    k_coords = torch.arange(k_size)[None, :] * max(q_size / k_size, 1.0)
-    relative_coords = (q_coords - k_coords) + (k_size - 1) * max(q_size / k_size, 1.0)
-
-    return rel_pos_resized[relative_coords.long()]
-
-
-def add_decomposed_rel_pos(
-    attn: torch.Tensor,
-    q: torch.Tensor,
-    rel_pos_h: torch.Tensor,
-    rel_pos_w: torch.Tensor,
-    q_size: Tuple[int, int],
-    k_size: Tuple[int, int],
-) -> torch.Tensor:
-    """
-    Calculate decomposed Relative Positional Embeddings from :paper:`mvitv2`.
-    https://github.com/facebookresearch/mvit/blob/19786631e330df9f3622e5402b4a419a263a2c80/mvit/models/attention.py   # noqa B950
-    Args:
-        attn (Tensor): attention map.
-        q (Tensor): query q in the attention layer with shape (B, q_h * q_w, C).
-        rel_pos_h (Tensor): relative position embeddings (Lh, C) for height axis.
-        rel_pos_w (Tensor): relative position embeddings (Lw, C) for width axis.
-        q_size (Tuple): spatial sequence size of query q with (q_h, q_w).
-        k_size (Tuple): spatial sequence size of key k with (k_h, k_w).
-
-    Returns:
-        attn (Tensor): attention map with added relative positional embeddings.
-    """
-    q_h, q_w = q_size
-    k_h, k_w = k_size
-    Rh = get_rel_pos(q_h, k_h, rel_pos_h)
-    Rw = get_rel_pos(q_w, k_w, rel_pos_w)
-
-    B, _, dim = q.shape
-    r_q = q.reshape(B, q_h, q_w, dim)
-    rel_h = torch.einsum("bhwc,hkc->bhwk", r_q, Rh)
-    rel_w = torch.einsum("bhwc,wkc->bhwk", r_q, Rw)
-
-    attn = (
-        attn.view(B, q_h, q_w, k_h, k_w) + rel_h[:, :, :, :, None] + rel_w[:, :, :, None, :]
-    ).view(B, q_h * q_w, k_h * k_w)
-
-    return attn
-
-
-class PatchEmbed(nn.Module):
-    """
-    Image to Patch Embedding.
-    """
-
-    def __init__(
-        self,
-        kernel_size: Tuple[int, int] = (16, 16),
-        stride: Tuple[int, int] = (16, 16),
-        padding: Tuple[int, int] = (0, 0),
-        in_chans: int = 3,
-        embed_dim: int = 768,
-    ) -> None:
-        """
-        Args:
-            kernel_size (Tuple): kernel size of the projection layer.
-            stride (Tuple): stride of the projection layer.
-            padding (Tuple): padding size of the projection layer.
-            in_chans (int): Number of input image channels.
-            embed_dim (int):  embed_dim (int): Patch embedding dimension.
-        """
-        super().__init__()
-
-        self.proj = nn.Conv2d(
-            in_chans, embed_dim, kernel_size=kernel_size, stride=stride, padding=padding
-        )
-
-    def forward(self, x: torch.Tensor) -> torch.Tensor:
-        x = self.proj(x)
-        # B C H W -> B H W C
-        x = x.permute(0, 2, 3, 1)
-        return x
diff --git a/spaces/yizhangliu/Grounded-Segment-Anything/transformers_4_35_0/commands/lfs.py b/spaces/yizhangliu/Grounded-Segment-Anything/transformers_4_35_0/commands/lfs.py
deleted file mode 100644
index 25537f07911a2a2aeb9fb8df8e2091f1e9b14b4e..0000000000000000000000000000000000000000
--- a/spaces/yizhangliu/Grounded-Segment-Anything/transformers_4_35_0/commands/lfs.py
+++ /dev/null
@@ -1,226 +0,0 @@
-"""
-Implementation of a custom transfer agent for the transfer type "multipart" for git-lfs.
-
-Inspired by: github.com/cbartz/git-lfs-swift-transfer-agent/blob/master/git_lfs_swift_transfer.py
-
-Spec is: github.com/git-lfs/git-lfs/blob/master/docs/custom-transfers.md
-
-
-To launch debugger while developing:
-
-``` [lfs "customtransfer.multipart"]
-path = /path/to/transformers/.env/bin/python args = -m debugpy --listen 5678 --wait-for-client
-/path/to/transformers/src/transformers/commands/transformers_cli.py lfs-multipart-upload ```"""
-
-import json
-import os
-import subprocess
-import sys
-import warnings
-from argparse import ArgumentParser
-from contextlib import AbstractContextManager
-from typing import Dict, List, Optional
-
-import requests
-
-from ..utils import logging
-from . import BaseTransformersCLICommand
-
-
-logger = logging.get_logger(__name__)  # pylint: disable=invalid-name
-
-
-LFS_MULTIPART_UPLOAD_COMMAND = "lfs-multipart-upload"
-
-
-class LfsCommands(BaseTransformersCLICommand):
-    """
-    Implementation of a custom transfer agent for the transfer type "multipart" for git-lfs. This lets users upload
-    large files >5GB 🔥. Spec for LFS custom transfer agent is:
-    https://github.com/git-lfs/git-lfs/blob/master/docs/custom-transfers.md
-
-    This introduces two commands to the CLI:
-
-    1. $ transformers-cli lfs-enable-largefiles
-
-    This should be executed once for each model repo that contains a model file >5GB. It's documented in the error
-    message you get if you just try to git push a 5GB file without having enabled it before.
-
-    2. $ transformers-cli lfs-multipart-upload
-
-    This command is called by lfs directly and is not meant to be called by the user.
-    """
-
-    @staticmethod
-    def register_subcommand(parser: ArgumentParser):
-        enable_parser = parser.add_parser(
-            "lfs-enable-largefiles",
-            help=(
-                "Deprecated: use `huggingface-cli` instead. Configure your repository to enable upload of files > 5GB."
-            ),
-        )
-        enable_parser.add_argument("path", type=str, help="Local path to repository you want to configure.")
-        enable_parser.set_defaults(func=lambda args: LfsEnableCommand(args))
-
-        upload_parser = parser.add_parser(
-            LFS_MULTIPART_UPLOAD_COMMAND,
-            help=(
-                "Deprecated: use `huggingface-cli` instead. "
-                "Command will get called by git-lfs, do not call it directly."
-            ),
-        )
-        upload_parser.set_defaults(func=lambda args: LfsUploadCommand(args))
-
-
-class LfsEnableCommand:
-    def __init__(self, args):
-        self.args = args
-
-    def run(self):
-        warnings.warn(
-            "Managing repositories through transformers-cli is deprecated. Please use `huggingface-cli` instead."
-        )
-        local_path = os.path.abspath(self.args.path)
-        if not os.path.isdir(local_path):
-            print("This does not look like a valid git repo.")
-            exit(1)
-        subprocess.run(
-            "git config lfs.customtransfer.multipart.path transformers-cli".split(), check=True, cwd=local_path
-        )
-        subprocess.run(
-            f"git config lfs.customtransfer.multipart.args {LFS_MULTIPART_UPLOAD_COMMAND}".split(),
-            check=True,
-            cwd=local_path,
-        )
-        print("Local repo set up for largefiles")
-
-
-def write_msg(msg: Dict):
-    """Write out the message in Line delimited JSON."""
-    msg = json.dumps(msg) + "\n"
-    sys.stdout.write(msg)
-    sys.stdout.flush()
-
-
-def read_msg() -> Optional[Dict]:
-    """Read Line delimited JSON from stdin."""
-    msg = json.loads(sys.stdin.readline().strip())
-
-    if "terminate" in (msg.get("type"), msg.get("event")):
-        # terminate message received
-        return None
-
-    if msg.get("event") not in ("download", "upload"):
-        logger.critical("Received unexpected message")
-        sys.exit(1)
-
-    return msg
-
-
-class FileSlice(AbstractContextManager):
-    """
-    File-like object that only reads a slice of a file
-
-    Inspired by stackoverflow.com/a/29838711/593036
-    """
-
-    def __init__(self, filepath: str, seek_from: int, read_limit: int):
-        self.filepath = filepath
-        self.seek_from = seek_from
-        self.read_limit = read_limit
-        self.n_seen = 0
-
-    def __enter__(self):
-        self.f = open(self.filepath, "rb")
-        self.f.seek(self.seek_from)
-        return self
-
-    def __len__(self):
-        total_length = os.fstat(self.f.fileno()).st_size
-        return min(self.read_limit, total_length - self.seek_from)
-
-    def read(self, n=-1):
-        if self.n_seen >= self.read_limit:
-            return b""
-        remaining_amount = self.read_limit - self.n_seen
-        data = self.f.read(remaining_amount if n < 0 else min(n, remaining_amount))
-        self.n_seen += len(data)
-        return data
-
-    def __iter__(self):
-        yield self.read(n=4 * 1024 * 1024)
-
-    def __exit__(self, *args):
-        self.f.close()
-
-
-class LfsUploadCommand:
-    def __init__(self, args):
-        self.args = args
-
-    def run(self):
-        # Immediately after invoking a custom transfer process, git-lfs
-        # sends initiation data to the process over stdin.
-        # This tells the process useful information about the configuration.
-        init_msg = json.loads(sys.stdin.readline().strip())
-        if not (init_msg.get("event") == "init" and init_msg.get("operation") == "upload"):
-            write_msg({"error": {"code": 32, "message": "Wrong lfs init operation"}})
-            sys.exit(1)
-
-        # The transfer process should use the information it needs from the
-        # initiation structure, and also perform any one-off setup tasks it
-        # needs to do. It should then respond on stdout with a simple empty
-        # confirmation structure, as follows:
-        write_msg({})
-
-        # After the initiation exchange, git-lfs will send any number of
-        # transfer requests to the stdin of the transfer process, in a serial sequence.
-        while True:
-            msg = read_msg()
-            if msg is None:
-                # When all transfers have been processed, git-lfs will send
-                # a terminate event to the stdin of the transfer process.
-                # On receiving this message the transfer process should
-                # clean up and terminate. No response is expected.
-                sys.exit(0)
-
-            oid = msg["oid"]
-            filepath = msg["path"]
-            completion_url = msg["action"]["href"]
-            header = msg["action"]["header"]
-            chunk_size = int(header.pop("chunk_size"))
-            presigned_urls: List[str] = list(header.values())
-
-            parts = []
-            for i, presigned_url in enumerate(presigned_urls):
-                with FileSlice(filepath, seek_from=i * chunk_size, read_limit=chunk_size) as data:
-                    r = requests.put(presigned_url, data=data)
-                    r.raise_for_status()
-                    parts.append(
-                        {
-                            "etag": r.headers.get("etag"),
-                            "partNumber": i + 1,
-                        }
-                    )
-                    # In order to support progress reporting while data is uploading / downloading,
-                    # the transfer process should post messages to stdout
-                    write_msg(
-                        {
-                            "event": "progress",
-                            "oid": oid,
-                            "bytesSoFar": (i + 1) * chunk_size,
-                            "bytesSinceLast": chunk_size,
-                        }
-                    )
-                    # Not precise but that's ok.
-
-            r = requests.post(
-                completion_url,
-                json={
-                    "oid": oid,
-                    "parts": parts,
-                },
-            )
-            r.raise_for_status()
-
-            write_msg({"event": "complete", "oid": oid})
diff --git a/spaces/yizhangliu/Grounded-Segment-Anything/transformers_4_35_0/models/longt5/modeling_flax_longt5.py b/spaces/yizhangliu/Grounded-Segment-Anything/transformers_4_35_0/models/longt5/modeling_flax_longt5.py
deleted file mode 100644
index 6b7bc7c28fcf7b56f80fcf0a41c9d05d695e39a6..0000000000000000000000000000000000000000
--- a/spaces/yizhangliu/Grounded-Segment-Anything/transformers_4_35_0/models/longt5/modeling_flax_longt5.py
+++ /dev/null
@@ -1,2447 +0,0 @@
-# coding=utf-8
-# Copyright 2022 LongT5 Authors and HuggingFace Inc. team.
-#
-# Licensed under the Apache License, Version 2.0 (the "License");
-# you may not use this file except in compliance with the License.
-# You may obtain a copy of the License at
-#
-#     http://www.apache.org/licenses/LICENSE-2.0
-#
-# Unless required by applicable law or agreed to in writing, software
-# distributed under the License is distributed on an "AS IS" BASIS,
-# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-# See the License for the specific language governing permissions and
-# limitations under the License.
-""" Flax LongT5 model."""
-
-
-import copy
-from typing import Any, Callable, List, Optional, Tuple
-
-import flax.linen as nn
-import jax
-import jax.numpy as jnp
-import numpy as np
-from flax.core.frozen_dict import FrozenDict, freeze, unfreeze
-from flax.linen import combine_masks, make_causal_mask
-from flax.linen import partitioning as nn_partitioning
-from flax.linen.attention import dot_product_attention_weights
-from flax.traverse_util import flatten_dict, unflatten_dict
-from jax.random import PRNGKey
-
-from ...modeling_flax_outputs import (
-    FlaxBaseModelOutput,
-    FlaxBaseModelOutputWithPastAndCrossAttentions,
-    FlaxCausalLMOutputWithCrossAttentions,
-    FlaxSeq2SeqLMOutput,
-    FlaxSeq2SeqModelOutput,
-)
-from ...modeling_flax_utils import (
-    ACT2FN,
-    FlaxPreTrainedModel,
-    append_call_sample_docstring,
-    append_replace_return_docstrings,
-    overwrite_call_docstring,
-)
-from ...utils import add_start_docstrings, add_start_docstrings_to_model_forward, logging, replace_return_docstrings
-from .configuration_longt5 import LongT5Config
-
-
-logger = logging.get_logger(__name__)
-
-_CHECKPOINT_FOR_DOC = "google/long-t5-local-base"
-_CONFIG_FOR_DOC = "LongT5Config"
-
-remat = nn_partitioning.remat
-
-
-# Copied from transformers.models.bart.modeling_flax_bart.shift_tokens_right
-def shift_tokens_right(input_ids: jnp.array, pad_token_id: int, decoder_start_token_id: int) -> jnp.ndarray:
-    """
-    Shift input ids one token to the right.
-    """
-    shifted_input_ids = jnp.zeros_like(input_ids)
-    shifted_input_ids = shifted_input_ids.at[:, 1:].set(input_ids[:, :-1])
-    shifted_input_ids = shifted_input_ids.at[:, 0].set(decoder_start_token_id)
-
-    shifted_input_ids = jnp.where(shifted_input_ids == -100, pad_token_id, shifted_input_ids)
-    return shifted_input_ids
-
-
-def _pad_to_multiple(x: jnp.ndarray, block_len: int, axis: int, pad_value: int = 0) -> jnp.ndarray:
-    """Pad an array so that a sequence length will be a multiple of `block_len`"""
-    pad_len = -x.shape[axis] % block_len
-    pad = [(0, 0)] * x.ndim
-    pad[axis] = (0, pad_len)
-    x = jnp.pad(x, pad_width=pad, mode="constant", constant_values=pad_value)
-    return x
-
-
-def _split_into_blocks(x: jnp.ndarray, block_len: int, axis: int) -> jnp.ndarray:
-    """Split an input array into blocks of a given `block_len` along the given `axis`. If the dimension length
-    is not a multiple of `block_len`, it will be padded first with selected `pad_value`.
-    """
-    # pad tensor to multiple of block_len
-    if x.shape[axis] % block_len != 0:
-        x = _pad_to_multiple(x, block_len, axis, pad_value=0)
-    num_blocks = x.shape[axis] // block_len
-    output_shape = x.shape[:axis] + (num_blocks, block_len) + x.shape[(axis + 1) :]
-    return x.reshape(output_shape)
-
-
-def _concatenate_3_blocks(x: jnp.ndarray, block_axis: int, sequence_axis: int, pad_value: int = 0) -> jnp.ndarray:
-    """Concatenate three consecutive blocks for each input block for local attentiont.
-    For more information, see: https://arxiv.org/pdf/2112.07916.pdf.
-    """
-    num_blocks = x.shape[block_axis]
-
-    pad = [(0, 0)] * x.ndim
-    pad[block_axis] = (1, 1)
-    # [batch_size, num_blocks, block_len] -> [batch_size, num_blocks + 2, block_len]
-    x = jnp.pad(x, pad_width=pad, mode="constant", constant_values=pad_value)
-
-    blocks_list: List[np.array] = []
-    for i in range(3):
-        # We use indexing approach here:
-        # https://numpy.org/doc/stable/user/basics.indexing.html#dealing-with-variable-numbers-of-indices-within-programs
-        indices = [slice(0, None)] * x.ndim
-        indices[block_axis] = slice(i, i + num_blocks)
-        indices = tuple(indices)
-        blocks_list.append(x[indices])
-    return jnp.concatenate(blocks_list, axis=sequence_axis)  # [batch_size, num_blocks, 3 * block_len, ...]
-
-
-def _make_3block_relative_position_ids(block_len: int) -> jnp.ndarray:
-    """Makes 3-blocked relative position ids for local attention."""
-    position_ids = jnp.arange(3 * block_len, dtype=jnp.int32)
-    center_position_ids = position_ids[block_len:-block_len]
-    relative_position_ids = position_ids[None, :] - center_position_ids[:, None]  # [block_len, 3 * block_len]
-    return relative_position_ids
-
-
-def _mask_local_attention_mask(local_attention_mask: np.ndarray, block_len: int) -> jnp.ndarray:
-    """Mask local attention mask to enforce that tokens are not allowed to attend tokens farther than ``local_radius."""
-    relative_position_ids = _make_3block_relative_position_ids(block_len)
-    locality_mask = jnp.abs(relative_position_ids) < block_len
-    locality_mask = locality_mask[None, None, :, :]
-    return jnp.logical_and(local_attention_mask, locality_mask)
-
-
-def _get_local_attention_mask(attention_mask: np.ndarray, block_len: int) -> jnp.ndarray:
-    """Prepare attention mask to be applied for a local attention."""
-    # [batch_size, num_blocks, block_len]
-    _blocked_attention_mask = _split_into_blocks(attention_mask, block_len, axis=1)
-    # [batch_size, num_block, 3 * block_len]
-    _3blocked_attention_mask = _concatenate_3_blocks(_blocked_attention_mask, block_axis=1, sequence_axis=2)
-
-    _blocked_attention_mask = _blocked_attention_mask[..., None]
-    _3blocked_attention_mask = _3blocked_attention_mask[..., None, :]
-    # [batch_size, num_block, block_len, 3 * block_len]
-    local_attention_mask = jnp.logical_and(_blocked_attention_mask, _3blocked_attention_mask)
-    local_attention_mask = _mask_local_attention_mask(local_attention_mask, block_len)
-    # [batch_size, 1, num_block, block_len, 3 * block_len]
-    return local_attention_mask[:, None, ...]
-
-
-def _make_global_fixed_block_ids(attention_mask: np.ndarray, global_block_size: int) -> Tuple[jnp.ndarray, np.ndarray]:
-    """Obtain the "fixed block" global id corresponding to each input token.
-
-    This implementation is a simlified version of the original Flaxformr implementation adopted from:
-    https://github.com/google/flaxformer/blob/main/flaxformer/architectures/longt5/long_attention.py.
-
-    In our scenario, as we use this strategy only for a decoder, orphan tokens, i.e. those tokens which do not make for
-    the whole fixed block, are assigned to the preceding block.
-
-    Padding tokens from the original sequence are represented by -1.
-    """
-    batch_size, seq_len = attention_mask.shape[:2]
-
-    def handle_orphan_tokens(block_ids: np.ndarray) -> jnp.ndarray:
-        block_ends = (jnp.arange(seq_len) % global_block_size) == global_block_size - 1
-        true_block_ends = jnp.logical_and(block_ends, block_ids >= 0)
-        full_blocks = true_block_ends.sum(-1)[..., None]
-        block_ids = jnp.minimum(block_ids, full_blocks - 1)
-        return block_ids
-
-    fixed_block_mask = jnp.ones_like(attention_mask) / global_block_size
-    fixed_block_mask = jnp.cumsum(fixed_block_mask, axis=1) - fixed_block_mask
-    mask = jnp.where(attention_mask != 0.0, 1.0, -1000.0)
-    global_block_ids = jnp.maximum(
-        jnp.floor(mask + fixed_block_mask - 1.0), jnp.array(-1.0, dtype=attention_mask.dtype)
-    )
-    # set padding tokens to -1
-    global_block_ids = (global_block_ids * attention_mask) + (attention_mask - 1)
-    # [batch_size, seq_len]
-    global_block_ids = handle_orphan_tokens(global_block_ids)
-    num_globals = seq_len // global_block_size
-
-    # [batch_size, seq_len // global_block_size]
-    if num_globals > 0:
-        _sequence_block_ids_max = jnp.repeat(global_block_ids.max(axis=-1)[:, None], repeats=num_globals, axis=1)
-    else:
-        _sequence_block_ids_max = jnp.zeros((batch_size, 0), dtype=global_block_ids.dtype)
-    global_segment_ids = jnp.cumsum(jnp.ones((batch_size, num_globals)), axis=-1) - 1
-    global_segment_ids = jnp.where(global_segment_ids <= _sequence_block_ids_max, 1, 0)
-    return global_block_ids, global_segment_ids
-
-
-def _make_side_relative_position_ids(attention_mask: np.ndarray, global_block_size: int) -> np.ndarray:
-    """Create the relative position tensor for local -> global attention."""
-    block_ids, global_segment_ids = _make_global_fixed_block_ids(attention_mask, global_block_size)
-    global_seq_len = global_segment_ids.shape[-1]
-    global_positions = jnp.arange(global_seq_len)
-    side_relative_position = global_positions - block_ids[..., None]
-    return side_relative_position
-
-
-def _create_global_aggregates(hidden_states: np.ndarray, block_ids: np.ndarray, global_seq_len: int) -> np.ndarray:
-    """Compute individual block aggregates by summing over individual blocks."""
-    # (batch..., seq_len, global_seq_len))
-    one_hot_block_ids = jax.nn.one_hot(block_ids, global_seq_len)
-    return jnp.einsum("...nd,...ng->...gd", hidden_states, one_hot_block_ids)
-
-
-# Copied from transformers.models.t5.modeling_flax_t5.FlaxT5LayerNorm with T5->LongT5
-class FlaxLongT5LayerNorm(nn.Module):
-    hidden_size: int
-    dtype: jnp.dtype = jnp.float32
-    eps: float = 1e-6
-    weight_init: Callable[..., np.ndarray] = jax.nn.initializers.ones
-
-    def setup(self):
-        self.weight = self.param("weight", self.weight_init, (self.hidden_size,))
-
-    def __call__(self, hidden_states):
-        """
-        Construct a layernorm module in the LongT5 style; No bias and no subtraction of mean.
-        """
-        # layer norm should always be calculated in float32
-        variance = jnp.power(hidden_states.astype("f4"), 2).mean(axis=-1, keepdims=True)
-        hidden_states = hidden_states / jnp.sqrt(variance + self.eps)
-
-        return self.weight * hidden_states
-
-
-# Copied from transformers.models.t5.modeling_flax_t5.FlaxT5DenseActDense with T5->LongT5
-class FlaxLongT5DenseActDense(nn.Module):
-    config: LongT5Config
-    dtype: jnp.dtype = jnp.float32
-
-    def setup(self):
-        wi_init_std = self.config.initializer_factor * (self.config.d_model**-0.5)
-        wo_init_std = self.config.initializer_factor * (self.config.d_ff**-0.5)
-
-        self.wi = nn.Dense(
-            self.config.d_ff,
-            use_bias=False,
-            kernel_init=jax.nn.initializers.normal(wi_init_std),
-            dtype=self.dtype,
-        )
-        self.wo = nn.Dense(
-            self.config.d_model,
-            use_bias=False,
-            kernel_init=jax.nn.initializers.normal(wo_init_std),
-            dtype=self.dtype,
-        )
-        self.dropout = nn.Dropout(self.config.dropout_rate)
-        self.act = ACT2FN[self.config.dense_act_fn]
-
-    def __call__(self, hidden_states, deterministic=True):
-        hidden_states = self.wi(hidden_states)
-        hidden_states = self.act(hidden_states)
-        hidden_states = self.dropout(hidden_states, deterministic=deterministic)
-        hidden_states = self.wo(hidden_states)
-        return hidden_states
-
-
-# Copied from transformers.models.t5.modeling_flax_t5.FlaxT5DenseGatedActDense with T5->LongT5
-class FlaxLongT5DenseGatedActDense(nn.Module):
-    config: LongT5Config
-    dtype: jnp.dtype = jnp.float32  # the dtype of the computation
-
-    def setup(self):
-        wi_init_std = self.config.initializer_factor * (self.config.d_model**-0.5)
-        wo_init_std = self.config.initializer_factor * (self.config.d_ff**-0.5)
-
-        self.wi_0 = nn.Dense(
-            self.config.d_ff,
-            use_bias=False,
-            kernel_init=jax.nn.initializers.normal(wi_init_std),
-            dtype=self.dtype,
-        )
-        self.wi_1 = nn.Dense(
-            self.config.d_ff,
-            use_bias=False,
-            kernel_init=jax.nn.initializers.normal(wi_init_std),
-            dtype=self.dtype,
-        )
-        self.wo = nn.Dense(
-            self.config.d_model,
-            use_bias=False,
-            kernel_init=jax.nn.initializers.normal(wo_init_std),
-            dtype=self.dtype,
-        )
-        self.dropout = nn.Dropout(self.config.dropout_rate)
-        self.act = ACT2FN[self.config.dense_act_fn]
-
-    def __call__(self, hidden_states, deterministic):
-        hidden_gelu = self.act(self.wi_0(hidden_states))
-        hidden_linear = self.wi_1(hidden_states)
-        hidden_states = hidden_gelu * hidden_linear
-        hidden_states = self.dropout(hidden_states, deterministic=deterministic)
-        hidden_states = self.wo(hidden_states)
-        return hidden_states
-
-
-# Copied from transformers.models.t5.modeling_flax_t5.FlaxT5LayerFF with T5->LongT5
-class FlaxLongT5LayerFF(nn.Module):
-    config: LongT5Config
-    dtype: jnp.dtype = jnp.float32  # the dtype of the computation
-
-    def setup(self):
-        if self.config.is_gated_act:
-            self.DenseReluDense = FlaxLongT5DenseGatedActDense(self.config, dtype=self.dtype)
-        else:
-            self.DenseReluDense = FlaxLongT5DenseActDense(self.config, dtype=self.dtype)
-
-        self.layer_norm = FlaxLongT5LayerNorm(
-            self.config.d_model, eps=self.config.layer_norm_epsilon, dtype=self.dtype
-        )
-        self.dropout = nn.Dropout(self.config.dropout_rate)
-
-    def __call__(self, hidden_states, deterministic=True):
-        forwarded_states = self.layer_norm(hidden_states)
-        forwarded_states = self.DenseReluDense(forwarded_states, deterministic=deterministic)
-        hidden_states = hidden_states + self.dropout(forwarded_states, deterministic=deterministic)
-        return hidden_states
-
-
-# Copied from transformers.models.t5.modeling_flax_t5.FlaxT5Attention with T5->LongT5
-class FlaxLongT5Attention(nn.Module):
-    config: LongT5Config
-    has_relative_attention_bias: bool = False
-    causal: bool = False
-    dtype: jnp.dtype = jnp.float32  # the dtype of the computation
-
-    def setup(self):
-        self.relative_attention_num_buckets = self.config.relative_attention_num_buckets
-        self.relative_attention_max_distance = self.config.relative_attention_max_distance
-        self.d_model = self.config.d_model
-        self.key_value_proj_dim = self.config.d_kv
-        self.n_heads = self.config.num_heads
-        self.dropout = self.config.dropout_rate
-        self.inner_dim = self.n_heads * self.key_value_proj_dim
-
-        q_init_std = self.config.initializer_factor * ((self.inner_dim * self.key_value_proj_dim) ** -0.5)
-        kv_init_std = self.config.initializer_factor * (self.inner_dim**-0.5)
-        o_init_std = self.config.initializer_factor * (self.inner_dim**-0.5)
-
-        self.q = nn.Dense(
-            self.inner_dim,
-            use_bias=False,
-            kernel_init=jax.nn.initializers.normal(q_init_std),
-            dtype=self.dtype,
-        )
-        self.k = nn.Dense(
-            self.inner_dim,
-            use_bias=False,
-            kernel_init=jax.nn.initializers.normal(kv_init_std),
-            dtype=self.dtype,
-        )
-        self.v = nn.Dense(
-            self.inner_dim,
-            use_bias=False,
-            kernel_init=jax.nn.initializers.normal(kv_init_std),
-            dtype=self.dtype,
-        )
-        self.o = nn.Dense(
-            self.d_model,
-            use_bias=False,
-            kernel_init=jax.nn.initializers.normal(o_init_std),
-            dtype=self.dtype,
-        )
-
-        if self.has_relative_attention_bias:
-            self.relative_attention_bias = nn.Embed(
-                self.relative_attention_num_buckets,
-                self.n_heads,
-                embedding_init=jax.nn.initializers.normal(kv_init_std),
-                dtype=self.dtype,
-            )
-
-    @staticmethod
-    def _relative_position_bucket(relative_position, bidirectional=True, num_buckets=32, max_distance=128):
-        """
-        Adapted from Mesh Tensorflow:
-        https://github.com/tensorflow/mesh/blob/0cb87fe07da627bf0b7e60475d59f95ed6b5be3d/mesh_tensorflow/transformer/transformer_layers.py#L593
-
-        Translate relative position to a bucket number for relative attention. The relative position is defined as
-        memory_position - query_position, i.e. the distance in tokens from the attending position to the attended-to
-        position. If bidirectional=False, then positive relative positions are invalid. We use smaller buckets for
-        small absolute relative_position and larger buckets for larger absolute relative_positions. All relative
-        positions >=max_distance map to the same bucket. All relative positions <=-max_distance map to the same bucket.
-        This should allow for more graceful generalization to longer sequences than the model has been trained on
-        """
-        relative_buckets = 0
-        if bidirectional:
-            num_buckets //= 2
-            relative_buckets += (relative_position > 0) * num_buckets
-            relative_position = jnp.abs(relative_position)
-        else:
-            relative_position = -jnp.clip(relative_position, a_max=0)
-        # now relative_position is in the range [0, inf)
-
-        # half of the buckets are for exact increments in positions
-        max_exact = num_buckets // 2
-        is_small = relative_position < max_exact
-
-        # The other half of the buckets are for logarithmically bigger bins in positions up to max_distance
-        relative_position_if_large = max_exact + (
-            jnp.log(relative_position / max_exact) / jnp.log(max_distance / max_exact) * (num_buckets - max_exact)
-        )
-        relative_position_if_large = jnp.clip(relative_position_if_large, a_max=num_buckets - 1)
-
-        relative_buckets += jnp.where(is_small, relative_position, relative_position_if_large)
-
-        return relative_buckets.astype("i4")
-
-    def compute_bias(self, query_length, key_length):
-        """Compute binned relative position bias"""
-        context_position = jnp.arange(query_length, dtype="i4")[:, None]
-        memory_position = jnp.arange(key_length, dtype="i4")[None, :]
-
-        relative_position = memory_position - context_position
-        relative_position_bucket = self._relative_position_bucket(
-            relative_position,
-            bidirectional=(not self.causal),
-            num_buckets=self.relative_attention_num_buckets,
-            max_distance=self.relative_attention_max_distance,
-        )
-
-        values = self.relative_attention_bias(relative_position_bucket)
-        values = values.transpose((2, 0, 1))[None, :, :, :]
-        return values
-
-    def _split_heads(self, hidden_states):
-        return hidden_states.reshape(hidden_states.shape[:2] + (self.n_heads, self.key_value_proj_dim))
-
-    def _merge_heads(self, hidden_states):
-        return hidden_states.reshape(hidden_states.shape[:2] + (self.inner_dim,))
-
-    @nn.compact
-    def _concatenate_to_cache(self, key, value, query, attention_mask):
-        """
-        This function takes projected key, value states from a single input token and concatenates the states to cached
-        states from previous steps. This function is slighly adapted from the official Flax repository:
-        https://github.com/google/flax/blob/491ce18759622506588784b4fca0e4bf05f8c8cd/flax/linen/attention.py#L252
-        """
-        # detect if we're initializing by absence of existing cache data.
-        is_initialized = self.has_variable("cache", "cached_key")
-        cached_key = self.variable("cache", "cached_key", jnp.zeros, key.shape, key.dtype)
-        cached_value = self.variable("cache", "cached_value", jnp.zeros, value.shape, value.dtype)
-        cache_index = self.variable("cache", "cache_index", lambda: jnp.array(0, dtype=jnp.int32))
-
-        if is_initialized:
-            *batch_dims, max_length, num_heads, depth_per_head = cached_key.value.shape
-            # update key, value caches with our new 1d spatial slices
-            cur_index = cache_index.value
-            indices = (0,) * len(batch_dims) + (cur_index, 0, 0)
-            key = jax.lax.dynamic_update_slice(cached_key.value, key, indices)
-            value = jax.lax.dynamic_update_slice(cached_value.value, value, indices)
-            cached_key.value = key
-            cached_value.value = value
-            num_updated_cache_vectors = query.shape[1]
-            cache_index.value = cache_index.value + num_updated_cache_vectors
-            # causal mask for cached decoder self-attention: our single query position should only attend to those key positions
-            # that have already been generated and cached, not the remaining zero elements.
-            pad_mask = jnp.broadcast_to(
-                jnp.arange(max_length) < cur_index + num_updated_cache_vectors,
-                tuple(batch_dims) + (1, num_updated_cache_vectors, max_length),
-            )
-            attention_mask = combine_masks(pad_mask, attention_mask)
-        return key, value, attention_mask
-
-    def _create_position_bias(
-        self, key_states, query_states, attention_mask, init_cache, seq_length, causal_attention_mask_shift
-    ):
-        cache_is_filled = self.causal and self.has_variable("cache", "cached_key") and (not init_cache)
-        key_length = key_states.shape[1]
-        query_length = key_length if cache_is_filled else query_states.shape[1]
-
-        if self.has_relative_attention_bias:
-            position_bias = self.compute_bias(query_length, key_length)
-        elif attention_mask is not None:
-            position_bias = jnp.zeros_like(attention_mask)
-        else:
-            position_bias = jnp.zeros((1, self.n_heads, query_length, key_length), dtype=self.dtype)
-
-        # if key and values are already calculated, only the last query position bias should be taken
-        if cache_is_filled:
-            max_decoder_length = self.variables["cache"]["cached_key"].shape[1]
-            position_bias = jax.lax.dynamic_slice(
-                position_bias,
-                (0, 0, causal_attention_mask_shift, 0),
-                (1, self.n_heads, seq_length, max_decoder_length),
-            )
-        return position_bias
-
-    def __call__(
-        self,
-        hidden_states,
-        attention_mask=None,
-        key_value_states=None,
-        position_bias=None,
-        use_cache=False,
-        output_attentions=False,
-        deterministic=True,
-        init_cache=False,
-    ):
-        """
-        Self-attention (if key_value_states is None) or attention over source sentence (provided by key_value_states).
-        """
-        batch_size, seq_length = hidden_states.shape[:2]
-
-        # q, k, v projections
-        query_states = self.q(hidden_states)  # (batch_size, n_heads, seq_length, dim_per_head)
-        key_states = self.k(hidden_states) if key_value_states is None else self.k(key_value_states)
-        value_states = self.v(hidden_states) if key_value_states is None else self.v(key_value_states)
-
-        # reshape to (batch_size, seq_length, n_heads, head_dim)
-        query_states = self._split_heads(query_states)
-        key_states = self._split_heads(key_states)
-        value_states = self._split_heads(value_states)
-
-        # counter-act scaling in dot_product_attention_weights function
-        query_states *= jnp.sqrt(query_states.shape[-1])
-
-        # for fast decoding causal attention mask should be shifted
-        causal_attention_mask_shift = (
-            self.variables["cache"]["cache_index"] if (self.has_variable("cache", "cached_key") and self.causal) else 0
-        )
-        # create causal attention_mask; attention_mask has to be defined when model is causal
-        if self.causal:
-            causal_attention_mask = make_causal_mask(attention_mask, dtype="bool")
-
-            # fast decoding for generate requires special attention_mask
-            if self.has_variable("cache", "cached_key"):
-                max_decoder_length = self.variables["cache"]["cached_key"].shape[1]
-                causal_attention_mask = jax.lax.dynamic_slice(
-                    causal_attention_mask,
-                    (0, 0, causal_attention_mask_shift, 0),
-                    (1, 1, seq_length, max_decoder_length),
-                )
-
-            # broadcast causal attention mask & attention mask to fit for merge
-            causal_attention_mask = jnp.broadcast_to(
-                causal_attention_mask, (batch_size,) + causal_attention_mask.shape[1:]
-            )
-            attention_mask = jnp.broadcast_to(
-                jnp.expand_dims(attention_mask, axis=(-3, -2)), causal_attention_mask.shape
-            )
-            attention_mask = combine_masks(attention_mask, causal_attention_mask)
-        elif attention_mask is not None:
-            attention_mask = jnp.expand_dims(attention_mask, axis=(-3, -2))
-
-        # During fast autoregressive decoding, we feed one position at a time,
-        # and cache the keys and values step by step.
-        if self.causal and (self.has_variable("cache", "cached_key") or init_cache):
-            key_states, value_states, attention_attention_mask = self._concatenate_to_cache(
-                key_states, value_states, query_states, attention_mask
-            )
-
-        # replace masked positions with -10_000
-        if attention_mask is not None:
-            mask_value = jnp.finfo(self.dtype).min
-            attention_mask = jax.lax.select(
-                attention_mask > 0,
-                jnp.full(attention_mask.shape, 0.0).astype(self.dtype),
-                jnp.full(attention_mask.shape, mask_value).astype(self.dtype),
-            )
-
-        if position_bias is None:
-            # compute position bias (only for first layer)
-            position_bias = self._create_position_bias(
-                key_states, query_states, attention_mask, init_cache, seq_length, causal_attention_mask_shift
-            )
-
-            if attention_mask is not None:
-                position_bias = position_bias + attention_mask
-
-        # create dropout rng
-        dropout_rng = None
-        if not deterministic and self.dropout > 0.0:
-            dropout_rng = self.make_rng("dropout")
-
-        # Softmax(QK^T)
-        attn_weights = dot_product_attention_weights(
-            query_states,
-            key_states,
-            bias=position_bias,
-            dropout_rng=dropout_rng,
-            dropout_rate=self.dropout,
-            broadcast_dropout=True,
-            deterministic=deterministic,
-            dtype=self.dtype,
-        )
-
-        # multiply with value states
-        attn_output = jnp.einsum("...hqk,...khd->...qhd", attn_weights, value_states)
-
-        # bring back to (batch_size, seq_length, d_model)
-        attn_output = self._merge_heads(attn_output)
-
-        # apply output matrix
-        attn_output = self.o(attn_output)
-
-        outputs = (attn_output, position_bias)
-
-        if output_attentions:
-            outputs = outputs + (attn_weights,)
-
-        return outputs
-
-
-class FlaxLongT5LocalAttention(nn.Module):
-    config: LongT5Config
-    has_relative_attention_bias: bool = False
-    dtype: jnp.dtype = jnp.float32  # the dtype of the computation
-
-    def setup(self):
-        self.relative_attention_num_buckets = self.config.relative_attention_num_buckets
-        self.relative_attention_max_distance = self.config.relative_attention_max_distance
-        self.d_model = self.config.d_model
-        self.key_value_proj_dim = self.config.d_kv
-        self.n_heads = self.config.num_heads
-        self.local_radius = self.config.local_radius
-        self.block_len = self.local_radius + 1
-        self.dropout = self.config.dropout_rate
-        self.inner_dim = self.n_heads * self.key_value_proj_dim
-
-        q_init_std = self.config.initializer_factor * ((self.inner_dim * self.key_value_proj_dim) ** -0.5)
-        kv_init_std = self.config.initializer_factor * (self.inner_dim**-0.5)
-        o_init_std = self.config.initializer_factor * (self.inner_dim**-0.5)
-
-        self.q = nn.Dense(
-            self.inner_dim,
-            use_bias=False,
-            kernel_init=jax.nn.initializers.normal(q_init_std),
-            dtype=self.dtype,
-        )
-        self.k = nn.Dense(
-            self.inner_dim,
-            use_bias=False,
-            kernel_init=jax.nn.initializers.normal(kv_init_std),
-            dtype=self.dtype,
-        )
-        self.v = nn.Dense(
-            self.inner_dim,
-            use_bias=False,
-            kernel_init=jax.nn.initializers.normal(kv_init_std),
-            dtype=self.dtype,
-        )
-        self.o = nn.Dense(
-            self.d_model,
-            use_bias=False,
-            kernel_init=jax.nn.initializers.normal(o_init_std),
-            dtype=self.dtype,
-        )
-
-        if self.has_relative_attention_bias:
-            self.relative_attention_bias = nn.Embed(
-                self.relative_attention_num_buckets,
-                self.n_heads,
-                embedding_init=jax.nn.initializers.normal(kv_init_std),
-            )
-
-    @staticmethod
-    # Copied from transformers.models.t5.modeling_flax_t5.FlaxT5Attention._relative_position_bucket
-    def _relative_position_bucket(relative_position, bidirectional=True, num_buckets=32, max_distance=128):
-        """
-        Adapted from Mesh Tensorflow:
-        https://github.com/tensorflow/mesh/blob/0cb87fe07da627bf0b7e60475d59f95ed6b5be3d/mesh_tensorflow/transformer/transformer_layers.py#L593
-
-        Translate relative position to a bucket number for relative attention. The relative position is defined as
-        memory_position - query_position, i.e. the distance in tokens from the attending position to the attended-to
-        position. If bidirectional=False, then positive relative positions are invalid. We use smaller buckets for
-        small absolute relative_position and larger buckets for larger absolute relative_positions. All relative
-        positions >=max_distance map to the same bucket. All relative positions <=-max_distance map to the same bucket.
-        This should allow for more graceful generalization to longer sequences than the model has been trained on
-        """
-        relative_buckets = 0
-        if bidirectional:
-            num_buckets //= 2
-            relative_buckets += (relative_position > 0) * num_buckets
-            relative_position = jnp.abs(relative_position)
-        else:
-            relative_position = -jnp.clip(relative_position, a_max=0)
-        # now relative_position is in the range [0, inf)
-
-        # half of the buckets are for exact increments in positions
-        max_exact = num_buckets // 2
-        is_small = relative_position < max_exact
-
-        # The other half of the buckets are for logarithmically bigger bins in positions up to max_distance
-        relative_position_if_large = max_exact + (
-            jnp.log(relative_position / max_exact) / jnp.log(max_distance / max_exact) * (num_buckets - max_exact)
-        )
-        relative_position_if_large = jnp.clip(relative_position_if_large, a_max=num_buckets - 1)
-
-        relative_buckets += jnp.where(is_small, relative_position, relative_position_if_large)
-
-        return relative_buckets.astype("i4")
-
-    def compute_bias(self, block_length: int):
-        """Compute binned relative position bias"""
-        memory_position = jnp.arange(3 * block_length, dtype="i4")
-        context_position = memory_position[block_length:-block_length]
-
-        relative_position = memory_position[None, :] - context_position[:, None]
-        relative_position_bucket = self._relative_position_bucket(
-            relative_position,
-            bidirectional=True,
-            num_buckets=self.relative_attention_num_buckets,
-            max_distance=self.relative_attention_max_distance,
-        )
-
-        values = self.relative_attention_bias(relative_position_bucket)
-        values = values.transpose((2, 0, 1))[None, None, :, :, :]
-        return values
-
-    def _split_heads(self, hidden_states):
-        return hidden_states.reshape(hidden_states.shape[:2] + (self.n_heads, self.key_value_proj_dim))
-
-    def _merge_heads(self, hidden_states):
-        return hidden_states.reshape(hidden_states.shape[0], -1, self.inner_dim)
-
-    def _create_position_bias(self, block_len: int, attention_mask: Optional[np.ndarray]) -> np.ndarray:
-        # position_bias shape: # (1, 1, n_heads, block_len, 3 * block_len)
-        if self.has_relative_attention_bias:
-            position_bias = self.compute_bias(block_len)
-        elif attention_mask is not None:
-            position_bias = jnp.zeros_like(attention_mask)
-        else:
-            position_bias = jnp.zeros((1, 1, self.n_heads, block_len, 3 * block_len), dtype=self.dtype)
-
-        return position_bias
-
-    def __call__(
-        self,
-        hidden_states,
-        attention_mask=None,
-        key_value_states=None,
-        position_bias=None,
-        output_attentions=False,
-        deterministic=True,
-    ):
-        """
-        Self-attention (if key_value_states is None) or attention over source sentence (provided by key_value_states).
-        """
-        batch_size, seq_length = hidden_states.shape[:2]
-
-        # q, k, v projections
-        query_states = self.q(hidden_states)  # (batch_size, n_heads, seq_length, dim_per_head)
-        key_states = self.k(hidden_states) if key_value_states is None else self.k(key_value_states)
-        value_states = self.v(hidden_states) if key_value_states is None else self.v(key_value_states)
-
-        # reshape to (batch_size, seq_length, n_heads, head_dim)
-        query_states = self._split_heads(query_states)
-        key_states = self._split_heads(key_states)
-        value_states = self._split_heads(value_states)
-
-        # Split into blocks -> (batch_size, num_blocks, block_len, n_heads, head_dim)
-        query_states = _split_into_blocks(query_states, self.block_len, axis=1)
-        key_states = _split_into_blocks(key_states, self.block_len, axis=1)
-        value_states = _split_into_blocks(value_states, self.block_len, axis=1)
-
-        # Concatenate 3 blocks for keys and values -> (batch_size, num_blocks, 3 * block_len, n_heads, dim_per_head)
-        key_states = _concatenate_3_blocks(key_states, block_axis=1, sequence_axis=2)
-        value_states = _concatenate_3_blocks(value_states, block_axis=1, sequence_axis=2)
-
-        # counter-act scaling in dot_product_attention_weights function
-        query_states *= jnp.sqrt(query_states.shape[-1])
-
-        if attention_mask is not None:
-            attention_mask = _get_local_attention_mask(attention_mask, self.block_len)
-
-            # replace masked positions with -10_000
-            attention_mask = jax.lax.select(
-                attention_mask > 0,
-                jnp.full(attention_mask.shape, 0.0).astype(self.dtype),
-                jnp.full(attention_mask.shape, -1e10).astype(self.dtype),
-            )
-
-        if position_bias is None:
-            # compute position bias (only for first layer)
-            position_bias = self._create_position_bias(self.block_len, attention_mask)
-
-            if attention_mask is not None:
-                position_bias = position_bias + attention_mask.swapaxes(1, 2)
-
-        # create dropout rng
-        dropout_rng = None
-        if not deterministic and self.dropout > 0.0:
-            dropout_rng = self.make_rng("dropout")
-
-        # Softmax(QK^T)
-        attn_weights = dot_product_attention_weights(
-            query_states,
-            key_states,
-            bias=position_bias,
-            dropout_rng=dropout_rng,
-            dropout_rate=self.dropout,
-            broadcast_dropout=True,
-            deterministic=deterministic,
-            dtype=self.dtype,
-        )
-
-        # multiply with value states
-        attn_output = jnp.einsum("...hqk,...khd->...qhd", attn_weights, value_states)
-
-        # bring back to (batch_size, seq_length, d_model)
-        attn_output = self._merge_heads(attn_output)
-        attn_output = attn_output[:, :seq_length, :]
-
-        # apply output matrix
-        attn_output = self.o(attn_output)
-
-        outputs = (attn_output, position_bias)
-
-        if output_attentions:
-            outputs = outputs + (attn_weights,)
-
-        return outputs
-
-
-class FlaxLongT5TransientGlobalAttention(nn.Module):
-    config: LongT5Config
-    has_relative_attention_bias: bool = False
-    dtype: jnp.dtype = jnp.float32  # the dtype of the computation
-
-    def setup(self):
-        self.relative_attention_num_buckets = self.config.relative_attention_num_buckets
-        self.relative_attention_max_distance = self.config.relative_attention_max_distance
-        self.d_model = self.config.d_model
-        self.key_value_proj_dim = self.config.d_kv
-        self.n_heads = self.config.num_heads
-        self.local_radius = self.config.local_radius
-        self.block_len = self.local_radius + 1
-        self.global_block_size = self.config.global_block_size
-        self.dropout = self.config.dropout_rate
-        self.inner_dim = self.n_heads * self.key_value_proj_dim
-
-        q_init_std = self.config.initializer_factor * ((self.inner_dim * self.key_value_proj_dim) ** -0.5)
-        kv_init_std = self.config.initializer_factor * (self.inner_dim**-0.5)
-        o_init_std = self.config.initializer_factor * (self.inner_dim**-0.5)
-
-        self.q = nn.Dense(
-            self.inner_dim,
-            use_bias=False,
-            kernel_init=jax.nn.initializers.normal(q_init_std),
-            dtype=self.dtype,
-        )
-        self.k = nn.Dense(
-            self.inner_dim,
-            use_bias=False,
-            kernel_init=jax.nn.initializers.normal(kv_init_std),
-            dtype=self.dtype,
-        )
-        self.v = nn.Dense(
-            self.inner_dim,
-            use_bias=False,
-            kernel_init=jax.nn.initializers.normal(kv_init_std),
-            dtype=self.dtype,
-        )
-        self.o = nn.Dense(
-            self.d_model,
-            use_bias=False,
-            kernel_init=jax.nn.initializers.normal(o_init_std),
-            dtype=self.dtype,
-        )
-
-        if self.has_relative_attention_bias:
-            self.relative_attention_bias = nn.Embed(
-                self.relative_attention_num_buckets,
-                self.n_heads,
-                embedding_init=jax.nn.initializers.normal(kv_init_std),
-            )
-
-        # Relativen attention bias & Layer norm for global attention
-        if self.has_relative_attention_bias:
-            self.global_relative_attention_bias = nn.Embed(
-                self.relative_attention_num_buckets,
-                self.n_heads,
-                embedding_init=jax.nn.initializers.normal(kv_init_std),
-            )
-        self.global_input_layer_norm = FlaxLongT5LayerNorm(
-            self.config.d_model, eps=self.config.layer_norm_epsilon, dtype=self.dtype
-        )
-
-    @staticmethod
-    # Copied from transformers.models.t5.modeling_flax_t5.FlaxT5Attention._relative_position_bucket
-    def _relative_position_bucket(relative_position, bidirectional=True, num_buckets=32, max_distance=128):
-        """
-        Adapted from Mesh Tensorflow:
-        https://github.com/tensorflow/mesh/blob/0cb87fe07da627bf0b7e60475d59f95ed6b5be3d/mesh_tensorflow/transformer/transformer_layers.py#L593
-
-        Translate relative position to a bucket number for relative attention. The relative position is defined as
-        memory_position - query_position, i.e. the distance in tokens from the attending position to the attended-to
-        position. If bidirectional=False, then positive relative positions are invalid. We use smaller buckets for
-        small absolute relative_position and larger buckets for larger absolute relative_positions. All relative
-        positions >=max_distance map to the same bucket. All relative positions <=-max_distance map to the same bucket.
-        This should allow for more graceful generalization to longer sequences than the model has been trained on
-        """
-        relative_buckets = 0
-        if bidirectional:
-            num_buckets //= 2
-            relative_buckets += (relative_position > 0) * num_buckets
-            relative_position = jnp.abs(relative_position)
-        else:
-            relative_position = -jnp.clip(relative_position, a_max=0)
-        # now relative_position is in the range [0, inf)
-
-        # half of the buckets are for exact increments in positions
-        max_exact = num_buckets // 2
-        is_small = relative_position < max_exact
-
-        # The other half of the buckets are for logarithmically bigger bins in positions up to max_distance
-        relative_position_if_large = max_exact + (
-            jnp.log(relative_position / max_exact) / jnp.log(max_distance / max_exact) * (num_buckets - max_exact)
-        )
-        relative_position_if_large = jnp.clip(relative_position_if_large, a_max=num_buckets - 1)
-
-        relative_buckets += jnp.where(is_small, relative_position, relative_position_if_large)
-
-        return relative_buckets.astype("i4")
-
-    def compute_bias(self, block_length: int):
-        """Compute binned relative position bias"""
-        memory_position = jnp.arange(3 * block_length, dtype="i4")
-        context_position = memory_position[block_length:-block_length]
-
-        relative_position = memory_position[None, :] - context_position[:, None]
-        relative_position_bucket = self._relative_position_bucket(
-            relative_position,
-            bidirectional=True,
-            num_buckets=self.relative_attention_num_buckets,
-            max_distance=self.relative_attention_max_distance,
-        )
-
-        values = self.relative_attention_bias(relative_position_bucket)
-        values = values.transpose((2, 0, 1))[None, None, :, :, :]
-        return values
-
-    def compute_side_bias(self, attention_mask: np.ndarray, global_segment_ids: np.ndarray) -> np.ndarray:
-        # (batch_size, 1, 1, seq_len, global_seq_len)
-        side_attention_mask = jnp.equal(attention_mask[..., None], global_segment_ids[:, None, :])[:, None, ...]
-        attention_side_bias = jax.lax.select(
-            side_attention_mask > 0,
-            jnp.full(side_attention_mask.shape, 0.0).astype(self.dtype),
-            jnp.full(side_attention_mask.shape, -1e10).astype(self.dtype),
-        )
-        # (batch_size, seq_len, global_seq_len)
-        side_relative_position = _make_side_relative_position_ids(attention_mask, self.global_block_size)
-        side_relative_position_bucket = self._relative_position_bucket(
-            side_relative_position,
-            bidirectional=True,
-            num_buckets=self.relative_attention_num_buckets,
-            max_distance=self.relative_attention_max_distance,
-        )
-        # (batch_size, seq_len, global_seq_len, num_heads)
-        side_bias = self.global_relative_attention_bias(side_relative_position_bucket)
-
-        # (batch_size, 1, num_heads, seq_len, global_seq_len)
-        side_bias = jnp.transpose(side_bias, (0, 3, 1, 2))
-        # (batch_size, num_heads, seq_len, global_seq_len)
-        attention_side_bias = attention_side_bias + side_bias
-        return attention_side_bias
-
-    def _split_heads(self, hidden_states):
-        return hidden_states.reshape(hidden_states.shape[:2] + (self.n_heads, self.key_value_proj_dim))
-
-    def _merge_heads(self, hidden_states):
-        return hidden_states.reshape(hidden_states.shape[0], -1, self.inner_dim)
-
-    def _create_position_bias(self, block_len: int, attention_mask: Optional[np.ndarray]) -> np.ndarray:
-        # position_bias shape: # (1, 1, n_heads, block_len, 3 * block_len)
-        if self.has_relative_attention_bias:
-            position_bias = self.compute_bias(block_len)
-        elif attention_mask is not None:
-            position_bias = jnp.zeros_like(attention_mask)
-        else:
-            position_bias = jnp.zeros((1, 1, self.n_heads, block_len, 3 * block_len), dtype=self.dtype)
-
-        return position_bias
-
-    def __call__(
-        self,
-        hidden_states,
-        attention_mask=None,
-        key_value_states=None,
-        position_bias=None,
-        output_attentions=False,
-        deterministic=True,
-    ):
-        """
-        Self-attention (if key_value_states is None) or attention over source sentence (provided by key_value_states).
-        """
-        batch_size, seq_length = hidden_states.shape[:2]
-
-        # Prepare components for transient-global attention
-        # Obtain block_ids and global_segment_ids
-        # global_seq_len := seq_len // self.global_block_size
-        # shapes: (batch_size, seq_len) & (batch_size, global_seq_len)
-        block_ids, global_segment_ids = _make_global_fixed_block_ids(
-            attention_mask if attention_mask is not None else jnp.ones((batch_size, seq_length)),
-            self.global_block_size,
-        )
-        # Create global inputs
-        _global_seq_len = global_segment_ids.shape[-1]
-        global_inputs = _create_global_aggregates(hidden_states, block_ids, _global_seq_len)
-        global_inputs = self.global_input_layer_norm(global_inputs)
-
-        # q, k, v projections
-        query_states = self.q(hidden_states)  # (batch_size, n_heads, seq_length, dim_per_head)
-        key_states = self.k(hidden_states) if key_value_states is None else self.k(key_value_states)
-        value_states = self.v(hidden_states) if key_value_states is None else self.v(key_value_states)
-
-        # reshape to (batch_size, seq_length, n_heads, head_dim)
-        query_states = self._split_heads(query_states)
-        key_states = self._split_heads(key_states)
-        value_states = self._split_heads(value_states)
-
-        # Get global/side key/value_states
-        side_key_states = self.k(global_inputs)
-        side_value_states = self.v(global_inputs)
-
-        # reshape to (batch_size, global_seq_len, n_heads, head_dim)
-        side_key_states = self._split_heads(side_key_states)
-        side_value_states = self._split_heads(side_value_states)
-
-        # Split into blocks -> (batch_size, num_blocks, block_len, n_heads, head_dim)
-        query_states = _split_into_blocks(query_states, self.block_len, axis=1)
-        key_states = _split_into_blocks(key_states, self.block_len, axis=1)
-        value_states = _split_into_blocks(value_states, self.block_len, axis=1)
-
-        # Concatenate 3 blocks for keys and values -> (batch_size, num_blocks, 3 * block_len, n_heads, dim_per_head)
-        key_states = _concatenate_3_blocks(key_states, block_axis=1, sequence_axis=2)
-        value_states = _concatenate_3_blocks(value_states, block_axis=1, sequence_axis=2)
-
-        # Tile side inputs across local key/value blocks
-        # New shape: (batch_size, num_blocks, global_seq_len, n_heads, dim_per_head)
-        reps = [1] * (side_key_states.ndim + 1)
-        reps[1] = key_states.shape[1]
-        side_key_states = jnp.tile(side_key_states[:, None, ...], reps)
-        side_value_states = jnp.tile(side_value_states[:, None, ...], reps)
-
-        # Concatenate "local" and "side"/"global" key/value states to allow each token to attend global aggregated ones
-        # New shape: (batch_size, num_blocks, 3 * block_len + global_seq_len, n_heads, dim_per_head)
-        key_states = jnp.concatenate((key_states, side_key_states), axis=2)
-        value_states = jnp.concatenate((value_states, side_value_states), axis=2)
-
-        # counter-act scaling in dot_product_attention_weights function
-        query_states *= jnp.sqrt(query_states.shape[-1])
-
-        if attention_mask is not None:
-            local_attention_mask = _get_local_attention_mask(attention_mask, self.block_len)
-            local_attention_mask = jax.lax.select(
-                local_attention_mask > 0,
-                jnp.full(local_attention_mask.shape, 0.0).astype(self.dtype),
-                jnp.full(local_attention_mask.shape, -1e10).astype(self.dtype),
-            )
-        else:
-            local_attention_mask = None
-
-        if position_bias is None:
-            # compute position bias (only for first layer)
-            position_bias = self._create_position_bias(self.block_len, attention_mask)
-            if local_attention_mask is not None:
-                position_bias = position_bias + local_attention_mask.swapaxes(1, 2)
-
-            # Calculate global/side bias - shape: # (batch_size, num_heads, seq_len, global_seq_len)
-            if attention_mask is None:
-                attention_mask = jnp.ones((batch_size, seq_length))
-            side_position_bias = self.compute_side_bias(attention_mask, global_segment_ids)
-            side_position_bias = _split_into_blocks(side_position_bias, self.block_len, axis=-2)
-            side_position_bias = jnp.swapaxes(side_position_bias, 1, 2)
-            position_bias = jnp.concatenate((position_bias, side_position_bias), axis=-1)
-
-        # create dropout rng
-        dropout_rng = None
-        if not deterministic and self.dropout > 0.0:
-            dropout_rng = self.make_rng("dropout")
-
-        # Softmax(QK^T)
-        attn_weights = dot_product_attention_weights(
-            query_states,
-            key_states,
-            bias=position_bias,
-            dropout_rng=dropout_rng,
-            dropout_rate=self.dropout,
-            broadcast_dropout=True,
-            deterministic=deterministic,
-            dtype=self.dtype,
-        )
-
-        # multiply with value states
-        attn_output = jnp.einsum("...hqk,...khd->...qhd", attn_weights, value_states)
-
-        # bring back to (batch_size, seq_length, d_model)
-        attn_output = self._merge_heads(attn_output)
-        attn_output = attn_output[:, :seq_length, :]
-
-        # apply output matrix
-        attn_output = self.o(attn_output)
-
-        outputs = (attn_output, position_bias)
-
-        if output_attentions:
-            outputs = outputs + (attn_weights,)
-
-        return outputs
-
-
-class FlaxLongT5LayerLocalSelfAttention(nn.Module):
-    """Local self attention used in encoder"""
-
-    config: LongT5Config
-    has_relative_attention_bias: bool = False
-    dtype: jnp.dtype = jnp.float32  # the dtype of the computation
-
-    def setup(self):
-        self.LocalSelfAttention = FlaxLongT5LocalAttention(
-            self.config, has_relative_attention_bias=self.has_relative_attention_bias, dtype=self.dtype
-        )
-        self.layer_norm = FlaxLongT5LayerNorm(
-            self.config.d_model, eps=self.config.layer_norm_epsilon, dtype=self.dtype
-        )
-        self.dropout = nn.Dropout(self.config.dropout_rate)
-
-    def __call__(
-        self,
-        hidden_states,
-        attention_mask=None,
-        position_bias=None,
-        output_attentions=False,
-        deterministic=True,
-        **kwargs: Any,  # to accept init_cache kwargs
-    ):
-        normed_hidden_states = self.layer_norm(hidden_states)
-        attention_output = self.LocalSelfAttention(
-            normed_hidden_states,
-            attention_mask=attention_mask,
-            position_bias=position_bias,
-            output_attentions=output_attentions,
-            deterministic=deterministic,
-        )
-        hidden_states = hidden_states + self.dropout(attention_output[0], deterministic=deterministic)
-        outputs = (hidden_states,) + attention_output[1:]  # add attentions if we output them
-        return outputs
-
-
-class FlaxLongT5LayerTransientGlobalSelfAttention(nn.Module):
-    """Transient-Global self attention used in encoder"""
-
-    config: LongT5Config
-    has_relative_attention_bias: bool = False
-    dtype: jnp.dtype = jnp.float32  # the dtype of the computation
-
-    def setup(self):
-        self.TransientGlobalSelfAttention = FlaxLongT5TransientGlobalAttention(
-            self.config, has_relative_attention_bias=self.has_relative_attention_bias, dtype=self.dtype
-        )
-        self.layer_norm = FlaxLongT5LayerNorm(
-            self.config.d_model, eps=self.config.layer_norm_epsilon, dtype=self.dtype
-        )
-        self.dropout = nn.Dropout(self.config.dropout_rate)
-
-    def __call__(
-        self,
-        hidden_states,
-        attention_mask=None,
-        position_bias=None,
-        output_attentions=False,
-        deterministic=True,
-        **kwargs: Any,  # to accept init_cache kwargs
-    ):
-        normed_hidden_states = self.layer_norm(hidden_states)
-        attention_output = self.TransientGlobalSelfAttention(
-            normed_hidden_states,
-            attention_mask=attention_mask,
-            position_bias=position_bias,
-            output_attentions=output_attentions,
-            deterministic=deterministic,
-        )
-        hidden_states = hidden_states + self.dropout(attention_output[0], deterministic=deterministic)
-        outputs = (hidden_states,) + attention_output[1:]  # add attentions if we output them
-        return outputs
-
-
-# Copied from transformers.models.t5.modeling_flax_t5.FlaxT5LayerSelfAttention with T5->LongT5
-class FlaxLongT5LayerSelfAttention(nn.Module):
-    config: LongT5Config
-    has_relative_attention_bias: bool = False
-    dtype: jnp.dtype = jnp.float32  # the dtype of the computation
-
-    def setup(self):
-        self.SelfAttention = FlaxLongT5Attention(
-            self.config,
-            has_relative_attention_bias=self.has_relative_attention_bias,
-            causal=self.config.causal,
-            dtype=self.dtype,
-        )
-        self.layer_norm = FlaxLongT5LayerNorm(
-            self.config.d_model, eps=self.config.layer_norm_epsilon, dtype=self.dtype
-        )
-        self.dropout = nn.Dropout(self.config.dropout_rate)
-
-    def __call__(
-        self,
-        hidden_states,
-        attention_mask=None,
-        position_bias=None,
-        output_attentions=False,
-        deterministic=True,
-        init_cache=False,
-    ):
-        normed_hidden_states = self.layer_norm(hidden_states)
-        attention_output = self.SelfAttention(
-            normed_hidden_states,
-            attention_mask=attention_mask,
-            position_bias=position_bias,
-            output_attentions=output_attentions,
-            deterministic=deterministic,
-            init_cache=init_cache,
-        )
-        hidden_states = hidden_states + self.dropout(attention_output[0], deterministic=deterministic)
-        outputs = (hidden_states,) + attention_output[1:]  # add attentions if we output them
-        return outputs
-
-
-# Copied from transformers.models.t5.modeling_flax_t5.FlaxT5LayerCrossAttention with T5->LongT5
-class FlaxLongT5LayerCrossAttention(nn.Module):
-    config: LongT5Config
-    dtype: jnp.dtype = jnp.float32  # the dtype of the computation
-
-    def setup(self):
-        self.EncDecAttention = FlaxLongT5Attention(
-            self.config, has_relative_attention_bias=False, causal=False, dtype=self.dtype
-        )
-        self.layer_norm = FlaxLongT5LayerNorm(
-            self.config.d_model, eps=self.config.layer_norm_epsilon, dtype=self.dtype
-        )
-        self.dropout = nn.Dropout(self.config.dropout_rate)
-
-    def __call__(
-        self,
-        hidden_states,
-        key_value_states,
-        attention_mask=None,
-        position_bias=None,
-        output_attentions=False,
-        deterministic=True,
-    ):
-        normed_hidden_states = self.layer_norm(hidden_states)
-        attention_output = self.EncDecAttention(
-            normed_hidden_states,
-            attention_mask=attention_mask,
-            key_value_states=key_value_states,
-            position_bias=position_bias,
-            output_attentions=output_attentions,
-        )
-        hidden_states = hidden_states + self.dropout(attention_output[0], deterministic=deterministic)
-        outputs = (hidden_states,) + attention_output[1:]  # add attentions if we output them
-        return outputs
-
-
-class FlaxLongT5Block(nn.Module):
-    config: LongT5Config
-    has_relative_attention_bias: bool = False
-    dtype: jnp.dtype = jnp.float32  # the dtype of the computation
-
-    def setup(self):
-        self.causal = self.config.causal
-        if self.causal:
-            attention_layer = FlaxLongT5LayerSelfAttention
-        elif self.config.encoder_attention_type == "local":
-            attention_layer = FlaxLongT5LayerLocalSelfAttention
-        elif self.config.encoder_attention_type == "transient-global":
-            attention_layer = FlaxLongT5LayerTransientGlobalSelfAttention
-        else:
-            raise ValueError(
-                "For encoder attention mechanism, either `local` or `transient-global` attention type is expected, "
-                f"but got {self.config.encoder_attention_type}."
-            )
-        self.layer = (
-            attention_layer(
-                self.config,
-                has_relative_attention_bias=self.has_relative_attention_bias,
-                name=str(0),
-                dtype=self.dtype,
-            ),
-        )
-        feed_forward_index = 1
-        if self.causal:
-            self.layer += (FlaxLongT5LayerCrossAttention(self.config, name=str(1), dtype=self.dtype),)
-            feed_forward_index += 1
-
-        self.layer += (FlaxLongT5LayerFF(self.config, name=str(feed_forward_index), dtype=self.dtype),)
-
-    # Copied from transformers.models.t5.modeling_flax_t5.FlaxT5Block.__call__ with T5->LongT5
-    def __call__(
-        self,
-        hidden_states,
-        attention_mask=None,
-        position_bias=None,
-        encoder_hidden_states=None,
-        encoder_attention_mask=None,
-        encoder_decoder_position_bias=None,
-        output_attentions=False,
-        return_dict=True,
-        deterministic=True,
-        init_cache=False,
-    ):
-        self_attention_outputs = self.layer[0](
-            hidden_states,
-            attention_mask=attention_mask,
-            position_bias=position_bias,
-            output_attentions=output_attentions,
-            deterministic=deterministic,
-            init_cache=init_cache,
-        )
-        hidden_states = self_attention_outputs[0]
-        attention_outputs = self_attention_outputs[1:]  # Keep self-attention outputs and relative position weights
-
-        do_cross_attention = self.causal and encoder_hidden_states is not None
-        if do_cross_attention:
-            cross_attention_outputs = self.layer[1](
-                hidden_states,
-                key_value_states=encoder_hidden_states,
-                attention_mask=encoder_attention_mask,
-                position_bias=encoder_decoder_position_bias,
-                output_attentions=output_attentions,
-                deterministic=deterministic,
-            )
-            hidden_states = cross_attention_outputs[0]
-
-            # Keep cross-attention outputs and relative position weights
-            attention_outputs = attention_outputs + cross_attention_outputs[1:]
-
-        # Apply Feed Forward layer
-        hidden_states = self.layer[-1](hidden_states, deterministic=deterministic)
-
-        outputs = (hidden_states,)
-
-        outputs = outputs + attention_outputs
-
-        # returns hidden-states, present_key_value_states, (self-attention position bias), (self-attention weights),
-        # (cross-attention position bias), (cross-attention weights)
-        return outputs
-
-
-# Copied from transformers.models.t5.modeling_flax_t5.FlaxT5LayerCollection with T5->LongT5
-class FlaxLongT5LayerCollection(nn.Module):
-    config: LongT5Config
-    has_relative_attention_bias: bool
-    dtype: jnp.dtype = jnp.float32  # the dtype of the computation
-
-    def setup(self):
-        self.layer = FlaxLongT5Block(
-            self.config, has_relative_attention_bias=self.has_relative_attention_bias, dtype=self.dtype
-        )
-
-    def __call__(
-        self,
-        hidden_states,
-        attention_mask=None,
-        position_bias=None,
-        encoder_hidden_states=None,
-        encoder_attention_mask=None,
-        encoder_decoder_position_bias=None,
-        output_attentions=False,
-        deterministic=True,
-        init_cache=False,
-    ):
-        return self.layer(
-            hidden_states,
-            attention_mask=attention_mask,
-            position_bias=position_bias,
-            encoder_hidden_states=encoder_hidden_states,
-            encoder_attention_mask=encoder_attention_mask,
-            encoder_decoder_position_bias=encoder_decoder_position_bias,
-            output_attentions=output_attentions,
-            deterministic=deterministic,
-            init_cache=init_cache,
-        )
-
-
-# Copied from transformers.models.t5.modeling_flax_t5.FlaxT5BlockCollection with T5->LongT5
-class FlaxLongT5BlockCollection(nn.Module):
-    config: LongT5Config
-    dtype: jnp.dtype = jnp.float32  # the dtype of the computation
-    gradient_checkpointing: bool = False
-
-    def setup(self):
-        self.causal = self.config.causal
-        if self.gradient_checkpointing:
-            FlaxLongT5CheckpointLayer = remat(FlaxLongT5LayerCollection, static_argnums=(6, 7, 8))
-            self.blocks = [
-                FlaxLongT5CheckpointLayer(
-                    self.config,
-                    has_relative_attention_bias=(i == 0),
-                    dtype=self.dtype,
-                    name=str(i),
-                )
-                for i in range(self.config.num_layers)
-            ]
-        else:
-            self.blocks = [
-                FlaxLongT5LayerCollection(
-                    self.config,
-                    has_relative_attention_bias=(i == 0),
-                    dtype=self.dtype,
-                    name=str(i),
-                )
-                for i in range(self.config.num_layers)
-            ]
-
-    def __call__(
-        self,
-        hidden_states=None,
-        attention_mask=None,
-        encoder_hidden_states=None,
-        encoder_attention_mask=None,
-        output_attentions: bool = False,
-        output_hidden_states: bool = False,
-        deterministic: bool = True,
-        init_cache: bool = False,
-    ):
-        # Prepare head mask if needed
-        all_hidden_states = () if output_hidden_states else None
-        all_attentions = () if output_attentions else None
-        all_cross_attentions = () if (output_attentions and self.causal) else None
-        position_bias = None
-        encoder_decoder_position_bias = None
-
-        for i, layer_module in enumerate(self.blocks):
-            if output_hidden_states:
-                all_hidden_states = all_hidden_states + (hidden_states,)
-
-            layer_outputs = layer_module(
-                hidden_states,
-                attention_mask,
-                position_bias,
-                encoder_hidden_states,
-                encoder_attention_mask,
-                encoder_decoder_position_bias,
-                output_attentions,
-                deterministic,
-                init_cache,
-            )
-
-            hidden_states = layer_outputs[0]
-
-            # We share the position biases between the layers - the first layer store them
-            # layer_outputs = hidden-states, key-value-states (self-attention position bias), (self-attention weights),
-            # (cross-attention position bias), (cross-attention weights)
-            position_bias = layer_outputs[1]
-
-            if self.causal and encoder_hidden_states is not None:
-                encoder_decoder_position_bias = layer_outputs[3 if output_attentions else 2]
-
-            if output_attentions:
-                all_attentions = all_attentions + (layer_outputs[2],)
-                if self.causal:
-                    all_cross_attentions = all_cross_attentions + (layer_outputs[4],)
-
-        return FlaxBaseModelOutputWithPastAndCrossAttentions(
-            last_hidden_state=hidden_states,
-            hidden_states=all_hidden_states,
-            attentions=all_attentions,
-            cross_attentions=all_cross_attentions,
-        )
-
-
-# Copied from transformers.models.t5.modeling_flax_t5.FlaxT5Stack with T5->LongT5
-class FlaxLongT5Stack(nn.Module):
-    config: LongT5Config
-    embed_tokens: nn.Embed
-    dtype: jnp.dtype = jnp.float32  # the dtype of the computation
-    gradient_checkpointing: bool = False
-
-    def setup(self):
-        self.causal = self.config.causal
-
-        self.block = FlaxLongT5BlockCollection(
-            self.config, dtype=self.dtype, gradient_checkpointing=self.gradient_checkpointing
-        )
-        self.final_layer_norm = FlaxLongT5LayerNorm(
-            self.config.d_model, eps=self.config.layer_norm_epsilon, dtype=self.dtype
-        )
-        self.dropout = nn.Dropout(self.config.dropout_rate)
-
-    def __call__(
-        self,
-        input_ids=None,
-        attention_mask=None,
-        encoder_hidden_states=None,
-        encoder_attention_mask=None,
-        output_attentions: bool = False,
-        output_hidden_states: bool = False,
-        return_dict: bool = True,
-        deterministic: bool = True,
-        init_cache: bool = False,
-    ):
-        hidden_states = self.embed_tokens(input_ids)
-        hidden_states = self.dropout(hidden_states, deterministic=deterministic)
-
-        outputs = self.block(
-            hidden_states,
-            attention_mask=attention_mask,
-            encoder_hidden_states=encoder_hidden_states,
-            encoder_attention_mask=encoder_attention_mask,
-            output_attentions=output_attentions,
-            output_hidden_states=output_hidden_states,
-            deterministic=deterministic,
-            init_cache=init_cache,
-        )
-
-        hidden_states = outputs[0]
-
-        hidden_states = self.final_layer_norm(hidden_states)
-        hidden_states = self.dropout(hidden_states, deterministic=deterministic)
-
-        # Add last layer
-        all_hidden_states = None
-
-        if output_hidden_states:
-            all_hidden_states = outputs.hidden_states
-            all_hidden_states = all_hidden_states + (hidden_states,)
-
-        if not return_dict:
-            if output_hidden_states:
-                return (
-                    hidden_states,
-                    all_hidden_states,
-                ) + outputs[2:]
-            return (hidden_states,) + outputs[1:]
-
-        return FlaxBaseModelOutputWithPastAndCrossAttentions(
-            last_hidden_state=hidden_states,
-            hidden_states=all_hidden_states,
-            attentions=outputs.attentions,
-            cross_attentions=outputs.cross_attentions,
-        )
-
-
-LONGT5_ENCODE_INPUTS_DOCSTRING = r"""
-    Args:
-        input_ids (`jnp.ndarray` of shape `(batch_size, sequence_length)`):
-            Indices of input sequence tokens in the vocabulary. LongT5 is a model with relative position embeddings so
-            you should be able to pad the inputs on both the right and the left.
-
-            Indices can be obtained using [`AutoTokenizer`]. See [`PreTrainedTokenizer.encode`] and
-            [`PreTrainedTokenizer.__call__`] for detail.
-
-            To know more on how to prepare `input_ids` for pretraining take a look a [LONGT5
-            Training](./longt5#training).
-        attention_mask (`jnp.ndarray` of shape `(batch_size, sequence_length)`, *optional*):
-            Mask to avoid performing attention on padding token indices. Mask values selected in `[0, 1]`:
-
-            - 1 for tokens that are **not masked**,
-            - 0 for tokens that are **masked**.
-
-            [What are attention masks?](../glossary#attention-mask)
-        output_attentions (`bool`, *optional*):
-            Whether or not to return the attentions tensors of all attention layers. See `attentions` under returned
-            tensors for more detail.
-        output_hidden_states (`bool`, *optional*):
-            Whether or not to return the hidden states of all layers. See `hidden_states` under returned tensors for
-            more detail.
-        return_dict (`bool`, *optional*):
-            Whether or not to return a [`~utils.ModelOutput`] instead of a plain tuple.
-"""
-
-LONGT5_DECODE_INPUTS_DOCSTRING = r"""
-    Args:
-        decoder_input_ids (`jnp.ndarray` of shape `(batch_size, target_sequence_length)`):
-            Indices of decoder input sequence tokens in the vocabulary.
-
-            Indices can be obtained using [`AutoTokenizer`]. See [`PreTrainedTokenizer.encode`] and
-            [`PreTrainedTokenizer.__call__`] for details.
-
-            [What are decoder input IDs?](../glossary#decoder-input-ids)
-
-            For training, `decoder_input_ids` should be provided.
-        encoder_outputs (`tuple(tuple(jnp.ndarray)`):
-            Tuple consists of (`last_hidden_state`, *optional*: `hidden_states`, *optional*: `attentions`)
-            `last_hidden_state` of shape `(batch_size, sequence_length, hidden_size)`, *optional*) is a sequence of
-            hidden-states at the output of the last layer of the encoder. Used in the cross-attention of the decoder.
-        encoder_attention_mask (`jnp.ndarray` of shape `(batch_size, sequence_length)`, *optional*):
-            Mask to avoid performing attention on padding token indices. Mask values selected in `[0, 1]`:
-
-            - 1 for tokens that are **not masked**,
-            - 0 for tokens that are **masked**.
-
-            [What are attention masks?](../glossary#attention-mask)
-        decoder_attention_mask (`jnp.ndarray` of shape `(batch_size, target_sequence_length)`, *optional*):
-            Default behavior: generate a tensor that ignores pad tokens in `decoder_input_ids`. Causal mask will also
-            be used by default.
-
-            If you want to change padding behavior, you should modify to your needs. See diagram 1 in [the
-            paper](https://arxiv.org/abs/1910.13461) for more information on the default strategy.
-        past_key_values (`Dict[str, np.ndarray]`, *optional*, returned by `init_cache` or when passing previous `past_key_values`):
-            Dictionary of pre-computed hidden-states (key and values in the attention blocks) that can be used for fast
-            auto-regressive decoding. Pre-computed key and value hidden-states are of shape *[batch_size, max_length]*.
-        output_attentions (`bool`, *optional*):
-            Whether or not to return the attentions tensors of all attention layers. See `attentions` under returned
-            tensors for more detail.
-        output_hidden_states (`bool`, *optional*):
-            Whether or not to return the hidden states of all layers. See `hidden_states` under returned tensors for
-            more detail.
-        return_dict (`bool`, *optional*):
-            Whether or not to return a [`~utils.ModelOutput`] instead of a plain tuple.
-"""
-
-
-LONGT5_INPUTS_DOCSTRING = r"""
-    Args:
-        input_ids (`jnp.ndarray` of shape `(batch_size, sequence_length)`):
-            Indices of input sequence tokens in the vocabulary. LongT5 is a model with relative position embeddings so
-            you should be able to pad the inputs on both the right and the left.
-
-            Indices can be obtained using [`AutoTokenizer`]. See [`PreTrainedTokenizer.encode`] and
-            [`PreTrainedTokenizer.__call__`] for detail.
-
-            [What are input IDs?](../glossary#input-ids)
-
-            To know more on how to prepare `input_ids` for pretraining take a look a [LONGT5
-            Training](./longt5#training).
-        attention_mask (`jnp.ndarray` of shape `(batch_size, sequence_length)`, *optional*):
-            Mask to avoid performing attention on padding token indices. Mask values selected in `[0, 1]`:
-
-            - 1 for tokens that are **not masked**,
-            - 0 for tokens that are **masked**.
-
-            [What are attention masks?](../glossary#attention-mask)
-        decoder_input_ids (`jnp.ndarray` of shape `(batch_size, target_sequence_length)`, *optional*):
-            Indices of decoder input sequence tokens in the vocabulary.
-
-            Indices can be obtained using [`AutoTokenizer`]. See [`PreTrainedTokenizer.encode`] and
-            [`PreTrainedTokenizer.__call__`] for details.
-
-            [What are decoder input IDs?](../glossary#decoder-input-ids)
-
-            LONGT5 uses the `pad_token_id` as the starting token for `decoder_input_ids` generation. If
-            `past_key_values` is used, optionally only the last `decoder_input_ids` have to be input (see
-            `past_key_values`).
-
-            To know more on how to prepare `decoder_input_ids` for pretraining take a look at [LONGT5
-            Training](./longt5#training).
-        decoder_attention_mask (`jnp.ndarray` of shape `(batch_size, target_sequence_length)`, *optional*):
-            Default behavior: generate a tensor that ignores pad tokens in `decoder_input_ids`. Causal mask will also
-            be used by default.
-        encoder_outputs (`tuple(tuple(jnp.ndarray)`, *optional*):
-            Tuple consists of (`last_hidden_state`, `optional`: *hidden_states*, `optional`: *attentions*)
-            `last_hidden_state` of shape `(batch_size, sequence_length, hidden_size)` is a sequence of hidden states at
-            the output of the last layer of the encoder. Used in the cross-attention of the decoder.
-        past_key_values (`tuple(tuple(jnp.ndarray))` of length `config.n_layers` with each tuple having 4 tensors of shape `(batch_size, num_heads, sequence_length - 1, embed_size_per_head)`):
-            Contains precomputed key and value hidden states of the attention blocks. Can be used to speed up decoding.
-
-            If `past_key_values` are used, the user can optionally input only the last `decoder_input_ids` (those that
-            don't have their past key value states given to this model) of shape `(batch_size, 1)` instead of all
-            `decoder_input_ids` of shape `(batch_size, sequence_length)`.
-
-
-        output_attentions (`bool`, *optional*):
-            Whether or not to return the attentions tensors of all attention layers. See `attentions` under returned
-            tensors for more detail.
-        output_hidden_states (`bool`, *optional*):
-            Whether or not to return the hidden states of all layers. See `hidden_states` under returned tensors for
-            more detail.
-        return_dict (`bool`, *optional*):
-            Whether or not to return a [`~utils.ModelOutput`] instead of a plain tuple.
-"""
-
-
-class FlaxLongT5PreTrainedModel(FlaxPreTrainedModel):
-    """
-    An abstract class to handle weights initialization and a simple interface for downloading and loading pretrained
-    models.
-    """
-
-    config_class = LongT5Config
-    base_model_prefix = "transformer"
-    module_class: nn.Module = None
-
-    def __init__(
-        self,
-        config: LongT5Config,
-        input_shape: Tuple[int] = (1, 1),
-        seed: int = 0,
-        dtype: jnp.dtype = jnp.float32,
-        _do_init: bool = True,
-        **kwargs,
-    ):
-        module = self.module_class(config=config, dtype=dtype, **kwargs)
-        super().__init__(config, module, input_shape=input_shape, seed=seed, dtype=dtype, _do_init=_do_init)
-
-    def enable_gradient_checkpointing(self):
-        self._module = self.module_class(
-            config=self.config,
-            dtype=self.dtype,
-            gradient_checkpointing=True,
-        )
-
-    def init_weights(self, rng: jax.random.PRNGKey, input_shape: Tuple, params: FrozenDict = None) -> FrozenDict:
-        # init input tensors
-        input_ids = jnp.zeros(input_shape, dtype="i4")
-
-        attention_mask = jnp.ones_like(input_ids)
-        decoder_input_ids = jnp.ones_like(input_ids)
-        decoder_attention_mask = jnp.ones_like(input_ids)
-
-        params_rng, dropout_rng = jax.random.split(rng)
-        rngs = {"params": params_rng, "dropout": dropout_rng}
-
-        random_params = self.module.init(
-            rngs,
-            input_ids,
-            attention_mask,
-            decoder_input_ids,
-            decoder_attention_mask,
-        )["params"]
-
-        if params is not None:
-            random_params = flatten_dict(unfreeze(random_params))
-            params = flatten_dict(unfreeze(params))
-            for missing_key in self._missing_keys:
-                params[missing_key] = random_params[missing_key]
-            self._missing_keys = set()
-            return freeze(unflatten_dict(params))
-        else:
-            return random_params
-
-    @add_start_docstrings_to_model_forward(LONGT5_INPUTS_DOCSTRING)
-    def __call__(
-        self,
-        input_ids: jnp.ndarray,
-        attention_mask: Optional[jnp.ndarray] = None,
-        decoder_input_ids: jnp.ndarray = None,
-        decoder_attention_mask: Optional[jnp.ndarray] = None,
-        output_attentions: Optional[bool] = None,
-        output_hidden_states: Optional[bool] = None,
-        return_dict: Optional[bool] = None,
-        train: bool = False,
-        params: dict = None,
-        dropout_rng: PRNGKey = None,
-    ):
-        output_attentions = output_attentions if output_attentions is not None else self.config.output_attentions
-        output_hidden_states = (
-            output_hidden_states if output_hidden_states is not None else self.config.output_hidden_states
-        )
-        return_dict = return_dict if return_dict is not None else self.config.return_dict
-
-        if decoder_input_ids is None:
-            raise ValueError(
-                "Make sure to provide both `input_ids` and `decoder_input_ids`. `decoder_input_ids` is not passed"
-                " here."
-            )
-
-        # prepare encoder inputs
-        if attention_mask is None:
-            attention_mask = jnp.ones_like(input_ids)
-
-        # prepare decoder inputs
-        if decoder_attention_mask is None:
-            decoder_attention_mask = jnp.ones_like(decoder_input_ids)
-
-        # Handle any PRNG if needed
-        rngs = {"dropout": dropout_rng} if dropout_rng is not None else {}
-
-        return self.module.apply(
-            {"params": params or self.params},
-            input_ids=jnp.array(input_ids, dtype="i4"),
-            attention_mask=jnp.array(attention_mask, dtype="i4"),
-            decoder_input_ids=jnp.array(decoder_input_ids, dtype="i4"),
-            decoder_attention_mask=jnp.array(decoder_attention_mask, dtype="i4"),
-            output_attentions=output_attentions,
-            output_hidden_states=output_hidden_states,
-            return_dict=return_dict,
-            deterministic=not train,
-            rngs=rngs,
-        )
-
-    def init_cache(self, batch_size, max_length, encoder_outputs):
-        r"""
-        Args:
-            batch_size (`int`):
-                batch_size used for fast auto-regressive decoding. Defines the batch size of the initialized cache.
-            max_length (`int`):
-                maximum possible length for auto-regressive decoding. Defines the sequence length of the initialized
-                cache.
-            encoder_outputs (`Union[FlaxBaseModelOutput, tuple(tuple(jnp.ndarray)]`):
-                `encoder_outputs` consists of (`last_hidden_state`, *optional*: `hidden_states`, *optional*:
-                `attentions`). `last_hidden_state` of shape `(batch_size, sequence_length, hidden_size)`, *optional*)
-                is a sequence of hidden-states at the output of the last layer of the encoder. Used in the
-                cross-attention of the decoder.
-        """
-        # init input variables to retrieve cache
-        decoder_input_ids = jnp.ones((batch_size, max_length), dtype="i4")
-        decoder_attention_mask = jnp.ones_like(decoder_input_ids)
-
-        def _decoder_forward(module, decoder_input_ids, decoder_attention_mask, **kwargs):
-            decoder_module = module._get_decoder_module()
-            return decoder_module(
-                decoder_input_ids,
-                decoder_attention_mask,
-                **kwargs,
-            )
-
-        init_variables = self.module.init(
-            jax.random.PRNGKey(0),
-            decoder_input_ids=decoder_input_ids,
-            decoder_attention_mask=decoder_attention_mask,
-            encoder_hidden_states=encoder_outputs[0],
-            init_cache=True,
-            method=_decoder_forward,  # we only need to call the decoder to init the cache
-        )
-        return unfreeze(init_variables["cache"])
-
-    @add_start_docstrings(LONGT5_ENCODE_INPUTS_DOCSTRING)
-    @replace_return_docstrings(output_type=FlaxBaseModelOutput, config_class=LongT5Config)
-    def encode(
-        self,
-        input_ids: jnp.ndarray,
-        attention_mask: Optional[jnp.ndarray] = None,
-        output_attentions: Optional[bool] = None,
-        output_hidden_states: Optional[bool] = None,
-        return_dict: Optional[bool] = None,
-        train: bool = False,
-        params: dict = None,
-        dropout_rng: PRNGKey = None,
-    ):
-        r"""
-        Returns:
-
-        Example:
-
-        ```python
-        >>> from transformers import AutoTokenizer, FlaxLongT5ForConditionalGeneration
-
-        >>> tokenizer = AutoTokenizer.from_pretrained("t5-base")
-        >>> model = FlaxLongT5ForConditionalGeneration.from_pretrained("google/long-t5-local-base")
-
-        >>> text = "My friends are cool but they eat too many carbs."
-        >>> inputs = tokenizer(text, return_tensors="np")
-        >>> encoder_outputs = model.encode(**inputs)
-        ```"""
-        output_attentions = output_attentions if output_attentions is not None else self.config.output_attentions
-        output_hidden_states = (
-            output_hidden_states if output_hidden_states is not None else self.config.output_hidden_states
-        )
-        return_dict = return_dict if return_dict is not None else self.config.return_dict
-
-        if attention_mask is None:
-            attention_mask = jnp.ones_like(input_ids)
-
-        # Handle any PRNG if needed
-        rngs = {}
-        if dropout_rng is not None:
-            rngs["dropout"] = dropout_rng
-
-        def _encoder_forward(module, input_ids, attention_mask, **kwargs):
-            encode_module = module._get_encoder_module()
-            return encode_module(input_ids, attention_mask, **kwargs)
-
-        return self.module.apply(
-            {"params": params or self.params},
-            input_ids=jnp.array(input_ids, dtype="i4"),
-            attention_mask=jnp.array(attention_mask, dtype="i4"),
-            output_attentions=output_attentions,
-            output_hidden_states=output_hidden_states,
-            return_dict=return_dict,
-            deterministic=not train,
-            rngs=rngs,
-            method=_encoder_forward,
-        )
-
-    @add_start_docstrings(LONGT5_DECODE_INPUTS_DOCSTRING)
-    @replace_return_docstrings(output_type=FlaxBaseModelOutputWithPastAndCrossAttentions, config_class=LongT5Config)
-    def decode(
-        self,
-        decoder_input_ids,
-        encoder_outputs,
-        encoder_attention_mask: Optional[jnp.ndarray] = None,
-        decoder_attention_mask: Optional[jnp.ndarray] = None,
-        past_key_values: dict = None,
-        output_attentions: Optional[bool] = None,
-        output_hidden_states: Optional[bool] = None,
-        return_dict: Optional[bool] = None,
-        train: bool = False,
-        params: dict = None,
-        dropout_rng: PRNGKey = None,
-    ):
-        r"""
-        Returns:
-
-        Example:
-
-        ```python
-        >>> from transformers import AutoTokenizer, FlaxLongT5ForConditionalGeneration
-        >>> import jax.numpy as jnp
-
-        >>> tokenizer = AutoTokenizer.from_pretrained("t5-base")
-        >>> model = FlaxLongT5ForConditionalGeneration.from_pretrained("google/long-t5-local-base")
-
-        >>> text = "My friends are cool but they eat too many carbs."
-        >>> inputs = tokenizer(text, return_tensors="np")
-        >>> encoder_outputs = model.encode(**inputs)
-
-        >>> decoder_start_token_id = model.config.decoder_start_token_id
-        >>> decoder_input_ids = jnp.ones((inputs.input_ids.shape[0], 1), dtype="i4") * decoder_start_token_id
-
-        >>> outputs = model.decode(decoder_input_ids, encoder_outputs)
-        >>> logits = outputs.logits
-        ```"""
-        output_attentions = output_attentions if output_attentions is not None else self.config.output_attentions
-        output_hidden_states = (
-            output_hidden_states if output_hidden_states is not None else self.config.output_hidden_states
-        )
-        return_dict = return_dict if return_dict is not None else self.config.return_dict
-
-        encoder_hidden_states = encoder_outputs[0]
-        if encoder_attention_mask is None:
-            batch_size, sequence_length = encoder_hidden_states.shape[:2]
-            encoder_attention_mask = jnp.ones((batch_size, sequence_length))
-
-        batch_size, sequence_length = decoder_input_ids.shape
-        if decoder_attention_mask is None:
-            decoder_attention_mask = jnp.ones((batch_size, sequence_length))
-
-        # Handle any PRNG if needed
-        rngs = {}
-        if dropout_rng is not None:
-            rngs["dropout"] = dropout_rng
-
-        inputs = {"params": params or self.params}
-
-        # if past_key_values are passed then cache is already initialized a private flag init_cache has to be
-        # passed down to ensure cache is used. It has to be made sure that cache is marked as mutable so that
-        # it can be changed by FlaxLongT5Attention module
-        if past_key_values:
-            inputs["cache"] = past_key_values
-            mutable = ["cache"]
-        else:
-            mutable = False
-
-        def _decoder_forward(module, decoder_input_ids, decoder_attention_mask, **kwargs):
-            decoder_module = module._get_decoder_module()
-            return decoder_module(
-                decoder_input_ids,
-                decoder_attention_mask,
-                **kwargs,
-            )
-
-        outputs = self.module.apply(
-            inputs,
-            decoder_input_ids=jnp.array(decoder_input_ids, dtype="i4"),
-            decoder_attention_mask=jnp.array(decoder_attention_mask, dtype="i4"),
-            encoder_hidden_states=encoder_hidden_states,
-            encoder_attention_mask=jnp.array(encoder_attention_mask, dtype="i4"),
-            output_attentions=output_attentions,
-            output_hidden_states=output_hidden_states,
-            return_dict=return_dict,
-            deterministic=not train,
-            rngs=rngs,
-            mutable=mutable,
-            method=_decoder_forward,
-        )
-
-        # add updated cache to model output
-        if past_key_values is not None and return_dict:
-            outputs, past = outputs
-            outputs["past_key_values"] = unfreeze(past["cache"])
-            return outputs
-        elif past_key_values is not None and not return_dict:
-            outputs, past = outputs
-            outputs = outputs[:1] + (unfreeze(past["cache"]),) + outputs[1:]
-
-        return outputs
-
-
-LONGT5_START_DOCSTRING = r"""
-    The LongT5 model was proposed in [LongT5: Efficient Text-To-Text Transformer for Long
-    Sequences](https://arxiv.org/abs/2112.07916) by Mandy Guo, Joshua Ainslie, David Uthus, Santiago Ontanon, Jianmo
-    Ni, Yun-Hsuan Sung and Yinfei Yang. It's an encoder-decoder transformer pre-trained in a text-to-text denoising
-    generative setting. LongT5 model is an extension of T5 model, and it enables using one of the two different
-    efficient attention mechanisms - (1) Local attention, or (2) Transient-Global attention.
-
-    This model inherits from [`FlaxPreTrainedModel`]. Check the superclass documentation for the generic methods the
-    library implements for all its model (such as downloading or saving, resizing the input embeddings, pruning heads
-    etc.)
-
-    This model is also a Flax Linen
-    [flax.nn.Module](https://flax.readthedocs.io/en/latest/_autosummary/flax.nn.module.html) subclass. Use it as a
-    regular Flax Module and refer to the Flax documentation for all matter related to general usage and behavior.
-
-    Finally, this model supports inherent JAX features such as:
-
-    - [Just-In-Time (JIT) compilation](https://jax.readthedocs.io/en/latest/jax.html#just-in-time-compilation-jit)
-    - [Automatic Differentiation](https://jax.readthedocs.io/en/latest/jax.html#automatic-differentiation)
-    - [Vectorization](https://jax.readthedocs.io/en/latest/jax.html#vectorization-vmap)
-    - [Parallelization](https://jax.readthedocs.io/en/latest/jax.html#parallelization-pmap)
-
-    Parameters:
-        config ([`LongT5Config`]): Model configuration class with all the parameters of the model.
-            Initializing with a config file does not load the weights associated with the model, only the
-            configuration. Check out the [`~FlaxPreTrainedModel.from_pretrained`] method to load the model weights.
-        dtype (`jax.numpy.dtype`, *optional*, defaults to `jax.numpy.float32`):
-            The data type of the computation. Can be one of `jax.numpy.float32`, `jax.numpy.float16` (on GPUs) and
-            `jax.numpy.bfloat16` (on TPUs).
-
-            This can be used to enable mixed-precision training or half-precision inference on GPUs or TPUs. If
-            specified all the computation will be performed with the given `dtype`.
-
-            **Note that this only specifies the dtype of the computation and does not influence the dtype of model
-            parameters.**
-
-            If you wish to change the dtype of the model parameters, see [`~FlaxPreTrainedModel.to_fp16`] and
-            [`~FlaxPreTrainedModel.to_bf16`].
-"""
-
-
-@add_start_docstrings(
-    "The bare LONGT5 Model transformer outputting raw hidden-stateswithout any specific head on top.",
-    LONGT5_START_DOCSTRING,
-)
-# Copied from transformers.models.t5.modeling_flax_t5.FlaxT5Module with T5->LongT5
-class FlaxLongT5Module(nn.Module):
-    config: LongT5Config
-    dtype: jnp.dtype = jnp.float32  # the dtype of the computation
-    gradient_checkpointing: bool = False
-
-    def _get_encoder_module(self):
-        return self.encoder
-
-    def _get_decoder_module(self):
-        return self.decoder
-
-    def setup(self):
-        self.shared = nn.Embed(
-            self.config.vocab_size,
-            self.config.d_model,
-            embedding_init=jax.nn.initializers.normal(self.config.initializer_factor * 1.0),
-            dtype=self.dtype,
-        )
-
-        encoder_config = copy.deepcopy(self.config)
-        encoder_config.causal = False
-        self.encoder = FlaxLongT5Stack(
-            encoder_config,
-            embed_tokens=self.shared,
-            dtype=self.dtype,
-            gradient_checkpointing=self.gradient_checkpointing,
-        )
-
-        decoder_config = copy.deepcopy(self.config)
-        decoder_config.causal = True
-        decoder_config.num_layers = self.config.num_decoder_layers
-        self.decoder = FlaxLongT5Stack(
-            decoder_config,
-            embed_tokens=self.shared,
-            dtype=self.dtype,
-            gradient_checkpointing=self.gradient_checkpointing,
-        )
-
-    def __call__(
-        self,
-        input_ids=None,
-        attention_mask=None,
-        decoder_input_ids=None,
-        decoder_attention_mask=None,
-        encoder_outputs=None,
-        output_attentions=None,
-        output_hidden_states=None,
-        return_dict=None,
-        deterministic: bool = True,
-    ):
-        return_dict = return_dict if return_dict is not None else self.config.use_return_dict
-
-        # Encode if needed (training, first prediction pass)
-        encoder_outputs = self.encoder(
-            input_ids=input_ids,
-            attention_mask=attention_mask,
-            output_attentions=output_attentions,
-            output_hidden_states=output_hidden_states,
-            return_dict=return_dict,
-            deterministic=deterministic,
-        )
-
-        # Decode
-        decoder_outputs = self.decoder(
-            input_ids=decoder_input_ids,
-            attention_mask=decoder_attention_mask,
-            encoder_hidden_states=encoder_outputs[0],
-            encoder_attention_mask=attention_mask,
-            output_attentions=output_attentions,
-            output_hidden_states=output_hidden_states,
-            return_dict=return_dict,
-            deterministic=deterministic,
-        )
-
-        if not return_dict:
-            return decoder_outputs + encoder_outputs
-
-        return FlaxSeq2SeqModelOutput(
-            last_hidden_state=decoder_outputs.last_hidden_state,
-            past_key_values=decoder_outputs.past_key_values,
-            decoder_hidden_states=decoder_outputs.hidden_states,
-            decoder_attentions=decoder_outputs.attentions,
-            cross_attentions=decoder_outputs.cross_attentions,
-            encoder_last_hidden_state=encoder_outputs.last_hidden_state,
-            encoder_hidden_states=encoder_outputs.hidden_states,
-            encoder_attentions=encoder_outputs.attentions,
-        )
-
-
-# Copied from transformers.models.t5.modeling_flax_t5.FlaxT5Model with T5->LongT5
-class FlaxLongT5Model(FlaxLongT5PreTrainedModel):
-    module_class = FlaxLongT5Module
-
-
-append_call_sample_docstring(FlaxLongT5Model, _CHECKPOINT_FOR_DOC, FlaxSeq2SeqModelOutput, _CONFIG_FOR_DOC)
-
-FLAX_LONGT5_MODEL_DOCSTRING = """
-    Returns:
-
-    Example:
-
-    ```python
-    >>> from transformers import AutoTokenizer, FlaxLongT5Model
-
-    >>> tokenizer = AutoTokenizer.from_pretrained("t5-base")
-    >>> model = FlaxLongT5Model.from_pretrained("google/long-t5-local-base")
-
-    >>> input_ids = tokenizer(
-    ...     "Studies have been shown that owning a dog is good for you", return_tensors="np"
-    ... ).input_ids
-    >>> decoder_input_ids = tokenizer("Studies show that", return_tensors="np").input_ids
-
-    >>> # forward pass
-    >>> outputs = model(input_ids=input_ids, decoder_input_ids=decoder_input_ids)
-    >>> last_hidden_states = outputs.last_hidden_state
-    ```
-"""
-
-
-overwrite_call_docstring(FlaxLongT5Model, LONGT5_INPUTS_DOCSTRING + FLAX_LONGT5_MODEL_DOCSTRING)
-append_replace_return_docstrings(FlaxLongT5Model, output_type=FlaxSeq2SeqLMOutput, config_class=_CONFIG_FOR_DOC)
-
-
-@add_start_docstrings("""LONGT5 Model with a `language modeling` head on top.""", LONGT5_START_DOCSTRING)
-# Copied from transformers.models.t5.modeling_flax_t5.FlaxT5ForConditionalGenerationModule with T5->LongT5
-class FlaxLongT5ForConditionalGenerationModule(nn.Module):
-    config: LongT5Config
-    dtype: jnp.dtype = jnp.float32  # the dtype of the computation
-    gradient_checkpointing: bool = False
-
-    def _get_encoder_module(self):
-        return self.encoder
-
-    def _get_decoder_module(self):
-        return self.decoder
-
-    def setup(self):
-        self.model_dim = self.config.d_model
-
-        self.shared = nn.Embed(
-            self.config.vocab_size,
-            self.config.d_model,
-            embedding_init=jax.nn.initializers.normal(self.config.initializer_factor),
-            dtype=self.dtype,
-        )
-
-        encoder_config = copy.deepcopy(self.config)
-        encoder_config.causal = False
-        encoder_config.use_cache = False
-        encoder_config.is_encoder_decoder = False
-        self.encoder = FlaxLongT5Stack(
-            encoder_config, self.shared, dtype=self.dtype, gradient_checkpointing=self.gradient_checkpointing
-        )
-
-        decoder_config = copy.deepcopy(self.config)
-        decoder_config.causal = True
-        decoder_config.is_encoder_decoder = False
-        decoder_config.num_layers = self.config.num_decoder_layers
-        self.decoder = FlaxLongT5Stack(
-            decoder_config, self.shared, dtype=self.dtype, gradient_checkpointing=self.gradient_checkpointing
-        )
-
-        self.lm_head = nn.Dense(
-            self.config.vocab_size,
-            use_bias=False,
-            kernel_init=jax.nn.initializers.normal(self.config.initializer_factor),
-            dtype=self.dtype,
-        )
-
-    def __call__(
-        self,
-        input_ids=None,
-        attention_mask=None,
-        decoder_input_ids=None,
-        decoder_attention_mask=None,
-        encoder_outputs=None,
-        output_attentions=None,
-        output_hidden_states=None,
-        return_dict=None,
-        deterministic: bool = True,
-    ):
-        return_dict = return_dict if return_dict is not None else self.config.use_return_dict
-
-        # Encode
-        encoder_outputs = self.encoder(
-            input_ids=input_ids,
-            attention_mask=attention_mask,
-            output_attentions=output_attentions,
-            output_hidden_states=output_hidden_states,
-            return_dict=return_dict,
-            deterministic=deterministic,
-        )
-
-        hidden_states = encoder_outputs[0]
-
-        # Decode
-        decoder_outputs = self.decoder(
-            input_ids=decoder_input_ids,
-            attention_mask=decoder_attention_mask,
-            encoder_hidden_states=hidden_states,
-            encoder_attention_mask=attention_mask,
-            output_attentions=output_attentions,
-            output_hidden_states=output_hidden_states,
-            return_dict=return_dict,
-            deterministic=deterministic,
-        )
-
-        sequence_output = decoder_outputs[0]
-
-        if self.config.tie_word_embeddings:
-            # Rescale output before projecting on vocab
-            # See https://github.com/tensorflow/mesh/blob/fa19d69eafc9a482aff0b59ddd96b025c0cb207d/mesh_tensorflow/transformer/transformer.py#L586
-            sequence_output = sequence_output * (self.model_dim**-0.5)
-
-        if self.config.tie_word_embeddings:
-            shared_embedding = self.shared.variables["params"]["embedding"]
-            lm_logits = self.lm_head.apply({"params": {"kernel": shared_embedding.T}}, sequence_output)
-        else:
-            lm_logits = self.lm_head(sequence_output)
-
-        if not return_dict:
-            return (lm_logits,) + decoder_outputs[1:] + encoder_outputs
-
-        return FlaxSeq2SeqLMOutput(
-            logits=lm_logits,
-            past_key_values=decoder_outputs.past_key_values,
-            decoder_hidden_states=decoder_outputs.hidden_states,
-            decoder_attentions=decoder_outputs.attentions,
-            cross_attentions=decoder_outputs.cross_attentions,
-            encoder_last_hidden_state=encoder_outputs.last_hidden_state,
-            encoder_hidden_states=encoder_outputs.hidden_states,
-            encoder_attentions=encoder_outputs.attentions,
-        )
-
-
-class FlaxLongT5ForConditionalGeneration(FlaxLongT5PreTrainedModel):
-    module_class = FlaxLongT5ForConditionalGenerationModule
-
-    @add_start_docstrings(LONGT5_DECODE_INPUTS_DOCSTRING)
-    @replace_return_docstrings(output_type=FlaxCausalLMOutputWithCrossAttentions, config_class=LongT5Config)
-    def decode(
-        self,
-        decoder_input_ids,
-        encoder_outputs,
-        encoder_attention_mask: Optional[jnp.ndarray] = None,
-        decoder_attention_mask: Optional[jnp.ndarray] = None,
-        past_key_values: dict = None,
-        output_attentions: Optional[bool] = None,
-        output_hidden_states: Optional[bool] = None,
-        return_dict: Optional[bool] = None,
-        train: bool = False,
-        params: dict = None,
-        dropout_rng: PRNGKey = None,
-    ):
-        r"""
-        Returns:
-
-        Example:
-
-        ```python
-        >>> from transformers import AutoTokenizer, FlaxLongT5ForConditionalGeneration
-        >>> import jax.numpy as jnp
-
-        >>> tokenizer = AutoTokenizer.from_pretrained("t5-base")
-        >>> model = FlaxLongT5ForConditionalGeneration.from_pretrained("google/long-t5-local-base")
-
-        >>> text = "summarize: My friends are cool but they eat too many carbs."
-        >>> inputs = tokenizer(text, return_tensors="np")
-        >>> encoder_outputs = model.encode(**inputs)
-
-        >>> decoder_start_token_id = model.config.decoder_start_token_id
-        >>> decoder_input_ids = jnp.ones((inputs.input_ids.shape[0], 1), dtype="i4") * decoder_start_token_id
-
-        >>> outputs = model.decode(decoder_input_ids, encoder_outputs)
-        >>> logits = outputs.logits
-        ```"""
-        output_attentions = output_attentions if output_attentions is not None else self.config.output_attentions
-        output_hidden_states = (
-            output_hidden_states if output_hidden_states is not None else self.config.output_hidden_states
-        )
-        return_dict = return_dict if return_dict is not None else self.config.return_dict
-
-        encoder_hidden_states = encoder_outputs[0]
-        if encoder_attention_mask is None:
-            batch_size, sequence_length = encoder_hidden_states.shape[:2]
-            encoder_attention_mask = jnp.ones((batch_size, sequence_length))
-
-        batch_size, sequence_length = decoder_input_ids.shape
-        if decoder_attention_mask is None:
-            decoder_attention_mask = jnp.ones((batch_size, sequence_length))
-
-        # Handle any PRNG if needed
-        rngs = {}
-        if dropout_rng is not None:
-            rngs["dropout"] = dropout_rng
-
-        inputs = {"params": params or self.params}
-
-        # if past_key_values are passed then cache is already initialized a private flag init_cache has to be
-        # passed down to ensure cache is used. It has to be made sure that cache is marked as mutable so that
-        # it can be changed by FlaxLongT5Attention module
-        if past_key_values:
-            inputs["cache"] = past_key_values
-            mutable = ["cache"]
-        else:
-            mutable = False
-
-        def _decoder_forward(module, decoder_input_ids, decoder_attention_mask, **kwargs):
-            decoder_module = module._get_decoder_module()
-            decoder_outputs = decoder_module(
-                decoder_input_ids,
-                decoder_attention_mask,
-                **kwargs,
-            )
-
-            sequence_output = decoder_outputs[0]
-
-            if self.config.tie_word_embeddings:
-                # Rescale output before projecting on vocab
-                # See https://github.com/tensorflow/mesh/blob/fa19d69eafc9a482aff0b59ddd96b025c0cb207d/mesh_tensorflow/transformer/transformer.py#L586
-                sequence_output = sequence_output * (self.config.d_model**-0.5)
-
-            if self.config.tie_word_embeddings:
-                shared_embedding = module.shared.variables["params"]["embedding"]
-                lm_logits = module.lm_head.apply({"params": {"kernel": shared_embedding.T}}, sequence_output)
-            else:
-                lm_logits = module.lm_head(sequence_output)
-
-            return lm_logits, decoder_outputs
-
-        outputs = self.module.apply(
-            inputs,
-            decoder_input_ids=jnp.array(decoder_input_ids, dtype="i4"),
-            decoder_attention_mask=jnp.array(decoder_attention_mask, dtype="i4"),
-            encoder_hidden_states=encoder_hidden_states,
-            encoder_attention_mask=jnp.array(encoder_attention_mask, dtype="i4"),
-            output_attentions=output_attentions,
-            output_hidden_states=output_hidden_states,
-            return_dict=return_dict,
-            deterministic=not train,
-            rngs=rngs,
-            mutable=mutable,
-            method=_decoder_forward,
-        )
-
-        if past_key_values is None:
-            lm_logits, decoder_outputs = outputs
-        else:
-            (lm_logits, decoder_outputs), past = outputs
-
-        if return_dict:
-            outputs = FlaxCausalLMOutputWithCrossAttentions(
-                logits=lm_logits,
-                hidden_states=decoder_outputs.hidden_states,
-                attentions=decoder_outputs.attentions,
-                cross_attentions=decoder_outputs.cross_attentions,
-            )
-        else:
-            outputs = (lm_logits,) + decoder_outputs[1:]
-
-        # add updated cache to model output
-        if past_key_values is not None and return_dict:
-            outputs["past_key_values"] = unfreeze(past["cache"])
-            return outputs
-        elif past_key_values is not None and not return_dict:
-            outputs = outputs[:1] + (unfreeze(past["cache"]),) + outputs[1:]
-
-        return outputs
-
-    def prepare_inputs_for_generation(
-        self,
-        decoder_input_ids,
-        max_length,
-        attention_mask: Optional[jax.Array] = None,
-        decoder_attention_mask: Optional[jax.Array] = None,
-        encoder_outputs=None,
-        **kwargs,
-    ):
-        # initializing the cache
-        batch_size, seq_length = decoder_input_ids.shape
-
-        past_key_values = self.init_cache(batch_size, max_length, encoder_outputs)
-        # Note that usually one would have to put 0's in the attention_mask for x > input_ids.shape[-1] and x < cache_length.
-        # But since the decoder uses a causal mask, those positions are masked anyways.
-        # Thus we can create a single static attention_mask here, which is more efficient for compilation
-        extended_attention_mask = jnp.ones((batch_size, max_length), dtype="i4")
-        if decoder_attention_mask is not None:
-            extended_attention_mask = jax.lax.dynamic_update_slice(
-                extended_attention_mask, decoder_attention_mask, (0, 0)
-            )
-
-        return {
-            "past_key_values": past_key_values,
-            "encoder_outputs": encoder_outputs,
-            "encoder_attention_mask": attention_mask,
-            "decoder_attention_mask": extended_attention_mask,
-        }
-
-    def update_inputs_for_generation(self, model_outputs, model_kwargs):
-        model_kwargs["past_key_values"] = model_outputs.past_key_values
-        return model_kwargs
-
-
-FLAX_LONGT5_CONDITIONAL_GENERATION_DOCSTRING = """
-    Returns:
-
-    Example:
-
-    ```python
-    >>> from transformers import AutoTokenizer, FlaxLongT5ForConditionalGeneration
-
-    >>> tokenizer = AutoTokenizer.from_pretrained("t5-base")
-    >>> model = FlaxLongT5ForConditionalGeneration.from_pretrained("google/long-t5-local-base")
-
-    >>> ARTICLE_TO_SUMMARIZE = "summarize: My friends are cool but they eat too many carbs."
-    >>> inputs = tokenizer([ARTICLE_TO_SUMMARIZE], return_tensors="np")
-
-    >>> # Generate Summary
-    >>> summary_ids = model.generate(inputs["input_ids"]).sequences
-    >>> print(tokenizer.decode(summary_ids[0], skip_special_tokens=True, clean_up_tokenization_spaces=False))
-    ```
-"""
-
-
-overwrite_call_docstring(
-    FlaxLongT5ForConditionalGeneration, LONGT5_INPUTS_DOCSTRING + FLAX_LONGT5_CONDITIONAL_GENERATION_DOCSTRING
-)
-append_replace_return_docstrings(
-    FlaxLongT5ForConditionalGeneration, output_type=FlaxSeq2SeqLMOutput, config_class=_CONFIG_FOR_DOC
-)
diff --git a/spaces/yizhangliu/Grounded-Segment-Anything/transformers_4_35_0/models/mobilebert/configuration_mobilebert.py b/spaces/yizhangliu/Grounded-Segment-Anything/transformers_4_35_0/models/mobilebert/configuration_mobilebert.py
deleted file mode 100644
index afe6c3b3d927982abf0331299127ee7c956edd27..0000000000000000000000000000000000000000
--- a/spaces/yizhangliu/Grounded-Segment-Anything/transformers_4_35_0/models/mobilebert/configuration_mobilebert.py
+++ /dev/null
@@ -1,187 +0,0 @@
-# coding=utf-8
-# Copyright 2020 The HuggingFace Team. All rights reserved.
-#
-# Licensed under the Apache License, Version 2.0 (the "License");
-# you may not use this file except in compliance with the License.
-# You may obtain a copy of the License at
-#
-#     http://www.apache.org/licenses/LICENSE-2.0
-#
-# Unless required by applicable law or agreed to in writing, software
-# distributed under the License is distributed on an "AS IS" BASIS,
-# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-# See the License for the specific language governing permissions and
-# limitations under the License.
-""" MobileBERT model configuration"""
-from collections import OrderedDict
-from typing import Mapping
-
-from ...configuration_utils import PretrainedConfig
-from ...onnx import OnnxConfig
-from ...utils import logging
-
-
-logger = logging.get_logger(__name__)
-
-MOBILEBERT_PRETRAINED_CONFIG_ARCHIVE_MAP = {
-    "google/mobilebert-uncased": "https://huggingface.co/google/mobilebert-uncased/resolve/main/config.json"
-}
-
-
-class MobileBertConfig(PretrainedConfig):
-    r"""
-    This is the configuration class to store the configuration of a [`MobileBertModel`] or a [`TFMobileBertModel`]. It
-    is used to instantiate a MobileBERT model according to the specified arguments, defining the model architecture.
-    Instantiating a configuration with the defaults will yield a similar configuration to that of the MobileBERT
-    [google/mobilebert-uncased](https://huggingface.co/google/mobilebert-uncased) architecture.
-
-    Configuration objects inherit from [`PretrainedConfig`] and can be used to control the model outputs. Read the
-    documentation from [`PretrainedConfig`] for more information.
-
-
-    Args:
-        vocab_size (`int`, *optional*, defaults to 30522):
-            Vocabulary size of the MobileBERT model. Defines the number of different tokens that can be represented by
-            the `inputs_ids` passed when calling [`MobileBertModel`] or [`TFMobileBertModel`].
-        hidden_size (`int`, *optional*, defaults to 512):
-            Dimensionality of the encoder layers and the pooler layer.
-        num_hidden_layers (`int`, *optional*, defaults to 24):
-            Number of hidden layers in the Transformer encoder.
-        num_attention_heads (`int`, *optional*, defaults to 4):
-            Number of attention heads for each attention layer in the Transformer encoder.
-        intermediate_size (`int`, *optional*, defaults to 512):
-            Dimensionality of the "intermediate" (often named feed-forward) layer in the Transformer encoder.
-        hidden_act (`str` or `function`, *optional*, defaults to `"relu"`):
-            The non-linear activation function (function or string) in the encoder and pooler. If string, `"gelu"`,
-            `"relu"`, `"silu"` and `"gelu_new"` are supported.
-        hidden_dropout_prob (`float`, *optional*, defaults to 0.0):
-            The dropout probability for all fully connected layers in the embeddings, encoder, and pooler.
-        attention_probs_dropout_prob (`float`, *optional*, defaults to 0.1):
-            The dropout ratio for the attention probabilities.
-        max_position_embeddings (`int`, *optional*, defaults to 512):
-            The maximum sequence length that this model might ever be used with. Typically set this to something large
-            just in case (e.g., 512 or 1024 or 2048).
-        type_vocab_size (`int`, *optional*, defaults to 2):
-            The vocabulary size of the `token_type_ids` passed when calling [`MobileBertModel`] or
-            [`TFMobileBertModel`].
-        initializer_range (`float`, *optional*, defaults to 0.02):
-            The standard deviation of the truncated_normal_initializer for initializing all weight matrices.
-        layer_norm_eps (`float`, *optional*, defaults to 1e-12):
-            The epsilon used by the layer normalization layers.
-
-        pad_token_id (`int`, *optional*, defaults to 0):
-            The ID of the token in the word embedding to use as padding.
-        embedding_size (`int`, *optional*, defaults to 128):
-            The dimension of the word embedding vectors.
-        trigram_input (`bool`, *optional*, defaults to `True`):
-            Use a convolution of trigram as input.
-        use_bottleneck (`bool`, *optional*, defaults to `True`):
-            Whether to use bottleneck in BERT.
-        intra_bottleneck_size (`int`, *optional*, defaults to 128):
-            Size of bottleneck layer output.
-        use_bottleneck_attention (`bool`, *optional*, defaults to `False`):
-            Whether to use attention inputs from the bottleneck transformation.
-        key_query_shared_bottleneck (`bool`, *optional*, defaults to `True`):
-            Whether to use the same linear transformation for query&key in the bottleneck.
-        num_feedforward_networks (`int`, *optional*, defaults to 4):
-            Number of FFNs in a block.
-        normalization_type (`str`, *optional*, defaults to `"no_norm"`):
-            The normalization type in MobileBERT.
-        classifier_dropout (`float`, *optional*):
-            The dropout ratio for the classification head.
-
-    Examples:
-
-    ```python
-    >>> from transformers import MobileBertConfig, MobileBertModel
-
-    >>> # Initializing a MobileBERT configuration
-    >>> configuration = MobileBertConfig()
-
-    >>> # Initializing a model (with random weights) from the configuration above
-    >>> model = MobileBertModel(configuration)
-
-    >>> # Accessing the model configuration
-    >>> configuration = model.config
-    ```
-
-    Attributes: pretrained_config_archive_map (Dict[str, str]): A dictionary containing all the available pre-trained
-    checkpoints.
-    """
-    pretrained_config_archive_map = MOBILEBERT_PRETRAINED_CONFIG_ARCHIVE_MAP
-    model_type = "mobilebert"
-
-    def __init__(
-        self,
-        vocab_size=30522,
-        hidden_size=512,
-        num_hidden_layers=24,
-        num_attention_heads=4,
-        intermediate_size=512,
-        hidden_act="relu",
-        hidden_dropout_prob=0.0,
-        attention_probs_dropout_prob=0.1,
-        max_position_embeddings=512,
-        type_vocab_size=2,
-        initializer_range=0.02,
-        layer_norm_eps=1e-12,
-        pad_token_id=0,
-        embedding_size=128,
-        trigram_input=True,
-        use_bottleneck=True,
-        intra_bottleneck_size=128,
-        use_bottleneck_attention=False,
-        key_query_shared_bottleneck=True,
-        num_feedforward_networks=4,
-        normalization_type="no_norm",
-        classifier_activation=True,
-        classifier_dropout=None,
-        **kwargs,
-    ):
-        super().__init__(pad_token_id=pad_token_id, **kwargs)
-
-        self.vocab_size = vocab_size
-        self.hidden_size = hidden_size
-        self.num_hidden_layers = num_hidden_layers
-        self.num_attention_heads = num_attention_heads
-        self.hidden_act = hidden_act
-        self.intermediate_size = intermediate_size
-        self.hidden_dropout_prob = hidden_dropout_prob
-        self.attention_probs_dropout_prob = attention_probs_dropout_prob
-        self.max_position_embeddings = max_position_embeddings
-        self.type_vocab_size = type_vocab_size
-        self.initializer_range = initializer_range
-        self.layer_norm_eps = layer_norm_eps
-        self.embedding_size = embedding_size
-        self.trigram_input = trigram_input
-        self.use_bottleneck = use_bottleneck
-        self.intra_bottleneck_size = intra_bottleneck_size
-        self.use_bottleneck_attention = use_bottleneck_attention
-        self.key_query_shared_bottleneck = key_query_shared_bottleneck
-        self.num_feedforward_networks = num_feedforward_networks
-        self.normalization_type = normalization_type
-        self.classifier_activation = classifier_activation
-
-        if self.use_bottleneck:
-            self.true_hidden_size = intra_bottleneck_size
-        else:
-            self.true_hidden_size = hidden_size
-
-        self.classifier_dropout = classifier_dropout
-
-
-# Copied from transformers.models.bert.configuration_bert.BertOnnxConfig with Bert->MobileBert
-class MobileBertOnnxConfig(OnnxConfig):
-    @property
-    def inputs(self) -> Mapping[str, Mapping[int, str]]:
-        if self.task == "multiple-choice":
-            dynamic_axis = {0: "batch", 1: "choice", 2: "sequence"}
-        else:
-            dynamic_axis = {0: "batch", 1: "sequence"}
-        return OrderedDict(
-            [
-                ("input_ids", dynamic_axis),
-                ("attention_mask", dynamic_axis),
-                ("token_type_ids", dynamic_axis),
-            ]
-        )
diff --git a/spaces/yizhangliu/Grounded-Segment-Anything/transformers_4_35_0/models/owlvit/feature_extraction_owlvit.py b/spaces/yizhangliu/Grounded-Segment-Anything/transformers_4_35_0/models/owlvit/feature_extraction_owlvit.py
deleted file mode 100644
index f85fd7f31ea4223be9054ccccc5633bdeef433aa..0000000000000000000000000000000000000000
--- a/spaces/yizhangliu/Grounded-Segment-Anything/transformers_4_35_0/models/owlvit/feature_extraction_owlvit.py
+++ /dev/null
@@ -1,33 +0,0 @@
-# coding=utf-8
-# Copyright 2022 The HuggingFace Inc. team. All rights reserved.
-#
-# Licensed under the Apache License, Version 2.0 (the "License");
-# you may not use this file except in compliance with the License.
-# You may obtain a copy of the License at
-#
-#     http://www.apache.org/licenses/LICENSE-2.0
-#
-# Unless required by applicable law or agreed to in writing, software
-# distributed under the License is distributed on an "AS IS" BASIS,
-# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-# See the License for the specific language governing permissions and
-# limitations under the License.
-"""Feature extractor class for OwlViT."""
-
-import warnings
-
-from ...utils import logging
-from .image_processing_owlvit import OwlViTImageProcessor
-
-
-logger = logging.get_logger(__name__)
-
-
-class OwlViTFeatureExtractor(OwlViTImageProcessor):
-    def __init__(self, *args, **kwargs) -> None:
-        warnings.warn(
-            "The class OwlViTFeatureExtractor is deprecated and will be removed in version 5 of Transformers. Please"
-            " use OwlViTImageProcessor instead.",
-            FutureWarning,
-        )
-        super().__init__(*args, **kwargs)
diff --git a/spaces/ysharma/LLaVA_v1/llava/eval/eval_gpt_review_visual.py b/spaces/ysharma/LLaVA_v1/llava/eval/eval_gpt_review_visual.py
deleted file mode 100644
index d6e407a400a67020d801e6c27a3c32a2ee38f30c..0000000000000000000000000000000000000000
--- a/spaces/ysharma/LLaVA_v1/llava/eval/eval_gpt_review_visual.py
+++ /dev/null
@@ -1,118 +0,0 @@
-import argparse
-import json
-import os
-
-import openai
-import time
-
-NUM_SECONDS_TO_SLEEP = 0.5
-
-
-def get_eval(content: str, max_tokens: int):
-    while True:
-        try:
-            response = openai.ChatCompletion.create(
-                model='gpt-4-0314',
-                messages=[{
-                    'role': 'system',
-                    'content': 'You are a helpful and precise assistant for checking the quality of the answer.'
-                }, {
-                    'role': 'user',
-                    'content': content,
-                }],
-                temperature=0.2,  # TODO: figure out which temperature is best for evaluation
-                max_tokens=max_tokens,
-            )
-            break
-        except openai.error.RateLimitError:
-            pass
-        except Exception as e:
-            print(e)
-        time.sleep(NUM_SECONDS_TO_SLEEP)
-
-    return response['choices'][0]['message']['content']
-
-
-def parse_score(review):
-    try:
-        score_pair = review.split('\n')[0]
-        score_pair = score_pair.replace(',', ' ')
-        sp = score_pair.split(' ')
-        if len(sp) == 2:
-            return [float(sp[0]), float(sp[1])]
-        else:
-            print('error', review)
-            return [-1, -1]
-    except Exception as e:
-        print(e)
-        print('error', review)
-        return [-1, -1]
-
-
-if __name__ == '__main__':
-    parser = argparse.ArgumentParser(description='ChatGPT-based QA evaluation.')
-    parser.add_argument('-q', '--question')
-    parser.add_argument('-c', '--context')
-    parser.add_argument('-a', '--answer-list', nargs='+', default=[])
-    parser.add_argument('-r', '--rule')
-    parser.add_argument('-o', '--output')
-    parser.add_argument('--max-tokens', type=int, default=1024, help='maximum number of tokens produced in the output')
-    args = parser.parse_args()
-
-    f_q = open(os.path.expanduser(args.question))
-    f_ans1 = open(os.path.expanduser(args.answer_list[0]))
-    f_ans2 = open(os.path.expanduser(args.answer_list[1]))
-    rule_dict = json.load(open(os.path.expanduser(args.rule), 'r'))
-
-    if os.path.isfile(os.path.expanduser(args.output)):
-        cur_reviews = [json.loads(line) for line in open(os.path.expanduser(args.output))]
-    else:
-        cur_reviews = []
-
-    review_file = open(f'{args.output}', 'a')
-
-    context_list = [json.loads(line) for line in open(os.path.expanduser(args.context))]
-    image_to_context = {context['image']: context for context in context_list}
-
-    handles = []
-    idx = 0
-    for ques_js, ans1_js, ans2_js in zip(f_q, f_ans1, f_ans2):
-        ques = json.loads(ques_js)
-        ans1 = json.loads(ans1_js)
-        ans2 = json.loads(ans2_js)
-
-        inst = image_to_context[ques['image']]
-        cap_str = '\n'.join(inst['captions'])
-        box_str = '\n'.join([f'{instance["category"]}: {instance["bbox"]}' for instance in inst['instances']])
-
-        category = json.loads(ques_js)['category']
-        if category in rule_dict:
-            rule = rule_dict[category]
-        else:
-            assert False, f"Visual QA category not found in rule file: {category}."
-        prompt = rule['prompt']
-        role = rule['role']
-        content = (f'[Context]\n{cap_str}\n\n{box_str}\n\n'
-                   f'[Question]\n{ques["text"]}\n\n'
-                   f'[{role} 1]\n{ans1["text"]}\n\n[End of {role} 1]\n\n'
-                   f'[{role} 2]\n{ans2["text"]}\n\n[End of {role} 2]\n\n'
-                   f'[System]\n{prompt}\n\n')
-        cur_js = {
-            'id': idx+1,
-            'question_id': ques['question_id'],
-            'answer1_id': ans1.get('answer_id', ans1['question_id']),
-            'answer2_id': ans2.get('answer_id', ans2['answer_id']),
-            'category': category
-        }
-        if idx >= len(cur_reviews):
-            review = get_eval(content, args.max_tokens)
-            scores = parse_score(review)
-            cur_js['content'] = review
-            cur_js['tuple'] = scores
-            review_file.write(json.dumps(cur_js) + '\n')
-            review_file.flush()
-        else:
-            print(f'Skipping {idx} as we already have it.')
-        idx += 1
-        print(idx)
-    review_file.close()
diff --git a/spaces/yuezih/BLIP-SMILE/SMILE/BLIP/models/__init__.py b/spaces/yuezih/BLIP-SMILE/SMILE/BLIP/models/__init__.py
deleted file mode 100644
index e69de29bb2d1d6434b8b29ae775ad8c2e48c5391..0000000000000000000000000000000000000000
diff --git a/spaces/yufiofficial/MusicGenQ/audiocraft/quantization/vq.py b/spaces/yufiofficial/MusicGenQ/audiocraft/quantization/vq.py
deleted file mode 100644
index f67c3a0cd30d4b8993a36c587f00dc8a451d926f..0000000000000000000000000000000000000000
--- a/spaces/yufiofficial/MusicGenQ/audiocraft/quantization/vq.py
+++ /dev/null
@@ -1,116 +0,0 @@
-# Copyright (c) Meta Platforms, Inc. and affiliates.
-# All rights reserved.
-#
-# This source code is licensed under the license found in the
-# LICENSE file in the root directory of this source tree.
-
-import math
-import typing as tp
-
-import torch
-
-from .base import BaseQuantizer, QuantizedResult
-from .core_vq import ResidualVectorQuantization
-
-
-class ResidualVectorQuantizer(BaseQuantizer):
-    """Residual Vector Quantizer.
-
-    Args:
-        dimension (int): Dimension of the codebooks.
-        n_q (int): Number of residual vector quantizers used.
-        q_dropout (bool): Random quantizer drop out at train time.
-        bins (int): Codebook size.
-        decay (float): Decay for exponential moving average over the codebooks.
-        kmeans_init (bool): Whether to use kmeans to initialize the codebooks.
-        kmeans_iters (int): Number of iterations used for kmeans initialization.
-        threshold_ema_dead_code (int): Threshold for dead code expiration. Replace any codes
-            that have an exponential moving average cluster size less than the specified threshold with
-            randomly selected vector from the current batch.
-        orthogonal_reg_weight (float): Orthogonal regularization weights.
-        orthogonal_reg_active_codes_only (bool): Apply orthogonal regularization only on active codes.
-        orthogonal_reg_max_codes (optional int): Maximum number of codes to consider.
-            for orthogonal regulariation.
-    """
-    def __init__(
-        self,
-        dimension: int = 256,
-        n_q: int = 8,
-        q_dropout: bool = False,
-        bins: int = 1024,
-        decay: float = 0.99,
-        kmeans_init: bool = True,
-        kmeans_iters: int = 10,
-        threshold_ema_dead_code: int = 2,
-        orthogonal_reg_weight: float = 0.0,
-        orthogonal_reg_active_codes_only: bool = False,
-        orthogonal_reg_max_codes: tp.Optional[int] = None,
-    ):
-        super().__init__()
-        self.max_n_q = n_q
-        self.n_q = n_q
-        self.q_dropout = q_dropout
-        self.dimension = dimension
-        self.bins = bins
-        self.decay = decay
-        self.kmeans_init = kmeans_init
-        self.kmeans_iters = kmeans_iters
-        self.threshold_ema_dead_code = threshold_ema_dead_code
-        self.orthogonal_reg_weight = orthogonal_reg_weight
-        self.orthogonal_reg_active_codes_only = orthogonal_reg_active_codes_only
-        self.orthogonal_reg_max_codes = orthogonal_reg_max_codes
-        self.vq = ResidualVectorQuantization(
-            dim=self.dimension,
-            codebook_size=self.bins,
-            num_quantizers=self.n_q,
-            decay=self.decay,
-            kmeans_init=self.kmeans_init,
-            kmeans_iters=self.kmeans_iters,
-            threshold_ema_dead_code=self.threshold_ema_dead_code,
-            orthogonal_reg_weight=self.orthogonal_reg_weight,
-            orthogonal_reg_active_codes_only=self.orthogonal_reg_active_codes_only,
-            orthogonal_reg_max_codes=self.orthogonal_reg_max_codes,
-            channels_last=False
-        )
-
-    def forward(self, x: torch.Tensor, frame_rate: int):
-        n_q = self.n_q
-        if self.training and self.q_dropout:
-            n_q = int(torch.randint(1, self.n_q + 1, (1,)).item())
-        bw_per_q = math.log2(self.bins) * frame_rate / 1000
-        quantized, codes, commit_loss = self.vq(x, n_q=n_q)
-        codes = codes.transpose(0, 1)
-        # codes is [B, K, T], with T frames, K nb of codebooks.
-        bw = torch.tensor(n_q * bw_per_q).to(x)
-        return QuantizedResult(quantized, codes, bw, penalty=torch.mean(commit_loss))
-
-    def encode(self, x: torch.Tensor) -> torch.Tensor:
-        """Encode a given input tensor with the specified frame rate at the given bandwidth.
-        The RVQ encode method sets the appropriate number of quantizer to use
-        and returns indices for each quantizer.
-        """
-        n_q = self.n_q
-        codes = self.vq.encode(x, n_q=n_q)
-        codes = codes.transpose(0, 1)
-        # codes is [B, K, T], with T frames, K nb of codebooks.
-        return codes
-
-    def decode(self, codes: torch.Tensor) -> torch.Tensor:
-        """Decode the given codes to the quantized representation.
-        """
-        # codes is [B, K, T], with T frames, K nb of codebooks, vq.decode expects [K, B, T].
-        codes = codes.transpose(0, 1)
-        quantized = self.vq.decode(codes)
-        return quantized
-
-    @property
-    def total_codebooks(self):
-        return self.max_n_q
-
-    @property
-    def num_codebooks(self):
-        return self.n_q
-
-    def set_num_codebooks(self, n: int):
-        assert n > 0 and n <= self.max_n_q
-        self.n_q = n
diff --git a/spaces/yufiofficial/MusicGenQ/tests/models/test_encodec_model.py b/spaces/yufiofficial/MusicGenQ/tests/models/test_encodec_model.py
deleted file mode 100644
index 2f9c1db3f69a45f02451b71da95f44356811acbb..0000000000000000000000000000000000000000
--- a/spaces/yufiofficial/MusicGenQ/tests/models/test_encodec_model.py
+++ /dev/null
@@ -1,60 +0,0 @@
-# Copyright (c) Meta Platforms, Inc. and affiliates.
-# All rights reserved.
-#
-# This source code is licensed under the license found in the
-# LICENSE file in the root directory of this source tree.
-
-import random
-
-import numpy as np
-import torch
-
-from audiocraft.models import EncodecModel
-from audiocraft.modules import SEANetEncoder, SEANetDecoder
-from audiocraft.quantization import DummyQuantizer
-
-
-class TestEncodecModel:
-
-    def _create_encodec_model(self,
-                              sample_rate: int,
-                              channels: int,
-                              dim: int = 5,
-                              n_filters: int = 3,
-                              n_residual_layers: int = 1,
-                              ratios: list = [5, 4, 3, 2],
-                              **kwargs):
-        frame_rate = np.prod(ratios)
-        encoder = SEANetEncoder(channels=channels, dimension=dim, n_filters=n_filters,
-                                n_residual_layers=n_residual_layers, ratios=ratios)
-        decoder = SEANetDecoder(channels=channels, dimension=dim, n_filters=n_filters,
-                                n_residual_layers=n_residual_layers, ratios=ratios)
-        quantizer = DummyQuantizer()
-        model = EncodecModel(encoder, decoder, quantizer, frame_rate=frame_rate,
-                             sample_rate=sample_rate, channels=channels, **kwargs)
-        return model
-
-    def test_model(self):
-        random.seed(1234)
-        sample_rate = 24_000
-        channels = 1
-        model = self._create_encodec_model(sample_rate, channels)
-        for _ in range(10):
-            length = random.randrange(1, 10_000)
-            x = torch.randn(2, channels, length)
-            res = model(x)
-            assert res.x.shape == x.shape
-
-    def test_model_renorm(self):
-        random.seed(1234)
-        sample_rate = 24_000
-        channels = 1
-        model_nonorm = self._create_encodec_model(sample_rate, channels, renormalize=False)
-        model_renorm = self._create_encodec_model(sample_rate, channels, renormalize=True)
-
-        for _ in range(10):
-            length = random.randrange(1, 10_000)
-            x = torch.randn(2, channels, length)
-            codes, scales = model_nonorm.encode(x)
-            codes, scales = model_renorm.encode(x)
-            assert scales is not None
diff --git a/spaces/zhanghaohui/szu-gpt-academic/crazy_functions/test_project/cpp/libJPG/jpgd.cpp b/spaces/zhanghaohui/szu-gpt-academic/crazy_functions/test_project/cpp/libJPG/jpgd.cpp
deleted file mode 100644
index 36d06c8e9068570c3e7624895d474f33dbfe3d29..0000000000000000000000000000000000000000
--- a/spaces/zhanghaohui/szu-gpt-academic/crazy_functions/test_project/cpp/libJPG/jpgd.cpp
+++ /dev/null
@@ -1,3276 +0,0 @@
-// jpgd.cpp - C++ class for JPEG decompression.
-// Public domain, Rich Geldreich <richgel99@gmail.com>
-// Last updated Apr. 16, 2011
-// Alex Evans: Linear memory allocator (taken from jpge.h).
-//
-// Supports progressive and baseline sequential JPEG image files, and the most common chroma subsampling factors: Y, H1V1, H2V1, H1V2, and H2V2.
-//
-// Chroma upsampling quality: H2V2 is upsampled in the frequency domain, H2V1 and H1V2 are upsampled using point sampling.
-// Chroma upsampling reference: "Fast Scheme for Image Size Change in the Compressed Domain"
-// http://vision.ai.uiuc.edu/~dugad/research/dct/index.html
-
-#include "jpgd.h"
-#include <string.h>
-
-#include <assert.h>
-// BEGIN EPIC MOD
-#define JPGD_ASSERT(x) { assert(x); CA_ASSUME(x); } (void)0
-// END EPIC MOD
-
-#ifdef _MSC_VER
-#pragma warning (disable : 4611) // warning C4611: interaction between '_setjmp' and C++ object destruction is non-portable
-#endif
-
-// Set to 1 to enable freq. domain chroma upsampling on images using H2V2 subsampling (0=faster nearest neighbor sampling).
-// This is slower, but results in higher quality on images with highly saturated colors.
-#define JPGD_SUPPORT_FREQ_DOMAIN_UPSAMPLING 1
-
-#define JPGD_TRUE (1)
-#define JPGD_FALSE (0)
-
-#define JPGD_MAX(a,b) (((a)>(b)) ? (a) : (b))
-#define JPGD_MIN(a,b) (((a)<(b)) ? (a) : (b))
-
-namespace jpgd {
-
-	static inline void *jpgd_malloc(size_t nSize) { return FMemory::Malloc(nSize); }
-	static inline void jpgd_free(void *p) { FMemory::Free(p); }
-
-// BEGIN EPIC MOD
-//@UE3 - use UE3 BGRA encoding instead of assuming RGBA
-	// stolen from IImageWrapper.h
-	enum ERGBFormatJPG
-	{
-		Invalid = -1,
-		RGBA =  0,
-		BGRA =  1,
-		Gray =  2,
-	};
-	static ERGBFormatJPG jpg_format;
-// END EPIC MOD
-
-	// DCT coefficients are stored in this sequence.
-	static int g_ZAG[64] = {  0,1,8,16,9,2,3,10,17,24,32,25,18,11,4,5,12,19,26,33,40,48,41,34,27,20,13,6,7,14,21,28,35,42,49,56,57,50,43,36,29,22,15,23,30,37,44,51,58,59,52,45,38,31,39,46,53,60,61,54,47,55,62,63 };
-
-	enum JPEG_MARKER
-	{
-		M_SOF0  = 0xC0, M_SOF1  = 0xC1, M_SOF2  = 0xC2, M_SOF3  = 0xC3, M_SOF5  = 0xC5, M_SOF6  = 0xC6, M_SOF7  = 0xC7, M_JPG   = 0xC8,
-		M_SOF9  = 0xC9, M_SOF10 = 0xCA, M_SOF11 = 0xCB, M_SOF13 = 0xCD, M_SOF14 = 0xCE, M_SOF15 = 0xCF, M_DHT   = 0xC4, M_DAC   = 0xCC,
-		M_RST0  = 0xD0, M_RST1  = 0xD1, M_RST2  = 0xD2, M_RST3  = 0xD3, M_RST4  = 0xD4, M_RST5  = 0xD5, M_RST6  = 0xD6, M_RST7  = 0xD7,
-		M_SOI   = 0xD8, M_EOI   = 0xD9, M_SOS   = 0xDA, M_DQT   = 0xDB, M_DNL   = 0xDC, M_DRI   = 0xDD, M_DHP   = 0xDE, M_EXP   = 0xDF,
-		M_APP0  = 0xE0, M_APP15 = 0xEF, M_JPG0  = 0xF0, M_JPG13 = 0xFD, M_COM   = 0xFE, M_TEM   = 0x01, M_ERROR = 0x100, RST0   = 0xD0
-	};
-
-	enum JPEG_SUBSAMPLING { JPGD_GRAYSCALE = 0, JPGD_YH1V1, JPGD_YH2V1, JPGD_YH1V2, JPGD_YH2V2 };
-
-#define CONST_BITS  13
-#define PASS1_BITS  2
-#define SCALEDONE ((int32)1)
-
-#define FIX_0_298631336  ((int32)2446)        /* FIX(0.298631336) */
-#define FIX_0_390180644  ((int32)3196)        /* FIX(0.390180644) */
-#define FIX_0_541196100  ((int32)4433)        /* FIX(0.541196100) */
-#define FIX_0_765366865  ((int32)6270)        /* FIX(0.765366865) */
-#define FIX_0_899976223  ((int32)7373)        /* FIX(0.899976223) */
-#define FIX_1_175875602  ((int32)9633)        /* FIX(1.175875602) */
-#define FIX_1_501321110  ((int32)12299)       /* FIX(1.501321110) */
-#define FIX_1_847759065  ((int32)15137)       /* FIX(1.847759065) */
-#define FIX_1_961570560  ((int32)16069)       /* FIX(1.961570560) */
-#define FIX_2_053119869  ((int32)16819)       /* FIX(2.053119869) */
-#define FIX_2_562915447  ((int32)20995)       /* FIX(2.562915447) */
-#define FIX_3_072711026  ((int32)25172)       /* FIX(3.072711026) */
-
-#define DESCALE(x,n)  (((x) + (SCALEDONE << ((n)-1))) >> (n))
-#define DESCALE_ZEROSHIFT(x,n)  (((x) + (128 << (n)) + (SCALEDONE << ((n)-1))) >> (n))
-
-#define MULTIPLY(var, cnst)  ((var) * (cnst))
-
-#define CLAMP(i) ((static_cast<uint>(i) > 255) ? (((~i) >> 31) & 0xFF) : (i))
-
-	// Compiler creates a fast path 1D IDCT for X non-zero columns
-	template <int NONZERO_COLS>
-	struct Row
-	{
-		static void idct(int* pTemp, const jpgd_block_t* pSrc)
-		{
-			// ACCESS_COL() will be optimized at compile time to either an array access, or 0.
-#define ACCESS_COL(x) (((x) < NONZERO_COLS) ? (int)pSrc[x] : 0)
-
-			const int z2 = ACCESS_COL(2), z3 = ACCESS_COL(6);
-
-			const int z1 = MULTIPLY(z2 + z3, FIX_0_541196100);
-			const int tmp2 = z1 + MULTIPLY(z3, - FIX_1_847759065);
-			const int tmp3 = z1 + MULTIPLY(z2, FIX_0_765366865);
-
-			const int tmp0 = (ACCESS_COL(0) + ACCESS_COL(4)) << CONST_BITS;
-			const int tmp1 = (ACCESS_COL(0) - ACCESS_COL(4)) << CONST_BITS;
-
-			const int tmp10 = tmp0 + tmp3, tmp13 = tmp0 - tmp3, tmp11 = tmp1 + tmp2, tmp12 = tmp1 - tmp2;
-
-			const int atmp0 = ACCESS_COL(7), atmp1 = ACCESS_COL(5), atmp2 = ACCESS_COL(3), atmp3 = ACCESS_COL(1);
-
-			const int bz1 = atmp0 + atmp3, bz2 = atmp1 + atmp2, bz3 = atmp0 + atmp2, bz4 = atmp1 + atmp3;
-			const int bz5 = MULTIPLY(bz3 + bz4, FIX_1_175875602);
-
-			const int az1 = MULTIPLY(bz1, - FIX_0_899976223);
-			const int az2 = MULTIPLY(bz2, - FIX_2_562915447);
-			const int az3 = MULTIPLY(bz3, - FIX_1_961570560) + bz5;
-			const int az4 = MULTIPLY(bz4, - FIX_0_390180644) + bz5;
-
-			const int btmp0 = MULTIPLY(atmp0, FIX_0_298631336) + az1 + az3;
-			const int btmp1 = MULTIPLY(atmp1, FIX_2_053119869) + az2 + az4;
-			const int btmp2 = MULTIPLY(atmp2, FIX_3_072711026) + az2 + az3;
-			const int btmp3 = MULTIPLY(atmp3, FIX_1_501321110) + az1 + az4;
-
-			pTemp[0] = DESCALE(tmp10 + btmp3, CONST_BITS-PASS1_BITS);
-			pTemp[7] = DESCALE(tmp10 - btmp3, CONST_BITS-PASS1_BITS);
-			pTemp[1] = DESCALE(tmp11 + btmp2, CONST_BITS-PASS1_BITS);
-			pTemp[6] = DESCALE(tmp11 - btmp2, CONST_BITS-PASS1_BITS);
-			pTemp[2] = DESCALE(tmp12 + btmp1, CONST_BITS-PASS1_BITS);
-			pTemp[5] = DESCALE(tmp12 - btmp1, CONST_BITS-PASS1_BITS);
-			pTemp[3] = DESCALE(tmp13 + btmp0, CONST_BITS-PASS1_BITS);
-			pTemp[4] = DESCALE(tmp13 - btmp0, CONST_BITS-PASS1_BITS);
-		}
-	};
-
-	template <>
-	struct Row<0>
-	{
-		static void idct(int* pTemp, const jpgd_block_t* pSrc)
-		{
-#ifdef _MSC_VER
-			pTemp; pSrc;
-#endif
-		}
-	};
-
-	template <>
-	struct Row<1>
-	{
-		static void idct(int* pTemp, const jpgd_block_t* pSrc)
-		{
-			const int dcval = (pSrc[0] << PASS1_BITS);
-
-			pTemp[0] = dcval;
-			pTemp[1] = dcval;
-			pTemp[2] = dcval;
-			pTemp[3] = dcval;
-			pTemp[4] = dcval;
-			pTemp[5] = dcval;
-			pTemp[6] = dcval;
-			pTemp[7] = dcval;
-		}
-	};
-
-	// Compiler creates a fast path 1D IDCT for X non-zero rows
-	template <int NONZERO_ROWS>
-	struct Col
-	{
-		static void idct(uint8* pDst_ptr, const int* pTemp)
-		{
-			// ACCESS_ROW() will be optimized at compile time to either an array access, or 0.
-#define ACCESS_ROW(x) (((x) < NONZERO_ROWS) ? pTemp[x * 8] : 0)
-
-			const int z2 = ACCESS_ROW(2);
-			const int z3 = ACCESS_ROW(6);
-
-			const int z1 = MULTIPLY(z2 + z3, FIX_0_541196100);
-			const int tmp2 = z1 + MULTIPLY(z3, - FIX_1_847759065);
-			const int tmp3 = z1 + MULTIPLY(z2, FIX_0_765366865);
-
-			const int tmp0 = (ACCESS_ROW(0) + ACCESS_ROW(4)) << CONST_BITS;
-			const int tmp1 = (ACCESS_ROW(0) - ACCESS_ROW(4)) << CONST_BITS;
-
-			const int tmp10 = tmp0 + tmp3, tmp13 = tmp0 - tmp3, tmp11 = tmp1 + tmp2, tmp12 = tmp1 - tmp2;
-
-			const int atmp0 = ACCESS_ROW(7), atmp1 = ACCESS_ROW(5), atmp2 = ACCESS_ROW(3), atmp3 = ACCESS_ROW(1);
-
-			const int bz1 = atmp0 + atmp3, bz2 = atmp1 + atmp2, bz3 = atmp0 + atmp2, bz4 = atmp1 + atmp3;
-			const int bz5 = MULTIPLY(bz3 + bz4, FIX_1_175875602);
-
-			const int az1 = MULTIPLY(bz1, - FIX_0_899976223);
-			const int az2 = MULTIPLY(bz2, - FIX_2_562915447);
-			const int az3 = MULTIPLY(bz3, - FIX_1_961570560) + bz5;
-			const int az4 = MULTIPLY(bz4, - FIX_0_390180644) + bz5;
-
-			const int btmp0 = MULTIPLY(atmp0, FIX_0_298631336) + az1 + az3;
-			const int btmp1 = MULTIPLY(atmp1, FIX_2_053119869) + az2 + az4;
-			const int btmp2 = MULTIPLY(atmp2, FIX_3_072711026) + az2 + az3;
-			const int btmp3 = MULTIPLY(atmp3, FIX_1_501321110) + az1 + az4;
-
-			int i = DESCALE_ZEROSHIFT(tmp10 + btmp3, CONST_BITS+PASS1_BITS+3);
-			pDst_ptr[8*0] = (uint8)CLAMP(i);
-
-			i = DESCALE_ZEROSHIFT(tmp10 - btmp3, CONST_BITS+PASS1_BITS+3);
-			pDst_ptr[8*7] = (uint8)CLAMP(i);
-
-			i = DESCALE_ZEROSHIFT(tmp11 + btmp2, CONST_BITS+PASS1_BITS+3);
-			pDst_ptr[8*1] = (uint8)CLAMP(i);
-
-			i = DESCALE_ZEROSHIFT(tmp11 - btmp2, CONST_BITS+PASS1_BITS+3);
-			pDst_ptr[8*6] = (uint8)CLAMP(i);
-
-			i = DESCALE_ZEROSHIFT(tmp12 + btmp1, CONST_BITS+PASS1_BITS+3);
-			pDst_ptr[8*2] = (uint8)CLAMP(i);
-
-			i = DESCALE_ZEROSHIFT(tmp12 - btmp1, CONST_BITS+PASS1_BITS+3);
-			pDst_ptr[8*5] = (uint8)CLAMP(i);
-
-			i = DESCALE_ZEROSHIFT(tmp13 + btmp0, CONST_BITS+PASS1_BITS+3);
-			pDst_ptr[8*3] = (uint8)CLAMP(i);
-
-			i = DESCALE_ZEROSHIFT(tmp13 - btmp0, CONST_BITS+PASS1_BITS+3);
-			pDst_ptr[8*4] = (uint8)CLAMP(i);
-		}
-	};
-
-	template <>
-	struct Col<1>
-	{
-		static void idct(uint8* pDst_ptr, const int* pTemp)
-		{
-			int dcval = DESCALE_ZEROSHIFT(pTemp[0], PASS1_BITS+3);
-			const uint8 dcval_clamped = (uint8)CLAMP(dcval);
-			pDst_ptr[0*8] = dcval_clamped;
-			pDst_ptr[1*8] = dcval_clamped;
-			pDst_ptr[2*8] = dcval_clamped;
-			pDst_ptr[3*8] = dcval_clamped;
-			pDst_ptr[4*8] = dcval_clamped;
-			pDst_ptr[5*8] = dcval_clamped;
-			pDst_ptr[6*8] = dcval_clamped;
-			pDst_ptr[7*8] = dcval_clamped;
-		}
-	};
-
-	static const uint8 s_idct_row_table[] =
-	{
-		1,0,0,0,0,0,0,0, 2,0,0,0,0,0,0,0, 2,1,0,0,0,0,0,0, 2,1,1,0,0,0,0,0, 2,2,1,0,0,0,0,0, 3,2,1,0,0,0,0,0, 4,2,1,0,0,0,0,0, 4,3,1,0,0,0,0,0,
-		4,3,2,0,0,0,0,0, 4,3,2,1,0,0,0,0, 4,3,2,1,1,0,0,0, 4,3,2,2,1,0,0,0, 4,3,3,2,1,0,0,0, 4,4,3,2,1,0,0,0, 5,4,3,2,1,0,0,0, 6,4,3,2,1,0,0,0,
-		6,5,3,2,1,0,0,0, 6,5,4,2,1,0,0,0, 6,5,4,3,1,0,0,0, 6,5,4,3,2,0,0,0, 6,5,4,3,2,1,0,0, 6,5,4,3,2,1,1,0, 6,5,4,3,2,2,1,0, 6,5,4,3,3,2,1,0,
-		6,5,4,4,3,2,1,0, 6,5,5,4,3,2,1,0, 6,6,5,4,3,2,1,0, 7,6,5,4,3,2,1,0, 8,6,5,4,3,2,1,0, 8,7,5,4,3,2,1,0, 8,7,6,4,3,2,1,0, 8,7,6,5,3,2,1,0,
-		8,7,6,5,4,2,1,0, 8,7,6,5,4,3,1,0, 8,7,6,5,4,3,2,0, 8,7,6,5,4,3,2,1, 8,7,6,5,4,3,2,2, 8,7,6,5,4,3,3,2, 8,7,6,5,4,4,3,2, 8,7,6,5,5,4,3,2,
-		8,7,6,6,5,4,3,2, 8,7,7,6,5,4,3,2, 8,8,7,6,5,4,3,2, 8,8,8,6,5,4,3,2, 8,8,8,7,5,4,3,2, 8,8,8,7,6,4,3,2, 8,8,8,7,6,5,3,2, 8,8,8,7,6,5,4,2,
-		8,8,8,7,6,5,4,3, 8,8,8,7,6,5,4,4, 8,8,8,7,6,5,5,4, 8,8,8,7,6,6,5,4, 8,8,8,7,7,6,5,4, 8,8,8,8,7,6,5,4, 8,8,8,8,8,6,5,4, 8,8,8,8,8,7,5,4,
-		8,8,8,8,8,7,6,4, 8,8,8,8,8,7,6,5, 8,8,8,8,8,7,6,6, 8,8,8,8,8,7,7,6, 8,8,8,8,8,8,7,6, 8,8,8,8,8,8,8,6, 8,8,8,8,8,8,8,7, 8,8,8,8,8,8,8,8,
-	};
-
-	static const uint8 s_idct_col_table[] = { 1, 1, 2, 3, 3, 3, 3, 3, 3, 4, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 6, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8 };
-
-	void idct(const jpgd_block_t* pSrc_ptr, uint8* pDst_ptr, int block_max_zag)
-	{
-		JPGD_ASSERT(block_max_zag >= 1);
-		JPGD_ASSERT(block_max_zag <= 64);
-
-		if (block_max_zag == 1)
-		{
-			int k = ((pSrc_ptr[0] + 4) >> 3) + 128;
-			k = CLAMP(k);
-			k = k | (k<<8);
-			k = k | (k<<16);
-
-			for (int i = 8; i > 0; i--)
-			{
-				*(int*)&pDst_ptr[0] = k;
-				*(int*)&pDst_ptr[4] = k;
-				pDst_ptr += 8;
-			}
-			return;
-		}
-
-		int temp[64];
-
-		const jpgd_block_t* pSrc = pSrc_ptr;
-		int* pTemp = temp;
-
-		const uint8* pRow_tab = &s_idct_row_table[(block_max_zag - 1) * 8];
-		int i;
-		for (i = 8; i > 0; i--, pRow_tab++)
-		{
-			switch (*pRow_tab)
-			{
-			case 0: Row<0>::idct(pTemp, pSrc); break;
-			case 1: Row<1>::idct(pTemp, pSrc); break;
-			case 2: Row<2>::idct(pTemp, pSrc); break;
-			case 3: Row<3>::idct(pTemp, pSrc); break;
-			case 4: Row<4>::idct(pTemp, pSrc); break;
-			case 5: Row<5>::idct(pTemp, pSrc); break;
-			case 6: Row<6>::idct(pTemp, pSrc); break;
-			case 7: Row<7>::idct(pTemp, pSrc); break;
-			case 8: Row<8>::idct(pTemp, pSrc); break;
-			}
-
-			pSrc += 8;
-			pTemp += 8;
-		}
-
-		pTemp = temp;
-
-		const int nonzero_rows = s_idct_col_table[block_max_zag - 1];
-		for (i = 8; i > 0; i--)
-		{
-			switch (nonzero_rows)
-			{
-			case 1: Col<1>::idct(pDst_ptr, pTemp); break;
-			case 2: Col<2>::idct(pDst_ptr, pTemp); break;
-			case 3: Col<3>::idct(pDst_ptr, pTemp); break;
-			case 4: Col<4>::idct(pDst_ptr, pTemp); break;
-			case 5: Col<5>::idct(pDst_ptr, pTemp); break;
-			case 6: Col<6>::idct(pDst_ptr, pTemp); break;
-			case 7: Col<7>::idct(pDst_ptr, pTemp); break;
-			case 8: Col<8>::idct(pDst_ptr, pTemp); break;
-			}
-
-			pTemp++;
-			pDst_ptr++;
-		}
-	}
-
-	void idct_4x4(const jpgd_block_t* pSrc_ptr, uint8* pDst_ptr)
-	{
-		int temp[64];
-		int* pTemp = temp;
-		const jpgd_block_t* pSrc = pSrc_ptr;
-
-		for (int i = 4; i > 0; i--)
-		{
-			Row<4>::idct(pTemp, pSrc);
-			pSrc += 8;
-			pTemp += 8;
-		}
-
-		pTemp = temp;
-		for (int i = 8; i > 0; i--)
-		{
-			Col<4>::idct(pDst_ptr, pTemp);
-			pTemp++;
-			pDst_ptr++;
-		}
-	}
-
-	// Retrieve one character from the input stream.
-	inline uint jpeg_decoder::get_char()
-	{
-		// Any bytes remaining in buffer?
-		if (!m_in_buf_left)
-		{
-			// Try to get more bytes.
-			prep_in_buffer();
-			// Still nothing to get?
-			if (!m_in_buf_left)
-			{
-				// Pad the end of the stream with 0xFF 0xD9 (EOI marker)
-				int t = m_tem_flag;
-				m_tem_flag ^= 1;
-				if (t)
-					return 0xD9;
-				else
-					return 0xFF;
-			}
-		}
-
-		uint c = *m_pIn_buf_ofs++;
-		m_in_buf_left--;
-
-		return c;
-	}
-
-	// Same as previous method, except can indicate if the character is a pad character or not.
-	inline uint jpeg_decoder::get_char(bool *pPadding_flag)
-	{
-		if (!m_in_buf_left)
-		{
-			prep_in_buffer();
-			if (!m_in_buf_left)
-			{
-				*pPadding_flag = true;
-				int t = m_tem_flag;
-				m_tem_flag ^= 1;
-				if (t)
-					return 0xD9;
-				else
-					return 0xFF;
-			}
-		}
-
-		*pPadding_flag = false;
-
-		uint c = *m_pIn_buf_ofs++;
-		m_in_buf_left--;
-
-		return c;
-	}
-
-	// Inserts a previously retrieved character back into the input buffer.
-	inline void jpeg_decoder::stuff_char(uint8 q)
-	{
-		*(--m_pIn_buf_ofs) = q;
-		m_in_buf_left++;
-	}
-
-	// Retrieves one character from the input stream, but does not read past markers. Will continue to return 0xFF when a marker is encountered.
-	inline uint8 jpeg_decoder::get_octet()
-	{
-		bool padding_flag;
-		int c = get_char(&padding_flag);
-
-		if (c == 0xFF)
-		{
-			if (padding_flag)
-				return 0xFF;
-
-			c = get_char(&padding_flag);
-			if (padding_flag)
-			{
-				stuff_char(0xFF);
-				return 0xFF;
-			}
-
-			if (c == 0x00)
-				return 0xFF;
-			else
-			{
-				stuff_char(static_cast<uint8>(c));
-				stuff_char(0xFF);
-				return 0xFF;
-			}
-		}
-
-		return static_cast<uint8>(c);
-	}
-
-	// Retrieves a variable number of bits from the input stream. Does not recognize markers.
-	inline uint jpeg_decoder::get_bits(int num_bits)
-	{
-		if (!num_bits)
-			return 0;
-
-		uint i = m_bit_buf >> (32 - num_bits);
-
-		if ((m_bits_left -= num_bits) <= 0)
-		{
-			m_bit_buf <<= (num_bits += m_bits_left);
-
-			uint c1 = get_char();
-			uint c2 = get_char();
-			m_bit_buf = (m_bit_buf & 0xFFFF0000) | (c1 << 8) | c2;
-
-			m_bit_buf <<= -m_bits_left;
-
-			m_bits_left += 16;
-
-			JPGD_ASSERT(m_bits_left >= 0);
-		}
-		else
-			m_bit_buf <<= num_bits;
-
-		return i;
-	}
-
-	// Retrieves a variable number of bits from the input stream. Markers will not be read into the input bit buffer. Instead, an infinite number of all 1's will be returned when a marker is encountered.
-	inline uint jpeg_decoder::get_bits_no_markers(int num_bits)
-	{
-		if (!num_bits)
-			return 0;
-
-		uint i = m_bit_buf >> (32 - num_bits);
-
-		if ((m_bits_left -= num_bits) <= 0)
-		{
-			m_bit_buf <<= (num_bits += m_bits_left);
-
-			if ((m_in_buf_left < 2) || (m_pIn_buf_ofs[0] == 0xFF) || (m_pIn_buf_ofs[1] == 0xFF))
-			{
-				uint c1 = get_octet();
-				uint c2 = get_octet();
-				m_bit_buf |= (c1 << 8) | c2;
-			}
-			else
-			{
-				m_bit_buf |= ((uint)m_pIn_buf_ofs[0] << 8) | m_pIn_buf_ofs[1];
-				m_in_buf_left -= 2;
-				m_pIn_buf_ofs += 2;
-			}
-
-			m_bit_buf <<= -m_bits_left;
-
-			m_bits_left += 16;
-
-			JPGD_ASSERT(m_bits_left >= 0);
-		}
-		else
-			m_bit_buf <<= num_bits;
-
-		return i;
-	}
-
-	// Decodes a Huffman encoded symbol.
-	inline int jpeg_decoder::huff_decode(huff_tables *pH)
-	{
-		int symbol;
-
-		// Check first 8-bits: do we have a complete symbol?
-		if ((symbol = pH->look_up[m_bit_buf >> 24]) < 0)
-		{
-			// Decode more bits, use a tree traversal to find symbol.
-			int ofs = 23;
-			do
-			{
-				symbol = pH->tree[-(int)(symbol + ((m_bit_buf >> ofs) & 1))];
-				ofs--;
-			} while (symbol < 0);
-
-			get_bits_no_markers(8 + (23 - ofs));
-		}
-		else
-			get_bits_no_markers(pH->code_size[symbol]);
-
-		return symbol;
-	}
-
-	// Decodes a Huffman encoded symbol.
-	inline int jpeg_decoder::huff_decode(huff_tables *pH, int& extra_bits)
-	{
-		int symbol;
-
-		// Check first 8-bits: do we have a complete symbol?
-		if ((symbol = pH->look_up2[m_bit_buf >> 24]) < 0)
-		{
-			// Use a tree traversal to find symbol.
-			int ofs = 23;
-			do
-			{
-				symbol = pH->tree[-(int)(symbol + ((m_bit_buf >> ofs) & 1))];
-				ofs--;
-			} while (symbol < 0);
-
-			get_bits_no_markers(8 + (23 - ofs));
-
-			extra_bits = get_bits_no_markers(symbol & 0xF);
-		}
-		else
-		{
-			JPGD_ASSERT(((symbol >> 8) & 31) == pH->code_size[symbol & 255] + ((symbol & 0x8000) ? (symbol & 15) : 0));
-
-			if (symbol & 0x8000)
-			{
-				get_bits_no_markers((symbol >> 8) & 31);
-				extra_bits = symbol >> 16;
-			}
-			else
-			{
-				int code_size = (symbol >> 8) & 31;
-				int num_extra_bits = symbol & 0xF;
-				int bits = code_size + num_extra_bits;
-				if (bits <= (m_bits_left + 16))
-					extra_bits = get_bits_no_markers(bits) & ((1 << num_extra_bits) - 1);
-				else
-				{
-					get_bits_no_markers(code_size);
-					extra_bits = get_bits_no_markers(num_extra_bits);
-				}
-			}
-
-			symbol &= 0xFF;
-		}
-
-		return symbol;
-	}
-
-	// Tables and macro used to fully decode the DPCM differences.
-	static const int s_extend_test[16] = { 0, 0x0001, 0x0002, 0x0004, 0x0008, 0x0010, 0x0020, 0x0040, 0x0080, 0x0100, 0x0200, 0x0400, 0x0800, 0x1000, 0x2000, 0x4000 };
-	static const int s_extend_offset[16] = { 0, -1, -3, -7, -15, -31, -63, -127, -255, -511, -1023, -2047, -4095, -8191, -16383, -32767 };
-	static const int s_extend_mask[] = { 0, (1<<0), (1<<1), (1<<2), (1<<3), (1<<4), (1<<5), (1<<6), (1<<7), (1<<8), (1<<9), (1<<10), (1<<11), (1<<12), (1<<13), (1<<14), (1<<15), (1<<16) };
-#define HUFF_EXTEND(x,s) ((x) < s_extend_test[s] ? (x) + s_extend_offset[s] : (x))
-
-	// Clamps a value between 0-255.
-	inline uint8 jpeg_decoder::clamp(int i)
-	{
-		if (static_cast<uint>(i) > 255)
-			i = (((~i) >> 31) & 0xFF);
-
-		return static_cast<uint8>(i);
-	}
-
-	namespace DCT_Upsample
-	{
-		struct Matrix44
-		{
-			typedef int Element_Type;
-			enum { NUM_ROWS = 4, NUM_COLS = 4 };
-
-			Element_Type v[NUM_ROWS][NUM_COLS];
-
-			inline int rows() const { return NUM_ROWS; }
-			inline int cols() const { return NUM_COLS; }
-
-			inline const Element_Type & at(int r, int c) const { return v[r][c]; }
-			inline       Element_Type & at(int r, int c)       { return v[r][c]; }
-
-			inline Matrix44() { }
-
-			inline Matrix44& operator += (const Matrix44& a)
-			{
-				for (int r = 0; r < NUM_ROWS; r++)
-				{
-					at(r, 0) += a.at(r, 0);
-					at(r, 1) += a.at(r, 1);
-					at(r, 2) += a.at(r, 2);
-					at(r, 3) += a.at(r, 3);
-				}
-				return *this;
-			}
-
-			inline Matrix44& operator -= (const Matrix44& a)
-			{
-				for (int r = 0; r < NUM_ROWS; r++)
-				{
-					at(r, 0) -= a.at(r, 0);
-					at(r, 1) -= a.at(r, 1);
-					at(r, 2) -= a.at(r, 2);
-					at(r, 3) -= a.at(r, 3);
-				}
-				return *this;
-			}
-
-			friend inline Matrix44 operator + (const Matrix44& a, const Matrix44& b)
-			{
-				Matrix44 ret;
-				for (int r = 0; r < NUM_ROWS; r++)
-				{
-					ret.at(r, 0) = a.at(r, 0) + b.at(r, 0);
-					ret.at(r, 1) = a.at(r, 1) + b.at(r, 1);
-					ret.at(r, 2) = a.at(r, 2) + b.at(r, 2);
-					ret.at(r, 3) = a.at(r, 3) + b.at(r, 3);
-				}
-				return ret;
-			}
-
-			friend inline Matrix44 operator - (const Matrix44& a, const Matrix44& b)
-			{
-				Matrix44 ret;
-				for (int r = 0; r < NUM_ROWS; r++)
-				{
-					ret.at(r, 0) = a.at(r, 0) - b.at(r, 0);
-					ret.at(r, 1) = a.at(r, 1) - b.at(r, 1);
-					ret.at(r, 2) = a.at(r, 2) - b.at(r, 2);
-					ret.at(r, 3) = a.at(r, 3) - b.at(r, 3);
-				}
-				return ret;
-			}
-
-			static inline void add_and_store(jpgd_block_t* pDst, const Matrix44& a, const Matrix44& b)
-			{
-				for (int r = 0; r < 4; r++)
-				{
-					pDst[0*8 + r] = static_cast<jpgd_block_t>(a.at(r, 0) + b.at(r, 0));
-					pDst[1*8 + r] = static_cast<jpgd_block_t>(a.at(r, 1) + b.at(r, 1));
-					pDst[2*8 + r] = static_cast<jpgd_block_t>(a.at(r, 2) + b.at(r, 2));
-					pDst[3*8 + r] = static_cast<jpgd_block_t>(a.at(r, 3) + b.at(r, 3));
-				}
-			}
-
-			static inline void sub_and_store(jpgd_block_t* pDst, const Matrix44& a, const Matrix44& b)
-			{
-				for (int r = 0; r < 4; r++)
-				{
-					pDst[0*8 + r] = static_cast<jpgd_block_t>(a.at(r, 0) - b.at(r, 0));
-					pDst[1*8 + r] = static_cast<jpgd_block_t>(a.at(r, 1) - b.at(r, 1));
-					pDst[2*8 + r] = static_cast<jpgd_block_t>(a.at(r, 2) - b.at(r, 2));
-					pDst[3*8 + r] = static_cast<jpgd_block_t>(a.at(r, 3) - b.at(r, 3));
-				}
-			}
-		};
-
-		const int FRACT_BITS = 10;
-		const int SCALE = 1 << FRACT_BITS;
-
-		typedef int Temp_Type;
-#define D(i) (((i) + (SCALE >> 1)) >> FRACT_BITS)
-#define F(i) ((int)((i) * SCALE + .5f))
-
-		// Any decent C++ compiler will optimize this at compile time to a 0, or an array access.
-#define AT(c, r) ((((c)>=NUM_COLS)||((r)>=NUM_ROWS)) ? 0 : pSrc[(c)+(r)*8])
-
-		// NUM_ROWS/NUM_COLS = # of non-zero rows/cols in input matrix
-		template<int NUM_ROWS, int NUM_COLS>
-		struct P_Q
-		{
-			static void calc(Matrix44& P, Matrix44& Q, const jpgd_block_t* pSrc)
-			{
-				// 4x8 = 4x8 times 8x8, matrix 0 is constant
-				const Temp_Type X000 = AT(0, 0);
-				const Temp_Type X001 = AT(0, 1);
-				const Temp_Type X002 = AT(0, 2);
-				const Temp_Type X003 = AT(0, 3);
-				const Temp_Type X004 = AT(0, 4);
-				const Temp_Type X005 = AT(0, 5);
-				const Temp_Type X006 = AT(0, 6);
-				const Temp_Type X007 = AT(0, 7);
-				const Temp_Type X010 = D(F(0.415735f) * AT(1, 0) + F(0.791065f) * AT(3, 0) + F(-0.352443f) * AT(5, 0) + F(0.277785f) * AT(7, 0));
-				const Temp_Type X011 = D(F(0.415735f) * AT(1, 1) + F(0.791065f) * AT(3, 1) + F(-0.352443f) * AT(5, 1) + F(0.277785f) * AT(7, 1));
-				const Temp_Type X012 = D(F(0.415735f) * AT(1, 2) + F(0.791065f) * AT(3, 2) + F(-0.352443f) * AT(5, 2) + F(0.277785f) * AT(7, 2));
-				const Temp_Type X013 = D(F(0.415735f) * AT(1, 3) + F(0.791065f) * AT(3, 3) + F(-0.352443f) * AT(5, 3) + F(0.277785f) * AT(7, 3));
-				const Temp_Type X014 = D(F(0.415735f) * AT(1, 4) + F(0.791065f) * AT(3, 4) + F(-0.352443f) * AT(5, 4) + F(0.277785f) * AT(7, 4));
-				const Temp_Type X015 = D(F(0.415735f) * AT(1, 5) + F(0.791065f) * AT(3, 5) + F(-0.352443f) * AT(5, 5) + F(0.277785f) * AT(7, 5));
-				const Temp_Type X016 = D(F(0.415735f) * AT(1, 6) + F(0.791065f) * AT(3, 6) + F(-0.352443f) * AT(5, 6) + F(0.277785f) * AT(7, 6));
-				const Temp_Type X017 = D(F(0.415735f) * AT(1, 7) + F(0.791065f) * AT(3, 7) + F(-0.352443f) * AT(5, 7) + F(0.277785f) * AT(7, 7));
-				const Temp_Type X020 = AT(4, 0);
-				const Temp_Type X021 = AT(4, 1);
-				const Temp_Type X022 = AT(4, 2);
-				const Temp_Type X023 = AT(4, 3);
-				const Temp_Type X024 = AT(4, 4);
-				const Temp_Type X025 = AT(4, 5);
-				const Temp_Type X026 = AT(4, 6);
-				const Temp_Type X027 = AT(4, 7);
-				const Temp_Type X030 = D(F(0.022887f) * AT(1, 0) + F(-0.097545f) * AT(3, 0) + F(0.490393f) * AT(5, 0) + F(0.865723f) * AT(7, 0));
-				const Temp_Type X031 = D(F(0.022887f) * AT(1, 1) + F(-0.097545f) * AT(3, 1) + F(0.490393f) * AT(5, 1) + F(0.865723f) * AT(7, 1));
-				const Temp_Type X032 = D(F(0.022887f) * AT(1, 2) + F(-0.097545f) * AT(3, 2) + F(0.490393f) * AT(5, 2) + F(0.865723f) * AT(7, 2));
-				const Temp_Type X033 = D(F(0.022887f) * AT(1, 3) + F(-0.097545f) * AT(3, 3) + F(0.490393f) * AT(5, 3) + F(0.865723f) * AT(7, 3));
-				const Temp_Type X034 = D(F(0.022887f) * AT(1, 4) + F(-0.097545f) * AT(3, 4) + F(0.490393f) * AT(5, 4) + F(0.865723f) * AT(7, 4));
-				const Temp_Type X035 = D(F(0.022887f) * AT(1, 5) + F(-0.097545f) * AT(3, 5) + F(0.490393f) * AT(5, 5) + F(0.865723f) * AT(7, 5));
-				const Temp_Type X036 = D(F(0.022887f) * AT(1, 6) + F(-0.097545f) * AT(3, 6) + F(0.490393f) * AT(5, 6) + F(0.865723f) * AT(7, 6));
-				const Temp_Type X037 = D(F(0.022887f) * AT(1, 7) + F(-0.097545f) * AT(3, 7) + F(0.490393f) * AT(5, 7) + F(0.865723f) * AT(7, 7));
-
-				// 4x4 = 4x8 times 8x4, matrix 1 is constant
-				P.at(0, 0) = X000;
-				P.at(0, 1) = D(X001 * F(0.415735f) + X003 * F(0.791065f) + X005 * F(-0.352443f) + X007 * F(0.277785f));
-				P.at(0, 2) = X004;
-				P.at(0, 3) = D(X001 * F(0.022887f) + X003 * F(-0.097545f) + X005 * F(0.490393f) + X007 * F(0.865723f));
-				P.at(1, 0) = X010;
-				P.at(1, 1) = D(X011 * F(0.415735f) + X013 * F(0.791065f) + X015 * F(-0.352443f) + X017 * F(0.277785f));
-				P.at(1, 2) = X014;
-				P.at(1, 3) = D(X011 * F(0.022887f) + X013 * F(-0.097545f) + X015 * F(0.490393f) + X017 * F(0.865723f));
-				P.at(2, 0) = X020;
-				P.at(2, 1) = D(X021 * F(0.415735f) + X023 * F(0.791065f) + X025 * F(-0.352443f) + X027 * F(0.277785f));
-				P.at(2, 2) = X024;
-				P.at(2, 3) = D(X021 * F(0.022887f) + X023 * F(-0.097545f) + X025 * F(0.490393f) + X027 * F(0.865723f));
-				P.at(3, 0) = X030;
-				P.at(3, 1) = D(X031 * F(0.415735f) + X033 * F(0.791065f) + X035 * F(-0.352443f) + X037 * F(0.277785f));
-				P.at(3, 2) = X034;
-				P.at(3, 3) = D(X031 * F(0.022887f) + X033 * F(-0.097545f) + X035 * F(0.490393f) + X037 * F(0.865723f));
-				// 40 muls 24 adds
-
-				// 4x4 = 4x8 times 8x4, matrix 1 is constant
-				Q.at(0, 0) = D(X001 * F(0.906127f) + X003 * F(-0.318190f) + X005 * F(0.212608f) + X007 * F(-0.180240f));
-				Q.at(0, 1) = X002;
-				Q.at(0, 2) = D(X001 * F(-0.074658f) + X003 * F(0.513280f) + X005 * F(0.768178f) + X007 * F(-0.375330f));
-				Q.at(0, 3) = X006;
-				Q.at(1, 0) = D(X011 * F(0.906127f) + X013 * F(-0.318190f) + X015 * F(0.212608f) + X017 * F(-0.180240f));
-				Q.at(1, 1) = X012;
-				Q.at(1, 2) = D(X011 * F(-0.074658f) + X013 * F(0.513280f) + X015 * F(0.768178f) + X017 * F(-0.375330f));
-				Q.at(1, 3) = X016;
-				Q.at(2, 0) = D(X021 * F(0.906127f) + X023 * F(-0.318190f) + X025 * F(0.212608f) + X027 * F(-0.180240f));
-				Q.at(2, 1) = X022;
-				Q.at(2, 2) = D(X021 * F(-0.074658f) + X023 * F(0.513280f) + X025 * F(0.768178f) + X027 * F(-0.375330f));
-				Q.at(2, 3) = X026;
-				Q.at(3, 0) = D(X031 * F(0.906127f) + X033 * F(-0.318190f) + X035 * F(0.212608f) + X037 * F(-0.180240f));
-				Q.at(3, 1) = X032;
-				Q.at(3, 2) = D(X031 * F(-0.074658f) + X033 * F(0.513280f) + X035 * F(0.768178f) + X037 * F(-0.375330f));
-				Q.at(3, 3) = X036;
-				// 40 muls 24 adds
-			}
-		};
-
-		template<int NUM_ROWS, int NUM_COLS>
-		struct R_S
-		{
-			static void calc(Matrix44& R, Matrix44& S, const jpgd_block_t* pSrc)
-			{
-				// 4x8 = 4x8 times 8x8, matrix 0 is constant
-				const Temp_Type X100 = D(F(0.906127f) * AT(1, 0) + F(-0.318190f) * AT(3, 0) + F(0.212608f) * AT(5, 0) + F(-0.180240f) * AT(7, 0));
-				const Temp_Type X101 = D(F(0.906127f) * AT(1, 1) + F(-0.318190f) * AT(3, 1) + F(0.212608f) * AT(5, 1) + F(-0.180240f) * AT(7, 1));
-				const Temp_Type X102 = D(F(0.906127f) * AT(1, 2) + F(-0.318190f) * AT(3, 2) + F(0.212608f) * AT(5, 2) + F(-0.180240f) * AT(7, 2));
-				const Temp_Type X103 = D(F(0.906127f) * AT(1, 3) + F(-0.318190f) * AT(3, 3) + F(0.212608f) * AT(5, 3) + F(-0.180240f) * AT(7, 3));
-				const Temp_Type X104 = D(F(0.906127f) * AT(1, 4) + F(-0.318190f) * AT(3, 4) + F(0.212608f) * AT(5, 4) + F(-0.180240f) * AT(7, 4));
-				const Temp_Type X105 = D(F(0.906127f) * AT(1, 5) + F(-0.318190f) * AT(3, 5) + F(0.212608f) * AT(5, 5) + F(-0.180240f) * AT(7, 5));
-				const Temp_Type X106 = D(F(0.906127f) * AT(1, 6) + F(-0.318190f) * AT(3, 6) + F(0.212608f) * AT(5, 6) + F(-0.180240f) * AT(7, 6));
-				const Temp_Type X107 = D(F(0.906127f) * AT(1, 7) + F(-0.318190f) * AT(3, 7) + F(0.212608f) * AT(5, 7) + F(-0.180240f) * AT(7, 7));
-				const Temp_Type X110 = AT(2, 0);
-				const Temp_Type X111 = AT(2, 1);
-				const Temp_Type X112 = AT(2, 2);
-				const Temp_Type X113 = AT(2, 3);
-				const Temp_Type X114 = AT(2, 4);
-				const Temp_Type X115 = AT(2, 5);
-				const Temp_Type X116 = AT(2, 6);
-				const Temp_Type X117 = AT(2, 7);
-				const Temp_Type X120 = D(F(-0.074658f) * AT(1, 0) + F(0.513280f) * AT(3, 0) + F(0.768178f) * AT(5, 0) + F(-0.375330f) * AT(7, 0));
-				const Temp_Type X121 = D(F(-0.074658f) * AT(1, 1) + F(0.513280f) * AT(3, 1) + F(0.768178f) * AT(5, 1) + F(-0.375330f) * AT(7, 1));
-				const Temp_Type X122 = D(F(-0.074658f) * AT(1, 2) + F(0.513280f) * AT(3, 2) + F(0.768178f) * AT(5, 2) + F(-0.375330f) * AT(7, 2));
-				const Temp_Type X123 = D(F(-0.074658f) * AT(1, 3) + F(0.513280f) * AT(3, 3) + F(0.768178f) * AT(5, 3) + F(-0.375330f) * AT(7, 3));
-				const Temp_Type X124 = D(F(-0.074658f) * AT(1, 4) + F(0.513280f) * AT(3, 4) + F(0.768178f) * AT(5, 4) + F(-0.375330f) * AT(7, 4));
-				const Temp_Type X125 = D(F(-0.074658f) * AT(1, 5) + F(0.513280f) * AT(3, 5) + F(0.768178f) * AT(5, 5) + F(-0.375330f) * AT(7, 5));
-				const Temp_Type X126 = D(F(-0.074658f) * AT(1, 6) + F(0.513280f) * AT(3, 6) + F(0.768178f) * AT(5, 6) + F(-0.375330f) * AT(7, 6));
-				const Temp_Type X127 = D(F(-0.074658f) * AT(1, 7) + F(0.513280f) * AT(3, 7) + F(0.768178f) * AT(5, 7) + F(-0.375330f) * AT(7, 7));
-				const Temp_Type X130 = AT(6, 0);
-				const Temp_Type X131 = AT(6, 1);
-				const Temp_Type X132 = AT(6, 2);
-				const Temp_Type X133 = AT(6, 3);
-				const Temp_Type X134 = AT(6, 4);
-				const Temp_Type X135 = AT(6, 5);
-				const Temp_Type X136 = AT(6, 6);
-				const Temp_Type X137 = AT(6, 7);
-				// 80 muls 48 adds
-
-				// 4x4 = 4x8 times 8x4, matrix 1 is constant
-				R.at(0, 0) = X100;
-				R.at(0, 1) = D(X101 * F(0.415735f) + X103 * F(0.791065f) + X105 * F(-0.352443f) + X107 * F(0.277785f));
-				R.at(0, 2) = X104;
-				R.at(0, 3) = D(X101 * F(0.022887f) + X103 * F(-0.097545f) + X105 * F(0.490393f) + X107 * F(0.865723f));
-				R.at(1, 0) = X110;
-				R.at(1, 1) = D(X111 * F(0.415735f) + X113 * F(0.791065f) + X115 * F(-0.352443f) + X117 * F(0.277785f));
-				R.at(1, 2) = X114;
-				R.at(1, 3) = D(X111 * F(0.022887f) + X113 * F(-0.097545f) + X115 * F(0.490393f) + X117 * F(0.865723f));
-				R.at(2, 0) = X120;
-				R.at(2, 1) = D(X121 * F(0.415735f) + X123 * F(0.791065f) + X125 * F(-0.352443f) + X127 * F(0.277785f));
-				R.at(2, 2) = X124;
-				R.at(2, 3) = D(X121 * F(0.022887f) + X123 * F(-0.097545f) + X125 * F(0.490393f) + X127 * F(0.865723f));
-				R.at(3, 0) = X130;
-				R.at(3, 1) = D(X131 * F(0.415735f) + X133 * F(0.791065f) + X135 * F(-0.352443f) + X137 * F(0.277785f));
-				R.at(3, 2) = X134;
-				R.at(3, 3) = D(X131 * F(0.022887f) + X133 * F(-0.097545f) + X135 * F(0.490393f) + X137 * F(0.865723f));
-				// 40 muls 24 adds
-				// 4x4 = 4x8 times 8x4, matrix 1 is constant
-				S.at(0, 0) = D(X101 * F(0.906127f) + X103 * F(-0.318190f) + X105 * F(0.212608f) + X107 * F(-0.180240f));
-				S.at(0, 1) = X102;
-				S.at(0, 2) = D(X101 * F(-0.074658f) + X103 * F(0.513280f) + X105 * F(0.768178f) + X107 * F(-0.375330f));
-				S.at(0, 3) = X106;
-				S.at(1, 0) = D(X111 * F(0.906127f) + X113 * F(-0.318190f) + X115 * F(0.212608f) + X117 * F(-0.180240f));
-				S.at(1, 1) = X112;
-				S.at(1, 2) = D(X111 * F(-0.074658f) + X113 * F(0.513280f) + X115 * F(0.768178f) + X117 * F(-0.375330f));
-				S.at(1, 3) = X116;
-				S.at(2, 0) = D(X121 * F(0.906127f) + X123 * F(-0.318190f) + X125 * F(0.212608f) + X127 * F(-0.180240f));
-				S.at(2, 1) = X122;
-				S.at(2, 2) = D(X121 * F(-0.074658f) + X123 * F(0.513280f) + X125 * F(0.768178f) + X127 * F(-0.375330f));
-				S.at(2, 3) = X126;
-				S.at(3, 0) = D(X131 * F(0.906127f) + X133 * F(-0.318190f) + X135 * F(0.212608f) + X137 * F(-0.180240f));
-				S.at(3, 1) = X132;
-				S.at(3, 2) = D(X131 * F(-0.074658f) + X133 * F(0.513280f) + X135 * F(0.768178f) + X137 * F(-0.375330f));
-				S.at(3, 3) = X136;
-				// 40 muls 24 adds
-			}
-		};
-	} // end namespace DCT_Upsample
-
-	// Unconditionally frees all allocated m_blocks.
-	void jpeg_decoder::free_all_blocks()
-	{
-		m_pStream = NULL;
-		for (mem_block *b = m_pMem_blocks; b; )
-		{
-			mem_block *n = b->m_pNext;
-			jpgd_free(b);
-			b = n;
-		}
-		m_pMem_blocks = NULL;
-	}
-
-	// This method handles all errors.
-	// It could easily be changed to use C++ exceptions.
-	void jpeg_decoder::stop_decoding(jpgd_status status)
-	{
-		m_error_code = status;
-		free_all_blocks();
-		longjmp(m_jmp_state, status);
-
-		// we shouldn't get here as longjmp shouldn't return, but we put it here to make it explicit
-		// that this function doesn't return, otherwise we get this error:
-		// 
-		// error : function declared 'noreturn' should not return
-		exit(1);
-	}
-
-	void *jpeg_decoder::alloc(size_t nSize, bool zero)
-	{
-		nSize = (JPGD_MAX(nSize, 1) + 3) & ~3;
-		char *rv = NULL;
-		for (mem_block *b = m_pMem_blocks; b; b = b->m_pNext)
-		{
-			if ((b->m_used_count + nSize) <= b->m_size)
-			{
-				rv = b->m_data + b->m_used_count;
-				b->m_used_count += nSize;
-				break;
-			}
-		}
-		if (!rv)
-		{
-			int capacity = JPGD_MAX(32768 - 256, (nSize + 2047) & ~2047);
-			mem_block *b = (mem_block*)jpgd_malloc(sizeof(mem_block) + capacity);
-			if (!b) stop_decoding(JPGD_NOTENOUGHMEM);
-			b->m_pNext = m_pMem_blocks; m_pMem_blocks = b;
-			b->m_used_count = nSize;
-			b->m_size = capacity;
-			rv = b->m_data;
-		}
-		if (zero) memset(rv, 0, nSize);
-		return rv;
-	}
-
-	void jpeg_decoder::word_clear(void *p, uint16 c, uint n)
-	{
-		uint8 *pD = (uint8*)p;
-		const uint8 l = c & 0xFF, h = (c >> 8) & 0xFF;
-		while (n)
-		{
-			pD[0] = l; pD[1] = h; pD += 2;
-			n--;
-		}
-	}
-
-	// Refill the input buffer.
-	// This method will sit in a loop until (A) the buffer is full or (B)
-	// the stream's read() method reports and end of file condition.
-	void jpeg_decoder::prep_in_buffer()
-	{
-		m_in_buf_left = 0;
-		m_pIn_buf_ofs = m_in_buf;
-
-		if (m_eof_flag)
-			return;
-
-		do
-		{
-			int bytes_read = m_pStream->read(m_in_buf + m_in_buf_left, JPGD_IN_BUF_SIZE - m_in_buf_left, &m_eof_flag);
-			if (bytes_read == -1)
-				stop_decoding(JPGD_STREAM_READ);
-
-			m_in_buf_left += bytes_read;
-		} while ((m_in_buf_left < JPGD_IN_BUF_SIZE) && (!m_eof_flag));
-
-		m_total_bytes_read += m_in_buf_left;
-
-		// Pad the end of the block with M_EOI (prevents the decompressor from going off the rails if the stream is invalid).
-		// (This dates way back to when this decompressor was written in C/asm, and the all-asm Huffman decoder did some fancy things to increase perf.)
-		word_clear(m_pIn_buf_ofs + m_in_buf_left, 0xD9FF, 64);
-	}
-
-	// Read a Huffman code table.
-	void jpeg_decoder::read_dht_marker()
-	{
-		int i, index, count;
-		uint8 huff_num[17];
-		uint8 huff_val[256];
-
-		uint num_left = get_bits(16);
-
-		if (num_left < 2)
-			stop_decoding(JPGD_BAD_DHT_MARKER);
-
-		num_left -= 2;
-
-		while (num_left)
-		{
-			index = get_bits(8);
-
-			huff_num[0] = 0;
-
-			count = 0;
-
-			for (i = 1; i <= 16; i++)
-			{
-				huff_num[i] = static_cast<uint8>(get_bits(8));
-				count += huff_num[i];
-			}
-
-			if (count > 255)
-				stop_decoding(JPGD_BAD_DHT_COUNTS);
-
-			for (i = 0; i < count; i++)
-				huff_val[i] = static_cast<uint8>(get_bits(8));
-
-			i = 1 + 16 + count;
-
-			if (num_left < (uint)i)
-				stop_decoding(JPGD_BAD_DHT_MARKER);
-
-			num_left -= i;
-
-			if ((index & 0x10) > 0x10)
-				stop_decoding(JPGD_BAD_DHT_INDEX);
-
-			index = (index & 0x0F) + ((index & 0x10) >> 4) * (JPGD_MAX_HUFF_TABLES >> 1);
-
-			if (index >= JPGD_MAX_HUFF_TABLES)
-				stop_decoding(JPGD_BAD_DHT_INDEX);
-
-			if (!m_huff_num[index])
-				m_huff_num[index] = (uint8 *)alloc(17);
-
-			if (!m_huff_val[index])
-				m_huff_val[index] = (uint8 *)alloc(256);
-
-			m_huff_ac[index] = (index & 0x10) != 0;
-			memcpy(m_huff_num[index], huff_num, 17);
-			memcpy(m_huff_val[index], huff_val, 256);
-		}
-	}
-
-	// Read a quantization table.
-	void jpeg_decoder::read_dqt_marker()
-	{
-		int n, i, prec;
-		uint num_left;
-		uint temp;
-
-		num_left = get_bits(16);
-
-		if (num_left < 2)
-			stop_decoding(JPGD_BAD_DQT_MARKER);
-
-		num_left -= 2;
-
-		while (num_left)
-		{
-			n = get_bits(8);
-			prec = n >> 4;
-			n &= 0x0F;
-
-			if (n >= JPGD_MAX_QUANT_TABLES)
-				stop_decoding(JPGD_BAD_DQT_TABLE);
-
-			if (!m_quant[n])
-				m_quant[n] = (jpgd_quant_t *)alloc(64 * sizeof(jpgd_quant_t));
-
-			// read quantization entries, in zag order
-			for (i = 0; i < 64; i++)
-			{
-				temp = get_bits(8);
-
-				if (prec)
-					temp = (temp << 8) + get_bits(8);
-
-				m_quant[n][i] = static_cast<jpgd_quant_t>(temp);
-			}
-
-			i = 64 + 1;
-
-			if (prec)
-				i += 64;
-
-			if (num_left < (uint)i)
-				stop_decoding(JPGD_BAD_DQT_LENGTH);
-
-			num_left -= i;
-		}
-	}
-
-	// Read the start of frame (SOF) marker.
-	void jpeg_decoder::read_sof_marker()
-	{
-		int i;
-		uint num_left;
-
-		num_left = get_bits(16);
-
-		if (get_bits(8) != 8)   /* precision: sorry, only 8-bit precision is supported right now */
-			stop_decoding(JPGD_BAD_PRECISION);
-
-		m_image_y_size = get_bits(16);
-
-		if ((m_image_y_size < 1) || (m_image_y_size > JPGD_MAX_HEIGHT))
-			stop_decoding(JPGD_BAD_HEIGHT);
-
-		m_image_x_size = get_bits(16);
-
-		if ((m_image_x_size < 1) || (m_image_x_size > JPGD_MAX_WIDTH))
-			stop_decoding(JPGD_BAD_WIDTH);
-
-		m_comps_in_frame = get_bits(8);
-
-		if (m_comps_in_frame > JPGD_MAX_COMPONENTS)
-			stop_decoding(JPGD_TOO_MANY_COMPONENTS);
-
-		if (num_left != (uint)(m_comps_in_frame * 3 + 8))
-			stop_decoding(JPGD_BAD_SOF_LENGTH);
-
-		for (i = 0; i < m_comps_in_frame; i++)
-		{
-			m_comp_ident[i]  = get_bits(8);
-			m_comp_h_samp[i] = get_bits(4);
-			m_comp_v_samp[i] = get_bits(4);
-			m_comp_quant[i]  = get_bits(8);
-		}
-	}
-
-	// Used to skip unrecognized markers.
-	void jpeg_decoder::skip_variable_marker()
-	{
-		uint num_left;
-
-		num_left = get_bits(16);
-
-		if (num_left < 2)
-			stop_decoding(JPGD_BAD_VARIABLE_MARKER);
-
-		num_left -= 2;
-
-		while (num_left)
-		{
-			get_bits(8);
-			num_left--;
-		}
-	}
-
-	// Read a define restart interval (DRI) marker.
-	void jpeg_decoder::read_dri_marker()
-	{
-		if (get_bits(16) != 4)
-			stop_decoding(JPGD_BAD_DRI_LENGTH);
-
-		m_restart_interval = get_bits(16);
-	}
-
-	// Read a start of scan (SOS) marker.
-	void jpeg_decoder::read_sos_marker()
-	{
-		uint num_left;
-		int i, ci, n, c, cc;
-
-		num_left = get_bits(16);
-
-		n = get_bits(8);
-
-		m_comps_in_scan = n;
-
-		num_left -= 3;
-
-		if ( (num_left != (uint)(n * 2 + 3)) || (n < 1) || (n > JPGD_MAX_COMPS_IN_SCAN) )
-			stop_decoding(JPGD_BAD_SOS_LENGTH);
-
-		for (i = 0; i < n; i++)
-		{
-			cc = get_bits(8);
-			c = get_bits(8);
-			num_left -= 2;
-
-			for (ci = 0; ci < m_comps_in_frame; ci++)
-				if (cc == m_comp_ident[ci])
-					break;
-
-			if (ci >= m_comps_in_frame)
-				stop_decoding(JPGD_BAD_SOS_COMP_ID);
-
-			m_comp_list[i]    = ci;
-			m_comp_dc_tab[ci] = (c >> 4) & 15;
-			m_comp_ac_tab[ci] = (c & 15) + (JPGD_MAX_HUFF_TABLES >> 1);
-		}
-
-		m_spectral_start  = get_bits(8);
-		m_spectral_end    = get_bits(8);
-		m_successive_high = get_bits(4);
-		m_successive_low  = get_bits(4);
-
-		if (!m_progressive_flag)
-		{
-			m_spectral_start = 0;
-			m_spectral_end = 63;
-		}
-
-		num_left -= 3;
-
-		while (num_left)                  /* read past whatever is num_left */
-		{
-			get_bits(8);
-			num_left--;
-		}
-	}
-
-	// Finds the next marker.
-	int jpeg_decoder::next_marker()
-	{
-		uint c, bytes;
-
-		bytes = 0;
-
-		do
-		{
-			do
-			{
-				bytes++;
-				c = get_bits(8);
-			} while (c != 0xFF);
-
-			do
-			{
-				c = get_bits(8);
-			} while (c == 0xFF);
-
-		} while (c == 0);
-
-		// If bytes > 0 here, there where extra bytes before the marker (not good).
-
-		return c;
-	}
-
-	// Process markers. Returns when an SOFx, SOI, EOI, or SOS marker is
-	// encountered.
-	int jpeg_decoder::process_markers()
-	{
-		int c;
-
-		for ( ; ; )
-		{
-			c = next_marker();
-
-			switch (c)
-			{
-			case M_SOF0:
-			case M_SOF1:
-			case M_SOF2:
-			case M_SOF3:
-			case M_SOF5:
-			case M_SOF6:
-			case M_SOF7:
-				//      case M_JPG:
-			case M_SOF9:
-			case M_SOF10:
-			case M_SOF11:
-			case M_SOF13:
-			case M_SOF14:
-			case M_SOF15:
-			case M_SOI:
-			case M_EOI:
-			case M_SOS:
-				{
-					return c;
-				}
-			case M_DHT:
-				{
-					read_dht_marker();
-					break;
-				}
-				// No arithmitic support - dumb patents!
-			case M_DAC:
-				{
-					stop_decoding(JPGD_NO_ARITHMITIC_SUPPORT);
-					break;
-				}
-			case M_DQT:
-				{
-					read_dqt_marker();
-					break;
-				}
-			case M_DRI:
-				{
-					read_dri_marker();
-					break;
-				}
-				//case M_APP0:  /* no need to read the JFIF marker */
-
-			case M_JPG:
-			case M_RST0:    /* no parameters */
-			case M_RST1:
-			case M_RST2:
-			case M_RST3:
-			case M_RST4:
-			case M_RST5:
-			case M_RST6:
-			case M_RST7:
-			case M_TEM:
-				{
-					stop_decoding(JPGD_UNEXPECTED_MARKER);
-					break;
-				}
-			default:    /* must be DNL, DHP, EXP, APPn, JPGn, COM, or RESn or APP0 */
-				{
-					skip_variable_marker();
-					break;
-				}
-			}
-		}
-	}
-
-	// Finds the start of image (SOI) marker.
-	// This code is rather defensive: it only checks the first 512 bytes to avoid
-	// false positives.
-	void jpeg_decoder::locate_soi_marker()
-	{
-		uint lastchar, thischar;
-		uint bytesleft;
-
-		lastchar = get_bits(8);
-
-		thischar = get_bits(8);
-
-		/* ok if it's a normal JPEG file without a special header */
-
-		if ((lastchar == 0xFF) && (thischar == M_SOI))
-			return;
-
-		bytesleft = 4096; //512;
-
-		for ( ; ; )
-		{
-			if (--bytesleft == 0)
-				stop_decoding(JPGD_NOT_JPEG);
-
-			lastchar = thischar;
-
-			thischar = get_bits(8);
-
-			if (lastchar == 0xFF)
-			{
-				if (thischar == M_SOI)
-					break;
-				else if (thischar == M_EOI) // get_bits will keep returning M_EOI if we read past the end
-					stop_decoding(JPGD_NOT_JPEG);
-			}
-		}
-
-		// Check the next character after marker: if it's not 0xFF, it can't be the start of the next marker, so the file is bad.
-		thischar = (m_bit_buf >> 24) & 0xFF;
-
-		if (thischar != 0xFF)
-			stop_decoding(JPGD_NOT_JPEG);
-	}
-
-	// Find a start of frame (SOF) marker.
-	void jpeg_decoder::locate_sof_marker()
-	{
-		locate_soi_marker();
-
-		int c = process_markers();
-
-		switch (c)
-		{
-		case M_SOF2:
-			m_progressive_flag = JPGD_TRUE;
-		case M_SOF0:  /* baseline DCT */
-		case M_SOF1:  /* extended sequential DCT */
-			{
-				read_sof_marker();
-				break;
-			}
-		case M_SOF9:  /* Arithmitic coding */
-			{
-				stop_decoding(JPGD_NO_ARITHMITIC_SUPPORT);
-				break;
-			}
-		default:
-			{
-				stop_decoding(JPGD_UNSUPPORTED_MARKER);
-				break;
-			}
-		}
-	}
-
-	// Find a start of scan (SOS) marker.
-	int jpeg_decoder::locate_sos_marker()
-	{
-		int c;
-
-		c = process_markers();
-
-		if (c == M_EOI)
-			return JPGD_FALSE;
-		else if (c != M_SOS)
-			stop_decoding(JPGD_UNEXPECTED_MARKER);
-
-		read_sos_marker();
-
-		return JPGD_TRUE;
-	}
-
-	// Reset everything to default/uninitialized state.
-	void jpeg_decoder::init(jpeg_decoder_stream *pStream)
-	{
-		m_pMem_blocks = NULL;
-		m_error_code = JPGD_SUCCESS;
-		m_ready_flag = false;
-		m_image_x_size = m_image_y_size = 0;
-		m_pStream = pStream;
-		m_progressive_flag = JPGD_FALSE;
-
-		memset(m_huff_ac, 0, sizeof(m_huff_ac));
-		memset(m_huff_num, 0, sizeof(m_huff_num));
-		memset(m_huff_val, 0, sizeof(m_huff_val));
-		memset(m_quant, 0, sizeof(m_quant));
-
-		m_scan_type = 0;
-		m_comps_in_frame = 0;
-
-		memset(m_comp_h_samp, 0, sizeof(m_comp_h_samp));
-		memset(m_comp_v_samp, 0, sizeof(m_comp_v_samp));
-		memset(m_comp_quant, 0, sizeof(m_comp_quant));
-		memset(m_comp_ident, 0, sizeof(m_comp_ident));
-		memset(m_comp_h_blocks, 0, sizeof(m_comp_h_blocks));
-		memset(m_comp_v_blocks, 0, sizeof(m_comp_v_blocks));
-
-		m_comps_in_scan = 0;
-		memset(m_comp_list, 0, sizeof(m_comp_list));
-		memset(m_comp_dc_tab, 0, sizeof(m_comp_dc_tab));
-		memset(m_comp_ac_tab, 0, sizeof(m_comp_ac_tab));
-
-		m_spectral_start = 0;
-		m_spectral_end = 0;
-		m_successive_low = 0;
-		m_successive_high = 0;
-		m_max_mcu_x_size = 0;
-		m_max_mcu_y_size = 0;
-		m_blocks_per_mcu = 0;
-		m_max_blocks_per_row = 0;
-		m_mcus_per_row = 0;
-		m_mcus_per_col = 0;
-		m_expanded_blocks_per_component = 0;
-		m_expanded_blocks_per_mcu = 0;
-		m_expanded_blocks_per_row = 0;
-		m_freq_domain_chroma_upsample = false;
-
-		memset(m_mcu_org, 0, sizeof(m_mcu_org));
-
-		m_total_lines_left = 0;
-		m_mcu_lines_left = 0;
-		m_real_dest_bytes_per_scan_line = 0;
-		m_dest_bytes_per_scan_line = 0;
-		m_dest_bytes_per_pixel = 0;
-
-		memset(m_pHuff_tabs, 0, sizeof(m_pHuff_tabs));
-
-		memset(m_dc_coeffs, 0, sizeof(m_dc_coeffs));
-		memset(m_ac_coeffs, 0, sizeof(m_ac_coeffs));
-		memset(m_block_y_mcu, 0, sizeof(m_block_y_mcu));
-
-		m_eob_run = 0;
-
-		memset(m_block_y_mcu, 0, sizeof(m_block_y_mcu));
-
-		m_pIn_buf_ofs = m_in_buf;
-		m_in_buf_left = 0;
-		m_eof_flag = false;
-		m_tem_flag = 0;
-
-		memset(m_in_buf_pad_start, 0, sizeof(m_in_buf_pad_start));
-		memset(m_in_buf, 0, sizeof(m_in_buf));
-		memset(m_in_buf_pad_end, 0, sizeof(m_in_buf_pad_end));
-
-		m_restart_interval = 0;
-		m_restarts_left    = 0;
-		m_next_restart_num = 0;
-
-		m_max_mcus_per_row = 0;
-		m_max_blocks_per_mcu = 0;
-		m_max_mcus_per_col = 0;
-
-		memset(m_last_dc_val, 0, sizeof(m_last_dc_val));
-		m_pMCU_coefficients = NULL;
-		m_pSample_buf = NULL;
-
-		m_total_bytes_read = 0;
-
-		m_pScan_line_0 = NULL;
-		m_pScan_line_1 = NULL;
-
-		// Ready the input buffer.
-		prep_in_buffer();
-
-		// Prime the bit buffer.
-		m_bits_left = 16;
-		m_bit_buf = 0;
-
-		get_bits(16);
-		get_bits(16);
-
-		for (int i = 0; i < JPGD_MAX_BLOCKS_PER_MCU; i++)
-			m_mcu_block_max_zag[i] = 64;
-	}
-
-#define SCALEBITS 16
-#define ONE_HALF  ((int) 1 << (SCALEBITS-1))
-#define FIX(x)    ((int) ((x) * (1L<<SCALEBITS) + 0.5f))
-
-	// Create a few tables that allow us to quickly convert YCbCr to RGB.
-	void jpeg_decoder::create_look_ups()
-	{
-		for (int i = 0; i <= 255; i++)
-		{
-			int k = i - 128;
-			m_crr[i] = ( FIX(1.40200f)  * k + ONE_HALF) >> SCALEBITS;
-			m_cbb[i] = ( FIX(1.77200f)  * k + ONE_HALF) >> SCALEBITS;
-			m_crg[i] = (-FIX(0.71414f)) * k;
-			m_cbg[i] = (-FIX(0.34414f)) * k + ONE_HALF;
-		}
-	}
-
-	// This method throws back into the stream any bytes that where read
-	// into the bit buffer during initial marker scanning.
-	void jpeg_decoder::fix_in_buffer()
-	{
-		// In case any 0xFF's where pulled into the buffer during marker scanning.
-		JPGD_ASSERT((m_bits_left & 7) == 0);
-
-		if (m_bits_left == 16)
-			stuff_char( (uint8)(m_bit_buf & 0xFF));
-
-		if (m_bits_left >= 8)
-			stuff_char( (uint8)((m_bit_buf >> 8) & 0xFF));
-
-		stuff_char((uint8)((m_bit_buf >> 16) & 0xFF));
-		stuff_char((uint8)((m_bit_buf >> 24) & 0xFF));
-
-		m_bits_left = 16;
-		get_bits_no_markers(16);
-		get_bits_no_markers(16);
-	}
-
-	void jpeg_decoder::transform_mcu(int mcu_row)
-	{
-		jpgd_block_t* pSrc_ptr = m_pMCU_coefficients;
-		uint8* pDst_ptr = m_pSample_buf + mcu_row * m_blocks_per_mcu * 64;
-
-		for (int mcu_block = 0; mcu_block < m_blocks_per_mcu; mcu_block++)
-		{
-			idct(pSrc_ptr, pDst_ptr, m_mcu_block_max_zag[mcu_block]);
-			pSrc_ptr += 64;
-			pDst_ptr += 64;
-		}
-	}
-
-	static const uint8 s_max_rc[64] =
-	{
-		17, 18, 34, 50, 50, 51, 52, 52, 52, 68, 84, 84, 84, 84, 85, 86, 86, 86, 86, 86,
-		102, 118, 118, 118, 118, 118, 118, 119, 120, 120, 120, 120, 120, 120, 120, 136,
-		136, 136, 136, 136, 136, 136, 136, 136, 136, 136, 136, 136, 136, 136, 136, 136,
-		136, 136, 136, 136, 136, 136, 136, 136, 136, 136, 136, 136
-	};
-
-	void jpeg_decoder::transform_mcu_expand(int mcu_row)
-	{
-		jpgd_block_t* pSrc_ptr = m_pMCU_coefficients;
-		uint8* pDst_ptr = m_pSample_buf + mcu_row * m_expanded_blocks_per_mcu * 64;
-
-		// Y IDCT
-		int mcu_block;
-		for (mcu_block = 0; mcu_block < m_expanded_blocks_per_component; mcu_block++)
-		{
-			idct(pSrc_ptr, pDst_ptr, m_mcu_block_max_zag[mcu_block]);
-			pSrc_ptr += 64;
-			pDst_ptr += 64;
-		}
-
-		// Chroma IDCT, with upsampling
-		jpgd_block_t temp_block[64];
-
-		for (int i = 0; i < 2; i++)
-		{
-			DCT_Upsample::Matrix44 P, Q, R, S;
-
-			JPGD_ASSERT(m_mcu_block_max_zag[mcu_block] >= 1);
-			JPGD_ASSERT(m_mcu_block_max_zag[mcu_block] <= 64);
-
-			switch (s_max_rc[m_mcu_block_max_zag[mcu_block++] - 1])
-			{
-			case 1*16+1:
-				DCT_Upsample::P_Q<1, 1>::calc(P, Q, pSrc_ptr);
-				DCT_Upsample::R_S<1, 1>::calc(R, S, pSrc_ptr);
-				break;
-			case 1*16+2:
-				DCT_Upsample::P_Q<1, 2>::calc(P, Q, pSrc_ptr);
-				DCT_Upsample::R_S<1, 2>::calc(R, S, pSrc_ptr);
-				break;
-			case 2*16+2:
-				DCT_Upsample::P_Q<2, 2>::calc(P, Q, pSrc_ptr);
-				DCT_Upsample::R_S<2, 2>::calc(R, S, pSrc_ptr);
-				break;
-			case 3*16+2:
-				DCT_Upsample::P_Q<3, 2>::calc(P, Q, pSrc_ptr);
-				DCT_Upsample::R_S<3, 2>::calc(R, S, pSrc_ptr);
-				break;
-			case 3*16+3:
-				DCT_Upsample::P_Q<3, 3>::calc(P, Q, pSrc_ptr);
-				DCT_Upsample::R_S<3, 3>::calc(R, S, pSrc_ptr);
-				break;
-			case 3*16+4:
-				DCT_Upsample::P_Q<3, 4>::calc(P, Q, pSrc_ptr);
-				DCT_Upsample::R_S<3, 4>::calc(R, S, pSrc_ptr);
-				break;
-			case 4*16+4:
-				DCT_Upsample::P_Q<4, 4>::calc(P, Q, pSrc_ptr);
-				DCT_Upsample::R_S<4, 4>::calc(R, S, pSrc_ptr);
-				break;
-			case 5*16+4:
-				DCT_Upsample::P_Q<5, 4>::calc(P, Q, pSrc_ptr);
-				DCT_Upsample::R_S<5, 4>::calc(R, S, pSrc_ptr);
-				break;
-			case 5*16+5:
-				DCT_Upsample::P_Q<5, 5>::calc(P, Q, pSrc_ptr);
-				DCT_Upsample::R_S<5, 5>::calc(R, S, pSrc_ptr);
-				break;
-			case 5*16+6:
-				DCT_Upsample::P_Q<5, 6>::calc(P, Q, pSrc_ptr);
-				DCT_Upsample::R_S<5, 6>::calc(R, S, pSrc_ptr);
-				break;
-			case 6*16+6:
-				DCT_Upsample::P_Q<6, 6>::calc(P, Q, pSrc_ptr);
-				DCT_Upsample::R_S<6, 6>::calc(R, S, pSrc_ptr);
-				break;
-			case 7*16+6:
-				DCT_Upsample::P_Q<7, 6>::calc(P, Q, pSrc_ptr);
-				DCT_Upsample::R_S<7, 6>::calc(R, S, pSrc_ptr);
-				break;
-			case 7*16+7:
-				DCT_Upsample::P_Q<7, 7>::calc(P, Q, pSrc_ptr);
-				DCT_Upsample::R_S<7, 7>::calc(R, S, pSrc_ptr);
-				break;
-			case 7*16+8:
-				DCT_Upsample::P_Q<7, 8>::calc(P, Q, pSrc_ptr);
-				DCT_Upsample::R_S<7, 8>::calc(R, S, pSrc_ptr);
-				break;
-			case 8*16+8:
-				DCT_Upsample::P_Q<8, 8>::calc(P, Q, pSrc_ptr);
-				DCT_Upsample::R_S<8, 8>::calc(R, S, pSrc_ptr);
-				break;
-			default:
-				JPGD_ASSERT(false);
-			}
-
-			DCT_Upsample::Matrix44 a(P + Q); P -= Q;
-			DCT_Upsample::Matrix44& b = P;
-			DCT_Upsample::Matrix44 c(R + S); R -= S;
-			DCT_Upsample::Matrix44& d = R;
-
-			DCT_Upsample::Matrix44::add_and_store(temp_block, a, c);
-			idct_4x4(temp_block, pDst_ptr);
-			pDst_ptr += 64;
-
-			DCT_Upsample::Matrix44::sub_and_store(temp_block, a, c);
-			idct_4x4(temp_block, pDst_ptr);
-			pDst_ptr += 64;
-
-			DCT_Upsample::Matrix44::add_and_store(temp_block, b, d);
-			idct_4x4(temp_block, pDst_ptr);
-			pDst_ptr += 64;
-
-			DCT_Upsample::Matrix44::sub_and_store(temp_block, b, d);
-			idct_4x4(temp_block, pDst_ptr);
-			pDst_ptr += 64;
-
-			pSrc_ptr += 64;
-		}
-	}
-
-	// Loads and dequantizes the next row of (already decoded) coefficients.
-	// Progressive images only.
-	void jpeg_decoder::load_next_row()
-	{
-		int i;
-		jpgd_block_t *p;
-		jpgd_quant_t *q;
-		int mcu_row, mcu_block, row_block = 0;
-		int component_num, component_id;
-		int block_x_mcu[JPGD_MAX_COMPONENTS];
-
-		memset(block_x_mcu, 0, JPGD_MAX_COMPONENTS * sizeof(int));
-
-		for (mcu_row = 0; mcu_row < m_mcus_per_row; mcu_row++)
-		{
-			int block_x_mcu_ofs = 0, block_y_mcu_ofs = 0;
-
-			for (mcu_block = 0; mcu_block < m_blocks_per_mcu; mcu_block++)
-			{
-				component_id = m_mcu_org[mcu_block];
-				q = m_quant[m_comp_quant[component_id]];
-
-				p = m_pMCU_coefficients + 64 * mcu_block;
-
-				jpgd_block_t* pAC = coeff_buf_getp(m_ac_coeffs[component_id], block_x_mcu[component_id] + block_x_mcu_ofs, m_block_y_mcu[component_id] + block_y_mcu_ofs);
-				jpgd_block_t* pDC = coeff_buf_getp(m_dc_coeffs[component_id], block_x_mcu[component_id] + block_x_mcu_ofs, m_block_y_mcu[component_id] + block_y_mcu_ofs);
-				p[0] = pDC[0];
-				memcpy(&p[1], &pAC[1], 63 * sizeof(jpgd_block_t));
-
-				for (i = 63; i > 0; i--)
-					if (p[g_ZAG[i]])
-						break;
-
-				m_mcu_block_max_zag[mcu_block] = i + 1;
-
-				for ( ; i >= 0; i--)
-					if (p[g_ZAG[i]])
-						p[g_ZAG[i]] = static_cast<jpgd_block_t>(p[g_ZAG[i]] * q[i]);
-
-				row_block++;
-
-				if (m_comps_in_scan == 1)
-					block_x_mcu[component_id]++;
-				else
-				{
-					if (++block_x_mcu_ofs == m_comp_h_samp[component_id])
-					{
-						block_x_mcu_ofs = 0;
-
-						if (++block_y_mcu_ofs == m_comp_v_samp[component_id])
-						{
-							block_y_mcu_ofs = 0;
-
-							block_x_mcu[component_id] += m_comp_h_samp[component_id];
-						}
-					}
-				}
-			}
-
-			if (m_freq_domain_chroma_upsample)
-				transform_mcu_expand(mcu_row);
-			else
-				transform_mcu(mcu_row);
-		}
-
-		if (m_comps_in_scan == 1)
-			m_block_y_mcu[m_comp_list[0]]++;
-		else
-		{
-			for (component_num = 0; component_num < m_comps_in_scan; component_num++)
-			{
-				component_id = m_comp_list[component_num];
-
-				m_block_y_mcu[component_id] += m_comp_v_samp[component_id];
-			}
-		}
-	}
-
-	// Restart interval processing.
-	void jpeg_decoder::process_restart()
-	{
-		int i;
-		int c = 0;
-
-		// Align to a byte boundry
-		// FIXME: Is this really necessary? get_bits_no_markers() never reads in markers!
-		//get_bits_no_markers(m_bits_left & 7);
-
-		// Let's scan a little bit to find the marker, but not _too_ far.
-		// 1536 is a "fudge factor" that determines how much to scan.
-		for (i = 1536; i > 0; i--)
-			if (get_char() == 0xFF)
-				break;
-
-		if (i == 0)
-			stop_decoding(JPGD_BAD_RESTART_MARKER);
-
-		for ( ; i > 0; i--)
-			if ((c = get_char()) != 0xFF)
-				break;
-
-		if (i == 0)
-			stop_decoding(JPGD_BAD_RESTART_MARKER);
-
-		// Is it the expected marker? If not, something bad happened.
-		if (c != (m_next_restart_num + M_RST0))
-			stop_decoding(JPGD_BAD_RESTART_MARKER);
-
-		// Reset each component's DC prediction values.
-		memset(&m_last_dc_val, 0, m_comps_in_frame * sizeof(uint));
-
-		m_eob_run = 0;
-
-		m_restarts_left = m_restart_interval;
-
-		m_next_restart_num = (m_next_restart_num + 1) & 7;
-
-		// Get the bit buffer going again...
-
-		m_bits_left = 16;
-		get_bits_no_markers(16);
-		get_bits_no_markers(16);
-	}
-
-	static inline int dequantize_ac(int c, int q) {	c *= q;	return c; }
-
-	// Decodes and dequantizes the next row of coefficients.
-	void jpeg_decoder::decode_next_row()
-	{
-		int row_block = 0;
-
-		for (int mcu_row = 0; mcu_row < m_mcus_per_row; mcu_row++)
-		{
-			if ((m_restart_interval) && (m_restarts_left == 0))
-				process_restart();
-
-			jpgd_block_t* p = m_pMCU_coefficients;
-			for (int mcu_block = 0; mcu_block < m_blocks_per_mcu; mcu_block++, p += 64)
-			{
-				int component_id = m_mcu_org[mcu_block];
-				jpgd_quant_t* q = m_quant[m_comp_quant[component_id]];
-
-				int r, s;
-				s = huff_decode(m_pHuff_tabs[m_comp_dc_tab[component_id]], r);
-				s = HUFF_EXTEND(r, s);
-
-				m_last_dc_val[component_id] = (s += m_last_dc_val[component_id]);
-
-				p[0] = static_cast<jpgd_block_t>(s * q[0]);
-
-				int prev_num_set = m_mcu_block_max_zag[mcu_block];
-
-				huff_tables *pH = m_pHuff_tabs[m_comp_ac_tab[component_id]];
-
-				int k;
-				for (k = 1; k < 64; k++)
-				{
-					int extra_bits;
-					s = huff_decode(pH, extra_bits);
-
-					r = s >> 4;
-					s &= 15;
-
-					if (s)
-					{
-						if (r)
-						{
-							if ((k + r) > 63)
-								stop_decoding(JPGD_DECODE_ERROR);
-
-							if (k < prev_num_set)
-							{
-								int n = JPGD_MIN(r, prev_num_set - k);
-								int kt = k;
-								while (n--)
-									p[g_ZAG[kt++]] = 0;
-							}
-
-							k += r;
-						}
-
-						s = HUFF_EXTEND(extra_bits, s);
-
-						JPGD_ASSERT(k < 64);
-
-						p[g_ZAG[k]] = static_cast<jpgd_block_t>(dequantize_ac(s, q[k])); //s * q[k];
-					}
-					else
-					{
-						if (r == 15)
-						{
-							if ((k + 16) > 64)
-								stop_decoding(JPGD_DECODE_ERROR);
-
-							if (k < prev_num_set)
-							{
-								int n = JPGD_MIN(16, prev_num_set - k);
-								int kt = k;
-								while (n--)
-								{
-									JPGD_ASSERT(kt <= 63);
-									p[g_ZAG[kt++]] = 0;
-								}
-							}
-
-							k += 16 - 1; // - 1 because the loop counter is k
-							// BEGIN EPIC MOD
-							JPGD_ASSERT(k < 64 && p[g_ZAG[k]] == 0);
-							// END EPIC MOD
-						}
-						else
-							break;
-					}
-				}
-
-				if (k < prev_num_set)
-				{
-					int kt = k;
-					while (kt < prev_num_set)
-						p[g_ZAG[kt++]] = 0;
-				}
-
-				m_mcu_block_max_zag[mcu_block] = k;
-
-				row_block++;
-			}
-
-			if (m_freq_domain_chroma_upsample)
-				transform_mcu_expand(mcu_row);
-			else
-				transform_mcu(mcu_row);
-
-			m_restarts_left--;
-		}
-	}
-
-	// YCbCr H1V1 (1x1:1:1, 3 m_blocks per MCU) to RGB
-	void jpeg_decoder::H1V1Convert()
-	{
-		int row = m_max_mcu_y_size - m_mcu_lines_left;
-		uint8 *d = m_pScan_line_0;
-		uint8 *s = m_pSample_buf + row * 8;
-
-		for (int i = m_max_mcus_per_row; i > 0; i--)
-		{
-			for (int j = 0; j < 8; j++)
-			{
-				int y = s[j];
-				int cb = s[64+j];
-				int cr = s[128+j];
-
-				if (jpg_format == ERGBFormatJPG::BGRA)
-				{
-					d[0] = clamp(y + m_cbb[cb]);
-					d[1] = clamp(y + ((m_crg[cr] + m_cbg[cb]) >> 16));
-					d[2] = clamp(y + m_crr[cr]);
-					d[3] = 255;
-				}
-				else
-				{
-					d[0] = clamp(y + m_crr[cr]);
-					d[1] = clamp(y + ((m_crg[cr] + m_cbg[cb]) >> 16));
-					d[2] = clamp(y + m_cbb[cb]);
-					d[3] = 255;
-				}
-				d += 4;
-			}
-
-			s += 64*3;
-		}
-	}
-
-	// YCbCr H2V1 (2x1:1:1, 4 m_blocks per MCU) to RGB
-	void jpeg_decoder::H2V1Convert()
-	{
-		int row = m_max_mcu_y_size - m_mcu_lines_left;
-		uint8 *d0 = m_pScan_line_0;
-		uint8 *y = m_pSample_buf + row * 8;
-		uint8 *c = m_pSample_buf + 2*64 + row * 8;
-
-		for (int i = m_max_mcus_per_row; i > 0; i--)
-		{
-			for (int l = 0; l < 2; l++)
-			{
-				for (int j = 0; j < 4; j++)
-				{
-					int cb = c[0];
-					int cr = c[64];
-
-					int rc = m_crr[cr];
-					int gc = ((m_crg[cr] + m_cbg[cb]) >> 16);
-					int bc = m_cbb[cb];
-
-					int yy = y[j<<1];
-					if (jpg_format == ERGBFormatJPG::BGRA)
-					{
-						d0[0] = clamp(yy+bc);
-						d0[1] = clamp(yy+gc);
-						d0[2] = clamp(yy+rc);
-						d0[3] = 255;
-						yy = y[(j<<1)+1];
-						d0[4] = clamp(yy+bc);
-						d0[5] = clamp(yy+gc);
-						d0[6] = clamp(yy+rc);
-						d0[7] = 255;
-					}
-					else
-					{
-						d0[0] = clamp(yy+rc);
-						d0[1] = clamp(yy+gc);
-						d0[2] = clamp(yy+bc);
-						d0[3] = 255;
-						yy = y[(j<<1)+1];
-						d0[4] = clamp(yy+rc);
-						d0[5] = clamp(yy+gc);
-						d0[6] = clamp(yy+bc);
-						d0[7] = 255;
-					}
-
-					d0 += 8;
-
-					c++;
-				}
-				y += 64;
-			}
-
-			y += 64*4 - 64*2;
-			c += 64*4 - 8;
-		}
-	}
-
-	// YCbCr H2V1 (1x2:1:1, 4 m_blocks per MCU) to RGB
-	void jpeg_decoder::H1V2Convert()
-	{
-		int row = m_max_mcu_y_size - m_mcu_lines_left;
-		uint8 *d0 = m_pScan_line_0;
-		uint8 *d1 = m_pScan_line_1;
-		uint8 *y;
-		uint8 *c;
-
-		if (row < 8)
-			y = m_pSample_buf + row * 8;
-		else
-			y = m_pSample_buf + 64*1 + (row & 7) * 8;
-
-		c = m_pSample_buf + 64*2 + (row >> 1) * 8;
-
-		for (int i = m_max_mcus_per_row; i > 0; i--)
-		{
-			for (int j = 0; j < 8; j++)
-			{
-				int cb = c[0+j];
-				int cr = c[64+j];
-
-				int rc = m_crr[cr];
-				int gc = ((m_crg[cr] + m_cbg[cb]) >> 16);
-				int bc = m_cbb[cb];
-
-				int yy = y[j];
-				if (jpg_format == ERGBFormatJPG::BGRA)
-				{
-					d0[0] = clamp(yy+bc);
-					d0[1] = clamp(yy+gc);
-					d0[2] = clamp(yy+rc);
-					d0[3] = 255;
-					yy = y[8+j];
-					d1[0] = clamp(yy+bc);
-					d1[1] = clamp(yy+gc);
-					d1[2] = clamp(yy+rc);
-					d1[3] = 255;
-				}
-				else
-				{
-					d0[0] = clamp(yy+rc);
-					d0[1] = clamp(yy+gc);
-					d0[2] = clamp(yy+bc);
-					d0[3] = 255;
-					yy = y[8+j];
-					d1[0] = clamp(yy+rc);
-					d1[1] = clamp(yy+gc);
-					d1[2] = clamp(yy+bc);
-					d1[3] = 255;
-				}
-
-				d0 += 4;
-				d1 += 4;
-			}
-
-			y += 64*4;
-			c += 64*4;
-		}
-	}
-
-	// YCbCr H2V2 (2x2:1:1, 6 m_blocks per MCU) to RGB
-	void jpeg_decoder::H2V2Convert()
-	{
-		int row = m_max_mcu_y_size - m_mcu_lines_left;
-		uint8 *d0 = m_pScan_line_0;
-		uint8 *d1 = m_pScan_line_1;
-		uint8 *y;
-		uint8 *c;
-
-		if (row < 8)
-			y = m_pSample_buf + row * 8;
-		else
-			y = m_pSample_buf + 64*2 + (row & 7) * 8;
-
-		c = m_pSample_buf + 64*4 + (row >> 1) * 8;
-
-		for (int i = m_max_mcus_per_row; i > 0; i--)
-		{
-			for (int l = 0; l < 2; l++)
-			{
-				for (int j = 0; j < 8; j += 2)
-				{
-					int cb = c[0];
-					int cr = c[64];
-
-					int rc = m_crr[cr];
-					int gc = ((m_crg[cr] + m_cbg[cb]) >> 16);
-					int bc = m_cbb[cb];
-
-					int yy = y[j];
-					if (jpg_format == ERGBFormatJPG::BGRA)
-					{
-						d0[0] = clamp(yy+bc);
-						d0[1] = clamp(yy+gc);
-						d0[2] = clamp(yy+rc);
-						d0[3] = 255;
-						yy = y[j+1];
-						d0[4] = clamp(yy+bc);
-						d0[5] = clamp(yy+gc);
-						d0[6] = clamp(yy+rc);
-						d0[7] = 255;
-						yy = y[j+8];
-						d1[0] = clamp(yy+bc);
-						d1[1] = clamp(yy+gc);
-						d1[2] = clamp(yy+rc);
-						d1[3] = 255;
-						yy = y[j+8+1];
-						d1[4] = clamp(yy+bc);
-						d1[5] = clamp(yy+gc);
-						d1[6] = clamp(yy+rc);
-						d1[7] = 255;
-					}
-					else
-					{
-						d0[0] = clamp(yy+rc);
-						d0[1] = clamp(yy+gc);
-						d0[2] = clamp(yy+bc);
-						d0[3] = 255;
-						yy = y[j+1];
-						d0[4] = clamp(yy+rc);
-						d0[5] = clamp(yy+gc);
-						d0[6] = clamp(yy+bc);
-						d0[7] = 255;
-						yy = y[j+8];
-						d1[0] = clamp(yy+rc);
-						d1[1] = clamp(yy+gc);
-						d1[2] = clamp(yy+bc);
-						d1[3] = 255;
-						yy = y[j+8+1];
-						d1[4] = clamp(yy+rc);
-						d1[5] = clamp(yy+gc);
-						d1[6] = clamp(yy+bc);
-						d1[7] = 255;
-					}
-
-					d0 += 8;
-					d1 += 8;
-
-					c++;
-				}
-				y += 64;
-			}
-
-			y += 64*6 - 64*2;
-			c += 64*6 - 8;
-		}
-	}
-
-	// Y (1 block per MCU) to 8-bit grayscale
-	void jpeg_decoder::gray_convert()
-	{
-		int row = m_max_mcu_y_size - m_mcu_lines_left;
-		uint8 *d = m_pScan_line_0;
-		uint8 *s = m_pSample_buf + row * 8;
-
-		for (int i = m_max_mcus_per_row; i > 0; i--)
-		{
-			*(uint *)d = *(uint *)s;
-			*(uint *)(&d[4]) = *(uint *)(&s[4]);
-
-			s += 64;
-			d += 8;
-		}
-	}
-
-	void jpeg_decoder::expanded_convert()
-	{
-		int row = m_max_mcu_y_size - m_mcu_lines_left;
-
-		uint8* Py = m_pSample_buf + (row / 8) * 64 * m_comp_h_samp[0] + (row & 7) * 8;
-
-		uint8* d = m_pScan_line_0;
-
-		for (int i = m_max_mcus_per_row; i > 0; i--)
-		{
-			for (int k = 0; k < m_max_mcu_x_size; k += 8)
-			{
-				const int Y_ofs = k * 8;
-				const int Cb_ofs = Y_ofs + 64 * m_expanded_blocks_per_component;
-				const int Cr_ofs = Y_ofs + 64 * m_expanded_blocks_per_component * 2;
-				for (int j = 0; j < 8; j++)
-				{
-					int y = Py[Y_ofs + j];
-					int cb = Py[Cb_ofs + j];
-					int cr = Py[Cr_ofs + j];
-
-					if (jpg_format == ERGBFormatJPG::BGRA)
-					{
-						d[0] = clamp(y + m_cbb[cb]);
-						d[1] = clamp(y + ((m_crg[cr] + m_cbg[cb]) >> 16));
-						d[2] = clamp(y + m_crr[cr]);
-						d[3] = 255;
-					}
-					else
-					{
-						d[0] = clamp(y + m_crr[cr]);
-						d[1] = clamp(y + ((m_crg[cr] + m_cbg[cb]) >> 16));
-						d[2] = clamp(y + m_cbb[cb]);
-						d[3] = 255;
-					}
-
-					d += 4;
-				}
-			}
-
-			Py += 64 * m_expanded_blocks_per_mcu;
-		}
-	}
-
-	// Find end of image (EOI) marker, so we can return to the user the exact size of the input stream.
-	void jpeg_decoder::find_eoi()
-	{
-		if (!m_progressive_flag)
-		{
-			// Attempt to read the EOI marker.
-			//get_bits_no_markers(m_bits_left & 7);
-
-			// Prime the bit buffer
-			m_bits_left = 16;
-			get_bits(16);
-			get_bits(16);
-
-			// The next marker _should_ be EOI
-			process_markers();
-		}
-
-		m_total_bytes_read -= m_in_buf_left;
-	}
-
-	int jpeg_decoder::decode(const void** pScan_line, uint* pScan_line_len)
-	{
-		if ((m_error_code) || (!m_ready_flag))
-			return JPGD_FAILED;
-
-		if (m_total_lines_left == 0)
-			return JPGD_DONE;
-
-		if (m_mcu_lines_left == 0)
-		{
-			if (setjmp(m_jmp_state))
-				return JPGD_FAILED;
-
-			if (m_progressive_flag)
-				load_next_row();
-			else
-				decode_next_row();
-
-			// Find the EOI marker if that was the last row.
-			if (m_total_lines_left <= m_max_mcu_y_size)
-				find_eoi();
-
-			m_mcu_lines_left = m_max_mcu_y_size;
-		}
-
-		if (m_freq_domain_chroma_upsample)
-		{
-			expanded_convert();
-			*pScan_line = m_pScan_line_0;
-		}
-		else
-		{
-			switch (m_scan_type)
-			{
-			case JPGD_YH2V2:
-				{
-					if ((m_mcu_lines_left & 1) == 0)
-					{
-						H2V2Convert();
-						*pScan_line = m_pScan_line_0;
-					}
-					else
-						*pScan_line = m_pScan_line_1;
-
-					break;
-				}
-			case JPGD_YH2V1:
-				{
-					H2V1Convert();
-					*pScan_line = m_pScan_line_0;
-					break;
-				}
-			case JPGD_YH1V2:
-				{
-					if ((m_mcu_lines_left & 1) == 0)
-					{
-						H1V2Convert();
-						*pScan_line = m_pScan_line_0;
-					}
-					else
-						*pScan_line = m_pScan_line_1;
-
-					break;
-				}
-			case JPGD_YH1V1:
-				{
-					H1V1Convert();
-					*pScan_line = m_pScan_line_0;
-					break;
-				}
-			case JPGD_GRAYSCALE:
-				{
-					gray_convert();
-					*pScan_line = m_pScan_line_0;
-
-					break;
-				}
-			}
-		}
-
-		*pScan_line_len = m_real_dest_bytes_per_scan_line;
-
-		m_mcu_lines_left--;
-		m_total_lines_left--;
-
-		return JPGD_SUCCESS;
-	}
-
-	// Creates the tables needed for efficient Huffman decoding.
-	void jpeg_decoder::make_huff_table(int index, huff_tables *pH)
-	{
-		int p, i, l, si;
-		uint8 huffsize[257];
-		uint huffcode[257];
-		uint code;
-		uint subtree;
-		int code_size;
-		int lastp;
-		int nextfreeentry;
-		int currententry;
-
-		pH->ac_table = m_huff_ac[index] != 0;
-
-		p = 0;
-
-		for (l = 1; l <= 16; l++)
-		{
-			for (i = 1; i <= m_huff_num[index][l]; i++)
-				huffsize[p++] = static_cast<uint8>(l);
-		}
-
-		huffsize[p] = 0;
-
-		lastp = p;
-
-		code = 0;
-		si = huffsize[0];
-		p = 0;
-
-		while (huffsize[p])
-		{
-			while (huffsize[p] == si)
-			{
-				huffcode[p++] = code;
-				code++;
-			}
-
-			code <<= 1;
-			si++;
-		}
-
-		memset(pH->look_up, 0, sizeof(pH->look_up));
-		memset(pH->look_up2, 0, sizeof(pH->look_up2));
-		memset(pH->tree, 0, sizeof(pH->tree));
-		memset(pH->code_size, 0, sizeof(pH->code_size));
-
-		nextfreeentry = -1;
-
-		p = 0;
-
-		while (p < lastp)
-		{
-			i = m_huff_val[index][p];
-			code = huffcode[p];
-			code_size = huffsize[p];
-
-			pH->code_size[i] = static_cast<uint8>(code_size);
-
-			if (code_size <= 8)
-			{
-				code <<= (8 - code_size);
-
-				for (l = 1 << (8 - code_size); l > 0; l--)
-				{
-					JPGD_ASSERT(i < 256);
-
-					pH->look_up[code] = i;
-
-					bool has_extrabits = false;
-					int extra_bits = 0;
-					int num_extra_bits = i & 15;
-
-					int bits_to_fetch = code_size;
-					if (num_extra_bits)
-					{
-						int total_codesize = code_size + num_extra_bits;
-						if (total_codesize <= 8)
-						{
-							has_extrabits = true;
-							extra_bits = ((1 << num_extra_bits) - 1) & (code >> (8 - total_codesize));
-							JPGD_ASSERT(extra_bits <= 0x7FFF);
-							bits_to_fetch += num_extra_bits;
-						}
-					}
-
-					if (!has_extrabits)
-						pH->look_up2[code] = i | (bits_to_fetch << 8);
-					else
-						pH->look_up2[code] = i | 0x8000 | (extra_bits << 16) | (bits_to_fetch << 8);
-
-					code++;
-				}
-			}
-			else
-			{
-				subtree = (code >> (code_size - 8)) & 0xFF;
-
-				currententry = pH->look_up[subtree];
-
-				if (currententry == 0)
-				{
-					pH->look_up[subtree] = currententry = nextfreeentry;
-					pH->look_up2[subtree] = currententry = nextfreeentry;
-
-					nextfreeentry -= 2;
-				}
-
-				code <<= (16 - (code_size - 8));
-
-				for (l = code_size; l > 9; l--)
-				{
-					if ((code & 0x8000) == 0)
-						currententry--;
-
-					if (pH->tree[-currententry - 1] == 0)
-					{
-						pH->tree[-currententry - 1] = nextfreeentry;
-
-						currententry = nextfreeentry;
-
-						nextfreeentry -= 2;
-					}
-					else
-						currententry = pH->tree[-currententry - 1];
-
-					code <<= 1;
-				}
-
-				if ((code & 0x8000) == 0)
-					currententry--;
-
-				pH->tree[-currententry - 1] = i;
-			}
-
-			p++;
-		}
-	}
-
-	// Verifies the quantization tables needed for this scan are available.
-	void jpeg_decoder::check_quant_tables()
-	{
-		for (int i = 0; i < m_comps_in_scan; i++)
-			if (m_quant[m_comp_quant[m_comp_list[i]]] == NULL)
-				stop_decoding(JPGD_UNDEFINED_QUANT_TABLE);
-	}
-
-	// Verifies that all the Huffman tables needed for this scan are available.
-	void jpeg_decoder::check_huff_tables()
-	{
-		for (int i = 0; i < m_comps_in_scan; i++)
-		{
-			if ((m_spectral_start == 0) && (m_huff_num[m_comp_dc_tab[m_comp_list[i]]] == NULL))
-				stop_decoding(JPGD_UNDEFINED_HUFF_TABLE);
-
-			if ((m_spectral_end > 0) && (m_huff_num[m_comp_ac_tab[m_comp_list[i]]] == NULL))
-				stop_decoding(JPGD_UNDEFINED_HUFF_TABLE);
-		}
-
-		for (int i = 0; i < JPGD_MAX_HUFF_TABLES; i++)
-			if (m_huff_num[i])
-			{
-				if (!m_pHuff_tabs[i])
-					m_pHuff_tabs[i] = (huff_tables *)alloc(sizeof(huff_tables));
-
-				make_huff_table(i, m_pHuff_tabs[i]);
-			}
-	}
-
-	// Determines the component order inside each MCU.
-	// Also calcs how many MCU's are on each row, etc.
-	void jpeg_decoder::calc_mcu_block_order()
-	{
-		int component_num, component_id;
-		int max_h_samp = 0, max_v_samp = 0;
-
-		for (component_id = 0; component_id < m_comps_in_frame; component_id++)
-		{
-			if (m_comp_h_samp[component_id] > max_h_samp)
-				max_h_samp = m_comp_h_samp[component_id];
-
-			if (m_comp_v_samp[component_id] > max_v_samp)
-				max_v_samp = m_comp_v_samp[component_id];
-		}
-
-		for (component_id = 0; component_id < m_comps_in_frame; component_id++)
-		{
-			m_comp_h_blocks[component_id] = ((((m_image_x_size * m_comp_h_samp[component_id]) + (max_h_samp - 1)) / max_h_samp) + 7) / 8;
-			m_comp_v_blocks[component_id] = ((((m_image_y_size * m_comp_v_samp[component_id]) + (max_v_samp - 1)) / max_v_samp) + 7) / 8;
-		}
-
-		if (m_comps_in_scan == 1)
-		{
-			m_mcus_per_row = m_comp_h_blocks[m_comp_list[0]];
-			m_mcus_per_col = m_comp_v_blocks[m_comp_list[0]];
-		}
-		else
-		{
-			m_mcus_per_row = (((m_image_x_size + 7) / 8) + (max_h_samp - 1)) / max_h_samp;
-			m_mcus_per_col = (((m_image_y_size + 7) / 8) + (max_v_samp - 1)) / max_v_samp;
-		}
-
-		if (m_comps_in_scan == 1)
-		{
-			m_mcu_org[0] = m_comp_list[0];
-
-			m_blocks_per_mcu = 1;
-		}
-		else
-		{
-			m_blocks_per_mcu = 0;
-
-			for (component_num = 0; component_num < m_comps_in_scan; component_num++)
-			{
-				int num_blocks;
-
-				component_id = m_comp_list[component_num];
-
-				num_blocks = m_comp_h_samp[component_id] * m_comp_v_samp[component_id];
-
-				while (num_blocks--)
-					m_mcu_org[m_blocks_per_mcu++] = component_id;
-			}
-		}
-	}
-
-	// Starts a new scan.
-	int jpeg_decoder::init_scan()
-	{
-		if (!locate_sos_marker())
-			return JPGD_FALSE;
-
-		calc_mcu_block_order();
-
-		check_huff_tables();
-
-		check_quant_tables();
-
-		memset(m_last_dc_val, 0, m_comps_in_frame * sizeof(uint));
-
-		m_eob_run = 0;
-
-		if (m_restart_interval)
-		{
-			m_restarts_left = m_restart_interval;
-			m_next_restart_num = 0;
-		}
-
-		fix_in_buffer();
-
-		return JPGD_TRUE;
-	}
-
-	// Starts a frame. Determines if the number of components or sampling factors
-	// are supported.
-	void jpeg_decoder::init_frame()
-	{
-		int i;
-
-		if (m_comps_in_frame == 1)
-		{
-			if ((m_comp_h_samp[0] != 1) || (m_comp_v_samp[0] != 1))
-				stop_decoding(JPGD_UNSUPPORTED_SAMP_FACTORS);
-
-			m_scan_type = JPGD_GRAYSCALE;
-			m_max_blocks_per_mcu = 1;
-			m_max_mcu_x_size = 8;
-			m_max_mcu_y_size = 8;
-		}
-		else if (m_comps_in_frame == 3)
-		{
-			if ( ((m_comp_h_samp[1] != 1) || (m_comp_v_samp[1] != 1)) ||
-				((m_comp_h_samp[2] != 1) || (m_comp_v_samp[2] != 1)) )
-				stop_decoding(JPGD_UNSUPPORTED_SAMP_FACTORS);
-
-			if ((m_comp_h_samp[0] == 1) && (m_comp_v_samp[0] == 1))
-			{
-				m_scan_type = JPGD_YH1V1;
-
-				m_max_blocks_per_mcu = 3;
-				m_max_mcu_x_size = 8;
-				m_max_mcu_y_size = 8;
-			}
-			else if ((m_comp_h_samp[0] == 2) && (m_comp_v_samp[0] == 1))
-			{
-				m_scan_type = JPGD_YH2V1;
-				m_max_blocks_per_mcu = 4;
-				m_max_mcu_x_size = 16;
-				m_max_mcu_y_size = 8;
-			}
-			else if ((m_comp_h_samp[0] == 1) && (m_comp_v_samp[0] == 2))
-			{
-				m_scan_type = JPGD_YH1V2;
-				m_max_blocks_per_mcu = 4;
-				m_max_mcu_x_size = 8;
-				m_max_mcu_y_size = 16;
-			}
-			else if ((m_comp_h_samp[0] == 2) && (m_comp_v_samp[0] == 2))
-			{
-				m_scan_type = JPGD_YH2V2;
-				m_max_blocks_per_mcu = 6;
-				m_max_mcu_x_size = 16;
-				m_max_mcu_y_size = 16;
-			}
-			else
-				stop_decoding(JPGD_UNSUPPORTED_SAMP_FACTORS);
-		}
-		else
-			stop_decoding(JPGD_UNSUPPORTED_COLORSPACE);
-
-		m_max_mcus_per_row = (m_image_x_size + (m_max_mcu_x_size - 1)) / m_max_mcu_x_size;
-		m_max_mcus_per_col = (m_image_y_size + (m_max_mcu_y_size - 1)) / m_max_mcu_y_size;
-
-		// These values are for the *destination* pixels: after conversion.
-		if (m_scan_type == JPGD_GRAYSCALE)
-			m_dest_bytes_per_pixel = 1;
-		else
-			m_dest_bytes_per_pixel = 4;
-
-		m_dest_bytes_per_scan_line = ((m_image_x_size + 15) & 0xFFF0) * m_dest_bytes_per_pixel;
-
-		m_real_dest_bytes_per_scan_line = (m_image_x_size * m_dest_bytes_per_pixel);
-
-		// Initialize two scan line buffers.
-		m_pScan_line_0 = (uint8 *)alloc(m_dest_bytes_per_scan_line, true);
-		if ((m_scan_type == JPGD_YH1V2) || (m_scan_type == JPGD_YH2V2))
-			m_pScan_line_1 = (uint8 *)alloc(m_dest_bytes_per_scan_line, true);
-
-		m_max_blocks_per_row = m_max_mcus_per_row * m_max_blocks_per_mcu;
-
-		// Should never happen
-		if (m_max_blocks_per_row > JPGD_MAX_BLOCKS_PER_ROW)
-			stop_decoding(JPGD_ASSERTION_ERROR);
-
-		// Allocate the coefficient buffer, enough for one MCU
-		m_pMCU_coefficients = (jpgd_block_t*)alloc(m_max_blocks_per_mcu * 64 * sizeof(jpgd_block_t));
-
-		for (i = 0; i < m_max_blocks_per_mcu; i++)
-			m_mcu_block_max_zag[i] = 64;
-
-		m_expanded_blocks_per_component = m_comp_h_samp[0] * m_comp_v_samp[0];
-		m_expanded_blocks_per_mcu = m_expanded_blocks_per_component * m_comps_in_frame;
-		m_expanded_blocks_per_row = m_max_mcus_per_row * m_expanded_blocks_per_mcu;
-		// Freq. domain chroma upsampling is only supported for H2V2 subsampling factor.
-// BEGIN EPIC MOD
-#if JPGD_SUPPORT_FREQ_DOMAIN_UPSAMPLING
-		m_freq_domain_chroma_upsample = (m_expanded_blocks_per_mcu == 4*3);
-#else
-		m_freq_domain_chroma_upsample = 0;
-#endif
-// END EPIC MOD
-
-		if (m_freq_domain_chroma_upsample)
-			m_pSample_buf = (uint8 *)alloc(m_expanded_blocks_per_row * 64);
-		else
-			m_pSample_buf = (uint8 *)alloc(m_max_blocks_per_row * 64);
-
-		m_total_lines_left = m_image_y_size;
-
-		m_mcu_lines_left = 0;
-
-		create_look_ups();
-	}
-
-	// The coeff_buf series of methods originally stored the coefficients
-	// into a "virtual" file which was located in EMS, XMS, or a disk file. A cache
-	// was used to make this process more efficient. Now, we can store the entire
-	// thing in RAM.
-	jpeg_decoder::coeff_buf* jpeg_decoder::coeff_buf_open(int block_num_x, int block_num_y, int block_len_x, int block_len_y)
-	{
-		coeff_buf* cb = (coeff_buf*)alloc(sizeof(coeff_buf));
-
-		cb->block_num_x = block_num_x;
-		cb->block_num_y = block_num_y;
-		cb->block_len_x = block_len_x;
-		cb->block_len_y = block_len_y;
-		cb->block_size = (block_len_x * block_len_y) * sizeof(jpgd_block_t);
-		cb->pData = (uint8 *)alloc(cb->block_size * block_num_x * block_num_y, true);
-		return cb;
-	}
-
-	inline jpgd_block_t *jpeg_decoder::coeff_buf_getp(coeff_buf *cb, int block_x, int block_y)
-	{
-		JPGD_ASSERT((block_x < cb->block_num_x) && (block_y < cb->block_num_y));
-		return (jpgd_block_t *)(cb->pData + block_x * cb->block_size + block_y * (cb->block_size * cb->block_num_x));
-	}
-
-	// The following methods decode the various types of m_blocks encountered
-	// in progressively encoded images.
-	void jpeg_decoder::decode_block_dc_first(jpeg_decoder *pD, int component_id, int block_x, int block_y)
-	{
-		int s, r;
-		jpgd_block_t *p = pD->coeff_buf_getp(pD->m_dc_coeffs[component_id], block_x, block_y);
-
-		if ((s = pD->huff_decode(pD->m_pHuff_tabs[pD->m_comp_dc_tab[component_id]])) != 0)
-		{
-			r = pD->get_bits_no_markers(s);
-			s = HUFF_EXTEND(r, s);
-		}
-
-		pD->m_last_dc_val[component_id] = (s += pD->m_last_dc_val[component_id]);
-
-		p[0] = static_cast<jpgd_block_t>(s << pD->m_successive_low);
-	}
-
-	void jpeg_decoder::decode_block_dc_refine(jpeg_decoder *pD, int component_id, int block_x, int block_y)
-	{
-		if (pD->get_bits_no_markers(1))
-		{
-			jpgd_block_t *p = pD->coeff_buf_getp(pD->m_dc_coeffs[component_id], block_x, block_y);
-
-			p[0] |= (1 << pD->m_successive_low);
-		}
-	}
-
-	void jpeg_decoder::decode_block_ac_first(jpeg_decoder *pD, int component_id, int block_x, int block_y)
-	{
-		int k, s, r;
-
-		if (pD->m_eob_run)
-		{
-			pD->m_eob_run--;
-			return;
-		}
-
-		jpgd_block_t *p = pD->coeff_buf_getp(pD->m_ac_coeffs[component_id], block_x, block_y);
-
-		for (k = pD->m_spectral_start; k <= pD->m_spectral_end; k++)
-		{
-			s = pD->huff_decode(pD->m_pHuff_tabs[pD->m_comp_ac_tab[component_id]]);
-
-			r = s >> 4;
-			s &= 15;
-
-			if (s)
-			{
-				if ((k += r) > 63)
-					pD->stop_decoding(JPGD_DECODE_ERROR);
-
-				r = pD->get_bits_no_markers(s);
-				s = HUFF_EXTEND(r, s);
-
-				p[g_ZAG[k]] = static_cast<jpgd_block_t>(s << pD->m_successive_low);
-			}
-			else
-			{
-				if (r == 15)
-				{
-					if ((k += 15) > 63)
-						pD->stop_decoding(JPGD_DECODE_ERROR);
-				}
-				else
-				{
-					pD->m_eob_run = 1 << r;
-
-					if (r)
-						pD->m_eob_run += pD->get_bits_no_markers(r);
-
-					pD->m_eob_run--;
-
-					break;
-				}
-			}
-		}
-	}
-
-	void jpeg_decoder::decode_block_ac_refine(jpeg_decoder *pD, int component_id, int block_x, int block_y)
-	{
-		int s, k, r;
-		int p1 = 1 << pD->m_successive_low;
-		int m1 = (-1) << pD->m_successive_low;
-		jpgd_block_t *p = pD->coeff_buf_getp(pD->m_ac_coeffs[component_id], block_x, block_y);
-
-		k = pD->m_spectral_start;
-
-		if (pD->m_eob_run == 0)
-		{
-			for ( ; k <= pD->m_spectral_end; k++)
-			{
-				s = pD->huff_decode(pD->m_pHuff_tabs[pD->m_comp_ac_tab[component_id]]);
-
-				r = s >> 4;
-				s &= 15;
-
-				if (s)
-				{
-					if (s != 1)
-						pD->stop_decoding(JPGD_DECODE_ERROR);
-
-					if (pD->get_bits_no_markers(1))
-						s = p1;
-					else
-						s = m1;
-				}
-				else
-				{
-					if (r != 15)
-					{
-						pD->m_eob_run = 1 << r;
-
-						if (r)
-							pD->m_eob_run += pD->get_bits_no_markers(r);
-
-						break;
-					}
-				}
-
-				do
-				{
-					// BEGIN EPIC MOD
-					JPGD_ASSERT(k < 64);
-					// END EPIC MOD
-
-					jpgd_block_t *this_coef = p + g_ZAG[k];
-
-					if (*this_coef != 0)
-					{
-						if (pD->get_bits_no_markers(1))
-						{
-							if ((*this_coef & p1) == 0)
-							{
-								if (*this_coef >= 0)
-									*this_coef = static_cast<jpgd_block_t>(*this_coef + p1);
-								else
-									*this_coef = static_cast<jpgd_block_t>(*this_coef + m1);
-							}
-						}
-					}
-					else
-					{
-						if (--r < 0)
-							break;
-					}
-
-					k++;
-
-				} while (k <= pD->m_spectral_end);
-
-				if ((s) && (k < 64))
-				{
-					p[g_ZAG[k]] = static_cast<jpgd_block_t>(s);
-				}
-			}
-		}
-
-		if (pD->m_eob_run > 0)
-		{
-			for ( ; k <= pD->m_spectral_end; k++)
-			{
-				// BEGIN EPIC MOD
-				JPGD_ASSERT(k < 64);
-				// END EPIC MOD
-
-				jpgd_block_t *this_coef = p + g_ZAG[k];
-
-				if (*this_coef != 0)
-				{
-					if (pD->get_bits_no_markers(1))
-					{
-						if ((*this_coef & p1) == 0)
-						{
-							if (*this_coef >= 0)
-								*this_coef = static_cast<jpgd_block_t>(*this_coef + p1);
-							else
-								*this_coef = static_cast<jpgd_block_t>(*this_coef + m1);
-						}
-					}
-				}
-			}
-
-			pD->m_eob_run--;
-		}
-	}
-
-	// Decode a scan in a progressively encoded image.
-	void jpeg_decoder::decode_scan(pDecode_block_func decode_block_func)
-	{
-		int mcu_row, mcu_col, mcu_block;
-		int block_x_mcu[JPGD_MAX_COMPONENTS], m_block_y_mcu[JPGD_MAX_COMPONENTS];
-
-		memset(m_block_y_mcu, 0, sizeof(m_block_y_mcu));
-
-		for (mcu_col = 0; mcu_col < m_mcus_per_col; mcu_col++)
-		{
-			int component_num, component_id;
-
-			memset(block_x_mcu, 0, sizeof(block_x_mcu));
-
-			for (mcu_row = 0; mcu_row < m_mcus_per_row; mcu_row++)
-			{
-				int block_x_mcu_ofs = 0, block_y_mcu_ofs = 0;
-
-				if ((m_restart_interval) && (m_restarts_left == 0))
-					process_restart();
-
-				for (mcu_block = 0; mcu_block < m_blocks_per_mcu; mcu_block++)
-				{
-					component_id = m_mcu_org[mcu_block];
-
-					decode_block_func(this, component_id, block_x_mcu[component_id] + block_x_mcu_ofs, m_block_y_mcu[component_id] + block_y_mcu_ofs);
-
-					if (m_comps_in_scan == 1)
-						block_x_mcu[component_id]++;
-					else
-					{
-						if (++block_x_mcu_ofs == m_comp_h_samp[component_id])
-						{
-							block_x_mcu_ofs = 0;
-
-							if (++block_y_mcu_ofs == m_comp_v_samp[component_id])
-							{
-								block_y_mcu_ofs = 0;
-								block_x_mcu[component_id] += m_comp_h_samp[component_id];
-							}
-						}
-					}
-				}
-
-				m_restarts_left--;
-			}
-
-			if (m_comps_in_scan == 1)
-				m_block_y_mcu[m_comp_list[0]]++;
-			else
-			{
-				for (component_num = 0; component_num < m_comps_in_scan; component_num++)
-				{
-					component_id = m_comp_list[component_num];
-					m_block_y_mcu[component_id] += m_comp_v_samp[component_id];
-				}
-			}
-		}
-	}
-
-	// Decode a progressively encoded image.
-	void jpeg_decoder::init_progressive()
-	{
-		int i;
-
-		if (m_comps_in_frame == 4)
-			stop_decoding(JPGD_UNSUPPORTED_COLORSPACE);
-
-		// Allocate the coefficient buffers.
-		for (i = 0; i < m_comps_in_frame; i++)
-		{
-			m_dc_coeffs[i] = coeff_buf_open(m_max_mcus_per_row * m_comp_h_samp[i], m_max_mcus_per_col * m_comp_v_samp[i], 1, 1);
-			m_ac_coeffs[i] = coeff_buf_open(m_max_mcus_per_row * m_comp_h_samp[i], m_max_mcus_per_col * m_comp_v_samp[i], 8, 8);
-		}
-
-		for ( ; ; )
-		{
-			int dc_only_scan, refinement_scan;
-			pDecode_block_func decode_block_func;
-
-			if (!init_scan())
-				break;
-
-			dc_only_scan = (m_spectral_start == 0);
-			refinement_scan = (m_successive_high != 0);
-
-			if ((m_spectral_start > m_spectral_end) || (m_spectral_end > 63))
-				stop_decoding(JPGD_BAD_SOS_SPECTRAL);
-
-			if (dc_only_scan)
-			{
-				if (m_spectral_end)
-					stop_decoding(JPGD_BAD_SOS_SPECTRAL);
-			}
-			else if (m_comps_in_scan != 1)  /* AC scans can only contain one component */
-				stop_decoding(JPGD_BAD_SOS_SPECTRAL);
-
-			if ((refinement_scan) && (m_successive_low != m_successive_high - 1))
-				stop_decoding(JPGD_BAD_SOS_SUCCESSIVE);
-
-			if (dc_only_scan)
-			{
-				if (refinement_scan)
-					decode_block_func = decode_block_dc_refine;
-				else
-					decode_block_func = decode_block_dc_first;
-			}
-			else
-			{
-				if (refinement_scan)
-					decode_block_func = decode_block_ac_refine;
-				else
-					decode_block_func = decode_block_ac_first;
-			}
-
-			decode_scan(decode_block_func);
-
-			m_bits_left = 16;
-			get_bits(16);
-			get_bits(16);
-		}
-
-		m_comps_in_scan = m_comps_in_frame;
-
-		for (i = 0; i < m_comps_in_frame; i++)
-			m_comp_list[i] = i;
-
-		calc_mcu_block_order();
-	}
-
-	void jpeg_decoder::init_sequential()
-	{
-		if (!init_scan())
-			stop_decoding(JPGD_UNEXPECTED_MARKER);
-	}
-
-	void jpeg_decoder::decode_start()
-	{
-		init_frame();
-
-		if (m_progressive_flag)
-			init_progressive();
-		else
-			init_sequential();
-	}
-
-	void jpeg_decoder::decode_init(jpeg_decoder_stream *pStream)
-	{
-		init(pStream);
-		locate_sof_marker();
-	}
-
-	jpeg_decoder::jpeg_decoder(jpeg_decoder_stream *pStream)
-	{
-		if (setjmp(m_jmp_state))
-			return;
-		decode_init(pStream);
-	}
-
-	int jpeg_decoder::begin_decoding()
-	{
-		if (m_ready_flag)
-			return JPGD_SUCCESS;
-
-		if (m_error_code)
-			return JPGD_FAILED;
-
-		if (setjmp(m_jmp_state))
-			return JPGD_FAILED;
-
-		decode_start();
-
-		m_ready_flag = true;
-
-		return JPGD_SUCCESS;
-	}
-
-	jpeg_decoder::~jpeg_decoder()
-	{
-		free_all_blocks();
-	}
-
-	jpeg_decoder_file_stream::jpeg_decoder_file_stream()
-	{
-		m_pFile = NULL;
-		m_eof_flag = false;
-		m_error_flag = false;
-	}
-
-	void jpeg_decoder_file_stream::close()
-	{
-		if (m_pFile)
-		{
-			fclose(m_pFile);
-			m_pFile = NULL;
-		}
-
-		m_eof_flag = false;
-		m_error_flag = false;
-	}
-
-	jpeg_decoder_file_stream::~jpeg_decoder_file_stream()
-	{
-		close();
-	}
-
-	bool jpeg_decoder_file_stream::open(const char *Pfilename)
-	{
-		close();
-
-		m_eof_flag = false;
-		m_error_flag = false;
-
-#if defined(_MSC_VER)
-		m_pFile = NULL;
-		fopen_s(&m_pFile, Pfilename, "rb");
-#else
-		m_pFile = fopen(Pfilename, "rb");
-#endif
-		return m_pFile != NULL;
-	}
-
-	int jpeg_decoder_file_stream::read(uint8 *pBuf, int max_bytes_to_read, bool *pEOF_flag)
-	{
-		if (!m_pFile)
-			return -1;
-
-		if (m_eof_flag)
-		{
-			*pEOF_flag = true;
-			return 0;
-		}
-
-		if (m_error_flag)
-			return -1;
-
-		int bytes_read = static_cast<int>(fread(pBuf, 1, max_bytes_to_read, m_pFile));
-		if (bytes_read < max_bytes_to_read)
-		{
-			if (ferror(m_pFile))
-			{
-				m_error_flag = true;
-				return -1;
-			}
-
-			m_eof_flag = true;
-			*pEOF_flag = true;
-		}
-
-		return bytes_read;
-	}
-
-	bool jpeg_decoder_mem_stream::open(const uint8 *pSrc_data, uint size)
-	{
-		close();
-		m_pSrc_data = pSrc_data;
-		m_ofs = 0;
-		m_size = size;
-		return true;
-	}
-
-	int jpeg_decoder_mem_stream::read(uint8 *pBuf, int max_bytes_to_read, bool *pEOF_flag)
-	{
-		*pEOF_flag = false;
-
-		if (!m_pSrc_data)
-			return -1;
-
-		uint bytes_remaining = m_size - m_ofs;
-		if ((uint)max_bytes_to_read > bytes_remaining)
-		{
-			max_bytes_to_read = bytes_remaining;
-			*pEOF_flag = true;
-		}
-
-		memcpy(pBuf, m_pSrc_data + m_ofs, max_bytes_to_read);
-		m_ofs += max_bytes_to_read;
-
-		return max_bytes_to_read;
-	}
-
-	unsigned char *decompress_jpeg_image_from_stream(jpeg_decoder_stream *pStream, int *width, int *height, int *actual_comps, int req_comps)
-	{
-		if (!actual_comps)
-			return NULL;
-		*actual_comps = 0;
-
-		if ((!pStream) || (!width) || (!height) || (!req_comps))
-			return NULL;
-
-		if ((req_comps != 1) && (req_comps != 3) && (req_comps != 4))
-			return NULL;
-
-		jpeg_decoder decoder(pStream);
-		if (decoder.get_error_code() != JPGD_SUCCESS)
-			return NULL;
-
-		const int image_width = decoder.get_width(), image_height = decoder.get_height();
-		*width = image_width;
-		*height = image_height;
-		*actual_comps = decoder.get_num_components();
-
-		if (decoder.begin_decoding() != JPGD_SUCCESS)
-			return NULL;
-
-		const int dst_bpl = image_width * req_comps;
-
-		uint8 *pImage_data = (uint8*)jpgd_malloc(dst_bpl * image_height);
-		if (!pImage_data)
-			return NULL;
-
-		for (int y = 0; y < image_height; y++)
-		{
-			const uint8* pScan_line = 0;
-			uint scan_line_len;
-			if (decoder.decode((const void**)&pScan_line, &scan_line_len) != JPGD_SUCCESS)
-			{
-				jpgd_free(pImage_data);
-				return NULL;
-			}
-
-			uint8 *pDst = pImage_data + y * dst_bpl;
-
-			if (((req_comps == 4) && (decoder.get_num_components() == 3)) ||
-				((req_comps == 1) && (decoder.get_num_components() == 1)))
-			{
-				memcpy(pDst, pScan_line, dst_bpl);
-			}
-			else if (decoder.get_num_components() == 1)
-			{
-				if (req_comps == 3)
-				{
-					for (int x = 0; x < image_width; x++)
-					{
-						uint8 luma = pScan_line[x];
-						pDst[0] = luma;
-						pDst[1] = luma;
-						pDst[2] = luma;
-						pDst += 3;
-					}
-				}
-				else
-				{
-					for (int x = 0; x < image_width; x++)
-					{
-						uint8 luma = pScan_line[x];
-						pDst[0] = luma;
-						pDst[1] = luma;
-						pDst[2] = luma;
-						pDst[3] = 255;
-						pDst += 4;
-					}
-				}
-			}
-			else if (decoder.get_num_components() == 3)
-			{
-				if (req_comps == 1)
-				{
-					const int YR = 19595, YG = 38470, YB = 7471;
-					for (int x = 0; x < image_width; x++)
-					{
-						int r = pScan_line[x*4+0];
-						int g = pScan_line[x*4+1];
-						int b = pScan_line[x*4+2];
-						*pDst++ = static_cast<uint8>((r * YR + g * YG + b * YB + 32768) >> 16);
-					}
-				}
-				else
-				{
-					for (int x = 0; x < image_width; x++)
-					{
-						pDst[0] = pScan_line[x*4+0];
-						pDst[1] = pScan_line[x*4+1];
-						pDst[2] = pScan_line[x*4+2];
-						pDst += 3;
-					}
-				}
-			}
-		}
-
-		return pImage_data;
-	}
-
-// BEGIN EPIC MOD
-	unsigned char *decompress_jpeg_image_from_memory(const unsigned char *pSrc_data, int src_data_size, int *width, int *height, int *actual_comps, int req_comps, int format)
-	{
-		jpg_format = (ERGBFormatJPG)format;
-// EMD EPIC MOD
-		jpgd::jpeg_decoder_mem_stream mem_stream(pSrc_data, src_data_size);
-		return decompress_jpeg_image_from_stream(&mem_stream, width, height, actual_comps, req_comps);
-	}
-
-	unsigned char *decompress_jpeg_image_from_file(const char *pSrc_filename, int *width, int *height, int *actual_comps, int req_comps)
-	{
-		jpgd::jpeg_decoder_file_stream file_stream;
-		if (!file_stream.open(pSrc_filename))
-			return NULL;
-		return decompress_jpeg_image_from_stream(&file_stream, width, height, actual_comps, req_comps);
-	}
-
-} // namespace jpgd
diff --git a/spaces/zhuowen999/vits_chinese/bert/ProsodyModel.py b/spaces/zhuowen999/vits_chinese/bert/ProsodyModel.py
deleted file mode 100644
index 5f305b41894a4a8cec05c23dcdd29a9b939b748b..0000000000000000000000000000000000000000
--- a/spaces/zhuowen999/vits_chinese/bert/ProsodyModel.py
+++ /dev/null
@@ -1,75 +0,0 @@
-import os
-import torch
-import torch.nn as nn
-import torch.nn.functional as F
-
-from transformers import BertModel, BertConfig, BertTokenizer
-
-
-class CharEmbedding(nn.Module):
-    def __init__(self, model_dir):
-        super().__init__()
-        self.tokenizer = BertTokenizer.from_pretrained(model_dir)
-        self.bert_config = BertConfig.from_pretrained(model_dir)
-        self.hidden_size = self.bert_config.hidden_size
-        self.bert = BertModel(self.bert_config)
-        self.proj = nn.Linear(self.hidden_size, 256)
-        self.linear = nn.Linear(256, 3)
-
-    def text2Token(self, text):
-        token = self.tokenizer.tokenize(text)
-        txtid = self.tokenizer.convert_tokens_to_ids(token)
-        return txtid
-
-    def forward(self, inputs_ids, inputs_masks, tokens_type_ids):
-        out_seq = self.bert(input_ids=inputs_ids,
-                            attention_mask=inputs_masks,
-                            token_type_ids=tokens_type_ids)[0]
-        out_seq = self.proj(out_seq)
-        return out_seq
-
-
-class TTSProsody(object):
-    def __init__(self, path, device):
-        self.device = device
-        self.char_model = CharEmbedding(path)
-        self.char_model.load_state_dict(
-            torch.load(
-                os.path.join(path, 'prosody_model.pt'),
-                map_location="cpu"
-            ),
-            strict=False
-        )
-        self.char_model.eval()
-        self.char_model.to(self.device)
-
-    def get_char_embeds(self, text):
-        input_ids = self.char_model.text2Token(text)
-        input_masks = [1] * len(input_ids)
-        type_ids = [0] * len(input_ids)
-        input_ids = torch.LongTensor([input_ids]).to(self.device)
-        input_masks = torch.LongTensor([input_masks]).to(self.device)
-        type_ids = torch.LongTensor([type_ids]).to(self.device)
-
-        with torch.no_grad():
-            char_embeds = self.char_model(
-                input_ids, input_masks, type_ids).squeeze(0).cpu()
-        return char_embeds
-
-    def expand_for_phone(self, char_embeds, length):  # length of phones for char
-        assert char_embeds.size(0) == len(length)
-        expand_vecs = list()
-        for vec, leng in zip(char_embeds, length):
-            vec = vec.expand(leng, -1)
-            expand_vecs.append(vec)
-        expand_embeds = torch.cat(expand_vecs, 0)
-        assert expand_embeds.size(0) == sum(length)
-        return expand_embeds.numpy()
-
-
-if __name__ == "__main__":
-    device = torch.device("cuda" if torch.cuda.is_available() else "cpu")
-    prosody = TTSProsody('./bert/', device)
-    while True:
-        text = input("请输入文本：")
-        prosody.get_char_embeds(text)
diff --git a/spaces/zlc99/M4Singer/inference/m4singer/ds_e2e.py b/spaces/zlc99/M4Singer/inference/m4singer/ds_e2e.py
deleted file mode 100644
index 566b1e00389e1907a68d5a6ae4f156fb84d50b16..0000000000000000000000000000000000000000
--- a/spaces/zlc99/M4Singer/inference/m4singer/ds_e2e.py
+++ /dev/null
@@ -1,67 +0,0 @@
-import torch
-# from inference.tts.fs import FastSpeechInfer
-# from modules.tts.fs2_orig import FastSpeech2Orig
-from inference.m4singer.base_svs_infer import BaseSVSInfer
-from utils import load_ckpt
-from utils.hparams import hparams
-from usr.diff.shallow_diffusion_tts import GaussianDiffusion
-from usr.diffsinger_task import DIFF_DECODERS
-from modules.fastspeech.pe import PitchExtractor
-import utils
-
-
-class DiffSingerE2EInfer(BaseSVSInfer):
-    def build_model(self):
-        model = GaussianDiffusion(
-            phone_encoder=self.ph_encoder,
-            out_dims=hparams['audio_num_mel_bins'], denoise_fn=DIFF_DECODERS[hparams['diff_decoder_type']](hparams),
-            timesteps=hparams['timesteps'],
-            K_step=hparams['K_step'],
-            loss_type=hparams['diff_loss_type'],
-            spec_min=hparams['spec_min'], spec_max=hparams['spec_max'],
-        )
-        model.eval()
-        load_ckpt(model, hparams['work_dir'], 'model')
-
-        if hparams.get('pe_enable') is not None and hparams['pe_enable']:
-            self.pe = PitchExtractor().to(self.device)
-            utils.load_ckpt(self.pe, hparams['pe_ckpt'], 'model', strict=True)
-            self.pe.eval()
-        return model
-
-    def forward_model(self, inp):
-        sample = self.input_to_batch(inp)
-        txt_tokens = sample['txt_tokens']  # [B, T_t]
-        spk_id = sample.get('spk_ids')
-        with torch.no_grad():
-            output = self.model(txt_tokens, spk_embed=spk_id, ref_mels=None, infer=True,
-                                pitch_midi=sample['pitch_midi'], midi_dur=sample['midi_dur'],
-                                is_slur=sample['is_slur'])
-            mel_out = output['mel_out']  # [B, T,80]
-            if hparams.get('pe_enable') is not None and hparams['pe_enable']:
-                f0_pred = self.pe(mel_out)['f0_denorm_pred']  # pe predict from Pred mel
-            else:
-                f0_pred = output['f0_denorm']
-            wav_out = self.run_vocoder(mel_out, f0=f0_pred)
-        wav_out = wav_out.cpu().numpy()
-        return wav_out[0]
-
-if __name__ == '__main__':
-    inp = {
-        'spk_name': 'Tenor-1',
-        'text': 'AP你要相信AP相信我们会像童话故事里AP',
-        'notes': 'rest | G#3 | A#3 C4 | D#4 | D#4 F4 | rest | E4 F4 | F4 | D#4 A#3 | A#3 | A#3 | C#4 | B3 C4 | C#4 | B3 C4 | A#3 | G#3 | rest',
-        'notes_duration': '0.14 | 0.47 | 0.1905 0.1895 | 0.41 | 0.3005 0.3895 | 0.21 | 0.2391 0.1809 | 0.32 | 0.4105 0.2095 | 0.35 | 0.43 | 0.45 | 0.2309 0.2291 | 0.48 | 0.225 0.195 | 0.29 | 0.71 | 0.14',
-        'input_type': 'word',
-    } 
-
-    c = {
-        'spk_name': 'Tenor-1',
-        'text': '你要相信相信我们会像童话故事里',
-        'ph_seq': '<AP> n i iao iao x iang x in in <AP> x iang iang x in uo uo m en h uei x iang t ong ong h ua g u u sh i l i <AP>',
-        'note_seq': 'rest G#3 G#3 A#3 C4 D#4 D#4 D#4 D#4 F4 rest E4 E4 F4 F4 F4 D#4 A#3 A#3 A#3 A#3 A#3 C#4 C#4 B3 B3 C4 C#4 C#4 B3 B3 C4 A#3 A#3 G#3 G#3 rest',
-        'note_dur_seq': '0.14 0.47 0.47 0.1905 0.1895 0.41 0.41 0.3005 0.3005 0.3895 0.21 0.2391 0.2391 0.1809 0.32 0.32 0.4105 0.2095 0.35 0.35 0.43 0.43 0.45 0.45 0.2309 0.2309 0.2291 0.48 0.48 0.225 0.225 0.195 0.29 0.29 0.71 0.71 0.14',
-        'is_slur_seq': '0 0 0 0 1 0 0 0 0 1 0 0 0 1 0 0 0 1 0 0 0 0 0 0 0 0 1 0 0 0 0 1 0 0 0 0 0',
-        'input_type': 'phoneme'
-    }
-    DiffSingerE2EInfer.example_run(inp)