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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
2306.06276 | Xiaodong Cai | Anchen Sun, Elizabeth J. Franzmann, Zhibin Chen, Xiaodong Cai | Contrastive Learning for Predicting Cancer Prognosis Using Gene
Expression Values | null | null | null | null | cs.LG | http://creativecommons.org/licenses/by-nc-nd/4.0/ | Recent advancements in image classification have demonstrated that
contrastive learning (CL) can aid in further learning tasks by acquiring good
feature representation from a limited number of data samples. In this paper, we
applied CL to tumor transcriptomes and clinical data to learn feature
representations in a lo... | [
{
"created": "Fri, 9 Jun 2023 22:03:18 GMT",
"version": "v1"
},
{
"created": "Tue, 19 Sep 2023 03:52:55 GMT",
"version": "v2"
},
{
"created": "Thu, 9 May 2024 04:38:57 GMT",
"version": "v3"
},
{
"created": "Thu, 16 May 2024 22:31:37 GMT",
"version": "v4"
}
] | 2024-05-20 | [
[
"Sun",
"Anchen",
""
],
[
"Franzmann",
"Elizabeth J.",
""
],
[
"Chen",
"Zhibin",
""
],
[
"Cai",
"Xiaodong",
""
]
] | Recent advancements in image classification have demonstrated that contrastive learning (CL) can aid in further learning tasks by acquiring good feature representation from a limited number of data samples. In this paper, we applied CL to tumor transcriptomes and clinical data to learn feature representations in a low-... |
2304.14778 | Arvid Becker | Arvid Becker, Pedro Cabalar, Mart\'in Di\'eguez, Torsten Schaub, Anna
Schuhmann | Metric Temporal Equilibrium Logic over Timed Traces | Under consideration in Theory and Practice of Logic Programming
(TPLP) | null | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In temporal extensions of Answer Set Programming (ASP) based on linear-time,
the behavior of dynamic systems is captured by sequences of states. While this
representation reflects their relative order, it abstracts away the specific
times associated with each state. However, timing constraints are important in
many a... | [
{
"created": "Fri, 28 Apr 2023 11:39:49 GMT",
"version": "v1"
},
{
"created": "Fri, 3 May 2024 12:40:35 GMT",
"version": "v2"
}
] | 2024-05-06 | [
[
"Becker",
"Arvid",
""
],
[
"Cabalar",
"Pedro",
""
],
[
"Diéguez",
"Martín",
""
],
[
"Schaub",
"Torsten",
""
],
[
"Schuhmann",
"Anna",
""
]
] | In temporal extensions of Answer Set Programming (ASP) based on linear-time, the behavior of dynamic systems is captured by sequences of states. While this representation reflects their relative order, it abstracts away the specific times associated with each state. However, timing constraints are important in many app... |
2404.13421 | Michael Duchesne | Michael Duchesne, Kaiwen Zhang, Chamseddine Talhi | MultiConfederated Learning: Inclusive Non-IID Data handling with
Decentralized Federated Learning | null | Proceedings of the 39th ACM/SIGAPP Symposium on Applied Computing,
SAC '24, 1587-1595, April 2024. ACM | 10.1145/3605098.3636000 | null | cs.LG cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Federated Learning (FL) has emerged as a prominent privacy-preserving
technique for enabling use cases like confidential clinical machine learning.
FL operates by aggregating models trained by remote devices which owns the
data. Thus, FL enables the training of powerful global models using
crowd-sourced data from a l... | [
{
"created": "Sat, 20 Apr 2024 16:38:26 GMT",
"version": "v1"
}
] | 2024-04-23 | [
[
"Duchesne",
"Michael",
""
],
[
"Zhang",
"Kaiwen",
""
],
[
"Talhi",
"Chamseddine",
""
]
] | Federated Learning (FL) has emerged as a prominent privacy-preserving technique for enabling use cases like confidential clinical machine learning. FL operates by aggregating models trained by remote devices which owns the data. Thus, FL enables the training of powerful global models using crowd-sourced data from a lar... |
2211.08234 | Jun Jin | Jun Jin, Hongming Zhang, Jun Luo | Build generally reusable agent-environment interaction models | Accepted in Foundation Models for Decision Making Workshop at Neural
Information Processing Systems, 2022. Slides:
https://docs.google.com/presentation/d/1PMS2xwTcztP2pPk1bsjqkQscI39Wy5tpmoE5-_ZC7Fo/edit?usp=sharing | null | null | null | cs.LG cs.AI | http://creativecommons.org/licenses/by/4.0/ | This paper tackles the problem of how to pre-train a model and make it
generally reusable backbones for downstream task learning. In pre-training, we
propose a method that builds an agent-environment interaction model by learning
domain invariant successor features from the agent's vast experiences covering
various t... | [
{
"created": "Sun, 13 Nov 2022 07:33:14 GMT",
"version": "v1"
}
] | 2022-11-16 | [
[
"Jin",
"Jun",
""
],
[
"Zhang",
"Hongming",
""
],
[
"Luo",
"Jun",
""
]
] | This paper tackles the problem of how to pre-train a model and make it generally reusable backbones for downstream task learning. In pre-training, we propose a method that builds an agent-environment interaction model by learning domain invariant successor features from the agent's vast experiences covering various tas... |
2407.01490 | Lu\'isa Shimabucoro | Lu\'isa Shimabucoro, Sebastian Ruder, Julia Kreutzer, Marzieh Fadaee
and Sara Hooker | LLM See, LLM Do: Guiding Data Generation to Target Non-Differentiable
Objectives | null | null | null | null | cs.CL cs.AI cs.LG | http://creativecommons.org/licenses/by/4.0/ | The widespread adoption of synthetic data raises new questions about how
models generating the data can influence other large language models (LLMs) via
distilled data. To start, our work exhaustively characterizes the impact of
passive inheritance of model properties by systematically studying the
consequences of sy... | [
{
"created": "Mon, 1 Jul 2024 17:26:21 GMT",
"version": "v1"
},
{
"created": "Fri, 19 Jul 2024 10:45:21 GMT",
"version": "v2"
}
] | 2024-07-22 | [
[
"Shimabucoro",
"Luísa",
""
],
[
"Ruder",
"Sebastian",
""
],
[
"Kreutzer",
"Julia",
""
],
[
"Fadaee",
"Marzieh",
""
],
[
"Hooker",
"Sara",
""
]
] | The widespread adoption of synthetic data raises new questions about how models generating the data can influence other large language models (LLMs) via distilled data. To start, our work exhaustively characterizes the impact of passive inheritance of model properties by systematically studying the consequences of synt... |
1803.07519 | Minhui Xue | Lei Ma, Felix Juefei-Xu, Fuyuan Zhang, Jiyuan Sun, Minhui Xue, Bo Li,
Chunyang Chen, Ting Su, Li Li, Yang Liu, Jianjun Zhao, Yadong Wang | DeepGauge: Multi-Granularity Testing Criteria for Deep Learning Systems | The 33rd IEEE/ACM International Conference on Automated Software
Engineering (ASE 2018) | DeepGauge: Multi-Granularity Testing Criteria for Deep Learning
Systems. In Proceedings of the 33rd ACM/IEEE International Conference on
Automated Software Engineering (ASE 18), September 3-7, 2018, Montpellier,
France | 10.1145/3238147.3238202 | null | cs.SE cs.CR cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Deep learning (DL) defines a new data-driven programming paradigm that
constructs the internal system logic of a crafted neuron network through a set
of training data. We have seen wide adoption of DL in many safety-critical
scenarios. However, a plethora of studies have shown that the state-of-the-art
DL systems suf... | [
{
"created": "Tue, 20 Mar 2018 16:52:12 GMT",
"version": "v1"
},
{
"created": "Tue, 15 May 2018 05:02:54 GMT",
"version": "v2"
},
{
"created": "Sat, 28 Jul 2018 07:47:27 GMT",
"version": "v3"
},
{
"created": "Tue, 14 Aug 2018 23:07:39 GMT",
"version": "v4"
}
] | 2018-08-16 | [
[
"Ma",
"Lei",
""
],
[
"Juefei-Xu",
"Felix",
""
],
[
"Zhang",
"Fuyuan",
""
],
[
"Sun",
"Jiyuan",
""
],
[
"Xue",
"Minhui",
""
],
[
"Li",
"Bo",
""
],
[
"Chen",
"Chunyang",
""
],
[
"Su",
"Ting",
... | Deep learning (DL) defines a new data-driven programming paradigm that constructs the internal system logic of a crafted neuron network through a set of training data. We have seen wide adoption of DL in many safety-critical scenarios. However, a plethora of studies have shown that the state-of-the-art DL systems suffe... |
2205.00366 | Venkat Margapuri | Venkat Margapuri, Trevor Rife, Chaney Courtney, Brandon Schlautman,
Kai Zhao, Mitchell Neilsen | Fractional Vegetation Cover Estimation using Hough Lines and Linear
Iterative Clustering | null | null | null | null | cs.CV | http://creativecommons.org/licenses/by/4.0/ | A common requirement of plant breeding programs across the country is
companion planting -- growing different species of plants in close proximity so
they can mutually benefit each other. However, the determination of companion
plants requires meticulous monitoring of plant growth. The technique of ocular
monitoring ... | [
{
"created": "Sat, 30 Apr 2022 23:33:31 GMT",
"version": "v1"
}
] | 2022-05-03 | [
[
"Margapuri",
"Venkat",
""
],
[
"Rife",
"Trevor",
""
],
[
"Courtney",
"Chaney",
""
],
[
"Schlautman",
"Brandon",
""
],
[
"Zhao",
"Kai",
""
],
[
"Neilsen",
"Mitchell",
""
]
] | A common requirement of plant breeding programs across the country is companion planting -- growing different species of plants in close proximity so they can mutually benefit each other. However, the determination of companion plants requires meticulous monitoring of plant growth. The technique of ocular monitoring is... |
2210.11806 | Li Chong | Li Chong, Denghao Ma, Yueguo Chen | Multi-view Semantic Matching of Question retrieval using Fine-grained
Semantic Representations | 10 pages | null | null | null | cs.IR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | As a key task of question answering, question retrieval has attracted much
attention from the communities of academia and industry. Previous solutions
mainly focus on the translation model, topic model, and deep learning
techniques. Distinct from the previous solutions, we propose to construct
fine-grained semantic r... | [
{
"created": "Fri, 21 Oct 2022 08:32:38 GMT",
"version": "v1"
},
{
"created": "Thu, 16 Feb 2023 01:46:57 GMT",
"version": "v2"
}
] | 2023-02-17 | [
[
"Chong",
"Li",
""
],
[
"Ma",
"Denghao",
""
],
[
"Chen",
"Yueguo",
""
]
] | As a key task of question answering, question retrieval has attracted much attention from the communities of academia and industry. Previous solutions mainly focus on the translation model, topic model, and deep learning techniques. Distinct from the previous solutions, we propose to construct fine-grained semantic rep... |
1808.03322 | Nicholas DeMarinis | Nicholas DeMarinis, Stefanie Tellex, Vasileios Kemerlis, George
Konidaris, Rodrigo Fonseca | Scanning the Internet for ROS: A View of Security in Robotics Research | 10 pages | null | null | null | cs.CR cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Because robots can directly perceive and affect the physical world, security
issues take on particular importance. In this paper, we describe the results of
our work on scanning the entire IPv4 address space of the Internet for
instances of the Robot Operating System (ROS), a widely used robotics platform
for researc... | [
{
"created": "Mon, 23 Jul 2018 13:05:03 GMT",
"version": "v1"
}
] | 2018-08-13 | [
[
"DeMarinis",
"Nicholas",
""
],
[
"Tellex",
"Stefanie",
""
],
[
"Kemerlis",
"Vasileios",
""
],
[
"Konidaris",
"George",
""
],
[
"Fonseca",
"Rodrigo",
""
]
] | Because robots can directly perceive and affect the physical world, security issues take on particular importance. In this paper, we describe the results of our work on scanning the entire IPv4 address space of the Internet for instances of the Robot Operating System (ROS), a widely used robotics platform for research.... |
2109.06481 | Jongyoon Song | Jongyoon Song, Sungwon Kim, and Sungroh Yoon | AligNART: Non-autoregressive Neural Machine Translation by Jointly
Learning to Estimate Alignment and Translate | Accepted by EMNLP 2021 | null | null | null | cs.CL cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Non-autoregressive neural machine translation (NART) models suffer from the
multi-modality problem which causes translation inconsistency such as token
repetition. Most recent approaches have attempted to solve this problem by
implicitly modeling dependencies between outputs. In this paper, we introduce
AligNART, whi... | [
{
"created": "Tue, 14 Sep 2021 07:26:33 GMT",
"version": "v1"
}
] | 2021-09-15 | [
[
"Song",
"Jongyoon",
""
],
[
"Kim",
"Sungwon",
""
],
[
"Yoon",
"Sungroh",
""
]
] | Non-autoregressive neural machine translation (NART) models suffer from the multi-modality problem which causes translation inconsistency such as token repetition. Most recent approaches have attempted to solve this problem by implicitly modeling dependencies between outputs. In this paper, we introduce AligNART, which... |
2310.05387 | Da Long | Da Long, Wei W. Xing, Aditi S. Krishnapriyan, Robert M. Kirby,
Shandian Zhe, Michael W. Mahoney | Equation Discovery with Bayesian Spike-and-Slab Priors and Efficient
Kernels | null | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Discovering governing equations from data is important to many scientific and
engineering applications. Despite promising successes, existing methods are
still challenged by data sparsity and noise issues, both of which are
ubiquitous in practice. Moreover, state-of-the-art methods lack uncertainty
quantification and... | [
{
"created": "Mon, 9 Oct 2023 03:55:09 GMT",
"version": "v1"
},
{
"created": "Mon, 22 Apr 2024 02:07:18 GMT",
"version": "v2"
}
] | 2024-04-23 | [
[
"Long",
"Da",
""
],
[
"Xing",
"Wei W.",
""
],
[
"Krishnapriyan",
"Aditi S.",
""
],
[
"Kirby",
"Robert M.",
""
],
[
"Zhe",
"Shandian",
""
],
[
"Mahoney",
"Michael W.",
""
]
] | Discovering governing equations from data is important to many scientific and engineering applications. Despite promising successes, existing methods are still challenged by data sparsity and noise issues, both of which are ubiquitous in practice. Moreover, state-of-the-art methods lack uncertainty quantification and/o... |
2302.13290 | Stefan Schoder | Stefan Schoder | Implementation of an aeroacoustic simulation pipeline using
openCFS-Acoustics and openCFS-Data applied to human phonation | 9 pages, 4 figures | null | null | null | cs.SD eess.AS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The human phonation process be modeled using the Finite Element Method (FEM)
which provides a detailed representation of the voice production process. A
software implementation in C++ using FEM (openCFS) has been used to simulate
the phonation process. The FEM model consists of a 3D mesh of the upper human
airways. T... | [
{
"created": "Sun, 26 Feb 2023 10:46:15 GMT",
"version": "v1"
}
] | 2023-02-28 | [
[
"Schoder",
"Stefan",
""
]
] | The human phonation process be modeled using the Finite Element Method (FEM) which provides a detailed representation of the voice production process. A software implementation in C++ using FEM (openCFS) has been used to simulate the phonation process. The FEM model consists of a 3D mesh of the upper human airways. The... |
2305.07717 | Souad Taouti | Souad Taouti, Hadda Cherroun and Djelloul Ziadi | Parallel Tree Kernel Computation | 9 pages, 4 figures | null | null | null | cs.CL | http://creativecommons.org/licenses/by/4.0/ | Tree kernels are fundamental tools that have been leveraged in many
applications, particularly those based on machine learning for Natural Language
Processing tasks. In this paper, we devise a parallel implementation of the
sequential algorithm for the computation of some tree kernels of two finite
sets of trees (Oua... | [
{
"created": "Fri, 12 May 2023 18:16:45 GMT",
"version": "v1"
}
] | 2023-05-16 | [
[
"Taouti",
"Souad",
""
],
[
"Cherroun",
"Hadda",
""
],
[
"Ziadi",
"Djelloul",
""
]
] | Tree kernels are fundamental tools that have been leveraged in many applications, particularly those based on machine learning for Natural Language Processing tasks. In this paper, we devise a parallel implementation of the sequential algorithm for the computation of some tree kernels of two finite sets of trees (Ouali... |
2210.15504 | Navid Kayhani | Navid Kayhani, Angela Schoellig, and Brenda McCabe | Perception-aware Tag Placement Planning for Robust Localization of UAVs
in Indoor Construction Environments | [Final draft] This material may be downloaded for personal use only.
Any other use requires prior permission of the American Society of Civil
Engineers and the Journal of Computing in Civil Engineering | null | 10.1061/JCCEE5/CPENG-5068 | null | cs.RO | http://creativecommons.org/licenses/by-nc-nd/4.0/ | Tag-based visual-inertial localization is a lightweight method for enabling
autonomous data collection missions of low-cost unmanned aerial vehicles (UAVs)
in indoor construction environments. However, finding the optimal tag
configuration (i.e., number, size, and location) on dynamic construction sites
remains chall... | [
{
"created": "Thu, 27 Oct 2022 14:37:57 GMT",
"version": "v1"
}
] | 2022-10-28 | [
[
"Kayhani",
"Navid",
""
],
[
"Schoellig",
"Angela",
""
],
[
"McCabe",
"Brenda",
""
]
] | Tag-based visual-inertial localization is a lightweight method for enabling autonomous data collection missions of low-cost unmanned aerial vehicles (UAVs) in indoor construction environments. However, finding the optimal tag configuration (i.e., number, size, and location) on dynamic construction sites remains challen... |
2207.07901 | Mahyuddin K. M. Nasution | Mahyuddin K. M. Nasution, Rahmat Hidayat, and Rahmad Syah | Computer Science | 18, 2 figures | International Journal on Advanced Science Engineering Information
Technology, 12(3), 2022 | null | 123 | cs.CY | http://creativecommons.org/publicdomain/zero/1.0/ | Possible for science itself, conceptually, to have and will understand
differently, let alone science also seen as technology, such as computer
science. After all, science and technology are viewpoints diverse by either
individual, community, or social. Generally, it depends on socioeconomic
capabilities. So it is wi... | [
{
"created": "Sat, 16 Jul 2022 10:54:57 GMT",
"version": "v1"
}
] | 2022-07-19 | [
[
"Nasution",
"Mahyuddin K. M.",
""
],
[
"Hidayat",
"Rahmat",
""
],
[
"Syah",
"Rahmad",
""
]
] | Possible for science itself, conceptually, to have and will understand differently, let alone science also seen as technology, such as computer science. After all, science and technology are viewpoints diverse by either individual, community, or social. Generally, it depends on socioeconomic capabilities. So it is with... |
1809.01721 | Ismail Shahin | Ismail Shahin and Ali Bou Nassif | Three-Stage Speaker Verification Architecture in Emotional Talking
Environments | 18 pages. arXiv admin note: substantial text overlap with
arXiv:1804.00155, arXiv:1707.00137 | International Journal of Speech Technology, 2018 | 10.1007/s10772-018-9543-4 | null | cs.SD cs.AI eess.AS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Speaker verification performance in neutral talking environment is usually
high, while it is sharply decreased in emotional talking environments. This
performance degradation in emotional environments is due to the problem of
mismatch between training in neutral environment while testing in emotional
environments. In... | [
{
"created": "Mon, 3 Sep 2018 09:25:35 GMT",
"version": "v1"
}
] | 2018-09-07 | [
[
"Shahin",
"Ismail",
""
],
[
"Nassif",
"Ali Bou",
""
]
] | Speaker verification performance in neutral talking environment is usually high, while it is sharply decreased in emotional talking environments. This performance degradation in emotional environments is due to the problem of mismatch between training in neutral environment while testing in emotional environments. In t... |
1606.03194 | Virendra Sule | Mayuresh Bakshi, Virendra Sule, Maryam Shoejai Baghini | Stabilization Theory for Active Multi Port Networks | 9 pages, 6 figures | null | null | null | cs.SY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper proposes a theory for designing stable interconnection of linear
active multi-port networks at the ports. Such interconnections can lead to
unstable networks even if the original networks are stable with respect to
bounded port excitations. Hence such a theory is necessary for realising
interconnections of... | [
{
"created": "Fri, 10 Jun 2016 05:58:23 GMT",
"version": "v1"
}
] | 2016-06-13 | [
[
"Bakshi",
"Mayuresh",
""
],
[
"Sule",
"Virendra",
""
],
[
"Baghini",
"Maryam Shoejai",
""
]
] | This paper proposes a theory for designing stable interconnection of linear active multi-port networks at the ports. Such interconnections can lead to unstable networks even if the original networks are stable with respect to bounded port excitations. Hence such a theory is necessary for realising interconnections of a... |
2011.07743 | Yu Gu | Yu Gu, Sue Kase, Michelle Vanni, Brian Sadler, Percy Liang, Xifeng
Yan, Yu Su | Beyond I.I.D.: Three Levels of Generalization for Question Answering on
Knowledge Bases | Accepted to TheWebConf 2021 (previously WWW) | null | 10.1145/3442381.3449992 | null | cs.CL cs.AI cs.LG | http://creativecommons.org/licenses/by/4.0/ | Existing studies on question answering on knowledge bases (KBQA) mainly
operate with the standard i.i.d assumption, i.e., training distribution over
questions is the same as the test distribution. However, i.i.d may be neither
reasonably achievable nor desirable on large-scale KBs because 1) true user
distribution is... | [
{
"created": "Mon, 16 Nov 2020 06:36:26 GMT",
"version": "v1"
},
{
"created": "Wed, 18 Nov 2020 03:36:38 GMT",
"version": "v2"
},
{
"created": "Sun, 13 Dec 2020 03:13:37 GMT",
"version": "v3"
},
{
"created": "Fri, 12 Feb 2021 18:48:38 GMT",
"version": "v4"
},
{
"c... | 2021-02-24 | [
[
"Gu",
"Yu",
""
],
[
"Kase",
"Sue",
""
],
[
"Vanni",
"Michelle",
""
],
[
"Sadler",
"Brian",
""
],
[
"Liang",
"Percy",
""
],
[
"Yan",
"Xifeng",
""
],
[
"Su",
"Yu",
""
]
] | Existing studies on question answering on knowledge bases (KBQA) mainly operate with the standard i.i.d assumption, i.e., training distribution over questions is the same as the test distribution. However, i.i.d may be neither reasonably achievable nor desirable on large-scale KBs because 1) true user distribution is h... |
2006.11419 | Chuangchuang Sun | Chuangchuang Sun, Dong-Ki Kim, Jonathan P. How | FISAR: Forward Invariant Safe Reinforcement Learning with a Deep Neural
Network-Based Optimize | Accepted to ICML 2020 Workshop Theoretical Foundations of RL;
Accepted to ICRA 2021 | null | null | null | cs.LG cs.AI stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper investigates reinforcement learning with constraints, which are
indispensable in safety-critical environments. To drive the constraint
violation monotonically decrease, we take the constraints as Lyapunov functions
and impose new linear constraints on the policy parameters' updating dynamics.
As a result, ... | [
{
"created": "Fri, 19 Jun 2020 21:58:42 GMT",
"version": "v1"
},
{
"created": "Thu, 9 Jul 2020 03:11:59 GMT",
"version": "v2"
},
{
"created": "Tue, 3 Nov 2020 16:16:15 GMT",
"version": "v3"
},
{
"created": "Wed, 5 May 2021 23:42:55 GMT",
"version": "v4"
}
] | 2021-05-07 | [
[
"Sun",
"Chuangchuang",
""
],
[
"Kim",
"Dong-Ki",
""
],
[
"How",
"Jonathan P.",
""
]
] | This paper investigates reinforcement learning with constraints, which are indispensable in safety-critical environments. To drive the constraint violation monotonically decrease, we take the constraints as Lyapunov functions and impose new linear constraints on the policy parameters' updating dynamics. As a result, th... |
2110.14363 | Mucong Ding | Mucong Ding, Kezhi Kong, Jingling Li, Chen Zhu, John P Dickerson,
Furong Huang, Tom Goldstein | VQ-GNN: A Universal Framework to Scale up Graph Neural Networks using
Vector Quantization | NeurIPS 2021 | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Most state-of-the-art Graph Neural Networks (GNNs) can be defined as a form
of graph convolution which can be realized by message passing between direct
neighbors or beyond. To scale such GNNs to large graphs, various neighbor-,
layer-, or subgraph-sampling techniques are proposed to alleviate the "neighbor
explosion... | [
{
"created": "Wed, 27 Oct 2021 11:48:50 GMT",
"version": "v1"
}
] | 2021-10-28 | [
[
"Ding",
"Mucong",
""
],
[
"Kong",
"Kezhi",
""
],
[
"Li",
"Jingling",
""
],
[
"Zhu",
"Chen",
""
],
[
"Dickerson",
"John P",
""
],
[
"Huang",
"Furong",
""
],
[
"Goldstein",
"Tom",
""
]
] | Most state-of-the-art Graph Neural Networks (GNNs) can be defined as a form of graph convolution which can be realized by message passing between direct neighbors or beyond. To scale such GNNs to large graphs, various neighbor-, layer-, or subgraph-sampling techniques are proposed to alleviate the "neighbor explosion" ... |
1905.07856 | Shivashankar Subramanian | Shivashankar Subramanian and Trevor Cohn and Timothy Baldwin | Target Based Speech Act Classification in Political Campaign Text | Eighth Joint Conference on Lexical and Computational Semantics, *SEM
2019, Camera Ready | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We study pragmatics in political campaign text, through analysis of speech
acts and the target of each utterance. We propose a new annotation schema
incorporating domain-specific speech acts, such as commissive-action, and
present a novel annotated corpus of media releases and speech transcripts from
the 2016 Austral... | [
{
"created": "Mon, 20 May 2019 03:14:11 GMT",
"version": "v1"
}
] | 2019-05-21 | [
[
"Subramanian",
"Shivashankar",
""
],
[
"Cohn",
"Trevor",
""
],
[
"Baldwin",
"Timothy",
""
]
] | We study pragmatics in political campaign text, through analysis of speech acts and the target of each utterance. We propose a new annotation schema incorporating domain-specific speech acts, such as commissive-action, and present a novel annotated corpus of media releases and speech transcripts from the 2016 Australia... |
2403.17014 | Mohamad Dhaini | Mohamad Dhaini, Maxime Berar, Paul Honeine, Antonin Van Exem | Contrastive Learning for Regression on Hyperspectral Data | Accepted in IEEE International Conference on Acoustics, Speech and
Signal Processing (ICASSP) 2024 | null | null | null | cs.CV cs.LG | http://creativecommons.org/licenses/by/4.0/ | Contrastive learning has demonstrated great effectiveness in representation
learning especially for image classification tasks. However, there is still a
shortage in the studies targeting regression tasks, and more specifically
applications on hyperspectral data. In this paper, we propose a contrastive
learning frame... | [
{
"created": "Mon, 12 Feb 2024 21:33:46 GMT",
"version": "v1"
}
] | 2024-03-27 | [
[
"Dhaini",
"Mohamad",
""
],
[
"Berar",
"Maxime",
""
],
[
"Honeine",
"Paul",
""
],
[
"Van Exem",
"Antonin",
""
]
] | Contrastive learning has demonstrated great effectiveness in representation learning especially for image classification tasks. However, there is still a shortage in the studies targeting regression tasks, and more specifically applications on hyperspectral data. In this paper, we propose a contrastive learning framewo... |
2401.14654 | Alice Kwak | Alice Saebom Kwak, Cheonkam Jeong, Ji Weon Lim, and Byeongcheol Min | A Korean Legal Judgment Prediction Dataset for Insurance Disputes | 5 pages, 1 figure | null | null | null | cs.CL cs.LG | http://creativecommons.org/licenses/by-nc-sa/4.0/ | This paper introduces a Korean legal judgment prediction (LJP) dataset for
insurance disputes. Successful LJP models on insurance disputes can benefit
insurance companies and their customers. It can save both sides' time and money
by allowing them to predict how the result would come out if they proceed to
the disput... | [
{
"created": "Fri, 26 Jan 2024 05:26:27 GMT",
"version": "v1"
}
] | 2024-01-29 | [
[
"Kwak",
"Alice Saebom",
""
],
[
"Jeong",
"Cheonkam",
""
],
[
"Lim",
"Ji Weon",
""
],
[
"Min",
"Byeongcheol",
""
]
] | This paper introduces a Korean legal judgment prediction (LJP) dataset for insurance disputes. Successful LJP models on insurance disputes can benefit insurance companies and their customers. It can save both sides' time and money by allowing them to predict how the result would come out if they proceed to the dispute ... |
2403.10579 | Adrian Kliks | Adrian Kliks | Metamaterialy, konfigurowalne matryce antenowe i komunikacja
holograficzna. Wstepna analiza nowej koncepcji bezprzewodowej transmisji
danych | 19 pages, in Polish language, 7 figures | PRZEGLAD TELEKOMUNIKACYJNY I WIADOMOSCI TELEKOMUNIKACYJNE, no.4,
vol. 2023, pp. 29-39 | 10.15199/59.2023.4.4 | null | cs.ET | http://creativecommons.org/licenses/by/4.0/ | In the last few years, a very original concept of holographic communication
has gained a lot of interest among scientists from all over the world. The
specificity of this approach, on the one hand, is very different from the known
and currently used solutions, on the other hand, it creates great development
opportuni... | [
{
"created": "Fri, 15 Mar 2024 10:58:17 GMT",
"version": "v1"
}
] | 2024-03-19 | [
[
"Kliks",
"Adrian",
""
]
] | In the last few years, a very original concept of holographic communication has gained a lot of interest among scientists from all over the world. The specificity of this approach, on the one hand, is very different from the known and currently used solutions, on the other hand, it creates great development opportuniti... |
1811.10986 | Somayeh Asadifar | Somayeh Asadifar, Mohsen Kahani and Saeedeh Shekarpour | HCqa: Hybrid and Complex Question Answering on Textual Corpus and
Knowledge Graph | null | null | null | null | cs.CL cs.IR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Question Answering (QA) systems provide easy access to the vast amount of
knowledge without having to know the underlying complex structure of the
knowledge. The research community has provided ad hoc solutions to the key QA
tasks, including named entity recognition and disambiguation, relation
extraction and query b... | [
{
"created": "Sat, 24 Nov 2018 07:03:53 GMT",
"version": "v1"
},
{
"created": "Thu, 3 Jan 2019 08:19:45 GMT",
"version": "v2"
},
{
"created": "Mon, 28 Jan 2019 09:42:23 GMT",
"version": "v3"
},
{
"created": "Thu, 31 Jan 2019 06:39:48 GMT",
"version": "v4"
},
{
"cr... | 2019-06-11 | [
[
"Asadifar",
"Somayeh",
""
],
[
"Kahani",
"Mohsen",
""
],
[
"Shekarpour",
"Saeedeh",
""
]
] | Question Answering (QA) systems provide easy access to the vast amount of knowledge without having to know the underlying complex structure of the knowledge. The research community has provided ad hoc solutions to the key QA tasks, including named entity recognition and disambiguation, relation extraction and query bui... |
2303.02328 | Sangrok Lee | Sangrok Lee, Jongseong Bae, Ha Young Kim | Decompose, Adjust, Compose: Effective Normalization by Playing with
Frequency for Domain Generalization | 10 pages,6 figures, Conference on Computer Vision and Pattern
Recognition 2023 | null | null | null | cs.CV | http://creativecommons.org/licenses/by/4.0/ | Domain generalization (DG) is a principal task to evaluate the robustness of
computer vision models. Many previous studies have used normalization for DG.
In normalization, statistics and normalized features are regarded as style and
content, respectively. However, it has a content variation problem when
removing sty... | [
{
"created": "Sat, 4 Mar 2023 05:23:11 GMT",
"version": "v1"
},
{
"created": "Mon, 13 Mar 2023 16:04:17 GMT",
"version": "v2"
},
{
"created": "Wed, 15 Mar 2023 12:39:19 GMT",
"version": "v3"
}
] | 2023-03-16 | [
[
"Lee",
"Sangrok",
""
],
[
"Bae",
"Jongseong",
""
],
[
"Kim",
"Ha Young",
""
]
] | Domain generalization (DG) is a principal task to evaluate the robustness of computer vision models. Many previous studies have used normalization for DG. In normalization, statistics and normalized features are regarded as style and content, respectively. However, it has a content variation problem when removing style... |
2402.02592 | Gerald Woo | Gerald Woo, Chenghao Liu, Akshat Kumar, Caiming Xiong, Silvio
Savarese, Doyen Sahoo | Unified Training of Universal Time Series Forecasting Transformers | null | null | null | null | cs.LG cs.AI | http://creativecommons.org/licenses/by/4.0/ | Deep learning for time series forecasting has traditionally operated within a
one-model-per-dataset framework, limiting its potential to leverage the
game-changing impact of large pre-trained models. The concept of universal
forecasting, emerging from pre-training on a vast collection of time series
datasets, envisio... | [
{
"created": "Sun, 4 Feb 2024 20:00:45 GMT",
"version": "v1"
},
{
"created": "Wed, 22 May 2024 11:49:59 GMT",
"version": "v2"
}
] | 2024-05-24 | [
[
"Woo",
"Gerald",
""
],
[
"Liu",
"Chenghao",
""
],
[
"Kumar",
"Akshat",
""
],
[
"Xiong",
"Caiming",
""
],
[
"Savarese",
"Silvio",
""
],
[
"Sahoo",
"Doyen",
""
]
] | Deep learning for time series forecasting has traditionally operated within a one-model-per-dataset framework, limiting its potential to leverage the game-changing impact of large pre-trained models. The concept of universal forecasting, emerging from pre-training on a vast collection of time series datasets, envisions... |
1904.08854 | Fernando Garcia | Fernando Garcia, Amit Kumar Pandey and Charles Fattal | Wait for me! Towards socially assistive walk companions | 2nd Workshop on Social Robots in Therapy and Care. 14th ACM/IEEE
International Conference on Human-Robot Interaction (HRI 2019) | null | null | SREC/2019/01 | cs.RO cs.HC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The aim of the present study involves designing a humanoid robot guide as a
walking trainer for elderly and rehabilitation patients. The system is based on
the humanoid robot Pepper with a compliance approach that allows to match the
motion intention of the user to the robot's pace. This feasibility study is
backed u... | [
{
"created": "Thu, 18 Apr 2019 15:56:14 GMT",
"version": "v1"
}
] | 2019-09-11 | [
[
"Garcia",
"Fernando",
""
],
[
"Pandey",
"Amit Kumar",
""
],
[
"Fattal",
"Charles",
""
]
] | The aim of the present study involves designing a humanoid robot guide as a walking trainer for elderly and rehabilitation patients. The system is based on the humanoid robot Pepper with a compliance approach that allows to match the motion intention of the user to the robot's pace. This feasibility study is backed up ... |
2008.00086 | Songyang Zhang | Songyang Zhang | LearningCC: An online learning approach for congestion control | 5 figures | null | null | null | cs.NI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Recently, much effort has been devoted by researchers from both academia and
industry to develop novel congestion control methods. LearningCC is presented
in this letter, in which the congestion control problem is solved by reinforce
learning approach. Instead of adjusting the congestion window with fixed
policy, the... | [
{
"created": "Mon, 3 Aug 2020 06:51:34 GMT",
"version": "v1"
}
] | 2020-08-04 | [
[
"Zhang",
"Songyang",
""
]
] | Recently, much effort has been devoted by researchers from both academia and industry to develop novel congestion control methods. LearningCC is presented in this letter, in which the congestion control problem is solved by reinforce learning approach. Instead of adjusting the congestion window with fixed policy, there... |
1409.1055 | Uwe Aickelin | Diman Hassan, Uwe Aickelin and Christian Wagner | Comparison of Distance Metrics for Hierarchical Data in Medical
Databases | Proceedings of the 2014 World Congress on Computational Intelligence
(WCCI 2014), pp. 3636-3643, 2014 | null | null | null | cs.DB cs.CE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Distance metrics are broadly used in different research areas and
applications, such as bio-informatics, data mining and many other fields.
However, there are some metrics, like pq-gram and Edit Distance used
specifically for data with a hierarchical structure. Other metrics used for
non-hierarchical data are the geo... | [
{
"created": "Wed, 3 Sep 2014 12:19:19 GMT",
"version": "v1"
}
] | 2014-09-04 | [
[
"Hassan",
"Diman",
""
],
[
"Aickelin",
"Uwe",
""
],
[
"Wagner",
"Christian",
""
]
] | Distance metrics are broadly used in different research areas and applications, such as bio-informatics, data mining and many other fields. However, there are some metrics, like pq-gram and Edit Distance used specifically for data with a hierarchical structure. Other metrics used for non-hierarchical data are the geome... |
1601.03533 | Bernd Zwattendorfer | Bernd Zwattendorfer and Daniel Slamanig | The Austrian eID Ecosystem in the Public Cloud: How to Obtain Privacy
While Preserving Practicality | 47 pages, 5 figures, Journal of Information Security and
Applications, 2015 | null | 10.1016/j.jisa.2015.11.004. | null | cs.CR | http://creativecommons.org/licenses/by-nc-sa/4.0/ | The Austrian eID system constitutes a main pillar within the Austrian
e-Government strategy. The eID system ensures unique identification and secure
authentication for citizens protecting access to applications where sensitive
and personal data is involved. In particular, the Austrian eID system supports
three main u... | [
{
"created": "Thu, 14 Jan 2016 10:08:58 GMT",
"version": "v1"
}
] | 2016-01-15 | [
[
"Zwattendorfer",
"Bernd",
""
],
[
"Slamanig",
"Daniel",
""
]
] | The Austrian eID system constitutes a main pillar within the Austrian e-Government strategy. The eID system ensures unique identification and secure authentication for citizens protecting access to applications where sensitive and personal data is involved. In particular, the Austrian eID system supports three main use... |
2002.05822 | Yangchen Pan | Yangchen Pan, Jincheng Mei, Amir-massoud Farahmand | Frequency-based Search-control in Dyna | Accepted to ICLR 2020 | null | null | null | cs.LG cs.AI stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Model-based reinforcement learning has been empirically demonstrated as a
successful strategy to improve sample efficiency. In particular, Dyna is an
elegant model-based architecture integrating learning and planning that
provides huge flexibility of using a model. One of the most important
components in Dyna is call... | [
{
"created": "Fri, 14 Feb 2020 00:27:58 GMT",
"version": "v1"
}
] | 2020-02-17 | [
[
"Pan",
"Yangchen",
""
],
[
"Mei",
"Jincheng",
""
],
[
"Farahmand",
"Amir-massoud",
""
]
] | Model-based reinforcement learning has been empirically demonstrated as a successful strategy to improve sample efficiency. In particular, Dyna is an elegant model-based architecture integrating learning and planning that provides huge flexibility of using a model. One of the most important components in Dyna is called... |
1208.3839 | Jing-Yan Wang | Jing-Yan Wang | Discriminative Sparse Coding on Multi-Manifold for Data Representation
and Classification | This paper has been withdrawn by the author due to the terrible
writing | null | null | null | cs.CV cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Sparse coding has been popularly used as an effective data representation
method in various applications, such as computer vision, medical imaging and
bioinformatics, etc. However, the conventional sparse coding algorithms and its
manifold regularized variants (graph sparse coding and Laplacian sparse
coding), learn ... | [
{
"created": "Sun, 19 Aug 2012 14:49:27 GMT",
"version": "v1"
},
{
"created": "Wed, 3 Apr 2013 14:21:40 GMT",
"version": "v2"
}
] | 2013-04-04 | [
[
"Wang",
"Jing-Yan",
""
]
] | Sparse coding has been popularly used as an effective data representation method in various applications, such as computer vision, medical imaging and bioinformatics, etc. However, the conventional sparse coding algorithms and its manifold regularized variants (graph sparse coding and Laplacian sparse coding), learn th... |
2407.10112 | Quanming Yao | Yaqing Wang and Hongming Piao and Daxiang Dong and Quanming Yao and
Jingbo Zhou | Warming Up Cold-Start CTR Prediction by Learning Item-Specific Feature
Interactions | KDD 2024 | null | null | null | cs.IR | http://creativecommons.org/licenses/by/4.0/ | In recommendation systems, new items are continuously introduced, initially
lacking interaction records but gradually accumulating them over time.
Accurately predicting the click-through rate (CTR) for these items is crucial
for enhancing both revenue and user experience. While existing methods focus on
enhancing ite... | [
{
"created": "Sun, 14 Jul 2024 07:58:13 GMT",
"version": "v1"
}
] | 2024-07-16 | [
[
"Wang",
"Yaqing",
""
],
[
"Piao",
"Hongming",
""
],
[
"Dong",
"Daxiang",
""
],
[
"Yao",
"Quanming",
""
],
[
"Zhou",
"Jingbo",
""
]
] | In recommendation systems, new items are continuously introduced, initially lacking interaction records but gradually accumulating them over time. Accurately predicting the click-through rate (CTR) for these items is crucial for enhancing both revenue and user experience. While existing methods focus on enhancing item ... |
2303.11502 | Subhadeep Koley | Ayan Kumar Bhunia, Subhadeep Koley, Amandeep Kumar, Aneeshan Sain,
Pinaki Nath Chowdhury, Tao Xiang, Yi-Zhe Song | Sketch2Saliency: Learning to Detect Salient Objects from Human Drawings | CVPR 2023. Project page available at
https://ayankumarbhunia.github.io/Sketch2Saliency/ | null | null | null | cs.CV | http://creativecommons.org/licenses/by-nc-sa/4.0/ | Human sketch has already proved its worth in various visual understanding
tasks (e.g., retrieval, segmentation, image-captioning, etc). In this paper, we
reveal a new trait of sketches - that they are also salient. This is intuitive
as sketching is a natural attentive process at its core. More specifically, we
aim to... | [
{
"created": "Mon, 20 Mar 2023 23:46:46 GMT",
"version": "v1"
},
{
"created": "Thu, 23 Mar 2023 22:14:11 GMT",
"version": "v2"
},
{
"created": "Thu, 30 Mar 2023 15:08:36 GMT",
"version": "v3"
}
] | 2023-03-31 | [
[
"Bhunia",
"Ayan Kumar",
""
],
[
"Koley",
"Subhadeep",
""
],
[
"Kumar",
"Amandeep",
""
],
[
"Sain",
"Aneeshan",
""
],
[
"Chowdhury",
"Pinaki Nath",
""
],
[
"Xiang",
"Tao",
""
],
[
"Song",
"Yi-Zhe",
""
]
] | Human sketch has already proved its worth in various visual understanding tasks (e.g., retrieval, segmentation, image-captioning, etc). In this paper, we reveal a new trait of sketches - that they are also salient. This is intuitive as sketching is a natural attentive process at its core. More specifically, we aim to s... |
2212.10292 | Monika Wysocza\'nska | Monika Wysocza\'nska, Tom Monnier, Tomasz Trzci\'nski, David Picard | Towards Unsupervised Visual Reasoning: Do Off-The-Shelf Features Know
How to Reason? | null | null | null | null | cs.CV cs.AI | http://creativecommons.org/licenses/by/4.0/ | Recent advances in visual representation learning allowed to build an
abundance of powerful off-the-shelf features that are ready-to-use for numerous
downstream tasks. This work aims to assess how well these features preserve
information about the objects, such as their spatial location, their visual
properties and t... | [
{
"created": "Tue, 20 Dec 2022 14:36:45 GMT",
"version": "v1"
}
] | 2022-12-21 | [
[
"Wysoczańska",
"Monika",
""
],
[
"Monnier",
"Tom",
""
],
[
"Trzciński",
"Tomasz",
""
],
[
"Picard",
"David",
""
]
] | Recent advances in visual representation learning allowed to build an abundance of powerful off-the-shelf features that are ready-to-use for numerous downstream tasks. This work aims to assess how well these features preserve information about the objects, such as their spatial location, their visual properties and the... |
1904.00368 | Soheil Mehrabkhani | Soheil Mehrabkhani | Fourier Transform Approach to Machine Learning I: Fourier Regression | null | null | null | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We propose a supervised learning algorithm for machine learning applications.
Contrary to the model developing in the classical methods, which treat
training, validation, and test as separate steps, in the presented approach,
there is a unified training and evaluating procedure based on an iterative band
filtering by... | [
{
"created": "Sun, 31 Mar 2019 09:41:28 GMT",
"version": "v1"
},
{
"created": "Tue, 2 Apr 2019 09:24:18 GMT",
"version": "v2"
},
{
"created": "Sun, 22 Sep 2019 09:22:34 GMT",
"version": "v3"
}
] | 2019-09-24 | [
[
"Mehrabkhani",
"Soheil",
""
]
] | We propose a supervised learning algorithm for machine learning applications. Contrary to the model developing in the classical methods, which treat training, validation, and test as separate steps, in the presented approach, there is a unified training and evaluating procedure based on an iterative band filtering by t... |
2105.09660 | Felix Hamborg | Felix Hamborg and Karsten Donnay and Bela Gipp | Towards Target-dependent Sentiment Classification in News Articles | null | null | 10.1007/978-3-030-71305-8_12 | null | cs.CL cs.CY | http://creativecommons.org/licenses/by-sa/4.0/ | Extensive research on target-dependent sentiment classification (TSC) has led
to strong classification performances in domains where authors tend to
explicitly express sentiment about specific entities or topics, such as in
reviews or on social media. We investigate TSC in news articles, a much less
researched domain... | [
{
"created": "Thu, 20 May 2021 10:48:03 GMT",
"version": "v1"
}
] | 2021-05-21 | [
[
"Hamborg",
"Felix",
""
],
[
"Donnay",
"Karsten",
""
],
[
"Gipp",
"Bela",
""
]
] | Extensive research on target-dependent sentiment classification (TSC) has led to strong classification performances in domains where authors tend to explicitly express sentiment about specific entities or topics, such as in reviews or on social media. We investigate TSC in news articles, a much less researched domain, ... |
1904.09561 | EPTCS | Michele Pagani (IRIF, Universit\'e Paris Diderot, France), Sandra
Alves (Porto University) | Proceedings Twelfth Workshop on Developments in Computational Models and
Ninth Workshop on Intersection Types and Related Systems | null | EPTCS 293, 2019 | 10.4204/EPTCS.293 | null | cs.LO cs.CC cs.PL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This volume contains a final and revised selection of papers presented at
Twelfth Workshop on Developments in Computational Models (DCM 2018) and the
Ninth Workshop on Intersection Types and Related Systems (ITRS 2018), held on
July 8, 2018 in Oxford, in affiliation with FLOC 2018.
| [
{
"created": "Sun, 21 Apr 2019 07:53:20 GMT",
"version": "v1"
}
] | 2019-04-23 | [
[
"Pagani",
"Michele",
"",
"IRIF, Université Paris Diderot, France"
],
[
"Alves",
"Sandra",
"",
"Porto University"
]
] | This volume contains a final and revised selection of papers presented at Twelfth Workshop on Developments in Computational Models (DCM 2018) and the Ninth Workshop on Intersection Types and Related Systems (ITRS 2018), held on July 8, 2018 in Oxford, in affiliation with FLOC 2018. |
2105.03215 | Yida Wang | Zhi Chen, Cody Hao Yu, Trevor Morris, Jorn Tuyls, Yi-Hsiang Lai, Jared
Roesch, Elliott Delaye, Vin Sharma, Yida Wang | Bring Your Own Codegen to Deep Learning Compiler | null | null | null | null | cs.LG cs.PF cs.PL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Deep neural networks (DNNs) have been ubiquitously applied in many
applications, and accelerators are emerged as an enabler to support the fast
and efficient inference tasks of these applications. However, to achieve high
model coverage with high performance, each accelerator vendor has to develop a
full compiler sta... | [
{
"created": "Mon, 3 May 2021 17:22:25 GMT",
"version": "v1"
}
] | 2021-05-10 | [
[
"Chen",
"Zhi",
""
],
[
"Yu",
"Cody Hao",
""
],
[
"Morris",
"Trevor",
""
],
[
"Tuyls",
"Jorn",
""
],
[
"Lai",
"Yi-Hsiang",
""
],
[
"Roesch",
"Jared",
""
],
[
"Delaye",
"Elliott",
""
],
[
"Sharma",
... | Deep neural networks (DNNs) have been ubiquitously applied in many applications, and accelerators are emerged as an enabler to support the fast and efficient inference tasks of these applications. However, to achieve high model coverage with high performance, each accelerator vendor has to develop a full compiler stack... |
2204.09717 | Anwesh Reddy Paduri | Narayana Darapaneni, Selvakumar Raj, Raghul V, Venkatesh Sivaraman,
Sunil Mohan, and Anwesh Reddy Paduri | LSTM-RASA Based Agri Farm Assistant for Farmers | null | null | null | null | cs.CL cs.AI | http://creativecommons.org/licenses/by-nc-nd/4.0/ | The application of Deep Learning and Natural Language based ChatBots are
growing rapidly in recent years. They are used in many fields like customer
support, reservation system and as personal assistant. The Enterprises are
using such ChatBots to serve their customers in a better and efficient manner.
Even after such... | [
{
"created": "Thu, 7 Apr 2022 11:01:54 GMT",
"version": "v1"
}
] | 2022-04-22 | [
[
"Darapaneni",
"Narayana",
""
],
[
"Raj",
"Selvakumar",
""
],
[
"V",
"Raghul",
""
],
[
"Sivaraman",
"Venkatesh",
""
],
[
"Mohan",
"Sunil",
""
],
[
"Paduri",
"Anwesh Reddy",
""
]
] | The application of Deep Learning and Natural Language based ChatBots are growing rapidly in recent years. They are used in many fields like customer support, reservation system and as personal assistant. The Enterprises are using such ChatBots to serve their customers in a better and efficient manner. Even after such t... |
1810.02383 | Alphan Sahin | Alphan Sahin, Rui Yang | A Generic Complementary Sequence Construction and Associated
Encoder/Decoder Design | 15 pages, to appear in IEEE Transactions on Communications | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this study, we propose a flexible construction of complementary sequences
(CSs) that can contain zero-valued elements. To derive the construction, we use
Boolean functions to represent a polynomial generated with a recursion. By
applying this representation to recursive CS constructions, we show the impact
of cons... | [
{
"created": "Thu, 4 Oct 2018 18:13:16 GMT",
"version": "v1"
},
{
"created": "Sat, 27 Jul 2019 20:20:54 GMT",
"version": "v2"
},
{
"created": "Wed, 4 Aug 2021 14:54:38 GMT",
"version": "v3"
}
] | 2021-08-05 | [
[
"Sahin",
"Alphan",
""
],
[
"Yang",
"Rui",
""
]
] | In this study, we propose a flexible construction of complementary sequences (CSs) that can contain zero-valued elements. To derive the construction, we use Boolean functions to represent a polynomial generated with a recursion. By applying this representation to recursive CS constructions, we show the impact of constr... |
1705.05301 | Paschalis Panteleris | Paschalis Panteleris (1) and Antonis Argyros (1 and 2) ((1) Institute
of Computer Science, FORTH, (2) Computer Science Department, University of
Crete) | Back to RGB: 3D tracking of hands and hand-object interactions based on
short-baseline stereo | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We present a novel solution to the problem of 3D tracking of the articulated
motion of human hand(s), possibly in interaction with other objects. The vast
majority of contemporary relevant work capitalizes on depth information
provided by RGBD cameras. In this work, we show that accurate and efficient 3D
hand trackin... | [
{
"created": "Mon, 15 May 2017 15:38:56 GMT",
"version": "v1"
}
] | 2017-05-16 | [
[
"Panteleris",
"Paschalis",
"",
"1 and 2"
],
[
"Argyros",
"Antonis",
"",
"1 and 2"
]
] | We present a novel solution to the problem of 3D tracking of the articulated motion of human hand(s), possibly in interaction with other objects. The vast majority of contemporary relevant work capitalizes on depth information provided by RGBD cameras. In this work, we show that accurate and efficient 3D hand tracking ... |
2001.05572 | Oliver Urbann | Oliver Urbann, Simon Camphausen, Arne Moos, Ingmar Schwarz, S\"oren
Kerner, Maximilian Otten | A C Code Generator for Fast Inference and Simple Deployment of
Convolutional Neural Networks on Resource Constrained Systems | null | null | null | null | cs.LG cs.PF | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Inference of Convolutional Neural Networks in time critical applications
usually requires a GPU. In robotics or embedded devices these are often not
available due to energy, space and cost constraints. Furthermore, installation
of a deep learning framework or even a native compiler on the target platform
is not possi... | [
{
"created": "Tue, 14 Jan 2020 09:46:14 GMT",
"version": "v1"
}
] | 2020-01-17 | [
[
"Urbann",
"Oliver",
""
],
[
"Camphausen",
"Simon",
""
],
[
"Moos",
"Arne",
""
],
[
"Schwarz",
"Ingmar",
""
],
[
"Kerner",
"Sören",
""
],
[
"Otten",
"Maximilian",
""
]
] | Inference of Convolutional Neural Networks in time critical applications usually requires a GPU. In robotics or embedded devices these are often not available due to energy, space and cost constraints. Furthermore, installation of a deep learning framework or even a native compiler on the target platform is not possibl... |
2106.02954 | Avi Caciularu | Avi Caciularu, Ido Dagan, Jacob Goldberger | Denoising Word Embeddings by Averaging in a Shared Space | Accepted to *SEM 2021 | null | null | null | cs.CL cs.LG | http://creativecommons.org/licenses/by/4.0/ | We introduce a new approach for smoothing and improving the quality of word
embeddings. We consider a method of fusing word embeddings that were trained on
the same corpus but with different initializations. We project all the models
to a shared vector space using an efficient implementation of the Generalized
Procru... | [
{
"created": "Sat, 5 Jun 2021 19:49:02 GMT",
"version": "v1"
}
] | 2021-06-08 | [
[
"Caciularu",
"Avi",
""
],
[
"Dagan",
"Ido",
""
],
[
"Goldberger",
"Jacob",
""
]
] | We introduce a new approach for smoothing and improving the quality of word embeddings. We consider a method of fusing word embeddings that were trained on the same corpus but with different initializations. We project all the models to a shared vector space using an efficient implementation of the Generalized Procrust... |
2001.07698 | Bernardo Huberman | Qi Zhou, Jingjie Zhu, Junwen Zhang, Zhensheng Jia, Bernardo Huberman
and Gee-Kung Chang | Intelligent Bandwidth Allocation for Latency Management in NG-EPON using
Reinforcement Learning Methods | null | null | null | null | cs.NI cs.LG eess.SP | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A novel intelligent bandwidth allocation scheme in NG-EPON using
reinforcement learning is proposed and demonstrated for latency management. We
verify the capability of the proposed scheme under both fixed and dynamic
traffic loads scenarios to achieve <1ms average latency. The RL agent
demonstrates an efficient inte... | [
{
"created": "Tue, 21 Jan 2020 18:58:56 GMT",
"version": "v1"
}
] | 2020-01-22 | [
[
"Zhou",
"Qi",
""
],
[
"Zhu",
"Jingjie",
""
],
[
"Zhang",
"Junwen",
""
],
[
"Jia",
"Zhensheng",
""
],
[
"Huberman",
"Bernardo",
""
],
[
"Chang",
"Gee-Kung",
""
]
] | A novel intelligent bandwidth allocation scheme in NG-EPON using reinforcement learning is proposed and demonstrated for latency management. We verify the capability of the proposed scheme under both fixed and dynamic traffic loads scenarios to achieve <1ms average latency. The RL agent demonstrates an efficient intell... |
2302.09040 | Karine Levonyan | Karine Levonyan, Jesse Harder, Fernando De Mesentier Silva | Automated Graph Genetic Algorithm based Puzzle Validation for Faster
Game Design | null | 2022 IEEE Congress on Evolutionary Computation (CEC), Padua,
Italy, 2022, pp. 1-8 | 10.1109/CEC55065.2022.9870402 | null | cs.NE cs.AI | http://creativecommons.org/licenses/by/4.0/ | Many games are reliant on creating new and engaging content constantly to
maintain the interest of their player-base. One such example are puzzle games,
in such it is common to have a recurrent need to create new puzzles. Creating
new puzzles requires guaranteeing that they are solvable and interesting to
players, bo... | [
{
"created": "Fri, 17 Feb 2023 18:15:33 GMT",
"version": "v1"
},
{
"created": "Tue, 21 Feb 2023 19:23:15 GMT",
"version": "v2"
}
] | 2023-02-23 | [
[
"Levonyan",
"Karine",
""
],
[
"Harder",
"Jesse",
""
],
[
"Silva",
"Fernando De Mesentier",
""
]
] | Many games are reliant on creating new and engaging content constantly to maintain the interest of their player-base. One such example are puzzle games, in such it is common to have a recurrent need to create new puzzles. Creating new puzzles requires guaranteeing that they are solvable and interesting to players, both... |
1806.10061 | Kamil Senel | Kamil Senel and Erik G. Larsson | Grant-Free Massive MTC-Enabled Massive MIMO: A Compressive Sensing
Approach | Submitted to IEEE Transactions on Communications | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A key challenge of massive MTC (mMTC), is the joint detection of device
activity and decoding of data. The sparse characteristics of mMTC makes
compressed sensing (CS) approaches a promising solution to the device detection
problem. However, utilizing CS-based approaches for device detection along with
channel estima... | [
{
"created": "Tue, 26 Jun 2018 15:25:45 GMT",
"version": "v1"
}
] | 2018-06-27 | [
[
"Senel",
"Kamil",
""
],
[
"Larsson",
"Erik G.",
""
]
] | A key challenge of massive MTC (mMTC), is the joint detection of device activity and decoding of data. The sparse characteristics of mMTC makes compressed sensing (CS) approaches a promising solution to the device detection problem. However, utilizing CS-based approaches for device detection along with channel estimati... |
1610.01245 | Ali Parsai | Ali Parsai, Alessandro Murgia, Serge Demeyer | A Model to Estimate First-Order Mutation Coverage from Higher-Order
Mutation Coverage | 2016 IEEE International Conference on Software Quality, Reliability,
and Security. 9 pages | 2016 IEEE International Conference on Software Quality,
Reliability and Security (QRS), Vienna, Austria, 2016, pp. 365-373 | 10.1109/QRS.2016.48 | null | cs.SE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The test suite is essential for fault detection during software development.
First-order mutation coverage is an accurate metric to quantify the quality of
the test suite. However, it is computationally expensive. Hence, the adoption
of this metric is limited. In this study, we address this issue by proposing a
reali... | [
{
"created": "Wed, 5 Oct 2016 01:15:42 GMT",
"version": "v1"
}
] | 2016-10-18 | [
[
"Parsai",
"Ali",
""
],
[
"Murgia",
"Alessandro",
""
],
[
"Demeyer",
"Serge",
""
]
] | The test suite is essential for fault detection during software development. First-order mutation coverage is an accurate metric to quantify the quality of the test suite. However, it is computationally expensive. Hence, the adoption of this metric is limited. In this study, we address this issue by proposing a realist... |
2012.02344 | Vassillen Chizhov | Vassillen Chizhov, Iliyan Georgiev, Karol Myszkowski, Gurprit Singh | Perceptual error optimization for Monte Carlo rendering | null | ACM Transactions on Graphics, Volume 41, Issue 3, June 2022,
Article No.: 26, pp 1-17 | 10.1145/3504002 | null | cs.GR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Synthesizing realistic images involves computing high-dimensional
light-transport integrals. In practice, these integrals are numerically
estimated via Monte Carlo integration. The error of this estimation manifests
itself as conspicuous aliasing or noise. To ameliorate such artifacts and
improve image fidelity, we p... | [
{
"created": "Fri, 4 Dec 2020 00:30:45 GMT",
"version": "v1"
},
{
"created": "Mon, 7 Dec 2020 16:04:18 GMT",
"version": "v2"
},
{
"created": "Mon, 5 Jul 2021 12:16:31 GMT",
"version": "v3"
},
{
"created": "Tue, 13 Jul 2021 17:52:16 GMT",
"version": "v4"
},
{
"crea... | 2022-04-06 | [
[
"Chizhov",
"Vassillen",
""
],
[
"Georgiev",
"Iliyan",
""
],
[
"Myszkowski",
"Karol",
""
],
[
"Singh",
"Gurprit",
""
]
] | Synthesizing realistic images involves computing high-dimensional light-transport integrals. In practice, these integrals are numerically estimated via Monte Carlo integration. The error of this estimation manifests itself as conspicuous aliasing or noise. To ameliorate such artifacts and improve image fidelity, we pro... |
2208.00771 | Vladan Majerech Dr. | Vladan Majerech | 100 prisoners and a lightbulb -- looking back | 12 pages, 1 table, 1 graph | null | null | null | cs.DM math.HO | http://creativecommons.org/publicdomain/zero/1.0/ | 100 prisoners and a light bulb is a long standing mathematical puzzle. The
problem was studied mostly in 2002 [5], 2003 [1], and 2004 [3]. Solutions in
published articles had average number of visits above 3850, but best solutions
on forums had (declared) average number of visits around 3500. I spent some
time in 200... | [
{
"created": "Wed, 6 Jul 2022 22:22:53 GMT",
"version": "v1"
}
] | 2022-08-02 | [
[
"Majerech",
"Vladan",
""
]
] | 100 prisoners and a light bulb is a long standing mathematical puzzle. The problem was studied mostly in 2002 [5], 2003 [1], and 2004 [3]. Solutions in published articles had average number of visits above 3850, but best solutions on forums had (declared) average number of visits around 3500. I spent some time in 2007-... |
2102.05224 | Hyeongtaek Lee | Hyeongtaek Lee, Hyuckjin Choi, Hwanjin Kim, Sucheol Kim, Chulhee Jang,
Yongyun Choi, and Junil Choi | Downlink Channel Reconstruction for Spatial Multiplexing in Massive MIMO
Systems | Submitted to IEEE Transactions on Wireless Communications | IEEE Transactions on Wireless Communications, vol. 20, no. 9, pp.
6154-6166, Sept. 2021 | 10.1109/TWC.2021.3072158 | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | To get channel state information (CSI) at a base station (BS), most of
researches on massive multiple-input multiple-output (MIMO) systems consider
time division duplexing (TDD) to get benefit from the uplink and downlink
channel reciprocity. Even in TDD, however, the BS still needs to transmit
downlink training sign... | [
{
"created": "Wed, 10 Feb 2021 02:26:01 GMT",
"version": "v1"
}
] | 2022-06-28 | [
[
"Lee",
"Hyeongtaek",
""
],
[
"Choi",
"Hyuckjin",
""
],
[
"Kim",
"Hwanjin",
""
],
[
"Kim",
"Sucheol",
""
],
[
"Jang",
"Chulhee",
""
],
[
"Choi",
"Yongyun",
""
],
[
"Choi",
"Junil",
""
]
] | To get channel state information (CSI) at a base station (BS), most of researches on massive multiple-input multiple-output (MIMO) systems consider time division duplexing (TDD) to get benefit from the uplink and downlink channel reciprocity. Even in TDD, however, the BS still needs to transmit downlink training signal... |
1507.00772 | Roman Kecher | Yehuda Afek, Roman Kecher, Moshe Sulamy | Optimal and Resilient Pheromone Utilization in Ant Foraging | null | null | null | null | cs.DC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Pheromones are a chemical substance produced and released by ants as means of
communication. In this work we present the minimum amount of pheromones
necessary and sufficient for a colony of ants (identical mobile agents) to
deterministically find a food source (treasure), assuming that each ant has the
computational... | [
{
"created": "Thu, 2 Jul 2015 21:34:58 GMT",
"version": "v1"
}
] | 2015-07-06 | [
[
"Afek",
"Yehuda",
""
],
[
"Kecher",
"Roman",
""
],
[
"Sulamy",
"Moshe",
""
]
] | Pheromones are a chemical substance produced and released by ants as means of communication. In this work we present the minimum amount of pheromones necessary and sufficient for a colony of ants (identical mobile agents) to deterministically find a food source (treasure), assuming that each ant has the computational c... |
2303.18008 | Bashar Huleihel | Bashar Huleihel, Oron Sabag, Haim H. Permuter, Victoria Kostina | Capacity of Finite-State Channels with Delayed Feedback | null | null | null | null | cs.IT math.IT | http://creativecommons.org/licenses/by/4.0/ | In this paper, we investigate the capacity of finite-state channels (FSCs) in
presence of delayed feedback. We show that the capacity of a FSC with delayed
feedback can be computed as that of a new FSC with instantaneous feedback and
an extended state. Consequently, graph-based methods to obtain computable upper
and ... | [
{
"created": "Fri, 31 Mar 2023 12:28:18 GMT",
"version": "v1"
},
{
"created": "Sat, 22 Jun 2024 11:14:27 GMT",
"version": "v2"
}
] | 2024-06-25 | [
[
"Huleihel",
"Bashar",
""
],
[
"Sabag",
"Oron",
""
],
[
"Permuter",
"Haim H.",
""
],
[
"Kostina",
"Victoria",
""
]
] | In this paper, we investigate the capacity of finite-state channels (FSCs) in presence of delayed feedback. We show that the capacity of a FSC with delayed feedback can be computed as that of a new FSC with instantaneous feedback and an extended state. Consequently, graph-based methods to obtain computable upper and lo... |
2007.13657 | Behnam Neyshabur | Behnam Neyshabur | Towards Learning Convolutions from Scratch | 18 pages, 9 figures, 4 tables | null | null | null | cs.LG cs.CV stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Convolution is one of the most essential components of architectures used in
computer vision. As machine learning moves towards reducing the expert bias and
learning it from data, a natural next step seems to be learning
convolution-like structures from scratch. This, however, has proven elusive.
For example, current... | [
{
"created": "Mon, 27 Jul 2020 16:13:13 GMT",
"version": "v1"
}
] | 2020-07-28 | [
[
"Neyshabur",
"Behnam",
""
]
] | Convolution is one of the most essential components of architectures used in computer vision. As machine learning moves towards reducing the expert bias and learning it from data, a natural next step seems to be learning convolution-like structures from scratch. This, however, has proven elusive. For example, current s... |
2407.21298 | An Wu | An Wu and Yu Pan and Fuqi Zhou and Jinghui Yan and Chuanlu Liu | A Vectorization Method Induced By Maximal Margin Classification For
Persistent Diagrams | null | null | null | null | cs.LG cs.AI q-bio.BM | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Persistent homology is an effective method for extracting topological
information, represented as persistent diagrams, of spatial structure data.
Hence it is well-suited for the study of protein structures. Attempts to
incorporate Persistent homology in machine learning methods of protein function
prediction have res... | [
{
"created": "Wed, 31 Jul 2024 02:55:01 GMT",
"version": "v1"
}
] | 2024-08-01 | [
[
"Wu",
"An",
""
],
[
"Pan",
"Yu",
""
],
[
"Zhou",
"Fuqi",
""
],
[
"Yan",
"Jinghui",
""
],
[
"Liu",
"Chuanlu",
""
]
] | Persistent homology is an effective method for extracting topological information, represented as persistent diagrams, of spatial structure data. Hence it is well-suited for the study of protein structures. Attempts to incorporate Persistent homology in machine learning methods of protein function prediction have resul... |
2002.04830 | Kevin Tian | Arun Jambulapati, Yin Tat Lee, Jerry Li, Swati Padmanabhan, Kevin Tian | Positive Semidefinite Programming: Mixed, Parallel, and
Width-Independent | There is an error in this manuscript. This version notes the source
of the error on the first page | null | null | null | cs.DS math.OC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We give the first approximation algorithm for mixed packing and covering
semidefinite programs (SDPs) with polylogarithmic dependence on width. Mixed
packing and covering SDPs constitute a fundamental algorithmic primitive with
recent applications in combinatorial optimization, robust learning, and quantum
complexity... | [
{
"created": "Wed, 12 Feb 2020 07:47:50 GMT",
"version": "v1"
},
{
"created": "Fri, 12 Jun 2020 22:48:35 GMT",
"version": "v2"
},
{
"created": "Mon, 12 Jul 2021 04:07:02 GMT",
"version": "v3"
}
] | 2021-07-13 | [
[
"Jambulapati",
"Arun",
""
],
[
"Lee",
"Yin Tat",
""
],
[
"Li",
"Jerry",
""
],
[
"Padmanabhan",
"Swati",
""
],
[
"Tian",
"Kevin",
""
]
] | We give the first approximation algorithm for mixed packing and covering semidefinite programs (SDPs) with polylogarithmic dependence on width. Mixed packing and covering SDPs constitute a fundamental algorithmic primitive with recent applications in combinatorial optimization, robust learning, and quantum complexity. ... |
2401.07055 | Alessandro Di Giorgio | Filippo Bonchi, Alessandro Di Giorgio, Nathan Haydon, Pawel Sobocinski | Diagrammatic Algebra of First Order Logic | null | null | null | null | cs.LO math.CT | http://creativecommons.org/licenses/by/4.0/ | We introduce the calculus of neo-Peircean relations, a string diagrammatic
extension of the calculus of binary relations that has the same expressivity as
first order logic and comes with a complete axiomatisation. The axioms are
obtained by combining two well known categorical structures: cartesian and
linear bicate... | [
{
"created": "Sat, 13 Jan 2024 12:09:02 GMT",
"version": "v1"
}
] | 2024-01-17 | [
[
"Bonchi",
"Filippo",
""
],
[
"Di Giorgio",
"Alessandro",
""
],
[
"Haydon",
"Nathan",
""
],
[
"Sobocinski",
"Pawel",
""
]
] | We introduce the calculus of neo-Peircean relations, a string diagrammatic extension of the calculus of binary relations that has the same expressivity as first order logic and comes with a complete axiomatisation. The axioms are obtained by combining two well known categorical structures: cartesian and linear bicatego... |
2312.01326 | Xinyi Wang | Xinyi Wang, Yulong Ding, Yizhou Chen, Ruihua Han, Lele Xi, and Ben M.
Chen | OA-ECBVC: A Cooperative Collision-free Encirclement and Capture Approach
in Cluttered Environments | 7 pages, 7 figures, conference | null | null | null | cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This article investigates the practical scenarios of chasing an adversarial
evader in an unbounded environment with cluttered obstacles. We propose a
Voronoi-based decentralized algorithm for multiple pursuers to encircle and
capture the evader by reacting to collisions. An efficient approach is
presented for constru... | [
{
"created": "Sun, 3 Dec 2023 09:11:43 GMT",
"version": "v1"
}
] | 2023-12-05 | [
[
"Wang",
"Xinyi",
""
],
[
"Ding",
"Yulong",
""
],
[
"Chen",
"Yizhou",
""
],
[
"Han",
"Ruihua",
""
],
[
"Xi",
"Lele",
""
],
[
"Chen",
"Ben M.",
""
]
] | This article investigates the practical scenarios of chasing an adversarial evader in an unbounded environment with cluttered obstacles. We propose a Voronoi-based decentralized algorithm for multiple pursuers to encircle and capture the evader by reacting to collisions. An efficient approach is presented for construct... |
2403.10780 | Mariia Khan | Mariia Khan, Yue Qiu, Yuren Cong, Jumana Abu-Khalaf, David Suter, Bodo
Rosenhahn | Segment Any Object Model (SAOM): Real-to-Simulation Fine-Tuning Strategy
for Multi-Class Multi-Instance Segmentation | null | null | null | null | cs.CV cs.AI | http://creativecommons.org/licenses/by/4.0/ | Multi-class multi-instance segmentation is the task of identifying masks for
multiple object classes and multiple instances of the same class within an
image. The foundational Segment Anything Model (SAM) is designed for promptable
multi-class multi-instance segmentation but tends to output part or sub-part
masks in ... | [
{
"created": "Sat, 16 Mar 2024 02:54:49 GMT",
"version": "v1"
}
] | 2024-03-19 | [
[
"Khan",
"Mariia",
""
],
[
"Qiu",
"Yue",
""
],
[
"Cong",
"Yuren",
""
],
[
"Abu-Khalaf",
"Jumana",
""
],
[
"Suter",
"David",
""
],
[
"Rosenhahn",
"Bodo",
""
]
] | Multi-class multi-instance segmentation is the task of identifying masks for multiple object classes and multiple instances of the same class within an image. The foundational Segment Anything Model (SAM) is designed for promptable multi-class multi-instance segmentation but tends to output part or sub-part masks in th... |
2303.01746 | Kusum Sangwan | Michael A. Henning, Kusum, Arti Pandey, Kaustav Paul | Complexity of total dominator coloring in graphs | V1, 18 pages, 1 figure | null | null | null | cs.DM cs.CC math.CO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Let $G=(V,E)$ be a graph with no isolated vertices. A vertex $v$ totally
dominate a vertex $w$ ($w \ne v$), if $v$ is adjacent to $w$. A set $D
\subseteq V$ called a total dominating set of $G$ if every vertex $v\in V$ is
totally dominated by some vertex in $D$. The minimum cardinality of a total
dominating set is th... | [
{
"created": "Fri, 3 Mar 2023 07:17:22 GMT",
"version": "v1"
}
] | 2023-03-06 | [
[
"Henning",
"Michael A.",
""
],
[
"Kusum",
"",
""
],
[
"Pandey",
"Arti",
""
],
[
"Paul",
"Kaustav",
""
]
] | Let $G=(V,E)$ be a graph with no isolated vertices. A vertex $v$ totally dominate a vertex $w$ ($w \ne v$), if $v$ is adjacent to $w$. A set $D \subseteq V$ called a total dominating set of $G$ if every vertex $v\in V$ is totally dominated by some vertex in $D$. The minimum cardinality of a total dominating set is the ... |
2008.05180 | Christian Schulz | Alexander Gellner, Sebastian Lamm, Christian Schulz, Darren Strash,
Bogd\'an Zav\'alnij | Boosting Data Reduction for the Maximum Weight Independent Set Problem
Using Increasing Transformations | null | null | null | null | cs.DS cs.AI cs.IR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Given a vertex-weighted graph, the maximum weight independent set problem
asks for a pair-wise non-adjacent set of vertices such that the sum of their
weights is maximum. The branch-and-reduce paradigm is the de facto standard
approach to solve the problem to optimality in practice. In this paradigm, data
reduction r... | [
{
"created": "Wed, 12 Aug 2020 08:52:50 GMT",
"version": "v1"
},
{
"created": "Thu, 13 Aug 2020 05:45:23 GMT",
"version": "v2"
}
] | 2020-08-14 | [
[
"Gellner",
"Alexander",
""
],
[
"Lamm",
"Sebastian",
""
],
[
"Schulz",
"Christian",
""
],
[
"Strash",
"Darren",
""
],
[
"Zaválnij",
"Bogdán",
""
]
] | Given a vertex-weighted graph, the maximum weight independent set problem asks for a pair-wise non-adjacent set of vertices such that the sum of their weights is maximum. The branch-and-reduce paradigm is the de facto standard approach to solve the problem to optimality in practice. In this paradigm, data reduction rul... |
2307.08847 | Gamze Gursoy | Ahmed Elhussein and Gamze Gursoy | Privacy-preserving patient clustering for personalized federated
learning | null | null | null | null | cs.LG cs.CR | http://creativecommons.org/licenses/by-nc-nd/4.0/ | Federated Learning (FL) is a machine learning framework that enables multiple
organizations to train a model without sharing their data with a central
server. However, it experiences significant performance degradation if the data
is non-identically independently distributed (non-IID). This is a problem in
medical se... | [
{
"created": "Mon, 17 Jul 2023 21:19:08 GMT",
"version": "v1"
}
] | 2023-07-19 | [
[
"Elhussein",
"Ahmed",
""
],
[
"Gursoy",
"Gamze",
""
]
] | Federated Learning (FL) is a machine learning framework that enables multiple organizations to train a model without sharing their data with a central server. However, it experiences significant performance degradation if the data is non-identically independently distributed (non-IID). This is a problem in medical sett... |
2107.01464 | Ibrahim Sabek | Ibrahim Sabek, Kapil Vaidya, Dominik Horn, Andreas Kipf, Tim Kraska | When Are Learned Models Better Than Hash Functions? | null | null | null | null | cs.DB | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this work, we aim to study when learned models are better hash functions,
particular for hash-maps. We use lightweight piece-wise linear models to
replace the hash functions as they have small inference times and are
sufficiently general to capture complex distributions. We analyze the learned
models in terms of: ... | [
{
"created": "Sat, 3 Jul 2021 16:50:52 GMT",
"version": "v1"
}
] | 2021-07-06 | [
[
"Sabek",
"Ibrahim",
""
],
[
"Vaidya",
"Kapil",
""
],
[
"Horn",
"Dominik",
""
],
[
"Kipf",
"Andreas",
""
],
[
"Kraska",
"Tim",
""
]
] | In this work, we aim to study when learned models are better hash functions, particular for hash-maps. We use lightweight piece-wise linear models to replace the hash functions as they have small inference times and are sufficiently general to capture complex distributions. We analyze the learned models in terms of: th... |
1804.02773 | Attila Varga | Attila Varga | Novelty and Foreseeing Research Trends; The Case of Astrophysics and
Astronomy | null | null | 10.3847/1538-4365/aab765 | null | cs.DL stat.AP | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Metrics based on reference lists of research articles or on keywords have
been used to predict citation impact. The concept behind such metrics is that
original ideas stem from the reconfiguration of the structure of past
knowledge, and therefore atypical combinations in the reference lists,
keywords, or classificati... | [
{
"created": "Sun, 8 Apr 2018 23:03:01 GMT",
"version": "v1"
}
] | 2018-05-23 | [
[
"Varga",
"Attila",
""
]
] | Metrics based on reference lists of research articles or on keywords have been used to predict citation impact. The concept behind such metrics is that original ideas stem from the reconfiguration of the structure of past knowledge, and therefore atypical combinations in the reference lists, keywords, or classification... |
1009.1512 | Christine Bachoc | Christine Bachoc (IMB) | Applications of semidefinite programming to coding theory | 5 pages; ITW 2010, Dublib : Ireland (2010) | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We survey recent generalizations and improvements of the linear programming
method that involve semidefinite programming. A general framework using group
representations and tools from graph theory is provided.
| [
{
"created": "Wed, 8 Sep 2010 12:10:50 GMT",
"version": "v1"
}
] | 2010-09-09 | [
[
"Bachoc",
"Christine",
"",
"IMB"
]
] | We survey recent generalizations and improvements of the linear programming method that involve semidefinite programming. A general framework using group representations and tools from graph theory is provided. |
2405.02070 | Andreas A{\ss}muth | George R. S. Weir and Andreas A{\ss}muth | Strategies for Intrusion Monitoring in Cloud Services | 5 pages | Proc of the 8th International Conference on Cloud Computing,
GRIDs, and Virtualization (Cloud Computing 2017), Athens, Greece, February
2017, pp. 49-53, ISSN 2308-4294 | null | null | cs.CR cs.DC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Effective activity and event monitoring is an essential aspect of digital
forensic readiness. Techniques for capturing log and other event data are
familiar from conventional networked hosts and transfer directly to the Cloud
context. In both contexts, a major concern is the risk that monitoring systems
may be target... | [
{
"created": "Fri, 3 May 2024 13:00:36 GMT",
"version": "v1"
}
] | 2024-05-06 | [
[
"Weir",
"George R. S.",
""
],
[
"Aßmuth",
"Andreas",
""
]
] | Effective activity and event monitoring is an essential aspect of digital forensic readiness. Techniques for capturing log and other event data are familiar from conventional networked hosts and transfer directly to the Cloud context. In both contexts, a major concern is the risk that monitoring systems may be targeted... |
1706.02815 | Hao He | Hao He, Bo Xin, David Wipf | From Bayesian Sparsity to Gated Recurrent Nets | null | null | null | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The iterations of many first-order algorithms, when applied to minimizing
common regularized regression functions, often resemble neural network layers
with pre-specified weights. This observation has prompted the development of
learning-based approaches that purport to replace these iterations with
enhanced surrogat... | [
{
"created": "Fri, 9 Jun 2017 02:56:54 GMT",
"version": "v1"
},
{
"created": "Wed, 2 Aug 2017 17:03:43 GMT",
"version": "v2"
}
] | 2017-08-03 | [
[
"He",
"Hao",
""
],
[
"Xin",
"Bo",
""
],
[
"Wipf",
"David",
""
]
] | The iterations of many first-order algorithms, when applied to minimizing common regularized regression functions, often resemble neural network layers with pre-specified weights. This observation has prompted the development of learning-based approaches that purport to replace these iterations with enhanced surrogates... |
2402.10478 | Ishan Rajendrakumar Dave | Ishan Rajendrakumar Dave, Tristan de Blegiers, Chen Chen, Mubarak Shah | CodaMal: Contrastive Domain Adaptation for Malaria Detection in Low-Cost
Microscopes | Under Review. Project Page:
https://daveishan.github.io/codamal-webpage/ | null | null | null | cs.CV cs.LG | http://creativecommons.org/licenses/by-nc-sa/4.0/ | Malaria is a major health issue worldwide, and its diagnosis requires
scalable solutions that can work effectively with low-cost microscopes (LCM).
Deep learning-based methods have shown success in computer-aided diagnosis from
microscopic images. However, these methods need annotated images that show
cells affected ... | [
{
"created": "Fri, 16 Feb 2024 06:57:03 GMT",
"version": "v1"
}
] | 2024-02-19 | [
[
"Dave",
"Ishan Rajendrakumar",
""
],
[
"de Blegiers",
"Tristan",
""
],
[
"Chen",
"Chen",
""
],
[
"Shah",
"Mubarak",
""
]
] | Malaria is a major health issue worldwide, and its diagnosis requires scalable solutions that can work effectively with low-cost microscopes (LCM). Deep learning-based methods have shown success in computer-aided diagnosis from microscopic images. However, these methods need annotated images that show cells affected by... |
2009.06799 | Jacob Buckman | Jacob Buckman, Carles Gelada, Marc G. Bellemare | The Importance of Pessimism in Fixed-Dataset Policy Optimization | null | null | null | null | cs.AI cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We study worst-case guarantees on the expected return of fixed-dataset policy
optimization algorithms. Our core contribution is a unified conceptual and
mathematical framework for the study of algorithms in this regime. This
analysis reveals that for naive approaches, the possibility of erroneous value
overestimation... | [
{
"created": "Tue, 15 Sep 2020 00:18:34 GMT",
"version": "v1"
},
{
"created": "Sun, 4 Oct 2020 23:51:31 GMT",
"version": "v2"
},
{
"created": "Sun, 29 Nov 2020 05:58:30 GMT",
"version": "v3"
}
] | 2020-12-01 | [
[
"Buckman",
"Jacob",
""
],
[
"Gelada",
"Carles",
""
],
[
"Bellemare",
"Marc G.",
""
]
] | We study worst-case guarantees on the expected return of fixed-dataset policy optimization algorithms. Our core contribution is a unified conceptual and mathematical framework for the study of algorithms in this regime. This analysis reveals that for naive approaches, the possibility of erroneous value overestimation l... |
1806.01224 | Nils M\"uller | Nils M\"uller and Tobias Glasmachers | Challenges in High-dimensional Reinforcement Learning with Evolution
Strategies | 12 pages, 5 figures | null | null | null | cs.NE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Evolution Strategies (ESs) have recently become popular for training deep
neural networks, in particular on reinforcement learning tasks, a special form
of controller design. Compared to classic problems in continuous direct search,
deep networks pose extremely high-dimensional optimization problems, with many
thousa... | [
{
"created": "Mon, 4 Jun 2018 17:08:23 GMT",
"version": "v1"
},
{
"created": "Sun, 1 Jul 2018 18:30:36 GMT",
"version": "v2"
}
] | 2018-07-03 | [
[
"Müller",
"Nils",
""
],
[
"Glasmachers",
"Tobias",
""
]
] | Evolution Strategies (ESs) have recently become popular for training deep neural networks, in particular on reinforcement learning tasks, a special form of controller design. Compared to classic problems in continuous direct search, deep networks pose extremely high-dimensional optimization problems, with many thousand... |
2306.09998 | Juliette Marrie | Juliette Marrie, Michael Arbel, Diane Larlus, Julien Mairal | SLACK: Stable Learning of Augmentations with Cold-start and KL
regularization | Accepted to CVPR 2023 | null | null | null | cs.CV cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Data augmentation is known to improve the generalization capabilities of
neural networks, provided that the set of transformations is chosen with care,
a selection often performed manually. Automatic data augmentation aims at
automating this process. However, most recent approaches still rely on some
prior informatio... | [
{
"created": "Fri, 16 Jun 2023 17:51:07 GMT",
"version": "v1"
}
] | 2023-06-19 | [
[
"Marrie",
"Juliette",
""
],
[
"Arbel",
"Michael",
""
],
[
"Larlus",
"Diane",
""
],
[
"Mairal",
"Julien",
""
]
] | Data augmentation is known to improve the generalization capabilities of neural networks, provided that the set of transformations is chosen with care, a selection often performed manually. Automatic data augmentation aims at automating this process. However, most recent approaches still rely on some prior information;... |
1311.4088 | Adel Alinezhad kolaei | Adel Alinezhad Kolaei and Marzieh Ahmadzadeh | The Optimization of Running Queries in Relational Databases Using
ANT-Colony Algorithm | null | null | null | null | cs.DB cs.NE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The issue of optimizing queries is a cost-sensitive process and with respect
to the number of associated tables in a query, its number of permutations grows
exponentially. On one hand, in comparison with other operators in relational
database, join operator is the most difficult and complicated one in terms of
optimi... | [
{
"created": "Sat, 16 Nov 2013 18:43:19 GMT",
"version": "v1"
}
] | 2013-11-19 | [
[
"Kolaei",
"Adel Alinezhad",
""
],
[
"Ahmadzadeh",
"Marzieh",
""
]
] | The issue of optimizing queries is a cost-sensitive process and with respect to the number of associated tables in a query, its number of permutations grows exponentially. On one hand, in comparison with other operators in relational database, join operator is the most difficult and complicated one in terms of optimiza... |
1410.2834 | Ubiratam de Paula Junior | Ubiratam de Paula Junior, L\'ucia M. A. Drummond, Daniel de Oliveira,
Yuri Frota, Valmir C. Barbosa | Handling Flash-Crowd Events to Improve the Performance of Web
Applications | Submitted to the 30th Symposium On Applied Computing (2015) | Proceedings of the 30th ACM/SIGAPP Symposium on Applied Computing,
769-774, 2015 | 10.1145/2695664.2695839 | null | cs.DC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Cloud computing can offer a set of computing resources according to users'
demand. It is suitable to be used to handle flash-crowd events in Web
applications due to its elasticity and on-demand characteristics. Thus, when
Web applications need more computing or storage capacity, they just instantiate
new resources. H... | [
{
"created": "Fri, 10 Oct 2014 16:36:09 GMT",
"version": "v1"
}
] | 2015-05-04 | [
[
"Junior",
"Ubiratam de Paula",
""
],
[
"Drummond",
"Lúcia M. A.",
""
],
[
"de Oliveira",
"Daniel",
""
],
[
"Frota",
"Yuri",
""
],
[
"Barbosa",
"Valmir C.",
""
]
] | Cloud computing can offer a set of computing resources according to users' demand. It is suitable to be used to handle flash-crowd events in Web applications due to its elasticity and on-demand characteristics. Thus, when Web applications need more computing or storage capacity, they just instantiate new resources. How... |
1910.08071 | Shadrokh Samavi | Mahdi Ahmadi, Nader Karimi, Shadrokh Samavi | Context-Aware Saliency Detection for Image Retargeting Using
Convolutional Neural Networks | 20 pages, 19 figures | null | null | null | cs.CV eess.IV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Image retargeting is the task of making images capable of being displayed on
screens with different sizes. This work should be done so that high-level
visual information and low-level features such as texture remain as intact as
possible to the human visual system, while the output image may have different
dimensions... | [
{
"created": "Thu, 17 Oct 2019 17:59:46 GMT",
"version": "v1"
}
] | 2019-10-18 | [
[
"Ahmadi",
"Mahdi",
""
],
[
"Karimi",
"Nader",
""
],
[
"Samavi",
"Shadrokh",
""
]
] | Image retargeting is the task of making images capable of being displayed on screens with different sizes. This work should be done so that high-level visual information and low-level features such as texture remain as intact as possible to the human visual system, while the output image may have different dimensions. ... |
1711.11469 | Aaron Potechin | Aaron Potechin | Sum of squares lower bounds from symmetry and a good story | null | null | null | null | cs.CC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we develop machinery which makes it much easier to prove sum
of squares lower bounds when the problem is symmetric under permutations of
$[1,n]$ and the unsatisfiability of our problem comes from integrality
arguments, i.e. arguments that an expression must be an integer. Roughly
speaking, to prove SOS... | [
{
"created": "Thu, 30 Nov 2017 15:47:13 GMT",
"version": "v1"
},
{
"created": "Thu, 17 May 2018 14:20:45 GMT",
"version": "v2"
},
{
"created": "Fri, 14 Dec 2018 00:11:25 GMT",
"version": "v3"
}
] | 2018-12-17 | [
[
"Potechin",
"Aaron",
""
]
] | In this paper, we develop machinery which makes it much easier to prove sum of squares lower bounds when the problem is symmetric under permutations of $[1,n]$ and the unsatisfiability of our problem comes from integrality arguments, i.e. arguments that an expression must be an integer. Roughly speaking, to prove SOS l... |
2204.06718 | Hengyue Pan | Hengyue Pan and Yixin Chen and Xin Niu and Wenbo Zhou and Dongsheng Li | Learning Convolutional Neural Networks in the Frequency Domain | Submitted to NeurIPS 2022 | null | null | null | cs.CV cs.AI cs.LG | http://creativecommons.org/licenses/by/4.0/ | Convolutional neural network (CNN) has achieved impressive success in
computer vision during the past few decades. The image convolution operation
helps CNNs to get good performance on image-related tasks. However, the image
convolution has high computation complexity and hard to be implemented. This
paper proposes t... | [
{
"created": "Thu, 14 Apr 2022 03:08:40 GMT",
"version": "v1"
},
{
"created": "Wed, 20 Jul 2022 08:16:09 GMT",
"version": "v10"
},
{
"created": "Fri, 15 Apr 2022 10:10:30 GMT",
"version": "v2"
},
{
"created": "Tue, 19 Apr 2022 13:17:24 GMT",
"version": "v3"
},
{
"... | 2022-07-21 | [
[
"Pan",
"Hengyue",
""
],
[
"Chen",
"Yixin",
""
],
[
"Niu",
"Xin",
""
],
[
"Zhou",
"Wenbo",
""
],
[
"Li",
"Dongsheng",
""
]
] | Convolutional neural network (CNN) has achieved impressive success in computer vision during the past few decades. The image convolution operation helps CNNs to get good performance on image-related tasks. However, the image convolution has high computation complexity and hard to be implemented. This paper proposes the... |
1401.6576 | Luc Dartois | Luc Dartois (ULB), Charles Paperman | Adding modular predicates to first-order fragments | null | null | null | null | cs.LO cs.FL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We investigate the decidability of the definability problem for fragments of
first order logic over finite words enriched with modular predicates. Our
approach aims toward the most generic statements that we could achieve, which
successfully covers the quantifier alternation hierarchy of first order logic
and some of... | [
{
"created": "Sat, 25 Jan 2014 19:57:46 GMT",
"version": "v1"
},
{
"created": "Mon, 19 May 2014 18:58:57 GMT",
"version": "v2"
},
{
"created": "Fri, 13 Nov 2015 14:43:48 GMT",
"version": "v3"
}
] | 2015-11-16 | [
[
"Dartois",
"Luc",
"",
"ULB"
],
[
"Paperman",
"Charles",
""
]
] | We investigate the decidability of the definability problem for fragments of first order logic over finite words enriched with modular predicates. Our approach aims toward the most generic statements that we could achieve, which successfully covers the quantifier alternation hierarchy of first order logic and some of i... |
1706.05924 | Manoel Horta Ribeiro | Manoel Horta Ribeiro, Pedro H. Calais, Virg\'ilio A. F. Almeida,
Wagner Meira Jr | "Everything I Disagree With is #FakeNews": Correlating Political
Polarization and Spread of Misinformation | 8 pages, 10 figures, to be presented at DS+J Workshop @ KDD'17 | null | null | null | cs.SI cs.CY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | An important challenge in the process of tracking and detecting the
dissemination of misinformation is to understand the political gap between
people that engage with the so called "fake news". A possible factor
responsible for this gap is opinion polarization, which may prompt the general
public to classify content ... | [
{
"created": "Mon, 19 Jun 2017 13:26:41 GMT",
"version": "v1"
},
{
"created": "Mon, 17 Jul 2017 17:17:37 GMT",
"version": "v2"
}
] | 2017-07-18 | [
[
"Ribeiro",
"Manoel Horta",
""
],
[
"Calais",
"Pedro H.",
""
],
[
"Almeida",
"Virgílio A. F.",
""
],
[
"Meira",
"Wagner",
"Jr"
]
] | An important challenge in the process of tracking and detecting the dissemination of misinformation is to understand the political gap between people that engage with the so called "fake news". A possible factor responsible for this gap is opinion polarization, which may prompt the general public to classify content th... |
1812.03243 | Md Kamruzzaman Sarker | Md Kamruzzaman Sarker, Pascal Hitzler | Efficient Concept Induction for Description Logics | Accepted at AAAI-19 | null | null | null | cs.AI cs.LO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Concept Induction refers to the problem of creating complex Description Logic
class descriptions (i.e., TBox axioms) from instance examples (i.e., ABox
data). In this paper we look particularly at the case where both a set of
positive and a set of negative instances are given, and complex class
expressions are sought... | [
{
"created": "Sat, 8 Dec 2018 00:10:05 GMT",
"version": "v1"
}
] | 2018-12-11 | [
[
"Sarker",
"Md Kamruzzaman",
""
],
[
"Hitzler",
"Pascal",
""
]
] | Concept Induction refers to the problem of creating complex Description Logic class descriptions (i.e., TBox axioms) from instance examples (i.e., ABox data). In this paper we look particularly at the case where both a set of positive and a set of negative instances are given, and complex class expressions are sought u... |
2407.12487 | Xin Wang | Mengxiao Zhu, Xin Wang, Xiantao Wang, Zihang Chen, Wei Huang | Application of Prompt Learning Models in Identifying the Collaborative
Problem Solving Skills in an Online Task | null | null | null | null | cs.HC | http://creativecommons.org/publicdomain/zero/1.0/ | Collaborative problem solving (CPS) competence is considered one of the
essential 21st-century skills. To facilitate the assessment and learning of CPS
competence, researchers have proposed a series of frameworks to conceptualize
CPS and explored ways to make sense of the complex processes involved in
collaborative p... | [
{
"created": "Wed, 17 Jul 2024 11:12:02 GMT",
"version": "v1"
}
] | 2024-07-18 | [
[
"Zhu",
"Mengxiao",
""
],
[
"Wang",
"Xin",
""
],
[
"Wang",
"Xiantao",
""
],
[
"Chen",
"Zihang",
""
],
[
"Huang",
"Wei",
""
]
] | Collaborative problem solving (CPS) competence is considered one of the essential 21st-century skills. To facilitate the assessment and learning of CPS competence, researchers have proposed a series of frameworks to conceptualize CPS and explored ways to make sense of the complex processes involved in collaborative pro... |
1801.09866 | Kyungmin Lee | Kyungmin Lee, Chiyoun Park, Namhoon Kim, and Jaewon Lee | Accelerating recurrent neural network language model based online speech
recognition system | 4 pages, 4 figures, 3 tables, ICASSP2018(Accepted) | null | null | null | cs.CL cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper presents methods to accelerate recurrent neural network based
language models (RNNLMs) for online speech recognition systems. Firstly, a
lossy compression of the past hidden layer outputs (history vector) with
caching is introduced in order to reduce the number of LM queries. Next, RNNLM
computations are d... | [
{
"created": "Tue, 30 Jan 2018 06:58:50 GMT",
"version": "v1"
}
] | 2018-01-31 | [
[
"Lee",
"Kyungmin",
""
],
[
"Park",
"Chiyoun",
""
],
[
"Kim",
"Namhoon",
""
],
[
"Lee",
"Jaewon",
""
]
] | This paper presents methods to accelerate recurrent neural network based language models (RNNLMs) for online speech recognition systems. Firstly, a lossy compression of the past hidden layer outputs (history vector) with caching is introduced in order to reduce the number of LM queries. Next, RNNLM computations are dep... |
2311.01793 | Tomasz Kociumaka | Daniel Gibney, Ce Jin, Tomasz Kociumaka, Sharma V. Thankachan | Near-Optimal Quantum Algorithms for Bounded Edit Distance and Lempel-Ziv
Factorization | Accepted to SODA 2024. arXiv admin note: substantial text overlap
with arXiv:2302.07235 | null | null | null | cs.DS quant-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Classically, the edit distance of two length-$n$ strings can be computed in
$O(n^2)$ time, whereas an $O(n^{2-\epsilon})$-time procedure would falsify the
Orthogonal Vectors Hypothesis. If the edit distance does not exceed $k$, the
running time can be improved to $O(n+k^2)$, which is near-optimal (conditioned
on OVH)... | [
{
"created": "Fri, 3 Nov 2023 09:09:23 GMT",
"version": "v1"
}
] | 2023-11-06 | [
[
"Gibney",
"Daniel",
""
],
[
"Jin",
"Ce",
""
],
[
"Kociumaka",
"Tomasz",
""
],
[
"Thankachan",
"Sharma V.",
""
]
] | Classically, the edit distance of two length-$n$ strings can be computed in $O(n^2)$ time, whereas an $O(n^{2-\epsilon})$-time procedure would falsify the Orthogonal Vectors Hypothesis. If the edit distance does not exceed $k$, the running time can be improved to $O(n+k^2)$, which is near-optimal (conditioned on OVH) a... |
1912.09697 | Xingkui Wei | Xingkui Wei, Yinda Zhang, Zhuwen Li, Yanwei Fu and Xiangyang Xue | DeepSFM: Structure From Motion Via Deep Bundle Adjustment | Accepted by ECCV2020(Oral) | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Structure from motion (SfM) is an essential computer vision problem which has
not been well handled by deep learning. One of the promising trends is to apply
explicit structural constraint, e.g. 3D cost volume, into the network. However,
existing methods usually assume accurate camera poses either from GT or other
me... | [
{
"created": "Fri, 20 Dec 2019 08:47:41 GMT",
"version": "v1"
},
{
"created": "Mon, 10 Aug 2020 07:31:28 GMT",
"version": "v2"
}
] | 2020-08-11 | [
[
"Wei",
"Xingkui",
""
],
[
"Zhang",
"Yinda",
""
],
[
"Li",
"Zhuwen",
""
],
[
"Fu",
"Yanwei",
""
],
[
"Xue",
"Xiangyang",
""
]
] | Structure from motion (SfM) is an essential computer vision problem which has not been well handled by deep learning. One of the promising trends is to apply explicit structural constraint, e.g. 3D cost volume, into the network. However, existing methods usually assume accurate camera poses either from GT or other meth... |
2109.11406 | Maud Ehrmann | Maud Ehrmann, Ahmed Hamdi, Elvys Linhares Pontes, Matteo Romanello,
Antoine Doucet | Named Entity Recognition and Classification on Historical Documents: A
Survey | 39 pages | ACM Computing Surveys 56-2 (2023) 1-47 | 10.1145/3604931 | null | cs.CL cs.LG | http://creativecommons.org/licenses/by-sa/4.0/ | After decades of massive digitisation, an unprecedented amount of historical
documents is available in digital format, along with their machine-readable
texts. While this represents a major step forward with respect to preservation
and accessibility, it also opens up new opportunities in terms of content
mining and t... | [
{
"created": "Thu, 23 Sep 2021 14:37:40 GMT",
"version": "v1"
}
] | 2024-04-02 | [
[
"Ehrmann",
"Maud",
""
],
[
"Hamdi",
"Ahmed",
""
],
[
"Pontes",
"Elvys Linhares",
""
],
[
"Romanello",
"Matteo",
""
],
[
"Doucet",
"Antoine",
""
]
] | After decades of massive digitisation, an unprecedented amount of historical documents is available in digital format, along with their machine-readable texts. While this represents a major step forward with respect to preservation and accessibility, it also opens up new opportunities in terms of content mining and the... |
1312.7179 | Patoomsiri Songsiri Ms. | Patoomsiri Songsiri, Thimaporn Phetkaew, Ryutaro Ichise and Boonserm
Kijsirikul | Sub-Classifier Construction for Error Correcting Output Code Using
Minimum Weight Perfect Matching | 7 pages, 3 figures | null | null | null | cs.LG cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Multi-class classification is mandatory for real world problems and one of
promising techniques for multi-class classification is Error Correcting Output
Code. We propose a method for constructing the Error Correcting Output Code to
obtain the suitable combination of positive and negative classes encoded to
represent... | [
{
"created": "Fri, 27 Dec 2013 03:21:34 GMT",
"version": "v1"
}
] | 2013-12-30 | [
[
"Songsiri",
"Patoomsiri",
""
],
[
"Phetkaew",
"Thimaporn",
""
],
[
"Ichise",
"Ryutaro",
""
],
[
"Kijsirikul",
"Boonserm",
""
]
] | Multi-class classification is mandatory for real world problems and one of promising techniques for multi-class classification is Error Correcting Output Code. We propose a method for constructing the Error Correcting Output Code to obtain the suitable combination of positive and negative classes encoded to represent b... |
1802.09623 | Biao Zhao | Biao Zhao, Shigang Yue | A Resilient Image Matching Method with an Affine Invariant Feature
Detector and Descriptor | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Image feature matching is to seek, localize and identify the similarities
across the images. The matched local features between different images can
indicate the similarities of their content. Resilience of image feature
matching to large view point changes is challenging for a lot of applications
such as 3D object r... | [
{
"created": "Fri, 29 Dec 2017 11:36:58 GMT",
"version": "v1"
}
] | 2018-02-28 | [
[
"Zhao",
"Biao",
""
],
[
"Yue",
"Shigang",
""
]
] | Image feature matching is to seek, localize and identify the similarities across the images. The matched local features between different images can indicate the similarities of their content. Resilience of image feature matching to large view point changes is challenging for a lot of applications such as 3D object rec... |
2406.05412 | Hao Zhang | Hao Zhang, Shuaijie Zhang, Renbin Zou | Select-Mosaic: Data Augmentation Method for Dense Small Object Scenes | null | null | null | null | cs.CV | http://creativecommons.org/licenses/by/4.0/ | Data augmentation refers to the process of applying a series of
transformations or expansions to original data to generate new samples, thereby
increasing the diversity and quantity of the data, effectively improving the
performance and robustness of models. As a common data augmentation method,
Mosaic data augmentat... | [
{
"created": "Sat, 8 Jun 2024 09:22:08 GMT",
"version": "v1"
}
] | 2024-06-11 | [
[
"Zhang",
"Hao",
""
],
[
"Zhang",
"Shuaijie",
""
],
[
"Zou",
"Renbin",
""
]
] | Data augmentation refers to the process of applying a series of transformations or expansions to original data to generate new samples, thereby increasing the diversity and quantity of the data, effectively improving the performance and robustness of models. As a common data augmentation method, Mosaic data augmentatio... |
2104.11645 | Di Wu | Di Wu, Xiaofeng Xie, Xiang Ni, Bin Fu, Hanhui Deng, Haibo Zeng, and
Zhijin Qin | Software-Defined Edge Computing: A New Architecture Paradigm to Support
IoT Data Analysis | null | null | null | null | cs.NI cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The rapid deployment of Internet of Things (IoT) applications leads to
massive data that need to be processed. These IoT applications have specific
communication requirements on latency and bandwidth, and present new features
on their generated data such as time-dependency. Therefore, it is desirable to
reshape the c... | [
{
"created": "Thu, 22 Apr 2021 11:19:20 GMT",
"version": "v1"
},
{
"created": "Mon, 26 Apr 2021 02:39:57 GMT",
"version": "v2"
}
] | 2021-04-27 | [
[
"Wu",
"Di",
""
],
[
"Xie",
"Xiaofeng",
""
],
[
"Ni",
"Xiang",
""
],
[
"Fu",
"Bin",
""
],
[
"Deng",
"Hanhui",
""
],
[
"Zeng",
"Haibo",
""
],
[
"Qin",
"Zhijin",
""
]
] | The rapid deployment of Internet of Things (IoT) applications leads to massive data that need to be processed. These IoT applications have specific communication requirements on latency and bandwidth, and present new features on their generated data such as time-dependency. Therefore, it is desirable to reshape the cur... |
1710.07761 | Cheng-Jun Wang Frank | Cheng-Jun Wang, Zhi-Cong Chen, Qiang Qin, Naipeng Chao | Leveraging the Flow of Collective Attention for Computational
Communication Research | 16 pages, 5 figures | null | null | null | cs.CY cs.SI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Human attention becomes an increasingly important resource for our
understanding or collective human behaviors in the age of information
explosion. To better understand the flow of collective attention, we construct
the attention flow network using anonymous smartphone data of 100,000 users in
a major city of China. ... | [
{
"created": "Sat, 21 Oct 2017 06:17:12 GMT",
"version": "v1"
}
] | 2017-10-24 | [
[
"Wang",
"Cheng-Jun",
""
],
[
"Chen",
"Zhi-Cong",
""
],
[
"Qin",
"Qiang",
""
],
[
"Chao",
"Naipeng",
""
]
] | Human attention becomes an increasingly important resource for our understanding or collective human behaviors in the age of information explosion. To better understand the flow of collective attention, we construct the attention flow network using anonymous smartphone data of 100,000 users in a major city of China. In... |
1109.5635 | Krzysztof Onak | Alexandr Andoni and Krzysztof Onak | Approximating Edit Distance in Near-Linear Time | Preliminary version appeared in STOC 2009 | null | null | null | cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We show how to compute the edit distance between two strings of length n up
to a factor of 2^{\~O(sqrt(log n))} in n^(1+o(1)) time. This is the first
sub-polynomial approximation algorithm for this problem that runs in
near-linear time, improving on the state-of-the-art n^(1/3+o(1)) approximation.
Previously, approxi... | [
{
"created": "Mon, 26 Sep 2011 16:48:20 GMT",
"version": "v1"
}
] | 2011-09-27 | [
[
"Andoni",
"Alexandr",
""
],
[
"Onak",
"Krzysztof",
""
]
] | We show how to compute the edit distance between two strings of length n up to a factor of 2^{\~O(sqrt(log n))} in n^(1+o(1)) time. This is the first sub-polynomial approximation algorithm for this problem that runs in near-linear time, improving on the state-of-the-art n^(1/3+o(1)) approximation. Previously, approxima... |
2106.05438 | Alexander H. Liu | Alexander H. Liu, SouYoung Jin, Cheng-I Jeff Lai, Andrew Rouditchenko,
Aude Oliva, James Glass | Cross-Modal Discrete Representation Learning | Preprint | null | null | null | cs.CV | http://creativecommons.org/licenses/by/4.0/ | Recent advances in representation learning have demonstrated an ability to
represent information from different modalities such as video, text, and audio
in a single high-level embedding vector. In this work we present a
self-supervised learning framework that is able to learn a representation that
captures finer lev... | [
{
"created": "Thu, 10 Jun 2021 00:23:33 GMT",
"version": "v1"
}
] | 2021-06-11 | [
[
"Liu",
"Alexander H.",
""
],
[
"Jin",
"SouYoung",
""
],
[
"Lai",
"Cheng-I Jeff",
""
],
[
"Rouditchenko",
"Andrew",
""
],
[
"Oliva",
"Aude",
""
],
[
"Glass",
"James",
""
]
] | Recent advances in representation learning have demonstrated an ability to represent information from different modalities such as video, text, and audio in a single high-level embedding vector. In this work we present a self-supervised learning framework that is able to learn a representation that captures finer level... |
2006.13477 | Yiwen Sun | Yiwen Sun, Kun Fu, Zheng Wang, Changshui Zhang and Jieping Ye | Road Network Metric Learning for Estimated Time of Arrival | Accepted by 25th International Conference on Pattern Recognition
(ICPR 2020) | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Recently, deep learning have achieved promising results in Estimated Time of
Arrival (ETA), which is considered as predicting the travel time from the
origin to the destination along a given path. One of the key techniques is to
use embedding vectors to represent the elements of road network, such as the
links (road ... | [
{
"created": "Wed, 24 Jun 2020 04:45:14 GMT",
"version": "v1"
}
] | 2020-06-25 | [
[
"Sun",
"Yiwen",
""
],
[
"Fu",
"Kun",
""
],
[
"Wang",
"Zheng",
""
],
[
"Zhang",
"Changshui",
""
],
[
"Ye",
"Jieping",
""
]
] | Recently, deep learning have achieved promising results in Estimated Time of Arrival (ETA), which is considered as predicting the travel time from the origin to the destination along a given path. One of the key techniques is to use embedding vectors to represent the elements of road network, such as the links (road se... |
1411.4249 | Chengwen Xing | Chengwen Xing, Feifei Gao, Yiqing Zhou | A Framework for Transceiver Designs for Multi-Hop Communications with
Covariance Shaping Constraints | 31 Pages, 9 Figures, Submitted to Signal Processing IEEE | null | 10.1109/TSP.2015.2425800 | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | For multiple-input multiple-output (MIMO) transceiver designs, sum power
constraint is an elegant and ideal model. When various practical limitations
are taken into account e.g., peak power constraints, per-antenna power
constraints, etc., covariance shaping constraints will act as an effective and
reasonable model. ... | [
{
"created": "Sun, 16 Nov 2014 11:56:03 GMT",
"version": "v1"
},
{
"created": "Wed, 19 Nov 2014 13:20:34 GMT",
"version": "v2"
},
{
"created": "Thu, 20 Nov 2014 05:40:26 GMT",
"version": "v3"
},
{
"created": "Thu, 11 Dec 2014 07:01:31 GMT",
"version": "v4"
},
{
"c... | 2017-02-22 | [
[
"Xing",
"Chengwen",
""
],
[
"Gao",
"Feifei",
""
],
[
"Zhou",
"Yiqing",
""
]
] | For multiple-input multiple-output (MIMO) transceiver designs, sum power constraint is an elegant and ideal model. When various practical limitations are taken into account e.g., peak power constraints, per-antenna power constraints, etc., covariance shaping constraints will act as an effective and reasonable model. In... |
1708.00544 | Jeremy Kepner | Michael Jones, Jeremy Kepner, William Arcand, David Bestor, Bill
Bergeron, Vijay Gadepally, Michael Houle, Matthew Hubbell, Peter Michaleas,
Andrew Prout, Albert Reuther, Siddharth Samsi, Paul Monticiollo | Performance Measurements of Supercomputing and Cloud Storage Solutions | 5 pages, 4 figures, to appear in IEEE HPEC 2017 | null | 10.1109/HPEC.2017.8091073 | null | cs.DC astro-ph.IM cs.NI cs.OS cs.PF | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Increasing amounts of data from varied sources, particularly in the fields of
machine learning and graph analytics, are causing storage requirements to grow
rapidly. A variety of technologies exist for storing and sharing these data,
ranging from parallel file systems used by supercomputers to distributed block
stora... | [
{
"created": "Tue, 1 Aug 2017 22:48:06 GMT",
"version": "v1"
}
] | 2018-03-06 | [
[
"Jones",
"Michael",
""
],
[
"Kepner",
"Jeremy",
""
],
[
"Arcand",
"William",
""
],
[
"Bestor",
"David",
""
],
[
"Bergeron",
"Bill",
""
],
[
"Gadepally",
"Vijay",
""
],
[
"Houle",
"Michael",
""
],
[
... | Increasing amounts of data from varied sources, particularly in the fields of machine learning and graph analytics, are causing storage requirements to grow rapidly. A variety of technologies exist for storing and sharing these data, ranging from parallel file systems used by supercomputers to distributed block storage... |
2301.09072 | Shangqing Liu | Shangqing Liu, Bozhi Wu, Xiaofei Xie, Guozhu Meng, Yang Liu | ContraBERT: Enhancing Code Pre-trained Models via Contrastive Learning | null | null | null | null | cs.SE | http://creativecommons.org/publicdomain/zero/1.0/ | Large-scale pre-trained models such as CodeBERT, GraphCodeBERT have earned
widespread attention from both academia and industry. Attributed to the
superior ability in code representation, they have been further applied in
multiple downstream tasks such as clone detection, code search and code
translation. However, it... | [
{
"created": "Sun, 22 Jan 2023 08:03:20 GMT",
"version": "v1"
}
] | 2023-01-24 | [
[
"Liu",
"Shangqing",
""
],
[
"Wu",
"Bozhi",
""
],
[
"Xie",
"Xiaofei",
""
],
[
"Meng",
"Guozhu",
""
],
[
"Liu",
"Yang",
""
]
] | Large-scale pre-trained models such as CodeBERT, GraphCodeBERT have earned widespread attention from both academia and industry. Attributed to the superior ability in code representation, they have been further applied in multiple downstream tasks such as clone detection, code search and code translation. However, it i... |
1707.07857 | Xiaohua Xie | Chunchao Guo, Jianhuang Lai, Xiaohua Xie | Motion-Appearance Interactive Encoding for Object Segmentation in
Unconstrained Videos | 11 pages, 7 figures | null | 10.1109/TCSVT.2019.2908779 | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We present a novel method of integrating motion and appearance cues for
foreground object segmentation in unconstrained videos. Unlike conventional
methods encoding motion and appearance patterns individually, our method puts
particular emphasis on their mutual assistance. Specifically, we propose using
an interactiv... | [
{
"created": "Tue, 25 Jul 2017 09:01:59 GMT",
"version": "v1"
}
] | 2019-04-17 | [
[
"Guo",
"Chunchao",
""
],
[
"Lai",
"Jianhuang",
""
],
[
"Xie",
"Xiaohua",
""
]
] | We present a novel method of integrating motion and appearance cues for foreground object segmentation in unconstrained videos. Unlike conventional methods encoding motion and appearance patterns individually, our method puts particular emphasis on their mutual assistance. Specifically, we propose using an interactivel... |
2212.00306 | Wentao Hu | Wentao Hu and Hui Fang | Decentralized Matrix Factorization with Heterogeneous Differential
Privacy | Accepted by the 22nd IEEE International Conference on Trust, Security
and Privacy in Computing and Communications (TrustCom-2023) | null | null | null | cs.LG cs.CR | http://creativecommons.org/licenses/by-nc-nd/4.0/ | Conventional matrix factorization relies on centralized collection of users'
data for recommendation, which might introduce an increased risk of privacy
leakage especially when the recommender is untrusted. Existing differentially
private matrix factorization methods either assume the recommender is trusted,
or can o... | [
{
"created": "Thu, 1 Dec 2022 06:48:18 GMT",
"version": "v1"
},
{
"created": "Sun, 17 Sep 2023 03:19:23 GMT",
"version": "v2"
}
] | 2023-09-19 | [
[
"Hu",
"Wentao",
""
],
[
"Fang",
"Hui",
""
]
] | Conventional matrix factorization relies on centralized collection of users' data for recommendation, which might introduce an increased risk of privacy leakage especially when the recommender is untrusted. Existing differentially private matrix factorization methods either assume the recommender is trusted, or can onl... |
2407.09913 | Haoyang Liu | Haoyang Liu | Emotion Detection through Body Gesture and Face | 25 pages, 4 figures | null | null | null | cs.CV | http://creativecommons.org/licenses/by-nc-nd/4.0/ | The project leverages advanced machine and deep learning techniques to
address the challenge of emotion recognition by focusing on non-facial cues,
specifically hands, body gestures, and gestures. Traditional emotion
recognition systems mainly rely on facial expression analysis and often ignore
the rich emotional inf... | [
{
"created": "Sat, 13 Jul 2024 15:15:50 GMT",
"version": "v1"
}
] | 2024-07-16 | [
[
"Liu",
"Haoyang",
""
]
] | The project leverages advanced machine and deep learning techniques to address the challenge of emotion recognition by focusing on non-facial cues, specifically hands, body gestures, and gestures. Traditional emotion recognition systems mainly rely on facial expression analysis and often ignore the rich emotional infor... |
1701.00963 | Songwei Fu | Songwei Fu, Chia-Yen Shih, Yuming Jiang, Matteo Ceriotti, Xintao Huan
and Pedro Jos\'e Marr\'on | RADIUS: A System for Detecting Anomalous Link Quality Degradation in
Wireless Sensor Networks | null | null | null | null | cs.NI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | To ensure proper functioning of a Wireless Sensor Network (WSN), it is
crucial that the network is able to detect anomalies in communication quality
(e.g., RSSI), which may cause performance degradation, so that the network can
react accordingly. In this paper, we introduce RADIUS, a lightweight system for
the purpos... | [
{
"created": "Wed, 4 Jan 2017 10:56:31 GMT",
"version": "v1"
}
] | 2017-01-05 | [
[
"Fu",
"Songwei",
""
],
[
"Shih",
"Chia-Yen",
""
],
[
"Jiang",
"Yuming",
""
],
[
"Ceriotti",
"Matteo",
""
],
[
"Huan",
"Xintao",
""
],
[
"Marrón",
"Pedro José",
""
]
] | To ensure proper functioning of a Wireless Sensor Network (WSN), it is crucial that the network is able to detect anomalies in communication quality (e.g., RSSI), which may cause performance degradation, so that the network can react accordingly. In this paper, we introduce RADIUS, a lightweight system for the purpose.... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.