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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1703.08651 | Xuanyi Dong | Xuanyi Dong, Junshi Huang, Yi Yang, Shuicheng Yan | More is Less: A More Complicated Network with Less Inference Complexity | This paper has been accepted by the IEEE CVPR 2017 | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we present a novel and general network structure towards
accelerating the inference process of convolutional neural networks, which is
more complicated in network structure yet with less inference complexity. The
core idea is to equip each original convolutional layer with another low-cost
collaborativ... | [
{
"created": "Sat, 25 Mar 2017 05:51:42 GMT",
"version": "v1"
},
{
"created": "Mon, 15 May 2017 07:56:20 GMT",
"version": "v2"
}
] | 2017-05-16 | [
[
"Dong",
"Xuanyi",
""
],
[
"Huang",
"Junshi",
""
],
[
"Yang",
"Yi",
""
],
[
"Yan",
"Shuicheng",
""
]
] | In this paper, we present a novel and general network structure towards accelerating the inference process of convolutional neural networks, which is more complicated in network structure yet with less inference complexity. The core idea is to equip each original convolutional layer with another low-cost collaborative ... |
1912.04734 | Angshul Majumdar Dr. | Jyoti Maggu, Angshul Majumdar and Emilie Chouzenoux | Transformed Subspace Clustering | null | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Subspace clustering assumes that the data is sepa-rable into separate
subspaces. Such a simple as-sumption, does not always hold. We assume that,
even if the raw data is not separable into subspac-es, one can learn a
representation (transform coef-ficients) such that the learnt representation is
sep-arable into subsp... | [
{
"created": "Tue, 10 Dec 2019 14:57:14 GMT",
"version": "v1"
}
] | 2019-12-11 | [
[
"Maggu",
"Jyoti",
""
],
[
"Majumdar",
"Angshul",
""
],
[
"Chouzenoux",
"Emilie",
""
]
] | Subspace clustering assumes that the data is sepa-rable into separate subspaces. Such a simple as-sumption, does not always hold. We assume that, even if the raw data is not separable into subspac-es, one can learn a representation (transform coef-ficients) such that the learnt representation is sep-arable into subspac... |
1611.01873 | Carlos Enrique Frasser Mr. | Carlos E. Frasser and George N. Vostrov | Geodetic Graphs Homeomorphic to a Given Geodetic Graph | 28 pages, 8 Figures | International Journal of Graph Theory and its Applications 3(1)
(2020) pp. 13-44 | null | https://www.mililink.com/upload/article/107744499ijgta_v3i1_13-44.pdf | cs.DM math.CO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper describes a new approach to the problem of generating the class of
all geodetic graphs homeomorphic to a given geodetic one. An algorithmic
procedure is elaborated to carry out a systematic finding of such a class of
graphs. As a result, the enumeration of the class of geodetic graphs
homeomorphic to certa... | [
{
"created": "Mon, 7 Nov 2016 02:02:23 GMT",
"version": "v1"
}
] | 2023-06-21 | [
[
"Frasser",
"Carlos E.",
""
],
[
"Vostrov",
"George N.",
""
]
] | This paper describes a new approach to the problem of generating the class of all geodetic graphs homeomorphic to a given geodetic one. An algorithmic procedure is elaborated to carry out a systematic finding of such a class of graphs. As a result, the enumeration of the class of geodetic graphs homeomorphic to certain... |
2405.07781 | Andreas Vogelsang | Adrian Bajraktari, Michelle Binder, Andreas Vogelsang | Requirements Engineering for Research Software: A Vision | Accepted at the 32nd IEEE International Requirements Engineering 2024
(RE) conference | null | null | null | cs.SE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Modern science is relying on software more than ever. The behavior and
outcomes of this software shape the scientific and public discourse on
important topics like climate change, economic growth, or the spread of
infections. Most researchers creating software for scientific purposes are not
trained in Software Engin... | [
{
"created": "Mon, 13 May 2024 14:25:01 GMT",
"version": "v1"
}
] | 2024-05-14 | [
[
"Bajraktari",
"Adrian",
""
],
[
"Binder",
"Michelle",
""
],
[
"Vogelsang",
"Andreas",
""
]
] | Modern science is relying on software more than ever. The behavior and outcomes of this software shape the scientific and public discourse on important topics like climate change, economic growth, or the spread of infections. Most researchers creating software for scientific purposes are not trained in Software Enginee... |
2110.01880 | Shailza Sharma | Shailza Sharma, Abhinav Dhall, and Vinay Kumar | Frequency Aware Face Hallucination Generative Adversarial Network with
Semantic Structural Constraint | 12 pages, 12 figures, submitted to IEEE Transactions on Computational
Imaging | null | null | null | cs.CV cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we address the issue of face hallucination. Most current face
hallucination methods rely on two-dimensional facial priors to generate high
resolution face images from low resolution face images. These methods are only
capable of assimilating global information into the generated image. Still
there exis... | [
{
"created": "Tue, 5 Oct 2021 08:51:29 GMT",
"version": "v1"
}
] | 2021-10-06 | [
[
"Sharma",
"Shailza",
""
],
[
"Dhall",
"Abhinav",
""
],
[
"Kumar",
"Vinay",
""
]
] | In this paper, we address the issue of face hallucination. Most current face hallucination methods rely on two-dimensional facial priors to generate high resolution face images from low resolution face images. These methods are only capable of assimilating global information into the generated image. Still there exist ... |
2405.10765 | Leon Tolksdorf | Leon Tolksdorf, Christian Birkner, Arturo Tejada, Nathan van de Wouw | Fast Collision Probability Estimation for Automated Driving using
Multi-circular Shape Approximations | Accepted for the 2024 Intelligent Vehicles Symposium, 8 pages | null | null | null | cs.RO math.PR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Many state-of-the-art methods for safety assessment and motion planning for
automated driving require estimation of the probability of collision (POC). To
estimate the POC, a shape approximation of the colliding actors and probability
density functions of the associated uncertain kinematic variables are required.
Eve... | [
{
"created": "Fri, 17 May 2024 13:27:14 GMT",
"version": "v1"
},
{
"created": "Wed, 22 May 2024 06:22:11 GMT",
"version": "v2"
}
] | 2024-05-24 | [
[
"Tolksdorf",
"Leon",
""
],
[
"Birkner",
"Christian",
""
],
[
"Tejada",
"Arturo",
""
],
[
"van de Wouw",
"Nathan",
""
]
] | Many state-of-the-art methods for safety assessment and motion planning for automated driving require estimation of the probability of collision (POC). To estimate the POC, a shape approximation of the colliding actors and probability density functions of the associated uncertain kinematic variables are required. Even ... |
2405.12252 | Canh Pham Van | Canh V. Pham | Enhanced Deterministic Approximation Algorithm for Non-monotone
Submodular Maximization under Knapsack Constraint with Linear Query
Complexity | null | null | null | null | cs.DS cs.AI | http://creativecommons.org/licenses/by/4.0/ | In this work, we consider the Submodular Maximization under Knapsack (SMK)
constraint problem over the ground set of size $n$. The problem recently
attracted a lot of attention due to its applications in various domains of
combination optimization, artificial intelligence, and machine learning. We
improve the approxi... | [
{
"created": "Mon, 20 May 2024 02:24:58 GMT",
"version": "v1"
}
] | 2024-05-22 | [
[
"Pham",
"Canh V.",
""
]
] | In this work, we consider the Submodular Maximization under Knapsack (SMK) constraint problem over the ground set of size $n$. The problem recently attracted a lot of attention due to its applications in various domains of combination optimization, artificial intelligence, and machine learning. We improve the approxima... |
2212.10276 | Shashank Srivastava | Graham Caron and Shashank Srivastava | Identifying and Manipulating the Personality Traits of Language Models | null | null | null | null | cs.AI | http://creativecommons.org/licenses/by/4.0/ | Psychology research has long explored aspects of human personality such as
extroversion, agreeableness and emotional stability. Categorizations like the
`Big Five' personality traits are commonly used to assess and diagnose
personality types. In this work, we explore the question of whether the
perceived personality ... | [
{
"created": "Tue, 20 Dec 2022 14:24:11 GMT",
"version": "v1"
}
] | 2022-12-21 | [
[
"Caron",
"Graham",
""
],
[
"Srivastava",
"Shashank",
""
]
] | Psychology research has long explored aspects of human personality such as extroversion, agreeableness and emotional stability. Categorizations like the `Big Five' personality traits are commonly used to assess and diagnose personality types. In this work, we explore the question of whether the perceived personality in... |
1911.06889 | Tristan Pollner | Andrei Graur, Tristan Pollner, Vidhya Ramaswamy, and S. Matthew
Weinberg | New Query Lower Bounds for Submodular Function MInimization | null | null | null | null | cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We consider submodular function minimization in the oracle model: given
black-box access to a submodular set function $f:2^{[n]}\rightarrow
\mathbb{R}$, find an element of $\arg\min_S \{f(S)\}$ using as few queries to
$f(\cdot)$ as possible. State-of-the-art algorithms succeed with
$\tilde{O}(n^2)$ queries [LeeSW15],... | [
{
"created": "Fri, 15 Nov 2019 21:45:14 GMT",
"version": "v1"
}
] | 2019-11-19 | [
[
"Graur",
"Andrei",
""
],
[
"Pollner",
"Tristan",
""
],
[
"Ramaswamy",
"Vidhya",
""
],
[
"Weinberg",
"S. Matthew",
""
]
] | We consider submodular function minimization in the oracle model: given black-box access to a submodular set function $f:2^{[n]}\rightarrow \mathbb{R}$, find an element of $\arg\min_S \{f(S)\}$ using as few queries to $f(\cdot)$ as possible. State-of-the-art algorithms succeed with $\tilde{O}(n^2)$ queries [LeeSW15], y... |
1907.09755 | Erik Daniel | Erik Daniel, Elias Rohrer and Florian Tschorsch | Map-Z: Exposing the Zcash Network in Times of Transition | 8 pages, 6 Figures, accepted at 2019 IEEE 44th Conference on Local
Computer Networks (LCN) for publication | null | null | null | cs.CR cs.NI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Zcash is a privacy-preserving cryptocurrency that provides anonymous monetary
transactions. While Zcash's anonymity is part of a rigorous scientific
discussion, information on the underlying peer-to-peer network are missing. In
this paper, we provide the first long-term measurement study of the Zcash
network to captu... | [
{
"created": "Tue, 23 Jul 2019 08:39:11 GMT",
"version": "v1"
},
{
"created": "Fri, 26 Jul 2019 13:58:18 GMT",
"version": "v2"
}
] | 2019-07-29 | [
[
"Daniel",
"Erik",
""
],
[
"Rohrer",
"Elias",
""
],
[
"Tschorsch",
"Florian",
""
]
] | Zcash is a privacy-preserving cryptocurrency that provides anonymous monetary transactions. While Zcash's anonymity is part of a rigorous scientific discussion, information on the underlying peer-to-peer network are missing. In this paper, we provide the first long-term measurement study of the Zcash network to capture... |
2211.05364 | Chao Hu | Chao Hu, Liqiang Zhu | Efficient Unsupervised Video Object Segmentation Network Based on Motion
Guidance | The 10th International Conference on Information Systems and
Computing Technology | 2022-The 10th International Conference on Information Systems and
Computing Technology | null | ID: ISCT-2022-0052 | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Due to the problem of performance constraints of unsupervised video object
detection, its large-scale application is limited. In response to this pain
point, we propose another excellent method to solve this problematic point. By
incorporating motion characterization in unsupervised video object detection,
detection ... | [
{
"created": "Thu, 10 Nov 2022 06:13:23 GMT",
"version": "v1"
},
{
"created": "Mon, 21 Nov 2022 04:36:07 GMT",
"version": "v2"
}
] | 2022-11-22 | [
[
"Hu",
"Chao",
""
],
[
"Zhu",
"Liqiang",
""
]
] | Due to the problem of performance constraints of unsupervised video object detection, its large-scale application is limited. In response to this pain point, we propose another excellent method to solve this problematic point. By incorporating motion characterization in unsupervised video object detection, detection ac... |
1904.00058 | Andrey Rivkin | Marco Montali, Andrey Rivkin | From DB-nets to Coloured Petri Nets with Priorities (Extended Version) | null | null | null | null | cs.LO cs.DB | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The recently introduced formalism of DB-nets has brought in a new conceptual
way of modelling complex dynamic systems that equally account for the process
and data dimensions, considering local data as well as persistent,
transactional data. DB-nets combine a coloured variant of Petri nets with name
creation and mana... | [
{
"created": "Fri, 29 Mar 2019 19:11:42 GMT",
"version": "v1"
}
] | 2019-04-02 | [
[
"Montali",
"Marco",
""
],
[
"Rivkin",
"Andrey",
""
]
] | The recently introduced formalism of DB-nets has brought in a new conceptual way of modelling complex dynamic systems that equally account for the process and data dimensions, considering local data as well as persistent, transactional data. DB-nets combine a coloured variant of Petri nets with name creation and manage... |
2010.04933 | Yue Zheng | Yue Zheng, Tianyi Yang, Wen Zhang and Dengji Zhao | Barter Exchange via Friends' Friends | null | null | null | null | cs.GT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Barter exchange studies the setting where each agent owns a good, and they
can exchange with each other if that gives them more preferred goods. This
exchange will give better outcomes if there are more participants. The
challenge here is how to get more participants and our goal is to incentivize
the existing partic... | [
{
"created": "Sat, 10 Oct 2020 07:53:18 GMT",
"version": "v1"
}
] | 2020-10-13 | [
[
"Zheng",
"Yue",
""
],
[
"Yang",
"Tianyi",
""
],
[
"Zhang",
"Wen",
""
],
[
"Zhao",
"Dengji",
""
]
] | Barter exchange studies the setting where each agent owns a good, and they can exchange with each other if that gives them more preferred goods. This exchange will give better outcomes if there are more participants. The challenge here is how to get more participants and our goal is to incentivize the existing particip... |
1010.4281 | Vijay Vazirani | Vijay V. Vazirani | Non-Separable, Quasiconcave Utilities are Easy -- in a Perfect Price
Discrimination Market Model | null | null | null | null | cs.GT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Recent results, establishing evidence of intractability for such restrictive
utility functions as additively separable, piecewise-linear and concave, under
both Fisher and Arrow-Debreu market models, have prompted the question of
whether we have failed to capture some essential elements of real markets,
which seem to... | [
{
"created": "Wed, 20 Oct 2010 19:13:15 GMT",
"version": "v1"
}
] | 2010-10-21 | [
[
"Vazirani",
"Vijay V.",
""
]
] | Recent results, establishing evidence of intractability for such restrictive utility functions as additively separable, piecewise-linear and concave, under both Fisher and Arrow-Debreu market models, have prompted the question of whether we have failed to capture some essential elements of real markets, which seem to d... |
2306.06051 | Alessandro Wollek | Alessandro Wollek, Sardi Hyska, Bastian Sabel, Michael Ingrisch,
Tobias Lasser | Higher Chest X-ray Resolution Improves Classification Performance | null | null | null | null | cs.CV | http://creativecommons.org/licenses/by/4.0/ | Deep learning models for image classification are often trained at a
resolution of 224 x 224 pixels for historical and efficiency reasons. However,
chest X-rays are acquired at a much higher resolution to display subtle
pathologies. This study investigates the effect of training resolution on chest
X-ray classificati... | [
{
"created": "Fri, 9 Jun 2023 17:21:52 GMT",
"version": "v1"
},
{
"created": "Thu, 3 Aug 2023 17:58:20 GMT",
"version": "v2"
}
] | 2023-08-04 | [
[
"Wollek",
"Alessandro",
""
],
[
"Hyska",
"Sardi",
""
],
[
"Sabel",
"Bastian",
""
],
[
"Ingrisch",
"Michael",
""
],
[
"Lasser",
"Tobias",
""
]
] | Deep learning models for image classification are often trained at a resolution of 224 x 224 pixels for historical and efficiency reasons. However, chest X-rays are acquired at a much higher resolution to display subtle pathologies. This study investigates the effect of training resolution on chest X-ray classification... |
2406.05505 | Georgina Cosma Professor | Mohit Kumar Singh, Georgina Cosma, Patrick Waterson, Jonathan Back,
Gyuchan Thomas Jun | I-SIRch: AI-Powered Concept Annotation Tool For Equitable Extraction And
Analysis Of Safety Insights From Maternity Investigations | null | null | null | null | cs.IR cs.AI | http://creativecommons.org/licenses/by-nc-nd/4.0/ | Maternity care is a complex system involving treatments and interactions
between patients, providers, and the care environment. To improve patient
safety and outcomes, understanding the human factors (e.g. individuals
decisions, local facilities) influencing healthcare delivery is crucial.
However, most current tools... | [
{
"created": "Sat, 8 Jun 2024 16:05:31 GMT",
"version": "v1"
}
] | 2024-06-11 | [
[
"Singh",
"Mohit Kumar",
""
],
[
"Cosma",
"Georgina",
""
],
[
"Waterson",
"Patrick",
""
],
[
"Back",
"Jonathan",
""
],
[
"Jun",
"Gyuchan Thomas",
""
]
] | Maternity care is a complex system involving treatments and interactions between patients, providers, and the care environment. To improve patient safety and outcomes, understanding the human factors (e.g. individuals decisions, local facilities) influencing healthcare delivery is crucial. However, most current tools f... |
2011.10653 | Abe Leite | Abe Leite and Sa\'ul A. Blanco | Effects of Human vs. Automatic Feedback on Students' Understanding of AI
Concepts and Programming Style | Published in SIGCSE '20: Proceedings of the 51st ACM Technical
Symposium on Computer Science Education | SIGCSE '20: Proceedings of the 51st ACM Technical Symposium on
Computer Science Education (Feb 2020) 44-50 | 10.1145/3328778.3366921 | null | cs.HC cs.CY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The use of automatic grading tools has become nearly ubiquitous in large
undergraduate programming courses, and recent work has focused on improving the
quality of automatically generated feedback. However, there is a relative lack
of data directly comparing student outcomes when receiving computer-generated
feedback... | [
{
"created": "Fri, 20 Nov 2020 21:40:32 GMT",
"version": "v1"
}
] | 2020-11-24 | [
[
"Leite",
"Abe",
""
],
[
"Blanco",
"Saúl A.",
""
]
] | The use of automatic grading tools has become nearly ubiquitous in large undergraduate programming courses, and recent work has focused on improving the quality of automatically generated feedback. However, there is a relative lack of data directly comparing student outcomes when receiving computer-generated feedback a... |
2203.15601 | Christian Sigg | Christian Sigg, Flavia Cavallaro, Tobias G\"unther and Martin R.
Oswald | Photographic Visualization of Weather Forecasts with Generative
Adversarial Networks | null | null | null | null | cs.CV cs.LG eess.IV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Outdoor webcam images are an information-dense yet accessible visualization
of past and present weather conditions, and are consulted by meteorologists and
the general public alike. Weather forecasts, however, are still communicated as
text, pictograms or charts. We therefore introduce a novel method that uses
photog... | [
{
"created": "Tue, 29 Mar 2022 14:10:29 GMT",
"version": "v1"
}
] | 2022-03-30 | [
[
"Sigg",
"Christian",
""
],
[
"Cavallaro",
"Flavia",
""
],
[
"Günther",
"Tobias",
""
],
[
"Oswald",
"Martin R.",
""
]
] | Outdoor webcam images are an information-dense yet accessible visualization of past and present weather conditions, and are consulted by meteorologists and the general public alike. Weather forecasts, however, are still communicated as text, pictograms or charts. We therefore introduce a novel method that uses photogra... |
1811.08271 | Zhitao Guan | Jing Li, Zhitao Guan, Xiaojiang Du, Zijian Zhang, Zhenyu Zhou | A Low-latency Secure Data Outsourcing Scheme for Cloud-WSN | arXiv admin note: text overlap with arXiv:1810.10746 | null | null | null | cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | With the support of cloud computing, large quantities of data collected from
various WSN applications can be managed efficiently. However, maintaining data
security and efficiency of data processing in cloud-WSN (C-WSN) are important
and challenging issues. In this paper, we present an efficient data outsourcing
sche... | [
{
"created": "Thu, 25 Oct 2018 07:49:13 GMT",
"version": "v1"
}
] | 2018-11-21 | [
[
"Li",
"Jing",
""
],
[
"Guan",
"Zhitao",
""
],
[
"Du",
"Xiaojiang",
""
],
[
"Zhang",
"Zijian",
""
],
[
"Zhou",
"Zhenyu",
""
]
] | With the support of cloud computing, large quantities of data collected from various WSN applications can be managed efficiently. However, maintaining data security and efficiency of data processing in cloud-WSN (C-WSN) are important and challenging issues. In this paper, we present an efficient data outsourcing scheme... |
2307.03347 | Qing Xu | Qing Xu, Min Wu, Xiaoli Li, Kezhi Mao, Zhenghua Chen | Distilling Universal and Joint Knowledge for Cross-Domain Model
Compression on Time Series Data | Accepted by IJCAI 2023 | null | null | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | For many real-world time series tasks, the computational complexity of
prevalent deep leaning models often hinders the deployment on resource-limited
environments (e.g., smartphones). Moreover, due to the inevitable domain shift
between model training (source) and deploying (target) stages, compressing
those deep mod... | [
{
"created": "Fri, 7 Jul 2023 01:48:02 GMT",
"version": "v1"
}
] | 2023-07-10 | [
[
"Xu",
"Qing",
""
],
[
"Wu",
"Min",
""
],
[
"Li",
"Xiaoli",
""
],
[
"Mao",
"Kezhi",
""
],
[
"Chen",
"Zhenghua",
""
]
] | For many real-world time series tasks, the computational complexity of prevalent deep leaning models often hinders the deployment on resource-limited environments (e.g., smartphones). Moreover, due to the inevitable domain shift between model training (source) and deploying (target) stages, compressing those deep model... |
cs/0006005 | Stephen Marsand | Stephen Marsland, Ulrich Nehmzow and Jonathan Shapiro | Novelty Detection for Robot Neotaxis | 7 pages, 5 figures. In Proceedings of the Second International
Conference on Neural Computation, 2000 | null | null | null | cs.RO cs.NE nlin.AO | null | The ability of a robot to detect and respond to changes in its environment is
potentially very useful, as it draws attention to new and potentially important
features. We describe an algorithm for learning to filter out previously
experienced stimuli to allow further concentration on novel features. The
algorithm use... | [
{
"created": "Fri, 2 Jun 2000 11:32:17 GMT",
"version": "v1"
}
] | 2007-05-23 | [
[
"Marsland",
"Stephen",
""
],
[
"Nehmzow",
"Ulrich",
""
],
[
"Shapiro",
"Jonathan",
""
]
] | The ability of a robot to detect and respond to changes in its environment is potentially very useful, as it draws attention to new and potentially important features. We describe an algorithm for learning to filter out previously experienced stimuli to allow further concentration on novel features. The algorithm uses ... |
2201.06170 | Phillip Benjamin Str\"obel | Phillip Benjamin Str\"obel, Simon Clematide, Martin Volk, Raphael
Schwitter, Tobias Hodel, David Schoch | Evaluation of HTR models without Ground Truth Material | Accepted at LREC 2022. Final version submitted to LREC 2022 | null | null | null | cs.CL | http://creativecommons.org/licenses/by/4.0/ | The evaluation of Handwritten Text Recognition (HTR) models during their
development is straightforward: because HTR is a supervised problem, the usual
data split into training, validation, and test data sets allows the evaluation
of models in terms of accuracy or error rates. However, the evaluation process
becomes ... | [
{
"created": "Mon, 17 Jan 2022 01:26:09 GMT",
"version": "v1"
},
{
"created": "Fri, 29 Apr 2022 09:59:29 GMT",
"version": "v2"
}
] | 2022-05-02 | [
[
"Ströbel",
"Phillip Benjamin",
""
],
[
"Clematide",
"Simon",
""
],
[
"Volk",
"Martin",
""
],
[
"Schwitter",
"Raphael",
""
],
[
"Hodel",
"Tobias",
""
],
[
"Schoch",
"David",
""
]
] | The evaluation of Handwritten Text Recognition (HTR) models during their development is straightforward: because HTR is a supervised problem, the usual data split into training, validation, and test data sets allows the evaluation of models in terms of accuracy or error rates. However, the evaluation process becomes tr... |
2312.01105 | Patrick Ruhkamp | Patrick Ruhkamp, Daoyi Gao, Nassir Navab, Benjamin Busam | S2P3: Self-Supervised Polarimetric Pose Prediction | Accepted at IJCV | null | null | null | cs.CV | http://creativecommons.org/licenses/by/4.0/ | This paper proposes the first self-supervised 6D object pose prediction from
multimodal RGB+polarimetric images. The novel training paradigm comprises 1) a
physical model to extract geometric information of polarized light, 2) a
teacher-student knowledge distillation scheme and 3) a self-supervised loss
formulation t... | [
{
"created": "Sat, 2 Dec 2023 10:46:40 GMT",
"version": "v1"
}
] | 2023-12-05 | [
[
"Ruhkamp",
"Patrick",
""
],
[
"Gao",
"Daoyi",
""
],
[
"Navab",
"Nassir",
""
],
[
"Busam",
"Benjamin",
""
]
] | This paper proposes the first self-supervised 6D object pose prediction from multimodal RGB+polarimetric images. The novel training paradigm comprises 1) a physical model to extract geometric information of polarized light, 2) a teacher-student knowledge distillation scheme and 3) a self-supervised loss formulation thr... |
2105.14427 | Tianhao Wang | Salil Vadhan, Tianhao Wang | Concurrent Composition of Differential Privacy | null | null | null | null | cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We initiate a study of the composition properties of interactive
differentially private mechanisms. An interactive differentially private
mechanism is an algorithm that allows an analyst to adaptively ask queries
about a sensitive dataset, with the property that an adversarial analyst's view
of the interaction is app... | [
{
"created": "Sun, 30 May 2021 04:35:50 GMT",
"version": "v1"
},
{
"created": "Wed, 15 Sep 2021 18:50:12 GMT",
"version": "v2"
}
] | 2021-09-17 | [
[
"Vadhan",
"Salil",
""
],
[
"Wang",
"Tianhao",
""
]
] | We initiate a study of the composition properties of interactive differentially private mechanisms. An interactive differentially private mechanism is an algorithm that allows an analyst to adaptively ask queries about a sensitive dataset, with the property that an adversarial analyst's view of the interaction is appro... |
2211.01542 | Shuhao Gu | Shuhao Gu, Bojie Hu, Yang Feng | Continual Learning of Neural Machine Translation within Low Forgetting
Risk Regions | EMNLP 2022 Main Conference Long Paper | null | null | null | cs.CL | http://creativecommons.org/licenses/by/4.0/ | This paper considers continual learning of large-scale pretrained neural
machine translation model without accessing the previous training data or
introducing model separation. We argue that the widely used
regularization-based methods, which perform multi-objective learning with an
auxiliary loss, suffer from the mi... | [
{
"created": "Thu, 3 Nov 2022 01:21:10 GMT",
"version": "v1"
},
{
"created": "Fri, 4 Nov 2022 02:10:02 GMT",
"version": "v2"
}
] | 2022-11-07 | [
[
"Gu",
"Shuhao",
""
],
[
"Hu",
"Bojie",
""
],
[
"Feng",
"Yang",
""
]
] | This paper considers continual learning of large-scale pretrained neural machine translation model without accessing the previous training data or introducing model separation. We argue that the widely used regularization-based methods, which perform multi-objective learning with an auxiliary loss, suffer from the mise... |
2406.18176 | Robert-Jan Bruintjes | Robert-Jan Bruintjes, Attila Lengyel, Marcos Baptista Rios, Osman
Semih Kayhan, Davide Zambrano, Nergis Tomen, Jan van Gemert | VIPriors 4: Visual Inductive Priors for Data-Efficient Deep Learning
Challenges | arXiv admin note: text overlap with arXiv:2305.19688 | null | null | null | cs.CV | http://creativecommons.org/licenses/by/4.0/ | The fourth edition of the "VIPriors: Visual Inductive Priors for
Data-Efficient Deep Learning" workshop features two data-impaired challenges.
These challenges address the problem of training deep learning models for
computer vision tasks with limited data. Participants are limited to training
models from scratch usi... | [
{
"created": "Wed, 26 Jun 2024 08:50:51 GMT",
"version": "v1"
},
{
"created": "Mon, 1 Jul 2024 07:59:13 GMT",
"version": "v2"
}
] | 2024-07-02 | [
[
"Bruintjes",
"Robert-Jan",
""
],
[
"Lengyel",
"Attila",
""
],
[
"Rios",
"Marcos Baptista",
""
],
[
"Kayhan",
"Osman Semih",
""
],
[
"Zambrano",
"Davide",
""
],
[
"Tomen",
"Nergis",
""
],
[
"van Gemert",
"Jan",
... | The fourth edition of the "VIPriors: Visual Inductive Priors for Data-Efficient Deep Learning" workshop features two data-impaired challenges. These challenges address the problem of training deep learning models for computer vision tasks with limited data. Participants are limited to training models from scratch using... |
2012.10151 | Wenjun Mei | Wenjun Mei, Ge Chen, Noah E. Friedkin, Florian D\"orfler | Structural Balance and Interpersonal Appraisals Dynamics: Beyond
All-to-All and Two-Faction Networks | null | null | null | null | cs.SI cs.DM cs.SY eess.SY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Structural balance theory describes stable configurations of topologies of
signed interpersonal appraisal networks. Existing models explaining the
convergence of appraisal networks to structural balance either diverge in
finite time, or could get stuck in jammed states, or converge to only complete
graphs. In this pa... | [
{
"created": "Fri, 18 Dec 2020 10:28:15 GMT",
"version": "v1"
},
{
"created": "Wed, 23 Dec 2020 14:54:47 GMT",
"version": "v2"
}
] | 2020-12-24 | [
[
"Mei",
"Wenjun",
""
],
[
"Chen",
"Ge",
""
],
[
"Friedkin",
"Noah E.",
""
],
[
"Dörfler",
"Florian",
""
]
] | Structural balance theory describes stable configurations of topologies of signed interpersonal appraisal networks. Existing models explaining the convergence of appraisal networks to structural balance either diverge in finite time, or could get stuck in jammed states, or converge to only complete graphs. In this pape... |
2101.03539 | Glauco Carneiro | Glauco de Figueiredo Carneiro, Rafael Antonio Lima Cardoso, Antonio
Pedro Dores, Jos\'e Euclimar Xavier Menezes | Perspectives and Challenges in the Analysis of Prison Systems Data: A
Systematic Mapping | Submitted to Dialogos Poss\'iveis Journal | 2021 | null | Dialogos Poss\'iveis v. 20, n. 1 (2021) | cs.CY | http://creativecommons.org/licenses/by/4.0/ | Context: Open public data enable different stakeholders to perform analysis
and uncover information from different perspectives. The identification and
analysis of data from prison systems is not a trivial task. It raises the need
for the research community to know how these data have been produced and used.
Goal: An... | [
{
"created": "Sun, 10 Jan 2021 13:03:40 GMT",
"version": "v1"
},
{
"created": "Thu, 25 Feb 2021 22:51:23 GMT",
"version": "v2"
},
{
"created": "Fri, 5 Nov 2021 01:12:14 GMT",
"version": "v3"
}
] | 2021-12-09 | [
[
"Carneiro",
"Glauco de Figueiredo",
""
],
[
"Cardoso",
"Rafael Antonio Lima",
""
],
[
"Dores",
"Antonio Pedro",
""
],
[
"Menezes",
"José Euclimar Xavier",
""
]
] | Context: Open public data enable different stakeholders to perform analysis and uncover information from different perspectives. The identification and analysis of data from prison systems is not a trivial task. It raises the need for the research community to know how these data have been produced and used. Goal: Anal... |
1507.02226 | Quentin Stout | Quentin F. Stout | L infinity Isotonic Regression for Linear, Multidimensional, and Tree
Orders | updated references, minor modifications | null | null | null | cs.DS stat.CO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Algorithms are given for determining $L_\infty$ isotonic regression of
weighted data. For a linear order, grid in multidimensional space, or tree, of
$n$ vertices, optimal algorithms are given, taking $\Theta(n)$ time. These
improve upon previous algorithms by a factor of $\Omega(\log n)$. For vertices
at arbitrary p... | [
{
"created": "Wed, 8 Jul 2015 17:16:28 GMT",
"version": "v1"
},
{
"created": "Thu, 22 Jun 2017 22:06:37 GMT",
"version": "v2"
}
] | 2017-06-26 | [
[
"Stout",
"Quentin F.",
""
]
] | Algorithms are given for determining $L_\infty$ isotonic regression of weighted data. For a linear order, grid in multidimensional space, or tree, of $n$ vertices, optimal algorithms are given, taking $\Theta(n)$ time. These improve upon previous algorithms by a factor of $\Omega(\log n)$. For vertices at arbitrary pos... |
2308.06663 | Md Abul Bashar | Md Abul Bashar, Richi Nayak | ALGAN: Time Series Anomaly Detection with Adjusted-LSTM GAN | null | null | null | null | cs.LG cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Anomaly detection in time series data, to identify points that deviate from
normal behaviour, is a common problem in various domains such as manufacturing,
medical imaging, and cybersecurity. Recently, Generative Adversarial Networks
(GANs) are shown to be effective in detecting anomalies in time series data.
The neu... | [
{
"created": "Sun, 13 Aug 2023 02:17:19 GMT",
"version": "v1"
},
{
"created": "Wed, 1 Nov 2023 02:00:10 GMT",
"version": "v2"
}
] | 2023-11-02 | [
[
"Bashar",
"Md Abul",
""
],
[
"Nayak",
"Richi",
""
]
] | Anomaly detection in time series data, to identify points that deviate from normal behaviour, is a common problem in various domains such as manufacturing, medical imaging, and cybersecurity. Recently, Generative Adversarial Networks (GANs) are shown to be effective in detecting anomalies in time series data. The neura... |
2401.03491 | Arshiya Khan | Sarah Alharbi, Arshiya Khan | Ensemble Defense System: A Hybrid IDS Approach for Effective Cyber
Threat Detection | null | 2023 33rd International Telecommunication Networks and
Applications Conference, Melbourne, Australia, 2023, pp. 267-270 | 10.1109/ITNAC59571.2023.10368510 | null | cs.CR | http://creativecommons.org/licenses/by/4.0/ | Sophisticated cyber attacks present significant challenges for organizations
in detecting and preventing such threats. To address this critical need for
advanced defense mechanisms, we propose an Ensemble Defense System (EDS). An
EDS is a cybersecurity framework aggregating multiple security tools designed
to monitor... | [
{
"created": "Sun, 7 Jan 2024 14:07:00 GMT",
"version": "v1"
}
] | 2024-01-09 | [
[
"Alharbi",
"Sarah",
""
],
[
"Khan",
"Arshiya",
""
]
] | Sophisticated cyber attacks present significant challenges for organizations in detecting and preventing such threats. To address this critical need for advanced defense mechanisms, we propose an Ensemble Defense System (EDS). An EDS is a cybersecurity framework aggregating multiple security tools designed to monitor a... |
2208.08382 | Sreeraj Ramachandran | Sreeraj Ramachandran and Ajita Rattani | Deep Generative Views to Mitigate Gender Classification Bias Across
Gender-Race Groups | 20 pages, 4 figures, 9 tables, ICPR workshop | null | null | null | cs.CV cs.AI cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Published studies have suggested the bias of automated face-based gender
classification algorithms across gender-race groups. Specifically, unequal
accuracy rates were obtained for women and dark-skinned people. To mitigate the
bias of gender classifiers, the vision community has developed several
strategies. However... | [
{
"created": "Wed, 17 Aug 2022 16:23:35 GMT",
"version": "v1"
}
] | 2022-08-18 | [
[
"Ramachandran",
"Sreeraj",
""
],
[
"Rattani",
"Ajita",
""
]
] | Published studies have suggested the bias of automated face-based gender classification algorithms across gender-race groups. Specifically, unequal accuracy rates were obtained for women and dark-skinned people. To mitigate the bias of gender classifiers, the vision community has developed several strategies. However, ... |
2203.00134 | Saba Ahmadi | Saba Ahmadi, Hedyeh Beyhaghi, Avrim Blum, Keziah Naggita | Setting Fair Incentives to Maximize Improvement | null | null | null | null | cs.GT cs.LG cs.MA | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We consider the problem of helping agents improve by setting short-term
goals. Given a set of target skill levels, we assume each agent will try to
improve from their initial skill level to the closest target level within reach
or do nothing if no target level is within reach. We consider two models: the
common impro... | [
{
"created": "Mon, 28 Feb 2022 23:09:40 GMT",
"version": "v1"
}
] | 2022-03-02 | [
[
"Ahmadi",
"Saba",
""
],
[
"Beyhaghi",
"Hedyeh",
""
],
[
"Blum",
"Avrim",
""
],
[
"Naggita",
"Keziah",
""
]
] | We consider the problem of helping agents improve by setting short-term goals. Given a set of target skill levels, we assume each agent will try to improve from their initial skill level to the closest target level within reach or do nothing if no target level is within reach. We consider two models: the common improve... |
cs/0505042 | Matthew Earl | Matthew Earl and Raffaello D'Andrea | Iterative MILP Methods for Vehicle Control Problems | 22 pages, 9 figures, submitted to IEEE Transactions on Robotics, for
associated web page see http://control.mae.cornell.edu/earl/milp2 | M. G. Earl and R. D'Andrea, "Iterative MILP Methods for Vehicle
Control Problems," IEEE Transactions on Robotics, Volume 21, Issue 6, pages
1158-1167, Dec. 2005. | null | null | cs.RO | null | Mixed integer linear programming (MILP) is a powerful tool for planning and
control problems because of its modeling capability and the availability of
good solvers. However, for large models, MILP methods suffer computationally.
In this paper, we present iterative MILP algorithms that address this issue. We
consider... | [
{
"created": "Mon, 16 May 2005 03:54:08 GMT",
"version": "v1"
}
] | 2007-05-23 | [
[
"Earl",
"Matthew",
""
],
[
"D'Andrea",
"Raffaello",
""
]
] | Mixed integer linear programming (MILP) is a powerful tool for planning and control problems because of its modeling capability and the availability of good solvers. However, for large models, MILP methods suffer computationally. In this paper, we present iterative MILP algorithms that address this issue. We consider t... |
1709.04073 | Chandrashekar Lakshminarayanan | Chandrashekar Lakshminarayanan and Csaba Szepesv\'ari | Linear Stochastic Approximation: Constant Step-Size and Iterate
Averaging | 16 pages, 2 figures, was submitted to NIPS 2017 | null | null | null | cs.LG cs.SY stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We consider $d$-dimensional linear stochastic approximation algorithms (LSAs)
with a constant step-size and the so called Polyak-Ruppert (PR) averaging of
iterates. LSAs are widely applied in machine learning and reinforcement
learning (RL), where the aim is to compute an appropriate $\theta_{*} \in
\mathbb{R}^d$ (th... | [
{
"created": "Tue, 12 Sep 2017 22:34:09 GMT",
"version": "v1"
}
] | 2017-09-14 | [
[
"Lakshminarayanan",
"Chandrashekar",
""
],
[
"Szepesvári",
"Csaba",
""
]
] | We consider $d$-dimensional linear stochastic approximation algorithms (LSAs) with a constant step-size and the so called Polyak-Ruppert (PR) averaging of iterates. LSAs are widely applied in machine learning and reinforcement learning (RL), where the aim is to compute an appropriate $\theta_{*} \in \mathbb{R}^d$ (that... |
2407.04549 | Jane Pan | Jane Pan, He He, Samuel R. Bowman, Shi Feng | Spontaneous Reward Hacking in Iterative Self-Refinement | null | null | null | null | cs.CL cs.AI | http://creativecommons.org/licenses/by/4.0/ | Language models are capable of iteratively improving their outputs based on
natural language feedback, thus enabling in-context optimization of user
preference. In place of human users, a second language model can be used as an
evaluator, providing feedback along with numerical ratings which the generator
attempts to... | [
{
"created": "Fri, 5 Jul 2024 14:34:50 GMT",
"version": "v1"
}
] | 2024-07-08 | [
[
"Pan",
"Jane",
""
],
[
"He",
"He",
""
],
[
"Bowman",
"Samuel R.",
""
],
[
"Feng",
"Shi",
""
]
] | Language models are capable of iteratively improving their outputs based on natural language feedback, thus enabling in-context optimization of user preference. In place of human users, a second language model can be used as an evaluator, providing feedback along with numerical ratings which the generator attempts to o... |
2007.10200 | Ahmed Arafa | Ahmed Arafa, Karim Banawan, Karim G. Seddik, H. Vincent Poor | Sample, Quantize and Encode: Timely Estimation Over Noisy Channels | Accepted for publication in the IEEE Transactions on Communications.
arXiv admin note: substantial text overlap with arXiv:2004.12982 | null | null | null | cs.IT cs.NI eess.SP math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The effects of quantization and coding on the estimation quality of
Gauss-Markov processes are considered, with a special attention to the
Ornstein-Uhlenbeck process. Samples are acquired from the process, quantized,
and then encoded for transmission using either infinite incremental redundancy
(IIR) or fixed redunda... | [
{
"created": "Thu, 16 Jul 2020 17:50:41 GMT",
"version": "v1"
},
{
"created": "Mon, 21 Jun 2021 20:56:34 GMT",
"version": "v2"
}
] | 2021-06-23 | [
[
"Arafa",
"Ahmed",
""
],
[
"Banawan",
"Karim",
""
],
[
"Seddik",
"Karim G.",
""
],
[
"Poor",
"H. Vincent",
""
]
] | The effects of quantization and coding on the estimation quality of Gauss-Markov processes are considered, with a special attention to the Ornstein-Uhlenbeck process. Samples are acquired from the process, quantized, and then encoded for transmission using either infinite incremental redundancy (IIR) or fixed redundanc... |
2305.06615 | Nikolay Mikhaylovskiy | Nikolay Mikhaylovskiy and Ilya Churilov | Autocorrelations Decay in Texts and Applicability Limits of Language
Models | Accepted to Dialog-2023 | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We show that the laws of autocorrelations decay in texts are closely related
to applicability limits of language models. Using distributional semantics we
empirically demonstrate that autocorrelations of words in texts decay according
to a power law. We show that distributional semantics provides coherent
autocorrela... | [
{
"created": "Thu, 11 May 2023 07:23:01 GMT",
"version": "v1"
}
] | 2023-05-12 | [
[
"Mikhaylovskiy",
"Nikolay",
""
],
[
"Churilov",
"Ilya",
""
]
] | We show that the laws of autocorrelations decay in texts are closely related to applicability limits of language models. Using distributional semantics we empirically demonstrate that autocorrelations of words in texts decay according to a power law. We show that distributional semantics provides coherent autocorrelati... |
2208.12327 | Xiaoyu Lin | Xiaoyu Lin, Baran Ozaydin, Vidit Vidit, Majed El Helou and Sabine
S\"usstrunk | DSR: Towards Drone Image Super-Resolution | Accepted at ECCVW 2022 | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Despite achieving remarkable progress in recent years, single-image
super-resolution methods are developed with several limitations. Specifically,
they are trained on fixed content domains with certain degradations (whether
synthetic or real). The priors they learn are prone to overfitting the training
configuration.... | [
{
"created": "Thu, 25 Aug 2022 19:58:54 GMT",
"version": "v1"
}
] | 2022-08-29 | [
[
"Lin",
"Xiaoyu",
""
],
[
"Ozaydin",
"Baran",
""
],
[
"Vidit",
"Vidit",
""
],
[
"Helou",
"Majed El",
""
],
[
"Süsstrunk",
"Sabine",
""
]
] | Despite achieving remarkable progress in recent years, single-image super-resolution methods are developed with several limitations. Specifically, they are trained on fixed content domains with certain degradations (whether synthetic or real). The priors they learn are prone to overfitting the training configuration. T... |
1703.09928 | Qiong Zeng | Qiong Zeng and Baoquan Chen and Yanir Kleiman and Daniel Cohen-Or and
Yangyan Li | Bundle Optimization for Multi-aspect Embedding | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Understanding semantic similarity among images is the core of a wide range of
computer vision applications. An important step towards this goal is to collect
and learn human perceptions. Interestingly, the semantic context of images is
often ambiguous as images can be perceived with emphasis on different aspects,
whi... | [
{
"created": "Wed, 29 Mar 2017 08:29:55 GMT",
"version": "v1"
},
{
"created": "Wed, 5 Apr 2017 06:59:19 GMT",
"version": "v2"
},
{
"created": "Sat, 16 Sep 2017 03:16:06 GMT",
"version": "v3"
}
] | 2017-09-19 | [
[
"Zeng",
"Qiong",
""
],
[
"Chen",
"Baoquan",
""
],
[
"Kleiman",
"Yanir",
""
],
[
"Cohen-Or",
"Daniel",
""
],
[
"Li",
"Yangyan",
""
]
] | Understanding semantic similarity among images is the core of a wide range of computer vision applications. An important step towards this goal is to collect and learn human perceptions. Interestingly, the semantic context of images is often ambiguous as images can be perceived with emphasis on different aspects, which... |
2404.05205 | Shubhabrata Mukherjee | Babak Poorebrahim Gilkalaye, Shubhabrata Mukherjee, Reza Derakhshani | A secure and private ensemble matcher using multi-vault obfuscated
templates | This paper has been accepted in IJCB 2024 Special Session, Generative
AI for Futuristic Biometrics | null | null | null | cs.CV | http://creativecommons.org/licenses/by/4.0/ | Generative AI has revolutionized modern machine learning by providing
unprecedented realism, diversity, and efficiency in data generation. This
technology holds immense potential for biometrics, including for securing
sensitive and personally identifiable information. Given the irrevocability of
biometric samples and... | [
{
"created": "Mon, 8 Apr 2024 05:18:39 GMT",
"version": "v1"
},
{
"created": "Mon, 12 Aug 2024 14:42:48 GMT",
"version": "v2"
}
] | 2024-08-13 | [
[
"Gilkalaye",
"Babak Poorebrahim",
""
],
[
"Mukherjee",
"Shubhabrata",
""
],
[
"Derakhshani",
"Reza",
""
]
] | Generative AI has revolutionized modern machine learning by providing unprecedented realism, diversity, and efficiency in data generation. This technology holds immense potential for biometrics, including for securing sensitive and personally identifiable information. Given the irrevocability of biometric samples and m... |
2305.15557 | Riccardo Bonalli | Riccardo Bonalli and Alessandro Rudi | Non-Parametric Learning of Stochastic Differential Equations with
Non-asymptotic Fast Rates of Convergence | null | null | null | null | cs.LG cs.SY eess.SY math.OC | http://creativecommons.org/licenses/by/4.0/ | We propose a novel non-parametric learning paradigm for the identification of
drift and diffusion coefficients of multi-dimensional non-linear stochastic
differential equations, which relies upon discrete-time observations of the
state. The key idea essentially consists of fitting a RKHS-based approximation
of the co... | [
{
"created": "Wed, 24 May 2023 20:43:47 GMT",
"version": "v1"
},
{
"created": "Tue, 23 Apr 2024 11:34:52 GMT",
"version": "v2"
}
] | 2024-04-24 | [
[
"Bonalli",
"Riccardo",
""
],
[
"Rudi",
"Alessandro",
""
]
] | We propose a novel non-parametric learning paradigm for the identification of drift and diffusion coefficients of multi-dimensional non-linear stochastic differential equations, which relies upon discrete-time observations of the state. The key idea essentially consists of fitting a RKHS-based approximation of the corr... |
2109.01156 | Linqing Liu | Linqing Liu, Patrick Lewis, Sebastian Riedel, Pontus Stenetorp | Challenges in Generalization in Open Domain Question Answering | NAACL 2022 Findings | null | null | null | cs.CL cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Recent work on Open Domain Question Answering has shown that there is a large
discrepancy in model performance between novel test questions and those that
largely overlap with training questions. However, it is unclear which aspects
of novel questions make them challenging. Drawing upon studies on systematic
generali... | [
{
"created": "Thu, 2 Sep 2021 18:04:10 GMT",
"version": "v1"
},
{
"created": "Wed, 15 Dec 2021 18:37:48 GMT",
"version": "v2"
},
{
"created": "Sun, 15 May 2022 10:30:54 GMT",
"version": "v3"
}
] | 2022-05-17 | [
[
"Liu",
"Linqing",
""
],
[
"Lewis",
"Patrick",
""
],
[
"Riedel",
"Sebastian",
""
],
[
"Stenetorp",
"Pontus",
""
]
] | Recent work on Open Domain Question Answering has shown that there is a large discrepancy in model performance between novel test questions and those that largely overlap with training questions. However, it is unclear which aspects of novel questions make them challenging. Drawing upon studies on systematic generaliza... |
1812.03267 | Zhe Wang | Zhe Wang, Lingjie Duan, and Rui Zhang | Adaptive Deployment for UAV-Aided Communication Networks | null | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Unmanned aerial vehicle (UAV) as an aerial base station is a promising
technology to rapidly provide wireless connectivity to ground users. Given
UAV's agility and mobility, a key question is how to adapt UAV deployment to
best cater to the instantaneous wireless traffic in a territory. In this paper,
we propose an a... | [
{
"created": "Sat, 8 Dec 2018 04:32:28 GMT",
"version": "v1"
}
] | 2018-12-11 | [
[
"Wang",
"Zhe",
""
],
[
"Duan",
"Lingjie",
""
],
[
"Zhang",
"Rui",
""
]
] | Unmanned aerial vehicle (UAV) as an aerial base station is a promising technology to rapidly provide wireless connectivity to ground users. Given UAV's agility and mobility, a key question is how to adapt UAV deployment to best cater to the instantaneous wireless traffic in a territory. In this paper, we propose an ada... |
2305.01498 | Miao Li | Miao Li, Eduard Hovy, Jey Han Lau | Summarizing Multiple Documents with Conversational Structure for
Meta-Review Generation | Long paper; Accepted to EMNLP 2023; Soundness: 3, 3, 4; Excitement:
3, 4, 4 | null | null | null | cs.CL cs.AI | http://creativecommons.org/licenses/by/4.0/ | We present PeerSum, a novel dataset for generating meta-reviews of scientific
papers. The meta-reviews can be interpreted as abstractive summaries of
reviews, multi-turn discussions and the paper abstract. These source documents
have rich inter-document relationships with an explicit hierarchical
conversational struc... | [
{
"created": "Tue, 2 May 2023 15:18:18 GMT",
"version": "v1"
},
{
"created": "Sat, 7 Oct 2023 22:57:34 GMT",
"version": "v2"
},
{
"created": "Tue, 10 Oct 2023 03:19:16 GMT",
"version": "v3"
},
{
"created": "Mon, 23 Oct 2023 06:18:09 GMT",
"version": "v4"
}
] | 2023-10-24 | [
[
"Li",
"Miao",
""
],
[
"Hovy",
"Eduard",
""
],
[
"Lau",
"Jey Han",
""
]
] | We present PeerSum, a novel dataset for generating meta-reviews of scientific papers. The meta-reviews can be interpreted as abstractive summaries of reviews, multi-turn discussions and the paper abstract. These source documents have rich inter-document relationships with an explicit hierarchical conversational structu... |
1801.02120 | Somayeh Kafaie | Somayeh Kafaie, Yuanzhu Peter Chen, Octavia A. Dobre, Mohamed Hossam
Ahmed | Network Coding Implementation Details: A Guidance Document | 5 pages, 5 figures, 22nd Annual Newfoundland Electrical and Computer
Engineering Conference (NECEC), 2013 | null | null | null | cs.NI cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In recent years, network coding has become one of the most interesting fields
and has attracted considerable attention from both industry and academia. The
idea of network coding is based on the concept of allowing intermediate nodes
to encode and combine incoming packets instead of only copy and forward them.
This a... | [
{
"created": "Sun, 7 Jan 2018 03:26:04 GMT",
"version": "v1"
}
] | 2018-01-09 | [
[
"Kafaie",
"Somayeh",
""
],
[
"Chen",
"Yuanzhu Peter",
""
],
[
"Dobre",
"Octavia A.",
""
],
[
"Ahmed",
"Mohamed Hossam",
""
]
] | In recent years, network coding has become one of the most interesting fields and has attracted considerable attention from both industry and academia. The idea of network coding is based on the concept of allowing intermediate nodes to encode and combine incoming packets instead of only copy and forward them. This app... |
2011.03779 | Paul Hriljac | Paul Hriljac | Constructing Cryptographic Multilinear Maps Using Affine Automorphisms | null | null | null | null | cs.CR math.AG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The point of this paper is to use affine automorphisms from algebraic
geometry to build cryptographic multivariate mappings. We will construct groups
G,H, both isomorphic to the cyclic group with a prime number of elements and
multilinear pairings from the k-fold product of G to H. The construction is
reminiscent of ... | [
{
"created": "Sat, 7 Nov 2020 14:22:06 GMT",
"version": "v1"
}
] | 2020-11-10 | [
[
"Hriljac",
"Paul",
""
]
] | The point of this paper is to use affine automorphisms from algebraic geometry to build cryptographic multivariate mappings. We will construct groups G,H, both isomorphic to the cyclic group with a prime number of elements and multilinear pairings from the k-fold product of G to H. The construction is reminiscent of te... |
2105.14526 | Nikhil Iyer | Nikhil Iyer, V Thejas, Nipun Kwatra, Ramachandran Ramjee, Muthian
Sivathanu | LRTuner: A Learning Rate Tuner for Deep Neural Networks | 17 pages | null | null | null | cs.LG | http://creativecommons.org/licenses/by/4.0/ | One very important hyperparameter for training deep neural networks is the
learning rate schedule of the optimizer. The choice of learning rate schedule
determines the computational cost of getting close to a minima, how close you
actually get to the minima, and most importantly the kind of local minima
(wide/narrow)... | [
{
"created": "Sun, 30 May 2021 13:06:26 GMT",
"version": "v1"
}
] | 2021-06-01 | [
[
"Iyer",
"Nikhil",
""
],
[
"Thejas",
"V",
""
],
[
"Kwatra",
"Nipun",
""
],
[
"Ramjee",
"Ramachandran",
""
],
[
"Sivathanu",
"Muthian",
""
]
] | One very important hyperparameter for training deep neural networks is the learning rate schedule of the optimizer. The choice of learning rate schedule determines the computational cost of getting close to a minima, how close you actually get to the minima, and most importantly the kind of local minima (wide/narrow) a... |
2403.10167 | Malte Luttermann | Malte Luttermann, Johann Machemer, Marcel Gehrke | Efficient Detection of Exchangeable Factors in Factor Graphs | Extended version of paper accepted to the Proceedings of the 37th
International FLAIRS Conference (FLAIRS-24) | null | null | null | cs.AI cs.DS | http://creativecommons.org/licenses/by-nc-sa/4.0/ | To allow for tractable probabilistic inference with respect to domain sizes,
lifted probabilistic inference exploits symmetries in probabilistic graphical
models. However, checking whether two factors encode equivalent semantics and
hence are exchangeable is computationally expensive. In this paper, we
efficiently so... | [
{
"created": "Fri, 15 Mar 2024 10:20:56 GMT",
"version": "v1"
},
{
"created": "Fri, 5 Apr 2024 16:02:40 GMT",
"version": "v2"
}
] | 2024-04-08 | [
[
"Luttermann",
"Malte",
""
],
[
"Machemer",
"Johann",
""
],
[
"Gehrke",
"Marcel",
""
]
] | To allow for tractable probabilistic inference with respect to domain sizes, lifted probabilistic inference exploits symmetries in probabilistic graphical models. However, checking whether two factors encode equivalent semantics and hence are exchangeable is computationally expensive. In this paper, we efficiently solv... |
2105.13396 | Zachary Neal | Zachary P. Neal, Rachel Domagalski, and Bruce Sagan | Comparing Alternatives to the Fixed Degree Sequence Model for Extracting
the Backbone of Bipartite Projections | null | Scientific reports, 11(1), 1-13 (2021) | 10.1038/s41598-021-03238-3 | null | cs.SI stat.AP | http://creativecommons.org/licenses/by-sa/4.0/ | Projections of bipartite or two-mode networks capture co-occurrences, and are
used in diverse fields (e.g., ecology, economics, bibliometrics, politics) to
represent unipartite networks. A key challenge in analyzing such networks is
determining whether an observed number of co-occurrences between two nodes is
signifi... | [
{
"created": "Thu, 27 May 2021 18:56:04 GMT",
"version": "v1"
},
{
"created": "Mon, 31 May 2021 12:24:53 GMT",
"version": "v2"
},
{
"created": "Fri, 18 Jun 2021 15:02:14 GMT",
"version": "v3"
},
{
"created": "Thu, 7 Oct 2021 17:55:14 GMT",
"version": "v4"
},
{
"cr... | 2022-02-22 | [
[
"Neal",
"Zachary P.",
""
],
[
"Domagalski",
"Rachel",
""
],
[
"Sagan",
"Bruce",
""
]
] | Projections of bipartite or two-mode networks capture co-occurrences, and are used in diverse fields (e.g., ecology, economics, bibliometrics, politics) to represent unipartite networks. A key challenge in analyzing such networks is determining whether an observed number of co-occurrences between two nodes is significa... |
1709.05510 | Sainyam Galhotra Mr | Sainyam Galhotra, Arya Mazumdar, Soumyabrata Pal, Barna Saha | The Geometric Block Model | A shorter version of this paper has appeared in 32nd AAAI Conference
on Artificial Intelligence. The AAAI proceedings version as well as the
previous version in arxiv contained some errors that have been corrected in
this version | null | null | null | cs.SI cs.DS stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | To capture the inherent geometric features of many community detection
problems, we propose to use a new random graph model of communities that we
call a Geometric Block Model. The geometric block model generalizes the random
geometric graphs in the same way that the well-studied stochastic block model
generalizes th... | [
{
"created": "Sat, 16 Sep 2017 13:38:03 GMT",
"version": "v1"
},
{
"created": "Wed, 24 Jan 2018 16:26:40 GMT",
"version": "v2"
}
] | 2018-01-25 | [
[
"Galhotra",
"Sainyam",
""
],
[
"Mazumdar",
"Arya",
""
],
[
"Pal",
"Soumyabrata",
""
],
[
"Saha",
"Barna",
""
]
] | To capture the inherent geometric features of many community detection problems, we propose to use a new random graph model of communities that we call a Geometric Block Model. The geometric block model generalizes the random geometric graphs in the same way that the well-studied stochastic block model generalizes the ... |
2103.16989 | Shu Xincheng | Jiawei Shen, Xincheng Shu, Hu Yang | Bidirectional group random walk based network embedding for asymmetric
proximity | 18 pages, 7 figures | null | null | null | cs.SI | http://creativecommons.org/licenses/by/4.0/ | Network embedding aims to represent a network into a low dimensional space
where the network structural information and inherent properties are maximumly
preserved. Random walk based network embedding methods such as DeepWalk and
node2vec have shown outstanding performance in the aspect of preserving the
network topo... | [
{
"created": "Wed, 31 Mar 2021 11:11:53 GMT",
"version": "v1"
}
] | 2021-04-01 | [
[
"Shen",
"Jiawei",
""
],
[
"Shu",
"Xincheng",
""
],
[
"Yang",
"Hu",
""
]
] | Network embedding aims to represent a network into a low dimensional space where the network structural information and inherent properties are maximumly preserved. Random walk based network embedding methods such as DeepWalk and node2vec have shown outstanding performance in the aspect of preserving the network topolo... |
2003.12296 | Lei Qi | Jian Zhang, Lei Qi, Yinghuan Shi, Yang Gao | Generalizable Model-agnostic Semantic Segmentation via Target-specific
Normalization | Accepted by Pattern Recognition (PR) | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Semantic segmentation in a supervised learning manner has achieved
significant progress in recent years. However, its performance usually drops
dramatically due to the data-distribution discrepancy between seen and unseen
domains when we directly deploy the trained model to segment the images of
unseen (or new coming... | [
{
"created": "Fri, 27 Mar 2020 09:25:19 GMT",
"version": "v1"
},
{
"created": "Tue, 31 Aug 2021 06:43:50 GMT",
"version": "v2"
}
] | 2021-09-01 | [
[
"Zhang",
"Jian",
""
],
[
"Qi",
"Lei",
""
],
[
"Shi",
"Yinghuan",
""
],
[
"Gao",
"Yang",
""
]
] | Semantic segmentation in a supervised learning manner has achieved significant progress in recent years. However, its performance usually drops dramatically due to the data-distribution discrepancy between seen and unseen domains when we directly deploy the trained model to segment the images of unseen (or new coming) ... |
2203.15121 | Mohannad Ismail | Mohannad Ismail, Andrew Quach, Christopher Jelesnianski, Yeongjin
Jang, Changwoo Min | Tightly Seal Your Sensitive Pointers with PACTight | Accepted for publication to USENIX Security 2022 | null | null | null | cs.CR | http://creativecommons.org/licenses/by/4.0/ | ARM is becoming more popular in desktops and data centers, opening a new
realm in terms of security attacks against ARM. ARM has released Pointer
Authentication, a new hardware security feature that is intended to ensure
pointer integrity with cryptographic primitives. In this paper, we utilize
Pointer Authentication... | [
{
"created": "Mon, 28 Mar 2022 21:55:51 GMT",
"version": "v1"
}
] | 2022-03-30 | [
[
"Ismail",
"Mohannad",
""
],
[
"Quach",
"Andrew",
""
],
[
"Jelesnianski",
"Christopher",
""
],
[
"Jang",
"Yeongjin",
""
],
[
"Min",
"Changwoo",
""
]
] | ARM is becoming more popular in desktops and data centers, opening a new realm in terms of security attacks against ARM. ARM has released Pointer Authentication, a new hardware security feature that is intended to ensure pointer integrity with cryptographic primitives. In this paper, we utilize Pointer Authentication (... |
2302.01706 | Zilong Zhao | Zilong Zhao, Han Wu, Aad Van Moorsel and Lydia Y. Chen | GTV: Generating Tabular Data via Vertical Federated Learning | null | null | null | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Generative Adversarial Networks (GANs) have achieved state-of-the-art results
in tabular data synthesis, under the presumption of direct accessible training
data. Vertical Federated Learning (VFL) is a paradigm which allows to
distributedly train machine learning model with clients possessing unique
features pertaini... | [
{
"created": "Fri, 3 Feb 2023 13:04:12 GMT",
"version": "v1"
}
] | 2023-02-06 | [
[
"Zhao",
"Zilong",
""
],
[
"Wu",
"Han",
""
],
[
"Van Moorsel",
"Aad",
""
],
[
"Chen",
"Lydia Y.",
""
]
] | Generative Adversarial Networks (GANs) have achieved state-of-the-art results in tabular data synthesis, under the presumption of direct accessible training data. Vertical Federated Learning (VFL) is a paradigm which allows to distributedly train machine learning model with clients possessing unique features pertaining... |
1007.0982 | An Liu Dr | An Liu and Youjian (Eugene) Liu and Haige Xiang and Wu Luo | MIMO B-MAC Interference Network Optimization under Rate Constraints by
Polite Water-filling and Duality | 30 pages, 8 figures, and 5 tables. Submitted to IEEE Transactions on
Signal Processing, Jun. 2010 | An Liu; Youjian Liu; Haige Xiang; Wu Luo, "MIMO B-MAC Interference
Network Optimization Under Rate Constraints by Polite Water-Filling and
Duality," IEEE Transactions on Signal Processing, vol.59, no.1, pp.263,276,
Jan. 2011 | 10.1109/TSP.2010.2088394 | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We take two new approaches to design efficient algorithms for transmitter
optimization under rate constraints, to guarantee the Quality of Service in
general MIMO interference networks, which is a combination of multiple
interfering broadcast channels (BC) and multiaccess channels (MAC) and is named
B-MAC Networks. T... | [
{
"created": "Tue, 6 Jul 2010 19:31:00 GMT",
"version": "v1"
}
] | 2013-11-26 | [
[
"Liu",
"An",
"",
"Eugene"
],
[
"Youjian",
"",
"",
"Eugene"
],
[
"Liu",
"",
""
],
[
"Xiang",
"Haige",
""
],
[
"Luo",
"Wu",
""
]
] | We take two new approaches to design efficient algorithms for transmitter optimization under rate constraints, to guarantee the Quality of Service in general MIMO interference networks, which is a combination of multiple interfering broadcast channels (BC) and multiaccess channels (MAC) and is named B-MAC Networks. Two... |
1210.1771 | A. Emre Cetin | A. Emre Cetin | In-place associative permutation sort | 25 pages. arXiv admin note: substantial text overlap with
arXiv:1209.0572, arXiv:1209.3668, arXiv:1209.1942, arXiv:1209.4714 | null | null | null | cs.DS | http://creativecommons.org/licenses/by-nc-sa/3.0/ | In-place associative integer sorting technique was developed, improved and
specialized for distinct integers. The technique is suitable for integer
sorting. Hence, given a list S of n integers S[0...n-1], the technique sorts
the integers in ascending or descending order. It replaces bucket sort,
distribution counting... | [
{
"created": "Fri, 5 Oct 2012 14:30:37 GMT",
"version": "v1"
}
] | 2012-10-08 | [
[
"Cetin",
"A. Emre",
""
]
] | In-place associative integer sorting technique was developed, improved and specialized for distinct integers. The technique is suitable for integer sorting. Hence, given a list S of n integers S[0...n-1], the technique sorts the integers in ascending or descending order. It replaces bucket sort, distribution counting s... |
2403.12965 | Xi Chen | Mengting Chen, Xi Chen, Zhonghua Zhai, Chen Ju, Xuewen Hong, Jinsong
Lan, Shuai Xiao | Wear-Any-Way: Manipulable Virtual Try-on via Sparse Correspondence
Alignment | Project Page: https://mengtingchen.github.io/wear-any-way-page/ | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper introduces a novel framework for virtual try-on, termed
Wear-Any-Way. Different from previous methods, Wear-Any-Way is a customizable
solution. Besides generating high-fidelity results, our method supports users
to precisely manipulate the wearing style. To achieve this goal, we first
construct a strong pi... | [
{
"created": "Tue, 19 Mar 2024 17:59:52 GMT",
"version": "v1"
}
] | 2024-03-20 | [
[
"Chen",
"Mengting",
""
],
[
"Chen",
"Xi",
""
],
[
"Zhai",
"Zhonghua",
""
],
[
"Ju",
"Chen",
""
],
[
"Hong",
"Xuewen",
""
],
[
"Lan",
"Jinsong",
""
],
[
"Xiao",
"Shuai",
""
]
] | This paper introduces a novel framework for virtual try-on, termed Wear-Any-Way. Different from previous methods, Wear-Any-Way is a customizable solution. Besides generating high-fidelity results, our method supports users to precisely manipulate the wearing style. To achieve this goal, we first construct a strong pipe... |
1701.08474 | Prasanna Kansakar | Arslan Munir, Prasanna Kansakar, Samee U. Khan | IFCIoT: Integrated Fog Cloud IoT Architectural Paradigm for Future
Internet of Things | 9 pages, 3 figures, accepted for publication in IEEE Consumer
Electronics Magazine, July 2017 issue | null | null | null | cs.DC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We propose a novel integrated fog cloud IoT (IFCIoT) architectural paradigm
that promises increased performance, energy efficiency, reduced latency,
quicker response time, scalability, and better localized accuracy for future
IoT applications. The fog nodes (e.g., edge servers, smart routers, base
stations) receive c... | [
{
"created": "Mon, 30 Jan 2017 03:50:54 GMT",
"version": "v1"
}
] | 2017-01-31 | [
[
"Munir",
"Arslan",
""
],
[
"Kansakar",
"Prasanna",
""
],
[
"Khan",
"Samee U.",
""
]
] | We propose a novel integrated fog cloud IoT (IFCIoT) architectural paradigm that promises increased performance, energy efficiency, reduced latency, quicker response time, scalability, and better localized accuracy for future IoT applications. The fog nodes (e.g., edge servers, smart routers, base stations) receive com... |
2202.08827 | Mislav Balunovic | Mislav Balunovi\'c, Dimitar I. Dimitrov, Nikola Jovanovi\'c, Martin
Vechev | LAMP: Extracting Text from Gradients with Language Model Priors | null | null | null | null | cs.LG cs.DC | http://creativecommons.org/licenses/by/4.0/ | Recent work shows that sensitive user data can be reconstructed from gradient
updates, breaking the key privacy promise of federated learning. While success
was demonstrated primarily on image data, these methods do not directly
transfer to other domains such as text. In this work, we propose LAMP, a novel
attack tai... | [
{
"created": "Thu, 17 Feb 2022 18:49:25 GMT",
"version": "v1"
},
{
"created": "Wed, 19 Oct 2022 16:00:23 GMT",
"version": "v2"
}
] | 2022-10-20 | [
[
"Balunović",
"Mislav",
""
],
[
"Dimitrov",
"Dimitar I.",
""
],
[
"Jovanović",
"Nikola",
""
],
[
"Vechev",
"Martin",
""
]
] | Recent work shows that sensitive user data can be reconstructed from gradient updates, breaking the key privacy promise of federated learning. While success was demonstrated primarily on image data, these methods do not directly transfer to other domains such as text. In this work, we propose LAMP, a novel attack tailo... |
2109.13070 | Zhengyuan Liu | Zhengyuan Liu, Nancy F. Chen | Controllable Neural Dialogue Summarization with Personal Named Entity
Planning | EMNLP 2021 Main Conference | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we propose a controllable neural generation framework that can
flexibly guide dialogue summarization with personal named entity planning. The
conditional sequences are modulated to decide what types of information or what
perspective to focus on when forming summaries to tackle the under-constrained
pr... | [
{
"created": "Mon, 27 Sep 2021 14:19:32 GMT",
"version": "v1"
}
] | 2021-09-28 | [
[
"Liu",
"Zhengyuan",
""
],
[
"Chen",
"Nancy F.",
""
]
] | In this paper, we propose a controllable neural generation framework that can flexibly guide dialogue summarization with personal named entity planning. The conditional sequences are modulated to decide what types of information or what perspective to focus on when forming summaries to tackle the under-constrained prob... |
1509.00584 | Norbert B\'atfai Ph.D. | Norbert B\'atfai | Turing's Imitation Game has been Improved | null | null | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Using the recently introduced universal computing model, called orchestrated
machine, that represents computations in a dissipative environment, we consider
a new kind of interpretation of Turing's Imitation Game. In addition we raise
the question whether the intelligence may show fractal properties. Then we
sketch a... | [
{
"created": "Wed, 2 Sep 2015 07:18:20 GMT",
"version": "v1"
}
] | 2015-09-03 | [
[
"Bátfai",
"Norbert",
""
]
] | Using the recently introduced universal computing model, called orchestrated machine, that represents computations in a dissipative environment, we consider a new kind of interpretation of Turing's Imitation Game. In addition we raise the question whether the intelligence may show fractal properties. Then we sketch a v... |
1404.6196 | Naohi Eguchi | Naohi Eguchi | Proving Termination of Unfolding Graph Rewriting for General Safe
Recursion | Technical report | null | null | null | cs.LO cs.CC math.LO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper we present a new termination proof and complexity analysis of
unfolding graph rewriting which is a specific kind of infinite graph rewriting
expressing the general form of safe recursion. We introduce a termination order
over sequences of terms together with an interpretation of term graphs into
sequenc... | [
{
"created": "Thu, 24 Apr 2014 17:44:57 GMT",
"version": "v1"
},
{
"created": "Wed, 30 Apr 2014 08:03:50 GMT",
"version": "v2"
},
{
"created": "Wed, 28 May 2014 20:35:58 GMT",
"version": "v3"
},
{
"created": "Fri, 20 Jun 2014 16:06:14 GMT",
"version": "v4"
}
] | 2014-06-23 | [
[
"Eguchi",
"Naohi",
""
]
] | In this paper we present a new termination proof and complexity analysis of unfolding graph rewriting which is a specific kind of infinite graph rewriting expressing the general form of safe recursion. We introduce a termination order over sequences of terms together with an interpretation of term graphs into sequences... |
1112.1045 | Xin Li | Xin Li | Non-Malleable Extractors, Two-Source Extractors and Privacy
Amplification | null | null | null | null | cs.CR cs.CC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Dodis and Wichs introduced the notion of a non-malleable extractor to study
the problem of privacy amplification with an active adversary. A non-malleable
extractor is a much stronger version of a strong extractor. Previously, there
are only two known constructions of non-malleable extractors. Both
constructions only... | [
{
"created": "Mon, 5 Dec 2011 20:07:10 GMT",
"version": "v1"
},
{
"created": "Mon, 9 Apr 2012 06:21:32 GMT",
"version": "v2"
}
] | 2015-03-19 | [
[
"Li",
"Xin",
""
]
] | Dodis and Wichs introduced the notion of a non-malleable extractor to study the problem of privacy amplification with an active adversary. A non-malleable extractor is a much stronger version of a strong extractor. Previously, there are only two known constructions of non-malleable extractors. Both constructions only w... |
1003.5517 | Lingjie Duan | Lingjie Duan, Jianwei Huang, and Biying Shou | Competition with Dynamic Spectrum Leasing | A shorter version appears in IEEE DySPAN 2010. This version has been
submitted to IEEE/ACM Transactions on Networking. | null | 10.1109/DYSPAN.2010.5457903 | null | cs.NI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper presents a comprehensive analytical study of two competitive
cognitive operators' spectrum leasing and pricing strategies, taking into
account operators' heterogeneity in leasing costs and users' heterogeneity in
transmission power and channel conditions. We model the interactions between
operators and use... | [
{
"created": "Mon, 29 Mar 2010 12:09:04 GMT",
"version": "v1"
}
] | 2016-11-17 | [
[
"Duan",
"Lingjie",
""
],
[
"Huang",
"Jianwei",
""
],
[
"Shou",
"Biying",
""
]
] | This paper presents a comprehensive analytical study of two competitive cognitive operators' spectrum leasing and pricing strategies, taking into account operators' heterogeneity in leasing costs and users' heterogeneity in transmission power and channel conditions. We model the interactions between operators and users... |
2009.05737 | Zuchao Li | Zuchao Li, Hai Zhao, Shexia He, Jiaxun Cai | Syntax Role for Neural Semantic Role Labeling | null | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Semantic role labeling (SRL) is dedicated to recognizing the semantic
predicate-argument structure of a sentence. Previous studies in terms of
traditional models have shown syntactic information can make remarkable
contributions to SRL performance; however, the necessity of syntactic
information was challenged by a f... | [
{
"created": "Sat, 12 Sep 2020 07:01:12 GMT",
"version": "v1"
}
] | 2020-09-15 | [
[
"Li",
"Zuchao",
""
],
[
"Zhao",
"Hai",
""
],
[
"He",
"Shexia",
""
],
[
"Cai",
"Jiaxun",
""
]
] | Semantic role labeling (SRL) is dedicated to recognizing the semantic predicate-argument structure of a sentence. Previous studies in terms of traditional models have shown syntactic information can make remarkable contributions to SRL performance; however, the necessity of syntactic information was challenged by a few... |
2202.07991 | Vikram Gupta | Vikram Gupta, Rini Sharon, Ramit Sawhney, Debdoot Mukherjee | ADIMA: Abuse Detection In Multilingual Audio | null | null | null | null | cs.SD cs.CL eess.AS | http://creativecommons.org/licenses/by/4.0/ | Abusive content detection in spoken text can be addressed by performing
Automatic Speech Recognition (ASR) and leveraging advancements in natural
language processing. However, ASR models introduce latency and often perform
sub-optimally for profane words as they are underrepresented in training
corpora and not spoken... | [
{
"created": "Wed, 16 Feb 2022 11:09:50 GMT",
"version": "v1"
}
] | 2022-02-17 | [
[
"Gupta",
"Vikram",
""
],
[
"Sharon",
"Rini",
""
],
[
"Sawhney",
"Ramit",
""
],
[
"Mukherjee",
"Debdoot",
""
]
] | Abusive content detection in spoken text can be addressed by performing Automatic Speech Recognition (ASR) and leveraging advancements in natural language processing. However, ASR models introduce latency and often perform sub-optimally for profane words as they are underrepresented in training corpora and not spoken c... |
1005.4552 | Josef Urban | Josef Urban, Jesse Alama, Piotr Rudnicki, and Herman Geuvers | A Wiki for Mizar: Motivation, Considerations, and Initial Prototype | To appear in The 9th International Conference on Mathematical
Knowledge Management: MKM 2010 | Intelligent Computer Mathematics 2010, LNCS 6167, pp. 455-469 | 10.1007/978-3-642-14128-7_38 | null | cs.DL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Formal mathematics has so far not taken full advantage of ideas from
collaborative tools such as wikis and distributed version control systems
(DVCS). We argue that the field could profit from such tools, serving both
newcomers and experts alike. We describe a preliminary system for such
collaborative development bas... | [
{
"created": "Tue, 25 May 2010 12:42:29 GMT",
"version": "v1"
}
] | 2011-07-27 | [
[
"Urban",
"Josef",
""
],
[
"Alama",
"Jesse",
""
],
[
"Rudnicki",
"Piotr",
""
],
[
"Geuvers",
"Herman",
""
]
] | Formal mathematics has so far not taken full advantage of ideas from collaborative tools such as wikis and distributed version control systems (DVCS). We argue that the field could profit from such tools, serving both newcomers and experts alike. We describe a preliminary system for such collaborative development based... |
2404.11358 | Jeongtaek Oh | Jeongtaek Oh, Jaeyoung Chung, Dongwoo Lee, Kyoung Mu Lee | DeblurGS: Gaussian Splatting for Camera Motion Blur | null | null | null | null | cs.CV | http://creativecommons.org/licenses/by-nc-nd/4.0/ | Although significant progress has been made in reconstructing sharp 3D scenes
from motion-blurred images, a transition to real-world applications remains
challenging. The primary obstacle stems from the severe blur which leads to
inaccuracies in the acquisition of initial camera poses through
Structure-from-Motion, a... | [
{
"created": "Wed, 17 Apr 2024 13:14:52 GMT",
"version": "v1"
},
{
"created": "Thu, 18 Apr 2024 03:18:36 GMT",
"version": "v2"
}
] | 2024-04-19 | [
[
"Oh",
"Jeongtaek",
""
],
[
"Chung",
"Jaeyoung",
""
],
[
"Lee",
"Dongwoo",
""
],
[
"Lee",
"Kyoung Mu",
""
]
] | Although significant progress has been made in reconstructing sharp 3D scenes from motion-blurred images, a transition to real-world applications remains challenging. The primary obstacle stems from the severe blur which leads to inaccuracies in the acquisition of initial camera poses through Structure-from-Motion, a c... |
2104.07663 | Cristina Maria Pacurar | Cristina Maria Pacurar, Ruxandra-Gabriela Albu, Victor-Dan Pacurar | Tourist route optimization in the context of Covid-19 pandemic | null | Sustainability. 2021; 13(10):5492 | 10.3390/su13105492 | null | cs.SI physics.soc-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The paper presents an innovative method for tourist route planning inside a
destination. The necessity of reorganizing the tourist routes within a
destination comes as an immediate response to the Covid-19 crisis. The
implementation of the method inside tourist destinations can be an important
advantage in transformi... | [
{
"created": "Thu, 15 Apr 2021 17:59:56 GMT",
"version": "v1"
},
{
"created": "Wed, 5 May 2021 18:44:57 GMT",
"version": "v2"
}
] | 2021-07-20 | [
[
"Pacurar",
"Cristina Maria",
""
],
[
"Albu",
"Ruxandra-Gabriela",
""
],
[
"Pacurar",
"Victor-Dan",
""
]
] | The paper presents an innovative method for tourist route planning inside a destination. The necessity of reorganizing the tourist routes within a destination comes as an immediate response to the Covid-19 crisis. The implementation of the method inside tourist destinations can be an important advantage in transforming... |
2301.10485 | Mrudula Balachander | Mrudula Balachander, Emmanuel Filiot, Jean-Fran\c{c}ois Raskin | LTL Reactive Synthesis with a Few Hints | null | null | null | null | cs.GT cs.FL cs.LO cs.SY eess.SY | http://creativecommons.org/publicdomain/zero/1.0/ | We study a variant of the problem of synthesizing Mealy machines that enforce
LTL specifications against all possible behaviours of the environment including
hostile ones. In the variant studied here, the user provides the high level LTL
specification {\phi} of the system to design, and a set E of examples of
executi... | [
{
"created": "Wed, 25 Jan 2023 09:45:06 GMT",
"version": "v1"
}
] | 2023-02-09 | [
[
"Balachander",
"Mrudula",
""
],
[
"Filiot",
"Emmanuel",
""
],
[
"Raskin",
"Jean-François",
""
]
] | We study a variant of the problem of synthesizing Mealy machines that enforce LTL specifications against all possible behaviours of the environment including hostile ones. In the variant studied here, the user provides the high level LTL specification {\phi} of the system to design, and a set E of examples of execution... |
2007.05164 | Natalie Collina | Natalie Collina and S. Matthew Weinberg | On the (in)-approximability of Bayesian Revenue Maximization for a
Combinatorial Buyer | null | null | null | null | cs.GT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We consider a revenue-maximizing single seller with $m$ items for sale to a
single buyer whose value $v(\cdot)$ for the items is drawn from a known
distribution $D$ of support $k$. A series of works by Cai et al. establishes
that when each $v(\cdot)$ in the support of $D$ is additive or unit-demand (or
$c$-demand), t... | [
{
"created": "Fri, 10 Jul 2020 04:58:29 GMT",
"version": "v1"
}
] | 2020-07-13 | [
[
"Collina",
"Natalie",
""
],
[
"Weinberg",
"S. Matthew",
""
]
] | We consider a revenue-maximizing single seller with $m$ items for sale to a single buyer whose value $v(\cdot)$ for the items is drawn from a known distribution $D$ of support $k$. A series of works by Cai et al. establishes that when each $v(\cdot)$ in the support of $D$ is additive or unit-demand (or $c$-demand), the... |
1209.5785 | Dmitry Truhachev | Dmitri Truhachev and Christian Schlegel | Coupling Data Transmission for Multiple-Access Communications | IEEE Transactions on Information Theory, under revision | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We consider a signaling format where the information to be communicated from
one or multiple transmitters to a receiver is modulated via a superposition of
independent data streams. Each data stream is formed by error-correction
encoding, constellation mapping, replication and permutation of symbols, and
application ... | [
{
"created": "Tue, 25 Sep 2012 22:25:59 GMT",
"version": "v1"
},
{
"created": "Wed, 5 Dec 2012 05:26:03 GMT",
"version": "v2"
},
{
"created": "Sat, 24 Jun 2017 20:47:20 GMT",
"version": "v3"
},
{
"created": "Fri, 15 Jun 2018 13:12:49 GMT",
"version": "v4"
}
] | 2018-06-18 | [
[
"Truhachev",
"Dmitri",
""
],
[
"Schlegel",
"Christian",
""
]
] | We consider a signaling format where the information to be communicated from one or multiple transmitters to a receiver is modulated via a superposition of independent data streams. Each data stream is formed by error-correction encoding, constellation mapping, replication and permutation of symbols, and application of... |
1609.07035 | Siddhartha Banerjee Siddhartha Banerjee | Siddhartha Banerjee, Prasenjit Mitra and Kazunari Sugiyama | Abstractive Meeting Summarization UsingDependency Graph Fusion | WWW '15 Companion Proceedings of the 24th International Conference on
World Wide Web, Pages 5-6. arXiv admin note: substantial text overlap with
arXiv:1609.07033 | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Automatic summarization techniques on meeting conversations developed so far
have been primarily extractive, resulting in poor summaries. To improve this,
we propose an approach to generate abstractive summaries by fusing important
content from several utterances. Any meeting is generally comprised of several
discuss... | [
{
"created": "Thu, 22 Sep 2016 15:53:04 GMT",
"version": "v1"
}
] | 2016-09-25 | [
[
"Banerjee",
"Siddhartha",
""
],
[
"Mitra",
"Prasenjit",
""
],
[
"Sugiyama",
"Kazunari",
""
]
] | Automatic summarization techniques on meeting conversations developed so far have been primarily extractive, resulting in poor summaries. To improve this, we propose an approach to generate abstractive summaries by fusing important content from several utterances. Any meeting is generally comprised of several discussio... |
1912.08124 | Luca Manneschi | Luca Manneschi, Andrew C. Lin, Eleni Vasilaki | SpaRCe: Improved Learning of Reservoir Computing Systems through Sparse
Representations | null | IEEE Transactions on Neural Networks and Learning Systems, 16
August 2021 | 10.1109/TNNLS.2021.3102378 | null | cs.NE cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | "Sparse" neural networks, in which relatively few neurons or connections are
active, are common in both machine learning and neuroscience. Whereas in
machine learning, "sparsity" is related to a penalty term that leads to some
connecting weights becoming small or zero, in biological brains, sparsity is
often created ... | [
{
"created": "Wed, 4 Dec 2019 15:05:26 GMT",
"version": "v1"
},
{
"created": "Mon, 20 Apr 2020 17:51:11 GMT",
"version": "v2"
},
{
"created": "Mon, 11 Jan 2021 16:25:07 GMT",
"version": "v3"
},
{
"created": "Sun, 18 Apr 2021 05:26:54 GMT",
"version": "v4"
}
] | 2021-08-19 | [
[
"Manneschi",
"Luca",
""
],
[
"Lin",
"Andrew C.",
""
],
[
"Vasilaki",
"Eleni",
""
]
] | "Sparse" neural networks, in which relatively few neurons or connections are active, are common in both machine learning and neuroscience. Whereas in machine learning, "sparsity" is related to a penalty term that leads to some connecting weights becoming small or zero, in biological brains, sparsity is often created wh... |
1804.03550 | Martin Garbade | Martin Garbade, Yueh-Tung Chen, Johann Sawatzky, Juergen Gall | Two Stream 3D Semantic Scene Completion | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Inferring the 3D geometry and the semantic meaning of surfaces, which are
occluded, is a very challenging task. Recently, a first end-to-end learning
approach has been proposed that completes a scene from a single depth image.
The approach voxelizes the scene and predicts for each voxel if it is occupied
and, if it i... | [
{
"created": "Tue, 10 Apr 2018 14:10:26 GMT",
"version": "v1"
},
{
"created": "Mon, 16 Jul 2018 16:37:53 GMT",
"version": "v2"
},
{
"created": "Wed, 10 Apr 2019 14:35:56 GMT",
"version": "v3"
},
{
"created": "Wed, 15 May 2019 14:36:17 GMT",
"version": "v4"
}
] | 2019-05-16 | [
[
"Garbade",
"Martin",
""
],
[
"Chen",
"Yueh-Tung",
""
],
[
"Sawatzky",
"Johann",
""
],
[
"Gall",
"Juergen",
""
]
] | Inferring the 3D geometry and the semantic meaning of surfaces, which are occluded, is a very challenging task. Recently, a first end-to-end learning approach has been proposed that completes a scene from a single depth image. The approach voxelizes the scene and predicts for each voxel if it is occupied and, if it is ... |
2102.08012 | Jason Liang | Jason Liang, Keith Kelly | Training Stacked Denoising Autoencoders for Representation Learning | null | null | null | null | cs.LG cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We implement stacked denoising autoencoders, a class of neural networks that
are capable of learning powerful representations of high dimensional data. We
describe stochastic gradient descent for unsupervised training of autoencoders,
as well as a novel genetic algorithm based approach that makes use of gradient
info... | [
{
"created": "Tue, 16 Feb 2021 08:18:22 GMT",
"version": "v1"
}
] | 2021-02-17 | [
[
"Liang",
"Jason",
""
],
[
"Kelly",
"Keith",
""
]
] | We implement stacked denoising autoencoders, a class of neural networks that are capable of learning powerful representations of high dimensional data. We describe stochastic gradient descent for unsupervised training of autoencoders, as well as a novel genetic algorithm based approach that makes use of gradient inform... |
2305.05348 | Jiacheng Yao | Jiacheng Yao, Jindan Xu, Wei Xu, Derrick Wing Kwan Ng, Chau Yuen,
Xiaohu You | Robust Beamforming Design for RIS-aided Cell-free Systems with CSI
Uncertainties and Capacity-limited Backhaul | Accepted by IEEE TCOM | null | null | null | cs.IT eess.SP math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we consider the robust beamforming design in a reconfigurable
intelligent surface (RIS)-aided cell-free (CF) system considering the channel
state information (CSI) uncertainties of both the direct channels and cascaded
channels at the transmitter with capacity-limited backhaul. We jointly optimize
the ... | [
{
"created": "Tue, 9 May 2023 11:20:08 GMT",
"version": "v1"
}
] | 2023-05-10 | [
[
"Yao",
"Jiacheng",
""
],
[
"Xu",
"Jindan",
""
],
[
"Xu",
"Wei",
""
],
[
"Ng",
"Derrick Wing Kwan",
""
],
[
"Yuen",
"Chau",
""
],
[
"You",
"Xiaohu",
""
]
] | In this paper, we consider the robust beamforming design in a reconfigurable intelligent surface (RIS)-aided cell-free (CF) system considering the channel state information (CSI) uncertainties of both the direct channels and cascaded channels at the transmitter with capacity-limited backhaul. We jointly optimize the pr... |
2402.10846 | Arash Mohammadi | Kawa Atapour, S. Jamal Seyedmohammadi, Jamshid Abouei, Arash
Mohammadi, Konstantinos N. Plataniotis | FedD2S: Personalized Data-Free Federated Knowledge Distillation | null | null | null | null | cs.LG cs.AI cs.DC eess.IV | http://creativecommons.org/licenses/by/4.0/ | This paper addresses the challenge of mitigating data heterogeneity among
clients within a Federated Learning (FL) framework. The model-drift issue,
arising from the noniid nature of client data, often results in suboptimal
personalization of a global model compared to locally trained models for each
client. To tackl... | [
{
"created": "Fri, 16 Feb 2024 17:36:51 GMT",
"version": "v1"
}
] | 2024-02-19 | [
[
"Atapour",
"Kawa",
""
],
[
"Seyedmohammadi",
"S. Jamal",
""
],
[
"Abouei",
"Jamshid",
""
],
[
"Mohammadi",
"Arash",
""
],
[
"Plataniotis",
"Konstantinos N.",
""
]
] | This paper addresses the challenge of mitigating data heterogeneity among clients within a Federated Learning (FL) framework. The model-drift issue, arising from the noniid nature of client data, often results in suboptimal personalization of a global model compared to locally trained models for each client. To tackle ... |
1906.11156 | Jiezhong Qiu | Jiezhong Qiu, Yuxiao Dong, Hao Ma, Jian Li, Chi Wang, Kuansan Wang,
and Jie Tang | NetSMF: Large-Scale Network Embedding as Sparse Matrix Factorization | 11 pages, in Proceedings of the Web Conference 2019 (WWW 19) | null | 10.1145/3308558.3313446 | null | cs.SI cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We study the problem of large-scale network embedding, which aims to learn
latent representations for network mining applications. Previous research shows
that 1) popular network embedding benchmarks, such as DeepWalk, are in essence
implicitly factorizing a matrix with a closed form, and 2)the explicit
factorization... | [
{
"created": "Wed, 26 Jun 2019 15:17:29 GMT",
"version": "v1"
}
] | 2019-06-27 | [
[
"Qiu",
"Jiezhong",
""
],
[
"Dong",
"Yuxiao",
""
],
[
"Ma",
"Hao",
""
],
[
"Li",
"Jian",
""
],
[
"Wang",
"Chi",
""
],
[
"Wang",
"Kuansan",
""
],
[
"Tang",
"Jie",
""
]
] | We study the problem of large-scale network embedding, which aims to learn latent representations for network mining applications. Previous research shows that 1) popular network embedding benchmarks, such as DeepWalk, are in essence implicitly factorizing a matrix with a closed form, and 2)the explicit factorization o... |
2308.14030 | Chen Shen | Chen Shen and Jun Zhang and Xinggong Liang and Zeyi Hao and Kehan Li
and Fan Wang and Zhenyuan Wang and Chunfeng Lian | Forensic Histopathological Recognition via a Context-Aware MIL Network
Powered by Self-Supervised Contrastive Learning | 11 pages, 2 figures | null | null | null | cs.CV cs.LG | http://creativecommons.org/licenses/by/4.0/ | Forensic pathology is critical in analyzing death manner and time from the
microscopic aspect to assist in the establishment of reliable factual bases for
criminal investigation. In practice, even the manual differentiation between
different postmortem organ tissues is challenging and relies on expertise,
considering... | [
{
"created": "Sun, 27 Aug 2023 07:47:38 GMT",
"version": "v1"
}
] | 2023-08-29 | [
[
"Shen",
"Chen",
""
],
[
"Zhang",
"Jun",
""
],
[
"Liang",
"Xinggong",
""
],
[
"Hao",
"Zeyi",
""
],
[
"Li",
"Kehan",
""
],
[
"Wang",
"Fan",
""
],
[
"Wang",
"Zhenyuan",
""
],
[
"Lian",
"Chunfeng",
... | Forensic pathology is critical in analyzing death manner and time from the microscopic aspect to assist in the establishment of reliable factual bases for criminal investigation. In practice, even the manual differentiation between different postmortem organ tissues is challenging and relies on expertise, considering t... |
2204.05727 | Hui Kong | Banghe Wu, Chengzhong Xu, Hui Kong | LiDAR Road-Atlas: An Efficient Map Representation for General 3D Urban
Environment | null | Field Robotics, 2023 | 10.55417/fr.2023014 | null | cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this work, we propose the LiDAR Road-Atlas, a compactable and efficient 3D
map representation, for autonomous robot or vehicle navigation in general urban
environment. The LiDAR Road-Atlas can be generated by an online mapping
framework based on incrementally merging local 2D occupancy grid maps (2D-OGM).
Specific... | [
{
"created": "Tue, 12 Apr 2022 11:46:09 GMT",
"version": "v1"
},
{
"created": "Mon, 13 Mar 2023 07:16:04 GMT",
"version": "v2"
}
] | 2023-05-18 | [
[
"Wu",
"Banghe",
""
],
[
"Xu",
"Chengzhong",
""
],
[
"Kong",
"Hui",
""
]
] | In this work, we propose the LiDAR Road-Atlas, a compactable and efficient 3D map representation, for autonomous robot or vehicle navigation in general urban environment. The LiDAR Road-Atlas can be generated by an online mapping framework based on incrementally merging local 2D occupancy grid maps (2D-OGM). Specifical... |
1511.02307 | Mehrdad Tahmasbi | Mehrdad Tahmasbi and Faramarz Fekri | On the Capacity Achieving Probability Measures for Molecular Receivers | 6 pages, 1 figure | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, diffusion-based molecular commu- nication with ligand receptor
receivers is studied. Information messages are assumed to be encoded via
variations of the con- centration of molecules. The randomness in the ligand
reception process induces uncertainty in the communication; limiting the rate
of informati... | [
{
"created": "Sat, 7 Nov 2015 05:56:57 GMT",
"version": "v1"
}
] | 2015-11-10 | [
[
"Tahmasbi",
"Mehrdad",
""
],
[
"Fekri",
"Faramarz",
""
]
] | In this paper, diffusion-based molecular commu- nication with ligand receptor receivers is studied. Information messages are assumed to be encoded via variations of the con- centration of molecules. The randomness in the ligand reception process induces uncertainty in the communication; limiting the rate of information... |
2206.08514 | Ganqu Cui | Ganqu Cui, Lifan Yuan, Bingxiang He, Yangyi Chen, Zhiyuan Liu, Maosong
Sun | A Unified Evaluation of Textual Backdoor Learning: Frameworks and
Benchmarks | NeurIPS 2022 Datasets & Benchmarks; Toolkits avaliable at
https://github.com/thunlp/OpenBackdoor | null | null | null | cs.LG cs.CL cs.CR | http://creativecommons.org/licenses/by-nc-sa/4.0/ | Textual backdoor attacks are a kind of practical threat to NLP systems. By
injecting a backdoor in the training phase, the adversary could control model
predictions via predefined triggers. As various attack and defense models have
been proposed, it is of great significance to perform rigorous evaluations.
However, w... | [
{
"created": "Fri, 17 Jun 2022 02:29:23 GMT",
"version": "v1"
},
{
"created": "Tue, 1 Nov 2022 15:26:31 GMT",
"version": "v2"
}
] | 2022-11-02 | [
[
"Cui",
"Ganqu",
""
],
[
"Yuan",
"Lifan",
""
],
[
"He",
"Bingxiang",
""
],
[
"Chen",
"Yangyi",
""
],
[
"Liu",
"Zhiyuan",
""
],
[
"Sun",
"Maosong",
""
]
] | Textual backdoor attacks are a kind of practical threat to NLP systems. By injecting a backdoor in the training phase, the adversary could control model predictions via predefined triggers. As various attack and defense models have been proposed, it is of great significance to perform rigorous evaluations. However, we ... |
2210.09805 | Amr Hendy | Amr Hendy, Mohamed Abdelghaffar, Mohamed Afify and Ahmed Y. Tawfik | Domain Specific Sub-network for Multi-Domain Neural Machine Translation | 6 pages, 1 figure, 5 tables, AACL-IJCNLP 2022 conference | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper presents Domain-Specific Sub-network (DoSS). It uses a set of
masks obtained through pruning to define a sub-network for each domain and
finetunes the sub-network parameters on domain data. This performs very closely
and drastically reduces the number of parameters compared to finetuning the
whole network ... | [
{
"created": "Tue, 18 Oct 2022 12:26:49 GMT",
"version": "v1"
}
] | 2022-10-19 | [
[
"Hendy",
"Amr",
""
],
[
"Abdelghaffar",
"Mohamed",
""
],
[
"Afify",
"Mohamed",
""
],
[
"Tawfik",
"Ahmed Y.",
""
]
] | This paper presents Domain-Specific Sub-network (DoSS). It uses a set of masks obtained through pruning to define a sub-network for each domain and finetunes the sub-network parameters on domain data. This performs very closely and drastically reduces the number of parameters compared to finetuning the whole network on... |
2205.00224 | Sue Sin Chong | Sue Sin Chong | Loss Function Entropy Regularization for Diverse Decision Boundaries | 7 pages | 2022 7th International Conference on Big Data Analytics (ICBDA) | 10.1109/ICBDA55095.2022.9760312 | null | cs.LG | http://creativecommons.org/licenses/by/4.0/ | Is it possible to train several classifiers to perform meaningful
crowd-sourcing to produce a better prediction label set without ground-truth
annotation? This paper will modify the contrastive learning objectives to
automatically train a self-complementing ensemble to produce a state-of-the-art
prediction on the CIF... | [
{
"created": "Sat, 30 Apr 2022 10:16:41 GMT",
"version": "v1"
},
{
"created": "Mon, 23 May 2022 07:18:28 GMT",
"version": "v2"
}
] | 2022-05-24 | [
[
"Chong",
"Sue Sin",
""
]
] | Is it possible to train several classifiers to perform meaningful crowd-sourcing to produce a better prediction label set without ground-truth annotation? This paper will modify the contrastive learning objectives to automatically train a self-complementing ensemble to produce a state-of-the-art prediction on the CIFAR... |
1403.6614 | Kin Tat Ho | Kin Tat Ho and Lok Ming Lui | QCMC: Quasi-conformal Parameterizations for Multiply-connected domains | 26 pages, 23 figures, submitted. arXiv admin note: text overlap with
arXiv:1402.6908, arXiv:1307.2679 by other authors | null | null | null | cs.CG cs.CV math.DG | http://creativecommons.org/licenses/by-nc-sa/3.0/ | This paper presents a method to compute the {\it quasi-conformal
parameterization} (QCMC) for a multiply-connected 2D domain or surface. QCMC
computes a quasi-conformal map from a multiply-connected domain $S$ onto a
punctured disk $D_S$ associated with a given Beltrami differential. The
Beltrami differential, which ... | [
{
"created": "Wed, 26 Mar 2014 10:21:03 GMT",
"version": "v1"
}
] | 2014-03-27 | [
[
"Ho",
"Kin Tat",
""
],
[
"Lui",
"Lok Ming",
""
]
] | This paper presents a method to compute the {\it quasi-conformal parameterization} (QCMC) for a multiply-connected 2D domain or surface. QCMC computes a quasi-conformal map from a multiply-connected domain $S$ onto a punctured disk $D_S$ associated with a given Beltrami differential. The Beltrami differential, which me... |
1810.09142 | Dmitry Shkatov | Mikhail Rybakov and Dmitry Shkatov | Complexity and Expressivity of Branching- and Alternating-Time Temporal
Logics with Finitely Many Variables | Prefinal version of the published paper | Bernd Fischer and Tarmo Uustalu (eds.) Theoretical Aspects of
Computing -- ICTAC 2018. Lecture Notes in Computer Science,Vol. 11187,
Springer 2018, pp. 396--414 | 10.1007/978-3-030-02508-3_21 | null | cs.LO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We show that Branching-time temporal logics CTL and CTL*, as well as
Alternating-time temporal logics ATL and ATL*, are as semantically expressive
in the language with a single propositional variable as they are in the full
language, i.e., with an unlimited supply of propositional variables. It follows
that satisfiab... | [
{
"created": "Mon, 22 Oct 2018 08:52:23 GMT",
"version": "v1"
},
{
"created": "Fri, 18 Jan 2019 20:08:42 GMT",
"version": "v2"
}
] | 2019-01-23 | [
[
"Rybakov",
"Mikhail",
""
],
[
"Shkatov",
"Dmitry",
""
]
] | We show that Branching-time temporal logics CTL and CTL*, as well as Alternating-time temporal logics ATL and ATL*, are as semantically expressive in the language with a single propositional variable as they are in the full language, i.e., with an unlimited supply of propositional variables. It follows that satisfiabil... |
1604.04827 | Hendrik Molter | Ren\'e van Bevern and Christian Komusiewicz and Hendrik Molter and
Rolf Niedermeier and Manuel Sorge and Toby Walsh | h-Index Manipulation by Undoing Merges | null | Quantitative Science Studies, 1(4): 1529-1552. 2020 | 10.1162/qss_a_00093 | null | cs.DL cs.DM cs.DS cs.SI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The h-index is an important bibliographic measure used to assess the
performance of researchers. Dutiful researchers merge different versions of
their articles in their Google Scholar profile even though this can decrease
their h-index. In this article, we study the manipulation of the h-index by
undoing such merges.... | [
{
"created": "Sun, 17 Apr 2016 04:11:30 GMT",
"version": "v1"
},
{
"created": "Sat, 9 Jul 2016 06:47:32 GMT",
"version": "v2"
},
{
"created": "Tue, 12 Nov 2019 11:28:18 GMT",
"version": "v3"
}
] | 2021-01-14 | [
[
"van Bevern",
"René",
""
],
[
"Komusiewicz",
"Christian",
""
],
[
"Molter",
"Hendrik",
""
],
[
"Niedermeier",
"Rolf",
""
],
[
"Sorge",
"Manuel",
""
],
[
"Walsh",
"Toby",
""
]
] | The h-index is an important bibliographic measure used to assess the performance of researchers. Dutiful researchers merge different versions of their articles in their Google Scholar profile even though this can decrease their h-index. In this article, we study the manipulation of the h-index by undoing such merges. I... |
2106.09170 | Heitor Murilo Gomes | Heitor Murilo Gomes, Maciej Grzenda, Rodrigo Mello, Jesse Read, Minh
Huong Le Nguyen, Albert Bifet | A Survey on Semi-Supervised Learning for Delayed Partially Labelled Data
Streams | null | null | null | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Unlabelled data appear in many domains and are particularly relevant to
streaming applications, where even though data is abundant, labelled data is
rare. To address the learning problems associated with such data, one can
ignore the unlabelled data and focus only on the labelled data (supervised
learning); use the l... | [
{
"created": "Wed, 16 Jun 2021 23:14:20 GMT",
"version": "v1"
}
] | 2021-06-18 | [
[
"Gomes",
"Heitor Murilo",
""
],
[
"Grzenda",
"Maciej",
""
],
[
"Mello",
"Rodrigo",
""
],
[
"Read",
"Jesse",
""
],
[
"Nguyen",
"Minh Huong Le",
""
],
[
"Bifet",
"Albert",
""
]
] | Unlabelled data appear in many domains and are particularly relevant to streaming applications, where even though data is abundant, labelled data is rare. To address the learning problems associated with such data, one can ignore the unlabelled data and focus only on the labelled data (supervised learning); use the lab... |
1802.10457 | Vincent Divol | Fr\'ed\'eric Chazal, Vincent Divol | The density of expected persistence diagrams and its kernel based
estimation | Extended version of a paper published in the proceedings of the
Symposium of Computational Geometry 2018 | null | null | null | cs.CG | http://creativecommons.org/licenses/by/4.0/ | Persistence diagrams play a fundamental role in Topological Data Analysis
where they are used as topological descriptors of filtrations built on top of
data. They consist in discrete multisets of points in the plane $\mathbb{R}^2$
that can equivalently be seen as discrete measures in $\mathbb{R}^2$. When the
data com... | [
{
"created": "Wed, 28 Feb 2018 14:58:19 GMT",
"version": "v1"
},
{
"created": "Fri, 22 Mar 2019 16:11:31 GMT",
"version": "v2"
}
] | 2019-03-25 | [
[
"Chazal",
"Frédéric",
""
],
[
"Divol",
"Vincent",
""
]
] | Persistence diagrams play a fundamental role in Topological Data Analysis where they are used as topological descriptors of filtrations built on top of data. They consist in discrete multisets of points in the plane $\mathbb{R}^2$ that can equivalently be seen as discrete measures in $\mathbb{R}^2$. When the data come ... |
1202.3773 | Haohai Yu | Haohai Yu, Robert A. van Engelen | Measuring the Hardness of Stochastic Sampling on Bayesian Networks with
Deterministic Causalities: the k-Test | null | null | null | UAI-P-2011-PG-786-795 | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Approximate Bayesian inference is NP-hard. Dagum and Luby defined the Local
Variance Bound (LVB) to measure the approximation hardness of Bayesian
inference on Bayesian networks, assuming the networks model strictly positive
joint probability distributions, i.e. zero probabilities are not permitted.
This paper introd... | [
{
"created": "Tue, 14 Feb 2012 16:41:17 GMT",
"version": "v1"
}
] | 2012-02-20 | [
[
"Yu",
"Haohai",
""
],
[
"van Engelen",
"Robert A.",
""
]
] | Approximate Bayesian inference is NP-hard. Dagum and Luby defined the Local Variance Bound (LVB) to measure the approximation hardness of Bayesian inference on Bayesian networks, assuming the networks model strictly positive joint probability distributions, i.e. zero probabilities are not permitted. This paper introduc... |
1012.5318 | Sergei Viznyuk | Sergei Viznyuk | Condensation into ground state in binary string models | 6 pages, 3 figures | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The ensemble of binary strings defined via strong-interaction model exhibits
enhanced condensation (collapse) into ground state below certain temperature.
The non-interaction model shows gradual accumulation into ground state as
temperature approaches zero
| [
{
"created": "Thu, 23 Dec 2010 23:35:10 GMT",
"version": "v1"
}
] | 2010-12-27 | [
[
"Viznyuk",
"Sergei",
""
]
] | The ensemble of binary strings defined via strong-interaction model exhibits enhanced condensation (collapse) into ground state below certain temperature. The non-interaction model shows gradual accumulation into ground state as temperature approaches zero |
2203.07961 | Hippolyte Verdier | Hippolyte Verdier, Fran\c{c}ois Laurent, Alhassan Cass\'e, Christian
Vestergaard, Jean-Baptiste Masson | Variational inference of fractional Brownian motion with linear
computational complexity | null | null | 10.1103/PhysRevE.106.055311 | null | cs.LG physics.bio-ph physics.data-an q-bio.QM | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We introduce a simulation-based, amortised Bayesian inference scheme to infer
the parameters of random walks. Our approach learns the posterior distribution
of the walks' parameters with a likelihood-free method. In the first step a
graph neural network is trained on simulated data to learn optimized
low-dimensional ... | [
{
"created": "Tue, 15 Mar 2022 14:43:16 GMT",
"version": "v1"
},
{
"created": "Mon, 21 Mar 2022 09:27:31 GMT",
"version": "v2"
},
{
"created": "Thu, 22 Sep 2022 16:40:02 GMT",
"version": "v3"
},
{
"created": "Fri, 23 Sep 2022 06:30:36 GMT",
"version": "v4"
}
] | 2022-12-07 | [
[
"Verdier",
"Hippolyte",
""
],
[
"Laurent",
"François",
""
],
[
"Cassé",
"Alhassan",
""
],
[
"Vestergaard",
"Christian",
""
],
[
"Masson",
"Jean-Baptiste",
""
]
] | We introduce a simulation-based, amortised Bayesian inference scheme to infer the parameters of random walks. Our approach learns the posterior distribution of the walks' parameters with a likelihood-free method. In the first step a graph neural network is trained on simulated data to learn optimized low-dimensional su... |
2109.05843 | Ritu Kapur | Ritu Kapur and Balwinder Sodhi | OSS effort estimation using software features similarity and developer
activity-based metrics | 45 pages, 10 figures, 11 tables, 3 algorithms, Accepted in ACM TOSEM | null | 10.1145/3485819 | null | cs.SE | http://creativecommons.org/licenses/by/4.0/ | Software development effort estimation (SDEE) generally involves leveraging
the information about the effort spent in developing similar software in the
past. Most organizations do not have access to sufficient and reliable forms of
such data from past projects. As such, the existing SDEE methods suffer from
low usag... | [
{
"created": "Mon, 13 Sep 2021 10:16:39 GMT",
"version": "v1"
}
] | 2021-09-14 | [
[
"Kapur",
"Ritu",
""
],
[
"Sodhi",
"Balwinder",
""
]
] | Software development effort estimation (SDEE) generally involves leveraging the information about the effort spent in developing similar software in the past. Most organizations do not have access to sufficient and reliable forms of such data from past projects. As such, the existing SDEE methods suffer from low usage ... |
2311.05237 | Shuhei Tarashima | Shuhei Tarashima, Muhammad Abdul Haq, Yushan Wang, Norio Tagawa | Widely Applicable Strong Baseline for Sports Ball Detection and Tracking | BMVC2023. Code & dataset : https://github.com/nttcom/WASB-SBDT | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this work, we present a novel Sports Ball Detection and Tracking (SBDT)
method that can be applied to various sports categories. Our approach is
composed of (1) high-resolution feature extraction, (2) position-aware model
training, and (3) inference considering temporal consistency, all of which are
put together a... | [
{
"created": "Thu, 9 Nov 2023 09:39:12 GMT",
"version": "v1"
},
{
"created": "Thu, 16 Nov 2023 17:46:58 GMT",
"version": "v2"
}
] | 2023-11-17 | [
[
"Tarashima",
"Shuhei",
""
],
[
"Haq",
"Muhammad Abdul",
""
],
[
"Wang",
"Yushan",
""
],
[
"Tagawa",
"Norio",
""
]
] | In this work, we present a novel Sports Ball Detection and Tracking (SBDT) method that can be applied to various sports categories. Our approach is composed of (1) high-resolution feature extraction, (2) position-aware model training, and (3) inference considering temporal consistency, all of which are put together as ... |
2207.07591 | Hasna Bouraoui | Hasna Bouraoui, Chadlia Jerad, Omar Romdhani, Jeronimo Castrillon | mAPN: Modeling, Analysis, and Exploration of Algorithmic and Parallelism
Adaptivity | 26 PAGES JOURNAL PAPER | null | null | null | cs.DC | http://creativecommons.org/licenses/by/4.0/ | Using parallel embedded systems these days is increasing. They are getting
more complex due to integrating multiple functionalities in one application or
running numerous ones concurrently. This concerns a wide range of applications,
including streaming applications, commonly used in embedded systems. These
applicati... | [
{
"created": "Fri, 15 Jul 2022 16:39:41 GMT",
"version": "v1"
}
] | 2022-07-18 | [
[
"Bouraoui",
"Hasna",
""
],
[
"Jerad",
"Chadlia",
""
],
[
"Romdhani",
"Omar",
""
],
[
"Castrillon",
"Jeronimo",
""
]
] | Using parallel embedded systems these days is increasing. They are getting more complex due to integrating multiple functionalities in one application or running numerous ones concurrently. This concerns a wide range of applications, including streaming applications, commonly used in embedded systems. These application... |
2207.14243 | Nikita Gabdullin | Nikita Gabdullin | Combining human parsing with analytical feature extraction and ranking
schemes for high-generalization person reidentification | 20 pages, 7 figures, 6 tables, 15 equations | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Person reidentification (re-ID) has been receiving increasing attention in
recent years due to its importance for both science and society. Machine
learning and particularly Deep Learning (DL) has become the main re-id tool
that allowed researches to achieve unprecedented accuracy levels on benchmark
datasets. Howeve... | [
{
"created": "Thu, 28 Jul 2022 17:22:48 GMT",
"version": "v1"
}
] | 2022-07-29 | [
[
"Gabdullin",
"Nikita",
""
]
] | Person reidentification (re-ID) has been receiving increasing attention in recent years due to its importance for both science and society. Machine learning and particularly Deep Learning (DL) has become the main re-id tool that allowed researches to achieve unprecedented accuracy levels on benchmark datasets. However,... |
cs/0611075 | Ying Jun Zhang Ph.D. | Soung Chang Liew and Ying Jun Zhang | Proportional Fairness in Multi-channel Multi-rate Wireless Networks-Part
I: The Case of Deterministic Channels | null | null | null | null | cs.NI cs.IT cs.PF math.IT | null | This is Part I of a two-part paper series that studies the use of the
proportional fairness (PF) utility function as the basis for capacity
allocation and scheduling in multi-channel multi-rate wireless networks. The
contributions of Part I are threefold. (i) First, we lay down the theoretical
foundation for PF. Spec... | [
{
"created": "Thu, 16 Nov 2006 03:08:36 GMT",
"version": "v1"
},
{
"created": "Fri, 22 Feb 2008 14:27:39 GMT",
"version": "v2"
}
] | 2008-02-22 | [
[
"Liew",
"Soung Chang",
""
],
[
"Zhang",
"Ying Jun",
""
]
] | This is Part I of a two-part paper series that studies the use of the proportional fairness (PF) utility function as the basis for capacity allocation and scheduling in multi-channel multi-rate wireless networks. The contributions of Part I are threefold. (i) First, we lay down the theoretical foundation for PF. Specif... |
2306.16632 | Ha Thanh Nguyen | Ha-Thanh Nguyen, Francesca Toni, Kostas Stathis, Ken Satoh | Beyond Logic Programming for Legal Reasoning | Workshop on Logic Programming and Legal Reasoning, @ICLP 2023 | null | null | null | cs.LO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Logic programming has long being advocated for legal reasoning, and several
approaches have been put forward relying upon explicit representation of the
law in logic programming terms. In this position paper we focus on the PROLEG
logic-programming-based framework for formalizing and reasoning with Japanese
presuppos... | [
{
"created": "Thu, 29 Jun 2023 02:12:18 GMT",
"version": "v1"
}
] | 2023-06-30 | [
[
"Nguyen",
"Ha-Thanh",
""
],
[
"Toni",
"Francesca",
""
],
[
"Stathis",
"Kostas",
""
],
[
"Satoh",
"Ken",
""
]
] | Logic programming has long being advocated for legal reasoning, and several approaches have been put forward relying upon explicit representation of the law in logic programming terms. In this position paper we focus on the PROLEG logic-programming-based framework for formalizing and reasoning with Japanese presupposed... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.