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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1806.08852 | Lorenzo Quir\'os | Lorenzo Quir\'os | Multi-Task Handwritten Document Layout Analysis | null | null | null | null | cs.CV | http://creativecommons.org/licenses/by/4.0/ | Document Layout Analysis is a fundamental step in Handwritten Text Processing
systems, from the extraction of the text lines to the type of zone it belongs
to. We present a system based on artificial neural networks which is able to
determine not only the baselines of text lines present in the document, but
also perf... | [
{
"created": "Fri, 22 Jun 2018 21:00:07 GMT",
"version": "v1"
},
{
"created": "Mon, 12 Nov 2018 11:30:18 GMT",
"version": "v2"
},
{
"created": "Wed, 12 Dec 2018 15:07:40 GMT",
"version": "v3"
}
] | 2018-12-13 | [
[
"Quirós",
"Lorenzo",
""
]
] | Document Layout Analysis is a fundamental step in Handwritten Text Processing systems, from the extraction of the text lines to the type of zone it belongs to. We present a system based on artificial neural networks which is able to determine not only the baselines of text lines present in the document, but also perfor... |
1803.06913 | Anirban Nag | Anirban Nag, Ali Shafiee, Rajeev Balasubramonian, Vivek Srikumar and
Naveen Muralimanohar | Newton: Gravitating Towards the Physical Limits of Crossbar Acceleration | 13 pages with Appendix | null | null | null | cs.LG cs.AR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Many recent works have designed accelerators for Convolutional Neural
Networks (CNNs). While digital accelerators have relied on near data
processing, analog accelerators have further reduced data movement by
performing in-situ computation. Recent works take advantage of highly parallel
analog in-situ computation in ... | [
{
"created": "Sat, 10 Mar 2018 05:06:57 GMT",
"version": "v1"
}
] | 2018-03-20 | [
[
"Nag",
"Anirban",
""
],
[
"Shafiee",
"Ali",
""
],
[
"Balasubramonian",
"Rajeev",
""
],
[
"Srikumar",
"Vivek",
""
],
[
"Muralimanohar",
"Naveen",
""
]
] | Many recent works have designed accelerators for Convolutional Neural Networks (CNNs). While digital accelerators have relied on near data processing, analog accelerators have further reduced data movement by performing in-situ computation. Recent works take advantage of highly parallel analog in-situ computation in me... |
cs/0703153 | Maurice Margenstern | Maurice Margenstern | The periodic domino problem is undecidable in the hyperbolic plane | null | null | null | null | cs.CG cs.DM | null | In this paper, we consider the periodic tiling problem which was proved
undecidable in the Euclidean plane by Yu. Gurevich and I. Koriakov in 1972.
Here, we prove that the same problem for the hyperbolic plane is also
undecidable.
| [
{
"created": "Fri, 30 Mar 2007 09:31:40 GMT",
"version": "v1"
}
] | 2007-05-23 | [
[
"Margenstern",
"Maurice",
""
]
] | In this paper, we consider the periodic tiling problem which was proved undecidable in the Euclidean plane by Yu. Gurevich and I. Koriakov in 1972. Here, we prove that the same problem for the hyperbolic plane is also undecidable. |
1709.06341 | Benjamin Hou | Benjamin Hou, Bishesh Khanal, Amir Alansary, Steven McDonagh, Alice
Davidson, Mary Rutherford, Jo V. Hajnal, Daniel Rueckert, Ben Glocker and
Bernhard Kainz | 3D Reconstruction in Canonical Co-ordinate Space from Arbitrarily
Oriented 2D Images | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Limited capture range, and the requirement to provide high quality
initialization for optimization-based 2D/3D image registration methods, can
significantly degrade the performance of 3D image reconstruction and motion
compensation pipelines. Challenging clinical imaging scenarios, which contain
significant subject m... | [
{
"created": "Tue, 19 Sep 2017 10:50:20 GMT",
"version": "v1"
},
{
"created": "Wed, 20 Sep 2017 08:17:57 GMT",
"version": "v2"
},
{
"created": "Thu, 7 Dec 2017 18:55:18 GMT",
"version": "v3"
},
{
"created": "Tue, 23 Jan 2018 18:21:29 GMT",
"version": "v4"
}
] | 2018-01-24 | [
[
"Hou",
"Benjamin",
""
],
[
"Khanal",
"Bishesh",
""
],
[
"Alansary",
"Amir",
""
],
[
"McDonagh",
"Steven",
""
],
[
"Davidson",
"Alice",
""
],
[
"Rutherford",
"Mary",
""
],
[
"Hajnal",
"Jo V.",
""
],
[
... | Limited capture range, and the requirement to provide high quality initialization for optimization-based 2D/3D image registration methods, can significantly degrade the performance of 3D image reconstruction and motion compensation pipelines. Challenging clinical imaging scenarios, which contain significant subject mot... |
2404.10713 | Tandin Dorji | Tandin Dorji, Pakinee Aimmanee, Vich Yindeedej | A Plausibility Study of Using Augmented Reality in the
Ventriculoperitoneal Shunt Operations | Accepted for the 2024 - 16th International Conference on Knowledge
and Smart Technology (KST). To be published in IEEEXplore Digital Library
(#61284), ISBN: 979-8-3503-7073-7 | null | 10.1109/KST61284.2024.10499675 | null | cs.CV cs.SE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The field of augmented reality (AR) has undergone substantial growth, finding
diverse applications in the medical industry. This paper delves into various
techniques employed in medical surgeries, scrutinizing factors such as cost,
implementation, and accessibility. The focus of this exploration is on AR-based
soluti... | [
{
"created": "Tue, 16 Apr 2024 16:43:14 GMT",
"version": "v1"
}
] | 2024-04-22 | [
[
"Dorji",
"Tandin",
""
],
[
"Aimmanee",
"Pakinee",
""
],
[
"Yindeedej",
"Vich",
""
]
] | The field of augmented reality (AR) has undergone substantial growth, finding diverse applications in the medical industry. This paper delves into various techniques employed in medical surgeries, scrutinizing factors such as cost, implementation, and accessibility. The focus of this exploration is on AR-based solution... |
1812.01936 | Jiankang Deng | Jia Guo, Jiankang Deng, Niannan Xue, Stefanos Zafeiriou | Stacked Dense U-Nets with Dual Transformers for Robust Face Alignment | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Facial landmark localisation in images captured in-the-wild is an important
and challenging problem. The current state-of-the-art revolves around certain
kinds of Deep Convolutional Neural Networks (DCNNs) such as stacked U-Nets and
Hourglass networks. In this work, we innovatively propose stacked dense U-Nets
for th... | [
{
"created": "Wed, 5 Dec 2018 12:02:11 GMT",
"version": "v1"
}
] | 2018-12-06 | [
[
"Guo",
"Jia",
""
],
[
"Deng",
"Jiankang",
""
],
[
"Xue",
"Niannan",
""
],
[
"Zafeiriou",
"Stefanos",
""
]
] | Facial landmark localisation in images captured in-the-wild is an important and challenging problem. The current state-of-the-art revolves around certain kinds of Deep Convolutional Neural Networks (DCNNs) such as stacked U-Nets and Hourglass networks. In this work, we innovatively propose stacked dense U-Nets for this... |
1703.08838 | Saber Salehkaleybar | Saber Salehkaleybar, Arsalan Sharif-Nassab, S. Jamaloddin Golestani | Distributed Voting/Ranking with Optimal Number of States per Node | null | null | null | null | cs.DC cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Considering a network with $n$ nodes, where each node initially votes for one
(or more) choices out of $K$ possible choices, we present a Distributed
Multi-choice Voting/Ranking (DMVR) algorithm to determine either the choice
with maximum vote (the voting problem) or to rank all the choices in terms of
their acquired... | [
{
"created": "Sun, 26 Mar 2017 16:19:31 GMT",
"version": "v1"
}
] | 2017-03-28 | [
[
"Salehkaleybar",
"Saber",
""
],
[
"Sharif-Nassab",
"Arsalan",
""
],
[
"Golestani",
"S. Jamaloddin",
""
]
] | Considering a network with $n$ nodes, where each node initially votes for one (or more) choices out of $K$ possible choices, we present a Distributed Multi-choice Voting/Ranking (DMVR) algorithm to determine either the choice with maximum vote (the voting problem) or to rank all the choices in terms of their acquired v... |
2009.12326 | Yuxuan Zhao | Yuxuan Zhao, Eric Landgrebe, Eliot Shekhtman and Madeleine Udell | Online Missing Value Imputation and Change Point Detection with the
Gaussian Copula | Accepted by AAAI 2022 | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Missing value imputation is crucial for real-world data science workflows.
Imputation is harder in the online setting, as it requires the imputation
method itself to be able to evolve over time. For practical applications,
imputation algorithms should produce imputations that match the true data
distribution, handle ... | [
{
"created": "Fri, 25 Sep 2020 16:27:47 GMT",
"version": "v1"
},
{
"created": "Wed, 15 Dec 2021 20:12:33 GMT",
"version": "v2"
}
] | 2021-12-17 | [
[
"Zhao",
"Yuxuan",
""
],
[
"Landgrebe",
"Eric",
""
],
[
"Shekhtman",
"Eliot",
""
],
[
"Udell",
"Madeleine",
""
]
] | Missing value imputation is crucial for real-world data science workflows. Imputation is harder in the online setting, as it requires the imputation method itself to be able to evolve over time. For practical applications, imputation algorithms should produce imputations that match the true data distribution, handle da... |
2004.08096 | Yanghua Jin | Naofumi Akimoto, Huachun Zhu, Yanghua Jin, Yoshimitsu Aoki | Fast Soft Color Segmentation | Accepted at CVPR 2020 | null | null | null | cs.CV cs.LG cs.MM | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We address the problem of soft color segmentation, defined as decomposing a
given image into several RGBA layers, each containing only homogeneous color
regions. The resulting layers from decomposition pave the way for applications
that benefit from layer-based editing, such as recoloring and compositing of
images an... | [
{
"created": "Fri, 17 Apr 2020 07:43:33 GMT",
"version": "v1"
}
] | 2020-04-20 | [
[
"Akimoto",
"Naofumi",
""
],
[
"Zhu",
"Huachun",
""
],
[
"Jin",
"Yanghua",
""
],
[
"Aoki",
"Yoshimitsu",
""
]
] | We address the problem of soft color segmentation, defined as decomposing a given image into several RGBA layers, each containing only homogeneous color regions. The resulting layers from decomposition pave the way for applications that benefit from layer-based editing, such as recoloring and compositing of images and ... |
2102.11743 | Kyle Mills | Kyle Mills and Isaac Tamblyn | Weakly-supervised multi-class object localization using only object
counts as labels | null | null | null | null | cs.CV cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We demonstrate the use of an extensive deep neural network to localize
instances of objects in images. The EDNN is naturally able to accurately
perform multi-class counting using only ground truth count values as labels.
Without providing any conceptual information, object annotations, or pixel
segmentation informati... | [
{
"created": "Tue, 23 Feb 2021 15:14:46 GMT",
"version": "v1"
}
] | 2021-02-24 | [
[
"Mills",
"Kyle",
""
],
[
"Tamblyn",
"Isaac",
""
]
] | We demonstrate the use of an extensive deep neural network to localize instances of objects in images. The EDNN is naturally able to accurately perform multi-class counting using only ground truth count values as labels. Without providing any conceptual information, object annotations, or pixel segmentation information... |
2403.02783 | Sebastien Verel | S\'ebastien Verel (LISIC), Sarah Thomson, Omar Rifki (LISIC) | Where the Really Hard Quadratic Assignment Problems Are: the QAP-SAT
instances | null | Evolutionary Computation in Combinatorial Optimization Conference
(evoCOP), Apr 2024, Aberystwyth, United Kingdom | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The Quadratic Assignment Problem (QAP) is one of the major domains in the
field of evolutionary computation, and more widely in combinatorial
optimization. This paper studies the phase transition of the QAP, which can be
described as a dramatic change in the problem's computational complexity and
satisfiability, with... | [
{
"created": "Tue, 5 Mar 2024 08:56:30 GMT",
"version": "v1"
}
] | 2024-03-06 | [
[
"Verel",
"Sébastien",
"",
"LISIC"
],
[
"Thomson",
"Sarah",
"",
"LISIC"
],
[
"Rifki",
"Omar",
"",
"LISIC"
]
] | The Quadratic Assignment Problem (QAP) is one of the major domains in the field of evolutionary computation, and more widely in combinatorial optimization. This paper studies the phase transition of the QAP, which can be described as a dramatic change in the problem's computational complexity and satisfiability, within... |
2311.02512 | Iman Jafarian | Iman Jafarian | Cryptanalysis of Nikooghadam et al.'s lightweight authentication
protocol for Internet of Drones | 4 pages, 3 figures, 1 table | null | null | null | cs.CR | http://creativecommons.org/licenses/by/4.0/ | The Internet of Drones has emerged as a transformative technology with
applications spanning various domains, including surveillance, delivery
services, and disaster management. Secure communication between controller
users and drones is paramount to ensure the transmitted data's confidentiality,
integrity, and authe... | [
{
"created": "Tue, 4 Jul 2023 06:21:38 GMT",
"version": "v1"
}
] | 2023-11-07 | [
[
"Jafarian",
"Iman",
""
]
] | The Internet of Drones has emerged as a transformative technology with applications spanning various domains, including surveillance, delivery services, and disaster management. Secure communication between controller users and drones is paramount to ensure the transmitted data's confidentiality, integrity, and authent... |
2309.05134 | Effie Daum | Effie Daum, Maxime Vaidis, Fran\c{c}ois Pomerleau | Benchmarking ground truth trajectories with robotic total stations | Accepted and presented at IROS23, Workshop on Methods for Objective
Comparison of Results in Intelligent Robotics Research | null | null | null | cs.RO | http://creativecommons.org/licenses/by/4.0/ | Benchmarks stand as vital cornerstones in elevating SLAM algorithms within
mobile robotics. Consequently, ensuring accurate and reproducible ground truth
generation is vital for fair evaluation. A majority of outdoor ground truths
are generated by GNSS, which can lead to discrepancies over time, especially in
covered... | [
{
"created": "Sun, 10 Sep 2023 21:01:34 GMT",
"version": "v1"
},
{
"created": "Thu, 29 Feb 2024 17:39:49 GMT",
"version": "v2"
}
] | 2024-03-01 | [
[
"Daum",
"Effie",
""
],
[
"Vaidis",
"Maxime",
""
],
[
"Pomerleau",
"François",
""
]
] | Benchmarks stand as vital cornerstones in elevating SLAM algorithms within mobile robotics. Consequently, ensuring accurate and reproducible ground truth generation is vital for fair evaluation. A majority of outdoor ground truths are generated by GNSS, which can lead to discrepancies over time, especially in covered a... |
1412.5903 | Max Jaderberg | Max Jaderberg, Karen Simonyan, Andrea Vedaldi, Andrew Zisserman | Deep Structured Output Learning for Unconstrained Text Recognition | arXiv admin note: text overlap with arXiv:1406.2227 | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We develop a representation suitable for the unconstrained recognition of
words in natural images: the general case of no fixed lexicon and unknown
length.
To this end we propose a convolutional neural network (CNN) based
architecture which incorporates a Conditional Random Field (CRF) graphical
model, taking the w... | [
{
"created": "Thu, 18 Dec 2014 15:49:46 GMT",
"version": "v1"
},
{
"created": "Fri, 19 Dec 2014 17:37:37 GMT",
"version": "v2"
},
{
"created": "Mon, 22 Dec 2014 19:56:48 GMT",
"version": "v3"
},
{
"created": "Tue, 23 Dec 2014 13:17:59 GMT",
"version": "v4"
},
{
"c... | 2015-04-13 | [
[
"Jaderberg",
"Max",
""
],
[
"Simonyan",
"Karen",
""
],
[
"Vedaldi",
"Andrea",
""
],
[
"Zisserman",
"Andrew",
""
]
] | We develop a representation suitable for the unconstrained recognition of words in natural images: the general case of no fixed lexicon and unknown length. To this end we propose a convolutional neural network (CNN) based architecture which incorporates a Conditional Random Field (CRF) graphical model, taking the whole... |
1506.06833 | Francis Ferraro | Francis Ferraro, Nasrin Mostafazadeh, Ting-Hao (Kenneth) Huang, Lucy
Vanderwende, Jacob Devlin, Michel Galley, Margaret Mitchell | A Survey of Current Datasets for Vision and Language Research | To appear in EMNLP 2015, short proceedings. Dataset analysis and
discussion expanded, including an initial examination into reporting bias for
one of them. F.F. and N.M. contributed equally to this work | null | null | null | cs.CL cs.AI cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Integrating vision and language has long been a dream in work on artificial
intelligence (AI). In the past two years, we have witnessed an explosion of
work that brings together vision and language from images to videos and beyond.
The available corpora have played a crucial role in advancing this area of
research. I... | [
{
"created": "Tue, 23 Jun 2015 00:59:27 GMT",
"version": "v1"
},
{
"created": "Wed, 19 Aug 2015 04:33:37 GMT",
"version": "v2"
}
] | 2021-08-23 | [
[
"Ferraro",
"Francis",
"",
"Kenneth"
],
[
"Mostafazadeh",
"Nasrin",
"",
"Kenneth"
],
[
"Ting-Hao",
"",
"",
"Kenneth"
],
[
"Huang",
"",
""
],
[
"Vanderwende",
"Lucy",
""
],
[
"Devlin",
"Jacob",
""
],
[
"G... | Integrating vision and language has long been a dream in work on artificial intelligence (AI). In the past two years, we have witnessed an explosion of work that brings together vision and language from images to videos and beyond. The available corpora have played a crucial role in advancing this area of research. In ... |
1403.5802 | Randall Smith | Lisa F. Smith, Kimberly K. Arcand, Jeffrey K. Smith, Randall K. Smith,
Jay Bookbinder, Megan Watzke | Examining Perceptions of Astronomy Images Across Mobile Platforms | 23 pages, 1 figure; Journal of Science Communication, in press | null | null | null | cs.HC astro-ph.IM physics.ed-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Modern society has led many people to become consumers of data unlike
previous generations. How this shift in the way information is communicated and
received - including in areas of science - and affects perception and
comprehension is still an open question. This study examined one aspect of this
digital age: perce... | [
{
"created": "Sun, 23 Mar 2014 21:03:28 GMT",
"version": "v1"
}
] | 2014-03-25 | [
[
"Smith",
"Lisa F.",
""
],
[
"Arcand",
"Kimberly K.",
""
],
[
"Smith",
"Jeffrey K.",
""
],
[
"Smith",
"Randall K.",
""
],
[
"Bookbinder",
"Jay",
""
],
[
"Watzke",
"Megan",
""
]
] | Modern society has led many people to become consumers of data unlike previous generations. How this shift in the way information is communicated and received - including in areas of science - and affects perception and comprehension is still an open question. This study examined one aspect of this digital age: percept... |
2407.08071 | Noah Haeske | Noah Haeske | Viability of Low-Cost Infrared Sensors for Short Range Tracking | For program, see
https://github.com/noah-haeske/research/blob/main/experimentProgram.py For
sensor datasheet, see
https://www.st.com/en/imaging-and-photonics-solutions/vl53l7cx.html#overview | null | null | null | cs.RO cs.SY eess.SY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A classic task in robotics is tracking a target in the external environment.
There are several well-documented approaches to this problem. This paper
presents a novel approach to this problem using infrared time of flight
sensors. The use of infrared time of flight sensors is not common as a tracking
approach, typica... | [
{
"created": "Wed, 10 Jul 2024 22:15:48 GMT",
"version": "v1"
}
] | 2024-07-12 | [
[
"Haeske",
"Noah",
""
]
] | A classic task in robotics is tracking a target in the external environment. There are several well-documented approaches to this problem. This paper presents a novel approach to this problem using infrared time of flight sensors. The use of infrared time of flight sensors is not common as a tracking approach, typicall... |
2011.02578 | Kihyuk Sohn | Kihyuk Sohn, Chun-Liang Li, Jinsung Yoon, Minho Jin, Tomas Pfister | Learning and Evaluating Representations for Deep One-class
Classification | Published at International Conference on Learning Representation
(ICLR) 2021. The first two authors contributed equally | null | null | null | cs.CV | http://creativecommons.org/licenses/by/4.0/ | We present a two-stage framework for deep one-class classification. We first
learn self-supervised representations from one-class data, and then build
one-class classifiers on learned representations. The framework not only allows
to learn better representations, but also permits building one-class
classifiers that a... | [
{
"created": "Wed, 4 Nov 2020 23:33:41 GMT",
"version": "v1"
},
{
"created": "Thu, 25 Mar 2021 23:11:23 GMT",
"version": "v2"
}
] | 2021-03-29 | [
[
"Sohn",
"Kihyuk",
""
],
[
"Li",
"Chun-Liang",
""
],
[
"Yoon",
"Jinsung",
""
],
[
"Jin",
"Minho",
""
],
[
"Pfister",
"Tomas",
""
]
] | We present a two-stage framework for deep one-class classification. We first learn self-supervised representations from one-class data, and then build one-class classifiers on learned representations. The framework not only allows to learn better representations, but also permits building one-class classifiers that are... |
2007.01839 | Hado van Hasselt | Hado van Hasselt, Sephora Madjiheurem, Matteo Hessel, David Silver,
Andr\'e Barreto, Diana Borsa | Expected Eligibility Traces | AAAI, distinguished paper award | null | null | null | cs.LG cs.AI stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The question of how to determine which states and actions are responsible for
a certain outcome is known as the credit assignment problem and remains a
central research question in reinforcement learning and artificial
intelligence. Eligibility traces enable efficient credit assignment to the
recent sequence of state... | [
{
"created": "Fri, 3 Jul 2020 17:46:16 GMT",
"version": "v1"
},
{
"created": "Mon, 8 Feb 2021 13:02:30 GMT",
"version": "v2"
}
] | 2021-02-09 | [
[
"van Hasselt",
"Hado",
""
],
[
"Madjiheurem",
"Sephora",
""
],
[
"Hessel",
"Matteo",
""
],
[
"Silver",
"David",
""
],
[
"Barreto",
"André",
""
],
[
"Borsa",
"Diana",
""
]
] | The question of how to determine which states and actions are responsible for a certain outcome is known as the credit assignment problem and remains a central research question in reinforcement learning and artificial intelligence. Eligibility traces enable efficient credit assignment to the recent sequence of states ... |
2311.07096 | Seyedkhashayar Hashemi | Seyedkhashayar Hashemi, Hai Jiang and Masoud Ardakani | Optimal Configuration of Reconfigurable Intelligent Surfaces with
Arbitrary Discrete Phase Shifts | null | null | null | null | cs.IT eess.SP math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We address the reflection optimization problem for a reconfigurable
intelligent surface (RIS), where the RIS elements feature a set of
non-uniformly spaced discrete phase shifts. This is motivated by the actual
behavior of practical RIS elements, where it is shown that a uniform phase
shift assumption is not realisti... | [
{
"created": "Mon, 13 Nov 2023 05:52:55 GMT",
"version": "v1"
}
] | 2023-11-14 | [
[
"Hashemi",
"Seyedkhashayar",
""
],
[
"Jiang",
"Hai",
""
],
[
"Ardakani",
"Masoud",
""
]
] | We address the reflection optimization problem for a reconfigurable intelligent surface (RIS), where the RIS elements feature a set of non-uniformly spaced discrete phase shifts. This is motivated by the actual behavior of practical RIS elements, where it is shown that a uniform phase shift assumption is not realistic.... |
1412.8712 | Stavros Nikolopoulos D. | Stavros D. Nikolopoulos and Iosif Polenakis | Detecting Malicious Code by Exploiting Dependencies of System-call
Groups | 21 pages, 4 figures | null | null | null | cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper we present an elaborated graph-based algorithmic technique for
efficient malware detection. More precisely, we utilize the system-call
dependency graphs (or, for short ScD graphs), obtained by capturing taint
analysis traces and a set of various similarity metrics in order to detect
whether an unknown t... | [
{
"created": "Tue, 30 Dec 2014 18:06:23 GMT",
"version": "v1"
}
] | 2014-12-31 | [
[
"Nikolopoulos",
"Stavros D.",
""
],
[
"Polenakis",
"Iosif",
""
]
] | In this paper we present an elaborated graph-based algorithmic technique for efficient malware detection. More precisely, we utilize the system-call dependency graphs (or, for short ScD graphs), obtained by capturing taint analysis traces and a set of various similarity metrics in order to detect whether an unknown tes... |
2005.05359 | Jianwei Wu | Jianwei Wu, James Clause | A Pattern-based Approach to Detect and Improve Non-descriptive Test
Names | Accepted by The Journal of Systems & Software | The Journal of Systems & Software 168C (2020) 110639 | 10.1016/j.jss.2020.110639 | null | cs.SE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Unit tests are an important artifact that supports the software development
process in several ways. For example, when a test fails, its name can provide
the first step towards understanding the purpose of the test. Unfortunately,
unit tests often lack descriptive names. In this paper, we propose a new,
pattern-based... | [
{
"created": "Mon, 11 May 2020 18:08:35 GMT",
"version": "v1"
}
] | 2020-05-20 | [
[
"Wu",
"Jianwei",
""
],
[
"Clause",
"James",
""
]
] | Unit tests are an important artifact that supports the software development process in several ways. For example, when a test fails, its name can provide the first step towards understanding the purpose of the test. Unfortunately, unit tests often lack descriptive names. In this paper, we propose a new, pattern-based a... |
1707.07591 | Timo Schick | Timo Schick | Transition-Based Generation from Abstract Meaning Representations | null | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This work addresses the task of generating English sentences from Abstract
Meaning Representation (AMR) graphs. To cope with this task, we transform each
input AMR graph into a structure similar to a dependency tree and annotate it
with syntactic information by applying various predefined actions to it.
Subsequently,... | [
{
"created": "Mon, 24 Jul 2017 14:52:32 GMT",
"version": "v1"
}
] | 2017-07-25 | [
[
"Schick",
"Timo",
""
]
] | This work addresses the task of generating English sentences from Abstract Meaning Representation (AMR) graphs. To cope with this task, we transform each input AMR graph into a structure similar to a dependency tree and annotate it with syntactic information by applying various predefined actions to it. Subsequently, a... |
2001.01289 | Pawe{\l} Gawrychowski | Bart{\l}omiej Dudek, Pawe{\l} Gawrychowski, Tatiana Starikovskaya | All non-trivial variants of 3-LDT are equivalent | null | null | null | null | cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The popular 3-SUM conjecture states that there is no strongly subquadratic
time algorithm for checking if a given set of integers contains three distinct
elements that sum up to zero. A closely related problem is to check if a given
set of integers contains distinct $x_1, x_2, x_3$ such that $x_1+x_2=2x_3$.
This can ... | [
{
"created": "Sun, 5 Jan 2020 18:43:04 GMT",
"version": "v1"
}
] | 2020-01-07 | [
[
"Dudek",
"Bartłomiej",
""
],
[
"Gawrychowski",
"Paweł",
""
],
[
"Starikovskaya",
"Tatiana",
""
]
] | The popular 3-SUM conjecture states that there is no strongly subquadratic time algorithm for checking if a given set of integers contains three distinct elements that sum up to zero. A closely related problem is to check if a given set of integers contains distinct $x_1, x_2, x_3$ such that $x_1+x_2=2x_3$. This can be... |
2310.12454 | Jinhui Yin | You Li, Jinhui Yin and Yuming Lin | Rethinking the Construction of Effective Metrics for Understanding the
Mechanisms of Pretrained Language Models | Accepted by Findings of EMNLP2023 | null | null | null | cs.CL cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Pretrained language models are expected to effectively map input text to a
set of vectors while preserving the inherent relationships within the text.
Consequently, designing a white-box model to compute metrics that reflect the
presence of specific internal relations in these vectors has become a common
approach for... | [
{
"created": "Thu, 19 Oct 2023 04:16:40 GMT",
"version": "v1"
}
] | 2023-10-20 | [
[
"Li",
"You",
""
],
[
"Yin",
"Jinhui",
""
],
[
"Lin",
"Yuming",
""
]
] | Pretrained language models are expected to effectively map input text to a set of vectors while preserving the inherent relationships within the text. Consequently, designing a white-box model to compute metrics that reflect the presence of specific internal relations in these vectors has become a common approach for p... |
2102.10204 | Puoya Tabaghi | Puoya Tabaghi, Chao Pan, Eli Chien, Jianhao Peng, Olgica Milenkovic | Linear Classifiers in Product Space Forms | null | null | null | null | cs.LG stat.ML | http://creativecommons.org/licenses/by/4.0/ | Embedding methods for product spaces are powerful techniques for
low-distortion and low-dimensional representation of complex data structures.
Here, we address the new problem of linear classification in product space
forms -- products of Euclidean, spherical, and hyperbolic spaces. First, we
describe novel formulati... | [
{
"created": "Fri, 19 Feb 2021 23:29:03 GMT",
"version": "v1"
},
{
"created": "Wed, 16 Jun 2021 14:56:49 GMT",
"version": "v2"
},
{
"created": "Mon, 3 Jan 2022 16:14:34 GMT",
"version": "v3"
}
] | 2022-01-04 | [
[
"Tabaghi",
"Puoya",
""
],
[
"Pan",
"Chao",
""
],
[
"Chien",
"Eli",
""
],
[
"Peng",
"Jianhao",
""
],
[
"Milenkovic",
"Olgica",
""
]
] | Embedding methods for product spaces are powerful techniques for low-distortion and low-dimensional representation of complex data structures. Here, we address the new problem of linear classification in product space forms -- products of Euclidean, spherical, and hyperbolic spaces. First, we describe novel formulation... |
0901.3314 | Stephan Tinguely | Amos Lapidoth, Stephan Tinguely | Sending a Bi-Variate Gaussian over a Gaussian MAC | submitted to the IEEE Transactions on Information Theory | null | 10.1109/ISIT.2006.261926 | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We study the power versus distortion trade-off for the distributed
transmission of a memoryless bi-variate Gaussian source over a two-to-one
average-power limited Gaussian multiple-access channel. In this problem, each
of two separate transmitters observes a different component of a memoryless
bi-variate Gaussian sou... | [
{
"created": "Wed, 21 Jan 2009 19:14:57 GMT",
"version": "v1"
}
] | 2016-11-17 | [
[
"Lapidoth",
"Amos",
""
],
[
"Tinguely",
"Stephan",
""
]
] | We study the power versus distortion trade-off for the distributed transmission of a memoryless bi-variate Gaussian source over a two-to-one average-power limited Gaussian multiple-access channel. In this problem, each of two separate transmitters observes a different component of a memoryless bi-variate Gaussian sourc... |
2401.01923 | Xin Wang | Xin Wang, Zhongwei Wan, Arvin Hekmati, Mingyu Zong, Samiul Alam, Mi
Zhang, Bhaskar Krishnamachari | IoT in the Era of Generative AI: Vision and Challenges | 8 pages, 3 figures, 1 table | null | null | null | cs.DC cs.LG cs.NI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Advancements in Generative AI hold immense promise to push Internet of Things
(IoT) to the next level. In this article, we share our vision on IoT in the era
of Generative AI. We discuss some of the most important applications of
Generative AI in IoT-related domains. We also identify some of the most
critical challen... | [
{
"created": "Wed, 3 Jan 2024 18:08:57 GMT",
"version": "v1"
},
{
"created": "Sat, 6 Jan 2024 03:11:40 GMT",
"version": "v2"
},
{
"created": "Sun, 11 Aug 2024 15:31:20 GMT",
"version": "v3"
}
] | 2024-08-13 | [
[
"Wang",
"Xin",
""
],
[
"Wan",
"Zhongwei",
""
],
[
"Hekmati",
"Arvin",
""
],
[
"Zong",
"Mingyu",
""
],
[
"Alam",
"Samiul",
""
],
[
"Zhang",
"Mi",
""
],
[
"Krishnamachari",
"Bhaskar",
""
]
] | Advancements in Generative AI hold immense promise to push Internet of Things (IoT) to the next level. In this article, we share our vision on IoT in the era of Generative AI. We discuss some of the most important applications of Generative AI in IoT-related domains. We also identify some of the most critical challenge... |
2205.03750 | Guangmo Tong | Yifan Wang and Guangmo Tong | Learnability of Competitive Threshold Models | IJCAI-ECAI 2022 | null | null | null | cs.LG cs.SI | http://creativecommons.org/licenses/by/4.0/ | Modeling the spread of social contagions is central to various applications
in social computing. In this paper, we study the learnability of the
competitive threshold model from a theoretical perspective. We demonstrate how
competitive threshold models can be seamlessly simulated by artificial neural
networks with fi... | [
{
"created": "Sun, 8 May 2022 01:11:51 GMT",
"version": "v1"
}
] | 2022-05-10 | [
[
"Wang",
"Yifan",
""
],
[
"Tong",
"Guangmo",
""
]
] | Modeling the spread of social contagions is central to various applications in social computing. In this paper, we study the learnability of the competitive threshold model from a theoretical perspective. We demonstrate how competitive threshold models can be seamlessly simulated by artificial neural networks with fini... |
2110.07720 | Rangeet Pan | Rangeet Pan and Hridesh Rajan | Decomposing Convolutional Neural Networks into Reusable and Replaceable
Modules | Accepted at ICSE'22 | null | null | null | cs.CV | http://creativecommons.org/licenses/by/4.0/ | Training from scratch is the most common way to build a Convolutional Neural
Network (CNN) based model. What if we can build new CNN models by reusing parts
from previously build CNN models? What if we can improve a CNN model by
replacing (possibly faulty) parts with other parts? In both cases, instead of
training, c... | [
{
"created": "Mon, 11 Oct 2021 20:41:50 GMT",
"version": "v1"
},
{
"created": "Mon, 20 Dec 2021 15:43:58 GMT",
"version": "v2"
}
] | 2021-12-21 | [
[
"Pan",
"Rangeet",
""
],
[
"Rajan",
"Hridesh",
""
]
] | Training from scratch is the most common way to build a Convolutional Neural Network (CNN) based model. What if we can build new CNN models by reusing parts from previously build CNN models? What if we can improve a CNN model by replacing (possibly faulty) parts with other parts? In both cases, instead of training, can... |
2207.05669 | Matteo Bunino | Matteo Bunino | From Spectral Graph Convolutions to Large Scale Graph Convolutional
Networks | null | null | null | null | cs.LG | http://creativecommons.org/licenses/by-nc-nd/4.0/ | Graph Convolutional Networks (GCNs) have been shown to be a powerful concept
that has been successfully applied to a large variety of tasks across many
domains over the past years. In this work we study the theory that paved the
way to the definition of GCN, including related parts of classical graph
theory. We also ... | [
{
"created": "Tue, 12 Jul 2022 16:57:08 GMT",
"version": "v1"
}
] | 2022-07-13 | [
[
"Bunino",
"Matteo",
""
]
] | Graph Convolutional Networks (GCNs) have been shown to be a powerful concept that has been successfully applied to a large variety of tasks across many domains over the past years. In this work we study the theory that paved the way to the definition of GCN, including related parts of classical graph theory. We also di... |
2305.08596 | Youngjin Jin | Youngjin Jin, Eugene Jang, Jian Cui, Jin-Woo Chung, Yongjae Lee,
Seungwon Shin | DarkBERT: A Language Model for the Dark Side of the Internet | 9 pages (main paper), 17 pages (including bibliography and appendix),
to appear at the ACL 2023 Main Conference | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Recent research has suggested that there are clear differences in the
language used in the Dark Web compared to that of the Surface Web. As studies
on the Dark Web commonly require textual analysis of the domain, language
models specific to the Dark Web may provide valuable insights to researchers.
In this work, we i... | [
{
"created": "Mon, 15 May 2023 12:23:10 GMT",
"version": "v1"
},
{
"created": "Thu, 18 May 2023 05:02:29 GMT",
"version": "v2"
}
] | 2023-05-19 | [
[
"Jin",
"Youngjin",
""
],
[
"Jang",
"Eugene",
""
],
[
"Cui",
"Jian",
""
],
[
"Chung",
"Jin-Woo",
""
],
[
"Lee",
"Yongjae",
""
],
[
"Shin",
"Seungwon",
""
]
] | Recent research has suggested that there are clear differences in the language used in the Dark Web compared to that of the Surface Web. As studies on the Dark Web commonly require textual analysis of the domain, language models specific to the Dark Web may provide valuable insights to researchers. In this work, we int... |
2203.13474 | Erik Nijkamp Dr. | Erik Nijkamp, Bo Pang, Hiroaki Hayashi, Lifu Tu, Huan Wang, Yingbo
Zhou, Silvio Savarese, Caiming Xiong | CodeGen: An Open Large Language Model for Code with Multi-Turn Program
Synthesis | null | null | null | null | cs.LG cs.CL cs.PL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Program synthesis strives to generate a computer program as a solution to a
given problem specification, expressed with input-output examples or natural
language descriptions. The prevalence of large language models advances the
state-of-the-art for program synthesis, though limited training resources and
data impede... | [
{
"created": "Fri, 25 Mar 2022 06:55:15 GMT",
"version": "v1"
},
{
"created": "Mon, 28 Mar 2022 17:10:30 GMT",
"version": "v2"
},
{
"created": "Wed, 30 Mar 2022 06:57:04 GMT",
"version": "v3"
},
{
"created": "Thu, 29 Sep 2022 20:43:54 GMT",
"version": "v4"
},
{
"c... | 2023-03-01 | [
[
"Nijkamp",
"Erik",
""
],
[
"Pang",
"Bo",
""
],
[
"Hayashi",
"Hiroaki",
""
],
[
"Tu",
"Lifu",
""
],
[
"Wang",
"Huan",
""
],
[
"Zhou",
"Yingbo",
""
],
[
"Savarese",
"Silvio",
""
],
[
"Xiong",
"Cai... | Program synthesis strives to generate a computer program as a solution to a given problem specification, expressed with input-output examples or natural language descriptions. The prevalence of large language models advances the state-of-the-art for program synthesis, though limited training resources and data impede o... |
2402.05962 | Junfeng Fang | Junfeng Fang and Xinglin Li and Yongduo Sui and Yuan Gao and Guibin
Zhang and Kun Wang and Xiang Wang and Xiangnan He | EXGC: Bridging Efficiency and Explainability in Graph Condensation | null | null | null | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Graph representation learning on vast datasets, like web data, has made
significant strides. However, the associated computational and storage
overheads raise concerns. In sight of this, Graph condensation (GCond) has been
introduced to distill these large real datasets into a more concise yet
information-rich synthe... | [
{
"created": "Mon, 5 Feb 2024 06:03:38 GMT",
"version": "v1"
}
] | 2024-02-12 | [
[
"Fang",
"Junfeng",
""
],
[
"Li",
"Xinglin",
""
],
[
"Sui",
"Yongduo",
""
],
[
"Gao",
"Yuan",
""
],
[
"Zhang",
"Guibin",
""
],
[
"Wang",
"Kun",
""
],
[
"Wang",
"Xiang",
""
],
[
"He",
"Xiangnan",
... | Graph representation learning on vast datasets, like web data, has made significant strides. However, the associated computational and storage overheads raise concerns. In sight of this, Graph condensation (GCond) has been introduced to distill these large real datasets into a more concise yet information-rich syntheti... |
2403.11145 | Fuqiang Niu | Fuqiang Niu, Min Yang, Ang Li, Baoquan Zhang, Xiaojiang Peng and Bowen
Zhang | A Challenge Dataset and Effective Models for Conversational Stance
Detection | null | LREC-COLING 2024 | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Previous stance detection studies typically concentrate on evaluating stances
within individual instances, thereby exhibiting limitations in effectively
modeling multi-party discussions concerning the same specific topic, as
naturally transpire in authentic social media interactions. This constraint
arises primarily ... | [
{
"created": "Sun, 17 Mar 2024 08:51:01 GMT",
"version": "v1"
},
{
"created": "Thu, 21 Mar 2024 06:22:56 GMT",
"version": "v2"
}
] | 2024-03-22 | [
[
"Niu",
"Fuqiang",
""
],
[
"Yang",
"Min",
""
],
[
"Li",
"Ang",
""
],
[
"Zhang",
"Baoquan",
""
],
[
"Peng",
"Xiaojiang",
""
],
[
"Zhang",
"Bowen",
""
]
] | Previous stance detection studies typically concentrate on evaluating stances within individual instances, thereby exhibiting limitations in effectively modeling multi-party discussions concerning the same specific topic, as naturally transpire in authentic social media interactions. This constraint arises primarily du... |
1905.09568 | Stephan Fahrenkrog-Petersen | Stephan A. Fahrenkrog-Petersen, Niek Tax, Irene Teinemaa, Marlon
Dumas, Massimiliano de Leoni, Fabrizio Maria Maggi, Matthias Weidlich | Fire Now, Fire Later: Alarm-Based Systems for Prescriptive Process
Monitoring | null | null | null | null | cs.LG cs.AI stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Predictive process monitoring is a family of techniques to analyze events
produced during the execution of a business process in order to predict the
future state or the final outcome of running process instances. Existing
techniques in this field are able to predict, at each step of a process
instance, the likelihoo... | [
{
"created": "Thu, 23 May 2019 10:18:25 GMT",
"version": "v1"
},
{
"created": "Wed, 14 Oct 2020 12:33:08 GMT",
"version": "v2"
}
] | 2020-10-15 | [
[
"Fahrenkrog-Petersen",
"Stephan A.",
""
],
[
"Tax",
"Niek",
""
],
[
"Teinemaa",
"Irene",
""
],
[
"Dumas",
"Marlon",
""
],
[
"de Leoni",
"Massimiliano",
""
],
[
"Maggi",
"Fabrizio Maria",
""
],
[
"Weidlich",
"Ma... | Predictive process monitoring is a family of techniques to analyze events produced during the execution of a business process in order to predict the future state or the final outcome of running process instances. Existing techniques in this field are able to predict, at each step of a process instance, the likelihood ... |
2304.00009 | Siddarth Shandeep Singh | Siddarth Singh and Benjamin Rosman | The challenge of redundancy on multi-agent value factorisation | Published at the 22nd International Conference on Autonomous Agents
and Multiagent Systems (AAMAS 2023). 2 Pages, 1 Figure | null | null | null | cs.AI | http://creativecommons.org/licenses/by/4.0/ | In the field of cooperative multi-agent reinforcement learning (MARL), the
standard paradigm is the use of centralised training and decentralised
execution where a central critic conditions the policies of the cooperative
agents based on a central state. It has been shown, that in cases with large
numbers of redundan... | [
{
"created": "Tue, 28 Mar 2023 20:41:12 GMT",
"version": "v1"
}
] | 2023-04-04 | [
[
"Singh",
"Siddarth",
""
],
[
"Rosman",
"Benjamin",
""
]
] | In the field of cooperative multi-agent reinforcement learning (MARL), the standard paradigm is the use of centralised training and decentralised execution where a central critic conditions the policies of the cooperative agents based on a central state. It has been shown, that in cases with large numbers of redundant ... |
1604.04893 | Fouad Khan | Fouad Khan | An Initial Seed Selection Algorithm for K-means Clustering of
Georeferenced Data to Improve Replicability of Cluster Assignments for
Mapping Application | Applied Soft Computing 12 (2012) | null | 10.1016/j.asoc.2012.07.021 | null | cs.LG cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | K-means is one of the most widely used clustering algorithms in various
disciplines, especially for large datasets. However the method is known to be
highly sensitive to initial seed selection of cluster centers. K-means++ has
been proposed to overcome this problem and has been shown to have better
accuracy and compu... | [
{
"created": "Sun, 17 Apr 2016 16:25:15 GMT",
"version": "v1"
}
] | 2016-04-19 | [
[
"Khan",
"Fouad",
""
]
] | K-means is one of the most widely used clustering algorithms in various disciplines, especially for large datasets. However the method is known to be highly sensitive to initial seed selection of cluster centers. K-means++ has been proposed to overcome this problem and has been shown to have better accuracy and computa... |
2010.16115 | Gabriel Hondet | Gabriel Hondet (DEDUCTEAM, LSV, ENS Paris Saclay, CNRS), Fr\'ed\'eric
Blanqui (DEDUCTEAM, LSV, ENS Paris Saclay, CNRS) | The New Rewriting Engine of Dedukti | null | FSCD 2020 - 5th International Conference on Formal Structures for
Computation and Deduction, Jun 2020, Paris, France. pp.16 | 10.4230/LIPIcs.FSCD.2020.35 | null | cs.PL cs.SC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Dedukti is a type-checker for the $\lambda$$\Pi$-calculus modulo rewriting,
an extension of Edinburgh's logicalframework LF where functions and type
symbols can be defined by rewrite rules. It thereforecontains an engine for
rewriting LF terms and types according to the rewrite rules given by the user.A
key component... | [
{
"created": "Fri, 30 Oct 2020 08:19:19 GMT",
"version": "v1"
},
{
"created": "Tue, 15 Feb 2022 14:24:55 GMT",
"version": "v2"
}
] | 2022-02-16 | [
[
"Hondet",
"Gabriel",
"",
"DEDUCTEAM, LSV, ENS Paris Saclay, CNRS"
],
[
"Blanqui",
"Frédéric",
"",
"DEDUCTEAM, LSV, ENS Paris Saclay, CNRS"
]
] | Dedukti is a type-checker for the $\lambda$$\Pi$-calculus modulo rewriting, an extension of Edinburgh's logicalframework LF where functions and type symbols can be defined by rewrite rules. It thereforecontains an engine for rewriting LF terms and types according to the rewrite rules given by the user.A key component o... |
1908.09982 | Genta Indra Winata | Genta Indra Winata, Andrea Madotto, Jamin Shin, Elham J. Barezi,
Pascale Fung | On the Effectiveness of Low-Rank Matrix Factorization for LSTM Model
Compression | Accepted in PACLIC 2019 | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Despite their ubiquity in NLP tasks, Long Short-Term Memory (LSTM) networks
suffer from computational inefficiencies caused by inherent unparallelizable
recurrences, which further aggravates as LSTMs require more parameters for
larger memory capacity. In this paper, we propose to apply low-rank matrix
factorization (... | [
{
"created": "Tue, 27 Aug 2019 01:52:07 GMT",
"version": "v1"
}
] | 2019-08-28 | [
[
"Winata",
"Genta Indra",
""
],
[
"Madotto",
"Andrea",
""
],
[
"Shin",
"Jamin",
""
],
[
"Barezi",
"Elham J.",
""
],
[
"Fung",
"Pascale",
""
]
] | Despite their ubiquity in NLP tasks, Long Short-Term Memory (LSTM) networks suffer from computational inefficiencies caused by inherent unparallelizable recurrences, which further aggravates as LSTMs require more parameters for larger memory capacity. In this paper, we propose to apply low-rank matrix factorization (MF... |
2305.01700 | Lee Milburn | Lee Milburn, Juan Gamba, Miguel Fernandes, Claudio Semini | Computer-Vision Based Real Time Waypoint Generation for Autonomous
Vineyard Navigation with Quadruped Robots | Accepted to IEEE-ICARSC 2023 Conference. arXiv admin note: text
overlap with arXiv:2301.00887 | null | null | null | cs.RO | http://creativecommons.org/licenses/by-nc-nd/4.0/ | The VINUM project seeks to address the shortage of skilled labor in modern
vineyards by introducing a cutting-edge mobile robotic solution. Leveraging the
capabilities of the quadruped robot, HyQReal, this system, equipped with arm
and vision sensors, offers autonomous navigation and winter pruning of
grapevines redu... | [
{
"created": "Tue, 2 May 2023 18:08:37 GMT",
"version": "v1"
}
] | 2023-05-04 | [
[
"Milburn",
"Lee",
""
],
[
"Gamba",
"Juan",
""
],
[
"Fernandes",
"Miguel",
""
],
[
"Semini",
"Claudio",
""
]
] | The VINUM project seeks to address the shortage of skilled labor in modern vineyards by introducing a cutting-edge mobile robotic solution. Leveraging the capabilities of the quadruped robot, HyQReal, this system, equipped with arm and vision sensors, offers autonomous navigation and winter pruning of grapevines reduci... |
1210.8291 | Huanhuan Chen | Huanhuan Chen, Peter Tino, Xin Yao, and Ali Rodan | Learning in the Model Space for Fault Diagnosis | null | null | null | null | cs.LG cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The emergence of large scaled sensor networks facilitates the collection of
large amounts of real-time data to monitor and control complex engineering
systems. However, in many cases the collected data may be incomplete or
inconsistent, while the underlying environment may be time-varying or
un-formulated. In this pa... | [
{
"created": "Wed, 31 Oct 2012 10:42:32 GMT",
"version": "v1"
}
] | 2012-11-01 | [
[
"Chen",
"Huanhuan",
""
],
[
"Tino",
"Peter",
""
],
[
"Yao",
"Xin",
""
],
[
"Rodan",
"Ali",
""
]
] | The emergence of large scaled sensor networks facilitates the collection of large amounts of real-time data to monitor and control complex engineering systems. However, in many cases the collected data may be incomplete or inconsistent, while the underlying environment may be time-varying or un-formulated. In this pape... |
1701.03247 | Binnan Zhuang | Binnan Zhuang, Dongning Guo, Ermin Wei and Michael L. Honig | Scalable Spectrum Allocation and User Association in Networks with Many
Small Cells | Submiited to IEEE Transactions on Communications | null | null | null | cs.IT cs.NI math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A scalable framework is developed to allocate radio resources across a large
number of densely deployed small cells with given traffic statistics on a slow
timescale. Joint user association and spectrum allocation is first formulated
as a convex optimization problem by dividing the spectrum among all possible
transmi... | [
{
"created": "Thu, 12 Jan 2017 06:11:54 GMT",
"version": "v1"
}
] | 2017-01-13 | [
[
"Zhuang",
"Binnan",
""
],
[
"Guo",
"Dongning",
""
],
[
"Wei",
"Ermin",
""
],
[
"Honig",
"Michael L.",
""
]
] | A scalable framework is developed to allocate radio resources across a large number of densely deployed small cells with given traffic statistics on a slow timescale. Joint user association and spectrum allocation is first formulated as a convex optimization problem by dividing the spectrum among all possible transmiss... |
1203.6722 | Vinay Bettadapura | Vinay Bettadapura | Face Expression Recognition and Analysis: The State of the Art | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The automatic recognition of facial expressions has been an active research
topic since the early nineties. There have been several advances in the past
few years in terms of face detection and tracking, feature extraction
mechanisms and the techniques used for expression classification. This paper
surveys some of th... | [
{
"created": "Fri, 30 Mar 2012 05:47:59 GMT",
"version": "v1"
}
] | 2012-04-02 | [
[
"Bettadapura",
"Vinay",
""
]
] | The automatic recognition of facial expressions has been an active research topic since the early nineties. There have been several advances in the past few years in terms of face detection and tracking, feature extraction mechanisms and the techniques used for expression classification. This paper surveys some of the ... |
2103.01783 | Mauricio Aniche | Maur\'icio Aniche and Christoph Treude and Andy Zaidman | How Developers Engineer Test Cases: An Observational Study | null | null | null | null | cs.SE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | One of the main challenges that developers face when testing their systems
lies in engineering test cases that are good enough to reveal bugs. And while
our body of knowledge on software testing and automated test case generation is
already quite significant, in practice, developers are still the ones
responsible for... | [
{
"created": "Mon, 1 Mar 2021 13:20:18 GMT",
"version": "v1"
},
{
"created": "Tue, 20 Apr 2021 10:05:34 GMT",
"version": "v2"
},
{
"created": "Mon, 9 Aug 2021 18:51:11 GMT",
"version": "v3"
},
{
"created": "Sat, 6 Nov 2021 08:25:49 GMT",
"version": "v4"
}
] | 2021-11-09 | [
[
"Aniche",
"Maurício",
""
],
[
"Treude",
"Christoph",
""
],
[
"Zaidman",
"Andy",
""
]
] | One of the main challenges that developers face when testing their systems lies in engineering test cases that are good enough to reveal bugs. And while our body of knowledge on software testing and automated test case generation is already quite significant, in practice, developers are still the ones responsible for e... |
1308.0502 | James Cheney | James Cheney | Static Enforceability of XPath-Based Access Control Policies | Proceedings of the 14th International Symposium on Database
Programming Languages (DBPL 2013), August 30, 2013, Riva del Garda, Trento,
Italy | null | null | null | cs.DB cs.CR cs.LO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We consider the problem of extending XML databases with fine-grained,
high-level access control policies specified using XPath expressions. Most
prior work checks individual updates dynamically, which is expensive (requiring
worst-case execution time proportional to the size of the database). On the
other hand, stati... | [
{
"created": "Fri, 2 Aug 2013 13:52:36 GMT",
"version": "v1"
}
] | 2013-08-05 | [
[
"Cheney",
"James",
""
]
] | We consider the problem of extending XML databases with fine-grained, high-level access control policies specified using XPath expressions. Most prior work checks individual updates dynamically, which is expensive (requiring worst-case execution time proportional to the size of the database). On the other hand, static ... |
2103.12419 | Artur Sokolovsky | Artur Sokolovsky, Luca Arnaboldi, Jaume Bacardit, Thomas Gross | Volume-Centred Range Bars: Novel Interpretable Representation of
Financial Markets Designed for Machine Learning Applications | The reproducibility package available at:
https://doi.org/10.5281/zenodo.4629567 | null | null | null | cs.LG cs.AI cs.SY eess.SY q-fin.TR | http://creativecommons.org/licenses/by/4.0/ | Financial markets are a source of non-stationary multidimensional time series
which has been drawing attention for decades. Each financial instrument has its
specific changing-over-time properties, making its analysis a complex task.
Hence, improvement of understanding and development of more informative,
generalisab... | [
{
"created": "Tue, 23 Mar 2021 09:55:46 GMT",
"version": "v1"
},
{
"created": "Tue, 13 Apr 2021 14:36:44 GMT",
"version": "v2"
},
{
"created": "Thu, 13 May 2021 14:35:25 GMT",
"version": "v3"
},
{
"created": "Sun, 8 May 2022 18:23:07 GMT",
"version": "v4"
}
] | 2022-05-10 | [
[
"Sokolovsky",
"Artur",
""
],
[
"Arnaboldi",
"Luca",
""
],
[
"Bacardit",
"Jaume",
""
],
[
"Gross",
"Thomas",
""
]
] | Financial markets are a source of non-stationary multidimensional time series which has been drawing attention for decades. Each financial instrument has its specific changing-over-time properties, making its analysis a complex task. Hence, improvement of understanding and development of more informative, generalisable... |
2304.08458 | Tianji Shen | Tianji Shen, Vamoua Yachongka, Yuto Hama, Hideki Ochiai | Secrecy Design of Indoor Visible Light Communication Network under
Downlink NOMA Transmission | 30 pages, 13 figures. This work has been submitted to the IEEE for
possible publication. Copyright may be transferred without notice, after
which this version may no longer be accessible | null | null | null | cs.IT eess.SP math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this work, we investigate the transmission sum rate as well as the secrecy
sum rate of indoor visible light communication (VLC) networks for mobile
devices with the power domain non-orthogonal multiple access (NOMA)
transmission, where multiple legitimate users are equipped with photodiodes
(PDs). We introduce a b... | [
{
"created": "Mon, 17 Apr 2023 17:33:39 GMT",
"version": "v1"
},
{
"created": "Tue, 18 Apr 2023 15:07:42 GMT",
"version": "v2"
}
] | 2023-04-19 | [
[
"Shen",
"Tianji",
""
],
[
"Yachongka",
"Vamoua",
""
],
[
"Hama",
"Yuto",
""
],
[
"Ochiai",
"Hideki",
""
]
] | In this work, we investigate the transmission sum rate as well as the secrecy sum rate of indoor visible light communication (VLC) networks for mobile devices with the power domain non-orthogonal multiple access (NOMA) transmission, where multiple legitimate users are equipped with photodiodes (PDs). We introduce a bod... |
1906.03897 | Leshem Choshen | Yoav Kantor and Yoav Katz and Leshem Choshen and Edo Cohen-Karlik and
Naftali Liberman and Assaf Toledo and Amir Menczel and Noam Slonim | Learning to combine Grammatical Error Corrections | BEA 2019 | null | null | null | cs.CL cs.AI cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The field of Grammatical Error Correction (GEC) has produced various systems
to deal with focused phenomena or general text editing. We propose an automatic
way to combine black-box systems. Our method automatically detects the strength
of a system or the combination of several systems per error type, improving
preci... | [
{
"created": "Mon, 10 Jun 2019 10:57:47 GMT",
"version": "v1"
}
] | 2019-06-11 | [
[
"Kantor",
"Yoav",
""
],
[
"Katz",
"Yoav",
""
],
[
"Choshen",
"Leshem",
""
],
[
"Cohen-Karlik",
"Edo",
""
],
[
"Liberman",
"Naftali",
""
],
[
"Toledo",
"Assaf",
""
],
[
"Menczel",
"Amir",
""
],
[
"Sl... | The field of Grammatical Error Correction (GEC) has produced various systems to deal with focused phenomena or general text editing. We propose an automatic way to combine black-box systems. Our method automatically detects the strength of a system or the combination of several systems per error type, improving precisi... |
1007.3229 | Pradeepa BK | Pradeepa BK and Joy Kuri | Aggregate Download Throughput for TCP-controlled long file transfers in
a WLAN with multiple STA-AP association rates | Double columns, 3 pages, 3 figures, typos updated | null | null | null | cs.NI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We consider several WLAN stations associated at rates r1, r2, ..., rk with an
Access Point. Each station is downloading a long file from a local server,
located on the LAN to which the AP is attached. We model these simultaneous
TCP-controlled transfers using a Markov Chain. Our analytical approach leads to
a procedu... | [
{
"created": "Mon, 19 Jul 2010 18:13:56 GMT",
"version": "v1"
},
{
"created": "Mon, 21 Feb 2011 03:32:08 GMT",
"version": "v2"
}
] | 2011-02-22 | [
[
"BK",
"Pradeepa",
""
],
[
"Kuri",
"Joy",
""
]
] | We consider several WLAN stations associated at rates r1, r2, ..., rk with an Access Point. Each station is downloading a long file from a local server, located on the LAN to which the AP is attached. We model these simultaneous TCP-controlled transfers using a Markov Chain. Our analytical approach leads to a procedure... |
2404.09454 | Sepehr Dehdashtian | Sepehr Dehdashtian, Bashir Sadeghi, Vishnu Naresh Boddeti | Utility-Fairness Trade-Offs and How to Find Them | IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2024 | null | null | null | cs.CV cs.CY cs.LG | http://creativecommons.org/licenses/by/4.0/ | When building classification systems with demographic fairness
considerations, there are two objectives to satisfy: 1) maximizing utility for
the specific task and 2) ensuring fairness w.r.t. a known demographic
attribute. These objectives often compete, so optimizing both can lead to a
trade-off between utility and ... | [
{
"created": "Mon, 15 Apr 2024 04:43:53 GMT",
"version": "v1"
},
{
"created": "Wed, 24 Apr 2024 00:08:42 GMT",
"version": "v2"
}
] | 2024-04-25 | [
[
"Dehdashtian",
"Sepehr",
""
],
[
"Sadeghi",
"Bashir",
""
],
[
"Boddeti",
"Vishnu Naresh",
""
]
] | When building classification systems with demographic fairness considerations, there are two objectives to satisfy: 1) maximizing utility for the specific task and 2) ensuring fairness w.r.t. a known demographic attribute. These objectives often compete, so optimizing both can lead to a trade-off between utility and fa... |
1809.04737 | Xintao Wu | Yongkai Wu and Lu Zhang and Xintao Wu | Fairness-aware Classification: Criterion, Convexity, and Bounds | null | null | null | null | cs.LG cs.AI cs.CY stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Fairness-aware classification is receiving increasing attention in the
machine learning fields. Recently research proposes to formulate the
fairness-aware classification as constrained optimization problems. However,
several limitations exist in previous works due to the lack of a theoretical
framework for guiding th... | [
{
"created": "Thu, 13 Sep 2018 01:56:57 GMT",
"version": "v1"
}
] | 2018-09-14 | [
[
"Wu",
"Yongkai",
""
],
[
"Zhang",
"Lu",
""
],
[
"Wu",
"Xintao",
""
]
] | Fairness-aware classification is receiving increasing attention in the machine learning fields. Recently research proposes to formulate the fairness-aware classification as constrained optimization problems. However, several limitations exist in previous works due to the lack of a theoretical framework for guiding the ... |
2008.01960 | Kai Sun | Kai Sun | A Novel Approach for the Process Planning and Scheduling Problem Using
the Concept of Maximum Weighted Independent Set | null | null | null | null | cs.DC math.CO math.OC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Process Planning and Scheduling (PPS) is an essential and practical topic but
a very intractable problem in manufacturing systems. Many research use
iterative methods to solve such problems; however, they cannot achieve
satisfactory results in both quality and computational speed. Other studies
formulate scheduling p... | [
{
"created": "Wed, 5 Aug 2020 07:02:27 GMT",
"version": "v1"
},
{
"created": "Thu, 13 Aug 2020 03:07:13 GMT",
"version": "v2"
},
{
"created": "Sun, 16 Aug 2020 06:33:33 GMT",
"version": "v3"
}
] | 2020-08-18 | [
[
"Sun",
"Kai",
""
]
] | Process Planning and Scheduling (PPS) is an essential and practical topic but a very intractable problem in manufacturing systems. Many research use iterative methods to solve such problems; however, they cannot achieve satisfactory results in both quality and computational speed. Other studies formulate scheduling pro... |
1304.6763 | Joakim And\'en | Joakim And\'en, St\'ephane Mallat | Deep Scattering Spectrum | null | null | 10.1109/TSP.2014.2326991 | null | cs.SD cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A scattering transform defines a locally translation invariant representation
which is stable to time-warping deformations. It extends MFCC representations
by computing modulation spectrum coefficients of multiple orders, through
cascades of wavelet convolutions and modulus operators. Second-order scattering
coeffici... | [
{
"created": "Wed, 24 Apr 2013 21:50:03 GMT",
"version": "v1"
},
{
"created": "Fri, 10 Jan 2014 20:35:56 GMT",
"version": "v2"
}
] | 2015-06-15 | [
[
"Andén",
"Joakim",
""
],
[
"Mallat",
"Stéphane",
""
]
] | A scattering transform defines a locally translation invariant representation which is stable to time-warping deformations. It extends MFCC representations by computing modulation spectrum coefficients of multiple orders, through cascades of wavelet convolutions and modulus operators. Second-order scattering coefficien... |
2110.14859 | Nate Veldt | Nate Veldt, Austin R. Benson, Jon Kleinberg | Approximate Decomposable Submodular Function Minimization for
Cardinality-Based Components | null | null | null | null | cs.LG cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Minimizing a sum of simple submodular functions of limited support is a
special case of general submodular function minimization that has seen numerous
applications in machine learning. We develop fast techniques for instances
where components in the sum are cardinality-based, meaning they depend only on
the size of ... | [
{
"created": "Thu, 28 Oct 2021 02:36:55 GMT",
"version": "v1"
}
] | 2021-10-29 | [
[
"Veldt",
"Nate",
""
],
[
"Benson",
"Austin R.",
""
],
[
"Kleinberg",
"Jon",
""
]
] | Minimizing a sum of simple submodular functions of limited support is a special case of general submodular function minimization that has seen numerous applications in machine learning. We develop fast techniques for instances where components in the sum are cardinality-based, meaning they depend only on the size of th... |
2306.04792 | Nimrod Megiddo | Nimrod Megiddo | On the Use of Generative Models in Observational Causal Analysis | null | null | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The use of a hypothetical generative model was been suggested for causal
analysis of observational data. The very assumption of a particular model is a
commitment to a certain set of variables and therefore to a certain set of
possible causes. Estimating the joint probability distribution of can be useful
for predict... | [
{
"created": "Wed, 7 Jun 2023 21:29:49 GMT",
"version": "v1"
}
] | 2023-06-09 | [
[
"Megiddo",
"Nimrod",
""
]
] | The use of a hypothetical generative model was been suggested for causal analysis of observational data. The very assumption of a particular model is a commitment to a certain set of variables and therefore to a certain set of possible causes. Estimating the joint probability distribution of can be useful for predictin... |
2102.00769 | Yukai Shi | Yukai Shi, Sen Zhang, Chenxing Zhou, Xiaodan Liang, Xiaojun Yang,
Liang Lin | GTAE: Graph-Transformer based Auto-Encoders for Linguistic-Constrained
Text Style Transfer | The first two authors share equal-authorship;
Code:https://github.com/SenZHANG-GitHub/graph-text-style-transfer ;
benchmark: https://github.com/ykshi/text-style-transfer-benchmark | null | null | null | cs.CL cs.AI cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Non-parallel text style transfer has attracted increasing research interests
in recent years. Despite successes in transferring the style based on the
encoder-decoder framework, current approaches still lack the ability to
preserve the content and even logic of original sentences, mainly due to the
large unconstraine... | [
{
"created": "Mon, 1 Feb 2021 11:08:45 GMT",
"version": "v1"
}
] | 2021-02-02 | [
[
"Shi",
"Yukai",
""
],
[
"Zhang",
"Sen",
""
],
[
"Zhou",
"Chenxing",
""
],
[
"Liang",
"Xiaodan",
""
],
[
"Yang",
"Xiaojun",
""
],
[
"Lin",
"Liang",
""
]
] | Non-parallel text style transfer has attracted increasing research interests in recent years. Despite successes in transferring the style based on the encoder-decoder framework, current approaches still lack the ability to preserve the content and even logic of original sentences, mainly due to the large unconstrained ... |
2009.09354 | Ruturaj Raval | Ruturaj Raval | An Improved Approach of Intention Discovery with Machine Learning for
POMDP-based Dialogue Management | In addition to my thesis: https://scholar.uwindsor.ca/etd/7731/ | null | null | null | cs.AI cs.HC | http://creativecommons.org/licenses/by-nc-sa/4.0/ | An Embodied Conversational Agent (ECA) is an intelligent agent that works as
the front end of software applications to interact with users through
verbal/nonverbal expressions and to provide online assistance without the
limits of time, location, and language. To help to improve the experience of
human-computer inter... | [
{
"created": "Sun, 20 Sep 2020 05:28:36 GMT",
"version": "v1"
}
] | 2020-09-22 | [
[
"Raval",
"Ruturaj",
""
]
] | An Embodied Conversational Agent (ECA) is an intelligent agent that works as the front end of software applications to interact with users through verbal/nonverbal expressions and to provide online assistance without the limits of time, location, and language. To help to improve the experience of human-computer interac... |
2406.08106 | Juliane Weilbach | Juliane Weilbach, Sebastian Gerwinn, Karim Barsim, Martin Fr\"anzle | Counterfactual-based Root Cause Analysis for Dynamical Systems | null | null | null | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Identifying the underlying reason for a failing dynamic process or otherwise
anomalous observation is a fundamental challenge, yet has numerous industrial
applications. Identifying the failure-causing sub-system using causal
inference, one can ask the question: "Would the observed failure also occur, if
we had replac... | [
{
"created": "Wed, 12 Jun 2024 11:38:13 GMT",
"version": "v1"
}
] | 2024-06-13 | [
[
"Weilbach",
"Juliane",
""
],
[
"Gerwinn",
"Sebastian",
""
],
[
"Barsim",
"Karim",
""
],
[
"Fränzle",
"Martin",
""
]
] | Identifying the underlying reason for a failing dynamic process or otherwise anomalous observation is a fundamental challenge, yet has numerous industrial applications. Identifying the failure-causing sub-system using causal inference, one can ask the question: "Would the observed failure also occur, if we had replaced... |
2101.08095 | Jesse Sigal | Jesse Sigal | Automatic Differentiation via Effects and Handlers: An Implementation in
Frank | Appeared as short paper in PEPM'21, see
https://www.youtube.com/watch?v=BmBSJFkfL2M for associated talk | null | null | null | cs.PL cs.LG | http://creativecommons.org/licenses/by/4.0/ | Automatic differentiation (AD) is an important family of algorithms which
enables derivative based optimization. We show that AD can be simply
implemented with effects and handlers by doing so in the Frank language. By
considering how our implementation behaves in Frank's operational semantics, we
show how our code p... | [
{
"created": "Wed, 20 Jan 2021 12:34:25 GMT",
"version": "v1"
}
] | 2021-01-21 | [
[
"Sigal",
"Jesse",
""
]
] | Automatic differentiation (AD) is an important family of algorithms which enables derivative based optimization. We show that AD can be simply implemented with effects and handlers by doing so in the Frank language. By considering how our implementation behaves in Frank's operational semantics, we show how our code per... |
2406.17815 | Alireza Hosseini | Alireza Hosseini, Amirhossein Kazerouni, Saeed Akhavan, Michael
Brudno, Babak Taati | SUM: Saliency Unification through Mamba for Visual Attention Modeling | null | null | null | null | cs.CV cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Visual attention modeling, important for interpreting and prioritizing visual
stimuli, plays a significant role in applications such as marketing,
multimedia, and robotics. Traditional saliency prediction models, especially
those based on Convolutional Neural Networks (CNNs) or Transformers, achieve
notable success b... | [
{
"created": "Tue, 25 Jun 2024 05:54:07 GMT",
"version": "v1"
}
] | 2024-06-27 | [
[
"Hosseini",
"Alireza",
""
],
[
"Kazerouni",
"Amirhossein",
""
],
[
"Akhavan",
"Saeed",
""
],
[
"Brudno",
"Michael",
""
],
[
"Taati",
"Babak",
""
]
] | Visual attention modeling, important for interpreting and prioritizing visual stimuli, plays a significant role in applications such as marketing, multimedia, and robotics. Traditional saliency prediction models, especially those based on Convolutional Neural Networks (CNNs) or Transformers, achieve notable success by ... |
1708.05106 | Arin Chaudhuri | Arin Chaudhuri, Deovrat Kakde, Carol Sadek, Laura Gonzalez, Seunghyun
Kong | The Mean and Median Criterion for Automatic Kernel Bandwidth Selection
for Support Vector Data Description | null | null | 10.1109/ICDMW.2017.116 | null | cs.LG cs.AI stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Support vector data description (SVDD) is a popular technique for detecting
anomalies. The SVDD classifier partitions the whole space into an inlier
region, which consists of the region near the training data, and an outlier
region, which consists of points away from the training data. The computation
of the SVDD cla... | [
{
"created": "Wed, 16 Aug 2017 23:38:35 GMT",
"version": "v1"
},
{
"created": "Mon, 21 Aug 2017 23:12:34 GMT",
"version": "v2"
}
] | 2018-07-23 | [
[
"Chaudhuri",
"Arin",
""
],
[
"Kakde",
"Deovrat",
""
],
[
"Sadek",
"Carol",
""
],
[
"Gonzalez",
"Laura",
""
],
[
"Kong",
"Seunghyun",
""
]
] | Support vector data description (SVDD) is a popular technique for detecting anomalies. The SVDD classifier partitions the whole space into an inlier region, which consists of the region near the training data, and an outlier region, which consists of points away from the training data. The computation of the SVDD class... |
2006.03951 | Rahul Singh | Rahul Singh, Fang Liu, Xin Liu, Ness Shroff | Contextual Bandits with Side-Observations | under review | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We investigate contextual bandits in the presence of side-observations across
arms in order to design recommendation algorithms for users connected via
social networks. Users in social networks respond to their friends' activity,
and hence provide information about each other's preferences. In our model,
when a learn... | [
{
"created": "Sat, 6 Jun 2020 19:34:50 GMT",
"version": "v1"
},
{
"created": "Fri, 23 Oct 2020 21:27:46 GMT",
"version": "v2"
}
] | 2020-10-27 | [
[
"Singh",
"Rahul",
""
],
[
"Liu",
"Fang",
""
],
[
"Liu",
"Xin",
""
],
[
"Shroff",
"Ness",
""
]
] | We investigate contextual bandits in the presence of side-observations across arms in order to design recommendation algorithms for users connected via social networks. Users in social networks respond to their friends' activity, and hence provide information about each other's preferences. In our model, when a learnin... |
2403.05308 | Biswarup Mukherjee | Anne Tryphosa Kamatham, Kavita Sharma, Srikumar Venkataraman, Biswarup
Mukherjee | Sparse Wearable Sonomyography Sensor-based Proprioceptive Proportional
Control Across Multiple Gestures | null | null | null | null | cs.HC cs.RO eess.SP | http://creativecommons.org/licenses/by-nc-nd/4.0/ | Sonomyography (SMG) is a non-invasive technique that uses ultrasound imaging
to detect the dynamic activity of muscles. Wearable SMG systems have recently
gained popularity due to their potential as human-computer interfaces for their
superior performance compared to conventional methods. This paper demonstrates
real... | [
{
"created": "Fri, 8 Mar 2024 13:38:07 GMT",
"version": "v1"
}
] | 2024-03-11 | [
[
"Kamatham",
"Anne Tryphosa",
""
],
[
"Sharma",
"Kavita",
""
],
[
"Venkataraman",
"Srikumar",
""
],
[
"Mukherjee",
"Biswarup",
""
]
] | Sonomyography (SMG) is a non-invasive technique that uses ultrasound imaging to detect the dynamic activity of muscles. Wearable SMG systems have recently gained popularity due to their potential as human-computer interfaces for their superior performance compared to conventional methods. This paper demonstrates real-t... |
2305.10703 | Yue Yu | Yue Yu, Yuchen Zhuang, Rongzhi Zhang, Yu Meng, Jiaming Shen, Chao
Zhang | ReGen: Zero-Shot Text Classification via Training Data Generation with
Progressive Dense Retrieval | ACL 2023 Findings (Code: https://github.com/yueyu1030/ReGen) | null | null | null | cs.CL cs.IR cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | With the development of large language models (LLMs), zero-shot learning has
attracted much attention for various NLP tasks. Different from prior works that
generate training data with billion-scale natural language generation (NLG)
models, we propose a retrieval-enhanced framework to create training data from
a gene... | [
{
"created": "Thu, 18 May 2023 04:30:09 GMT",
"version": "v1"
}
] | 2023-05-19 | [
[
"Yu",
"Yue",
""
],
[
"Zhuang",
"Yuchen",
""
],
[
"Zhang",
"Rongzhi",
""
],
[
"Meng",
"Yu",
""
],
[
"Shen",
"Jiaming",
""
],
[
"Zhang",
"Chao",
""
]
] | With the development of large language models (LLMs), zero-shot learning has attracted much attention for various NLP tasks. Different from prior works that generate training data with billion-scale natural language generation (NLG) models, we propose a retrieval-enhanced framework to create training data from a genera... |
2105.13573 | El Moatez Billah Nagoudi | El Moatez Billah Nagoudi, AbdelRahim Elmadany, Muhammad Abdul-Mageed | Investigating Code-Mixed Modern Standard Arabic-Egyptian to English
Machine Translation | CALCS2021, colocated with NAACL-2021 | null | null | null | cs.LG cs.CL | http://creativecommons.org/licenses/by/4.0/ | Recent progress in neural machine translation (NMT) has made it possible to
translate successfully between monolingual language pairs where large parallel
data exist, with pre-trained models improving performance even further.
Although there exists work on translating in code-mixed settings (where one of
the pairs in... | [
{
"created": "Fri, 28 May 2021 03:38:35 GMT",
"version": "v1"
}
] | 2021-05-31 | [
[
"Nagoudi",
"El Moatez Billah",
""
],
[
"Elmadany",
"AbdelRahim",
""
],
[
"Abdul-Mageed",
"Muhammad",
""
]
] | Recent progress in neural machine translation (NMT) has made it possible to translate successfully between monolingual language pairs where large parallel data exist, with pre-trained models improving performance even further. Although there exists work on translating in code-mixed settings (where one of the pairs incl... |
2110.13883 | Alexander Marx | Alexander Marx and Jonas Fischer | Estimating Mutual Information via Geodesic $k$NN | Accepted at SIAM SDM'22 | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Estimating mutual information (MI) between two continuous random variables
$X$ and $Y$ allows to capture non-linear dependencies between them,
non-parametrically. As such, MI estimation lies at the core of many data
science applications. Yet, robustly estimating MI for high-dimensional $X$ and
$Y$ is still an open re... | [
{
"created": "Tue, 26 Oct 2021 17:40:35 GMT",
"version": "v1"
},
{
"created": "Tue, 18 Jan 2022 12:59:04 GMT",
"version": "v2"
}
] | 2022-01-19 | [
[
"Marx",
"Alexander",
""
],
[
"Fischer",
"Jonas",
""
]
] | Estimating mutual information (MI) between two continuous random variables $X$ and $Y$ allows to capture non-linear dependencies between them, non-parametrically. As such, MI estimation lies at the core of many data science applications. Yet, robustly estimating MI for high-dimensional $X$ and $Y$ is still an open rese... |
1104.2690 | Nick Gravin | Ioannis Caragiannis, Angelo Fanelli, Nick Gravin, Alexander Skopalik | Efficient computation of approximate pure Nash equilibria in congestion
games | null | null | null | null | cs.GT cs.DM | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Congestion games constitute an important class of games in which computing an
exact or even approximate pure Nash equilibrium is in general {\sf
PLS}-complete. We present a surprisingly simple polynomial-time algorithm that
computes O(1)-approximate Nash equilibria in these games. In particular, for
congestion games ... | [
{
"created": "Thu, 14 Apr 2011 08:14:47 GMT",
"version": "v1"
},
{
"created": "Wed, 13 Jul 2011 18:15:02 GMT",
"version": "v2"
}
] | 2011-07-14 | [
[
"Caragiannis",
"Ioannis",
""
],
[
"Fanelli",
"Angelo",
""
],
[
"Gravin",
"Nick",
""
],
[
"Skopalik",
"Alexander",
""
]
] | Congestion games constitute an important class of games in which computing an exact or even approximate pure Nash equilibrium is in general {\sf PLS}-complete. We present a surprisingly simple polynomial-time algorithm that computes O(1)-approximate Nash equilibria in these games. In particular, for congestion games wi... |
2408.03291 | Lianwei Yang | Lianwei Yang, Haisong Gong | DopQ-ViT: Towards Distribution-Friendly and Outlier-Aware Post-Training
Quantization for Vision Transformers | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Vision transformers (ViTs) have garnered significant attention for their
performance in vision tasks; however, the high computational cost and
significant latency issues have hinder widespread adoption. Post-training
quantization (PTQ), a promising method for model compression, still faces
accuracy degradation challe... | [
{
"created": "Tue, 6 Aug 2024 16:40:04 GMT",
"version": "v1"
}
] | 2024-08-07 | [
[
"Yang",
"Lianwei",
""
],
[
"Gong",
"Haisong",
""
]
] | Vision transformers (ViTs) have garnered significant attention for their performance in vision tasks; however, the high computational cost and significant latency issues have hinder widespread adoption. Post-training quantization (PTQ), a promising method for model compression, still faces accuracy degradation challeng... |
1505.03759 | Keren Zhou | Keren Zhou, Guocheng Niu, Wuzhao Zhang, Xueqi Li, Wenqin Liu | Parse Concurrent Data Structures: BST as an Example | null | null | null | null | cs.DC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Designing concurrent data structures should follow some basic rules. By
separating the algorithms into two phases, we present guidelines for scalable
data structures, with a analysis model based on the Amadal's law. To the best
of our knowledge, we are the first to formalize a practical model for measuring
concurrent... | [
{
"created": "Thu, 14 May 2015 15:38:21 GMT",
"version": "v1"
},
{
"created": "Sat, 30 May 2015 16:29:50 GMT",
"version": "v2"
}
] | 2015-06-02 | [
[
"Zhou",
"Keren",
""
],
[
"Niu",
"Guocheng",
""
],
[
"Zhang",
"Wuzhao",
""
],
[
"Li",
"Xueqi",
""
],
[
"Liu",
"Wenqin",
""
]
] | Designing concurrent data structures should follow some basic rules. By separating the algorithms into two phases, we present guidelines for scalable data structures, with a analysis model based on the Amadal's law. To the best of our knowledge, we are the first to formalize a practical model for measuring concurrent s... |
1906.05000 | Arne K\"ohn | Max Friedrich, Arne K\"ohn, Gregor Wiedemann, Chris Biemann | Adversarial Learning of Privacy-Preserving Text Representations for
De-Identification of Medical Records | Accepted at ACL 2019; camera-ready version | null | null | null | cs.CL | http://creativecommons.org/licenses/by/4.0/ | De-identification is the task of detecting protected health information (PHI)
in medical text. It is a critical step in sanitizing electronic health records
(EHRs) to be shared for research. Automatic de-identification classifierscan
significantly speed up the sanitization process. However, obtaining a large and
dive... | [
{
"created": "Wed, 12 Jun 2019 08:29:24 GMT",
"version": "v1"
}
] | 2019-06-13 | [
[
"Friedrich",
"Max",
""
],
[
"Köhn",
"Arne",
""
],
[
"Wiedemann",
"Gregor",
""
],
[
"Biemann",
"Chris",
""
]
] | De-identification is the task of detecting protected health information (PHI) in medical text. It is a critical step in sanitizing electronic health records (EHRs) to be shared for research. Automatic de-identification classifierscan significantly speed up the sanitization process. However, obtaining a large and divers... |
2206.06357 | Haolin Yu | Haolin Yu, Kaiyang Guo, Mahdi Karami, Xi Chen, Guojun Zhang, Pascal
Poupart | Federated Bayesian Neural Regression: A Scalable Global Federated
Gaussian Process | 10 pages main text, 5 pages appendix, 5 figures | null | null | null | cs.LG | http://creativecommons.org/licenses/by/4.0/ | In typical scenarios where the Federated Learning (FL) framework applies, it
is common for clients to have insufficient training data to produce an accurate
model. Thus, models that provide not only point estimations, but also some
notion of confidence are beneficial. Gaussian Process (GP) is a powerful
Bayesian mode... | [
{
"created": "Mon, 13 Jun 2022 17:52:58 GMT",
"version": "v1"
}
] | 2022-06-14 | [
[
"Yu",
"Haolin",
""
],
[
"Guo",
"Kaiyang",
""
],
[
"Karami",
"Mahdi",
""
],
[
"Chen",
"Xi",
""
],
[
"Zhang",
"Guojun",
""
],
[
"Poupart",
"Pascal",
""
]
] | In typical scenarios where the Federated Learning (FL) framework applies, it is common for clients to have insufficient training data to produce an accurate model. Thus, models that provide not only point estimations, but also some notion of confidence are beneficial. Gaussian Process (GP) is a powerful Bayesian model ... |
2110.06703 | Jochen De Weerdt | Pieter De Koninck and Klaas Nelissen and Seppe vanden Broucke and Bart
Baesens and Monique Snoeck and Jochen De Weerdt | Expert-driven Trace Clustering with Instance-level Constraints | null | Knowl Inf Syst 63, 1197-1220 (2021) | 10.1007/s10115-021-01548-6 | null | cs.LG | http://creativecommons.org/licenses/by/4.0/ | Within the field of process mining, several different trace clustering
approaches exist for partitioning traces or process instances into similar
groups. Typically, this partitioning is based on certain patterns or similarity
between the traces, or driven by the discovery of a process model for each
cluster. The main... | [
{
"created": "Wed, 13 Oct 2021 13:18:58 GMT",
"version": "v1"
}
] | 2022-08-18 | [
[
"De Koninck",
"Pieter",
""
],
[
"Nelissen",
"Klaas",
""
],
[
"Broucke",
"Seppe vanden",
""
],
[
"Baesens",
"Bart",
""
],
[
"Snoeck",
"Monique",
""
],
[
"De Weerdt",
"Jochen",
""
]
] | Within the field of process mining, several different trace clustering approaches exist for partitioning traces or process instances into similar groups. Typically, this partitioning is based on certain patterns or similarity between the traces, or driven by the discovery of a process model for each cluster. The main d... |
1904.04176 | Ashwin Rajadesingan | Ashwin Rajadesingan, Ramaswami Mahalingam, David Jurgens | Smart, Responsible, and Upper Caste Only: Measuring Caste Attitudes
through Large-Scale Analysis of Matrimonial Profiles | 12 pages; Accepted to be published at ICWSM'19 | null | null | null | cs.SI cs.CY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Discriminatory caste attitudes currently stigmatize millions of Indians,
subjecting individuals to prejudice in all aspects of life. Governmental
incentives and societal movements have attempted to counter these attitudes,
yet accurate measurements of public opinions on caste are not yet available for
understanding w... | [
{
"created": "Mon, 8 Apr 2019 16:30:33 GMT",
"version": "v1"
}
] | 2019-04-09 | [
[
"Rajadesingan",
"Ashwin",
""
],
[
"Mahalingam",
"Ramaswami",
""
],
[
"Jurgens",
"David",
""
]
] | Discriminatory caste attitudes currently stigmatize millions of Indians, subjecting individuals to prejudice in all aspects of life. Governmental incentives and societal movements have attempted to counter these attitudes, yet accurate measurements of public opinions on caste are not yet available for understanding whe... |
2106.04011 | AkshatKumar Nigam Mr | AkshatKumar Nigam, Robert Pollice, Alan Aspuru-Guzik | JANUS: Parallel Tempered Genetic Algorithm Guided by Deep Neural
Networks for Inverse Molecular Design | 20 pages, 12 figures, 4 tables. Comments are welcome! (code will be
uploaded when paper is formally published) | null | null | null | cs.NE cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Inverse molecular design, i.e., designing molecules with specific target
properties, can be posed as an optimization problem. High-dimensional
optimization tasks in the natural sciences are commonly tackled via
population-based metaheuristic optimization algorithms such as evolutionary
algorithms. However, expensive ... | [
{
"created": "Mon, 7 Jun 2021 23:41:34 GMT",
"version": "v1"
},
{
"created": "Sat, 14 Aug 2021 20:57:26 GMT",
"version": "v2"
}
] | 2021-08-17 | [
[
"Nigam",
"AkshatKumar",
""
],
[
"Pollice",
"Robert",
""
],
[
"Aspuru-Guzik",
"Alan",
""
]
] | Inverse molecular design, i.e., designing molecules with specific target properties, can be posed as an optimization problem. High-dimensional optimization tasks in the natural sciences are commonly tackled via population-based metaheuristic optimization algorithms such as evolutionary algorithms. However, expensive pr... |
1906.01539 | Samira Abnar | Samira Abnar, Lisa Beinborn, Rochelle Choenni, Willem Zuidema | Blackbox meets blackbox: Representational Similarity and Stability
Analysis of Neural Language Models and Brains | null | 2nd BlackBoxNLP workshop @ACL2019 | null | null | cs.AI cs.CL q-bio.NC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we define and apply representational stability analysis
(ReStA), an intuitive way of analyzing neural language models. ReStA is a
variant of the popular representational similarity analysis (RSA) in cognitive
neuroscience. While RSA can be used to compare representations in models, model
components, an... | [
{
"created": "Tue, 4 Jun 2019 15:52:46 GMT",
"version": "v1"
},
{
"created": "Wed, 5 Jun 2019 09:58:34 GMT",
"version": "v2"
}
] | 2019-06-06 | [
[
"Abnar",
"Samira",
""
],
[
"Beinborn",
"Lisa",
""
],
[
"Choenni",
"Rochelle",
""
],
[
"Zuidema",
"Willem",
""
]
] | In this paper, we define and apply representational stability analysis (ReStA), an intuitive way of analyzing neural language models. ReStA is a variant of the popular representational similarity analysis (RSA) in cognitive neuroscience. While RSA can be used to compare representations in models, model components, and ... |
2007.07032 | Christian Timmerer | Andrew Perkis, Christian Timmerer, Sabina Barakovi\'c, Jasmina
Barakovi\'c Husi\'c, S{\o}ren Bech, Sebastian Bosse, Jean Botev, Kjell
Brunnstr\"om, Luis Cruz, Katrien De Moor, Andrea de Polo Saibanti, Wouter
Durnez, Sebastian Egger-Lampl, Ulrich Engelke, Tiago H. Falk, Jes\'us
Guti\'errez, Asim Hameed, Andrew H... | QUALINET White Paper on Definitions of Immersive Media Experience (IMEx) | null | null | null | null | cs.MM | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | With the coming of age of virtual/augmented reality and interactive media,
numerous definitions, frameworks, and models of immersion have emerged across
different fields ranging from computer graphics to literary works. Immersion is
oftentimes used interchangeably with presence as both concepts are closely
related. H... | [
{
"created": "Wed, 10 Jun 2020 15:59:42 GMT",
"version": "v1"
},
{
"created": "Tue, 24 Nov 2020 23:04:36 GMT",
"version": "v2"
}
] | 2020-11-26 | [
[
"Perkis",
"Andrew",
""
],
[
"Timmerer",
"Christian",
""
],
[
"Baraković",
"Sabina",
""
],
[
"Husić",
"Jasmina Baraković",
""
],
[
"Bech",
"Søren",
""
],
[
"Bosse",
"Sebastian",
""
],
[
"Botev",
"Jean",
""
... | With the coming of age of virtual/augmented reality and interactive media, numerous definitions, frameworks, and models of immersion have emerged across different fields ranging from computer graphics to literary works. Immersion is oftentimes used interchangeably with presence as both concepts are closely related. How... |
1806.03417 | Maximilian Nickel | Maximilian Nickel, Douwe Kiela | Learning Continuous Hierarchies in the Lorentz Model of Hyperbolic
Geometry | Accepted at ICML'18 | null | null | null | cs.AI cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We are concerned with the discovery of hierarchical relationships from
large-scale unstructured similarity scores. For this purpose, we study
different models of hyperbolic space and find that learning embeddings in the
Lorentz model is substantially more efficient than in the Poincar\'e-ball
model. We show that the ... | [
{
"created": "Sat, 9 Jun 2018 05:56:50 GMT",
"version": "v1"
},
{
"created": "Sun, 8 Jul 2018 13:06:31 GMT",
"version": "v2"
}
] | 2018-07-10 | [
[
"Nickel",
"Maximilian",
""
],
[
"Kiela",
"Douwe",
""
]
] | We are concerned with the discovery of hierarchical relationships from large-scale unstructured similarity scores. For this purpose, we study different models of hyperbolic space and find that learning embeddings in the Lorentz model is substantially more efficient than in the Poincar\'e-ball model. We show that the pr... |
1804.02273 | Vyacheslav Moklev | Vyacheslav Moklev and Vladimir Ulyantsev | BFS Enumeration for Breaking Symmetries in Graphs | null | null | null | null | cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | There are numerous NP-hard combinatorial problems which involve searching for
an undirected graph satisfying a certain property. One way to solve such
problems is to translate a problem into an instance of the boolean
satisfiability (SAT) or constraint satisfaction (CSP) problem. Such reduction
usually can give rise ... | [
{
"created": "Fri, 6 Apr 2018 13:53:31 GMT",
"version": "v1"
}
] | 2018-04-09 | [
[
"Moklev",
"Vyacheslav",
""
],
[
"Ulyantsev",
"Vladimir",
""
]
] | There are numerous NP-hard combinatorial problems which involve searching for an undirected graph satisfying a certain property. One way to solve such problems is to translate a problem into an instance of the boolean satisfiability (SAT) or constraint satisfaction (CSP) problem. Such reduction usually can give rise to... |
2005.07293 | Ninareh Mehrabi | Ninareh Mehrabi, Yuzhong Huang, Fred Morstatter | Statistical Equity: A Fairness Classification Objective | null | null | null | null | cs.LG cs.AI stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Machine learning systems have been shown to propagate the societal errors of
the past. In light of this, a wealth of research focuses on designing solutions
that are "fair." Even with this abundance of work, there is no singular
definition of fairness, mainly because fairness is subjective and context
dependent. We p... | [
{
"created": "Thu, 14 May 2020 23:19:38 GMT",
"version": "v1"
}
] | 2020-05-18 | [
[
"Mehrabi",
"Ninareh",
""
],
[
"Huang",
"Yuzhong",
""
],
[
"Morstatter",
"Fred",
""
]
] | Machine learning systems have been shown to propagate the societal errors of the past. In light of this, a wealth of research focuses on designing solutions that are "fair." Even with this abundance of work, there is no singular definition of fairness, mainly because fairness is subjective and context dependent. We pro... |
2209.03069 | Durga Shree N | Durga Shree N, Sree Dharinya S, Dasari Vijayasree, Nadendla Sai Roopa,
Anugu Arun | A Review on the Process of Automated Software Testing | 7 pages, 2 figures, 2 tables | null | null | null | cs.SE | http://creativecommons.org/licenses/by/4.0/ | The requirements in automation, digitalization, and fast computations have
loaded the IT sector with expectations of highly reliable, efficient, and
cost-effective software. Given that the process of testing, verification, and
validation of software products consumes 50-75% of the total revenue if the
testing process... | [
{
"created": "Wed, 7 Sep 2022 11:06:07 GMT",
"version": "v1"
}
] | 2022-09-08 | [
[
"N",
"Durga Shree",
""
],
[
"S",
"Sree Dharinya",
""
],
[
"Vijayasree",
"Dasari",
""
],
[
"Roopa",
"Nadendla Sai",
""
],
[
"Arun",
"Anugu",
""
]
] | The requirements in automation, digitalization, and fast computations have loaded the IT sector with expectations of highly reliable, efficient, and cost-effective software. Given that the process of testing, verification, and validation of software products consumes 50-75% of the total revenue if the testing process i... |
2208.07362 | Subodh Mishra | Subodh Mishra, Sushruth Nagesh, Sagar Manglani, Graham Mills, Punarjay
Chakravarty, Gaurav Pandey | Look Both Ways: Bidirectional Visual Sensing for Automatic Multi-Camera
Registration | null | null | null | null | cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This work describes the automatic registration of a large network
(approximately 40) of fixed, ceiling-mounted environment cameras spread over a
large area (approximately 800 squared meters) using a mobile calibration robot
equipped with a single upward-facing fisheye camera and a backlit ArUco marker
for easy detect... | [
{
"created": "Mon, 15 Aug 2022 17:55:55 GMT",
"version": "v1"
},
{
"created": "Fri, 7 Oct 2022 23:19:58 GMT",
"version": "v2"
}
] | 2022-10-11 | [
[
"Mishra",
"Subodh",
""
],
[
"Nagesh",
"Sushruth",
""
],
[
"Manglani",
"Sagar",
""
],
[
"Mills",
"Graham",
""
],
[
"Chakravarty",
"Punarjay",
""
],
[
"Pandey",
"Gaurav",
""
]
] | This work describes the automatic registration of a large network (approximately 40) of fixed, ceiling-mounted environment cameras spread over a large area (approximately 800 squared meters) using a mobile calibration robot equipped with a single upward-facing fisheye camera and a backlit ArUco marker for easy detectio... |
1710.02447 | Bernease Herman | Bernease Herman (1), Gundula Proksch (1), Rachel Berney (1), Hillary
Dawkins (1), Jacob Kovacs (1), Yahui Ma (1), Jacob Rich (2), Amanda Tan (1)
((1) U. of Washington, (2) U. of Wisconsin) | Data science for urban equity: Making gentrification an accessible topic
for data scientists, policymakers, and the community | Presented at the Data For Good Exchange 2017 | null | null | null | cs.CY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The University of Washington eScience Institute runs an annual Data Science
for Social Good (DSSG) program that selects four projects each year to train
students from a wide range of disciplines while helping community members
execute social good projects, often with an urban focus.
We present observations and deli... | [
{
"created": "Fri, 6 Oct 2017 15:24:57 GMT",
"version": "v1"
}
] | 2017-10-09 | [
[
"Herman",
"Bernease",
"",
"U. of Washington"
],
[
"Proksch",
"Gundula",
"",
"U. of Washington"
],
[
"Berney",
"Rachel",
"",
"U. of Washington"
],
[
"Dawkins",
"Hillary",
"",
"U. of Washington"
],
[
"Kovacs",
"Jacob",
"",
... | The University of Washington eScience Institute runs an annual Data Science for Social Good (DSSG) program that selects four projects each year to train students from a wide range of disciplines while helping community members execute social good projects, often with an urban focus. We present observations and delibera... |
1808.06497 | Keting Lu | Keting Lu, Shiqi Zhang, Xiaoping Chen | Goal-oriented Dialogue Policy Learning from Failures | null | null | null | null | cs.AI cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Reinforcement learning methods have been used for learning dialogue policies.
However, learning an effective dialogue policy frequently requires
prohibitively many conversations. This is partly because of the sparse rewards
in dialogues, and the very few successful dialogues in early learning phase.
Hindsight experie... | [
{
"created": "Mon, 20 Aug 2018 15:04:30 GMT",
"version": "v1"
},
{
"created": "Thu, 22 Nov 2018 13:51:34 GMT",
"version": "v2"
}
] | 2018-11-26 | [
[
"Lu",
"Keting",
""
],
[
"Zhang",
"Shiqi",
""
],
[
"Chen",
"Xiaoping",
""
]
] | Reinforcement learning methods have been used for learning dialogue policies. However, learning an effective dialogue policy frequently requires prohibitively many conversations. This is partly because of the sparse rewards in dialogues, and the very few successful dialogues in early learning phase. Hindsight experienc... |
2406.06908 | Shuaiyi Huang | Shuaiyi Huang, Saksham Suri, Kamal Gupta, Sai Saketh Rambhatla,
Ser-nam Lim, Abhinav Shrivastava | UVIS: Unsupervised Video Instance Segmentation | CVPR2024 Workshop | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Video instance segmentation requires classifying, segmenting, and tracking
every object across video frames. Unlike existing approaches that rely on
masks, boxes, or category labels, we propose UVIS, a novel Unsupervised Video
Instance Segmentation (UVIS) framework that can perform video instance
segmentation without... | [
{
"created": "Tue, 11 Jun 2024 03:05:50 GMT",
"version": "v1"
}
] | 2024-06-12 | [
[
"Huang",
"Shuaiyi",
""
],
[
"Suri",
"Saksham",
""
],
[
"Gupta",
"Kamal",
""
],
[
"Rambhatla",
"Sai Saketh",
""
],
[
"Lim",
"Ser-nam",
""
],
[
"Shrivastava",
"Abhinav",
""
]
] | Video instance segmentation requires classifying, segmenting, and tracking every object across video frames. Unlike existing approaches that rely on masks, boxes, or category labels, we propose UVIS, a novel Unsupervised Video Instance Segmentation (UVIS) framework that can perform video instance segmentation without a... |
1110.4034 | Ian Pratt-Hartmann | Roman Kontchakov and Yavor Nenov and Ian Pratt-Hartmann and Michael
Zakharyaschev | Topological Logics with Connectedness over Euclidean Spaces | null | ACM Transactions on Computational Logic, 14(2:13), 2013 | 10.1145/2480759.2480765 | null | cs.LO math.GT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We consider the quantifier-free languages, Bc and Bc0, obtained by augmenting
the signature of Boolean algebras with a unary predicate representing,
respectively, the property of being connected, and the property of having a
connected interior. These languages are interpreted over the regular closed
sets of n-dimensi... | [
{
"created": "Tue, 18 Oct 2011 15:54:46 GMT",
"version": "v1"
}
] | 2024-04-24 | [
[
"Kontchakov",
"Roman",
""
],
[
"Nenov",
"Yavor",
""
],
[
"Pratt-Hartmann",
"Ian",
""
],
[
"Zakharyaschev",
"Michael",
""
]
] | We consider the quantifier-free languages, Bc and Bc0, obtained by augmenting the signature of Boolean algebras with a unary predicate representing, respectively, the property of being connected, and the property of having a connected interior. These languages are interpreted over the regular closed sets of n-dimension... |
2403.16368 | Xiaoyu Liu | Quan Zhang, Xiaoyu Liu, Wei Li, Hanting Chen, Junchao Liu, Jie Hu,
Zhiwei Xiong, Chun Yuan, Yunhe Wang | Distilling Semantic Priors from SAM to Efficient Image Restoration
Models | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In image restoration (IR), leveraging semantic priors from segmentation
models has been a common approach to improve performance. The recent segment
anything model (SAM) has emerged as a powerful tool for extracting advanced
semantic priors to enhance IR tasks. However, the computational cost of SAM is
prohibitive fo... | [
{
"created": "Mon, 25 Mar 2024 02:17:20 GMT",
"version": "v1"
},
{
"created": "Tue, 2 Apr 2024 10:25:07 GMT",
"version": "v2"
}
] | 2024-04-03 | [
[
"Zhang",
"Quan",
""
],
[
"Liu",
"Xiaoyu",
""
],
[
"Li",
"Wei",
""
],
[
"Chen",
"Hanting",
""
],
[
"Liu",
"Junchao",
""
],
[
"Hu",
"Jie",
""
],
[
"Xiong",
"Zhiwei",
""
],
[
"Yuan",
"Chun",
""... | In image restoration (IR), leveraging semantic priors from segmentation models has been a common approach to improve performance. The recent segment anything model (SAM) has emerged as a powerful tool for extracting advanced semantic priors to enhance IR tasks. However, the computational cost of SAM is prohibitive for ... |
2210.13371 | Yuan Gao | Yuan Gao, Yukai Gong, Victor Paredes, Ayonga Hereid, Yan Gu | Time-Varying ALIP Model and Robust Foot-Placement Control for
Underactuated Bipedal Robot Walking on a Swaying Rigid Surface | null | null | null | null | cs.RO | http://creativecommons.org/licenses/by/4.0/ | Controller design for bipedal walking on dynamic rigid surfaces (DRSes),
which are rigid surfaces moving in the inertial frame (e.g., ships and
airplanes), remains largely uninvestigated. This paper introduces a
hierarchical control approach that achieves stable underactuated bipedal robot
walking on a horizontally o... | [
{
"created": "Mon, 24 Oct 2022 16:12:51 GMT",
"version": "v1"
},
{
"created": "Tue, 29 Nov 2022 19:34:39 GMT",
"version": "v2"
}
] | 2022-12-01 | [
[
"Gao",
"Yuan",
""
],
[
"Gong",
"Yukai",
""
],
[
"Paredes",
"Victor",
""
],
[
"Hereid",
"Ayonga",
""
],
[
"Gu",
"Yan",
""
]
] | Controller design for bipedal walking on dynamic rigid surfaces (DRSes), which are rigid surfaces moving in the inertial frame (e.g., ships and airplanes), remains largely uninvestigated. This paper introduces a hierarchical control approach that achieves stable underactuated bipedal robot walking on a horizontally osc... |
2201.11932 | Shiyu Wang | Shiyu Wang, Xiaojie Guo, Liang Zhao | Deep Generative Model for Periodic Graphs | This paper has been accepted by NeurIPS 2022 | null | null | null | cs.LG | http://creativecommons.org/licenses/by/4.0/ | Periodic graphs are graphs consisting of repetitive local structures, such as
crystal nets and polygon mesh. Their generative modeling has great potential in
real-world applications such as material design and graphics synthesis.
Classical models either rely on domain-specific predefined generation
principles (e.g., ... | [
{
"created": "Fri, 28 Jan 2022 04:56:28 GMT",
"version": "v1"
},
{
"created": "Fri, 30 Sep 2022 23:48:31 GMT",
"version": "v2"
},
{
"created": "Wed, 5 Oct 2022 17:48:08 GMT",
"version": "v3"
},
{
"created": "Thu, 6 Oct 2022 00:33:20 GMT",
"version": "v4"
}
] | 2022-10-07 | [
[
"Wang",
"Shiyu",
""
],
[
"Guo",
"Xiaojie",
""
],
[
"Zhao",
"Liang",
""
]
] | Periodic graphs are graphs consisting of repetitive local structures, such as crystal nets and polygon mesh. Their generative modeling has great potential in real-world applications such as material design and graphics synthesis. Classical models either rely on domain-specific predefined generation principles (e.g., in... |
2202.09470 | Max von Hippel | Maria Leonor Pacheco, Max von Hippel, Ben Weintraub, Dan Goldwasser,
Cristina Nita-Rotaru | Automated Attack Synthesis by Extracting Finite State Machines from
Protocol Specification Documents | To appear in IEEE Security and Privacy, 2022 | null | null | null | cs.CR cs.CL cs.FL cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Automated attack discovery techniques, such as attacker synthesis or
model-based fuzzing, provide powerful ways to ensure network protocols operate
correctly and securely. Such techniques, in general, require a formal
representation of the protocol, often in the form of a finite state machine
(FSM). Unfortunately, ma... | [
{
"created": "Fri, 18 Feb 2022 23:27:29 GMT",
"version": "v1"
}
] | 2022-02-24 | [
[
"Pacheco",
"Maria Leonor",
""
],
[
"von Hippel",
"Max",
""
],
[
"Weintraub",
"Ben",
""
],
[
"Goldwasser",
"Dan",
""
],
[
"Nita-Rotaru",
"Cristina",
""
]
] | Automated attack discovery techniques, such as attacker synthesis or model-based fuzzing, provide powerful ways to ensure network protocols operate correctly and securely. Such techniques, in general, require a formal representation of the protocol, often in the form of a finite state machine (FSM). Unfortunately, many... |
cs/0605107 | Daowen Qiu | Daowen Qiu, Fuchun Liu | Fuzzy Discrete Event Systems under Fuzzy Observability and a
test-algorithm | A further revised version to appear in IEEE Trans. Fuzzy Systems | IEEE Transactions on Fuzzy Systems, 2009, 17 (3): 578-589. | null | null | cs.LO | null | In order to more effectively cope with the real-world problems of vagueness,
impreciseness, and subjectivity, fuzzy discrete event systems (FDESs) were
proposed recently. Notably, FDESs have been applied to biomedical control for
HIV/AIDS treatment planning and sensory information processing for robotic
control. Qiu,... | [
{
"created": "Wed, 24 May 2006 15:41:00 GMT",
"version": "v1"
},
{
"created": "Tue, 24 Apr 2007 04:27:12 GMT",
"version": "v2"
},
{
"created": "Sun, 7 Oct 2007 02:32:38 GMT",
"version": "v3"
}
] | 2010-03-10 | [
[
"Qiu",
"Daowen",
""
],
[
"Liu",
"Fuchun",
""
]
] | In order to more effectively cope with the real-world problems of vagueness, impreciseness, and subjectivity, fuzzy discrete event systems (FDESs) were proposed recently. Notably, FDESs have been applied to biomedical control for HIV/AIDS treatment planning and sensory information processing for robotic control. Qiu, C... |
1706.09976 | Michael Skirpan | Michael Skirpan and Micha Gorelick | The Authority of "Fair" in Machine Learning | Presented as a talk at the 2017 Workshop on Fairness, Accountability,
and Transparency in Machine Learning (FAT/ML 2017) | null | null | null | cs.CY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we argue for the adoption of a normative definition of
fairness within the machine learning community. After characterizing this
definition, we review the current literature of Fair ML in light of its
implications. We end by suggesting ways to incorporate a broader community and
generate further debate... | [
{
"created": "Thu, 29 Jun 2017 23:37:34 GMT",
"version": "v1"
},
{
"created": "Fri, 7 Jul 2017 17:54:48 GMT",
"version": "v2"
}
] | 2017-07-10 | [
[
"Skirpan",
"Michael",
""
],
[
"Gorelick",
"Micha",
""
]
] | In this paper, we argue for the adoption of a normative definition of fairness within the machine learning community. After characterizing this definition, we review the current literature of Fair ML in light of its implications. We end by suggesting ways to incorporate a broader community and generate further debate a... |
2311.14081 | Hana Chockler | David A. Kelly, Hana Chockler, Daniel Kroening, Nathan Blake, Aditi
Ramaswamy, Melane Navaratnarajah, Aaditya Shivakumar | You Only Explain Once | null | null | null | null | cs.CV | http://creativecommons.org/licenses/by/4.0/ | In this paper, we propose a new black-box explainability algorithm and tool,
YO-ReX, for efficient explanation of the outputs of object detectors. The new
algorithm computes explanations for all objects detected in the image
simultaneously. Hence, compared to the baseline, the new algorithm reduces the
number of quer... | [
{
"created": "Thu, 23 Nov 2023 16:19:59 GMT",
"version": "v1"
}
] | 2023-11-27 | [
[
"Kelly",
"David A.",
""
],
[
"Chockler",
"Hana",
""
],
[
"Kroening",
"Daniel",
""
],
[
"Blake",
"Nathan",
""
],
[
"Ramaswamy",
"Aditi",
""
],
[
"Navaratnarajah",
"Melane",
""
],
[
"Shivakumar",
"Aaditya",
"... | In this paper, we propose a new black-box explainability algorithm and tool, YO-ReX, for efficient explanation of the outputs of object detectors. The new algorithm computes explanations for all objects detected in the image simultaneously. Hence, compared to the baseline, the new algorithm reduces the number of querie... |
1908.02409 | Anhong Guo | Anhong Guo, Ilter Canberk, Hannah Murphy, Andr\'es Monroy-Hern\'andez,
Rajan Vaish | Blocks: Collaborative and Persistent Augmented Reality Experiences | ACM UbiComp 2019 | null | 10.1145/3351241 | null | cs.HC | http://creativecommons.org/licenses/by/4.0/ | We introduce Blocks, a mobile application that enables people to co-create AR
structures that persist in the physical environment. Using Blocks, end users
can collaborate synchronously or asynchronously, whether they are colocated or
remote. Additionally, the AR structures can be tied to a physical location or
can be... | [
{
"created": "Wed, 7 Aug 2019 00:49:35 GMT",
"version": "v1"
},
{
"created": "Wed, 14 Aug 2019 17:53:37 GMT",
"version": "v2"
}
] | 2019-08-15 | [
[
"Guo",
"Anhong",
""
],
[
"Canberk",
"Ilter",
""
],
[
"Murphy",
"Hannah",
""
],
[
"Monroy-Hernández",
"Andrés",
""
],
[
"Vaish",
"Rajan",
""
]
] | We introduce Blocks, a mobile application that enables people to co-create AR structures that persist in the physical environment. Using Blocks, end users can collaborate synchronously or asynchronously, whether they are colocated or remote. Additionally, the AR structures can be tied to a physical location or can be a... |
1804.00657 | Yuval Bahat | Yuval Bahat and Gregory Shakhnarovich | Confidence from Invariance to Image Transformations | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We develop a technique for automatically detecting the classification errors
of a pre-trained visual classifier. Our method is agnostic to the form of the
classifier, requiring access only to classifier responses to a set of inputs.
We train a parametric binary classifier (error/correct) on a representation
derived f... | [
{
"created": "Mon, 2 Apr 2018 20:38:52 GMT",
"version": "v1"
}
] | 2018-04-04 | [
[
"Bahat",
"Yuval",
""
],
[
"Shakhnarovich",
"Gregory",
""
]
] | We develop a technique for automatically detecting the classification errors of a pre-trained visual classifier. Our method is agnostic to the form of the classifier, requiring access only to classifier responses to a set of inputs. We train a parametric binary classifier (error/correct) on a representation derived fro... |
2102.07970 | Justin Fu | Justin Fu and Sergey Levine | Offline Model-Based Optimization via Normalized Maximum Likelihood
Estimation | null | null | null | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this work we consider data-driven optimization problems where one must
maximize a function given only queries at a fixed set of points. This problem
setting emerges in many domains where function evaluation is a complex and
expensive process, such as in the design of materials, vehicles, or neural
network architec... | [
{
"created": "Tue, 16 Feb 2021 06:04:27 GMT",
"version": "v1"
}
] | 2021-02-17 | [
[
"Fu",
"Justin",
""
],
[
"Levine",
"Sergey",
""
]
] | In this work we consider data-driven optimization problems where one must maximize a function given only queries at a fixed set of points. This problem setting emerges in many domains where function evaluation is a complex and expensive process, such as in the design of materials, vehicles, or neural network architectu... |
1811.01852 | Naeemul Hassan | Sameer Dhoju, Md Main Uddin Rony, Naeemul Hassan | Differences between Health Related News Articles from Reliable and
Unreliable Media | null | null | null | null | cs.SI cs.CY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this study, we examine a collection of health-related news articles
published by reliable and unreliable media outlets. Our analysis shows that
there are structural, topical, and semantic differences in the way reliable and
unreliable media outlets conduct health journalism. We argue that the findings
from this st... | [
{
"created": "Mon, 5 Nov 2018 17:17:18 GMT",
"version": "v1"
}
] | 2018-11-06 | [
[
"Dhoju",
"Sameer",
""
],
[
"Rony",
"Md Main Uddin",
""
],
[
"Hassan",
"Naeemul",
""
]
] | In this study, we examine a collection of health-related news articles published by reliable and unreliable media outlets. Our analysis shows that there are structural, topical, and semantic differences in the way reliable and unreliable media outlets conduct health journalism. We argue that the findings from this stud... |
1107.0998 | Samuel Epstein | Samuel Epstein and Margrit Betke | An Information Theoretic Representation of Agent Dynamics as Set
Intersections | null | null | null | null | cs.IT cs.AI math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We represent agents as sets of strings. Each string encodes a potential
interaction with another agent or environment. We represent the total set of
dynamics between two agents as the intersection of their respective strings, we
prove complexity properties of player interactions using Algorithmic
Information Theory. ... | [
{
"created": "Tue, 5 Jul 2011 22:23:42 GMT",
"version": "v1"
}
] | 2015-03-19 | [
[
"Epstein",
"Samuel",
""
],
[
"Betke",
"Margrit",
""
]
] | We represent agents as sets of strings. Each string encodes a potential interaction with another agent or environment. We represent the total set of dynamics between two agents as the intersection of their respective strings, we prove complexity properties of player interactions using Algorithmic Information Theory. We... |
2212.13544 | Tinghao Zhang | Tinghao Zhang, Kwok-Yan Lam, Jun Zhao, Feng Li, Huimei Han, Norziana
Jamil | Enhancing Federated Learning with spectrum allocation optimization and
device selection | This paper is accepted by IEEE/ACM Transactions on Networking | null | null | null | cs.DC eess.SP | http://creativecommons.org/licenses/by/4.0/ | Machine learning (ML) is a widely accepted means for supporting customized
services for mobile devices and applications. Federated Learning (FL), which is
a promising approach to implement machine learning while addressing data
privacy concerns, typically involves a large number of wireless mobile devices
to collect ... | [
{
"created": "Tue, 27 Dec 2022 16:32:33 GMT",
"version": "v1"
}
] | 2022-12-29 | [
[
"Zhang",
"Tinghao",
""
],
[
"Lam",
"Kwok-Yan",
""
],
[
"Zhao",
"Jun",
""
],
[
"Li",
"Feng",
""
],
[
"Han",
"Huimei",
""
],
[
"Jamil",
"Norziana",
""
]
] | Machine learning (ML) is a widely accepted means for supporting customized services for mobile devices and applications. Federated Learning (FL), which is a promising approach to implement machine learning while addressing data privacy concerns, typically involves a large number of wireless mobile devices to collect mo... |
2204.13384 | Jan Philip Wahle | Jan Philip Wahle and Terry Ruas and Saif M. Mohammad and Bela Gipp | D3: A Massive Dataset of Scholarly Metadata for Analyzing the State of
Computer Science Research | null | LREC 2022 | null | null | cs.DL cs.CL | http://creativecommons.org/licenses/by-sa/4.0/ | DBLP is the largest open-access repository of scientific articles on computer
science and provides metadata associated with publications, authors, and
venues. We retrieved more than 6 million publications from DBLP and extracted
pertinent metadata (e.g., abstracts, author affiliations, citations) from the
publication... | [
{
"created": "Thu, 28 Apr 2022 09:59:52 GMT",
"version": "v1"
},
{
"created": "Mon, 12 Sep 2022 15:07:17 GMT",
"version": "v2"
},
{
"created": "Thu, 3 Nov 2022 15:03:09 GMT",
"version": "v3"
},
{
"created": "Thu, 10 Nov 2022 10:55:39 GMT",
"version": "v4"
}
] | 2024-02-09 | [
[
"Wahle",
"Jan Philip",
""
],
[
"Ruas",
"Terry",
""
],
[
"Mohammad",
"Saif M.",
""
],
[
"Gipp",
"Bela",
""
]
] | DBLP is the largest open-access repository of scientific articles on computer science and provides metadata associated with publications, authors, and venues. We retrieved more than 6 million publications from DBLP and extracted pertinent metadata (e.g., abstracts, author affiliations, citations) from the publication t... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.