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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
2403.14399 | Liang Ding | Changtong Zan, Liang Ding, Li Shen, Yibing Zhen, Weifeng Liu, Dacheng
Tao | Building Accurate Translation-Tailored LLMs with Language Aware
Instruction Tuning | null | null | null | null | cs.CL cs.AI | http://creativecommons.org/publicdomain/zero/1.0/ | Translation-tailored Large language models (LLMs) exhibit remarkable
translation capabilities, even competing with supervised-trained commercial
translation systems. However, off-target translation remains an unsolved
problem, especially for low-resource languages, hindering us from developing
accurate LLMs-based tra... | [
{
"created": "Thu, 21 Mar 2024 13:47:40 GMT",
"version": "v1"
}
] | 2024-03-22 | [
[
"Zan",
"Changtong",
""
],
[
"Ding",
"Liang",
""
],
[
"Shen",
"Li",
""
],
[
"Zhen",
"Yibing",
""
],
[
"Liu",
"Weifeng",
""
],
[
"Tao",
"Dacheng",
""
]
] | Translation-tailored Large language models (LLMs) exhibit remarkable translation capabilities, even competing with supervised-trained commercial translation systems. However, off-target translation remains an unsolved problem, especially for low-resource languages, hindering us from developing accurate LLMs-based trans... |
2003.12327 | Lei Huang | Lei Huang, Lei Zhao, Yi Zhou, Fan Zhu, Li Liu, Ling Shao | An Investigation into the Stochasticity of Batch Whitening | Accepted to CVPR 2020. The Code is available at
https://github.com/huangleiBuaa/StochasticityBW | null | null | null | cs.CV cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Batch Normalization (BN) is extensively employed in various network
architectures by performing standardization within mini-batches.
A full understanding of the process has been a central target in the deep
learning communities.
Unlike existing works, which usually only analyze the standardization
operation, this... | [
{
"created": "Fri, 27 Mar 2020 11:06:32 GMT",
"version": "v1"
}
] | 2020-03-30 | [
[
"Huang",
"Lei",
""
],
[
"Zhao",
"Lei",
""
],
[
"Zhou",
"Yi",
""
],
[
"Zhu",
"Fan",
""
],
[
"Liu",
"Li",
""
],
[
"Shao",
"Ling",
""
]
] | Batch Normalization (BN) is extensively employed in various network architectures by performing standardization within mini-batches. A full understanding of the process has been a central target in the deep learning communities. Unlike existing works, which usually only analyze the standardization operation, this paper... |
2403.05488 | Fortun\'e Kponou | D. Fortune Kponou, Frejus A. A. Laleye, Eugene C. Ezin | FFSTC: Fongbe to French Speech Translation Corpus | null | null | null | null | cs.CL | http://creativecommons.org/licenses/by/4.0/ | In this paper, we introduce the Fongbe to French Speech Translation Corpus
(FFSTC) for the first time. This corpus encompasses approximately 31 hours of
collected Fongbe language content, featuring both French transcriptions and
corresponding Fongbe voice recordings. FFSTC represents a comprehensive dataset
compiled ... | [
{
"created": "Fri, 8 Mar 2024 17:53:58 GMT",
"version": "v1"
}
] | 2024-03-11 | [
[
"Kponou",
"D. Fortune",
""
],
[
"Laleye",
"Frejus A. A.",
""
],
[
"Ezin",
"Eugene C.",
""
]
] | In this paper, we introduce the Fongbe to French Speech Translation Corpus (FFSTC) for the first time. This corpus encompasses approximately 31 hours of collected Fongbe language content, featuring both French transcriptions and corresponding Fongbe voice recordings. FFSTC represents a comprehensive dataset compiled th... |
1908.03237 | Andong Cao | Andong Cao, Ali Dhanaliwala, Jianbo Shi, Terence Gade, Brian Park | Image-based marker tracking and registration for intraoperative 3D
image-guided interventions using augmented reality | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Augmented reality has the potential to improve operating room workflow by
allowing physicians to "see" inside a patient through the projection of imaging
directly onto the surgical field. For this to be useful the acquired imaging
must be quickly and accurately registered with patient and the registration
must be mai... | [
{
"created": "Thu, 8 Aug 2019 18:57:34 GMT",
"version": "v1"
}
] | 2019-08-12 | [
[
"Cao",
"Andong",
""
],
[
"Dhanaliwala",
"Ali",
""
],
[
"Shi",
"Jianbo",
""
],
[
"Gade",
"Terence",
""
],
[
"Park",
"Brian",
""
]
] | Augmented reality has the potential to improve operating room workflow by allowing physicians to "see" inside a patient through the projection of imaging directly onto the surgical field. For this to be useful the acquired imaging must be quickly and accurately registered with patient and the registration must be maint... |
1803.10039 | Lei He | Lei He, Guanghui Wang and Zhanyi Hu | Learning Depth from Single Images with Deep Neural Network Embedding
Focal Length | null | null | 10.1109/TIP.2018.2832296 | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Learning depth from a single image, as an important issue in scene
understanding, has attracted a lot of attention in the past decade. The
accuracy of the depth estimation has been improved from conditional Markov
random fields, non-parametric methods, to deep convolutional neural networks
most recently. However, the... | [
{
"created": "Tue, 27 Mar 2018 12:26:15 GMT",
"version": "v1"
}
] | 2018-08-01 | [
[
"He",
"Lei",
""
],
[
"Wang",
"Guanghui",
""
],
[
"Hu",
"Zhanyi",
""
]
] | Learning depth from a single image, as an important issue in scene understanding, has attracted a lot of attention in the past decade. The accuracy of the depth estimation has been improved from conditional Markov random fields, non-parametric methods, to deep convolutional neural networks most recently. However, there... |
1712.03757 | Lei You | Lei You, Lei Lei, Di Yuan, Sumei Sun, Symeon Chatzinotas, Bj\"orn
Ottersten | A Framework for Optimizing Multi-cell NOMA: Delivering Demand with Less
Resource | 7 pages | IEEE GLOBECOM 2017 | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Non-orthogonal multiple access (NOMA) allows multiple users to simultaneously
access the same time-frequency resource by using superposition coding and
successive interference cancellation (SIC). Thus far, most papers on NOMA have
focused on performance gain for one or sometimes two base stations. In this
paper, we s... | [
{
"created": "Mon, 11 Dec 2017 13:05:15 GMT",
"version": "v1"
}
] | 2017-12-12 | [
[
"You",
"Lei",
""
],
[
"Lei",
"Lei",
""
],
[
"Yuan",
"Di",
""
],
[
"Sun",
"Sumei",
""
],
[
"Chatzinotas",
"Symeon",
""
],
[
"Ottersten",
"Björn",
""
]
] | Non-orthogonal multiple access (NOMA) allows multiple users to simultaneously access the same time-frequency resource by using superposition coding and successive interference cancellation (SIC). Thus far, most papers on NOMA have focused on performance gain for one or sometimes two base stations. In this paper, we stu... |
1711.05159 | Mathys Rennela | Mathys Rennela and Sam Staton | Classical Control, Quantum Circuits and Linear Logic in Enriched
Category Theory | null | Logical Methods in Computer Science, Volume 16, Issue 1 (March 10,
2020) lmcs:4068 | 10.23638/LMCS-16(1:30)2020 | null | cs.LO cs.PL math.CT math.OA quant-ph | http://creativecommons.org/licenses/by/4.0/ | We describe categorical models of a circuit-based (quantum) functional
programming language. We show that enriched categories play a crucial role.
Following earlier work on QWire by Paykin et al., we consider both a simple
first-order linear language for circuits, and a more powerful host language,
such that the circ... | [
{
"created": "Tue, 14 Nov 2017 15:59:21 GMT",
"version": "v1"
},
{
"created": "Mon, 12 Aug 2019 17:49:53 GMT",
"version": "v2"
},
{
"created": "Thu, 22 Aug 2019 13:19:22 GMT",
"version": "v3"
},
{
"created": "Fri, 17 Jan 2020 21:38:22 GMT",
"version": "v4"
},
{
"c... | 2023-06-22 | [
[
"Rennela",
"Mathys",
""
],
[
"Staton",
"Sam",
""
]
] | We describe categorical models of a circuit-based (quantum) functional programming language. We show that enriched categories play a crucial role. Following earlier work on QWire by Paykin et al., we consider both a simple first-order linear language for circuits, and a more powerful host language, such that the circui... |
2211.10344 | Paul Escapil-Inchausp\'e | Paul Escapil-Inchausp\'e and Gonzalo A. Ruz | Physics-informed neural networks for operator equations with stochastic
data | null | null | null | null | cs.LG cs.NA math.NA | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We consider the computation of statistical moments to operator equations with
stochastic data. We remark that application of PINNs -- referred to as TPINNs
-- allows to solve the induced tensor operator equations under minimal changes
of existing PINNs code, and enabling handling of non-linear and time-dependent
oper... | [
{
"created": "Tue, 15 Nov 2022 20:52:01 GMT",
"version": "v1"
},
{
"created": "Fri, 3 May 2024 21:35:02 GMT",
"version": "v2"
}
] | 2024-05-07 | [
[
"Escapil-Inchauspé",
"Paul",
""
],
[
"Ruz",
"Gonzalo A.",
""
]
] | We consider the computation of statistical moments to operator equations with stochastic data. We remark that application of PINNs -- referred to as TPINNs -- allows to solve the induced tensor operator equations under minimal changes of existing PINNs code, and enabling handling of non-linear and time-dependent operat... |
2306.10420 | Cihat Ke\c{c}eci | Cihat Ke\c{c}eci, Katherine R. Davis, Erchin Serpedin | Federated Learning Based Distributed Localization of False Data
Injection Attacks on Smart Grids | 9 pages, 6 figures | null | null | null | cs.LG cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Data analysis and monitoring on smart grids are jeopardized by attacks on
cyber-physical systems. False data injection attack (FDIA) is one of the
classes of those attacks that target the smart measurement devices by injecting
malicious data. The employment of machine learning techniques in the detection
and localiza... | [
{
"created": "Sat, 17 Jun 2023 20:29:55 GMT",
"version": "v1"
}
] | 2023-06-21 | [
[
"Keçeci",
"Cihat",
""
],
[
"Davis",
"Katherine R.",
""
],
[
"Serpedin",
"Erchin",
""
]
] | Data analysis and monitoring on smart grids are jeopardized by attacks on cyber-physical systems. False data injection attack (FDIA) is one of the classes of those attacks that target the smart measurement devices by injecting malicious data. The employment of machine learning techniques in the detection and localizati... |
2206.09262 | Shanshan Wu | Shanshan Wu, Tian Li, Zachary Charles, Yu Xiao, Ziyu Liu, Zheng Xu,
Virginia Smith | Motley: Benchmarking Heterogeneity and Personalization in Federated
Learning | 40 pages, 10 figures, 7 tables. EMNIST and Landmarks fine-tuning
results are corrected in (and after) v5. Code:
https://github.com/google-research/federated/tree/master/personalization_benchmark | null | null | null | cs.LG cs.DC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Personalized federated learning considers learning models unique to each
client in a heterogeneous network. The resulting client-specific models have
been purported to improve metrics such as accuracy, fairness, and robustness in
federated networks. However, despite a plethora of work in this area, it
remains unclear... | [
{
"created": "Sat, 18 Jun 2022 18:18:49 GMT",
"version": "v1"
},
{
"created": "Tue, 5 Jul 2022 21:27:05 GMT",
"version": "v2"
},
{
"created": "Sun, 10 Jul 2022 02:29:32 GMT",
"version": "v3"
},
{
"created": "Wed, 13 Jul 2022 23:54:01 GMT",
"version": "v4"
},
{
"cr... | 2022-09-27 | [
[
"Wu",
"Shanshan",
""
],
[
"Li",
"Tian",
""
],
[
"Charles",
"Zachary",
""
],
[
"Xiao",
"Yu",
""
],
[
"Liu",
"Ziyu",
""
],
[
"Xu",
"Zheng",
""
],
[
"Smith",
"Virginia",
""
]
] | Personalized federated learning considers learning models unique to each client in a heterogeneous network. The resulting client-specific models have been purported to improve metrics such as accuracy, fairness, and robustness in federated networks. However, despite a plethora of work in this area, it remains unclear: ... |
2309.08008 | Yanshan Wang | Sonish Sivarajkumar, Mark Kelley, Alyssa Samolyk-Mazzanti, Shyam
Visweswaran, Yanshan Wang | An Empirical Evaluation of Prompting Strategies for Large Language
Models in Zero-Shot Clinical Natural Language Processing | null | null | null | null | cs.CL cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Large language models (LLMs) have shown remarkable capabilities in Natural
Language Processing (NLP), especially in domains where labeled data is scarce
or expensive, such as clinical domain. However, to unlock the clinical
knowledge hidden in these LLMs, we need to design effective prompts that can
guide them to per... | [
{
"created": "Thu, 14 Sep 2023 19:35:00 GMT",
"version": "v1"
}
] | 2023-09-18 | [
[
"Sivarajkumar",
"Sonish",
""
],
[
"Kelley",
"Mark",
""
],
[
"Samolyk-Mazzanti",
"Alyssa",
""
],
[
"Visweswaran",
"Shyam",
""
],
[
"Wang",
"Yanshan",
""
]
] | Large language models (LLMs) have shown remarkable capabilities in Natural Language Processing (NLP), especially in domains where labeled data is scarce or expensive, such as clinical domain. However, to unlock the clinical knowledge hidden in these LLMs, we need to design effective prompts that can guide them to perfo... |
2402.10059 | Jovan Komatovic | Pierre Civit, Muhammad Ayaz Dzulfikar, Seth Gilbert, Rachid Guerraoui,
Jovan Komatovic, Manuel Vidigueira, Igor Zablotchi | Partial Synchrony for Free? New Upper Bounds for Byzantine Agreement | null | null | null | null | cs.DC | http://creativecommons.org/licenses/by/4.0/ | Byzantine agreement allows n processes to decide on a common value, in spite
of arbitrary failures. The seminal Dolev-Reischuk bound states that any
deterministic solution to Byzantine agreement exchanges Omega(n^2) bits. In
synchronous networks, solutions with optimal O(n^2) bit complexity, optimal
fault tolerance, ... | [
{
"created": "Thu, 15 Feb 2024 16:29:24 GMT",
"version": "v1"
},
{
"created": "Fri, 16 Feb 2024 08:40:21 GMT",
"version": "v2"
},
{
"created": "Thu, 22 Feb 2024 12:06:57 GMT",
"version": "v3"
},
{
"created": "Fri, 5 Apr 2024 08:07:16 GMT",
"version": "v4"
}
] | 2024-04-08 | [
[
"Civit",
"Pierre",
""
],
[
"Dzulfikar",
"Muhammad Ayaz",
""
],
[
"Gilbert",
"Seth",
""
],
[
"Guerraoui",
"Rachid",
""
],
[
"Komatovic",
"Jovan",
""
],
[
"Vidigueira",
"Manuel",
""
],
[
"Zablotchi",
"Igor",
... | Byzantine agreement allows n processes to decide on a common value, in spite of arbitrary failures. The seminal Dolev-Reischuk bound states that any deterministic solution to Byzantine agreement exchanges Omega(n^2) bits. In synchronous networks, solutions with optimal O(n^2) bit complexity, optimal fault tolerance, an... |
1507.02099 | Ludo Waltman | Ludo Waltman | A review of the literature on citation impact indicators | null | null | null | null | cs.DL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Citation impact indicators nowadays play an important role in research
evaluation, and consequently these indicators have received a lot of attention
in the bibliometric and scientometric literature. This paper provides an
in-depth review of the literature on citation impact indicators. First, an
overview is given of... | [
{
"created": "Wed, 8 Jul 2015 11:21:58 GMT",
"version": "v1"
},
{
"created": "Thu, 10 Dec 2015 16:20:02 GMT",
"version": "v2"
},
{
"created": "Thu, 25 Feb 2016 15:11:58 GMT",
"version": "v3"
}
] | 2016-02-26 | [
[
"Waltman",
"Ludo",
""
]
] | Citation impact indicators nowadays play an important role in research evaluation, and consequently these indicators have received a lot of attention in the bibliometric and scientometric literature. This paper provides an in-depth review of the literature on citation impact indicators. First, an overview is given of t... |
2109.03429 | Friedrich Sommer | E. Paxon Frady, Denis Kleyko, Christopher J. Kymn, Bruno A. Olshausen,
Friedrich T. Sommer | Computing on Functions Using Randomized Vector Representations | 33 pages, 18 Figures | null | null | null | cs.LG cs.NE q-bio.NC | http://creativecommons.org/licenses/by-sa/4.0/ | Vector space models for symbolic processing that encode symbols by random
vectors have been proposed in cognitive science and connectionist communities
under the names Vector Symbolic Architecture (VSA), and, synonymously,
Hyperdimensional (HD) computing. In this paper, we generalize VSAs to function
spaces by mappin... | [
{
"created": "Wed, 8 Sep 2021 04:39:48 GMT",
"version": "v1"
}
] | 2021-09-09 | [
[
"Frady",
"E. Paxon",
""
],
[
"Kleyko",
"Denis",
""
],
[
"Kymn",
"Christopher J.",
""
],
[
"Olshausen",
"Bruno A.",
""
],
[
"Sommer",
"Friedrich T.",
""
]
] | Vector space models for symbolic processing that encode symbols by random vectors have been proposed in cognitive science and connectionist communities under the names Vector Symbolic Architecture (VSA), and, synonymously, Hyperdimensional (HD) computing. In this paper, we generalize VSAs to function spaces by mapping ... |
1809.00530 | Ruidan He | Ruidan He, Wee Sun Lee, Hwee Tou Ng, Daniel Dahlmeier | Adaptive Semi-supervised Learning for Cross-domain Sentiment
Classification | Accepted to EMNLP2018 | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We consider the cross-domain sentiment classification problem, where a
sentiment classifier is to be learned from a source domain and to be
generalized to a target domain. Our approach explicitly minimizes the distance
between the source and the target instances in an embedded feature space. With
the difference betwe... | [
{
"created": "Mon, 3 Sep 2018 10:15:04 GMT",
"version": "v1"
}
] | 2018-09-05 | [
[
"He",
"Ruidan",
""
],
[
"Lee",
"Wee Sun",
""
],
[
"Ng",
"Hwee Tou",
""
],
[
"Dahlmeier",
"Daniel",
""
]
] | We consider the cross-domain sentiment classification problem, where a sentiment classifier is to be learned from a source domain and to be generalized to a target domain. Our approach explicitly minimizes the distance between the source and the target instances in an embedded feature space. With the difference between... |
1902.11266 | M. Saquib Sarfraz | M. Saquib Sarfraz, Vivek Sharma, Rainer Stiefelhagen | Efficient Parameter-free Clustering Using First Neighbor Relations | CVPR 2019 | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We present a new clustering method in the form of a single clustering
equation that is able to directly discover groupings in the data. The main
proposition is that the first neighbor of each sample is all one needs to
discover large chains and finding the groups in the data. In contrast to most
existing clustering a... | [
{
"created": "Thu, 28 Feb 2019 18:12:57 GMT",
"version": "v1"
}
] | 2019-03-01 | [
[
"Sarfraz",
"M. Saquib",
""
],
[
"Sharma",
"Vivek",
""
],
[
"Stiefelhagen",
"Rainer",
""
]
] | We present a new clustering method in the form of a single clustering equation that is able to directly discover groupings in the data. The main proposition is that the first neighbor of each sample is all one needs to discover large chains and finding the groups in the data. In contrast to most existing clustering alg... |
2401.15048 | Dmytro Zakharov | Dmytro Zakharov, Oleksandr Kuznetsov, Emanuele Frontoni | Unrecognizable Yet Identifiable: Image Distortion with Preserved
Embeddings | null | null | null | null | cs.CV cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In the realm of security applications, biometric authentication systems play
a crucial role, yet one often encounters challenges concerning privacy and
security while developing one. One of the most fundamental challenges lies in
avoiding storing biometrics directly in the storage but still achieving
decently high ac... | [
{
"created": "Fri, 26 Jan 2024 18:20:53 GMT",
"version": "v1"
}
] | 2024-01-29 | [
[
"Zakharov",
"Dmytro",
""
],
[
"Kuznetsov",
"Oleksandr",
""
],
[
"Frontoni",
"Emanuele",
""
]
] | In the realm of security applications, biometric authentication systems play a crucial role, yet one often encounters challenges concerning privacy and security while developing one. One of the most fundamental challenges lies in avoiding storing biometrics directly in the storage but still achieving decently high accu... |
2010.04970 | Yingxue Zhang | Yingxue Zhang, Fandong Meng, Peng Li, Ping Jian, Jie Zhou | MS-Ranker: Accumulating Evidence from Potentially Correct Candidates for
Answer Selection | null | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | As conventional answer selection (AS) methods generally match the question
with each candidate answer independently, they suffer from the lack of matching
information between the question and the candidate. To address this problem, we
propose a novel reinforcement learning (RL) based multi-step ranking model,
named M... | [
{
"created": "Sat, 10 Oct 2020 10:36:58 GMT",
"version": "v1"
}
] | 2020-10-13 | [
[
"Zhang",
"Yingxue",
""
],
[
"Meng",
"Fandong",
""
],
[
"Li",
"Peng",
""
],
[
"Jian",
"Ping",
""
],
[
"Zhou",
"Jie",
""
]
] | As conventional answer selection (AS) methods generally match the question with each candidate answer independently, they suffer from the lack of matching information between the question and the candidate. To address this problem, we propose a novel reinforcement learning (RL) based multi-step ranking model, named MS-... |
2006.13326 | Mohammad Fereydounian | Mohammad Fereydounian, Zebang Shen, Aryan Mokhtari, Amin Karbasi,
Hamed Hassani | Safe Learning under Uncertain Objectives and Constraints | 42 pages, 2 figures | null | null | null | cs.LG cs.AI math.OC stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we consider non-convex optimization problems under
\textit{unknown} yet safety-critical constraints. Such problems naturally arise
in a variety of domains including robotics, manufacturing, and medical
procedures, where it is infeasible to know or identify all the constraints.
Therefore, the parameter ... | [
{
"created": "Tue, 23 Jun 2020 20:51:00 GMT",
"version": "v1"
}
] | 2020-06-25 | [
[
"Fereydounian",
"Mohammad",
""
],
[
"Shen",
"Zebang",
""
],
[
"Mokhtari",
"Aryan",
""
],
[
"Karbasi",
"Amin",
""
],
[
"Hassani",
"Hamed",
""
]
] | In this paper, we consider non-convex optimization problems under \textit{unknown} yet safety-critical constraints. Such problems naturally arise in a variety of domains including robotics, manufacturing, and medical procedures, where it is infeasible to know or identify all the constraints. Therefore, the parameter sp... |
2007.02736 | Frank Wolter | Alessandro Artale and Jean Christoph Jung and Andrea Mazzullo and Ana
Ozaki and Frank Wolter | Living Without Beth and Craig: Definitions and Interpolants in
Description and Modal Logics with Nominals and Role Inclusions | We have revised a few sections from the previous version. The
relationship between interpolants and explicit definitions is analysed in
more detail now | null | null | null | cs.LO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The Craig interpolation property (CIP) states that an interpolant for an
implication exists iff it is valid. The projective Beth definability property
(PBDP) states that an explicit definition exists iff a formula stating implicit
definability is valid. Thus, the CIP and PBDP reduce potentially hard existence
problem... | [
{
"created": "Mon, 6 Jul 2020 13:16:12 GMT",
"version": "v1"
},
{
"created": "Thu, 20 Aug 2020 08:52:24 GMT",
"version": "v2"
},
{
"created": "Mon, 28 Dec 2020 11:48:02 GMT",
"version": "v3"
},
{
"created": "Wed, 17 Aug 2022 15:49:55 GMT",
"version": "v4"
},
{
"cr... | 2023-05-01 | [
[
"Artale",
"Alessandro",
""
],
[
"Jung",
"Jean Christoph",
""
],
[
"Mazzullo",
"Andrea",
""
],
[
"Ozaki",
"Ana",
""
],
[
"Wolter",
"Frank",
""
]
] | The Craig interpolation property (CIP) states that an interpolant for an implication exists iff it is valid. The projective Beth definability property (PBDP) states that an explicit definition exists iff a formula stating implicit definability is valid. Thus, the CIP and PBDP reduce potentially hard existence problems ... |
2204.06297 | Giorgio Visani Mr | Giorgio Visani, Giacomo Graffi, Mattia Alfero, Enrico Bagli, Davide
Capuzzo, Federico Chesani | Enabling Synthetic Data adoption in regulated domains | null | null | null | null | cs.LG cs.AI stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The switch from a Model-Centric to a Data-Centric mindset is putting emphasis
on data and its quality rather than algorithms, bringing forward new
challenges. In particular, the sensitive nature of the information in highly
regulated scenarios needs to be accounted for. Specific approaches to address
the privacy issu... | [
{
"created": "Wed, 13 Apr 2022 10:53:54 GMT",
"version": "v1"
}
] | 2022-04-14 | [
[
"Visani",
"Giorgio",
""
],
[
"Graffi",
"Giacomo",
""
],
[
"Alfero",
"Mattia",
""
],
[
"Bagli",
"Enrico",
""
],
[
"Capuzzo",
"Davide",
""
],
[
"Chesani",
"Federico",
""
]
] | The switch from a Model-Centric to a Data-Centric mindset is putting emphasis on data and its quality rather than algorithms, bringing forward new challenges. In particular, the sensitive nature of the information in highly regulated scenarios needs to be accounted for. Specific approaches to address the privacy issue ... |
1209.3644 | Petrus H Potgieter | Petrus H. Potgieter | Availability of titles on peer-to-peer file sharing networks | 8 pages | null | null | null | cs.NI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | File sharing, typically involving video or audio material in which copyright
may persist and using peer-to-peer (P2P) networks like BitTorrent, has been
reported to make up the bulk of Internet traffic. The free-riding problem
appears in this "digital gift economy" but its users exhibit rational
behaviour, subject to... | [
{
"created": "Mon, 17 Sep 2012 13:12:04 GMT",
"version": "v1"
}
] | 2012-09-18 | [
[
"Potgieter",
"Petrus H.",
""
]
] | File sharing, typically involving video or audio material in which copyright may persist and using peer-to-peer (P2P) networks like BitTorrent, has been reported to make up the bulk of Internet traffic. The free-riding problem appears in this "digital gift economy" but its users exhibit rational behaviour, subject to t... |
2405.18803 | Minyu Feng | Minyu Feng, Ziyan Zeng, Qin Li, Matja\v{z} Perc, J\"urgen Kurths | Information Dynamics in Evolving Networks Based on the Birth-Death
Process: Random Drift and Natural Selection Perspective | 14 pages, 9 figures | null | 10.1109/TSMC.2024.3389095 | null | cs.SI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Dynamic processes in complex networks are crucial for better understanding
collective behavior in human societies, biological systems, and the internet.
In this paper, we first focus on the continuous Markov-based modeling of
evolving networks with the birth-death of individuals. A new individual arrives
at the group... | [
{
"created": "Wed, 29 May 2024 06:47:00 GMT",
"version": "v1"
}
] | 2024-05-30 | [
[
"Feng",
"Minyu",
""
],
[
"Zeng",
"Ziyan",
""
],
[
"Li",
"Qin",
""
],
[
"Perc",
"Matjaž",
""
],
[
"Kurths",
"Jürgen",
""
]
] | Dynamic processes in complex networks are crucial for better understanding collective behavior in human societies, biological systems, and the internet. In this paper, we first focus on the continuous Markov-based modeling of evolving networks with the birth-death of individuals. A new individual arrives at the group b... |
2201.06310 | I\~nigo Martinez | I\~nigo Martinez, Elisabeth Viles, Igor G. Olaizola | A survey study of success factors in data science projects | 6 pages, 7 figures, 2 tables, accepted at IEEE Big Data 2021,
International Workshop on Methods to Improve Big Data Science Projects | 2021 IEEE International Conference on Big Data, pages 2313-2318 | 10.1109/BigData52589.2021.9671588 | null | cs.DB cs.GL cs.LG cs.SE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In recent years, the data science community has pursued excellence and made
significant research efforts to develop advanced analytics, focusing on solving
technical problems at the expense of organizational and socio-technical
challenges. According to previous surveys on the state of data science project
management,... | [
{
"created": "Mon, 17 Jan 2022 09:50:46 GMT",
"version": "v1"
}
] | 2022-01-19 | [
[
"Martinez",
"Iñigo",
""
],
[
"Viles",
"Elisabeth",
""
],
[
"Olaizola",
"Igor G.",
""
]
] | In recent years, the data science community has pursued excellence and made significant research efforts to develop advanced analytics, focusing on solving technical problems at the expense of organizational and socio-technical challenges. According to previous surveys on the state of data science project management, t... |
1904.08144 | Jaechang Lim | Jaechang Lim, Seongok Ryu, Kyubyong Park, Yo Joong Choe, Jiyeon Ham,
and Woo Youn Kim | Predicting drug-target interaction using 3D structure-embedded graph
representations from graph neural networks | 20 pages, 2 figures | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Accurate prediction of drug-target interaction (DTI) is essential for in
silico drug design. For the purpose, we propose a novel approach for predicting
DTI using a GNN that directly incorporates the 3D structure of a protein-ligand
complex. We also apply a distance-aware graph attention algorithm with gate
augmentat... | [
{
"created": "Wed, 17 Apr 2019 09:03:54 GMT",
"version": "v1"
}
] | 2019-04-18 | [
[
"Lim",
"Jaechang",
""
],
[
"Ryu",
"Seongok",
""
],
[
"Park",
"Kyubyong",
""
],
[
"Choe",
"Yo Joong",
""
],
[
"Ham",
"Jiyeon",
""
],
[
"Kim",
"Woo Youn",
""
]
] | Accurate prediction of drug-target interaction (DTI) is essential for in silico drug design. For the purpose, we propose a novel approach for predicting DTI using a GNN that directly incorporates the 3D structure of a protein-ligand complex. We also apply a distance-aware graph attention algorithm with gate augmentatio... |
2007.07053 | Qiang Nie | Qiang Nie, Ziwei Liu, Yunhui Liu | Unsupervised 3D Human Pose Representation with Viewpoint and Pose
Disentanglement | To appear in ECCV 2020. Code and models are available at:
https://github.com/NIEQiang001/unsupervised-human-pose.git | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Learning a good 3D human pose representation is important for human pose
related tasks, e.g. human 3D pose estimation and action recognition. Within all
these problems, preserving the intrinsic pose information and adapting to view
variations are two critical issues. In this work, we propose a novel Siamese
denoising... | [
{
"created": "Tue, 14 Jul 2020 14:25:22 GMT",
"version": "v1"
},
{
"created": "Tue, 2 Nov 2021 03:23:43 GMT",
"version": "v2"
}
] | 2021-11-03 | [
[
"Nie",
"Qiang",
""
],
[
"Liu",
"Ziwei",
""
],
[
"Liu",
"Yunhui",
""
]
] | Learning a good 3D human pose representation is important for human pose related tasks, e.g. human 3D pose estimation and action recognition. Within all these problems, preserving the intrinsic pose information and adapting to view variations are two critical issues. In this work, we propose a novel Siamese denoising a... |
1608.04529 | Stephan Druskat | Stephan Druskat | A Proposal for the Measurement and Documentation of Research Software
Sustainability in Interactive Metadata Repositories | 2 pages, submitted to and accepted for the 4th Workshop on
Sustainable Software for Science: Practice and Experiences (WSSSPE4), 12-14
September 2016, Manchester, UK | null | null | null | cs.SE cs.CY | http://creativecommons.org/licenses/by/4.0/ | This paper proposes an interactive repository type for research software
metadata which measures and documents software sustainability by accumulating
metadata, and computing sustainability metrics over them. Such a repository
would help to overcome technical barriers to software sustainability by
furthering the disc... | [
{
"created": "Tue, 16 Aug 2016 09:41:23 GMT",
"version": "v1"
},
{
"created": "Wed, 17 Aug 2016 10:29:58 GMT",
"version": "v2"
}
] | 2016-08-18 | [
[
"Druskat",
"Stephan",
""
]
] | This paper proposes an interactive repository type for research software metadata which measures and documents software sustainability by accumulating metadata, and computing sustainability metrics over them. Such a repository would help to overcome technical barriers to software sustainability by furthering the discov... |
2005.13654 | Matija Pretnar | \v{Z}iga Luk\v{s}i\v{c} and Matija Pretnar | Local Algebraic Effect Theories | 24 pages, 8 figures | LUKSIC, Z, & PRETNAR, M. (2020). Local algebraic effect theories.
Journal of Functional Programming, 30, E13 | 10.1017/S0956796819000212 | null | cs.LO cs.PL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Algebraic effects are computational effects that can be described with a set
of basic operations and equations between them. As many interesting effect
handlers do not respect these equations, most approaches assume a trivial
theory, sacrificing both reasoning power and safety.
We present an alternative approach wh... | [
{
"created": "Wed, 27 May 2020 21:08:54 GMT",
"version": "v1"
}
] | 2020-05-29 | [
[
"Lukšič",
"Žiga",
""
],
[
"Pretnar",
"Matija",
""
]
] | Algebraic effects are computational effects that can be described with a set of basic operations and equations between them. As many interesting effect handlers do not respect these equations, most approaches assume a trivial theory, sacrificing both reasoning power and safety. We present an alternative approach where ... |
2204.00350 | Zheng Zhao | Zheng Zhao and Bonnie Webber | Revisiting Shallow Discourse Parsing in the PDTB-3: Handling
Intra-sentential Implicits | Accepted to CODI 2021 | null | null | null | cs.CL | http://creativecommons.org/licenses/by-nc-sa/4.0/ | In the PDTB-3, several thousand implicit discourse relations were newly
annotated \textit{within} individual sentences, adding to the over 15,000
implicit relations annotated \textit{across} adjacent sentences in the PDTB-2.
Given that the position of the arguments to these \textit{intra-sentential
implicits} is no l... | [
{
"created": "Fri, 1 Apr 2022 10:56:25 GMT",
"version": "v1"
}
] | 2022-04-04 | [
[
"Zhao",
"Zheng",
""
],
[
"Webber",
"Bonnie",
""
]
] | In the PDTB-3, several thousand implicit discourse relations were newly annotated \textit{within} individual sentences, adding to the over 15,000 implicit relations annotated \textit{across} adjacent sentences in the PDTB-2. Given that the position of the arguments to these \textit{intra-sentential implicits} is no lon... |
2212.05613 | Filip Ilievski | Aravinda Kolla, Filip Ilievski, H\^ong-\^An Sandlin and Alain Mermoud | A Study of Slang Representation Methods | null | null | null | null | cs.CL cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Considering the large amount of content created online by the minute,
slang-aware automatic tools are critically needed to promote social good, and
assist policymakers and moderators in restricting the spread of offensive
language, abuse, and hate speech. Despite the success of large language models
and the spontaneo... | [
{
"created": "Sun, 11 Dec 2022 21:56:44 GMT",
"version": "v1"
},
{
"created": "Fri, 27 Jan 2023 17:06:45 GMT",
"version": "v2"
},
{
"created": "Tue, 31 Jan 2023 19:37:52 GMT",
"version": "v3"
}
] | 2023-02-02 | [
[
"Kolla",
"Aravinda",
""
],
[
"Ilievski",
"Filip",
""
],
[
"Sandlin",
"Hông-Ân",
""
],
[
"Mermoud",
"Alain",
""
]
] | Considering the large amount of content created online by the minute, slang-aware automatic tools are critically needed to promote social good, and assist policymakers and moderators in restricting the spread of offensive language, abuse, and hate speech. Despite the success of large language models and the spontaneous... |
0801.0938 | Sang-Woon Jeon | Sang-Woon Jeon, Natasha Devroye, Mai Vu, Sae-Young Chung, Vahid Tarokh | Cognitive Networks Achieve Throughput Scaling of a Homogeneous Network | 28 pages, 12 figures, submitted to IEEE Trans. on Information Theory | IEEE Transactions on Information Theory, vol. 57, no. 8, pp.
5103-5115, Aug. 2011 | 10.1109/TIT.2011.2158874 | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We study two distinct, but overlapping, networks that operate at the same
time, space, and frequency. The first network consists of $n$ randomly
distributed \emph{primary users}, which form either an ad hoc network, or an
infrastructure-supported ad hoc network with $l$ additional base stations. The
second network co... | [
{
"created": "Mon, 7 Jan 2008 10:52:39 GMT",
"version": "v1"
},
{
"created": "Thu, 16 Jul 2009 05:24:13 GMT",
"version": "v2"
}
] | 2016-11-17 | [
[
"Jeon",
"Sang-Woon",
""
],
[
"Devroye",
"Natasha",
""
],
[
"Vu",
"Mai",
""
],
[
"Chung",
"Sae-Young",
""
],
[
"Tarokh",
"Vahid",
""
]
] | We study two distinct, but overlapping, networks that operate at the same time, space, and frequency. The first network consists of $n$ randomly distributed \emph{primary users}, which form either an ad hoc network, or an infrastructure-supported ad hoc network with $l$ additional base stations. The second network cons... |
cs/0603047 | Simone Severini | Stefano Mancini and Simone Severini | The Quantum Separability Problem for Gaussian States | 8 pages | Electronic Notes in Theoretical Computer Science, Volume 169 ,
March 2007, pp. 121-131 | 10.1016/j.entcs.2006.07.034 | null | cs.CC quant-ph | null | Determining whether a quantum state is separable or entangled is a problem of
fundamental importance in quantum information science. This is a brief review
in which we consider the problem for states in infinite dimensional Hilbert
spaces. We show how the problem becomes tractable for a class of Gaussian
states.
| [
{
"created": "Sun, 12 Mar 2006 14:33:41 GMT",
"version": "v1"
},
{
"created": "Fri, 31 Mar 2006 12:38:49 GMT",
"version": "v2"
}
] | 2007-05-23 | [
[
"Mancini",
"Stefano",
""
],
[
"Severini",
"Simone",
""
]
] | Determining whether a quantum state is separable or entangled is a problem of fundamental importance in quantum information science. This is a brief review in which we consider the problem for states in infinite dimensional Hilbert spaces. We show how the problem becomes tractable for a class of Gaussian states. |
2211.11039 | Jag Mohan Singh | Jag Mohan Singh, Raghavendra Ramachandra | Deep Composite Face Image Attacks: Generation, Vulnerability and
Detection | The submitted paper is accepted in IEEE Access 2023 | null | null | null | cs.CV | http://creativecommons.org/licenses/by/4.0/ | Face manipulation attacks have drawn the attention of biometric researchers
because of their vulnerability to Face Recognition Systems (FRS). This paper
proposes a novel scheme to generate Composite Face Image Attacks (CFIA) based
on facial attributes using Generative Adversarial Networks (GANs). Given the
face image... | [
{
"created": "Sun, 20 Nov 2022 17:31:52 GMT",
"version": "v1"
},
{
"created": "Thu, 16 Feb 2023 17:41:25 GMT",
"version": "v2"
},
{
"created": "Mon, 20 Mar 2023 20:06:42 GMT",
"version": "v3"
}
] | 2023-03-22 | [
[
"Singh",
"Jag Mohan",
""
],
[
"Ramachandra",
"Raghavendra",
""
]
] | Face manipulation attacks have drawn the attention of biometric researchers because of their vulnerability to Face Recognition Systems (FRS). This paper proposes a novel scheme to generate Composite Face Image Attacks (CFIA) based on facial attributes using Generative Adversarial Networks (GANs). Given the face images ... |
1611.04455 | Hongyi Liu | Vaidehi Dalmia, Hongyi Liu, Shih-Fu Chang | Columbia MVSO Image Sentiment Dataset | null | null | null | null | cs.MM | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The Multilingual Visual Sentiment Ontology (MVSO) consists of 15,600 concepts
in 12 different languages that are strongly related to emotions and sentiments
expressed in images. These concepts are defined in the form of Adjective-Noun
Pair (ANP), which are crawled and discovered from online image forum Flickr. In
thi... | [
{
"created": "Mon, 14 Nov 2016 16:48:12 GMT",
"version": "v1"
}
] | 2016-11-15 | [
[
"Dalmia",
"Vaidehi",
""
],
[
"Liu",
"Hongyi",
""
],
[
"Chang",
"Shih-Fu",
""
]
] | The Multilingual Visual Sentiment Ontology (MVSO) consists of 15,600 concepts in 12 different languages that are strongly related to emotions and sentiments expressed in images. These concepts are defined in the form of Adjective-Noun Pair (ANP), which are crawled and discovered from online image forum Flickr. In this ... |
1901.03489 | Chen Qu | Chen Qu, Liu Yang, Bruce Croft, Yongfeng Zhang, Johanne R. Trippas and
Minghui Qiu | User Intent Prediction in Information-seeking Conversations | Accepted to CHIIR 2019 | null | 10.1145/3295750.3298924 | null | cs.IR cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Conversational assistants are being progressively adopted by the general
population. However, they are not capable of handling complicated
information-seeking tasks that involve multiple turns of information exchange.
Due to the limited communication bandwidth in conversational search, it is
important for conversatio... | [
{
"created": "Fri, 11 Jan 2019 05:53:13 GMT",
"version": "v1"
}
] | 2019-01-14 | [
[
"Qu",
"Chen",
""
],
[
"Yang",
"Liu",
""
],
[
"Croft",
"Bruce",
""
],
[
"Zhang",
"Yongfeng",
""
],
[
"Trippas",
"Johanne R.",
""
],
[
"Qiu",
"Minghui",
""
]
] | Conversational assistants are being progressively adopted by the general population. However, they are not capable of handling complicated information-seeking tasks that involve multiple turns of information exchange. Due to the limited communication bandwidth in conversational search, it is important for conversationa... |
1701.02710 | Subhro Das | Subhro Das and Jos\'e M. F. Moura | Distributed Estimation of Dynamic Fields over Multi-agent Networks | Accepted for publication at ICASSP 2017 | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This work presents distributed algorithms for estimation of time-varying
random fields over multi-agent/sensor networks. A network of sensors makes
sparse and noisy local measurements of the dynamic field. Each sensor aims to
obtain unbiased distributed estimates of the entire field with bounded
mean-squared error (M... | [
{
"created": "Tue, 10 Jan 2017 18:04:16 GMT",
"version": "v1"
}
] | 2017-01-11 | [
[
"Das",
"Subhro",
""
],
[
"Moura",
"José M. F.",
""
]
] | This work presents distributed algorithms for estimation of time-varying random fields over multi-agent/sensor networks. A network of sensors makes sparse and noisy local measurements of the dynamic field. Each sensor aims to obtain unbiased distributed estimates of the entire field with bounded mean-squared error (MSE... |
1504.04799 | Qinghua Guo | Qinghua Guo and Jiangtao Xi | Approximate Message Passing with Unitary Transformation | 5 pages | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Approximate message passing (AMP) and its variants, developed based on loopy
belief propagation, are attractive for estimating a vector x from a noisy
version of z = Ax, which arises in many applications. For a large A with i. i.
d. elements, AMP can be characterized by the state evolution and exhibits fast
convergen... | [
{
"created": "Sun, 19 Apr 2015 06:06:46 GMT",
"version": "v1"
}
] | 2015-04-21 | [
[
"Guo",
"Qinghua",
""
],
[
"Xi",
"Jiangtao",
""
]
] | Approximate message passing (AMP) and its variants, developed based on loopy belief propagation, are attractive for estimating a vector x from a noisy version of z = Ax, which arises in many applications. For a large A with i. i. d. elements, AMP can be characterized by the state evolution and exhibits fast convergence... |
2404.18928 | Michael Luo Zhiyu | Michael Luo, Justin Wong, Brandon Trabucco, Yanping Huang, Joseph E.
Gonzalez, Zhifeng Chen, Ruslan Salakhutdinov, Ion Stoica | Stylus: Automatic Adapter Selection for Diffusion Models | Project Website: https://stylus-diffusion.github.io | null | null | null | cs.CV cs.AI cs.CL cs.GR cs.LG | http://creativecommons.org/licenses/by/4.0/ | Beyond scaling base models with more data or parameters, fine-tuned adapters
provide an alternative way to generate high fidelity, custom images at reduced
costs. As such, adapters have been widely adopted by open-source communities,
accumulating a database of over 100K adapters-most of which are highly
customized wi... | [
{
"created": "Mon, 29 Apr 2024 17:59:16 GMT",
"version": "v1"
}
] | 2024-04-30 | [
[
"Luo",
"Michael",
""
],
[
"Wong",
"Justin",
""
],
[
"Trabucco",
"Brandon",
""
],
[
"Huang",
"Yanping",
""
],
[
"Gonzalez",
"Joseph E.",
""
],
[
"Chen",
"Zhifeng",
""
],
[
"Salakhutdinov",
"Ruslan",
""
],
... | Beyond scaling base models with more data or parameters, fine-tuned adapters provide an alternative way to generate high fidelity, custom images at reduced costs. As such, adapters have been widely adopted by open-source communities, accumulating a database of over 100K adapters-most of which are highly customized with... |
2301.08811 | Cyrus Neary | Bo Chen and Calvin Hawkins and Mustafa O. Karabag and Cyrus Neary and
Matthew Hale and Ufuk Topcu | Differential Privacy in Cooperative Multiagent Planning | null | null | null | null | cs.MA cs.AI cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Privacy-aware multiagent systems must protect agents' sensitive data while
simultaneously ensuring that agents accomplish their shared objectives. Towards
this goal, we propose a framework to privatize inter-agent communications in
cooperative multiagent decision-making problems. We study sequential
decision-making p... | [
{
"created": "Fri, 20 Jan 2023 21:36:57 GMT",
"version": "v1"
}
] | 2023-01-24 | [
[
"Chen",
"Bo",
""
],
[
"Hawkins",
"Calvin",
""
],
[
"Karabag",
"Mustafa O.",
""
],
[
"Neary",
"Cyrus",
""
],
[
"Hale",
"Matthew",
""
],
[
"Topcu",
"Ufuk",
""
]
] | Privacy-aware multiagent systems must protect agents' sensitive data while simultaneously ensuring that agents accomplish their shared objectives. Towards this goal, we propose a framework to privatize inter-agent communications in cooperative multiagent decision-making problems. We study sequential decision-making pro... |
2004.04242 | Matheus Gadelha | Matheus Gadelha, Rui Wang, Subhransu Maji | Deep Manifold Prior | 22 pages, 12 figures | null | null | null | cs.CV cs.GR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We present a prior for manifold structured data, such as surfaces of 3D
shapes, where deep neural networks are adopted to reconstruct a target shape
using gradient descent starting from a random initialization. We show that
surfaces generated this way are smooth, with limiting behavior characterized by
Gaussian proce... | [
{
"created": "Wed, 8 Apr 2020 20:47:56 GMT",
"version": "v1"
}
] | 2020-04-10 | [
[
"Gadelha",
"Matheus",
""
],
[
"Wang",
"Rui",
""
],
[
"Maji",
"Subhransu",
""
]
] | We present a prior for manifold structured data, such as surfaces of 3D shapes, where deep neural networks are adopted to reconstruct a target shape using gradient descent starting from a random initialization. We show that surfaces generated this way are smooth, with limiting behavior characterized by Gaussian process... |
2309.07264 | Oliver Johnson | Vivekanand Paligadu and Oliver Johnson and Matthew Aldridge | Small error algorithms for tropical group testing | null | null | null | null | cs.IT math.IT math.PR | http://creativecommons.org/licenses/by/4.0/ | We consider a version of the classical group testing problem motivated by PCR
testing for COVID-19. In the so-called tropical group testing model, the
outcome of a test is the lowest cycle threshold (Ct) level of the individuals
pooled within it, rather than a simple binary indicator variable. We introduce
the tropic... | [
{
"created": "Wed, 13 Sep 2023 18:56:38 GMT",
"version": "v1"
},
{
"created": "Thu, 15 Aug 2024 05:51:13 GMT",
"version": "v2"
}
] | 2024-08-16 | [
[
"Paligadu",
"Vivekanand",
""
],
[
"Johnson",
"Oliver",
""
],
[
"Aldridge",
"Matthew",
""
]
] | We consider a version of the classical group testing problem motivated by PCR testing for COVID-19. In the so-called tropical group testing model, the outcome of a test is the lowest cycle threshold (Ct) level of the individuals pooled within it, rather than a simple binary indicator variable. We introduce the tropical... |
1911.11376 | Markus Knecht | Markus Knecht | Mandala: A Smart Contract Programming Language | null | null | null | null | cs.PL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Smart contracts on a blockchain behave precisely as specified by their code.
A vulnerability in this code can lead to unexpected behaviour, which is hard to
fix because a blockchain does not allow to change smart contract code after its
deployment. Such vulnerabilities have led to several incidents. In the
aftermath ... | [
{
"created": "Tue, 26 Nov 2019 07:33:22 GMT",
"version": "v1"
}
] | 2019-11-27 | [
[
"Knecht",
"Markus",
""
]
] | Smart contracts on a blockchain behave precisely as specified by their code. A vulnerability in this code can lead to unexpected behaviour, which is hard to fix because a blockchain does not allow to change smart contract code after its deployment. Such vulnerabilities have led to several incidents. In the aftermath of... |
2103.00902 | Bamdev Mishra | Bamdev Mishra, N T V Satyadev, Hiroyuki Kasai, and Pratik Jawanpuria | Manifold optimization for non-linear optimal transport problems | technical report, change is title, addition of experiments | null | null | null | cs.LG math.OC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Optimal transport (OT) has recently found widespread interest in machine
learning. It allows to define novel distances between probability measures,
which have shown promise in several applications. In this work, we discuss how
to computationally approach general non-linear OT problems within the framework
of Riemann... | [
{
"created": "Mon, 1 Mar 2021 10:49:19 GMT",
"version": "v1"
},
{
"created": "Fri, 8 Oct 2021 06:01:03 GMT",
"version": "v2"
}
] | 2021-10-11 | [
[
"Mishra",
"Bamdev",
""
],
[
"Satyadev",
"N T V",
""
],
[
"Kasai",
"Hiroyuki",
""
],
[
"Jawanpuria",
"Pratik",
""
]
] | Optimal transport (OT) has recently found widespread interest in machine learning. It allows to define novel distances between probability measures, which have shown promise in several applications. In this work, we discuss how to computationally approach general non-linear OT problems within the framework of Riemannia... |
1705.01226 | EPTCS | David M. Russinoff (ARM Ltd.) | A Computationally Surveyable Proof of the Group Properties of an
Elliptic Curve | In Proceedings ACL2Workshop 2017, arXiv:1705.00766 | EPTCS 249, 2017, pp. 30-46 | 10.4204/EPTCS.249.3 | null | cs.CR math.NT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We present an elementary proof of the group properties of the elliptic curve
known as "Curve25519", as a component of a comprehensive proof of correctness
of a hardware implementation of the associated Diffie-Hellman key agreement
algorithm. The entire proof has been formalized and mechanically verified with
ACL2, an... | [
{
"created": "Wed, 3 May 2017 01:48:57 GMT",
"version": "v1"
}
] | 2017-05-04 | [
[
"Russinoff",
"David M.",
"",
"ARM Ltd."
]
] | We present an elementary proof of the group properties of the elliptic curve known as "Curve25519", as a component of a comprehensive proof of correctness of a hardware implementation of the associated Diffie-Hellman key agreement algorithm. The entire proof has been formalized and mechanically verified with ACL2, and ... |
1202.2037 | Lianlin Li Dr | Lianlin Li | Note on RIP-based Co-sparse Analysis | null | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Over the past years, there are increasing interests in recovering the signals
from undersampling data where such signals are sparse under some orthogonal
dictionary or tight framework, which is referred to be sparse synthetic model.
More recently, its counterpart, i.e., the sparse analysis model, has also
attracted r... | [
{
"created": "Thu, 9 Feb 2012 16:34:47 GMT",
"version": "v1"
}
] | 2012-02-10 | [
[
"Li",
"Lianlin",
""
]
] | Over the past years, there are increasing interests in recovering the signals from undersampling data where such signals are sparse under some orthogonal dictionary or tight framework, which is referred to be sparse synthetic model. More recently, its counterpart, i.e., the sparse analysis model, has also attracted res... |
1903.07904 | Sadaf Zuhra Ms | Sadaf ul Zuhra, Prasanna Chaporkar, Abhay Karandikar | Resource Allocation for Loss Tolerant Video Streaming in eMBMS | null | null | null | null | cs.NI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Bandwidth hungry video content has become the dominant contributor to the
data traffic world over. Cellular networks are constantly evolving to meet the
growing traffic demands. Over the past few years, wireless multicast has been
garnering a lot of attention as a means of efficient resource utilization.
Multicast tr... | [
{
"created": "Tue, 19 Mar 2019 09:39:42 GMT",
"version": "v1"
}
] | 2019-03-20 | [
[
"Zuhra",
"Sadaf ul",
""
],
[
"Chaporkar",
"Prasanna",
""
],
[
"Karandikar",
"Abhay",
""
]
] | Bandwidth hungry video content has become the dominant contributor to the data traffic world over. Cellular networks are constantly evolving to meet the growing traffic demands. Over the past few years, wireless multicast has been garnering a lot of attention as a means of efficient resource utilization. Multicast tran... |
2405.11905 | Jaewon Son | Jaewon Son, Jaehun Park, Kwangsu Kim | CSTA: CNN-based Spatiotemporal Attention for Video Summarization | Accepted at CVPR 2024 | null | null | null | cs.CV | http://creativecommons.org/licenses/by/4.0/ | Video summarization aims to generate a concise representation of a video,
capturing its essential content and key moments while reducing its overall
length. Although several methods employ attention mechanisms to handle
long-term dependencies, they often fail to capture the visual significance
inherent in frames. To ... | [
{
"created": "Mon, 20 May 2024 09:38:37 GMT",
"version": "v1"
},
{
"created": "Tue, 21 May 2024 07:04:23 GMT",
"version": "v2"
}
] | 2024-05-22 | [
[
"Son",
"Jaewon",
""
],
[
"Park",
"Jaehun",
""
],
[
"Kim",
"Kwangsu",
""
]
] | Video summarization aims to generate a concise representation of a video, capturing its essential content and key moments while reducing its overall length. Although several methods employ attention mechanisms to handle long-term dependencies, they often fail to capture the visual significance inherent in frames. To ad... |
1908.02555 | Damien Chablat | Yang Zhang (LS2N, RoMas), Vigen Arakelian (DGMA, LS2N, RoMas),
Baptiste Veron (IRT Jules Verne), Damien Chablat (LS2N, ReV) | Key Features of the Coupled Hand-operated Balanced Manipulator (HOBM)
and Lightweight Robot (LWR) | null | Advances in Mechanism and Machine Science, pp.2289-2298, 2019 | null | null | cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The paper deals with coupled systems including hand-operated balanced
manipulators and lightweight robots. The aim of such a cooperation is to
displace heavy payloads with less powerful robots. In other term, in the
coupled system for handling of heavy payloads by a HOBM an operator is replaced
by a LWR. The advantag... | [
{
"created": "Wed, 7 Aug 2019 12:21:45 GMT",
"version": "v1"
}
] | 2019-08-08 | [
[
"Zhang",
"Yang",
"",
"LS2N, RoMas"
],
[
"Arakelian",
"Vigen",
"",
"DGMA, LS2N, RoMas"
],
[
"Veron",
"Baptiste",
"",
"IRT Jules Verne"
],
[
"Chablat",
"Damien",
"",
"LS2N, ReV"
]
] | The paper deals with coupled systems including hand-operated balanced manipulators and lightweight robots. The aim of such a cooperation is to displace heavy payloads with less powerful robots. In other term, in the coupled system for handling of heavy payloads by a HOBM an operator is replaced by a LWR. The advantages... |
2202.06262 | Rajni Dabas | Rajni Dabas and Neelima Gupta | Locating Charging Stations: Connected, Capacitated and Prize- Collecting | null | null | null | null | cs.DS | http://creativecommons.org/licenses/by/4.0/ | In this paper, we study locating charging station problem as facility
location problem and its variants ($k$-Median, $k$-Facility location and
$k$-center). We study the connectivity and the capacity constraints in these
problem.
Capacity and connectivity constraints have been studied in the literature
separately fo... | [
{
"created": "Sun, 13 Feb 2022 08:55:13 GMT",
"version": "v1"
}
] | 2022-02-15 | [
[
"Dabas",
"Rajni",
""
],
[
"Gupta",
"Neelima",
""
]
] | In this paper, we study locating charging station problem as facility location problem and its variants ($k$-Median, $k$-Facility location and $k$-center). We study the connectivity and the capacity constraints in these problem. Capacity and connectivity constraints have been studied in the literature separately for al... |
1912.00191 | Jiankai Sun | Junning Huang, Sirui Xie, Jiankai Sun, Qiurui Ma, Chunxiao Liu,
Jianping Shi, Dahua Lin, Bolei Zhou | Learning a Decision Module by Imitating Driver's Control Behaviors | Proceedings of the Conference on Robot Learning (CoRL) 2020 | null | null | null | cs.AI cs.RO eess.SP | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Autonomous driving systems have a pipeline of perception, decision, planning,
and control. The decision module processes information from the perception
module and directs the execution of downstream planning and control modules. On
the other hand, the recent success of deep learning suggests that this pipeline
could... | [
{
"created": "Sat, 30 Nov 2019 11:57:35 GMT",
"version": "v1"
},
{
"created": "Wed, 5 May 2021 02:06:49 GMT",
"version": "v2"
},
{
"created": "Thu, 6 May 2021 01:38:16 GMT",
"version": "v3"
}
] | 2021-05-07 | [
[
"Huang",
"Junning",
""
],
[
"Xie",
"Sirui",
""
],
[
"Sun",
"Jiankai",
""
],
[
"Ma",
"Qiurui",
""
],
[
"Liu",
"Chunxiao",
""
],
[
"Shi",
"Jianping",
""
],
[
"Lin",
"Dahua",
""
],
[
"Zhou",
"Bolei... | Autonomous driving systems have a pipeline of perception, decision, planning, and control. The decision module processes information from the perception module and directs the execution of downstream planning and control modules. On the other hand, the recent success of deep learning suggests that this pipeline could b... |
2310.06947 | Roc\'io Carratal\'a-S\'aez | Roc\'io Carratal\'a-S\'aez and Francisco J. and\'ujar and Yuri Torres
and Arturo Gonzalez-Escribano and Diego R. Llanos | Open SYCL on heterogeneous GPU systems: A case of study | null | null | null | null | cs.DC | http://creativecommons.org/licenses/by-nc-sa/4.0/ | Computational platforms for high-performance scientific applications are
becoming more heterogenous, including hardware accelerators such as multiple
GPUs. Applications in a wide variety of scientific fields require an efficient
and careful management of the computational resources of this type of hardware
to obtain ... | [
{
"created": "Tue, 10 Oct 2023 19:07:52 GMT",
"version": "v1"
}
] | 2023-10-12 | [
[
"Carratalá-Sáez",
"Rocío",
""
],
[
"andújar",
"Francisco J.",
""
],
[
"Torres",
"Yuri",
""
],
[
"Gonzalez-Escribano",
"Arturo",
""
],
[
"Llanos",
"Diego R.",
""
]
] | Computational platforms for high-performance scientific applications are becoming more heterogenous, including hardware accelerators such as multiple GPUs. Applications in a wide variety of scientific fields require an efficient and careful management of the computational resources of this type of hardware to obtain th... |
1609.00214 | Wojciech Czerwi\'nski | Lorenzo Clemente, Wojciech Czerwi\'nski, S{\l}awomir Lasota, Charles
Paperman | Separability of Reachability Sets of Vector Addition Systems | null | null | null | null | cs.FL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Given two families of sets $\mathcal{F}$ and $\mathcal{G}$, the $\mathcal{F}$
separability problem for $\mathcal{G}$ asks whether for two given sets $U, V
\in \mathcal{G}$ there exists a set $S \in \mathcal{F}$, such that $U$ is
included in $S$ and $V$ is disjoint with $S$. We consider two families of sets
$\mathcal{... | [
{
"created": "Thu, 1 Sep 2016 12:42:18 GMT",
"version": "v1"
}
] | 2016-09-02 | [
[
"Clemente",
"Lorenzo",
""
],
[
"Czerwiński",
"Wojciech",
""
],
[
"Lasota",
"Sławomir",
""
],
[
"Paperman",
"Charles",
""
]
] | Given two families of sets $\mathcal{F}$ and $\mathcal{G}$, the $\mathcal{F}$ separability problem for $\mathcal{G}$ asks whether for two given sets $U, V \in \mathcal{G}$ there exists a set $S \in \mathcal{F}$, such that $U$ is included in $S$ and $V$ is disjoint with $S$. We consider two families of sets $\mathcal{F}... |
2403.11069 | Mohammad Heydari | Mohammad Heydari, Mohsen Khazeni, Mohammad Ali Soltanshahi | Deep Learning-based Sentiment Analysis in Persian Language | 7 pages, 5 figures, 4 tables | null | 10.1109/ICWR51868.2021.9443152 | null | cs.CL | http://creativecommons.org/licenses/by/4.0/ | Recently, there has been a growing interest in the use of deep learning
techniques for tasks in natural language processing (NLP), with sentiment
analysis being one of the most challenging areas, particularly in the Persian
language. The vast amounts of content generated by Persian users on thousands
of websites, blo... | [
{
"created": "Sun, 17 Mar 2024 03:15:29 GMT",
"version": "v1"
}
] | 2024-03-19 | [
[
"Heydari",
"Mohammad",
""
],
[
"Khazeni",
"Mohsen",
""
],
[
"Soltanshahi",
"Mohammad Ali",
""
]
] | Recently, there has been a growing interest in the use of deep learning techniques for tasks in natural language processing (NLP), with sentiment analysis being one of the most challenging areas, particularly in the Persian language. The vast amounts of content generated by Persian users on thousands of websites, blogs... |
1710.04313 | Marc Zeitoun | Thomas Place and Marc Zeitoun | Generic Results for Concatenation Hierarchies | null | null | null | null | cs.FL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In the theory of formal languages, the understanding of concatenation
hierarchies of regular languages is one of the most fundamental and challenging
topic. In this paper, we survey progress made in the comprehension of this
problem since 1971, and we establish new generic statements regarding this
problem.
| [
{
"created": "Wed, 11 Oct 2017 21:38:35 GMT",
"version": "v1"
}
] | 2017-10-13 | [
[
"Place",
"Thomas",
""
],
[
"Zeitoun",
"Marc",
""
]
] | In the theory of formal languages, the understanding of concatenation hierarchies of regular languages is one of the most fundamental and challenging topic. In this paper, we survey progress made in the comprehension of this problem since 1971, and we establish new generic statements regarding this problem. |
2211.13219 | Karolis Martinkus | Jeremia Geiger, Karolis Martinkus, Oliver Richter and Roger
Wattenhofer | Automating Rigid Origami Design | IJCAI 2023 AI, Arts & Creativity Special Track | null | null | null | cs.GR cs.AI cs.LG cs.NE cs.RO | http://creativecommons.org/licenses/by/4.0/ | Rigid origami has shown potential in large diversity of practical
applications. However, current rigid origami crease pattern design mostly
relies on known tessellations. This strongly limits the diversity and novelty
of patterns that can be created. In this work, we build upon the recently
developed principle of thr... | [
{
"created": "Sun, 20 Nov 2022 17:13:50 GMT",
"version": "v1"
},
{
"created": "Fri, 28 Apr 2023 12:45:57 GMT",
"version": "v2"
}
] | 2023-05-01 | [
[
"Geiger",
"Jeremia",
""
],
[
"Martinkus",
"Karolis",
""
],
[
"Richter",
"Oliver",
""
],
[
"Wattenhofer",
"Roger",
""
]
] | Rigid origami has shown potential in large diversity of practical applications. However, current rigid origami crease pattern design mostly relies on known tessellations. This strongly limits the diversity and novelty of patterns that can be created. In this work, we build upon the recently developed principle of three... |
2004.11814 | Feng Li | Feng Li, Runming Cong, Huihui Bai, and Yifan He | Deep Interleaved Network for Image Super-Resolution With Asymmetric
Co-Attention | Accepted by the IJCAI-PRICAI 2020 | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Recently, Convolutional Neural Networks (CNN) based image super-resolution
(SR) have shown significant success in the literature. However, these methods
are implemented as single-path stream to enrich feature maps from the input for
the final prediction, which fail to fully incorporate former low-level features
into ... | [
{
"created": "Fri, 24 Apr 2020 15:49:18 GMT",
"version": "v1"
}
] | 2020-04-27 | [
[
"Li",
"Feng",
""
],
[
"Cong",
"Runming",
""
],
[
"Bai",
"Huihui",
""
],
[
"He",
"Yifan",
""
]
] | Recently, Convolutional Neural Networks (CNN) based image super-resolution (SR) have shown significant success in the literature. However, these methods are implemented as single-path stream to enrich feature maps from the input for the final prediction, which fail to fully incorporate former low-level features into la... |
1807.06132 | Fatemeh Sadat Saleh | Fatemeh Sadat Saleh, Mohammad Sadegh Aliakbarian, Mathieu Salzmann,
Lars Petersson, Jose M. Alvarez | Effective Use of Synthetic Data for Urban Scene Semantic Segmentation | Accepted in European Conference on Computer Vision (ECCV), 2018 | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Training a deep network to perform semantic segmentation requires large
amounts of labeled data. To alleviate the manual effort of annotating real
images, researchers have investigated the use of synthetic data, which can be
labeled automatically. Unfortunately, a network trained on synthetic data
performs relatively... | [
{
"created": "Mon, 16 Jul 2018 22:10:09 GMT",
"version": "v1"
}
] | 2018-07-18 | [
[
"Saleh",
"Fatemeh Sadat",
""
],
[
"Aliakbarian",
"Mohammad Sadegh",
""
],
[
"Salzmann",
"Mathieu",
""
],
[
"Petersson",
"Lars",
""
],
[
"Alvarez",
"Jose M.",
""
]
] | Training a deep network to perform semantic segmentation requires large amounts of labeled data. To alleviate the manual effort of annotating real images, researchers have investigated the use of synthetic data, which can be labeled automatically. Unfortunately, a network trained on synthetic data performs relatively p... |
2102.06228 | Vidyadhar Upadhya | Vidyadhar Upadhya and P S Sastry | Learning Gaussian-Bernoulli RBMs using Difference of Convex Functions
Optimization | Submitted to IEEE-TNNLS | null | null | null | cs.LG | http://creativecommons.org/licenses/by/4.0/ | The Gaussian-Bernoulli restricted Boltzmann machine (GB-RBM) is a useful
generative model that captures meaningful features from the given
$n$-dimensional continuous data. The difficulties associated with learning
GB-RBM are reported extensively in earlier studies. They indicate that the
training of the GB-RBM using ... | [
{
"created": "Thu, 11 Feb 2021 19:15:54 GMT",
"version": "v1"
}
] | 2021-02-15 | [
[
"Upadhya",
"Vidyadhar",
""
],
[
"Sastry",
"P S",
""
]
] | The Gaussian-Bernoulli restricted Boltzmann machine (GB-RBM) is a useful generative model that captures meaningful features from the given $n$-dimensional continuous data. The difficulties associated with learning GB-RBM are reported extensively in earlier studies. They indicate that the training of the GB-RBM using th... |
2010.13198 | Klaus Schneider | Klaus Schneider, Beichuan Zhang, Van Sy Mai, Lotfi Benmohamed | The Case for Hop-by-Hop Traffic Engineering | null | null | null | null | cs.NI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | State-of-the-art Internet traffic engineering uses source-based explicit
routing via MPLS or Segment Routing. Though widely adopted in practice, source
routing can face certain inefficiencies and operational issues, caused by its
use of bandwidth reservations.
In this work, we make the case for Hop-by-Hop (HBH) Tra... | [
{
"created": "Sun, 25 Oct 2020 19:14:33 GMT",
"version": "v1"
}
] | 2020-10-27 | [
[
"Schneider",
"Klaus",
""
],
[
"Zhang",
"Beichuan",
""
],
[
"Mai",
"Van Sy",
""
],
[
"Benmohamed",
"Lotfi",
""
]
] | State-of-the-art Internet traffic engineering uses source-based explicit routing via MPLS or Segment Routing. Though widely adopted in practice, source routing can face certain inefficiencies and operational issues, caused by its use of bandwidth reservations. In this work, we make the case for Hop-by-Hop (HBH) Traffic... |
2406.18459 | Younghyun Kim | Younghyun Kim, Geunmin Hwang, Junyu Zhang, Eunbyung Park | DiffuseHigh: Training-free Progressive High-Resolution Image Synthesis
through Structure Guidance | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Recent surge in large-scale generative models has spurred the development of
vast fields in computer vision. In particular, text-to-image diffusion models
have garnered widespread adoption across diverse domain due to their potential
for high-fidelity image generation. Nonetheless, existing large-scale diffusion
mode... | [
{
"created": "Wed, 26 Jun 2024 16:10:31 GMT",
"version": "v1"
},
{
"created": "Mon, 8 Jul 2024 06:06:53 GMT",
"version": "v2"
},
{
"created": "Wed, 10 Jul 2024 06:18:13 GMT",
"version": "v3"
},
{
"created": "Thu, 11 Jul 2024 15:03:44 GMT",
"version": "v4"
}
] | 2024-07-12 | [
[
"Kim",
"Younghyun",
""
],
[
"Hwang",
"Geunmin",
""
],
[
"Zhang",
"Junyu",
""
],
[
"Park",
"Eunbyung",
""
]
] | Recent surge in large-scale generative models has spurred the development of vast fields in computer vision. In particular, text-to-image diffusion models have garnered widespread adoption across diverse domain due to their potential for high-fidelity image generation. Nonetheless, existing large-scale diffusion models... |
2303.07470 | Shrihari Sridharan | Shrihari Sridharan, Jacob R. Stevens, Kaushik Roy and Anand
Raghunathan | X-Former: In-Memory Acceleration of Transformers | null | null | null | null | cs.LG cs.AR | http://creativecommons.org/licenses/by/4.0/ | Transformers have achieved great success in a wide variety of natural
language processing (NLP) tasks due to the attention mechanism, which assigns
an importance score for every word relative to other words in a sequence.
However, these models are very large, often reaching hundreds of billions of
parameters, and the... | [
{
"created": "Mon, 13 Mar 2023 21:11:54 GMT",
"version": "v1"
}
] | 2023-03-15 | [
[
"Sridharan",
"Shrihari",
""
],
[
"Stevens",
"Jacob R.",
""
],
[
"Roy",
"Kaushik",
""
],
[
"Raghunathan",
"Anand",
""
]
] | Transformers have achieved great success in a wide variety of natural language processing (NLP) tasks due to the attention mechanism, which assigns an importance score for every word relative to other words in a sequence. However, these models are very large, often reaching hundreds of billions of parameters, and there... |
2102.00849 | Muhammad Umer Gurchani | Muhammad Umer Gurchani | Crawling political communities in Twitter and extracting political
affiliations | 22 Pages | null | null | null | cs.SI | http://creativecommons.org/licenses/by-sa/4.0/ | In theory, a major advantage to the big data approach in studying online
communities is that it should be possible to collect a representative random
sample from a broadly defined population. However, in practice, data collection
processes are not formalized, even for famous social media platforms such as
Twitter and... | [
{
"created": "Mon, 1 Feb 2021 13:57:48 GMT",
"version": "v1"
}
] | 2021-02-02 | [
[
"Gurchani",
"Muhammad Umer",
""
]
] | In theory, a major advantage to the big data approach in studying online communities is that it should be possible to collect a representative random sample from a broadly defined population. However, in practice, data collection processes are not formalized, even for famous social media platforms such as Twitter and F... |
2304.05632 | Haozhi Wang | Haozhi Wang, Yinchuan Li, Qing Wang, Yunfeng Shao, Jianye Hao | Multi-agent Policy Reciprocity with Theoretical Guarantee | null | null | null | null | cs.AI cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Modern multi-agent reinforcement learning (RL) algorithms hold great
potential for solving a variety of real-world problems. However, they do not
fully exploit cross-agent knowledge to reduce sample complexity and improve
performance. Although transfer RL supports knowledge sharing, it is
hyperparameter sensitive and... | [
{
"created": "Wed, 12 Apr 2023 06:27:10 GMT",
"version": "v1"
}
] | 2023-04-13 | [
[
"Wang",
"Haozhi",
""
],
[
"Li",
"Yinchuan",
""
],
[
"Wang",
"Qing",
""
],
[
"Shao",
"Yunfeng",
""
],
[
"Hao",
"Jianye",
""
]
] | Modern multi-agent reinforcement learning (RL) algorithms hold great potential for solving a variety of real-world problems. However, they do not fully exploit cross-agent knowledge to reduce sample complexity and improve performance. Although transfer RL supports knowledge sharing, it is hyperparameter sensitive and c... |
2309.05550 | Levent Aksoy | Levent Aksoy and Debapriya Basu Roy and Malik Imran and Samuel
Pagliarini | Multiplierless Design of High-Speed Very Large Constant Multiplications | null | null | null | null | cs.CR | http://creativecommons.org/licenses/by/4.0/ | In cryptographic algorithms, the constants to be multiplied by a variable can
be very large due to security requirements. Thus, the hardware complexity of
such algorithms heavily depends on the design architecture handling large
constants. In this paper, we introduce an electronic design automation tool,
called LEIGE... | [
{
"created": "Mon, 11 Sep 2023 15:35:02 GMT",
"version": "v1"
},
{
"created": "Tue, 12 Sep 2023 06:30:00 GMT",
"version": "v2"
}
] | 2023-09-13 | [
[
"Aksoy",
"Levent",
""
],
[
"Roy",
"Debapriya Basu",
""
],
[
"Imran",
"Malik",
""
],
[
"Pagliarini",
"Samuel",
""
]
] | In cryptographic algorithms, the constants to be multiplied by a variable can be very large due to security requirements. Thus, the hardware complexity of such algorithms heavily depends on the design architecture handling large constants. In this paper, we introduce an electronic design automation tool, called LEIGER,... |
2007.05196 | Matthias Hutsebaut-Buysse | Matthias Hutsebaut-Buysse, Kevin Mets, Steven Latr\'e | Pre-trained Word Embeddings for Goal-conditional Transfer Learning in
Reinforcement Learning | Paper accepted to the ICML 2020 Language in Reinforcement Learning
(LaReL) Workshop | null | null | null | cs.LG cs.AI stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Reinforcement learning (RL) algorithms typically start tabula rasa, without
any prior knowledge of the environment, and without any prior skills. This
however often leads to low sample efficiency, requiring a large amount of
interaction with the environment. This is especially true in a lifelong
learning setting, in ... | [
{
"created": "Fri, 10 Jul 2020 06:42:00 GMT",
"version": "v1"
}
] | 2020-07-13 | [
[
"Hutsebaut-Buysse",
"Matthias",
""
],
[
"Mets",
"Kevin",
""
],
[
"Latré",
"Steven",
""
]
] | Reinforcement learning (RL) algorithms typically start tabula rasa, without any prior knowledge of the environment, and without any prior skills. This however often leads to low sample efficiency, requiring a large amount of interaction with the environment. This is especially true in a lifelong learning setting, in wh... |
1901.00707 | Huaiping Ming | Huaiping Ming, Lei He, Haohan Guo, Frank K. Soong | Feature reinforcement with word embedding and parsing information in
neural TTS | null | null | null | null | cs.SD cs.CL eess.AS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we propose a feature reinforcement method under the
sequence-to-sequence neural text-to-speech (TTS) synthesis framework. The
proposed method utilizes the multiple input encoder to take three levels of
text information, i.e., phoneme sequence, pre-trained word embedding, and
grammatical structure of se... | [
{
"created": "Thu, 3 Jan 2019 13:15:19 GMT",
"version": "v1"
},
{
"created": "Wed, 6 Mar 2019 15:24:38 GMT",
"version": "v2"
}
] | 2019-03-07 | [
[
"Ming",
"Huaiping",
""
],
[
"He",
"Lei",
""
],
[
"Guo",
"Haohan",
""
],
[
"Soong",
"Frank K.",
""
]
] | In this paper, we propose a feature reinforcement method under the sequence-to-sequence neural text-to-speech (TTS) synthesis framework. The proposed method utilizes the multiple input encoder to take three levels of text information, i.e., phoneme sequence, pre-trained word embedding, and grammatical structure of sent... |
2304.00813 | Chi Zhang | Chi Zhang, Wenjie Ruan, Fu Wang, Peipei Xu, Geyong Min, Xiaowei Huang | Model-Agnostic Reachability Analysis on Deep Neural Networks | PAKDD 2023 | null | null | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Verification plays an essential role in the formal analysis of
safety-critical systems. Most current verification methods have specific
requirements when working on Deep Neural Networks (DNNs). They either target
one particular network category, e.g., Feedforward Neural Networks (FNNs), or
networks with specific acti... | [
{
"created": "Mon, 3 Apr 2023 09:01:59 GMT",
"version": "v1"
}
] | 2023-04-04 | [
[
"Zhang",
"Chi",
""
],
[
"Ruan",
"Wenjie",
""
],
[
"Wang",
"Fu",
""
],
[
"Xu",
"Peipei",
""
],
[
"Min",
"Geyong",
""
],
[
"Huang",
"Xiaowei",
""
]
] | Verification plays an essential role in the formal analysis of safety-critical systems. Most current verification methods have specific requirements when working on Deep Neural Networks (DNNs). They either target one particular network category, e.g., Feedforward Neural Networks (FNNs), or networks with specific activa... |
2111.04525 | Wentao Lu | Wentao Lu, Claude Sammut | D-Flow: A Real Time Spatial Temporal Model for Target Area Segmentation | null | null | null | null | cs.RO | http://creativecommons.org/licenses/by/4.0/ | Semantic segmentation has attracted a large amount of attention in recent
years. In robotics, segmentation can be used to identify a region of interest,
or \emph{target area}. For example, in the RoboCup Standard Platform League
(SPL), segmentation separates the soccer field from the background and from
players on th... | [
{
"created": "Mon, 8 Nov 2021 14:18:45 GMT",
"version": "v1"
}
] | 2021-11-09 | [
[
"Lu",
"Wentao",
""
],
[
"Sammut",
"Claude",
""
]
] | Semantic segmentation has attracted a large amount of attention in recent years. In robotics, segmentation can be used to identify a region of interest, or \emph{target area}. For example, in the RoboCup Standard Platform League (SPL), segmentation separates the soccer field from the background and from players on the ... |
1910.04907 | Gourav Datta | Gourav Datta, Haolin Cong, Souvik Kundu, Peter A. Beerel | Metastability-Resilient Synchronization FIFO for SFQ Logic | Accepted in ISEC 2019 | null | null | null | cs.ET physics.app-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Digital single-flux quantum (SFQ) technology promises to meet the demands of
ultra low power and high speed computing needed for future exascale
supercomputing systems. The combination of ultra high clock frequencies,
gate-level pipelines, and numerous sources of variability in SFQ circuits,
however, make low-skew gl... | [
{
"created": "Thu, 10 Oct 2019 23:17:06 GMT",
"version": "v1"
},
{
"created": "Wed, 23 Oct 2019 21:47:03 GMT",
"version": "v2"
}
] | 2019-10-25 | [
[
"Datta",
"Gourav",
""
],
[
"Cong",
"Haolin",
""
],
[
"Kundu",
"Souvik",
""
],
[
"Beerel",
"Peter A.",
""
]
] | Digital single-flux quantum (SFQ) technology promises to meet the demands of ultra low power and high speed computing needed for future exascale supercomputing systems. The combination of ultra high clock frequencies, gate-level pipelines, and numerous sources of variability in SFQ circuits, however, make low-skew glob... |
1906.04547 | Alex Hern\'andez Garc\'ia | Alex Hern\'andez-Garc\'ia, Peter K\"onig, Tim C. Kietzmann | Learning robust visual representations using data augmentation
invariance | 6 pages, 2 figures, work in progress | null | null | null | cs.CV cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Deep convolutional neural networks trained for image object categorization
have shown remarkable similarities with representations found across the
primate ventral visual stream. Yet, artificial and biological networks still
exhibit important differences. Here we investigate one such property:
increasing invariance t... | [
{
"created": "Tue, 11 Jun 2019 13:03:19 GMT",
"version": "v1"
}
] | 2019-06-12 | [
[
"Hernández-García",
"Alex",
""
],
[
"König",
"Peter",
""
],
[
"Kietzmann",
"Tim C.",
""
]
] | Deep convolutional neural networks trained for image object categorization have shown remarkable similarities with representations found across the primate ventral visual stream. Yet, artificial and biological networks still exhibit important differences. Here we investigate one such property: increasing invariance to ... |
1809.10336 | Tao Ma | Tao Ma | Multi-task Learning for Financial Forecasting | The methods and results of this paper have been proved to be wrong.
So we want to withdraw it to keep others from following the wrong results | null | null | null | cs.LG cs.AI stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Financial forecasting is challenging and attractive in machine learning.
There are many classic solutions, as well as many deep learning based methods,
proposed to deal with it yielding encouraging performance. Stock time series
forecasting is the most representative problem in financial forecasting. Due to
the stron... | [
{
"created": "Thu, 27 Sep 2018 04:03:03 GMT",
"version": "v1"
},
{
"created": "Sat, 15 Dec 2018 14:25:41 GMT",
"version": "v2"
},
{
"created": "Tue, 22 Jan 2019 09:19:22 GMT",
"version": "v3"
}
] | 2019-01-23 | [
[
"Ma",
"Tao",
""
]
] | Financial forecasting is challenging and attractive in machine learning. There are many classic solutions, as well as many deep learning based methods, proposed to deal with it yielding encouraging performance. Stock time series forecasting is the most representative problem in financial forecasting. Due to the strong ... |
1607.00501 | Le Dong | Le Dong, Na Lv, Qianni Zhang, Shanshan Xie, Ling He, Mengdie Mao | A Distributed Deep Representation Learning Model for Big Image Data
Classification | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper describes an effective and efficient image classification
framework nominated distributed deep representation learning model (DDRL). The
aim is to strike the balance between the computational intensive deep learning
approaches (tuned parameters) which are intended for distributed computing, and
the approac... | [
{
"created": "Sat, 2 Jul 2016 12:33:12 GMT",
"version": "v1"
}
] | 2016-07-05 | [
[
"Dong",
"Le",
""
],
[
"Lv",
"Na",
""
],
[
"Zhang",
"Qianni",
""
],
[
"Xie",
"Shanshan",
""
],
[
"He",
"Ling",
""
],
[
"Mao",
"Mengdie",
""
]
] | This paper describes an effective and efficient image classification framework nominated distributed deep representation learning model (DDRL). The aim is to strike the balance between the computational intensive deep learning approaches (tuned parameters) which are intended for distributed computing, and the approache... |
2002.10420 | Fahad Sohrab | Fahad Sohrab, Jenni Raitoharju | Boosting rare benthic macroinvertebrates taxa identification with
one-class classification | 5 pages, 1 figure, 2 tables | 2020 IEEE Symposium Series on Computational Intelligence (SSCI) | 10.1109/SSCI47803.2020.9308359 | null | cs.CV cs.LG eess.IV stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Insect monitoring is crucial for understanding the consequences of rapid
ecological changes, but taxa identification currently requires tedious manual
expert work and cannot be scaled-up efficiently. Deep convolutional neural
networks (CNNs), provide a viable way to significantly increase the
biomonitoring volumes. H... | [
{
"created": "Wed, 12 Feb 2020 09:46:24 GMT",
"version": "v1"
}
] | 2021-01-07 | [
[
"Sohrab",
"Fahad",
""
],
[
"Raitoharju",
"Jenni",
""
]
] | Insect monitoring is crucial for understanding the consequences of rapid ecological changes, but taxa identification currently requires tedious manual expert work and cannot be scaled-up efficiently. Deep convolutional neural networks (CNNs), provide a viable way to significantly increase the biomonitoring volumes. How... |
1907.00967 | David Hofbauer MSc | David Hofbauer, Christoph Schmittner, Manuela Brandstetter, Markus
Tauber | Autonomous CPS mobility securely designed | The 5th IEEE International workshop on Communication, Computing, and
Networking in Cyber Physical Systems (CCNCPS 2019) in association with 20th
IEEE International Symposium on a World of Wireless, Mobile and Multimedia
Networks (IEEE WoWMoM 2019) - Washington D.C., USA; | null | null | null | cs.OH | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In the last years the interconnection and ongoing development of physical
systems combined with cyber resources has led to increasing automation. Through
this progress in technology, autonomous vehicles, especially autonomous trains
are getting more attention from industry and are already under test. The use of
auton... | [
{
"created": "Tue, 2 Jul 2019 11:22:34 GMT",
"version": "v1"
}
] | 2019-07-03 | [
[
"Hofbauer",
"David",
""
],
[
"Schmittner",
"Christoph",
""
],
[
"Brandstetter",
"Manuela",
""
],
[
"Tauber",
"Markus",
""
]
] | In the last years the interconnection and ongoing development of physical systems combined with cyber resources has led to increasing automation. Through this progress in technology, autonomous vehicles, especially autonomous trains are getting more attention from industry and are already under test. The use of autonom... |
2407.15964 | David Keaton | David Keaton, Amol S. Joshi, Jeremy Dawson, Nasser M. Nasrabadi | FDWST: Fingerphoto Deblurring using Wavelet Style Transfer | Accepted by IJCB 2024 | null | null | null | cs.CV eess.IV | http://creativecommons.org/licenses/by-nc-sa/4.0/ | The challenge of deblurring fingerphoto images, or generating a sharp
fingerphoto from a given blurry one, is a significant problem in the realm of
computer vision. To address this problem, we propose a fingerphoto deblurring
architecture referred to as Fingerphoto Deblurring using Wavelet Style Transfer
(FDWST), whi... | [
{
"created": "Mon, 22 Jul 2024 18:26:43 GMT",
"version": "v1"
}
] | 2024-07-24 | [
[
"Keaton",
"David",
""
],
[
"Joshi",
"Amol S.",
""
],
[
"Dawson",
"Jeremy",
""
],
[
"Nasrabadi",
"Nasser M.",
""
]
] | The challenge of deblurring fingerphoto images, or generating a sharp fingerphoto from a given blurry one, is a significant problem in the realm of computer vision. To address this problem, we propose a fingerphoto deblurring architecture referred to as Fingerphoto Deblurring using Wavelet Style Transfer (FDWST), which... |
1911.13162 | Alexander Preuhs | Alexander Preuhs, Michael Manhart, Philipp Roser, Bernhard Stimpel,
Christopher Syben, Marios Psychogios, Markus Kowarschik, Andreas Maier | Deep autofocus with cone-beam CT consistency constraint | Accepted at BVM 2020, review score under Top-6 of the conference | null | null | null | cs.LG cs.CV eess.IV stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | High quality reconstruction with interventional C-arm cone-beam computed
tomography (CBCT) requires exact geometry information. If the geometry
information is corrupted, e. g., by unexpected patient or system movement, the
measured signal is misplaced in the backprojection operation. With prolonged
acquisition times ... | [
{
"created": "Fri, 29 Nov 2019 15:54:38 GMT",
"version": "v1"
},
{
"created": "Mon, 2 Dec 2019 12:17:44 GMT",
"version": "v2"
},
{
"created": "Wed, 4 Dec 2019 21:43:50 GMT",
"version": "v3"
}
] | 2019-12-06 | [
[
"Preuhs",
"Alexander",
""
],
[
"Manhart",
"Michael",
""
],
[
"Roser",
"Philipp",
""
],
[
"Stimpel",
"Bernhard",
""
],
[
"Syben",
"Christopher",
""
],
[
"Psychogios",
"Marios",
""
],
[
"Kowarschik",
"Markus",
... | High quality reconstruction with interventional C-arm cone-beam computed tomography (CBCT) requires exact geometry information. If the geometry information is corrupted, e. g., by unexpected patient or system movement, the measured signal is misplaced in the backprojection operation. With prolonged acquisition times of... |
2012.14349 | Filip Biljecki | Abraham Noah Wu, Filip Biljecki | Roofpedia: Automatic mapping of green and solar roofs for an open
roofscape registry and evaluation of urban sustainability | null | Landscape and Urban Planning 214: 104167, 2021 | 10.1016/j.landurbplan.2021.104167 | null | cs.CY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Sustainable roofs, such as those with greenery and photovoltaic panels,
contribute to the roadmap for reducing the carbon footprint of cities. However,
research on sustainable urban roofscapes is rather focused on their potential
and it is hindered by the scarcity of data, limiting our understanding of their
current ... | [
{
"created": "Tue, 22 Dec 2020 13:34:50 GMT",
"version": "v1"
},
{
"created": "Fri, 2 Apr 2021 23:59:10 GMT",
"version": "v2"
},
{
"created": "Fri, 14 May 2021 08:02:59 GMT",
"version": "v3"
},
{
"created": "Thu, 24 Jun 2021 12:20:27 GMT",
"version": "v4"
}
] | 2021-06-25 | [
[
"Wu",
"Abraham Noah",
""
],
[
"Biljecki",
"Filip",
""
]
] | Sustainable roofs, such as those with greenery and photovoltaic panels, contribute to the roadmap for reducing the carbon footprint of cities. However, research on sustainable urban roofscapes is rather focused on their potential and it is hindered by the scarcity of data, limiting our understanding of their current co... |
1602.05741 | Alexis Decurninge | Alexis Decurninge and Maxime Guillaud and Dirk Slock | Channel Covariance Estimation in Massive MIMO Frequency Division Duplex
Systems | 6 pages in Globecom, "From theory to practice" workshop, December
2015 | null | null | null | cs.IT math.IT stat.AP | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Channel covariance is emerging as a critical ingredient of the acquisition of
instantaneous channel state information (CSI) in multi-user Massive MIMO
systems operating in frequency division duplex (FDD) mode. In this context,
channel reciprocity does not hold, and it is generally expected that covariance
information... | [
{
"created": "Thu, 18 Feb 2016 10:15:14 GMT",
"version": "v1"
}
] | 2016-02-19 | [
[
"Decurninge",
"Alexis",
""
],
[
"Guillaud",
"Maxime",
""
],
[
"Slock",
"Dirk",
""
]
] | Channel covariance is emerging as a critical ingredient of the acquisition of instantaneous channel state information (CSI) in multi-user Massive MIMO systems operating in frequency division duplex (FDD) mode. In this context, channel reciprocity does not hold, and it is generally expected that covariance information a... |
1303.1418 | Merrick McCracken | Merrick McCracken, Maurizio Bocca, Neal Patwari | Joint Ultra-wideband and Signal Strength-based Through-building Tracking
for Tactical Operations | 9 pages, conference submission | null | null | null | cs.OH | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Accurate device free localization (DFL) based on received signal strength
(RSS) measurements requires placement of radio transceivers on all sides of the
target area. Accuracy degrades dramatically if sensors do not surround the
area. However, law enforcement officers sometimes face situations where it is
not possibl... | [
{
"created": "Wed, 6 Mar 2013 18:38:48 GMT",
"version": "v1"
}
] | 2013-03-07 | [
[
"McCracken",
"Merrick",
""
],
[
"Bocca",
"Maurizio",
""
],
[
"Patwari",
"Neal",
""
]
] | Accurate device free localization (DFL) based on received signal strength (RSS) measurements requires placement of radio transceivers on all sides of the target area. Accuracy degrades dramatically if sensors do not surround the area. However, law enforcement officers sometimes face situations where it is not possible ... |
2308.08934 | Limin Wang | Limin Wang, Masatoshi Hanai, Toyotaro Suzumura, Shun Takashige,
Kenjiro Taura | On Data Imbalance in Molecular Property Prediction with Pre-training | null | null | null | null | cs.LG cond-mat.mtrl-sci | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Revealing and analyzing the various properties of materials is an essential
and critical issue in the development of materials, including batteries,
semiconductors, catalysts, and pharmaceuticals. Traditionally, these properties
have been determined through theoretical calculations and simulations. However,
it is not... | [
{
"created": "Thu, 17 Aug 2023 12:04:14 GMT",
"version": "v1"
}
] | 2023-08-21 | [
[
"Wang",
"Limin",
""
],
[
"Hanai",
"Masatoshi",
""
],
[
"Suzumura",
"Toyotaro",
""
],
[
"Takashige",
"Shun",
""
],
[
"Taura",
"Kenjiro",
""
]
] | Revealing and analyzing the various properties of materials is an essential and critical issue in the development of materials, including batteries, semiconductors, catalysts, and pharmaceuticals. Traditionally, these properties have been determined through theoretical calculations and simulations. However, it is not p... |
2211.07844 | Michael Murray | Michael Murray, Hui Jin, Benjamin Bowman, Guido Montufar | Characterizing the Spectrum of the NTK via a Power Series Expansion | 55 pages, 3 Figures, 1 Table | null | null | null | cs.LG | http://creativecommons.org/licenses/by-sa/4.0/ | Under mild conditions on the network initialization we derive a power series
expansion for the Neural Tangent Kernel (NTK) of arbitrarily deep feedforward
networks in the infinite width limit. We provide expressions for the
coefficients of this power series which depend on both the Hermite coefficients
of the activat... | [
{
"created": "Tue, 15 Nov 2022 02:01:41 GMT",
"version": "v1"
},
{
"created": "Wed, 18 Jan 2023 23:47:25 GMT",
"version": "v2"
},
{
"created": "Tue, 21 Feb 2023 19:49:18 GMT",
"version": "v3"
},
{
"created": "Tue, 28 Feb 2023 19:27:25 GMT",
"version": "v4"
}
] | 2023-03-02 | [
[
"Murray",
"Michael",
""
],
[
"Jin",
"Hui",
""
],
[
"Bowman",
"Benjamin",
""
],
[
"Montufar",
"Guido",
""
]
] | Under mild conditions on the network initialization we derive a power series expansion for the Neural Tangent Kernel (NTK) of arbitrarily deep feedforward networks in the infinite width limit. We provide expressions for the coefficients of this power series which depend on both the Hermite coefficients of the activatio... |
2111.02529 | Theodore Heiser | Theodore James Thibault Heiser, Mari-Liis Allikivi, Meelis Kull | Shift Happens: Adjusting Classifiers | ECML PKDD 2019 conference paper, 16 pages | ECML PKDD 2019. Lecture Notes in Computer Science, vol 11907.
Springer, Cham (2020) | 10.1007/978-3-030-46147-8_4 | null | cs.LG | http://creativecommons.org/licenses/by/4.0/ | Minimizing expected loss measured by a proper scoring rule, such as Brier
score or log-loss (cross-entropy), is a common objective while training a
probabilistic classifier. If the data have experienced dataset shift where the
class distributions change post-training, then often the model's performance
will decrease,... | [
{
"created": "Wed, 3 Nov 2021 21:27:27 GMT",
"version": "v1"
}
] | 2021-11-05 | [
[
"Heiser",
"Theodore James Thibault",
""
],
[
"Allikivi",
"Mari-Liis",
""
],
[
"Kull",
"Meelis",
""
]
] | Minimizing expected loss measured by a proper scoring rule, such as Brier score or log-loss (cross-entropy), is a common objective while training a probabilistic classifier. If the data have experienced dataset shift where the class distributions change post-training, then often the model's performance will decrease, o... |
1510.02836 | Mauricio Toro | Mauricio Toro and Myriam Desainte-Catherine and Pascal Baltazar | A Model for Interactive Scores with Temporal Constraints and Conditional
Branching | 14 pages, extended version of conference paper on Journ\'ees de
INformatique Musicale 2010 | null | null | null | cs.LO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Interactive Scores (IS) are a formalism for the design and performance of
interactive multimedia scenarios. IS provide temporal relations (TR), but they
cannot represent conditional branching and TRs simultaneously. We propose an
extension to Allombert et al.'s IS model by including a condition on the TRs.
We found o... | [
{
"created": "Fri, 9 Oct 2015 22:08:08 GMT",
"version": "v1"
}
] | 2015-10-13 | [
[
"Toro",
"Mauricio",
""
],
[
"Desainte-Catherine",
"Myriam",
""
],
[
"Baltazar",
"Pascal",
""
]
] | Interactive Scores (IS) are a formalism for the design and performance of interactive multimedia scenarios. IS provide temporal relations (TR), but they cannot represent conditional branching and TRs simultaneously. We propose an extension to Allombert et al.'s IS model by including a condition on the TRs. We found out... |
1107.4684 | Bas van Vlijmen | J.A. Bergstra, G.P.A.J. Delen, S.F.M. van Vlijmen | Introducing Sourcements | null | null | null | null | cs.SE cs.GL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Sourcing processes are discussed at a high abstraction level. A dedicated
terminology is developed concerning general aspects of sourcing. The term
sourcement is coined to denote a building block for sourcing. No- tions of
allocation, functional architecture and allocational architecture, equilibrium,
and configurati... | [
{
"created": "Sat, 23 Jul 2011 12:12:12 GMT",
"version": "v1"
}
] | 2011-07-26 | [
[
"Bergstra",
"J. A.",
""
],
[
"Delen",
"G. P. A. J.",
""
],
[
"van Vlijmen",
"S. F. M.",
""
]
] | Sourcing processes are discussed at a high abstraction level. A dedicated terminology is developed concerning general aspects of sourcing. The term sourcement is coined to denote a building block for sourcing. No- tions of allocation, functional architecture and allocational architecture, equilibrium, and configuration... |
1801.00254 | Youngsam Kim | Youngsam Kim, Hyopil Shin | A New Approach for Measuring Sentiment Orientation based on
Multi-Dimensional Vector Space | 8 pages | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This study implements a vector space model approach to measure the sentiment
orientations of words. Two representative vectors for positive/negative
polarity are constructed using high-dimensional vec-tor space in both an
unsupervised and a semi-supervised manner. A sentiment ori-entation value per
word is determined... | [
{
"created": "Sun, 31 Dec 2017 08:44:51 GMT",
"version": "v1"
}
] | 2018-01-03 | [
[
"Kim",
"Youngsam",
""
],
[
"Shin",
"Hyopil",
""
]
] | This study implements a vector space model approach to measure the sentiment orientations of words. Two representative vectors for positive/negative polarity are constructed using high-dimensional vec-tor space in both an unsupervised and a semi-supervised manner. A sentiment ori-entation value per word is determined b... |
1705.03242 | Farbod Kayhan | Guido Montorsi and Farbod Kayhan | Low Complexity Two-Stage Soft/Hard Decoders | Submitted to IEEE Transaction on Communications, 18 pages, 7 figures | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Next generation wireless systems will need higher spectral efficiency as the
expected traffic volumes per unit bandwidth and dimension will inevitably grow.
As a consequence, it is necessary to design coding schemes with performances
close to the theoretical limits, having high flexibility and low complexity
requirem... | [
{
"created": "Tue, 9 May 2017 09:19:58 GMT",
"version": "v1"
}
] | 2017-05-10 | [
[
"Montorsi",
"Guido",
""
],
[
"Kayhan",
"Farbod",
""
]
] | Next generation wireless systems will need higher spectral efficiency as the expected traffic volumes per unit bandwidth and dimension will inevitably grow. As a consequence, it is necessary to design coding schemes with performances close to the theoretical limits, having high flexibility and low complexity requiremen... |
1911.07657 | Minjia Shi | Minjia Shi, Tor Helleseth and Patrick Sole | Two-weight codes over the integers modulo a prime power | null | null | null | null | cs.IT cs.CR math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Let $p$ be a prime number. Irreducible cyclic codes of length $p^2-1$ and
dimension $2$ over the integers modulo $p^h$ are shown to have exactly two
nonzero Hamming weights. The construction uses the Galois ring of
characteristic $p^h$ and order $p^{2h}.$ When the check polynomial is
primitive, the code meets the Gri... | [
{
"created": "Fri, 15 Nov 2019 02:01:54 GMT",
"version": "v1"
}
] | 2019-11-19 | [
[
"Shi",
"Minjia",
""
],
[
"Helleseth",
"Tor",
""
],
[
"Sole",
"Patrick",
""
]
] | Let $p$ be a prime number. Irreducible cyclic codes of length $p^2-1$ and dimension $2$ over the integers modulo $p^h$ are shown to have exactly two nonzero Hamming weights. The construction uses the Galois ring of characteristic $p^h$ and order $p^{2h}.$ When the check polynomial is primitive, the code meets the Gries... |
1511.01293 | Leonardo Parisi | Andrea Cavagna, Chiara Creato, Lorenzo Del Castello, Stefania Melillo,
Leonardo Parisi, Massimiliano Viale | Towards a tracking algorithm based on the clustering of spatio-temporal
clouds of points | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The interest in 3D dynamical tracking is growing in fields such as robotics,
biology and fluid dynamics. Recently, a major source of progress in 3D tracking
has been the study of collective behaviour in biological systems, where the
trajectories of individual animals moving within large and dense groups need to
be re... | [
{
"created": "Wed, 4 Nov 2015 11:20:51 GMT",
"version": "v1"
}
] | 2015-11-05 | [
[
"Cavagna",
"Andrea",
""
],
[
"Creato",
"Chiara",
""
],
[
"Del Castello",
"Lorenzo",
""
],
[
"Melillo",
"Stefania",
""
],
[
"Parisi",
"Leonardo",
""
],
[
"Viale",
"Massimiliano",
""
]
] | The interest in 3D dynamical tracking is growing in fields such as robotics, biology and fluid dynamics. Recently, a major source of progress in 3D tracking has been the study of collective behaviour in biological systems, where the trajectories of individual animals moving within large and dense groups need to be reco... |
2212.08658 | Frederic Guerrero-Sol\'e | Frederic Guerrero-Sole | IMAGINE: An Integrated Model of Artificial Intelligence-Mediated
Communication Effects | 29 pages | null | null | null | cs.AI cs.CY cs.HC | http://creativecommons.org/licenses/by/4.0/ | Artificial Intelligence (AI) is transforming all fields of knowledge and
production. From surgery, autonomous driving, to image and video creation, AI
seems to make possible hitherto unimaginable processes of automation and
efficient creation. Media and communication are not an exception, and we are
currently witness... | [
{
"created": "Tue, 13 Dec 2022 19:48:38 GMT",
"version": "v1"
}
] | 2022-12-20 | [
[
"Guerrero-Sole",
"Frederic",
""
]
] | Artificial Intelligence (AI) is transforming all fields of knowledge and production. From surgery, autonomous driving, to image and video creation, AI seems to make possible hitherto unimaginable processes of automation and efficient creation. Media and communication are not an exception, and we are currently witnessin... |
2308.16382 | Xiao Wang | Xiao Wang, Fang Dai, Wenyan Guo, Junfeng Wang | A stochastic block model for community detection in attributed networks | null | null | null | null | cs.SI stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Community detection is an important content in complex network analysis. The
existing community detection methods in attributed networks mostly focus on
only using network structure, while the methods of integrating node attributes
is mainly for the traditional community structures, and cannot detect
multipartite str... | [
{
"created": "Thu, 31 Aug 2023 01:00:24 GMT",
"version": "v1"
}
] | 2023-09-01 | [
[
"Wang",
"Xiao",
""
],
[
"Dai",
"Fang",
""
],
[
"Guo",
"Wenyan",
""
],
[
"Wang",
"Junfeng",
""
]
] | Community detection is an important content in complex network analysis. The existing community detection methods in attributed networks mostly focus on only using network structure, while the methods of integrating node attributes is mainly for the traditional community structures, and cannot detect multipartite struc... |
1803.05396 | Carla Groenland | Carla Groenland and Karolina Okrasa and Pawel Rz\k{a}\.zewski and Alex
Scott and Paul Seymour and Sophie Spirkl | $H$-colouring $P_t$-free graphs in subexponential time | Fixed some typo's | null | null | null | cs.DM math.CO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A graph is called $P_t$-free if it does not contain the path on $t$ vertices
as an induced subgraph. Let $H$ be a multigraph with the property that any two
distinct vertices share at most one common neighbour. We show that the
generating function for (list) graph homomorphisms from $G$ to $H$ can be
calculated in sub... | [
{
"created": "Wed, 14 Mar 2018 16:45:27 GMT",
"version": "v1"
},
{
"created": "Thu, 10 May 2018 07:18:57 GMT",
"version": "v2"
},
{
"created": "Fri, 22 Mar 2019 15:33:04 GMT",
"version": "v3"
}
] | 2019-03-25 | [
[
"Groenland",
"Carla",
""
],
[
"Okrasa",
"Karolina",
""
],
[
"Rzążewski",
"Pawel",
""
],
[
"Scott",
"Alex",
""
],
[
"Seymour",
"Paul",
""
],
[
"Spirkl",
"Sophie",
""
]
] | A graph is called $P_t$-free if it does not contain the path on $t$ vertices as an induced subgraph. Let $H$ be a multigraph with the property that any two distinct vertices share at most one common neighbour. We show that the generating function for (list) graph homomorphisms from $G$ to $H$ can be calculated in subex... |
2212.06146 | Audrey Der | Audrey Der, Chin-Chia Michael Yeh, Renjie Wu, Junpeng Wang, Yan Zheng,
Zhongfang Zhuang, Liang Wang, Wei Zhang, Eamonn Keogh | Matrix Profile XXVII: A Novel Distance Measure for Comparing Long Time
Series | Accepted at IEEE ICKG 2022. (Previously entitled IEEE ICBK.) Abridged
abstract as per arxiv's requirements | null | null | null | cs.LG cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The most useful data mining primitives are distance measures. With an
effective distance measure, it is possible to perform classification,
clustering, anomaly detection, segmentation, etc. For single-event time series
Euclidean Distance and Dynamic Time Warping distance are known to be extremely
effective. However, ... | [
{
"created": "Fri, 9 Dec 2022 23:02:23 GMT",
"version": "v1"
}
] | 2022-12-14 | [
[
"Der",
"Audrey",
""
],
[
"Yeh",
"Chin-Chia Michael",
""
],
[
"Wu",
"Renjie",
""
],
[
"Wang",
"Junpeng",
""
],
[
"Zheng",
"Yan",
""
],
[
"Zhuang",
"Zhongfang",
""
],
[
"Wang",
"Liang",
""
],
[
"Zhang... | The most useful data mining primitives are distance measures. With an effective distance measure, it is possible to perform classification, clustering, anomaly detection, segmentation, etc. For single-event time series Euclidean Distance and Dynamic Time Warping distance are known to be extremely effective. However, fo... |
2104.06127 | Maartje De Graaf | Sven Y. Neuteboom and Maartje M.A. de Graaf | Cobbler Stick With Your Reads: People's Perceptions of Gendered Robots
Performing Gender Stereotypical Tasks | in TRAITS Workshop Proceedings (arXiv:2103.12679) held in conjunction
with Companion of the 2021 ACM/IEEE International Conference on Human-Robot
Interaction, March 2021, Pages 709-711 | null | null | TRAITS/2021/01 | cs.RO cs.HC | http://creativecommons.org/licenses/by-nc-nd/4.0/ | Previous research found that robots should best be designed to fit their
given task, whilst others identified gender effects in people's evaluations of
robots. This study combines this knowledge to investigate stereotyping effects
of robot genderedness and assigned tasks in an online experiment (n = 89)
manipulating ... | [
{
"created": "Tue, 13 Apr 2021 12:00:17 GMT",
"version": "v1"
}
] | 2021-04-14 | [
[
"Neuteboom",
"Sven Y.",
""
],
[
"de Graaf",
"Maartje M. A.",
""
]
] | Previous research found that robots should best be designed to fit their given task, whilst others identified gender effects in people's evaluations of robots. This study combines this knowledge to investigate stereotyping effects of robot genderedness and assigned tasks in an online experiment (n = 89) manipulating ro... |
1309.7313 | Jiwei Li | Jiwei Li and Claire Cardie | Timeline Generation: Tracking individuals on Twitter | null | null | null | null | cs.SI cs.IR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we propose a unsupervised framework to reconstruct a person's
life history by creating a chronological list for {\it personal important
events} (PIE) of individuals based on the tweets they published. By analyzing
individual tweet collections, we find that what are suitable for inclusion in
the persona... | [
{
"created": "Fri, 27 Sep 2013 17:56:35 GMT",
"version": "v1"
},
{
"created": "Sun, 20 Oct 2013 00:16:14 GMT",
"version": "v2"
},
{
"created": "Fri, 7 Feb 2014 19:10:58 GMT",
"version": "v3"
}
] | 2014-02-10 | [
[
"Li",
"Jiwei",
""
],
[
"Cardie",
"Claire",
""
]
] | In this paper, we propose a unsupervised framework to reconstruct a person's life history by creating a chronological list for {\it personal important events} (PIE) of individuals based on the tweets they published. By analyzing individual tweet collections, we find that what are suitable for inclusion in the personal ... |
1101.4236 | Yashwanth Vijay Kothapalli | Yashwanth Kothapalli | Indexing Properties of Primitive Pythagorean Triples for Cryptography
Applications | 8 pages | null | null | null | cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper presents new properties of Primitive Pythagorean Triples (PPT)
that have relevance in applications where events of different probability need
to be generated and in cryptography.
| [
{
"created": "Fri, 21 Jan 2011 21:53:18 GMT",
"version": "v1"
}
] | 2011-01-25 | [
[
"Kothapalli",
"Yashwanth",
""
]
] | This paper presents new properties of Primitive Pythagorean Triples (PPT) that have relevance in applications where events of different probability need to be generated and in cryptography. |
2303.08562 | Weijian Huang | Weijian Huang, Hao Yang, Cheng Li, Mingtong Dai, Rui Yang, Shanshan
Wang | MGA: Medical generalist agent through text-guided knowledge
transformation | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Multi-modal representation methods have achieved advanced performance in
medical applications by extracting more robust features from multi-domain data.
However, existing methods usually need to train additional branches for
downstream tasks, which may increase the model complexities in clinical
applications as well ... | [
{
"created": "Wed, 15 Mar 2023 12:28:31 GMT",
"version": "v1"
}
] | 2023-03-16 | [
[
"Huang",
"Weijian",
""
],
[
"Yang",
"Hao",
""
],
[
"Li",
"Cheng",
""
],
[
"Dai",
"Mingtong",
""
],
[
"Yang",
"Rui",
""
],
[
"Wang",
"Shanshan",
""
]
] | Multi-modal representation methods have achieved advanced performance in medical applications by extracting more robust features from multi-domain data. However, existing methods usually need to train additional branches for downstream tasks, which may increase the model complexities in clinical applications as well as... |
2403.11451 | Haolan Chen | Haolan Chen, Jinhua Hao, Kai Zhao, Kun Yuan, Ming Sun, Chao Zhou and
Wei Hu | CasSR: Activating Image Power for Real-World Image Super-Resolution | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The objective of image super-resolution is to generate clean and
high-resolution images from degraded versions. Recent advancements in diffusion
modeling have led to the emergence of various image super-resolution techniques
that leverage pretrained text-to-image (T2I) models. Nevertheless, due to the
prevalent sever... | [
{
"created": "Mon, 18 Mar 2024 03:59:43 GMT",
"version": "v1"
}
] | 2024-03-19 | [
[
"Chen",
"Haolan",
""
],
[
"Hao",
"Jinhua",
""
],
[
"Zhao",
"Kai",
""
],
[
"Yuan",
"Kun",
""
],
[
"Sun",
"Ming",
""
],
[
"Zhou",
"Chao",
""
],
[
"Hu",
"Wei",
""
]
] | The objective of image super-resolution is to generate clean and high-resolution images from degraded versions. Recent advancements in diffusion modeling have led to the emergence of various image super-resolution techniques that leverage pretrained text-to-image (T2I) models. Nevertheless, due to the prevalent severe ... |
2204.14059 | Siyuan Liu | Yi Lin (1), Siyuan Liu (1), Lei Yan (1 and 2), Kai Yan (3), Yelu Zeng
(4) and Bin Yang (5) ((1) Institute of Remote Sensing and Geographic
Information System, School of Earth and Space Sciences, Peking University.
(2) Guangxi Key Laboratory of Remote Measuring System, Guiling University of
Aerospace Technology.... | Improving the estimation of directional area scattering factor (DASF)
from canopy reflectance: theoretical basis and validation | null | null | null | null | cs.CE eess.IV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Directional area scattering factor (DASF) is a critical canopy structural
parameter for vegetation monitoring. It provides an efficient tool for
decoupling of canopy structure and leaf optics from canopy reflectance. Current
standard approach to estimate DASF from canopy bidirectional reflectance factor
(BRF) is base... | [
{
"created": "Thu, 28 Apr 2022 02:54:24 GMT",
"version": "v1"
}
] | 2022-05-02 | [
[
"Lin",
"Yi",
"",
"1 and 2"
],
[
"Liu",
"Siyuan",
"",
"1 and 2"
],
[
"Yan",
"Lei",
"",
"1 and 2"
],
[
"Yan",
"Kai",
""
],
[
"Zeng",
"Yelu",
""
],
[
"Yang",
"Bin",
""
]
] | Directional area scattering factor (DASF) is a critical canopy structural parameter for vegetation monitoring. It provides an efficient tool for decoupling of canopy structure and leaf optics from canopy reflectance. Current standard approach to estimate DASF from canopy bidirectional reflectance factor (BRF) is based ... |
2007.04604 | Sao Mai Nguyen | Linda Nanan Vall\'ee (ESATIC), Christophe Lohr, Sao Mai Nguyen (IMT
Atlantique), Ioannis Kanellos (IMT Atlantique - INFO), O. Asseu (ESATIC) | Building an Automated Gesture Imitation Game for Teenagers with ASD | null | Far East Journal of Electronics and Communications, 2019, 22,
pp.19 - 28 | 10.17654/EC023010001 | null | cs.HC cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Autism spectrum disorder is a neurodevelopmental condition that includes
issues with communication and social interactions. People with ASD also often
have restricted interests and repetitive behaviors. In this paper we build
preliminary bricks of an automated gesture imitation game that will aim at
improving social ... | [
{
"created": "Thu, 9 Jul 2020 07:27:43 GMT",
"version": "v1"
}
] | 2020-07-10 | [
[
"Vallée",
"Linda Nanan",
"",
"ESATIC"
],
[
"Lohr",
"Christophe",
"",
"IMT\n Atlantique"
],
[
"Nguyen",
"Sao Mai",
"",
"IMT\n Atlantique"
],
[
"Kanellos",
"Ioannis",
"",
"IMT Atlantique - INFO"
],
[
"Asseu",
"O.",
"",
... | Autism spectrum disorder is a neurodevelopmental condition that includes issues with communication and social interactions. People with ASD also often have restricted interests and repetitive behaviors. In this paper we build preliminary bricks of an automated gesture imitation game that will aim at improving social in... |
1802.08150 | Diego Moussallem | Diego Moussallem, Thiago Castro Ferreira, Marcos Zampieri, Maria
Claudia Cavalcanti, Geraldo Xex\'eo, Mariana Neves, Axel-Cyrille Ngonga Ngomo | RDF2PT: Generating Brazilian Portuguese Texts from RDF Data | Accepted for publication in Language Resources and Evaluation
Conference (LREC) 2018 | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The generation of natural language from Resource Description Framework (RDF)
data has recently gained significant attention due to the continuous growth of
Linked Data. A number of these approaches generate natural language in
languages other than English, however, no work has been proposed to generate
Brazilian Port... | [
{
"created": "Thu, 22 Feb 2018 16:41:56 GMT",
"version": "v1"
}
] | 2018-02-23 | [
[
"Moussallem",
"Diego",
""
],
[
"Ferreira",
"Thiago Castro",
""
],
[
"Zampieri",
"Marcos",
""
],
[
"Cavalcanti",
"Maria Claudia",
""
],
[
"Xexéo",
"Geraldo",
""
],
[
"Neves",
"Mariana",
""
],
[
"Ngomo",
"Axel-Cy... | The generation of natural language from Resource Description Framework (RDF) data has recently gained significant attention due to the continuous growth of Linked Data. A number of these approaches generate natural language in languages other than English, however, no work has been proposed to generate Brazilian Portug... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.