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
1705.10786
Hamidreza Alvari
Hamidreza Alvari, Paulo Shakarian, J.E. Kelly Snyder
Semi-Supervised Learning for Detecting Human Trafficking
null
null
null
null
cs.LG cs.AI
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Human trafficking is one of the most atrocious crimes and among the challenging problems facing law enforcement which demands attention of global magnitude. In this study, we leverage textual data from the website "Backpage"- used for classified advertisement- to discern potential patterns of human trafficking activi...
[ { "created": "Tue, 30 May 2017 05:51:53 GMT", "version": "v1" } ]
2017-06-01
[ [ "Alvari", "Hamidreza", "" ], [ "Shakarian", "Paulo", "" ], [ "Snyder", "J. E. Kelly", "" ] ]
Human trafficking is one of the most atrocious crimes and among the challenging problems facing law enforcement which demands attention of global magnitude. In this study, we leverage textual data from the website "Backpage"- used for classified advertisement- to discern potential patterns of human trafficking activiti...
1208.4692
Francis Maes
Francis Maes and David Lupien St-Pierre and Damien Ernst
Monte Carlo Search Algorithm Discovery for One Player Games
null
null
null
null
cs.AI cs.GT
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Much current research in AI and games is being devoted to Monte Carlo search (MCS) algorithms. While the quest for a single unified MCS algorithm that would perform well on all problems is of major interest for AI, practitioners often know in advance the problem they want to solve, and spend plenty of time exploiting...
[ { "created": "Thu, 23 Aug 2012 08:44:59 GMT", "version": "v1" }, { "created": "Fri, 16 Nov 2012 15:57:58 GMT", "version": "v2" }, { "created": "Tue, 18 Dec 2012 10:44:37 GMT", "version": "v3" } ]
2015-03-20
[ [ "Maes", "Francis", "" ], [ "St-Pierre", "David Lupien", "" ], [ "Ernst", "Damien", "" ] ]
Much current research in AI and games is being devoted to Monte Carlo search (MCS) algorithms. While the quest for a single unified MCS algorithm that would perform well on all problems is of major interest for AI, practitioners often know in advance the problem they want to solve, and spend plenty of time exploiting t...
2206.03857
Vitor Bosshard
Vitor Bosshard, Ye Wang and Sven Seuken
Non-decreasing Payment Rules for Combinatorial Auctions
Published at IJCAI 2018. Includes corrigendum explaining a mistake in the original paper
null
10.24963/ijcai.2018/15
null
cs.GT
http://creativecommons.org/licenses/by/4.0/
Combinatorial auctions are used to allocate resources in domains where bidders have complex preferences over bundles of goods. However, the behavior of bidders under different payment rules is not well understood, and there has been limited success in finding Bayes-Nash equilibria of such auctions due to the computat...
[ { "created": "Tue, 7 Jun 2022 13:17:09 GMT", "version": "v1" } ]
2022-06-09
[ [ "Bosshard", "Vitor", "" ], [ "Wang", "Ye", "" ], [ "Seuken", "Sven", "" ] ]
Combinatorial auctions are used to allocate resources in domains where bidders have complex preferences over bundles of goods. However, the behavior of bidders under different payment rules is not well understood, and there has been limited success in finding Bayes-Nash equilibria of such auctions due to the computatio...
2407.01866
Yunxiang Zhang
Yunxiang Zhang, Alexandr Kuznetsov, Akshay Jindal, Kenneth Chen, Anton Sochenov, Anton Kaplanyan, Qi Sun
Image-GS: Content-Adaptive Image Representation via 2D Gaussians
null
null
null
null
cs.CV cs.GR
http://creativecommons.org/licenses/by/4.0/
Neural image representations have recently emerged as a promising technique for storing, streaming, and rendering visual data. Coupled with learning-based workflows, these novel representations have demonstrated remarkable visual fidelity and memory efficiency. However, existing neural image representations often rel...
[ { "created": "Tue, 2 Jul 2024 00:45:21 GMT", "version": "v1" } ]
2024-07-03
[ [ "Zhang", "Yunxiang", "" ], [ "Kuznetsov", "Alexandr", "" ], [ "Jindal", "Akshay", "" ], [ "Chen", "Kenneth", "" ], [ "Sochenov", "Anton", "" ], [ "Kaplanyan", "Anton", "" ], [ "Sun", "Qi", "" ] ]
Neural image representations have recently emerged as a promising technique for storing, streaming, and rendering visual data. Coupled with learning-based workflows, these novel representations have demonstrated remarkable visual fidelity and memory efficiency. However, existing neural image representations often rely ...
2311.06838
Chengguang Gan
Chengguang Gan, Qinghao Zhang, Tatsunori Mori
GIELLM: Japanese General Information Extraction Large Language Model Utilizing Mutual Reinforcement Effect
10 pages, 6 figures
null
null
null
cs.CL
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Information Extraction (IE) stands as a cornerstone in natural language processing, traditionally segmented into distinct sub-tasks. The advent of Large Language Models (LLMs) heralds a paradigm shift, suggesting the feasibility of a singular model addressing multiple IE subtasks. In this vein, we introduce the Gener...
[ { "created": "Sun, 12 Nov 2023 13:30:38 GMT", "version": "v1" } ]
2023-11-14
[ [ "Gan", "Chengguang", "" ], [ "Zhang", "Qinghao", "" ], [ "Mori", "Tatsunori", "" ] ]
Information Extraction (IE) stands as a cornerstone in natural language processing, traditionally segmented into distinct sub-tasks. The advent of Large Language Models (LLMs) heralds a paradigm shift, suggesting the feasibility of a singular model addressing multiple IE subtasks. In this vein, we introduce the General...
1812.10961
Sergey Belim
S.V. Belim, N.F. Bogachenko, A.N. Kabanov
A Precedent Approach to Assigning Access Rights
null
null
10.1088/1742-6596/1210/1/012010
null
cs.CR cs.AI cs.DM
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
To design a discretionary access control policy, a technique is proposed that uses the principle of analogies and is based on both the properties of objects and the properties of subjects. As attributes characterizing these properties, the values of the security attributes of subjects and objects are chosen. The conc...
[ { "created": "Fri, 28 Dec 2018 11:51:14 GMT", "version": "v1" } ]
2019-05-22
[ [ "Belim", "S. V.", "" ], [ "Bogachenko", "N. F.", "" ], [ "Kabanov", "A. N.", "" ] ]
To design a discretionary access control policy, a technique is proposed that uses the principle of analogies and is based on both the properties of objects and the properties of subjects. As attributes characterizing these properties, the values of the security attributes of subjects and objects are chosen. The concep...
1010.3947
Pedro Aguiar
Bernardo Esteves Pires and Pedro M. Q. Aguiar
Maximum Likelihood Mosaics
13 pages, 8 figures
null
null
null
cs.CV
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
The majority of the approaches to the automatic recovery of a panoramic image from a set of partial views are suboptimal in the sense that the input images are aligned, or registered, pair by pair, e.g., consecutive frames of a video clip. These approaches lead to propagation errors that may be very severe, particula...
[ { "created": "Tue, 19 Oct 2010 15:13:40 GMT", "version": "v1" } ]
2010-10-20
[ [ "Pires", "Bernardo Esteves", "" ], [ "Aguiar", "Pedro M. Q.", "" ] ]
The majority of the approaches to the automatic recovery of a panoramic image from a set of partial views are suboptimal in the sense that the input images are aligned, or registered, pair by pair, e.g., consecutive frames of a video clip. These approaches lead to propagation errors that may be very severe, particularl...
2212.08709
Clayton Thomas
Yannai A. Gonczarowski, Clayton Thomas
Structural Complexities of Matching Mechanisms
null
null
null
null
cs.GT cs.CC econ.TH
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
We study various novel complexity measures for two-sided matching mechanisms, applied to the two canonical strategyproof matching mechanisms, Deferred Acceptance (DA) and Top Trading Cycles (TTC). Our metrics are designed to capture the complexity of various structural (rather than computational) concerns, in particu...
[ { "created": "Fri, 16 Dec 2022 20:53:30 GMT", "version": "v1" }, { "created": "Thu, 11 May 2023 16:43:32 GMT", "version": "v2" }, { "created": "Sat, 30 Mar 2024 22:17:26 GMT", "version": "v3" } ]
2024-04-02
[ [ "Gonczarowski", "Yannai A.", "" ], [ "Thomas", "Clayton", "" ] ]
We study various novel complexity measures for two-sided matching mechanisms, applied to the two canonical strategyproof matching mechanisms, Deferred Acceptance (DA) and Top Trading Cycles (TTC). Our metrics are designed to capture the complexity of various structural (rather than computational) concerns, in particula...
2407.15861
Chenyu Zhang
Chenyu Zhang, Mingwang Hu, Wenhui Li and Lanjun Wang
Adversarial Attacks and Defenses on Text-to-Image Diffusion Models: A Survey
null
null
null
null
cs.CR cs.AI cs.CV
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Recently, the text-to-image diffusion model has gained considerable attention from the community due to its exceptional image generation capability. A representative model, Stable Diffusion, amassed more than 10 million users within just two months of its release. This surge in popularity has facilitated studies on t...
[ { "created": "Wed, 10 Jul 2024 13:50:31 GMT", "version": "v1" } ]
2024-07-24
[ [ "Zhang", "Chenyu", "" ], [ "Hu", "Mingwang", "" ], [ "Li", "Wenhui", "" ], [ "Wang", "Lanjun", "" ] ]
Recently, the text-to-image diffusion model has gained considerable attention from the community due to its exceptional image generation capability. A representative model, Stable Diffusion, amassed more than 10 million users within just two months of its release. This surge in popularity has facilitated studies on the...
2311.06157
Grischa Fraumann
Grischa Fraumann, Svantje Lilienthal, and Christian Hauschke
The Registry of Scientometric Data Sources
20 pages, 4 figures, 1 table
null
10.31222/osf.io/f2bx3
null
cs.DL
http://creativecommons.org/licenses/by/4.0/
In this article, we describe the Registry of Scientometric Data Sources (RSDS) and several scientometric data sources recorded in this open registry that could be of interest for scientometricians, institutional researchers, librarians, practitioners, policy makers, students and other stakeholders with an interest in...
[ { "created": "Fri, 10 Nov 2023 16:23:40 GMT", "version": "v1" } ]
2023-11-13
[ [ "Fraumann", "Grischa", "" ], [ "Lilienthal", "Svantje", "" ], [ "Hauschke", "Christian", "" ] ]
In this article, we describe the Registry of Scientometric Data Sources (RSDS) and several scientometric data sources recorded in this open registry that could be of interest for scientometricians, institutional researchers, librarians, practitioners, policy makers, students and other stakeholders with an interest in s...
2105.07445
Hyesun Chung
Hyesun Chung and Woojin Park
Enhancing the Usability of Self-service Kiosks for Older Adults: Effects of Using Privacy Partitions and Chairs
null
null
null
null
cs.HC
http://creativecommons.org/licenses/by-nc-nd/4.0/
This study aimed to evaluate the effects of possible physical design features of self-service kiosks (SSK), side and back partitions and chairs, on workload and task performance of older users during a typical SSK task. The study comparatively evaluated eight physical SSK design alternatives, and younger and older pa...
[ { "created": "Sun, 16 May 2021 14:43:51 GMT", "version": "v1" } ]
2021-05-18
[ [ "Chung", "Hyesun", "" ], [ "Park", "Woojin", "" ] ]
This study aimed to evaluate the effects of possible physical design features of self-service kiosks (SSK), side and back partitions and chairs, on workload and task performance of older users during a typical SSK task. The study comparatively evaluated eight physical SSK design alternatives, and younger and older part...
2309.08600
Robert Huben
Hoagy Cunningham, Aidan Ewart, Logan Riggs, Robert Huben, Lee Sharkey
Sparse Autoencoders Find Highly Interpretable Features in Language Models
20 pages, 18 figures, 2 tables
null
null
null
cs.LG cs.CL
http://creativecommons.org/licenses/by/4.0/
One of the roadblocks to a better understanding of neural networks' internals is \textit{polysemanticity}, where neurons appear to activate in multiple, semantically distinct contexts. Polysemanticity prevents us from identifying concise, human-understandable explanations for what neural networks are doing internally...
[ { "created": "Fri, 15 Sep 2023 17:56:55 GMT", "version": "v1" }, { "created": "Tue, 19 Sep 2023 17:20:52 GMT", "version": "v2" }, { "created": "Wed, 4 Oct 2023 13:17:38 GMT", "version": "v3" } ]
2023-10-05
[ [ "Cunningham", "Hoagy", "" ], [ "Ewart", "Aidan", "" ], [ "Riggs", "Logan", "" ], [ "Huben", "Robert", "" ], [ "Sharkey", "Lee", "" ] ]
One of the roadblocks to a better understanding of neural networks' internals is \textit{polysemanticity}, where neurons appear to activate in multiple, semantically distinct contexts. Polysemanticity prevents us from identifying concise, human-understandable explanations for what neural networks are doing internally. ...
1309.0633
Sandor Vagvolgyi
Sandor Vagvolgyi
Threefold Post Correspondence System
null
null
null
null
cs.CC cs.LO
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
We introduce the concept of a threefold Post correspondence system (3PCS for short) and we consider it as an instance of the threefold Post correspondence problem. With each 3PCS, we associate three Post correspondence systems, i.e., three instances of the Post correspondence problem. We conjecture that for each 3PCS...
[ { "created": "Tue, 3 Sep 2013 10:23:08 GMT", "version": "v1" } ]
2013-09-04
[ [ "Vagvolgyi", "Sandor", "" ] ]
We introduce the concept of a threefold Post correspondence system (3PCS for short) and we consider it as an instance of the threefold Post correspondence problem. With each 3PCS, we associate three Post correspondence systems, i.e., three instances of the Post correspondence problem. We conjecture that for each 3PCS, ...
2311.16835
Kunpeng Wang
Kunpeng Wang, Chenglong Li, Zhengzheng Tu, Zhengyi Liu, Bin Luo
Unified-modal Salient Object Detection via Adaptive Prompt Learning
13 pages, 11 figures
null
null
null
cs.CV
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Existing single-modal and multi-modal salient object detection (SOD) methods focus on designing specific architectures tailored for their respective tasks. However, developing completely different models for different tasks leads to labor and time consumption, as well as high computational and practical deployment co...
[ { "created": "Tue, 28 Nov 2023 14:51:08 GMT", "version": "v1" }, { "created": "Wed, 29 Nov 2023 13:14:58 GMT", "version": "v2" }, { "created": "Fri, 15 Dec 2023 12:19:34 GMT", "version": "v3" }, { "created": "Mon, 13 May 2024 02:55:17 GMT", "version": "v4" }, { "c...
2024-06-06
[ [ "Wang", "Kunpeng", "" ], [ "Li", "Chenglong", "" ], [ "Tu", "Zhengzheng", "" ], [ "Liu", "Zhengyi", "" ], [ "Luo", "Bin", "" ] ]
Existing single-modal and multi-modal salient object detection (SOD) methods focus on designing specific architectures tailored for their respective tasks. However, developing completely different models for different tasks leads to labor and time consumption, as well as high computational and practical deployment cost...
2305.13969
Matej Novosad
Matej Novosad, Robert Penicka, Vojtech Vonasek
CTopPRM: Clustering Topological PRM for Planning Multiple Distinct Paths in 3D Environments
in IEEE Robotics and Automation Letters
null
10.1109/LRA.2023.3315539
null
cs.RO
http://creativecommons.org/licenses/by/4.0/
In this paper, we propose a new method called Clustering Topological PRM (CTopPRM) for finding multiple homotopically distinct paths in 3D cluttered environments. Finding such distinct paths, e.g., going around an obstacle from a different side, is useful in many applications. Among others, using multiple distinct pa...
[ { "created": "Tue, 23 May 2023 11:53:04 GMT", "version": "v1" }, { "created": "Mon, 18 Sep 2023 12:58:36 GMT", "version": "v2" }, { "created": "Thu, 28 Sep 2023 17:58:29 GMT", "version": "v3" } ]
2023-09-29
[ [ "Novosad", "Matej", "" ], [ "Penicka", "Robert", "" ], [ "Vonasek", "Vojtech", "" ] ]
In this paper, we propose a new method called Clustering Topological PRM (CTopPRM) for finding multiple homotopically distinct paths in 3D cluttered environments. Finding such distinct paths, e.g., going around an obstacle from a different side, is useful in many applications. Among others, using multiple distinct path...
1811.09946
Thomas Sandholm
Thomas Sandholm, Bernardo A. Huberman
A Learning Approach to Wi-Fi Access
null
null
null
null
cs.NI
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
We show experimentally that workload-based AP-STA associations can improve system throughput significantly. We present a predictive model that guides optimal resource allocations in dense Wi-Fi networks and achieves 72-77% of the optimal throughput with varying training data set sizes using a 3-day trace of real cabl...
[ { "created": "Sun, 25 Nov 2018 05:26:45 GMT", "version": "v1" } ]
2018-11-27
[ [ "Sandholm", "Thomas", "" ], [ "Huberman", "Bernardo A.", "" ] ]
We show experimentally that workload-based AP-STA associations can improve system throughput significantly. We present a predictive model that guides optimal resource allocations in dense Wi-Fi networks and achieves 72-77% of the optimal throughput with varying training data set sizes using a 3-day trace of real cable ...
2101.00543
Taehyeun Park
Taehyeun Park, Walid Saad, Bo Zhou
Centralized and Distributed Age of Information Minimization with non-linear Aging Functions in the Internet of Things
19 pages, 11 figures, journal
null
null
null
cs.IT math.IT
http://creativecommons.org/licenses/by/4.0/
Resource management in Internet of Things (IoT) systems is a major challenge due to the massive scale and heterogeneity of the IoT system. For instance, most IoT applications require timely delivery of collected information, which is a key challenge for the IoT. In this paper, novel centralized and distributed resour...
[ { "created": "Sun, 3 Jan 2021 02:19:33 GMT", "version": "v1" } ]
2021-01-05
[ [ "Park", "Taehyeun", "" ], [ "Saad", "Walid", "" ], [ "Zhou", "Bo", "" ] ]
Resource management in Internet of Things (IoT) systems is a major challenge due to the massive scale and heterogeneity of the IoT system. For instance, most IoT applications require timely delivery of collected information, which is a key challenge for the IoT. In this paper, novel centralized and distributed resource...
1302.1153
Carlos Alberto Fernandez-y-Fernandez
Moises Homero Sanchez Lopez, Carlos Alberto Fernandez-y-Fernandez, Jorge Rafael Aguilar Cisneros
On the need for optimization of the software development processes in short-term projects
8 pages, conference proceedings T\'opicos Selectos de Tecnolog\'ias de la Informaci\'on y Comunicaciones in Proceedings of the XXV Congreso Nacional y XI Congreso Internacional de Inform\'atica y Computaci\'on ANIEI 2012
null
null
null
cs.SE
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Nowadays, most of the software development projects in Mexico are short-term projects (micro and small projects); for this reason, in this paper we are presenting a research proposal with the goal of identifying the elements contributing to their success or failure. With this research, we are trying to identify and p...
[ { "created": "Tue, 5 Feb 2013 19:06:06 GMT", "version": "v1" } ]
2013-02-06
[ [ "Lopez", "Moises Homero Sanchez", "" ], [ "Fernandez-y-Fernandez", "Carlos Alberto", "" ], [ "Cisneros", "Jorge Rafael Aguilar", "" ] ]
Nowadays, most of the software development projects in Mexico are short-term projects (micro and small projects); for this reason, in this paper we are presenting a research proposal with the goal of identifying the elements contributing to their success or failure. With this research, we are trying to identify and pro...
1211.5795
Alexandr Klimchik
Alexandr Klimchik (EMN, IRCCyN), Anatol Pashkevich (EMN, IRCCyN), Damien Chablat (IRCCyN)
Stiffness modeling of non-perfect parallel manipulators
null
IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2012), Vilamoura : Portugal (2012)
null
null
cs.RO
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
The paper focuses on the stiffness modeling of parallel manipulators composed of non-perfect serial chains, whose geometrical parameters differ from the nominal ones. In these manipulators, there usually exist essential internal forces/torques that considerably affect the stiffness properties and also change the end-...
[ { "created": "Sun, 25 Nov 2012 18:55:54 GMT", "version": "v1" } ]
2012-11-27
[ [ "Klimchik", "Alexandr", "", "EMN, IRCCyN" ], [ "Pashkevich", "Anatol", "", "EMN, IRCCyN" ], [ "Chablat", "Damien", "", "IRCCyN" ] ]
The paper focuses on the stiffness modeling of parallel manipulators composed of non-perfect serial chains, whose geometrical parameters differ from the nominal ones. In these manipulators, there usually exist essential internal forces/torques that considerably affect the stiffness properties and also change the end-ef...
1901.05876
Bin Kong
Eric Wu, Bin Kong, Xin Wang, Junjie Bai, Yi Lu, Feng Gao, Shaoting Zhang, Kunlin Cao, Qi Song, Siwei Lyu, Youbing Yin
Residual Attention based Network for Hand Bone Age Assessment
null
null
null
null
cs.CV cs.LG
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Computerized automatic methods have been employed to boost the productivity as well as objectiveness of hand bone age assessment. These approaches make predictions according to the whole X-ray images, which include other objects that may introduce distractions. Instead, our framework is inspired by the clinical workf...
[ { "created": "Fri, 21 Dec 2018 23:09:32 GMT", "version": "v1" } ]
2019-01-18
[ [ "Wu", "Eric", "" ], [ "Kong", "Bin", "" ], [ "Wang", "Xin", "" ], [ "Bai", "Junjie", "" ], [ "Lu", "Yi", "" ], [ "Gao", "Feng", "" ], [ "Zhang", "Shaoting", "" ], [ "Cao", "Kunlin", "" ], ...
Computerized automatic methods have been employed to boost the productivity as well as objectiveness of hand bone age assessment. These approaches make predictions according to the whole X-ray images, which include other objects that may introduce distractions. Instead, our framework is inspired by the clinical workflo...
2403.09620
Shubhankar Mangesh Borse
Vibashan VS, Shubhankar Borse, Hyojin Park, Debasmit Das, Vishal Patel, Munawar Hayat, Fatih Porikli
PosSAM: Panoptic Open-vocabulary Segment Anything
null
null
null
null
cs.CV
http://creativecommons.org/licenses/by/4.0/
In this paper, we introduce an open-vocabulary panoptic segmentation model that effectively unifies the strengths of the Segment Anything Model (SAM) with the vision-language CLIP model in an end-to-end framework. While SAM excels in generating spatially-aware masks, it's decoder falls short in recognizing object cla...
[ { "created": "Thu, 14 Mar 2024 17:55:03 GMT", "version": "v1" } ]
2024-03-15
[ [ "VS", "Vibashan", "" ], [ "Borse", "Shubhankar", "" ], [ "Park", "Hyojin", "" ], [ "Das", "Debasmit", "" ], [ "Patel", "Vishal", "" ], [ "Hayat", "Munawar", "" ], [ "Porikli", "Fatih", "" ] ]
In this paper, we introduce an open-vocabulary panoptic segmentation model that effectively unifies the strengths of the Segment Anything Model (SAM) with the vision-language CLIP model in an end-to-end framework. While SAM excels in generating spatially-aware masks, it's decoder falls short in recognizing object class...
1505.03476
Mingyu Chen
Zehan Cui, Tianyue Lu, Haiyang Pan, Sally A. Mckee, Mingyu Chen
Twin-Load: Building a Scalable Memory System over the Non-Scalable Interface
submitted to PACT15
null
null
null
cs.AR
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Commodity memory interfaces have difficulty in scaling memory capacity to meet the needs of modern multicore and big data systems. DRAM device density and maximum device count are constrained by technology, package, and signal in- tegrity issues that limit total memory capacity. Synchronous DRAM protocols require dat...
[ { "created": "Wed, 13 May 2015 17:54:15 GMT", "version": "v1" } ]
2015-05-14
[ [ "Cui", "Zehan", "" ], [ "Lu", "Tianyue", "" ], [ "Pan", "Haiyang", "" ], [ "Mckee", "Sally A.", "" ], [ "Chen", "Mingyu", "" ] ]
Commodity memory interfaces have difficulty in scaling memory capacity to meet the needs of modern multicore and big data systems. DRAM device density and maximum device count are constrained by technology, package, and signal in- tegrity issues that limit total memory capacity. Synchronous DRAM protocols require data ...
2107.00440
Piji Li
Dong Wang, Ning Ding, Piji Li, Hai-Tao Zheng
CLINE: Contrastive Learning with Semantic Negative Examples for Natural Language Understanding
ACL 2021, Main Conference, Long Paper
null
null
null
cs.CL cs.AI
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Despite pre-trained language models have proven useful for learning high-quality semantic representations, these models are still vulnerable to simple perturbations. Recent works aimed to improve the robustness of pre-trained models mainly focus on adversarial training from perturbed examples with similar semantics, ...
[ { "created": "Thu, 1 Jul 2021 13:34:12 GMT", "version": "v1" } ]
2021-07-02
[ [ "Wang", "Dong", "" ], [ "Ding", "Ning", "" ], [ "Li", "Piji", "" ], [ "Zheng", "Hai-Tao", "" ] ]
Despite pre-trained language models have proven useful for learning high-quality semantic representations, these models are still vulnerable to simple perturbations. Recent works aimed to improve the robustness of pre-trained models mainly focus on adversarial training from perturbed examples with similar semantics, ne...
2312.08309
Faisal Haque Bappy
Sabbir Ahmed, Md Nahiduzzaman, Tariqul Islam, Faisal Haque Bappy, Tarannum Shaila Zaman, Raiful Hasan
FASTEN: Towards a FAult-tolerant and STorage EfficieNt Cloud: Balancing Between Replication and Deduplication
null
null
null
null
cs.DC
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
With the surge in cloud storage adoption, enterprises face challenges managing data duplication and exponential data growth. Deduplication mitigates redundancy, yet maintaining redundancy ensures high availability, incurring storage costs. Balancing these aspects is a significant research concern. We propose FASTEN, ...
[ { "created": "Wed, 13 Dec 2023 17:27:17 GMT", "version": "v1" } ]
2023-12-14
[ [ "Ahmed", "Sabbir", "" ], [ "Nahiduzzaman", "Md", "" ], [ "Islam", "Tariqul", "" ], [ "Bappy", "Faisal Haque", "" ], [ "Zaman", "Tarannum Shaila", "" ], [ "Hasan", "Raiful", "" ] ]
With the surge in cloud storage adoption, enterprises face challenges managing data duplication and exponential data growth. Deduplication mitigates redundancy, yet maintaining redundancy ensures high availability, incurring storage costs. Balancing these aspects is a significant research concern. We propose FASTEN, a ...
2011.04542
Seohyun Kim
Gareth Ari Aye, Seohyun Kim, Hongyu Li
Learning Autocompletion from Real-World Datasets
null
null
null
null
cs.SE
http://creativecommons.org/licenses/by-nc-sa/4.0/
Code completion is a popular software development tool integrated into all major IDEs. Many neural language models have achieved promising results in completion suggestion prediction on synthetic benchmarks. However, a recent study When Code Completion Fails: a Case Study on Real-World Completions demonstrates that t...
[ { "created": "Mon, 9 Nov 2020 16:33:02 GMT", "version": "v1" } ]
2020-11-10
[ [ "Aye", "Gareth Ari", "" ], [ "Kim", "Seohyun", "" ], [ "Li", "Hongyu", "" ] ]
Code completion is a popular software development tool integrated into all major IDEs. Many neural language models have achieved promising results in completion suggestion prediction on synthetic benchmarks. However, a recent study When Code Completion Fails: a Case Study on Real-World Completions demonstrates that the...
2403.18197
Changyi Lin
Changyi Lin, Xingyu Liu, Yuxiang Yang, Yaru Niu, Wenhao Yu, Tingnan Zhang, Jie Tan, Byron Boots, Ding Zhao
LocoMan: Advancing Versatile Quadrupedal Dexterity with Lightweight Loco-Manipulators
Project page: https://linchangyi1.github.io/LocoMan
null
null
null
cs.RO
http://creativecommons.org/licenses/by-nc-nd/4.0/
Quadrupedal robots have emerged as versatile agents capable of locomoting and manipulating in complex environments. Traditional designs typically rely on the robot's inherent body parts or incorporate top-mounted arms for manipulation tasks. However, these configurations may limit the robot's operational dexterity, e...
[ { "created": "Wed, 27 Mar 2024 02:13:24 GMT", "version": "v1" } ]
2024-03-28
[ [ "Lin", "Changyi", "" ], [ "Liu", "Xingyu", "" ], [ "Yang", "Yuxiang", "" ], [ "Niu", "Yaru", "" ], [ "Yu", "Wenhao", "" ], [ "Zhang", "Tingnan", "" ], [ "Tan", "Jie", "" ], [ "Boots", "Byron", ...
Quadrupedal robots have emerged as versatile agents capable of locomoting and manipulating in complex environments. Traditional designs typically rely on the robot's inherent body parts or incorporate top-mounted arms for manipulation tasks. However, these configurations may limit the robot's operational dexterity, eff...
cs/0607086
Farid Nouioua
Daniel Kayser (LIPN), Farid Nouioua (LIPN)
Representing Knowledge about Norms
null
The 16th European Conference on Artificial Intelligence (ECAI'04) (2004) 363-367
null
null
cs.AI
null
Norms are essential to extend inference: inferences based on norms are far richer than those based on logical implications. In the recent decades, much effort has been devoted to reason on a domain, once its norms are represented. How to extract and express those norms has received far less attention. Extraction is d...
[ { "created": "Tue, 18 Jul 2006 08:15:04 GMT", "version": "v1" } ]
2007-05-23
[ [ "Kayser", "Daniel", "", "LIPN" ], [ "Nouioua", "Farid", "", "LIPN" ] ]
Norms are essential to extend inference: inferences based on norms are far richer than those based on logical implications. In the recent decades, much effort has been devoted to reason on a domain, once its norms are represented. How to extract and express those norms has received far less attention. Extraction is dif...
1704.04459
Ali Kariminezhad
Ali Kariminezhad, Soheil Gherekhloo, and Aydin Sezgin
Optimal Power Splitting for Simultaneous Information Detection and Energy Harvesting
null
null
null
null
cs.IT math.IT
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
This letter deals with the joint information and energy processing at a receiver of a point-to-point communication channel. In particular, the trade-off between the achievable information rate and harvested energy for a multiple-antenna power splitting (PS) receiver is investigated. Here, the rate- energy region char...
[ { "created": "Fri, 14 Apr 2017 15:31:10 GMT", "version": "v1" } ]
2017-04-17
[ [ "Kariminezhad", "Ali", "" ], [ "Gherekhloo", "Soheil", "" ], [ "Sezgin", "Aydin", "" ] ]
This letter deals with the joint information and energy processing at a receiver of a point-to-point communication channel. In particular, the trade-off between the achievable information rate and harvested energy for a multiple-antenna power splitting (PS) receiver is investigated. Here, the rate- energy region charac...
2002.11885
Gaurav Nagesh Shetty
Gaurav N.Shetty, Konstantinos Slavakis, Ukash Nakarmi, Gesualdo Scutari, and Leslie Ying
Kernel Bi-Linear Modeling for Reconstructing Data on Manifolds: The Dynamic-MRI Case
null
null
null
null
cs.LG cs.CV eess.IV stat.ML
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
This paper establishes a kernel-based framework for reconstructing data on manifolds, tailored to fit the dynamic-(d)MRI-data recovery problem. The proposed methodology exploits simple tangent-space geometries of manifolds in reproducing kernel Hilbert spaces and follows classical kernel-approximation arguments to fo...
[ { "created": "Thu, 27 Feb 2020 02:42:08 GMT", "version": "v1" } ]
2020-02-28
[ [ "Shetty", "Gaurav N.", "" ], [ "Slavakis", "Konstantinos", "" ], [ "Nakarmi", "Ukash", "" ], [ "Scutari", "Gesualdo", "" ], [ "Ying", "Leslie", "" ] ]
This paper establishes a kernel-based framework for reconstructing data on manifolds, tailored to fit the dynamic-(d)MRI-data recovery problem. The proposed methodology exploits simple tangent-space geometries of manifolds in reproducing kernel Hilbert spaces and follows classical kernel-approximation arguments to form...
2009.03115
Youngtaek Kim
Youngtaek Kim, Jaeyoung Kim, Hyeon Jeon, Young-Ho Kim, Hyunjoo Song, Bohyoung Kim, Jinwook Seo
Githru: Visual Analytics for Understanding Software Development History Through Git Metadata Analysis
IEEE VIS 2020 (VAST), ACM 2012 CCS - Human-centered computing, Visualization
IEEE Transactions on Visualization and Computer Graphics (TVCG) Feb. 2021, pp. 656-666, vol. 27
10.1109/TVCG.2020.3030414
null
cs.SE cs.HC
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Git metadata contains rich information for developers to understand the overall context of a large software development project. Thus it can help new developers, managers, and testers understand the history of development without needing to dig into a large pile of unfamiliar source code. However, the current tools f...
[ { "created": "Mon, 7 Sep 2020 14:06:59 GMT", "version": "v1" }, { "created": "Tue, 8 Sep 2020 04:15:19 GMT", "version": "v2" } ]
2021-04-29
[ [ "Kim", "Youngtaek", "" ], [ "Kim", "Jaeyoung", "" ], [ "Jeon", "Hyeon", "" ], [ "Kim", "Young-Ho", "" ], [ "Song", "Hyunjoo", "" ], [ "Kim", "Bohyoung", "" ], [ "Seo", "Jinwook", "" ] ]
Git metadata contains rich information for developers to understand the overall context of a large software development project. Thus it can help new developers, managers, and testers understand the history of development without needing to dig into a large pile of unfamiliar source code. However, the current tools for...
1007.3624
Abuzer Yakaryilmaz
Abuzer Yakaryilmaz and A. C. Cem Say
Unbounded-error quantum computation with small space bounds
A preliminary version of this paper appeared in the Proceedings of the Fourth International Computer Science Symposium in Russia, pages 356--367, 2009
Information and Computation, Volume 209, Issue 6, June 2011, Pages 873-892
10.1016/j.ic.2011.01.008
null
cs.CC quant-ph
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
We prove the following facts about the language recognition power of quantum Turing machines (QTMs) in the unbounded error setting: QTMs are strictly more powerful than probabilistic Turing machines for any common space bound $ s $ satisfying $ s(n)=o(\log \log n) $. For "one-way" Turing machines, where the input tap...
[ { "created": "Wed, 21 Jul 2010 12:00:14 GMT", "version": "v1" }, { "created": "Thu, 10 Feb 2011 15:05:45 GMT", "version": "v2" } ]
2014-01-29
[ [ "Yakaryilmaz", "Abuzer", "" ], [ "Say", "A. C. Cem", "" ] ]
We prove the following facts about the language recognition power of quantum Turing machines (QTMs) in the unbounded error setting: QTMs are strictly more powerful than probabilistic Turing machines for any common space bound $ s $ satisfying $ s(n)=o(\log \log n) $. For "one-way" Turing machines, where the input tape ...
1703.09177
Farzad Salehisadaghiani
Farzad Salehisadaghiani
Nash Equilibrium in Social Media
arXiv admin note: substantial text overlap with arXiv:1612.07179
null
null
null
cs.GT cs.SI cs.SY
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
In this work, we investigate an application of a Nash equilibrium seeking algorithm in a social network. In a networked game each player (user) takes action in response to other players' actions in order to decrease (increase) his cost (profit) in the network. We assume that the players' cost functions are not necess...
[ { "created": "Mon, 27 Mar 2017 16:44:49 GMT", "version": "v1" } ]
2017-03-28
[ [ "Salehisadaghiani", "Farzad", "" ] ]
In this work, we investigate an application of a Nash equilibrium seeking algorithm in a social network. In a networked game each player (user) takes action in response to other players' actions in order to decrease (increase) his cost (profit) in the network. We assume that the players' cost functions are not necessar...
cs/0605123
Jaime Cardoso
Jaime S. Cardoso
Classification of Ordinal Data
62 pages, MSc thesis
null
null
null
cs.AI
null
Classification of ordinal data is one of the most important tasks of relation learning. In this thesis a novel framework for ordered classes is proposed. The technique reduces the problem of classifying ordered classes to the standard two-class problem. The introduced method is then mapped into support vector machine...
[ { "created": "Fri, 26 May 2006 09:44:44 GMT", "version": "v1" } ]
2007-05-23
[ [ "Cardoso", "Jaime S.", "" ] ]
Classification of ordinal data is one of the most important tasks of relation learning. In this thesis a novel framework for ordered classes is proposed. The technique reduces the problem of classifying ordered classes to the standard two-class problem. The introduced method is then mapped into support vector machines ...
cs/0602052
Grigoriev Evgeniy
Evgeniy Grigoriev
The OverRelational Manifesto
34 pages
null
null
null
cs.DB cs.DS
null
The OverRelational Manifesto (below ORM) proposes a possible approach to creation of data storage systems of the next generation. ORM starts from the requirement that information in a relational database is represented by a set of relation values. Accordingly, it is assumed that the information about any entity of an...
[ { "created": "Tue, 14 Feb 2006 12:19:08 GMT", "version": "v1" }, { "created": "Wed, 15 Feb 2006 10:28:24 GMT", "version": "v2" }, { "created": "Fri, 17 Mar 2006 09:57:07 GMT", "version": "v3" } ]
2007-05-23
[ [ "Grigoriev", "Evgeniy", "" ] ]
The OverRelational Manifesto (below ORM) proposes a possible approach to creation of data storage systems of the next generation. ORM starts from the requirement that information in a relational database is represented by a set of relation values. Accordingly, it is assumed that the information about any entity of an e...
2008.13664
Thomas Lange
Thomas Lange, Aneesh Balakrishnan, Maximilien Glorieux, Dan Alexandrescu, Luca Sterpone
Machine Learning Clustering Techniques for Selective Mitigation of Critical Design Features
null
null
10.1109/IOLTS50870.2020.9159751
null
cs.AR cs.LG
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Selective mitigation or selective hardening is an effective technique to obtain a good trade-off between the improvements in the overall reliability of a circuit and the hardware overhead induced by the hardening techniques. Selective mitigation relies on preferentially protecting circuit instances according to their...
[ { "created": "Mon, 31 Aug 2020 15:03:16 GMT", "version": "v1" }, { "created": "Fri, 2 Apr 2021 15:48:17 GMT", "version": "v2" } ]
2021-04-05
[ [ "Lange", "Thomas", "" ], [ "Balakrishnan", "Aneesh", "" ], [ "Glorieux", "Maximilien", "" ], [ "Alexandrescu", "Dan", "" ], [ "Sterpone", "Luca", "" ] ]
Selective mitigation or selective hardening is an effective technique to obtain a good trade-off between the improvements in the overall reliability of a circuit and the hardware overhead induced by the hardening techniques. Selective mitigation relies on preferentially protecting circuit instances according to their s...
2407.10793
Hannah Sansford
Hannah Sansford, Nicholas Richardson, Hermina Petric Maretic, Juba Nait Saada
GraphEval: A Knowledge-Graph Based LLM Hallucination Evaluation Framework
12 pages, to be published at KiL'24: Workshop on Knowledge-infused Learning co-located with 30th ACM KDD Conference, August 26, 2024, Barcelona, Spain
null
null
null
cs.CL cs.AI cs.LG
http://creativecommons.org/licenses/by/4.0/
Methods to evaluate Large Language Model (LLM) responses and detect inconsistencies, also known as hallucinations, with respect to the provided knowledge, are becoming increasingly important for LLM applications. Current metrics fall short in their ability to provide explainable decisions, systematically check all pi...
[ { "created": "Mon, 15 Jul 2024 15:11:16 GMT", "version": "v1" } ]
2024-07-16
[ [ "Sansford", "Hannah", "" ], [ "Richardson", "Nicholas", "" ], [ "Maretic", "Hermina Petric", "" ], [ "Saada", "Juba Nait", "" ] ]
Methods to evaluate Large Language Model (LLM) responses and detect inconsistencies, also known as hallucinations, with respect to the provided knowledge, are becoming increasingly important for LLM applications. Current metrics fall short in their ability to provide explainable decisions, systematically check all piec...
2206.04585
William Chen
William Chen, Siyi Hu, Rajat Talak, Luca Carlone
Extracting Zero-shot Common Sense from Large Language Models for Robot 3D Scene Understanding
4 pages (excluding references and appendix), 2 figures, 2 tables. Submitted to Robotics: Science and Systems 2022 2nd Workshop on Scaling Robot Learning. Corrected typos and notation
null
null
null
cs.RO cs.CL
http://creativecommons.org/licenses/by/4.0/
Semantic 3D scene understanding is a problem of critical importance in robotics. While significant advances have been made in simultaneous localization and mapping algorithms, robots are still far from having the common sense knowledge about household objects and their locations of an average human. We introduce a no...
[ { "created": "Thu, 9 Jun 2022 16:05:35 GMT", "version": "v1" }, { "created": "Sun, 19 Jun 2022 03:06:05 GMT", "version": "v2" } ]
2022-06-22
[ [ "Chen", "William", "" ], [ "Hu", "Siyi", "" ], [ "Talak", "Rajat", "" ], [ "Carlone", "Luca", "" ] ]
Semantic 3D scene understanding is a problem of critical importance in robotics. While significant advances have been made in simultaneous localization and mapping algorithms, robots are still far from having the common sense knowledge about household objects and their locations of an average human. We introduce a nove...
2006.00661
Sho Takemori Ph.D
Sho Takemori, Masahiro Sato, Takashi Sonoda, Janmajay Singh, Tomoko Ohkuma
Submodular Bandit Problem Under Multiple Constraints
accepted at UAI 2020, minor mistakes fixed
null
null
null
cs.LG stat.ML
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
The linear submodular bandit problem was proposed to simultaneously address diversified retrieval and online learning in a recommender system. If there is no uncertainty, this problem is equivalent to a submodular maximization problem under a cardinality constraint. However, in some situations, recommendation lists s...
[ { "created": "Mon, 1 Jun 2020 01:28:44 GMT", "version": "v1" }, { "created": "Wed, 3 Jun 2020 06:59:23 GMT", "version": "v2" }, { "created": "Fri, 31 Jul 2020 04:10:35 GMT", "version": "v3" }, { "created": "Mon, 26 Oct 2020 05:12:46 GMT", "version": "v4" }, { "cre...
2021-03-30
[ [ "Takemori", "Sho", "" ], [ "Sato", "Masahiro", "" ], [ "Sonoda", "Takashi", "" ], [ "Singh", "Janmajay", "" ], [ "Ohkuma", "Tomoko", "" ] ]
The linear submodular bandit problem was proposed to simultaneously address diversified retrieval and online learning in a recommender system. If there is no uncertainty, this problem is equivalent to a submodular maximization problem under a cardinality constraint. However, in some situations, recommendation lists sho...
2305.17813
Kevin Jude Concessao
Kevin Jude Concessao, Unnikrishnan Cheramangalath, MJ Ricky Dev, Rupesh Nasre
Meerkat: A framework for Dynamic Graph Algorithms on GPUs
null
null
null
null
cs.DC
http://creativecommons.org/licenses/by/4.0/
Graph algorithms are challenging to implement due to their varying topology and irregular access patterns. Real-world graphs are dynamic in nature and routinely undergo edge and vertex additions, as well as, deletions. Typical examples of dynamic graphs are social networks, collaboration networks, and road networks. ...
[ { "created": "Sun, 28 May 2023 21:10:31 GMT", "version": "v1" }, { "created": "Fri, 2 Jun 2023 15:22:20 GMT", "version": "v2" } ]
2023-06-05
[ [ "Concessao", "Kevin Jude", "" ], [ "Cheramangalath", "Unnikrishnan", "" ], [ "Dev", "MJ Ricky", "" ], [ "Nasre", "Rupesh", "" ] ]
Graph algorithms are challenging to implement due to their varying topology and irregular access patterns. Real-world graphs are dynamic in nature and routinely undergo edge and vertex additions, as well as, deletions. Typical examples of dynamic graphs are social networks, collaboration networks, and road networks. Ap...
2203.14806
Simon J. Blanchard
S. J. Blanchard, T. J. Noseworthy, E. Pancer, M. Poole
Extraction of Visual Information to Predict Crowdfunding Success
32 pages, 5 figures
null
null
null
cs.CV cs.MM stat.AP
http://creativecommons.org/licenses/by/4.0/
Researchers have increasingly turned to crowdfunding platforms to gain insights into entrepreneurial activity and dynamics. While previous studies have explored various factors influencing crowdfunding success, such as technology, communication, and marketing strategies, the role of visual elements that can be automa...
[ { "created": "Mon, 28 Mar 2022 14:44:52 GMT", "version": "v1" }, { "created": "Wed, 6 Sep 2023 15:13:07 GMT", "version": "v2" } ]
2023-09-07
[ [ "Blanchard", "S. J.", "" ], [ "Noseworthy", "T. J.", "" ], [ "Pancer", "E.", "" ], [ "Poole", "M.", "" ] ]
Researchers have increasingly turned to crowdfunding platforms to gain insights into entrepreneurial activity and dynamics. While previous studies have explored various factors influencing crowdfunding success, such as technology, communication, and marketing strategies, the role of visual elements that can be automati...
2001.05571
Jan Brabec
Jan Brabec, Tom\'a\v{s} Kom\'arek, Vojt\v{e}ch Franc, Luk\'a\v{s} Machlica
On Model Evaluation under Non-constant Class Imbalance
Accepted for proceedings of ICCS 2020. Supplementary code at: https://github.com/CiscoCTA/nci_eval
null
null
null
cs.LG stat.ML
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Many real-world classification problems are significantly class-imbalanced to detriment of the class of interest. The standard set of proper evaluation metrics is well-known but the usual assumption is that the test dataset imbalance equals the real-world imbalance. In practice, this assumption is often broken for va...
[ { "created": "Wed, 15 Jan 2020 21:52:24 GMT", "version": "v1" }, { "created": "Wed, 15 Apr 2020 17:58:21 GMT", "version": "v2" } ]
2020-04-16
[ [ "Brabec", "Jan", "" ], [ "Komárek", "Tomáš", "" ], [ "Franc", "Vojtěch", "" ], [ "Machlica", "Lukáš", "" ] ]
Many real-world classification problems are significantly class-imbalanced to detriment of the class of interest. The standard set of proper evaluation metrics is well-known but the usual assumption is that the test dataset imbalance equals the real-world imbalance. In practice, this assumption is often broken for vari...
1901.03278
Kai Chen
Jiaqi Wang, Kai Chen, Shuo Yang, Chen Change Loy, Dahua Lin
Region Proposal by Guided Anchoring
CVPR 2019 camera ready
null
null
null
cs.CV
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Region anchors are the cornerstone of modern object detection techniques. State-of-the-art detectors mostly rely on a dense anchoring scheme, where anchors are sampled uniformly over the spatial domain with a predefined set of scales and aspect ratios. In this paper, we revisit this foundational stage. Our study show...
[ { "created": "Thu, 10 Jan 2019 17:13:13 GMT", "version": "v1" }, { "created": "Fri, 12 Apr 2019 06:25:50 GMT", "version": "v2" } ]
2019-04-15
[ [ "Wang", "Jiaqi", "" ], [ "Chen", "Kai", "" ], [ "Yang", "Shuo", "" ], [ "Loy", "Chen Change", "" ], [ "Lin", "Dahua", "" ] ]
Region anchors are the cornerstone of modern object detection techniques. State-of-the-art detectors mostly rely on a dense anchoring scheme, where anchors are sampled uniformly over the spatial domain with a predefined set of scales and aspect ratios. In this paper, we revisit this foundational stage. Our study shows ...
2002.04672
Kevin Liang
Yuewei Yang, Kevin J Liang, Lawrence Carin
Object Detection as a Positive-Unlabeled Problem
Published as a conference paper in the British Machine Vision Conference (BMVC) 2020
null
null
null
cs.CV
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
As with other deep learning methods, label quality is important for learning modern convolutional object detectors. However, the potentially large number and wide diversity of object instances that can be found in complex image scenes makes constituting complete annotations a challenging task; objects missing annotat...
[ { "created": "Tue, 11 Feb 2020 20:49:34 GMT", "version": "v1" }, { "created": "Sun, 1 Nov 2020 18:25:47 GMT", "version": "v2" } ]
2020-11-03
[ [ "Yang", "Yuewei", "" ], [ "Liang", "Kevin J", "" ], [ "Carin", "Lawrence", "" ] ]
As with other deep learning methods, label quality is important for learning modern convolutional object detectors. However, the potentially large number and wide diversity of object instances that can be found in complex image scenes makes constituting complete annotations a challenging task; objects missing annotatio...
2402.07376
Rundong Luo
Rundong Luo, Hong-Xing Yu, Jiajun Wu
Unsupervised Discovery of Object-Centric Neural Fields
null
null
null
null
cs.CV
http://creativecommons.org/licenses/by/4.0/
We study inferring 3D object-centric scene representations from a single image. While recent methods have shown potential in unsupervised 3D object discovery from simple synthetic images, they fail to generalize to real-world scenes with visually rich and diverse objects. This limitation stems from their object repre...
[ { "created": "Mon, 12 Feb 2024 02:16:59 GMT", "version": "v1" } ]
2024-02-13
[ [ "Luo", "Rundong", "" ], [ "Yu", "Hong-Xing", "" ], [ "Wu", "Jiajun", "" ] ]
We study inferring 3D object-centric scene representations from a single image. While recent methods have shown potential in unsupervised 3D object discovery from simple synthetic images, they fail to generalize to real-world scenes with visually rich and diverse objects. This limitation stems from their object represe...
2404.15591
Alberto Presta Mr
Alberto Presta, Gabriele Spadaro, Enzo Tartaglione, Attilio Fiandrotti and Marco Grangetto
Domain Adaptation for Learned Image Compression with Supervised Adapters
10 pages, published to Data compression conference 2024 (DCC2024)
null
null
null
cs.CV eess.IV
http://creativecommons.org/publicdomain/zero/1.0/
In Learned Image Compression (LIC), a model is trained at encoding and decoding images sampled from a source domain, often outperforming traditional codecs on natural images; yet its performance may be far from optimal on images sampled from different domains. In this work, we tackle the problem of adapting a pre-tra...
[ { "created": "Wed, 24 Apr 2024 01:50:36 GMT", "version": "v1" } ]
2024-04-25
[ [ "Presta", "Alberto", "" ], [ "Spadaro", "Gabriele", "" ], [ "Tartaglione", "Enzo", "" ], [ "Fiandrotti", "Attilio", "" ], [ "Grangetto", "Marco", "" ] ]
In Learned Image Compression (LIC), a model is trained at encoding and decoding images sampled from a source domain, often outperforming traditional codecs on natural images; yet its performance may be far from optimal on images sampled from different domains. In this work, we tackle the problem of adapting a pre-train...
1909.09485
Iftitahu Ni'mah
Iftitahu Ni'mah, Vlado Menkovski, Mykola Pechenizkiy
BSDAR: Beam Search Decoding with Attention Reward in Neural Keyphrase Generation
arxiv preprint. a preliminary study
null
null
null
cs.CL cs.LG stat.ML
http://creativecommons.org/licenses/by/4.0/
This study mainly investigates two common decoding problems in neural keyphrase generation: sequence length bias and beam diversity. To tackle the problems, we introduce a beam search decoding strategy based on word-level and ngram-level reward function to constrain and refine Seq2Seq inference at test time. Results ...
[ { "created": "Tue, 17 Sep 2019 18:44:54 GMT", "version": "v1" }, { "created": "Mon, 30 Oct 2023 04:33:55 GMT", "version": "v2" } ]
2023-10-31
[ [ "Ni'mah", "Iftitahu", "" ], [ "Menkovski", "Vlado", "" ], [ "Pechenizkiy", "Mykola", "" ] ]
This study mainly investigates two common decoding problems in neural keyphrase generation: sequence length bias and beam diversity. To tackle the problems, we introduce a beam search decoding strategy based on word-level and ngram-level reward function to constrain and refine Seq2Seq inference at test time. Results sh...
cs/0311002
Andy King
Florence Benoy and Andy King and Fred Mesnard
Computing Convex Hulls with a Linear Solver
13 pages, 1 figure
null
null
null
cs.PL
null
A programming tactic involving polyhedra is reported that has been widely applied in the polyhedral analysis of (constraint) logic programs. The method enables the computations of convex hulls that are required for polyhedral analysis to be coded with linear constraint solving machinery that is available in many Prol...
[ { "created": "Tue, 4 Nov 2003 12:43:54 GMT", "version": "v1" } ]
2007-05-23
[ [ "Benoy", "Florence", "" ], [ "King", "Andy", "" ], [ "Mesnard", "Fred", "" ] ]
A programming tactic involving polyhedra is reported that has been widely applied in the polyhedral analysis of (constraint) logic programs. The method enables the computations of convex hulls that are required for polyhedral analysis to be coded with linear constraint solving machinery that is available in many Prolog...
2309.01446
Raz Lapid
Raz Lapid, Ron Langberg, Moshe Sipper
Open Sesame! Universal Black Box Jailbreaking of Large Language Models
Accepted at SeT-LLM @ ICLR 2024
ICLR 2024 Workshop on Secure and Trustworthy Large Language Models
null
null
cs.CL cs.CV cs.NE
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Large language models (LLMs), designed to provide helpful and safe responses, often rely on alignment techniques to align with user intent and social guidelines. Unfortunately, this alignment can be exploited by malicious actors seeking to manipulate an LLM's outputs for unintended purposes. In this paper we introduc...
[ { "created": "Mon, 4 Sep 2023 08:54:20 GMT", "version": "v1" }, { "created": "Sun, 17 Sep 2023 13:19:11 GMT", "version": "v2" }, { "created": "Tue, 21 Nov 2023 14:02:33 GMT", "version": "v3" }, { "created": "Mon, 5 Aug 2024 11:34:10 GMT", "version": "v4" } ]
2024-08-06
[ [ "Lapid", "Raz", "" ], [ "Langberg", "Ron", "" ], [ "Sipper", "Moshe", "" ] ]
Large language models (LLMs), designed to provide helpful and safe responses, often rely on alignment techniques to align with user intent and social guidelines. Unfortunately, this alignment can be exploited by malicious actors seeking to manipulate an LLM's outputs for unintended purposes. In this paper we introduce ...
2402.17863
Young Kyung Kim
Young Kyung Kim, J. Mat\'ias Di Martino, Guillermo Sapiro
Vision Transformers with Natural Language Semantics
22 pages, 9 figures
null
null
null
cs.CV
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Tokens or patches within Vision Transformers (ViT) lack essential semantic information, unlike their counterparts in natural language processing (NLP). Typically, ViT tokens are associated with rectangular image patches that lack specific semantic context, making interpretation difficult and failing to effectively en...
[ { "created": "Tue, 27 Feb 2024 19:54:42 GMT", "version": "v1" } ]
2024-02-29
[ [ "Kim", "Young Kyung", "" ], [ "Di Martino", "J. Matías", "" ], [ "Sapiro", "Guillermo", "" ] ]
Tokens or patches within Vision Transformers (ViT) lack essential semantic information, unlike their counterparts in natural language processing (NLP). Typically, ViT tokens are associated with rectangular image patches that lack specific semantic context, making interpretation difficult and failing to effectively enca...
1705.05254
Yanjing Wang
Raul Fervari, Andreas Herzig, Yanjun Li, Yanjing Wang
Strategically knowing how
an earlier version of the paper to appear in IJCAI 2017
null
null
null
cs.AI cs.LO
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
In this paper, we propose a single-agent logic of goal-directed knowing how extending the standard epistemic logic of knowing that with a new knowing how operator. The semantics of the new operator is based on the idea that knowing how to achieve $\phi$ means that there exists a (uniform) strategy such that the agent...
[ { "created": "Mon, 15 May 2017 14:12:16 GMT", "version": "v1" } ]
2017-05-16
[ [ "Fervari", "Raul", "" ], [ "Herzig", "Andreas", "" ], [ "Li", "Yanjun", "" ], [ "Wang", "Yanjing", "" ] ]
In this paper, we propose a single-agent logic of goal-directed knowing how extending the standard epistemic logic of knowing that with a new knowing how operator. The semantics of the new operator is based on the idea that knowing how to achieve $\phi$ means that there exists a (uniform) strategy such that the agent k...
2303.04352
Robert Wray
Robert E. Wray, Steven J. Jones, John E. Laird
Computational-level Analysis of Constraint Compliance for General Intelligence
10 pages, 2 figures. Accepted for presentation at AGI 2023. Corrected author list (segmented list) and abstract text artifacts
null
null
null
cs.AI
http://creativecommons.org/licenses/by-nc-sa/4.0/
Human behavior is conditioned by codes and norms that constrain action. Rules, ``manners,'' laws, and moral imperatives are examples of classes of constraints that govern human behavior. These systems of constraints are "messy:" individual constraints are often poorly defined, what constraints are relevant in a parti...
[ { "created": "Wed, 8 Mar 2023 03:25:24 GMT", "version": "v1" }, { "created": "Mon, 10 Apr 2023 17:58:41 GMT", "version": "v2" }, { "created": "Thu, 15 Jun 2023 15:03:11 GMT", "version": "v3" } ]
2023-06-16
[ [ "Wray", "Robert E.", "" ], [ "Jones", "Steven J.", "" ], [ "Laird", "John E.", "" ] ]
Human behavior is conditioned by codes and norms that constrain action. Rules, ``manners,'' laws, and moral imperatives are examples of classes of constraints that govern human behavior. These systems of constraints are "messy:" individual constraints are often poorly defined, what constraints are relevant in a particu...
1008.1848
Kamaljit I Lakhtaria
Kamaljit I. Lakhtaria
Enhancing QOS and QOE in IMS enabled next generation networks
null
null
10.5121/jgraphoc.2010.2206
International journal on applications of graph theory in wireless ad hoc networks and sensor networks (GRAPH-HOC) Vol.2, No.2, June 2010
cs.NI
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Managing network complexity, accommodating greater numbers of subscribers, improving coverage to support data services (e.g. email, video, and music downloads), keeping up to speed with fast-changing technology, and driving maximum value from existing networks - all while reducing CapEX and OpEX and ensuring Quality ...
[ { "created": "Wed, 11 Aug 2010 07:47:27 GMT", "version": "v1" } ]
2010-08-12
[ [ "Lakhtaria", "Kamaljit I.", "" ] ]
Managing network complexity, accommodating greater numbers of subscribers, improving coverage to support data services (e.g. email, video, and music downloads), keeping up to speed with fast-changing technology, and driving maximum value from existing networks - all while reducing CapEX and OpEX and ensuring Quality of...
2311.09945
Qirui Tang
Qirui Tang, Wenkang Jiang, Yihua Du, Lei Lin
An Attention-Based Denoising Framework for Personality Detection in Social Media Texts
null
null
null
null
cs.CY cs.CL
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
In social media networks, users produce a large amount of text content anytime, providing researchers with a valuable approach to digging for personality-related information. Personality detection based on user-generated texts is a universal method that can be used to build user portraits. The presence of noise in so...
[ { "created": "Thu, 16 Nov 2023 14:56:09 GMT", "version": "v1" } ]
2023-11-17
[ [ "Tang", "Qirui", "" ], [ "Jiang", "Wenkang", "" ], [ "Du", "Yihua", "" ], [ "Lin", "Lei", "" ] ]
In social media networks, users produce a large amount of text content anytime, providing researchers with a valuable approach to digging for personality-related information. Personality detection based on user-generated texts is a universal method that can be used to build user portraits. The presence of noise in soci...
1604.07370
Christian Stab
Christian Stab and Iryna Gurevych
Parsing Argumentation Structures in Persuasive Essays
Under review in Computational Linguistics. First submission: 26 October 2015. Revised submission: 15 July 2016
null
null
null
cs.CL
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
In this article, we present a novel approach for parsing argumentation structures. We identify argument components using sequence labeling at the token level and apply a new joint model for detecting argumentation structures. The proposed model globally optimizes argument component types and argumentative relations u...
[ { "created": "Mon, 25 Apr 2016 19:19:04 GMT", "version": "v1" }, { "created": "Fri, 22 Jul 2016 11:55:03 GMT", "version": "v2" } ]
2016-07-25
[ [ "Stab", "Christian", "" ], [ "Gurevych", "Iryna", "" ] ]
In this article, we present a novel approach for parsing argumentation structures. We identify argument components using sequence labeling at the token level and apply a new joint model for detecting argumentation structures. The proposed model globally optimizes argument component types and argumentative relations usi...
2006.05975
Ruoqi Shen
Simon S. Du, Wei Hu, Zhiyuan Li, Ruoqi Shen, Zhao Song, Jiajun Wu
When is Particle Filtering Efficient for Planning in Partially Observed Linear Dynamical Systems?
null
null
null
null
cs.LG math.OC stat.ML
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Particle filtering is a popular method for inferring latent states in stochastic dynamical systems, whose theoretical properties have been well studied in machine learning and statistics communities. In many control problems, e.g., partially observed linear dynamical systems (POLDS), oftentimes the inferred latent st...
[ { "created": "Wed, 10 Jun 2020 17:43:43 GMT", "version": "v1" }, { "created": "Fri, 9 Jul 2021 01:28:42 GMT", "version": "v2" } ]
2021-07-12
[ [ "Du", "Simon S.", "" ], [ "Hu", "Wei", "" ], [ "Li", "Zhiyuan", "" ], [ "Shen", "Ruoqi", "" ], [ "Song", "Zhao", "" ], [ "Wu", "Jiajun", "" ] ]
Particle filtering is a popular method for inferring latent states in stochastic dynamical systems, whose theoretical properties have been well studied in machine learning and statistics communities. In many control problems, e.g., partially observed linear dynamical systems (POLDS), oftentimes the inferred latent stat...
2207.08902
Seungwoo Jeong
Seungwoo Jeong, Taekwon Ga, Inhwan Jeong, Jongkyu Oh, and Jongeun Choi
Layered Cost-Map-Based Traffic Management for Multiple Automated Mobile Robots via a Data Distribution Service
8 pages, 13 figures
null
null
null
cs.RO cs.MA cs.SY eess.SY
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
This letter proposes traffic management for multiple automated mobile robots (AMRs) based on a layered cost map. Multiple AMRs communicate via a data distribution service (DDS), which is shared by topics in the same DDS domain. The cost of each layer is manipulated by topics. The traffic management server in the doma...
[ { "created": "Mon, 18 Jul 2022 19:23:30 GMT", "version": "v1" } ]
2022-07-20
[ [ "Jeong", "Seungwoo", "" ], [ "Ga", "Taekwon", "" ], [ "Jeong", "Inhwan", "" ], [ "Oh", "Jongkyu", "" ], [ "Choi", "Jongeun", "" ] ]
This letter proposes traffic management for multiple automated mobile robots (AMRs) based on a layered cost map. Multiple AMRs communicate via a data distribution service (DDS), which is shared by topics in the same DDS domain. The cost of each layer is manipulated by topics. The traffic management server in the domain...
2011.12259
Jiehua Chen
Jiehua Chen and Sanjukta Roy and Manuel Sorge
Fractional Matchings under Preferences: Stability and Optimality
null
null
null
null
cs.GT
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
We thoroughly study a generalized version of the classic Stable Marriage and Stable Roommates problems where agents may share partners. We consider two prominent stability concepts: ordinal stability [Aharoni and Fleiner, Journal of Combinatorial Theory, 2003] and cardinal stability [Caragiannis et al., ACM EC 2019] ...
[ { "created": "Tue, 24 Nov 2020 18:12:23 GMT", "version": "v1" } ]
2020-11-25
[ [ "Chen", "Jiehua", "" ], [ "Roy", "Sanjukta", "" ], [ "Sorge", "Manuel", "" ] ]
We thoroughly study a generalized version of the classic Stable Marriage and Stable Roommates problems where agents may share partners. We consider two prominent stability concepts: ordinal stability [Aharoni and Fleiner, Journal of Combinatorial Theory, 2003] and cardinal stability [Caragiannis et al., ACM EC 2019] an...
1804.08420
Qiang Ning
Qiang Ning, Zhongzhi Yu, Chuchu Fan, Dan Roth
Exploiting Partially Annotated Data for Temporal Relation Extraction
[Final Version] short paper accepted by *SEM'18
null
null
null
cs.CL cs.LG stat.ML
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Annotating temporal relations (TempRel) between events described in natural language is known to be labor intensive, partly because the total number of TempRels is quadratic in the number of events. As a result, only a small number of documents are typically annotated, limiting the coverage of various lexical/semanti...
[ { "created": "Wed, 18 Apr 2018 21:33:00 GMT", "version": "v1" }, { "created": "Wed, 25 Apr 2018 02:31:40 GMT", "version": "v2" } ]
2018-04-26
[ [ "Ning", "Qiang", "" ], [ "Yu", "Zhongzhi", "" ], [ "Fan", "Chuchu", "" ], [ "Roth", "Dan", "" ] ]
Annotating temporal relations (TempRel) between events described in natural language is known to be labor intensive, partly because the total number of TempRels is quadratic in the number of events. As a result, only a small number of documents are typically annotated, limiting the coverage of various lexical/semantic ...
1601.06454
Emiliano De Cristofaro
Luca Melis and Hassan Jameel Asghar and Emiliano De Cristofaro and Mohamed Ali Kaafar
Private Processing of Outsourced Network Functions: Feasibility and Constructions
A preliminary version of this paper appears in the 1st ACM International Workshop on Security in Software Defined Networks & Network Function Virtualization. This is the full version
null
10.1145/2876019.2876021
null
cs.CR
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Aiming to reduce the cost and complexity of maintaining networking infrastructures, organizations are increasingly outsourcing their network functions (e.g., firewalls, traffic shapers and intrusion detection systems) to the cloud, and a number of industrial players have started to offer network function virtualizati...
[ { "created": "Mon, 25 Jan 2016 00:24:49 GMT", "version": "v1" } ]
2016-01-26
[ [ "Melis", "Luca", "" ], [ "Asghar", "Hassan Jameel", "" ], [ "De Cristofaro", "Emiliano", "" ], [ "Kaafar", "Mohamed Ali", "" ] ]
Aiming to reduce the cost and complexity of maintaining networking infrastructures, organizations are increasingly outsourcing their network functions (e.g., firewalls, traffic shapers and intrusion detection systems) to the cloud, and a number of industrial players have started to offer network function virtualization...
2306.07856
Alessandro Palmarini
Alessandro B. Palmarini, Christopher G. Lucas, N. Siddharth
Bayesian Program Learning by Decompiling Amortized Knowledge
null
null
null
null
cs.AI cs.LG cs.SE
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
DreamCoder is an inductive program synthesis system that, whilst solving problems, learns to simplify search in an iterative wake-sleep procedure. The cost of search is amortized by training a neural search policy, reducing search breadth and effectively "compiling" useful information to compose program solutions acr...
[ { "created": "Tue, 13 Jun 2023 15:35:01 GMT", "version": "v1" }, { "created": "Sun, 1 Oct 2023 15:01:45 GMT", "version": "v2" }, { "created": "Fri, 31 May 2024 15:14:58 GMT", "version": "v3" } ]
2024-06-03
[ [ "Palmarini", "Alessandro B.", "" ], [ "Lucas", "Christopher G.", "" ], [ "Siddharth", "N.", "" ] ]
DreamCoder is an inductive program synthesis system that, whilst solving problems, learns to simplify search in an iterative wake-sleep procedure. The cost of search is amortized by training a neural search policy, reducing search breadth and effectively "compiling" useful information to compose program solutions acros...
1910.05518
Seunghan Yang
Seunghan Yang, Yoonhyung Kim, Youngeun Kim, and Changick Kim
Combinational Class Activation Maps for Weakly Supervised Object Localization
The paper was accepted to the IEEE Winter Conference on Applications of Computer Vision (WACV'2020)
null
null
null
cs.CV
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Weakly supervised object localization has recently attracted attention since it aims to identify both class labels and locations of objects by using image-level labels. Most previous methods utilize the activation map corresponding to the highest activation source. Exploiting only one activation map of the highest pr...
[ { "created": "Sat, 12 Oct 2019 07:29:59 GMT", "version": "v1" }, { "created": "Thu, 19 Dec 2019 07:53:46 GMT", "version": "v2" } ]
2019-12-20
[ [ "Yang", "Seunghan", "" ], [ "Kim", "Yoonhyung", "" ], [ "Kim", "Youngeun", "" ], [ "Kim", "Changick", "" ] ]
Weakly supervised object localization has recently attracted attention since it aims to identify both class labels and locations of objects by using image-level labels. Most previous methods utilize the activation map corresponding to the highest activation source. Exploiting only one activation map of the highest prob...
1402.1697
Abhishek Halder
Abhishek Halder, Raktim Bhattacharya
Geodesic Density Tracking with Applications to Data Driven Modeling
8 pages, 7 figures
null
null
null
cs.SY math.OC
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Many problems in dynamic data driven modeling deals with distributed rather than lumped observations. In this paper, we show that the Monge-Kantorovich optimal transport theory provides a unifying framework to tackle such problems in the systems-control parlance. Specifically, given distributional measurements at arb...
[ { "created": "Fri, 7 Feb 2014 17:17:54 GMT", "version": "v1" } ]
2014-02-10
[ [ "Halder", "Abhishek", "" ], [ "Bhattacharya", "Raktim", "" ] ]
Many problems in dynamic data driven modeling deals with distributed rather than lumped observations. In this paper, we show that the Monge-Kantorovich optimal transport theory provides a unifying framework to tackle such problems in the systems-control parlance. Specifically, given distributional measurements at arbit...
0912.3970
William Jackson
Nitin A. Naik, Gajanan D. Kurundkar, Santosh D. Khamitkar, Namdeo V. Kalyankar
Penetration Testing: A Roadmap to Network Security
null
Journal of Computing, Volume 1, Issue 1, pp 187-190, December 2009
null
null
cs.NI cs.CR
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Network penetration testing identifies the exploits and vulnerabilities those exist within computer network infrastructure and help to confirm the security measures. The objective of this paper is to explain methodology and methods behind penetration testing and illustrate remedies over it, which will provide substan...
[ { "created": "Sun, 20 Dec 2009 03:39:53 GMT", "version": "v1" }, { "created": "Sat, 26 Dec 2009 15:10:20 GMT", "version": "v2" } ]
2009-12-26
[ [ "Naik", "Nitin A.", "" ], [ "Kurundkar", "Gajanan D.", "" ], [ "Khamitkar", "Santosh D.", "" ], [ "Kalyankar", "Namdeo V.", "" ] ]
Network penetration testing identifies the exploits and vulnerabilities those exist within computer network infrastructure and help to confirm the security measures. The objective of this paper is to explain methodology and methods behind penetration testing and illustrate remedies over it, which will provide substanti...
1808.01423
Chris Tensmeyer
Chris Tensmeyer, Curtis Wigington, Brian Davis, Seth Stewart, Tony Martinez, William Barrett
Language Model Supervision for Handwriting Recognition Model Adaptation
null
null
null
null
cs.CV
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Training state-of-the-art offline handwriting recognition (HWR) models requires large labeled datasets, but unfortunately such datasets are not available in all languages and domains due to the high cost of manual labeling.We address this problem by showing how high resource languages can be leveraged to help train m...
[ { "created": "Sat, 4 Aug 2018 04:27:05 GMT", "version": "v1" } ]
2018-08-07
[ [ "Tensmeyer", "Chris", "" ], [ "Wigington", "Curtis", "" ], [ "Davis", "Brian", "" ], [ "Stewart", "Seth", "" ], [ "Martinez", "Tony", "" ], [ "Barrett", "William", "" ] ]
Training state-of-the-art offline handwriting recognition (HWR) models requires large labeled datasets, but unfortunately such datasets are not available in all languages and domains due to the high cost of manual labeling.We address this problem by showing how high resource languages can be leveraged to help train mod...
2110.12493
Yaxiong Lei
Shijing He and Yaxiong Lei
The privacy protection effectiveness of the video conference platforms' virtual background and the privacy concerns from the end-users
null
null
null
null
cs.HC
http://creativecommons.org/licenses/by/4.0/
Due to the abrupt arise of pandemic worldwide, the video conferencing platforms are becoming ubiquitously available and being embedded into either various digital devices or the collaborative daily work. Even though the service provider has designed many security functions to protect individual's privacy, such as vir...
[ { "created": "Sun, 24 Oct 2021 17:22:25 GMT", "version": "v1" } ]
2021-10-26
[ [ "He", "Shijing", "" ], [ "Lei", "Yaxiong", "" ] ]
Due to the abrupt arise of pandemic worldwide, the video conferencing platforms are becoming ubiquitously available and being embedded into either various digital devices or the collaborative daily work. Even though the service provider has designed many security functions to protect individual's privacy, such as virtu...
2401.01469
Walid Saba
Walid Saba, Suzanne Wendelken and James. Shanahan
Question-Answering Based Summarization of Electronic Health Records using Retrieval Augmented Generation
null
null
null
null
cs.CL cs.AI
http://creativecommons.org/licenses/by/4.0/
Summarization of electronic health records (EHRs) can substantially minimize 'screen time' for both patients as well as medical personnel. In recent years summarization of EHRs have employed machine learning pipelines using state of the art neural models. However, these models have produced less than adequate results...
[ { "created": "Wed, 3 Jan 2024 00:09:34 GMT", "version": "v1" } ]
2024-01-04
[ [ "Saba", "Walid", "" ], [ "Wendelken", "Suzanne", "" ], [ "Shanahan", "James.", "" ] ]
Summarization of electronic health records (EHRs) can substantially minimize 'screen time' for both patients as well as medical personnel. In recent years summarization of EHRs have employed machine learning pipelines using state of the art neural models. However, these models have produced less than adequate results t...
0909.0095
Rakesh Mohanty
Rakesh Mohanty and N. S. Narayanaswamy
Online Algorithms for Self-Organizing Sequential Search - A Survey
null
null
null
null
cs.DS
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
The main objective of this survey is to present the important theoretical and experimental results contributed till date in the area of online algorithms for the self organizing sequential search problem, also popularly known as the List Update Problem(LUP) in a chronological way. The survey includes competitiveness ...
[ { "created": "Tue, 1 Sep 2009 05:46:32 GMT", "version": "v1" }, { "created": "Wed, 2 Sep 2009 03:48:38 GMT", "version": "v2" } ]
2009-09-02
[ [ "Mohanty", "Rakesh", "" ], [ "Narayanaswamy", "N. S.", "" ] ]
The main objective of this survey is to present the important theoretical and experimental results contributed till date in the area of online algorithms for the self organizing sequential search problem, also popularly known as the List Update Problem(LUP) in a chronological way. The survey includes competitiveness re...
2207.04686
Prateek Varshney
Prateek Varshney, Abhradeep Thakurta, Prateek Jain
(Nearly) Optimal Private Linear Regression via Adaptive Clipping
41 Pages, Accepted in the 35th Annual Conference on Learning Theory (COLT 2022)
null
null
null
cs.LG cs.CR math.OC stat.ML
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
We study the problem of differentially private linear regression where each data point is sampled from a fixed sub-Gaussian style distribution. We propose and analyze a one-pass mini-batch stochastic gradient descent method (DP-AMBSSGD) where points in each iteration are sampled without replacement. Noise is added fo...
[ { "created": "Mon, 11 Jul 2022 08:04:46 GMT", "version": "v1" }, { "created": "Tue, 12 Jul 2022 21:09:52 GMT", "version": "v2" } ]
2022-07-14
[ [ "Varshney", "Prateek", "" ], [ "Thakurta", "Abhradeep", "" ], [ "Jain", "Prateek", "" ] ]
We study the problem of differentially private linear regression where each data point is sampled from a fixed sub-Gaussian style distribution. We propose and analyze a one-pass mini-batch stochastic gradient descent method (DP-AMBSSGD) where points in each iteration are sampled without replacement. Noise is added for ...
1904.09571
Wayne Wu
Wayne Wu, Kaidi Cao, Cheng Li, Chen Qian, Chen Change Loy
TransGaGa: Geometry-Aware Unsupervised Image-to-Image Translation
Accepted to CVPR 2019. Project page: https://wywu.github.io/projects/TGaGa/TGaGa.html
null
null
null
cs.CV
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Unsupervised image-to-image translation aims at learning a mapping between two visual domains. However, learning a translation across large geometry variations always ends up with failure. In this work, we present a novel disentangle-and-translate framework to tackle the complex objects image-to-image translation tas...
[ { "created": "Sun, 21 Apr 2019 09:42:10 GMT", "version": "v1" } ]
2019-04-23
[ [ "Wu", "Wayne", "" ], [ "Cao", "Kaidi", "" ], [ "Li", "Cheng", "" ], [ "Qian", "Chen", "" ], [ "Loy", "Chen Change", "" ] ]
Unsupervised image-to-image translation aims at learning a mapping between two visual domains. However, learning a translation across large geometry variations always ends up with failure. In this work, we present a novel disentangle-and-translate framework to tackle the complex objects image-to-image translation task....
cs/0511049
Gus Gutoski
Gus Gutoski
Entropy, Convex Optimization, and Competitive Quantum Interactions
withdrawn
null
null
null
cs.CC cs.GT quant-ph
null
This paper has been withdrawn by the author due to errors.
[ { "created": "Sat, 12 Nov 2005 21:15:40 GMT", "version": "v1" }, { "created": "Mon, 21 Nov 2005 23:09:33 GMT", "version": "v2" }, { "created": "Mon, 30 Oct 2006 20:16:50 GMT", "version": "v3" } ]
2007-05-23
[ [ "Gutoski", "Gus", "" ] ]
This paper has been withdrawn by the author due to errors.
1907.11090
Heyang Gong
Gong Heyang and Zhu Ke
Info Intervention
See more information on Causal AI: https://sites.google.com/view/minituring/home
null
null
null
cs.AI cs.LG stat.ME stat.ML
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Causal diagrams based on do intervention are useful tools to formalize, process and understand causal relationship among variables. However, the do intervention has controversial interpretation of causal questions for non-manipulable variables, and it also lacks the power to check the conditions related to counterfac...
[ { "created": "Wed, 24 Jul 2019 07:31:14 GMT", "version": "v1" }, { "created": "Sun, 29 Dec 2019 02:59:06 GMT", "version": "v2" }, { "created": "Thu, 16 Apr 2020 15:33:59 GMT", "version": "v3" }, { "created": "Fri, 17 Apr 2020 03:22:07 GMT", "version": "v4" }, { "c...
2020-06-03
[ [ "Heyang", "Gong", "" ], [ "Ke", "Zhu", "" ] ]
Causal diagrams based on do intervention are useful tools to formalize, process and understand causal relationship among variables. However, the do intervention has controversial interpretation of causal questions for non-manipulable variables, and it also lacks the power to check the conditions related to counterfactu...
2108.06180
Jiafei Duan
Jiafei Duan, Samson Yu Bai Jian, Cheston Tan
SPACE: A Simulator for Physical Interactions and Causal Learning in 3D Environments
Accepted to ICCV 21, Simulation Technology for Embodied AI (SEAI) Workshop
null
null
null
cs.AI cs.CV
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Recent advancements in deep learning, computer vision, and embodied AI have given rise to synthetic causal reasoning video datasets. These datasets facilitate the development of AI algorithms that can reason about physical interactions between objects. However, datasets thus far have primarily focused on elementary p...
[ { "created": "Fri, 13 Aug 2021 11:49:46 GMT", "version": "v1" } ]
2021-08-16
[ [ "Duan", "Jiafei", "" ], [ "Jian", "Samson Yu Bai", "" ], [ "Tan", "Cheston", "" ] ]
Recent advancements in deep learning, computer vision, and embodied AI have given rise to synthetic causal reasoning video datasets. These datasets facilitate the development of AI algorithms that can reason about physical interactions between objects. However, datasets thus far have primarily focused on elementary phy...
2311.07975
Zhilin Zhao
Zhilin Zhao and Longbing Cao and Yixuan Zhang
Out-of-Distribution Knowledge Distillation via Confidence Amendment
null
null
null
null
cs.LG
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Out-of-distribution (OOD) detection is essential in identifying test samples that deviate from the in-distribution (ID) data upon which a standard network is trained, ensuring network robustness and reliability. This paper introduces OOD knowledge distillation, a pioneering learning framework applicable whether or no...
[ { "created": "Tue, 14 Nov 2023 08:05:02 GMT", "version": "v1" } ]
2023-11-15
[ [ "Zhao", "Zhilin", "" ], [ "Cao", "Longbing", "" ], [ "Zhang", "Yixuan", "" ] ]
Out-of-distribution (OOD) detection is essential in identifying test samples that deviate from the in-distribution (ID) data upon which a standard network is trained, ensuring network robustness and reliability. This paper introduces OOD knowledge distillation, a pioneering learning framework applicable whether or not ...
1911.08642
Adam Eck
Adam Eck, Maulik Shah, Prashant Doshi, and Leen-Kiat Soh
Scalable Decision-Theoretic Planning in Open and Typed Multiagent Systems
Pre-print with appendices for AAAI 2020
null
null
null
cs.MA
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
In open agent systems, the set of agents that are cooperating or competing changes over time and in ways that are nontrivial to predict. For example, if collaborative robots were tasked with fighting wildfires, they may run out of suppressants and be temporarily unavailable to assist their peers. We consider the prob...
[ { "created": "Wed, 20 Nov 2019 00:39:36 GMT", "version": "v1" } ]
2019-11-21
[ [ "Eck", "Adam", "" ], [ "Shah", "Maulik", "" ], [ "Doshi", "Prashant", "" ], [ "Soh", "Leen-Kiat", "" ] ]
In open agent systems, the set of agents that are cooperating or competing changes over time and in ways that are nontrivial to predict. For example, if collaborative robots were tasked with fighting wildfires, they may run out of suppressants and be temporarily unavailable to assist their peers. We consider the proble...
2011.01506
Narayanan Chatapuram Krishnan
Rajat Sharma, Nikhil Reddy, Vidhya Kamakshi, Narayanan C Krishnan, Shweta Jain
MAIRE -- A Model-Agnostic Interpretable Rule Extraction Procedure for Explaining Classifiers
null
null
null
null
cs.AI cs.LG
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
The paper introduces a novel framework for extracting model-agnostic human interpretable rules to explain a classifier's output. The human interpretable rule is defined as an axis-aligned hyper-cuboid containing the instance for which the classification decision has to be explained. The proposed procedure finds the l...
[ { "created": "Tue, 3 Nov 2020 06:53:06 GMT", "version": "v1" } ]
2020-11-04
[ [ "Sharma", "Rajat", "" ], [ "Reddy", "Nikhil", "" ], [ "Kamakshi", "Vidhya", "" ], [ "Krishnan", "Narayanan C", "" ], [ "Jain", "Shweta", "" ] ]
The paper introduces a novel framework for extracting model-agnostic human interpretable rules to explain a classifier's output. The human interpretable rule is defined as an axis-aligned hyper-cuboid containing the instance for which the classification decision has to be explained. The proposed procedure finds the lar...
2202.13293
Mahmood Ahmadi
Ameneh Zarei, Shahla Safari, Mahmood Ahmadi, Farhad Mardukhi
Past, Present and Future of Hadoop: A Survey
A survey on Hadoop
null
null
null
cs.NI
http://creativecommons.org/licenses/by/4.0/
In this paper, a technology for massive data storage and computing named Hadoop is surveyed. Hadoop consists of heterogeneous computing devices like regular PCs abstracting away the details of parallel processing and developers can just concentrate on their computational problem. A Hadoop cluster is made of two parts...
[ { "created": "Sun, 27 Feb 2022 05:09:09 GMT", "version": "v1" } ]
2022-03-01
[ [ "Zarei", "Ameneh", "" ], [ "Safari", "Shahla", "" ], [ "Ahmadi", "Mahmood", "" ], [ "Mardukhi", "Farhad", "" ] ]
In this paper, a technology for massive data storage and computing named Hadoop is surveyed. Hadoop consists of heterogeneous computing devices like regular PCs abstracting away the details of parallel processing and developers can just concentrate on their computational problem. A Hadoop cluster is made of two parts: ...
1805.04737
Dongrui Wu
Dongrui Wu, Vernon J. Lawhern, Stephen Gordon, Brent J. Lance, Chin-Teng Lin
Offline EEG-Based Driver Drowsiness Estimation Using Enhanced Batch-Mode Active Learning (EBMAL) for Regression
null
IEEE Int'l. Conf. on Systems, Man and Cybernetics, pp. 730-736, Budapest, Hungary, 2016
null
null
cs.LG cs.HC stat.ML
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
There are many important regression problems in real-world brain-computer interface (BCI) applications, e.g., driver drowsiness estimation from EEG signals. This paper considers offline analysis: given a pool of unlabeled EEG epochs recorded during driving, how do we optimally select a small number of them to label s...
[ { "created": "Sat, 12 May 2018 15:36:05 GMT", "version": "v1" } ]
2020-03-31
[ [ "Wu", "Dongrui", "" ], [ "Lawhern", "Vernon J.", "" ], [ "Gordon", "Stephen", "" ], [ "Lance", "Brent J.", "" ], [ "Lin", "Chin-Teng", "" ] ]
There are many important regression problems in real-world brain-computer interface (BCI) applications, e.g., driver drowsiness estimation from EEG signals. This paper considers offline analysis: given a pool of unlabeled EEG epochs recorded during driving, how do we optimally select a small number of them to label so ...
1903.03731
Hirak Jyoti Kashyap
Hirak J Kashyap, Charless Fowlkes, Jeffrey L Krichmar
Sparse Representations for Object and Ego-motion Estimation in Dynamic Scenes
With supplementary material
null
10.1109/TNNLS.2020.3006467
null
cs.CV cs.LG
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Dynamic scenes that contain both object motion and egomotion are a challenge for monocular visual odometry (VO). Another issue with monocular VO is the scale ambiguity, i.e. these methods cannot estimate scene depth and camera motion in real scale. Here, we propose a learning based approach to predict camera motion p...
[ { "created": "Sat, 9 Mar 2019 03:56:53 GMT", "version": "v1" } ]
2020-08-31
[ [ "Kashyap", "Hirak J", "" ], [ "Fowlkes", "Charless", "" ], [ "Krichmar", "Jeffrey L", "" ] ]
Dynamic scenes that contain both object motion and egomotion are a challenge for monocular visual odometry (VO). Another issue with monocular VO is the scale ambiguity, i.e. these methods cannot estimate scene depth and camera motion in real scale. Here, we propose a learning based approach to predict camera motion par...
2012.11866
Zehua Sun
Zehua Sun, Qiuhong Ke, Hossein Rahmani, Mohammed Bennamoun, Gang Wang and Jun Liu
Human Action Recognition from Various Data Modalities: A Review
null
null
10.1109/TPAMI.2022.3183112
null
cs.CV
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Human Action Recognition (HAR) aims to understand human behavior and assign a label to each action. It has a wide range of applications, and therefore has been attracting increasing attention in the field of computer vision. Human actions can be represented using various data modalities, such as RGB, skeleton, depth,...
[ { "created": "Tue, 22 Dec 2020 07:37:43 GMT", "version": "v1" }, { "created": "Mon, 28 Dec 2020 05:34:43 GMT", "version": "v2" }, { "created": "Fri, 29 Jan 2021 12:13:25 GMT", "version": "v3" }, { "created": "Fri, 23 Jul 2021 15:30:59 GMT", "version": "v4" }, { "c...
2022-06-22
[ [ "Sun", "Zehua", "" ], [ "Ke", "Qiuhong", "" ], [ "Rahmani", "Hossein", "" ], [ "Bennamoun", "Mohammed", "" ], [ "Wang", "Gang", "" ], [ "Liu", "Jun", "" ] ]
Human Action Recognition (HAR) aims to understand human behavior and assign a label to each action. It has a wide range of applications, and therefore has been attracting increasing attention in the field of computer vision. Human actions can be represented using various data modalities, such as RGB, skeleton, depth, i...
2005.10788
Anastasiya Gorodilova
Anastasiya Gorodilova
A note on the properties of associated Boolean functions of quadratic APN functions
null
Prikladnaya Diskretnaya Matematika. 2020. No 47, pp 16-21
10.17223/20710410/47/2
null
cs.DM math.CO
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Let $F$ be a quadratic APN function of $n$ variables. The associated Boolean function $\gamma_F$ in $2n$ variables ($\gamma_F(a,b)=1$ if $a\neq{\bf 0}$ and equation $F(x)+F(x+a)=b$ has solutions) has the form $\gamma_F(a,b) = \Phi_F(a) \cdot b + \varphi_F(a) + 1$ for appropriate functions $\Phi_F:\mathbb{F}_2^n\to \m...
[ { "created": "Thu, 21 May 2020 17:10:53 GMT", "version": "v1" } ]
2020-05-22
[ [ "Gorodilova", "Anastasiya", "" ] ]
Let $F$ be a quadratic APN function of $n$ variables. The associated Boolean function $\gamma_F$ in $2n$ variables ($\gamma_F(a,b)=1$ if $a\neq{\bf 0}$ and equation $F(x)+F(x+a)=b$ has solutions) has the form $\gamma_F(a,b) = \Phi_F(a) \cdot b + \varphi_F(a) + 1$ for appropriate functions $\Phi_F:\mathbb{F}_2^n\to \mat...
1604.02815
Dan Rosenbaum
Dan Rosenbaum and Yair Weiss
Beyond Brightness Constancy: Learning Noise Models for Optical Flow
null
null
null
null
cs.CV
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Optical flow is typically estimated by minimizing a "data cost" and an optional regularizer. While there has been much work on different regularizers many modern algorithms still use a data cost that is not very different from the ones used over 30 years ago: a robust version of brightness constancy or gradient const...
[ { "created": "Mon, 11 Apr 2016 07:23:44 GMT", "version": "v1" } ]
2016-04-12
[ [ "Rosenbaum", "Dan", "" ], [ "Weiss", "Yair", "" ] ]
Optical flow is typically estimated by minimizing a "data cost" and an optional regularizer. While there has been much work on different regularizers many modern algorithms still use a data cost that is not very different from the ones used over 30 years ago: a robust version of brightness constancy or gradient constan...
1303.2489
Juan Antonio Navarro P\'erez
Juan Antonio Navarro-P\'erez and Andrey Rybalchenko
Separation Logic Modulo Theories
16 pages
null
null
null
cs.LO
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Logical reasoning about program data often requires dealing with heap structures as well as scalar data types. Recent advances in Satisfiability Modular Theory (SMT) already offer efficient procedures for dealing with scalars, yet they lack any support for dealing with heap structures. In this paper, we present an ap...
[ { "created": "Mon, 11 Mar 2013 11:22:51 GMT", "version": "v1" } ]
2013-03-12
[ [ "Navarro-Pérez", "Juan Antonio", "" ], [ "Rybalchenko", "Andrey", "" ] ]
Logical reasoning about program data often requires dealing with heap structures as well as scalar data types. Recent advances in Satisfiability Modular Theory (SMT) already offer efficient procedures for dealing with scalars, yet they lack any support for dealing with heap structures. In this paper, we present an appr...
2406.02542
Prajwal Singhania
Prajwal Singhania, Siddharth Singh, Shwai He, Soheil Feizi, Abhinav Bhatele
Loki: Low-Rank Keys for Efficient Sparse Attention
null
null
null
null
cs.LG
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Inference on large language models can be expensive in terms of the compute and memory costs involved, especially when long sequence lengths are used. In particular, the self-attention mechanism used in such models contributes significantly to these costs, which has resulted in several recent works that propose spars...
[ { "created": "Tue, 4 Jun 2024 17:58:03 GMT", "version": "v1" } ]
2024-06-05
[ [ "Singhania", "Prajwal", "" ], [ "Singh", "Siddharth", "" ], [ "He", "Shwai", "" ], [ "Feizi", "Soheil", "" ], [ "Bhatele", "Abhinav", "" ] ]
Inference on large language models can be expensive in terms of the compute and memory costs involved, especially when long sequence lengths are used. In particular, the self-attention mechanism used in such models contributes significantly to these costs, which has resulted in several recent works that propose sparse ...
2307.04872
Xinran Zhu
Xinran Zhu, Hong Shui, Bodong Chen
The Synthesis Lab: Empowering Collaborative Learning in Higher Education through Knowledge Synthesis
null
null
null
null
cs.HC cs.CY
http://creativecommons.org/licenses/by-nc-nd/4.0/
The ability to synthesize information has emerged as a critical skill for success across various fields. However, within the field of education, there is a lack of systematic understanding and well-defined design infrastructures that address the mechanisms and processes of knowledge synthesis in collaborative learnin...
[ { "created": "Mon, 10 Jul 2023 19:41:54 GMT", "version": "v1" } ]
2023-07-12
[ [ "Zhu", "Xinran", "" ], [ "Shui", "Hong", "" ], [ "Chen", "Bodong", "" ] ]
The ability to synthesize information has emerged as a critical skill for success across various fields. However, within the field of education, there is a lack of systematic understanding and well-defined design infrastructures that address the mechanisms and processes of knowledge synthesis in collaborative learning ...
1001.0210
Alexander Vardy
Hessam Mahdavifar and Alexander Vardy
Achieving the Secrecy Capacity of Wiretap Channels Using Polar Codes
15 pages, to appear in the IEEE Transactions on Information Theory
null
null
null
cs.IT cs.CR math.IT
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Suppose Alice wishes to send messages to Bob through a communication channel C_1, but her transmissions also reach an eavesdropper Eve through another channel C_2. The goal is to design a coding scheme that makes it possible for Alice to communicate both reliably and securely. Reliability is measured in terms of Bob'...
[ { "created": "Fri, 1 Jan 2010 05:30:10 GMT", "version": "v1" }, { "created": "Mon, 4 Apr 2011 00:48:19 GMT", "version": "v2" } ]
2015-03-13
[ [ "Mahdavifar", "Hessam", "" ], [ "Vardy", "Alexander", "" ] ]
Suppose Alice wishes to send messages to Bob through a communication channel C_1, but her transmissions also reach an eavesdropper Eve through another channel C_2. The goal is to design a coding scheme that makes it possible for Alice to communicate both reliably and securely. Reliability is measured in terms of Bob's ...
2107.04197
John Chen
John Chen, Cameron Wolfe, Anastasios Kyrillidis
REX: Revisiting Budgeted Training with an Improved Schedule
null
null
null
null
cs.LG
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Deep learning practitioners often operate on a computational and monetary budget. Thus, it is critical to design optimization algorithms that perform well under any budget. The linear learning rate schedule is considered the best budget-aware schedule, as it outperforms most other schedules in the low budget regime. ...
[ { "created": "Fri, 9 Jul 2021 04:17:35 GMT", "version": "v1" } ]
2021-07-12
[ [ "Chen", "John", "" ], [ "Wolfe", "Cameron", "" ], [ "Kyrillidis", "Anastasios", "" ] ]
Deep learning practitioners often operate on a computational and monetary budget. Thus, it is critical to design optimization algorithms that perform well under any budget. The linear learning rate schedule is considered the best budget-aware schedule, as it outperforms most other schedules in the low budget regime. On...
2308.01359
Maxime Flin
Maxime Flin, Magn\'us M. Halld\'orsson and Alexandre Nolin
Fast Coloring Despite Congested Relays
37 pages. To appear in proceedings of DISC 2023
null
null
null
cs.DS cs.DC
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
We provide a $O(\log^6 \log n)$-round randomized algorithm for distance-2 coloring in CONGEST with $\Delta^2+1$ colors. For $\Delta\gg\operatorname{poly}\log n$, this improves exponentially on the $O(\log\Delta+\operatorname{poly}\log\log n)$ algorithm of [Halld\'orsson, Kuhn, Maus, Nolin, DISC'20]. Our study is mo...
[ { "created": "Wed, 2 Aug 2023 18:04:52 GMT", "version": "v1" } ]
2023-08-04
[ [ "Flin", "Maxime", "" ], [ "Halldórsson", "Magnús M.", "" ], [ "Nolin", "Alexandre", "" ] ]
We provide a $O(\log^6 \log n)$-round randomized algorithm for distance-2 coloring in CONGEST with $\Delta^2+1$ colors. For $\Delta\gg\operatorname{poly}\log n$, this improves exponentially on the $O(\log\Delta+\operatorname{poly}\log\log n)$ algorithm of [Halld\'orsson, Kuhn, Maus, Nolin, DISC'20]. Our study is motiva...
2408.01346
Luca Maria Aiello
Anders Giovanni M{\o}ller, Luca Maria Aiello
Prompt Refinement or Fine-tuning? Best Practices for using LLMs in Computational Social Science Tasks
5 pages, 1 table
null
null
null
cs.CY cs.CL physics.soc-ph
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Large Language Models are expressive tools that enable complex tasks of text understanding within Computational Social Science. Their versatility, while beneficial, poses a barrier for establishing standardized best practices within the field. To bring clarity on the values of different strategies, we present an over...
[ { "created": "Fri, 2 Aug 2024 15:46:36 GMT", "version": "v1" } ]
2024-08-05
[ [ "Møller", "Anders Giovanni", "" ], [ "Aiello", "Luca Maria", "" ] ]
Large Language Models are expressive tools that enable complex tasks of text understanding within Computational Social Science. Their versatility, while beneficial, poses a barrier for establishing standardized best practices within the field. To bring clarity on the values of different strategies, we present an overvi...
1403.2802
Zhimin Cao
Haoqiang Fan, Zhimin Cao, Yuning Jiang, Qi Yin, Chinchilla Doudou
Learning Deep Face Representation
null
null
null
null
cs.CV cs.LG
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Face representation is a crucial step of face recognition systems. An optimal face representation should be discriminative, robust, compact, and very easy-to-implement. While numerous hand-crafted and learning-based representations have been proposed, considerable room for improvement is still present. In this paper,...
[ { "created": "Wed, 12 Mar 2014 03:47:18 GMT", "version": "v1" } ]
2014-03-13
[ [ "Fan", "Haoqiang", "" ], [ "Cao", "Zhimin", "" ], [ "Jiang", "Yuning", "" ], [ "Yin", "Qi", "" ], [ "Doudou", "Chinchilla", "" ] ]
Face representation is a crucial step of face recognition systems. An optimal face representation should be discriminative, robust, compact, and very easy-to-implement. While numerous hand-crafted and learning-based representations have been proposed, considerable room for improvement is still present. In this paper, w...
1911.03329
Stuart Shieber
Mirac Suzgun and Sebastian Gehrmann and Yonatan Belinkov and Stuart M. Shieber
Memory-Augmented Recurrent Neural Networks Can Learn Generalized Dyck Languages
null
null
null
null
cs.CL cs.LG cs.NE
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
We introduce three memory-augmented Recurrent Neural Networks (MARNNs) and explore their capabilities on a series of simple language modeling tasks whose solutions require stack-based mechanisms. We provide the first demonstration of neural networks recognizing the generalized Dyck languages, which express the core o...
[ { "created": "Fri, 8 Nov 2019 15:33:51 GMT", "version": "v1" } ]
2019-11-11
[ [ "Suzgun", "Mirac", "" ], [ "Gehrmann", "Sebastian", "" ], [ "Belinkov", "Yonatan", "" ], [ "Shieber", "Stuart M.", "" ] ]
We introduce three memory-augmented Recurrent Neural Networks (MARNNs) and explore their capabilities on a series of simple language modeling tasks whose solutions require stack-based mechanisms. We provide the first demonstration of neural networks recognizing the generalized Dyck languages, which express the core of ...
1905.12032
Pu Zhao
Pu Zhao, Siyue Wang, Cheng Gongye, Yanzhi Wang, Yunsi Fei, Xue Lin
Fault Sneaking Attack: a Stealthy Framework for Misleading Deep Neural Networks
Accepted by the 56th Design Automation Conference (DAC 2019)
null
10.1145/3316781.3317825
null
cs.LG cs.CR cs.CV stat.ML
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Despite the great achievements of deep neural networks (DNNs), the vulnerability of state-of-the-art DNNs raises security concerns of DNNs in many application domains requiring high reliability.We propose the fault sneaking attack on DNNs, where the adversary aims to misclassify certain input images into any target l...
[ { "created": "Tue, 28 May 2019 18:56:44 GMT", "version": "v1" } ]
2019-05-30
[ [ "Zhao", "Pu", "" ], [ "Wang", "Siyue", "" ], [ "Gongye", "Cheng", "" ], [ "Wang", "Yanzhi", "" ], [ "Fei", "Yunsi", "" ], [ "Lin", "Xue", "" ] ]
Despite the great achievements of deep neural networks (DNNs), the vulnerability of state-of-the-art DNNs raises security concerns of DNNs in many application domains requiring high reliability.We propose the fault sneaking attack on DNNs, where the adversary aims to misclassify certain input images into any target lab...
2407.06533
Rachneet Kaur
Rachneet Kaur, Zhen Zeng, Tucker Balch, Manuela Veloso
LETS-C: Leveraging Language Embedding for Time Series Classification
22 pages, 5 figures, 10 tables
null
null
null
cs.LG cs.AI cs.CE cs.CL stat.ME
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Recent advancements in language modeling have shown promising results when applied to time series data. In particular, fine-tuning pre-trained large language models (LLMs) for time series classification tasks has achieved state-of-the-art (SOTA) performance on standard benchmarks. However, these LLM-based models have...
[ { "created": "Tue, 9 Jul 2024 04:07:57 GMT", "version": "v1" } ]
2024-07-10
[ [ "Kaur", "Rachneet", "" ], [ "Zeng", "Zhen", "" ], [ "Balch", "Tucker", "" ], [ "Veloso", "Manuela", "" ] ]
Recent advancements in language modeling have shown promising results when applied to time series data. In particular, fine-tuning pre-trained large language models (LLMs) for time series classification tasks has achieved state-of-the-art (SOTA) performance on standard benchmarks. However, these LLM-based models have a...
2205.11668
Benjamin Andres Huerfano Zapata
Benjamin A. Huerfano Z., Andres F Ardila, and Pedro L Cifuentes
TIC como apoyo del soporte social al enfermo cr\'onico y su cuidador : Aproximaci\'on al estado del Arte
7 pages, in Spanish language, 5 figures, and 35 direct references
Event Encuentro Nacional de Investigacion y Desarrollo ENID 2013 1st ed, Vol 1, pages 1-7 (2013)
null
null
cs.SI cs.CY
http://creativecommons.org/licenses/by/4.0/
The current approach is carried out in order to have an overview of the level of inclusion and the participation of ICTs in social support and support for vulnerable populations suffering from chronic diseases. The inclusion was made through a bibliographic review, this being the basis for the collection of data and ...
[ { "created": "Mon, 23 May 2022 23:28:30 GMT", "version": "v1" } ]
2022-08-24
[ [ "Z.", "Benjamin A. Huerfano", "" ], [ "Ardila", "Andres F", "" ], [ "Cifuentes", "Pedro L", "" ] ]
The current approach is carried out in order to have an overview of the level of inclusion and the participation of ICTs in social support and support for vulnerable populations suffering from chronic diseases. The inclusion was made through a bibliographic review, this being the basis for the collection of data and pe...
1412.0954
Laura Toni
Laura Toni, Thomas Maugey, Pascal Frossard
Optimized Packet Scheduling in Multiview Video Navigation Systems
null
null
null
null
cs.MM
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
In multiview video systems, multiple cameras generally acquire the same scene from different perspectives, such that users have the possibility to select their preferred viewpoint. This results in large amounts of highly redundant data, which needs to be properly handled during encoding and transmission over resource...
[ { "created": "Tue, 2 Dec 2014 16:02:12 GMT", "version": "v1" } ]
2014-12-03
[ [ "Toni", "Laura", "" ], [ "Maugey", "Thomas", "" ], [ "Frossard", "Pascal", "" ] ]
In multiview video systems, multiple cameras generally acquire the same scene from different perspectives, such that users have the possibility to select their preferred viewpoint. This results in large amounts of highly redundant data, which needs to be properly handled during encoding and transmission over resource-c...
2307.16120
Qingping Zhou
Qingping Zhou, Jiayu Qian, Junqi Tang, Jinglai Li
Deep Unrolling Networks with Recurrent Momentum Acceleration for Nonlinear Inverse Problems
null
null
null
null
cs.LG
http://creativecommons.org/licenses/by/4.0/
Combining the strengths of model-based iterative algorithms and data-driven deep learning solutions, deep unrolling networks (DuNets) have become a popular tool to solve inverse imaging problems. While DuNets have been successfully applied to many linear inverse problems, nonlinear problems tend to impair the perform...
[ { "created": "Sun, 30 Jul 2023 03:59:47 GMT", "version": "v1" }, { "created": "Wed, 16 Aug 2023 13:58:20 GMT", "version": "v2" }, { "created": "Wed, 7 Feb 2024 13:19:29 GMT", "version": "v3" }, { "created": "Sun, 31 Mar 2024 08:40:15 GMT", "version": "v4" } ]
2024-04-02
[ [ "Zhou", "Qingping", "" ], [ "Qian", "Jiayu", "" ], [ "Tang", "Junqi", "" ], [ "Li", "Jinglai", "" ] ]
Combining the strengths of model-based iterative algorithms and data-driven deep learning solutions, deep unrolling networks (DuNets) have become a popular tool to solve inverse imaging problems. While DuNets have been successfully applied to many linear inverse problems, nonlinear problems tend to impair the performan...
cs/0604073
Muthiah Annamalai
Muthiah Annamalai, Hemant Kumar, Leela Velusamy
Octave-GTK: A GTK binding for GNU Octave
Comments: Presented at Octave2006 Conference, Washington D.C
null
null
Octave2006/02
cs.SE
null
This paper discusses the problems faced with interoperability between two programming languages, with respect to GNU Octave, and GTK API written in C, to provide the GTK API on Octave.Octave-GTK is the fusion of two different API's: one exported by GNU Octave [scientific computing tool] and the other GTK [GUI toolkit...
[ { "created": "Wed, 19 Apr 2006 16:46:23 GMT", "version": "v1" }, { "created": "Fri, 28 Apr 2006 18:43:46 GMT", "version": "v2" } ]
2007-05-23
[ [ "Annamalai", "Muthiah", "" ], [ "Kumar", "Hemant", "" ], [ "Velusamy", "Leela", "" ] ]
This paper discusses the problems faced with interoperability between two programming languages, with respect to GNU Octave, and GTK API written in C, to provide the GTK API on Octave.Octave-GTK is the fusion of two different API's: one exported by GNU Octave [scientific computing tool] and the other GTK [GUI toolkit];...
2307.04131
Yiyang Zhao
Yiyang Zhao and Tian Guo
Carbon-Efficient Neural Architecture Search
null
In 2nd Workshop on Sustainable Computer Systems (HotCarbon 23) July 9, 2023
10.1145/3604930.3605708
null
cs.LG cs.AI
http://creativecommons.org/licenses/by-sa/4.0/
This work presents a novel approach to neural architecture search (NAS) that aims to reduce energy costs and increase carbon efficiency during the model design process. The proposed framework, called carbon-efficient NAS (CE-NAS), consists of NAS evaluation algorithms with different energy requirements, a multi-objec...
[ { "created": "Sun, 9 Jul 2023 09:03:10 GMT", "version": "v1" } ]
2023-07-12
[ [ "Zhao", "Yiyang", "" ], [ "Guo", "Tian", "" ] ]
This work presents a novel approach to neural architecture search (NAS) that aims to reduce energy costs and increase carbon efficiency during the model design process. The proposed framework, called carbon-efficient NAS (CE-NAS), consists of NAS evaluation algorithms with different energy requirements, a multi-objecti...
1708.02125
Caihua Shan
Caihua Shan, Nikos Mamoulis, Guoliang Li, Reynold Cheng, Zhipeng Huang, Yudian Zheng
T-Crowd: Effective Crowdsourcing for Tabular Data
null
null
null
null
cs.DB
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Crowdsourcing employs human workers to solve computer-hard problems, such as data cleaning, entity resolution, and sentiment analysis. When crowdsourcing tabular data, e.g., the attribute values of an entity set, a worker's answers on the different attributes (e.g., the nationality and age of a celebrity star) are of...
[ { "created": "Mon, 7 Aug 2017 14:03:17 GMT", "version": "v1" } ]
2017-08-08
[ [ "Shan", "Caihua", "" ], [ "Mamoulis", "Nikos", "" ], [ "Li", "Guoliang", "" ], [ "Cheng", "Reynold", "" ], [ "Huang", "Zhipeng", "" ], [ "Zheng", "Yudian", "" ] ]
Crowdsourcing employs human workers to solve computer-hard problems, such as data cleaning, entity resolution, and sentiment analysis. When crowdsourcing tabular data, e.g., the attribute values of an entity set, a worker's answers on the different attributes (e.g., the nationality and age of a celebrity star) are ofte...
2306.12718
Weiming Qu
Qu Weiming, Liu Tianlin, Luo Dingsheng
CEMSSL: A Unified Framework for Multi-Solution Inverse Kinematic Model Learning of Robot Arms with High-Precision Manipulation
null
null
null
null
cs.RO
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Multiple solutions mainly originate from the existence of redundant degrees of freedom in the robot arm, which may cause difficulties in inverse model learning but they can also bring many benefits, such as higher flexibility and robustness. Current multi-solution inverse model learning methods rely on conditional de...
[ { "created": "Thu, 22 Jun 2023 07:50:17 GMT", "version": "v1" } ]
2023-06-23
[ [ "Weiming", "Qu", "" ], [ "Tianlin", "Liu", "" ], [ "Dingsheng", "Luo", "" ] ]
Multiple solutions mainly originate from the existence of redundant degrees of freedom in the robot arm, which may cause difficulties in inverse model learning but they can also bring many benefits, such as higher flexibility and robustness. Current multi-solution inverse model learning methods rely on conditional deep...
2306.04445
Mustapha Bounoua
Mustapha Bounoua, Giulio Franzese, Pietro Michiardi
Multi-modal Latent Diffusion
null
null
null
null
cs.LG cs.CV
http://creativecommons.org/licenses/by/4.0/
Multi-modal data-sets are ubiquitous in modern applications, and multi-modal Variational Autoencoders are a popular family of models that aim to learn a joint representation of the different modalities. However, existing approaches suffer from a coherence-quality tradeoff, where models with good generation quality la...
[ { "created": "Wed, 7 Jun 2023 14:16:44 GMT", "version": "v1" }, { "created": "Mon, 18 Dec 2023 10:43:55 GMT", "version": "v2" } ]
2023-12-19
[ [ "Bounoua", "Mustapha", "" ], [ "Franzese", "Giulio", "" ], [ "Michiardi", "Pietro", "" ] ]
Multi-modal data-sets are ubiquitous in modern applications, and multi-modal Variational Autoencoders are a popular family of models that aim to learn a joint representation of the different modalities. However, existing approaches suffer from a coherence-quality tradeoff, where models with good generation quality lack...