id stringlengths 9 10 | submitter stringlengths 1 64 ⌀ | authors stringlengths 4 20.7k | title stringlengths 4 246 | comments stringlengths 1 523 ⌀ | journal-ref stringlengths 4 404 ⌀ | doi stringlengths 11 153 ⌀ | report-no stringlengths 2 254 ⌀ | categories stringlengths 5 98 | license stringclasses 9
values | orig_abstract stringlengths 14 3.35k | versions listlengths 1 60 | update_date stringlengths 10 10 | authors_parsed listlengths 1 1.35k | abstract stringlengths 11 3.34k |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
2303.06823 | Atul Dhingra | Atul Dhingra, Gaurav Sood | Instate: Predicting the State of Residence From Last Name | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | India has twenty-two official languages. Serving such a diverse language base
is a challenge for survey statisticians, call center operators, software
developers, and other such service providers. To help provide better services
to different language communities via better localization, we introduce a new
machine lea... | [
{
"created": "Mon, 13 Mar 2023 02:49:50 GMT",
"version": "v1"
}
] | 2023-03-14 | [
[
"Dhingra",
"Atul",
""
],
[
"Sood",
"Gaurav",
""
]
] | India has twenty-two official languages. Serving such a diverse language base is a challenge for survey statisticians, call center operators, software developers, and other such service providers. To help provide better services to different language communities via better localization, we introduce a new machine learn... |
1103.3933 | Tuvi Etzion | Tuvi Etzion | Product Constructions for Perfect Lee Codes | submitted to IEEE Transactions on Information Theory | null | 10.1109/TIT.2011.2161133 | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A well known conjecture of Golomb and Welch is that the only nontrivial
perfect codes in the Lee and Manhattan metrics have length two or minimum
distance three. This problem and related topics were subject for extensive
research in the last forty years. In this paper two product constructions for
perfect Lee codes a... | [
{
"created": "Mon, 21 Mar 2011 07:53:53 GMT",
"version": "v1"
},
{
"created": "Wed, 22 Jun 2011 09:47:33 GMT",
"version": "v2"
}
] | 2016-11-17 | [
[
"Etzion",
"Tuvi",
""
]
] | A well known conjecture of Golomb and Welch is that the only nontrivial perfect codes in the Lee and Manhattan metrics have length two or minimum distance three. This problem and related topics were subject for extensive research in the last forty years. In this paper two product constructions for perfect Lee codes and... |
1808.04405 | Srayan Datta | Srayan Datta and Eytan Adar | Extracting Inter-community Conflicts in Reddit | 21 pages, 7 figures | null | null | null | cs.SI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Anti-social behaviors in social media can happen both at user and community
levels. While a great deal of attention is on the individual as an 'aggressor,'
the banning of entire Reddit subcommunities (i.e., subreddits) demonstrates
that this is a multi-layer concern. Existing research on inter-community
conflict has ... | [
{
"created": "Mon, 13 Aug 2018 18:56:27 GMT",
"version": "v1"
}
] | 2018-08-15 | [
[
"Datta",
"Srayan",
""
],
[
"Adar",
"Eytan",
""
]
] | Anti-social behaviors in social media can happen both at user and community levels. While a great deal of attention is on the individual as an 'aggressor,' the banning of entire Reddit subcommunities (i.e., subreddits) demonstrates that this is a multi-layer concern. Existing research on inter-community conflict has la... |
2401.03256 | Subhajit Sahu | Subhajit Sahu | An Incrementally Expanding Approach for Updating PageRank on Dynamic
Graphs | 11 pages, 14 figures, 1 table | null | null | null | cs.DC cs.PF | http://creativecommons.org/licenses/by-nc-sa/4.0/ | PageRank is a popular centrality metric that assigns importance to the
vertices of a graph based on its neighbors and their score. Efficient parallel
algorithms for updating PageRank on dynamic graphs is crucial for various
applications, especially as dataset sizes have reached substantial scales. This
technical repo... | [
{
"created": "Sat, 6 Jan 2024 16:45:49 GMT",
"version": "v1"
},
{
"created": "Tue, 9 Jan 2024 06:56:23 GMT",
"version": "v2"
},
{
"created": "Fri, 26 Jan 2024 09:37:59 GMT",
"version": "v3"
}
] | 2024-01-29 | [
[
"Sahu",
"Subhajit",
""
]
] | PageRank is a popular centrality metric that assigns importance to the vertices of a graph based on its neighbors and their score. Efficient parallel algorithms for updating PageRank on dynamic graphs is crucial for various applications, especially as dataset sizes have reached substantial scales. This technical report... |
1807.02098 | Somdip Dey Mr. | Somdip Dey, Grigorios Kalliatakis, Sangeet Saha, Amit Kumar Singh,
Shoaib Ehsan, Klaus McDonald-Maier | MAT-CNN-SOPC: Motionless Analysis of Traffic Using Convolutional Neural
Networks on System-On-a-Programmable-Chip | 6 pages, 3 figures, 2 tables | 2018 NASA/ESA Conference on Adaptive Hardware and Systems (AHS
2018) | null | null | cs.CV | http://creativecommons.org/licenses/by/4.0/ | Intelligent Transportation Systems (ITS) have become an important pillar in
modern "smart city" framework which demands intelligent involvement of
machines. Traffic load recognition can be categorized as an important and
challenging issue for such systems. Recently, Convolutional Neural Network
(CNN) models have draw... | [
{
"created": "Thu, 5 Jul 2018 17:35:33 GMT",
"version": "v1"
},
{
"created": "Tue, 14 Aug 2018 23:31:16 GMT",
"version": "v2"
}
] | 2018-08-16 | [
[
"Dey",
"Somdip",
""
],
[
"Kalliatakis",
"Grigorios",
""
],
[
"Saha",
"Sangeet",
""
],
[
"Singh",
"Amit Kumar",
""
],
[
"Ehsan",
"Shoaib",
""
],
[
"McDonald-Maier",
"Klaus",
""
]
] | Intelligent Transportation Systems (ITS) have become an important pillar in modern "smart city" framework which demands intelligent involvement of machines. Traffic load recognition can be categorized as an important and challenging issue for such systems. Recently, Convolutional Neural Network (CNN) models have drawn ... |
2002.05886 | Jadab Kumar Pal Dr | Jimut Bahan Pal | How to cluster nearest unique nodes from different classes using
JJCluster in Wisp application? | A new type of clustering algorithm is built which helps to find the
best place for any location by giving a set of preferences to the
application. Source code can be found here: https://github.com/Jimut123/wisp | null | null | null | cs.HC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The work of finding the best place according to user preference is a tedious
task. It needs manual research and lot of intuitive process to find the best
location according to some earlier knowledge about the place. It is mainly
about accessing publicly available spatial data, applying a simple algorithm to
summarize... | [
{
"created": "Fri, 14 Feb 2020 06:38:01 GMT",
"version": "v1"
},
{
"created": "Mon, 17 Feb 2020 08:42:56 GMT",
"version": "v2"
}
] | 2020-02-18 | [
[
"Pal",
"Jimut Bahan",
""
]
] | The work of finding the best place according to user preference is a tedious task. It needs manual research and lot of intuitive process to find the best location according to some earlier knowledge about the place. It is mainly about accessing publicly available spatial data, applying a simple algorithm to summarize t... |
1405.2652 | Ronald Ortner | Ronald Ortner, Odalric-Ambrym Maillard, Daniil Ryabko | Selecting Near-Optimal Approximate State Representations in
Reinforcement Learning | null | null | null | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We consider a reinforcement learning setting introduced in (Maillard et al.,
NIPS 2011) where the learner does not have explicit access to the states of the
underlying Markov decision process (MDP). Instead, she has access to several
models that map histories of past interactions to states. Here we improve over
known... | [
{
"created": "Mon, 12 May 2014 07:45:54 GMT",
"version": "v1"
},
{
"created": "Wed, 14 May 2014 12:43:36 GMT",
"version": "v2"
},
{
"created": "Wed, 9 Jul 2014 14:40:20 GMT",
"version": "v3"
},
{
"created": "Mon, 21 Jul 2014 11:52:37 GMT",
"version": "v4"
},
{
"cr... | 2014-09-16 | [
[
"Ortner",
"Ronald",
""
],
[
"Maillard",
"Odalric-Ambrym",
""
],
[
"Ryabko",
"Daniil",
""
]
] | We consider a reinforcement learning setting introduced in (Maillard et al., NIPS 2011) where the learner does not have explicit access to the states of the underlying Markov decision process (MDP). Instead, she has access to several models that map histories of past interactions to states. Here we improve over known r... |
2009.10373 | Michele Linardi | Michele Linardi and Themis Palpanas | Scalable Data Series Subsequence Matching with ULISSE | null | null | null | null | cs.DB | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Data series similarity search is an important operation and at the core of
several analysis tasks and applications related to data series collections.
Despite the fact that data series indexes enable fast similarity search, all
existing indexes can only answer queries of a single length (fixed at index
construction t... | [
{
"created": "Tue, 22 Sep 2020 08:04:20 GMT",
"version": "v1"
}
] | 2020-09-23 | [
[
"Linardi",
"Michele",
""
],
[
"Palpanas",
"Themis",
""
]
] | Data series similarity search is an important operation and at the core of several analysis tasks and applications related to data series collections. Despite the fact that data series indexes enable fast similarity search, all existing indexes can only answer queries of a single length (fixed at index construction tim... |
2403.00315 | Andr\'es P\'aez | Andr\'es P\'aez | Axe the X in XAI: A Plea for Understandable AI | null | null | null | null | cs.AI cs.LG | http://creativecommons.org/licenses/by-nc-nd/4.0/ | In a recent paper, Erasmus et al. (2021) defend the idea that the ambiguity
of the term "explanation" in explainable AI (XAI) can be solved by adopting any
of four different extant accounts of explanation in the philosophy of science:
the Deductive Nomological, Inductive Statistical, Causal Mechanical, and New
Mechan... | [
{
"created": "Fri, 1 Mar 2024 06:28:53 GMT",
"version": "v1"
}
] | 2024-03-04 | [
[
"Páez",
"Andrés",
""
]
] | In a recent paper, Erasmus et al. (2021) defend the idea that the ambiguity of the term "explanation" in explainable AI (XAI) can be solved by adopting any of four different extant accounts of explanation in the philosophy of science: the Deductive Nomological, Inductive Statistical, Causal Mechanical, and New Mechanis... |
1712.00975 | Dat Thanh Tran | Dat Thanh Tran, Alexandros Iosifidis, Juho Kanniainen, Moncef Gabbouj | Temporal Attention augmented Bilinear Network for Financial Time-Series
Data Analysis | 12 pages, 4 figures, 3 tables | null | 10.1109/TNNLS.2018.2869225 | null | cs.CE cs.LG q-fin.CP | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Financial time-series forecasting has long been a challenging problem because
of the inherently noisy and stochastic nature of the market. In the
High-Frequency Trading (HFT), forecasting for trading purposes is even a more
challenging task since an automated inference system is required to be both
accurate and fast.... | [
{
"created": "Mon, 4 Dec 2017 09:41:24 GMT",
"version": "v1"
}
] | 2019-06-11 | [
[
"Tran",
"Dat Thanh",
""
],
[
"Iosifidis",
"Alexandros",
""
],
[
"Kanniainen",
"Juho",
""
],
[
"Gabbouj",
"Moncef",
""
]
] | Financial time-series forecasting has long been a challenging problem because of the inherently noisy and stochastic nature of the market. In the High-Frequency Trading (HFT), forecasting for trading purposes is even a more challenging task since an automated inference system is required to be both accurate and fast. I... |
1804.03416 | Katarzyna Biesialska | Katarzyna Biesialska, Xavier Franch, Victor Munt\'es-Mulero | Protocol and Tools for Conducting Agile Software Engineering Research in
an Industrial-Academic Setting: A Preliminary Study | Accepted to CESI 2018 - International Workshop on Conducting
Empirical Studies in Industry (in conjunction with ICSE 2018) | 2018 IEEE/ACM 6th International Workshop on Conducting Empirical
Studies in Industry (CESI), Gothenburg, 2018, pp. 29-32 | 10.1145/3193965.3193970 | null | cs.SE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Conducting empirical research in software engineering industry is a process,
and as such, it should be generalizable. The aim of this paper is to discuss
how academic researchers may address some of the challenges they encounter
during conducting empirical research in the software industry by means of a
systematic an... | [
{
"created": "Tue, 10 Apr 2018 09:31:08 GMT",
"version": "v1"
}
] | 2020-03-17 | [
[
"Biesialska",
"Katarzyna",
""
],
[
"Franch",
"Xavier",
""
],
[
"Muntés-Mulero",
"Victor",
""
]
] | Conducting empirical research in software engineering industry is a process, and as such, it should be generalizable. The aim of this paper is to discuss how academic researchers may address some of the challenges they encounter during conducting empirical research in the software industry by means of a systematic and ... |
2003.04117 | M. G. Sarwar Murshed | Rashik Shadman, M.G. Sarwar Murshed, Edward Verenich, Alvaro
Velasquez, Faraz Hussain | The Utility of Feature Reuse: Transfer Learning in Data-Starved Regimes | 5 pages, 3 figure, conference | null | null | null | cs.CV cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The use of transfer learning with deep neural networks has increasingly
become widespread for deploying well-tested computer vision systems to newer
domains, especially those with limited datasets. We describe a transfer
learning use case for a domain with a data-starved regime, having fewer than
100 labeled target s... | [
{
"created": "Sat, 29 Feb 2020 18:48:58 GMT",
"version": "v1"
},
{
"created": "Thu, 28 Dec 2023 15:53:41 GMT",
"version": "v2"
}
] | 2023-12-29 | [
[
"Shadman",
"Rashik",
""
],
[
"Murshed",
"M. G. Sarwar",
""
],
[
"Verenich",
"Edward",
""
],
[
"Velasquez",
"Alvaro",
""
],
[
"Hussain",
"Faraz",
""
]
] | The use of transfer learning with deep neural networks has increasingly become widespread for deploying well-tested computer vision systems to newer domains, especially those with limited datasets. We describe a transfer learning use case for a domain with a data-starved regime, having fewer than 100 labeled target sam... |
2007.14049 | Stephan Lukasczyk | Stephan Lukasczyk and Florian Kroi{\ss} and Gordon Fraser | Automated Unit Test Generation for Python | 15 pages, to be published in Proceedings of the 12th Symposium on
Search-Based Software Engineering (SSBSE 2020) | null | 10.1007/978-3-030-59762-7_2 | null | cs.SE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Automated unit test generation is an established research field, and mature
test generation tools exist for statically typed programming languages such as
Java. It is, however, substantially more difficult to automatically generate
supportive tests for dynamically typed programming languages such as Python,
due to th... | [
{
"created": "Tue, 28 Jul 2020 08:12:23 GMT",
"version": "v1"
}
] | 2020-10-07 | [
[
"Lukasczyk",
"Stephan",
""
],
[
"Kroiß",
"Florian",
""
],
[
"Fraser",
"Gordon",
""
]
] | Automated unit test generation is an established research field, and mature test generation tools exist for statically typed programming languages such as Java. It is, however, substantially more difficult to automatically generate supportive tests for dynamically typed programming languages such as Python, due to the ... |
2205.12324 | Ferenc Ill\'es | Ferenc Ill\'es | Linearly representable games and pseudo-polynomial calculation of the
Shapley value | 17 pages | null | null | null | cs.GT | http://creativecommons.org/licenses/by/4.0/ | We introduce the notion of linearly representable games. Broadly speaking,
these are TU games that can be described by as many parameters as the number of
players, like weighted voting games, airport games, or bankruptcy games. We
show that the Shapley value calculation is pseudo-polynomial for linearly
representable... | [
{
"created": "Tue, 24 May 2022 19:11:12 GMT",
"version": "v1"
}
] | 2022-05-26 | [
[
"Illés",
"Ferenc",
""
]
] | We introduce the notion of linearly representable games. Broadly speaking, these are TU games that can be described by as many parameters as the number of players, like weighted voting games, airport games, or bankruptcy games. We show that the Shapley value calculation is pseudo-polynomial for linearly representable g... |
1910.13095 | Mengjing Chen | Hua Liu and Mengjing Chen and Xiaolong Wang and Zihe Wang | A Game-theoretical Approach to Analyze Film Release Time | 11 pages | null | null | null | cs.GT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Film release dates play an important part in box office revenues because of
the facts of obvious seasonality demand in the film industry and severe
competition among films shown at the same time. In this paper, we study how
film studios choose release time for movies they produce to maximize their box
offices. We fir... | [
{
"created": "Tue, 29 Oct 2019 05:53:20 GMT",
"version": "v1"
},
{
"created": "Tue, 1 Sep 2020 02:27:19 GMT",
"version": "v2"
},
{
"created": "Mon, 4 Jan 2021 05:46:42 GMT",
"version": "v3"
}
] | 2021-01-05 | [
[
"Liu",
"Hua",
""
],
[
"Chen",
"Mengjing",
""
],
[
"Wang",
"Xiaolong",
""
],
[
"Wang",
"Zihe",
""
]
] | Film release dates play an important part in box office revenues because of the facts of obvious seasonality demand in the film industry and severe competition among films shown at the same time. In this paper, we study how film studios choose release time for movies they produce to maximize their box offices. We first... |
2407.05061 | Monika Wysocza\'nska | Monika Wysocza\'nska, Antonin Vobecky, Amaia Cardiel, Tomasz
Trzci\'nski, Renaud Marlet, Andrei Bursuc, Oriane Sim\'eoni | A Study of Test-time Contrastive Concepts for Open-world,
Open-vocabulary Semantic Segmentation | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Recent VLMs, pre-trained on large amounts of image-text pairs to align both
modalities, have opened the way to open-vocabulary semantic segmentation. Given
an arbitrary set of textual queries, image regions are assigned the closest
query in feature space. However, the usual setup expects the user to list all
possible... | [
{
"created": "Sat, 6 Jul 2024 12:18:43 GMT",
"version": "v1"
}
] | 2024-07-09 | [
[
"Wysoczańska",
"Monika",
""
],
[
"Vobecky",
"Antonin",
""
],
[
"Cardiel",
"Amaia",
""
],
[
"Trzciński",
"Tomasz",
""
],
[
"Marlet",
"Renaud",
""
],
[
"Bursuc",
"Andrei",
""
],
[
"Siméoni",
"Oriane",
""
]
... | Recent VLMs, pre-trained on large amounts of image-text pairs to align both modalities, have opened the way to open-vocabulary semantic segmentation. Given an arbitrary set of textual queries, image regions are assigned the closest query in feature space. However, the usual setup expects the user to list all possible v... |
1911.06147 | Sergio Gast\'on Burdisso | Sergio G. Burdisso, Marcelo Errecalde, Manuel Montes-y-G\'omez | t-SS3: a text classifier with dynamic n-grams for early risk detection
over text streams | Highlights: (*) A classifier that is able to dynamically learn and
recognize important word n-grams. (*) A novel text classifier having the
ability to visually explain its rationale. (*) Support for incremental
learning and text classification over streams. (*) Efficient model for
addressing early risk detectio... | Pattern Recognition Letters, Elsevier, 2020 | 10.1016/j.patrec.2020.07.001 | null | cs.CL cs.IR cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A recently introduced classifier, called SS3, has shown to be well suited to
deal with early risk detection (ERD) problems on text streams. It obtained
state-of-the-art performance on early depression and anorexia detection on
Reddit in the CLEF's eRisk open tasks. SS3 was created to deal with ERD
problems naturally ... | [
{
"created": "Mon, 11 Nov 2019 22:06:40 GMT",
"version": "v1"
},
{
"created": "Wed, 6 May 2020 23:04:03 GMT",
"version": "v2"
}
] | 2020-07-14 | [
[
"Burdisso",
"Sergio G.",
""
],
[
"Errecalde",
"Marcelo",
""
],
[
"Montes-y-Gómez",
"Manuel",
""
]
] | A recently introduced classifier, called SS3, has shown to be well suited to deal with early risk detection (ERD) problems on text streams. It obtained state-of-the-art performance on early depression and anorexia detection on Reddit in the CLEF's eRisk open tasks. SS3 was created to deal with ERD problems naturally si... |
2204.03770 | Jazlyn Hellman | Jazlyn Hellman, Jiahao Chen, Md. Sami Uddin, Jinghui Cheng, Jin L.C.
Guo | Characterizing User Behaviors in Open-Source Software User Forums: An
Empirical Study | 15th International Conference on Cooperative and Human Aspects of
Softare Engineering | null | 10.1145/3528579.3529178 | null | cs.SE cs.HC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | User forums of Open Source Software (OSS) enable end-users to collaboratively
discuss problems concerning the OSS applications. Despite decades of research
on OSS, we know very little about how end-users engage with OSS communities on
these forums, in particular, the challenges that hinder their continuous and
meanin... | [
{
"created": "Thu, 7 Apr 2022 22:56:18 GMT",
"version": "v1"
}
] | 2022-04-11 | [
[
"Hellman",
"Jazlyn",
""
],
[
"Chen",
"Jiahao",
""
],
[
"Uddin",
"Md. Sami",
""
],
[
"Cheng",
"Jinghui",
""
],
[
"Guo",
"Jin L. C.",
""
]
] | User forums of Open Source Software (OSS) enable end-users to collaboratively discuss problems concerning the OSS applications. Despite decades of research on OSS, we know very little about how end-users engage with OSS communities on these forums, in particular, the challenges that hinder their continuous and meaningf... |
2110.08649 | Avishek Bose | Avishek Joey Bose, Marcus Brubaker, and Ivan Kobyzev | Equivariant Finite Normalizing Flows | Preprint | null | null | null | cs.LG cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Generative modeling seeks to uncover the underlying factors that give rise to
observed data that can often be modeled as the natural symmetries that manifest
themselves through invariances and equivariances to certain transformation
laws. However, current approaches to representing these symmetries are couched
in the... | [
{
"created": "Sat, 16 Oct 2021 20:16:00 GMT",
"version": "v1"
},
{
"created": "Fri, 12 Aug 2022 19:12:11 GMT",
"version": "v2"
}
] | 2022-08-16 | [
[
"Bose",
"Avishek Joey",
""
],
[
"Brubaker",
"Marcus",
""
],
[
"Kobyzev",
"Ivan",
""
]
] | Generative modeling seeks to uncover the underlying factors that give rise to observed data that can often be modeled as the natural symmetries that manifest themselves through invariances and equivariances to certain transformation laws. However, current approaches to representing these symmetries are couched in the f... |
2210.12539 | Tanya Shreedhar | Tanya Shreedhar, Sanjit K. Kaul and Roy D. Yates | ACP+: An Age Control Protocol for the Internet | Under submission. arXiv admin note: text overlap with
arXiv:2103.07797, arXiv:1811.03353 | null | null | null | cs.NI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We present ACP+, an age control protocol, which is a transport layer protocol
that regulates the rate at which update packets from a source are sent over the
Internet to a monitor. The source would like to keep the average age of sensed
information at the monitor to a minimum, given the network conditions.
Extensive ... | [
{
"created": "Sat, 22 Oct 2022 20:01:22 GMT",
"version": "v1"
}
] | 2022-10-25 | [
[
"Shreedhar",
"Tanya",
""
],
[
"Kaul",
"Sanjit K.",
""
],
[
"Yates",
"Roy D.",
""
]
] | We present ACP+, an age control protocol, which is a transport layer protocol that regulates the rate at which update packets from a source are sent over the Internet to a monitor. The source would like to keep the average age of sensed information at the monitor to a minimum, given the network conditions. Extensive ex... |
2406.08816 | Manish Kumar Singh | Manish Kumar Singh, Rajeev Yasarla, Hong Cai, Mingu Lee, Fatih Porikli | ToSA: Token Selective Attention for Efficient Vision Transformers | Accepted at CVPRW 2024 | null | null | null | cs.CV | http://creativecommons.org/licenses/by/4.0/ | In this paper, we propose a novel token selective attention approach, ToSA,
which can identify tokens that need to be attended as well as those that can
skip a transformer layer. More specifically, a token selector parses the
current attention maps and predicts the attention maps for the next layer,
which are then us... | [
{
"created": "Thu, 13 Jun 2024 05:17:21 GMT",
"version": "v1"
}
] | 2024-06-14 | [
[
"Singh",
"Manish Kumar",
""
],
[
"Yasarla",
"Rajeev",
""
],
[
"Cai",
"Hong",
""
],
[
"Lee",
"Mingu",
""
],
[
"Porikli",
"Fatih",
""
]
] | In this paper, we propose a novel token selective attention approach, ToSA, which can identify tokens that need to be attended as well as those that can skip a transformer layer. More specifically, a token selector parses the current attention maps and predicts the attention maps for the next layer, which are then used... |
2406.03253 | Sreeram Vennam | Akshit Sinha, Sreeram Vennam, Charu Sharma, Ponnurangam Kumaraguru | Generating Explanations for Cellular Neural Networks | null | null | null | null | cs.LG | http://creativecommons.org/licenses/by/4.0/ | Recent advancements in graph learning contributed to explaining predictions
generated by Graph Neural Networks. However, existing methodologies often fall
short when applied to real-world datasets. We introduce HOGE, a framework to
capture higher-order structures using cell complexes, which excel at modeling
higher-o... | [
{
"created": "Wed, 5 Jun 2024 13:31:30 GMT",
"version": "v1"
},
{
"created": "Thu, 6 Jun 2024 01:42:52 GMT",
"version": "v2"
},
{
"created": "Wed, 24 Jul 2024 18:22:22 GMT",
"version": "v3"
}
] | 2024-07-26 | [
[
"Sinha",
"Akshit",
""
],
[
"Vennam",
"Sreeram",
""
],
[
"Sharma",
"Charu",
""
],
[
"Kumaraguru",
"Ponnurangam",
""
]
] | Recent advancements in graph learning contributed to explaining predictions generated by Graph Neural Networks. However, existing methodologies often fall short when applied to real-world datasets. We introduce HOGE, a framework to capture higher-order structures using cell complexes, which excel at modeling higher-ord... |
2012.15355 | Peng Xu | Peng Xu, Dhruv Kumar, Wei Yang, Wenjie Zi, Keyi Tang, Chenyang Huang,
Jackie Chi Kit Cheung, Simon J.D. Prince, Yanshuai Cao | Optimizing Deeper Transformers on Small Datasets | Accepted at ACL 2021 main conference | null | null | null | cs.CL cs.LG | http://creativecommons.org/licenses/by-nc-sa/4.0/ | It is a common belief that training deep transformers from scratch requires
large datasets. Consequently, for small datasets, people usually use shallow
and simple additional layers on top of pre-trained models during fine-tuning.
This work shows that this does not always need to be the case: with proper
initializati... | [
{
"created": "Wed, 30 Dec 2020 22:53:49 GMT",
"version": "v1"
},
{
"created": "Wed, 19 May 2021 17:12:23 GMT",
"version": "v2"
},
{
"created": "Thu, 27 May 2021 16:53:14 GMT",
"version": "v3"
},
{
"created": "Mon, 31 May 2021 16:45:47 GMT",
"version": "v4"
}
] | 2021-06-01 | [
[
"Xu",
"Peng",
""
],
[
"Kumar",
"Dhruv",
""
],
[
"Yang",
"Wei",
""
],
[
"Zi",
"Wenjie",
""
],
[
"Tang",
"Keyi",
""
],
[
"Huang",
"Chenyang",
""
],
[
"Cheung",
"Jackie Chi Kit",
""
],
[
"Prince",
... | It is a common belief that training deep transformers from scratch requires large datasets. Consequently, for small datasets, people usually use shallow and simple additional layers on top of pre-trained models during fine-tuning. This work shows that this does not always need to be the case: with proper initialization... |
1905.07512 | Daniel Gordon | Daniel Gordon, Abhishek Kadian, Devi Parikh, Judy Hoffman, Dhruv Batra | SplitNet: Sim2Sim and Task2Task Transfer for Embodied Visual Navigation | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We propose SplitNet, a method for decoupling visual perception and policy
learning. By incorporating auxiliary tasks and selective learning of portions
of the model, we explicitly decompose the learning objectives for visual
navigation into perceiving the world and acting on that perception. We show
dramatic improvem... | [
{
"created": "Sat, 18 May 2019 00:57:19 GMT",
"version": "v1"
},
{
"created": "Tue, 21 May 2019 00:50:54 GMT",
"version": "v2"
},
{
"created": "Wed, 23 Oct 2019 19:07:16 GMT",
"version": "v3"
}
] | 2019-10-25 | [
[
"Gordon",
"Daniel",
""
],
[
"Kadian",
"Abhishek",
""
],
[
"Parikh",
"Devi",
""
],
[
"Hoffman",
"Judy",
""
],
[
"Batra",
"Dhruv",
""
]
] | We propose SplitNet, a method for decoupling visual perception and policy learning. By incorporating auxiliary tasks and selective learning of portions of the model, we explicitly decompose the learning objectives for visual navigation into perceiving the world and acting on that perception. We show dramatic improvemen... |
1705.04981 | Bing Li | Bing Li, Ning Chen, Yang Xu, Ulf Schlichtmann | On Timing Model Extraction and Hierarchical Statistical Timing Analysis | null | IEEE Transactions on Computer-Aided Design of Integrated Circuits
and Systems 32(3), 367-380, March 2013 | 10.1109/TCAD.2012.2228305 | null | cs.AR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we investigate the challenges to apply Statistical Static
Timing Analysis (SSTA) in hierarchical design flow, where modules supplied by
IP vendors are used to hide design details for IP protection and to reduce the
complexity of design and verification. For the three basic circuit types,
combinational,... | [
{
"created": "Sun, 14 May 2017 15:49:14 GMT",
"version": "v1"
}
] | 2017-05-16 | [
[
"Li",
"Bing",
""
],
[
"Chen",
"Ning",
""
],
[
"Xu",
"Yang",
""
],
[
"Schlichtmann",
"Ulf",
""
]
] | In this paper, we investigate the challenges to apply Statistical Static Timing Analysis (SSTA) in hierarchical design flow, where modules supplied by IP vendors are used to hide design details for IP protection and to reduce the complexity of design and verification. For the three basic circuit types, combinational, f... |
1706.08436 | Juan Garcia Torres | Juan Garcia-Torres, Diana Caro-Prieto | Image Processing in Floriculture Using a robotic Mobile Platform | 4 Pages, Paper made at Fundacion Universitaria Agraria de Colombia | null | null | null | cs.CY cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Colombia has a privileged geographical location which makes it a cornerstone
and equidistant point to all regional markets. The country has a great
ecological diversity and it is one of the largest suppliers of flowers for US.
Colombian flower companies have made innovations in the marketing process,
using methods to... | [
{
"created": "Mon, 26 Jun 2017 15:21:44 GMT",
"version": "v1"
}
] | 2017-06-27 | [
[
"Garcia-Torres",
"Juan",
""
],
[
"Caro-Prieto",
"Diana",
""
]
] | Colombia has a privileged geographical location which makes it a cornerstone and equidistant point to all regional markets. The country has a great ecological diversity and it is one of the largest suppliers of flowers for US. Colombian flower companies have made innovations in the marketing process, using methods to r... |
2003.06518 | Jie Ying Wu | Jie Ying Wu, Peter Kazanzides, Mathias Unberath | Leveraging Vision and Kinematics Data to Improve Realism of Biomechanic
Soft-tissue Simulation for Robotic Surgery | 12 pages, 4 figures, to be published in IJCARS IPCAI special edition
2020 | null | 10.1007/s11548-020-02139-6 | null | cs.RO cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Purpose Surgical simulations play an increasingly important role in surgeon
education and developing algorithms that enable robots to perform surgical
subtasks. To model anatomy, Finite Element Method (FEM) simulations have been
held as the gold standard for calculating accurate soft-tissue deformation.
Unfortunately... | [
{
"created": "Sat, 14 Mar 2020 00:16:08 GMT",
"version": "v1"
}
] | 2020-03-27 | [
[
"Wu",
"Jie Ying",
""
],
[
"Kazanzides",
"Peter",
""
],
[
"Unberath",
"Mathias",
""
]
] | Purpose Surgical simulations play an increasingly important role in surgeon education and developing algorithms that enable robots to perform surgical subtasks. To model anatomy, Finite Element Method (FEM) simulations have been held as the gold standard for calculating accurate soft-tissue deformation. Unfortunately, ... |
2402.14154 | Yiqiao Jin | Yiqiao Jin, Minje Choi, Gaurav Verma, Jindong Wang, Srijan Kumar | MM-Soc: Benchmarking Multimodal Large Language Models in Social Media
Platforms | In Proceedings of ACL 2024 | null | null | null | cs.CL cs.CV cs.CY | http://creativecommons.org/licenses/by/4.0/ | Social media platforms are hubs for multimodal information exchange,
encompassing text, images, and videos, making it challenging for machines to
comprehend the information or emotions associated with interactions in online
spaces. Multimodal Large Language Models (MLLMs) have emerged as a promising
solution to these... | [
{
"created": "Wed, 21 Feb 2024 22:27:40 GMT",
"version": "v1"
},
{
"created": "Wed, 24 Jul 2024 15:19:20 GMT",
"version": "v2"
}
] | 2024-07-25 | [
[
"Jin",
"Yiqiao",
""
],
[
"Choi",
"Minje",
""
],
[
"Verma",
"Gaurav",
""
],
[
"Wang",
"Jindong",
""
],
[
"Kumar",
"Srijan",
""
]
] | Social media platforms are hubs for multimodal information exchange, encompassing text, images, and videos, making it challenging for machines to comprehend the information or emotions associated with interactions in online spaces. Multimodal Large Language Models (MLLMs) have emerged as a promising solution to these c... |
2404.05128 | Nazifa Khan | Nazifa Azam Khan, Mikolaj Cieslak, Ian McQuillan | Importance of realism in procedurally-generated synthetic images for
deep learning: case studies in maize and canola | null | null | null | null | cs.CV cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Artificial neural networks are often used to identify features of crop
plants. However, training their models requires many annotated images, which
can be expensive and time-consuming to acquire. Procedural models of plants,
such as those developed with Lindenmayer-systems (L-systems) can be created to
produce visual... | [
{
"created": "Mon, 8 Apr 2024 01:08:41 GMT",
"version": "v1"
},
{
"created": "Wed, 15 May 2024 16:55:03 GMT",
"version": "v2"
}
] | 2024-05-16 | [
[
"Khan",
"Nazifa Azam",
""
],
[
"Cieslak",
"Mikolaj",
""
],
[
"McQuillan",
"Ian",
""
]
] | Artificial neural networks are often used to identify features of crop plants. However, training their models requires many annotated images, which can be expensive and time-consuming to acquire. Procedural models of plants, such as those developed with Lindenmayer-systems (L-systems) can be created to produce visually... |
1602.02509 | Wouter Bokslag | Wouter Bokslag, Manon de Vries | Evaluating e-voting: theory and practice | 19 pages | null | null | null | cs.CY cs.CR | http://creativecommons.org/licenses/by-sa/4.0/ | In the Netherlands as well as many other countries, the use of electronic
voting solutions is a recurrent topic of discussion. While electronic voting
certainly has advantages over paper voting, there are also important risks
involved. This paper presents an analysis of benefits and risks of electronic
voting, and sh... | [
{
"created": "Mon, 8 Feb 2016 09:47:04 GMT",
"version": "v1"
}
] | 2016-02-09 | [
[
"Bokslag",
"Wouter",
""
],
[
"de Vries",
"Manon",
""
]
] | In the Netherlands as well as many other countries, the use of electronic voting solutions is a recurrent topic of discussion. While electronic voting certainly has advantages over paper voting, there are also important risks involved. This paper presents an analysis of benefits and risks of electronic voting, and show... |
2010.11522 | Jiaoyan Chen | Ziheng Zhang and Jiaoyan Chen and Xi Chen and Hualuo Liu and Yuejia
Xiang and Bo Liu and Yefeng Zheng | An Industry Evaluation of Embedding-based Entity Alignment | accepted by COLING 2020 | null | null | null | cs.CL cs.AI cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Embedding-based entity alignment has been widely investigated in recent
years, but most proposed methods still rely on an ideal supervised learning
setting with a large number of unbiased seed mappings for training and
validation, which significantly limits their usage. In this study, we evaluate
those state-of-the-a... | [
{
"created": "Thu, 22 Oct 2020 08:33:58 GMT",
"version": "v1"
},
{
"created": "Sat, 7 Nov 2020 12:25:10 GMT",
"version": "v2"
}
] | 2020-11-10 | [
[
"Zhang",
"Ziheng",
""
],
[
"Chen",
"Jiaoyan",
""
],
[
"Chen",
"Xi",
""
],
[
"Liu",
"Hualuo",
""
],
[
"Xiang",
"Yuejia",
""
],
[
"Liu",
"Bo",
""
],
[
"Zheng",
"Yefeng",
""
]
] | Embedding-based entity alignment has been widely investigated in recent years, but most proposed methods still rely on an ideal supervised learning setting with a large number of unbiased seed mappings for training and validation, which significantly limits their usage. In this study, we evaluate those state-of-the-art... |
2106.07296 | Rafel Palliser Sans | Rafel Palliser-Sans | RRULES: An improvement of the RULES rule-based classifier | 6 pages, 2 algorithms | null | null | null | cs.LG cs.AI | http://creativecommons.org/licenses/by/4.0/ | RRULES is presented as an improvement and optimization over RULES, a simple
inductive learning algorithm for extracting IF-THEN rules from a set of
training examples. RRULES optimizes the algorithm by implementing a more
effective mechanism to detect irrelevant rules, at the same time that checks
the stopping conditi... | [
{
"created": "Mon, 14 Jun 2021 10:42:12 GMT",
"version": "v1"
}
] | 2021-06-15 | [
[
"Palliser-Sans",
"Rafel",
""
]
] | RRULES is presented as an improvement and optimization over RULES, a simple inductive learning algorithm for extracting IF-THEN rules from a set of training examples. RRULES optimizes the algorithm by implementing a more effective mechanism to detect irrelevant rules, at the same time that checks the stopping condition... |
1804.05966 | Kyle Kloster | Eric Horton, Kyle Kloster, Blair D. Sullivan | Subgraph centrality and walk-regularity | 23 pages, 2 figures, links to software repository | null | null | null | cs.SI physics.soc-ph | http://creativecommons.org/licenses/by/4.0/ | Matrix-based centrality measures have enjoyed significant popularity in
network analysis, in no small part due to our ability to rigorously analyze
their behavior as parameters vary. Recent work has considered the relationship
between subgraph centrality, which is defined using the matrix exponential
$f(x) = \exp(x)$... | [
{
"created": "Mon, 16 Apr 2018 22:56:46 GMT",
"version": "v1"
},
{
"created": "Mon, 29 Oct 2018 15:25:14 GMT",
"version": "v2"
},
{
"created": "Mon, 4 Feb 2019 22:27:40 GMT",
"version": "v3"
}
] | 2019-02-06 | [
[
"Horton",
"Eric",
""
],
[
"Kloster",
"Kyle",
""
],
[
"Sullivan",
"Blair D.",
""
]
] | Matrix-based centrality measures have enjoyed significant popularity in network analysis, in no small part due to our ability to rigorously analyze their behavior as parameters vary. Recent work has considered the relationship between subgraph centrality, which is defined using the matrix exponential $f(x) = \exp(x)$, ... |
1103.0087 | Ephzibah Ep | E.P.Ephzibah | Cost effective approach on feature selection using genetic algorithms
and fuzzy logic for diabetes diagnosis | null | null | null | null | cs.NE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A way to enhance the performance of a model that combines genetic algorithms
and fuzzy logic for feature selection and classification is proposed. Early
diagnosis of any disease with less cost is preferable. Diabetes is one such
disease. Diabetes has become the fourth leading cause of death in developed
countries and... | [
{
"created": "Tue, 1 Mar 2011 06:10:18 GMT",
"version": "v1"
}
] | 2011-03-02 | [
[
"Ephzibah",
"E. P.",
""
]
] | A way to enhance the performance of a model that combines genetic algorithms and fuzzy logic for feature selection and classification is proposed. Early diagnosis of any disease with less cost is preferable. Diabetes is one such disease. Diabetes has become the fourth leading cause of death in developed countries and t... |
1308.6807 | Joohwan Kim | Joohwan Kim and R. Srikant | Achieving the Optimal Steaming Capacity and Delay Using Random Regular
Digraphs in P2P Networks | null | null | null | null | cs.NI cs.MM | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In earlier work, we showed that it is possible to achieve $O(\log N)$
streaming delay with high probability in a peer-to-peer network, where each
peer has as little as four neighbors, while achieving any arbitrary fraction of
the maximum possible streaming rate. However, the constant in the $O(log N)$
delay term beco... | [
{
"created": "Fri, 30 Aug 2013 17:49:55 GMT",
"version": "v1"
}
] | 2013-09-02 | [
[
"Kim",
"Joohwan",
""
],
[
"Srikant",
"R.",
""
]
] | In earlier work, we showed that it is possible to achieve $O(\log N)$ streaming delay with high probability in a peer-to-peer network, where each peer has as little as four neighbors, while achieving any arbitrary fraction of the maximum possible streaming rate. However, the constant in the $O(log N)$ delay term become... |
2301.00621 | Dor Tsur | Dor Tsur, Ziv Aharoni, Ziv Goldfeld and Haim Permuter | Data-Driven Optimization of Directed Information over Discrete Alphabets | null | null | null | null | cs.IT cs.LG math.IT | http://creativecommons.org/licenses/by/4.0/ | Directed information (DI) is a fundamental measure for the study and analysis
of sequential stochastic models. In particular, when optimized over input
distributions it characterizes the capacity of general communication channels.
However, analytic computation of DI is typically intractable and existing
optimization ... | [
{
"created": "Mon, 2 Jan 2023 12:25:40 GMT",
"version": "v1"
}
] | 2023-01-03 | [
[
"Tsur",
"Dor",
""
],
[
"Aharoni",
"Ziv",
""
],
[
"Goldfeld",
"Ziv",
""
],
[
"Permuter",
"Haim",
""
]
] | Directed information (DI) is a fundamental measure for the study and analysis of sequential stochastic models. In particular, when optimized over input distributions it characterizes the capacity of general communication channels. However, analytic computation of DI is typically intractable and existing optimization te... |
1908.08044 | Jian Yao | Jian Yao and Ahmad Al-Dahle | Coarse-to-fine Optimization for Speech Enhancement | null | Interspeech 2019 | null | null | cs.SD cs.LG eess.AS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we propose the coarse-to-fine optimization for the task of
speech enhancement. Cosine similarity loss [1] has proven to be an effective
metric to measure similarity of speech signals. However, due to the large
variance of the enhanced speech with even the same cosine similarity loss in
high dimensional... | [
{
"created": "Wed, 21 Aug 2019 17:51:29 GMT",
"version": "v1"
}
] | 2019-08-23 | [
[
"Yao",
"Jian",
""
],
[
"Al-Dahle",
"Ahmad",
""
]
] | In this paper, we propose the coarse-to-fine optimization for the task of speech enhancement. Cosine similarity loss [1] has proven to be an effective metric to measure similarity of speech signals. However, due to the large variance of the enhanced speech with even the same cosine similarity loss in high dimensional s... |
2111.04308 | Cedric Cook | Cedric Cook | Learning Context-Aware Representations of Subtrees | 36 pages, 12 Figures. This work was carried out as a Master Thesis at
Klarna Bank AB, under supervision of Stefan Magureanu | null | null | null | cs.LG | http://creativecommons.org/licenses/by-sa/4.0/ | This thesis tackles the problem of learning efficient representations of
complex, structured data with a natural application to web page and element
classification. We hypothesise that the context around the element inside the
web page is of high value to the problem and is currently under exploited. This
thesis aims... | [
{
"created": "Mon, 8 Nov 2021 07:43:14 GMT",
"version": "v1"
}
] | 2021-11-09 | [
[
"Cook",
"Cedric",
""
]
] | This thesis tackles the problem of learning efficient representations of complex, structured data with a natural application to web page and element classification. We hypothesise that the context around the element inside the web page is of high value to the problem and is currently under exploited. This thesis aims t... |
2402.17358 | Xinyu Lu | Xinyu Lu, Bowen Yu, Yaojie Lu, Hongyu Lin, Haiyang Yu, Le Sun, Xianpei
Han, Yongbin Li | SoFA: Shielded On-the-fly Alignment via Priority Rule Following | null | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The alignment problem in Large Language Models (LLMs) involves adapting them
to the broad spectrum of human values. This requirement challenges existing
alignment methods due to diversity of preferences and regulatory standards.
This paper introduces a novel alignment paradigm, priority rule following,
which defines ... | [
{
"created": "Tue, 27 Feb 2024 09:52:27 GMT",
"version": "v1"
}
] | 2024-02-28 | [
[
"Lu",
"Xinyu",
""
],
[
"Yu",
"Bowen",
""
],
[
"Lu",
"Yaojie",
""
],
[
"Lin",
"Hongyu",
""
],
[
"Yu",
"Haiyang",
""
],
[
"Sun",
"Le",
""
],
[
"Han",
"Xianpei",
""
],
[
"Li",
"Yongbin",
""
]... | The alignment problem in Large Language Models (LLMs) involves adapting them to the broad spectrum of human values. This requirement challenges existing alignment methods due to diversity of preferences and regulatory standards. This paper introduces a novel alignment paradigm, priority rule following, which defines ru... |
2006.01080 | Alina Karakanta | Alina Karakanta, Matteo Negri, Marco Turchi | Is 42 the Answer to Everything in Subtitling-oriented Speech
Translation? | Accepted at IWSLT 2020 | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Subtitling is becoming increasingly important for disseminating information,
given the enormous amounts of audiovisual content becoming available daily.
Although Neural Machine Translation (NMT) can speed up the process of
translating audiovisual content, large manual effort is still required for
transcribing the sou... | [
{
"created": "Mon, 1 Jun 2020 17:02:28 GMT",
"version": "v1"
}
] | 2020-06-02 | [
[
"Karakanta",
"Alina",
""
],
[
"Negri",
"Matteo",
""
],
[
"Turchi",
"Marco",
""
]
] | Subtitling is becoming increasingly important for disseminating information, given the enormous amounts of audiovisual content becoming available daily. Although Neural Machine Translation (NMT) can speed up the process of translating audiovisual content, large manual effort is still required for transcribing the sourc... |
1606.03507 | Tahir Hameed | Tahir Hameed and Bobby Swar | Social value and information quality in online health information search | Research-in-progress ISBN# 978-0-646-95337-3 Presented at the
Australasian Conference on Information Systems 2015 (arXiv:1605.01032) | null | null | ACIS/2015/196 | cs.CY | http://creativecommons.org/licenses/by-nc-sa/4.0/ | This paper extends and validates a model of value-driven online healthcare
information search in online shared contexts. Perceived value is an important
factor behind users' decisions concerning search, consumption and reuse of
products and services. The role of utilitarian, hedonic and epistemic value of
information... | [
{
"created": "Sat, 11 Jun 2016 00:12:51 GMT",
"version": "v1"
}
] | 2016-06-14 | [
[
"Hameed",
"Tahir",
""
],
[
"Swar",
"Bobby",
""
]
] | This paper extends and validates a model of value-driven online healthcare information search in online shared contexts. Perceived value is an important factor behind users' decisions concerning search, consumption and reuse of products and services. The role of utilitarian, hedonic and epistemic value of information i... |
2103.04942 | Ioannis Exarchos | Ioannis Exarchos, Karen Wang, Brian H. Do, Fabio Stroppa, Margaret M.
Coad, Allison M. Okamura, and C. Karen Liu | Task-Specific Design Optimization and Fabrication for Inflated-Beam Soft
Robots with Growable Discrete Joints | null | null | null | null | cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Soft robot serial chain manipulators with the capability for growth,
stiffness control, and discrete joints have the potential to approach the
dexterity of traditional robot arms, while improving safety, lowering cost, and
providing an increased workspace, with potential application in home
environments. This paper p... | [
{
"created": "Mon, 8 Mar 2021 18:00:27 GMT",
"version": "v1"
},
{
"created": "Wed, 22 Sep 2021 17:10:42 GMT",
"version": "v2"
}
] | 2021-09-23 | [
[
"Exarchos",
"Ioannis",
""
],
[
"Wang",
"Karen",
""
],
[
"Do",
"Brian H.",
""
],
[
"Stroppa",
"Fabio",
""
],
[
"Coad",
"Margaret M.",
""
],
[
"Okamura",
"Allison M.",
""
],
[
"Liu",
"C. Karen",
""
]
] | Soft robot serial chain manipulators with the capability for growth, stiffness control, and discrete joints have the potential to approach the dexterity of traditional robot arms, while improving safety, lowering cost, and providing an increased workspace, with potential application in home environments. This paper pre... |
1711.06964 | Amitabha Roy | Amitabha Roy, Subramanya R. Dulloor | Cyclone: High Availability for Persistent Key Value Stores | null | null | null | null | cs.DC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Persistent key value stores are an important component of many distributed
data serving solutions with innovations targeted at taking advantage of growing
flash speeds. Unfortunately their performance is hampered by the need to
maintain and replicate a write ahead log to guarantee availability in the face
of machine ... | [
{
"created": "Sun, 19 Nov 2017 04:07:34 GMT",
"version": "v1"
}
] | 2017-11-21 | [
[
"Roy",
"Amitabha",
""
],
[
"Dulloor",
"Subramanya R.",
""
]
] | Persistent key value stores are an important component of many distributed data serving solutions with innovations targeted at taking advantage of growing flash speeds. Unfortunately their performance is hampered by the need to maintain and replicate a write ahead log to guarantee availability in the face of machine an... |
1405.0320 | Jan Verschelde | Danko Adrovic and Jan Verschelde | Computing all Affine Solution Sets of Binomial Systems | 4 page extended abstract accepted by EACA 2014, a conference on
Computer Algebra and its Applications | null | null | null | cs.SC cs.MS math.AG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | To compute solutions of sparse polynomial systems efficiently we have to
exploit the structure of their Newton polytopes. While the application of
polyhedral methods naturally excludes solutions with zero components, an
irreducible decomposition of a variety is typically understood in affine space,
including also tho... | [
{
"created": "Thu, 1 May 2014 23:00:24 GMT",
"version": "v1"
}
] | 2014-05-05 | [
[
"Adrovic",
"Danko",
""
],
[
"Verschelde",
"Jan",
""
]
] | To compute solutions of sparse polynomial systems efficiently we have to exploit the structure of their Newton polytopes. While the application of polyhedral methods naturally excludes solutions with zero components, an irreducible decomposition of a variety is typically understood in affine space, including also those... |
1710.04578 | Dongyao Chen | Dongyao Chen, Kyong-Tak Cho, Kang G. Shin | Mobile IMUs Reveal Driver's Identity From Vehicle Turns | 15 pages, 15 figures | null | null | null | cs.CR cs.CY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | As vehicle maneuver data becomes abundant for assisted or autonomous driving,
their implication of privacy invasion/leakage has become an increasing concern.
In particular, the surface for fingerprinting a driver will expand
significantly if the driver's identity can be linked with the data collected
from his mobile ... | [
{
"created": "Thu, 12 Oct 2017 15:49:35 GMT",
"version": "v1"
}
] | 2017-10-13 | [
[
"Chen",
"Dongyao",
""
],
[
"Cho",
"Kyong-Tak",
""
],
[
"Shin",
"Kang G.",
""
]
] | As vehicle maneuver data becomes abundant for assisted or autonomous driving, their implication of privacy invasion/leakage has become an increasing concern. In particular, the surface for fingerprinting a driver will expand significantly if the driver's identity can be linked with the data collected from his mobile or... |
2305.17581 | Mher Safaryan | Mher Safaryan and Alexandra Peste and Dan Alistarh | Knowledge Distillation Performs Partial Variance Reduction | 15+22 pages, NeurIPS 2023 | null | null | null | cs.LG math.OC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Knowledge distillation is a popular approach for enhancing the performance of
''student'' models, with lower representational capacity, by taking advantage
of more powerful ''teacher'' models. Despite its apparent simplicity and
widespread use, the underlying mechanics behind knowledge distillation (KD) are
still not... | [
{
"created": "Sat, 27 May 2023 21:25:55 GMT",
"version": "v1"
},
{
"created": "Fri, 8 Dec 2023 22:08:09 GMT",
"version": "v2"
}
] | 2023-12-12 | [
[
"Safaryan",
"Mher",
""
],
[
"Peste",
"Alexandra",
""
],
[
"Alistarh",
"Dan",
""
]
] | Knowledge distillation is a popular approach for enhancing the performance of ''student'' models, with lower representational capacity, by taking advantage of more powerful ''teacher'' models. Despite its apparent simplicity and widespread use, the underlying mechanics behind knowledge distillation (KD) are still not f... |
2111.02120 | Raheel Qader | Melissa Ailem, Jinghsu Liu, Raheel Qader | Lingua Custodia's participation at the WMT 2021 Machine Translation
using Terminologies shared task | null | null | null | null | cs.CL cs.AI | http://creativecommons.org/licenses/by/4.0/ | This paper describes Lingua Custodia's submission to the WMT21 shared task on
machine translation using terminologies. We consider three directions, namely
English to French, Russian, and Chinese. We rely on a Transformer-based
architecture as a building block, and we explore a method which introduces two
main change... | [
{
"created": "Wed, 3 Nov 2021 10:36:32 GMT",
"version": "v1"
}
] | 2021-11-04 | [
[
"Ailem",
"Melissa",
""
],
[
"Liu",
"Jinghsu",
""
],
[
"Qader",
"Raheel",
""
]
] | This paper describes Lingua Custodia's submission to the WMT21 shared task on machine translation using terminologies. We consider three directions, namely English to French, Russian, and Chinese. We rely on a Transformer-based architecture as a building block, and we explore a method which introduces two main changes ... |
1404.4560 | Lane A. Hemaspaandra | Edith Hemaspaandra and Lane A. Hemaspaandra and Henning Schnoor | A Control Dichotomy for Pure Scoring Rules | A shorter version of this paper will appear in the proceedings of the
Twenty-Eighth AAAI Conference on Artificial Intelligence (AAAI 2014) | null | null | null | cs.GT cs.CC cs.MA | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Scoring systems are an extremely important class of election systems. A
length-$m$ (so-called) scoring vector applies only to $m$-candidate elections.
To handle general elections, one must use a family of vectors, one per length.
The most elegant approach to making sure such families are "family-like" is the
recently... | [
{
"created": "Thu, 17 Apr 2014 15:38:54 GMT",
"version": "v1"
}
] | 2014-04-18 | [
[
"Hemaspaandra",
"Edith",
""
],
[
"Hemaspaandra",
"Lane A.",
""
],
[
"Schnoor",
"Henning",
""
]
] | Scoring systems are an extremely important class of election systems. A length-$m$ (so-called) scoring vector applies only to $m$-candidate elections. To handle general elections, one must use a family of vectors, one per length. The most elegant approach to making sure such families are "family-like" is the recently i... |
0704.3904 | Fabien Mathieu | Anh-Tuan Gai (INRIA Rocquencourt), Dmitry Lebedev (FT R&D), Fabien
Mathieu (FT R&D), Fabien De Montgolfier (LIAFA), Julien Reynier (LIENS),
Laurent Viennot (INRIA Rocquencourt) | Acyclic Preference Systems in P2P Networks | null | null | null | null | cs.DS cs.GT | null | In this work we study preference systems natural for the Peer-to-Peer
paradigm. Most of them fall in three categories: global, symmetric and
complementary. All these systems share an acyclicity property. As a
consequence, they admit a stable (or Pareto efficient) configuration, where no
participant can collaborate wi... | [
{
"created": "Mon, 30 Apr 2007 09:26:39 GMT",
"version": "v1"
},
{
"created": "Wed, 2 May 2007 13:07:31 GMT",
"version": "v2"
}
] | 2007-05-23 | [
[
"Gai",
"Anh-Tuan",
"",
"INRIA Rocquencourt"
],
[
"Lebedev",
"Dmitry",
"",
"FT R&D"
],
[
"Mathieu",
"Fabien",
"",
"FT R&D"
],
[
"De Montgolfier",
"Fabien",
"",
"LIAFA"
],
[
"Reynier",
"Julien",
"",
"LIENS"
],
[
... | In this work we study preference systems natural for the Peer-to-Peer paradigm. Most of them fall in three categories: global, symmetric and complementary. All these systems share an acyclicity property. As a consequence, they admit a stable (or Pareto efficient) configuration, where no participant can collaborate with... |
2101.09849 | Roozbeh Yousefzadeh | Roozbeh Yousefzadeh | Deep Learning Generalization and the Convex Hull of Training Sets | null | null | null | null | cs.LG math.DG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We study the generalization of deep learning models in relation to the convex
hull of their training sets. A trained image classifier basically partitions
its domain via decision boundaries and assigns a class to each of those
partitions. The location of decision boundaries inside the convex hull of
training set can ... | [
{
"created": "Mon, 25 Jan 2021 01:54:02 GMT",
"version": "v1"
}
] | 2021-01-26 | [
[
"Yousefzadeh",
"Roozbeh",
""
]
] | We study the generalization of deep learning models in relation to the convex hull of their training sets. A trained image classifier basically partitions its domain via decision boundaries and assigns a class to each of those partitions. The location of decision boundaries inside the convex hull of training set can be... |
1701.03826 | Yu Zhang | Yu Zhang, Kanat Tangwongsan and Srikanta Tirthapura | Streaming k-Means Clustering with Fast Queries | null | null | null | null | cs.DS cs.SE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We present methods for k-means clustering on a stream with a focus on
providing fast responses to clustering queries. Compared to the current
state-of-the-art, our methods provide substantial improvement in the query time
for cluster centers while retaining the desirable properties of provably small
approximation err... | [
{
"created": "Fri, 13 Jan 2017 20:21:08 GMT",
"version": "v1"
},
{
"created": "Thu, 6 Dec 2018 20:28:18 GMT",
"version": "v2"
}
] | 2018-12-10 | [
[
"Zhang",
"Yu",
""
],
[
"Tangwongsan",
"Kanat",
""
],
[
"Tirthapura",
"Srikanta",
""
]
] | We present methods for k-means clustering on a stream with a focus on providing fast responses to clustering queries. Compared to the current state-of-the-art, our methods provide substantial improvement in the query time for cluster centers while retaining the desirable properties of provably small approximation error... |
2212.04264 | Kaan Ak\c{s}it | Ahmet G\"uzel, Jeanne Beyazian, Praneeth Chakravarthula and Kaan
Ak\c{s}it | ChromaCorrect: Prescription Correction in Virtual Reality Headsets
through Perceptual Guidance | 12 pages, 9 figures, 1 table, 1 listing | null | null | null | cs.HC cs.GR cs.LG | http://creativecommons.org/licenses/by-nc-nd/4.0/ | A large portion of today's world population suffer from vision impairments
and wear prescription eyeglasses. However, eyeglasses causes additional bulk
and discomfort when used with augmented and virtual reality headsets, thereby
negatively impacting the viewer's visual experience. In this work, we remedy
the usage o... | [
{
"created": "Thu, 8 Dec 2022 13:30:17 GMT",
"version": "v1"
}
] | 2022-12-09 | [
[
"Güzel",
"Ahmet",
""
],
[
"Beyazian",
"Jeanne",
""
],
[
"Chakravarthula",
"Praneeth",
""
],
[
"Akşit",
"Kaan",
""
]
] | A large portion of today's world population suffer from vision impairments and wear prescription eyeglasses. However, eyeglasses causes additional bulk and discomfort when used with augmented and virtual reality headsets, thereby negatively impacting the viewer's visual experience. In this work, we remedy the usage of ... |
2105.06186 | EPTCS | Nicolas Behr (Universit\'e Paris Cit\'e, IRIF, CNRS), Joachim Kock
(Universitat Aut\`onoma de Barcelona & Centre de Recerca Matem\`atica) | Tracelet Hopf Algebras and Decomposition Spaces (Extended Abstract) | In Proceedings ACT 2021, arXiv:2211.01102 | EPTCS 372, 2022, pp. 323-337 | 10.4204/EPTCS.372.23 | null | cs.LO math.CT | http://creativecommons.org/licenses/by/4.0/ | Tracelets are the intrinsic carriers of causal information in categorical
rewriting systems. In this work, we assemble tracelets into a symmetric
monoidal decomposition space, inducing a cocommutative Hopf algebra of
tracelets. This Hopf algebra captures important combinatorial and algebraic
aspects of rewriting theo... | [
{
"created": "Thu, 13 May 2021 10:59:16 GMT",
"version": "v1"
},
{
"created": "Tue, 13 Jul 2021 17:36:49 GMT",
"version": "v2"
},
{
"created": "Thu, 3 Nov 2022 14:20:47 GMT",
"version": "v3"
}
] | 2022-11-04 | [
[
"Behr",
"Nicolas",
"",
"Université Paris Cité, IRIF, CNRS"
],
[
"Kock",
"Joachim",
"",
"Universitat Autònoma de Barcelona & Centre de Recerca Matemàtica"
]
] | Tracelets are the intrinsic carriers of causal information in categorical rewriting systems. In this work, we assemble tracelets into a symmetric monoidal decomposition space, inducing a cocommutative Hopf algebra of tracelets. This Hopf algebra captures important combinatorial and algebraic aspects of rewriting theory... |
1909.10869 | Sam Thompson | Dominik D. Freydenberger and Sam M. Thompson | Dynamic Complexity of Document Spanners | null | null | null | null | cs.LO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The present paper investigates the dynamic complexity of document spanners, a
formal framework for information extraction introduced by Fagin, Kimelfeld,
Reiss, and Vansummeren (JACM 2015). We first look at the class of regular
spanners and prove that any regular spanner can be maintained in the dynamic
complexity cl... | [
{
"created": "Tue, 24 Sep 2019 13:13:37 GMT",
"version": "v1"
},
{
"created": "Thu, 9 Jan 2020 14:01:43 GMT",
"version": "v2"
}
] | 2020-01-10 | [
[
"Freydenberger",
"Dominik D.",
""
],
[
"Thompson",
"Sam M.",
""
]
] | The present paper investigates the dynamic complexity of document spanners, a formal framework for information extraction introduced by Fagin, Kimelfeld, Reiss, and Vansummeren (JACM 2015). We first look at the class of regular spanners and prove that any regular spanner can be maintained in the dynamic complexity clas... |
2006.07563 | Huthaifa I. Ashqar | Huthaifa I. Ashqar, Mohammed Elhenawy, and Hesham A.Rakha | Modeling bike counts in a bike-sharing system considering the effect of
weather conditions | Published in Case Studies on Transport Policy (Volume 7, Issue 2,
June 2019, Pages 261-268) | Case studies on transport policy 7, no. 2 (2019): 261-268 | 10.1016/j.cstp.2019.02.011 | null | cs.CY cs.LG physics.soc-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The paper develops a method that quantifies the effect of weather conditions
on the prediction of bike station counts in the San Francisco Bay Area Bike
Share System. The Random Forest technique was used to rank the predictors that
were then used to develop a regression model using a guided forward step-wise
regressi... | [
{
"created": "Sat, 13 Jun 2020 05:32:32 GMT",
"version": "v1"
}
] | 2020-06-16 | [
[
"Ashqar",
"Huthaifa I.",
""
],
[
"Elhenawy",
"Mohammed",
""
],
[
"Rakha",
"Hesham A.",
""
]
] | The paper develops a method that quantifies the effect of weather conditions on the prediction of bike station counts in the San Francisco Bay Area Bike Share System. The Random Forest technique was used to rank the predictors that were then used to develop a regression model using a guided forward step-wise regression... |
1910.05895 | Julian Salazar | Toan Q. Nguyen and Julian Salazar | Transformers without Tears: Improving the Normalization of
Self-Attention | Accepted to IWSLT 2019 (oral); code is available at
https://github.com/tnq177/transformers_without_tears | null | 10.5281/zenodo.3525484 | null | cs.CL cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We evaluate three simple, normalization-centric changes to improve
Transformer training. First, we show that pre-norm residual connections
(PreNorm) and smaller initializations enable warmup-free, validation-based
training with large learning rates. Second, we propose $\ell_2$ normalization
with a single scale parame... | [
{
"created": "Mon, 14 Oct 2019 02:23:43 GMT",
"version": "v1"
},
{
"created": "Mon, 30 Dec 2019 03:53:04 GMT",
"version": "v2"
}
] | 2020-01-01 | [
[
"Nguyen",
"Toan Q.",
""
],
[
"Salazar",
"Julian",
""
]
] | We evaluate three simple, normalization-centric changes to improve Transformer training. First, we show that pre-norm residual connections (PreNorm) and smaller initializations enable warmup-free, validation-based training with large learning rates. Second, we propose $\ell_2$ normalization with a single scale paramete... |
2204.11041 | Meng Xing | Meng Xing, Zhiyong Feng, Yong Su and Changjae Oh | Learning by Erasing: Conditional Entropy based Transferable
Out-Of-Distribution Detection | update new experimental results | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Out-of-distribution (OOD) detection is essential to handle the distribution
shifts between training and test scenarios. For a new in-distribution (ID)
dataset, existing methods require retraining to capture the dataset-specific
feature representation or data distribution. In this paper, we propose a deep
generative m... | [
{
"created": "Sat, 23 Apr 2022 10:19:58 GMT",
"version": "v1"
},
{
"created": "Mon, 7 Aug 2023 22:47:07 GMT",
"version": "v2"
},
{
"created": "Wed, 27 Mar 2024 14:29:27 GMT",
"version": "v3"
}
] | 2024-03-28 | [
[
"Xing",
"Meng",
""
],
[
"Feng",
"Zhiyong",
""
],
[
"Su",
"Yong",
""
],
[
"Oh",
"Changjae",
""
]
] | Out-of-distribution (OOD) detection is essential to handle the distribution shifts between training and test scenarios. For a new in-distribution (ID) dataset, existing methods require retraining to capture the dataset-specific feature representation or data distribution. In this paper, we propose a deep generative mod... |
2211.07343 | Pengyu Cheng | Pengyu Cheng, Ruineng Li | Replacing Language Model for Style Transfer | null | null | null | null | cs.CL cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We introduce replacing language model (RLM), a sequence-to-sequence language
modeling framework for text style transfer (TST). Our method autoregressively
replaces each token of the source sentence with a text span that has a similar
meaning but in the target style. The new span is generated via a
non-autoregressive ... | [
{
"created": "Mon, 14 Nov 2022 13:35:55 GMT",
"version": "v1"
},
{
"created": "Wed, 28 Feb 2024 12:51:09 GMT",
"version": "v2"
}
] | 2024-02-29 | [
[
"Cheng",
"Pengyu",
""
],
[
"Li",
"Ruineng",
""
]
] | We introduce replacing language model (RLM), a sequence-to-sequence language modeling framework for text style transfer (TST). Our method autoregressively replaces each token of the source sentence with a text span that has a similar meaning but in the target style. The new span is generated via a non-autoregressive ma... |
2009.10689 | Vasiliy Gurianov | Vasyliy I. Gurianov | Simulation model of spacetime with the Minkowski metric | 8 pages, 5 figures, 2 tables | null | null | null | cs.CE cs.MA | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we propose a simulation model of spacetime as a discrete model
of physical space. The model is based on the ideas of Stephen Wolfram and uses
non-numerical modelling. The simulation model is described as an ontology. We
use object-oriented simulation (OOS), but the model is also suitable for
agent-base... | [
{
"created": "Tue, 22 Sep 2020 17:03:38 GMT",
"version": "v1"
}
] | 2020-09-23 | [
[
"Gurianov",
"Vasyliy I.",
""
]
] | In this paper, we propose a simulation model of spacetime as a discrete model of physical space. The model is based on the ideas of Stephen Wolfram and uses non-numerical modelling. The simulation model is described as an ontology. We use object-oriented simulation (OOS), but the model is also suitable for agent-based ... |
1510.04747 | Yang Shi | Animashree Anandkumar, Prateek Jain, Yang Shi, U. N. Niranjan | Tensor vs Matrix Methods: Robust Tensor Decomposition under Block Sparse
Perturbations | null | null | null | null | cs.LG cs.IT math.IT stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Robust tensor CP decomposition involves decomposing a tensor into low rank
and sparse components. We propose a novel non-convex iterative algorithm with
guaranteed recovery. It alternates between low-rank CP decomposition through
gradient ascent (a variant of the tensor power method), and hard thresholding
of the res... | [
{
"created": "Thu, 15 Oct 2015 23:40:13 GMT",
"version": "v1"
},
{
"created": "Wed, 21 Oct 2015 00:53:13 GMT",
"version": "v2"
},
{
"created": "Thu, 5 Nov 2015 05:02:03 GMT",
"version": "v3"
},
{
"created": "Sat, 14 Nov 2015 21:54:08 GMT",
"version": "v4"
},
{
"cr... | 2016-04-28 | [
[
"Anandkumar",
"Animashree",
""
],
[
"Jain",
"Prateek",
""
],
[
"Shi",
"Yang",
""
],
[
"Niranjan",
"U. N.",
""
]
] | Robust tensor CP decomposition involves decomposing a tensor into low rank and sparse components. We propose a novel non-convex iterative algorithm with guaranteed recovery. It alternates between low-rank CP decomposition through gradient ascent (a variant of the tensor power method), and hard thresholding of the resid... |
1906.02123 | Hongming Zhang | Hongming Zhang, Hantian Ding, Yangqiu Song | SP-10K: A Large-scale Evaluation Set for Selectional Preference
Acquisition | Accepted by ACL 2019 | null | null | null | cs.CL cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Selectional Preference (SP) is a commonly observed language phenomenon and
proved to be useful in many natural language processing tasks. To provide a
better evaluation method for SP models, we introduce SP-10K, a large-scale
evaluation set that provides human ratings for the plausibility of 10,000 SP
pairs over five... | [
{
"created": "Tue, 14 May 2019 08:32:39 GMT",
"version": "v1"
}
] | 2019-06-06 | [
[
"Zhang",
"Hongming",
""
],
[
"Ding",
"Hantian",
""
],
[
"Song",
"Yangqiu",
""
]
] | Selectional Preference (SP) is a commonly observed language phenomenon and proved to be useful in many natural language processing tasks. To provide a better evaluation method for SP models, we introduce SP-10K, a large-scale evaluation set that provides human ratings for the plausibility of 10,000 SP pairs over five S... |
2405.14567 | Adibvafa Fallahpour | Adibvafa Fallahpour, Mahshid Alinoori, Arash Afkanpour, Amrit Krishnan | EHRMamba: Towards Generalizable and Scalable Foundation Models for
Electronic Health Records | 17 Pages, 4 Figures | null | null | null | cs.LG | http://creativecommons.org/licenses/by/4.0/ | Transformers have significantly advanced the modeling of Electronic Health
Records (EHR), yet their deployment in real-world healthcare is limited by
several key challenges. Firstly, the quadratic computational cost and
insufficient context length of these models pose significant obstacles for
hospitals in processing... | [
{
"created": "Thu, 23 May 2024 13:43:29 GMT",
"version": "v1"
},
{
"created": "Fri, 24 May 2024 02:22:21 GMT",
"version": "v2"
}
] | 2024-05-27 | [
[
"Fallahpour",
"Adibvafa",
""
],
[
"Alinoori",
"Mahshid",
""
],
[
"Afkanpour",
"Arash",
""
],
[
"Krishnan",
"Amrit",
""
]
] | Transformers have significantly advanced the modeling of Electronic Health Records (EHR), yet their deployment in real-world healthcare is limited by several key challenges. Firstly, the quadratic computational cost and insufficient context length of these models pose significant obstacles for hospitals in processing t... |
2006.02887 | Francesco Dagnino | Francesco Dagnino | Foundations of regular coinduction | null | Logical Methods in Computer Science, Volume 17, Issue 4 (October
1, 2021) lmcs:6553 | 10.46298/lmcs-17(4:2)2021 | null | cs.LO | http://creativecommons.org/licenses/by/4.0/ | Inference systems are a widespread framework used to define possibly
recursive predicates by means of inference rules. They allow both inductive and
coinductive interpretations that are fairly well-studied. In this paper, we
consider a middle way interpretation, called regular, which combines advantages
of both appro... | [
{
"created": "Thu, 4 Jun 2020 14:33:39 GMT",
"version": "v1"
},
{
"created": "Thu, 11 Jun 2020 12:45:07 GMT",
"version": "v2"
},
{
"created": "Wed, 5 May 2021 15:30:23 GMT",
"version": "v3"
},
{
"created": "Thu, 6 May 2021 10:45:38 GMT",
"version": "v4"
},
{
"crea... | 2023-06-22 | [
[
"Dagnino",
"Francesco",
""
]
] | Inference systems are a widespread framework used to define possibly recursive predicates by means of inference rules. They allow both inductive and coinductive interpretations that are fairly well-studied. In this paper, we consider a middle way interpretation, called regular, which combines advantages of both approac... |
2405.13075 | Shunyang Zhang | S. Zhang, S. Wang, H. Miao, H. Chen, C. Fan, J. Zhang | Score-CDM: Score-Weighted Convolutional Diffusion Model for Multivariate
Time Series Imputation | null | null | null | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Multivariant time series (MTS) data are usually incomplete in real scenarios,
and imputing the incomplete MTS is practically important to facilitate various
time series mining tasks. Recently, diffusion model-based MTS imputation
methods have achieved promising results by utilizing CNN or attention
mechanisms for tem... | [
{
"created": "Tue, 21 May 2024 02:00:55 GMT",
"version": "v1"
}
] | 2024-05-24 | [
[
"Zhang",
"S.",
""
],
[
"Wang",
"S.",
""
],
[
"Miao",
"H.",
""
],
[
"Chen",
"H.",
""
],
[
"Fan",
"C.",
""
],
[
"Zhang",
"J.",
""
]
] | Multivariant time series (MTS) data are usually incomplete in real scenarios, and imputing the incomplete MTS is practically important to facilitate various time series mining tasks. Recently, diffusion model-based MTS imputation methods have achieved promising results by utilizing CNN or attention mechanisms for tempo... |
2202.06649 | Zhensu Sun | Zhensu Sun, Li Li, Yan Liu, Xiaoning Du, Li Li | On the Importance of Building High-quality Training Datasets for Neural
Code Search | 11 pages, accepted to ICSE 2022 | null | null | null | cs.SE cs.AI | http://creativecommons.org/licenses/by/4.0/ | The performance of neural code search is significantly influenced by the
quality of the training data from which the neural models are derived. A large
corpus of high-quality query and code pairs is demanded to establish a precise
mapping from the natural language to the programming language. Due to the
limited avail... | [
{
"created": "Mon, 14 Feb 2022 12:02:41 GMT",
"version": "v1"
}
] | 2022-02-15 | [
[
"Sun",
"Zhensu",
""
],
[
"Li",
"Li",
""
],
[
"Liu",
"Yan",
""
],
[
"Du",
"Xiaoning",
""
],
[
"Li",
"Li",
""
]
] | The performance of neural code search is significantly influenced by the quality of the training data from which the neural models are derived. A large corpus of high-quality query and code pairs is demanded to establish a precise mapping from the natural language to the programming language. Due to the limited availab... |
1705.03427 | Laurent Massoulie | Laurent Massouli\'e and R\'emi Varloot | Rapid Mixing of Local Graph Dynamics | null | null | null | null | cs.DC math.PR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Graph dynamics arise naturally in many contexts. For instance in peer-to-peer
networks, a participating peer may replace an existing connection with one
neighbour by a new connection with a neighbour's neighbour. Several such local
rewiring rules have been proposed to ensure that peer-to-peer networks achieve
good co... | [
{
"created": "Tue, 9 May 2017 16:56:19 GMT",
"version": "v1"
}
] | 2017-05-10 | [
[
"Massoulié",
"Laurent",
""
],
[
"Varloot",
"Rémi",
""
]
] | Graph dynamics arise naturally in many contexts. For instance in peer-to-peer networks, a participating peer may replace an existing connection with one neighbour by a new connection with a neighbour's neighbour. Several such local rewiring rules have been proposed to ensure that peer-to-peer networks achieve good conn... |
2402.19262 | Advait Gadhikar | Advait Gadhikar and Rebekka Burkholz | Masks, Signs, And Learning Rate Rewinding | Accepted for publishing at ICLR 2024 | null | null | null | cs.LG | http://creativecommons.org/licenses/by/4.0/ | Learning Rate Rewinding (LRR) has been established as a strong variant of
Iterative Magnitude Pruning (IMP) to find lottery tickets in deep
overparameterized neural networks. While both iterative pruning schemes couple
structure and parameter learning, understanding how LRR excels in both aspects
can bring us closer ... | [
{
"created": "Thu, 29 Feb 2024 15:32:02 GMT",
"version": "v1"
}
] | 2024-03-01 | [
[
"Gadhikar",
"Advait",
""
],
[
"Burkholz",
"Rebekka",
""
]
] | Learning Rate Rewinding (LRR) has been established as a strong variant of Iterative Magnitude Pruning (IMP) to find lottery tickets in deep overparameterized neural networks. While both iterative pruning schemes couple structure and parameter learning, understanding how LRR excels in both aspects can bring us closer to... |
2306.12829 | Klaus Schoeffmann | Natalia Math\'a, Klaus Schoeffmann, Konstantin Schekotihin, Stephanie
Sarny, Doris Putzgruber-Adamitsch, Yosuf El-Shabrawi | Relevance-Based Compression of Cataract Surgery Videos | 11 pages, 5 figures, 3 tables | null | null | null | cs.MM | http://creativecommons.org/licenses/by/4.0/ | In the last decade, the need for storing videos from cataract surgery has
increased significantly. Hospitals continue to improve their imaging and
recording devices (e.g., microscopes and cameras used in microscopic surgery,
such as ophthalmology) to enhance their post-surgical processing efficiency.
The video record... | [
{
"created": "Thu, 22 Jun 2023 12:04:37 GMT",
"version": "v1"
}
] | 2023-06-23 | [
[
"Mathá",
"Natalia",
""
],
[
"Schoeffmann",
"Klaus",
""
],
[
"Schekotihin",
"Konstantin",
""
],
[
"Sarny",
"Stephanie",
""
],
[
"Putzgruber-Adamitsch",
"Doris",
""
],
[
"El-Shabrawi",
"Yosuf",
""
]
] | In the last decade, the need for storing videos from cataract surgery has increased significantly. Hospitals continue to improve their imaging and recording devices (e.g., microscopes and cameras used in microscopic surgery, such as ophthalmology) to enhance their post-surgical processing efficiency. The video recordin... |
1812.11826 | Cihan Tugrul Cicek | Cihan Tugrul Cicek and Hakan Gultekin and Bulent Tavli and Halim
Yanikomeroglu | UAV Base Station Location Optimization for Next Generation Wireless
Networks: Overview and Future Research Directions | 1st IEEE Unmanned Vehicle Systems (UVS) Conference - Oman Feb.2019 | null | 10.1109/UVS.2019.8658363 | null | cs.NI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Unmanned aerial vehicles mounted base stations (UAV-BSs) are expected to
become one of the significant components of the Next Generation Wireless
Networks (NGWNs). Rapid deployment, mobility, higher chances of unobstructed
propagation path, and flexibility features of UAV-BSs have attracted
significant attention. Des... | [
{
"created": "Mon, 3 Dec 2018 19:22:03 GMT",
"version": "v1"
}
] | 2020-08-27 | [
[
"Cicek",
"Cihan Tugrul",
""
],
[
"Gultekin",
"Hakan",
""
],
[
"Tavli",
"Bulent",
""
],
[
"Yanikomeroglu",
"Halim",
""
]
] | Unmanned aerial vehicles mounted base stations (UAV-BSs) are expected to become one of the significant components of the Next Generation Wireless Networks (NGWNs). Rapid deployment, mobility, higher chances of unobstructed propagation path, and flexibility features of UAV-BSs have attracted significant attention. Despi... |
1904.12777 | Abdullah Almethen | Abdullah Almethen, Othon Michail, Igor Potapov | Pushing Lines Helps: Efficient Universal Centralised Transformations for
Programmable Matter | 40 pages, 27 figures | null | null | null | cs.DS cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we study a discrete system of entities residing on a
two-dimensional square grid. Each entity is modelled as a node occupying a
distinct cell of the grid. The set of all $n$ nodes forms initially a connected
shape $A$. Entities are equipped with a linear-strength pushing mechanism that
can push a whole... | [
{
"created": "Mon, 29 Apr 2019 15:38:41 GMT",
"version": "v1"
}
] | 2019-04-30 | [
[
"Almethen",
"Abdullah",
""
],
[
"Michail",
"Othon",
""
],
[
"Potapov",
"Igor",
""
]
] | In this paper, we study a discrete system of entities residing on a two-dimensional square grid. Each entity is modelled as a node occupying a distinct cell of the grid. The set of all $n$ nodes forms initially a connected shape $A$. Entities are equipped with a linear-strength pushing mechanism that can push a whole l... |
2309.07694 | Shentong Mo | Shentong Mo, Miao Xin | Tree of Uncertain Thoughts Reasoning for Large Language Models | null | null | null | null | cs.CL cs.AI cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | While the recently introduced Tree of Thoughts (ToT) has heralded
advancements in allowing Large Language Models (LLMs) to reason through
foresight and backtracking for global decision-making, it has overlooked the
inherent local uncertainties in intermediate decision points or "thoughts".
These local uncertainties, ... | [
{
"created": "Thu, 14 Sep 2023 13:14:51 GMT",
"version": "v1"
}
] | 2023-09-15 | [
[
"Mo",
"Shentong",
""
],
[
"Xin",
"Miao",
""
]
] | While the recently introduced Tree of Thoughts (ToT) has heralded advancements in allowing Large Language Models (LLMs) to reason through foresight and backtracking for global decision-making, it has overlooked the inherent local uncertainties in intermediate decision points or "thoughts". These local uncertainties, in... |
1503.08909 | George Toderici | Joe Yue-Hei Ng and Matthew Hausknecht and Sudheendra Vijayanarasimhan
and Oriol Vinyals and Rajat Monga and George Toderici | Beyond Short Snippets: Deep Networks for Video Classification | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Convolutional neural networks (CNNs) have been extensively applied for image
recognition problems giving state-of-the-art results on recognition, detection,
segmentation and retrieval. In this work we propose and evaluate several deep
neural network architectures to combine image information across a video over
longe... | [
{
"created": "Tue, 31 Mar 2015 04:34:12 GMT",
"version": "v1"
},
{
"created": "Mon, 13 Apr 2015 19:44:25 GMT",
"version": "v2"
}
] | 2015-04-14 | [
[
"Ng",
"Joe Yue-Hei",
""
],
[
"Hausknecht",
"Matthew",
""
],
[
"Vijayanarasimhan",
"Sudheendra",
""
],
[
"Vinyals",
"Oriol",
""
],
[
"Monga",
"Rajat",
""
],
[
"Toderici",
"George",
""
]
] | Convolutional neural networks (CNNs) have been extensively applied for image recognition problems giving state-of-the-art results on recognition, detection, segmentation and retrieval. In this work we propose and evaluate several deep neural network architectures to combine image information across a video over longer ... |
1112.6160 | Katharine Turner | Katharine Turner | Cone fields and topological sampling in manifolds with bounded curvature | 20 pages, 3 figures | null | null | null | cs.CG math.AT math.DG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Often noisy point clouds are given as an approximation of a particular
compact set of interest. A finite point cloud is a compact set. This paper
proves a reconstruction theorem which gives a sufficient condition, as a bound
on the Hausdorff distance between two compact sets, for when certain offsets of
these two set... | [
{
"created": "Wed, 28 Dec 2011 18:10:52 GMT",
"version": "v1"
},
{
"created": "Sat, 3 Aug 2013 05:05:22 GMT",
"version": "v2"
}
] | 2013-08-06 | [
[
"Turner",
"Katharine",
""
]
] | Often noisy point clouds are given as an approximation of a particular compact set of interest. A finite point cloud is a compact set. This paper proves a reconstruction theorem which gives a sufficient condition, as a bound on the Hausdorff distance between two compact sets, for when certain offsets of these two sets ... |
1501.00696 | Pauli Miettinen | Saskia Metzler and Pauli Miettinen | Clustering Boolean Tensors | null | null | 10.1007/s10618-015-0420-3 | null | cs.NA cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Tensor factorizations are computationally hard problems, and in particular,
are often significantly harder than their matrix counterparts. In case of
Boolean tensor factorizations -- where the input tensor and all the factors are
required to be binary and we use Boolean algebra -- much of that hardness comes
from the... | [
{
"created": "Sun, 4 Jan 2015 17:01:03 GMT",
"version": "v1"
}
] | 2016-09-19 | [
[
"Metzler",
"Saskia",
""
],
[
"Miettinen",
"Pauli",
""
]
] | Tensor factorizations are computationally hard problems, and in particular, are often significantly harder than their matrix counterparts. In case of Boolean tensor factorizations -- where the input tensor and all the factors are required to be binary and we use Boolean algebra -- much of that hardness comes from the p... |
2211.09198 | Christian Rieck | Javier Garcia, Michael Yannuzzi, Peter Kramer, Christian Rieck,
S\'andor P. Fekete, Aaron T. Becker | Reconfiguration of a 2D Structure Using Spatio-Temporal Planning and
Load Transferring | seven pages, eight figures, one table; revised version; to appear in
the proceedings of the 2024 IEEE International Conference on Robotics and
Automation (ICRA 2024) | null | null | null | cs.RO cs.CG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We present progress on the problem of reconfiguring a 2D arrangement of
building material by a cooperative group of robots. These robots must avoid
collisions, deadlocks, and are subjected to the constraint of maintaining
connectivity of the structure. We develop two reconfiguration methods, one
based on spatio-tempo... | [
{
"created": "Wed, 16 Nov 2022 20:32:53 GMT",
"version": "v1"
},
{
"created": "Thu, 7 Mar 2024 14:08:20 GMT",
"version": "v2"
}
] | 2024-03-08 | [
[
"Garcia",
"Javier",
""
],
[
"Yannuzzi",
"Michael",
""
],
[
"Kramer",
"Peter",
""
],
[
"Rieck",
"Christian",
""
],
[
"Fekete",
"Sándor P.",
""
],
[
"Becker",
"Aaron T.",
""
]
] | We present progress on the problem of reconfiguring a 2D arrangement of building material by a cooperative group of robots. These robots must avoid collisions, deadlocks, and are subjected to the constraint of maintaining connectivity of the structure. We develop two reconfiguration methods, one based on spatio-tempora... |
1903.04448 | Judith Fan | Judith Fan, Robert Hawkins, Mike Wu, Noah Goodman | Pragmatic inference and visual abstraction enable contextual flexibility
during visual communication | 29 pages; 5 figures; submitted draft of manuscript | null | 10.1007/s42113-019-00058-7 | null | cs.OH cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Visual modes of communication are ubiquitous in modern life --- from maps to
data plots to political cartoons. Here we investigate drawing, the most basic
form of visual communication. Participants were paired in an online environment
to play a drawing-based reference game. On each trial, both participants were
shown... | [
{
"created": "Mon, 11 Mar 2019 17:18:16 GMT",
"version": "v1"
},
{
"created": "Thu, 28 Mar 2019 01:06:20 GMT",
"version": "v2"
}
] | 2019-12-17 | [
[
"Fan",
"Judith",
""
],
[
"Hawkins",
"Robert",
""
],
[
"Wu",
"Mike",
""
],
[
"Goodman",
"Noah",
""
]
] | Visual modes of communication are ubiquitous in modern life --- from maps to data plots to political cartoons. Here we investigate drawing, the most basic form of visual communication. Participants were paired in an online environment to play a drawing-based reference game. On each trial, both participants were shown t... |
2208.01182 | Yun-Wei Chu | Yun-Wei Chu, Seyyedali Hosseinalipour, Elizabeth Tenorio, Laura Cruz,
Kerrie Douglas, Andrew Lan, Christopher Brinton | Mitigating Biases in Student Performance Prediction via Attention-Based
Personalized Federated Learning | 10 pages, CIKM 2022 | null | null | null | cs.LG cs.AI cs.CY | http://creativecommons.org/licenses/by/4.0/ | Traditional learning-based approaches to student modeling generalize poorly
to underrepresented student groups due to biases in data availability. In this
paper, we propose a methodology for predicting student performance from their
online learning activities that optimizes inference accuracy over different
demograph... | [
{
"created": "Tue, 2 Aug 2022 00:22:20 GMT",
"version": "v1"
}
] | 2022-08-03 | [
[
"Chu",
"Yun-Wei",
""
],
[
"Hosseinalipour",
"Seyyedali",
""
],
[
"Tenorio",
"Elizabeth",
""
],
[
"Cruz",
"Laura",
""
],
[
"Douglas",
"Kerrie",
""
],
[
"Lan",
"Andrew",
""
],
[
"Brinton",
"Christopher",
""
... | Traditional learning-based approaches to student modeling generalize poorly to underrepresented student groups due to biases in data availability. In this paper, we propose a methodology for predicting student performance from their online learning activities that optimizes inference accuracy over different demographic... |
0810.2390 | Simone Faro | Simone Faro and Thierry Lecroq | Efficient Pattern Matching on Binary Strings | 12 pages | null | null | null | cs.DS cs.IR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The binary string matching problem consists in finding all the occurrences of
a pattern in a text where both strings are built on a binary alphabet. This is
an interesting problem in computer science, since binary data are omnipresent
in telecom and computer network applications. Moreover the problem finds
applicatio... | [
{
"created": "Tue, 14 Oct 2008 08:44:27 GMT",
"version": "v1"
},
{
"created": "Wed, 15 Oct 2008 12:15:24 GMT",
"version": "v2"
}
] | 2008-10-15 | [
[
"Faro",
"Simone",
""
],
[
"Lecroq",
"Thierry",
""
]
] | The binary string matching problem consists in finding all the occurrences of a pattern in a text where both strings are built on a binary alphabet. This is an interesting problem in computer science, since binary data are omnipresent in telecom and computer network applications. Moreover the problem finds applications... |
2304.01834 | Ntumba Elie Nsampi | Ntumba Elie Nsampi, Adarsh Djeacoumar, Hans-Peter Seidel, Tobias
Ritschel, Thomas Leimk\"uhler | Neural Field Convolutions by Repeated Differentiation | null | null | 10.1145/3618340 | null | cs.CV cs.GR | http://creativecommons.org/licenses/by/4.0/ | Neural fields are evolving towards a general-purpose continuous
representation for visual computing. Yet, despite their numerous appealing
properties, they are hardly amenable to signal processing. As a remedy, we
present a method to perform general continuous convolutions with general
continuous signals such as neur... | [
{
"created": "Tue, 4 Apr 2023 14:39:44 GMT",
"version": "v1"
},
{
"created": "Tue, 7 Nov 2023 09:18:32 GMT",
"version": "v2"
},
{
"created": "Sun, 10 Mar 2024 19:35:43 GMT",
"version": "v3"
},
{
"created": "Thu, 4 Apr 2024 18:01:47 GMT",
"version": "v4"
}
] | 2024-04-08 | [
[
"Nsampi",
"Ntumba Elie",
""
],
[
"Djeacoumar",
"Adarsh",
""
],
[
"Seidel",
"Hans-Peter",
""
],
[
"Ritschel",
"Tobias",
""
],
[
"Leimkühler",
"Thomas",
""
]
] | Neural fields are evolving towards a general-purpose continuous representation for visual computing. Yet, despite their numerous appealing properties, they are hardly amenable to signal processing. As a remedy, we present a method to perform general continuous convolutions with general continuous signals such as neural... |
1401.3357 | Jean Gregoire | Jean Gregoire and Emilio Frazzoli and Arnaud de La Fortelle and
Tichakorn Wongpiromsarn | Back-pressure traffic signal control with unknown routing rates | accepted for presentation at IFAC 2014, 6 pages. arXiv admin note:
text overlap with arXiv:1309.6484 | null | null | null | cs.SY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The control of a network of signalized intersections is considered. Previous
works proposed a feedback control belonging to the family of the so-called
back-pressure controls that ensures provably maximum stability given
pre-specified routing probabilities. However, this optimal back-pressure
controller (BP*) require... | [
{
"created": "Mon, 9 Dec 2013 10:41:10 GMT",
"version": "v1"
},
{
"created": "Mon, 31 Mar 2014 13:48:02 GMT",
"version": "v2"
}
] | 2014-04-01 | [
[
"Gregoire",
"Jean",
""
],
[
"Frazzoli",
"Emilio",
""
],
[
"de La Fortelle",
"Arnaud",
""
],
[
"Wongpiromsarn",
"Tichakorn",
""
]
] | The control of a network of signalized intersections is considered. Previous works proposed a feedback control belonging to the family of the so-called back-pressure controls that ensures provably maximum stability given pre-specified routing probabilities. However, this optimal back-pressure controller (BP*) requires ... |
1611.07541 | Harold Gabow | Harold N. Gabow | Data Structures for Weighted Matching and Extensions to $b$-matching and
$f$-factors | This paper is a combination of two conference papers: A preliminary
version of the data structures part appeared in Proc. 1st Annual ACM-SIAM
Symp. on Disc. Algorithms (SODA), 1990. A preliminary version of the
extensions part, based on reduction to matching, appeared in Proc. 15th
Annual ACM Symp. on Theory of... | null | null | null | cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper shows the weighted matching problem on general graphs can be
solved in time $O(n(m + n\log n))$ for $n$ and $m$ the number of vertices and
edges, respectively. This was previously known only for bipartite graphs. The
crux is a data structure for blossom creation. It uses a dynamic
nearest-common-ancestor a... | [
{
"created": "Tue, 22 Nov 2016 21:22:33 GMT",
"version": "v1"
}
] | 2016-11-24 | [
[
"Gabow",
"Harold N.",
""
]
] | This paper shows the weighted matching problem on general graphs can be solved in time $O(n(m + n\log n))$ for $n$ and $m$ the number of vertices and edges, respectively. This was previously known only for bipartite graphs. The crux is a data structure for blossom creation. It uses a dynamic nearest-common-ancestor alg... |
2407.15599 | Philip Whittington | Philip Whittington | Online String Attractors | null | null | null | null | cs.DS | http://creativecommons.org/licenses/by/4.0/ | In today's data-centric world, fast and effective compression of data is
paramount. To measure success towards the second goal, Kempa and Prezza
[STOC2018] introduce the string attractor, a combinatorial object unifying
dictionary-based compression. Given a string $T \in \Sigma^n$, a string
attractor ($k$-attractor) ... | [
{
"created": "Mon, 22 Jul 2024 12:44:25 GMT",
"version": "v1"
}
] | 2024-07-23 | [
[
"Whittington",
"Philip",
""
]
] | In today's data-centric world, fast and effective compression of data is paramount. To measure success towards the second goal, Kempa and Prezza [STOC2018] introduce the string attractor, a combinatorial object unifying dictionary-based compression. Given a string $T \in \Sigma^n$, a string attractor ($k$-attractor) is... |
1906.06675 | Sadaf Salehkalaibar | Sadaf Salehkalaibar, Mohammad Hossein Yassaee and Vincent Y. F. Tan | Covert Communication Over a Compound Channel | null | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we consider fundamental communication limits over a compound
channel. Covert communication in the information-theoretic context has been
primarily concerned with fundamental limits when the transmitter wishes to
communicate to legitimate receiver(s) while ensuring that the communication is
not detected... | [
{
"created": "Sun, 16 Jun 2019 12:59:07 GMT",
"version": "v1"
}
] | 2019-06-18 | [
[
"Salehkalaibar",
"Sadaf",
""
],
[
"Yassaee",
"Mohammad Hossein",
""
],
[
"Tan",
"Vincent Y. F.",
""
]
] | In this paper, we consider fundamental communication limits over a compound channel. Covert communication in the information-theoretic context has been primarily concerned with fundamental limits when the transmitter wishes to communicate to legitimate receiver(s) while ensuring that the communication is not detected b... |
1905.11381 | Jirong Yi | Jirong Yi, Hui Xie, Leixin Zhou, Xiaodong Wu, Weiyu Xu, Raghuraman
Mudumbai | Trust but Verify: An Information-Theoretic Explanation for the
Adversarial Fragility of Machine Learning Systems, and a General Defense
against Adversarial Attacks | 44 Pages, 2 Theorems, 35 Figures, 29 Tables. arXiv admin note:
substantial text overlap with arXiv:1901.09413 | null | null | null | cs.CR cs.CV cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Deep-learning based classification algorithms have been shown to be
susceptible to adversarial attacks: minor changes to the input of classifiers
can dramatically change their outputs, while being imperceptible to humans. In
this paper, we present a simple hypothesis about a feature compression property
of artificial... | [
{
"created": "Sat, 25 May 2019 21:57:51 GMT",
"version": "v1"
}
] | 2019-05-29 | [
[
"Yi",
"Jirong",
""
],
[
"Xie",
"Hui",
""
],
[
"Zhou",
"Leixin",
""
],
[
"Wu",
"Xiaodong",
""
],
[
"Xu",
"Weiyu",
""
],
[
"Mudumbai",
"Raghuraman",
""
]
] | Deep-learning based classification algorithms have been shown to be susceptible to adversarial attacks: minor changes to the input of classifiers can dramatically change their outputs, while being imperceptible to humans. In this paper, we present a simple hypothesis about a feature compression property of artificial i... |
2303.07682 | Haobin Tang | Haobin Tang, Xulong Zhang, Jianzong Wang, Ning Cheng, Jing Xiao | QI-TTS: Questioning Intonation Control for Emotional Speech Synthesis | Accepted by ICASSP 2023 | null | null | null | cs.SD cs.CL eess.AS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Recent expressive text to speech (TTS) models focus on synthesizing emotional
speech, but some fine-grained styles such as intonation are neglected. In this
paper, we propose QI-TTS which aims to better transfer and control intonation
to further deliver the speaker's questioning intention while transferring
emotion f... | [
{
"created": "Tue, 14 Mar 2023 07:53:19 GMT",
"version": "v1"
}
] | 2023-03-15 | [
[
"Tang",
"Haobin",
""
],
[
"Zhang",
"Xulong",
""
],
[
"Wang",
"Jianzong",
""
],
[
"Cheng",
"Ning",
""
],
[
"Xiao",
"Jing",
""
]
] | Recent expressive text to speech (TTS) models focus on synthesizing emotional speech, but some fine-grained styles such as intonation are neglected. In this paper, we propose QI-TTS which aims to better transfer and control intonation to further deliver the speaker's questioning intention while transferring emotion fro... |
2201.12581 | Xiaoyang Li | Xiaoyang Li, Fan Liu, Ziqin Zhou, Guangxu Zhu, Shuai Wang, Kaibin
Huang, and Yi Gong | Integrated Sensing, Communication, and Computation Over-the-Air: MIMO
Beamforming Design | This paper has been submitted to IEEE for possible publication | null | null | null | cs.IT eess.SP math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | To support the unprecedented growth of the Internet of Things (IoT)
applications, tremendous data need to be collected by the IoT devices and
delivered to the server for further computation. By utilizing the same signals
for both radar sensing and data communication, the integrated sensing and
communication (ISAC) te... | [
{
"created": "Sat, 29 Jan 2022 12:58:11 GMT",
"version": "v1"
},
{
"created": "Tue, 22 Feb 2022 12:09:16 GMT",
"version": "v2"
}
] | 2022-02-23 | [
[
"Li",
"Xiaoyang",
""
],
[
"Liu",
"Fan",
""
],
[
"Zhou",
"Ziqin",
""
],
[
"Zhu",
"Guangxu",
""
],
[
"Wang",
"Shuai",
""
],
[
"Huang",
"Kaibin",
""
],
[
"Gong",
"Yi",
""
]
] | To support the unprecedented growth of the Internet of Things (IoT) applications, tremendous data need to be collected by the IoT devices and delivered to the server for further computation. By utilizing the same signals for both radar sensing and data communication, the integrated sensing and communication (ISAC) tech... |
2109.05771 | Dev Yashpal Sheth | Ananya B. Sai, Tanay Dixit, Dev Yashpal Sheth, Sreyas Mohan, Mitesh M.
Khapra | Perturbation CheckLists for Evaluating NLG Evaluation Metrics | Accepted at EMNLP 2021. See https://iitmnlp.github.io/EvalEval/ for
our templates and code | null | null | null | cs.CL | http://creativecommons.org/licenses/by/4.0/ | Natural Language Generation (NLG) evaluation is a multifaceted task requiring
assessment of multiple desirable criteria, e.g., fluency, coherency, coverage,
relevance, adequacy, overall quality, etc. Across existing datasets for 6 NLG
tasks, we observe that the human evaluation scores on these multiple criteria
are o... | [
{
"created": "Mon, 13 Sep 2021 08:26:26 GMT",
"version": "v1"
}
] | 2021-09-14 | [
[
"Sai",
"Ananya B.",
""
],
[
"Dixit",
"Tanay",
""
],
[
"Sheth",
"Dev Yashpal",
""
],
[
"Mohan",
"Sreyas",
""
],
[
"Khapra",
"Mitesh M.",
""
]
] | Natural Language Generation (NLG) evaluation is a multifaceted task requiring assessment of multiple desirable criteria, e.g., fluency, coherency, coverage, relevance, adequacy, overall quality, etc. Across existing datasets for 6 NLG tasks, we observe that the human evaluation scores on these multiple criteria are oft... |
2104.14802 | Xinjian Zhang | Xinjian Zhang, Yi Xu, Su Yang, Longwen Gao, Huyang Sun | Dance Generation with Style Embedding: Learning and Transferring Latent
Representations of Dance Styles | Submit to IJCAI-21 | null | null | null | cs.MM cs.GR cs.SD eess.AS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Choreography refers to creation of dance steps and motions for dances
according to the latent knowledge in human mind, where the created dance
motions are in general style-specific and consistent. So far, such latent
style-specific knowledge about dance styles cannot be represented explicitly in
human language and ha... | [
{
"created": "Fri, 30 Apr 2021 07:36:49 GMT",
"version": "v1"
}
] | 2021-05-03 | [
[
"Zhang",
"Xinjian",
""
],
[
"Xu",
"Yi",
""
],
[
"Yang",
"Su",
""
],
[
"Gao",
"Longwen",
""
],
[
"Sun",
"Huyang",
""
]
] | Choreography refers to creation of dance steps and motions for dances according to the latent knowledge in human mind, where the created dance motions are in general style-specific and consistent. So far, such latent style-specific knowledge about dance styles cannot be represented explicitly in human language and has ... |
2402.15492 | Xuyang Li | Xuyang Li, Hamed Bolandi, Mahdi Masmoudi, Talal Salem, Nizar Lajnef,
Vishnu Naresh Boddeti | Mechanics-Informed Autoencoder Enables Automated Detection and
Localization of Unforeseen Structural Damage | null | null | null | null | cs.LG eess.SP | http://creativecommons.org/licenses/by-nc-nd/4.0/ | Structural health monitoring (SHM) ensures the safety and longevity of
structures like buildings and bridges. As the volume and scale of structures
and the impact of their failure continue to grow, there is a dire need for SHM
techniques that are scalable, inexpensive, can operate passively without human
intervention... | [
{
"created": "Fri, 23 Feb 2024 18:31:02 GMT",
"version": "v1"
},
{
"created": "Thu, 18 Jul 2024 06:29:37 GMT",
"version": "v2"
}
] | 2024-07-19 | [
[
"Li",
"Xuyang",
""
],
[
"Bolandi",
"Hamed",
""
],
[
"Masmoudi",
"Mahdi",
""
],
[
"Salem",
"Talal",
""
],
[
"Lajnef",
"Nizar",
""
],
[
"Boddeti",
"Vishnu Naresh",
""
]
] | Structural health monitoring (SHM) ensures the safety and longevity of structures like buildings and bridges. As the volume and scale of structures and the impact of their failure continue to grow, there is a dire need for SHM techniques that are scalable, inexpensive, can operate passively without human intervention, ... |
2212.05885 | Haosu Zhou | Haosu Zhou, and Nan Li | Image-based Artificial Intelligence empowered surrogate model and shape
morpher for real-time blank shape optimisation in the hot stamping process | 32 pages, 11 figures | null | null | null | cs.CV cs.AI cs.LG | http://creativecommons.org/licenses/by/4.0/ | As the complexity of modern manufacturing technologies increases, traditional
trial-and-error design, which requires iterative and expensive simulations,
becomes unreliable and time-consuming. This difficulty is especially
significant for the design of hot-stamped safety-critical components, such as
ultra-high-streng... | [
{
"created": "Thu, 1 Dec 2022 20:17:48 GMT",
"version": "v1"
}
] | 2022-12-13 | [
[
"Zhou",
"Haosu",
""
],
[
"Li",
"Nan",
""
]
] | As the complexity of modern manufacturing technologies increases, traditional trial-and-error design, which requires iterative and expensive simulations, becomes unreliable and time-consuming. This difficulty is especially significant for the design of hot-stamped safety-critical components, such as ultra-high-strength... |
2101.10492 | Dayu Zhu | Dayu Zhu, Wenshan Cai | Fast Non-line-of-sight Imaging with Two-step Deep Remapping | null | null | null | null | cs.CV eess.IV | http://creativecommons.org/licenses/by/4.0/ | Conventional imaging only records photons directly sent from the object to
the detector, while non-line-of-sight (NLOS) imaging takes the indirect light
into account. Most NLOS solutions employ a transient scanning process, followed
by a physical based algorithm to reconstruct the NLOS scenes. However, the
transient ... | [
{
"created": "Tue, 26 Jan 2021 00:08:54 GMT",
"version": "v1"
},
{
"created": "Fri, 26 Mar 2021 01:23:18 GMT",
"version": "v2"
}
] | 2021-03-29 | [
[
"Zhu",
"Dayu",
""
],
[
"Cai",
"Wenshan",
""
]
] | Conventional imaging only records photons directly sent from the object to the detector, while non-line-of-sight (NLOS) imaging takes the indirect light into account. Most NLOS solutions employ a transient scanning process, followed by a physical based algorithm to reconstruct the NLOS scenes. However, the transient de... |
2302.09124 | Vishnu Nair | Vishnu Nair, Hanxiu 'Hazel' Zhu, Brian A. Smith | ImageAssist: Tools for Enhancing Touchscreen-Based Image Exploration
Systems for Blind and Low Vision Users | null | Proceedings of the 2023 CHI Conference on Human Factors in
Computing Systems (CHI '23), April 2023 | 10.1145/3544548.3581302 | null | cs.HC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Blind and low vision (BLV) users often rely on alt text to understand what a
digital image is showing. However, recent research has investigated how
touch-based image exploration on touchscreens can supplement alt text.
Touchscreen-based image exploration systems allow BLV users to deeply
understand images while gran... | [
{
"created": "Fri, 17 Feb 2023 20:16:28 GMT",
"version": "v1"
}
] | 2023-02-21 | [
[
"Nair",
"Vishnu",
""
],
[
"Zhu",
"Hanxiu 'Hazel'",
""
],
[
"Smith",
"Brian A.",
""
]
] | Blind and low vision (BLV) users often rely on alt text to understand what a digital image is showing. However, recent research has investigated how touch-based image exploration on touchscreens can supplement alt text. Touchscreen-based image exploration systems allow BLV users to deeply understand images while granti... |
1609.00048 | Joel Tropp | Joel A. Tropp, Alp Yurtsever, Madeleine Udell, Volkan Cevher | Practical sketching algorithms for low-rank matrix approximation | null | SIAM J. Matrix Analysis and Applications, Vol. 38, num. 4, pp.
1454-1485, Dec. 2017 | 10.1137/17M1111590 | null | cs.NA cs.DS math.NA stat.CO stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper describes a suite of algorithms for constructing low-rank
approximations of an input matrix from a random linear image of the matrix,
called a sketch. These methods can preserve structural properties of the input
matrix, such as positive-semidefiniteness, and they can produce approximations
with a user-spe... | [
{
"created": "Wed, 31 Aug 2016 21:30:26 GMT",
"version": "v1"
},
{
"created": "Tue, 2 Jan 2018 18:13:40 GMT",
"version": "v2"
}
] | 2018-01-03 | [
[
"Tropp",
"Joel A.",
""
],
[
"Yurtsever",
"Alp",
""
],
[
"Udell",
"Madeleine",
""
],
[
"Cevher",
"Volkan",
""
]
] | This paper describes a suite of algorithms for constructing low-rank approximations of an input matrix from a random linear image of the matrix, called a sketch. These methods can preserve structural properties of the input matrix, such as positive-semidefiniteness, and they can produce approximations with a user-speci... |
1709.06764 | Andres Milioto | Andres Milioto, Philipp Lottes, Cyrill Stachniss | Real-time Semantic Segmentation of Crop and Weed for Precision
Agriculture Robots Leveraging Background Knowledge in CNNs | Accepted for publication at IEEE International Conference on Robotics
and Automation 2018 (ICRA 2018) | null | null | null | cs.CV cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Precision farming robots, which target to reduce the amount of herbicides
that need to be brought out in the fields, must have the ability to identify
crops and weeds in real time to trigger weeding actions. In this paper, we
address the problem of CNN-based semantic segmentation of crop fields
separating sugar beet ... | [
{
"created": "Wed, 20 Sep 2017 08:24:18 GMT",
"version": "v1"
},
{
"created": "Fri, 2 Mar 2018 15:46:48 GMT",
"version": "v2"
}
] | 2018-03-05 | [
[
"Milioto",
"Andres",
""
],
[
"Lottes",
"Philipp",
""
],
[
"Stachniss",
"Cyrill",
""
]
] | Precision farming robots, which target to reduce the amount of herbicides that need to be brought out in the fields, must have the ability to identify crops and weeds in real time to trigger weeding actions. In this paper, we address the problem of CNN-based semantic segmentation of crop fields separating sugar beet pl... |
2404.17276 | Charalampos Symeonidis | Charalampos Symeonidis and Nikos Nikolaidis | Efficient Deterministic Renewable Energy Forecasting Guided by
Multiple-Location Weather Data | null | null | null | null | cs.LG cs.AI | http://creativecommons.org/licenses/by/4.0/ | Electricity generated from renewable energy sources has been established as
an efficient remedy for both energy shortages and the environmental pollution
stemming from conventional energy production methods. Solar and wind power are
two of the most dominant renewable energy sources. The accurate forecasting of
the en... | [
{
"created": "Fri, 26 Apr 2024 09:30:55 GMT",
"version": "v1"
}
] | 2024-04-29 | [
[
"Symeonidis",
"Charalampos",
""
],
[
"Nikolaidis",
"Nikos",
""
]
] | Electricity generated from renewable energy sources has been established as an efficient remedy for both energy shortages and the environmental pollution stemming from conventional energy production methods. Solar and wind power are two of the most dominant renewable energy sources. The accurate forecasting of the ener... |
2111.11647 | Young-Gyu Yoon | Junmo Cho, Dong-Hwan Lee, Young-Gyu Yoon | Inducing Functions through Reinforcement Learning without Task
Specification | 14 pages | null | null | null | cs.AI cs.LG cs.NE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We report a bio-inspired framework for training a neural network through
reinforcement learning to induce high level functions within the network. Based
on the interpretation that animals have gained their cognitive functions such
as object recognition - without ever being specifically trained for - as a
result of ma... | [
{
"created": "Tue, 23 Nov 2021 04:42:02 GMT",
"version": "v1"
}
] | 2021-11-24 | [
[
"Cho",
"Junmo",
""
],
[
"Lee",
"Dong-Hwan",
""
],
[
"Yoon",
"Young-Gyu",
""
]
] | We report a bio-inspired framework for training a neural network through reinforcement learning to induce high level functions within the network. Based on the interpretation that animals have gained their cognitive functions such as object recognition - without ever being specifically trained for - as a result of maxi... |
2208.09596 | Keyu Wen | Qingrong Cheng, Keyu Wen, Xiaodong Gu | Vision-Language Matching for Text-to-Image Synthesis via Generative
Adversarial Networks | 14 pages | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Text-to-image synthesis aims to generate a photo-realistic and semantic
consistent image from a specific text description. The images synthesized by
off-the-shelf models usually contain limited components compared with the
corresponding image and text description, which decreases the image quality and
the textual-vis... | [
{
"created": "Sat, 20 Aug 2022 03:34:04 GMT",
"version": "v1"
}
] | 2022-08-23 | [
[
"Cheng",
"Qingrong",
""
],
[
"Wen",
"Keyu",
""
],
[
"Gu",
"Xiaodong",
""
]
] | Text-to-image synthesis aims to generate a photo-realistic and semantic consistent image from a specific text description. The images synthesized by off-the-shelf models usually contain limited components compared with the corresponding image and text description, which decreases the image quality and the textual-visua... |
1805.07457 | Jyh-Jing Hwang | Jyh-Jing Hwang, Tsung-Wei Ke, Jianbo Shi, Stella X. Yu | Adversarial Structure Matching for Structured Prediction Tasks | In CVPR 2019. Webpage & Code:
https://jyhjinghwang.github.io/projects/asm.html | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Pixel-wise losses, e.g., cross-entropy or L2, have been widely used in
structured prediction tasks as a spatial extension of generic image
classification or regression. However, its i.i.d. assumption neglects the
structural regularity present in natural images. Various attempts have been
made to incorporate structura... | [
{
"created": "Fri, 18 May 2018 22:03:58 GMT",
"version": "v1"
},
{
"created": "Mon, 21 Oct 2019 16:46:07 GMT",
"version": "v2"
}
] | 2019-10-22 | [
[
"Hwang",
"Jyh-Jing",
""
],
[
"Ke",
"Tsung-Wei",
""
],
[
"Shi",
"Jianbo",
""
],
[
"Yu",
"Stella X.",
""
]
] | Pixel-wise losses, e.g., cross-entropy or L2, have been widely used in structured prediction tasks as a spatial extension of generic image classification or regression. However, its i.i.d. assumption neglects the structural regularity present in natural images. Various attempts have been made to incorporate structural ... |
1112.0974 | Jan Lellmann | Jan Lellmann, Frank Lenzen, and Christoph Schn\"orr | Optimality Bounds for a Variational Relaxation of the Image Partitioning
Problem | null | null | null | null | cs.CV math.CO math.FA math.OC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We consider a variational convex relaxation of a class of optimal
partitioning and multiclass labeling problems, which has recently proven quite
successful and can be seen as a continuous analogue of Linear Programming (LP)
relaxation methods for finite-dimensional problems. While for the latter case
several optimali... | [
{
"created": "Mon, 5 Dec 2011 16:05:32 GMT",
"version": "v1"
}
] | 2011-12-06 | [
[
"Lellmann",
"Jan",
""
],
[
"Lenzen",
"Frank",
""
],
[
"Schnörr",
"Christoph",
""
]
] | We consider a variational convex relaxation of a class of optimal partitioning and multiclass labeling problems, which has recently proven quite successful and can be seen as a continuous analogue of Linear Programming (LP) relaxation methods for finite-dimensional problems. While for the latter case several optimality... |
2203.09231 | Marcos Faundez-Zanuy | Marcos Faundez-Zanuy, Daniel Rodr\'iguez-Porcheron | Speaker recognition using residual signal of linear and nonlinear
prediction models | 4 pages, published in 5th International Conference on spoken language
processing. Vol.2 pp.121-124. ICSLP 1998. ISBN 1-876346-17-5 | 5th International Conference on spoken language processing. Vol.2
pp.121-124. ICSLP 1998. ISBN 1-876346-17-5 | null | null | cs.SD eess.AS | http://creativecommons.org/licenses/by-nc-nd/4.0/ | This Paper discusses the usefulness of the residual signal for speaker
recognition. It is shown that the combination of both a measure defined over
LPCC coefficients and a measure defined over the energy of the residual signal
gives rise to an improvement over the classical method which considers only the
LPCC coeffi... | [
{
"created": "Thu, 17 Mar 2022 10:36:58 GMT",
"version": "v1"
}
] | 2022-03-18 | [
[
"Faundez-Zanuy",
"Marcos",
""
],
[
"Rodríguez-Porcheron",
"Daniel",
""
]
] | This Paper discusses the usefulness of the residual signal for speaker recognition. It is shown that the combination of both a measure defined over LPCC coefficients and a measure defined over the energy of the residual signal gives rise to an improvement over the classical method which considers only the LPCC coeffici... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.