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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1905.01326 | Dominik Kulon | Dominik Kulon, Haoyang Wang, Riza Alp G\"uler, Michael Bronstein,
Stefanos Zafeiriou | Single Image 3D Hand Reconstruction with Mesh Convolutions | Proceedings of the British Machine Vision Conference (BMVC 2019) | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Monocular 3D reconstruction of deformable objects, such as human body parts,
has been typically approached by predicting parameters of heavyweight linear
models. In this paper, we demonstrate an alternative solution that is based on
the idea of encoding images into a latent non-linear representation of meshes.
The pr... | [
{
"created": "Sat, 4 May 2019 20:41:47 GMT",
"version": "v1"
},
{
"created": "Mon, 13 May 2019 23:37:19 GMT",
"version": "v2"
},
{
"created": "Mon, 5 Aug 2019 12:07:34 GMT",
"version": "v3"
}
] | 2019-08-06 | [
[
"Kulon",
"Dominik",
""
],
[
"Wang",
"Haoyang",
""
],
[
"Güler",
"Riza Alp",
""
],
[
"Bronstein",
"Michael",
""
],
[
"Zafeiriou",
"Stefanos",
""
]
] | Monocular 3D reconstruction of deformable objects, such as human body parts, has been typically approached by predicting parameters of heavyweight linear models. In this paper, we demonstrate an alternative solution that is based on the idea of encoding images into a latent non-linear representation of meshes. The prio... |
2305.17489 | Zhongping Zhang | Zhongping Zhang, Jian Zheng, Jacob Zhiyuan Fang, Bryan A. Plummer | Text-to-image Editing by Image Information Removal | Full paper is accepted by WACV2024; Best paper runner-up of
AI4CC@CVPR 2023 | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Diffusion models have demonstrated impressive performance in text-guided
image generation. Current methods that leverage the knowledge of these models
for image editing either fine-tune them using the input image (e.g., Imagic) or
incorporate structure information as additional constraints (e.g., ControlNet).
However... | [
{
"created": "Sat, 27 May 2023 14:48:05 GMT",
"version": "v1"
},
{
"created": "Tue, 7 Nov 2023 19:22:36 GMT",
"version": "v2"
}
] | 2023-11-09 | [
[
"Zhang",
"Zhongping",
""
],
[
"Zheng",
"Jian",
""
],
[
"Fang",
"Jacob Zhiyuan",
""
],
[
"Plummer",
"Bryan A.",
""
]
] | Diffusion models have demonstrated impressive performance in text-guided image generation. Current methods that leverage the knowledge of these models for image editing either fine-tune them using the input image (e.g., Imagic) or incorporate structure information as additional constraints (e.g., ControlNet). However, ... |
1911.09427 | Guy Shalev | Guy Shalev, Ran El-Yaniv, Daniel Klotz, Frederik Kratzert, Asher
Metzger, Sella Nevo | Accurate Hydrologic Modeling Using Less Information | null | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Joint models are a common and important tool in the intersection of machine
learning and the physical sciences, particularly in contexts where real-world
measurements are scarce. Recent developments in rainfall-runoff modeling, one
of the prime challenges in hydrology, show the value of a joint model with
shared repr... | [
{
"created": "Thu, 21 Nov 2019 12:01:19 GMT",
"version": "v1"
}
] | 2019-11-22 | [
[
"Shalev",
"Guy",
""
],
[
"El-Yaniv",
"Ran",
""
],
[
"Klotz",
"Daniel",
""
],
[
"Kratzert",
"Frederik",
""
],
[
"Metzger",
"Asher",
""
],
[
"Nevo",
"Sella",
""
]
] | Joint models are a common and important tool in the intersection of machine learning and the physical sciences, particularly in contexts where real-world measurements are scarce. Recent developments in rainfall-runoff modeling, one of the prime challenges in hydrology, show the value of a joint model with shared repres... |
2306.09389 | Junjun Yan | Junjun Yan, Xinhai Chen, Zhichao Wang, Enqiang Zhoui and Jie Liu | ST-PINN: A Self-Training Physics-Informed Neural Network for Partial
Differential Equations | null | null | null | null | cs.LG cs.AI physics.comp-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Partial differential equations (PDEs) are an essential computational kernel
in physics and engineering. With the advance of deep learning, physics-informed
neural networks (PINNs), as a mesh-free method, have shown great potential for
fast PDE solving in various applications. To address the issue of low accuracy
and ... | [
{
"created": "Thu, 15 Jun 2023 15:49:13 GMT",
"version": "v1"
}
] | 2023-06-19 | [
[
"Yan",
"Junjun",
""
],
[
"Chen",
"Xinhai",
""
],
[
"Wang",
"Zhichao",
""
],
[
"Zhoui",
"Enqiang",
""
],
[
"Liu",
"Jie",
""
]
] | Partial differential equations (PDEs) are an essential computational kernel in physics and engineering. With the advance of deep learning, physics-informed neural networks (PINNs), as a mesh-free method, have shown great potential for fast PDE solving in various applications. To address the issue of low accuracy and co... |
1906.03380 | Sarah Wiegreffe | Sarah Wiegreffe, Edward Choi, Sherry Yan, Jimeng Sun, Jacob Eisenstein | Clinical Concept Extraction for Document-Level Coding | ACL BioNLP workshop (2019) | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The text of clinical notes can be a valuable source of patient information
and clinical assessments. Historically, the primary approach for exploiting
clinical notes has been information extraction: linking spans of text to
concepts in a detailed domain ontology. However, recent work has demonstrated
the potential of... | [
{
"created": "Sat, 8 Jun 2019 03:32:00 GMT",
"version": "v1"
}
] | 2019-06-11 | [
[
"Wiegreffe",
"Sarah",
""
],
[
"Choi",
"Edward",
""
],
[
"Yan",
"Sherry",
""
],
[
"Sun",
"Jimeng",
""
],
[
"Eisenstein",
"Jacob",
""
]
] | The text of clinical notes can be a valuable source of patient information and clinical assessments. Historically, the primary approach for exploiting clinical notes has been information extraction: linking spans of text to concepts in a detailed domain ontology. However, recent work has demonstrated the potential of s... |
1908.11366 | Karim Banawan | Karim Banawan and Batuhan Arasli and Sennur Ulukus | Improved Storage for Efficient Private Information Retrieval | ITW 2019 | null | null | null | cs.IT cs.CR cs.DB math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We consider the problem of private information retrieval from $N$
\emph{storage-constrained} databases. In this problem, a user wishes to
retrieve a single message out of $M$ messages (of size $L$) without revealing
any information about the identity of the message to individual databases. Each
database stores $\mu M... | [
{
"created": "Thu, 29 Aug 2019 17:52:01 GMT",
"version": "v1"
}
] | 2019-08-30 | [
[
"Banawan",
"Karim",
""
],
[
"Arasli",
"Batuhan",
""
],
[
"Ulukus",
"Sennur",
""
]
] | We consider the problem of private information retrieval from $N$ \emph{storage-constrained} databases. In this problem, a user wishes to retrieve a single message out of $M$ messages (of size $L$) without revealing any information about the identity of the message to individual databases. Each database stores $\mu ML$... |
0705.3360 | Kyriakos Sgarbas | Kyriakos N. Sgarbas | The Road to Quantum Artificial Intelligence | 9 pages. Presented at PCI-2007: 11th Panhellenic Conference in
Informatics, 18-20 May 2007, Patras, Greece | In: T.S.Papatheodorou, D.N.Christodoulakis and N.N.Karanikolas
(eds), "Current Trends in Informatics", Vol.A, pp.469-477, New Technologies
Publications, Athens, 2007 (SET 978-960-89784-0-9) | null | null | cs.AI | null | This paper overviews the basic principles and recent advances in the emerging
field of Quantum Computation (QC), highlighting its potential application to
Artificial Intelligence (AI). The paper provides a very brief introduction to
basic QC issues like quantum registers, quantum gates and quantum algorithms
and then... | [
{
"created": "Wed, 23 May 2007 12:31:47 GMT",
"version": "v1"
}
] | 2007-05-24 | [
[
"Sgarbas",
"Kyriakos N.",
""
]
] | This paper overviews the basic principles and recent advances in the emerging field of Quantum Computation (QC), highlighting its potential application to Artificial Intelligence (AI). The paper provides a very brief introduction to basic QC issues like quantum registers, quantum gates and quantum algorithms and then i... |
2308.14272 | Jennifer Hsia | Jennifer Hsia, Danish Pruthi, Aarti Singh, Zachary C. Lipton | Goodhart's Law Applies to NLP's Explanation Benchmarks | null | null | null | null | cs.CL cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Despite the rising popularity of saliency-based explanations, the research
community remains at an impasse, facing doubts concerning their purpose,
efficacy, and tendency to contradict each other. Seeking to unite the
community's efforts around common goals, several recent works have proposed
evaluation metrics. In t... | [
{
"created": "Mon, 28 Aug 2023 03:03:03 GMT",
"version": "v1"
}
] | 2023-08-29 | [
[
"Hsia",
"Jennifer",
""
],
[
"Pruthi",
"Danish",
""
],
[
"Singh",
"Aarti",
""
],
[
"Lipton",
"Zachary C.",
""
]
] | Despite the rising popularity of saliency-based explanations, the research community remains at an impasse, facing doubts concerning their purpose, efficacy, and tendency to contradict each other. Seeking to unite the community's efforts around common goals, several recent works have proposed evaluation metrics. In thi... |
2405.18296 | Anchit Jain | Anchit Jain, Rozhin Nobahari, Aristide Baratin, Stefano Sarao Mannelli | Bias in Motion: Theoretical Insights into the Dynamics of Bias in SGD
Training | null | null | null | null | cs.LG cond-mat.dis-nn stat.ML | http://creativecommons.org/licenses/by/4.0/ | Machine learning systems often acquire biases by leveraging undesired
features in the data, impacting accuracy variably across different
sub-populations. Current understanding of bias formation mostly focuses on the
initial and final stages of learning, leaving a gap in knowledge regarding the
transient dynamics. To ... | [
{
"created": "Tue, 28 May 2024 15:50:10 GMT",
"version": "v1"
}
] | 2024-05-29 | [
[
"Jain",
"Anchit",
""
],
[
"Nobahari",
"Rozhin",
""
],
[
"Baratin",
"Aristide",
""
],
[
"Mannelli",
"Stefano Sarao",
""
]
] | Machine learning systems often acquire biases by leveraging undesired features in the data, impacting accuracy variably across different sub-populations. Current understanding of bias formation mostly focuses on the initial and final stages of learning, leaving a gap in knowledge regarding the transient dynamics. To ad... |
2012.00548 | Xinyu Gao | Xinyu Gao, Yuanwei Liu, Xiao Liu and Zhijin Qin | Resource Allocation in IRSs Aided MISO-NOMA Networks: A Machine Learning
Approach | 6 pages, 5 figures. It will be published in IEEE Global
Communications Conference (GC) 2020 | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A novel framework of intelligent reflecting surface (IRS)-aided
multiple-input single-output (MISO) non-orthogonal multiple access (NOMA)
network is proposed, where a base station (BS) serves multiple clusters with
unfixed number of users in each cluster. The goal is to maximize the sum rate
of all users by jointly o... | [
{
"created": "Wed, 18 Nov 2020 12:36:24 GMT",
"version": "v1"
}
] | 2020-12-02 | [
[
"Gao",
"Xinyu",
""
],
[
"Liu",
"Yuanwei",
""
],
[
"Liu",
"Xiao",
""
],
[
"Qin",
"Zhijin",
""
]
] | A novel framework of intelligent reflecting surface (IRS)-aided multiple-input single-output (MISO) non-orthogonal multiple access (NOMA) network is proposed, where a base station (BS) serves multiple clusters with unfixed number of users in each cluster. The goal is to maximize the sum rate of all users by jointly opt... |
1911.07234 | Ali \c{C}ivril | Ali \c{C}ivril | Approximation of Steiner Forest via the Bidirected Cut Relaxation | 15 pages, 5 figures | Journal of Combinatorial Optimization, 38(4):1196-1212, 2019 | 10.1007/s10878-019-00444-8 | null | cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The classical algorithm of Agrawal, Klein and Ravi [SIAM J. Comput., 24
(1995), pp. 440-456], stated in the setting of the primal-dual schema by
Goemans and Williamson [SIAM J. Comput., 24 (1995), pp. 296-317] uses the
undirected cut relaxation for the Steiner forest problem. Its approximation
ratio is $2-\frac{1}{k}... | [
{
"created": "Sun, 17 Nov 2019 13:34:00 GMT",
"version": "v1"
}
] | 2019-11-19 | [
[
"Çivril",
"Ali",
""
]
] | The classical algorithm of Agrawal, Klein and Ravi [SIAM J. Comput., 24 (1995), pp. 440-456], stated in the setting of the primal-dual schema by Goemans and Williamson [SIAM J. Comput., 24 (1995), pp. 296-317] uses the undirected cut relaxation for the Steiner forest problem. Its approximation ratio is $2-\frac{1}{k}$,... |
2405.00879 | Xiao Li | Xiao Li and Qian Gong and Jaemoon Lee and Scott Klasky and Anand
Rangarajan and Sanjay Ranka | Machine Learning Techniques for Data Reduction of Climate Applications | 7 pages. arXiv admin note: text overlap with arXiv:2404.18063 | null | null | null | cs.LG physics.ao-ph | http://creativecommons.org/licenses/by/4.0/ | Scientists conduct large-scale simulations to compute derived
quantities-of-interest (QoI) from primary data. Often, QoI are linked to
specific features, regions, or time intervals, such that data can be adaptively
reduced without compromising the integrity of QoI. For many spatiotemporal
applications, these QoI are ... | [
{
"created": "Wed, 1 May 2024 21:44:47 GMT",
"version": "v1"
}
] | 2024-05-03 | [
[
"Li",
"Xiao",
""
],
[
"Gong",
"Qian",
""
],
[
"Lee",
"Jaemoon",
""
],
[
"Klasky",
"Scott",
""
],
[
"Rangarajan",
"Anand",
""
],
[
"Ranka",
"Sanjay",
""
]
] | Scientists conduct large-scale simulations to compute derived quantities-of-interest (QoI) from primary data. Often, QoI are linked to specific features, regions, or time intervals, such that data can be adaptively reduced without compromising the integrity of QoI. For many spatiotemporal applications, these QoI are bi... |
1902.05026 | Justice Amoh | Justice Amoh and Kofi Odame | An Optimized Recurrent Unit for Ultra-Low-Power Keyword Spotting | null | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | There is growing interest in being able to run neural networks on sensors,
wearables and internet-of-things (IoT) devices. However, the computational
demands of neural networks make them difficult to deploy on
resource-constrained edge devices.
To meet this need, our work introduces a new recurrent unit architectur... | [
{
"created": "Wed, 13 Feb 2019 17:41:15 GMT",
"version": "v1"
}
] | 2019-02-14 | [
[
"Amoh",
"Justice",
""
],
[
"Odame",
"Kofi",
""
]
] | There is growing interest in being able to run neural networks on sensors, wearables and internet-of-things (IoT) devices. However, the computational demands of neural networks make them difficult to deploy on resource-constrained edge devices. To meet this need, our work introduces a new recurrent unit architecture th... |
2212.07114 | Yuchao Chen | Yuchao Chen, Jintao Wang, Xiaoqing Wang, and Jian Song | Age of Information Optimization in Multi-Channel Network with Sided
Information | null | null | null | null | cs.IT cs.SI math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We consider a discrete-time multi-channel network where the destination
collects time-sensitive packets from multiple sources with sided channel
information. The popular metric, Age of Information (AoI), is applied to
measure the data freshness at the destination. Due to the interference
constraint, only disjoint sou... | [
{
"created": "Wed, 14 Dec 2022 09:06:05 GMT",
"version": "v1"
}
] | 2022-12-15 | [
[
"Chen",
"Yuchao",
""
],
[
"Wang",
"Jintao",
""
],
[
"Wang",
"Xiaoqing",
""
],
[
"Song",
"Jian",
""
]
] | We consider a discrete-time multi-channel network where the destination collects time-sensitive packets from multiple sources with sided channel information. The popular metric, Age of Information (AoI), is applied to measure the data freshness at the destination. Due to the interference constraint, only disjoint sourc... |
2307.06845 | Vincent Schorp | Vincent Schorp, Will Panitch, Kaushik Shivakumar, Vainavi Viswanath,
Justin Kerr, Yahav Avigal, Danyal M Fer, Lionel Ott, Ken Goldberg | Self-Supervised Learning for Interactive Perception of Surgical Thread
for Autonomous Suture Tail-Shortening | International Conference on Automation Science and Engineering (CASE)
2023, 7 pages | null | null | null | cs.RO cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Accurate 3D sensing of suturing thread is a challenging problem in automated
surgical suturing because of the high state-space complexity, thinness and
deformability of the thread, and possibility of occlusion by the grippers and
tissue. In this work we present a method for tracking surgical thread in 3D
which is rob... | [
{
"created": "Thu, 13 Jul 2023 16:08:03 GMT",
"version": "v1"
}
] | 2023-07-14 | [
[
"Schorp",
"Vincent",
""
],
[
"Panitch",
"Will",
""
],
[
"Shivakumar",
"Kaushik",
""
],
[
"Viswanath",
"Vainavi",
""
],
[
"Kerr",
"Justin",
""
],
[
"Avigal",
"Yahav",
""
],
[
"Fer",
"Danyal M",
""
],
[
... | Accurate 3D sensing of suturing thread is a challenging problem in automated surgical suturing because of the high state-space complexity, thinness and deformability of the thread, and possibility of occlusion by the grippers and tissue. In this work we present a method for tracking surgical thread in 3D which is robus... |
2007.05549 | Alexander Irpan | Janarthanan Rajendran, Alex Irpan, Eric Jang | Meta-Learning Requires Meta-Augmentation | 14 pages, 8 figures. NeurIPS 2020 camera ready. Code at
https://github.com/google-research/google-research/tree/master/meta_augmentation | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Meta-learning algorithms aim to learn two components: a model that predicts
targets for a task, and a base learner that quickly updates that model when
given examples from a new task. This additional level of learning can be
powerful, but it also creates another potential source for overfitting, since
we can now over... | [
{
"created": "Fri, 10 Jul 2020 18:04:04 GMT",
"version": "v1"
},
{
"created": "Wed, 4 Nov 2020 00:03:33 GMT",
"version": "v2"
}
] | 2020-11-05 | [
[
"Rajendran",
"Janarthanan",
""
],
[
"Irpan",
"Alex",
""
],
[
"Jang",
"Eric",
""
]
] | Meta-learning algorithms aim to learn two components: a model that predicts targets for a task, and a base learner that quickly updates that model when given examples from a new task. This additional level of learning can be powerful, but it also creates another potential source for overfitting, since we can now overfi... |
1904.13080 | Qi Wang | Yuan Yuan and Dong Wang and Qi Wang | Memory-Augmented Temporal Dynamic Learning for Action Recognition | The Thirty-Third AAAI Conference on Artificial Intelligence (AAAI-19) | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Human actions captured in video sequences contain two crucial factors for
action recognition, i.e., visual appearance and motion dynamics. To model these
two aspects, Convolutional and Recurrent Neural Networks (CNNs and RNNs) are
adopted in most existing successful methods for recognizing actions. However,
CNN based... | [
{
"created": "Tue, 30 Apr 2019 07:19:50 GMT",
"version": "v1"
}
] | 2019-05-01 | [
[
"Yuan",
"Yuan",
""
],
[
"Wang",
"Dong",
""
],
[
"Wang",
"Qi",
""
]
] | Human actions captured in video sequences contain two crucial factors for action recognition, i.e., visual appearance and motion dynamics. To model these two aspects, Convolutional and Recurrent Neural Networks (CNNs and RNNs) are adopted in most existing successful methods for recognizing actions. However, CNN based m... |
2404.18191 | Yihao Zhang | Chen Cheng, Xinzhi Yu, Haodong Wen, Jingsong Sun, Guanzhang Yue, Yihao
Zhang, Zeming Wei | Exploring the Robustness of In-Context Learning with Noisy Labels | ICLR 2024 Workshop on Reliable and Responsible Foundation Models | null | null | null | cs.CL cs.AI cs.CR cs.LG math.OC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Recently, the mysterious In-Context Learning (ICL) ability exhibited by
Transformer architectures, especially in large language models (LLMs), has
sparked significant research interest. However, the resilience of Transformers'
in-context learning capabilities in the presence of noisy samples, prevalent in
both traini... | [
{
"created": "Sun, 28 Apr 2024 14:05:23 GMT",
"version": "v1"
},
{
"created": "Wed, 1 May 2024 09:15:16 GMT",
"version": "v2"
}
] | 2024-05-02 | [
[
"Cheng",
"Chen",
""
],
[
"Yu",
"Xinzhi",
""
],
[
"Wen",
"Haodong",
""
],
[
"Sun",
"Jingsong",
""
],
[
"Yue",
"Guanzhang",
""
],
[
"Zhang",
"Yihao",
""
],
[
"Wei",
"Zeming",
""
]
] | Recently, the mysterious In-Context Learning (ICL) ability exhibited by Transformer architectures, especially in large language models (LLMs), has sparked significant research interest. However, the resilience of Transformers' in-context learning capabilities in the presence of noisy samples, prevalent in both training... |
1708.04352 | Peter Henderson | Peter Henderson, Wei-Di Chang, Florian Shkurti, Johanna Hansen, David
Meger, Gregory Dudek | Benchmark Environments for Multitask Learning in Continuous Domains | Accepted at Lifelong Learning: A Reinforcement Learning Approach
Workshop @ ICML, Sydney, Australia, 2017 | null | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | As demand drives systems to generalize to various domains and problems, the
study of multitask, transfer and lifelong learning has become an increasingly
important pursuit. In discrete domains, performance on the Atari game suite has
emerged as the de facto benchmark for assessing multitask learning. However, in
cont... | [
{
"created": "Mon, 14 Aug 2017 22:55:03 GMT",
"version": "v1"
}
] | 2017-08-16 | [
[
"Henderson",
"Peter",
""
],
[
"Chang",
"Wei-Di",
""
],
[
"Shkurti",
"Florian",
""
],
[
"Hansen",
"Johanna",
""
],
[
"Meger",
"David",
""
],
[
"Dudek",
"Gregory",
""
]
] | As demand drives systems to generalize to various domains and problems, the study of multitask, transfer and lifelong learning has become an increasingly important pursuit. In discrete domains, performance on the Atari game suite has emerged as the de facto benchmark for assessing multitask learning. However, in contin... |
2309.03084 | Qi Ju | Ju Qi, Ting Feng, Falun Hei, Zhemei Fang, Yunfeng Luo | Pure Monte Carlo Counterfactual Regret Minimization | null | null | null | null | cs.AI cs.GT cs.LG | http://creativecommons.org/licenses/by/4.0/ | Counterfactual Regret Minimization (CFR) and its variants are the best
algorithms so far for solving large-scale incomplete information games.
However, we believe that there are two problems with CFR: First, matrix
multiplication is required in CFR iteration, and the time complexity of one
iteration is too high; Seco... | [
{
"created": "Mon, 4 Sep 2023 09:16:49 GMT",
"version": "v1"
},
{
"created": "Thu, 12 Oct 2023 06:24:33 GMT",
"version": "v2"
},
{
"created": "Fri, 13 Oct 2023 06:01:17 GMT",
"version": "v3"
}
] | 2023-10-16 | [
[
"Qi",
"Ju",
""
],
[
"Feng",
"Ting",
""
],
[
"Hei",
"Falun",
""
],
[
"Fang",
"Zhemei",
""
],
[
"Luo",
"Yunfeng",
""
]
] | Counterfactual Regret Minimization (CFR) and its variants are the best algorithms so far for solving large-scale incomplete information games. However, we believe that there are two problems with CFR: First, matrix multiplication is required in CFR iteration, and the time complexity of one iteration is too high; Second... |
2004.13891 | Jakub Tarnawski | Janardhan Kulkarni, Shi Li, Jakub Tarnawski, Minwei Ye | Hierarchy-Based Algorithms for Minimizing Makespan under Precedence and
Communication Constraints | null | Proc. of ACM-SIAM Symposium on Discrete Algorithms (SODA), 2020,
pages 2770-2789 | 10.1137/1.9781611975994.169 | null | cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We consider the classic problem of scheduling jobs with precedence
constraints on a set of identical machines to minimize the makespan objective
function. Understanding the exact approximability of the problem when the
number of machines is a constant is a well-known question in scheduling theory.
Indeed, an outstand... | [
{
"created": "Tue, 28 Apr 2020 23:28:59 GMT",
"version": "v1"
}
] | 2020-04-30 | [
[
"Kulkarni",
"Janardhan",
""
],
[
"Li",
"Shi",
""
],
[
"Tarnawski",
"Jakub",
""
],
[
"Ye",
"Minwei",
""
]
] | We consider the classic problem of scheduling jobs with precedence constraints on a set of identical machines to minimize the makespan objective function. Understanding the exact approximability of the problem when the number of machines is a constant is a well-known question in scheduling theory. Indeed, an outstandin... |
2111.12217 | Aida Sheshbolouki | Aida Sheshbolouki, M. Tamer \"Ozsu | Scale-Invariant Strength Assortativity of Streaming Butterflies | Submitted for publication | null | null | null | cs.DS cs.DB cs.DM cs.SI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Bipartite graphs are rich data structures with prevalent applications and
identifier structural features. However, less is known about their growth
patterns, particularly in streaming settings. Current works study the patterns
of static or aggregated temporal graphs optimized for certain down-stream
analytics or igno... | [
{
"created": "Wed, 24 Nov 2021 01:24:39 GMT",
"version": "v1"
}
] | 2021-11-25 | [
[
"Sheshbolouki",
"Aida",
""
],
[
"Özsu",
"M. Tamer",
""
]
] | Bipartite graphs are rich data structures with prevalent applications and identifier structural features. However, less is known about their growth patterns, particularly in streaming settings. Current works study the patterns of static or aggregated temporal graphs optimized for certain down-stream analytics or ignori... |
2103.04854 | Mohammadhossein Bahari | Mohammadhossein Bahari, Ismail Nejjar, Alexandre Alahi | Injecting Knowledge in Data-driven Vehicle Trajectory Predictors | Published in Transportation Research: Part C | Transportation Research Part C: Emerging Technologies, 2021 | 10.1016/j.trc.2021.103010 | null | cs.AI cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Vehicle trajectory prediction tasks have been commonly tackled from two
distinct perspectives: either with knowledge-driven methods or more recently
with data-driven ones. On the one hand, we can explicitly implement
domain-knowledge or physical priors such as anticipating that vehicles will
follow the middle of the ... | [
{
"created": "Mon, 8 Mar 2021 16:03:09 GMT",
"version": "v1"
},
{
"created": "Fri, 4 Mar 2022 11:22:45 GMT",
"version": "v2"
}
] | 2022-03-07 | [
[
"Bahari",
"Mohammadhossein",
""
],
[
"Nejjar",
"Ismail",
""
],
[
"Alahi",
"Alexandre",
""
]
] | Vehicle trajectory prediction tasks have been commonly tackled from two distinct perspectives: either with knowledge-driven methods or more recently with data-driven ones. On the one hand, we can explicitly implement domain-knowledge or physical priors such as anticipating that vehicles will follow the middle of the ro... |
2406.18311 | Xingyuan Bu | Yixin Jin, Wenjing Zhou, Meiqi Wang, Meng Li, Xintao Li, Tianyu Hu | Online Learning of Multiple Tasks and Their Relationships : Testing on
Spam Email Data and EEG Signals Recorded in Construction Fields | null | null | null | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper examines an online multi-task learning (OMTL) method, which
processes data sequentially to predict labels across related tasks. The
framework learns task weights and their relatedness concurrently. Unlike
previous models that assumed static task relatedness, our approach treats tasks
as initially independe... | [
{
"created": "Wed, 26 Jun 2024 12:50:13 GMT",
"version": "v1"
},
{
"created": "Sun, 30 Jun 2024 03:49:06 GMT",
"version": "v2"
}
] | 2024-07-10 | [
[
"Jin",
"Yixin",
""
],
[
"Zhou",
"Wenjing",
""
],
[
"Wang",
"Meiqi",
""
],
[
"Li",
"Meng",
""
],
[
"Li",
"Xintao",
""
],
[
"Hu",
"Tianyu",
""
]
] | This paper examines an online multi-task learning (OMTL) method, which processes data sequentially to predict labels across related tasks. The framework learns task weights and their relatedness concurrently. Unlike previous models that assumed static task relatedness, our approach treats tasks as initially independent... |
2305.15383 | Emmanuel Esposito | Khaled Eldowa, Emmanuel Esposito, Tommaso Cesari, Nicol\`o
Cesa-Bianchi | On the Minimax Regret for Online Learning with Feedback Graphs | null | null | null | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this work, we improve on the upper and lower bounds for the regret of
online learning with strongly observable undirected feedback graphs. The best
known upper bound for this problem is $\mathcal{O}\bigl(\sqrt{\alpha T\ln
K}\bigr)$, where $K$ is the number of actions, $\alpha$ is the independence
number of the gra... | [
{
"created": "Wed, 24 May 2023 17:40:57 GMT",
"version": "v1"
},
{
"created": "Sat, 28 Oct 2023 14:11:51 GMT",
"version": "v2"
}
] | 2023-10-31 | [
[
"Eldowa",
"Khaled",
""
],
[
"Esposito",
"Emmanuel",
""
],
[
"Cesari",
"Tommaso",
""
],
[
"Cesa-Bianchi",
"Nicolò",
""
]
] | In this work, we improve on the upper and lower bounds for the regret of online learning with strongly observable undirected feedback graphs. The best known upper bound for this problem is $\mathcal{O}\bigl(\sqrt{\alpha T\ln K}\bigr)$, where $K$ is the number of actions, $\alpha$ is the independence number of the graph... |
2401.03142 | Liangtao Shi | Liangtao Shi, Bineng Zhong, Qihua Liang, Ning Li, Shengping Zhang,
Xianxian Li | Explicit Visual Prompts for Visual Object Tracking | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | How to effectively exploit spatio-temporal information is crucial to capture
target appearance changes in visual tracking. However, most deep learning-based
trackers mainly focus on designing a complicated appearance model or template
updating strategy, while lacking the exploitation of context between
consecutive fr... | [
{
"created": "Sat, 6 Jan 2024 07:12:07 GMT",
"version": "v1"
}
] | 2024-01-09 | [
[
"Shi",
"Liangtao",
""
],
[
"Zhong",
"Bineng",
""
],
[
"Liang",
"Qihua",
""
],
[
"Li",
"Ning",
""
],
[
"Zhang",
"Shengping",
""
],
[
"Li",
"Xianxian",
""
]
] | How to effectively exploit spatio-temporal information is crucial to capture target appearance changes in visual tracking. However, most deep learning-based trackers mainly focus on designing a complicated appearance model or template updating strategy, while lacking the exploitation of context between consecutive fram... |
1806.01976 | YangQuan Chen Prof. | Sina Dehghan, Tiebiao Zhao, Yang Zhao, Jie Yuan, Abdullah Ates,
YangQuan Chen | PID2018 Benchmark Challenge: Model Predictive Control With Conditional
Integral Control Using A General Purpose Optimal Control Problem Solver -
RIOTS | 6 pages, 7 figures, 3rd IFAC Conference on Advances in
Proportional-Integral-Derivative Control | null | null | null | cs.SY math.OC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper presents a multi-variable Model Predictive Control (MPC) based
controller for the one-staged refrigeration cycle model described in the
PID2018 Benchmark Challenge. This model represents a two-input, two-output
system with strong nonlinearities and high coupling between its variables. A
general purpose opt... | [
{
"created": "Wed, 6 Jun 2018 01:55:02 GMT",
"version": "v1"
}
] | 2018-06-07 | [
[
"Dehghan",
"Sina",
""
],
[
"Zhao",
"Tiebiao",
""
],
[
"Zhao",
"Yang",
""
],
[
"Yuan",
"Jie",
""
],
[
"Ates",
"Abdullah",
""
],
[
"Chen",
"YangQuan",
""
]
] | This paper presents a multi-variable Model Predictive Control (MPC) based controller for the one-staged refrigeration cycle model described in the PID2018 Benchmark Challenge. This model represents a two-input, two-output system with strong nonlinearities and high coupling between its variables. A general purpose optim... |
2406.03820 | Thai-Hoc Vu | Ons Aouedi, Thai-Hoc Vu, Alessio Sacco, Dinh C. Nguyen, Kandaraj
Piamrat, Guido Marchetto, Quoc-Viet Pham | A Survey on Intelligent Internet of Things: Applications, Security,
Privacy, and Future Directions | This work has been accepted by IEEE Communications Surveys &
Tutorials | null | null | null | cs.NI cs.AI cs.CR cs.ET cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The rapid advances in the Internet of Things (IoT) have promoted a revolution
in communication technology and offered various customer services. Artificial
intelligence (AI) techniques have been exploited to facilitate IoT operations
and maximize their potential in modern application scenarios. In particular,
the con... | [
{
"created": "Thu, 6 Jun 2024 07:55:30 GMT",
"version": "v1"
},
{
"created": "Fri, 21 Jun 2024 14:43:41 GMT",
"version": "v2"
}
] | 2024-06-24 | [
[
"Aouedi",
"Ons",
""
],
[
"Vu",
"Thai-Hoc",
""
],
[
"Sacco",
"Alessio",
""
],
[
"Nguyen",
"Dinh C.",
""
],
[
"Piamrat",
"Kandaraj",
""
],
[
"Marchetto",
"Guido",
""
],
[
"Pham",
"Quoc-Viet",
""
]
] | The rapid advances in the Internet of Things (IoT) have promoted a revolution in communication technology and offered various customer services. Artificial intelligence (AI) techniques have been exploited to facilitate IoT operations and maximize their potential in modern application scenarios. In particular, the conve... |
2111.13307 | Zijian Wang | Zijian Wang, Xingqun Qi, Kun Yuan, Muyi Sun | Self-supervised Correlation Mining Network for Person Image Generation | null | A modified version compared with CVPR2022 version | null | null | cs.CV | http://creativecommons.org/publicdomain/zero/1.0/ | Person image generation aims to perform non-rigid deformation on source
images, which generally requires unaligned data pairs for training. Recently,
self-supervised methods express great prospects in this task by merging the
disentangled representations for self-reconstruction. However, such methods
fail to exploit ... | [
{
"created": "Fri, 26 Nov 2021 03:57:46 GMT",
"version": "v1"
},
{
"created": "Mon, 29 Nov 2021 08:25:03 GMT",
"version": "v2"
},
{
"created": "Wed, 14 Dec 2022 07:27:54 GMT",
"version": "v3"
}
] | 2022-12-15 | [
[
"Wang",
"Zijian",
""
],
[
"Qi",
"Xingqun",
""
],
[
"Yuan",
"Kun",
""
],
[
"Sun",
"Muyi",
""
]
] | Person image generation aims to perform non-rigid deformation on source images, which generally requires unaligned data pairs for training. Recently, self-supervised methods express great prospects in this task by merging the disentangled representations for self-reconstruction. However, such methods fail to exploit th... |
2201.08659 | Mads Lindskou | Mads Lindskou, Torben Tvedebrink, Poul Svante Eriksen, S{\o}ren
H{\o}jsgaard and Niels Morling | Unity Smoothing for Handling Inconsistent Evidence in Bayesian Networks
and Unity Propagation for Faster Inference | null | null | null | null | cs.LG stat.CO | http://creativecommons.org/licenses/by/4.0/ | We propose Unity Smoothing (US) for handling inconsistencies between a
Bayesian network model and new unseen observations. We show that prediction
accuracy, using the junction tree algorithm with US is comparable to that of
Laplace smoothing. Moreover, in applications were sparsity of the data
structures is utilized,... | [
{
"created": "Fri, 21 Jan 2022 12:03:45 GMT",
"version": "v1"
}
] | 2022-01-24 | [
[
"Lindskou",
"Mads",
""
],
[
"Tvedebrink",
"Torben",
""
],
[
"Eriksen",
"Poul Svante",
""
],
[
"Højsgaard",
"Søren",
""
],
[
"Morling",
"Niels",
""
]
] | We propose Unity Smoothing (US) for handling inconsistencies between a Bayesian network model and new unseen observations. We show that prediction accuracy, using the junction tree algorithm with US is comparable to that of Laplace smoothing. Moreover, in applications were sparsity of the data structures is utilized, U... |
2401.09885 | Jorge Martinez Gil Ph.D. | Jorge Martinez-Gil | Source Code Clone Detection Using Unsupervised Similarity Measures | Accepted for publication as Full Paper in the Software Quality Days
2024, Vienna, Austria | null | 10.1007/978-3-031-56281-5_2 | null | cs.SE cs.IR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Assessing similarity in source code has gained significant attention in
recent years due to its importance in software engineering tasks such as clone
detection and code search and recommendation. This work presents a comparative
analysis of unsupervised similarity measures for identifying source code clone
detection... | [
{
"created": "Thu, 18 Jan 2024 10:56:27 GMT",
"version": "v1"
},
{
"created": "Fri, 19 Jan 2024 07:23:04 GMT",
"version": "v2"
},
{
"created": "Tue, 6 Feb 2024 15:09:13 GMT",
"version": "v3"
}
] | 2024-08-13 | [
[
"Martinez-Gil",
"Jorge",
""
]
] | Assessing similarity in source code has gained significant attention in recent years due to its importance in software engineering tasks such as clone detection and code search and recommendation. This work presents a comparative analysis of unsupervised similarity measures for identifying source code clone detection. ... |
2305.13235 | Oana-Maria Camburu | Jesus Solano, Mardhiyah Sanni, Oana-Maria Camburu, Pasquale Minervini | SPARSEFIT: Few-shot Prompting with Sparse Fine-tuning for Jointly
Generating Predictions and Natural Language Explanations | null | ACL 2024 | null | null | cs.CL cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Models that generate natural language explanations (NLEs) for their
predictions have recently gained increasing interest. However, this approach
usually demands large datasets of human-written NLEs for the ground-truth
answers at training time, which can be expensive and potentially infeasible for
some applications. ... | [
{
"created": "Mon, 22 May 2023 17:06:41 GMT",
"version": "v1"
},
{
"created": "Tue, 23 May 2023 09:26:37 GMT",
"version": "v2"
},
{
"created": "Sun, 11 Aug 2024 11:43:23 GMT",
"version": "v3"
}
] | 2024-08-13 | [
[
"Solano",
"Jesus",
""
],
[
"Sanni",
"Mardhiyah",
""
],
[
"Camburu",
"Oana-Maria",
""
],
[
"Minervini",
"Pasquale",
""
]
] | Models that generate natural language explanations (NLEs) for their predictions have recently gained increasing interest. However, this approach usually demands large datasets of human-written NLEs for the ground-truth answers at training time, which can be expensive and potentially infeasible for some applications. Wh... |
2104.04916 | Xutan Peng | Xutan Peng, Chenghua Lin, Mark Stevenson | Cross-Lingual Word Embedding Refinement by $\ell_{1}$ Norm Optimisation | To appear at NAACL 2021 | NAACL-HLT 2021 | 10.18653/v1/2021.naacl-main.214 | null | cs.CL cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Cross-Lingual Word Embeddings (CLWEs) encode words from two or more languages
in a shared high-dimensional space in which vectors representing words with
similar meaning (regardless of language) are closely located. Existing methods
for building high-quality CLWEs learn mappings that minimise the $\ell_{2}$
norm loss... | [
{
"created": "Sun, 11 Apr 2021 04:37:54 GMT",
"version": "v1"
}
] | 2022-01-25 | [
[
"Peng",
"Xutan",
""
],
[
"Lin",
"Chenghua",
""
],
[
"Stevenson",
"Mark",
""
]
] | Cross-Lingual Word Embeddings (CLWEs) encode words from two or more languages in a shared high-dimensional space in which vectors representing words with similar meaning (regardless of language) are closely located. Existing methods for building high-quality CLWEs learn mappings that minimise the $\ell_{2}$ norm loss f... |
2302.08510 | Ting-Hsuan Liao | Ting-Hsuan Liao, Songwei Ge, Yiran Xu, Yao-Chih Lee, Badour AlBahar
and Jia-Bin Huang | Text-driven Visual Synthesis with Latent Diffusion Prior | Project website: https://latent-diffusion-prior.github.io/ | null | null | null | cs.CV | http://creativecommons.org/licenses/by/4.0/ | There has been tremendous progress in large-scale text-to-image synthesis
driven by diffusion models enabling versatile downstream applications such as
3D object synthesis from texts, image editing, and customized generation. We
present a generic approach using latent diffusion models as powerful image
priors for var... | [
{
"created": "Thu, 16 Feb 2023 18:59:58 GMT",
"version": "v1"
},
{
"created": "Mon, 3 Apr 2023 18:15:48 GMT",
"version": "v2"
}
] | 2023-04-05 | [
[
"Liao",
"Ting-Hsuan",
""
],
[
"Ge",
"Songwei",
""
],
[
"Xu",
"Yiran",
""
],
[
"Lee",
"Yao-Chih",
""
],
[
"AlBahar",
"Badour",
""
],
[
"Huang",
"Jia-Bin",
""
]
] | There has been tremendous progress in large-scale text-to-image synthesis driven by diffusion models enabling versatile downstream applications such as 3D object synthesis from texts, image editing, and customized generation. We present a generic approach using latent diffusion models as powerful image priors for vario... |
2307.16650 | Yong Zheng | Yong Zheng | ChatGPT for Teaching and Learning: An Experience from Data Science
Education | null | null | 10.1145/3585059.3611431 | null | cs.CY | http://creativecommons.org/licenses/by-nc-nd/4.0/ | ChatGPT, an implementation and application of large language models, has
gained significant popularity since its initial release. Researchers have been
exploring ways to harness the practical benefits of ChatGPT in real-world
scenarios. Educational researchers have investigated its potential in various
subjects, e.g.... | [
{
"created": "Mon, 31 Jul 2023 13:31:19 GMT",
"version": "v1"
}
] | 2023-08-01 | [
[
"Zheng",
"Yong",
""
]
] | ChatGPT, an implementation and application of large language models, has gained significant popularity since its initial release. Researchers have been exploring ways to harness the practical benefits of ChatGPT in real-world scenarios. Educational researchers have investigated its potential in various subjects, e.g., ... |
1902.06656 | Xavier Coiteux-Roy | Xavier Coiteux-Roy and Stefan Wolf | Proving Erasure | 5 pages, 3 figures | null | 10.1109/ISIT.2019.8849661 | null | cs.CR quant-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | It seems impossible to certify that a remote hosting service does not leak
its users' data --- or does quantum mechanics make it possible? We investigate
if a server hosting data can information-theoretically prove its definite
deletion using a "BB84-like" protocol. To do so, we first rigorously introduce
an alternat... | [
{
"created": "Mon, 18 Feb 2019 17:23:52 GMT",
"version": "v1"
},
{
"created": "Fri, 3 May 2019 08:55:15 GMT",
"version": "v2"
}
] | 2020-01-15 | [
[
"Coiteux-Roy",
"Xavier",
""
],
[
"Wolf",
"Stefan",
""
]
] | It seems impossible to certify that a remote hosting service does not leak its users' data --- or does quantum mechanics make it possible? We investigate if a server hosting data can information-theoretically prove its definite deletion using a "BB84-like" protocol. To do so, we first rigorously introduce an alternativ... |
2210.06242 | Sang-Hyun Je | Sang-Hyun Je | Entity Aware Negative Sampling with Auxiliary Loss of False Negative
Prediction for Knowledge Graph Embedding | null | null | null | null | cs.LG cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Knowledge graph (KG) embedding is widely used in many downstream applications
using KGs. Generally, since KGs contain only ground truth triples, it is
necessary to construct arbitrary negative samples for representation learning
of KGs. Recently, various methods for sampling high-quality negatives have been
studied b... | [
{
"created": "Wed, 12 Oct 2022 14:27:51 GMT",
"version": "v1"
}
] | 2022-10-13 | [
[
"Je",
"Sang-Hyun",
""
]
] | Knowledge graph (KG) embedding is widely used in many downstream applications using KGs. Generally, since KGs contain only ground truth triples, it is necessary to construct arbitrary negative samples for representation learning of KGs. Recently, various methods for sampling high-quality negatives have been studied bec... |
2104.14679 | Harshayu Girase | Harshayu Girase, Jerrick Hoang, Sai Yalamanchi, and Micol
Marchetti-Bowick | Physically Feasible Vehicle Trajectory Prediction | null | null | null | null | cs.RO cs.CV | http://creativecommons.org/licenses/by/4.0/ | Predicting the future motion of actors in a traffic scene is a crucial part
of any autonomous driving system. Recent research in this area has focused on
trajectory prediction approaches that optimize standard trajectory error
metrics. In this work, we describe three important properties -- physical
realism guarantee... | [
{
"created": "Thu, 29 Apr 2021 22:13:41 GMT",
"version": "v1"
}
] | 2021-05-03 | [
[
"Girase",
"Harshayu",
""
],
[
"Hoang",
"Jerrick",
""
],
[
"Yalamanchi",
"Sai",
""
],
[
"Marchetti-Bowick",
"Micol",
""
]
] | Predicting the future motion of actors in a traffic scene is a crucial part of any autonomous driving system. Recent research in this area has focused on trajectory prediction approaches that optimize standard trajectory error metrics. In this work, we describe three important properties -- physical realism guarantees,... |
2103.14475 | Jianyuan Guo | Jianyuan Guo, Kai Han, Yunhe Wang, Han Wu, Xinghao Chen, Chunjing Xu
and Chang Xu | Distilling Object Detectors via Decoupled Features | Accepted in CVPR 2021 | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Knowledge distillation is a widely used paradigm for inheriting information
from a complicated teacher network to a compact student network and maintaining
the strong performance. Different from image classification, object detectors
are much more sophisticated with multiple loss functions in which features that
sema... | [
{
"created": "Fri, 26 Mar 2021 13:58:49 GMT",
"version": "v1"
}
] | 2021-03-29 | [
[
"Guo",
"Jianyuan",
""
],
[
"Han",
"Kai",
""
],
[
"Wang",
"Yunhe",
""
],
[
"Wu",
"Han",
""
],
[
"Chen",
"Xinghao",
""
],
[
"Xu",
"Chunjing",
""
],
[
"Xu",
"Chang",
""
]
] | Knowledge distillation is a widely used paradigm for inheriting information from a complicated teacher network to a compact student network and maintaining the strong performance. Different from image classification, object detectors are much more sophisticated with multiple loss functions in which features that semant... |
1803.05849 | Renzo Andri | Andrawes Al Bahou, Geethan Karunaratne, Renzo Andri, Lukas Cavigelli,
Luca Benini | XNORBIN: A 95 TOp/s/W Hardware Accelerator for Binary Convolutional
Neural Networks | null | null | null | null | cs.CV cs.AI cs.AR cs.NE eess.IV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Deploying state-of-the-art CNNs requires power-hungry processors and off-chip
memory. This precludes the implementation of CNNs in low-power embedded
systems. Recent research shows CNNs sustain extreme quantization, binarizing
their weights and intermediate feature maps, thereby saving 8-32\x memory and
collapsing en... | [
{
"created": "Mon, 5 Mar 2018 15:41:28 GMT",
"version": "v1"
}
] | 2018-09-12 | [
[
"Bahou",
"Andrawes Al",
""
],
[
"Karunaratne",
"Geethan",
""
],
[
"Andri",
"Renzo",
""
],
[
"Cavigelli",
"Lukas",
""
],
[
"Benini",
"Luca",
""
]
] | Deploying state-of-the-art CNNs requires power-hungry processors and off-chip memory. This precludes the implementation of CNNs in low-power embedded systems. Recent research shows CNNs sustain extreme quantization, binarizing their weights and intermediate feature maps, thereby saving 8-32\x memory and collapsing ener... |
1905.00134 | Maximilian Haas-Heger | Maximilian Haas-Heger and Matei Ciocarlie | Accurate Energetic Constraints for Passive Grasp Stability Analysis | 18 pages, 13 figures, 2 tables, 1 algorithm | null | 10.1109/TRO.2020.2974108 | null | cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Passive reaction effects in grasp stability analysis occur when the contact
forces and joint torques applied by a grasp change in response to external
disturbances applied to the grasped object. For example, nonbackdrivable
actuators (e.g. highly geared servos) will passively resist external
disturbances without an a... | [
{
"created": "Tue, 30 Apr 2019 23:27:04 GMT",
"version": "v1"
},
{
"created": "Mon, 10 Jun 2019 22:04:58 GMT",
"version": "v2"
},
{
"created": "Mon, 18 Nov 2019 21:08:42 GMT",
"version": "v3"
},
{
"created": "Thu, 9 Jul 2020 03:02:38 GMT",
"version": "v4"
}
] | 2020-07-10 | [
[
"Haas-Heger",
"Maximilian",
""
],
[
"Ciocarlie",
"Matei",
""
]
] | Passive reaction effects in grasp stability analysis occur when the contact forces and joint torques applied by a grasp change in response to external disturbances applied to the grasped object. For example, nonbackdrivable actuators (e.g. highly geared servos) will passively resist external disturbances without an act... |
2307.08187 | Hiroki Naganuma | Hiroki Naganuma, Ryuichiro Hataya, Ioannis Mitliagkas | An Empirical Study of Pre-trained Model Selection for
Out-of-Distribution Generalization and Calibration | null | null | null | null | cs.LG cs.AI | http://creativecommons.org/licenses/by/4.0/ | In out-of-distribution (OOD) generalization tasks, fine-tuning pre-trained
models has become a prevalent strategy. Different from most prior work that has
focused on advancing learning algorithms, we systematically examined how
pre-trained model size, pre-training dataset size, and training strategies
impact generali... | [
{
"created": "Mon, 17 Jul 2023 01:27:10 GMT",
"version": "v1"
},
{
"created": "Mon, 20 Nov 2023 02:22:22 GMT",
"version": "v2"
},
{
"created": "Thu, 30 May 2024 23:30:02 GMT",
"version": "v3"
}
] | 2024-06-03 | [
[
"Naganuma",
"Hiroki",
""
],
[
"Hataya",
"Ryuichiro",
""
],
[
"Mitliagkas",
"Ioannis",
""
]
] | In out-of-distribution (OOD) generalization tasks, fine-tuning pre-trained models has become a prevalent strategy. Different from most prior work that has focused on advancing learning algorithms, we systematically examined how pre-trained model size, pre-training dataset size, and training strategies impact generaliza... |
2004.03954 | Jian-Jia Weng | Jian-Jia Weng, Fady Alajaji, and Tam\'as Linder | A Simple Capacity Outer Bound for Two-Way Channels and Capacity
Approximation Results | an error in Eq. (2) corrected | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Channel symmetry properties that imply the tightness of Shannon's random
coding inner bound have recently been used to determine the capacity region of
discrete-memoryless two-way channels (DM-TWCs). For channels without such
symmetry properties, outer bounds are often needed to estimate the capacity
region. However,... | [
{
"created": "Wed, 8 Apr 2020 12:01:09 GMT",
"version": "v1"
},
{
"created": "Wed, 12 Aug 2020 13:26:56 GMT",
"version": "v2"
},
{
"created": "Thu, 24 Sep 2020 21:26:05 GMT",
"version": "v3"
}
] | 2020-09-28 | [
[
"Weng",
"Jian-Jia",
""
],
[
"Alajaji",
"Fady",
""
],
[
"Linder",
"Tamás",
""
]
] | Channel symmetry properties that imply the tightness of Shannon's random coding inner bound have recently been used to determine the capacity region of discrete-memoryless two-way channels (DM-TWCs). For channels without such symmetry properties, outer bounds are often needed to estimate the capacity region. However, v... |
2312.09058 | Yixuan Even Xu | Yixuan Even Xu, Chun Kai Ling, Fei Fang | Learning Coalition Structures with Games | 13 pages, 4 figures, 3 tables, aaai 2024 | null | null | null | cs.GT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Coalitions naturally exist in many real-world systems involving multiple
decision makers such as ridesharing, security, and online ad auctions, but the
coalition structure among the agents is often unknown. We propose and study an
important yet previously overseen problem -- Coalition Structure Learning
(CSL), where ... | [
{
"created": "Thu, 14 Dec 2023 15:54:55 GMT",
"version": "v1"
},
{
"created": "Tue, 19 Dec 2023 02:54:23 GMT",
"version": "v2"
}
] | 2023-12-20 | [
[
"Xu",
"Yixuan Even",
""
],
[
"Ling",
"Chun Kai",
""
],
[
"Fang",
"Fei",
""
]
] | Coalitions naturally exist in many real-world systems involving multiple decision makers such as ridesharing, security, and online ad auctions, but the coalition structure among the agents is often unknown. We propose and study an important yet previously overseen problem -- Coalition Structure Learning (CSL), where we... |
2002.06987 | Wei Deng | Wei Deng and Junwei Pan and Tian Zhou and Deguang Kong and Aaron
Flores and Guang Lin | DeepLight: Deep Lightweight Feature Interactions for Accelerating CTR
Predictions in Ad Serving | Accepted by WSDM 2021; Source code:
https://github.com/WayneDW/DeepLight_Deep-Lightweight-Feature-Interactions | null | null | null | cs.LG cs.IR stat.AP stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Click-through rate (CTR) prediction is a crucial task in online display
advertising. The embedding-based neural networks have been proposed to learn
both explicit feature interactions through a shallow component and deep feature
interactions using a deep neural network (DNN) component. These sophisticated
models, how... | [
{
"created": "Mon, 17 Feb 2020 14:51:31 GMT",
"version": "v1"
},
{
"created": "Tue, 18 Aug 2020 01:46:08 GMT",
"version": "v2"
},
{
"created": "Wed, 6 Jan 2021 22:13:51 GMT",
"version": "v3"
}
] | 2021-01-08 | [
[
"Deng",
"Wei",
""
],
[
"Pan",
"Junwei",
""
],
[
"Zhou",
"Tian",
""
],
[
"Kong",
"Deguang",
""
],
[
"Flores",
"Aaron",
""
],
[
"Lin",
"Guang",
""
]
] | Click-through rate (CTR) prediction is a crucial task in online display advertising. The embedding-based neural networks have been proposed to learn both explicit feature interactions through a shallow component and deep feature interactions using a deep neural network (DNN) component. These sophisticated models, howev... |
1806.01830 | Adam Santoro | Vinicius Zambaldi, David Raposo, Adam Santoro, Victor Bapst, Yujia Li,
Igor Babuschkin, Karl Tuyls, David Reichert, Timothy Lillicrap, Edward
Lockhart, Murray Shanahan, Victoria Langston, Razvan Pascanu, Matthew
Botvinick, Oriol Vinyals, Peter Battaglia | Relational Deep Reinforcement Learning | null | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We introduce an approach for deep reinforcement learning (RL) that improves
upon the efficiency, generalization capacity, and interpretability of
conventional approaches through structured perception and relational reasoning.
It uses self-attention to iteratively reason about the relations between
entities in a scene... | [
{
"created": "Tue, 5 Jun 2018 17:39:12 GMT",
"version": "v1"
},
{
"created": "Thu, 28 Jun 2018 14:59:32 GMT",
"version": "v2"
}
] | 2018-06-29 | [
[
"Zambaldi",
"Vinicius",
""
],
[
"Raposo",
"David",
""
],
[
"Santoro",
"Adam",
""
],
[
"Bapst",
"Victor",
""
],
[
"Li",
"Yujia",
""
],
[
"Babuschkin",
"Igor",
""
],
[
"Tuyls",
"Karl",
""
],
[
"Reiche... | We introduce an approach for deep reinforcement learning (RL) that improves upon the efficiency, generalization capacity, and interpretability of conventional approaches through structured perception and relational reasoning. It uses self-attention to iteratively reason about the relations between entities in a scene a... |
2207.12764 | Anahita Farhang Ghahfarokhi | Anahita Farhang Ghahfarokhi, Fatemeh Akoochekian, Fareed Zandkarimi,
Wil M.P. van der Aalst | Clustering Object-Centric Event Logs | null | null | null | null | cs.AI | http://creativecommons.org/licenses/by/4.0/ | Process mining provides various algorithms to analyze process executions
based on event data. Process discovery, the most prominent category of process
mining techniques, aims to discover process models from event logs, however, it
leads to spaghetti models when working with real-life data. Therefore, several
cluster... | [
{
"created": "Tue, 26 Jul 2022 09:16:39 GMT",
"version": "v1"
}
] | 2022-07-27 | [
[
"Ghahfarokhi",
"Anahita Farhang",
""
],
[
"Akoochekian",
"Fatemeh",
""
],
[
"Zandkarimi",
"Fareed",
""
],
[
"van der Aalst",
"Wil M. P.",
""
]
] | Process mining provides various algorithms to analyze process executions based on event data. Process discovery, the most prominent category of process mining techniques, aims to discover process models from event logs, however, it leads to spaghetti models when working with real-life data. Therefore, several clusterin... |
2011.06825 | Md Saif Hassan Onim | Md. Saif Hassan Onim, Aiman Rafeed Ehtesham, Amreen Anbar, A. K. M.
Nazrul Islam, A. K. M. Mahbubur Rahman | LULC classification by semantic segmentation of satellite images using
FastFCN | null | null | 10.1109/ICAICT51780.2020.9333522 | null | cs.CV cs.LG | http://creativecommons.org/licenses/by/4.0/ | This paper analyses how well a Fast Fully Convolutional Network (FastFCN)
semantically segments satellite images and thus classifies Land Use/Land
Cover(LULC) classes. Fast-FCN was used on Gaofen-2 Image Dataset (GID-2) to
segment them in five different classes: BuiltUp, Meadow, Farmland, Water and
Forest. The result... | [
{
"created": "Fri, 13 Nov 2020 09:33:03 GMT",
"version": "v1"
},
{
"created": "Thu, 3 Dec 2020 19:50:31 GMT",
"version": "v2"
}
] | 2022-02-25 | [
[
"Onim",
"Md. Saif Hassan",
""
],
[
"Ehtesham",
"Aiman Rafeed",
""
],
[
"Anbar",
"Amreen",
""
],
[
"Islam",
"A. K. M. Nazrul",
""
],
[
"Rahman",
"A. K. M. Mahbubur",
""
]
] | This paper analyses how well a Fast Fully Convolutional Network (FastFCN) semantically segments satellite images and thus classifies Land Use/Land Cover(LULC) classes. Fast-FCN was used on Gaofen-2 Image Dataset (GID-2) to segment them in five different classes: BuiltUp, Meadow, Farmland, Water and Forest. The results ... |
2103.06352 | Kevin Lybarger | Kevin Lybarger, Linzee Mabrey, Matthew Thau, Pavan K. Bhatraju, Mark
Wurfel, Meliha Yetisgen | Identifying ARDS using the Hierarchical Attention Network with Sentence
Objectives Framework | null | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Acute respiratory distress syndrome (ARDS) is a life-threatening condition
that is often undiagnosed or diagnosed late. ARDS is especially prominent in
those infected with COVID-19. We explore the automatic identification of ARDS
indicators and confounding factors in free-text chest radiograph reports. We
present a n... | [
{
"created": "Wed, 10 Mar 2021 21:50:11 GMT",
"version": "v1"
}
] | 2021-03-12 | [
[
"Lybarger",
"Kevin",
""
],
[
"Mabrey",
"Linzee",
""
],
[
"Thau",
"Matthew",
""
],
[
"Bhatraju",
"Pavan K.",
""
],
[
"Wurfel",
"Mark",
""
],
[
"Yetisgen",
"Meliha",
""
]
] | Acute respiratory distress syndrome (ARDS) is a life-threatening condition that is often undiagnosed or diagnosed late. ARDS is especially prominent in those infected with COVID-19. We explore the automatic identification of ARDS indicators and confounding factors in free-text chest radiograph reports. We present a new... |
1909.06872 | Gilad Cohen | Gilad Cohen, Guillermo Sapiro, Raja Giryes | Detecting Adversarial Samples Using Influence Functions and Nearest
Neighbors | Paper accepted to CVPR 2020 | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Deep neural networks (DNNs) are notorious for their vulnerability to
adversarial attacks, which are small perturbations added to their input images
to mislead their prediction. Detection of adversarial examples is, therefore, a
fundamental requirement for robust classification frameworks. In this work, we
present a m... | [
{
"created": "Sun, 15 Sep 2019 20:07:48 GMT",
"version": "v1"
},
{
"created": "Thu, 19 Mar 2020 10:41:34 GMT",
"version": "v2"
}
] | 2020-03-20 | [
[
"Cohen",
"Gilad",
""
],
[
"Sapiro",
"Guillermo",
""
],
[
"Giryes",
"Raja",
""
]
] | Deep neural networks (DNNs) are notorious for their vulnerability to adversarial attacks, which are small perturbations added to their input images to mislead their prediction. Detection of adversarial examples is, therefore, a fundamental requirement for robust classification frameworks. In this work, we present a met... |
2406.11880 | Jason Martin | Jason Martin, Kenneth Yeung | Knowledge Return Oriented Prompting (KROP) | null | null | null | null | cs.CR cs.LG | http://creativecommons.org/licenses/by-sa/4.0/ | Many Large Language Models (LLMs) and LLM-powered apps deployed today use
some form of prompt filter or alignment to protect their integrity. However,
these measures aren't foolproof. This paper introduces KROP, a prompt injection
technique capable of obfuscating prompt injection attacks, rendering them
virtually und... | [
{
"created": "Tue, 11 Jun 2024 23:58:37 GMT",
"version": "v1"
}
] | 2024-06-19 | [
[
"Martin",
"Jason",
""
],
[
"Yeung",
"Kenneth",
""
]
] | Many Large Language Models (LLMs) and LLM-powered apps deployed today use some form of prompt filter or alignment to protect their integrity. However, these measures aren't foolproof. This paper introduces KROP, a prompt injection technique capable of obfuscating prompt injection attacks, rendering them virtually undet... |
2312.10616 | Sijie Wang | Sijie Wang, Rui She, Qiyu Kang, Xingchao Jian, Kai Zhao, Yang Song,
Wee Peng Tay | DistilVPR: Cross-Modal Knowledge Distillation for Visual Place
Recognition | Accepted by AAAI 2024 | null | null | null | cs.CV | http://creativecommons.org/licenses/by/4.0/ | The utilization of multi-modal sensor data in visual place recognition (VPR)
has demonstrated enhanced performance compared to single-modal counterparts.
Nonetheless, integrating additional sensors comes with elevated costs and may
not be feasible for systems that demand lightweight operation, thereby
impacting the p... | [
{
"created": "Sun, 17 Dec 2023 05:59:06 GMT",
"version": "v1"
}
] | 2023-12-19 | [
[
"Wang",
"Sijie",
""
],
[
"She",
"Rui",
""
],
[
"Kang",
"Qiyu",
""
],
[
"Jian",
"Xingchao",
""
],
[
"Zhao",
"Kai",
""
],
[
"Song",
"Yang",
""
],
[
"Tay",
"Wee Peng",
""
]
] | The utilization of multi-modal sensor data in visual place recognition (VPR) has demonstrated enhanced performance compared to single-modal counterparts. Nonetheless, integrating additional sensors comes with elevated costs and may not be feasible for systems that demand lightweight operation, thereby impacting the pra... |
2011.07542 | Ina Kodrasi | I. Kodrasi and M. Pernon and M. Laganaro and H. Bourlard | Automatic and perceptual discrimination between dysarthria, apraxia of
speech, and neurotypical speech | ICASSP 2021 | null | null | null | cs.SD eess.AS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Automatic techniques in the context of motor speech disorders (MSDs) are
typically two-class techniques aiming to discriminate between dysarthria and
neurotypical speech or between dysarthria and apraxia of speech (AoS). Further,
although such techniques are proposed to support the perceptual assessment of
clinicians... | [
{
"created": "Sun, 15 Nov 2020 14:48:28 GMT",
"version": "v1"
},
{
"created": "Mon, 8 Feb 2021 12:16:22 GMT",
"version": "v2"
},
{
"created": "Wed, 2 Jun 2021 08:36:58 GMT",
"version": "v3"
}
] | 2021-06-03 | [
[
"Kodrasi",
"I.",
""
],
[
"Pernon",
"M.",
""
],
[
"Laganaro",
"M.",
""
],
[
"Bourlard",
"H.",
""
]
] | Automatic techniques in the context of motor speech disorders (MSDs) are typically two-class techniques aiming to discriminate between dysarthria and neurotypical speech or between dysarthria and apraxia of speech (AoS). Further, although such techniques are proposed to support the perceptual assessment of clinicians, ... |
1407.6989 | Benjamin Schweinhart | Benjamin Schweinhart, Jeremy Mason, and Robert MacPherson | Topological Similarity of Random Cell Complexes and Applications | null | Phys. Rev. E 93, 062111 (2016) | 10.1103/PhysRevE.93.062111 | null | cs.CG cond-mat.mtrl-sci | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Although random cell complexes occur throughout the physical sciences, there
does not appear to be a standard way to quantify their statistical similarities
and differences. The various proposals in the literature are usually motivated
by the analysis of particular physical systems and do not necessarily apply to
gen... | [
{
"created": "Fri, 25 Jul 2014 17:52:41 GMT",
"version": "v1"
},
{
"created": "Mon, 4 Jan 2016 22:23:32 GMT",
"version": "v2"
}
] | 2016-06-15 | [
[
"Schweinhart",
"Benjamin",
""
],
[
"Mason",
"Jeremy",
""
],
[
"MacPherson",
"Robert",
""
]
] | Although random cell complexes occur throughout the physical sciences, there does not appear to be a standard way to quantify their statistical similarities and differences. The various proposals in the literature are usually motivated by the analysis of particular physical systems and do not necessarily apply to gener... |
2307.01994 | Xusheng Zhu | Xusheng Zhu, Wen Chen, Qingqing Wu, Liwei Wang | Performance Analysis of RIS-Aided Space Shift Keying With Channel
Estimation Errors | null | null | null | null | cs.IT eess.SP math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we investigate the reconfigurable intelligent surface (RIS)
assisted space shift keying (SSK) downlink communication systems under the
imperfect channel state information (CSI), where the channel between the base
station to RIS follows the Rayleigh fading, while the channel between the RIS
to user equi... | [
{
"created": "Wed, 5 Jul 2023 02:53:19 GMT",
"version": "v1"
}
] | 2023-07-06 | [
[
"Zhu",
"Xusheng",
""
],
[
"Chen",
"Wen",
""
],
[
"Wu",
"Qingqing",
""
],
[
"Wang",
"Liwei",
""
]
] | In this paper, we investigate the reconfigurable intelligent surface (RIS) assisted space shift keying (SSK) downlink communication systems under the imperfect channel state information (CSI), where the channel between the base station to RIS follows the Rayleigh fading, while the channel between the RIS to user equipm... |
2201.12848 | Axel Brando Guillaumes | Axel Brando, Joan Gimeno, Jose A. Rodr\'iguez-Serrano, Jordi Vitri\`a | Deep Non-Crossing Quantiles through the Partial Derivative | In the Proceedings of the 25th International Conference on Artificial
Intelligence and Statistics (AISTATS) | null | null | null | cs.LG cs.AI math.PR stat.ML | http://creativecommons.org/licenses/by-sa/4.0/ | Quantile Regression (QR) provides a way to approximate a single conditional
quantile. To have a more informative description of the conditional
distribution, QR can be merged with deep learning techniques to simultaneously
estimate multiple quantiles. However, the minimisation of the QR-loss function
does not guarant... | [
{
"created": "Sun, 30 Jan 2022 15:35:21 GMT",
"version": "v1"
}
] | 2022-02-01 | [
[
"Brando",
"Axel",
""
],
[
"Gimeno",
"Joan",
""
],
[
"Rodríguez-Serrano",
"Jose A.",
""
],
[
"Vitrià",
"Jordi",
""
]
] | Quantile Regression (QR) provides a way to approximate a single conditional quantile. To have a more informative description of the conditional distribution, QR can be merged with deep learning techniques to simultaneously estimate multiple quantiles. However, the minimisation of the QR-loss function does not guarantee... |
1709.02556 | EPTCS | L\'aszl\'o Z. Varga (ELTE E\"otv\"os Lor\'and University) | Game Theory Models for the Verification of the Collective Behaviour of
Autonomous Cars | In Proceedings FVAV 2017, arXiv:1709.02126 | EPTCS 257, 2017, pp. 27-34 | 10.4204/EPTCS.257.4 | null | cs.MA cs.GT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The collective of autonomous cars is expected to generate almost optimal
traffic. In this position paper we discuss the multi-agent models and the
verification results of the collective behaviour of autonomous cars. We argue
that non-cooperative autonomous adaptation cannot guarantee optimal behaviour.
The conjecture... | [
{
"created": "Fri, 8 Sep 2017 06:35:10 GMT",
"version": "v1"
}
] | 2017-09-11 | [
[
"Varga",
"László Z.",
"",
"ELTE Eötvös Loránd University"
]
] | The collective of autonomous cars is expected to generate almost optimal traffic. In this position paper we discuss the multi-agent models and the verification results of the collective behaviour of autonomous cars. We argue that non-cooperative autonomous adaptation cannot guarantee optimal behaviour. The conjecture i... |
2210.08883 | Lena Mulansky | Lena Mulansky and R\"udiger Pryss and Caroline Cohrdes and Harald
Baumeister and Felix Beierle | Social Media App Usage in Relation with PHQ-9 Depression Scores during
the COVID-19 Pandemic | Accepted for the UbiComp/ISWC 2022 conference | null | 10.1145/3544793.3563411 | null | cs.CY cs.SI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | With about 300 million affected people, major depressive disorder (MDD) is
one of the most common diseases worldwide. During the COVID-19 pandemic, the
number of cases increased even further, by 28%. Many factors may be correlated
with MDD, including the excessive use of social media apps. In this paper, we
investiga... | [
{
"created": "Mon, 17 Oct 2022 09:27:24 GMT",
"version": "v1"
}
] | 2022-10-18 | [
[
"Mulansky",
"Lena",
""
],
[
"Pryss",
"Rüdiger",
""
],
[
"Cohrdes",
"Caroline",
""
],
[
"Baumeister",
"Harald",
""
],
[
"Beierle",
"Felix",
""
]
] | With about 300 million affected people, major depressive disorder (MDD) is one of the most common diseases worldwide. During the COVID-19 pandemic, the number of cases increased even further, by 28%. Many factors may be correlated with MDD, including the excessive use of social media apps. In this paper, we investigate... |
2402.06576 | Abhijin Adiga | Abhijin Adiga, Yohai Trabelsi, Tanvir Ferdousi, Madhav Marathe, S. S.
Ravi, Samarth Swarup, Anil Kumar Vullikanti, Mandy L. Wilson, Sarit Kraus,
Reetwika Basu, Supriya Savalkar, Matthew Yourek, Michael Brady, Kirti
Rajagopalan, Jonathan Yoder | Value-based Resource Matching with Fairness Criteria: Application to
Agricultural Water Trading | null | null | null | null | cs.DS cs.MA | http://creativecommons.org/licenses/by/4.0/ | Optimal allocation of agricultural water in the event of droughts is an
important global problem. In addressing this problem, many aspects, including
the welfare of farmers, the economy, and the environment, must be considered.
Under this backdrop, our work focuses on several resource-matching problems
accounting for... | [
{
"created": "Fri, 9 Feb 2024 17:50:40 GMT",
"version": "v1"
},
{
"created": "Mon, 12 Feb 2024 02:17:04 GMT",
"version": "v2"
}
] | 2024-02-13 | [
[
"Adiga",
"Abhijin",
""
],
[
"Trabelsi",
"Yohai",
""
],
[
"Ferdousi",
"Tanvir",
""
],
[
"Marathe",
"Madhav",
""
],
[
"Ravi",
"S. S.",
""
],
[
"Swarup",
"Samarth",
""
],
[
"Vullikanti",
"Anil Kumar",
""
],
... | Optimal allocation of agricultural water in the event of droughts is an important global problem. In addressing this problem, many aspects, including the welfare of farmers, the economy, and the environment, must be considered. Under this backdrop, our work focuses on several resource-matching problems accounting for a... |
2010.12408 | Hande Dong | Hande Dong, Jiawei Chen, Fuli Feng, Xiangnan He, Shuxian Bi, Zhaolin
Ding, Peng Cui | On the Equivalence of Decoupled Graph Convolution Network and Label
Propagation | Accepted by WWW 2021 | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The original design of Graph Convolution Network (GCN) couples feature
transformation and neighborhood aggregation for node representation learning.
Recently, some work shows that coupling is inferior to decoupling, which
supports deep graph propagation better and has become the latest paradigm of
GCN (e.g., APPNP an... | [
{
"created": "Fri, 23 Oct 2020 13:57:39 GMT",
"version": "v1"
},
{
"created": "Mon, 15 Feb 2021 12:23:39 GMT",
"version": "v2"
}
] | 2021-02-16 | [
[
"Dong",
"Hande",
""
],
[
"Chen",
"Jiawei",
""
],
[
"Feng",
"Fuli",
""
],
[
"He",
"Xiangnan",
""
],
[
"Bi",
"Shuxian",
""
],
[
"Ding",
"Zhaolin",
""
],
[
"Cui",
"Peng",
""
]
] | The original design of Graph Convolution Network (GCN) couples feature transformation and neighborhood aggregation for node representation learning. Recently, some work shows that coupling is inferior to decoupling, which supports deep graph propagation better and has become the latest paradigm of GCN (e.g., APPNP and ... |
2402.08023 | Yijun Tian | Yijun Tian, Chuxu Zhang, Ziyi Kou, Zheyuan Liu, Xiangliang Zhang,
Nitesh V. Chawla | UGMAE: A Unified Framework for Graph Masked Autoencoders | null | null | null | null | cs.LG cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Generative self-supervised learning on graphs, particularly graph masked
autoencoders, has emerged as a popular learning paradigm and demonstrated its
efficacy in handling non-Euclidean data. However, several remaining issues
limit the capability of existing methods: 1) the disregard of uneven node
significance in ma... | [
{
"created": "Mon, 12 Feb 2024 19:39:26 GMT",
"version": "v1"
}
] | 2024-02-14 | [
[
"Tian",
"Yijun",
""
],
[
"Zhang",
"Chuxu",
""
],
[
"Kou",
"Ziyi",
""
],
[
"Liu",
"Zheyuan",
""
],
[
"Zhang",
"Xiangliang",
""
],
[
"Chawla",
"Nitesh V.",
""
]
] | Generative self-supervised learning on graphs, particularly graph masked autoencoders, has emerged as a popular learning paradigm and demonstrated its efficacy in handling non-Euclidean data. However, several remaining issues limit the capability of existing methods: 1) the disregard of uneven node significance in mask... |
2311.17135 | Weilin Wan | Weilin Wan, Zhiyang Dou, Taku Komura, Wenping Wang, Dinesh Jayaraman,
Lingjie Liu | TLControl: Trajectory and Language Control for Human Motion Synthesis | null | null | null | null | cs.CV cs.GR | http://creativecommons.org/licenses/by-nc-sa/4.0/ | Controllable human motion synthesis is essential for applications in AR/VR,
gaming and embodied AI. Existing methods often focus solely on either language
or full trajectory control, lacking precision in synthesizing motions aligned
with user-specified trajectories, especially for multi-joint control. To
address thes... | [
{
"created": "Tue, 28 Nov 2023 18:54:16 GMT",
"version": "v1"
},
{
"created": "Thu, 30 Nov 2023 20:36:16 GMT",
"version": "v2"
},
{
"created": "Tue, 12 Dec 2023 22:18:18 GMT",
"version": "v3"
},
{
"created": "Wed, 24 Jul 2024 13:55:48 GMT",
"version": "v4"
}
] | 2024-07-25 | [
[
"Wan",
"Weilin",
""
],
[
"Dou",
"Zhiyang",
""
],
[
"Komura",
"Taku",
""
],
[
"Wang",
"Wenping",
""
],
[
"Jayaraman",
"Dinesh",
""
],
[
"Liu",
"Lingjie",
""
]
] | Controllable human motion synthesis is essential for applications in AR/VR, gaming and embodied AI. Existing methods often focus solely on either language or full trajectory control, lacking precision in synthesizing motions aligned with user-specified trajectories, especially for multi-joint control. To address these ... |
2312.02509 | Ero Balsa | Ero Balsa and Yan Shvartzshnaider | When PETs misbehave: A Contextual Integrity analysis | null | null | null | null | cs.CR cs.CY cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Privacy enhancing technologies, or PETs, have been hailed as a promising
means to protect privacy without compromising on the functionality of digital
services. At the same time, and partly because they may encode a narrow
conceptualization of privacy as confidentiality that is popular among
policymakers, engineers a... | [
{
"created": "Tue, 5 Dec 2023 05:27:43 GMT",
"version": "v1"
}
] | 2023-12-06 | [
[
"Balsa",
"Ero",
""
],
[
"Shvartzshnaider",
"Yan",
""
]
] | Privacy enhancing technologies, or PETs, have been hailed as a promising means to protect privacy without compromising on the functionality of digital services. At the same time, and partly because they may encode a narrow conceptualization of privacy as confidentiality that is popular among policymakers, engineers and... |
1404.4888 | Isadora Nun Ms | Isadora Nun, Karim Pichara, Pavlos Protopapas, Dae-Won Kim | Supervised detection of anomalous light-curves in massive astronomical
catalogs | 16 pages, 18 figures, published in The Astrophysical Journal | 2014, ApJ, 793, 23 | 10.1088/0004-637X/793/1/23 | null | cs.CE astro-ph.IM cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The development of synoptic sky surveys has led to a massive amount of data
for which resources needed for analysis are beyond human capabilities. To
process this information and to extract all possible knowledge, machine
learning techniques become necessary. Here we present a new method to
automatically discover unk... | [
{
"created": "Fri, 18 Apr 2014 21:12:13 GMT",
"version": "v1"
},
{
"created": "Wed, 3 Sep 2014 15:50:49 GMT",
"version": "v2"
},
{
"created": "Wed, 27 May 2015 21:27:11 GMT",
"version": "v3"
}
] | 2015-05-29 | [
[
"Nun",
"Isadora",
""
],
[
"Pichara",
"Karim",
""
],
[
"Protopapas",
"Pavlos",
""
],
[
"Kim",
"Dae-Won",
""
]
] | The development of synoptic sky surveys has led to a massive amount of data for which resources needed for analysis are beyond human capabilities. To process this information and to extract all possible knowledge, machine learning techniques become necessary. Here we present a new method to automatically discover unkno... |
1509.04273 | Konrad Dabrowski | Andreas Brandst\"adt, Konrad K. Dabrowski, Shenwei Huang, Dani\"el
Paulusma | Bounding the Clique-Width of $H$-free Split Graphs | 17 pages, 5 figures. An extended abstract of this paper appeared in
the proceedings of EuroComb 2015 | null | null | null | cs.DM math.CO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A graph is $H$-free if it has no induced subgraph isomorphic to $H$. We
continue a study into the boundedness of clique-width of subclasses of perfect
graphs. We identify five new classes of $H$-free split graphs whose
clique-width is bounded. Our main result, obtained by combining new and known
results, provides a c... | [
{
"created": "Mon, 14 Sep 2015 20:07:31 GMT",
"version": "v1"
}
] | 2015-09-16 | [
[
"Brandstädt",
"Andreas",
""
],
[
"Dabrowski",
"Konrad K.",
""
],
[
"Huang",
"Shenwei",
""
],
[
"Paulusma",
"Daniël",
""
]
] | A graph is $H$-free if it has no induced subgraph isomorphic to $H$. We continue a study into the boundedness of clique-width of subclasses of perfect graphs. We identify five new classes of $H$-free split graphs whose clique-width is bounded. Our main result, obtained by combining new and known results, provides a cla... |
2206.01966 | Sajjad Karimian | B Rahimi, S Karimian, A Ghaznavi, M Jafari Heydarlou | Development and Evaluation of Dental Image Exchange and Management
System: A User-Centered Perspective | 3 figures, 5 tables | null | null | null | cs.HC cs.IR cs.MM cs.SE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Introduction: Systems that exist in the hospital or clinic settings are
capable of providing services in the physical environment. These systems (e.g.,
Picture Archiving and communication systems) provide remote service for
patients. To design such systems, we need some unique methods such as software
development lif... | [
{
"created": "Sat, 4 Jun 2022 11:16:43 GMT",
"version": "v1"
}
] | 2024-04-23 | [
[
"Rahimi",
"B",
""
],
[
"Karimian",
"S",
""
],
[
"Ghaznavi",
"A",
""
],
[
"Heydarlou",
"M Jafari",
""
]
] | Introduction: Systems that exist in the hospital or clinic settings are capable of providing services in the physical environment. These systems (e.g., Picture Archiving and communication systems) provide remote service for patients. To design such systems, we need some unique methods such as software development life ... |
2405.13094 | Kun Xie | Yusong Zhang, Kun Xie, Xingyi Zhang, Xiangyu Dong, Sibo Wang | KPG: Key Propagation Graph Generator for Rumor Detection based on
Reinforcement Learning | null | null | null | null | cs.SI cs.AI cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The proliferation of rumors on social media platforms during significant
events, such as the US elections and the COVID-19 pandemic, has a profound
impact on social stability and public health. Existing approaches for rumor
detection primarily rely on propagation graphs to enhance model effectiveness.
However, the pr... | [
{
"created": "Tue, 21 May 2024 13:13:43 GMT",
"version": "v1"
}
] | 2024-05-24 | [
[
"Zhang",
"Yusong",
""
],
[
"Xie",
"Kun",
""
],
[
"Zhang",
"Xingyi",
""
],
[
"Dong",
"Xiangyu",
""
],
[
"Wang",
"Sibo",
""
]
] | The proliferation of rumors on social media platforms during significant events, such as the US elections and the COVID-19 pandemic, has a profound impact on social stability and public health. Existing approaches for rumor detection primarily rely on propagation graphs to enhance model effectiveness. However, the pres... |
2402.08690 | Dobromir Dotov | Dobromir Dotov, Dante Camarena, Zack Harris, Joanna Spyra, Pietro
Gagliano, Laurel Trainor | If Turing played piano with an artificial partner | null | null | null | null | cs.SI cs.AI cs.LG cs.SD | http://creativecommons.org/licenses/by-nc-nd/4.0/ | Music is an inherently social activity that allows people to share
experiences and feel connected with one another. There has been little progress
in designing artificial partners exhibiting a similar social experience as
playing with another person. Neural network architectures that implement
generative models, such... | [
{
"created": "Fri, 9 Feb 2024 18:43:48 GMT",
"version": "v1"
}
] | 2024-02-15 | [
[
"Dotov",
"Dobromir",
""
],
[
"Camarena",
"Dante",
""
],
[
"Harris",
"Zack",
""
],
[
"Spyra",
"Joanna",
""
],
[
"Gagliano",
"Pietro",
""
],
[
"Trainor",
"Laurel",
""
]
] | Music is an inherently social activity that allows people to share experiences and feel connected with one another. There has been little progress in designing artificial partners exhibiting a similar social experience as playing with another person. Neural network architectures that implement generative models, such a... |
2402.09216 | Sankalan Pal Chowdhury | Sankalan Pal Chowdhury, Vil\'em Zouhar, Mrinmaya Sachan | AutoTutor meets Large Language Models: A Language Model Tutor with Rich
Pedagogy and Guardrails | To be presented at Learning@Scale 2024 | null | null | null | cs.CL cs.HC | http://creativecommons.org/licenses/by/4.0/ | Large Language Models (LLMs) have found several use cases in education,
ranging from automatic question generation to essay evaluation. In this paper,
we explore the potential of using Large Language Models (LLMs) to author
Intelligent Tutoring Systems. A common pitfall of LLMs is their straying from
desired pedagogi... | [
{
"created": "Wed, 14 Feb 2024 14:53:56 GMT",
"version": "v1"
},
{
"created": "Tue, 27 Feb 2024 11:27:27 GMT",
"version": "v2"
},
{
"created": "Thu, 25 Apr 2024 13:15:55 GMT",
"version": "v3"
}
] | 2024-04-26 | [
[
"Chowdhury",
"Sankalan Pal",
""
],
[
"Zouhar",
"Vilém",
""
],
[
"Sachan",
"Mrinmaya",
""
]
] | Large Language Models (LLMs) have found several use cases in education, ranging from automatic question generation to essay evaluation. In this paper, we explore the potential of using Large Language Models (LLMs) to author Intelligent Tutoring Systems. A common pitfall of LLMs is their straying from desired pedagogica... |
1905.04727 | Milan Gritta | Milan Gritta | A Comparison of Techniques for Sentiment Classification of Film Reviews | A short paper from my MPhil in Advanced Computer Science (2014-15) | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We undertake the task of comparing lexicon-based sentiment classification of
film reviews with machine learning approaches. We look at existing
methodologies and attempt to emulate and improve on them using a 'given'
lexicon and a bag-of-words approach. We also utilise syntactical information
such as part-of-speech a... | [
{
"created": "Sun, 12 May 2019 14:19:28 GMT",
"version": "v1"
}
] | 2019-05-14 | [
[
"Gritta",
"Milan",
""
]
] | We undertake the task of comparing lexicon-based sentiment classification of film reviews with machine learning approaches. We look at existing methodologies and attempt to emulate and improve on them using a 'given' lexicon and a bag-of-words approach. We also utilise syntactical information such as part-of-speech and... |
2001.08680 | Zijie Zhuang | Zijie Zhuang, Longhui Wei, Lingxi Xie, Tianyu Zhang, Hengheng Zhang,
Haozhe Wu, Haizhou Ai, and Qi Tian | Rethinking the Distribution Gap of Person Re-identification with
Camera-based Batch Normalization | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The fundamental difficulty in person re-identification (ReID) lies in
learning the correspondence among individual cameras. It strongly demands
costly inter-camera annotations, yet the trained models are not guaranteed to
transfer well to previously unseen cameras. These problems significantly limit
the application o... | [
{
"created": "Thu, 23 Jan 2020 17:22:34 GMT",
"version": "v1"
},
{
"created": "Tue, 31 Mar 2020 14:42:17 GMT",
"version": "v2"
},
{
"created": "Sat, 18 Jul 2020 15:37:06 GMT",
"version": "v3"
}
] | 2020-07-21 | [
[
"Zhuang",
"Zijie",
""
],
[
"Wei",
"Longhui",
""
],
[
"Xie",
"Lingxi",
""
],
[
"Zhang",
"Tianyu",
""
],
[
"Zhang",
"Hengheng",
""
],
[
"Wu",
"Haozhe",
""
],
[
"Ai",
"Haizhou",
""
],
[
"Tian",
"Qi... | The fundamental difficulty in person re-identification (ReID) lies in learning the correspondence among individual cameras. It strongly demands costly inter-camera annotations, yet the trained models are not guaranteed to transfer well to previously unseen cameras. These problems significantly limit the application of ... |
1903.10343 | Yassir Jedra | Yassir Jedra and Alexandre Proutiere | Sample Complexity Lower Bounds for Linear System Identification | null | null | null | null | cs.SY cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper establishes problem-specific sample complexity lower bounds for
linear system identification problems. The sample complexity is defined in the
PAC framework: it corresponds to the time it takes to identify the system
parameters with prescribed accuracy and confidence levels. By problem-specific,
we mean th... | [
{
"created": "Mon, 25 Mar 2019 14:06:27 GMT",
"version": "v1"
}
] | 2019-03-26 | [
[
"Jedra",
"Yassir",
""
],
[
"Proutiere",
"Alexandre",
""
]
] | This paper establishes problem-specific sample complexity lower bounds for linear system identification problems. The sample complexity is defined in the PAC framework: it corresponds to the time it takes to identify the system parameters with prescribed accuracy and confidence levels. By problem-specific, we mean that... |
2312.13913 | Xianfang Zeng | Xianfang Zeng, Xin Chen, Zhongqi Qi, Wen Liu, Zibo Zhao, Zhibin Wang,
Bin Fu, Yong Liu, Gang Yu | Paint3D: Paint Anything 3D with Lighting-Less Texture Diffusion Models | Project Website: https://github.com/OpenTexture/Paint3D | null | null | null | cs.CV | http://creativecommons.org/licenses/by-nc-sa/4.0/ | This paper presents Paint3D, a novel coarse-to-fine generative framework that
is capable of producing high-resolution, lighting-less, and diverse 2K UV
texture maps for untextured 3D meshes conditioned on text or image inputs. The
key challenge addressed is generating high-quality textures without embedded
illuminati... | [
{
"created": "Thu, 21 Dec 2023 15:01:47 GMT",
"version": "v1"
},
{
"created": "Fri, 22 Dec 2023 06:27:43 GMT",
"version": "v2"
}
] | 2023-12-25 | [
[
"Zeng",
"Xianfang",
""
],
[
"Chen",
"Xin",
""
],
[
"Qi",
"Zhongqi",
""
],
[
"Liu",
"Wen",
""
],
[
"Zhao",
"Zibo",
""
],
[
"Wang",
"Zhibin",
""
],
[
"Fu",
"Bin",
""
],
[
"Liu",
"Yong",
""
]... | This paper presents Paint3D, a novel coarse-to-fine generative framework that is capable of producing high-resolution, lighting-less, and diverse 2K UV texture maps for untextured 3D meshes conditioned on text or image inputs. The key challenge addressed is generating high-quality textures without embedded illumination... |
2312.08822 | Fengheng Li | Zhaochen Li, Fengheng Li, Wei Feng, Honghe Zhu, An Liu, Yaoyu Li,
Zheng Zhang, Jingjing Lv, Xin Zhu, Junjie Shen, Zhangang Lin, Jingping Shao,
Zhenglu Yang | Planning and Rendering: Towards End-to-End Product Poster Generation | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | End-to-end product poster generation significantly optimizes design
efficiency and reduces production costs. Prevailing methods predominantly rely
on image-inpainting methods to generate clean background images for given
products. Subsequently, poster layout generation methods are employed to
produce corresponding la... | [
{
"created": "Thu, 14 Dec 2023 11:11:50 GMT",
"version": "v1"
}
] | 2023-12-15 | [
[
"Li",
"Zhaochen",
""
],
[
"Li",
"Fengheng",
""
],
[
"Feng",
"Wei",
""
],
[
"Zhu",
"Honghe",
""
],
[
"Liu",
"An",
""
],
[
"Li",
"Yaoyu",
""
],
[
"Zhang",
"Zheng",
""
],
[
"Lv",
"Jingjing",
""... | End-to-end product poster generation significantly optimizes design efficiency and reduces production costs. Prevailing methods predominantly rely on image-inpainting methods to generate clean background images for given products. Subsequently, poster layout generation methods are employed to produce corresponding layo... |
2112.00331 | Ruiyang Liu | Ruiyang Liu, Predrag K. Nikolic | Mutltimodal AI Companion for Interactive Fairytale Co-creation | null | null | null | null | cs.MM | http://creativecommons.org/licenses/by-nc-nd/4.0/ | AI fairy tale companions play an important role in early childhood education
as an augmentation for parents' efforts to close the participation gap and
boost kids' mental and language development. Existing systems are generally
designed to provide vivid materials as unidirectional entertaining reading
environments, e... | [
{
"created": "Wed, 1 Dec 2021 07:53:38 GMT",
"version": "v1"
}
] | 2021-12-02 | [
[
"Liu",
"Ruiyang",
""
],
[
"Nikolic",
"Predrag K.",
""
]
] | AI fairy tale companions play an important role in early childhood education as an augmentation for parents' efforts to close the participation gap and boost kids' mental and language development. Existing systems are generally designed to provide vivid materials as unidirectional entertaining reading environments, e.g... |
2101.00443 | Sourav Garg | Sourav Garg, Niko S\"underhauf, Feras Dayoub, Douglas Morrison,
Akansel Cosgun, Gustavo Carneiro, Qi Wu, Tat-Jun Chin, Ian Reid, Stephen
Gould, Peter Corke, Michael Milford | Semantics for Robotic Mapping, Perception and Interaction: A Survey | 81 pages, 1 figure, published in Foundations and Trends in Robotics,
2020 | Foundations and Trends in Robotics: Vol. 8: No. 1-2, pp 1-224
(2020) | 10.1561/2300000059 | null | cs.RO cs.CV cs.HC cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | For robots to navigate and interact more richly with the world around them,
they will likely require a deeper understanding of the world in which they
operate. In robotics and related research fields, the study of understanding is
often referred to as semantics, which dictates what does the world "mean" to a
robot, a... | [
{
"created": "Sat, 2 Jan 2021 12:34:39 GMT",
"version": "v1"
}
] | 2021-01-05 | [
[
"Garg",
"Sourav",
""
],
[
"Sünderhauf",
"Niko",
""
],
[
"Dayoub",
"Feras",
""
],
[
"Morrison",
"Douglas",
""
],
[
"Cosgun",
"Akansel",
""
],
[
"Carneiro",
"Gustavo",
""
],
[
"Wu",
"Qi",
""
],
[
"Chi... | For robots to navigate and interact more richly with the world around them, they will likely require a deeper understanding of the world in which they operate. In robotics and related research fields, the study of understanding is often referred to as semantics, which dictates what does the world "mean" to a robot, and... |
2204.03538 | David Puljiz | David Puljiz, Bj\"orn Hein | Updating Industrial Robots for Emerging Technologies | As accepted to the 2nd International Workshop on Designerly HRI; HRI
2022 | null | null | null | cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Industrial arms need to evolve beyond their standard shape to embrace new and
emerging technologies. In this paper, we shall first perform an analysis of
four popular but different modern industrial robot arms. By seeing the common
trends we will try to extrapolate and expand these trends for the future. Here,
partic... | [
{
"created": "Thu, 7 Apr 2022 16:08:02 GMT",
"version": "v1"
},
{
"created": "Tue, 28 Mar 2023 15:36:57 GMT",
"version": "v2"
}
] | 2023-03-29 | [
[
"Puljiz",
"David",
""
],
[
"Hein",
"Björn",
""
]
] | Industrial arms need to evolve beyond their standard shape to embrace new and emerging technologies. In this paper, we shall first perform an analysis of four popular but different modern industrial robot arms. By seeing the common trends we will try to extrapolate and expand these trends for the future. Here, particul... |
2407.01905 | Jiawei Zhan | Jiawei Zhan, Jinxiang Lai, Bin-Bin Gao, Jun Liu, Xiaochen Chen,
Chengjie Wang | Enhancing Multi-Class Anomaly Detection via Diffusion Refinement with
Dual Conditioning | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Anomaly detection, the technique of identifying abnormal samples using only
normal samples, has attracted widespread interest in industry. Existing
one-model-per-category methods often struggle with limited generalization
capabilities due to their focus on a single category, and can fail when
encountering variations ... | [
{
"created": "Tue, 2 Jul 2024 03:09:40 GMT",
"version": "v1"
}
] | 2024-07-03 | [
[
"Zhan",
"Jiawei",
""
],
[
"Lai",
"Jinxiang",
""
],
[
"Gao",
"Bin-Bin",
""
],
[
"Liu",
"Jun",
""
],
[
"Chen",
"Xiaochen",
""
],
[
"Wang",
"Chengjie",
""
]
] | Anomaly detection, the technique of identifying abnormal samples using only normal samples, has attracted widespread interest in industry. Existing one-model-per-category methods often struggle with limited generalization capabilities due to their focus on a single category, and can fail when encountering variations in... |
1506.03378 | Lihong Li | Che-Yu Liu and Lihong Li | On the Prior Sensitivity of Thompson Sampling | Appears in the 27th International Conference on Algorithmic Learning
Theory (ALT), 2016 | null | null | null | cs.LG cs.AI stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The empirically successful Thompson Sampling algorithm for stochastic bandits
has drawn much interest in understanding its theoretical properties. One
important benefit of the algorithm is that it allows domain knowledge to be
conveniently encoded as a prior distribution to balance exploration and
exploitation more e... | [
{
"created": "Wed, 10 Jun 2015 16:22:26 GMT",
"version": "v1"
},
{
"created": "Thu, 21 Jul 2016 01:43:09 GMT",
"version": "v2"
}
] | 2016-07-22 | [
[
"Liu",
"Che-Yu",
""
],
[
"Li",
"Lihong",
""
]
] | The empirically successful Thompson Sampling algorithm for stochastic bandits has drawn much interest in understanding its theoretical properties. One important benefit of the algorithm is that it allows domain knowledge to be conveniently encoded as a prior distribution to balance exploration and exploitation more eff... |
2005.12409 | Petar Radanliev | Petar Radanliev, David De Roure, Max Van Kleek | Digitalization of COVID-19 pandemic management and cyber risk from
connected systems | null | null | null | null | cs.CY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | What makes cyber risks arising from connected systems challenging during the
management of a pandemic? Assuming that a variety of cyber-physical systems are
already operational-collecting, analyzing, and acting on data autonomously-what
risks might arise in their application to pandemic management? We already have
th... | [
{
"created": "Mon, 25 May 2020 21:19:28 GMT",
"version": "v1"
}
] | 2020-05-27 | [
[
"Radanliev",
"Petar",
""
],
[
"De Roure",
"David",
""
],
[
"Van Kleek",
"Max",
""
]
] | What makes cyber risks arising from connected systems challenging during the management of a pandemic? Assuming that a variety of cyber-physical systems are already operational-collecting, analyzing, and acting on data autonomously-what risks might arise in their application to pandemic management? We already have thes... |
1507.04537 | Nils Vortmeier | Thomas Schwentick, Nils Vortmeier, Thomas Zeume | Static Analysis for Logic-Based Dynamic Programs | null | null | null | null | cs.LO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A dynamic program, as introduced by Patnaik and Immerman (1994), maintains
the result of a fixed query for an input database which is subject to tuple
insertions and deletions. It can use an auxiliary database whose relations are
updated via first-order formulas upon modifications of the input database. This
paper st... | [
{
"created": "Thu, 16 Jul 2015 12:07:18 GMT",
"version": "v1"
}
] | 2015-07-17 | [
[
"Schwentick",
"Thomas",
""
],
[
"Vortmeier",
"Nils",
""
],
[
"Zeume",
"Thomas",
""
]
] | A dynamic program, as introduced by Patnaik and Immerman (1994), maintains the result of a fixed query for an input database which is subject to tuple insertions and deletions. It can use an auxiliary database whose relations are updated via first-order formulas upon modifications of the input database. This paper stud... |
1905.03633 | Jan Kotera | Jan Kotera, Denys Rozumnyi, Filip \v{S}roubek, Ji\v{r}\'i Matas | Intra-frame Object Tracking by Deblatting | null | 2019 IEEE/CVF International Conference on Computer Vision Workshop
(ICCVW) | 10.1109/ICCVW.2019.00283 | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Objects moving at high speed along complex trajectories often appear in
videos, especially videos of sports. Such objects elapse non-negligible
distance during exposure time of a single frame and therefore their position in
the frame is not well defined. They appear as semi-transparent streaks due to
the motion blur ... | [
{
"created": "Thu, 9 May 2019 13:48:01 GMT",
"version": "v1"
},
{
"created": "Thu, 20 Jun 2019 11:17:14 GMT",
"version": "v2"
}
] | 2020-06-03 | [
[
"Kotera",
"Jan",
""
],
[
"Rozumnyi",
"Denys",
""
],
[
"Šroubek",
"Filip",
""
],
[
"Matas",
"Jiří",
""
]
] | Objects moving at high speed along complex trajectories often appear in videos, especially videos of sports. Such objects elapse non-negligible distance during exposure time of a single frame and therefore their position in the frame is not well defined. They appear as semi-transparent streaks due to the motion blur an... |
2305.14243 | Manuel Tran | Manuel Tran, Yashin Dicente Cid, Amal Lahiani, Fabian J. Theis,
Tingying Peng, Eldad Klaiman | Training Transitive and Commutative Multimodal Transformers with LoReTTa | Accepted at NeurIPS 2023 (poster). Camera-ready version | null | null | null | cs.AI cs.CV | http://creativecommons.org/licenses/by/4.0/ | Training multimodal foundation models is challenging due to the limited
availability of multimodal datasets. While many public datasets pair images
with text, few combine images with audio or text with audio. Even rarer are
datasets that align all three modalities at once. Critical domains such as
healthcare, infrast... | [
{
"created": "Tue, 23 May 2023 16:58:55 GMT",
"version": "v1"
},
{
"created": "Mon, 29 May 2023 08:37:21 GMT",
"version": "v2"
},
{
"created": "Tue, 27 Jun 2023 09:00:35 GMT",
"version": "v3"
},
{
"created": "Sun, 24 Sep 2023 13:01:29 GMT",
"version": "v4"
},
{
"c... | 2024-01-18 | [
[
"Tran",
"Manuel",
""
],
[
"Cid",
"Yashin Dicente",
""
],
[
"Lahiani",
"Amal",
""
],
[
"Theis",
"Fabian J.",
""
],
[
"Peng",
"Tingying",
""
],
[
"Klaiman",
"Eldad",
""
]
] | Training multimodal foundation models is challenging due to the limited availability of multimodal datasets. While many public datasets pair images with text, few combine images with audio or text with audio. Even rarer are datasets that align all three modalities at once. Critical domains such as healthcare, infrastru... |
2107.06744 | Reshma Rastogi | Reshma Rastogi (nee. Khemchandani) and Aman Pal | Efficient Learning of Pinball TWSVM using Privileged Information and its
applications | null | null | null | null | cs.LG | http://creativecommons.org/licenses/by/4.0/ | In any learning framework, an expert knowledge always plays a crucial role.
But, in the field of machine learning, the knowledge offered by an expert is
rarely used. Moreover, machine learning algorithms (SVM based) generally use
hinge loss function which is sensitive towards the noise. Thus, in order to get
the adva... | [
{
"created": "Wed, 14 Jul 2021 14:42:07 GMT",
"version": "v1"
}
] | 2021-07-15 | [
[
"Rastogi",
"Reshma",
"",
"nee. Khemchandani"
],
[
"Pal",
"Aman",
""
]
] | In any learning framework, an expert knowledge always plays a crucial role. But, in the field of machine learning, the knowledge offered by an expert is rarely used. Moreover, machine learning algorithms (SVM based) generally use hinge loss function which is sensitive towards the noise. Thus, in order to get the advant... |
1109.6273 | Robert Simmons | Robert J. Simmons | Structural focalization | A Twelf formalization is included and an Agda formalization is
available at https://github.com/robsimmons/agda-lib/tree/focalization | null | null | null | cs.LO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Focusing, introduced by Jean-Marc Andreoli in the context of classical linear
logic, defines a normal form for sequent calculus derivations that cuts down on
the number of possible derivations by eagerly applying invertible rules and
grouping sequences of non-invertible rules. A focused sequent calculus is
defined re... | [
{
"created": "Wed, 28 Sep 2011 17:01:11 GMT",
"version": "v1"
},
{
"created": "Sat, 7 Jan 2012 23:52:03 GMT",
"version": "v2"
},
{
"created": "Sat, 14 Jan 2012 00:57:07 GMT",
"version": "v3"
},
{
"created": "Mon, 13 Aug 2012 21:02:09 GMT",
"version": "v4"
},
{
"cr... | 2014-03-18 | [
[
"Simmons",
"Robert J.",
""
]
] | Focusing, introduced by Jean-Marc Andreoli in the context of classical linear logic, defines a normal form for sequent calculus derivations that cuts down on the number of possible derivations by eagerly applying invertible rules and grouping sequences of non-invertible rules. A focused sequent calculus is defined rela... |
1407.0039 | Edinah Gnang K | Edinah K. Gnang | Integer formula encoding SageTeX package | null | null | null | null | cs.MS math.CO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The paper describes a SageTeX implementation of an integer encoding
procedures.
| [
{
"created": "Fri, 27 Jun 2014 00:13:14 GMT",
"version": "v1"
}
] | 2014-07-02 | [
[
"Gnang",
"Edinah K.",
""
]
] | The paper describes a SageTeX implementation of an integer encoding procedures. |
2303.12506 | Eden Hartman | Eden Hartman, Avinatan Hassidim, Yonatan Aumann and Erel Segal-Halevi | Leximin Approximation: From Single-Objective to Multi-Objective | null | null | null | null | cs.GT cs.DS cs.MA | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Leximin is a common approach to multi-objective optimization, frequently
employed in fair division applications. In leximin optimization, one first aims
to maximize the smallest objective value; subject to this, one maximizes the
second-smallest objective; and so on. Often, even the single-objective problem
of maximi... | [
{
"created": "Wed, 22 Mar 2023 12:27:15 GMT",
"version": "v1"
},
{
"created": "Sun, 4 Jun 2023 00:28:11 GMT",
"version": "v2"
},
{
"created": "Mon, 31 Jul 2023 09:17:37 GMT",
"version": "v3"
},
{
"created": "Thu, 28 Sep 2023 14:51:57 GMT",
"version": "v4"
}
] | 2023-09-29 | [
[
"Hartman",
"Eden",
""
],
[
"Hassidim",
"Avinatan",
""
],
[
"Aumann",
"Yonatan",
""
],
[
"Segal-Halevi",
"Erel",
""
]
] | Leximin is a common approach to multi-objective optimization, frequently employed in fair division applications. In leximin optimization, one first aims to maximize the smallest objective value; subject to this, one maximizes the second-smallest objective; and so on. Often, even the single-objective problem of maximizi... |
1204.1726 | Edoardo Di Napoli | Lukas Kr\"amer, Edoardo Di Napoli, Martin Galgon, Bruno Lang, and
Paolo Bientinesi | Dissecting the FEAST algorithm for generalized eigenproblems | 11 Pages, 5 Figures. Submitted to Journal of Computational and
Applied Mathematics | null | null | null | cs.NA math.NA | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We analyze the FEAST method for computing selected eigenvalues and
eigenvectors of large sparse matrix pencils. After establishing the close
connection between FEAST and the well-known Rayleigh-Ritz method, we identify
several critical issues that influence convergence and accuracy of the solver:
the choice of the st... | [
{
"created": "Sun, 8 Apr 2012 10:32:18 GMT",
"version": "v1"
}
] | 2012-04-10 | [
[
"Krämer",
"Lukas",
""
],
[
"Di Napoli",
"Edoardo",
""
],
[
"Galgon",
"Martin",
""
],
[
"Lang",
"Bruno",
""
],
[
"Bientinesi",
"Paolo",
""
]
] | We analyze the FEAST method for computing selected eigenvalues and eigenvectors of large sparse matrix pencils. After establishing the close connection between FEAST and the well-known Rayleigh-Ritz method, we identify several critical issues that influence convergence and accuracy of the solver: the choice of the star... |
2312.03579 | Minna Hirvonen | Minna Hirvonen | The Implication Problem for Functional Dependencies and Variants of
Marginal Distribution Equivalences | 23 pages, improved version after reviewer comments, results unchanged | null | null | null | cs.LO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We study functional dependencies together with two different probabilistic
dependency notions: unary marginal identity and unary marginal distribution
equivalence. A unary marginal identity states that two variables x and y are
identically distributed. A unary marginal distribution equivalence states that
the multise... | [
{
"created": "Wed, 6 Dec 2023 16:15:16 GMT",
"version": "v1"
},
{
"created": "Fri, 17 May 2024 15:50:55 GMT",
"version": "v2"
}
] | 2024-05-20 | [
[
"Hirvonen",
"Minna",
""
]
] | We study functional dependencies together with two different probabilistic dependency notions: unary marginal identity and unary marginal distribution equivalence. A unary marginal identity states that two variables x and y are identically distributed. A unary marginal distribution equivalence states that the multiset ... |
cs/0001019 | Joseph O'Rourke | Erik D. Demaine, Martin L. Demaine, Joseph O'Rourke | PushPush is NP-hard in 2D | 18 pages, 13 figures, 1 table. Improves cs.CG/9911013 | null | null | Smith Technical Report 065 | cs.CG cs.DM | null | We prove that a particular pushing-blocks puzzle is intractable in 2D,
improving an earlier result that established intractability in 3D [OS99]. The
puzzle, inspired by the game *PushPush*, consists of unit square blocks on an
integer lattice. An agent may push blocks (but never pull them) in attempting
to move betwe... | [
{
"created": "Mon, 24 Jan 2000 14:04:42 GMT",
"version": "v1"
}
] | 2007-05-23 | [
[
"Demaine",
"Erik D.",
""
],
[
"Demaine",
"Martin L.",
""
],
[
"O'Rourke",
"Joseph",
""
]
] | We prove that a particular pushing-blocks puzzle is intractable in 2D, improving an earlier result that established intractability in 3D [OS99]. The puzzle, inspired by the game *PushPush*, consists of unit square blocks on an integer lattice. An agent may push blocks (but never pull them) in attempting to move between... |
2202.06140 | Negin Nikafrooz | Negin Nikafrooz, Zachary Fuge, Alexander Leonessa | Grasp Control of a Cable-Driven Robotic Hand Using a PVDF Slip Detection
Sensor | null | null | null | null | cs.RO cs.SY eess.SY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Detecting and preventing slip is a major challenge in robotic hand operation,
underpinning the robot's ability to perform safe and reliable grasps. Using the
robotic hand design from the authors' earlier work, a sensing and control
strategy is proposed here to prevent object slippage. The robotic hand is
cable-driven... | [
{
"created": "Sat, 12 Feb 2022 20:51:12 GMT",
"version": "v1"
}
] | 2022-02-15 | [
[
"Nikafrooz",
"Negin",
""
],
[
"Fuge",
"Zachary",
""
],
[
"Leonessa",
"Alexander",
""
]
] | Detecting and preventing slip is a major challenge in robotic hand operation, underpinning the robot's ability to perform safe and reliable grasps. Using the robotic hand design from the authors' earlier work, a sensing and control strategy is proposed here to prevent object slippage. The robotic hand is cable-driven, ... |
2203.01497 | Shubham Singh | Shubham Singh, Ryan P. Russell and Patrick M. Wensing | Analytical Second-Order Partial Derivatives of Rigid-Body Inverse
Dynamics | Accepted for IROS 2022 (Oct 23-27, 2022 Kyoto) | null | null | null | cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Optimization-based robot control strategies often rely on first-order
dynamics approximation methods, as in iLQR. Using second-order approximations
of the dynamics is expensive due to the costly second-order partial derivatives
of the dynamics with respect to the state and control. Current approaches for
calculating ... | [
{
"created": "Thu, 3 Mar 2022 03:21:06 GMT",
"version": "v1"
},
{
"created": "Sun, 14 Aug 2022 21:55:26 GMT",
"version": "v2"
}
] | 2022-08-16 | [
[
"Singh",
"Shubham",
""
],
[
"Russell",
"Ryan P.",
""
],
[
"Wensing",
"Patrick M.",
""
]
] | Optimization-based robot control strategies often rely on first-order dynamics approximation methods, as in iLQR. Using second-order approximations of the dynamics is expensive due to the costly second-order partial derivatives of the dynamics with respect to the state and control. Current approaches for calculating th... |
1305.7167 | Pavel Zaichenkov | Pavel Zaichenkov (1 and 4), Bert Gijsbers (2 and 3), Clemens Grelck
(3), Olga Tveretina (1), Alex Shafarenko (1) ((1) University of
Hertfordshire, (2) Ghent University, (3) University of Amsterdam, (4) Moscow
Institute of Physics and Technology) | A Case Study in Coordination Programming: Performance Evaluation of
S-Net vs Intel's Concurrent Collections | 9 pages, 8 figures, 1 table, accepted for PLC 2014 workshop | null | null | null | cs.PL cs.DC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We present a programming methodology and runtime performance case study
comparing the declarative data flow coordination language S-Net with Intel's
Concurrent Collections (CnC). As a coordination language S-Net achieves a
near-complete separation of concerns between sequential software components
implemented in a se... | [
{
"created": "Thu, 30 May 2013 17:21:26 GMT",
"version": "v1"
},
{
"created": "Sat, 15 Jun 2013 11:01:14 GMT",
"version": "v2"
},
{
"created": "Thu, 7 Nov 2013 00:40:07 GMT",
"version": "v3"
},
{
"created": "Thu, 3 Apr 2014 12:24:47 GMT",
"version": "v4"
}
] | 2014-04-04 | [
[
"Zaichenkov",
"Pavel",
"",
"1 and 4"
],
[
"Gijsbers",
"Bert",
"",
"2 and 3"
],
[
"Grelck",
"Clemens",
""
],
[
"Tveretina",
"Olga",
""
],
[
"Shafarenko",
"Alex",
""
]
] | We present a programming methodology and runtime performance case study comparing the declarative data flow coordination language S-Net with Intel's Concurrent Collections (CnC). As a coordination language S-Net achieves a near-complete separation of concerns between sequential software components implemented in a sepa... |
2006.10592 | Nitin Saurabh | Balagopal Komarath and Nitin Saurabh | On the complexity of detecting hazards | To appear in Information Processing Letters | null | null | null | cs.CC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Detecting and eliminating logic hazards in Boolean circuits is a fundamental
problem in logic circuit design. We show that there is no $O(3^{(1-\epsilon)n}
\text{poly}(s))$ time algorithm, for any $\epsilon > 0$, that detects logic
hazards in Boolean circuits of size $s$ on $n$ variables under the assumption
that the... | [
{
"created": "Thu, 18 Jun 2020 14:55:08 GMT",
"version": "v1"
}
] | 2020-06-19 | [
[
"Komarath",
"Balagopal",
""
],
[
"Saurabh",
"Nitin",
""
]
] | Detecting and eliminating logic hazards in Boolean circuits is a fundamental problem in logic circuit design. We show that there is no $O(3^{(1-\epsilon)n} \text{poly}(s))$ time algorithm, for any $\epsilon > 0$, that detects logic hazards in Boolean circuits of size $s$ on $n$ variables under the assumption that the s... |
cs/0510058 | Peter Jung | Peter Jung | Precoding for 2x2 Doubly-Dispersive WSSUS Channels | 6 pages, 6th International ITG-Conference on Source and Channel
Coding (SCC 2006), Apr., 2006, Munich, typos corrected | null | null | null | cs.IT math.IT | null | Optimal link adaption to the scattering function of wide sense stationary
uncorrelated scattering (WSSUS) mobile communication channels is still an
unsolved problem despite its importance for next-generation system design. In
multicarrier transmission such link adaption is performed by pulse shaping
which in turn is ... | [
{
"created": "Thu, 20 Oct 2005 14:57:12 GMT",
"version": "v1"
},
{
"created": "Mon, 16 Jan 2006 09:06:09 GMT",
"version": "v2"
}
] | 2007-07-13 | [
[
"Jung",
"Peter",
""
]
] | Optimal link adaption to the scattering function of wide sense stationary uncorrelated scattering (WSSUS) mobile communication channels is still an unsolved problem despite its importance for next-generation system design. In multicarrier transmission such link adaption is performed by pulse shaping which in turn is eq... |
1810.09379 | Alexandre Rademaker | Alessandra Cid and Alexandre Rademaker and Bruno Cuconato and Valeria
de Paiva | Linguistic Legal Concept Extraction in Portuguese | This work was accepted for publication in the JURIX 2018
(http://jurix2018.ai.rug.nl) in a short 5-pages version | null | null | null | cs.CL | http://creativecommons.org/licenses/by/4.0/ | This work investigates legal concepts and their expression in Portuguese,
concentrating on the "Order of Attorneys of Brazil" Bar exam. Using a corpus
formed by a collection of multiple-choice questions, three norms related to the
Ethics part of the OAB exam, language resources (Princeton WordNet and
OpenWordNet-PT) ... | [
{
"created": "Mon, 22 Oct 2018 15:58:57 GMT",
"version": "v1"
}
] | 2018-10-23 | [
[
"Cid",
"Alessandra",
""
],
[
"Rademaker",
"Alexandre",
""
],
[
"Cuconato",
"Bruno",
""
],
[
"de Paiva",
"Valeria",
""
]
] | This work investigates legal concepts and their expression in Portuguese, concentrating on the "Order of Attorneys of Brazil" Bar exam. Using a corpus formed by a collection of multiple-choice questions, three norms related to the Ethics part of the OAB exam, language resources (Princeton WordNet and OpenWordNet-PT) an... |
1309.5439 | Mickael Randour | V\'eronique Bruy\`ere, Emmanuel Filiot, Mickael Randour and
Jean-Fran\c{c}ois Raskin | Meet Your Expectations With Guarantees: Beyond Worst-Case Synthesis in
Quantitative Games | Extended version. Journal version published in Information and
Computation, conference version published in STACS 2014 | null | null | null | cs.GT cs.FL cs.LO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We extend the quantitative synthesis framework by going beyond the
worst-case. On the one hand, classical analysis of two-player games involves an
adversary (modeling the environment of the system) which is purely antagonistic
and asks for strict guarantees. On the other hand, stochastic models like
Markov decision p... | [
{
"created": "Sat, 21 Sep 2013 05:44:00 GMT",
"version": "v1"
},
{
"created": "Tue, 8 Oct 2013 18:30:41 GMT",
"version": "v2"
},
{
"created": "Thu, 2 Jan 2014 10:13:00 GMT",
"version": "v3"
},
{
"created": "Wed, 29 Oct 2014 18:31:34 GMT",
"version": "v4"
},
{
"cre... | 2015-11-02 | [
[
"Bruyère",
"Véronique",
""
],
[
"Filiot",
"Emmanuel",
""
],
[
"Randour",
"Mickael",
""
],
[
"Raskin",
"Jean-François",
""
]
] | We extend the quantitative synthesis framework by going beyond the worst-case. On the one hand, classical analysis of two-player games involves an adversary (modeling the environment of the system) which is purely antagonistic and asks for strict guarantees. On the other hand, stochastic models like Markov decision pro... |
1811.07126 | Xue Yang | Xue Yang, Jirui Yang, Junchi Yan, Yue Zhang, Tengfei Zhang, Zhi Guo,
Sun Xian and Kun Fu | SCRDet: Towards More Robust Detection for Small, Cluttered and Rotated
Objects | 10 pages, 10 figures, 6 tables, ICCV2019 | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Object detection has been a building block in computer vision. Though
considerable progress has been made, there still exist challenges for objects
with small size, arbitrary direction, and dense distribution. Apart from
natural images, such issues are especially pronounced for aerial images of
great importance. This... | [
{
"created": "Sat, 17 Nov 2018 08:24:25 GMT",
"version": "v1"
},
{
"created": "Tue, 20 Nov 2018 08:22:24 GMT",
"version": "v2"
},
{
"created": "Thu, 1 Aug 2019 06:50:29 GMT",
"version": "v3"
},
{
"created": "Sat, 10 Aug 2019 02:53:31 GMT",
"version": "v4"
}
] | 2019-08-13 | [
[
"Yang",
"Xue",
""
],
[
"Yang",
"Jirui",
""
],
[
"Yan",
"Junchi",
""
],
[
"Zhang",
"Yue",
""
],
[
"Zhang",
"Tengfei",
""
],
[
"Guo",
"Zhi",
""
],
[
"Xian",
"Sun",
""
],
[
"Fu",
"Kun",
""
]
... | Object detection has been a building block in computer vision. Though considerable progress has been made, there still exist challenges for objects with small size, arbitrary direction, and dense distribution. Apart from natural images, such issues are especially pronounced for aerial images of great importance. This p... |
1507.08781 | Leonid Yaroslavsky | L. Yaroslavsky | Can compressed sensing beat the Nyquist sampling rate? | null | Opt. Eng. 54(7) 079701 (2015) | 10.1117/1.OE.54.7.079701 | null | cs.IT math.IT physics.optics | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Data saving capability of "Compressed sensing (sampling)" in signal
discretization is disputed and found to be far below the theoretical upper
bound defined by the signal sparsity. On a simple and intuitive example, it is
demonstrated that, in a realistic scenario for signals that are believed to be
sparse, one can a... | [
{
"created": "Fri, 31 Jul 2015 07:40:36 GMT",
"version": "v1"
}
] | 2015-10-28 | [
[
"Yaroslavsky",
"L.",
""
]
] | Data saving capability of "Compressed sensing (sampling)" in signal discretization is disputed and found to be far below the theoretical upper bound defined by the signal sparsity. On a simple and intuitive example, it is demonstrated that, in a realistic scenario for signals that are believed to be sparse, one can ach... |
1807.05798 | Jimmy Lin | Jimmy Lin and Peilin Yang | Repeatability Corner Cases in Document Ranking: The Impact of Score Ties | Published in the Proceedings of the 42nd Annual International ACM
SIGIR Conference on Research and Development in Information Retrieval (SIGIR
2019) | null | 10.1145/3331184.3331339 | null | cs.IR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Document ranking experiments should be repeatable. However, the interaction
between multi-threaded indexing and score ties during retrieval may yield
non-deterministic rankings, making repeatability not as trivial as one might
imagine. In the context of the open-source Lucene search engine, score ties are
broken by i... | [
{
"created": "Mon, 16 Jul 2018 11:32:52 GMT",
"version": "v1"
},
{
"created": "Mon, 2 Sep 2019 20:16:41 GMT",
"version": "v2"
}
] | 2019-09-04 | [
[
"Lin",
"Jimmy",
""
],
[
"Yang",
"Peilin",
""
]
] | Document ranking experiments should be repeatable. However, the interaction between multi-threaded indexing and score ties during retrieval may yield non-deterministic rankings, making repeatability not as trivial as one might imagine. In the context of the open-source Lucene search engine, score ties are broken by int... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.