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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1408.1237 | Balaji Vasan Srinivasan | Balaji Vasan Srinivasan, Qi Hu, Nail A. Gumerov, Raghu Murtugudde,
Ramani Duraiswami | Preconditioned Krylov solvers for kernel regression | null | null | null | null | cs.NA | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A primary computational problem in kernel regression is solution of a dense
linear system with the $N\times N$ kernel matrix. Because a direct solution has
an O($N^3$) cost, iterative Krylov methods are often used with fast
matrix-vector products. For poorly conditioned problems, convergence of the
iteration is slow ... | [
{
"created": "Wed, 6 Aug 2014 10:39:59 GMT",
"version": "v1"
}
] | 2014-08-07 | [
[
"Srinivasan",
"Balaji Vasan",
""
],
[
"Hu",
"Qi",
""
],
[
"Gumerov",
"Nail A.",
""
],
[
"Murtugudde",
"Raghu",
""
],
[
"Duraiswami",
"Ramani",
""
]
] | A primary computational problem in kernel regression is solution of a dense linear system with the $N\times N$ kernel matrix. Because a direct solution has an O($N^3$) cost, iterative Krylov methods are often used with fast matrix-vector products. For poorly conditioned problems, convergence of the iteration is slow an... |
1802.09001 | Batya Kenig | Batya Kenig | The Complexity of the Possible Winner Problem over Partitioned
Preferences | null | null | null | null | cs.GT cs.CC cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The Possible-Winner problem asks, given an election where the voters'
preferences over the set of candidates is partially specified, whether a
distinguished candidate can become a winner. In this work, we consider the
computational complexity of Possible-Winner under the assumption that the voter
preferences are $par... | [
{
"created": "Sun, 25 Feb 2018 13:21:40 GMT",
"version": "v1"
}
] | 2018-02-27 | [
[
"Kenig",
"Batya",
""
]
] | The Possible-Winner problem asks, given an election where the voters' preferences over the set of candidates is partially specified, whether a distinguished candidate can become a winner. In this work, we consider the computational complexity of Possible-Winner under the assumption that the voter preferences are $parti... |
2202.09836 | Alexander Steen | Alexander Steen, David Fuenmayor, Tobias Glei{\ss}ner, Geoff
Sutcliffe, Christoph Benzm\"uller | Automated Reasoning in Non-classical Logics in the TPTP World | 21 pages | null | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Non-classical logics are used in a wide spectrum of disciplines, including
artificial intelligence, computer science, mathematics, and philosophy. The
de-facto standard infrastructure for automated theorem proving, the TPTP World,
currently supports only classical logics. Similar standards for non-classical
logic rea... | [
{
"created": "Sun, 20 Feb 2022 15:29:30 GMT",
"version": "v1"
}
] | 2022-02-22 | [
[
"Steen",
"Alexander",
""
],
[
"Fuenmayor",
"David",
""
],
[
"Gleißner",
"Tobias",
""
],
[
"Sutcliffe",
"Geoff",
""
],
[
"Benzmüller",
"Christoph",
""
]
] | Non-classical logics are used in a wide spectrum of disciplines, including artificial intelligence, computer science, mathematics, and philosophy. The de-facto standard infrastructure for automated theorem proving, the TPTP World, currently supports only classical logics. Similar standards for non-classical logic reaso... |
1606.07143 | Justin Hsu | Gilles Barthe, No\'emie Fong, Marco Gaboardi, Benjamin Gr\'egoire,
Justin Hsu, Pierre-Yves Strub | Advanced Probabilistic Couplings for Differential Privacy | null | null | 10.1145/2976749.2978391 | null | cs.LO cs.DS cs.PL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Differential privacy is a promising formal approach to data privacy, which
provides a quantitative bound on the privacy cost of an algorithm that operates
on sensitive information. Several tools have been developed for the formal
verification of differentially private algorithms, including program logics and
type sys... | [
{
"created": "Thu, 23 Jun 2016 00:11:57 GMT",
"version": "v1"
},
{
"created": "Wed, 17 Aug 2016 16:22:57 GMT",
"version": "v2"
}
] | 2018-03-16 | [
[
"Barthe",
"Gilles",
""
],
[
"Fong",
"Noémie",
""
],
[
"Gaboardi",
"Marco",
""
],
[
"Grégoire",
"Benjamin",
""
],
[
"Hsu",
"Justin",
""
],
[
"Strub",
"Pierre-Yves",
""
]
] | Differential privacy is a promising formal approach to data privacy, which provides a quantitative bound on the privacy cost of an algorithm that operates on sensitive information. Several tools have been developed for the formal verification of differentially private algorithms, including program logics and type syste... |
2303.04554 | Leonardo Scabini | Leonardo Scabini, Kallil M. Zielinski, Lucas C. Ribas, Wesley N.
Gon\c{c}alves, Bernard De Baets, Odemir M. Bruno | RADAM: Texture Recognition through Randomized Aggregated Encoding of
Deep Activation Maps | 17 pages, 3 figures, submitted to peer-review journal | null | null | null | cs.CV cs.NE | http://creativecommons.org/licenses/by-nc-nd/4.0/ | Texture analysis is a classical yet challenging task in computer vision for
which deep neural networks are actively being applied. Most approaches are
based on building feature aggregation modules around a pre-trained backbone and
then fine-tuning the new architecture on specific texture recognition tasks.
Here we pr... | [
{
"created": "Wed, 8 Mar 2023 13:09:03 GMT",
"version": "v1"
}
] | 2023-03-09 | [
[
"Scabini",
"Leonardo",
""
],
[
"Zielinski",
"Kallil M.",
""
],
[
"Ribas",
"Lucas C.",
""
],
[
"Gonçalves",
"Wesley N.",
""
],
[
"De Baets",
"Bernard",
""
],
[
"Bruno",
"Odemir M.",
""
]
] | Texture analysis is a classical yet challenging task in computer vision for which deep neural networks are actively being applied. Most approaches are based on building feature aggregation modules around a pre-trained backbone and then fine-tuning the new architecture on specific texture recognition tasks. Here we prop... |
1401.6482 | Aria Ghasemian Sahebi | Aria G. Sahebi and S. Sandeep Pradhan | Nested Polar Codes Achieve the Shannon Rate-Distortion Function and the
Shannon Capacity | null | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | It is shown that nested polar codes achieve the Shannon rate-distortion
function for arbitrary (binary or non-binary) discrete memoryless sources and
the Shannon capacity of arbitrary discrete memoryless channels.
| [
{
"created": "Sat, 25 Jan 2014 01:26:53 GMT",
"version": "v1"
}
] | 2014-01-28 | [
[
"Sahebi",
"Aria G.",
""
],
[
"Pradhan",
"S. Sandeep",
""
]
] | It is shown that nested polar codes achieve the Shannon rate-distortion function for arbitrary (binary or non-binary) discrete memoryless sources and the Shannon capacity of arbitrary discrete memoryless channels. |
2103.02696 | Weilin Cong | Weilin Cong, Morteza Ramezani, Mehrdad Mahdavi | On the Importance of Sampling in Training GCNs: Tighter Analysis and
Variance Reduction | null | null | null | null | cs.LG cs.AI cs.CV | http://creativecommons.org/licenses/by/4.0/ | Graph Convolutional Networks (GCNs) have achieved impressive empirical
advancement across a wide variety of semi-supervised node classification tasks.
Despite their great success, training GCNs on large graphs suffers from
computational and memory issues. A potential path to circumvent these obstacles
is sampling-bas... | [
{
"created": "Wed, 3 Mar 2021 21:31:23 GMT",
"version": "v1"
},
{
"created": "Mon, 1 Nov 2021 17:26:18 GMT",
"version": "v2"
}
] | 2021-11-02 | [
[
"Cong",
"Weilin",
""
],
[
"Ramezani",
"Morteza",
""
],
[
"Mahdavi",
"Mehrdad",
""
]
] | Graph Convolutional Networks (GCNs) have achieved impressive empirical advancement across a wide variety of semi-supervised node classification tasks. Despite their great success, training GCNs on large graphs suffers from computational and memory issues. A potential path to circumvent these obstacles is sampling-based... |
2010.12546 | Erdem Koyuncu | Erdem Koyuncu | Quantizing Multiple Sources to a Common Cluster Center: An Asymptotic
Analysis | null | null | null | null | cs.LG cs.IT math.IT stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We consider quantizing an $Ld$-dimensional sample, which is obtained by
concatenating $L$ vectors from datasets of $d$-dimensional vectors, to a
$d$-dimensional cluster center. The distortion measure is the weighted sum of
$r$th powers of the distances between the cluster center and the samples. For
$L=1$, one recove... | [
{
"created": "Fri, 23 Oct 2020 17:14:28 GMT",
"version": "v1"
}
] | 2020-10-26 | [
[
"Koyuncu",
"Erdem",
""
]
] | We consider quantizing an $Ld$-dimensional sample, which is obtained by concatenating $L$ vectors from datasets of $d$-dimensional vectors, to a $d$-dimensional cluster center. The distortion measure is the weighted sum of $r$th powers of the distances between the cluster center and the samples. For $L=1$, one recovers... |
2407.11364 | Chen Wang | Vladimir Braverman, Prathamesh Dharangutte, Vihan Shah, Chen Wang | Learning-augmented Maximum Independent Set | APPROX 2024 | null | null | null | cs.DS cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We study the Maximum Independent Set (MIS) problem on general graphs within
the framework of learning-augmented algorithms. The MIS problem is known to be
NP-hard and is also NP-hard to approximate to within a factor of $n^{1-\delta}$
for any $\delta>0$. We show that we can break this barrier in the presence of
an or... | [
{
"created": "Tue, 16 Jul 2024 04:05:40 GMT",
"version": "v1"
}
] | 2024-07-17 | [
[
"Braverman",
"Vladimir",
""
],
[
"Dharangutte",
"Prathamesh",
""
],
[
"Shah",
"Vihan",
""
],
[
"Wang",
"Chen",
""
]
] | We study the Maximum Independent Set (MIS) problem on general graphs within the framework of learning-augmented algorithms. The MIS problem is known to be NP-hard and is also NP-hard to approximate to within a factor of $n^{1-\delta}$ for any $\delta>0$. We show that we can break this barrier in the presence of an orac... |
2301.05575 | Jo\~ao Mendes Lopes | Carolina Gon\c{c}alves, Jo\~ao M. Lopes, Sara Moccia, Daniele
Berardini, Lucia Migliorelli, and Cristina P. Santos | Deep learning-based approaches for human motion decoding in smart
walkers for rehabilitation | null | null | null | null | cs.CV cs.AI | http://creativecommons.org/licenses/by-nc-nd/4.0/ | Gait disabilities are among the most frequent worldwide. Their treatment
relies on rehabilitation therapies, in which smart walkers are being introduced
to empower the user's recovery and autonomy, while reducing the clinicians
effort. For that, these should be able to decode human motion and needs, as
early as possi... | [
{
"created": "Fri, 13 Jan 2023 14:29:44 GMT",
"version": "v1"
}
] | 2023-05-22 | [
[
"Gonçalves",
"Carolina",
""
],
[
"Lopes",
"João M.",
""
],
[
"Moccia",
"Sara",
""
],
[
"Berardini",
"Daniele",
""
],
[
"Migliorelli",
"Lucia",
""
],
[
"Santos",
"Cristina P.",
""
]
] | Gait disabilities are among the most frequent worldwide. Their treatment relies on rehabilitation therapies, in which smart walkers are being introduced to empower the user's recovery and autonomy, while reducing the clinicians effort. For that, these should be able to decode human motion and needs, as early as possibl... |
1904.10674 | Nicolas Audebert | Nicolas Audebert (OBELIX), Bertrand Saux, S\'ebastien Lef\`evre
(OBELIX) | Deep Learning for Classification of Hyperspectral Data: A Comparative
Review | null | null | 10.1109/MGRS.2019.2912563 | null | cs.LG cs.CV cs.NE eess.IV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In recent years, deep learning techniques revolutionized the way remote
sensing data are processed. Classification of hyperspectral data is no
exception to the rule, but has intrinsic specificities which make application
of deep learning less straightforward than with other optical data. This
article presents a state... | [
{
"created": "Wed, 24 Apr 2019 07:56:37 GMT",
"version": "v1"
}
] | 2019-04-25 | [
[
"Audebert",
"Nicolas",
"",
"OBELIX"
],
[
"Saux",
"Bertrand",
"",
"OBELIX"
],
[
"Lefèvre",
"Sébastien",
"",
"OBELIX"
]
] | In recent years, deep learning techniques revolutionized the way remote sensing data are processed. Classification of hyperspectral data is no exception to the rule, but has intrinsic specificities which make application of deep learning less straightforward than with other optical data. This article presents a state o... |
2302.13509 | Jing Liang | Jing Liang, Sanghyun Son, Ming Lin, Dinesh Manocha | GeoLCR: Attention-based Geometric Loop Closure and Registration | null | null | null | null | cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We present a novel algorithm specially designed for loop detection and
registration that utilizes Lidar-based perception. Our approach to loop
detection involves voxelizing point clouds, followed by an overlap calculation
to confirm whether a vehicle has completed a loop. We further enhance the
current pose's accurac... | [
{
"created": "Mon, 27 Feb 2023 04:16:16 GMT",
"version": "v1"
},
{
"created": "Tue, 28 Feb 2023 01:56:31 GMT",
"version": "v2"
},
{
"created": "Wed, 1 Mar 2023 18:54:09 GMT",
"version": "v3"
},
{
"created": "Thu, 2 Mar 2023 15:14:05 GMT",
"version": "v4"
},
{
"cre... | 2023-07-18 | [
[
"Liang",
"Jing",
""
],
[
"Son",
"Sanghyun",
""
],
[
"Lin",
"Ming",
""
],
[
"Manocha",
"Dinesh",
""
]
] | We present a novel algorithm specially designed for loop detection and registration that utilizes Lidar-based perception. Our approach to loop detection involves voxelizing point clouds, followed by an overlap calculation to confirm whether a vehicle has completed a loop. We further enhance the current pose's accuracy ... |
1709.00672 | Gaurav Pandey | Gaurav Pandey and Ambedkar Dukkipati | Unsupervised feature learning with discriminative encoder | 10 pages, 4 figures, International Conference on Data Mining, 2017 | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In recent years, deep discriminative models have achieved extraordinary
performance on supervised learning tasks, significantly outperforming their
generative counterparts. However, their success relies on the presence of a
large amount of labeled data. How can one use the same discriminative models
for learning usef... | [
{
"created": "Sun, 3 Sep 2017 06:40:35 GMT",
"version": "v1"
}
] | 2017-09-05 | [
[
"Pandey",
"Gaurav",
""
],
[
"Dukkipati",
"Ambedkar",
""
]
] | In recent years, deep discriminative models have achieved extraordinary performance on supervised learning tasks, significantly outperforming their generative counterparts. However, their success relies on the presence of a large amount of labeled data. How can one use the same discriminative models for learning useful... |
2310.07838 | Qingyue Zhao | Qingyue Zhao and Banghua Zhu | Towards the Fundamental Limits of Knowledge Transfer over Finite Domains | 41 pages, 2 figures; Appendix polished | null | null | null | cs.LG cs.AI cs.IT math.IT math.ST stat.ML stat.TH | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We characterize the statistical efficiency of knowledge transfer through $n$
samples from a teacher to a probabilistic student classifier with input space
$\mathcal S$ over labels $\mathcal A$. We show that privileged information at
three progressive levels accelerates the transfer. At the first level, only
samples w... | [
{
"created": "Wed, 11 Oct 2023 19:30:08 GMT",
"version": "v1"
},
{
"created": "Tue, 17 Oct 2023 15:35:41 GMT",
"version": "v2"
},
{
"created": "Sun, 12 Nov 2023 10:48:07 GMT",
"version": "v3"
},
{
"created": "Tue, 14 Nov 2023 11:26:10 GMT",
"version": "v4"
}
] | 2023-11-15 | [
[
"Zhao",
"Qingyue",
""
],
[
"Zhu",
"Banghua",
""
]
] | We characterize the statistical efficiency of knowledge transfer through $n$ samples from a teacher to a probabilistic student classifier with input space $\mathcal S$ over labels $\mathcal A$. We show that privileged information at three progressive levels accelerates the transfer. At the first level, only samples wit... |
1711.07341 | Hsin-Yuan Huang | Hsin-Yuan Huang, Chenguang Zhu, Yelong Shen, Weizhu Chen | FusionNet: Fusing via Fully-Aware Attention with Application to Machine
Comprehension | Published in Sixth International Conference on Learning
Representations (ICLR), 2018 | null | null | null | cs.CL cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper introduces a new neural structure called FusionNet, which extends
existing attention approaches from three perspectives. First, it puts forward a
novel concept of "history of word" to characterize attention information from
the lowest word-level embedding up to the highest semantic-level
representation. Se... | [
{
"created": "Thu, 16 Nov 2017 03:52:41 GMT",
"version": "v1"
},
{
"created": "Sun, 4 Feb 2018 04:56:45 GMT",
"version": "v2"
}
] | 2018-02-06 | [
[
"Huang",
"Hsin-Yuan",
""
],
[
"Zhu",
"Chenguang",
""
],
[
"Shen",
"Yelong",
""
],
[
"Chen",
"Weizhu",
""
]
] | This paper introduces a new neural structure called FusionNet, which extends existing attention approaches from three perspectives. First, it puts forward a novel concept of "history of word" to characterize attention information from the lowest word-level embedding up to the highest semantic-level representation. Seco... |
1307.4165 | Neetu Goel | Neetu Goel and R.B. Garg | A Comparative Study of CPU Scheduling Algorithms | null | International Journal of Graphics & Image Processing |Vol 2|issue
4|November 2012 | null | null | cs.OS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Developing CPU scheduling algorithms and understanding their impact in
practice can be difficult and time consuming due to the need to modify and test
operating system kernel code and measure the resulting performance on a
consistent workload of real applications. As processor is the important
resource, CPU schedulin... | [
{
"created": "Tue, 16 Jul 2013 05:21:34 GMT",
"version": "v1"
}
] | 2013-07-17 | [
[
"Goel",
"Neetu",
""
],
[
"Garg",
"R. B.",
""
]
] | Developing CPU scheduling algorithms and understanding their impact in practice can be difficult and time consuming due to the need to modify and test operating system kernel code and measure the resulting performance on a consistent workload of real applications. As processor is the important resource, CPU scheduling ... |
1701.03529 | Jonas Szutkoski | Luiz E. Allem, Juliane Capaverde, Mark van Hoeij, Jonas Szutkoski | Functional Decomposition using Principal Subfields | 8 pages, accepted for ISSAC'17 | null | 10.1145/3087604.3087608 | null | cs.SC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Let $f\in K(t)$ be a univariate rational function. It is well known that any
non-trivial decomposition $g \circ h$, with $g,h\in K(t)$, corresponds to a
non-trivial subfield $K(f(t))\subsetneq L \subsetneq K(t)$ and vice-versa. In
this paper we use the idea of principal subfields and fast
subfield-intersection techni... | [
{
"created": "Thu, 12 Jan 2017 23:14:56 GMT",
"version": "v1"
},
{
"created": "Fri, 26 May 2017 19:31:14 GMT",
"version": "v2"
}
] | 2017-05-30 | [
[
"Allem",
"Luiz E.",
""
],
[
"Capaverde",
"Juliane",
""
],
[
"van Hoeij",
"Mark",
""
],
[
"Szutkoski",
"Jonas",
""
]
] | Let $f\in K(t)$ be a univariate rational function. It is well known that any non-trivial decomposition $g \circ h$, with $g,h\in K(t)$, corresponds to a non-trivial subfield $K(f(t))\subsetneq L \subsetneq K(t)$ and vice-versa. In this paper we use the idea of principal subfields and fast subfield-intersection techniqu... |
1802.01447 | Lijun Zhao | Lijun Zhao, Huihui Bai, Feng Li, Anhong Wang and Yao Zhao | Mixed-Resolution Image Representation and Compression with Convolutional
Neural Networks | 5 pages, and 2 figures. arXiv admin note: substantial text overlap
with arXiv:1712.05969 | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we propose an end-to-end mixed-resolution image compression
framework with convolutional neural networks. Firstly, given one input image,
feature description neural network (FDNN) is used to generate a new
representation of this image, so that this image representation can be more
efficiently compresse... | [
{
"created": "Fri, 2 Feb 2018 08:57:44 GMT",
"version": "v1"
},
{
"created": "Wed, 1 Aug 2018 03:26:44 GMT",
"version": "v2"
}
] | 2018-08-03 | [
[
"Zhao",
"Lijun",
""
],
[
"Bai",
"Huihui",
""
],
[
"Li",
"Feng",
""
],
[
"Wang",
"Anhong",
""
],
[
"Zhao",
"Yao",
""
]
] | In this paper, we propose an end-to-end mixed-resolution image compression framework with convolutional neural networks. Firstly, given one input image, feature description neural network (FDNN) is used to generate a new representation of this image, so that this image representation can be more efficiently compressed ... |
1903.02149 | Xie De | Chao Li, Cheng Deng, Lei Wang, De Xie, Xianglong Liu | Coupled CycleGAN: Unsupervised Hashing Network for Cross-Modal Retrieval | null | null | null | null | cs.IR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In recent years, hashing has attracted more and more attention owing to its
superior capacity of low storage cost and high query efficiency in large-scale
cross-modal retrieval. Benefiting from deep leaning, continuously compelling
results in cross-modal retrieval community have been achieved. However,
existing deep ... | [
{
"created": "Wed, 6 Mar 2019 03:09:20 GMT",
"version": "v1"
}
] | 2019-03-07 | [
[
"Li",
"Chao",
""
],
[
"Deng",
"Cheng",
""
],
[
"Wang",
"Lei",
""
],
[
"Xie",
"De",
""
],
[
"Liu",
"Xianglong",
""
]
] | In recent years, hashing has attracted more and more attention owing to its superior capacity of low storage cost and high query efficiency in large-scale cross-modal retrieval. Benefiting from deep leaning, continuously compelling results in cross-modal retrieval community have been achieved. However, existing deep cr... |
1705.03865 | Akshay Gupta | Akshay Kumar Gupta | Survey of Visual Question Answering: Datasets and Techniques | 10 pages, 3 figures, 3 tables Added references, corrected typos, made
references less wordy | null | null | null | cs.CL cs.AI cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Visual question answering (or VQA) is a new and exciting problem that
combines natural language processing and computer vision techniques. We present
a survey of the various datasets and models that have been used to tackle this
task. The first part of the survey details the various datasets for VQA and
compares them... | [
{
"created": "Wed, 10 May 2017 17:30:17 GMT",
"version": "v1"
},
{
"created": "Thu, 11 May 2017 06:46:52 GMT",
"version": "v2"
}
] | 2017-05-12 | [
[
"Gupta",
"Akshay Kumar",
""
]
] | Visual question answering (or VQA) is a new and exciting problem that combines natural language processing and computer vision techniques. We present a survey of the various datasets and models that have been used to tackle this task. The first part of the survey details the various datasets for VQA and compares them a... |
2308.16708 | Sebastian Lubos | Sebastian Lubos, Thi Ngoc Trang Tran, Seda Polat Erdeniz, Merfat El
Mansi, Alexander Felfernig, Manfred Wundara and Gerhard Leitner | Concentrating on the Impact: Consequence-based Explanations in
Recommender Systems | The paper was presented at IntRS'23: Joint Workshop on Interfaces and
Human Decision Making for Recommender Systems, September 18, 2023, Singapore.
and is published in the workshop proceedings: https://ceur-ws.org/Vol-3534/ | null | null | null | cs.IR cs.HC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Recommender systems assist users in decision-making, where the presentation
of recommended items and their explanations are critical factors for enhancing
the overall user experience. Although various methods for generating
explanations have been proposed, there is still room for improvement,
particularly for users w... | [
{
"created": "Thu, 31 Aug 2023 13:24:57 GMT",
"version": "v1"
},
{
"created": "Tue, 3 Oct 2023 14:14:43 GMT",
"version": "v2"
},
{
"created": "Fri, 3 Nov 2023 12:02:49 GMT",
"version": "v3"
}
] | 2023-11-06 | [
[
"Lubos",
"Sebastian",
""
],
[
"Tran",
"Thi Ngoc Trang",
""
],
[
"Erdeniz",
"Seda Polat",
""
],
[
"Mansi",
"Merfat El",
""
],
[
"Felfernig",
"Alexander",
""
],
[
"Wundara",
"Manfred",
""
],
[
"Leitner",
"Gerhard... | Recommender systems assist users in decision-making, where the presentation of recommended items and their explanations are critical factors for enhancing the overall user experience. Although various methods for generating explanations have been proposed, there is still room for improvement, particularly for users who... |
1512.02831 | Fabian Gieseke | Fabian Gieseke and Cosmin Eugen Oancea and Ashish Mahabal and
Christian Igel and Tom Heskes | Bigger Buffer k-d Trees on Multi-Many-Core Systems | null | null | null | null | cs.DC cs.DS cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A buffer k-d tree is a k-d tree variant for massively-parallel nearest
neighbor search. While providing valuable speed-ups on modern many-core devices
in case both a large number of reference and query points are given, buffer k-d
trees are limited by the amount of points that can fit on a single device. In
this work... | [
{
"created": "Wed, 9 Dec 2015 12:28:12 GMT",
"version": "v1"
}
] | 2015-12-10 | [
[
"Gieseke",
"Fabian",
""
],
[
"Oancea",
"Cosmin Eugen",
""
],
[
"Mahabal",
"Ashish",
""
],
[
"Igel",
"Christian",
""
],
[
"Heskes",
"Tom",
""
]
] | A buffer k-d tree is a k-d tree variant for massively-parallel nearest neighbor search. While providing valuable speed-ups on modern many-core devices in case both a large number of reference and query points are given, buffer k-d trees are limited by the amount of points that can fit on a single device. In this work, ... |
2110.07959 | Zhiwei Tang | Zhiwei Tang, Tsung-Hui Chang, Xiaojing Ye, Hongyuan Zha | Low-rank Matrix Recovery With Unknown Correspondence | null | null | null | null | cs.LG cs.IR stat.ML | http://creativecommons.org/licenses/by/4.0/ | We study a matrix recovery problem with unknown correspondence: given the
observation matrix $M_o=[A,\tilde P B]$, where $\tilde P$ is an unknown
permutation matrix, we aim to recover the underlying matrix $M=[A,B]$. Such
problem commonly arises in many applications where heterogeneous data are
utilized and the corre... | [
{
"created": "Fri, 15 Oct 2021 09:27:50 GMT",
"version": "v1"
},
{
"created": "Mon, 18 Oct 2021 03:10:41 GMT",
"version": "v2"
}
] | 2021-10-19 | [
[
"Tang",
"Zhiwei",
""
],
[
"Chang",
"Tsung-Hui",
""
],
[
"Ye",
"Xiaojing",
""
],
[
"Zha",
"Hongyuan",
""
]
] | We study a matrix recovery problem with unknown correspondence: given the observation matrix $M_o=[A,\tilde P B]$, where $\tilde P$ is an unknown permutation matrix, we aim to recover the underlying matrix $M=[A,B]$. Such problem commonly arises in many applications where heterogeneous data are utilized and the corresp... |
2011.06512 | Angelica Louren\c{c}o Oliveira | Angelica Louren\c{c}o Oliveira and Marcos Eduardo Valle | Linear Dilation-Erosion Perceptron Trained Using a Convex-Concave
Procedure | 10 pages, 2 figures, 12th International Conference on Soft Computing
and Pattern Recognition, preprint | null | null | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Mathematical morphology (MM) is a theory of non-linear operators used for the
processing and analysis of images. Morphological neural networks (MNNs) are
neural networks whose neurons compute morphological operators. Dilations and
erosions are the elementary operators of MM. From an algebraic point of view, a
dilatio... | [
{
"created": "Wed, 11 Nov 2020 18:37:07 GMT",
"version": "v1"
}
] | 2020-11-13 | [
[
"Oliveira",
"Angelica Lourenço",
""
],
[
"Valle",
"Marcos Eduardo",
""
]
] | Mathematical morphology (MM) is a theory of non-linear operators used for the processing and analysis of images. Morphological neural networks (MNNs) are neural networks whose neurons compute morphological operators. Dilations and erosions are the elementary operators of MM. From an algebraic point of view, a dilation ... |
2401.01185 | Mete \c{S}eref Ahunbay | Mete \c{S}eref Ahunbay, Martin Bichler | On the Uniqueness of Bayesian Coarse Correlated Equilibria in Standard
First-Price and All-Pay Auctions | 73 pages, 6 figures. A first version of this article appeared on
ArXiV on January 2nd/3rd, 2024. This version significantly extends the
results | null | null | null | cs.GT | http://creativecommons.org/licenses/by/4.0/ | We study the Bayesian coarse correlated equilibrium (BCCE) of continuous and
discretised first-price and all-pay auctions under the standard symmetric
independent private-values model. Our goal is to determine how the canonical
Bayes-Nash equilibrium (BNE) of the auction relates to the outcome when all
buyers bid fol... | [
{
"created": "Tue, 2 Jan 2024 12:27:13 GMT",
"version": "v1"
},
{
"created": "Wed, 3 Jan 2024 09:24:00 GMT",
"version": "v2"
},
{
"created": "Thu, 20 Jun 2024 08:36:22 GMT",
"version": "v3"
}
] | 2024-06-21 | [
[
"Ahunbay",
"Mete Şeref",
""
],
[
"Bichler",
"Martin",
""
]
] | We study the Bayesian coarse correlated equilibrium (BCCE) of continuous and discretised first-price and all-pay auctions under the standard symmetric independent private-values model. Our goal is to determine how the canonical Bayes-Nash equilibrium (BNE) of the auction relates to the outcome when all buyers bid follo... |
1206.2276 | Masoud Alipour | Masoud Alipour, Omid Etesami, Ghid Maatouk, Amin Shokrollahi | Irregular Product Codes | First draft | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We consider irregular product codes.In this class of codes, each codeword is
represented by a matrix. The entries in each row (column) of the matrix should
come from a component row (column) code. As opposed to (standard) product
codes, we do not require that all component row codes nor all component column
codes be ... | [
{
"created": "Mon, 11 Jun 2012 16:24:19 GMT",
"version": "v1"
}
] | 2012-06-12 | [
[
"Alipour",
"Masoud",
""
],
[
"Etesami",
"Omid",
""
],
[
"Maatouk",
"Ghid",
""
],
[
"Shokrollahi",
"Amin",
""
]
] | We consider irregular product codes.In this class of codes, each codeword is represented by a matrix. The entries in each row (column) of the matrix should come from a component row (column) code. As opposed to (standard) product codes, we do not require that all component row codes nor all component column codes be th... |
1806.05599 | Christina Niklaus | Christina Niklaus, Matthias Cetto, Andr\'e Freitas and Siegfried
Handschuh | A Survey on Open Information Extraction | 27th International Conference on Computational Linguistics (COLING
2018) | null | null | null | cs.CL | http://creativecommons.org/licenses/by/4.0/ | We provide a detailed overview of the various approaches that were proposed
to date to solve the task of Open Information Extraction. We present the major
challenges that such systems face, show the evolution of the suggested
approaches over time and depict the specific issues they address. In addition,
we provide a ... | [
{
"created": "Thu, 14 Jun 2018 15:07:46 GMT",
"version": "v1"
}
] | 2018-06-15 | [
[
"Niklaus",
"Christina",
""
],
[
"Cetto",
"Matthias",
""
],
[
"Freitas",
"André",
""
],
[
"Handschuh",
"Siegfried",
""
]
] | We provide a detailed overview of the various approaches that were proposed to date to solve the task of Open Information Extraction. We present the major challenges that such systems face, show the evolution of the suggested approaches over time and depict the specific issues they address. In addition, we provide a cr... |
2002.03149 | Yanyan Zou | Yanyan Zou, Wei Lu and Xu Sun | Mining Commonsense Facts from the Physical World | The experiment part is not insufficient which might confuses the
readers, while we are not planning to improve it for now. To ensure the
quality of arxiv papers, we would like to withdraw this submission | null | null | null | cs.CL | http://creativecommons.org/licenses/by-nc-sa/4.0/ | Textual descriptions of the physical world implicitly mention commonsense
facts, while the commonsense knowledge bases explicitly represent such facts as
triples. Compared to dramatically increased text data, the coverage of existing
knowledge bases is far away from completion. Most of the prior studies on
populating... | [
{
"created": "Sat, 8 Feb 2020 12:02:45 GMT",
"version": "v1"
},
{
"created": "Tue, 11 Feb 2020 04:16:47 GMT",
"version": "v2"
},
{
"created": "Tue, 14 Apr 2020 00:58:51 GMT",
"version": "v3"
}
] | 2020-04-15 | [
[
"Zou",
"Yanyan",
""
],
[
"Lu",
"Wei",
""
],
[
"Sun",
"Xu",
""
]
] | Textual descriptions of the physical world implicitly mention commonsense facts, while the commonsense knowledge bases explicitly represent such facts as triples. Compared to dramatically increased text data, the coverage of existing knowledge bases is far away from completion. Most of the prior studies on populating k... |
2210.07914 | Corto Mascle | Corto Mascle | Model-checking lock-sharing systems against regular constraints | null | null | null | null | cs.FL cs.DC | http://creativecommons.org/licenses/by/4.0/ | We study the verification of distributed systems where processes are finite
automata with access to a shared pool of locks. We consider objectives that are
boolean combinations of local regular constraints. We show that the problem,
PSPACE-complete in general, falls in NP with the right assumptions on the
system. We ... | [
{
"created": "Fri, 14 Oct 2022 15:56:32 GMT",
"version": "v1"
}
] | 2022-10-17 | [
[
"Mascle",
"Corto",
""
]
] | We study the verification of distributed systems where processes are finite automata with access to a shared pool of locks. We consider objectives that are boolean combinations of local regular constraints. We show that the problem, PSPACE-complete in general, falls in NP with the right assumptions on the system. We us... |
2301.10225 | Don Krieger | Jeffrey Balzer, Julia Caviness, Don Krieger | The Evolution of Real-time Remote Intraoperative Neurophysiological
Monitoring (IONM) | 12 pages, 3 figures | null | null | null | cs.OH cs.CY | http://creativecommons.org/licenses/by-nc-nd/4.0/ | Real-time monitoring of nervous system function with immediate communication
of relevant information to the surgeon enables prevention and/or mitigation of
iatrogenic injury in many surgical procedures. The hardware and software
infrastructure and demonstrated usefulness of telemedicine in support of IONM
originated ... | [
{
"created": "Tue, 10 Jan 2023 14:57:37 GMT",
"version": "v1"
}
] | 2023-01-25 | [
[
"Balzer",
"Jeffrey",
""
],
[
"Caviness",
"Julia",
""
],
[
"Krieger",
"Don",
""
]
] | Real-time monitoring of nervous system function with immediate communication of relevant information to the surgeon enables prevention and/or mitigation of iatrogenic injury in many surgical procedures. The hardware and software infrastructure and demonstrated usefulness of telemedicine in support of IONM originated in... |
1911.12904 | Zinovy Diskin | Zinovy Diskin | General supervised learning as change propagation with delta lenses | An extended version of paper with the same title published at FOSSACS
2020. Unfortunately, both the paper and the previous version of the extended
version uploaded to arxiv on Feb 26, 2020, had bad typos in Definition 4 and
Fig.4, which are now fixed | In: Foundations of Software Science and Computation Structures.
FoSSaCS 2020. Lecture Notes in Computer Science, vol 12077. Springer,
pp.177-197 | 10.1007/978-3-030-45231-5_10 | null | cs.LO math.CT | http://creativecommons.org/licenses/by-sa/4.0/ | Delta lenses are an established mathematical framework for modelling and
designing bidirectional model transformations. Following the recent
observations by Fong et al, the paper extends the delta lens framework with a a
new ingredient: learning over a parameterized space of model transformations
seen as functors. We... | [
{
"created": "Thu, 28 Nov 2019 23:56:43 GMT",
"version": "v1"
},
{
"created": "Tue, 25 Feb 2020 17:44:25 GMT",
"version": "v2"
},
{
"created": "Wed, 26 Feb 2020 01:51:32 GMT",
"version": "v3"
},
{
"created": "Fri, 9 Jul 2021 17:56:07 GMT",
"version": "v4"
}
] | 2021-07-12 | [
[
"Diskin",
"Zinovy",
""
]
] | Delta lenses are an established mathematical framework for modelling and designing bidirectional model transformations. Following the recent observations by Fong et al, the paper extends the delta lens framework with a a new ingredient: learning over a parameterized space of model transformations seen as functors. We d... |
2312.02229 | Mahboobeh Parsapoor | Mahboobeh Parsapoor | Synthetic Data Generation Techniques for Developing AI-based Speech
Assessments for Parkinson's Disease (A Comparative Study) | 6, 5 Tables, 5 Figures | null | null | null | cs.SD cs.AI cs.LG eess.AS | http://creativecommons.org/licenses/by/4.0/ | Changes in speech and language are among the first signs of Parkinson's
disease (PD). Thus, clinicians have tried to identify individuals with PD from
their voices for years. Doctors can leverage AI-based speech assessments to
spot PD thanks to advancements in artificial intelligence (AI). Such AI systems
can be deve... | [
{
"created": "Mon, 4 Dec 2023 03:12:09 GMT",
"version": "v1"
}
] | 2023-12-06 | [
[
"Parsapoor",
"Mahboobeh",
""
]
] | Changes in speech and language are among the first signs of Parkinson's disease (PD). Thus, clinicians have tried to identify individuals with PD from their voices for years. Doctors can leverage AI-based speech assessments to spot PD thanks to advancements in artificial intelligence (AI). Such AI systems can be develo... |
1602.03115 | Li Xiao | Li Xiao, Xiang-Gen Xia, and Haiye Huo | Towards Robustness in Residue Number Systems | 32 pages, 5 figures | null | 10.1109/TSP.2016.2641398 | null | cs.IT math.IT math.NT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The problem of robustly reconstructing a large number from its erroneous
remainders with respect to several moduli, namely the robust remaindering
problem, may occur in many applications including phase unwrapping, frequency
detection from several undersampled waveforms, wireless sensor networks, etc.
Assuming that t... | [
{
"created": "Tue, 9 Feb 2016 18:53:55 GMT",
"version": "v1"
}
] | 2017-04-05 | [
[
"Xiao",
"Li",
""
],
[
"Xia",
"Xiang-Gen",
""
],
[
"Huo",
"Haiye",
""
]
] | The problem of robustly reconstructing a large number from its erroneous remainders with respect to several moduli, namely the robust remaindering problem, may occur in many applications including phase unwrapping, frequency detection from several undersampled waveforms, wireless sensor networks, etc. Assuming that the... |
2405.07941 | Oleksandr Kuznetsov | Oleksandr Kuznetsov, Alex Rusnak, Anton Yezhov, Dzianis Kanonik,
Kateryna Kuznetsova, Oleksandr Domin | Efficient and Universal Merkle Tree Inclusion Proofs via OR Aggregation | null | Cryptography 2024, 8, 28 | 10.3390/cryptography8030028 | null | cs.CR | http://creativecommons.org/licenses/by/4.0/ | Zero-knowledge proofs have emerged as a powerful tool for enhancing privacy
and security in blockchain applications. However, the efficiency and
scalability of proof systems remain a significant challenge, particularly in
the context of Merkle tree inclusion proofs. Traditional proof aggregation
techniques based on A... | [
{
"created": "Mon, 13 May 2024 17:15:38 GMT",
"version": "v1"
}
] | 2024-07-08 | [
[
"Kuznetsov",
"Oleksandr",
""
],
[
"Rusnak",
"Alex",
""
],
[
"Yezhov",
"Anton",
""
],
[
"Kanonik",
"Dzianis",
""
],
[
"Kuznetsova",
"Kateryna",
""
],
[
"Domin",
"Oleksandr",
""
]
] | Zero-knowledge proofs have emerged as a powerful tool for enhancing privacy and security in blockchain applications. However, the efficiency and scalability of proof systems remain a significant challenge, particularly in the context of Merkle tree inclusion proofs. Traditional proof aggregation techniques based on AND... |
2001.01027 | Konstantinos A. Mountris | Konstantinos A. Mountris and Esther Pueyo | The Radial Point Interpolation Mixed Collocation (RPIMC) Method for the
Solution of Transient Diffusion Problems | Accepted version for publication in Engineering Analysis with
Boundary Elements | Engineering Analysis with Boundary Elements 121 (2020): 207-216 | 10.1016/j.enganabound.2020.10.005 | null | cs.CE cs.NA math.NA | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The Radial Point Interpolation Mixed Collocation (RPIMC) method is proposed
in this paper for transient analysis of diffusion problems. RPIMC is an
efficient purely meshless method where the solution of the field variable is
obtained through collocation. The field function and its gradient are both
interpolated (mixe... | [
{
"created": "Sat, 4 Jan 2020 03:30:37 GMT",
"version": "v1"
},
{
"created": "Wed, 7 Oct 2020 13:23:27 GMT",
"version": "v2"
}
] | 2021-10-14 | [
[
"Mountris",
"Konstantinos A.",
""
],
[
"Pueyo",
"Esther",
""
]
] | The Radial Point Interpolation Mixed Collocation (RPIMC) method is proposed in this paper for transient analysis of diffusion problems. RPIMC is an efficient purely meshless method where the solution of the field variable is obtained through collocation. The field function and its gradient are both interpolated (mixed ... |
1910.06824 | Kizito Nkurikiyeyezu | Kizito Nkurikiyeyezu, Anna Yokokubo, Guillaume Lopez | Affect-aware thermal comfort provision in intelligent buildings | null | null | 10.1109/ACIIW.2019.8925184 | null | cs.HC eess.IV eess.SP | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Predominant thermal comfort provision technologies are energy-hungry, and yet
they perform crudely because they overlook the requisite precursors to thermal
comfort. They also fail to exclusively cool or heat the parts of the body
(e.g., the wrist, the feet, and the head) that influence the most a person's
thermal co... | [
{
"created": "Thu, 3 Oct 2019 13:46:17 GMT",
"version": "v1"
},
{
"created": "Tue, 31 Dec 2019 08:20:58 GMT",
"version": "v2"
}
] | 2020-01-01 | [
[
"Nkurikiyeyezu",
"Kizito",
""
],
[
"Yokokubo",
"Anna",
""
],
[
"Lopez",
"Guillaume",
""
]
] | Predominant thermal comfort provision technologies are energy-hungry, and yet they perform crudely because they overlook the requisite precursors to thermal comfort. They also fail to exclusively cool or heat the parts of the body (e.g., the wrist, the feet, and the head) that influence the most a person's thermal comf... |
2404.16456 | Mingcheng Li | Mingcheng Li, Dingkang Yang, Xiao Zhao, Shuaibing Wang, Yan Wang, Kun
Yang, Mingyang Sun, Dongliang Kou, Ziyun Qian, Lihua Zhang | Correlation-Decoupled Knowledge Distillation for Multimodal Sentiment
Analysis with Incomplete Modalities | Accepted by CVPR 2024 | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Multimodal sentiment analysis (MSA) aims to understand human sentiment
through multimodal data. Most MSA efforts are based on the assumption of
modality completeness. However, in real-world applications, some practical
factors cause uncertain modality missingness, which drastically degrades the
model's performance. T... | [
{
"created": "Thu, 25 Apr 2024 09:35:09 GMT",
"version": "v1"
},
{
"created": "Mon, 10 Jun 2024 09:10:37 GMT",
"version": "v2"
}
] | 2024-06-11 | [
[
"Li",
"Mingcheng",
""
],
[
"Yang",
"Dingkang",
""
],
[
"Zhao",
"Xiao",
""
],
[
"Wang",
"Shuaibing",
""
],
[
"Wang",
"Yan",
""
],
[
"Yang",
"Kun",
""
],
[
"Sun",
"Mingyang",
""
],
[
"Kou",
"Dongl... | Multimodal sentiment analysis (MSA) aims to understand human sentiment through multimodal data. Most MSA efforts are based on the assumption of modality completeness. However, in real-world applications, some practical factors cause uncertain modality missingness, which drastically degrades the model's performance. To ... |
2310.00896 | Yihong Zhang | Yihong Zhang and Takahiro Hara | Organized Event Participant Prediction Enhanced by Social Media
Retweeting Data | Accepted in WI-IAT 2023 | null | null | null | cs.LG cs.IR | http://creativecommons.org/licenses/by/4.0/ | Nowadays, many platforms on the Web offer organized events, allowing users to
be organizers or participants. For such platforms, it is beneficial to predict
potential event participants. Existing work on this problem tends to borrow
recommendation techniques. However, compared to e-commerce items and purchases,
event... | [
{
"created": "Mon, 2 Oct 2023 04:26:07 GMT",
"version": "v1"
}
] | 2023-10-03 | [
[
"Zhang",
"Yihong",
""
],
[
"Hara",
"Takahiro",
""
]
] | Nowadays, many platforms on the Web offer organized events, allowing users to be organizers or participants. For such platforms, it is beneficial to predict potential event participants. Existing work on this problem tends to borrow recommendation techniques. However, compared to e-commerce items and purchases, events ... |
1803.07985 | Hauke J\"urgen M\"onck | Hauke J\"urgen M\"onck, Andreas J\"org, Tobias von Falkenhausen,
Julian Tanke, Benjamin Wild, David Dormagen, Jonas Piotrowski, Claudia
Winklmayr, David Bierbach, Tim Landgraf | BioTracker: An Open-Source Computer Vision Framework for Visual Animal
Tracking | 4 pages, 2 figures | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The study of animal behavior increasingly relies on (semi-) automatic methods
for the extraction of relevant behavioral features from video or picture data.
To date, several specialized software products exist to detect and track
animals' positions in simple (laboratory) environments. Tracking animals in
their natura... | [
{
"created": "Wed, 21 Mar 2018 16:12:18 GMT",
"version": "v1"
}
] | 2018-03-22 | [
[
"Mönck",
"Hauke Jürgen",
""
],
[
"Jörg",
"Andreas",
""
],
[
"von Falkenhausen",
"Tobias",
""
],
[
"Tanke",
"Julian",
""
],
[
"Wild",
"Benjamin",
""
],
[
"Dormagen",
"David",
""
],
[
"Piotrowski",
"Jonas",
"... | The study of animal behavior increasingly relies on (semi-) automatic methods for the extraction of relevant behavioral features from video or picture data. To date, several specialized software products exist to detect and track animals' positions in simple (laboratory) environments. Tracking animals in their natural ... |
2112.00875 | Shyama Arunachalam | Shyama Kumari Arunachalam, Roopa V, Meena H B, Vijayalakshmi, T
Malavika | Secure and Safety Mobile Network System for Visually Impaired People | 4 pages, 3 figures, Accepted at 2012 IEEE ICECE, Bangalore | null | null | null | cs.HC cs.IR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The proposed system aims to be a techno-friend of visually impaired people to
assist them in orientation and mobility both indoor and outdoor. Moving through
an unknown environment becomes a real challenge for most of them, although they
rely on their other senses. An age old mechanism used for assistance for the
bli... | [
{
"created": "Wed, 1 Dec 2021 22:56:36 GMT",
"version": "v1"
}
] | 2021-12-03 | [
[
"Arunachalam",
"Shyama Kumari",
""
],
[
"V",
"Roopa",
""
],
[
"B",
"Meena H",
""
],
[
"Vijayalakshmi",
"",
""
],
[
"Malavika",
"T",
""
]
] | The proposed system aims to be a techno-friend of visually impaired people to assist them in orientation and mobility both indoor and outdoor. Moving through an unknown environment becomes a real challenge for most of them, although they rely on their other senses. An age old mechanism used for assistance for the blind... |
2003.03030 | Shihao Zhao | Shihao Zhao, Xingjun Ma, Xiang Zheng, James Bailey, Jingjing Chen,
Yu-Gang Jiang | Clean-Label Backdoor Attacks on Video Recognition Models | CVPR2020 | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Deep neural networks (DNNs) are vulnerable to backdoor attacks which can hide
backdoor triggers in DNNs by poisoning training data. A backdoored model
behaves normally on clean test images, yet consistently predicts a particular
target class for any test examples that contain the trigger pattern. As such,
backdoor at... | [
{
"created": "Fri, 6 Mar 2020 04:51:48 GMT",
"version": "v1"
},
{
"created": "Tue, 16 Jun 2020 12:13:20 GMT",
"version": "v2"
}
] | 2020-06-17 | [
[
"Zhao",
"Shihao",
""
],
[
"Ma",
"Xingjun",
""
],
[
"Zheng",
"Xiang",
""
],
[
"Bailey",
"James",
""
],
[
"Chen",
"Jingjing",
""
],
[
"Jiang",
"Yu-Gang",
""
]
] | Deep neural networks (DNNs) are vulnerable to backdoor attacks which can hide backdoor triggers in DNNs by poisoning training data. A backdoored model behaves normally on clean test images, yet consistently predicts a particular target class for any test examples that contain the trigger pattern. As such, backdoor atta... |
2009.09806 | Paolo Pareti Dr. | Paolo Pareti and George Konstantinidis and Fabio Mogavero and Timothy
J. Norman | SHACL Satisfiability and Containment (Extended Paper) | null | null | null | null | cs.LO cs.AI cs.DB | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The Shapes Constraint Language (SHACL) is a recent W3C recommendation
language for validating RDF data. Specifically, SHACL documents are collections
of constraints that enforce particular shapes on an RDF graph. Previous work on
the topic has provided theoretical and practical results for the validation
problem, but... | [
{
"created": "Mon, 31 Aug 2020 14:52:03 GMT",
"version": "v1"
},
{
"created": "Thu, 5 Nov 2020 10:55:19 GMT",
"version": "v2"
}
] | 2020-11-06 | [
[
"Pareti",
"Paolo",
""
],
[
"Konstantinidis",
"George",
""
],
[
"Mogavero",
"Fabio",
""
],
[
"Norman",
"Timothy J.",
""
]
] | The Shapes Constraint Language (SHACL) is a recent W3C recommendation language for validating RDF data. Specifically, SHACL documents are collections of constraints that enforce particular shapes on an RDF graph. Previous work on the topic has provided theoretical and practical results for the validation problem, but d... |
2406.12103 | Jayshree Sarathy | Rachel Cummings and Jayshree Sarathy | Centering Policy and Practice: Research Gaps around Usable Differential
Privacy | null | 2023 5th IEEE International Conference on Trust, Privacy and
Security in Intelligent Systems and Applications (TPS-ISA). IEEE Computer
Society, 2023 | null | null | cs.CR cs.CY cs.HC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | As a mathematically rigorous framework that has amassed a rich theoretical
literature, differential privacy is considered by many experts to be the gold
standard for privacy-preserving data analysis. Others argue that while
differential privacy is a clean formulation in theory, it poses significant
challenges in prac... | [
{
"created": "Mon, 17 Jun 2024 21:32:30 GMT",
"version": "v1"
}
] | 2024-06-19 | [
[
"Cummings",
"Rachel",
""
],
[
"Sarathy",
"Jayshree",
""
]
] | As a mathematically rigorous framework that has amassed a rich theoretical literature, differential privacy is considered by many experts to be the gold standard for privacy-preserving data analysis. Others argue that while differential privacy is a clean formulation in theory, it poses significant challenges in practi... |
2206.12147 | Xiao Wang | Xiao Wang, Shaoguo Liu, Yidong Jia, Yuxin Fu, Yufang Yu, Liang Wang,
Bo Zheng | MCMF: Multi-Constraints With Merging Features Bid Optimization in Online
Display Advertising | 5 pages, 5 figures | null | null | null | cs.GT cs.CE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In the Real-Time Bidding (RTB), advertisers are increasingly relying on bid
optimization to gain more conversions (i.e trade or arrival). Currently, the
efficiency of bid optimization is still challenged by the (1) sparse feedback,
(2) the budget management separated from the optimization, and (3) absence of
bidding ... | [
{
"created": "Fri, 24 Jun 2022 08:25:28 GMT",
"version": "v1"
},
{
"created": "Mon, 27 Jun 2022 12:23:40 GMT",
"version": "v2"
}
] | 2022-06-28 | [
[
"Wang",
"Xiao",
""
],
[
"Liu",
"Shaoguo",
""
],
[
"Jia",
"Yidong",
""
],
[
"Fu",
"Yuxin",
""
],
[
"Yu",
"Yufang",
""
],
[
"Wang",
"Liang",
""
],
[
"Zheng",
"Bo",
""
]
] | In the Real-Time Bidding (RTB), advertisers are increasingly relying on bid optimization to gain more conversions (i.e trade or arrival). Currently, the efficiency of bid optimization is still challenged by the (1) sparse feedback, (2) the budget management separated from the optimization, and (3) absence of bidding en... |
2308.02000 | Junyan Cheng | Junyan Cheng and Peter Chin | On the Transition from Neural Representation to Symbolic Knowledge | null | null | null | null | cs.AI cs.CV cs.LG | http://creativecommons.org/licenses/by/4.0/ | Bridging the huge disparity between neural and symbolic representation can
potentially enable the incorporation of symbolic thinking into neural networks
from essence. Motivated by how human gradually builds complex symbolic
representation from the prototype symbols that are learned through perception
and environment... | [
{
"created": "Thu, 3 Aug 2023 19:29:35 GMT",
"version": "v1"
}
] | 2023-08-07 | [
[
"Cheng",
"Junyan",
""
],
[
"Chin",
"Peter",
""
]
] | Bridging the huge disparity between neural and symbolic representation can potentially enable the incorporation of symbolic thinking into neural networks from essence. Motivated by how human gradually builds complex symbolic representation from the prototype symbols that are learned through perception and environmental... |
2403.14646 | Adil Rasheed Professor | Adil Rasheed, Florian Stadtmann, Eivind Fonn, Mandar Tabib, Vasileios
Tsiolakis, Balram Panjwani, Kjetil Andre Johannessen, Trond Kvamsdal, Omer
San, John Olav Tande, Idar Barstad, Tore Christiansen, Elling Rishoff, Lars
Fr{\o}yd, Tore Rasmussen | Digital Twin for Wind Energy: Latest updates from the NorthWind project | null | null | null | null | cs.CY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | NorthWind, a collaborative research initiative supported by the Research
Council of Norway, industry stakeholders, and research partners, aims to
advance cutting-edge research and innovation in wind energy. The core mission
is to reduce wind power costs and foster sustainable growth, with a key focus
on the developme... | [
{
"created": "Wed, 21 Feb 2024 22:53:39 GMT",
"version": "v1"
},
{
"created": "Tue, 26 Mar 2024 08:47:52 GMT",
"version": "v2"
}
] | 2024-03-27 | [
[
"Rasheed",
"Adil",
""
],
[
"Stadtmann",
"Florian",
""
],
[
"Fonn",
"Eivind",
""
],
[
"Tabib",
"Mandar",
""
],
[
"Tsiolakis",
"Vasileios",
""
],
[
"Panjwani",
"Balram",
""
],
[
"Johannessen",
"Kjetil Andre",
... | NorthWind, a collaborative research initiative supported by the Research Council of Norway, industry stakeholders, and research partners, aims to advance cutting-edge research and innovation in wind energy. The core mission is to reduce wind power costs and foster sustainable growth, with a key focus on the development... |
1307.7042 | Andrzej Kapanowski | Andrzej Kapanowski | Python for education: permutations | 26 pages, 1 figure, 2 tables | The Python Papers 9, 3 (2014) | null | null | cs.MS math.HO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Python implementation of permutations is presented. Three classes are
introduced: Perm for permutations, Group for permutation groups, and PermError
to report any errors for both classes. The class Perm is based on Python
dictionaries and utilize cycle notation. The methods of calculation for the
perm order, parity, ... | [
{
"created": "Fri, 26 Jul 2013 14:18:21 GMT",
"version": "v1"
}
] | 2014-06-17 | [
[
"Kapanowski",
"Andrzej",
""
]
] | Python implementation of permutations is presented. Three classes are introduced: Perm for permutations, Group for permutation groups, and PermError to report any errors for both classes. The class Perm is based on Python dictionaries and utilize cycle notation. The methods of calculation for the perm order, parity, ra... |
2406.03792 | Naibin Gu | Naibin Gu, Peng Fu, Xiyu Liu, Bowen Shen, Zheng Lin, Weiping Wang | Light-PEFT: Lightening Parameter-Efficient Fine-Tuning via Early Pruning | Findings of ACL 2024 | null | null | null | cs.CL | http://creativecommons.org/licenses/by/4.0/ | Parameter-efficient fine-tuning (PEFT) has emerged as the predominant
technique for fine-tuning in the era of large language models. However,
existing PEFT methods still have inadequate training efficiency. Firstly, the
utilization of large-scale foundation models during the training process is
excessively redundant ... | [
{
"created": "Thu, 6 Jun 2024 07:03:29 GMT",
"version": "v1"
}
] | 2024-06-07 | [
[
"Gu",
"Naibin",
""
],
[
"Fu",
"Peng",
""
],
[
"Liu",
"Xiyu",
""
],
[
"Shen",
"Bowen",
""
],
[
"Lin",
"Zheng",
""
],
[
"Wang",
"Weiping",
""
]
] | Parameter-efficient fine-tuning (PEFT) has emerged as the predominant technique for fine-tuning in the era of large language models. However, existing PEFT methods still have inadequate training efficiency. Firstly, the utilization of large-scale foundation models during the training process is excessively redundant fo... |
2406.10887 | Decheng Liu | Decheng Liu, Qixuan Su, Chunlei Peng, Nannan Wang, Xinbo Gao | Imperceptible Face Forgery Attack via Adversarial Semantic Mask | The code is publicly available | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | With the great development of generative model techniques, face forgery
detection draws more and more attention in the related field. Researchers find
that existing face forgery models are still vulnerable to adversarial examples
with generated pixel perturbations in the global image. These generated
adversarial samp... | [
{
"created": "Sun, 16 Jun 2024 10:38:11 GMT",
"version": "v1"
}
] | 2024-06-18 | [
[
"Liu",
"Decheng",
""
],
[
"Su",
"Qixuan",
""
],
[
"Peng",
"Chunlei",
""
],
[
"Wang",
"Nannan",
""
],
[
"Gao",
"Xinbo",
""
]
] | With the great development of generative model techniques, face forgery detection draws more and more attention in the related field. Researchers find that existing face forgery models are still vulnerable to adversarial examples with generated pixel perturbations in the global image. These generated adversarial sample... |
2203.00798 | Jingxi Xu | Jingxi Xu, Shuran Song, Matei Ciocarlie | TANDEM: Learning Joint Exploration and Decision Making with Tactile
Sensors | Accepted to Robotics and Automation Letters (RA-L) and International
Conference on Intelligent Robots and Systems (IROS) 2022 | null | null | null | cs.RO cs.AI cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Inspired by the human ability to perform complex manipulation in the complete
absence of vision (like retrieving an object from a pocket), the robotic
manipulation field is motivated to develop new methods for tactile-based object
interaction. However, tactile sensing presents the challenge of being an active
sensing... | [
{
"created": "Tue, 1 Mar 2022 23:55:09 GMT",
"version": "v1"
},
{
"created": "Sun, 26 Jun 2022 06:11:33 GMT",
"version": "v2"
},
{
"created": "Thu, 21 Jul 2022 06:52:17 GMT",
"version": "v3"
}
] | 2022-07-22 | [
[
"Xu",
"Jingxi",
""
],
[
"Song",
"Shuran",
""
],
[
"Ciocarlie",
"Matei",
""
]
] | Inspired by the human ability to perform complex manipulation in the complete absence of vision (like retrieving an object from a pocket), the robotic manipulation field is motivated to develop new methods for tactile-based object interaction. However, tactile sensing presents the challenge of being an active sensing m... |
2305.02201 | Lingyao Li | Lingyao Li, Zihui Ma, Lizhou Fan, Sanggyu Lee, Huizi Yu, Libby
Hemphill | ChatGPT in education: A discourse analysis of worries and concerns on
social media | null | null | null | null | cs.CY | http://creativecommons.org/licenses/by/4.0/ | The rapid advancements in generative AI models present new opportunities in
the education sector. However, it is imperative to acknowledge and address the
potential risks and concerns that may arise with their use. We analyzed Twitter
data to identify key concerns related to the use of ChatGPT in education. We
employ... | [
{
"created": "Sat, 29 Apr 2023 22:08:42 GMT",
"version": "v1"
}
] | 2023-05-04 | [
[
"Li",
"Lingyao",
""
],
[
"Ma",
"Zihui",
""
],
[
"Fan",
"Lizhou",
""
],
[
"Lee",
"Sanggyu",
""
],
[
"Yu",
"Huizi",
""
],
[
"Hemphill",
"Libby",
""
]
] | The rapid advancements in generative AI models present new opportunities in the education sector. However, it is imperative to acknowledge and address the potential risks and concerns that may arise with their use. We analyzed Twitter data to identify key concerns related to the use of ChatGPT in education. We employed... |
2312.17591 | Dongfang Li | Dongfang Li, Baotian Hu, Qingcai Chen, Shan He | Towards Faithful Explanations for Text Classification with Robustness
Improvement and Explanation Guided Training | null | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Feature attribution methods highlight the important input tokens as
explanations to model predictions, which have been widely applied to deep
neural networks towards trustworthy AI. However, recent works show that
explanations provided by these methods face challenges of being faithful and
robust. In this paper, we p... | [
{
"created": "Fri, 29 Dec 2023 13:07:07 GMT",
"version": "v1"
}
] | 2024-01-01 | [
[
"Li",
"Dongfang",
""
],
[
"Hu",
"Baotian",
""
],
[
"Chen",
"Qingcai",
""
],
[
"He",
"Shan",
""
]
] | Feature attribution methods highlight the important input tokens as explanations to model predictions, which have been widely applied to deep neural networks towards trustworthy AI. However, recent works show that explanations provided by these methods face challenges of being faithful and robust. In this paper, we pro... |
2012.00190 | Sven Buechel | Sven Buechel, Luise Modersohn, and Udo Hahn | Towards Label-Agnostic Emotion Embeddings | EMNLP 2021 camera-ready version | null | null | null | cs.CL cs.AI cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Research in emotion analysis is scattered across different label formats
(e.g., polarity types, basic emotion categories, and affective dimensions),
linguistic levels (word vs. sentence vs. discourse), and, of course, (few
well-resourced but much more under-resourced) natural languages and text genres
(e.g., product ... | [
{
"created": "Tue, 1 Dec 2020 00:54:13 GMT",
"version": "v1"
},
{
"created": "Sat, 6 Nov 2021 20:48:40 GMT",
"version": "v2"
}
] | 2021-11-09 | [
[
"Buechel",
"Sven",
""
],
[
"Modersohn",
"Luise",
""
],
[
"Hahn",
"Udo",
""
]
] | Research in emotion analysis is scattered across different label formats (e.g., polarity types, basic emotion categories, and affective dimensions), linguistic levels (word vs. sentence vs. discourse), and, of course, (few well-resourced but much more under-resourced) natural languages and text genres (e.g., product re... |
2012.05001 | Karim Ali | Karim M. Ali and Amr Guaily | Dual perspective method for solving the point in a polygon problem | 5 pages, 4 figures, 1 table containing 6 images, 1 algorithm | null | null | null | cs.CG physics.flu-dyn | http://creativecommons.org/licenses/by/4.0/ | A novel method has been introduced to solve a point inclusion in a polygon
problem. The method is applicable to convex as well as non-convex polygons
which are not self-intersecting. The introduced method is independent of
rounding off errors, which gives it a leverage over some methods prone to this
problem. A brief... | [
{
"created": "Wed, 9 Dec 2020 12:16:59 GMT",
"version": "v1"
}
] | 2020-12-10 | [
[
"Ali",
"Karim M.",
""
],
[
"Guaily",
"Amr",
""
]
] | A novel method has been introduced to solve a point inclusion in a polygon problem. The method is applicable to convex as well as non-convex polygons which are not self-intersecting. The introduced method is independent of rounding off errors, which gives it a leverage over some methods prone to this problem. A brief s... |
1811.08234 | Abhishek Bichhawat | Abhishek Bichhawat and Matt Fredrikson and Jean Yang and Akash Trehan | Contextual and Granular Policy Enforcement in Database-backed
Applications | null | null | 10.1145/3320269.3384759 | null | cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Database-backed applications rely on inlined policy checks to process users'
private and confidential data in a policy-compliant manner as traditional
database access control mechanisms cannot enforce complex policies. However,
application bugs due to missed checks are common in such applications, which
result in dat... | [
{
"created": "Tue, 20 Nov 2018 13:18:47 GMT",
"version": "v1"
},
{
"created": "Mon, 15 Jul 2019 15:23:31 GMT",
"version": "v2"
},
{
"created": "Fri, 28 Feb 2020 15:18:41 GMT",
"version": "v3"
},
{
"created": "Fri, 13 Mar 2020 19:09:27 GMT",
"version": "v4"
}
] | 2020-03-17 | [
[
"Bichhawat",
"Abhishek",
""
],
[
"Fredrikson",
"Matt",
""
],
[
"Yang",
"Jean",
""
],
[
"Trehan",
"Akash",
""
]
] | Database-backed applications rely on inlined policy checks to process users' private and confidential data in a policy-compliant manner as traditional database access control mechanisms cannot enforce complex policies. However, application bugs due to missed checks are common in such applications, which result in data ... |
1405.4506 | Limin Wang | Xiaojiang Peng and Limin Wang and Xingxing Wang and Yu Qiao | Bag of Visual Words and Fusion Methods for Action Recognition:
Comprehensive Study and Good Practice | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Video based action recognition is one of the important and challenging
problems in computer vision research. Bag of Visual Words model (BoVW) with
local features has become the most popular method and obtained the
state-of-the-art performance on several realistic datasets, such as the HMDB51,
UCF50, and UCF101. BoVW ... | [
{
"created": "Sun, 18 May 2014 13:56:07 GMT",
"version": "v1"
}
] | 2014-05-20 | [
[
"Peng",
"Xiaojiang",
""
],
[
"Wang",
"Limin",
""
],
[
"Wang",
"Xingxing",
""
],
[
"Qiao",
"Yu",
""
]
] | Video based action recognition is one of the important and challenging problems in computer vision research. Bag of Visual Words model (BoVW) with local features has become the most popular method and obtained the state-of-the-art performance on several realistic datasets, such as the HMDB51, UCF50, and UCF101. BoVW is... |
2004.08364 | Patrick Scheffe | Patrick Scheffe, Janis Maczijewski, Maximilian Kloock, Alexandru
Kampmann, Andreas Derks, Stefan Kowalewski, Bassam Alrifaee | Networked and Autonomous Model-scale Vehicles for Experiments in
Research and Education | This work has been accepted to IFAC for publication under a Creative
Commons Licence CC-BY-NC-ND | IFAC-PapersOnLine Volume 53, Issue 2, 2020, Pages 17332-17337 | 10.1016/j.ifacol.2020.12.1821 | null | cs.RO cs.MA | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper presents the $\mathrm{\mu}$Car, a 1:18 model-scale vehicle with
Ackermann steering geometry developed for experiments in networked and
autonomous driving in research and education. The vehicle is open source,
moderately costed and highly flexible, which allows for many applications. It
is equipped with an ... | [
{
"created": "Fri, 17 Apr 2020 17:39:57 GMT",
"version": "v1"
}
] | 2021-05-04 | [
[
"Scheffe",
"Patrick",
""
],
[
"Maczijewski",
"Janis",
""
],
[
"Kloock",
"Maximilian",
""
],
[
"Kampmann",
"Alexandru",
""
],
[
"Derks",
"Andreas",
""
],
[
"Kowalewski",
"Stefan",
""
],
[
"Alrifaee",
"Bassam",
... | This paper presents the $\mathrm{\mu}$Car, a 1:18 model-scale vehicle with Ackermann steering geometry developed for experiments in networked and autonomous driving in research and education. The vehicle is open source, moderately costed and highly flexible, which allows for many applications. It is equipped with an in... |
2209.05989 | Jiacheng Yin | Jiacheng Yin, Wenwen Li, Xidong Wang, Xiaozhou Ye, Ye Ouyang | 4G 5G Cell-level Multi-indicator Forecasting based on Dense-MLP | 9 pages, 6 figures. Published at ITU Journal on Future and Evolving
Technologies, viewable at https://www.itu.int/pub/S-JNL-VOL3.ISSUE3-2022-A03 | ITU Journal on Future and Evolving Technologies, Volume 3 (2022),
Issue 3 - AI and machine learning solutions in 5G and future networks, Pages
21-29 | null | null | cs.NI cs.LG | http://creativecommons.org/publicdomain/zero/1.0/ | With the development of 4G/5G, the rapid growth of traffic has caused a large
number of cell indicators to exceed the warning threshold, and network quality
has deteriorated. It is necessary for operators to solve the congestion in
advance and effectively to guarantee the quality of user experience. Cell-level
multi-... | [
{
"created": "Fri, 22 Jul 2022 05:03:27 GMT",
"version": "v1"
}
] | 2022-09-14 | [
[
"Yin",
"Jiacheng",
""
],
[
"Li",
"Wenwen",
""
],
[
"Wang",
"Xidong",
""
],
[
"Ye",
"Xiaozhou",
""
],
[
"Ouyang",
"Ye",
""
]
] | With the development of 4G/5G, the rapid growth of traffic has caused a large number of cell indicators to exceed the warning threshold, and network quality has deteriorated. It is necessary for operators to solve the congestion in advance and effectively to guarantee the quality of user experience. Cell-level multi-in... |
2007.08364 | Tadas Baltrusaitis | Tadas Baltrusaitis, Erroll Wood, Virginia Estellers, Charlie Hewitt,
Sebastian Dziadzio, Marek Kowalski, Matthew Johnson, Thomas J. Cashman, and
Jamie Shotton | A high fidelity synthetic face framework for computer vision | null | null | null | null | cs.CV cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Analysis of faces is one of the core applications of computer vision, with
tasks ranging from landmark alignment, head pose estimation, expression
recognition, and face recognition among others. However, building reliable
methods requires time-consuming data collection and often even more
time-consuming manual annota... | [
{
"created": "Thu, 16 Jul 2020 14:40:28 GMT",
"version": "v1"
}
] | 2020-07-17 | [
[
"Baltrusaitis",
"Tadas",
""
],
[
"Wood",
"Erroll",
""
],
[
"Estellers",
"Virginia",
""
],
[
"Hewitt",
"Charlie",
""
],
[
"Dziadzio",
"Sebastian",
""
],
[
"Kowalski",
"Marek",
""
],
[
"Johnson",
"Matthew",
"... | Analysis of faces is one of the core applications of computer vision, with tasks ranging from landmark alignment, head pose estimation, expression recognition, and face recognition among others. However, building reliable methods requires time-consuming data collection and often even more time-consuming manual annotati... |
2312.08898 | Xiao-Shan Gao | Yifan Zhu and Lijia Yu and Xiao-Shan Gao | Detection and Defense of Unlearnable Examples | AAAI 2024 | null | null | null | cs.LG cs.AI cs.CR | http://creativecommons.org/licenses/by/4.0/ | Privacy preserving has become increasingly critical with the emergence of
social media. Unlearnable examples have been proposed to avoid leaking personal
information on the Internet by degrading generalization abilities of deep
learning models. However, our study reveals that unlearnable examples are
easily detectabl... | [
{
"created": "Thu, 14 Dec 2023 12:59:20 GMT",
"version": "v1"
}
] | 2023-12-15 | [
[
"Zhu",
"Yifan",
""
],
[
"Yu",
"Lijia",
""
],
[
"Gao",
"Xiao-Shan",
""
]
] | Privacy preserving has become increasingly critical with the emergence of social media. Unlearnable examples have been proposed to avoid leaking personal information on the Internet by degrading generalization abilities of deep learning models. However, our study reveals that unlearnable examples are easily detectable.... |
2103.16143 | Constantinos Patsakis | Fran Casino, Nikolaos Totosis, Theodoros Apostolopoulos, Nikolaos
Lykousas, and Constantinos Patsakis | Analysis and Correlation of Visual Evidence in Campaigns of Malicious
Office Documents | null | null | null | null | cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Many malware campaigns use Microsoft (MS) Office documents as droppers to
download and execute their malicious payload. Such campaigns often use these
documents because MS Office is installed in billions of devices and that these
files allow the execution of arbitrary VBA code. Recent versions of MS Office
prevent th... | [
{
"created": "Tue, 30 Mar 2021 07:56:38 GMT",
"version": "v1"
}
] | 2021-03-31 | [
[
"Casino",
"Fran",
""
],
[
"Totosis",
"Nikolaos",
""
],
[
"Apostolopoulos",
"Theodoros",
""
],
[
"Lykousas",
"Nikolaos",
""
],
[
"Patsakis",
"Constantinos",
""
]
] | Many malware campaigns use Microsoft (MS) Office documents as droppers to download and execute their malicious payload. Such campaigns often use these documents because MS Office is installed in billions of devices and that these files allow the execution of arbitrary VBA code. Recent versions of MS Office prevent the ... |
2106.01215 | Talha Bin Masood | Talha Bin Masood, Signe Sidwall Thygesen, Mathieu Linares, Alexei I.
Abrikosov, Vijay Natarajan, Ingrid Hotz | Visual Analysis of Electronic Densities and Transitions in Molecules | 15 pages, 9 figures, To appear in EuroVis 2021 | null | null | null | cs.HC cs.CG physics.chem-ph | http://creativecommons.org/licenses/by-nc-sa/4.0/ | The study of electronic transitions within a molecule connected to the
absorption or emission of light is a common task in the process of the design
of new materials. The transitions are complex quantum mechanical processes and
a detailed analysis requires a breakdown of these processes into components
that can be in... | [
{
"created": "Wed, 2 Jun 2021 15:07:02 GMT",
"version": "v1"
}
] | 2021-06-03 | [
[
"Masood",
"Talha Bin",
""
],
[
"Thygesen",
"Signe Sidwall",
""
],
[
"Linares",
"Mathieu",
""
],
[
"Abrikosov",
"Alexei I.",
""
],
[
"Natarajan",
"Vijay",
""
],
[
"Hotz",
"Ingrid",
""
]
] | The study of electronic transitions within a molecule connected to the absorption or emission of light is a common task in the process of the design of new materials. The transitions are complex quantum mechanical processes and a detailed analysis requires a breakdown of these processes into components that can be inte... |
1106.5651 | Loet Leydesdorff | Loet Leydesdorff | Hyperincursive Cogitata and Incursive Cogitantes: Scholarly Discourse as
a Strongly Anticipatory System | arXiv admin note: substantial text overlap with arXiv:1011.3244 | International Journal of Computing Anticipatory Systems, 28,
173-186 | null | null | cs.DL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Strongly anticipatory systems-that is, systems which use models of themselves
for their further development-and which additionally may be able to run
hyperincursive routines-that is, develop only with reference to their future
states-cannot exist in res extensa, but can only be envisaged in res cogitans.
One needs in... | [
{
"created": "Tue, 28 Jun 2011 12:56:19 GMT",
"version": "v1"
},
{
"created": "Tue, 6 Jan 2015 06:01:18 GMT",
"version": "v2"
}
] | 2015-01-07 | [
[
"Leydesdorff",
"Loet",
""
]
] | Strongly anticipatory systems-that is, systems which use models of themselves for their further development-and which additionally may be able to run hyperincursive routines-that is, develop only with reference to their future states-cannot exist in res extensa, but can only be envisaged in res cogitans. One needs incu... |
1611.10212 | Antonis Achilleos | Luca Aceto, Antonis Achilleos, Adrian Francalanza, Anna
Ing\'olfsd\'ottir and S{\ae}var \"Orn Kjartansson | Determinizing Monitors for HML with Recursion | null | null | null | null | cs.LO cs.FL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We examine the determinization of monitors for HML with recursion. We
demonstrate that every monitor is equivalent to a deterministic one, which is
at most doubly exponential in size with respect to the original monitor. When
monitors are described as CCS-like processes, this doubly exponential bound is
optimal. When... | [
{
"created": "Wed, 30 Nov 2016 15:21:01 GMT",
"version": "v1"
}
] | 2016-12-01 | [
[
"Aceto",
"Luca",
""
],
[
"Achilleos",
"Antonis",
""
],
[
"Francalanza",
"Adrian",
""
],
[
"Ingólfsdóttir",
"Anna",
""
],
[
"Kjartansson",
"Sævar Örn",
""
]
] | We examine the determinization of monitors for HML with recursion. We demonstrate that every monitor is equivalent to a deterministic one, which is at most doubly exponential in size with respect to the original monitor. When monitors are described as CCS-like processes, this doubly exponential bound is optimal. When (... |
2403.02010 | Zhiyun Fan | Zhiyun Fan, Linhao Dong, Jun Zhang, Lu Lu, Zejun Ma | SA-SOT: Speaker-Aware Serialized Output Training for Multi-Talker ASR | null | null | null | null | cs.SD eess.AS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Multi-talker automatic speech recognition plays a crucial role in scenarios
involving multi-party interactions, such as meetings and conversations. Due to
its inherent complexity, this task has been receiving increasing attention.
Notably, the serialized output training (SOT) stands out among various
approaches becau... | [
{
"created": "Mon, 4 Mar 2024 13:10:40 GMT",
"version": "v1"
}
] | 2024-03-05 | [
[
"Fan",
"Zhiyun",
""
],
[
"Dong",
"Linhao",
""
],
[
"Zhang",
"Jun",
""
],
[
"Lu",
"Lu",
""
],
[
"Ma",
"Zejun",
""
]
] | Multi-talker automatic speech recognition plays a crucial role in scenarios involving multi-party interactions, such as meetings and conversations. Due to its inherent complexity, this task has been receiving increasing attention. Notably, the serialized output training (SOT) stands out among various approaches because... |
2003.03486 | Rodrigo de Lamare | A. Flores, R. C. de Lamare and B. Clerckx | Study of Linear Precoding and Stream Combining for Rate Splitting in
MU-MIMO Systems | 5 figures, 5 pages | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper develops stream combining techniques for rate-splitting (RS)
multiple-antenna systems with multiple users to enhance the common rate. We
propose linear combining techniques based on the Min-Max, the maximum ratio and
the minimum mean-square error criteria along with Regularized Block
Diagonalization (RBD) ... | [
{
"created": "Sat, 7 Mar 2020 02:07:25 GMT",
"version": "v1"
}
] | 2020-03-10 | [
[
"Flores",
"A.",
""
],
[
"de Lamare",
"R. C.",
""
],
[
"Clerckx",
"B.",
""
]
] | This paper develops stream combining techniques for rate-splitting (RS) multiple-antenna systems with multiple users to enhance the common rate. We propose linear combining techniques based on the Min-Max, the maximum ratio and the minimum mean-square error criteria along with Regularized Block Diagonalization (RBD) pr... |
2305.11003 | Chunming He | Chunming He and Kai Li and Yachao Zhang and Guoxia Xu and Longxiang
Tang and Yulun Zhang and Zhenhua Guo and Xiu Li | Weakly-Supervised Concealed Object Segmentation with SAM-based Pseudo
Labeling and Multi-scale Feature Grouping | 12 pages, 5 figures | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Weakly-Supervised Concealed Object Segmentation (WSCOS) aims to segment
objects well blended with surrounding environments using sparsely-annotated
data for model training. It remains a challenging task since (1) it is hard to
distinguish concealed objects from the background due to the intrinsic
similarity and (2) t... | [
{
"created": "Thu, 18 May 2023 14:31:34 GMT",
"version": "v1"
}
] | 2023-05-19 | [
[
"He",
"Chunming",
""
],
[
"Li",
"Kai",
""
],
[
"Zhang",
"Yachao",
""
],
[
"Xu",
"Guoxia",
""
],
[
"Tang",
"Longxiang",
""
],
[
"Zhang",
"Yulun",
""
],
[
"Guo",
"Zhenhua",
""
],
[
"Li",
"Xiu",
... | Weakly-Supervised Concealed Object Segmentation (WSCOS) aims to segment objects well blended with surrounding environments using sparsely-annotated data for model training. It remains a challenging task since (1) it is hard to distinguish concealed objects from the background due to the intrinsic similarity and (2) the... |
2005.11264 | Konstantina Bereta | Konstantina Bereta, George Papadakis, Manolis Koubarakis | OBDA for the Web: Creating Virtual RDF Graphs On Top of Web Data Sources | 12 pages, 6 figures | null | null | null | cs.DB | http://creativecommons.org/licenses/by/4.0/ | Due to Variety, Web data come in many different structures and formats, with
HTML tables and REST APIs (e.g., social media APIs) being among the most
popular ones. A big subset of Web data is also characterised by Velocity, as
data gets frequently updated so that consumers can obtain the most up-to-date
version of th... | [
{
"created": "Fri, 22 May 2020 16:29:25 GMT",
"version": "v1"
}
] | 2020-05-25 | [
[
"Bereta",
"Konstantina",
""
],
[
"Papadakis",
"George",
""
],
[
"Koubarakis",
"Manolis",
""
]
] | Due to Variety, Web data come in many different structures and formats, with HTML tables and REST APIs (e.g., social media APIs) being among the most popular ones. A big subset of Web data is also characterised by Velocity, as data gets frequently updated so that consumers can obtain the most up-to-date version of the ... |
1104.5069 | Tuan Nguyen | Tuan Nguyen and Subbarao Kambhampati and Minh Do | Synthesizing Robust Plans under Incomplete Domain Models | null | null | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Most current planners assume complete domain models and focus on generating
correct plans. Unfortunately, domain modeling is a laborious and error-prone
task. While domain experts cannot guarantee completeness, often they are able
to circumscribe the incompleteness of the model by providing annotations as to
which pa... | [
{
"created": "Wed, 27 Apr 2011 04:05:19 GMT",
"version": "v1"
}
] | 2011-04-28 | [
[
"Nguyen",
"Tuan",
""
],
[
"Kambhampati",
"Subbarao",
""
],
[
"Do",
"Minh",
""
]
] | Most current planners assume complete domain models and focus on generating correct plans. Unfortunately, domain modeling is a laborious and error-prone task. While domain experts cannot guarantee completeness, often they are able to circumscribe the incompleteness of the model by providing annotations as to which part... |
2105.07366 | Stephen MacDonell | Solomon Mensah, Jacky Keung, Stephen G. MacDonell, Michael Franklin
Bosu, and Kwabena Ebo Bennin | Investigating the Significance of the Bellwether Effect to Improve
Software Effort Prediction: Further Empirical Study | Journal paper, 23 pages, 8 figures, 9 tables | IEEE Transactions on Reliability 67(3)(2018), pp.1176-1198 | 10.1109/TR.2018.2839718 | null | cs.SE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Context: In addressing how best to estimate how much effort is required to
develop software, a recent study found that using exemplary and recently
completed projects [forming Bellwether moving windows (BMW)] in software effort
prediction (SEP) models leads to relatively improved accuracy. More studies
need to be con... | [
{
"created": "Sun, 16 May 2021 06:15:30 GMT",
"version": "v1"
}
] | 2021-05-18 | [
[
"Mensah",
"Solomon",
""
],
[
"Keung",
"Jacky",
""
],
[
"MacDonell",
"Stephen G.",
""
],
[
"Bosu",
"Michael Franklin",
""
],
[
"Bennin",
"Kwabena Ebo",
""
]
] | Context: In addressing how best to estimate how much effort is required to develop software, a recent study found that using exemplary and recently completed projects [forming Bellwether moving windows (BMW)] in software effort prediction (SEP) models leads to relatively improved accuracy. More studies need to be condu... |
2111.15020 | Wensheng Gan | Gengsen Huang, Wensheng Gan, Jian Weng, and Philip S. Yu | US-Rule: Discovering Utility-driven Sequential Rules | Preprint. 3 figures, 9 tables | null | null | null | cs.DB cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Utility-driven mining is an important task in data science and has many
applications in real life. High utility sequential pattern mining (HUSPM) is
one kind of utility-driven mining. HUSPM aims to discover all sequential
patterns with high utility. However, the existing algorithms of HUSPM can not
provide an accurat... | [
{
"created": "Mon, 29 Nov 2021 23:38:28 GMT",
"version": "v1"
}
] | 2021-12-01 | [
[
"Huang",
"Gengsen",
""
],
[
"Gan",
"Wensheng",
""
],
[
"Weng",
"Jian",
""
],
[
"Yu",
"Philip S.",
""
]
] | Utility-driven mining is an important task in data science and has many applications in real life. High utility sequential pattern mining (HUSPM) is one kind of utility-driven mining. HUSPM aims to discover all sequential patterns with high utility. However, the existing algorithms of HUSPM can not provide an accurate ... |
2004.07886 | Uthaipon Tantipongpipat | Vivek Madan, Aleksandar Nikolov, Mohit Singh, Uthaipon Tantipongpipat | Maximizing Determinants under Matroid Constraints | null | null | null | null | cs.DS cs.DM math.CO math.OC stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Given vectors $v_1,\dots,v_n\in\mathbb{R}^d$ and a matroid $M=([n],I)$, we
study the problem of finding a basis $S$ of $M$ such that $\det(\sum_{i \in
S}v_i v_i^\top)$ is maximized. This problem appears in a diverse set of areas
such as experimental design, fair allocation of goods, network design, and
machine learni... | [
{
"created": "Thu, 16 Apr 2020 19:16:38 GMT",
"version": "v1"
}
] | 2020-04-20 | [
[
"Madan",
"Vivek",
""
],
[
"Nikolov",
"Aleksandar",
""
],
[
"Singh",
"Mohit",
""
],
[
"Tantipongpipat",
"Uthaipon",
""
]
] | Given vectors $v_1,\dots,v_n\in\mathbb{R}^d$ and a matroid $M=([n],I)$, we study the problem of finding a basis $S$ of $M$ such that $\det(\sum_{i \in S}v_i v_i^\top)$ is maximized. This problem appears in a diverse set of areas such as experimental design, fair allocation of goods, network design, and machine learning... |
2104.05215 | Xiangde Luo | Xiangde Luo, Tao Song, Guotai Wang, Jieneng Chen, Yinan Chen, Kang Li,
Dimitris N. Metaxas and Shaoting Zhang | SCPM-Net: An Anchor-free 3D Lung Nodule Detection Network using Sphere
Representation and Center Points Matching | accept to Medical Image Analysis | null | 10.1016/j.media.2021.102287 | null | cs.CV | http://creativecommons.org/licenses/by-nc-sa/4.0/ | Lung nodule detection from 3D Computed Tomography scans plays a vital role in
efficient lung cancer screening. Despite the SOTA performance obtained by
recent anchor-based detectors using CNNs for this task, they require
predetermined anchor parameters such as the size, number, and aspect ratio of
anchors, and have l... | [
{
"created": "Mon, 12 Apr 2021 05:51:29 GMT",
"version": "v1"
},
{
"created": "Thu, 6 Jan 2022 09:13:15 GMT",
"version": "v2"
}
] | 2022-01-07 | [
[
"Luo",
"Xiangde",
""
],
[
"Song",
"Tao",
""
],
[
"Wang",
"Guotai",
""
],
[
"Chen",
"Jieneng",
""
],
[
"Chen",
"Yinan",
""
],
[
"Li",
"Kang",
""
],
[
"Metaxas",
"Dimitris N.",
""
],
[
"Zhang",
"S... | Lung nodule detection from 3D Computed Tomography scans plays a vital role in efficient lung cancer screening. Despite the SOTA performance obtained by recent anchor-based detectors using CNNs for this task, they require predetermined anchor parameters such as the size, number, and aspect ratio of anchors, and have lim... |
1011.5606 | Dan-Cristian Tomozei | Jean-Yves Le Boudec, Dan-Cristian Tomozei | Stability of a Stochastic Model for Demand-Response | Published in Stochastic Systems journal | null | 10.1214/11-SSY048 | null | cs.SY math.OC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We study the stability of a Markovian model of electricity production and
consumption that incorporates production volatility due to renewables and
uncertainty about actual demand versus planned production. We assume that the
energy producer targets a fixed energy reserve, subject to ramp-up and
ramp-down constraints... | [
{
"created": "Thu, 25 Nov 2010 12:18:55 GMT",
"version": "v1"
},
{
"created": "Mon, 25 Jul 2011 16:51:52 GMT",
"version": "v2"
},
{
"created": "Mon, 22 Apr 2013 09:47:19 GMT",
"version": "v3"
}
] | 2013-04-23 | [
[
"Boudec",
"Jean-Yves Le",
""
],
[
"Tomozei",
"Dan-Cristian",
""
]
] | We study the stability of a Markovian model of electricity production and consumption that incorporates production volatility due to renewables and uncertainty about actual demand versus planned production. We assume that the energy producer targets a fixed energy reserve, subject to ramp-up and ramp-down constraints, ... |
2011.04723 | Yen-Yu Chang | Yen-Yu Chang, Pan Li, Rok Sosic, M. H. Afifi, Marco Schweighauser,
Jure Leskovec | F-FADE: Frequency Factorization for Anomaly Detection in Edge Streams | WSDM 2021 | null | null | null | cs.SI cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Edge streams are commonly used to capture interactions in dynamic networks,
such as email, social, or computer networks. The problem of detecting anomalies
or rare events in edge streams has a wide range of applications. However, it
presents many challenges due to lack of labels, a highly dynamic nature of
interactio... | [
{
"created": "Mon, 9 Nov 2020 19:55:40 GMT",
"version": "v1"
},
{
"created": "Fri, 5 Feb 2021 13:11:09 GMT",
"version": "v2"
}
] | 2021-02-08 | [
[
"Chang",
"Yen-Yu",
""
],
[
"Li",
"Pan",
""
],
[
"Sosic",
"Rok",
""
],
[
"Afifi",
"M. H.",
""
],
[
"Schweighauser",
"Marco",
""
],
[
"Leskovec",
"Jure",
""
]
] | Edge streams are commonly used to capture interactions in dynamic networks, such as email, social, or computer networks. The problem of detecting anomalies or rare events in edge streams has a wide range of applications. However, it presents many challenges due to lack of labels, a highly dynamic nature of interactions... |
1904.03735 | Mahmudur Rahman Khan | Mahmudur Khan and Jacob Chakareski | Visible Light Communication for Next Generation Untethered Virtual
Reality Systems | Accepted at IEEE International Conference on Communications Workshop
on Optical Wireless Communications, Shanghai, China, May 2019 | null | null | null | cs.NI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Virtual and augmented reality (VR/AR) systems are emerging technologies
requiring data rates of multiple Gbps. Existing high quality VR headsets
require connections through HDMI cables to a computer rendering rich graphic
contents to meet the extremely high data transfer rate requirement. Such a
cable connection limi... | [
{
"created": "Sun, 7 Apr 2019 20:24:55 GMT",
"version": "v1"
}
] | 2019-04-09 | [
[
"Khan",
"Mahmudur",
""
],
[
"Chakareski",
"Jacob",
""
]
] | Virtual and augmented reality (VR/AR) systems are emerging technologies requiring data rates of multiple Gbps. Existing high quality VR headsets require connections through HDMI cables to a computer rendering rich graphic contents to meet the extremely high data transfer rate requirement. Such a cable connection limits... |
2109.05261 | Shengyu Zhang | Shengyu Zhang, Dong Yao, Zhou Zhao, Tat-seng Chua, Fei Wu | CauseRec: Counterfactual User Sequence Synthesis for Sequential
Recommendation | Proceedings of the 44th International ACM SIGIR Conference on
Research and Development in Information Retrieval (SIGIR 2021) | null | 10.1145/3404835.3462908 | null | cs.IR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Learning user representations based on historical behaviors lies at the core
of modern recommender systems. Recent advances in sequential recommenders have
convincingly demonstrated high capability in extracting effective user
representations from the given behavior sequences. Despite significant
progress, we argue t... | [
{
"created": "Sat, 11 Sep 2021 11:41:07 GMT",
"version": "v1"
}
] | 2021-09-14 | [
[
"Zhang",
"Shengyu",
""
],
[
"Yao",
"Dong",
""
],
[
"Zhao",
"Zhou",
""
],
[
"Chua",
"Tat-seng",
""
],
[
"Wu",
"Fei",
""
]
] | Learning user representations based on historical behaviors lies at the core of modern recommender systems. Recent advances in sequential recommenders have convincingly demonstrated high capability in extracting effective user representations from the given behavior sequences. Despite significant progress, we argue tha... |
1711.02679 | Volodymyr Kuleshov | Volodymyr Kuleshov, Stefano Ermon | Neural Variational Inference and Learning in Undirected Graphical Models | Appearing in Proceedings of the 31st Conference on Neural Information
Processing Systems (NIPS) 2017, Long Beach, CA, USA | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Many problems in machine learning are naturally expressed in the language of
undirected graphical models. Here, we propose black-box learning and inference
algorithms for undirected models that optimize a variational approximation to
the log-likelihood of the model. Central to our approach is an upper bound on
the lo... | [
{
"created": "Tue, 7 Nov 2017 19:00:20 GMT",
"version": "v1"
},
{
"created": "Thu, 16 Nov 2017 21:33:11 GMT",
"version": "v2"
}
] | 2017-11-20 | [
[
"Kuleshov",
"Volodymyr",
""
],
[
"Ermon",
"Stefano",
""
]
] | Many problems in machine learning are naturally expressed in the language of undirected graphical models. Here, we propose black-box learning and inference algorithms for undirected models that optimize a variational approximation to the log-likelihood of the model. Central to our approach is an upper bound on the log-... |
2003.00336 | Shrinu Kushagra | Shrinu Kushagra | Three-dimensional matching is NP-Hard | null | null | null | null | cs.CC | http://creativecommons.org/publicdomain/zero/1.0/ | The standard proof of NP-Hardness of 3DM provides a power-$4$ reduction of
3SAT to 3DM. In this note, we provide a linear-time reduction. Under the
exponential time hypothesis, this reduction improves the runtime lower bound
from $2^{o(\sqrt[4]{m})}$ (under the standard reduction) to $2^{o(m)}$.
| [
{
"created": "Sat, 29 Feb 2020 19:51:55 GMT",
"version": "v1"
}
] | 2020-03-03 | [
[
"Kushagra",
"Shrinu",
""
]
] | The standard proof of NP-Hardness of 3DM provides a power-$4$ reduction of 3SAT to 3DM. In this note, we provide a linear-time reduction. Under the exponential time hypothesis, this reduction improves the runtime lower bound from $2^{o(\sqrt[4]{m})}$ (under the standard reduction) to $2^{o(m)}$. |
cs/0205052 | Laemmel | Vasu Alagar and Ralf Laemmel | Three-Tiered Specification of Micro-Architectures | null | null | null | null | cs.SE cs.PL | null | A three-tiered specification approach is developed to formally specify
collections of collaborating objects, say micro-architectures. (i) The
structural properties to be maintained in the collaboration are specified in
the lowest tier. (ii) The behaviour of the object methods in the classes is
specified in the middle... | [
{
"created": "Sun, 19 May 2002 14:46:34 GMT",
"version": "v1"
}
] | 2007-05-23 | [
[
"Alagar",
"Vasu",
""
],
[
"Laemmel",
"Ralf",
""
]
] | A three-tiered specification approach is developed to formally specify collections of collaborating objects, say micro-architectures. (i) The structural properties to be maintained in the collaboration are specified in the lowest tier. (ii) The behaviour of the object methods in the classes is specified in the middle t... |
2204.14117 | Yusuke Ohtsubo | Yusuke Ohtsubo, Takuto Sato, Hirohiko Sagawa | A Comparative Study of Meter Detection Methods for Automated
Infrastructure Inspection | 2 pages, in Japanese language | null | null | null | cs.CV | http://creativecommons.org/licenses/by/4.0/ | In order to read meter values from a camera on an autonomous inspection robot
with positional errors, it is necessary to detect meter regions from the image.
In this study, we developed shape-based, texture-based, and background
information-based methods as meter area detection techniques and compared their
effective... | [
{
"created": "Sun, 24 Apr 2022 13:59:57 GMT",
"version": "v1"
}
] | 2022-05-02 | [
[
"Ohtsubo",
"Yusuke",
""
],
[
"Sato",
"Takuto",
""
],
[
"Sagawa",
"Hirohiko",
""
]
] | In order to read meter values from a camera on an autonomous inspection robot with positional errors, it is necessary to detect meter regions from the image. In this study, we developed shape-based, texture-based, and background information-based methods as meter area detection techniques and compared their effectivene... |
1908.11341 | Sergei O. Kuznetsov | Sergei O. Kuznetsov | Ordered Sets for Data Analysis | null | null | null | null | cs.LO cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This book dwells on mathematical and algorithmic issues of data analysis
based on generality order of descriptions and respective precision. To speak of
these topics correctly, we have to go some way getting acquainted with the
important notions of relation and order theory. On the one hand, data often
have a complex... | [
{
"created": "Tue, 27 Aug 2019 18:01:13 GMT",
"version": "v1"
}
] | 2019-08-30 | [
[
"Kuznetsov",
"Sergei O.",
""
]
] | This book dwells on mathematical and algorithmic issues of data analysis based on generality order of descriptions and respective precision. To speak of these topics correctly, we have to go some way getting acquainted with the important notions of relation and order theory. On the one hand, data often have a complex s... |
2407.01031 | Dan Peng | Dan Peng, Zhihui Fu, Jun Wang | PocketLLM: Enabling On-Device Fine-Tuning for Personalized LLMs | Accepted to the ACL 2024 Workshop on Privacy in Natural Language
Processing (PrivateNLP) | null | null | null | cs.LG cs.CL | http://creativecommons.org/licenses/by-nc-sa/4.0/ | Recent advancements in large language models (LLMs) have indeed showcased
their impressive capabilities. On mobile devices, the wealth of valuable,
non-public data generated daily holds great promise for locally fine-tuning
personalized LLMs, while maintaining privacy through on-device processing.
However, the constr... | [
{
"created": "Mon, 1 Jul 2024 07:26:56 GMT",
"version": "v1"
}
] | 2024-07-02 | [
[
"Peng",
"Dan",
""
],
[
"Fu",
"Zhihui",
""
],
[
"Wang",
"Jun",
""
]
] | Recent advancements in large language models (LLMs) have indeed showcased their impressive capabilities. On mobile devices, the wealth of valuable, non-public data generated daily holds great promise for locally fine-tuning personalized LLMs, while maintaining privacy through on-device processing. However, the constrai... |
2009.00506 | Oliver Horst | Oliver Horst and Johannes Wiesb\"ock and Raphael Wild and Uwe
Baumgarten | Quantifying the Latency and Possible Throughput of External Interrupts
on Cyber-Physical Systems | Appeared in proceedings of the 3rd Workshop on Benchmarking
Cyber-Physical Systems and Internet of Things (CPS-IoTBench) held in
conjunction with the 26th Annual International Conference on Mobile Computing
and Networking (MobiCom) | null | null | null | cs.OS | http://creativecommons.org/licenses/by-sa/4.0/ | An important characteristic of cyber-physical systems is their capability to
respond, in-time, to events from their physical environment. However, to the
best of our knowledge there exists no benchmark for assessing and comparing the
interrupt handling performance of different software stacks. Hence, we present
a fle... | [
{
"created": "Tue, 1 Sep 2020 15:08:31 GMT",
"version": "v1"
}
] | 2020-09-02 | [
[
"Horst",
"Oliver",
""
],
[
"Wiesböck",
"Johannes",
""
],
[
"Wild",
"Raphael",
""
],
[
"Baumgarten",
"Uwe",
""
]
] | An important characteristic of cyber-physical systems is their capability to respond, in-time, to events from their physical environment. However, to the best of our knowledge there exists no benchmark for assessing and comparing the interrupt handling performance of different software stacks. Hence, we present a flexi... |
2308.10248 | Gavin Leech | Alexander Matt Turner, Lisa Thiergart, Gavin Leech, David Udell, Juan
J. Vazquez, Ulisse Mini, Monte MacDiarmid | Activation Addition: Steering Language Models Without Optimization | null | null | null | null | cs.CL cs.LG | http://creativecommons.org/licenses/by/4.0/ | Reliably controlling the behavior of large language models is a pressing open
problem. Existing methods include supervised finetuning, reinforcement learning
from human feedback, prompt engineering and guided decoding. We instead
investigate activation engineering: modifying activations at inference-time to
predictab... | [
{
"created": "Sun, 20 Aug 2023 12:21:05 GMT",
"version": "v1"
},
{
"created": "Fri, 1 Sep 2023 17:07:29 GMT",
"version": "v2"
},
{
"created": "Mon, 13 Nov 2023 14:05:13 GMT",
"version": "v3"
},
{
"created": "Tue, 4 Jun 2024 10:08:39 GMT",
"version": "v4"
}
] | 2024-06-05 | [
[
"Turner",
"Alexander Matt",
""
],
[
"Thiergart",
"Lisa",
""
],
[
"Leech",
"Gavin",
""
],
[
"Udell",
"David",
""
],
[
"Vazquez",
"Juan J.",
""
],
[
"Mini",
"Ulisse",
""
],
[
"MacDiarmid",
"Monte",
""
]
] | Reliably controlling the behavior of large language models is a pressing open problem. Existing methods include supervised finetuning, reinforcement learning from human feedback, prompt engineering and guided decoding. We instead investigate activation engineering: modifying activations at inference-time to predictably... |
1806.06396 | Qingqing Wu | Miao Cui, Guangchi Zhang, Qingqing Wu, and Derrick Wing Kwan Ng | Robust Trajectory and Transmit Power Design for Secure UAV
Communications | Accepted by IEEE Transactions on Vehicular Technology, 2018 | null | null | null | cs.IT math.DS math.IT math.OC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Unmanned aerial vehicles (UAVs) are anticipated to be widely deployed in
future wireless communications, due to their advantages of high mobility and
easy deployment. However, the broadcast nature of air-to-ground line-of-sight
wireless chan- nels brings a new challenge to the information security of UAV-
ground comm... | [
{
"created": "Sun, 17 Jun 2018 15:44:20 GMT",
"version": "v1"
}
] | 2018-06-19 | [
[
"Cui",
"Miao",
""
],
[
"Zhang",
"Guangchi",
""
],
[
"Wu",
"Qingqing",
""
],
[
"Ng",
"Derrick Wing Kwan",
""
]
] | Unmanned aerial vehicles (UAVs) are anticipated to be widely deployed in future wireless communications, due to their advantages of high mobility and easy deployment. However, the broadcast nature of air-to-ground line-of-sight wireless chan- nels brings a new challenge to the information security of UAV- ground commun... |
2303.12364 | Maurice Rupp | Maurice Rupp, Oriane Peter, Thirupathi Pattipaka | ExBEHRT: Extended Transformer for Electronic Health Records to Predict
Disease Subtypes & Progressions | ICLR 2023 Workshop on Trustworthy Machine Learning for Healthcare
(Website: https://sites.google.com/view/tml4h2023/accepted-papers ) | Lecture Notes in Computer Science, vol 13932. Springer, Cham 2023 | 10.1007/978-3-031-39539-0_7 | null | cs.LG cs.AI | http://creativecommons.org/licenses/by/4.0/ | In this study, we introduce ExBEHRT, an extended version of BEHRT (BERT
applied to electronic health records), and apply different algorithms to
interpret its results. While BEHRT considers only diagnoses and patient age, we
extend the feature space to several multimodal records, namely demographics,
clinical charact... | [
{
"created": "Wed, 22 Mar 2023 08:03:27 GMT",
"version": "v1"
},
{
"created": "Tue, 11 Apr 2023 07:00:49 GMT",
"version": "v2"
},
{
"created": "Fri, 11 Aug 2023 14:59:36 GMT",
"version": "v3"
}
] | 2023-08-14 | [
[
"Rupp",
"Maurice",
""
],
[
"Peter",
"Oriane",
""
],
[
"Pattipaka",
"Thirupathi",
""
]
] | In this study, we introduce ExBEHRT, an extended version of BEHRT (BERT applied to electronic health records), and apply different algorithms to interpret its results. While BEHRT considers only diagnoses and patient age, we extend the feature space to several multimodal records, namely demographics, clinical character... |
2107.02434 | Shunquan Tan | Long Zhuo and Shunquan Tan and Bin Li and Jiwu Huang | Self-Adversarial Training incorporating Forgery Attention for Image
Forgery Localization | accepted by TIFS | null | 10.1109/TIFS.2022.3152362 | null | cs.CV cs.MM | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Image editing techniques enable people to modify the content of an image
without leaving visual traces and thus may cause serious security risks. Hence
the detection and localization of these forgeries become quite necessary and
challenging. Furthermore, unlike other tasks with extensive data, there is
usually a lack... | [
{
"created": "Tue, 6 Jul 2021 07:20:08 GMT",
"version": "v1"
},
{
"created": "Thu, 3 Feb 2022 04:14:46 GMT",
"version": "v2"
}
] | 2022-02-21 | [
[
"Zhuo",
"Long",
""
],
[
"Tan",
"Shunquan",
""
],
[
"Li",
"Bin",
""
],
[
"Huang",
"Jiwu",
""
]
] | Image editing techniques enable people to modify the content of an image without leaving visual traces and thus may cause serious security risks. Hence the detection and localization of these forgeries become quite necessary and challenging. Furthermore, unlike other tasks with extensive data, there is usually a lack o... |
2403.02936 | Mahdi Taheri | Mahdi Taheri, Natalia Cherezova, Samira Nazari, Ahsan Rafiq, Ali
Azarpeyvand, Tara Ghasempouri, Masoud Daneshtalab, Jaan Raik and Maksim
Jenihhin | AdAM: Adaptive Fault-Tolerant Approximate Multiplier for Edge DNN
Accelerators | null | null | null | null | cs.AI cs.AR cs.LG | http://creativecommons.org/licenses/by-nc-nd/4.0/ | In this paper, we propose an architecture of a novel adaptive fault-tolerant
approximate multiplier tailored for ASIC-based DNN accelerators.
| [
{
"created": "Tue, 5 Mar 2024 13:03:31 GMT",
"version": "v1"
}
] | 2024-03-06 | [
[
"Taheri",
"Mahdi",
""
],
[
"Cherezova",
"Natalia",
""
],
[
"Nazari",
"Samira",
""
],
[
"Rafiq",
"Ahsan",
""
],
[
"Azarpeyvand",
"Ali",
""
],
[
"Ghasempouri",
"Tara",
""
],
[
"Daneshtalab",
"Masoud",
""
],... | In this paper, we propose an architecture of a novel adaptive fault-tolerant approximate multiplier tailored for ASIC-based DNN accelerators. |
2210.15615 | Nikita Moghe | Chantal Amrhein and Nikita Moghe and Liane Guillou | ACES: Translation Accuracy Challenge Sets for Evaluating Machine
Translation Metrics | preprint for WMT 2022 with updated tables | null | null | null | cs.CL | http://creativecommons.org/licenses/by/4.0/ | As machine translation (MT) metrics improve their correlation with human
judgement every year, it is crucial to understand the limitations of such
metrics at the segment level. Specifically, it is important to investigate
metric behaviour when facing accuracy errors in MT because these can have
dangerous consequences... | [
{
"created": "Thu, 27 Oct 2022 16:59:02 GMT",
"version": "v1"
},
{
"created": "Tue, 6 Dec 2022 09:45:29 GMT",
"version": "v2"
}
] | 2022-12-07 | [
[
"Amrhein",
"Chantal",
""
],
[
"Moghe",
"Nikita",
""
],
[
"Guillou",
"Liane",
""
]
] | As machine translation (MT) metrics improve their correlation with human judgement every year, it is crucial to understand the limitations of such metrics at the segment level. Specifically, it is important to investigate metric behaviour when facing accuracy errors in MT because these can have dangerous consequences i... |
1701.08517 | Pieter Leyman | Pieter Leyman, San Tu Pham, Patrick De Causmaecker | The Intermittent Traveling Salesman Problem with Different Temperature
Profiles: Greedy or not? | null | null | null | null | cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this research, we discuss the intermittent traveling salesman problem
(ITSP), which extends the traditional traveling salesman problem (TSP) by
imposing temperature restrictions on each node. These additional constraints
limit the maximum allowable visit time per node, and result in multiple visits
for each node w... | [
{
"created": "Mon, 30 Jan 2017 09:22:08 GMT",
"version": "v1"
}
] | 2017-01-31 | [
[
"Leyman",
"Pieter",
""
],
[
"Pham",
"San Tu",
""
],
[
"De Causmaecker",
"Patrick",
""
]
] | In this research, we discuss the intermittent traveling salesman problem (ITSP), which extends the traditional traveling salesman problem (TSP) by imposing temperature restrictions on each node. These additional constraints limit the maximum allowable visit time per node, and result in multiple visits for each node whi... |
1204.3372 | Anton Salikhmetov | Anton Salikhmetov | Blind graph rewriting systems | 4 pages | null | null | null | cs.LO cs.FL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We consider a simple (probably, the simplest) structure for random access
memory. This structure can be used to construct a universal system with nearly
void processor, namely, we demonstrate that the processor of such a system may
have empty instruction set, in a more strong manner than the existing ZISC
(zero instr... | [
{
"created": "Mon, 16 Apr 2012 07:02:25 GMT",
"version": "v1"
}
] | 2012-04-17 | [
[
"Salikhmetov",
"Anton",
""
]
] | We consider a simple (probably, the simplest) structure for random access memory. This structure can be used to construct a universal system with nearly void processor, namely, we demonstrate that the processor of such a system may have empty instruction set, in a more strong manner than the existing ZISC (zero instruc... |
2206.02511 | Yang Li | Yang Li, Yu Shen, Huaijun Jiang, Tianyi Bai, Wentao Zhang, Ce Zhang
and Bin Cui | Transfer Learning based Search Space Design for Hyperparameter Tuning | 9 pages and 2 extra pages for appendix | Proceedings of the 28th ACM SIGKDD Conference on Knowledge
Discovery and Data Mining (KDD 2022) | 10.1145/3534678.3539369 | null | cs.LG cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The tuning of hyperparameters becomes increasingly important as machine
learning (ML) models have been extensively applied in data mining applications.
Among various approaches, Bayesian optimization (BO) is a successful
methodology to tune hyper-parameters automatically. While traditional methods
optimize each tunin... | [
{
"created": "Mon, 6 Jun 2022 11:48:58 GMT",
"version": "v1"
}
] | 2022-06-07 | [
[
"Li",
"Yang",
""
],
[
"Shen",
"Yu",
""
],
[
"Jiang",
"Huaijun",
""
],
[
"Bai",
"Tianyi",
""
],
[
"Zhang",
"Wentao",
""
],
[
"Zhang",
"Ce",
""
],
[
"Cui",
"Bin",
""
]
] | The tuning of hyperparameters becomes increasingly important as machine learning (ML) models have been extensively applied in data mining applications. Among various approaches, Bayesian optimization (BO) is a successful methodology to tune hyper-parameters automatically. While traditional methods optimize each tuning ... |
1004.3555 | Vishal Goyal | Sukhvinder S. Bamber, Ajay K. Sharma | Comparative Performance Investigations of different scenarios for
802.15.4 WPAN | International Journal of Computer Science Issues online at
http://ijcsi.org/articles/Comparative-Performance-Investigations-of-different-scenarios-for-802-15-4-WPAN.php | IJCSI, Volume 7, Issue 2, March 2010 | null | null | cs.NI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper investigates the performance of WPAN based on various topological
scenarios like: cluster, star and ring. The comparative results have been
reported for the performance metrics like: Throughput, Traffic sent, Traffic
received and Packets dropped. Cluster topology is best in comparison with star
and ring to... | [
{
"created": "Tue, 20 Apr 2010 20:10:49 GMT",
"version": "v1"
}
] | 2010-04-22 | [
[
"Bamber",
"Sukhvinder S.",
""
],
[
"Sharma",
"Ajay K.",
""
]
] | This paper investigates the performance of WPAN based on various topological scenarios like: cluster, star and ring. The comparative results have been reported for the performance metrics like: Throughput, Traffic sent, Traffic received and Packets dropped. Cluster topology is best in comparison with star and ring topo... |
1504.07597 | Nicolas Turenne | Nicolas Turenne | Duplicate Detection with Efficient Language Models for Automatic
Bibliographic Heterogeneous Data Integration | null | null | null | null | cs.DB | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We present a new method to detect duplicates used to merge different
bibliographic record corpora with the help of lexical and social information.
As we show, a trivial key is not available to delete useless documents. Merging
heteregeneous document databases to get a maximum of information can be of
interest. In our... | [
{
"created": "Mon, 27 Apr 2015 11:53:01 GMT",
"version": "v1"
}
] | 2015-04-29 | [
[
"Turenne",
"Nicolas",
""
]
] | We present a new method to detect duplicates used to merge different bibliographic record corpora with the help of lexical and social information. As we show, a trivial key is not available to delete useless documents. Merging heteregeneous document databases to get a maximum of information can be of interest. In our c... |
1812.05195 | Vaibhav Saini | Vaibhav Saini, Farima Farmahinifarahani, Yadong Lu, Di Yang, Pedro
Martins, Hitesh Sajnani, Pierre Baldi, Cristina Lopes | Towards Automating Precision Studies of Clone Detectors | Accepted to be published in the 41st ACM/IEEE International
Conference on Software Engineering | Proceeding 2019 IEEE/ACM 41st International Conference on Software
Engineering (ICSE) | 10.1109/ICSE.2019.00023 | null | cs.SE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Current research in clone detection suffers from poor ecosystems for
evaluating precision of clone detection tools. Corpora of labeled clones are
scarce and incomplete, making evaluation labor intensive and idiosyncratic, and
limiting inter tool comparison. Precision-assessment tools are simply lacking.
We present a ... | [
{
"created": "Wed, 12 Dec 2018 23:28:59 GMT",
"version": "v1"
},
{
"created": "Fri, 14 Dec 2018 02:36:31 GMT",
"version": "v2"
}
] | 2019-05-30 | [
[
"Saini",
"Vaibhav",
""
],
[
"Farmahinifarahani",
"Farima",
""
],
[
"Lu",
"Yadong",
""
],
[
"Yang",
"Di",
""
],
[
"Martins",
"Pedro",
""
],
[
"Sajnani",
"Hitesh",
""
],
[
"Baldi",
"Pierre",
""
],
[
"... | Current research in clone detection suffers from poor ecosystems for evaluating precision of clone detection tools. Corpora of labeled clones are scarce and incomplete, making evaluation labor intensive and idiosyncratic, and limiting inter tool comparison. Precision-assessment tools are simply lacking. We present a se... |
2309.06672 | Zhengyang Chen | Zhengyang Chen, Bing Han, Shuai Wang and Yanmin Qian | Attention-based Encoder-Decoder End-to-End Neural Diarization with
Embedding Enhancer | IEEE/ACM Transactions on Audio Speech and Language Processing Under
Review | null | null | null | cs.SD eess.AS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Deep neural network-based systems have significantly improved the performance
of speaker diarization tasks. However, end-to-end neural diarization (EEND)
systems often struggle to generalize to scenarios with an unseen number of
speakers, while target speaker voice activity detection (TS-VAD) systems tend
to be overl... | [
{
"created": "Wed, 13 Sep 2023 02:17:13 GMT",
"version": "v1"
}
] | 2023-09-14 | [
[
"Chen",
"Zhengyang",
""
],
[
"Han",
"Bing",
""
],
[
"Wang",
"Shuai",
""
],
[
"Qian",
"Yanmin",
""
]
] | Deep neural network-based systems have significantly improved the performance of speaker diarization tasks. However, end-to-end neural diarization (EEND) systems often struggle to generalize to scenarios with an unseen number of speakers, while target speaker voice activity detection (TS-VAD) systems tend to be overly ... |
1703.03262 | Ching-Hua Yu | Ching-Hua Yu | Does Nash Envy Immunity | null | null | null | null | cs.GT cs.CC cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The most popular stability notion in games should be Nash equilibrium under
the rationality of players who maximize their own payoff individually. In
contrast, in many scenarios, players can be (partly) irrational with some
unpredictable factors. Hence a strategy profile can be more robust if it is
resilient against ... | [
{
"created": "Thu, 9 Mar 2017 13:45:45 GMT",
"version": "v1"
}
] | 2017-03-10 | [
[
"Yu",
"Ching-Hua",
""
]
] | The most popular stability notion in games should be Nash equilibrium under the rationality of players who maximize their own payoff individually. In contrast, in many scenarios, players can be (partly) irrational with some unpredictable factors. Hence a strategy profile can be more robust if it is resilient against ce... |
2312.15820 | Qi Chen | Qi Chen, Dileepa Pitawela, Chongyang Zhao, Gengze Zhou, Hsiang-Ting
Chen, Qi Wu | WebVLN: Vision-and-Language Navigation on Websites | Accepted by AAAI2024 | null | null | null | cs.CV | http://creativecommons.org/licenses/by/4.0/ | Vision-and-Language Navigation (VLN) task aims to enable AI agents to
accurately understand and follow natural language instructions to navigate
through real-world environments, ultimately reaching specific target locations.
We recognise a promising opportunity to extend VLN to a comparable navigation
task that holds... | [
{
"created": "Mon, 25 Dec 2023 22:13:26 GMT",
"version": "v1"
}
] | 2023-12-27 | [
[
"Chen",
"Qi",
""
],
[
"Pitawela",
"Dileepa",
""
],
[
"Zhao",
"Chongyang",
""
],
[
"Zhou",
"Gengze",
""
],
[
"Chen",
"Hsiang-Ting",
""
],
[
"Wu",
"Qi",
""
]
] | Vision-and-Language Navigation (VLN) task aims to enable AI agents to accurately understand and follow natural language instructions to navigate through real-world environments, ultimately reaching specific target locations. We recognise a promising opportunity to extend VLN to a comparable navigation task that holds s... |
2001.01861 | Subru Krishnan | Mohammad Hossein Namaki, Avrilia Floratou, Fotis Psallidas, Subru
Krishnan, Ashvin Agrawal, Yinghui Wu, Yiwen Zhu and Markus Weimer | Vamsa: Automated Provenance Tracking in Data Science Scripts | null | null | 10.1145/3394486.3403205 | null | cs.LG cs.DC stat.ML | http://creativecommons.org/licenses/by-nc-sa/4.0/ | There has recently been a lot of ongoing research in the areas of fairness,
bias and explainability of machine learning (ML) models due to the self-evident
or regulatory requirements of various ML applications. We make the following
observation: All of these approaches require a robust understanding of the
relationsh... | [
{
"created": "Tue, 7 Jan 2020 02:39:02 GMT",
"version": "v1"
},
{
"created": "Thu, 30 Jul 2020 16:58:22 GMT",
"version": "v2"
}
] | 2020-07-31 | [
[
"Namaki",
"Mohammad Hossein",
""
],
[
"Floratou",
"Avrilia",
""
],
[
"Psallidas",
"Fotis",
""
],
[
"Krishnan",
"Subru",
""
],
[
"Agrawal",
"Ashvin",
""
],
[
"Wu",
"Yinghui",
""
],
[
"Zhu",
"Yiwen",
""
],
... | There has recently been a lot of ongoing research in the areas of fairness, bias and explainability of machine learning (ML) models due to the self-evident or regulatory requirements of various ML applications. We make the following observation: All of these approaches require a robust understanding of the relationship... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.