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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
2311.14883 | Sheikh Rabiul Islam | Alana Cedeno, Rachel Liang, and Sheikh Rabiul Islam | Predicting Potential School Shooters from Social Media Posts | null | IEEE Big Data 2023 | null | null | cs.SI | http://creativecommons.org/licenses/by/4.0/ | The rate of terror attacks has surged over the past decade, resulting in the
tragic and senseless loss or alteration of numerous lives. Offenders behind
mass shootings, bombings, or other domestic terrorism incidents have
historically exhibited warning signs on social media before carrying out actual
incidents. Howev... | [
{
"created": "Sat, 25 Nov 2023 00:30:23 GMT",
"version": "v1"
}
] | 2023-11-28 | [
[
"Cedeno",
"Alana",
""
],
[
"Liang",
"Rachel",
""
],
[
"Islam",
"Sheikh Rabiul",
""
]
] | The rate of terror attacks has surged over the past decade, resulting in the tragic and senseless loss or alteration of numerous lives. Offenders behind mass shootings, bombings, or other domestic terrorism incidents have historically exhibited warning signs on social media before carrying out actual incidents. However... |
2105.08872 | Jiansheng Fang | Jiansheng Fang, Huazhu Fu, Dan Zeng, Xiao Yan, Yuguang Yan, and Jiang
Liu | Combating Ambiguity for Hash-code Learning in Medical Instance Retrieval | 11 pages,8 figures, JBHI Journal | null | null | null | cs.IR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | When encountering a dubious diagnostic case, medical instance retrieval can
help radiologists make evidence-based diagnoses by finding images containing
instances similar to a query case from a large image database. The similarity
between the query case and retrieved similar cases is determined by visual
features ext... | [
{
"created": "Wed, 19 May 2021 01:13:05 GMT",
"version": "v1"
}
] | 2021-05-20 | [
[
"Fang",
"Jiansheng",
""
],
[
"Fu",
"Huazhu",
""
],
[
"Zeng",
"Dan",
""
],
[
"Yan",
"Xiao",
""
],
[
"Yan",
"Yuguang",
""
],
[
"Liu",
"Jiang",
""
]
] | When encountering a dubious diagnostic case, medical instance retrieval can help radiologists make evidence-based diagnoses by finding images containing instances similar to a query case from a large image database. The similarity between the query case and retrieved similar cases is determined by visual features extra... |
2310.06486 | Guoyuan An | Guoyuan An, Juhyung Seon, Inkyu An, Yuchi Huo, Sung-Eui Yoon | Topological RANSAC for instance verification and retrieval without
fine-tuning | null | null | null | null | cs.AI cs.CV cs.IR | http://creativecommons.org/licenses/by/4.0/ | This paper presents an innovative approach to enhancing explainable image
retrieval, particularly in situations where a fine-tuning set is unavailable.
The widely-used SPatial verification (SP) method, despite its efficacy, relies
on a spatial model and the hypothesis-testing strategy for instance
recognition, leadin... | [
{
"created": "Tue, 10 Oct 2023 09:53:59 GMT",
"version": "v1"
}
] | 2023-10-11 | [
[
"An",
"Guoyuan",
""
],
[
"Seon",
"Juhyung",
""
],
[
"An",
"Inkyu",
""
],
[
"Huo",
"Yuchi",
""
],
[
"Yoon",
"Sung-Eui",
""
]
] | This paper presents an innovative approach to enhancing explainable image retrieval, particularly in situations where a fine-tuning set is unavailable. The widely-used SPatial verification (SP) method, despite its efficacy, relies on a spatial model and the hypothesis-testing strategy for instance recognition, leading ... |
2306.12881 | Adrian Holzbock | Adrian Holzbock, Achyut Hegde, Klaus Dietmayer, and Vasileios
Belagiannis | Data-Free Backbone Fine-Tuning for Pruned Neural Networks | Accpeted for presentation at the 31st European Signal Processing
Conference (EUSIPCO) 2023, September 4-8, 2023, Helsinki, Finland | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Model compression techniques reduce the computational load and memory
consumption of deep neural networks. After the compression operation, e.g.
parameter pruning, the model is normally fine-tuned on the original training
dataset to recover from the performance drop caused by compression. However,
the training data i... | [
{
"created": "Thu, 22 Jun 2023 13:44:40 GMT",
"version": "v1"
}
] | 2023-06-23 | [
[
"Holzbock",
"Adrian",
""
],
[
"Hegde",
"Achyut",
""
],
[
"Dietmayer",
"Klaus",
""
],
[
"Belagiannis",
"Vasileios",
""
]
] | Model compression techniques reduce the computational load and memory consumption of deep neural networks. After the compression operation, e.g. parameter pruning, the model is normally fine-tuned on the original training dataset to recover from the performance drop caused by compression. However, the training data is ... |
2102.10607 | Sivaramakrishnan Rajaraman | Sivaramakrishnan Rajaraman, Les Folio, Jane Dimperio, Philip Alderson
and Sameer Antani | Improved Semantic Segmentation of Tuberculosis-consistent findings in
Chest X-rays Using Augmented Training of Modality-specific U-Net Models with
Weak Localizations | 31 pages, 19 figures, journal publication | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Deep learning (DL) has drawn tremendous attention in object localization and
recognition for both natural and medical images. U-Net segmentation models have
demonstrated superior performance compared to conventional handcrafted
feature-based methods. Medical image modality-specific DL models are better at
transferrin... | [
{
"created": "Sun, 21 Feb 2021 14:03:49 GMT",
"version": "v1"
},
{
"created": "Mon, 1 Mar 2021 18:10:45 GMT",
"version": "v2"
},
{
"created": "Fri, 26 Mar 2021 17:14:27 GMT",
"version": "v3"
}
] | 2021-03-29 | [
[
"Rajaraman",
"Sivaramakrishnan",
""
],
[
"Folio",
"Les",
""
],
[
"Dimperio",
"Jane",
""
],
[
"Alderson",
"Philip",
""
],
[
"Antani",
"Sameer",
""
]
] | Deep learning (DL) has drawn tremendous attention in object localization and recognition for both natural and medical images. U-Net segmentation models have demonstrated superior performance compared to conventional handcrafted feature-based methods. Medical image modality-specific DL models are better at transferring ... |
1905.03767 | Ashkan Khakzar | Ashkan Khakzar, Shadi Albarqouni, Nassir Navab | Learning Interpretable Features via Adversarially Robust Optimization | MICCAI 2019 (Medical Image Computing and Computer Assisted
Interventions) | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Neural networks are proven to be remarkably successful for classification and
diagnosis in medical applications. However, the ambiguity in the
decision-making process and the interpretability of the learned features is a
matter of concern. In this work, we propose a method for improving the feature
interpretability o... | [
{
"created": "Thu, 9 May 2019 17:50:25 GMT",
"version": "v1"
},
{
"created": "Mon, 19 Aug 2019 09:18:32 GMT",
"version": "v2"
}
] | 2019-08-20 | [
[
"Khakzar",
"Ashkan",
""
],
[
"Albarqouni",
"Shadi",
""
],
[
"Navab",
"Nassir",
""
]
] | Neural networks are proven to be remarkably successful for classification and diagnosis in medical applications. However, the ambiguity in the decision-making process and the interpretability of the learned features is a matter of concern. In this work, we propose a method for improving the feature interpretability of ... |
1902.03519 | Ali Vakilian | Arturs Backurs, Piotr Indyk, Krzysztof Onak, Baruch Schieber, Ali
Vakilian, Tal Wagner | Scalable Fair Clustering | ICML 2019 | null | null | null | cs.DS cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We study the fair variant of the classic $k$-median problem introduced by
Chierichetti et al. [2017]. In the standard $k$-median problem, given an input
pointset $P$, the goal is to find $k$ centers $C$ and assign each input point
to one of the centers in $C$ such that the average distance of points to their
cluster ... | [
{
"created": "Sun, 10 Feb 2019 00:04:34 GMT",
"version": "v1"
},
{
"created": "Mon, 10 Jun 2019 18:19:34 GMT",
"version": "v2"
}
] | 2019-06-12 | [
[
"Backurs",
"Arturs",
""
],
[
"Indyk",
"Piotr",
""
],
[
"Onak",
"Krzysztof",
""
],
[
"Schieber",
"Baruch",
""
],
[
"Vakilian",
"Ali",
""
],
[
"Wagner",
"Tal",
""
]
] | We study the fair variant of the classic $k$-median problem introduced by Chierichetti et al. [2017]. In the standard $k$-median problem, given an input pointset $P$, the goal is to find $k$ centers $C$ and assign each input point to one of the centers in $C$ such that the average distance of points to their cluster ce... |
1910.13620 | Xiang Huang | Xiang Huang, Jack H. Lutz, and Andrei N. Migunov | Algorithmic Randomness in Continuous-Time Markov Chains | null | null | null | null | cs.IT cs.LO math.IT math.PR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we develop the elements of the theory of algorithmic
randomness in continuous-time Markov chains (CTMCs). Our main contribution is a
rigorous, useful notion of what it means for an $\textit{ individual trajectory
}$ of a CTMC to be ${ \textit random }$. CTMCs have discrete state spaces and
operate in c... | [
{
"created": "Wed, 30 Oct 2019 01:48:38 GMT",
"version": "v1"
},
{
"created": "Tue, 7 Dec 2021 05:03:22 GMT",
"version": "v2"
},
{
"created": "Fri, 17 Dec 2021 17:52:23 GMT",
"version": "v3"
}
] | 2021-12-20 | [
[
"Huang",
"Xiang",
""
],
[
"Lutz",
"Jack H.",
""
],
[
"Migunov",
"Andrei N.",
""
]
] | In this paper, we develop the elements of the theory of algorithmic randomness in continuous-time Markov chains (CTMCs). Our main contribution is a rigorous, useful notion of what it means for an $\textit{ individual trajectory }$ of a CTMC to be ${ \textit random }$. CTMCs have discrete state spaces and operate in con... |
2306.12725 | Senbao Shi | Senbao Shi, Zhenran Xu, Baotian Hu, Min Zhang | Generative Multimodal Entity Linking | Accepted by LREC-COLING 2024 | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Multimodal Entity Linking (MEL) is the task of mapping mentions with
multimodal contexts to the referent entities from a knowledge base. Existing
MEL methods mainly focus on designing complex multimodal interaction mechanisms
and require fine-tuning all model parameters, which can be prohibitively costly
and difficul... | [
{
"created": "Thu, 22 Jun 2023 07:57:19 GMT",
"version": "v1"
},
{
"created": "Fri, 18 Aug 2023 05:12:12 GMT",
"version": "v2"
},
{
"created": "Tue, 19 Mar 2024 12:30:53 GMT",
"version": "v3"
},
{
"created": "Wed, 20 Mar 2024 01:30:41 GMT",
"version": "v4"
}
] | 2024-03-21 | [
[
"Shi",
"Senbao",
""
],
[
"Xu",
"Zhenran",
""
],
[
"Hu",
"Baotian",
""
],
[
"Zhang",
"Min",
""
]
] | Multimodal Entity Linking (MEL) is the task of mapping mentions with multimodal contexts to the referent entities from a knowledge base. Existing MEL methods mainly focus on designing complex multimodal interaction mechanisms and require fine-tuning all model parameters, which can be prohibitively costly and difficult ... |
1602.01648 | Maiara F. Bollauf | Maiara F. Bollauf and Ram Zamir | Uniformity Properties of Construction C | 5 pages, 1 figure, submitted to ISIT 2016 | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Construction C (also known as Forney's multi-level code formula) forms a
Euclidean code for the additive white Gaussian noise (AWGN) channel from $L$
binary code components. If the component codes are linear, then the minimum
distance is the same for all the points, although the kissing number may vary.
In fact, whil... | [
{
"created": "Thu, 4 Feb 2016 11:53:31 GMT",
"version": "v1"
},
{
"created": "Mon, 9 May 2016 15:46:00 GMT",
"version": "v2"
}
] | 2016-05-10 | [
[
"Bollauf",
"Maiara F.",
""
],
[
"Zamir",
"Ram",
""
]
] | Construction C (also known as Forney's multi-level code formula) forms a Euclidean code for the additive white Gaussian noise (AWGN) channel from $L$ binary code components. If the component codes are linear, then the minimum distance is the same for all the points, although the kissing number may vary. In fact, while ... |
2009.14794 | Valerii Likhosherstov | Krzysztof Choromanski, Valerii Likhosherstov, David Dohan, Xingyou
Song, Andreea Gane, Tamas Sarlos, Peter Hawkins, Jared Davis, Afroz
Mohiuddin, Lukasz Kaiser, David Belanger, Lucy Colwell, Adrian Weller | Rethinking Attention with Performers | Published as a conference paper + oral presentation at ICLR 2021. 38
pages. See
https://github.com/google-research/google-research/tree/master/protein_lm for
protein language model code, and
https://github.com/google-research/google-research/tree/master/performer for
Performer code. See
https://ai.googleblo... | null | null | null | cs.LG cs.CL stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We introduce Performers, Transformer architectures which can estimate regular
(softmax) full-rank-attention Transformers with provable accuracy, but using
only linear (as opposed to quadratic) space and time complexity, without
relying on any priors such as sparsity or low-rankness. To approximate softmax
attention-k... | [
{
"created": "Wed, 30 Sep 2020 17:09:09 GMT",
"version": "v1"
},
{
"created": "Tue, 16 Feb 2021 21:40:24 GMT",
"version": "v2"
},
{
"created": "Tue, 9 Mar 2021 16:26:47 GMT",
"version": "v3"
},
{
"created": "Sat, 19 Nov 2022 12:45:21 GMT",
"version": "v4"
}
] | 2022-11-22 | [
[
"Choromanski",
"Krzysztof",
""
],
[
"Likhosherstov",
"Valerii",
""
],
[
"Dohan",
"David",
""
],
[
"Song",
"Xingyou",
""
],
[
"Gane",
"Andreea",
""
],
[
"Sarlos",
"Tamas",
""
],
[
"Hawkins",
"Peter",
""
],... | We introduce Performers, Transformer architectures which can estimate regular (softmax) full-rank-attention Transformers with provable accuracy, but using only linear (as opposed to quadratic) space and time complexity, without relying on any priors such as sparsity or low-rankness. To approximate softmax attention-ker... |
2011.07805 | Guoqiang Wu | Guoqiang Wu, Jun Zhu | Multi-label classification: do Hamming loss and subset accuracy really
conflict with each other? | To Appear in NeurIPS 2020 | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Various evaluation measures have been developed for multi-label
classification, including Hamming Loss (HL), Subset Accuracy (SA) and Ranking
Loss (RL). However, there is a gap between empirical results and the existing
theories: 1) an algorithm often empirically performs well on some measure(s)
while poorly on other... | [
{
"created": "Mon, 16 Nov 2020 09:13:16 GMT",
"version": "v1"
}
] | 2020-11-17 | [
[
"Wu",
"Guoqiang",
""
],
[
"Zhu",
"Jun",
""
]
] | Various evaluation measures have been developed for multi-label classification, including Hamming Loss (HL), Subset Accuracy (SA) and Ranking Loss (RL). However, there is a gap between empirical results and the existing theories: 1) an algorithm often empirically performs well on some measure(s) while poorly on others,... |
1509.04199 | Eric Sopena | Eric Sopena (LaBRI) | i-MARK: A New Subtraction Division Game | A few typos have been corrected, including the statement of Theorem 8 | null | null | null | cs.DM | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Given two finite sets of integers $S\subseteq\NNN\setminus\{0\}$ and
$D\subseteq\NNN\setminus\{0,1\}$,the impartial combinatorial game $\IMARK(S,D)$
is played on a heap of tokens. From a heap of $n$ tokens, each player can
moveeither to a heap of $n-s$ tokens for some $s\in S$, or to a heap of $n/d$
tokensfor some $d... | [
{
"created": "Mon, 14 Sep 2015 16:57:57 GMT",
"version": "v1"
},
{
"created": "Mon, 9 Nov 2015 15:11:52 GMT",
"version": "v2"
}
] | 2015-11-10 | [
[
"Sopena",
"Eric",
"",
"LaBRI"
]
] | Given two finite sets of integers $S\subseteq\NNN\setminus\{0\}$ and $D\subseteq\NNN\setminus\{0,1\}$,the impartial combinatorial game $\IMARK(S,D)$ is played on a heap of tokens. From a heap of $n$ tokens, each player can moveeither to a heap of $n-s$ tokens for some $s\in S$, or to a heap of $n/d$ tokensfor some $d\i... |
2407.11585 | Tian Shilong | Shilong Tian, Hong Chen, Chengtao Lv, Yu Liu, Jinyang Guo, Xianglong
Liu, Shengxi Li, Hao Yang, Tao Xie | QVD: Post-training Quantization for Video Diffusion Models | accepted by ACMMM2024 | null | null | null | cs.CV cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Recently, video diffusion models (VDMs) have garnered significant attention
due to their notable advancements in generating coherent and realistic video
content. However, processing multiple frame features concurrently, coupled with
the considerable model size, results in high latency and extensive memory
consumption... | [
{
"created": "Tue, 16 Jul 2024 10:47:27 GMT",
"version": "v1"
},
{
"created": "Wed, 17 Jul 2024 05:27:04 GMT",
"version": "v2"
}
] | 2024-07-18 | [
[
"Tian",
"Shilong",
""
],
[
"Chen",
"Hong",
""
],
[
"Lv",
"Chengtao",
""
],
[
"Liu",
"Yu",
""
],
[
"Guo",
"Jinyang",
""
],
[
"Liu",
"Xianglong",
""
],
[
"Li",
"Shengxi",
""
],
[
"Yang",
"Hao",
... | Recently, video diffusion models (VDMs) have garnered significant attention due to their notable advancements in generating coherent and realistic video content. However, processing multiple frame features concurrently, coupled with the considerable model size, results in high latency and extensive memory consumption, ... |
2009.02717 | Suhail Sherif | Arkadev Chattopadhyay, Ankit Garg, Suhail Sherif | Towards Stronger Counterexamples to the Log-Approximate-Rank Conjecture | null | null | null | null | cs.CC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We give improved separations for the query complexity analogue of the
log-approximate-rank conjecture i.e. we show that there are a plethora of total
Boolean functions on $n$ input bits, each of which has approximate Fourier
sparsity at most $O(n^3)$ and randomized parity decision tree complexity
$\Theta(n)$. This im... | [
{
"created": "Sun, 6 Sep 2020 11:57:33 GMT",
"version": "v1"
}
] | 2020-09-08 | [
[
"Chattopadhyay",
"Arkadev",
""
],
[
"Garg",
"Ankit",
""
],
[
"Sherif",
"Suhail",
""
]
] | We give improved separations for the query complexity analogue of the log-approximate-rank conjecture i.e. we show that there are a plethora of total Boolean functions on $n$ input bits, each of which has approximate Fourier sparsity at most $O(n^3)$ and randomized parity decision tree complexity $\Theta(n)$. This impr... |
2105.06723 | Amrita Suresh | Benedikt Bollig, Alain Finkel, Amrita Suresh | Bounded Reachability Problems are Decidable in FIFO Machines | null | Logical Methods in Computer Science, Volume 18, Issue 1 (January
20, 2022) lmcs:7485 | 10.46298/lmcs-18(1:19)2022 | null | cs.LO cs.FL | http://creativecommons.org/licenses/by/4.0/ | The undecidability of basic decision problems for general FIFO machines such
as reachability and unboundedness is well-known. In this paper, we provide an
underapproximation for the general model by considering only runs that are
input-bounded (i.e. the sequence of messages sent through a particular channel
belongs t... | [
{
"created": "Fri, 14 May 2021 09:13:33 GMT",
"version": "v1"
},
{
"created": "Sun, 14 Nov 2021 23:27:44 GMT",
"version": "v2"
},
{
"created": "Wed, 8 Dec 2021 14:52:09 GMT",
"version": "v3"
},
{
"created": "Wed, 19 Jan 2022 16:00:43 GMT",
"version": "v4"
}
] | 2023-06-22 | [
[
"Bollig",
"Benedikt",
""
],
[
"Finkel",
"Alain",
""
],
[
"Suresh",
"Amrita",
""
]
] | The undecidability of basic decision problems for general FIFO machines such as reachability and unboundedness is well-known. In this paper, we provide an underapproximation for the general model by considering only runs that are input-bounded (i.e. the sequence of messages sent through a particular channel belongs to ... |
1603.06065 | Sungkyun Chang | Sungkyun Chang and Kyogu Lee | A pairwise approach to simultaneous onset/offset detection for singing
voice using correntropy | 2014 IEEE International Conference on Acoustics, Speech and Signal
Processing, 5 pages, 5 figures | null | 10.1109/ICASSP.2014.6853672 | null | cs.SD eess.AS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we propose a novelmethod to search for precise locations of
paired note onset and offset in a singing voice signal. In comparison with the
existing onset detection algorithms,our approach differs in two key respects.
First, we employ Correntropy, a generalized correlation function inspired from
Reyni's... | [
{
"created": "Sat, 19 Mar 2016 08:45:21 GMT",
"version": "v1"
}
] | 2020-10-29 | [
[
"Chang",
"Sungkyun",
""
],
[
"Lee",
"Kyogu",
""
]
] | In this paper, we propose a novelmethod to search for precise locations of paired note onset and offset in a singing voice signal. In comparison with the existing onset detection algorithms,our approach differs in two key respects. First, we employ Correntropy, a generalized correlation function inspired from Reyni's e... |
1807.00686 | Ting Yao | Ting Yao and Xue Li | YH Technologies at ActivityNet Challenge 2018 | Rank 2 in both Temporal Activity Detection Task & Kinetics Task @
ActivityNet 2018. arXiv admin note: substantial text overlap with
arXiv:1710.08011 by other authors | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This notebook paper presents an overview and comparative analysis of our
systems designed for the following five tasks in ActivityNet Challenge 2018:
temporal action proposals, temporal action localization, dense-captioning
events in videos, trimmed action recognition, and spatio-temporal action
localization.
| [
{
"created": "Fri, 29 Jun 2018 07:49:08 GMT",
"version": "v1"
}
] | 2018-07-03 | [
[
"Yao",
"Ting",
""
],
[
"Li",
"Xue",
""
]
] | This notebook paper presents an overview and comparative analysis of our systems designed for the following five tasks in ActivityNet Challenge 2018: temporal action proposals, temporal action localization, dense-captioning events in videos, trimmed action recognition, and spatio-temporal action localization. |
2309.01940 | Lingyue Fu Miss | Lingyue Fu, Huacan Chai, Shuang Luo, Kounianhua Du, Weiming Zhang,
Longteng Fan, Jiayi Lei, Renting Rui, Jianghao Lin, Yuchen Fang, Yifan Liu,
Jingkuan Wang, Siyuan Qi, Kangning Zhang, Weinan Zhang, Yong Yu | CodeApex: A Bilingual Programming Evaluation Benchmark for Large
Language Models | 33pages | null | null | null | cs.CL cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | With the emergence of Large Language Models (LLMs), there has been a
significant improvement in the programming capabilities of models, attracting
growing attention from researchers. Evaluating the programming capabilities of
LLMs is crucial as it reflects the multifaceted abilities of LLMs, and it has
numerous downs... | [
{
"created": "Tue, 5 Sep 2023 04:12:01 GMT",
"version": "v1"
},
{
"created": "Wed, 6 Sep 2023 15:36:11 GMT",
"version": "v2"
},
{
"created": "Sun, 10 Sep 2023 13:32:38 GMT",
"version": "v3"
},
{
"created": "Mon, 11 Mar 2024 08:07:28 GMT",
"version": "v4"
}
] | 2024-03-12 | [
[
"Fu",
"Lingyue",
""
],
[
"Chai",
"Huacan",
""
],
[
"Luo",
"Shuang",
""
],
[
"Du",
"Kounianhua",
""
],
[
"Zhang",
"Weiming",
""
],
[
"Fan",
"Longteng",
""
],
[
"Lei",
"Jiayi",
""
],
[
"Rui",
"Ren... | With the emergence of Large Language Models (LLMs), there has been a significant improvement in the programming capabilities of models, attracting growing attention from researchers. Evaluating the programming capabilities of LLMs is crucial as it reflects the multifaceted abilities of LLMs, and it has numerous downstr... |
1908.07152 | Joseph O'Rourke | Joseph O'Rourke | Unfolding Polyhedra | Proceedings 31st Canadian Conference on Computational Geometry, Aug
2019, Edmonton, Alberta. pp. 85-86. The arXiv version updates the proceedings
version by citing a recent result that not every polycube can be
edge-unzipped | null | null | null | cs.CG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Starting with the unsolved "D\"urer's problem" of edge-unfolding a convex
polyhedron to a net, we specialize and generalize (a) the types of cuts
permitted, and (b) the polyhedra shapes, to highlight both advances established
and which problems remain open.
| [
{
"created": "Tue, 13 Aug 2019 13:49:12 GMT",
"version": "v1"
}
] | 2019-08-21 | [
[
"O'Rourke",
"Joseph",
""
]
] | Starting with the unsolved "D\"urer's problem" of edge-unfolding a convex polyhedron to a net, we specialize and generalize (a) the types of cuts permitted, and (b) the polyhedra shapes, to highlight both advances established and which problems remain open. |
2307.02339 | Ludwig Mohr | Ludwig Mohr, Ismail Geles and Friedrich Fraundorfer | GAFAR: Graph-Attention Feature-Augmentation for Registration A Fast and
Light-weight Point Set Registration Algorithm | Accepted to the 11th European Conference on Mobile Robots (ECMR2023) | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Rigid registration of point clouds is a fundamental problem in computer
vision with many applications from 3D scene reconstruction to geometry capture
and robotics. If a suitable initial registration is available, conventional
methods like ICP and its many variants can provide adequate solutions. In
absence of a suit... | [
{
"created": "Wed, 5 Jul 2023 14:50:36 GMT",
"version": "v1"
}
] | 2023-07-06 | [
[
"Mohr",
"Ludwig",
""
],
[
"Geles",
"Ismail",
""
],
[
"Fraundorfer",
"Friedrich",
""
]
] | Rigid registration of point clouds is a fundamental problem in computer vision with many applications from 3D scene reconstruction to geometry capture and robotics. If a suitable initial registration is available, conventional methods like ICP and its many variants can provide adequate solutions. In absence of a suitab... |
1904.10574 | Hasan Manzour | Hasan Manzour, Simge K\"u\c{c}\"ukyavuz, Ali Shojaie | Integer Programming for Learning Directed Acyclic Graphs from Continuous
Data | null | null | null | null | cs.LG cs.DM stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Learning directed acyclic graphs (DAGs) from data is a challenging task both
in theory and in practice, because the number of possible DAGs scales
superexponentially with the number of nodes. In this paper, we study the
problem of learning an optimal DAG from continuous observational data. We cast
this problem in the... | [
{
"created": "Tue, 23 Apr 2019 23:58:40 GMT",
"version": "v1"
}
] | 2019-04-25 | [
[
"Manzour",
"Hasan",
""
],
[
"Küçükyavuz",
"Simge",
""
],
[
"Shojaie",
"Ali",
""
]
] | Learning directed acyclic graphs (DAGs) from data is a challenging task both in theory and in practice, because the number of possible DAGs scales superexponentially with the number of nodes. In this paper, we study the problem of learning an optimal DAG from continuous observational data. We cast this problem in the f... |
1511.07608 | Janne V. Kujala | Janne V. Kujala, Tuomas J. Lukka, and Harri Holopainen | Picking a Conveyor Clean by an Autonomously Learning Robot | 6 pages, 8 figures | null | null | null | cs.RO cs.CV cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We present a research picking prototype related to our company's industrial
waste sorting application. The goal of the prototype is to be as autonomous as
possible and it both calibrates itself and improves its picking with minimal
human intervention. The system learns to pick objects better based on a
feedback senso... | [
{
"created": "Tue, 24 Nov 2015 08:35:49 GMT",
"version": "v1"
}
] | 2015-11-25 | [
[
"Kujala",
"Janne V.",
""
],
[
"Lukka",
"Tuomas J.",
""
],
[
"Holopainen",
"Harri",
""
]
] | We present a research picking prototype related to our company's industrial waste sorting application. The goal of the prototype is to be as autonomous as possible and it both calibrates itself and improves its picking with minimal human intervention. The system learns to pick objects better based on a feedback sensor ... |
1708.04317 | Tianyang Wang | Tianyang Wang, Zhengrui Qin, Michelle Zhu | An ELU Network with Total Variation for Image Denoising | 10 pages, Accepted by the 24th International Conference on Neural
Information Processing (2017) | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we propose a novel convolutional neural network (CNN) for
image denoising, which uses exponential linear unit (ELU) as the activation
function. We investigate the suitability by analyzing ELU's connection with
trainable nonlinear reaction diffusion model (TNRD) and residual denoising. On
the other hand... | [
{
"created": "Mon, 14 Aug 2017 20:47:35 GMT",
"version": "v1"
}
] | 2017-08-16 | [
[
"Wang",
"Tianyang",
""
],
[
"Qin",
"Zhengrui",
""
],
[
"Zhu",
"Michelle",
""
]
] | In this paper, we propose a novel convolutional neural network (CNN) for image denoising, which uses exponential linear unit (ELU) as the activation function. We investigate the suitability by analyzing ELU's connection with trainable nonlinear reaction diffusion model (TNRD) and residual denoising. On the other hand, ... |
2207.11952 | Viorica Chifu | Cristina Bianca Pop, Viorica Rozina Chifu, Corina Cordea, Emil Stefan
Chifu, Octav Barsan | Forecasting the Short-Term Energy Consumption Using Random Forests and
Gradient Boosting | null | 2021 20th RoEduNet Conference: Networking in Education and
Research (RoEduNet), 2021, pp. 1-6 | 10.1109/RoEduNet54112.2021.9638276 | null | cs.AI cs.DC | http://creativecommons.org/licenses/by/4.0/ | This paper analyzes comparatively the performance of Random Forests and
Gradient Boosting algorithms in the field of forecasting the energy consumption
based on historical data. The two algorithms are applied in order to forecast
the energy consumption individually, and then combined together by using a
Weighted Aver... | [
{
"created": "Mon, 25 Jul 2022 07:40:25 GMT",
"version": "v1"
}
] | 2022-07-26 | [
[
"Pop",
"Cristina Bianca",
""
],
[
"Chifu",
"Viorica Rozina",
""
],
[
"Cordea",
"Corina",
""
],
[
"Chifu",
"Emil Stefan",
""
],
[
"Barsan",
"Octav",
""
]
] | This paper analyzes comparatively the performance of Random Forests and Gradient Boosting algorithms in the field of forecasting the energy consumption based on historical data. The two algorithms are applied in order to forecast the energy consumption individually, and then combined together by using a Weighted Averag... |
2403.14293 | Ponkoj Shill | Ponkoj Chandra Shill, Md. Azizul Hakim, Muhammad Jahanzeb Khan,
Bashira Akter Anima | Human Reactions to Incorrect Answers from Robots | 6 pages, 6 figures, 1 table, Ro-Man 2024 | null | null | null | cs.RO cs.SE | http://creativecommons.org/publicdomain/zero/1.0/ | As robots grow more and more integrated into numerous industries, it is
critical to comprehend how humans respond to their failures. This paper
systematically studies how trust dynamics and system design are affected by
human responses to robot failures. The three-stage survey used in the study
provides a thorough un... | [
{
"created": "Thu, 21 Mar 2024 11:00:11 GMT",
"version": "v1"
}
] | 2024-07-08 | [
[
"Shill",
"Ponkoj Chandra",
""
],
[
"Hakim",
"Md. Azizul",
""
],
[
"Khan",
"Muhammad Jahanzeb",
""
],
[
"Anima",
"Bashira Akter",
""
]
] | As robots grow more and more integrated into numerous industries, it is critical to comprehend how humans respond to their failures. This paper systematically studies how trust dynamics and system design are affected by human responses to robot failures. The three-stage survey used in the study provides a thorough unde... |
1608.04105 | Timothy Molter | Timothy W. Molter and M. Alexander Nugent | Machine Learning with Memristors via Thermodynamic RAM | null | CNNA 2016, 15th International Workshop on Cellular Nanoscale
Networks and their Applications, Dresden, Germany, 2016, pp. 1-2 | null | null | cs.ET cs.NE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Thermodynamic RAM (kT-RAM) is a neuromemristive co-processor design based on
the theory of AHaH Computing and implemented via CMOS and memristors. The
co-processor is a 2-D array of differential memristor pairs (synapses) that can
be selectively coupled together (neurons) via the digital bit addressing of the
underly... | [
{
"created": "Sun, 14 Aug 2016 14:01:10 GMT",
"version": "v1"
}
] | 2017-04-27 | [
[
"Molter",
"Timothy W.",
""
],
[
"Nugent",
"M. Alexander",
""
]
] | Thermodynamic RAM (kT-RAM) is a neuromemristive co-processor design based on the theory of AHaH Computing and implemented via CMOS and memristors. The co-processor is a 2-D array of differential memristor pairs (synapses) that can be selectively coupled together (neurons) via the digital bit addressing of the underlyin... |
1903.10740 | Juraj Sebej | Stavros Konstantinidis, Mitja Mastnak, Juraj Sebej | Partitioning a Symmetric Rational Relation into Two Asymmetric Rational
Relations | 19 pages, 4 figures. Submitted to the 24th International Conference
on Implementation and Application of Automata, July 22-25, 2019, Kosice,
Slovakia | null | null | null | cs.FL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We consider the problem of partitioning effectively a given symmetric (and
irreflexive) rational relation R into two asymmetric rational relations. This
problem is motivated by a recent method of embedding an R-independent language
into one that is maximal R-independent, where the method requires to use an
asymmetric... | [
{
"created": "Tue, 26 Mar 2019 08:58:25 GMT",
"version": "v1"
}
] | 2019-03-27 | [
[
"Konstantinidis",
"Stavros",
""
],
[
"Mastnak",
"Mitja",
""
],
[
"Sebej",
"Juraj",
""
]
] | We consider the problem of partitioning effectively a given symmetric (and irreflexive) rational relation R into two asymmetric rational relations. This problem is motivated by a recent method of embedding an R-independent language into one that is maximal R-independent, where the method requires to use an asymmetric p... |
1006.0379 | Jamshid Abouei | J. David Brown, Jamshid Abouei, Konstantinos N. Plataniotis,
Subbarayan Pasupathy | Adaptive Demodulation in Differentially Coherent Phase Systems: Design
and Performance Analysis | 25 pages, 11 Figures, submitted to IEEE Transactions on
Communications, June 1, 2010 | null | 10.1109/TCOMM.2011.051311.100331 | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Adaptive Demodulation (ADM) is a newly proposed rate-adaptive system which
operates without requiring Channel State Information (CSI) at the transmitter
(unlike adaptive modulation) by using adaptive decision region boundaries at
the receiver and encoding the data with a rateless code. This paper addresses
the design... | [
{
"created": "Wed, 2 Jun 2010 13:56:42 GMT",
"version": "v1"
}
] | 2016-11-17 | [
[
"Brown",
"J. David",
""
],
[
"Abouei",
"Jamshid",
""
],
[
"Plataniotis",
"Konstantinos N.",
""
],
[
"Pasupathy",
"Subbarayan",
""
]
] | Adaptive Demodulation (ADM) is a newly proposed rate-adaptive system which operates without requiring Channel State Information (CSI) at the transmitter (unlike adaptive modulation) by using adaptive decision region boundaries at the receiver and encoding the data with a rateless code. This paper addresses the design a... |
2203.15767 | Yaxin Hu | Yaxin Hu, Yuxiao Qu, Adam Maus, and Bilge Mutlu | Polite or Direct? Conversation Design of a Smart Display for Older
Adults Based on Politeness Theory | To be published in 2022 CHI Conference on Human Factors in Computing
Systems (CHI '22) | null | null | null | cs.HC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Conversational interfaces increasingly rely on human-like dialogue to offer a
natural experience. However, relying on dialogue involving multiple exchanges
for even simple tasks can overburden users, particularly older adults. In this
paper, we explored the use of politeness theory in conversation design to
alleviate... | [
{
"created": "Tue, 29 Mar 2022 17:26:08 GMT",
"version": "v1"
}
] | 2022-03-30 | [
[
"Hu",
"Yaxin",
""
],
[
"Qu",
"Yuxiao",
""
],
[
"Maus",
"Adam",
""
],
[
"Mutlu",
"Bilge",
""
]
] | Conversational interfaces increasingly rely on human-like dialogue to offer a natural experience. However, relying on dialogue involving multiple exchanges for even simple tasks can overburden users, particularly older adults. In this paper, we explored the use of politeness theory in conversation design to alleviate t... |
2103.07576 | Annemarie van der Marel | Annemarie van der Marel (1), Claire L. O'Connell (1), Sanjay Prasher
(1), Chelsea Carminito (1), Xavier Francis (1), Elizabeth A. Hobson (1) ((1)
Department of Biological Sciences, University of Cincinnati, Cincinnati, OH,
USA) | A comparison of low-cost behavioral observation software applications
and recommendations for use | 23 pages | null | null | null | cs.SI | http://creativecommons.org/licenses/by-nc-nd/4.0/ | In the field of animal behavior and behavioral ecology, many standardized
methods to observe animal behavior were established in the last decades. While
the protocols remained similar, behavioral researchers can take advantage of
technological advancements to enter observations directly onto a handheld
computer (phon... | [
{
"created": "Fri, 12 Mar 2021 23:51:30 GMT",
"version": "v1"
},
{
"created": "Fri, 16 Apr 2021 01:34:37 GMT",
"version": "v2"
},
{
"created": "Thu, 16 Sep 2021 15:17:02 GMT",
"version": "v3"
},
{
"created": "Mon, 25 Oct 2021 15:11:16 GMT",
"version": "v4"
}
] | 2021-10-26 | [
[
"van der Marel",
"Annemarie",
""
],
[
"O'Connell",
"Claire L.",
""
],
[
"Prasher",
"Sanjay",
""
],
[
"Carminito",
"Chelsea",
""
],
[
"Francis",
"Xavier",
""
],
[
"Hobson",
"Elizabeth A.",
""
]
] | In the field of animal behavior and behavioral ecology, many standardized methods to observe animal behavior were established in the last decades. While the protocols remained similar, behavioral researchers can take advantage of technological advancements to enter observations directly onto a handheld computer (phone,... |
1801.03106 | Wolfgang Orthuber | Wolfgang Orthuber (Kiel University) | Why informatics and general science need a conjoint basic definition of
information | 15 pages, 4 figures | null | null | null | cs.DL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | First the basic definition of information as a selection from a set of
possibilities resp. domain is recalled. This also applies to digital
information. The bits of digital information are parts of number sequences
which represent a selection from a set of possibilities resp. domain. For
faultless conversation sender... | [
{
"created": "Mon, 8 Jan 2018 17:25:00 GMT",
"version": "v1"
}
] | 2018-01-11 | [
[
"Orthuber",
"Wolfgang",
"",
"Kiel University"
]
] | First the basic definition of information as a selection from a set of possibilities resp. domain is recalled. This also applies to digital information. The bits of digital information are parts of number sequences which represent a selection from a set of possibilities resp. domain. For faultless conversation sender a... |
1806.06180 | Ganapati Bhat | Ganapati Bhat, Suat Gumussoy, Umit Y. Ogras | Power-Temperature Stability and Safety Analysis for Multiprocessor
Systems | Published in ACM TECS | ACM Trans. Embed. Comput. Syst. 16, 5s, Article 145 (September
2017), 19 pages | 10.1145/3126567 | null | cs.SY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Modern multiprocessor system-on-chips (SoCs) integrate multiple heterogeneous
cores to achieve high energy efficiency. The power consumption of each core
contributes to an increase in the temperature across the chip floorplan. In
turn, higher temperature increases the leakage power exponentially, and leads
to a posit... | [
{
"created": "Sat, 16 Jun 2018 04:43:25 GMT",
"version": "v1"
}
] | 2018-06-19 | [
[
"Bhat",
"Ganapati",
""
],
[
"Gumussoy",
"Suat",
""
],
[
"Ogras",
"Umit Y.",
""
]
] | Modern multiprocessor system-on-chips (SoCs) integrate multiple heterogeneous cores to achieve high energy efficiency. The power consumption of each core contributes to an increase in the temperature across the chip floorplan. In turn, higher temperature increases the leakage power exponentially, and leads to a positiv... |
1606.07518 | EPTCS | Alexandru Baltag (Institute for logic, Language and Computation.
University of Amsterdam), Nina Gierasimczuk (Institute for Logic, Language
and Computation. University of Amsterdam), Sonja Smets (Institute for Logic,
Language and Computation. University of Amsterdam) | On the Solvability of Inductive Problems: A Study in Epistemic Topology | In Proceedings TARK 2015, arXiv:1606.07295 | EPTCS 215, 2016, pp. 81-98 | 10.4204/EPTCS.215.7 | null | cs.LO cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We investigate the issues of inductive problem-solving and learning by
doxastic agents. We provide topological characterizations of solvability and
learnability, and we use them to prove that AGM-style belief revision is
"universal", i.e., that every solvable problem is solvable by AGM conditioning.
| [
{
"created": "Fri, 24 Jun 2016 00:30:59 GMT",
"version": "v1"
}
] | 2016-06-27 | [
[
"Baltag",
"Alexandru",
"",
"Institute for logic, Language and Computation.\n University of Amsterdam"
],
[
"Gierasimczuk",
"Nina",
"",
"Institute for Logic, Language\n and Computation. University of Amsterdam"
],
[
"Smets",
"Sonja",
"",
"Institute for Logi... | We investigate the issues of inductive problem-solving and learning by doxastic agents. We provide topological characterizations of solvability and learnability, and we use them to prove that AGM-style belief revision is "universal", i.e., that every solvable problem is solvable by AGM conditioning. |
1211.6631 | Onur Ozdemir | Onur Ozdemir, Pramod K. Varshney, Wei Su, and Andrew L. Drozd | Asymptotic Properties of Likelihood Based Linear Modulation
Classification Systems | 12 pages double-column, 6 figures, submitted to IEEE Transactions on
Wireless Communications | null | null | null | cs.IT math.IT stat.AP | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The problem of linear modulation classification using likelihood based
methods is considered. Asymptotic properties of most commonly used classifiers
in the literature are derived. These classifiers are based on hybrid likelihood
ratio test (HLRT) and average likelihood ratio test (ALRT), respectively. Both
a single-... | [
{
"created": "Wed, 28 Nov 2012 15:22:29 GMT",
"version": "v1"
}
] | 2012-11-29 | [
[
"Ozdemir",
"Onur",
""
],
[
"Varshney",
"Pramod K.",
""
],
[
"Su",
"Wei",
""
],
[
"Drozd",
"Andrew L.",
""
]
] | The problem of linear modulation classification using likelihood based methods is considered. Asymptotic properties of most commonly used classifiers in the literature are derived. These classifiers are based on hybrid likelihood ratio test (HLRT) and average likelihood ratio test (ALRT), respectively. Both a single-se... |
2306.17498 | Hartmut Koenitz | Hartmut Koenitz, Jonathan Barbara, Lissa Holloway-Attaway, Frank Nack,
Mirjam Palosaari Eladhari, Agnes Bakk | INDCOR White Paper 0: Interactive Digital Narratives (IDNs) -- A
Solution to the Challenge of Representing Complex Issues | null | null | null | null | cs.MM | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Citizens everywhere have the right to be well-informed. Yet, with the high
complexity of many contemporary issues, such as global warming and migration,
our means of information need to mutually adapt. Narrative has always been at
the core of information exchange - regardless of whether our ancestors sat
around a fir... | [
{
"created": "Fri, 30 Jun 2023 09:16:59 GMT",
"version": "v1"
}
] | 2023-07-03 | [
[
"Koenitz",
"Hartmut",
""
],
[
"Barbara",
"Jonathan",
""
],
[
"Holloway-Attaway",
"Lissa",
""
],
[
"Nack",
"Frank",
""
],
[
"Eladhari",
"Mirjam Palosaari",
""
],
[
"Bakk",
"Agnes",
""
]
] | Citizens everywhere have the right to be well-informed. Yet, with the high complexity of many contemporary issues, such as global warming and migration, our means of information need to mutually adapt. Narrative has always been at the core of information exchange - regardless of whether our ancestors sat around a fire ... |
1703.09651 | Divya Shyam Singh | Divya Shyam Singha, G.B.L. Chowdarya, D Roy Mahapatraa | Structural Damage Identification Using Artificial Neural Network and
Synthetic data | 6 pages,6 figures, ISSS conference | null | null | null | cs.LG cs.CE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper presents real-time vibration based identification technique using
measured frequency response functions(FRFs) under random vibration loading.
Artificial Neural Networks (ANNs) are trained to map damage fingerprints to
damage characteristic parameters. Principal component statistical analysis(PCA)
technique... | [
{
"created": "Mon, 27 Mar 2017 08:54:09 GMT",
"version": "v1"
}
] | 2017-03-29 | [
[
"Singha",
"Divya Shyam",
""
],
[
"Chowdarya",
"G. B. L.",
""
],
[
"Mahapatraa",
"D Roy",
""
]
] | This paper presents real-time vibration based identification technique using measured frequency response functions(FRFs) under random vibration loading. Artificial Neural Networks (ANNs) are trained to map damage fingerprints to damage characteristic parameters. Principal component statistical analysis(PCA) technique w... |
2111.00780 | Lantao Yu | Lantao Yu, Jiaming Song, Yang Song, Stefano Ermon | Pseudo-Spherical Contrastive Divergence | NeurIPS 2021 | null | null | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Energy-based models (EBMs) offer flexible distribution parametrization.
However, due to the intractable partition function, they are typically trained
via contrastive divergence for maximum likelihood estimation. In this paper, we
propose pseudo-spherical contrastive divergence (PS-CD) to generalize maximum
likelihoo... | [
{
"created": "Mon, 1 Nov 2021 09:17:15 GMT",
"version": "v1"
}
] | 2021-11-02 | [
[
"Yu",
"Lantao",
""
],
[
"Song",
"Jiaming",
""
],
[
"Song",
"Yang",
""
],
[
"Ermon",
"Stefano",
""
]
] | Energy-based models (EBMs) offer flexible distribution parametrization. However, due to the intractable partition function, they are typically trained via contrastive divergence for maximum likelihood estimation. In this paper, we propose pseudo-spherical contrastive divergence (PS-CD) to generalize maximum likelihood ... |
1805.12282 | Huda Khayrallah | Huda Khayrallah, Philipp Koehn | On the Impact of Various Types of Noise on Neural Machine Translation | Please cite as: @InProceedings{khayrallah-koehn:2018:WNMT, author =
{Khayrallah, Huda and Koehn, Philipp}, title = {On the Impact of Various
Types of Noise on Neural Machine Translation}, booktitle = {Proceedings of
the Second Workshop on Neural Machine Translation and Generation}, year =
{2018}, address = {Mel... | null | 10.18653/v1/W18-2709 | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We examine how various types of noise in the parallel training data impact
the quality of neural machine translation systems. We create five types of
artificial noise and analyze how they degrade performance in neural and
statistical machine translation. We find that neural models are generally more
harmed by noise t... | [
{
"created": "Thu, 31 May 2018 01:33:19 GMT",
"version": "v1"
}
] | 2020-09-14 | [
[
"Khayrallah",
"Huda",
""
],
[
"Koehn",
"Philipp",
""
]
] | We examine how various types of noise in the parallel training data impact the quality of neural machine translation systems. We create five types of artificial noise and analyze how they degrade performance in neural and statistical machine translation. We find that neural models are generally more harmed by noise tha... |
2303.12766 | Xin Lai | Xin Lai, Yukang Chen, Fanbin Lu, Jianhui Liu, Jiaya Jia | Spherical Transformer for LiDAR-based 3D Recognition | Accepted to CVPR 2023. Code is available at
https://github.com/dvlab-research/SphereFormer.git | null | null | null | cs.CV cs.AI | http://creativecommons.org/licenses/by-nc-sa/4.0/ | LiDAR-based 3D point cloud recognition has benefited various applications.
Without specially considering the LiDAR point distribution, most current
methods suffer from information disconnection and limited receptive field,
especially for the sparse distant points. In this work, we study the
varying-sparsity distribut... | [
{
"created": "Wed, 22 Mar 2023 17:30:14 GMT",
"version": "v1"
}
] | 2023-03-23 | [
[
"Lai",
"Xin",
""
],
[
"Chen",
"Yukang",
""
],
[
"Lu",
"Fanbin",
""
],
[
"Liu",
"Jianhui",
""
],
[
"Jia",
"Jiaya",
""
]
] | LiDAR-based 3D point cloud recognition has benefited various applications. Without specially considering the LiDAR point distribution, most current methods suffer from information disconnection and limited receptive field, especially for the sparse distant points. In this work, we study the varying-sparsity distributio... |
2303.03398 | Ronald Caplan | Ronald M. Caplan, Miko M. Stulajter, Jon A. Linker | Acceleration of a production Solar MHD code with Fortran standard
parallelism: From OpenACC to `do concurrent' | 10 pages, 2 tables, 4 figures, accepted to the AsHES workshop at
IPDPS 2023 | null | null | null | cs.MS astro-ph.IM cs.DC cs.PL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | There is growing interest in using standard language constructs for
accelerated computing, avoiding the need for (often vendor-specific) external
APIs. These constructs hold the potential to be more portable and much more
`future-proof'. For Fortran codes, the current focus is on the {\tt do
concurrent} (DC) loop. Wh... | [
{
"created": "Sun, 5 Mar 2023 21:37:34 GMT",
"version": "v1"
},
{
"created": "Wed, 8 Mar 2023 20:18:20 GMT",
"version": "v2"
}
] | 2023-03-10 | [
[
"Caplan",
"Ronald M.",
""
],
[
"Stulajter",
"Miko M.",
""
],
[
"Linker",
"Jon A.",
""
]
] | There is growing interest in using standard language constructs for accelerated computing, avoiding the need for (often vendor-specific) external APIs. These constructs hold the potential to be more portable and much more `future-proof'. For Fortran codes, the current focus is on the {\tt do concurrent} (DC) loop. Whil... |
1202.3683 | Rajendra Shinde | Debojyoti Dutta, Michael Kapralov, Ian Post, Rajendra Shinde | Optimal bandwidth-aware VM allocation for Infrastructure-as-a-Service | null | null | null | null | cs.NI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Infrastructure-as-a-Service (IaaS) providers need to offer richer services to
be competitive while optimizing their resource usage to keep costs down. Richer
service offerings include new resource request models involving bandwidth
guarantees between virtual machines (VMs). Thus we consider the following
problem: giv... | [
{
"created": "Thu, 16 Feb 2012 20:03:44 GMT",
"version": "v1"
}
] | 2012-02-17 | [
[
"Dutta",
"Debojyoti",
""
],
[
"Kapralov",
"Michael",
""
],
[
"Post",
"Ian",
""
],
[
"Shinde",
"Rajendra",
""
]
] | Infrastructure-as-a-Service (IaaS) providers need to offer richer services to be competitive while optimizing their resource usage to keep costs down. Richer service offerings include new resource request models involving bandwidth guarantees between virtual machines (VMs). Thus we consider the following problem: given... |
2303.10062 | Qiaojie Zheng | Qiaojie Zheng, Jiucai Zhang, Amy Zhang, Xiaoli Zhang | Confidence-aware 3D Gaze Estimation and Evaluation Metric | 9 pages 12 figures | null | null | null | cs.CV | http://creativecommons.org/licenses/by-nc-sa/4.0/ | Deep learning appearance-based 3D gaze estimation is gaining popularity due
to its minimal hardware requirements and being free of constraint. Unreliable
and overconfident inferences, however, still limit the adoption of this gaze
estimation method. To address the unreliable and overconfident issues, we
introduce a c... | [
{
"created": "Fri, 17 Mar 2023 15:44:44 GMT",
"version": "v1"
}
] | 2023-03-20 | [
[
"Zheng",
"Qiaojie",
""
],
[
"Zhang",
"Jiucai",
""
],
[
"Zhang",
"Amy",
""
],
[
"Zhang",
"Xiaoli",
""
]
] | Deep learning appearance-based 3D gaze estimation is gaining popularity due to its minimal hardware requirements and being free of constraint. Unreliable and overconfident inferences, however, still limit the adoption of this gaze estimation method. To address the unreliable and overconfident issues, we introduce a con... |
2006.07244 | Todd Murphey | Ana Pervan and Todd D. Murphey | Algorithmic Design for Embodied Intelligence in Synthetic Cells | null | null | null | null | cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In nature, biological organisms jointly evolve both their morphology and
their neurological capabilities to improve their chances for survival.
Consequently, task information is encoded in both their brains and their
bodies. In robotics, the development of complex control and planning algorithms
often bears sole resp... | [
{
"created": "Fri, 12 Jun 2020 14:58:12 GMT",
"version": "v1"
}
] | 2020-06-15 | [
[
"Pervan",
"Ana",
""
],
[
"Murphey",
"Todd D.",
""
]
] | In nature, biological organisms jointly evolve both their morphology and their neurological capabilities to improve their chances for survival. Consequently, task information is encoded in both their brains and their bodies. In robotics, the development of complex control and planning algorithms often bears sole respon... |
2103.10055 | Yaohui Guo | Yaohui Guo, Cong Shi, and X. Jessie Yang | Reverse Psychology in Trust-Aware Human-Robot Interaction | null | null | null | null | cs.RO | http://creativecommons.org/licenses/by/4.0/ | To facilitate effective human-robot interaction (HRI), trust-aware HRI has
been proposed, wherein the robotic agent explicitly considers the human's trust
during its planning and decision making. The success of trust-aware HRI depends
on the specification of a trust dynamics model and a trust-behavior model. In
this ... | [
{
"created": "Thu, 18 Mar 2021 07:30:58 GMT",
"version": "v1"
}
] | 2021-03-19 | [
[
"Guo",
"Yaohui",
""
],
[
"Shi",
"Cong",
""
],
[
"Yang",
"X. Jessie",
""
]
] | To facilitate effective human-robot interaction (HRI), trust-aware HRI has been proposed, wherein the robotic agent explicitly considers the human's trust during its planning and decision making. The success of trust-aware HRI depends on the specification of a trust dynamics model and a trust-behavior model. In this st... |
1910.08647 | Pavel Naumov | Pavel Naumov and Jia Tao | Blameworthiness in Security Games | 34th AAAI Conference on Artificial Intelligence (AAAI-20), February
7-12, 2020, New York, New York, USA | null | null | null | cs.AI cs.GT cs.LO math.LO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Security games are an example of a successful real-world application of game
theory. The paper defines blameworthiness of the defender and the attacker in
security games using the principle of alternative possibilities and provides a
sound and complete logical system for reasoning about blameworthiness in such
games.... | [
{
"created": "Fri, 18 Oct 2019 22:22:35 GMT",
"version": "v1"
},
{
"created": "Mon, 11 Nov 2019 20:50:51 GMT",
"version": "v2"
}
] | 2019-11-13 | [
[
"Naumov",
"Pavel",
""
],
[
"Tao",
"Jia",
""
]
] | Security games are an example of a successful real-world application of game theory. The paper defines blameworthiness of the defender and the attacker in security games using the principle of alternative possibilities and provides a sound and complete logical system for reasoning about blameworthiness in such games. T... |
2101.06665 | Farhad Merchant | Vinay Saxena, Ankitha Reddy, Jonathan Neudorfer, John Gustafson,
Sangeeth Nambiar, Rainer Leupers, Farhad Merchant | Brightening the Optical Flow through Posit Arithmetic | To appear in ISQED 2021 | null | null | null | cs.AR cs.MS | http://creativecommons.org/publicdomain/zero/1.0/ | As new technologies are invented, their commercial viability needs to be
carefully examined along with their technical merits and demerits. The posit
data format, proposed as a drop-in replacement for IEEE 754 float format, is
one such invention that requires extensive theoretical and experimental study
to identify p... | [
{
"created": "Sun, 17 Jan 2021 13:19:10 GMT",
"version": "v1"
}
] | 2021-01-19 | [
[
"Saxena",
"Vinay",
""
],
[
"Reddy",
"Ankitha",
""
],
[
"Neudorfer",
"Jonathan",
""
],
[
"Gustafson",
"John",
""
],
[
"Nambiar",
"Sangeeth",
""
],
[
"Leupers",
"Rainer",
""
],
[
"Merchant",
"Farhad",
""
]
... | As new technologies are invented, their commercial viability needs to be carefully examined along with their technical merits and demerits. The posit data format, proposed as a drop-in replacement for IEEE 754 float format, is one such invention that requires extensive theoretical and experimental study to identify pro... |
2301.00153 | Peter \v{S}vec | Peter \v{S}vec, \v{S}tefan Balogh, Martin Homola, J\'an K\v{l}uka | Knowledge-Based Dataset for Training PE Malware Detection Models | null | null | null | null | cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Ontologies are a standard for semantic schemata in many knowledge-intensive
domains of human interest. They are now becoming increasingly important also in
areas until very recently dominated by subsymbolic representations and
machine-learning-based data processing. One such area is information security,
and more spe... | [
{
"created": "Sat, 31 Dec 2022 08:46:02 GMT",
"version": "v1"
}
] | 2023-01-03 | [
[
"Švec",
"Peter",
""
],
[
"Balogh",
"Štefan",
""
],
[
"Homola",
"Martin",
""
],
[
"Kľuka",
"Ján",
""
]
] | Ontologies are a standard for semantic schemata in many knowledge-intensive domains of human interest. They are now becoming increasingly important also in areas until very recently dominated by subsymbolic representations and machine-learning-based data processing. One such area is information security, and more speci... |
2406.05349 | Thanh Huy Nguyen Mr. | Thanh-Huy Nguyen, Thi Kim Ngan Ngo, Mai Anh Vu, Ting-Yuan Tu | Blurry-Consistency Segmentation Framework with Selective Stacking on
Differential Interference Contrast 3D Breast Cancer Spheroid | null | null | null | null | cs.CV | http://creativecommons.org/licenses/by-nc-sa/4.0/ | The ability of three-dimensional (3D) spheroid modeling to study the invasive
behavior of breast cancer cells has drawn increased attention. The deep
learning-based image processing framework is very effective at speeding up the
cell morphological analysis process. Out-of-focus photos taken while capturing
3D cells u... | [
{
"created": "Sat, 8 Jun 2024 04:31:36 GMT",
"version": "v1"
}
] | 2024-06-11 | [
[
"Nguyen",
"Thanh-Huy",
""
],
[
"Ngo",
"Thi Kim Ngan",
""
],
[
"Vu",
"Mai Anh",
""
],
[
"Tu",
"Ting-Yuan",
""
]
] | The ability of three-dimensional (3D) spheroid modeling to study the invasive behavior of breast cancer cells has drawn increased attention. The deep learning-based image processing framework is very effective at speeding up the cell morphological analysis process. Out-of-focus photos taken while capturing 3D cells und... |
1003.3312 | Secretary Aircc Journal | G. G. Md. Nawaz Ali (1), (2), Rajib Chakraborty (2), Md. Shihabul Alam
(2) and Edward Chan (1), ((1) City University of Hong Kong, China and (2)
Khulna University of Engineering & Technology, Bangladesh) | An Efficient Approach for Generalized Load Balancing in Multipath Packet
Switched Networks | 12 Pages, IJCNC Journal 2010 | International Journal of Computer Networks & Communications 2.2
(2010) 142-153 | 10.5121/ijcnc.2010.2211 | null | cs.NI | http://creativecommons.org/licenses/by-nc-sa/3.0/ | This paper is a quantitative analysis on packet switched network with a view
to generalize load balancing and determination of appropriate routing algorithm
in multipath environment. Several routing algorithms have been introduced for
routing of packets from source to destination. Some of them route packets
accuratel... | [
{
"created": "Wed, 17 Mar 2010 07:15:27 GMT",
"version": "v1"
}
] | 2010-07-15 | [
[
"Ali",
"G. G. Md. Nawaz",
""
],
[
"Chakraborty",
"Rajib",
""
],
[
"Alam",
"Md. Shihabul",
""
],
[
"Chan",
"Edward",
""
]
] | This paper is a quantitative analysis on packet switched network with a view to generalize load balancing and determination of appropriate routing algorithm in multipath environment. Several routing algorithms have been introduced for routing of packets from source to destination. Some of them route packets accurately ... |
2202.05998 | Hangwei Qian | Hangwei Qian, Tian Tian, Chunyan Miao | What Makes Good Contrastive Learning on Small-Scale Wearable-based
Tasks? | Preprint | null | null | null | cs.LG cs.AI | http://creativecommons.org/licenses/by-nc-sa/4.0/ | Self-supervised learning establishes a new paradigm of learning
representations with much fewer or even no label annotations. Recently there
has been remarkable progress on large-scale contrastive learning models which
require substantial computing resources, yet such models are not practically
optimal for small-scal... | [
{
"created": "Sat, 12 Feb 2022 06:10:15 GMT",
"version": "v1"
}
] | 2022-02-15 | [
[
"Qian",
"Hangwei",
""
],
[
"Tian",
"Tian",
""
],
[
"Miao",
"Chunyan",
""
]
] | Self-supervised learning establishes a new paradigm of learning representations with much fewer or even no label annotations. Recently there has been remarkable progress on large-scale contrastive learning models which require substantial computing resources, yet such models are not practically optimal for small-scale ... |
2112.11215 | Yixuan Zhang | Nurul Suhaimi, Nutchanon Yongsatianchot, Yixuan Zhang, Anisa Amiji,
Shivani A. Patel, Stacy Marsella, Miso Kim, Jacqueline Griffin, Andrea Parker | Examining Older Adults' Information Exposure, Wellbeing, and Adherence
to Protective Measures During the COVID-19 Pandemic | 3 pages | null | null | null | cs.CY | http://creativecommons.org/licenses/by/4.0/ | Older adults are at greater risk of experiencing negative physical and
psychological impacts of the novel coronavirus 2019 (COVID-19) pandemic. Our
ongoing study is assessing COVID-19 information exposure in adults aged 55 and
above compared to other age groups living in Massachusetts and Georgia. This
work investiga... | [
{
"created": "Fri, 17 Dec 2021 15:33:13 GMT",
"version": "v1"
}
] | 2021-12-22 | [
[
"Suhaimi",
"Nurul",
""
],
[
"Yongsatianchot",
"Nutchanon",
""
],
[
"Zhang",
"Yixuan",
""
],
[
"Amiji",
"Anisa",
""
],
[
"Patel",
"Shivani A.",
""
],
[
"Marsella",
"Stacy",
""
],
[
"Kim",
"Miso",
""
],
[... | Older adults are at greater risk of experiencing negative physical and psychological impacts of the novel coronavirus 2019 (COVID-19) pandemic. Our ongoing study is assessing COVID-19 information exposure in adults aged 55 and above compared to other age groups living in Massachusetts and Georgia. This work investigate... |
2402.11131 | Mahyar Najibi | Nikhil Bhendawade, Irina Belousova, Qichen Fu, Henry Mason, Mohammad
Rastegari, Mahyar Najibi | Speculative Streaming: Fast LLM Inference without Auxiliary Models | null | null | null | null | cs.CL cs.AI cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Speculative decoding is a prominent technique to speed up the inference of a
large target language model based on predictions of an auxiliary draft model.
While effective, in application-specific settings, it often involves
fine-tuning both draft and target models to achieve high acceptance rates. As
the number of do... | [
{
"created": "Fri, 16 Feb 2024 23:36:43 GMT",
"version": "v1"
}
] | 2024-02-20 | [
[
"Bhendawade",
"Nikhil",
""
],
[
"Belousova",
"Irina",
""
],
[
"Fu",
"Qichen",
""
],
[
"Mason",
"Henry",
""
],
[
"Rastegari",
"Mohammad",
""
],
[
"Najibi",
"Mahyar",
""
]
] | Speculative decoding is a prominent technique to speed up the inference of a large target language model based on predictions of an auxiliary draft model. While effective, in application-specific settings, it often involves fine-tuning both draft and target models to achieve high acceptance rates. As the number of down... |
2106.14350 | Boris Kovalerchuk | Boris Kovalerchuk, Divya Chandrika Kalla, Bedant Agarwal | Deep Learning Image Recognition for Non-images | 33 pages, 17 figures, 18 tables | null | null | null | cs.LG cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Powerful deep learning algorithms open an opportunity for solving non-image
Machine Learning (ML) problems by transforming these problems to into the image
recognition problems. The CPC-R algorithm presented in this chapter converts
non-image data into images by visualizing non-image data. Then deep learning
CNN algo... | [
{
"created": "Mon, 28 Jun 2021 00:36:36 GMT",
"version": "v1"
},
{
"created": "Wed, 9 Feb 2022 22:08:16 GMT",
"version": "v2"
}
] | 2022-02-11 | [
[
"Kovalerchuk",
"Boris",
""
],
[
"Kalla",
"Divya Chandrika",
""
],
[
"Agarwal",
"Bedant",
""
]
] | Powerful deep learning algorithms open an opportunity for solving non-image Machine Learning (ML) problems by transforming these problems to into the image recognition problems. The CPC-R algorithm presented in this chapter converts non-image data into images by visualizing non-image data. Then deep learning CNN algori... |
1904.04978 | Dawei Du | Congcong Li, Dawei Du, Libo Zhang, Tiejian Luo, Yanjun Wu, Qi Tian,
Longyin Wen, Siwei Lyu | Data Priming Network for Automatic Check-Out | Accepted to ACM MM 2019 | null | null | null | cs.CV cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Automatic Check-Out (ACO) receives increased interests in recent years. An
important component of the ACO system is the visual item counting, which
recognizes the categories and counts of the items chosen by the customers.
However, the training of such a system is challenged by the domain adaptation
problem, in which... | [
{
"created": "Wed, 10 Apr 2019 02:12:48 GMT",
"version": "v1"
},
{
"created": "Thu, 1 Aug 2019 17:12:56 GMT",
"version": "v2"
},
{
"created": "Wed, 7 Aug 2019 03:04:32 GMT",
"version": "v3"
}
] | 2019-08-08 | [
[
"Li",
"Congcong",
""
],
[
"Du",
"Dawei",
""
],
[
"Zhang",
"Libo",
""
],
[
"Luo",
"Tiejian",
""
],
[
"Wu",
"Yanjun",
""
],
[
"Tian",
"Qi",
""
],
[
"Wen",
"Longyin",
""
],
[
"Lyu",
"Siwei",
""... | Automatic Check-Out (ACO) receives increased interests in recent years. An important component of the ACO system is the visual item counting, which recognizes the categories and counts of the items chosen by the customers. However, the training of such a system is challenged by the domain adaptation problem, in which t... |
2309.06188 | Mazvydas Gudelis | Mazvydas Gudelis, Michal Mackiewicz, Julie Bremner, Sophie Fielding | Computer Vision Pipeline for Automated Antarctic Krill Analysis | Accepted to MVEO @ BMVC 2023 | null | null | null | cs.CV | http://creativecommons.org/licenses/by/4.0/ | British Antarctic Survey (BAS) researchers launch annual expeditions to the
Antarctic in order to estimate Antarctic Krill biomass and assess the change
from previous years. These comparisons provide insight into the effects of the
current environment on this key component of the marine food chain. In this
work we ha... | [
{
"created": "Tue, 12 Sep 2023 12:54:12 GMT",
"version": "v1"
},
{
"created": "Thu, 12 Oct 2023 11:51:21 GMT",
"version": "v2"
}
] | 2023-10-13 | [
[
"Gudelis",
"Mazvydas",
""
],
[
"Mackiewicz",
"Michal",
""
],
[
"Bremner",
"Julie",
""
],
[
"Fielding",
"Sophie",
""
]
] | British Antarctic Survey (BAS) researchers launch annual expeditions to the Antarctic in order to estimate Antarctic Krill biomass and assess the change from previous years. These comparisons provide insight into the effects of the current environment on this key component of the marine food chain. In this work we have... |
1303.4169 | Makiko Konoshima | Yui Noma, Makiko Konoshima | Markov Chain Monte Carlo for Arrangement of Hyperplanes in
Locality-Sensitive Hashing | 13 pages, 10 figures | null | null | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Since Hamming distances can be calculated by bitwise computations, they can
be calculated with less computational load than L2 distances. Similarity
searches can therefore be performed faster in Hamming distance space. The
elements of Hamming distance space are bit strings. On the other hand, the
arrangement of hyper... | [
{
"created": "Mon, 18 Mar 2013 07:14:15 GMT",
"version": "v1"
}
] | 2013-03-19 | [
[
"Noma",
"Yui",
""
],
[
"Konoshima",
"Makiko",
""
]
] | Since Hamming distances can be calculated by bitwise computations, they can be calculated with less computational load than L2 distances. Similarity searches can therefore be performed faster in Hamming distance space. The elements of Hamming distance space are bit strings. On the other hand, the arrangement of hyperpl... |
1908.00981 | Sakib Khan | Sakib Mahmud Khan, Mashrur Chowdhury | Situation-Aware Left-Turning Connected and Automated Vehicle Operation
at Signalized Intersections | null | null | null | null | cs.RO cs.HC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | One challenging aspect of the Connected and Automated Vehicle (CAV) operation
in mixed traffic is the development of a situation-awareness module for CAVs.
While operating on public roads, CAVs need to assess their surroundings,
especially the intentions of non-CAVs. Generally, CAVs demonstrate a defensive
driving be... | [
{
"created": "Fri, 2 Aug 2019 16:44:14 GMT",
"version": "v1"
},
{
"created": "Mon, 16 Nov 2020 19:21:11 GMT",
"version": "v2"
}
] | 2020-11-18 | [
[
"Khan",
"Sakib Mahmud",
""
],
[
"Chowdhury",
"Mashrur",
""
]
] | One challenging aspect of the Connected and Automated Vehicle (CAV) operation in mixed traffic is the development of a situation-awareness module for CAVs. While operating on public roads, CAVs need to assess their surroundings, especially the intentions of non-CAVs. Generally, CAVs demonstrate a defensive driving beha... |
0705.1673 | Tshilidzi Marwala | L. Mdlazi, C.J. Stander, P.S. Heyns and T. Marwala | Using artificial intelligence for data reduction in mechanical
engineering | 6 pages | null | null | null | cs.CE cs.AI cs.NE | null | In this paper artificial neural networks and support vector machines are used
to reduce the amount of vibration data that is required to estimate the Time
Domain Average of a gear vibration signal. Two models for estimating the time
domain average of a gear vibration signal are proposed. The models are tested
on data... | [
{
"created": "Fri, 11 May 2007 15:49:40 GMT",
"version": "v1"
}
] | 2007-05-23 | [
[
"Mdlazi",
"L.",
""
],
[
"Stander",
"C. J.",
""
],
[
"Heyns",
"P. S.",
""
],
[
"Marwala",
"T.",
""
]
] | In this paper artificial neural networks and support vector machines are used to reduce the amount of vibration data that is required to estimate the Time Domain Average of a gear vibration signal. Two models for estimating the time domain average of a gear vibration signal are proposed. The models are tested on data f... |
1104.4597 | Thomas Rothvoss | Thomas Rothvoss | The Entropy Rounding Method in Approximation Algorithms | null | null | null | null | cs.DS math.CO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Let A be a matrix, c be any linear objective function and x be a fractional
vector, say an LP solution to some discrete optimization problem. Then a
recurring task in theoretical computer science (and in approximation algorithms
in particular) is to obtain an integral vector y such that Ax is roughly Ay and
c*y excee... | [
{
"created": "Sun, 24 Apr 2011 00:48:36 GMT",
"version": "v1"
}
] | 2011-04-26 | [
[
"Rothvoss",
"Thomas",
""
]
] | Let A be a matrix, c be any linear objective function and x be a fractional vector, say an LP solution to some discrete optimization problem. Then a recurring task in theoretical computer science (and in approximation algorithms in particular) is to obtain an integral vector y such that Ax is roughly Ay and c*y exceeds... |
1609.04259 | Guillaume Moroz | Guillaume Moroz (VEGAS), \'Eric Schost | A Fast Algorithm for Computing the Truncated Resultant | null | ISSAC '16, Jul 2016, Waterloo, Canada. ACM, Proceedings of the ACM
on International Symposium on Symbolic and Algebraic Computation, pp.341-348,
2016 | 10.1145/2930889.2930931 | null | cs.SC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Let P and Q be two polynomials in K[x, y] with degree at most d, where K is a
field. Denoting by R $\in$ K[x] the resultant of P and Q with respect to y, we
present an algorithm to compute R mod x^k in O~(kd) arithmetic operations in K,
where the O~ notation indicates that we omit polylogarithmic factors. This is
an ... | [
{
"created": "Wed, 14 Sep 2016 13:25:33 GMT",
"version": "v1"
}
] | 2016-09-15 | [
[
"Moroz",
"Guillaume",
"",
"VEGAS"
],
[
"Schost",
"Éric",
""
]
] | Let P and Q be two polynomials in K[x, y] with degree at most d, where K is a field. Denoting by R $\in$ K[x] the resultant of P and Q with respect to y, we present an algorithm to compute R mod x^k in O~(kd) arithmetic operations in K, where the O~ notation indicates that we omit polylogarithmic factors. This is an im... |
2307.01559 | Elia Cereda | Elia Cereda and Alessandro Giusti and Daniele Palossi | Secure Deep Learning-based Distributed Intelligence on Pocket-sized
Drones | This paper has been accepted for publication in the EWSN 2023
conference. \copyright 2023 ACM | null | null | null | cs.RO cs.CR cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Palm-sized nano-drones are an appealing class of edge nodes, but their
limited computational resources prevent running large deep-learning models
onboard. Adopting an edge-fog computational paradigm, we can offload part of
the computation to the fog; however, this poses security concerns if the fog
node, or the commu... | [
{
"created": "Tue, 4 Jul 2023 08:29:41 GMT",
"version": "v1"
}
] | 2023-07-06 | [
[
"Cereda",
"Elia",
""
],
[
"Giusti",
"Alessandro",
""
],
[
"Palossi",
"Daniele",
""
]
] | Palm-sized nano-drones are an appealing class of edge nodes, but their limited computational resources prevent running large deep-learning models onboard. Adopting an edge-fog computational paradigm, we can offload part of the computation to the fog; however, this poses security concerns if the fog node, or the communi... |
1703.01026 | Edward Barker | Edward W. Barker and Charl J. Ras | Unsupervised Basis Function Adaptation for Reinforcement Learning | Extended abstract submitted (3 March 2017) for 3rd Multidisciplinary
Conference on Reinforcement Learning and Decision Making (RLDM) 2017 | null | null | null | cs.AI cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | When using reinforcement learning (RL) algorithms to evaluate a policy it is
common, given a large state space, to introduce some form of approximation
architecture for the value function (VF). The exact form of this architecture
can have a significant effect on the accuracy of the VF estimate, however, and
determini... | [
{
"created": "Fri, 3 Mar 2017 03:24:03 GMT",
"version": "v1"
}
] | 2017-03-06 | [
[
"Barker",
"Edward W.",
""
],
[
"Ras",
"Charl J.",
""
]
] | When using reinforcement learning (RL) algorithms to evaluate a policy it is common, given a large state space, to introduce some form of approximation architecture for the value function (VF). The exact form of this architecture can have a significant effect on the accuracy of the VF estimate, however, and determining... |
1903.00902 | Wendong Wang | Wendong Wang, Jianjun Wang | Deterministic Analysis of Weighted BPDN With Partially Known Support
Information | null | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, with the aid of the powerful Restricted Isometry Constant
(RIC), a deterministic (or say non-stochastic) analysis, which includes a
series of sufficient conditions (related to the RIC order) and their resultant
error estimates, is established for the weighted Basis Pursuit De-Noising
(BPDN) to guarante... | [
{
"created": "Sun, 3 Mar 2019 13:20:45 GMT",
"version": "v1"
}
] | 2019-03-05 | [
[
"Wang",
"Wendong",
""
],
[
"Wang",
"Jianjun",
""
]
] | In this paper, with the aid of the powerful Restricted Isometry Constant (RIC), a deterministic (or say non-stochastic) analysis, which includes a series of sufficient conditions (related to the RIC order) and their resultant error estimates, is established for the weighted Basis Pursuit De-Noising (BPDN) to guarantee ... |
2310.15017 | Zhongjian Qiao | Zhongjian Qiao and Jiafei Lyu and Xiu Li | Mind the Model, Not the Agent: The Primacy Bias in Model-based RL | Accepted by European Conference on Artificial Intelligence (ECAI)
2024 | null | null | null | cs.LG cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The primacy bias in model-free reinforcement learning (MFRL), which refers to
the agent's tendency to overfit early data and lose the ability to learn from
new data, can significantly decrease the performance of MFRL algorithms.
Previous studies have shown that employing simple techniques, such as resetting
the agent... | [
{
"created": "Mon, 23 Oct 2023 15:12:20 GMT",
"version": "v1"
},
{
"created": "Sun, 7 Jul 2024 14:32:02 GMT",
"version": "v2"
}
] | 2024-07-09 | [
[
"Qiao",
"Zhongjian",
""
],
[
"Lyu",
"Jiafei",
""
],
[
"Li",
"Xiu",
""
]
] | The primacy bias in model-free reinforcement learning (MFRL), which refers to the agent's tendency to overfit early data and lose the ability to learn from new data, can significantly decrease the performance of MFRL algorithms. Previous studies have shown that employing simple techniques, such as resetting the agent's... |
2305.09123 | Weizhao Tang | Weizhao Tang, Peiyao Sheng, Ronghao Ni, Pronoy Roy, Xuechao Wang,
Giulia Fanti, and Pramod Viswanath | CFT-Forensics: High-Performance Byzantine Accountability for Crash Fault
Tolerant Protocols | null | null | null | null | cs.DC cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Crash fault tolerant (CFT) consensus algorithms are commonly used in
scenarios where system components are trusted -- e.g., enterprise settings and
government infrastructure. However, CFT consensus can be broken by even a
single corrupt node. A desirable property in the face of such potential
Byzantine faults is \emp... | [
{
"created": "Tue, 16 May 2023 03:09:26 GMT",
"version": "v1"
},
{
"created": "Thu, 2 Nov 2023 20:59:49 GMT",
"version": "v2"
},
{
"created": "Mon, 3 Jun 2024 14:20:12 GMT",
"version": "v3"
}
] | 2024-06-04 | [
[
"Tang",
"Weizhao",
""
],
[
"Sheng",
"Peiyao",
""
],
[
"Ni",
"Ronghao",
""
],
[
"Roy",
"Pronoy",
""
],
[
"Wang",
"Xuechao",
""
],
[
"Fanti",
"Giulia",
""
],
[
"Viswanath",
"Pramod",
""
]
] | Crash fault tolerant (CFT) consensus algorithms are commonly used in scenarios where system components are trusted -- e.g., enterprise settings and government infrastructure. However, CFT consensus can be broken by even a single corrupt node. A desirable property in the face of such potential Byzantine faults is \emph{... |
2102.10757 | Yaochen Xie | Yaochen Xie, Zhao Xu, Jingtun Zhang, Zhengyang Wang, Shuiwang Ji | Self-Supervised Learning of Graph Neural Networks: A Unified Review | Accepted by TPAMI. 26 pages, 7 figures | null | null | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Deep models trained in supervised mode have achieved remarkable success on a
variety of tasks. When labeled samples are limited, self-supervised learning
(SSL) is emerging as a new paradigm for making use of large amounts of
unlabeled samples. SSL has achieved promising performance on natural language
and image learn... | [
{
"created": "Mon, 22 Feb 2021 03:43:45 GMT",
"version": "v1"
},
{
"created": "Tue, 23 Feb 2021 18:12:23 GMT",
"version": "v2"
},
{
"created": "Tue, 23 Mar 2021 22:24:21 GMT",
"version": "v3"
},
{
"created": "Tue, 15 Feb 2022 19:15:32 GMT",
"version": "v4"
},
{
"c... | 2022-04-26 | [
[
"Xie",
"Yaochen",
""
],
[
"Xu",
"Zhao",
""
],
[
"Zhang",
"Jingtun",
""
],
[
"Wang",
"Zhengyang",
""
],
[
"Ji",
"Shuiwang",
""
]
] | Deep models trained in supervised mode have achieved remarkable success on a variety of tasks. When labeled samples are limited, self-supervised learning (SSL) is emerging as a new paradigm for making use of large amounts of unlabeled samples. SSL has achieved promising performance on natural language and image learnin... |
1409.0988 | Matthias W\"ahlisch | Michael Frey, Mesut G\"unes | Attack of the Ants: Studying Ant Routing Algorithms in Simulation and
Wireless Testbeds | Published in: A. F\"orster, C. Sommer, T. Steinbach, M. W\"ahlisch
(Eds.), Proc. of 1st OMNeT++ Community Summit, Hamburg, Germany, September 2,
2014, arXiv:1409.0093, 2014 | null | null | OMNET/2014/08 | cs.NI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Wireless networks are becoming the key building block of our communications
infrastructure. Examples range from cellular networks to ad hoc and sensor
networks in wildlife monitoring and environmental scenarios. With the rise of
the Internet of Things (IoT) millions of physical and virtual objects will
communicate wi... | [
{
"created": "Wed, 3 Sep 2014 08:30:36 GMT",
"version": "v1"
}
] | 2014-09-05 | [
[
"Frey",
"Michael",
""
],
[
"Günes",
"Mesut",
""
]
] | Wireless networks are becoming the key building block of our communications infrastructure. Examples range from cellular networks to ad hoc and sensor networks in wildlife monitoring and environmental scenarios. With the rise of the Internet of Things (IoT) millions of physical and virtual objects will communicate wire... |
1503.02427 | Mingxuan Wang | Mingxuan Wang and Zhengdong Lu and Hang Li and Qun Liu | Syntax-based Deep Matching of Short Texts | Accepted by IJCAI-2015 as full paper | null | null | null | cs.CL cs.LG cs.NE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Many tasks in natural language processing, ranging from machine translation
to question answering, can be reduced to the problem of matching two sentences
or more generally two short texts. We propose a new approach to the problem,
called Deep Match Tree (DeepMatch$_{tree}$), under a general setting. The
approach con... | [
{
"created": "Mon, 9 Mar 2015 11:11:15 GMT",
"version": "v1"
},
{
"created": "Tue, 10 Mar 2015 03:24:58 GMT",
"version": "v2"
},
{
"created": "Thu, 12 Mar 2015 08:31:01 GMT",
"version": "v3"
},
{
"created": "Fri, 24 Apr 2015 04:48:25 GMT",
"version": "v4"
},
{
"cr... | 2015-06-15 | [
[
"Wang",
"Mingxuan",
""
],
[
"Lu",
"Zhengdong",
""
],
[
"Li",
"Hang",
""
],
[
"Liu",
"Qun",
""
]
] | Many tasks in natural language processing, ranging from machine translation to question answering, can be reduced to the problem of matching two sentences or more generally two short texts. We propose a new approach to the problem, called Deep Match Tree (DeepMatch$_{tree}$), under a general setting. The approach consi... |
2110.11736 | Wanchuang Zhu Dr. | Wanchuang Zhu, Benjamin Zi Hao Zhao, Simon Luo, Tongliang Liu, Ke Deng | MANDERA: Malicious Node Detection in Federated Learning via Ranking | 17 pages, 11 figures, ICML | null | null | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Byzantine attacks hinder the deployment of federated learning algorithms.
Although we know that the benign gradients and Byzantine attacked gradients are
distributed differently, to detect the malicious gradients is challenging due
to (1) the gradient is high-dimensional and each dimension has its unique
distribution... | [
{
"created": "Fri, 22 Oct 2021 12:14:16 GMT",
"version": "v1"
},
{
"created": "Tue, 17 Jan 2023 04:24:03 GMT",
"version": "v2"
}
] | 2023-01-18 | [
[
"Zhu",
"Wanchuang",
""
],
[
"Zhao",
"Benjamin Zi Hao",
""
],
[
"Luo",
"Simon",
""
],
[
"Liu",
"Tongliang",
""
],
[
"Deng",
"Ke",
""
]
] | Byzantine attacks hinder the deployment of federated learning algorithms. Although we know that the benign gradients and Byzantine attacked gradients are distributed differently, to detect the malicious gradients is challenging due to (1) the gradient is high-dimensional and each dimension has its unique distribution a... |
2104.02392 | Thomas Steiner | Thomas Steiner, Fran\c{c}ois Beaufort | Accessing HID Devices on the Web With the WebHID API: How to play the
Chrome Dino Game by Jumping With a Nintendo Joy-Con Controller in One's
Pocket | 2 pages, accepted at the Developers Track of The Web Conference 2021 | null | null | null | cs.HC | http://creativecommons.org/licenses/by-sa/4.0/ | In this demonstration, we show how special hardware like Nintendo Joy-Con
controllers can be made accessible from the Web through the new WebHID API.
This novel technology proposal allows developers to write Web drivers in pure
JavaScript that talk to Human Interface Device (HID) devices via the HID
protocol. One suc... | [
{
"created": "Tue, 6 Apr 2021 09:49:53 GMT",
"version": "v1"
}
] | 2021-04-07 | [
[
"Steiner",
"Thomas",
""
],
[
"Beaufort",
"François",
""
]
] | In this demonstration, we show how special hardware like Nintendo Joy-Con controllers can be made accessible from the Web through the new WebHID API. This novel technology proposal allows developers to write Web drivers in pure JavaScript that talk to Human Interface Device (HID) devices via the HID protocol. One such ... |
2203.15233 | I-Chao Shen | I-Chao Shen, Yu Ju Chen, Oliver van Kaick, Takeo Igarashi | AutoPoly: Predicting a Polygonal Mesh Construction Sequence from a
Silhouette Image | 8 pages | null | null | null | cs.CV cs.CG cs.GR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Polygonal modeling is a core task of content creation in Computer Graphics.
The complexity of modeling, in terms of the number and the order of operations
and time required to execute them makes it challenging to learn and execute.
Our goal is to automatically derive a polygonal modeling sequence for a given
target. ... | [
{
"created": "Tue, 29 Mar 2022 04:48:47 GMT",
"version": "v1"
}
] | 2022-03-30 | [
[
"Shen",
"I-Chao",
""
],
[
"Chen",
"Yu Ju",
""
],
[
"van Kaick",
"Oliver",
""
],
[
"Igarashi",
"Takeo",
""
]
] | Polygonal modeling is a core task of content creation in Computer Graphics. The complexity of modeling, in terms of the number and the order of operations and time required to execute them makes it challenging to learn and execute. Our goal is to automatically derive a polygonal modeling sequence for a given target. Th... |
1812.00898 | Aishwarya Agrawal | Aishwarya Agrawal, Mateusz Malinowski, Felix Hill, Ali Eslami, Oriol
Vinyals, Tejas Kulkarni | Generating Diverse Programs with Instruction Conditioned Reinforced
Adversarial Learning | null | null | null | null | cs.LG cs.CL cs.CV stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Advances in Deep Reinforcement Learning have led to agents that perform well
across a variety of sensory-motor domains. In this work, we study the setting
in which an agent must learn to generate programs for diverse scenes
conditioned on a given symbolic instruction. Final goals are specified to our
agent via images... | [
{
"created": "Mon, 3 Dec 2018 16:51:35 GMT",
"version": "v1"
}
] | 2018-12-04 | [
[
"Agrawal",
"Aishwarya",
""
],
[
"Malinowski",
"Mateusz",
""
],
[
"Hill",
"Felix",
""
],
[
"Eslami",
"Ali",
""
],
[
"Vinyals",
"Oriol",
""
],
[
"Kulkarni",
"Tejas",
""
]
] | Advances in Deep Reinforcement Learning have led to agents that perform well across a variety of sensory-motor domains. In this work, we study the setting in which an agent must learn to generate programs for diverse scenes conditioned on a given symbolic instruction. Final goals are specified to our agent via images o... |
2311.15210 | Pingyao Feng | Pingyao Feng, Siheng Yi, Qingrui Qu, Zhiwang Yu, Yifei Zhu | Topology combined machine learning for consonant recognition | null | null | null | null | cs.LG math.ST stat.TH | http://creativecommons.org/licenses/by/4.0/ | In artificial-intelligence-aided signal processing, existing deep learning
models often exhibit a black-box structure, and their validity and
comprehensibility remain elusive. The integration of topological methods,
despite its relatively nascent application, serves a dual purpose of making
models more interpretable ... | [
{
"created": "Sun, 26 Nov 2023 06:53:56 GMT",
"version": "v1"
}
] | 2023-11-28 | [
[
"Feng",
"Pingyao",
""
],
[
"Yi",
"Siheng",
""
],
[
"Qu",
"Qingrui",
""
],
[
"Yu",
"Zhiwang",
""
],
[
"Zhu",
"Yifei",
""
]
] | In artificial-intelligence-aided signal processing, existing deep learning models often exhibit a black-box structure, and their validity and comprehensibility remain elusive. The integration of topological methods, despite its relatively nascent application, serves a dual purpose of making models more interpretable as... |
2205.00479 | Zhixian Yang | Zhixian Yang, Renliang Sun, Xiaojun Wan | Nearest Neighbor Knowledge Distillation for Neural Machine Translation | Accepted to NAACL 2022 Main Conference | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | k-nearest-neighbor machine translation (NN-MT), proposed by Khandelwal et al.
(2021), has achieved many state-of-the-art results in machine translation
tasks. Although effective, NN-MT requires conducting NN searches through the
large datastore for each decoding step during inference, prohibitively
increasing the dec... | [
{
"created": "Sun, 1 May 2022 14:30:49 GMT",
"version": "v1"
}
] | 2022-05-03 | [
[
"Yang",
"Zhixian",
""
],
[
"Sun",
"Renliang",
""
],
[
"Wan",
"Xiaojun",
""
]
] | k-nearest-neighbor machine translation (NN-MT), proposed by Khandelwal et al. (2021), has achieved many state-of-the-art results in machine translation tasks. Although effective, NN-MT requires conducting NN searches through the large datastore for each decoding step during inference, prohibitively increasing the decod... |
1302.3721 | Joseph Mellor | Joseph Mellor, Jonathan Shapiro | Thompson Sampling in Switching Environments with Bayesian Online Change
Point Detection | A version will appear in the Sixteenth international conference on
Artificial Intelligence and Statistics (AIStats 2013) | null | null | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Thompson Sampling has recently been shown to be optimal in the Bernoulli
Multi-Armed Bandit setting[Kaufmann et al., 2012]. This bandit problem assumes
stationary distributions for the rewards. It is often unrealistic to model the
real world as a stationary distribution. In this paper we derive and evaluate
algorithm... | [
{
"created": "Fri, 15 Feb 2013 10:48:57 GMT",
"version": "v1"
}
] | 2013-02-18 | [
[
"Mellor",
"Joseph",
""
],
[
"Shapiro",
"Jonathan",
""
]
] | Thompson Sampling has recently been shown to be optimal in the Bernoulli Multi-Armed Bandit setting[Kaufmann et al., 2012]. This bandit problem assumes stationary distributions for the rewards. It is often unrealistic to model the real world as a stationary distribution. In this paper we derive and evaluate algorithms ... |
2004.05773 | Isabelle Augenstein | Pepa Atanasova and Jakob Grue Simonsen and Christina Lioma and
Isabelle Augenstein | Generating Fact Checking Explanations | In Proceedings of the 2020 Annual Conference of the Association for
Computational Linguistics (ACL 2020) | null | null | null | cs.CL cs.AI cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Most existing work on automated fact checking is concerned with predicting
the veracity of claims based on metadata, social network spread, language used
in claims, and, more recently, evidence supporting or denying claims. A crucial
piece of the puzzle that is still missing is to understand how to automate the
most ... | [
{
"created": "Mon, 13 Apr 2020 05:23:25 GMT",
"version": "v1"
}
] | 2020-04-14 | [
[
"Atanasova",
"Pepa",
""
],
[
"Simonsen",
"Jakob Grue",
""
],
[
"Lioma",
"Christina",
""
],
[
"Augenstein",
"Isabelle",
""
]
] | Most existing work on automated fact checking is concerned with predicting the veracity of claims based on metadata, social network spread, language used in claims, and, more recently, evidence supporting or denying claims. A crucial piece of the puzzle that is still missing is to understand how to automate the most el... |
1412.0751 | John Wieting | John Wieting | Tiered Clustering to Improve Lexical Entailment | Paper for course project for Advanced NLP Spring 2013. 8 pages | null | null | null | cs.CL | http://creativecommons.org/licenses/by/3.0/ | Many tasks in Natural Language Processing involve recognizing lexical
entailment. Two different approaches to this problem have been proposed
recently that are quite different from each other. The first is an asymmetric
similarity measure designed to give high scores when the contexts of the
narrower term in the enta... | [
{
"created": "Tue, 2 Dec 2014 00:53:35 GMT",
"version": "v1"
}
] | 2014-12-03 | [
[
"Wieting",
"John",
""
]
] | Many tasks in Natural Language Processing involve recognizing lexical entailment. Two different approaches to this problem have been proposed recently that are quite different from each other. The first is an asymmetric similarity measure designed to give high scores when the contexts of the narrower term in the entail... |
2310.03668 | Iker Garc\'ia-Ferrero | Oscar Sainz, Iker Garc\'ia-Ferrero, Rodrigo Agerri, Oier Lopez de
Lacalle, German Rigau, Eneko Agirre | GoLLIE: Annotation Guidelines improve Zero-Shot Information-Extraction | The Twelfth International Conference on Learning Representations -
ICLR 2024 | null | null | null | cs.CL | http://creativecommons.org/licenses/by-sa/4.0/ | Large Language Models (LLMs) combined with instruction tuning have made
significant progress when generalizing to unseen tasks. However, they have been
less successful in Information Extraction (IE), lagging behind task-specific
models. Typically, IE tasks are characterized by complex annotation guidelines
that descr... | [
{
"created": "Thu, 5 Oct 2023 16:43:13 GMT",
"version": "v1"
},
{
"created": "Fri, 6 Oct 2023 17:41:15 GMT",
"version": "v2"
},
{
"created": "Mon, 11 Dec 2023 08:24:40 GMT",
"version": "v3"
},
{
"created": "Wed, 21 Feb 2024 15:51:58 GMT",
"version": "v4"
},
{
"cre... | 2024-03-07 | [
[
"Sainz",
"Oscar",
""
],
[
"García-Ferrero",
"Iker",
""
],
[
"Agerri",
"Rodrigo",
""
],
[
"de Lacalle",
"Oier Lopez",
""
],
[
"Rigau",
"German",
""
],
[
"Agirre",
"Eneko",
""
]
] | Large Language Models (LLMs) combined with instruction tuning have made significant progress when generalizing to unseen tasks. However, they have been less successful in Information Extraction (IE), lagging behind task-specific models. Typically, IE tasks are characterized by complex annotation guidelines that describ... |
2204.02684 | Xinyue Huo | Xinyue Huo, Lingxi Xie, Hengtong Hu, Wengang Zhou, Houqiang Li, Qi
Tian | Domain-Agnostic Prior for Transfer Semantic Segmentation | Accepted by CVPR 2022 | null | null | null | cs.CV | http://creativecommons.org/licenses/by/4.0/ | Unsupervised domain adaptation (UDA) is an important topic in the computer
vision community. The key difficulty lies in defining a common property between
the source and target domains so that the source-domain features can align with
the target-domain semantics. In this paper, we present a simple and effective
mecha... | [
{
"created": "Wed, 6 Apr 2022 09:13:25 GMT",
"version": "v1"
},
{
"created": "Wed, 20 Apr 2022 07:53:49 GMT",
"version": "v2"
}
] | 2022-04-21 | [
[
"Huo",
"Xinyue",
""
],
[
"Xie",
"Lingxi",
""
],
[
"Hu",
"Hengtong",
""
],
[
"Zhou",
"Wengang",
""
],
[
"Li",
"Houqiang",
""
],
[
"Tian",
"Qi",
""
]
] | Unsupervised domain adaptation (UDA) is an important topic in the computer vision community. The key difficulty lies in defining a common property between the source and target domains so that the source-domain features can align with the target-domain semantics. In this paper, we present a simple and effective mechani... |
2310.04192 | Daniel Weber | Daniel Weber, Fabian Thomas, Lukas Gerlach, Ruiyi Zhang, Michael
Schwarz | Reviving Meltdown 3a | published at ESORICS 2023 | null | null | null | cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Since the initial discovery of Meltdown and Spectre in 2017, different
variants of these attacks have been discovered. One often overlooked variant is
Meltdown 3a, also known as Meltdown-CPL-REG. Even though Meltdown-CPL-REG was
initially discovered in 2018, the available information regarding the
vulnerability is st... | [
{
"created": "Fri, 6 Oct 2023 12:11:46 GMT",
"version": "v1"
}
] | 2023-10-09 | [
[
"Weber",
"Daniel",
""
],
[
"Thomas",
"Fabian",
""
],
[
"Gerlach",
"Lukas",
""
],
[
"Zhang",
"Ruiyi",
""
],
[
"Schwarz",
"Michael",
""
]
] | Since the initial discovery of Meltdown and Spectre in 2017, different variants of these attacks have been discovered. One often overlooked variant is Meltdown 3a, also known as Meltdown-CPL-REG. Even though Meltdown-CPL-REG was initially discovered in 2018, the available information regarding the vulnerability is stil... |
2103.11683 | Qi Shen | Qi Shen, Shijun Wu, Yanzhen Zou, Bing Xie | Comprehensive Integration of API Usage Patterns | 11 pages, Accepted to the 29th IEEE/ACM International Conference on
Program Comprehension | null | null | null | cs.SE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Nowadays, developers often reuse existing APIs to implement their programming
tasks. A lot of API usage patterns are mined to help developers learn API usage
rules. However, there are still many missing variables to be synthesized when
developers integrate the patterns into their programming context. To deal with
thi... | [
{
"created": "Mon, 22 Mar 2021 09:24:43 GMT",
"version": "v1"
}
] | 2021-03-23 | [
[
"Shen",
"Qi",
""
],
[
"Wu",
"Shijun",
""
],
[
"Zou",
"Yanzhen",
""
],
[
"Xie",
"Bing",
""
]
] | Nowadays, developers often reuse existing APIs to implement their programming tasks. A lot of API usage patterns are mined to help developers learn API usage rules. However, there are still many missing variables to be synthesized when developers integrate the patterns into their programming context. To deal with this ... |
2402.13597 | Wang Liu | Wang Liu, Cunhua Pan, Hong Ren, Jiangzhou Wang, Robert Schober, and
Lajos Hanzo | Near-Field Multiuser Beam-Training for Extremely Large-Scale MIMO
Systems | submitted to IEEE | null | null | null | cs.IT eess.SP math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Extremely large-scale multiple-input multiple-output (XL-MIMO) systems are
capable of improving spectral efficiency by employing far more antennas than
conventional massive MIMO at the base station (BS). However, beam training in
multiuser XL-MIMO systems is challenging. To tackle these issues, we conceive a
three-ph... | [
{
"created": "Wed, 21 Feb 2024 07:59:44 GMT",
"version": "v1"
},
{
"created": "Tue, 26 Mar 2024 00:34:49 GMT",
"version": "v2"
}
] | 2024-03-27 | [
[
"Liu",
"Wang",
""
],
[
"Pan",
"Cunhua",
""
],
[
"Ren",
"Hong",
""
],
[
"Wang",
"Jiangzhou",
""
],
[
"Schober",
"Robert",
""
],
[
"Hanzo",
"Lajos",
""
]
] | Extremely large-scale multiple-input multiple-output (XL-MIMO) systems are capable of improving spectral efficiency by employing far more antennas than conventional massive MIMO at the base station (BS). However, beam training in multiuser XL-MIMO systems is challenging. To tackle these issues, we conceive a three-phas... |
2003.03220 | Ozan \c{C}atal | Ozan \c{C}atal, Samuel Wauthier, Tim Verbelen, Cedric De Boom, Bart
Dhoedt | Deep Active Inference for Autonomous Robot Navigation | workshop paper at BAICS at ICLR 2020 | null | null | null | cs.AI cs.LG | http://creativecommons.org/licenses/by/4.0/ | Active inference is a theory that underpins the way biological agent's
perceive and act in the real world. At its core, active inference is based on
the principle that the brain is an approximate Bayesian inference engine,
building an internal generative model to drive agents towards minimal surprise.
Although this t... | [
{
"created": "Fri, 6 Mar 2020 14:01:01 GMT",
"version": "v1"
}
] | 2020-03-09 | [
[
"Çatal",
"Ozan",
""
],
[
"Wauthier",
"Samuel",
""
],
[
"Verbelen",
"Tim",
""
],
[
"De Boom",
"Cedric",
""
],
[
"Dhoedt",
"Bart",
""
]
] | Active inference is a theory that underpins the way biological agent's perceive and act in the real world. At its core, active inference is based on the principle that the brain is an approximate Bayesian inference engine, building an internal generative model to drive agents towards minimal surprise. Although this the... |
2403.11051 | Akrati Saxena | Mariana Macedo, Akrati Saxena | Gender differences in online communication: A case study of Soccer | null | null | null | null | cs.SI | http://creativecommons.org/licenses/by-nc-nd/4.0/ | Social media and digital platforms allow us to express our opinions freely
and easily to a vast number of people. In this study, we examine whether there
are gender-based differences in how communication happens via Twitter in regard
to soccer. Soccer is one of the most popular sports, and therefore, on social
media,... | [
{
"created": "Sun, 17 Mar 2024 01:26:38 GMT",
"version": "v1"
}
] | 2024-03-19 | [
[
"Macedo",
"Mariana",
""
],
[
"Saxena",
"Akrati",
""
]
] | Social media and digital platforms allow us to express our opinions freely and easily to a vast number of people. In this study, we examine whether there are gender-based differences in how communication happens via Twitter in regard to soccer. Soccer is one of the most popular sports, and therefore, on social media, i... |
1906.10002 | Daniel Loureiro | Daniel Loureiro and Alipio Jorge | LIAAD at SemDeep-5 Challenge: Word-in-Context (WiC) | Accepted at the SemDeep-5 Workshop in IJCAI 2019. Code and data:
https://github.com/danlou/LMMS | null | null | null | cs.CL cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper describes the LIAAD system that was ranked second place in the
Word-in-Context challenge (WiC) featured in SemDeep-5. Our solution is based on
a novel system for Word Sense Disambiguation (WSD) using contextual embeddings
and full-inventory sense embeddings. We adapt this WSD system, in a
straightforward m... | [
{
"created": "Mon, 24 Jun 2019 14:49:05 GMT",
"version": "v1"
}
] | 2019-06-25 | [
[
"Loureiro",
"Daniel",
""
],
[
"Jorge",
"Alipio",
""
]
] | This paper describes the LIAAD system that was ranked second place in the Word-in-Context challenge (WiC) featured in SemDeep-5. Our solution is based on a novel system for Word Sense Disambiguation (WSD) using contextual embeddings and full-inventory sense embeddings. We adapt this WSD system, in a straightforward man... |
2309.12673 | Jerry Yao-Chieh Hu | Jerry Yao-Chieh Hu, Donglin Yang, Dennis Wu, Chenwei Xu, Bo-Yu Chen,
Han Liu | On Sparse Modern Hopfield Model | 37 pages, accepted at NeurIPS 2023. [v2] updated to match with
camera-ready version. Code is available at
https://github.com/MAGICS-LAB/SparseModernHopfield | null | null | null | cs.LG cs.AI cs.CV stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We introduce the sparse modern Hopfield model as a sparse extension of the
modern Hopfield model. Like its dense counterpart, the sparse modern Hopfield
model equips a memory-retrieval dynamics whose one-step approximation
corresponds to the sparse attention mechanism. Theoretically, our key
contribution is a princip... | [
{
"created": "Fri, 22 Sep 2023 07:32:45 GMT",
"version": "v1"
},
{
"created": "Wed, 29 Nov 2023 22:45:39 GMT",
"version": "v2"
}
] | 2023-12-01 | [
[
"Hu",
"Jerry Yao-Chieh",
""
],
[
"Yang",
"Donglin",
""
],
[
"Wu",
"Dennis",
""
],
[
"Xu",
"Chenwei",
""
],
[
"Chen",
"Bo-Yu",
""
],
[
"Liu",
"Han",
""
]
] | We introduce the sparse modern Hopfield model as a sparse extension of the modern Hopfield model. Like its dense counterpart, the sparse modern Hopfield model equips a memory-retrieval dynamics whose one-step approximation corresponds to the sparse attention mechanism. Theoretically, our key contribution is a principle... |
2203.00386 | Zihao Wang | Zihao Wang, Wei Liu, Qian He, Xinglong Wu, Zili Yi | CLIP-GEN: Language-Free Training of a Text-to-Image Generator with CLIP | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Training a text-to-image generator in the general domain (e.g., Dall.e,
CogView) requires huge amounts of paired text-image data, which is too
expensive to collect. In this paper, we propose a self-supervised scheme named
as CLIP-GEN for general text-to-image generation with the language-image priors
extracted with a... | [
{
"created": "Tue, 1 Mar 2022 12:11:32 GMT",
"version": "v1"
}
] | 2022-03-02 | [
[
"Wang",
"Zihao",
""
],
[
"Liu",
"Wei",
""
],
[
"He",
"Qian",
""
],
[
"Wu",
"Xinglong",
""
],
[
"Yi",
"Zili",
""
]
] | Training a text-to-image generator in the general domain (e.g., Dall.e, CogView) requires huge amounts of paired text-image data, which is too expensive to collect. In this paper, we propose a self-supervised scheme named as CLIP-GEN for general text-to-image generation with the language-image priors extracted with a p... |
1707.03886 | Amit Dhurandhar | Amit Dhurandhar, Vijay Iyengar, Ronny Luss and Karthikeyan Shanmugam | A Formal Framework to Characterize Interpretability of Procedures | presented at 2017 ICML Workshop on Human Interpretability in Machine
Learning (WHI 2017), Sydney, NSW, Australia | null | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We provide a novel notion of what it means to be interpretable, looking past
the usual association with human understanding. Our key insight is that
interpretability is not an absolute concept and so we define it relative to a
target model, which may or may not be a human. We define a framework that
allows for compar... | [
{
"created": "Wed, 12 Jul 2017 19:42:08 GMT",
"version": "v1"
}
] | 2017-07-14 | [
[
"Dhurandhar",
"Amit",
""
],
[
"Iyengar",
"Vijay",
""
],
[
"Luss",
"Ronny",
""
],
[
"Shanmugam",
"Karthikeyan",
""
]
] | We provide a novel notion of what it means to be interpretable, looking past the usual association with human understanding. Our key insight is that interpretability is not an absolute concept and so we define it relative to a target model, which may or may not be a human. We define a framework that allows for comparin... |
1801.01612 | Jaouhar Fattahi | Jaouhar Fattahi and Mohamed Mejri | Secrecy by Witness-Functions under Equational Theories | http://ieeexplore.ieee.org/document/7301205/ | 7th International Conference on Electronics, Computers and
Artificial Intelligence (ECAI), 2015 | 10.1109/ECAI.2015.7301205 | null | cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we use the witness-functions to analyze cryptographic
protocols for secrecy under nonempty equational theories. The witness-functions
are safe metrics used to compute security. An analysis with a witness-function
consists in making sure that the security of every atomic message does not
decrease during... | [
{
"created": "Fri, 5 Jan 2018 02:21:14 GMT",
"version": "v1"
}
] | 2018-01-08 | [
[
"Fattahi",
"Jaouhar",
""
],
[
"Mejri",
"Mohamed",
""
]
] | In this paper, we use the witness-functions to analyze cryptographic protocols for secrecy under nonempty equational theories. The witness-functions are safe metrics used to compute security. An analysis with a witness-function consists in making sure that the security of every atomic message does not decrease during i... |
1402.7015 | Fabian Pedregosa | Fabian Pedregosa (INRIA Saclay - Ile de France, INRIA Paris -
Rocquencourt), Michael Eickenberg (INRIA Saclay - Ile de France, LNAO),
Philippe Ciuciu (INRIA Saclay - Ile de France, NEUROSPIN), Bertrand Thirion
(INRIA Saclay - Ile de France, NEUROSPIN), Alexandre Gramfort (LTCI) | Data-driven HRF estimation for encoding and decoding models | appears in NeuroImage (2015) | null | 10.1016/j.neuroimage.2014.09.060 | null | cs.CE cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Despite the common usage of a canonical, data-independent, hemodynamic
response function (HRF), it is known that the shape of the HRF varies across
brain regions and subjects. This suggests that a data-driven estimation of this
function could lead to more statistical power when modeling BOLD fMRI data.
However, uncon... | [
{
"created": "Thu, 27 Feb 2014 18:50:58 GMT",
"version": "v1"
},
{
"created": "Sun, 6 Apr 2014 06:11:17 GMT",
"version": "v2"
},
{
"created": "Tue, 15 Jul 2014 11:14:00 GMT",
"version": "v3"
},
{
"created": "Mon, 6 Oct 2014 16:39:55 GMT",
"version": "v4"
},
{
"cre... | 2014-11-10 | [
[
"Pedregosa",
"Fabian",
"",
"INRIA Saclay - Ile de France, INRIA Paris -\n Rocquencourt"
],
[
"Eickenberg",
"Michael",
"",
"INRIA Saclay - Ile de France, LNAO"
],
[
"Ciuciu",
"Philippe",
"",
"INRIA Saclay - Ile de France, NEUROSPIN"
],
[
"Thirion",
... | Despite the common usage of a canonical, data-independent, hemodynamic response function (HRF), it is known that the shape of the HRF varies across brain regions and subjects. This suggests that a data-driven estimation of this function could lead to more statistical power when modeling BOLD fMRI data. However, unconst... |
2312.12891 | Steven James | William Hill, Ireton Liu, Anita De Mello Koch, Damion Harvey, Nishanth
Kumar, George Konidaris, Steven James | MinePlanner: A Benchmark for Long-Horizon Planning in Large Minecraft
Worlds | Accepted to the 6th ICAPS Workshop on the International Planning
Competition (WIPC 2024) | null | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We propose a new benchmark for planning tasks based on the Minecraft game.
Our benchmark contains 45 tasks overall, but also provides support for creating
both propositional and numeric instances of new Minecraft tasks automatically.
We benchmark numeric and propositional planning systems on these tasks, with
results... | [
{
"created": "Wed, 20 Dec 2023 10:04:39 GMT",
"version": "v1"
},
{
"created": "Sun, 28 Apr 2024 11:22:36 GMT",
"version": "v2"
}
] | 2024-04-30 | [
[
"Hill",
"William",
""
],
[
"Liu",
"Ireton",
""
],
[
"Koch",
"Anita De Mello",
""
],
[
"Harvey",
"Damion",
""
],
[
"Kumar",
"Nishanth",
""
],
[
"Konidaris",
"George",
""
],
[
"James",
"Steven",
""
]
] | We propose a new benchmark for planning tasks based on the Minecraft game. Our benchmark contains 45 tasks overall, but also provides support for creating both propositional and numeric instances of new Minecraft tasks automatically. We benchmark numeric and propositional planning systems on these tasks, with results d... |
2212.08872 | Salman Mohebi | Salman Mohebi, Andrea Zanella and Michele Zorzi | Pilot Reuse in Cell-Free Massive MIMO Systems: A Diverse Clustering
Approach | 29 pages, 9 figures, submitted to IEEE | null | null | null | cs.IT eess.SP math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Distributed or Cell-free (CF) massive Multiple-Input, Multiple-Output
(mMIMO), has been recently proposed as an answer to the limitations of the
current network-centric systems in providing high-rate ubiquitous transmission.
The capability of providing uniform service level makes CF mMIMO a potential
technology for b... | [
{
"created": "Sat, 17 Dec 2022 13:56:49 GMT",
"version": "v1"
}
] | 2022-12-20 | [
[
"Mohebi",
"Salman",
""
],
[
"Zanella",
"Andrea",
""
],
[
"Zorzi",
"Michele",
""
]
] | Distributed or Cell-free (CF) massive Multiple-Input, Multiple-Output (mMIMO), has been recently proposed as an answer to the limitations of the current network-centric systems in providing high-rate ubiquitous transmission. The capability of providing uniform service level makes CF mMIMO a potential technology for bey... |
1807.03165 | Jeremy Kepner | Jeremy Kepner, Vijay Gadepally, Hayden Jananthan, Lauren Milechin, Sid
Samsi | Sparse Deep Neural Network Exact Solutions | 8 pages, 10 figures, accepted to IEEE HPEC 2018. arXiv admin note:
text overlap with arXiv:1708.02937 | null | 10.1109/HPEC.2018.8547742 | null | cs.LG cs.CV cs.NE stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Deep neural networks (DNNs) have emerged as key enablers of machine learning.
Applying larger DNNs to more diverse applications is an important challenge.
The computations performed during DNN training and inference are dominated by
operations on the weight matrices describing the DNN. As DNNs incorporate more
layers... | [
{
"created": "Fri, 6 Jul 2018 00:47:12 GMT",
"version": "v1"
}
] | 2018-12-17 | [
[
"Kepner",
"Jeremy",
""
],
[
"Gadepally",
"Vijay",
""
],
[
"Jananthan",
"Hayden",
""
],
[
"Milechin",
"Lauren",
""
],
[
"Samsi",
"Sid",
""
]
] | Deep neural networks (DNNs) have emerged as key enablers of machine learning. Applying larger DNNs to more diverse applications is an important challenge. The computations performed during DNN training and inference are dominated by operations on the weight matrices describing the DNN. As DNNs incorporate more layers a... |
2402.09164 | Ruoyu Chen | Ruoyu Chen, Hua Zhang, Siyuan Liang, Jingzhi Li, Xiaochun Cao | Less is More: Fewer Interpretable Region via Submodular Subset Selection | Accepted to ICLR 2024 (Oral) | null | null | null | cs.CV cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Image attribution algorithms aim to identify important regions that are
highly relevant to model decisions. Although existing attribution solutions can
effectively assign importance to target elements, they still face the following
challenges: 1) existing attribution methods generate inaccurate small regions
thus mis... | [
{
"created": "Wed, 14 Feb 2024 13:30:02 GMT",
"version": "v1"
},
{
"created": "Thu, 29 Feb 2024 03:29:41 GMT",
"version": "v2"
}
] | 2024-03-01 | [
[
"Chen",
"Ruoyu",
""
],
[
"Zhang",
"Hua",
""
],
[
"Liang",
"Siyuan",
""
],
[
"Li",
"Jingzhi",
""
],
[
"Cao",
"Xiaochun",
""
]
] | Image attribution algorithms aim to identify important regions that are highly relevant to model decisions. Although existing attribution solutions can effectively assign importance to target elements, they still face the following challenges: 1) existing attribution methods generate inaccurate small regions thus misle... |
2103.07241 | Giovani Guizzo | Giovani Guizzo, Federica Sarro, Jens Krinke, Silvia Regina Vergilio | Sentinel: A Hyper-Heuristic for the Generation of Mutant Reduction
Strategies | in IEEE Transactions on Software Engineering | null | 10.1109/TSE.2020.3002496 | null | cs.SE cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Mutation testing is an effective approach to evaluate and strengthen software
test suites, but its adoption is currently limited by the mutants' execution
computational cost. Several strategies have been proposed to reduce this cost
(a.k.a. mutation cost reduction strategies), however none of them has proven to
be ef... | [
{
"created": "Fri, 12 Mar 2021 12:38:51 GMT",
"version": "v1"
}
] | 2021-03-15 | [
[
"Guizzo",
"Giovani",
""
],
[
"Sarro",
"Federica",
""
],
[
"Krinke",
"Jens",
""
],
[
"Vergilio",
"Silvia Regina",
""
]
] | Mutation testing is an effective approach to evaluate and strengthen software test suites, but its adoption is currently limited by the mutants' execution computational cost. Several strategies have been proposed to reduce this cost (a.k.a. mutation cost reduction strategies), however none of them has proven to be effe... |
1605.04344 | Ludovic Righetti | Brahayam Ponton, Stefan Schaal, Ludovic Righetti | On the Effects of Measurement Uncertainty in Optimal Control of Contact
Interactions | 17 pages, 5 figures - this version is the one published at WAFR 2016
to fulfill the open access requirements of the EU commission, please refer to
the previous version for the complete derivation of the algorithm | null | 10.1007/978-3-030-43089-4_50 | null | cs.SY cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Stochastic Optimal Control (SOC) typically considers noise only in the
process model, i.e. unknown disturbances. However, in many robotic applications
involving interaction with the environment, such as locomotion and
manipulation, uncertainty also comes from lack of precise knowledge of the
world, which is not an ac... | [
{
"created": "Fri, 13 May 2016 22:12:10 GMT",
"version": "v1"
},
{
"created": "Tue, 16 Jan 2018 18:01:59 GMT",
"version": "v2"
},
{
"created": "Sat, 5 Jun 2021 19:48:03 GMT",
"version": "v3"
}
] | 2021-06-08 | [
[
"Ponton",
"Brahayam",
""
],
[
"Schaal",
"Stefan",
""
],
[
"Righetti",
"Ludovic",
""
]
] | Stochastic Optimal Control (SOC) typically considers noise only in the process model, i.e. unknown disturbances. However, in many robotic applications involving interaction with the environment, such as locomotion and manipulation, uncertainty also comes from lack of precise knowledge of the world, which is not an actu... |
1611.01148 | Ted Alcorn | John W. Ayers (San Diego State University), Benjamin M. Althouse
(Santa Fe Institute), Eric C. Leas (UC San Diego), Ted Alcorn (Everytown for
Gun Safety), Mark Dredze (Johns Hopkins University) | Can Big Media Data Revolutionarize Gun Violence Prevention? | Presented at the Data For Good Exchange 2016 | null | null | null | cs.CY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The scientific method drives improvements in public health, but a strategy of
obstructionism has impeded scientists from gathering even a minimal amount of
information to address America's gun violence epidemic. We argue that in spite
of a lack of federal investment, large amounts of publicly available data offer
sci... | [
{
"created": "Thu, 3 Nov 2016 19:52:00 GMT",
"version": "v1"
}
] | 2016-11-04 | [
[
"Ayers",
"John W.",
"",
"San Diego State University"
],
[
"Althouse",
"Benjamin M.",
"",
"Santa Fe Institute"
],
[
"Leas",
"Eric C.",
"",
"UC San Diego"
],
[
"Alcorn",
"Ted",
"",
"Everytown for\n Gun Safety"
],
[
"Dredze",
"M... | The scientific method drives improvements in public health, but a strategy of obstructionism has impeded scientists from gathering even a minimal amount of information to address America's gun violence epidemic. We argue that in spite of a lack of federal investment, large amounts of publicly available data offer scien... |
1904.00742 | Renato Krohling | Giuliano L. Manso, Helder Knidel, Renato A. Krohling, Jose A. Ventura | A smartphone application to detection and classification of coffee leaf
miner and coffee leaf rust | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Generally, the identification and classification of plant diseases and/or
pests are performed by an expert . One of the problems facing coffee farmers in
Brazil is crop infestation, particularly by leaf rust Hemileia vastatrix and
leaf miner Leucoptera coffeella. The progression of the diseases and or pests
occurs sp... | [
{
"created": "Tue, 19 Mar 2019 21:45:47 GMT",
"version": "v1"
}
] | 2019-04-02 | [
[
"Manso",
"Giuliano L.",
""
],
[
"Knidel",
"Helder",
""
],
[
"Krohling",
"Renato A.",
""
],
[
"Ventura",
"Jose A.",
""
]
] | Generally, the identification and classification of plant diseases and/or pests are performed by an expert . One of the problems facing coffee farmers in Brazil is crop infestation, particularly by leaf rust Hemileia vastatrix and leaf miner Leucoptera coffeella. The progression of the diseases and or pests occurs spat... |
1502.07979 | Anastasios Noulas Anastasios Noulas | Anastasios Noulas, Blake Shaw, Renaud Lambiotte, Cecilia Mascolo | Topological Properties and Temporal Dynamics of Place Networks in Urban
Environments | null | null | null | null | cs.SI physics.soc-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Understanding the spatial networks formed by the trajectories of mobile users
can be beneficial to applications ranging from epidemiology to local search.
Despite the potential for impact in a number of fields, several aspects of
human mobility networks remain largely unexplored due to the lack of
large-scale data at... | [
{
"created": "Fri, 27 Feb 2015 17:30:16 GMT",
"version": "v1"
},
{
"created": "Tue, 17 Mar 2015 14:03:02 GMT",
"version": "v2"
}
] | 2015-03-18 | [
[
"Noulas",
"Anastasios",
""
],
[
"Shaw",
"Blake",
""
],
[
"Lambiotte",
"Renaud",
""
],
[
"Mascolo",
"Cecilia",
""
]
] | Understanding the spatial networks formed by the trajectories of mobile users can be beneficial to applications ranging from epidemiology to local search. Despite the potential for impact in a number of fields, several aspects of human mobility networks remain largely unexplored due to the lack of large-scale data at a... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.