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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
2006.04183 | Murat Sensoy | Murat Sensoy, Lance Kaplan, Federico Cerutti, Maryam Saleki | Uncertainty-Aware Deep Classifiers using Generative Models | This is a post-referred version of a conference paper published in
AAAI 2020 | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Deep neural networks are often ignorant about what they do not know and
overconfident when they make uninformed predictions. Some recent approaches
quantify classification uncertainty directly by training the model to output
high uncertainty for the data samples close to class boundaries or from the
outside of the tr... | [
{
"created": "Sun, 7 Jun 2020 15:38:35 GMT",
"version": "v1"
}
] | 2020-06-09 | [
[
"Sensoy",
"Murat",
""
],
[
"Kaplan",
"Lance",
""
],
[
"Cerutti",
"Federico",
""
],
[
"Saleki",
"Maryam",
""
]
] | Deep neural networks are often ignorant about what they do not know and overconfident when they make uninformed predictions. Some recent approaches quantify classification uncertainty directly by training the model to output high uncertainty for the data samples close to class boundaries or from the outside of the trai... |
2212.05611 | Mustafa Taha Ko\c{c}yi\u{g}it | Mustafa Taha Ko\c{c}yi\u{g}it, Timothy M. Hospedales, Hakan Bilen | Accelerating Self-Supervised Learning via Efficient Training Strategies | null | null | null | null | cs.CV | http://creativecommons.org/licenses/by/4.0/ | Recently the focus of the computer vision community has shifted from
expensive supervised learning towards self-supervised learning of visual
representations. While the performance gap between supervised and
self-supervised has been narrowing, the time for training self-supervised deep
networks remains an order of ma... | [
{
"created": "Sun, 11 Dec 2022 21:49:39 GMT",
"version": "v1"
}
] | 2022-12-13 | [
[
"Koçyiğit",
"Mustafa Taha",
""
],
[
"Hospedales",
"Timothy M.",
""
],
[
"Bilen",
"Hakan",
""
]
] | Recently the focus of the computer vision community has shifted from expensive supervised learning towards self-supervised learning of visual representations. While the performance gap between supervised and self-supervised has been narrowing, the time for training self-supervised deep networks remains an order of magn... |
2403.13793 | Matthew Rahtz | Mary Phuong, Matthew Aitchison, Elliot Catt, Sarah Cogan, Alexandre
Kaskasoli, Victoria Krakovna, David Lindner, Matthew Rahtz, Yannis Assael,
Sarah Hodkinson, Heidi Howard, Tom Lieberum, Ramana Kumar, Maria Abi Raad,
Albert Webson, Lewis Ho, Sharon Lin, Sebastian Farquhar, Marcus Hutter,
Gregoire Deletang, Ani... | Evaluating Frontier Models for Dangerous Capabilities | null | null | null | null | cs.LG | http://creativecommons.org/licenses/by/4.0/ | To understand the risks posed by a new AI system, we must understand what it
can and cannot do. Building on prior work, we introduce a programme of new
"dangerous capability" evaluations and pilot them on Gemini 1.0 models. Our
evaluations cover four areas: (1) persuasion and deception; (2) cyber-security;
(3) self-p... | [
{
"created": "Wed, 20 Mar 2024 17:54:26 GMT",
"version": "v1"
},
{
"created": "Fri, 5 Apr 2024 12:26:11 GMT",
"version": "v2"
}
] | 2024-04-08 | [
[
"Phuong",
"Mary",
""
],
[
"Aitchison",
"Matthew",
""
],
[
"Catt",
"Elliot",
""
],
[
"Cogan",
"Sarah",
""
],
[
"Kaskasoli",
"Alexandre",
""
],
[
"Krakovna",
"Victoria",
""
],
[
"Lindner",
"David",
""
],
... | To understand the risks posed by a new AI system, we must understand what it can and cannot do. Building on prior work, we introduce a programme of new "dangerous capability" evaluations and pilot them on Gemini 1.0 models. Our evaluations cover four areas: (1) persuasion and deception; (2) cyber-security; (3) self-pro... |
1504.05498 | Marc Torrellas | Marc Torrellas, Adrian Agustin and Josep Vidal | DoF-Delay Trade-Off for the $K$-user MIMO Interference Channel With
Delayed CSIT | 31 pages, 10 figures, 3 tables, submitted to the IEEE Transactions on
Information Theory | null | 10.1109/TIT.2016.2616348 | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The degrees of freedom (DoF) of the $K$-user multiple-input multiple-output
(MIMO) interference channel are studied when perfect, but delayed channel state
information is available at the transmitter side (delayed CSIT). Recent works
have proposed schemes that achieve increasing DoF values, but at the cost of
long co... | [
{
"created": "Tue, 21 Apr 2015 16:14:23 GMT",
"version": "v1"
},
{
"created": "Wed, 17 Jun 2015 19:51:55 GMT",
"version": "v2"
}
] | 2016-11-18 | [
[
"Torrellas",
"Marc",
""
],
[
"Agustin",
"Adrian",
""
],
[
"Vidal",
"Josep",
""
]
] | The degrees of freedom (DoF) of the $K$-user multiple-input multiple-output (MIMO) interference channel are studied when perfect, but delayed channel state information is available at the transmitter side (delayed CSIT). Recent works have proposed schemes that achieve increasing DoF values, but at the cost of long comm... |
2210.00094 | Amin Ghiasi | Amin Ghiasi, Ali Shafahi, Reza Ardekani | Improving Robustness with Adaptive Weight Decay | null | null | null | null | cs.LG cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We propose adaptive weight decay, which automatically tunes the
hyper-parameter for weight decay during each training iteration. For
classification problems, we propose changing the value of the weight decay
hyper-parameter on the fly based on the strength of updates from the
classification loss (i.e., gradient of cr... | [
{
"created": "Fri, 30 Sep 2022 21:13:00 GMT",
"version": "v1"
},
{
"created": "Sat, 2 Dec 2023 01:27:27 GMT",
"version": "v2"
}
] | 2023-12-05 | [
[
"Ghiasi",
"Amin",
""
],
[
"Shafahi",
"Ali",
""
],
[
"Ardekani",
"Reza",
""
]
] | We propose adaptive weight decay, which automatically tunes the hyper-parameter for weight decay during each training iteration. For classification problems, we propose changing the value of the weight decay hyper-parameter on the fly based on the strength of updates from the classification loss (i.e., gradient of cros... |
cs/0205028 | Steven Bird | Edward Loper and Steven Bird | NLTK: The Natural Language Toolkit | 8 pages, 1 figure, Proceedings of the ACL Workshop on Effective Tools
and Methodologies for Teaching Natural Language Processing and Computational
Linguistics, Philadelphia, July 2002, Association for Computational
Linguistics | null | null | null | cs.CL | null | NLTK, the Natural Language Toolkit, is a suite of open source program
modules, tutorials and problem sets, providing ready-to-use computational
linguistics courseware. NLTK covers symbolic and statistical natural language
processing, and is interfaced to annotated corpora. Students augment and
replace existing compon... | [
{
"created": "Fri, 17 May 2002 12:51:00 GMT",
"version": "v1"
}
] | 2007-05-23 | [
[
"Loper",
"Edward",
""
],
[
"Bird",
"Steven",
""
]
] | NLTK, the Natural Language Toolkit, is a suite of open source program modules, tutorials and problem sets, providing ready-to-use computational linguistics courseware. NLTK covers symbolic and statistical natural language processing, and is interfaced to annotated corpora. Students augment and replace existing componen... |
2008.03553 | Morteza Babaie | Aditya Sriram, Shivam Kalra, Morteza Babaie, Brady Kieffer, Waddah Al
Drobi, Shahryar Rahnamayan, Hany Kashani, Hamid R. Tizhoosh | Forming Local Intersections of Projections for Classifying and Searching
Histopathology Images | To appear in International Conference on AI in Medicine (AIME 2020) | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we propose a novel image descriptor called Forming Local
Intersections of Projections (FLIP) and its multi-resolution version (mFLIP)
for representing histopathology images. The descriptor is based on the Radon
transform wherein we apply parallel projections in small local neighborhoods of
gray-level i... | [
{
"created": "Sat, 8 Aug 2020 16:32:04 GMT",
"version": "v1"
}
] | 2020-08-11 | [
[
"Sriram",
"Aditya",
""
],
[
"Kalra",
"Shivam",
""
],
[
"Babaie",
"Morteza",
""
],
[
"Kieffer",
"Brady",
""
],
[
"Drobi",
"Waddah Al",
""
],
[
"Rahnamayan",
"Shahryar",
""
],
[
"Kashani",
"Hany",
""
],
[... | In this paper, we propose a novel image descriptor called Forming Local Intersections of Projections (FLIP) and its multi-resolution version (mFLIP) for representing histopathology images. The descriptor is based on the Radon transform wherein we apply parallel projections in small local neighborhoods of gray-level ima... |
1704.04394 | Namhoon Lee | Namhoon Lee, Wongun Choi, Paul Vernaza, Christopher B. Choy, Philip H.
S. Torr and Manmohan Chandraker | DESIRE: Distant Future Prediction in Dynamic Scenes with Interacting
Agents | Accepted at CVPR 2017 | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We introduce a Deep Stochastic IOC RNN Encoderdecoder framework, DESIRE, for
the task of future predictions of multiple interacting agents in dynamic
scenes. DESIRE effectively predicts future locations of objects in multiple
scenes by 1) accounting for the multi-modal nature of the future prediction
(i.e., given the... | [
{
"created": "Fri, 14 Apr 2017 11:15:44 GMT",
"version": "v1"
}
] | 2017-04-17 | [
[
"Lee",
"Namhoon",
""
],
[
"Choi",
"Wongun",
""
],
[
"Vernaza",
"Paul",
""
],
[
"Choy",
"Christopher B.",
""
],
[
"Torr",
"Philip H. S.",
""
],
[
"Chandraker",
"Manmohan",
""
]
] | We introduce a Deep Stochastic IOC RNN Encoderdecoder framework, DESIRE, for the task of future predictions of multiple interacting agents in dynamic scenes. DESIRE effectively predicts future locations of objects in multiple scenes by 1) accounting for the multi-modal nature of the future prediction (i.e., given the s... |
2011.11636 | Chun Yui Wong | Chun Yui Wong, Pranay Seshadri, Ashley Scillitoe, Andrew B. Duncan,
Geoffrey Parks | Blade Envelopes Part I: Concept and Methodology | null | null | null | null | cs.CE stat.AP | http://creativecommons.org/licenses/by-nc-nd/4.0/ | Blades manufactured through flank and point milling will likely exhibit
geometric variability. Gauging the aerodynamic repercussions of such
variability, prior to manufacturing a component, is challenging enough, let
alone trying to predict what the amplified impact of any in-service degradation
will be. While rules ... | [
{
"created": "Sun, 22 Nov 2020 11:34:59 GMT",
"version": "v1"
},
{
"created": "Mon, 21 Dec 2020 17:21:51 GMT",
"version": "v2"
},
{
"created": "Fri, 25 Dec 2020 14:39:52 GMT",
"version": "v3"
},
{
"created": "Tue, 5 Jan 2021 15:03:16 GMT",
"version": "v4"
},
{
"cr... | 2022-01-03 | [
[
"Wong",
"Chun Yui",
""
],
[
"Seshadri",
"Pranay",
""
],
[
"Scillitoe",
"Ashley",
""
],
[
"Duncan",
"Andrew B.",
""
],
[
"Parks",
"Geoffrey",
""
]
] | Blades manufactured through flank and point milling will likely exhibit geometric variability. Gauging the aerodynamic repercussions of such variability, prior to manufacturing a component, is challenging enough, let alone trying to predict what the amplified impact of any in-service degradation will be. While rules of... |
2408.07137 | Yutong Hu | Yutong Hu and Kangcheng Luo and Yansong Feng | ELLA: Empowering LLMs for Interpretable, Accurate and Informative Legal
Advice | null | null | null | null | cs.CL | http://creativecommons.org/licenses/by/4.0/ | Despite remarkable performance in legal consultation exhibited by legal Large
Language Models(LLMs) combined with legal article retrieval components, there
are still cases when the advice given is incorrect or baseless. To alleviate
these problems, we propose {\bf ELLA}, a tool for {\bf E}mpowering {\bf L}LMs
for int... | [
{
"created": "Tue, 13 Aug 2024 18:12:00 GMT",
"version": "v1"
}
] | 2024-08-15 | [
[
"Hu",
"Yutong",
""
],
[
"Luo",
"Kangcheng",
""
],
[
"Feng",
"Yansong",
""
]
] | Despite remarkable performance in legal consultation exhibited by legal Large Language Models(LLMs) combined with legal article retrieval components, there are still cases when the advice given is incorrect or baseless. To alleviate these problems, we propose {\bf ELLA}, a tool for {\bf E}mpowering {\bf L}LMs for inter... |
2006.09184 | Amir Ahmad | Amir Ahmada, Sunita Garhwal, Santosh Kumar Ray, Gagan Kumar, Sharaf J.
Malebary, Omar Mohammed Omar Barukab | The Number of Confirmed Cases of Covid-19 by using Machine Learning:
Methods and Challenges | null | null | null | null | cs.SI cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Covid-19 is one of the biggest health challenges that the world has ever
faced. Public health policy makers need the reliable prediction of the
confirmed cases in future to plan medical facilities. Machine learning methods
learn from the historical data and make a prediction about the event. Machine
learning methods ... | [
{
"created": "Thu, 11 Jun 2020 15:34:59 GMT",
"version": "v1"
}
] | 2020-06-17 | [
[
"Ahmada",
"Amir",
""
],
[
"Garhwal",
"Sunita",
""
],
[
"Ray",
"Santosh Kumar",
""
],
[
"Kumar",
"Gagan",
""
],
[
"Malebary",
"Sharaf J.",
""
],
[
"Barukab",
"Omar Mohammed Omar",
""
]
] | Covid-19 is one of the biggest health challenges that the world has ever faced. Public health policy makers need the reliable prediction of the confirmed cases in future to plan medical facilities. Machine learning methods learn from the historical data and make a prediction about the event. Machine learning methods ha... |
2202.00866 | Qimeng Wang | Yan Gao and Qimeng Wang and Xu Tang and Haochen Wang and Fei Ding and
Jing Li and Yao Hu | Decoupled IoU Regression for Object Detection | ACMMM 2021 Poster | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Non-maximum suppression (NMS) is widely used in object detection pipelines
for removing duplicated bounding boxes. The inconsistency between the
confidence for NMS and the real localization confidence seriously affects
detection performance. Prior works propose to predict Intersection-over-Union
(IoU) between boundin... | [
{
"created": "Wed, 2 Feb 2022 04:01:11 GMT",
"version": "v1"
}
] | 2022-02-03 | [
[
"Gao",
"Yan",
""
],
[
"Wang",
"Qimeng",
""
],
[
"Tang",
"Xu",
""
],
[
"Wang",
"Haochen",
""
],
[
"Ding",
"Fei",
""
],
[
"Li",
"Jing",
""
],
[
"Hu",
"Yao",
""
]
] | Non-maximum suppression (NMS) is widely used in object detection pipelines for removing duplicated bounding boxes. The inconsistency between the confidence for NMS and the real localization confidence seriously affects detection performance. Prior works propose to predict Intersection-over-Union (IoU) between bounding ... |
2111.12056 | Jinu Gong | Jinu Gong, Osvaldo Simeone, Rahif Kassab, and Joonhyuk Kang | Forget-SVGD: Particle-Based Bayesian Federated Unlearning | submitted for conference publication | null | null | null | cs.LG eess.SP | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Variational particle-based Bayesian learning methods have the advantage of
not being limited by the bias affecting more conventional parametric
techniques. This paper proposes to leverage the flexibility of non-parametric
Bayesian approximate inference to develop a novel Bayesian federated unlearning
method, referred... | [
{
"created": "Tue, 23 Nov 2021 18:15:50 GMT",
"version": "v1"
}
] | 2021-11-24 | [
[
"Gong",
"Jinu",
""
],
[
"Simeone",
"Osvaldo",
""
],
[
"Kassab",
"Rahif",
""
],
[
"Kang",
"Joonhyuk",
""
]
] | Variational particle-based Bayesian learning methods have the advantage of not being limited by the bias affecting more conventional parametric techniques. This paper proposes to leverage the flexibility of non-parametric Bayesian approximate inference to develop a novel Bayesian federated unlearning method, referred t... |
2010.11334 | Chiyu Zhang | Muhammad Abdul-Mageed, Chiyu Zhang, Houda Bouamor and Nizar Habash | NADI 2020: The First Nuanced Arabic Dialect Identification Shared Task | Accepted in The Fifth Arabic Natural Language Processing Workshop
(WANLP 2020) | null | null | null | cs.CL cs.AI | http://creativecommons.org/licenses/by/4.0/ | We present the results and findings of the First Nuanced Arabic Dialect
Identification Shared Task (NADI). This Shared Task includes two subtasks:
country-level dialect identification (Subtask 1) and province-level sub-dialect
identification (Subtask 2). The data for the shared task covers a total of 100
provinces fr... | [
{
"created": "Wed, 21 Oct 2020 22:14:28 GMT",
"version": "v1"
},
{
"created": "Sun, 1 Nov 2020 04:53:19 GMT",
"version": "v2"
},
{
"created": "Mon, 9 Nov 2020 19:18:33 GMT",
"version": "v3"
}
] | 2020-11-11 | [
[
"Abdul-Mageed",
"Muhammad",
""
],
[
"Zhang",
"Chiyu",
""
],
[
"Bouamor",
"Houda",
""
],
[
"Habash",
"Nizar",
""
]
] | We present the results and findings of the First Nuanced Arabic Dialect Identification Shared Task (NADI). This Shared Task includes two subtasks: country-level dialect identification (Subtask 1) and province-level sub-dialect identification (Subtask 2). The data for the shared task covers a total of 100 provinces from... |
1912.01146 | Basilis Mamalis | Basilis Mamalis | Prolonging Network Lifetime in Wireless Sensor Networks with
Path-Constrained Mobile Sink | 10 pages | International Journal of Advanced Computer Science and
Applications, Vol. 5, No. 10, 2014 | null | null | cs.DC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Many studies in recent years have considered the use of mobile sinks (MS) for
data gathering in wireless sensor networks (WSN), so as to reduce the need for
data forwarding among the sensor nodes (SN) and thereby prolong the network
lifetime. Moreover, in practice, often the MS tour length has to be kept below
a thre... | [
{
"created": "Tue, 3 Dec 2019 01:30:44 GMT",
"version": "v1"
}
] | 2019-12-04 | [
[
"Mamalis",
"Basilis",
""
]
] | Many studies in recent years have considered the use of mobile sinks (MS) for data gathering in wireless sensor networks (WSN), so as to reduce the need for data forwarding among the sensor nodes (SN) and thereby prolong the network lifetime. Moreover, in practice, often the MS tour length has to be kept below a thresh... |
2003.00406 | Xiao Wang | Sulan Zhai, Shunqiang Liu, Xiao Wang, Jin Tang | FMT:Fusing Multi-task Convolutional Neural Network for Person Search | Published on Multimedia Tools and Applications | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Person search is to detect all persons and identify the query persons from
detected persons in the image without proposals and bounding boxes, which is
different from person re-identification. In this paper, we propose a fusing
multi-task convolutional neural network(FMT-CNN) to tackle the correlation and
heterogenei... | [
{
"created": "Sun, 1 Mar 2020 05:20:47 GMT",
"version": "v1"
}
] | 2020-03-03 | [
[
"Zhai",
"Sulan",
""
],
[
"Liu",
"Shunqiang",
""
],
[
"Wang",
"Xiao",
""
],
[
"Tang",
"Jin",
""
]
] | Person search is to detect all persons and identify the query persons from detected persons in the image without proposals and bounding boxes, which is different from person re-identification. In this paper, we propose a fusing multi-task convolutional neural network(FMT-CNN) to tackle the correlation and heterogeneity... |
2012.05054 | Huansheng Ning Prof | Huansheng Ning and Feifei Shi | Could robots be regarded as humans in future? | 4 pages, 1 table | null | null | null | cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | With the overwhelming advances in Artificial Intelligence (AI), brain science
and neuroscience, robots are developing towards a direction of much more
human-like and human-friendly. We can't help but wonder whether robots could be
regarded as humans in future? In this article, we propose a novel perspective
to analyz... | [
{
"created": "Tue, 1 Dec 2020 13:04:08 GMT",
"version": "v1"
}
] | 2020-12-10 | [
[
"Ning",
"Huansheng",
""
],
[
"Shi",
"Feifei",
""
]
] | With the overwhelming advances in Artificial Intelligence (AI), brain science and neuroscience, robots are developing towards a direction of much more human-like and human-friendly. We can't help but wonder whether robots could be regarded as humans in future? In this article, we propose a novel perspective to analyze ... |
1210.2195 | J\"org P\"uhrer | Marina De Vos, Do\u{g}a Gizem K{\i}za, Johannes Oetsch, J\"org
P\"uhrer, Hans Tompits | Annotating Answer-Set Programs in LANA? | null | null | null | null | cs.SE cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | While past research in answer-set programming (ASP) mainly focused on theory,
ASP solver technology, and applications, the present work situates itself in
the context of a quite recent research trend: development support for ASP. In
particular, we propose to augment answer-set programs with additional
meta-informatio... | [
{
"created": "Mon, 8 Oct 2012 09:26:15 GMT",
"version": "v1"
}
] | 2012-10-09 | [
[
"De Vos",
"Marina",
""
],
[
"Kıza",
"Doğa Gizem",
""
],
[
"Oetsch",
"Johannes",
""
],
[
"Pührer",
"Jörg",
""
],
[
"Tompits",
"Hans",
""
]
] | While past research in answer-set programming (ASP) mainly focused on theory, ASP solver technology, and applications, the present work situates itself in the context of a quite recent research trend: development support for ASP. In particular, we propose to augment answer-set programs with additional meta-information ... |
0909.5278 | Yngve Villanger | Fedor V. Fomin and Yngve Villanger | Finding Induced Subgraphs via Minimal Triangulations | 14 pages | null | null | null | cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Potential maximal cliques and minimal separators are combinatorial objects
which were introduced and studied in the realm of minimal triangulations
problems including Minimum Fill-in and Treewidth. We discover unexpected
applications of these notions to the field of moderate exponential algorithms.
In particular, we ... | [
{
"created": "Tue, 29 Sep 2009 07:13:39 GMT",
"version": "v1"
},
{
"created": "Tue, 22 Dec 2009 09:55:02 GMT",
"version": "v2"
}
] | 2009-12-22 | [
[
"Fomin",
"Fedor V.",
""
],
[
"Villanger",
"Yngve",
""
]
] | Potential maximal cliques and minimal separators are combinatorial objects which were introduced and studied in the realm of minimal triangulations problems including Minimum Fill-in and Treewidth. We discover unexpected applications of these notions to the field of moderate exponential algorithms. In particular, we sh... |
2305.16532 | Amir Samad | Amir Samadi, Konstantinos Koufos, Kurt Debattista and Mehrdad Dianati | Counterfactual Explainer Framework for Deep Reinforcement Learning
Models Using Policy Distillation | null | null | null | null | cs.LG | http://creativecommons.org/licenses/by/4.0/ | Deep Reinforcement Learning (DRL) has demonstrated promising capability in
solving complex control problems. However, DRL applications in safety-critical
systems are hindered by the inherent lack of robust verification techniques to
assure their performance in such applications. One of the key requirements of
the ver... | [
{
"created": "Thu, 25 May 2023 23:30:48 GMT",
"version": "v1"
},
{
"created": "Thu, 1 Jun 2023 12:20:53 GMT",
"version": "v2"
},
{
"created": "Sat, 7 Oct 2023 11:34:25 GMT",
"version": "v3"
}
] | 2023-10-10 | [
[
"Samadi",
"Amir",
""
],
[
"Koufos",
"Konstantinos",
""
],
[
"Debattista",
"Kurt",
""
],
[
"Dianati",
"Mehrdad",
""
]
] | Deep Reinforcement Learning (DRL) has demonstrated promising capability in solving complex control problems. However, DRL applications in safety-critical systems are hindered by the inherent lack of robust verification techniques to assure their performance in such applications. One of the key requirements of the verif... |
2004.14571 | Sadasivam Aadhavan | Aadhavan Sadasivam, Kausic Gunasekar, Hasan Davulcu, Yezhou Yang | memeBot: Towards Automatic Image Meme Generation | null | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Image memes have become a widespread tool used by people for interacting and
exchanging ideas over social media, blogs, and open messengers. This work
proposes to treat automatic image meme generation as a translation process, and
further present an end to end neural and probabilistic approach to generate an
image-ba... | [
{
"created": "Thu, 30 Apr 2020 03:48:14 GMT",
"version": "v1"
}
] | 2020-05-01 | [
[
"Sadasivam",
"Aadhavan",
""
],
[
"Gunasekar",
"Kausic",
""
],
[
"Davulcu",
"Hasan",
""
],
[
"Yang",
"Yezhou",
""
]
] | Image memes have become a widespread tool used by people for interacting and exchanging ideas over social media, blogs, and open messengers. This work proposes to treat automatic image meme generation as a translation process, and further present an end to end neural and probabilistic approach to generate an image-base... |
2311.01599 | Bogdan Chornomaz | Zachary Chase, Bogdan Chornomaz, Shay Moran, Amir Yehudayoff | Local Borsuk-Ulam, Stability, and Replicability | null | null | null | null | cs.LG cs.DS | http://creativecommons.org/licenses/by/4.0/ | We use and adapt the Borsuk-Ulam Theorem from topology to derive limitations
on list-replicable and globally stable learning algorithms. We further
demonstrate the applicability of our methods in combinatorics and topology.
We show that, besides trivial cases, both list-replicable and globally stable
learning are i... | [
{
"created": "Thu, 2 Nov 2023 21:10:16 GMT",
"version": "v1"
}
] | 2023-11-06 | [
[
"Chase",
"Zachary",
""
],
[
"Chornomaz",
"Bogdan",
""
],
[
"Moran",
"Shay",
""
],
[
"Yehudayoff",
"Amir",
""
]
] | We use and adapt the Borsuk-Ulam Theorem from topology to derive limitations on list-replicable and globally stable learning algorithms. We further demonstrate the applicability of our methods in combinatorics and topology. We show that, besides trivial cases, both list-replicable and globally stable learning are impos... |
2006.03722 | Michael Fauss | Michael Fau{\ss}, Alex Dysto, H. Vincent Poor | MMSE Bounds Under Kullback-Leibler Divergence Constraints on the Joint
Input-Output Distribution | Submitted for publication in the IEEE Transactions on Signal
Processing | null | null | null | cs.IT math.IT stat.OT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper proposes a new family of lower and upper bounds on the minimum
mean squared error (MMSE). The key idea is to minimize/maximize the MMSE
subject to the constraint that the joint distribution of the input-output
statistics lies in a Kullback-Leibler divergence ball centered at some Gaussian
reference distrib... | [
{
"created": "Fri, 5 Jun 2020 22:30:59 GMT",
"version": "v1"
}
] | 2020-06-09 | [
[
"Fauß",
"Michael",
""
],
[
"Dysto",
"Alex",
""
],
[
"Poor",
"H. Vincent",
""
]
] | This paper proposes a new family of lower and upper bounds on the minimum mean squared error (MMSE). The key idea is to minimize/maximize the MMSE subject to the constraint that the joint distribution of the input-output statistics lies in a Kullback-Leibler divergence ball centered at some Gaussian reference distribut... |
1712.03866 | Iason Oikonomidis | Paschalis Panteleris, Iason Oikonomidis, Antonis Argyros | Using a single RGB frame for real time 3D hand pose estimation in the
wild | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We present a method for the real-time estimation of the full 3D pose of one
or more human hands using a single commodity RGB camera. Recent work in the
area has displayed impressive progress using RGBD input. However, since the
introduction of RGBD sensors, there has been little progress for the case of
monocular col... | [
{
"created": "Mon, 11 Dec 2017 16:16:05 GMT",
"version": "v1"
}
] | 2017-12-12 | [
[
"Panteleris",
"Paschalis",
""
],
[
"Oikonomidis",
"Iason",
""
],
[
"Argyros",
"Antonis",
""
]
] | We present a method for the real-time estimation of the full 3D pose of one or more human hands using a single commodity RGB camera. Recent work in the area has displayed impressive progress using RGBD input. However, since the introduction of RGBD sensors, there has been little progress for the case of monocular color... |
1911.11018 | Xiaowei Gu | Xiaowei Gu, Plamen P Angelov and Eduardo Almeida Soares | A Self-Adaptive Synthetic Over-Sampling Technique for Imbalanced
Classification | This paper has been submitted to International Journal of Intelligent
Systems for publication | null | 10.1002/int.22230 | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Traditionally, in supervised machine learning, (a significant) part of the
available data (usually 50% to 80%) is used for training and the rest for
validation. In many problems, however, the data is highly imbalanced in regard
to different classes or does not have good coverage of the feasible data space
which, in t... | [
{
"created": "Mon, 25 Nov 2019 16:08:32 GMT",
"version": "v1"
}
] | 2020-04-21 | [
[
"Gu",
"Xiaowei",
""
],
[
"Angelov",
"Plamen P",
""
],
[
"Soares",
"Eduardo Almeida",
""
]
] | Traditionally, in supervised machine learning, (a significant) part of the available data (usually 50% to 80%) is used for training and the rest for validation. In many problems, however, the data is highly imbalanced in regard to different classes or does not have good coverage of the feasible data space which, in tur... |
2206.14666 | Anthony Coache | Anthony Coache, Sebastian Jaimungal, \'Alvaro Cartea | Conditionally Elicitable Dynamic Risk Measures for Deep Reinforcement
Learning | 41 pages, 7 figures | null | null | null | cs.LG q-fin.CP q-fin.PM q-fin.RM q-fin.TR | http://creativecommons.org/licenses/by-sa/4.0/ | We propose a novel framework to solve risk-sensitive reinforcement learning
(RL) problems where the agent optimises time-consistent dynamic spectral risk
measures. Based on the notion of conditional elicitability, our methodology
constructs (strictly consistent) scoring functions that are used as penalizers
in the es... | [
{
"created": "Wed, 29 Jun 2022 14:11:15 GMT",
"version": "v1"
},
{
"created": "Wed, 5 Oct 2022 18:31:01 GMT",
"version": "v2"
},
{
"created": "Mon, 1 May 2023 15:16:41 GMT",
"version": "v3"
}
] | 2023-05-02 | [
[
"Coache",
"Anthony",
""
],
[
"Jaimungal",
"Sebastian",
""
],
[
"Cartea",
"Álvaro",
""
]
] | We propose a novel framework to solve risk-sensitive reinforcement learning (RL) problems where the agent optimises time-consistent dynamic spectral risk measures. Based on the notion of conditional elicitability, our methodology constructs (strictly consistent) scoring functions that are used as penalizers in the esti... |
2004.13138 | Jinghui Lu | Jinghui Lu and Brian MacNamee | Investigating the Effectiveness of Representations Based on Pretrained
Transformer-based Language Models in Active Learning for Labelling Text
Datasets | arXiv admin note: substantial text overlap with arXiv:1910.03505 | null | null | null | cs.IR cs.CL cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Active learning has been shown to be an effective way to alleviate some of
the effort required in utilising large collections of unlabelled data for
machine learning tasks without needing to fully label them. The representation
mechanism used to represent text documents when performing active learning,
however, has a... | [
{
"created": "Tue, 21 Apr 2020 02:37:44 GMT",
"version": "v1"
}
] | 2020-04-29 | [
[
"Lu",
"Jinghui",
""
],
[
"MacNamee",
"Brian",
""
]
] | Active learning has been shown to be an effective way to alleviate some of the effort required in utilising large collections of unlabelled data for machine learning tasks without needing to fully label them. The representation mechanism used to represent text documents when performing active learning, however, has a s... |
2405.20902 | Rongwu Xu | Rongwu Xu, Zehan Qi, Wei Xu | Preemptive Answer "Attacks" on Chain-of-Thought Reasoning | Accepted to ACL'24 (Findings). Camera-ready version | null | null | null | cs.CL cs.AI cs.CR | http://creativecommons.org/licenses/by-nc-nd/4.0/ | Large language models (LLMs) showcase impressive reasoning capabilities when
coupled with Chain-of-Thought (CoT) prompting. However, the robustness of this
approach warrants further investigation. In this paper, we introduce a novel
scenario termed preemptive answers, where the LLM obtains an answer before
engaging i... | [
{
"created": "Fri, 31 May 2024 15:15:04 GMT",
"version": "v1"
}
] | 2024-06-03 | [
[
"Xu",
"Rongwu",
""
],
[
"Qi",
"Zehan",
""
],
[
"Xu",
"Wei",
""
]
] | Large language models (LLMs) showcase impressive reasoning capabilities when coupled with Chain-of-Thought (CoT) prompting. However, the robustness of this approach warrants further investigation. In this paper, we introduce a novel scenario termed preemptive answers, where the LLM obtains an answer before engaging in ... |
2103.02650 | Kiant\'e Brantley | Kiant\'e Brantley, Soroush Mehri, Geoffrey J. Gordon | Successor Feature Sets: Generalizing Successor Representations Across
Policies | null | null | null | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Successor-style representations have many advantages for reinforcement
learning: for example, they can help an agent generalize from past experience
to new goals, and they have been proposed as explanations of behavioral and
neural data from human and animal learners. They also form a natural bridge
between model-bas... | [
{
"created": "Wed, 3 Mar 2021 19:36:44 GMT",
"version": "v1"
},
{
"created": "Mon, 15 Mar 2021 22:09:04 GMT",
"version": "v2"
}
] | 2021-03-17 | [
[
"Brantley",
"Kianté",
""
],
[
"Mehri",
"Soroush",
""
],
[
"Gordon",
"Geoffrey J.",
""
]
] | Successor-style representations have many advantages for reinforcement learning: for example, they can help an agent generalize from past experience to new goals, and they have been proposed as explanations of behavioral and neural data from human and animal learners. They also form a natural bridge between model-based... |
2305.11854 | Hiroki Furuta | Hiroki Furuta, Kuang-Huei Lee, Ofir Nachum, Yutaka Matsuo, Aleksandra
Faust, Shixiang Shane Gu, Izzeddin Gur | Multimodal Web Navigation with Instruction-Finetuned Foundation Models | Accepted to ICLR 2024. Website:
https://sites.google.com/view/mm-webnav/ | null | null | null | cs.LG cs.AI stat.ML | http://creativecommons.org/licenses/by/4.0/ | The progress of autonomous web navigation has been hindered by the dependence
on billions of exploratory interactions via online reinforcement learning, and
domain-specific model designs that make it difficult to leverage generalization
from rich out-of-domain data. In this work, we study data-driven offline
training... | [
{
"created": "Fri, 19 May 2023 17:44:34 GMT",
"version": "v1"
},
{
"created": "Sun, 1 Oct 2023 10:15:01 GMT",
"version": "v2"
},
{
"created": "Mon, 19 Feb 2024 01:56:54 GMT",
"version": "v3"
},
{
"created": "Sun, 25 Feb 2024 16:21:00 GMT",
"version": "v4"
}
] | 2024-02-27 | [
[
"Furuta",
"Hiroki",
""
],
[
"Lee",
"Kuang-Huei",
""
],
[
"Nachum",
"Ofir",
""
],
[
"Matsuo",
"Yutaka",
""
],
[
"Faust",
"Aleksandra",
""
],
[
"Gu",
"Shixiang Shane",
""
],
[
"Gur",
"Izzeddin",
""
]
] | The progress of autonomous web navigation has been hindered by the dependence on billions of exploratory interactions via online reinforcement learning, and domain-specific model designs that make it difficult to leverage generalization from rich out-of-domain data. In this work, we study data-driven offline training f... |
2403.12384 | Yifan Liu | Yifan Liu, Kangning Zhang, Xiangyuan Ren, Yanhua Huang, Jiarui Jin,
Yingjie Qin, Ruilong Su, Ruiwen Xu, Yong Yu, Weinan Zhang | AlignRec: Aligning and Training in Multimodal Recommendations | 9 page paper, 2 page appendix. Accepted by CIKM24 | null | null | null | cs.IR cs.LG | http://creativecommons.org/licenses/by-sa/4.0/ | With the development of multimedia systems, multimodal recommendations are
playing an essential role, as they can leverage rich contexts beyond
interactions. Existing methods mainly regard multimodal information as an
auxiliary, using them to help learn ID features; However, there exist semantic
gaps among multimodal... | [
{
"created": "Tue, 19 Mar 2024 02:49:32 GMT",
"version": "v1"
},
{
"created": "Wed, 20 Mar 2024 02:50:36 GMT",
"version": "v2"
},
{
"created": "Tue, 21 May 2024 11:51:03 GMT",
"version": "v3"
},
{
"created": "Thu, 1 Aug 2024 03:32:49 GMT",
"version": "v4"
}
] | 2024-08-02 | [
[
"Liu",
"Yifan",
""
],
[
"Zhang",
"Kangning",
""
],
[
"Ren",
"Xiangyuan",
""
],
[
"Huang",
"Yanhua",
""
],
[
"Jin",
"Jiarui",
""
],
[
"Qin",
"Yingjie",
""
],
[
"Su",
"Ruilong",
""
],
[
"Xu",
"Rui... | With the development of multimedia systems, multimodal recommendations are playing an essential role, as they can leverage rich contexts beyond interactions. Existing methods mainly regard multimodal information as an auxiliary, using them to help learn ID features; However, there exist semantic gaps among multimodal c... |
2402.08249 | Ying Jin | Ying Jin and Jiaqi Wang and Dahua Lin | SepRep-Net: Multi-source Free Domain Adaptation via Model Separation And
Reparameterization | null | null | null | null | cs.CV | http://creativecommons.org/licenses/by/4.0/ | We consider multi-source free domain adaptation, the problem of adapting
multiple existing models to a new domain without accessing the source data.
Among existing approaches, methods based on model ensemble are effective in
both the source and target domains, but incur significantly increased
computational costs. To... | [
{
"created": "Tue, 13 Feb 2024 06:35:00 GMT",
"version": "v1"
},
{
"created": "Fri, 17 May 2024 08:24:44 GMT",
"version": "v2"
}
] | 2024-05-20 | [
[
"Jin",
"Ying",
""
],
[
"Wang",
"Jiaqi",
""
],
[
"Lin",
"Dahua",
""
]
] | We consider multi-source free domain adaptation, the problem of adapting multiple existing models to a new domain without accessing the source data. Among existing approaches, methods based on model ensemble are effective in both the source and target domains, but incur significantly increased computational costs. Towa... |
2201.11192 | Gyri Reiersen | Gyri Reiersen, David Dao, Bj\"orn L\"utjens, Konstantin Klemmer, Kenza
Amara, Attila Steinegger, Ce Zhang, Xiaoxiang Zhu | ReforesTree: A Dataset for Estimating Tropical Forest Carbon Stock with
Deep Learning and Aerial Imagery | Accepted paper for the AI for Social Impact Track at the AAAI 2022 | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Forest biomass is a key influence for future climate, and the world urgently
needs highly scalable financing schemes, such as carbon offsetting
certifications, to protect and restore forests. Current manual forest carbon
stock inventory methods of measuring single trees by hand are time, labour, and
cost-intensive an... | [
{
"created": "Wed, 26 Jan 2022 21:27:57 GMT",
"version": "v1"
}
] | 2022-01-28 | [
[
"Reiersen",
"Gyri",
""
],
[
"Dao",
"David",
""
],
[
"Lütjens",
"Björn",
""
],
[
"Klemmer",
"Konstantin",
""
],
[
"Amara",
"Kenza",
""
],
[
"Steinegger",
"Attila",
""
],
[
"Zhang",
"Ce",
""
],
[
"Zhu... | Forest biomass is a key influence for future climate, and the world urgently needs highly scalable financing schemes, such as carbon offsetting certifications, to protect and restore forests. Current manual forest carbon stock inventory methods of measuring single trees by hand are time, labour, and cost-intensive and ... |
2209.11324 | Kostas Peppas P | Dimitrios G. Selimis, Mar Francis De Guzman, Fotis I. Lazarakis,
Kyriakos N. Manganaris, Kostas P. Peppas and Katsuyuki Haneda | Path Loss, Angular Spread and Channel Sparsity Modeling for Indoor and
Outdoor Environments at the sub-THz Band | null | null | null | null | cs.IT math.IT | http://creativecommons.org/publicdomain/zero/1.0/ | In this paper, we present new measurement results to model large-scale path
loss, angular spread and channel sparsity at the sub-THz (141-145 GHz) band,
for both indoor and outdoor scenarios. Extensive measurement campaigns have
been carried out, taking into account both line-of-sight (LoS) and non
line-of-sight (NLo... | [
{
"created": "Thu, 22 Sep 2022 21:32:51 GMT",
"version": "v1"
},
{
"created": "Wed, 23 Nov 2022 17:21:45 GMT",
"version": "v2"
},
{
"created": "Wed, 26 Apr 2023 09:33:24 GMT",
"version": "v3"
}
] | 2023-04-27 | [
[
"Selimis",
"Dimitrios G.",
""
],
[
"De Guzman",
"Mar Francis",
""
],
[
"Lazarakis",
"Fotis I.",
""
],
[
"Manganaris",
"Kyriakos N.",
""
],
[
"Peppas",
"Kostas P.",
""
],
[
"Haneda",
"Katsuyuki",
""
]
] | In this paper, we present new measurement results to model large-scale path loss, angular spread and channel sparsity at the sub-THz (141-145 GHz) band, for both indoor and outdoor scenarios. Extensive measurement campaigns have been carried out, taking into account both line-of-sight (LoS) and non line-of-sight (NLoS)... |
1802.08176 | George K. Thiruvathukal | Ahmed S. Kaseb, Bo Fu, Anup Mohan, Yung-Hsiang Lu, Amy Reibman, George
K. Thiruvathukal | Analyzing Real-Time Multimedia Content From Network Cameras Using CPUs
and GPUs in the Cloud | Accepted at MIPR 2018 | null | null | null | cs.DC | http://creativecommons.org/licenses/by-nc-sa/4.0/ | Millions of network cameras are streaming real-time multimedia content
(images or videos) for various environments (e.g., highways and malls) and can
be used for a variety of applications. Analyzing the content from many network
cameras requires significant amounts of computing resources. Cloud vendors
offer resource... | [
{
"created": "Wed, 21 Feb 2018 14:46:27 GMT",
"version": "v1"
},
{
"created": "Wed, 21 Mar 2018 14:30:56 GMT",
"version": "v2"
}
] | 2018-03-22 | [
[
"Kaseb",
"Ahmed S.",
""
],
[
"Fu",
"Bo",
""
],
[
"Mohan",
"Anup",
""
],
[
"Lu",
"Yung-Hsiang",
""
],
[
"Reibman",
"Amy",
""
],
[
"Thiruvathukal",
"George K.",
""
]
] | Millions of network cameras are streaming real-time multimedia content (images or videos) for various environments (e.g., highways and malls) and can be used for a variety of applications. Analyzing the content from many network cameras requires significant amounts of computing resources. Cloud vendors offer resources ... |
2407.17786 | Chi-Han Peng | Chia-Chia Chen and Chi-Han Peng | Topology-Preserving Downsampling of Binary Images | Accepted to The 18th European Conference on Computer Vision (ECCV)
2024 | null | null | null | cs.CV cs.GR | http://creativecommons.org/licenses/by/4.0/ | We present a novel discrete optimization-based approach to generate
downsampled versions of binary images that are guaranteed to have the same
topology as the original, measured by the zeroth and first Betti numbers of the
black regions, while having good similarity to the original image as measured
by IoU and Dice s... | [
{
"created": "Thu, 25 Jul 2024 05:30:09 GMT",
"version": "v1"
}
] | 2024-07-26 | [
[
"Chen",
"Chia-Chia",
""
],
[
"Peng",
"Chi-Han",
""
]
] | We present a novel discrete optimization-based approach to generate downsampled versions of binary images that are guaranteed to have the same topology as the original, measured by the zeroth and first Betti numbers of the black regions, while having good similarity to the original image as measured by IoU and Dice sco... |
2405.02653 | Qianli Zhou | Qianli Zhou and Tianxiang Zhan and Yong Deng | Isopignistic Canonical Decomposition via Belief Evolution Network | null | null | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Developing a general information processing model in uncertain environments
is fundamental for the advancement of explainable artificial intelligence.
Dempster-Shafer theory of evidence is a well-known and effective reasoning
method for representing epistemic uncertainty, which is closely related to
subjective probab... | [
{
"created": "Sat, 4 May 2024 12:39:15 GMT",
"version": "v1"
}
] | 2024-05-07 | [
[
"Zhou",
"Qianli",
""
],
[
"Zhan",
"Tianxiang",
""
],
[
"Deng",
"Yong",
""
]
] | Developing a general information processing model in uncertain environments is fundamental for the advancement of explainable artificial intelligence. Dempster-Shafer theory of evidence is a well-known and effective reasoning method for representing epistemic uncertainty, which is closely related to subjective probabil... |
2303.03616 | Van-Thach Do | Van-Thach Do and Quang-Cuong Pham | Geometry-Aware Coverage Path Planning for Depowdering on Complex 3D
Surfaces | 8 pages, 8 figures | IEEE ROBOTICS AND AUTOMATION LETTERS, VOL. 8, NO. 9, SEPTEMBER
2023 | 10.1109/LRA.2023.3296943 | null | cs.RO cs.CG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper presents a new approach to obtaining nearly complete coverage
paths (CP) with low overlapping on 3D general surfaces using mesh models. The
CP is obtained by segmenting the mesh model into a given number of clusters
using constrained centroidal Voronoi tessellation (CCVT) and finding the
shortest path from... | [
{
"created": "Tue, 7 Mar 2023 03:01:26 GMT",
"version": "v1"
},
{
"created": "Mon, 5 Jun 2023 00:55:58 GMT",
"version": "v2"
},
{
"created": "Thu, 8 Jun 2023 01:43:29 GMT",
"version": "v3"
}
] | 2023-10-24 | [
[
"Do",
"Van-Thach",
""
],
[
"Pham",
"Quang-Cuong",
""
]
] | This paper presents a new approach to obtaining nearly complete coverage paths (CP) with low overlapping on 3D general surfaces using mesh models. The CP is obtained by segmenting the mesh model into a given number of clusters using constrained centroidal Voronoi tessellation (CCVT) and finding the shortest path from c... |
2303.00154 | Elena Trunz | Elena Trunz, Jonathan Klein, Jan M\"uller, Lukas Bode, Ralf Sarlette,
Michael Weinmann, Reinhard Klein | Neural inverse procedural modeling of knitting yarns from images | 23 pages, 16 figures | null | null | null | cs.CV | http://creativecommons.org/licenses/by-nc-sa/4.0/ | We investigate the capabilities of neural inverse procedural modeling to
infer high-quality procedural yarn models with fiber-level details from single
images of depicted yarn samples. While directly inferring all parameters of the
underlying yarn model based on a single neural network may seem an intuitive
choice, w... | [
{
"created": "Wed, 1 Mar 2023 00:56:39 GMT",
"version": "v1"
}
] | 2023-03-02 | [
[
"Trunz",
"Elena",
""
],
[
"Klein",
"Jonathan",
""
],
[
"Müller",
"Jan",
""
],
[
"Bode",
"Lukas",
""
],
[
"Sarlette",
"Ralf",
""
],
[
"Weinmann",
"Michael",
""
],
[
"Klein",
"Reinhard",
""
]
] | We investigate the capabilities of neural inverse procedural modeling to infer high-quality procedural yarn models with fiber-level details from single images of depicted yarn samples. While directly inferring all parameters of the underlying yarn model based on a single neural network may seem an intuitive choice, we ... |
2001.06350 | Maira Gatti de Bayser | Maira Gatti de Bayser, Melina Alberio Guerra, Paulo Cavalin, Claudio
Pinhanez | A Hybrid Solution to Learn Turn-Taking in Multi-Party Service-based Chat
Groups | arXiv admin note: text overlap with arXiv:1907.02090 | null | null | null | cs.CL cs.FL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | To predict the next most likely participant to interact in a multi-party
conversation is a difficult problem. In a text-based chat group, the only
information available is the sender, the content of the text and the dialogue
history. In this paper we present our study on how these information can be
used on the predi... | [
{
"created": "Tue, 14 Jan 2020 22:37:21 GMT",
"version": "v1"
}
] | 2020-01-20 | [
[
"de Bayser",
"Maira Gatti",
""
],
[
"Guerra",
"Melina Alberio",
""
],
[
"Cavalin",
"Paulo",
""
],
[
"Pinhanez",
"Claudio",
""
]
] | To predict the next most likely participant to interact in a multi-party conversation is a difficult problem. In a text-based chat group, the only information available is the sender, the content of the text and the dialogue history. In this paper we present our study on how these information can be used on the predict... |
1607.02037 | Parthe Pandit | Parthe Pandit and Ankur A. Kulkarni | Refinement of the Equilibrium of Public Goods Games over Networks:
Efficiency and Effort of Specialized Equilibria | null | Journal of Mathematical Economics, Available online 16 April 2018 | 10.1016/j.jmateco.2018.04.002 | null | cs.GT math.OC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Recently Bramoulle and Kranton presented a model for the provision of public
goods over a network and showed the existence of a class of Nash equilibria
called specialized equilibria wherein some agents exert maximum effort while
other agents free ride. We examine the efficiency, effort and cost of
specialized equili... | [
{
"created": "Thu, 7 Jul 2016 14:51:33 GMT",
"version": "v1"
},
{
"created": "Mon, 24 Jan 2022 04:52:46 GMT",
"version": "v2"
}
] | 2022-01-25 | [
[
"Pandit",
"Parthe",
""
],
[
"Kulkarni",
"Ankur A.",
""
]
] | Recently Bramoulle and Kranton presented a model for the provision of public goods over a network and showed the existence of a class of Nash equilibria called specialized equilibria wherein some agents exert maximum effort while other agents free ride. We examine the efficiency, effort and cost of specialized equilibr... |
2010.08781 | Nick Brown | Ludovic A.R. Capelli, Zhenjiang Hu, Timothy A.K. Zakian, Nick Brown,
J. Mark Bull | iPregel: Vertex-centric programmability vs memory efficiency and
performance, why choose? | null | In Parallel Computing. 2019 Aug 1;86:45-56 | 10.1016/j.parco.2019.04.005 | null | cs.DC | http://creativecommons.org/licenses/by/4.0/ | The vertex-centric programming model, designed to improve the programmability
in graph processing application writing, has attracted great attention over the
years. However, shared memory frameworks that implement the vertex-centric
interface all expose a common tradeoff: programmability against memory
efficiency and... | [
{
"created": "Sat, 17 Oct 2020 12:40:52 GMT",
"version": "v1"
}
] | 2020-10-20 | [
[
"Capelli",
"Ludovic A. R.",
""
],
[
"Hu",
"Zhenjiang",
""
],
[
"Zakian",
"Timothy A. K.",
""
],
[
"Brown",
"Nick",
""
],
[
"Bull",
"J. Mark",
""
]
] | The vertex-centric programming model, designed to improve the programmability in graph processing application writing, has attracted great attention over the years. However, shared memory frameworks that implement the vertex-centric interface all expose a common tradeoff: programmability against memory efficiency and p... |
2205.15918 | Pierre Erbacher | Pierre Erbacher, Ludovic Denoyer, Laure Soulier | Interactive Query Clarification and Refinement via User Simulation | null | null | null | null | cs.IR | http://creativecommons.org/licenses/by/4.0/ | When users initiate search sessions, their queries are often unclear or might
lack of context; this resulting in inefficient document ranking. Multiple
approaches have been proposed by the Information Retrieval community to add
context and retrieve documents aligned with users' intents. While some work
focus on query... | [
{
"created": "Tue, 31 May 2022 16:08:41 GMT",
"version": "v1"
}
] | 2022-06-01 | [
[
"Erbacher",
"Pierre",
""
],
[
"Denoyer",
"Ludovic",
""
],
[
"Soulier",
"Laure",
""
]
] | When users initiate search sessions, their queries are often unclear or might lack of context; this resulting in inefficient document ranking. Multiple approaches have been proposed by the Information Retrieval community to add context and retrieve documents aligned with users' intents. While some work focus on query d... |
2403.02628 | Biqing Qi | Biqing Qi, Xingquan Chen, Junqi Gao, Dong Li, Jianxing Liu, Ligang Wu
and Bowen Zhou | Interactive Continual Learning: Fast and Slow Thinking | Accepted to CVPR 2024 | null | null | null | cs.CV cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Advanced life forms, sustained by the synergistic interaction of neural
cognitive mechanisms, continually acquire and transfer knowledge throughout
their lifespan. In contrast, contemporary machine learning paradigms exhibit
limitations in emulating the facets of continual learning (CL). Nonetheless,
the emergence of... | [
{
"created": "Tue, 5 Mar 2024 03:37:28 GMT",
"version": "v1"
},
{
"created": "Tue, 19 Mar 2024 02:19:52 GMT",
"version": "v2"
}
] | 2024-03-20 | [
[
"Qi",
"Biqing",
""
],
[
"Chen",
"Xingquan",
""
],
[
"Gao",
"Junqi",
""
],
[
"Li",
"Dong",
""
],
[
"Liu",
"Jianxing",
""
],
[
"Wu",
"Ligang",
""
],
[
"Zhou",
"Bowen",
""
]
] | Advanced life forms, sustained by the synergistic interaction of neural cognitive mechanisms, continually acquire and transfer knowledge throughout their lifespan. In contrast, contemporary machine learning paradigms exhibit limitations in emulating the facets of continual learning (CL). Nonetheless, the emergence of l... |
1408.7035 | Elad Michael Schiller (PhD) | Oscar Morales-Ponce and Elad M. Schiller and Paolo Falcone | Cooperation with Disagreement Correction in the Presence of
Communication Failures | Extended version of the paper with the same name that appears in 17th
International IEEE Conference on Intelligent Transportation Systems | null | null | null | cs.DC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Vehicle-to-vehicle communication is a fundamental requirement in cooperative
vehicular systems to achieve high performance while keeping high safety
standards. Vehicles periodically exchange critical information with nearby
vehicles to determine their maneuvers according to the information quality and
established str... | [
{
"created": "Fri, 29 Aug 2014 14:34:00 GMT",
"version": "v1"
},
{
"created": "Thu, 26 Feb 2015 23:00:57 GMT",
"version": "v2"
}
] | 2015-03-02 | [
[
"Morales-Ponce",
"Oscar",
""
],
[
"Schiller",
"Elad M.",
""
],
[
"Falcone",
"Paolo",
""
]
] | Vehicle-to-vehicle communication is a fundamental requirement in cooperative vehicular systems to achieve high performance while keeping high safety standards. Vehicles periodically exchange critical information with nearby vehicles to determine their maneuvers according to the information quality and established strat... |
2006.04489 | Hichem Sahbi | Ahmed Mazari and Hichem Sahbi | Action Recognition with Deep Multiple Aggregation Networks | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Most of the current action recognition algorithms are based on deep networks
which stack multiple convolutional, pooling and fully connected layers. While
convolutional and fully connected operations have been widely studied in the
literature, the design of pooling operations that handle action recognition,
with diff... | [
{
"created": "Mon, 8 Jun 2020 11:37:38 GMT",
"version": "v1"
}
] | 2020-06-09 | [
[
"Mazari",
"Ahmed",
""
],
[
"Sahbi",
"Hichem",
""
]
] | Most of the current action recognition algorithms are based on deep networks which stack multiple convolutional, pooling and fully connected layers. While convolutional and fully connected operations have been widely studied in the literature, the design of pooling operations that handle action recognition, with differ... |
1911.07260 | Yunming Zhang | Yunming Zhang, Ajay Brahmakshatriya, Xinyi Chen, Laxman Dhulipala,
Shoaib Kamil, Saman Amarasinghe, Julian Shun | Optimizing Ordered Graph Algorithms with GraphIt | null | CGO 2020 | null | null | cs.PL cs.DC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Many graph problems can be solved using ordered parallel graph algorithms
that achieve significant speedup over their unordered counterparts by reducing
redundant work. This paper introduces a new priority-based extension to
GraphIt, a domain-specific language for writing graph applications, to simplify
writing high-... | [
{
"created": "Sun, 17 Nov 2019 15:51:02 GMT",
"version": "v1"
},
{
"created": "Sun, 26 Jan 2020 23:37:14 GMT",
"version": "v2"
}
] | 2020-01-28 | [
[
"Zhang",
"Yunming",
""
],
[
"Brahmakshatriya",
"Ajay",
""
],
[
"Chen",
"Xinyi",
""
],
[
"Dhulipala",
"Laxman",
""
],
[
"Kamil",
"Shoaib",
""
],
[
"Amarasinghe",
"Saman",
""
],
[
"Shun",
"Julian",
""
]
] | Many graph problems can be solved using ordered parallel graph algorithms that achieve significant speedup over their unordered counterparts by reducing redundant work. This paper introduces a new priority-based extension to GraphIt, a domain-specific language for writing graph applications, to simplify writing high-pe... |
2407.00706 | Man Shun Ang | Andersen Ang, Waqas Bin Hamed, Hans De Sterck | Sum-of-norms regularized Nonnegative Matrix Factorization | 22 pages, 12 figures | null | null | null | cs.LG math.OC stat.ML | http://creativecommons.org/licenses/by/4.0/ | When applying nonnegative matrix factorization (NMF), generally the rank
parameter is unknown. Such rank in NMF, called the nonnegative rank, is usually
estimated heuristically since computing the exact value of it is NP-hard. In
this work, we propose an approximation method to estimate such rank while
solving NMF on... | [
{
"created": "Sun, 30 Jun 2024 14:16:27 GMT",
"version": "v1"
}
] | 2024-07-02 | [
[
"Ang",
"Andersen",
""
],
[
"Hamed",
"Waqas Bin",
""
],
[
"De Sterck",
"Hans",
""
]
] | When applying nonnegative matrix factorization (NMF), generally the rank parameter is unknown. Such rank in NMF, called the nonnegative rank, is usually estimated heuristically since computing the exact value of it is NP-hard. In this work, we propose an approximation method to estimate such rank while solving NMF on-t... |
2312.09230 | Arthur Conmy | Rhys Gould, Euan Ong, George Ogden, Arthur Conmy | Successor Heads: Recurring, Interpretable Attention Heads In The Wild | 12 main text pages, with appendix | null | null | null | cs.LG cs.AI cs.CL | http://creativecommons.org/licenses/by/4.0/ | In this work we present successor heads: attention heads that increment
tokens with a natural ordering, such as numbers, months, and days. For example,
successor heads increment 'Monday' into 'Tuesday'. We explain the successor
head behavior with an approach rooted in mechanistic interpretability, the
field that aims... | [
{
"created": "Thu, 14 Dec 2023 18:55:47 GMT",
"version": "v1"
}
] | 2023-12-15 | [
[
"Gould",
"Rhys",
""
],
[
"Ong",
"Euan",
""
],
[
"Ogden",
"George",
""
],
[
"Conmy",
"Arthur",
""
]
] | In this work we present successor heads: attention heads that increment tokens with a natural ordering, such as numbers, months, and days. For example, successor heads increment 'Monday' into 'Tuesday'. We explain the successor head behavior with an approach rooted in mechanistic interpretability, the field that aims t... |
2110.01717 | Zhao Xu | Zhao Xu, Youzhi Luo, Xuan Zhang, Xinyi Xu, Yaochen Xie, Meng Liu,
Kaleb Dickerson, Cheng Deng, Maho Nakata, Shuiwang Ji | Molecule3D: A Benchmark for Predicting 3D Geometries from Molecular
Graphs | null | null | null | null | cs.LG cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Graph neural networks are emerging as promising methods for modeling
molecular graphs, in which nodes and edges correspond to atoms and chemical
bonds, respectively. Recent studies show that when 3D molecular geometries,
such as bond lengths and angles, are available, molecular property prediction
tasks can be made m... | [
{
"created": "Thu, 30 Sep 2021 22:09:28 GMT",
"version": "v1"
}
] | 2021-10-06 | [
[
"Xu",
"Zhao",
""
],
[
"Luo",
"Youzhi",
""
],
[
"Zhang",
"Xuan",
""
],
[
"Xu",
"Xinyi",
""
],
[
"Xie",
"Yaochen",
""
],
[
"Liu",
"Meng",
""
],
[
"Dickerson",
"Kaleb",
""
],
[
"Deng",
"Cheng",
... | Graph neural networks are emerging as promising methods for modeling molecular graphs, in which nodes and edges correspond to atoms and chemical bonds, respectively. Recent studies show that when 3D molecular geometries, such as bond lengths and angles, are available, molecular property prediction tasks can be made mor... |
1709.05665 | Kevis-Kokitsi Maninis | Thomas Probst, Kevis-Kokitsi Maninis, Ajad Chhatkuli, Mouloud Ourak,
Emmanuel Vander Poorten, Luc Van Gool | Automatic Tool Landmark Detection for Stereo Vision in Robot-Assisted
Retinal Surgery | Accepted in Robotics and Automation Letters (RA-L). Project page:
http://www.vision.ee.ethz.ch/~kmaninis/keypoints2stereo/index.html | null | null | null | cs.CV cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Computer vision and robotics are being increasingly applied in medical
interventions. Especially in interventions where extreme precision is required
they could make a difference. One such application is robot-assisted retinal
microsurgery. In recent works, such interventions are conducted under a
stereo-microscope, ... | [
{
"created": "Sun, 17 Sep 2017 14:00:26 GMT",
"version": "v1"
},
{
"created": "Mon, 20 Nov 2017 17:59:08 GMT",
"version": "v2"
}
] | 2017-11-22 | [
[
"Probst",
"Thomas",
""
],
[
"Maninis",
"Kevis-Kokitsi",
""
],
[
"Chhatkuli",
"Ajad",
""
],
[
"Ourak",
"Mouloud",
""
],
[
"Poorten",
"Emmanuel Vander",
""
],
[
"Van Gool",
"Luc",
""
]
] | Computer vision and robotics are being increasingly applied in medical interventions. Especially in interventions where extreme precision is required they could make a difference. One such application is robot-assisted retinal microsurgery. In recent works, such interventions are conducted under a stereo-microscope, an... |
1707.09217 | Gerhard Gossen | Gerhard Gossen and Elena Demidova and Thomas Risse | Extracting Event-Centric Document Collections from Large-Scale Web
Archives | To be published in the proceedings of the Conference on Theory and
Practice of Digital Libraries (TPDL) 2017 | null | null | null | cs.DL cs.IR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Web archives are typically very broad in scope and extremely large in scale.
This makes data analysis appear daunting, especially for non-computer
scientists. These collections constitute an increasingly important source for
researchers in the social sciences, the historical sciences and journalists
interested in stu... | [
{
"created": "Fri, 28 Jul 2017 13:18:01 GMT",
"version": "v1"
}
] | 2017-07-31 | [
[
"Gossen",
"Gerhard",
""
],
[
"Demidova",
"Elena",
""
],
[
"Risse",
"Thomas",
""
]
] | Web archives are typically very broad in scope and extremely large in scale. This makes data analysis appear daunting, especially for non-computer scientists. These collections constitute an increasingly important source for researchers in the social sciences, the historical sciences and journalists interested in study... |
2207.09865 | Haipeng Xiong Mr. | Haipeng Xiong and Angela Yao | Discrete-Constrained Regression for Local Counting Models | Accepted by ECCV 2022 | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Local counts, or the number of objects in a local area, is a continuous value
by nature. Yet recent state-of-the-art methods show that formulating counting
as a classification task performs better than regression. Through a series of
experiments on carefully controlled synthetic data, we show that this
counter-intuit... | [
{
"created": "Wed, 20 Jul 2022 12:54:23 GMT",
"version": "v1"
}
] | 2022-07-21 | [
[
"Xiong",
"Haipeng",
""
],
[
"Yao",
"Angela",
""
]
] | Local counts, or the number of objects in a local area, is a continuous value by nature. Yet recent state-of-the-art methods show that formulating counting as a classification task performs better than regression. Through a series of experiments on carefully controlled synthetic data, we show that this counter-intuitiv... |
2106.00943 | Xinyi Zhang | Xinyi Zhang, Keisuke Koyama, Yukiyasu Domae, Weiwei Wan and Kensuke
Harada | A Topological Solution of Entanglement for Complex-shaped Parts in
Robotic Bin-picking | 7 pages | null | null | null | cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper addresses the problem of picking up only one object at a time
avoiding any entanglement in bin-picking. To cope with a difficult case where
the complex-shaped objects are heavily entangled together, we propose a
topology-based method that can generate non-tangle grasp positions on a single
depth image. The... | [
{
"created": "Wed, 2 Jun 2021 05:09:09 GMT",
"version": "v1"
},
{
"created": "Tue, 1 Mar 2022 02:33:02 GMT",
"version": "v2"
}
] | 2022-03-02 | [
[
"Zhang",
"Xinyi",
""
],
[
"Koyama",
"Keisuke",
""
],
[
"Domae",
"Yukiyasu",
""
],
[
"Wan",
"Weiwei",
""
],
[
"Harada",
"Kensuke",
""
]
] | This paper addresses the problem of picking up only one object at a time avoiding any entanglement in bin-picking. To cope with a difficult case where the complex-shaped objects are heavily entangled together, we propose a topology-based method that can generate non-tangle grasp positions on a single depth image. The c... |
2406.13983 | Juan Luque | Juan Luque, Sharmila Duppala, John Dickerson, Aravind Srinivasan | Barter Exchange with Shared Item Valuations | A previous version of this work appeared in the proceedings of WWW
'24 | null | 10.1145/3589334.3645632 | null | cs.DS | http://creativecommons.org/licenses/by-nc-sa/4.0/ | In barter exchanges agents enter seeking to swap their items for other items
on their wishlist. We consider a centralized barter exchange with a set of
agents and items where each item has a positive value. The goal is to compute a
(re)allocation of items maximizing the agents' collective utility subject to
each agen... | [
{
"created": "Thu, 20 Jun 2024 04:23:53 GMT",
"version": "v1"
}
] | 2024-06-21 | [
[
"Luque",
"Juan",
""
],
[
"Duppala",
"Sharmila",
""
],
[
"Dickerson",
"John",
""
],
[
"Srinivasan",
"Aravind",
""
]
] | In barter exchanges agents enter seeking to swap their items for other items on their wishlist. We consider a centralized barter exchange with a set of agents and items where each item has a positive value. The goal is to compute a (re)allocation of items maximizing the agents' collective utility subject to each agent'... |
2308.10610 | Yubiao Yue | Yubiao Yue, Xinyu Zeng, Xiaoqiang Shi, Meiping Zhang, Fan Zhang,
Yunxin Liang, Yan Liu, Zhenzhang Li, Yang Li | Ear-Keeper: Real-time Diagnosis of Ear Lesions Utilizing
Ultralight-Ultrafast ConvNet and Large-scale Ear Endoscopic Dataset | 18 pages,8 figures | null | null | null | cs.CV cs.SE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Deep learning-based ear disease diagnosis technology has proven effective and
affordable. However, due to the lack of ear endoscope datasets with diversity,
the practical potential of the deep learning model has not been thoroughly
studied. Moreover, existing research failed to achieve a good trade-off between
model ... | [
{
"created": "Mon, 21 Aug 2023 10:20:46 GMT",
"version": "v1"
},
{
"created": "Sun, 21 Jan 2024 13:23:10 GMT",
"version": "v2"
},
{
"created": "Tue, 23 Jan 2024 01:48:20 GMT",
"version": "v3"
},
{
"created": "Wed, 10 Apr 2024 08:16:18 GMT",
"version": "v4"
}
] | 2024-04-11 | [
[
"Yue",
"Yubiao",
""
],
[
"Zeng",
"Xinyu",
""
],
[
"Shi",
"Xiaoqiang",
""
],
[
"Zhang",
"Meiping",
""
],
[
"Zhang",
"Fan",
""
],
[
"Liang",
"Yunxin",
""
],
[
"Liu",
"Yan",
""
],
[
"Li",
"Zhenzhan... | Deep learning-based ear disease diagnosis technology has proven effective and affordable. However, due to the lack of ear endoscope datasets with diversity, the practical potential of the deep learning model has not been thoroughly studied. Moreover, existing research failed to achieve a good trade-off between model in... |
2211.01703 | Ke Sun | Ke Sun, Samir M. Perlaza, and Alain Jean-Marie | $2 \times 2$ Zero-Sum Games with Commitments and Noisy Observations | Accepted by 2023 IEEE Int. Symp. on Information Theory (ISIT) | null | null | null | cs.GT cs.IT cs.LG math.IT math.ST stat.ML stat.TH | http://creativecommons.org/licenses/by-nc-nd/4.0/ | In this paper, $2\times2$ zero-sum games are studied under the following
assumptions: $(1)$ One of the players (the leader) commits to choose its
actions by sampling a given probability measure (strategy); $(2)$ The leader
announces its action, which is observed by its opponent (the follower) through
a binary channel... | [
{
"created": "Thu, 3 Nov 2022 10:56:00 GMT",
"version": "v1"
},
{
"created": "Wed, 10 May 2023 00:50:30 GMT",
"version": "v2"
},
{
"created": "Thu, 11 May 2023 08:29:01 GMT",
"version": "v3"
}
] | 2023-05-12 | [
[
"Sun",
"Ke",
""
],
[
"Perlaza",
"Samir M.",
""
],
[
"Jean-Marie",
"Alain",
""
]
] | In this paper, $2\times2$ zero-sum games are studied under the following assumptions: $(1)$ One of the players (the leader) commits to choose its actions by sampling a given probability measure (strategy); $(2)$ The leader announces its action, which is observed by its opponent (the follower) through a binary channel; ... |
1703.08100 | Jiongqian Liang | Jiongqian Liang, Peter Jacobs, Jiankai Sun, Srinivasan Parthasarathy | Semi-supervised Embedding in Attributed Networks with Outliers | in Proceedings of SIAM International Conference on Data Mining
(SDM'18) | null | null | null | cs.SI cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we propose a novel framework, called Semi-supervised Embedding
in Attributed Networks with Outliers (SEANO), to learn a low-dimensional vector
representation that systematically captures the topological proximity,
attribute affinity and label similarity of vertices in a partially labeled
attributed net... | [
{
"created": "Thu, 23 Mar 2017 15:15:53 GMT",
"version": "v1"
},
{
"created": "Fri, 13 Oct 2017 20:51:05 GMT",
"version": "v2"
},
{
"created": "Mon, 5 Mar 2018 19:14:14 GMT",
"version": "v3"
},
{
"created": "Thu, 26 Apr 2018 21:54:52 GMT",
"version": "v4"
}
] | 2018-04-30 | [
[
"Liang",
"Jiongqian",
""
],
[
"Jacobs",
"Peter",
""
],
[
"Sun",
"Jiankai",
""
],
[
"Parthasarathy",
"Srinivasan",
""
]
] | In this paper, we propose a novel framework, called Semi-supervised Embedding in Attributed Networks with Outliers (SEANO), to learn a low-dimensional vector representation that systematically captures the topological proximity, attribute affinity and label similarity of vertices in a partially labeled attributed netwo... |
1304.3083 | Norman C. Dalkey | Norman C. Dalkey | Models vs. Inductive Inference for Dealing With Probabilistic Knowledge | Appears in Proceedings of the Second Conference on Uncertainty in
Artificial Intelligence (UAI1986) | null | null | UAI-P-1986-PG-63-70 | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Two different approaches to dealing with probabilistic knowledge are examined
-models and inductive inference. Examples of the first are: influence diagrams
[1], Bayesian networks [2], log-linear models [3, 4]. Examples of the second
are: games-against nature [5, 6] varieties of maximum-entropy methods [7, 8,
9], and... | [
{
"created": "Wed, 27 Mar 2013 19:51:44 GMT",
"version": "v1"
}
] | 2013-04-12 | [
[
"Dalkey",
"Norman C.",
""
]
] | Two different approaches to dealing with probabilistic knowledge are examined -models and inductive inference. Examples of the first are: influence diagrams [1], Bayesian networks [2], log-linear models [3, 4]. Examples of the second are: games-against nature [5, 6] varieties of maximum-entropy methods [7, 8, 9], and t... |
1307.6649 | Dr. Rajesh Kumar Tiwari | Kumar Gunjan, R. K. Tiwari, G. Sahoo | Towards Securing APIs in Cloud Computing | International Journal of Computer Engineering and Applications, June
2013. arXiv admin note: text overlap with arXiv:0901.0131 by other authors | null | null | null | cs.DC cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Every organisation today wants to adopt cloud computing paradigm and leverage
its various advantages. Today everyone is aware of its characteristics which
have made it so popular and how it can help the organisations focus on their
core activities leaving all IT services development and maintenance to the
cloud servi... | [
{
"created": "Thu, 25 Jul 2013 07:41:44 GMT",
"version": "v1"
}
] | 2013-07-26 | [
[
"Gunjan",
"Kumar",
""
],
[
"Tiwari",
"R. K.",
""
],
[
"Sahoo",
"G.",
""
]
] | Every organisation today wants to adopt cloud computing paradigm and leverage its various advantages. Today everyone is aware of its characteristics which have made it so popular and how it can help the organisations focus on their core activities leaving all IT services development and maintenance to the cloud service... |
1903.09465 | Yuan Cao | Zhuotao Liu and Yuan Cao and Xuewu Zhang and Changping Zhu and Fan
Zhang | Managing Recurrent Virtual Network Updates in Multi-Tenant Datacenters:
A System Perspective | null | null | null | null | cs.CR cs.NI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | With the advent of software-defined networking, network configuration through
programmable interfaces becomes practical, leading to various on-demand
opportunities for network routing update in multi-tenant datacenters, where
tenants have diverse requirements on network routings such as short latency,
low path inflat... | [
{
"created": "Fri, 22 Mar 2019 12:04:02 GMT",
"version": "v1"
},
{
"created": "Thu, 28 Mar 2019 07:45:34 GMT",
"version": "v2"
},
{
"created": "Fri, 29 Mar 2019 11:17:54 GMT",
"version": "v3"
},
{
"created": "Sun, 7 Apr 2019 06:45:38 GMT",
"version": "v4"
},
{
"cr... | 2020-06-19 | [
[
"Liu",
"Zhuotao",
""
],
[
"Cao",
"Yuan",
""
],
[
"Zhang",
"Xuewu",
""
],
[
"Zhu",
"Changping",
""
],
[
"Zhang",
"Fan",
""
]
] | With the advent of software-defined networking, network configuration through programmable interfaces becomes practical, leading to various on-demand opportunities for network routing update in multi-tenant datacenters, where tenants have diverse requirements on network routings such as short latency, low path inflatio... |
2306.13631 | Ayca Takmaz | Ay\c{c}a Takmaz, Elisabetta Fedele, Robert W. Sumner, Marc Pollefeys,
Federico Tombari, Francis Engelmann | OpenMask3D: Open-Vocabulary 3D Instance Segmentation | NeurIPS 2023. Project page: https://openmask3d.github.io/ | NeurIPS 2023 | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We introduce the task of open-vocabulary 3D instance segmentation. Current
approaches for 3D instance segmentation can typically only recognize object
categories from a pre-defined closed set of classes that are annotated in the
training datasets. This results in important limitations for real-world
applications wher... | [
{
"created": "Fri, 23 Jun 2023 17:36:44 GMT",
"version": "v1"
},
{
"created": "Sun, 29 Oct 2023 14:04:25 GMT",
"version": "v2"
}
] | 2023-10-31 | [
[
"Takmaz",
"Ayça",
""
],
[
"Fedele",
"Elisabetta",
""
],
[
"Sumner",
"Robert W.",
""
],
[
"Pollefeys",
"Marc",
""
],
[
"Tombari",
"Federico",
""
],
[
"Engelmann",
"Francis",
""
]
] | We introduce the task of open-vocabulary 3D instance segmentation. Current approaches for 3D instance segmentation can typically only recognize object categories from a pre-defined closed set of classes that are annotated in the training datasets. This results in important limitations for real-world applications where ... |
2312.11774 | Yuze He | Yuze He, Yushi Bai, Matthieu Lin, Jenny Sheng, Yubin Hu, Qi Wang,
Yu-Hui Wen, Yong-Jin Liu | Text-Image Conditioned Diffusion for Consistent Text-to-3D Generation | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | By lifting the pre-trained 2D diffusion models into Neural Radiance Fields
(NeRFs), text-to-3D generation methods have made great progress. Many
state-of-the-art approaches usually apply score distillation sampling (SDS) to
optimize the NeRF representations, which supervises the NeRF optimization with
pre-trained tex... | [
{
"created": "Tue, 19 Dec 2023 01:09:49 GMT",
"version": "v1"
}
] | 2023-12-20 | [
[
"He",
"Yuze",
""
],
[
"Bai",
"Yushi",
""
],
[
"Lin",
"Matthieu",
""
],
[
"Sheng",
"Jenny",
""
],
[
"Hu",
"Yubin",
""
],
[
"Wang",
"Qi",
""
],
[
"Wen",
"Yu-Hui",
""
],
[
"Liu",
"Yong-Jin",
""... | By lifting the pre-trained 2D diffusion models into Neural Radiance Fields (NeRFs), text-to-3D generation methods have made great progress. Many state-of-the-art approaches usually apply score distillation sampling (SDS) to optimize the NeRF representations, which supervises the NeRF optimization with pre-trained text-... |
2206.02597 | Alvari Sepp\"anen | Alvari Sepp\"anen, Eerik Alamikkotervo, Risto Ojala, Giacomo Dario,
Kari Tammi | No GPU? No problem: an ultra fast 3D detection of road users with a
simple proposal generator and energy-based out-of-distribution PointNets | null | null | 10.1186/s40537-023-00859-5 | null | cs.RO cs.SE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper presents a novel architecture for point cloud road user detection,
which is based on a classical point cloud proposal generator approach, that
utilizes simple geometrical rules. New methods are coupled with this technique
to achieve extremely small computational requirement, and mAP that is
comparable to t... | [
{
"created": "Mon, 6 Jun 2022 13:08:22 GMT",
"version": "v1"
}
] | 2024-01-04 | [
[
"Seppänen",
"Alvari",
""
],
[
"Alamikkotervo",
"Eerik",
""
],
[
"Ojala",
"Risto",
""
],
[
"Dario",
"Giacomo",
""
],
[
"Tammi",
"Kari",
""
]
] | This paper presents a novel architecture for point cloud road user detection, which is based on a classical point cloud proposal generator approach, that utilizes simple geometrical rules. New methods are coupled with this technique to achieve extremely small computational requirement, and mAP that is comparable to the... |
2008.03808 | Mohammed Alqahtani | Mohammed Alqahtani, Susan Gauch, Omar Salman, Mohammed Ibrahim, Reem
Al-Saffar | Diverse Group Formation Based on Multiple Demographic Features | null | KDIR, 169-178, 2020 | null | null | cs.IR cs.SI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The goal of group formation is to build a team to accomplish a specific task.
Algorithms are employed to improve the effectiveness of the team so formed and
the efficiency of the group selection process. However, there is concern that
team formation algorithms could be biased against minorities due to the
algorithms ... | [
{
"created": "Sun, 9 Aug 2020 20:15:04 GMT",
"version": "v1"
},
{
"created": "Thu, 3 Dec 2020 06:11:10 GMT",
"version": "v2"
}
] | 2020-12-04 | [
[
"Alqahtani",
"Mohammed",
""
],
[
"Gauch",
"Susan",
""
],
[
"Salman",
"Omar",
""
],
[
"Ibrahim",
"Mohammed",
""
],
[
"Al-Saffar",
"Reem",
""
]
] | The goal of group formation is to build a team to accomplish a specific task. Algorithms are employed to improve the effectiveness of the team so formed and the efficiency of the group selection process. However, there is concern that team formation algorithms could be biased against minorities due to the algorithms th... |
2210.00704 | Yingming Pu | Yingming Pu | Combined Dynamic Virtual Spatiotemporal Graph Mapping for Traffic
Prediction | null | null | null | null | cs.LG cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The continuous expansion of the urban construction scale has recently
contributed to the demand for the dynamics of traffic intersections that are
managed, making adaptive modellings become a hot topic. Existing deep learning
methods are powerful to fit complex heterogeneous graphs. However, they still
have drawbacks... | [
{
"created": "Mon, 3 Oct 2022 04:11:21 GMT",
"version": "v1"
}
] | 2022-10-04 | [
[
"Pu",
"Yingming",
""
]
] | The continuous expansion of the urban construction scale has recently contributed to the demand for the dynamics of traffic intersections that are managed, making adaptive modellings become a hot topic. Existing deep learning methods are powerful to fit complex heterogeneous graphs. However, they still have drawbacks, ... |
1811.07442 | Armon Shariati | Armon Shariati, Bernd Pfrommer, Camillo J. Taylor | Predictive and Semantic Layout Estimation for Robotic Applications in
Manhattan Worlds | null | null | null | null | cs.CV cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper describes an approach to automatically extracting floor plans from
the kinds of incomplete measurements that could be acquired by an autonomous
mobile robot. The approach proceeds by reasoning about extended structural
layout surfaces which are automatically extracted from the available data. The
scheme ca... | [
{
"created": "Mon, 19 Nov 2018 00:49:54 GMT",
"version": "v1"
}
] | 2018-11-20 | [
[
"Shariati",
"Armon",
""
],
[
"Pfrommer",
"Bernd",
""
],
[
"Taylor",
"Camillo J.",
""
]
] | This paper describes an approach to automatically extracting floor plans from the kinds of incomplete measurements that could be acquired by an autonomous mobile robot. The approach proceeds by reasoning about extended structural layout surfaces which are automatically extracted from the available data. The scheme can ... |
1808.08429 | Ines Dutra | Carla Silva, In\^es Dutra, Marcus S. Dahlem | Driven tabu search: a quantum inherent optimisation | 6 pages | null | null | null | cs.ET quant-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Quantum computers are different from binary digital electronic computers
based on transistors. Common digital computing encodes the data into binary
digits (bits), each of which is always in one of two definite states (0 or 1),
quantum computation uses quantum bits (qubits). A circuit-based qubit quantum
computer exi... | [
{
"created": "Sat, 25 Aug 2018 13:49:27 GMT",
"version": "v1"
}
] | 2018-08-28 | [
[
"Silva",
"Carla",
""
],
[
"Dutra",
"Inês",
""
],
[
"Dahlem",
"Marcus S.",
""
]
] | Quantum computers are different from binary digital electronic computers based on transistors. Common digital computing encodes the data into binary digits (bits), each of which is always in one of two definite states (0 or 1), quantum computation uses quantum bits (qubits). A circuit-based qubit quantum computer exist... |
2402.13973 | Jiahao Zhang | Jiahao Zhang, Rui Xue, Wenqi Fan, Xin Xu, Qing Li, Jian Pei, Xiaorui
Liu | Linear-Time Graph Neural Networks for Scalable Recommendations | 12 pages, 5 figures, accepted by The Web Conference 2024 | null | null | null | cs.IR cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In an era of information explosion, recommender systems are vital tools to
deliver personalized recommendations for users. The key of recommender systems
is to forecast users' future behaviors based on previous user-item
interactions. Due to their strong expressive power of capturing high-order
connectivities in user... | [
{
"created": "Wed, 21 Feb 2024 17:58:10 GMT",
"version": "v1"
}
] | 2024-02-22 | [
[
"Zhang",
"Jiahao",
""
],
[
"Xue",
"Rui",
""
],
[
"Fan",
"Wenqi",
""
],
[
"Xu",
"Xin",
""
],
[
"Li",
"Qing",
""
],
[
"Pei",
"Jian",
""
],
[
"Liu",
"Xiaorui",
""
]
] | In an era of information explosion, recommender systems are vital tools to deliver personalized recommendations for users. The key of recommender systems is to forecast users' future behaviors based on previous user-item interactions. Due to their strong expressive power of capturing high-order connectivities in user-i... |
2212.06436 | Thomas Werthenbach | Thomas Werthenbach and Johan Pouwelse | Survey on social reputation mechanisms: Someone told me I can trust you | 10 pages, 3 figures, 1 table | null | null | null | cs.DC | http://creativecommons.org/licenses/by/4.0/ | Nowadays, most business and social interactions have moved to the internet,
highlighting the relevance of creating online trust. One way to obtain a
measure of trust is through reputation mechanisms, which record one's past
performance and interactions to generate a reputational value. We observe that
numerous existi... | [
{
"created": "Tue, 13 Dec 2022 08:57:42 GMT",
"version": "v1"
}
] | 2022-12-14 | [
[
"Werthenbach",
"Thomas",
""
],
[
"Pouwelse",
"Johan",
""
]
] | Nowadays, most business and social interactions have moved to the internet, highlighting the relevance of creating online trust. One way to obtain a measure of trust is through reputation mechanisms, which record one's past performance and interactions to generate a reputational value. We observe that numerous existing... |
1911.07486 | Max Maass | Mikhail Fomichev, Max Maass, Matthias Hollick | Zero-Interaction Security -- Towards Sound Experimental Validation | 6 Pages. Companion article to arXiv:1901.07255 [cs.CR], dataset at
https://zenodo.org/record/2537721 | ACM GetMobile, Vol. 23 Issue 2 (June 2019), p. 16-21 | 10.1145/3372300.3372304 | null | cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Reproducibility and realistic datasets are crucial for advancing research.
Unfortunately, they are often neglected as valid scientific contributions in
many young disciplines, with computer science being no exception. In this
article, we show the challenges encountered when reproducing the work of
others, collecting ... | [
{
"created": "Mon, 18 Nov 2019 08:46:49 GMT",
"version": "v1"
}
] | 2019-11-19 | [
[
"Fomichev",
"Mikhail",
""
],
[
"Maass",
"Max",
""
],
[
"Hollick",
"Matthias",
""
]
] | Reproducibility and realistic datasets are crucial for advancing research. Unfortunately, they are often neglected as valid scientific contributions in many young disciplines, with computer science being no exception. In this article, we show the challenges encountered when reproducing the work of others, collecting re... |
1807.05987 | Svitlana Lytvynova H | Svitlana Lytvynova and Oksana Melnyk | Professional Development of Teachers Using Cloud Services During
Non-formal Education | null | null | null | null | cs.CY | http://creativecommons.org/publicdomain/zero/1.0/ | The rapid development of cloud services and their implementation in secondary
education require an increase in the IC-competence of teachers during
non-formal education. The implementation of cloud services will make it
possible to create some conditions for learning mobility of all participants of
teaching and learn... | [
{
"created": "Mon, 16 Jul 2018 17:39:01 GMT",
"version": "v1"
}
] | 2018-07-17 | [
[
"Lytvynova",
"Svitlana",
""
],
[
"Melnyk",
"Oksana",
""
]
] | The rapid development of cloud services and their implementation in secondary education require an increase in the IC-competence of teachers during non-formal education. The implementation of cloud services will make it possible to create some conditions for learning mobility of all participants of teaching and learnin... |
1505.05958 | Zhenyu Shen | Jingyu Hua, Zhenyu Shen, Sheng Zhong | We Can Track You If You Take the Metro: Tracking Metro Riders Using
Accelerometers on Smartphones | null | null | null | null | cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Motion sensors (e.g., accelerometers) on smartphones have been demonstrated
to be a powerful side channel for attackers to spy on users' inputs on
touchscreen. In this paper, we reveal another motion accelerometer-based attack
which is particularly serious: when a person takes the metro, a malicious
application on he... | [
{
"created": "Fri, 22 May 2015 05:59:55 GMT",
"version": "v1"
}
] | 2015-05-25 | [
[
"Hua",
"Jingyu",
""
],
[
"Shen",
"Zhenyu",
""
],
[
"Zhong",
"Sheng",
""
]
] | Motion sensors (e.g., accelerometers) on smartphones have been demonstrated to be a powerful side channel for attackers to spy on users' inputs on touchscreen. In this paper, we reveal another motion accelerometer-based attack which is particularly serious: when a person takes the metro, a malicious application on her ... |
2105.07444 | Ramakrishnan Raman | Ramakrishnan Raman, Meenakshi D'Souza | Knowledge Value Stream Framework For Complex Product Design Decisions | 31 pages, 25 Figures. A preliminary version of this work was
presented in 2017 IEEE Technology & Engineering Management Conference
(TEMSCON), which took place on June 8-10, 2017 in Santa Clara County, CA,
USA. Subsequently, the work has significantly evolved, expanded in scope and
progressed to its present form... | null | null | null | cs.SI | http://creativecommons.org/licenses/by/4.0/ | Product Development value stream includes all the activities, value added and
non value added, for designing and developing a product. It is characterized by
flow of knowledge that drives the decisions, and deals with how the product is
conceptualized, architected and designed by the design teams. The intangible
flow... | [
{
"created": "Sun, 16 May 2021 14:38:12 GMT",
"version": "v1"
}
] | 2021-05-18 | [
[
"Raman",
"Ramakrishnan",
""
],
[
"D'Souza",
"Meenakshi",
""
]
] | Product Development value stream includes all the activities, value added and non value added, for designing and developing a product. It is characterized by flow of knowledge that drives the decisions, and deals with how the product is conceptualized, architected and designed by the design teams. The intangible flow o... |
2208.05315 | YiSong Yu | Yisong Yu, Beihong Jin, Jiageng Song, Beibei Li, Yiyuan Zheng, and Wei
Zhu | Improving Micro-video Recommendation by Controlling Position Bias | accepted by ECML PKDD2022 | null | null | null | cs.IR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | As the micro-video apps become popular, the numbers of micro-videos and users
increase rapidly, which highlights the importance of micro-video
recommendation. Although the micro-video recommendation can be naturally
treated as the sequential recommendation, the previous sequential
recommendation models do not fully c... | [
{
"created": "Tue, 9 Aug 2022 11:58:57 GMT",
"version": "v1"
}
] | 2022-08-11 | [
[
"Yu",
"Yisong",
""
],
[
"Jin",
"Beihong",
""
],
[
"Song",
"Jiageng",
""
],
[
"Li",
"Beibei",
""
],
[
"Zheng",
"Yiyuan",
""
],
[
"Zhu",
"Wei",
""
]
] | As the micro-video apps become popular, the numbers of micro-videos and users increase rapidly, which highlights the importance of micro-video recommendation. Although the micro-video recommendation can be naturally treated as the sequential recommendation, the previous sequential recommendation models do not fully con... |
2212.08397 | Tulasimohan Molli | Prahladh Harsha, Tulasi mohan Molli, Ashutosh Shankar | Criticality of $\text{AC}^0$ formulae | null | null | null | null | cs.CC | http://creativecommons.org/licenses/by/4.0/ | Rossman [In $\textit{Proc. $34$th Comput. Complexity Conf.}$, 2019]
introduced the notion of $\textit{criticality}$. The criticality of a Boolean
function $f : \{0,1\}^n \to \{0,1\}$ is the minimum $\lambda \geq 1$ such that
for all positive integers $t$, \[ \Pr_{\rho \sim
\mathcal{R}_p}\left[\text{DT}_{\text{depth}}... | [
{
"created": "Fri, 16 Dec 2022 10:41:04 GMT",
"version": "v1"
},
{
"created": "Wed, 21 Dec 2022 05:52:30 GMT",
"version": "v2"
},
{
"created": "Thu, 5 Jan 2023 04:38:50 GMT",
"version": "v3"
}
] | 2023-01-06 | [
[
"Harsha",
"Prahladh",
""
],
[
"Molli",
"Tulasi mohan",
""
],
[
"Shankar",
"Ashutosh",
""
]
] | Rossman [In $\textit{Proc. $34$th Comput. Complexity Conf.}$, 2019] introduced the notion of $\textit{criticality}$. The criticality of a Boolean function $f : \{0,1\}^n \to \{0,1\}$ is the minimum $\lambda \geq 1$ such that for all positive integers $t$, \[ \Pr_{\rho \sim \mathcal{R}_p}\left[\text{DT}_{\text{depth}}(f... |
1902.03439 | Toke H{\o}iland-J{\o}rgensen | Toke H{\o}iland-J{\o}rgensen, Per Hurtig and Anna Brunstrom | PoliFi: Airtime Policy Enforcement for WiFi | null | null | null | null | cs.NI | http://creativecommons.org/licenses/by-sa/4.0/ | As WiFi grows ever more popular, airtime contention becomes an increasing
problem. One way to alleviate this is through network policy enforcement.
Unfortunately, WiFi lacks protocol support for configuring policies for its
usage, and since network-wide coordination cannot generally be ensured,
enforcing policy is ch... | [
{
"created": "Sat, 9 Feb 2019 16:29:22 GMT",
"version": "v1"
}
] | 2019-02-12 | [
[
"Høiland-Jørgensen",
"Toke",
""
],
[
"Hurtig",
"Per",
""
],
[
"Brunstrom",
"Anna",
""
]
] | As WiFi grows ever more popular, airtime contention becomes an increasing problem. One way to alleviate this is through network policy enforcement. Unfortunately, WiFi lacks protocol support for configuring policies for its usage, and since network-wide coordination cannot generally be ensured, enforcing policy is chal... |
1110.0550 | Sunil Khatri | Pey-Chang Kent Lin, Ayan Mandal, Sunil P Khatri | Boolean Satisfiability using Noise Based Logic | 6 pages, 1 figure | null | null | null | cs.CC cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we present a novel algorithm to solve the Boolean
Satisfiability (SAT) problem, using noise-based logic (NBL). Contrary to what
the name may suggest, NBL is not a random/fuzzy logic system. In fact, it is a
completely deterministic logic system. A key property of NBL is that it allows
us to apply a sup... | [
{
"created": "Tue, 4 Oct 2011 00:32:40 GMT",
"version": "v1"
}
] | 2011-10-05 | [
[
"Lin",
"Pey-Chang Kent",
""
],
[
"Mandal",
"Ayan",
""
],
[
"Khatri",
"Sunil P",
""
]
] | In this paper, we present a novel algorithm to solve the Boolean Satisfiability (SAT) problem, using noise-based logic (NBL). Contrary to what the name may suggest, NBL is not a random/fuzzy logic system. In fact, it is a completely deterministic logic system. A key property of NBL is that it allows us to apply a super... |
2310.20327 | Guoliang Lin | Guoliang Lin, Hanjiang Lai, Yan Pan, Jian Yin | Improving Entropy-Based Test-Time Adaptation from a Clustering View | null | null | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Domain shift is a common problem in the realistic world, where training data
and test data follow different data distributions. To deal with this problem,
fully test-time adaptation (TTA) leverages the unlabeled data encountered
during test time to adapt the model. In particular, entropy-based TTA (EBTTA)
methods, wh... | [
{
"created": "Tue, 31 Oct 2023 10:10:48 GMT",
"version": "v1"
},
{
"created": "Mon, 6 Nov 2023 14:47:30 GMT",
"version": "v2"
},
{
"created": "Tue, 7 Nov 2023 04:03:13 GMT",
"version": "v3"
},
{
"created": "Sat, 18 Nov 2023 06:14:05 GMT",
"version": "v4"
},
{
"cre... | 2024-04-29 | [
[
"Lin",
"Guoliang",
""
],
[
"Lai",
"Hanjiang",
""
],
[
"Pan",
"Yan",
""
],
[
"Yin",
"Jian",
""
]
] | Domain shift is a common problem in the realistic world, where training data and test data follow different data distributions. To deal with this problem, fully test-time adaptation (TTA) leverages the unlabeled data encountered during test time to adapt the model. In particular, entropy-based TTA (EBTTA) methods, whic... |
1311.6883 | Chaitanya Swamy | Hadi Minooei and Chaitanya Swamy | Near-Optimal and Robust Mechanism Design for Covering Problems with
Correlated Players | Major changes compared to the previous version. Please consult this
version | null | null | null | cs.GT cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We consider the problem of designing incentive-compatible, ex-post
individually rational (IR) mechanisms for covering problems in the Bayesian
setting, where players' types are drawn from an underlying distribution and may
be correlated, and the goal is to minimize the expected total payment made by
the mechanism. We... | [
{
"created": "Wed, 27 Nov 2013 07:20:32 GMT",
"version": "v1"
},
{
"created": "Thu, 29 Sep 2016 04:57:27 GMT",
"version": "v2"
}
] | 2016-09-30 | [
[
"Minooei",
"Hadi",
""
],
[
"Swamy",
"Chaitanya",
""
]
] | We consider the problem of designing incentive-compatible, ex-post individually rational (IR) mechanisms for covering problems in the Bayesian setting, where players' types are drawn from an underlying distribution and may be correlated, and the goal is to minimize the expected total payment made by the mechanism. We f... |
2006.11569 | Haiping Huang | Jianwen Zhou, and Haiping Huang | Weakly-correlated synapses promote dimension reduction in deep neural
networks | 21 pages, 8 figures | Phys. Rev. E 103, 012315 (2021) | 10.1103/PhysRevE.103.012315 | null | cs.LG cond-mat.dis-nn cond-mat.stat-mech q-bio.NC stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | By controlling synaptic and neural correlations, deep learning has achieved
empirical successes in improving classification performances. How synaptic
correlations affect neural correlations to produce disentangled hidden
representations remains elusive. Here we propose a simplified model of
dimension reduction, taki... | [
{
"created": "Sat, 20 Jun 2020 13:11:37 GMT",
"version": "v1"
}
] | 2021-02-02 | [
[
"Zhou",
"Jianwen",
""
],
[
"Huang",
"Haiping",
""
]
] | By controlling synaptic and neural correlations, deep learning has achieved empirical successes in improving classification performances. How synaptic correlations affect neural correlations to produce disentangled hidden representations remains elusive. Here we propose a simplified model of dimension reduction, taking... |
2303.10325 | Guandong Li | Guandong Li, Xian Yang | Smartbanner: Intelligent banner design framework that strikes a balance
between creative freedom and design rules | null | Published 23 November 2022 Art Multimedia Tools and Applications | 10.1007/s11042-022-14138-7 | null | cs.HC cs.MM | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Companies use banners extensively to promote their products, and the
intelligent automatic synthesis of banners is a challenging event. Under the
premise of inputting only a small amount of information such as product, text
and size, it can synthesize styles with high freedom and richness, but at the
same time, it mu... | [
{
"created": "Sat, 18 Mar 2023 04:01:53 GMT",
"version": "v1"
}
] | 2023-03-21 | [
[
"Li",
"Guandong",
""
],
[
"Yang",
"Xian",
""
]
] | Companies use banners extensively to promote their products, and the intelligent automatic synthesis of banners is a challenging event. Under the premise of inputting only a small amount of information such as product, text and size, it can synthesize styles with high freedom and richness, but at the same time, it must... |
2112.02082 | Zheng Dong | Zheng Dong, Ke Xu, Ziheng Duan, Hujun Bao, Weiwei Xu, Rynson W.H. Lau | Geometry-aware Two-scale PIFu Representation for Human Reconstruction | Accepted by NeurIPS 2022. 20 pages, 20 figures | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Although PIFu-based 3D human reconstruction methods are popular, the quality
of recovered details is still unsatisfactory. In a sparse (e.g., 3 RGBD
sensors) capture setting, the depth noise is typically amplified in the PIFu
representation, resulting in flat facial surfaces and geometry-fallible bodies.
In this pape... | [
{
"created": "Fri, 3 Dec 2021 18:46:49 GMT",
"version": "v1"
},
{
"created": "Tue, 27 Sep 2022 08:30:11 GMT",
"version": "v2"
}
] | 2022-09-28 | [
[
"Dong",
"Zheng",
""
],
[
"Xu",
"Ke",
""
],
[
"Duan",
"Ziheng",
""
],
[
"Bao",
"Hujun",
""
],
[
"Xu",
"Weiwei",
""
],
[
"Lau",
"Rynson W. H.",
""
]
] | Although PIFu-based 3D human reconstruction methods are popular, the quality of recovered details is still unsatisfactory. In a sparse (e.g., 3 RGBD sensors) capture setting, the depth noise is typically amplified in the PIFu representation, resulting in flat facial surfaces and geometry-fallible bodies. In this paper,... |
2402.14269 | Jihyeok Jung | Jihyeok Jung, Chan-Oi Song, Deok-Joo Lee, Kiho Yoon | Optimal Mechanism in a Dynamic Stochastic Knapsack Environment | 8 pages, 1 figures, presented in AAAI 38th conference on Artificial
Intelligence | null | null | null | cs.GT econ.GN q-fin.EC | http://creativecommons.org/licenses/by/4.0/ | This study introduces an optimal mechanism in a dynamic stochastic knapsack
environment. The model features a single seller who has a fixed quantity of a
perfectly divisible item. Impatient buyers with a piece-wise linear utility
function arrive randomly and they report the two-dimensional private
information: margin... | [
{
"created": "Thu, 22 Feb 2024 04:08:31 GMT",
"version": "v1"
}
] | 2024-02-23 | [
[
"Jung",
"Jihyeok",
""
],
[
"Song",
"Chan-Oi",
""
],
[
"Lee",
"Deok-Joo",
""
],
[
"Yoon",
"Kiho",
""
]
] | This study introduces an optimal mechanism in a dynamic stochastic knapsack environment. The model features a single seller who has a fixed quantity of a perfectly divisible item. Impatient buyers with a piece-wise linear utility function arrive randomly and they report the two-dimensional private information: marginal... |
1806.01353 | Scott Lee | Scott Lee | Natural Language Generation for Electronic Health Records | null | null | 10.1038/s41746-018-0070-0 | null | cs.CL cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A variety of methods existing for generating synthetic electronic health
records (EHRs), but they are not capable of generating unstructured text, like
emergency department (ED) chief complaints, history of present illness or
progress notes. Here, we use the encoder-decoder model, a deep learning
algorithm that featu... | [
{
"created": "Fri, 1 Jun 2018 12:01:48 GMT",
"version": "v1"
}
] | 2018-12-18 | [
[
"Lee",
"Scott",
""
]
] | A variety of methods existing for generating synthetic electronic health records (EHRs), but they are not capable of generating unstructured text, like emergency department (ED) chief complaints, history of present illness or progress notes. Here, we use the encoder-decoder model, a deep learning algorithm that feature... |
1412.6564 | Chris J. Maddison | Chris J. Maddison, Aja Huang, Ilya Sutskever, David Silver | Move Evaluation in Go Using Deep Convolutional Neural Networks | Minor edits and included captures in Figure 2 | null | null | null | cs.LG cs.NE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The game of Go is more challenging than other board games, due to the
difficulty of constructing a position or move evaluation function. In this
paper we investigate whether deep convolutional networks can be used to
directly represent and learn this knowledge. We train a large 12-layer
convolutional neural network b... | [
{
"created": "Sat, 20 Dec 2014 00:31:30 GMT",
"version": "v1"
},
{
"created": "Fri, 10 Apr 2015 19:03:34 GMT",
"version": "v2"
}
] | 2015-04-13 | [
[
"Maddison",
"Chris J.",
""
],
[
"Huang",
"Aja",
""
],
[
"Sutskever",
"Ilya",
""
],
[
"Silver",
"David",
""
]
] | The game of Go is more challenging than other board games, due to the difficulty of constructing a position or move evaluation function. In this paper we investigate whether deep convolutional networks can be used to directly represent and learn this knowledge. We train a large 12-layer convolutional neural network by ... |
2108.06608 | Simon Bultmann | Simon Bultmann, Jan Quenzel and Sven Behnke | Real-Time Multi-Modal Semantic Fusion on Unmanned Aerial Vehicles | Accepted for: 10th European Conference on Mobile Robots (ECMR), Bonn,
Germany, September 2021 | null | null | null | cs.CV cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Unmanned aerial vehicles (UAVs) equipped with multiple complementary sensors
have tremendous potential for fast autonomous or remote-controlled semantic
scene analysis, e.g., for disaster examination. In this work, we propose a UAV
system for real-time semantic inference and fusion of multiple sensor
modalities. Sema... | [
{
"created": "Sat, 14 Aug 2021 20:16:08 GMT",
"version": "v1"
}
] | 2021-08-17 | [
[
"Bultmann",
"Simon",
""
],
[
"Quenzel",
"Jan",
""
],
[
"Behnke",
"Sven",
""
]
] | Unmanned aerial vehicles (UAVs) equipped with multiple complementary sensors have tremendous potential for fast autonomous or remote-controlled semantic scene analysis, e.g., for disaster examination. In this work, we propose a UAV system for real-time semantic inference and fusion of multiple sensor modalities. Semant... |
1710.08679 | Takuma Yamaguchi | Takuma Yamaguchi (1), Kohei Fujita (1 and 2), Tsuyoshi Ichimura (1 and
2), Muneo Hori (1 and 2), Maddegedara Lalith (1 and 2) and Kengo Nakajima (3)
((1) Earthquake Research Institute and Department of Civil Engineering, The
University of Tokyo, (2) Advanced Institute for Computational Science, RIKEN,
(3) Infor... | Implicit Low-Order Unstructured Finite-Element Multiple Simulation
Enhanced by Dense Computation using OpenACC | 18 pages, 10 figures, accepted for WACCPD2017 | null | null | null | cs.DC cs.MS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we develop a low-order three-dimensional finite-element solver
for fast multiple-case crust deformation analysis on GPU-based systems. Based
on a high-performance solver designed for massively parallel CPU based systems,
we modify the algorithm to reduce random data access, and then insert OpenACC
dire... | [
{
"created": "Tue, 24 Oct 2017 09:51:31 GMT",
"version": "v1"
}
] | 2017-10-25 | [
[
"Yamaguchi",
"Takuma",
"",
"1 and 2"
],
[
"Fujita",
"Kohei",
"",
"1 and 2"
],
[
"Ichimura",
"Tsuyoshi",
"",
"1 and\n 2"
],
[
"Hori",
"Muneo",
"",
"1 and 2"
],
[
"Lalith",
"Maddegedara",
"",
"1 and 2"
],
[
"Nak... | In this paper, we develop a low-order three-dimensional finite-element solver for fast multiple-case crust deformation analysis on GPU-based systems. Based on a high-performance solver designed for massively parallel CPU based systems, we modify the algorithm to reduce random data access, and then insert OpenACC direct... |
2310.04863 | Yangze Li | Yangze Li, Fan Yu, Yuhao Liang, Pengcheng Guo, Mohan Shi, Zhihao Du,
Shiliang Zhang, Lei Xie | SA-Paraformer: Non-autoregressive End-to-End Speaker-Attributed ASR | null | null | null | null | cs.SD eess.AS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Joint modeling of multi-speaker ASR and speaker diarization has recently
shown promising results in speaker-attributed automatic speech recognition
(SA-ASR).Although being able to obtain state-of-the-art (SOTA) performance,
most of the studies are based on an autoregressive (AR) decoder which generates
tokens one-by-... | [
{
"created": "Sat, 7 Oct 2023 16:07:42 GMT",
"version": "v1"
}
] | 2023-10-10 | [
[
"Li",
"Yangze",
""
],
[
"Yu",
"Fan",
""
],
[
"Liang",
"Yuhao",
""
],
[
"Guo",
"Pengcheng",
""
],
[
"Shi",
"Mohan",
""
],
[
"Du",
"Zhihao",
""
],
[
"Zhang",
"Shiliang",
""
],
[
"Xie",
"Lei",
... | Joint modeling of multi-speaker ASR and speaker diarization has recently shown promising results in speaker-attributed automatic speech recognition (SA-ASR).Although being able to obtain state-of-the-art (SOTA) performance, most of the studies are based on an autoregressive (AR) decoder which generates tokens one-by-on... |
2407.12818 | Dishank Aggarwal | Dishank Aggarwal, Pushpak Bhattacharyya, Bhaskaran Raman | "I understand why I got this grade": Automatic Short Answer Grading with
Feedback | null | null | null | null | cs.CL cs.AI cs.CY | http://creativecommons.org/licenses/by/4.0/ | The demand for efficient and accurate assessment methods has intensified as
education systems transition to digital platforms. Providing feedback is
essential in educational settings and goes beyond simply conveying marks as it
justifies the assigned marks. In this context, we present a significant
advancement in aut... | [
{
"created": "Sun, 30 Jun 2024 15:42:18 GMT",
"version": "v1"
}
] | 2024-07-19 | [
[
"Aggarwal",
"Dishank",
""
],
[
"Bhattacharyya",
"Pushpak",
""
],
[
"Raman",
"Bhaskaran",
""
]
] | The demand for efficient and accurate assessment methods has intensified as education systems transition to digital platforms. Providing feedback is essential in educational settings and goes beyond simply conveying marks as it justifies the assigned marks. In this context, we present a significant advancement in autom... |
2312.03420 | Yingyan Xu | Yingyan Xu, Prashanth Chandran, Sebastian Weiss, Markus Gross, Gaspard
Zoss, Derek Bradley | Artist-Friendly Relightable and Animatable Neural Heads | null | null | null | null | cs.CV cs.GR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | An increasingly common approach for creating photo-realistic digital avatars
is through the use of volumetric neural fields. The original neural radiance
field (NeRF) allowed for impressive novel view synthesis of static heads when
trained on a set of multi-view images, and follow up methods showed that these
neural ... | [
{
"created": "Wed, 6 Dec 2023 11:06:46 GMT",
"version": "v1"
}
] | 2023-12-07 | [
[
"Xu",
"Yingyan",
""
],
[
"Chandran",
"Prashanth",
""
],
[
"Weiss",
"Sebastian",
""
],
[
"Gross",
"Markus",
""
],
[
"Zoss",
"Gaspard",
""
],
[
"Bradley",
"Derek",
""
]
] | An increasingly common approach for creating photo-realistic digital avatars is through the use of volumetric neural fields. The original neural radiance field (NeRF) allowed for impressive novel view synthesis of static heads when trained on a set of multi-view images, and follow up methods showed that these neural re... |
2205.06773 | Daniel Casini | Daniel Casini, Paolo Pazzaglia, Alessandro Biondi, Marco Di Natale | Optimized Partitioning and Priority Assignment of Real-Time Applications
on Heterogeneous Platforms with Hardware Acceleration | null | Journal of Systems Architecture, Volume 124, March 2022, 102416 | 10.1016/j.sysarc.2022.102416 | null | cs.DC | http://creativecommons.org/licenses/by-nc-nd/4.0/ | Hardware accelerators, such as those based on GPUs and FPGAs, offer an
excellent opportunity to efficiently parallelize functionalities. Recently,
modern embedded platforms started being equipped with such accelerators,
resulting in a compelling choice for emerging, highly computational intensive
workloads, like thos... | [
{
"created": "Tue, 19 Apr 2022 15:26:52 GMT",
"version": "v1"
}
] | 2022-05-16 | [
[
"Casini",
"Daniel",
""
],
[
"Pazzaglia",
"Paolo",
""
],
[
"Biondi",
"Alessandro",
""
],
[
"Di Natale",
"Marco",
""
]
] | Hardware accelerators, such as those based on GPUs and FPGAs, offer an excellent opportunity to efficiently parallelize functionalities. Recently, modern embedded platforms started being equipped with such accelerators, resulting in a compelling choice for emerging, highly computational intensive workloads, like those ... |
2105.06270 | Chen-Chen Fan | Chen-Chen Fan, Haiqun Xie, Liang Peng, Hongjun Yang, Zhen-Liang Ni,
Guan'an Wang, Yan-Jie Zhou, Sheng Chen, Zhijie Fang, Shuyun Huang, Zeng-Guang
Hou | Group Feature Learning and Domain Adversarial Neural Network for aMCI
Diagnosis System Based on EEG | This paper has been accepted by 2021 International Conference on
Robotics and Automation (ICRA 2021) | null | null | null | cs.LG cs.RO eess.SP | http://creativecommons.org/licenses/by/4.0/ | Medical diagnostic robot systems have been paid more and more attention due
to its objectivity and accuracy. The diagnosis of mild cognitive impairment
(MCI) is considered an effective means to prevent Alzheimer's disease (AD).
Doctors diagnose MCI based on various clinical examinations, which are
expensive and the d... | [
{
"created": "Wed, 28 Apr 2021 08:08:32 GMT",
"version": "v1"
}
] | 2021-05-14 | [
[
"Fan",
"Chen-Chen",
""
],
[
"Xie",
"Haiqun",
""
],
[
"Peng",
"Liang",
""
],
[
"Yang",
"Hongjun",
""
],
[
"Ni",
"Zhen-Liang",
""
],
[
"Wang",
"Guan'an",
""
],
[
"Zhou",
"Yan-Jie",
""
],
[
"Chen",
... | Medical diagnostic robot systems have been paid more and more attention due to its objectivity and accuracy. The diagnosis of mild cognitive impairment (MCI) is considered an effective means to prevent Alzheimer's disease (AD). Doctors diagnose MCI based on various clinical examinations, which are expensive and the dia... |
1301.1465 | Carlo Condo | Carlo Condo and Amer Baghdadi and Guido Masera | A joint communication and application simulator for NoC-based SoCs | Withdrawn, due to extended and revised version being published | null | null | null | cs.AR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | NoCs have become a widespread paradigm in the system-on-chip design world,
not only for multi-purpose SoCs, but also for application-specific ICs. The
common approach in the NoC design world is to separate the design of the
interconnection from the design of the processing elements: this is well suited
for a large nu... | [
{
"created": "Tue, 8 Jan 2013 09:59:28 GMT",
"version": "v1"
},
{
"created": "Fri, 31 May 2013 11:09:16 GMT",
"version": "v2"
}
] | 2013-06-03 | [
[
"Condo",
"Carlo",
""
],
[
"Baghdadi",
"Amer",
""
],
[
"Masera",
"Guido",
""
]
] | NoCs have become a widespread paradigm in the system-on-chip design world, not only for multi-purpose SoCs, but also for application-specific ICs. The common approach in the NoC design world is to separate the design of the interconnection from the design of the processing elements: this is well suited for a large numb... |
1505.01617 | Dengji Zhao | Dengji Zhao and Sarvapali D. Ramchurn and Nicholas R. Jennings | Incentive Design for Ridesharing with Uncertainty | 13 pages | null | null | null | cs.GT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We consider a ridesharing problem where there is uncertainty about the
completion of trips from both drivers and riders. Specifically, we study
ridesharing mechanisms that aim to incentivize commuters to reveal their
valuation for trips and their probability of undertaking their trips. Due to
the interdependence crea... | [
{
"created": "Thu, 7 May 2015 08:14:25 GMT",
"version": "v1"
}
] | 2015-05-08 | [
[
"Zhao",
"Dengji",
""
],
[
"Ramchurn",
"Sarvapali D.",
""
],
[
"Jennings",
"Nicholas R.",
""
]
] | We consider a ridesharing problem where there is uncertainty about the completion of trips from both drivers and riders. Specifically, we study ridesharing mechanisms that aim to incentivize commuters to reveal their valuation for trips and their probability of undertaking their trips. Due to the interdependence create... |
2304.08745 | Kasper Green Larsen | Kasper Green Larsen, Huacheng Yu | Super-Logarithmic Lower Bounds for Dynamic Graph Problems | null | null | null | null | cs.DS cs.CC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this work, we prove a $\tilde{\Omega}(\lg^{3/2} n )$ unconditional lower
bound on the maximum of the query time and update time for dynamic data
structures supporting reachability queries in $n$-node directed acyclic graphs
under edge insertions. This is the first super-logarithmic lower bound for any
natural grap... | [
{
"created": "Tue, 18 Apr 2023 05:46:47 GMT",
"version": "v1"
}
] | 2023-04-19 | [
[
"Larsen",
"Kasper Green",
""
],
[
"Yu",
"Huacheng",
""
]
] | In this work, we prove a $\tilde{\Omega}(\lg^{3/2} n )$ unconditional lower bound on the maximum of the query time and update time for dynamic data structures supporting reachability queries in $n$-node directed acyclic graphs under edge insertions. This is the first super-logarithmic lower bound for any natural graph ... |
1804.00410 | Wen-Cheng Chen | Wen-Cheng Chen, Chien-Wen Chen, Min-Chun Hu | SyncGAN: Synchronize the Latent Space of Cross-modal Generative
Adversarial Networks | 9 pages, Part of this work is accepted by IEEE International
Conference on Multimedia Expo 2018 | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Generative adversarial network (GAN) has achieved impressive success on
cross-domain generation, but it faces difficulty in cross-modal generation due
to the lack of a common distribution between heterogeneous data. Most existing
methods of conditional based cross-modal GANs adopt the strategy of
one-directional tran... | [
{
"created": "Mon, 2 Apr 2018 06:27:50 GMT",
"version": "v1"
}
] | 2018-04-03 | [
[
"Chen",
"Wen-Cheng",
""
],
[
"Chen",
"Chien-Wen",
""
],
[
"Hu",
"Min-Chun",
""
]
] | Generative adversarial network (GAN) has achieved impressive success on cross-domain generation, but it faces difficulty in cross-modal generation due to the lack of a common distribution between heterogeneous data. Most existing methods of conditional based cross-modal GANs adopt the strategy of one-directional transf... |
2408.00327 | Yun-Chih Chen | Yun-Chih Chen, Yuan-Hao Chang, Tei-Wei Kuo | Search-in-Memory (SiM): Reliable, Versatile, and Efficient Data Matching
in SSD's NAND Flash Memory Chip for Data Indexing Acceleration | This paper has been accepted for presentation at the The
International Conference on Hardware/Software Codesign and System Synthesis
(CODES+ISSS) in September, 2024. An extended abstract of this paper was
presented in Design, Automation & Test in Europe Conference & Exhibition
(DATE), 2024 | null | null | null | cs.AR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | To index the increasing volume of data, modern data indexes are typically
stored on SSDs and cached in DRAM. However, searching such an index has
resulted in significant I/O traffic due to limited access locality and
inefficient cache utilization. At the heart of index searching is the operation
of filtering through ... | [
{
"created": "Thu, 1 Aug 2024 07:00:18 GMT",
"version": "v1"
},
{
"created": "Fri, 2 Aug 2024 07:37:51 GMT",
"version": "v2"
}
] | 2024-08-05 | [
[
"Chen",
"Yun-Chih",
""
],
[
"Chang",
"Yuan-Hao",
""
],
[
"Kuo",
"Tei-Wei",
""
]
] | To index the increasing volume of data, modern data indexes are typically stored on SSDs and cached in DRAM. However, searching such an index has resulted in significant I/O traffic due to limited access locality and inefficient cache utilization. At the heart of index searching is the operation of filtering through va... |
2310.17471 | Zhiheng Guo | Xiang Chen, Zhiheng Guo, Xijun Wang, Howard H. Yang, Chenyuan Feng,
Junshen Su, Sihui Zheng, Tony Q. S. Quek | Foundation Model Based Native AI Framework in 6G with Cloud-Edge-End
Collaboration | 8 pages, 4 figures, 1 table | null | null | null | cs.IT cs.DC cs.LG cs.NI eess.SP math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Future wireless communication networks are in a position to move beyond
data-centric, device-oriented connectivity and offer intelligent, immersive
experiences based on task-oriented connections, especially in the context of
the thriving development of pre-trained foundation models (PFM) and the
evolving vision of 6G... | [
{
"created": "Thu, 26 Oct 2023 15:19:40 GMT",
"version": "v1"
}
] | 2023-10-27 | [
[
"Chen",
"Xiang",
""
],
[
"Guo",
"Zhiheng",
""
],
[
"Wang",
"Xijun",
""
],
[
"Yang",
"Howard H.",
""
],
[
"Feng",
"Chenyuan",
""
],
[
"Su",
"Junshen",
""
],
[
"Zheng",
"Sihui",
""
],
[
"Quek",
"T... | Future wireless communication networks are in a position to move beyond data-centric, device-oriented connectivity and offer intelligent, immersive experiences based on task-oriented connections, especially in the context of the thriving development of pre-trained foundation models (PFM) and the evolving vision of 6G n... |
1710.03774 | Hang Ma | Hang Ma, Sven Koenig | AI Buzzwords Explained: Multi-Agent Path Finding (MAPF) | null | null | 10.1145/3137574.3137579 | null | cs.AI cs.MA cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Explanation of the hot topic "multi-agent path finding".
| [
{
"created": "Tue, 10 Oct 2017 18:24:34 GMT",
"version": "v1"
},
{
"created": "Tue, 17 Oct 2017 00:21:44 GMT",
"version": "v2"
}
] | 2017-10-18 | [
[
"Ma",
"Hang",
""
],
[
"Koenig",
"Sven",
""
]
] | Explanation of the hot topic "multi-agent path finding". |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.