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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1901.09515 | Lin Chen | Lin Chen, Mingrui Zhang, Hamed Hassani, Amin Karbasi | Black Box Submodular Maximization: Discrete and Continuous Settings | Accepted to AISTATS 2020. First two authors contributed equally to
this work | null | null | null | cs.LG cs.DS math.OC stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we consider the problem of black box continuous submodular
maximization where we only have access to the function values and no
information about the derivatives is provided. For a monotone and continuous
DR-submodular function, and subject to a bounded convex body constraint, we
propose Black-box Cont... | [
{
"created": "Mon, 28 Jan 2019 04:53:53 GMT",
"version": "v1"
},
{
"created": "Sun, 1 Mar 2020 20:57:49 GMT",
"version": "v2"
}
] | 2020-03-03 | [
[
"Chen",
"Lin",
""
],
[
"Zhang",
"Mingrui",
""
],
[
"Hassani",
"Hamed",
""
],
[
"Karbasi",
"Amin",
""
]
] | In this paper, we consider the problem of black box continuous submodular maximization where we only have access to the function values and no information about the derivatives is provided. For a monotone and continuous DR-submodular function, and subject to a bounded convex body constraint, we propose Black-box Contin... |
2001.05671 | Yuto Nakashima | Kohei Yamada, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, and
Masayuki Takeda | Faster STR-EC-LCS Computation | null | null | null | null | cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The longest common subsequence (LCS) problem is a central problem in
stringology that finds the longest common subsequence of given two strings $A$
and $B$. More recently, a set of four constrained LCS problems (called
generalized constrained LCS problem) were proposed by Chen and Chao [J. Comb.
Optim, 2011]. In this... | [
{
"created": "Thu, 16 Jan 2020 06:30:29 GMT",
"version": "v1"
}
] | 2020-01-17 | [
[
"Yamada",
"Kohei",
""
],
[
"Nakashima",
"Yuto",
""
],
[
"Inenaga",
"Shunsuke",
""
],
[
"Bannai",
"Hideo",
""
],
[
"Takeda",
"Masayuki",
""
]
] | The longest common subsequence (LCS) problem is a central problem in stringology that finds the longest common subsequence of given two strings $A$ and $B$. More recently, a set of four constrained LCS problems (called generalized constrained LCS problem) were proposed by Chen and Chao [J. Comb. Optim, 2011]. In this p... |
2406.01869 | Christine Dewi | Christine Dewi, Dhananjay Thiruvady, and Nayyar Zaidi | Fruit Classification System with Deep Learning and Neural Architecture
Search | null | null | null | null | cs.CV cs.AI | http://creativecommons.org/licenses/by/4.0/ | The fruit identification process involves analyzing and categorizing
different types of fruits based on their visual characteristics. This activity
can be achieved using a range of methodologies, encompassing manual
examination, conventional computer vision methodologies, and more sophisticated
methodologies employin... | [
{
"created": "Tue, 4 Jun 2024 00:41:47 GMT",
"version": "v1"
}
] | 2024-06-05 | [
[
"Dewi",
"Christine",
""
],
[
"Thiruvady",
"Dhananjay",
""
],
[
"Zaidi",
"Nayyar",
""
]
] | The fruit identification process involves analyzing and categorizing different types of fruits based on their visual characteristics. This activity can be achieved using a range of methodologies, encompassing manual examination, conventional computer vision methodologies, and more sophisticated methodologies employing ... |
2101.11935 | Michal Kazmierski | Michal Kazmierski, Mattea Welch, Sejin Kim, Chris McIntosh, Princess
Margaret Head and Neck Cancer Group, Katrina Rey-McIntyre, Shao Hui Huang,
Tirth Patel, Tony Tadic, Michael Milosevic, Fei-Fei Liu, Andrew Hope, Scott
Bratman and Benjamin Haibe-Kains | A Machine Learning Challenge for Prognostic Modelling in Head and Neck
Cancer Using Multi-modal Data | 27 pages, 7 figures, under review | null | null | null | cs.LG eess.IV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Accurate prognosis for an individual patient is a key component of precision
oncology. Recent advances in machine learning have enabled the development of
models using a wider range of data, including imaging. Radiomics aims to
extract quantitative predictive and prognostic biomarkers from routine medical
imaging, bu... | [
{
"created": "Thu, 28 Jan 2021 11:20:34 GMT",
"version": "v1"
}
] | 2021-01-29 | [
[
"Kazmierski",
"Michal",
""
],
[
"Welch",
"Mattea",
""
],
[
"Kim",
"Sejin",
""
],
[
"McIntosh",
"Chris",
""
],
[
"Head",
"Princess Margaret",
""
],
[
"Group",
"Neck Cancer",
""
],
[
"Rey-McIntyre",
"Katrina",
... | Accurate prognosis for an individual patient is a key component of precision oncology. Recent advances in machine learning have enabled the development of models using a wider range of data, including imaging. Radiomics aims to extract quantitative predictive and prognostic biomarkers from routine medical imaging, but ... |
2406.09185 | Niharika Malvia | Syed Abdul Mateen, Niharika Malvia, Syed Abdul Khader, Danny Wang,
Deepti Srinivasan, Chi-Fu Jeffrey Yang, Lana Schumacher, Sandeep Manjanna | Thoracic Surgery Video Analysis for Surgical Phase Recognition | 2 pages, 2 figures | ICRA-RAMI Workshop, May 2024, Japan | null | null | cs.CV | http://creativecommons.org/licenses/by/4.0/ | This paper presents an approach for surgical phase recognition using video
data, aiming to provide a comprehensive understanding of surgical procedures
for automated workflow analysis. The advent of robotic surgery, digitized
operating rooms, and the generation of vast amounts of data have opened doors
for the applic... | [
{
"created": "Thu, 13 Jun 2024 14:47:57 GMT",
"version": "v1"
}
] | 2024-06-14 | [
[
"Mateen",
"Syed Abdul",
""
],
[
"Malvia",
"Niharika",
""
],
[
"Khader",
"Syed Abdul",
""
],
[
"Wang",
"Danny",
""
],
[
"Srinivasan",
"Deepti",
""
],
[
"Yang",
"Chi-Fu Jeffrey",
""
],
[
"Schumacher",
"Lana",
... | This paper presents an approach for surgical phase recognition using video data, aiming to provide a comprehensive understanding of surgical procedures for automated workflow analysis. The advent of robotic surgery, digitized operating rooms, and the generation of vast amounts of data have opened doors for the applicat... |
1807.09040 | Anshoo Tandon | Anshoo Tandon, Mehul Motani, Lav R. Varshney | Are RLL Codes Suitable for Simultaneous Energy and Information Transfer? | null | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Run-length limited (RLL) codes are a well-studied class of constrained codes
having application in diverse areas such as optical and magnetic data recording
systems, DNA-based storage, and visible light communication. RLL codes have
also been proposed for the emerging area of simultaneous energy and information
trans... | [
{
"created": "Tue, 24 Jul 2018 11:26:06 GMT",
"version": "v1"
}
] | 2018-07-25 | [
[
"Tandon",
"Anshoo",
""
],
[
"Motani",
"Mehul",
""
],
[
"Varshney",
"Lav R.",
""
]
] | Run-length limited (RLL) codes are a well-studied class of constrained codes having application in diverse areas such as optical and magnetic data recording systems, DNA-based storage, and visible light communication. RLL codes have also been proposed for the emerging area of simultaneous energy and information transfe... |
2305.03881 | Swagatika Dash | Swagatika Dash | Fairness in Image Search: A Study of Occupational Stereotyping in Image
Retrieval and its Debiasing | 20 Pages, Work uses Proprietary Search Systems from the year 2021 | null | null | null | cs.IR cs.CL cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Multi-modal search engines have experienced significant growth and widespread
use in recent years, making them the second most common internet use. While
search engine systems offer a range of services, the image search field has
recently become a focal point in the information retrieval community, as the
adage goes,... | [
{
"created": "Sat, 6 May 2023 00:24:44 GMT",
"version": "v1"
},
{
"created": "Tue, 22 Aug 2023 16:09:59 GMT",
"version": "v2"
}
] | 2023-08-23 | [
[
"Dash",
"Swagatika",
""
]
] | Multi-modal search engines have experienced significant growth and widespread use in recent years, making them the second most common internet use. While search engine systems offer a range of services, the image search field has recently become a focal point in the information retrieval community, as the adage goes, "... |
2311.08223 | Weidong Chen | Ting Wang, Weidong Chen, Yuanhe Tian, Yan Song, Zhendong Mao | Improving Image Captioning via Predicting Structured Concepts | Accepted by EMNLP 2023 (Main Conference, Oral) | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Having the difficulty of solving the semantic gap between images and texts
for the image captioning task, conventional studies in this area paid some
attention to treating semantic concepts as a bridge between the two modalities
and improved captioning performance accordingly. Although promising results on
concept pr... | [
{
"created": "Tue, 14 Nov 2023 15:01:58 GMT",
"version": "v1"
},
{
"created": "Tue, 28 Nov 2023 04:05:03 GMT",
"version": "v2"
}
] | 2023-11-29 | [
[
"Wang",
"Ting",
""
],
[
"Chen",
"Weidong",
""
],
[
"Tian",
"Yuanhe",
""
],
[
"Song",
"Yan",
""
],
[
"Mao",
"Zhendong",
""
]
] | Having the difficulty of solving the semantic gap between images and texts for the image captioning task, conventional studies in this area paid some attention to treating semantic concepts as a bridge between the two modalities and improved captioning performance accordingly. Although promising results on concept pred... |
2103.14712 | Arijit Ray | Arijit Ray, Michael Cogswell, Xiao Lin, Kamran Alipour, Ajay
Divakaran, Yi Yao, Giedrius Burachas | Generating and Evaluating Explanations of Attended and Error-Inducing
Input Regions for VQA Models | Applied AI Letters, Wiley, 25 October 2021 | null | 10.22541/au.162464902.28050142/v1 | null | cs.CV cs.AI cs.CY cs.HC | http://creativecommons.org/licenses/by/4.0/ | Attention maps, a popular heatmap-based explanation method for Visual
Question Answering (VQA), are supposed to help users understand the model by
highlighting portions of the image/question used by the model to infer answers.
However, we see that users are often misled by current attention map
visualizations that po... | [
{
"created": "Fri, 26 Mar 2021 19:52:32 GMT",
"version": "v1"
},
{
"created": "Wed, 31 Mar 2021 21:15:40 GMT",
"version": "v2"
},
{
"created": "Mon, 25 Oct 2021 18:58:42 GMT",
"version": "v3"
}
] | 2021-10-27 | [
[
"Ray",
"Arijit",
""
],
[
"Cogswell",
"Michael",
""
],
[
"Lin",
"Xiao",
""
],
[
"Alipour",
"Kamran",
""
],
[
"Divakaran",
"Ajay",
""
],
[
"Yao",
"Yi",
""
],
[
"Burachas",
"Giedrius",
""
]
] | Attention maps, a popular heatmap-based explanation method for Visual Question Answering (VQA), are supposed to help users understand the model by highlighting portions of the image/question used by the model to infer answers. However, we see that users are often misled by current attention map visualizations that poin... |
2205.04935 | Sara Saeidian | Sara Saeidian (1), Giulia Cervia (2), Tobias J. Oechtering (1), Mikael
Skoglund (1) ((1) KTH Royal Institute of Technology, (2) IMT Nord Europe) | Pointwise Maximal Leakage | Results unchanged. New examples added. This version has been accepted
for publication in IEEE Transactions on Information Theory | null | 10.1109/TIT.2023.3304378 | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We introduce a privacy measure called pointwise maximal leakage, generalizing
the pre-existing notion of maximal leakage, which quantifies the amount of
information leaking about a secret $X$ by disclosing a single outcome of a
(randomized) function calculated on $X$. Pointwise maximal leakage is a robust
and operati... | [
{
"created": "Tue, 10 May 2022 14:46:41 GMT",
"version": "v1"
},
{
"created": "Tue, 15 Aug 2023 14:03:40 GMT",
"version": "v2"
}
] | 2023-08-16 | [
[
"Saeidian",
"Sara",
"",
"KTH Royal Institute of Technology"
],
[
"Cervia",
"Giulia",
"",
"IMT Nord Europe"
],
[
"Oechtering",
"Tobias J.",
"",
"KTH Royal Institute of Technology"
],
[
"Skoglund",
"Mikael",
"",
"KTH Royal Institute of Tech... | We introduce a privacy measure called pointwise maximal leakage, generalizing the pre-existing notion of maximal leakage, which quantifies the amount of information leaking about a secret $X$ by disclosing a single outcome of a (randomized) function calculated on $X$. Pointwise maximal leakage is a robust and operation... |
2306.04628 | Sangjun Han | Sangjun Han, Hyeongrae Ihm, Woohyung Lim | Systematic Analysis of Music Representations from BERT | null | null | null | null | cs.SD cs.MM eess.AS | http://creativecommons.org/licenses/by/4.0/ | There have been numerous attempts to represent raw data as numerical vectors
that effectively capture semantic and contextual information. However, in the
field of symbolic music, previous works have attempted to validate their music
embeddings by observing the performance improvement of various fine-tuning
tasks. In... | [
{
"created": "Tue, 6 Jun 2023 13:26:55 GMT",
"version": "v1"
}
] | 2023-06-08 | [
[
"Han",
"Sangjun",
""
],
[
"Ihm",
"Hyeongrae",
""
],
[
"Lim",
"Woohyung",
""
]
] | There have been numerous attempts to represent raw data as numerical vectors that effectively capture semantic and contextual information. However, in the field of symbolic music, previous works have attempted to validate their music embeddings by observing the performance improvement of various fine-tuning tasks. In t... |
cs/0701095 | Pedro Cabalar | Pedro Cabalar and Paolo Ferraris | Propositional theories are strongly equivalent to logic programs | 15 pages | null | null | null | cs.AI cs.LO | null | This paper presents a property of propositional theories under the answer
sets semantics (called Equilibrium Logic for this general syntax): any theory
can always be reexpressed as a strongly equivalent disjunctive logic program,
possibly with negation in the head. We provide two different proofs for this
result: one... | [
{
"created": "Tue, 16 Jan 2007 12:29:55 GMT",
"version": "v1"
}
] | 2007-05-23 | [
[
"Cabalar",
"Pedro",
""
],
[
"Ferraris",
"Paolo",
""
]
] | This paper presents a property of propositional theories under the answer sets semantics (called Equilibrium Logic for this general syntax): any theory can always be reexpressed as a strongly equivalent disjunctive logic program, possibly with negation in the head. We provide two different proofs for this result: one i... |
2302.10289 | Shantanu Ghosh | Shantanu Ghosh, Ke Yu, Forough Arabshahi, Kayhan Batmanghelich | Tackling Shortcut Learning in Deep Neural Networks: An Iterative
Approach with Interpretable Models | 2nd Workshop on Spurious Correlations, Invariance, and Stability,
ICML 2023 | null | null | null | cs.LG cs.CV | http://creativecommons.org/licenses/by/4.0/ | We use concept-based interpretable models to mitigate shortcut learning.
Existing methods lack interpretability. Beginning with a Blackbox, we
iteratively carve out a mixture of interpretable experts (MoIE) and a residual
network. Each expert explains a subset of data using First Order Logic (FOL).
While explaining a... | [
{
"created": "Mon, 20 Feb 2023 20:25:41 GMT",
"version": "v1"
},
{
"created": "Thu, 27 Apr 2023 18:40:36 GMT",
"version": "v2"
},
{
"created": "Wed, 3 May 2023 03:37:49 GMT",
"version": "v3"
},
{
"created": "Tue, 9 May 2023 18:49:36 GMT",
"version": "v4"
},
{
"cre... | 2023-07-10 | [
[
"Ghosh",
"Shantanu",
""
],
[
"Yu",
"Ke",
""
],
[
"Arabshahi",
"Forough",
""
],
[
"Batmanghelich",
"Kayhan",
""
]
] | We use concept-based interpretable models to mitigate shortcut learning. Existing methods lack interpretability. Beginning with a Blackbox, we iteratively carve out a mixture of interpretable experts (MoIE) and a residual network. Each expert explains a subset of data using First Order Logic (FOL). While explaining a s... |
2007.15362 | Simon D. Fink | Thomas Bl\"asius, Simon D. Fink, Ignaz Rutter | Synchronized Planarity with Applications to Constrained Planarity
Problems | to appear in Proceedings of ESA 2021 | null | null | null | cs.DS cs.DM | http://creativecommons.org/licenses/by/4.0/ | We introduce the problem Synchronized Planarity. Roughly speaking, its input
is a loop-free multi-graph together with synchronization constraints that,
e.g., match pairs of vertices of equal degree by providing a bijection between
their edges. Synchronized Planarity then asks whether the graph admits a
crossing-free ... | [
{
"created": "Thu, 30 Jul 2020 10:26:55 GMT",
"version": "v1"
},
{
"created": "Thu, 22 Jul 2021 07:49:08 GMT",
"version": "v2"
}
] | 2021-07-23 | [
[
"Bläsius",
"Thomas",
""
],
[
"Fink",
"Simon D.",
""
],
[
"Rutter",
"Ignaz",
""
]
] | We introduce the problem Synchronized Planarity. Roughly speaking, its input is a loop-free multi-graph together with synchronization constraints that, e.g., match pairs of vertices of equal degree by providing a bijection between their edges. Synchronized Planarity then asks whether the graph admits a crossing-free em... |
2405.02066 | Youngdong Jang | Youngdong Jang, Dong In Lee, MinHyuk Jang, Jong Wook Kim, Feng Yang,
Sangpil Kim | WateRF: Robust Watermarks in Radiance Fields for Protection of
Copyrights | null | null | null | null | cs.CV eess.IV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The advances in the Neural Radiance Fields (NeRF) research offer extensive
applications in diverse domains, but protecting their copyrights has not yet
been researched in depth. Recently, NeRF watermarking has been considered one
of the pivotal solutions for safely deploying NeRF-based 3D representations.
However, ex... | [
{
"created": "Fri, 3 May 2024 12:56:34 GMT",
"version": "v1"
},
{
"created": "Thu, 9 May 2024 19:23:33 GMT",
"version": "v2"
},
{
"created": "Mon, 27 May 2024 11:48:37 GMT",
"version": "v3"
},
{
"created": "Fri, 12 Jul 2024 03:35:19 GMT",
"version": "v4"
}
] | 2024-07-15 | [
[
"Jang",
"Youngdong",
""
],
[
"Lee",
"Dong In",
""
],
[
"Jang",
"MinHyuk",
""
],
[
"Kim",
"Jong Wook",
""
],
[
"Yang",
"Feng",
""
],
[
"Kim",
"Sangpil",
""
]
] | The advances in the Neural Radiance Fields (NeRF) research offer extensive applications in diverse domains, but protecting their copyrights has not yet been researched in depth. Recently, NeRF watermarking has been considered one of the pivotal solutions for safely deploying NeRF-based 3D representations. However, exis... |
1802.08765 | Yejia Liu | Oliver Schulte and Yejia Liu and Chao Li | Model Trees for Identifying Exceptional Players in the NHL Draft | 14 pages | null | null | null | cs.LG cs.SI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Drafting strong players is crucial for the team success. We describe a new
data-driven interpretable approach for assessing draft prospects in the
National Hockey League. Successful previous approaches have built a predictive
model based on player features, or derived performance predictions from the
observed perform... | [
{
"created": "Fri, 23 Feb 2018 23:39:41 GMT",
"version": "v1"
}
] | 2018-02-27 | [
[
"Schulte",
"Oliver",
""
],
[
"Liu",
"Yejia",
""
],
[
"Li",
"Chao",
""
]
] | Drafting strong players is crucial for the team success. We describe a new data-driven interpretable approach for assessing draft prospects in the National Hockey League. Successful previous approaches have built a predictive model based on player features, or derived performance predictions from the observed performan... |
2306.13414 | Onur Dizdar | Onur Dizdar, Ata Sattarzadeh, Yi Xien Yap, and Stephen Wang | A Low-Complexity Design for Rate-Splitting Multiple Access in Overloaded
MIMO Networks | null | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Rate-Splitting Multiple Access (RSMA) is a robust multiple access scheme for
multi-antenna wireless networks. In this work, we study the performance of RSMA
in downlink overloaded networks, where the number of transmit antennas is
smaller than the number of users. We provide analysis and closed-form solutions
for opt... | [
{
"created": "Fri, 23 Jun 2023 10:00:14 GMT",
"version": "v1"
}
] | 2023-06-26 | [
[
"Dizdar",
"Onur",
""
],
[
"Sattarzadeh",
"Ata",
""
],
[
"Yap",
"Yi Xien",
""
],
[
"Wang",
"Stephen",
""
]
] | Rate-Splitting Multiple Access (RSMA) is a robust multiple access scheme for multi-antenna wireless networks. In this work, we study the performance of RSMA in downlink overloaded networks, where the number of transmit antennas is smaller than the number of users. We provide analysis and closed-form solutions for optim... |
1805.06992 | Jun Wang | Jun Wang, Sujoy Sikdar, Tyler Shepherd, Zhibing Zhao, Chunheng Jiang,
Lirong Xia | Practical Algorithms for STV and Ranked Pairs with Parallel Universes
Tiebreaking | 15 pages, 12 figures | null | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | STV and ranked pairs (RP) are two well-studied voting rules for group
decision-making. They proceed in multiple rounds, and are affected by how ties
are broken in each round. However, the literature is surprisingly vague about
how ties should be broken. We propose the first algorithms for computing the
set of alterna... | [
{
"created": "Thu, 17 May 2018 23:20:57 GMT",
"version": "v1"
}
] | 2018-05-21 | [
[
"Wang",
"Jun",
""
],
[
"Sikdar",
"Sujoy",
""
],
[
"Shepherd",
"Tyler",
""
],
[
"Zhao",
"Zhibing",
""
],
[
"Jiang",
"Chunheng",
""
],
[
"Xia",
"Lirong",
""
]
] | STV and ranked pairs (RP) are two well-studied voting rules for group decision-making. They proceed in multiple rounds, and are affected by how ties are broken in each round. However, the literature is surprisingly vague about how ties should be broken. We propose the first algorithms for computing the set of alternati... |
2112.03354 | Tica Lin | Tica Lin, Yalong Yang, Johanna Beyer, Hanspeter Pfister | Labeling Out-of-View Objects in Immersive Analytics to Support Situated
Visual Searching | To be published in IEEE Transactions on Visualization and Computer
Graphics | null | 10.1109/TVCG.2021.3133511 | null | cs.HC cs.GR | http://creativecommons.org/licenses/by-nc-nd/4.0/ | Augmented Reality (AR) embeds digital information into objects of the
physical world. Data can be shown in-situ, thereby enabling real-time visual
comparisons and object search in real-life user tasks, such as comparing
products and looking up scores in a sports game. While there have been studies
on designing AR int... | [
{
"created": "Mon, 6 Dec 2021 20:58:04 GMT",
"version": "v1"
},
{
"created": "Sat, 25 Dec 2021 03:11:52 GMT",
"version": "v2"
}
] | 2021-12-28 | [
[
"Lin",
"Tica",
""
],
[
"Yang",
"Yalong",
""
],
[
"Beyer",
"Johanna",
""
],
[
"Pfister",
"Hanspeter",
""
]
] | Augmented Reality (AR) embeds digital information into objects of the physical world. Data can be shown in-situ, thereby enabling real-time visual comparisons and object search in real-life user tasks, such as comparing products and looking up scores in a sports game. While there have been studies on designing AR inter... |
2403.15285 | Xiaofeng Luo | Jiawen Kang, Xiaofeng Luo, Jiangtian Nie, Tianhao Wu, Haibo Zhou,
Yonghua Wang, Dusit Niyato, Shiwen Mao, Shengli Xie | Blockchain-based Pseudonym Management for Vehicle Twin Migrations in
Vehicular Edge Metaverse | 14 pages, 9 figures | null | null | null | cs.NI cs.CR cs.HC cs.LG | http://creativecommons.org/licenses/by/4.0/ | Driven by the great advances in metaverse and edge computing technologies,
vehicular edge metaverses are expected to disrupt the current paradigm of
intelligent transportation systems. As highly computerized avatars of Vehicular
Metaverse Users (VMUs), the Vehicle Twins (VTs) deployed in edge servers can
provide valu... | [
{
"created": "Fri, 22 Mar 2024 15:31:37 GMT",
"version": "v1"
}
] | 2024-03-25 | [
[
"Kang",
"Jiawen",
""
],
[
"Luo",
"Xiaofeng",
""
],
[
"Nie",
"Jiangtian",
""
],
[
"Wu",
"Tianhao",
""
],
[
"Zhou",
"Haibo",
""
],
[
"Wang",
"Yonghua",
""
],
[
"Niyato",
"Dusit",
""
],
[
"Mao",
"S... | Driven by the great advances in metaverse and edge computing technologies, vehicular edge metaverses are expected to disrupt the current paradigm of intelligent transportation systems. As highly computerized avatars of Vehicular Metaverse Users (VMUs), the Vehicle Twins (VTs) deployed in edge servers can provide valuab... |
1710.07915 | Pan Cunhua | Cunhua Pan, Hani Mehrpouyan, Yuanwei Liu, Maged Elkashlan, and
Arumugam Nallanathan | Joint Pilot Allocation and Robust Transmission Design for Ultra-dense
User-centric TDD C-RAN with Imperfect CSI | Under revision in IEEE TWC | null | null | null | cs.IT math.IT | http://creativecommons.org/licenses/by-nc-sa/4.0/ | This paper considers the unavailability of complete channel state information
(CSI) in ultra-dense cloud radio access networks (C-RANs). The user-centric
cluster is adopted to reduce the computational complexity, while the incomplete
CSI is considered to reduce the heavy channel training overhead, where only
large-sc... | [
{
"created": "Sun, 22 Oct 2017 09:38:58 GMT",
"version": "v1"
}
] | 2017-10-24 | [
[
"Pan",
"Cunhua",
""
],
[
"Mehrpouyan",
"Hani",
""
],
[
"Liu",
"Yuanwei",
""
],
[
"Elkashlan",
"Maged",
""
],
[
"Nallanathan",
"Arumugam",
""
]
] | This paper considers the unavailability of complete channel state information (CSI) in ultra-dense cloud radio access networks (C-RANs). The user-centric cluster is adopted to reduce the computational complexity, while the incomplete CSI is considered to reduce the heavy channel training overhead, where only large-scal... |
2102.12421 | V Lalitha | Shreya Gupta and V. Lalitha | Rack-Aware Cooperative Regenerating Codes | 5 pages, 1 figure, accepted for publication in ISITA 2020 | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In distributed storage systems, cooperative regenerating codes tradeoff
storage for repair bandwidth in the case of multiple node failures. In
rack-aware distributed storage systems, there is no cost associated with
transferring symbols within a rack. Hence, the repair bandwidth will only take
into account cross-rack... | [
{
"created": "Wed, 24 Feb 2021 17:31:33 GMT",
"version": "v1"
}
] | 2021-02-25 | [
[
"Gupta",
"Shreya",
""
],
[
"Lalitha",
"V.",
""
]
] | In distributed storage systems, cooperative regenerating codes tradeoff storage for repair bandwidth in the case of multiple node failures. In rack-aware distributed storage systems, there is no cost associated with transferring symbols within a rack. Hence, the repair bandwidth will only take into account cross-rack t... |
2009.02353 | Gianni Antichi | Giuseppe Siracusano, Salvator Galea, Davide Sanvito, Mohammad
Malekzadeh, Hamed Haddadi, Gianni Antichi, Roberto Bifulco | Running Neural Networks on the NIC | null | null | null | null | cs.DC cs.AI cs.NI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper we show that the data plane of commodity programmable (Network
Interface Cards) NICs can run neural network inference tasks required by packet
monitoring applications, with low overhead. This is particularly important as
the data transfer costs to the host system and dedicated machine learning
accelerat... | [
{
"created": "Fri, 4 Sep 2020 18:35:58 GMT",
"version": "v1"
}
] | 2020-09-08 | [
[
"Siracusano",
"Giuseppe",
""
],
[
"Galea",
"Salvator",
""
],
[
"Sanvito",
"Davide",
""
],
[
"Malekzadeh",
"Mohammad",
""
],
[
"Haddadi",
"Hamed",
""
],
[
"Antichi",
"Gianni",
""
],
[
"Bifulco",
"Roberto",
"... | In this paper we show that the data plane of commodity programmable (Network Interface Cards) NICs can run neural network inference tasks required by packet monitoring applications, with low overhead. This is particularly important as the data transfer costs to the host system and dedicated machine learning accelerator... |
2402.04616 | Yijun Tian | Yijun Tian, Yikun Han, Xiusi Chen, Wei Wang, Nitesh V. Chawla | TinyLLM: Learning a Small Student from Multiple Large Language Models | null | null | null | null | cs.CL cs.AI cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Transferring the reasoning capability from stronger large language models
(LLMs) to smaller ones has been quite appealing, as smaller LLMs are more
flexible to deploy with less expense. Among the existing solutions, knowledge
distillation stands out due to its outstanding efficiency and generalization.
However, exist... | [
{
"created": "Wed, 7 Feb 2024 06:48:24 GMT",
"version": "v1"
},
{
"created": "Mon, 1 Apr 2024 01:28:48 GMT",
"version": "v2"
}
] | 2024-04-02 | [
[
"Tian",
"Yijun",
""
],
[
"Han",
"Yikun",
""
],
[
"Chen",
"Xiusi",
""
],
[
"Wang",
"Wei",
""
],
[
"Chawla",
"Nitesh V.",
""
]
] | Transferring the reasoning capability from stronger large language models (LLMs) to smaller ones has been quite appealing, as smaller LLMs are more flexible to deploy with less expense. Among the existing solutions, knowledge distillation stands out due to its outstanding efficiency and generalization. However, existin... |
2103.08759 | Gene Louis Kim | Gene Louis Kim, Viet Duong, Xin Lu, Lenhart Schubert | A Transition-based Parser for Unscoped Episodic Logical Forms | null | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | "Episodic Logic:Unscoped Logical Form" (EL-ULF) is a semantic representation
capturing predicate-argument structure as well as more challenging aspects of
language within the Episodic Logic formalism. We present the first learned
approach for parsing sentences into ULFs, using a growing set of annotated
examples. The... | [
{
"created": "Mon, 15 Mar 2021 23:09:32 GMT",
"version": "v1"
}
] | 2021-03-17 | [
[
"Kim",
"Gene Louis",
""
],
[
"Duong",
"Viet",
""
],
[
"Lu",
"Xin",
""
],
[
"Schubert",
"Lenhart",
""
]
] | "Episodic Logic:Unscoped Logical Form" (EL-ULF) is a semantic representation capturing predicate-argument structure as well as more challenging aspects of language within the Episodic Logic formalism. We present the first learned approach for parsing sentences into ULFs, using a growing set of annotated examples. The r... |
1911.07132 | Quanming Yao | Yongqi Zhang, Quanming Yao, Lei Chen | Interstellar: Searching Recurrent Architecture for Knowledge Graph
Embedding | Accepted to NeurIPS 2020 | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Knowledge graph (KG) embedding is well-known in learning representations of
KGs. Many models have been proposed to learn the interactions between entities
and relations of the triplets. However, long-term information among multiple
triplets is also important to KG. In this work, based on the relational paths,
which a... | [
{
"created": "Sun, 17 Nov 2019 02:16:24 GMT",
"version": "v1"
},
{
"created": "Sat, 24 Oct 2020 14:24:10 GMT",
"version": "v2"
},
{
"created": "Wed, 28 Apr 2021 07:16:19 GMT",
"version": "v3"
}
] | 2021-04-29 | [
[
"Zhang",
"Yongqi",
""
],
[
"Yao",
"Quanming",
""
],
[
"Chen",
"Lei",
""
]
] | Knowledge graph (KG) embedding is well-known in learning representations of KGs. Many models have been proposed to learn the interactions between entities and relations of the triplets. However, long-term information among multiple triplets is also important to KG. In this work, based on the relational paths, which are... |
1806.10051 | Sepehr Assadi | Sepehr Assadi, Krzysztof Onak, Baruch Schieber, Shay Solomon | Fully Dynamic Maximal Independent Set with Sublinear in n Update Time | null | null | null | null | cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The first fully dynamic algorithm for maintaining a maximal independent set
(MIS) with update time that is sublinear in the number of edges was presented
recently by the authors of this paper [Assadi et.al. STOC'18]. The algorithm is
deterministic and its update time is $O(m^{3/4})$, where $m$ is the
(dynamically cha... | [
{
"created": "Tue, 26 Jun 2018 15:07:47 GMT",
"version": "v1"
}
] | 2018-06-27 | [
[
"Assadi",
"Sepehr",
""
],
[
"Onak",
"Krzysztof",
""
],
[
"Schieber",
"Baruch",
""
],
[
"Solomon",
"Shay",
""
]
] | The first fully dynamic algorithm for maintaining a maximal independent set (MIS) with update time that is sublinear in the number of edges was presented recently by the authors of this paper [Assadi et.al. STOC'18]. The algorithm is deterministic and its update time is $O(m^{3/4})$, where $m$ is the (dynamically chang... |
1904.08754 | Fabio Giachelle | Fabio Giachelle, Gianmaria Silvello | A Progressive Visual Analytics Tool for Incremental Experimental
Evaluation | null | null | null | null | cs.IR | http://creativecommons.org/licenses/by/4.0/ | This paper presents a visual tool, AVIATOR, that integrates the progressive
visual analytics paradigm in the IR evaluation process. This tool serves to
speed-up and facilitate the performance assessment of retrieval models enabling
a result analysis through visual facilities. AVIATOR goes one step beyond the
common "... | [
{
"created": "Thu, 18 Apr 2019 13:16:53 GMT",
"version": "v1"
}
] | 2019-04-19 | [
[
"Giachelle",
"Fabio",
""
],
[
"Silvello",
"Gianmaria",
""
]
] | This paper presents a visual tool, AVIATOR, that integrates the progressive visual analytics paradigm in the IR evaluation process. This tool serves to speed-up and facilitate the performance assessment of retrieval models enabling a result analysis through visual facilities. AVIATOR goes one step beyond the common "co... |
2006.04672 | Weichao Mao | Weichao Mao, Kaiqing Zhang, Qiaomin Xie, Tamer Ba\c{s}ar | POLY-HOOT: Monte-Carlo Planning in Continuous Space MDPs with
Non-Asymptotic Analysis | NeurIPS 2020 | null | null | null | cs.AI cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Monte-Carlo planning, as exemplified by Monte-Carlo Tree Search (MCTS), has
demonstrated remarkable performance in applications with finite spaces. In this
paper, we consider Monte-Carlo planning in an environment with continuous
state-action spaces, a much less understood problem with important applications
in contr... | [
{
"created": "Mon, 8 Jun 2020 15:23:19 GMT",
"version": "v1"
},
{
"created": "Wed, 30 Dec 2020 05:21:05 GMT",
"version": "v2"
}
] | 2021-01-01 | [
[
"Mao",
"Weichao",
""
],
[
"Zhang",
"Kaiqing",
""
],
[
"Xie",
"Qiaomin",
""
],
[
"Başar",
"Tamer",
""
]
] | Monte-Carlo planning, as exemplified by Monte-Carlo Tree Search (MCTS), has demonstrated remarkable performance in applications with finite spaces. In this paper, we consider Monte-Carlo planning in an environment with continuous state-action spaces, a much less understood problem with important applications in control... |
2401.00162 | Guojian Wang | Guojian Wang, Faguo Wu, Xiao Zhang, Tianyuan Chen | Policy Optimization with Smooth Guidance Learned from State-Only
Demonstrations | 31 pages, 23 figures; This work has been submitted to the IEEE for
possible publication. Copyright may be transferred without notice, after
which this version may no longer be accessible | null | null | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The sparsity of reward feedback remains a challenging problem in online deep
reinforcement learning (DRL). Previous approaches have utilized offline
demonstrations to achieve impressive results in multiple hard tasks. However,
these approaches place high demands on demonstration quality, and obtaining
expert-like act... | [
{
"created": "Sat, 30 Dec 2023 07:41:45 GMT",
"version": "v1"
},
{
"created": "Wed, 10 Apr 2024 13:32:06 GMT",
"version": "v2"
},
{
"created": "Sat, 3 Aug 2024 01:14:11 GMT",
"version": "v3"
}
] | 2024-08-06 | [
[
"Wang",
"Guojian",
""
],
[
"Wu",
"Faguo",
""
],
[
"Zhang",
"Xiao",
""
],
[
"Chen",
"Tianyuan",
""
]
] | The sparsity of reward feedback remains a challenging problem in online deep reinforcement learning (DRL). Previous approaches have utilized offline demonstrations to achieve impressive results in multiple hard tasks. However, these approaches place high demands on demonstration quality, and obtaining expert-like actio... |
2009.09144 | Bojian Wu | Jiahui Lyu, Bojian Wu, Dani Lischinski, Daniel Cohen-Or, Hui Huang | Differentiable Refraction-Tracing for Mesh Reconstruction of Transparent
Objects | 13 pages, 21 figures | ACM Trans. on Graphics (Proc. of SIGGRAPH Asia 2020) | 10.1145/3414685.3417815 | null | cs.GR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Capturing the 3D geometry of transparent objects is a challenging task,
ill-suited for general-purpose scanning and reconstruction techniques, since
these cannot handle specular light transport phenomena. Existing
state-of-the-art methods, designed specifically for this task, either involve a
complex setup to reconst... | [
{
"created": "Sat, 19 Sep 2020 02:29:00 GMT",
"version": "v1"
}
] | 2020-09-22 | [
[
"Lyu",
"Jiahui",
""
],
[
"Wu",
"Bojian",
""
],
[
"Lischinski",
"Dani",
""
],
[
"Cohen-Or",
"Daniel",
""
],
[
"Huang",
"Hui",
""
]
] | Capturing the 3D geometry of transparent objects is a challenging task, ill-suited for general-purpose scanning and reconstruction techniques, since these cannot handle specular light transport phenomena. Existing state-of-the-art methods, designed specifically for this task, either involve a complex setup to reconstru... |
1909.06997 | Han Liu | Han Liu, Ge Gao, Hehua Zhang, Yu-Shen Liu, Yan Song, Ming Gu | MVDLite: a Fast Validation Algorithm for Model View Definition Rules | Preprint submitted to 29th International Workshop on Intelligent
Computing in Engineering (EG-ICE) | null | 10.7146/aul.455.c192 | null | cs.DB | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Model View Definition (MVD) is the standard methodology to define the data
exchange requirements and rule constraints for Building Information Models
(BIMs). In this paper, the MVDLite algorithm is proposed for the fast
validation of MVD rules. A "rule chain" structure is introduced to combine the
data templates, con... | [
{
"created": "Mon, 16 Sep 2019 05:39:49 GMT",
"version": "v1"
},
{
"created": "Fri, 31 Jan 2020 08:54:35 GMT",
"version": "v2"
},
{
"created": "Fri, 4 Mar 2022 00:41:00 GMT",
"version": "v3"
},
{
"created": "Sun, 17 Apr 2022 15:18:16 GMT",
"version": "v4"
}
] | 2023-12-29 | [
[
"Liu",
"Han",
""
],
[
"Gao",
"Ge",
""
],
[
"Zhang",
"Hehua",
""
],
[
"Liu",
"Yu-Shen",
""
],
[
"Song",
"Yan",
""
],
[
"Gu",
"Ming",
""
]
] | Model View Definition (MVD) is the standard methodology to define the data exchange requirements and rule constraints for Building Information Models (BIMs). In this paper, the MVDLite algorithm is proposed for the fast validation of MVD rules. A "rule chain" structure is introduced to combine the data templates, const... |
2308.00566 | Amir Bar | Amir Bar, Florian Bordes, Assaf Shocher, Mahmoud Assran, Pascal
Vincent, Nicolas Ballas, Trevor Darrell, Amir Globerson, Yann LeCun | Stochastic positional embeddings improve masked image modeling | Code and models available in https://github.com/amirbar/StoP | null | null | null | cs.CV cs.AI cs.LG | http://creativecommons.org/licenses/by/4.0/ | Masked Image Modeling (MIM) is a promising self-supervised learning approach
that enables learning from unlabeled images. Despite its recent success,
learning good representations through MIM remains challenging because it
requires predicting the right semantic content in accurate locations. For
example, given an inc... | [
{
"created": "Mon, 31 Jul 2023 17:59:08 GMT",
"version": "v1"
},
{
"created": "Tue, 27 Feb 2024 18:59:14 GMT",
"version": "v2"
}
] | 2024-02-28 | [
[
"Bar",
"Amir",
""
],
[
"Bordes",
"Florian",
""
],
[
"Shocher",
"Assaf",
""
],
[
"Assran",
"Mahmoud",
""
],
[
"Vincent",
"Pascal",
""
],
[
"Ballas",
"Nicolas",
""
],
[
"Darrell",
"Trevor",
""
],
[
"G... | Masked Image Modeling (MIM) is a promising self-supervised learning approach that enables learning from unlabeled images. Despite its recent success, learning good representations through MIM remains challenging because it requires predicting the right semantic content in accurate locations. For example, given an incom... |
2010.06059 | Sonia Baee | Sonia Baee, Mark Rucker, Anna Baglione, Mawulolo K. Ameko, Laura
Barnes | A Framework for Addressing the Risks and Opportunities In AI-Supported
Virtual Health Coaches | 4 pages | null | 10.1145/3421937.3421971 | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Virtual coaching has rapidly evolved into a foundational component of modern
clinical practice. At a time when healthcare professionals are in short supply
and the demand for low-cost treatments is ever-increasing, virtual health
coaches (VHCs) offer intervention-on-demand for those limited by finances or
geographic ... | [
{
"created": "Mon, 12 Oct 2020 22:41:35 GMT",
"version": "v1"
}
] | 2021-01-06 | [
[
"Baee",
"Sonia",
""
],
[
"Rucker",
"Mark",
""
],
[
"Baglione",
"Anna",
""
],
[
"Ameko",
"Mawulolo K.",
""
],
[
"Barnes",
"Laura",
""
]
] | Virtual coaching has rapidly evolved into a foundational component of modern clinical practice. At a time when healthcare professionals are in short supply and the demand for low-cost treatments is ever-increasing, virtual health coaches (VHCs) offer intervention-on-demand for those limited by finances or geographic ac... |
2310.11886 | Yanhao Wang | Jiaxi Pu, Yanhao Wang, Yuchen Li, Xuan Zhou | Sampling Algorithms for Butterfly Counting on Temporal Bipartite Graphs | 10 pages, 10 figures; under review | null | null | null | cs.SI cs.DB cs.DS | http://creativecommons.org/licenses/by-nc-sa/4.0/ | Temporal bipartite graphs are widely used to denote time-evolving
relationships between two disjoint sets of nodes, such as customer-product
interactions in E-commerce and user-group memberships in social networks.
Temporal butterflies, $(2,2)$-bicliques that occur within a short period and in
a prescribed order, are... | [
{
"created": "Wed, 18 Oct 2023 11:11:19 GMT",
"version": "v1"
}
] | 2023-10-19 | [
[
"Pu",
"Jiaxi",
""
],
[
"Wang",
"Yanhao",
""
],
[
"Li",
"Yuchen",
""
],
[
"Zhou",
"Xuan",
""
]
] | Temporal bipartite graphs are widely used to denote time-evolving relationships between two disjoint sets of nodes, such as customer-product interactions in E-commerce and user-group memberships in social networks. Temporal butterflies, $(2,2)$-bicliques that occur within a short period and in a prescribed order, are e... |
0708.1211 | Mark Iwen | M. A. Iwen | A Deterministic Sub-linear Time Sparse Fourier Algorithm via
Non-adaptive Compressed Sensing Methods | 16 pages total, 10 in paper, 6 in appended | null | null | null | cs.DM cs.NA | null | We study the problem of estimating the best B term Fourier representation for
a given frequency-sparse signal (i.e., vector) $\textbf{A}$ of length $N \gg
B$. More explicitly, we investigate how to deterministically identify B of the
largest magnitude frequencies of $\hat{\textbf{A}}$, and estimate their
coefficients... | [
{
"created": "Thu, 9 Aug 2007 04:07:06 GMT",
"version": "v1"
}
] | 2007-08-10 | [
[
"Iwen",
"M. A.",
""
]
] | We study the problem of estimating the best B term Fourier representation for a given frequency-sparse signal (i.e., vector) $\textbf{A}$ of length $N \gg B$. More explicitly, we investigate how to deterministically identify B of the largest magnitude frequencies of $\hat{\textbf{A}}$, and estimate their coefficients, ... |
2306.00612 | Jiakang Yuan | Jiakang Yuan, Bo Zhang, Xiangchao Yan, Tao Chen, Botian Shi, Yikang
Li, Yu Qiao | AD-PT: Autonomous Driving Pre-Training with Large-scale Point Cloud
Dataset | Accepted by NeurIPS 2023. Project page:
https://jiakangyuan.github.io/AD-PT.github.io/ | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | It is a long-term vision for Autonomous Driving (AD) community that the
perception models can learn from a large-scale point cloud dataset, to obtain
unified representations that can achieve promising results on different tasks
or benchmarks. Previous works mainly focus on the self-supervised pre-training
pipeline, m... | [
{
"created": "Thu, 1 Jun 2023 12:32:52 GMT",
"version": "v1"
},
{
"created": "Mon, 10 Jul 2023 12:32:23 GMT",
"version": "v2"
},
{
"created": "Thu, 26 Oct 2023 15:20:31 GMT",
"version": "v3"
}
] | 2023-10-27 | [
[
"Yuan",
"Jiakang",
""
],
[
"Zhang",
"Bo",
""
],
[
"Yan",
"Xiangchao",
""
],
[
"Chen",
"Tao",
""
],
[
"Shi",
"Botian",
""
],
[
"Li",
"Yikang",
""
],
[
"Qiao",
"Yu",
""
]
] | It is a long-term vision for Autonomous Driving (AD) community that the perception models can learn from a large-scale point cloud dataset, to obtain unified representations that can achieve promising results on different tasks or benchmarks. Previous works mainly focus on the self-supervised pre-training pipeline, mea... |
2405.01716 | Jayshree Sarathy | Rachel Cummings and Shlomi Hod and Jayshree Sarathy and Marika
Swanberg | ATTAXONOMY: Unpacking Differential Privacy Guarantees Against Practical
Adversaries | null | null | null | null | cs.CR cs.CY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Differential Privacy (DP) is a mathematical framework that is increasingly
deployed to mitigate privacy risks associated with machine learning and
statistical analyses. Despite the growing adoption of DP, its technical privacy
parameters do not lend themselves to an intelligible description of the
real-world privacy ... | [
{
"created": "Thu, 2 May 2024 20:23:23 GMT",
"version": "v1"
}
] | 2024-05-06 | [
[
"Cummings",
"Rachel",
""
],
[
"Hod",
"Shlomi",
""
],
[
"Sarathy",
"Jayshree",
""
],
[
"Swanberg",
"Marika",
""
]
] | Differential Privacy (DP) is a mathematical framework that is increasingly deployed to mitigate privacy risks associated with machine learning and statistical analyses. Despite the growing adoption of DP, its technical privacy parameters do not lend themselves to an intelligible description of the real-world privacy ri... |
1902.09212 | Bin Xiao | Ke Sun and Bin Xiao and Dong Liu and Jingdong Wang | Deep High-Resolution Representation Learning for Human Pose Estimation | accepted by CVPR2019 | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This is an official pytorch implementation of Deep High-Resolution
Representation Learning for Human Pose Estimation. In this work, we are
interested in the human pose estimation problem with a focus on learning
reliable high-resolution representations. Most existing methods recover
high-resolution representations fr... | [
{
"created": "Mon, 25 Feb 2019 11:55:28 GMT",
"version": "v1"
}
] | 2019-02-26 | [
[
"Sun",
"Ke",
""
],
[
"Xiao",
"Bin",
""
],
[
"Liu",
"Dong",
""
],
[
"Wang",
"Jingdong",
""
]
] | This is an official pytorch implementation of Deep High-Resolution Representation Learning for Human Pose Estimation. In this work, we are interested in the human pose estimation problem with a focus on learning reliable high-resolution representations. Most existing methods recover high-resolution representations from... |
1409.1544 | Thomas Streicher | Ingo Battenfeld, Klaus Keimel, Thomas Streicher | Observationally-induced algebras in Domain Theory | 26 pages | Logical Methods in Computer Science, Volume 10, Issue 3 (September
11, 2014) lmcs:963 | 10.2168/LMCS-10(3:18)2014 | null | cs.LO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper we revise and simplify the notion of observationally induced
algebra introduced by Simpson and Schroeder for the purpose of modelling
computational effects in the particular case where the ambient category is
given by classical domain theory. As examples of the general framework we
consider the various ... | [
{
"created": "Thu, 4 Sep 2014 19:09:12 GMT",
"version": "v1"
},
{
"created": "Fri, 5 Sep 2014 10:41:07 GMT",
"version": "v2"
},
{
"created": "Wed, 10 Sep 2014 14:57:23 GMT",
"version": "v3"
},
{
"created": "Thu, 27 Oct 2016 15:29:15 GMT",
"version": "v4"
}
] | 2016-10-28 | [
[
"Battenfeld",
"Ingo",
""
],
[
"Keimel",
"Klaus",
""
],
[
"Streicher",
"Thomas",
""
]
] | In this paper we revise and simplify the notion of observationally induced algebra introduced by Simpson and Schroeder for the purpose of modelling computational effects in the particular case where the ambient category is given by classical domain theory. As examples of the general framework we consider the various po... |
1104.1471 | Xiao Ma | Xiao Ma and Jia Liu and Baoming Bai | New Techniques for Upper-Bounding the ML Decoding Performance of Binary
Linear Codes | null | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, new techniques are presented to either simplify or improve
most existing upper bounds on the maximum-likelihood (ML) decoding performance
of the binary linear codes over additive white Gaussian noise (AWGN) channels.
Firstly, the recently proposed union bound using truncated weight spectrums by
Ma {\em... | [
{
"created": "Fri, 8 Apr 2011 03:06:36 GMT",
"version": "v1"
},
{
"created": "Mon, 3 Sep 2012 06:19:40 GMT",
"version": "v2"
}
] | 2015-03-19 | [
[
"Ma",
"Xiao",
""
],
[
"Liu",
"Jia",
""
],
[
"Bai",
"Baoming",
""
]
] | In this paper, new techniques are presented to either simplify or improve most existing upper bounds on the maximum-likelihood (ML) decoding performance of the binary linear codes over additive white Gaussian noise (AWGN) channels. Firstly, the recently proposed union bound using truncated weight spectrums by Ma {\em e... |
1905.04084 | Peng Zhang | Peng Zhang, Xiaoyu Ge, Jochen Renz | Support Relation Analysis for Objects in Multiple View RGB-D Images | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Understanding physical relations between objects, especially their support
relations, is crucial for robotic manipulation. There has been work on
reasoning about support relations and structural stability of simple
configurations in RGB-D images. In this paper, we propose a method for
extracting more detailed physica... | [
{
"created": "Fri, 10 May 2019 11:49:49 GMT",
"version": "v1"
}
] | 2019-05-13 | [
[
"Zhang",
"Peng",
""
],
[
"Ge",
"Xiaoyu",
""
],
[
"Renz",
"Jochen",
""
]
] | Understanding physical relations between objects, especially their support relations, is crucial for robotic manipulation. There has been work on reasoning about support relations and structural stability of simple configurations in RGB-D images. In this paper, we propose a method for extracting more detailed physical ... |
1210.3769 | Mahima Mehta | Mahima Mehta, Ranjan Bala Jain and Abhay Karandikar | Analysis of Blocking Probability in a Relay-based Cellular OFDMA Network | 33 pages, 10 figures | Pre-print version (May 2012) | null | null | cs.IT cs.NI math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Relay deployment in Orthogonal Frequency Division Multiple Access (OFDMA)
based cellular networks helps in coverage extension and or capacity
improvement. In OFDMA system, each user requires different number of
subcarriers to meet its rate requirement. This resource requirement depends on
the Signal to Interference R... | [
{
"created": "Sun, 14 Oct 2012 09:14:13 GMT",
"version": "v1"
},
{
"created": "Tue, 29 Apr 2014 15:32:20 GMT",
"version": "v2"
}
] | 2014-04-30 | [
[
"Mehta",
"Mahima",
""
],
[
"Jain",
"Ranjan Bala",
""
],
[
"Karandikar",
"Abhay",
""
]
] | Relay deployment in Orthogonal Frequency Division Multiple Access (OFDMA) based cellular networks helps in coverage extension and or capacity improvement. In OFDMA system, each user requires different number of subcarriers to meet its rate requirement. This resource requirement depends on the Signal to Interference Rat... |
2106.14421 | Maxime Gasse | Maxime Gasse, Damien Grasset, Guillaume Gaudron, Pierre-Yves Oudeyer | Causal Reinforcement Learning using Observational and Interventional
Data | null | null | null | null | cs.LG | http://creativecommons.org/licenses/by/4.0/ | Learning efficiently a causal model of the environment is a key challenge of
model-based RL agents operating in POMDPs. We consider here a scenario where
the learning agent has the ability to collect online experiences through direct
interactions with the environment (interventional data), but has also access to
a la... | [
{
"created": "Mon, 28 Jun 2021 06:58:20 GMT",
"version": "v1"
}
] | 2021-06-29 | [
[
"Gasse",
"Maxime",
""
],
[
"Grasset",
"Damien",
""
],
[
"Gaudron",
"Guillaume",
""
],
[
"Oudeyer",
"Pierre-Yves",
""
]
] | Learning efficiently a causal model of the environment is a key challenge of model-based RL agents operating in POMDPs. We consider here a scenario where the learning agent has the ability to collect online experiences through direct interactions with the environment (interventional data), but has also access to a larg... |
2112.01914 | Zheyuan Zhou | Zheyuan Zhou, Liang Du, Xiaoqing Ye, Zhikang Zou, Xiao Tan, Li Zhang,
Xiangyang Xue, Jianfeng Feng | SGM3D: Stereo Guided Monocular 3D Object Detection | 8 pages, 5 figures | null | 10.1109/LRA.2022.3191849 | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Monocular 3D object detection aims to predict the object location, dimension
and orientation in 3D space alongside the object category given only a
monocular image. It poses a great challenge due to its ill-posed property which
is critically lack of depth information in the 2D image plane. While there
exist approache... | [
{
"created": "Fri, 3 Dec 2021 13:57:14 GMT",
"version": "v1"
},
{
"created": "Thu, 24 Feb 2022 16:43:36 GMT",
"version": "v2"
}
] | 2023-07-06 | [
[
"Zhou",
"Zheyuan",
""
],
[
"Du",
"Liang",
""
],
[
"Ye",
"Xiaoqing",
""
],
[
"Zou",
"Zhikang",
""
],
[
"Tan",
"Xiao",
""
],
[
"Zhang",
"Li",
""
],
[
"Xue",
"Xiangyang",
""
],
[
"Feng",
"Jianfeng"... | Monocular 3D object detection aims to predict the object location, dimension and orientation in 3D space alongside the object category given only a monocular image. It poses a great challenge due to its ill-posed property which is critically lack of depth information in the 2D image plane. While there exist approaches ... |
2106.10905 | Pashupati Hegde | Pashupati Hegde, \c{C}a\u{g}atay Y{\i}ld{\i}z, Harri L\"ahdesm\"aki,
Samuel Kaski, Markus Heinonen | Variational multiple shooting for Bayesian ODEs with Gaussian processes | Camera-ready version at UAI 2022 | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Recent machine learning advances have proposed black-box estimation of
unknown continuous-time system dynamics directly from data. However, earlier
works are based on approximative ODE solutions or point estimates. We propose a
novel Bayesian nonparametric model that uses Gaussian processes to infer
posteriors of unk... | [
{
"created": "Mon, 21 Jun 2021 08:09:17 GMT",
"version": "v1"
},
{
"created": "Wed, 26 Jan 2022 08:03:04 GMT",
"version": "v2"
},
{
"created": "Sun, 17 Jul 2022 17:16:39 GMT",
"version": "v3"
}
] | 2022-07-19 | [
[
"Hegde",
"Pashupati",
""
],
[
"Yıldız",
"Çağatay",
""
],
[
"Lähdesmäki",
"Harri",
""
],
[
"Kaski",
"Samuel",
""
],
[
"Heinonen",
"Markus",
""
]
] | Recent machine learning advances have proposed black-box estimation of unknown continuous-time system dynamics directly from data. However, earlier works are based on approximative ODE solutions or point estimates. We propose a novel Bayesian nonparametric model that uses Gaussian processes to infer posteriors of unkno... |
1607.01517 | Erel Segal-Halevi | Erel Segal-Halevi, Shmuel Nitzan | Envy-Free Cake-Cutting among Families | The paper is obsolete - it is subsumed by the paper "Fair
Cake-Cutting among Families", arXiv:1510.03903 | null | null | null | cs.GT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper extends the classic cake-cutting problem to a situation in which
the "cake" is divided among families. Each piece of cake is owned and used
simultaneously by all members of the family. A typical example of such a cake
is land. We examine three ways to assess the fairness of such a division, based
on the cl... | [
{
"created": "Wed, 6 Jul 2016 08:24:57 GMT",
"version": "v1"
},
{
"created": "Fri, 9 Aug 2019 10:07:15 GMT",
"version": "v2"
}
] | 2019-08-12 | [
[
"Segal-Halevi",
"Erel",
""
],
[
"Nitzan",
"Shmuel",
""
]
] | This paper extends the classic cake-cutting problem to a situation in which the "cake" is divided among families. Each piece of cake is owned and used simultaneously by all members of the family. A typical example of such a cake is land. We examine three ways to assess the fairness of such a division, based on the clas... |
2403.20273 | Sergio Vitale | Wenyu Yang, Sergio Vitale, Hossein Aghababaei, Giampaolo Ferraioli,
Vito Pascazio, Gilda Schirinzi | CATSNet: a context-aware network for Height Estimation in a Forested
Area based on Pol-TomoSAR data | Submitted to IEEE TGRS, under review | null | null | null | cs.CV | http://creativecommons.org/licenses/by/4.0/ | Tropical forests are a key component of the global carbon cycle. With plans
for upcoming space-borne missions like BIOMASS to monitor forestry, several
airborne missions, including TropiSAR and AfriSAR campaigns, have been
successfully launched and experimented. Typical Synthetic Aperture Radar
Tomography (TomoSAR) m... | [
{
"created": "Fri, 29 Mar 2024 16:27:40 GMT",
"version": "v1"
}
] | 2024-04-01 | [
[
"Yang",
"Wenyu",
""
],
[
"Vitale",
"Sergio",
""
],
[
"Aghababaei",
"Hossein",
""
],
[
"Ferraioli",
"Giampaolo",
""
],
[
"Pascazio",
"Vito",
""
],
[
"Schirinzi",
"Gilda",
""
]
] | Tropical forests are a key component of the global carbon cycle. With plans for upcoming space-borne missions like BIOMASS to monitor forestry, several airborne missions, including TropiSAR and AfriSAR campaigns, have been successfully launched and experimented. Typical Synthetic Aperture Radar Tomography (TomoSAR) met... |
1404.0442 | Kevin Carlberg | Kevin Carlberg | Adaptive $h$-refinement for reduced-order models | submitted to the International Journal for Numerical Methods in
Engineering, Special Issue on Model Reduction | International Journal for Numerical Methods in Engineering, Vol.
102, No. 5, p.1192-1210 (2014) | 10.1002/nme.4800 | null | cs.NA math.NA | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This work presents a method to adaptively refine reduced-order models \emph{a
posteriori} without requiring additional full-order-model solves. The technique
is analogous to mesh-adaptive $h$-refinement: it enriches the reduced-basis
space online by `splitting' a given basis vector into several vectors with
disjoint ... | [
{
"created": "Wed, 2 Apr 2014 03:29:43 GMT",
"version": "v1"
},
{
"created": "Thu, 3 Apr 2014 04:12:34 GMT",
"version": "v2"
},
{
"created": "Fri, 18 Jul 2014 01:09:10 GMT",
"version": "v3"
}
] | 2015-04-16 | [
[
"Carlberg",
"Kevin",
""
]
] | This work presents a method to adaptively refine reduced-order models \emph{a posteriori} without requiring additional full-order-model solves. The technique is analogous to mesh-adaptive $h$-refinement: it enriches the reduced-basis space online by `splitting' a given basis vector into several vectors with disjoint su... |
2305.10172 | Yang Deng | Yang Deng, Wenxuan Zhang, Yifei Yuan, Wai Lam | Knowledge-enhanced Mixed-initiative Dialogue System for Emotional
Support Conversations | Accepted by ACL 2023 main conference | null | null | null | cs.CL cs.IR | http://creativecommons.org/licenses/by/4.0/ | Unlike empathetic dialogues, the system in emotional support conversations
(ESC) is expected to not only convey empathy for comforting the help-seeker,
but also proactively assist in exploring and addressing their problems during
the conversation. In this work, we study the problem of mixed-initiative ESC
where the u... | [
{
"created": "Wed, 17 May 2023 12:55:52 GMT",
"version": "v1"
}
] | 2023-05-18 | [
[
"Deng",
"Yang",
""
],
[
"Zhang",
"Wenxuan",
""
],
[
"Yuan",
"Yifei",
""
],
[
"Lam",
"Wai",
""
]
] | Unlike empathetic dialogues, the system in emotional support conversations (ESC) is expected to not only convey empathy for comforting the help-seeker, but also proactively assist in exploring and addressing their problems during the conversation. In this work, we study the problem of mixed-initiative ESC where the use... |
1009.5048 | S. M. Kamruzzaman | Abdul Kadar Muhammad Masum, Mohammad Mahadi Hassan, and S. M.
Kamruzzaman | The Most Advantageous Bangla Keyboard Layout Using Data Mining Technique | 10 Pages, International Journal | Journal of Computer Science, IBAIS University, Dkhaka, Bangladesh,
Vol. 1, No. 2, Dec. 2007 | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Bangla alphabet has a large number of letters, for this it is complicated to
type faster using Bangla keyboard. The proposed keyboard will maximize the
speed of operator as they can type with both hands parallel. Association rule
of data mining to distribute the Bangla characters in the keyboard is used
here. The fre... | [
{
"created": "Sun, 26 Sep 2010 02:09:41 GMT",
"version": "v1"
}
] | 2010-09-28 | [
[
"Masum",
"Abdul Kadar Muhammad",
""
],
[
"Hassan",
"Mohammad Mahadi",
""
],
[
"Kamruzzaman",
"S. M.",
""
]
] | Bangla alphabet has a large number of letters, for this it is complicated to type faster using Bangla keyboard. The proposed keyboard will maximize the speed of operator as they can type with both hands parallel. Association rule of data mining to distribute the Bangla characters in the keyboard is used here. The frequ... |
1911.03951 | Eyke H\"ullermeier | Ammar Shaker and Eyke H\"ullermeier | TSK-Streams: Learning TSK Fuzzy Systems on Data Streams | null | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The problem of adaptive learning from evolving and possibly non-stationary
data streams has attracted a lot of interest in machine learning in the recent
past, and also stimulated research in related fields, such as computational
intelligence and fuzzy systems. In particular, several rule-based methods for
the increm... | [
{
"created": "Sun, 10 Nov 2019 16:04:22 GMT",
"version": "v1"
}
] | 2019-11-12 | [
[
"Shaker",
"Ammar",
""
],
[
"Hüllermeier",
"Eyke",
""
]
] | The problem of adaptive learning from evolving and possibly non-stationary data streams has attracted a lot of interest in machine learning in the recent past, and also stimulated research in related fields, such as computational intelligence and fuzzy systems. In particular, several rule-based methods for the incremen... |
2406.17813 | Salvatore Greco | Salvatore Greco, Bartolomeo Vacchetti, Daniele Apiletti, Tania
Cerquitelli | Unsupervised Concept Drift Detection from Deep Learning Representations
in Real-time | null | null | null | null | cs.LG cs.AI | http://creativecommons.org/licenses/by-nc-sa/4.0/ | Concept Drift is a phenomenon in which the underlying data distribution and
statistical properties of a target domain change over time, leading to a
degradation of the model's performance. Consequently, models deployed in
production require continuous monitoring through drift detection techniques.
Most drift detectio... | [
{
"created": "Mon, 24 Jun 2024 23:41:46 GMT",
"version": "v1"
}
] | 2024-06-27 | [
[
"Greco",
"Salvatore",
""
],
[
"Vacchetti",
"Bartolomeo",
""
],
[
"Apiletti",
"Daniele",
""
],
[
"Cerquitelli",
"Tania",
""
]
] | Concept Drift is a phenomenon in which the underlying data distribution and statistical properties of a target domain change over time, leading to a degradation of the model's performance. Consequently, models deployed in production require continuous monitoring through drift detection techniques. Most drift detection ... |
1601.05003 | Florent Foucaud | Florent Foucaud and Ralf Klasing | Parameterized and approximation complexity of the detection pair problem
in graphs | 13 pages | Journal of Graph Algorithms and Applications 21(6):1039-1056, 2017 | 10.7155/jgaa.00449 | null | cs.DS cs.DM | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We study the complexity of the problem DETECTION PAIR. A detection pair of a
graph $G$ is a pair $(W,L)$ of sets of detectors with $W\subseteq V(G)$, the
watchers, and $L\subseteq V(G)$, the listeners, such that for every pair $u,v$
of vertices that are not dominated by a watcher of $W$, there is a listener of
$L$ wh... | [
{
"created": "Tue, 19 Jan 2016 17:20:40 GMT",
"version": "v1"
},
{
"created": "Tue, 30 Jan 2018 07:00:24 GMT",
"version": "v2"
}
] | 2018-01-31 | [
[
"Foucaud",
"Florent",
""
],
[
"Klasing",
"Ralf",
""
]
] | We study the complexity of the problem DETECTION PAIR. A detection pair of a graph $G$ is a pair $(W,L)$ of sets of detectors with $W\subseteq V(G)$, the watchers, and $L\subseteq V(G)$, the listeners, such that for every pair $u,v$ of vertices that are not dominated by a watcher of $W$, there is a listener of $L$ whos... |
2303.06010 | Timothy Cargan | Timothy Cargan, Dario Landa-Silva, Isaac Triguero | Local-Global Methods for Generalised Solar Irradiance Forecasting | 40 pages, 11 figures | null | null | null | cs.LG | http://creativecommons.org/licenses/by/4.0/ | As the use of solar power increases, having accurate and timely forecasts
will be essential for smooth grid operators. There are many proposed methods
for forecasting solar irradiance / solar power production. However, many of
these methods formulate the problem as a time-series, relying on near real-time
access to o... | [
{
"created": "Fri, 10 Mar 2023 16:13:35 GMT",
"version": "v1"
},
{
"created": "Mon, 10 Jul 2023 15:33:54 GMT",
"version": "v2"
}
] | 2023-07-11 | [
[
"Cargan",
"Timothy",
""
],
[
"Landa-Silva",
"Dario",
""
],
[
"Triguero",
"Isaac",
""
]
] | As the use of solar power increases, having accurate and timely forecasts will be essential for smooth grid operators. There are many proposed methods for forecasting solar irradiance / solar power production. However, many of these methods formulate the problem as a time-series, relying on near real-time access to obs... |
1605.05172 | Taraka Rama Kasicheyanula | Taraka Rama | Siamese convolutional networks based on phonetic features for cognate
identification | null | null | null | null | cs.CL | http://creativecommons.org/licenses/by-sa/4.0/ | In this paper, we explore the use of convolutional networks (ConvNets) for
the purpose of cognate identification. We compare our architecture with binary
classifiers based on string similarity measures on different language families.
Our experiments show that convolutional networks achieve competitive results
across ... | [
{
"created": "Tue, 17 May 2016 14:07:43 GMT",
"version": "v1"
},
{
"created": "Sat, 2 Jul 2016 12:29:08 GMT",
"version": "v2"
}
] | 2016-07-05 | [
[
"Rama",
"Taraka",
""
]
] | In this paper, we explore the use of convolutional networks (ConvNets) for the purpose of cognate identification. We compare our architecture with binary classifiers based on string similarity measures on different language families. Our experiments show that convolutional networks achieve competitive results across co... |
2206.06257 | Yihua Zhang | Gaoyuan Zhang, Songtao Lu, Yihua Zhang, Xiangyi Chen, Pin-Yu Chen,
Quanfu Fan, Lee Martie, Lior Horesh, Mingyi Hong, Sijia Liu | Distributed Adversarial Training to Robustify Deep Neural Networks at
Scale | null | null | null | null | cs.LG | http://creativecommons.org/licenses/by/4.0/ | Current deep neural networks (DNNs) are vulnerable to adversarial attacks,
where adversarial perturbations to the inputs can change or manipulate
classification. To defend against such attacks, an effective and popular
approach, known as adversarial training (AT), has been shown to mitigate the
negative impact of adv... | [
{
"created": "Mon, 13 Jun 2022 15:39:43 GMT",
"version": "v1"
},
{
"created": "Wed, 7 Sep 2022 15:37:17 GMT",
"version": "v2"
}
] | 2022-09-08 | [
[
"Zhang",
"Gaoyuan",
""
],
[
"Lu",
"Songtao",
""
],
[
"Zhang",
"Yihua",
""
],
[
"Chen",
"Xiangyi",
""
],
[
"Chen",
"Pin-Yu",
""
],
[
"Fan",
"Quanfu",
""
],
[
"Martie",
"Lee",
""
],
[
"Horesh",
"L... | Current deep neural networks (DNNs) are vulnerable to adversarial attacks, where adversarial perturbations to the inputs can change or manipulate classification. To defend against such attacks, an effective and popular approach, known as adversarial training (AT), has been shown to mitigate the negative impact of adver... |
2210.15027 | ELkebir Sarhrouni | Asma Elmaizi, Hasna Nhaila, Elkebir Sarhrouni, Ahmed Hammouch, and
Chafik Nacir | A novel information gain-based approach for classification and
dimensionality reduction of hyperspectral images | null | Procedia Computer Science, 2019, 148, pp. 126-134. DOI:
10.1016/j.procs.2019.01.016 -
http://www.scopus.com/inward/record.url?eid=2-s2.0-85062681587&partnerID=MN8TOARS | 10.1016/j.procs.2019.01.016 | null | cs.CV | http://creativecommons.org/licenses/by-nc-nd/4.0/ | Recently, the hyperspectral sensors have improved our ability to monitor the
earth surface with high spectral resolution. However, the high dimensionality
of spectral data brings challenges for the image processing. Consequently, the
dimensionality reduction is a necessary step in order to reduce the
computational co... | [
{
"created": "Wed, 26 Oct 2022 20:59:57 GMT",
"version": "v1"
}
] | 2022-10-28 | [
[
"Elmaizi",
"Asma",
""
],
[
"Nhaila",
"Hasna",
""
],
[
"Sarhrouni",
"Elkebir",
""
],
[
"Hammouch",
"Ahmed",
""
],
[
"Nacir",
"Chafik",
""
]
] | Recently, the hyperspectral sensors have improved our ability to monitor the earth surface with high spectral resolution. However, the high dimensionality of spectral data brings challenges for the image processing. Consequently, the dimensionality reduction is a necessary step in order to reduce the computational comp... |
2305.01303 | No\'e P\'erez-Higueras | No\'e P\'erez-Higueras and Roberto Otero and Fernando Caballero and
Luis Merino | HuNavSim: A ROS 2 Human Navigation Simulator for Benchmarking
Human-Aware Robot Navigation | Preprint version of the paper accepted in the RA-L Journal | null | null | null | cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This work presents the Human Navigation Simulator (HuNavSim), a novel
open-source tool for the simulation of different human-agent navigation
behaviors in scenarios with mobile robots. The tool, the first programmed under
the ROS 2 framework, can be employed along with different well-known robotics
simulators like Ga... | [
{
"created": "Tue, 2 May 2023 10:26:51 GMT",
"version": "v1"
},
{
"created": "Wed, 17 May 2023 14:13:47 GMT",
"version": "v2"
},
{
"created": "Wed, 13 Sep 2023 13:15:44 GMT",
"version": "v3"
}
] | 2023-09-14 | [
[
"Pérez-Higueras",
"Noé",
""
],
[
"Otero",
"Roberto",
""
],
[
"Caballero",
"Fernando",
""
],
[
"Merino",
"Luis",
""
]
] | This work presents the Human Navigation Simulator (HuNavSim), a novel open-source tool for the simulation of different human-agent navigation behaviors in scenarios with mobile robots. The tool, the first programmed under the ROS 2 framework, can be employed along with different well-known robotics simulators like Gaze... |
2305.05091 | Prateek Chhikara | Prateek Chhikara, Jiarui Zhang, Filip Ilievski, Jonathan Francis and
Kaixin Ma | Knowledge-enhanced Agents for Interactive Text Games | Published at K-CAP '23 | null | 10.1145/3587259.3627561 | null | cs.CL cs.AI cs.HC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Communication via natural language is a key aspect of machine intelligence,
and it requires computational models to learn and reason about world concepts,
with varying levels of supervision. Significant progress has been made on
fully-supervised non-interactive tasks, such as question-answering and
procedural text un... | [
{
"created": "Mon, 8 May 2023 23:31:39 GMT",
"version": "v1"
},
{
"created": "Sun, 17 Dec 2023 02:03:29 GMT",
"version": "v2"
}
] | 2023-12-19 | [
[
"Chhikara",
"Prateek",
""
],
[
"Zhang",
"Jiarui",
""
],
[
"Ilievski",
"Filip",
""
],
[
"Francis",
"Jonathan",
""
],
[
"Ma",
"Kaixin",
""
]
] | Communication via natural language is a key aspect of machine intelligence, and it requires computational models to learn and reason about world concepts, with varying levels of supervision. Significant progress has been made on fully-supervised non-interactive tasks, such as question-answering and procedural text unde... |
2401.06521 | Junxian Mu | Yu Wang, Junxian Mu, Pengfei Zhu, Qinghua Hu | Exploring Diverse Representations for Open Set Recognition | 9 pages, 4 figures. Accepted to AAAI 2024 | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Open set recognition (OSR) requires the model to classify samples that belong
to closed sets while rejecting unknown samples during test. Currently,
generative models often perform better than discriminative models in OSR, but
recent studies show that generative models may be computationally infeasible or
unstable on... | [
{
"created": "Fri, 12 Jan 2024 11:40:22 GMT",
"version": "v1"
}
] | 2024-01-15 | [
[
"Wang",
"Yu",
""
],
[
"Mu",
"Junxian",
""
],
[
"Zhu",
"Pengfei",
""
],
[
"Hu",
"Qinghua",
""
]
] | Open set recognition (OSR) requires the model to classify samples that belong to closed sets while rejecting unknown samples during test. Currently, generative models often perform better than discriminative models in OSR, but recent studies show that generative models may be computationally infeasible or unstable on c... |
2011.03880 | Zijie Huang | Zijie Huang, Yizhou Sun, Wei Wang | Learning Continuous System Dynamics from Irregularly-Sampled Partial
Observations | Neurips 2020 | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Many real-world systems, such as moving planets, can be considered as
multi-agent dynamic systems, where objects interact with each other and
co-evolve along with the time. Such dynamics is usually difficult to capture,
and understanding and predicting the dynamics based on observed trajectories of
objects become a c... | [
{
"created": "Sun, 8 Nov 2020 01:02:22 GMT",
"version": "v1"
}
] | 2020-11-10 | [
[
"Huang",
"Zijie",
""
],
[
"Sun",
"Yizhou",
""
],
[
"Wang",
"Wei",
""
]
] | Many real-world systems, such as moving planets, can be considered as multi-agent dynamic systems, where objects interact with each other and co-evolve along with the time. Such dynamics is usually difficult to capture, and understanding and predicting the dynamics based on observed trajectories of objects become a cri... |
2003.02446 | Hongzhi Wang | Meifan Zhang and Hongzhi Wang | LAQP: Learning-based Approximate Query Processing | null | null | null | null | cs.DB cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Querying on big data is a challenging task due to the rapid growth of data
amount. Approximate query processing (AQP) is a way to meet the requirement of
fast response. In this paper, we propose a learning-based AQP method called the
LAQP. The LAQP builds an error model learned from the historical queries to
predict ... | [
{
"created": "Thu, 5 Mar 2020 06:08:25 GMT",
"version": "v1"
}
] | 2020-03-06 | [
[
"Zhang",
"Meifan",
""
],
[
"Wang",
"Hongzhi",
""
]
] | Querying on big data is a challenging task due to the rapid growth of data amount. Approximate query processing (AQP) is a way to meet the requirement of fast response. In this paper, we propose a learning-based AQP method called the LAQP. The LAQP builds an error model learned from the historical queries to predict th... |
2101.08177 | Ximing Qiao | Ximing Qiao, Yuhua Bai, Siping Hu, Ang Li, Yiran Chen, Hai Li | On Provable Backdoor Defense in Collaborative Learning | null | null | null | null | cs.CR cs.LG | http://creativecommons.org/licenses/by/4.0/ | As collaborative learning allows joint training of a model using multiple
sources of data, the security problem has been a central concern. Malicious
users can upload poisoned data to prevent the model's convergence or inject
hidden backdoors. The so-called backdoor attacks are especially difficult to
detect since th... | [
{
"created": "Tue, 19 Jan 2021 14:39:32 GMT",
"version": "v1"
}
] | 2021-01-21 | [
[
"Qiao",
"Ximing",
""
],
[
"Bai",
"Yuhua",
""
],
[
"Hu",
"Siping",
""
],
[
"Li",
"Ang",
""
],
[
"Chen",
"Yiran",
""
],
[
"Li",
"Hai",
""
]
] | As collaborative learning allows joint training of a model using multiple sources of data, the security problem has been a central concern. Malicious users can upload poisoned data to prevent the model's convergence or inject hidden backdoors. The so-called backdoor attacks are especially difficult to detect since the ... |
1805.00699 | Krishna Chaitanya Kosaraju | Krishna Chaitanya Kosaraju and Shravan Mohan and Ramkrishna Pasumarthy | On the primal-dual dynamics of Support Vector Machines | To appear in MTNS 2018 | null | null | null | cs.SY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The aim of this paper is to study the convergence of the primal-dual dynamics
pertaining to Support Vector Machines (SVM). The optimization routine, used for
determining an SVM for classification, is first formulated as a dynamical
system. The dynamical system is constructed such that its equilibrium point is
the sol... | [
{
"created": "Wed, 2 May 2018 09:55:21 GMT",
"version": "v1"
}
] | 2018-05-03 | [
[
"Kosaraju",
"Krishna Chaitanya",
""
],
[
"Mohan",
"Shravan",
""
],
[
"Pasumarthy",
"Ramkrishna",
""
]
] | The aim of this paper is to study the convergence of the primal-dual dynamics pertaining to Support Vector Machines (SVM). The optimization routine, used for determining an SVM for classification, is first formulated as a dynamical system. The dynamical system is constructed such that its equilibrium point is the solut... |
2406.04835 | Zeyu Wan | Shiyi Chen, Zeyu Wan, Shiyang Yan, Chun Zhang, Weiyi Zhang, Qiang Li,
Debing Zhang, Fasih Ud Din Farrukh | SLR: Learning Quadruped Locomotion without Privileged Information | null | null | null | null | cs.RO | http://creativecommons.org/licenses/by/4.0/ | Traditional reinforcement learning control for quadruped robots often relies
on privileged information, demanding meticulous selection and precise
estimation, thereby imposing constraints on the development process. This work
proposes a Self-learning Latent Representation (SLR) method, which achieves
high-performance... | [
{
"created": "Fri, 7 Jun 2024 11:06:26 GMT",
"version": "v1"
}
] | 2024-06-10 | [
[
"Chen",
"Shiyi",
""
],
[
"Wan",
"Zeyu",
""
],
[
"Yan",
"Shiyang",
""
],
[
"Zhang",
"Chun",
""
],
[
"Zhang",
"Weiyi",
""
],
[
"Li",
"Qiang",
""
],
[
"Zhang",
"Debing",
""
],
[
"Farrukh",
"Fasih U... | Traditional reinforcement learning control for quadruped robots often relies on privileged information, demanding meticulous selection and precise estimation, thereby imposing constraints on the development process. This work proposes a Self-learning Latent Representation (SLR) method, which achieves high-performance c... |
2304.01080 | Alejandro Linares-Barranco A. Linares-Barranco | Antonio Rios-Navarro, Enrique Pi\~nero-Fuentes, Salvador Canas-Moreno,
Aqib Javed, Jin Harkin, Alejandro Linares-Barranco | LIPSFUS: A neuromorphic dataset for audio-visual sensory fusion of lip
reading | Submitted to ISCAS2023, 4 pages, plus references, github link
provided | null | null | null | cs.SD cs.RO eess.AS | http://creativecommons.org/licenses/by/4.0/ | This paper presents a sensory fusion neuromorphic dataset collected with
precise temporal synchronization using a set of Address-Event-Representation
sensors and tools. The target application is the lip reading of several
keywords for different machine learning applications, such as digits, robotic
commands, and auxi... | [
{
"created": "Tue, 28 Mar 2023 12:27:43 GMT",
"version": "v1"
}
] | 2023-04-04 | [
[
"Rios-Navarro",
"Antonio",
""
],
[
"Piñero-Fuentes",
"Enrique",
""
],
[
"Canas-Moreno",
"Salvador",
""
],
[
"Javed",
"Aqib",
""
],
[
"Harkin",
"Jin",
""
],
[
"Linares-Barranco",
"Alejandro",
""
]
] | This paper presents a sensory fusion neuromorphic dataset collected with precise temporal synchronization using a set of Address-Event-Representation sensors and tools. The target application is the lip reading of several keywords for different machine learning applications, such as digits, robotic commands, and auxili... |
2303.10307 | Jianye Yi | Jianye Yi and Xiaopin Zhong and Weixiang Liu and Wenxuan Zhu and
Zongze Wu and Yuanlong Deng | Edge-aware Plug-and-play Scheme for Semantic Segmentation | 8 pages, 5 figures | null | null | null | cs.CV cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Semantic segmentation is a classic and fundamental computer vision problem
dedicated to assigning each pixel with its corresponding class. Some recent
methods introduce edge-based information for improving the segmentation
performance. However these methods are specific and limited to certain network
architectures, a... | [
{
"created": "Sat, 18 Mar 2023 02:17:37 GMT",
"version": "v1"
}
] | 2023-03-21 | [
[
"Yi",
"Jianye",
""
],
[
"Zhong",
"Xiaopin",
""
],
[
"Liu",
"Weixiang",
""
],
[
"Zhu",
"Wenxuan",
""
],
[
"Wu",
"Zongze",
""
],
[
"Deng",
"Yuanlong",
""
]
] | Semantic segmentation is a classic and fundamental computer vision problem dedicated to assigning each pixel with its corresponding class. Some recent methods introduce edge-based information for improving the segmentation performance. However these methods are specific and limited to certain network architectures, and... |
1207.6445 | Shang-Pin Sheng | Shang-Pin Sheng, Mingyan Liu | Profit Incentive In A Secondary Spectrum Market: A Contract Design
Approach | 12 pages, 9 figures | null | null | null | cs.CE cs.GT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper we formulate a contract design problem where a primary license
holder wishes to profit from its excess spectrum capacity by selling it to
potential secondary users/buyers. It needs to determine how to optimally price
the excess spectrum so as to maximize its profit, knowing that this excess
capacity is ... | [
{
"created": "Fri, 27 Jul 2012 04:25:02 GMT",
"version": "v1"
}
] | 2012-07-30 | [
[
"Sheng",
"Shang-Pin",
""
],
[
"Liu",
"Mingyan",
""
]
] | In this paper we formulate a contract design problem where a primary license holder wishes to profit from its excess spectrum capacity by selling it to potential secondary users/buyers. It needs to determine how to optimally price the excess spectrum so as to maximize its profit, knowing that this excess capacity is st... |
2007.09490 | Mohammadreza Baharani | Mohammadreza Baharani, Ushma Sunil, Kaustubh Manohar, Steven
Furgurson, Hamed Tabkhi | DeepDive: An Integrative Algorithm/Architecture Co-Design for Deep
Separable Convolutional Neural Networks | null | null | null | null | cs.AR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Deep Separable Convolutional Neural Networks (DSCNNs) have become the
emerging paradigm by offering modular networks with structural sparsity in
order to achieve higher accuracy with relatively lower operations and
parameters. However, there is a lack of customized architectures that can
provide flexible solutions th... | [
{
"created": "Sat, 18 Jul 2020 17:50:01 GMT",
"version": "v1"
}
] | 2020-07-21 | [
[
"Baharani",
"Mohammadreza",
""
],
[
"Sunil",
"Ushma",
""
],
[
"Manohar",
"Kaustubh",
""
],
[
"Furgurson",
"Steven",
""
],
[
"Tabkhi",
"Hamed",
""
]
] | Deep Separable Convolutional Neural Networks (DSCNNs) have become the emerging paradigm by offering modular networks with structural sparsity in order to achieve higher accuracy with relatively lower operations and parameters. However, there is a lack of customized architectures that can provide flexible solutions that... |
2111.13949 | Prateek Chanda | Prateek Chanda, Malay Bhattacharya | Distributed Anomaly Detection in Edge Streams using Frequency based
Sketch Datastructures | null | null | null | null | cs.DC | http://creativecommons.org/licenses/by/4.0/ | Often logs hosted in large data centers represent network traffic data over a
long period of time. For instance, such network traffic data logged via a TCP
dump packet sniffer (as considered in the 1998 DARPA intrusion attack) included
network packets being transmitted between computers. While an online framework
is ... | [
{
"created": "Sat, 27 Nov 2021 17:29:10 GMT",
"version": "v1"
}
] | 2022-01-07 | [
[
"Chanda",
"Prateek",
""
],
[
"Bhattacharya",
"Malay",
""
]
] | Often logs hosted in large data centers represent network traffic data over a long period of time. For instance, such network traffic data logged via a TCP dump packet sniffer (as considered in the 1998 DARPA intrusion attack) included network packets being transmitted between computers. While an online framework is ne... |
1506.08238 | Wenda Li | Wenda Li, Grant Olney Passmore and Lawrence C. Paulson | Deciding Univariate Polynomial Problems Using Untrusted Certificates in
Isabelle/HOL | 24 pages | Journal of Automated Reasoning, 2017 | 10.1007/s10817-017-9424-6 | null | cs.LO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We present a proof procedure for univariate real polynomial problems in
Isabelle/HOL. The core mathematics of our procedure is based on univariate
cylindrical algebraic decomposition. We follow the approach of untrusted
certificates, separating solving from verifying: efficient external tools
perform expensive real a... | [
{
"created": "Fri, 26 Jun 2015 23:57:46 GMT",
"version": "v1"
},
{
"created": "Tue, 10 Apr 2018 22:19:07 GMT",
"version": "v2"
}
] | 2018-04-12 | [
[
"Li",
"Wenda",
""
],
[
"Passmore",
"Grant Olney",
""
],
[
"Paulson",
"Lawrence C.",
""
]
] | We present a proof procedure for univariate real polynomial problems in Isabelle/HOL. The core mathematics of our procedure is based on univariate cylindrical algebraic decomposition. We follow the approach of untrusted certificates, separating solving from verifying: efficient external tools perform expensive real alg... |
1403.3972 | Vojt\v{e}ch Vorel | Vojt\v{e}ch Vorel | Subset Synchronization and Careful Synchronization of Binary Finite
Automata | An extended version of the paper "Subset Synchronization of
Transitive Automata" presented at AFL 2014 | null | null | null | cs.FL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We present a strongly exponential lower bound that applies both to the subset
synchronization threshold for binary deterministic automata and to the careful
synchronization threshold for binary partial automata. In the later form, the
result finishes the research initiated by Martyugin (2013). Moreover, we show
that ... | [
{
"created": "Sun, 16 Mar 2014 23:29:14 GMT",
"version": "v1"
},
{
"created": "Thu, 22 May 2014 02:15:35 GMT",
"version": "v2"
},
{
"created": "Sat, 27 Sep 2014 23:06:39 GMT",
"version": "v3"
},
{
"created": "Mon, 15 Feb 2016 01:21:17 GMT",
"version": "v4"
}
] | 2016-02-16 | [
[
"Vorel",
"Vojtěch",
""
]
] | We present a strongly exponential lower bound that applies both to the subset synchronization threshold for binary deterministic automata and to the careful synchronization threshold for binary partial automata. In the later form, the result finishes the research initiated by Martyugin (2013). Moreover, we show that bo... |
2107.04393 | Nikolaj Ignatieff Schwartzbach | Mathias Hall-Andersen and Nikolaj I. Schwartzbach | Game theory on the blockchain: a model for games with smart contracts | null | SAGT 2021: 14th International Symposium on Algorithmic Game Theory | 10.1007/978-3-030-85947-3_11 | null | cs.GT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We propose a model for games in which the players have shared access to a
blockchain that allows them to deploy smart contracts to act on their behalf.
This changes fundamental game-theoretic assumptions about rationality since a
contract can commit a player to act irrationally in specific subgames, making
credible o... | [
{
"created": "Fri, 9 Jul 2021 12:43:04 GMT",
"version": "v1"
}
] | 2023-04-05 | [
[
"Hall-Andersen",
"Mathias",
""
],
[
"Schwartzbach",
"Nikolaj I.",
""
]
] | We propose a model for games in which the players have shared access to a blockchain that allows them to deploy smart contracts to act on their behalf. This changes fundamental game-theoretic assumptions about rationality since a contract can commit a player to act irrationally in specific subgames, making credible oth... |
1102.4528 | Nilo Serpa Costa | Nilo Serpa and Jose Roberto Steiner | Modelling the Dynamics of the Work-Employment System by Predator-Prey
Interactions | 17 pages, 11 figures and original formalism | null | null | null | cs.CE nlin.AO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The broad application range of the predator-prey modelling enabled us to
apply it to represent the dynamics of the work-employment system. For the
adopted period, we conclude that this dynamics is chaotic in the beginning of
the time series and tends to less perturbed states, as time goes by, due to
public policies a... | [
{
"created": "Tue, 22 Feb 2011 15:01:06 GMT",
"version": "v1"
},
{
"created": "Wed, 23 Feb 2011 11:50:29 GMT",
"version": "v2"
},
{
"created": "Thu, 17 Mar 2011 20:19:37 GMT",
"version": "v3"
}
] | 2011-03-21 | [
[
"Serpa",
"Nilo",
""
],
[
"Steiner",
"Jose Roberto",
""
]
] | The broad application range of the predator-prey modelling enabled us to apply it to represent the dynamics of the work-employment system. For the adopted period, we conclude that this dynamics is chaotic in the beginning of the time series and tends to less perturbed states, as time goes by, due to public policies and... |
2011.11155 | Hao Zhu | Hao Zhu, Yang Yuan, Guosheng Hu, Xiang Wu, Neil Robertson | Imbalance Robust Softmax for Deep Embeeding Learning | has been accepted by ACCV 2020 | null | null | null | cs.CV | http://creativecommons.org/licenses/by/4.0/ | Deep embedding learning is expected to learn a metric space in which features
have smaller maximal intra-class distance than minimal inter-class distance. In
recent years, one research focus is to solve the open-set problem by
discriminative deep embedding learning in the field of face recognition (FR)
and person re-... | [
{
"created": "Mon, 23 Nov 2020 00:43:07 GMT",
"version": "v1"
}
] | 2020-11-24 | [
[
"Zhu",
"Hao",
""
],
[
"Yuan",
"Yang",
""
],
[
"Hu",
"Guosheng",
""
],
[
"Wu",
"Xiang",
""
],
[
"Robertson",
"Neil",
""
]
] | Deep embedding learning is expected to learn a metric space in which features have smaller maximal intra-class distance than minimal inter-class distance. In recent years, one research focus is to solve the open-set problem by discriminative deep embedding learning in the field of face recognition (FR) and person re-id... |
1108.3629 | EPTCS | Gabriele Fici (Laboratoire I3S, CNRS and Universit\'e de Nice-Sophia
Antipolis) | A Classification of Trapezoidal Words | In Proceedings WORDS 2011, arXiv:1108.3412 | EPTCS 63, 2011, pp. 129-137 | 10.4204/EPTCS.63.18 | null | cs.FL math.CO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Trapezoidal words are finite words having at most n+1 distinct factors of
length n, for every n>=0. They encompass finite Sturmian words. We distinguish
trapezoidal words into two disjoint subsets: open and closed trapezoidal words.
A trapezoidal word is closed if its longest repeated prefix has exactly two
occurrenc... | [
{
"created": "Thu, 18 Aug 2011 03:53:45 GMT",
"version": "v1"
}
] | 2011-08-19 | [
[
"Fici",
"Gabriele",
"",
"Laboratoire I3S, CNRS and Université de Nice-Sophia\n Antipolis"
]
] | Trapezoidal words are finite words having at most n+1 distinct factors of length n, for every n>=0. They encompass finite Sturmian words. We distinguish trapezoidal words into two disjoint subsets: open and closed trapezoidal words. A trapezoidal word is closed if its longest repeated prefix has exactly two occurrences... |
2102.00314 | Gal Vardi | Gal Vardi, Daniel Reichman, Toniann Pitassi, Ohad Shamir | Size and Depth Separation in Approximating Benign Functions with Neural
Networks | Edits after review + changing the terminology from "natural
functions" to "benign functions" | null | null | null | cs.LG cs.CC stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | When studying the expressive power of neural networks, a main challenge is to
understand how the size and depth of the network affect its ability to
approximate real functions. However, not all functions are interesting from a
practical viewpoint: functions of interest usually have a polynomially-bounded
Lipschitz co... | [
{
"created": "Sat, 30 Jan 2021 21:30:11 GMT",
"version": "v1"
},
{
"created": "Wed, 3 Feb 2021 01:51:12 GMT",
"version": "v2"
},
{
"created": "Mon, 28 Jun 2021 20:34:40 GMT",
"version": "v3"
}
] | 2021-06-30 | [
[
"Vardi",
"Gal",
""
],
[
"Reichman",
"Daniel",
""
],
[
"Pitassi",
"Toniann",
""
],
[
"Shamir",
"Ohad",
""
]
] | When studying the expressive power of neural networks, a main challenge is to understand how the size and depth of the network affect its ability to approximate real functions. However, not all functions are interesting from a practical viewpoint: functions of interest usually have a polynomially-bounded Lipschitz cons... |
2305.07451 | Ga\"etan Staquet | V\'eronique Bruy\`ere, Guillermo A. P\'erez, Ga\"etan Staquet, Frits
W. Vaandrager | Automata with Timers | 35 pages, 9 figures | Formal Modeling and Analysis of Timed Systems (FORMATS) 2023 pp.
33-49 | 10.1007/978-3-031-42626-1_3 | null | cs.FL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this work, we study properties of deterministic finite-state automata with
timers, a subclass of timed automata proposed by Vaandrager et al. as a
candidate for an efficiently learnable timed model. We first study the
complexity of the configuration reachability problem for such automata and
establish that it is P... | [
{
"created": "Fri, 12 May 2023 13:07:10 GMT",
"version": "v1"
}
] | 2024-03-04 | [
[
"Bruyère",
"Véronique",
""
],
[
"Pérez",
"Guillermo A.",
""
],
[
"Staquet",
"Gaëtan",
""
],
[
"Vaandrager",
"Frits W.",
""
]
] | In this work, we study properties of deterministic finite-state automata with timers, a subclass of timed automata proposed by Vaandrager et al. as a candidate for an efficiently learnable timed model. We first study the complexity of the configuration reachability problem for such automata and establish that it is PSP... |
1509.02218 | Mitsuo Yoshida | Mitsuo Yoshida, Yuki Arase, Takaaki Tsunoda, Mikio Yamamoto | Wikipedia Page View Reflects Web Search Trend | 2 pages, 4 figures, The 2015 ACM Web Science Conference (WebSci15) | null | 10.1145/2786451.2786495 | null | cs.SI cs.IR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The frequency of a web search keyword generally reflects the degree of public
interest in a particular subject matter. Search logs are therefore useful
resources for trend analysis. However, access to search logs is typically
restricted to search engine providers. In this paper, we investigate whether
search frequenc... | [
{
"created": "Mon, 7 Sep 2015 22:59:28 GMT",
"version": "v1"
}
] | 2015-09-09 | [
[
"Yoshida",
"Mitsuo",
""
],
[
"Arase",
"Yuki",
""
],
[
"Tsunoda",
"Takaaki",
""
],
[
"Yamamoto",
"Mikio",
""
]
] | The frequency of a web search keyword generally reflects the degree of public interest in a particular subject matter. Search logs are therefore useful resources for trend analysis. However, access to search logs is typically restricted to search engine providers. In this paper, we investigate whether search frequency ... |
2310.08586 | Haoyi Zhu | Haoyi Zhu, Honghui Yang, Xiaoyang Wu, Di Huang, Sha Zhang, Xianglong
He, Hengshuang Zhao, Chunhua Shen, Yu Qiao, Tong He, Wanli Ouyang | PonderV2: Pave the Way for 3D Foundation Model with A Universal
Pre-training Paradigm | arXiv admin note: text overlap with arXiv:2301.00157 | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In contrast to numerous NLP and 2D vision foundational models, learning a 3D
foundational model poses considerably greater challenges. This is primarily due
to the inherent data variability and diversity of downstream tasks. In this
paper, we introduce a novel universal 3D pre-training framework designed to
facilitat... | [
{
"created": "Thu, 12 Oct 2023 17:59:57 GMT",
"version": "v1"
},
{
"created": "Fri, 13 Oct 2023 13:37:57 GMT",
"version": "v2"
},
{
"created": "Tue, 27 Feb 2024 13:53:43 GMT",
"version": "v3"
}
] | 2024-02-28 | [
[
"Zhu",
"Haoyi",
""
],
[
"Yang",
"Honghui",
""
],
[
"Wu",
"Xiaoyang",
""
],
[
"Huang",
"Di",
""
],
[
"Zhang",
"Sha",
""
],
[
"He",
"Xianglong",
""
],
[
"Zhao",
"Hengshuang",
""
],
[
"Shen",
"Chun... | In contrast to numerous NLP and 2D vision foundational models, learning a 3D foundational model poses considerably greater challenges. This is primarily due to the inherent data variability and diversity of downstream tasks. In this paper, we introduce a novel universal 3D pre-training framework designed to facilitate ... |
1701.00749 | Christophe Van Gysel | Christophe Van Gysel and Evangelos Kanoulas and Maarten de Rijke | Pyndri: a Python Interface to the Indri Search Engine | ECIR2017. Proceedings of the 39th European Conference on Information
Retrieval. 2017. The final publication will be available at Springer | null | null | null | cs.IR cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We introduce pyndri, a Python interface to the Indri search engine. Pyndri
allows to access Indri indexes from Python at two levels: (1) dictionary and
tokenized document collection, (2) evaluating queries on the index. We hope
that with the release of pyndri, we will stimulate reproducible, open and
fast-paced IR re... | [
{
"created": "Tue, 3 Jan 2017 17:17:34 GMT",
"version": "v1"
}
] | 2017-01-04 | [
[
"Van Gysel",
"Christophe",
""
],
[
"Kanoulas",
"Evangelos",
""
],
[
"de Rijke",
"Maarten",
""
]
] | We introduce pyndri, a Python interface to the Indri search engine. Pyndri allows to access Indri indexes from Python at two levels: (1) dictionary and tokenized document collection, (2) evaluating queries on the index. We hope that with the release of pyndri, we will stimulate reproducible, open and fast-paced IR rese... |
1509.04438 | Tobias Strau{\ss} | Tobias Strau{\ss}, Gundram Leifert, Tobias Gr\"uning, and Roger Labahn | Regular expressions for decoding of neural network outputs | 21 pages, 8 (+2) figures, 2 tables | null | 10.1016/j.neunet.2016.03.003 | NN3600 | cs.NE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This article proposes a convenient tool for decoding the output of neural
networks trained by Connectionist Temporal Classification (CTC) for handwritten
text recognition. We use regular expressions to describe the complex structures
expected in the writing. The corresponding finite automata are employed to
build a d... | [
{
"created": "Tue, 15 Sep 2015 08:24:37 GMT",
"version": "v1"
},
{
"created": "Mon, 22 Feb 2016 09:35:53 GMT",
"version": "v2"
}
] | 2016-03-31 | [
[
"Strauß",
"Tobias",
""
],
[
"Leifert",
"Gundram",
""
],
[
"Grüning",
"Tobias",
""
],
[
"Labahn",
"Roger",
""
]
] | This article proposes a convenient tool for decoding the output of neural networks trained by Connectionist Temporal Classification (CTC) for handwritten text recognition. We use regular expressions to describe the complex structures expected in the writing. The corresponding finite automata are employed to build a dec... |
1211.4771 | Ganesh Sundaramoorthi | Ganesh Sundaramoorthi and Yanchao Yang | Matching Through Features and Features Through Matching | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper addresses how to construct features for the problem of image
correspondence, in particular, the paper addresses how to construct features so
as to maintain the right level of invariance versus discriminability. We show
that without additional prior knowledge of the 3D scene, the right tradeoff
cannot be es... | [
{
"created": "Tue, 20 Nov 2012 15:15:56 GMT",
"version": "v1"
}
] | 2012-11-21 | [
[
"Sundaramoorthi",
"Ganesh",
""
],
[
"Yang",
"Yanchao",
""
]
] | This paper addresses how to construct features for the problem of image correspondence, in particular, the paper addresses how to construct features so as to maintain the right level of invariance versus discriminability. We show that without additional prior knowledge of the 3D scene, the right tradeoff cannot be esta... |
2012.02544 | Jos\'e Carlos Aradillas Jaramillo | Jos\'e Carlos Aradillas, Juan Jos\'e Murillo-Fuentes, Pablo M. Olmos | Boosting offline handwritten text recognition in historical documents
with few labeled lines | null | null | 10.1109/ACCESS.2021.3082689 | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we face the problem of offline handwritten text recognition
(HTR) in historical documents when few labeled samples are available and some
of them contain errors in the train set. Three main contributions are
developed. First we analyze how to perform transfer learning (TL) from a
massive database to a ... | [
{
"created": "Fri, 4 Dec 2020 11:59:35 GMT",
"version": "v1"
}
] | 2021-05-25 | [
[
"Aradillas",
"José Carlos",
""
],
[
"Murillo-Fuentes",
"Juan José",
""
],
[
"Olmos",
"Pablo M.",
""
]
] | In this paper, we face the problem of offline handwritten text recognition (HTR) in historical documents when few labeled samples are available and some of them contain errors in the train set. Three main contributions are developed. First we analyze how to perform transfer learning (TL) from a massive database to a sm... |
1307.5838 | Masoumeh Vali | Masoumeh Vali | Rotational Mutation Genetic Algorithm on optimization Problems | arXiv admin note: text overlap with arXiv:1307.5534, arXiv:1307.5679,
arXiv:1307.5840 | null | null | null | cs.NE math.OC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Optimization problem, nowadays, have more application in all major but they
have problem in computation. Calculation of the optimum point in the spaces
with the above dimensions is very time consuming. In this paper, there is
presented a new approach for the optimization of continuous functions with
rotational mutati... | [
{
"created": "Mon, 22 Jul 2013 12:09:59 GMT",
"version": "v1"
}
] | 2013-07-24 | [
[
"Vali",
"Masoumeh",
""
]
] | Optimization problem, nowadays, have more application in all major but they have problem in computation. Calculation of the optimum point in the spaces with the above dimensions is very time consuming. In this paper, there is presented a new approach for the optimization of continuous functions with rotational mutation... |
2302.07309 | Hongyan Gu | Hongyan Gu, Chunxu Yang, Mohammad Haeri, Jing Wang, Shirley Tang,
Wenzhong Yan, Shujin He, Christopher Kazu Williams, Shino Magaki, Xiang
'Anthony' Chen | Augmenting Pathologists with NaviPath: Design and Evaluation of a
Human-AI Collaborative Navigation System | Accepted ACM CHI Conference on Human Factors in Computing Systems
(CHI '23) | null | 10.1145/3544548.3580694 | null | cs.HC | http://creativecommons.org/licenses/by/4.0/ | Artificial Intelligence (AI) brings advancements to support pathologists in
navigating high-resolution tumor images to search for pathology patterns of
interest. However, existing AI-assisted tools have not realized this promised
potential due to a lack of insight into pathology and HCI considerations for
pathologist... | [
{
"created": "Tue, 14 Feb 2023 19:50:02 GMT",
"version": "v1"
}
] | 2023-02-16 | [
[
"Gu",
"Hongyan",
""
],
[
"Yang",
"Chunxu",
""
],
[
"Haeri",
"Mohammad",
""
],
[
"Wang",
"Jing",
""
],
[
"Tang",
"Shirley",
""
],
[
"Yan",
"Wenzhong",
""
],
[
"He",
"Shujin",
""
],
[
"Williams",
... | Artificial Intelligence (AI) brings advancements to support pathologists in navigating high-resolution tumor images to search for pathology patterns of interest. However, existing AI-assisted tools have not realized this promised potential due to a lack of insight into pathology and HCI considerations for pathologists'... |
2102.06427 | Hung P. Hoang | Bernd G\"artner, Sebastian Haslebacher, Hung P. Hoang | A Subexponential Algorithm for ARRIVAL | 13 pages, 1 figure Added a reference | null | null | null | cs.DS | http://creativecommons.org/licenses/by/4.0/ | The ARRIVAL problem is to decide the fate of a train moving along the edges
of a directed graph, according to a simple (deterministic) pseudorandom walk.
The problem is in $NP \cap coNP$ but not known to be in $P$. The currently best
algorithms have runtime $2^{\Theta(n)}$ where $n$ is the number of vertices.
This is... | [
{
"created": "Fri, 12 Feb 2021 10:14:23 GMT",
"version": "v1"
},
{
"created": "Tue, 23 Feb 2021 10:41:48 GMT",
"version": "v2"
},
{
"created": "Fri, 9 Apr 2021 14:11:24 GMT",
"version": "v3"
}
] | 2021-04-12 | [
[
"Gärtner",
"Bernd",
""
],
[
"Haslebacher",
"Sebastian",
""
],
[
"Hoang",
"Hung P.",
""
]
] | The ARRIVAL problem is to decide the fate of a train moving along the edges of a directed graph, according to a simple (deterministic) pseudorandom walk. The problem is in $NP \cap coNP$ but not known to be in $P$. The currently best algorithms have runtime $2^{\Theta(n)}$ where $n$ is the number of vertices. This is n... |
2303.10635 | Shiwei Cheng | Song Zhao, Shiwei Cheng, Chenshuang Zhu | 3D Gaze Vis: Sharing Eye Tracking Data Visualization for Collaborative
Work in VR Environment | null | null | null | null | cs.HC cs.CY | http://creativecommons.org/licenses/by-nc-sa/4.0/ | Conducting collaborative tasks, e.g., multi-user game, in virtual reality
(VR) could enable us to explore more immersive and effective experience.
However, for current VR systems, users cannot communicate properly with each
other via their gaze points, and this would interfere with users' mutual
understanding of the ... | [
{
"created": "Sun, 19 Mar 2023 12:00:53 GMT",
"version": "v1"
}
] | 2023-03-21 | [
[
"Zhao",
"Song",
""
],
[
"Cheng",
"Shiwei",
""
],
[
"Zhu",
"Chenshuang",
""
]
] | Conducting collaborative tasks, e.g., multi-user game, in virtual reality (VR) could enable us to explore more immersive and effective experience. However, for current VR systems, users cannot communicate properly with each other via their gaze points, and this would interfere with users' mutual understanding of the in... |
2305.02986 | Joshua Kavner | Hadi Hosseini, Joshua Kavner, Tomasz W\k{a}s, Lirong Xia | Distribution of Chores with Information Asymmetry | 21 pages, 1 figure | null | null | null | cs.GT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Fair distribution of indivisible tasks with non-positive valuations (aka
chores) has given rise to a large body of work in recent years. A popular
approximate fairness notion is envy-freeness up to one item (EF1), which
requires that any pairwise envy can be eliminated by the removal of a single
item. While an EF1 an... | [
{
"created": "Thu, 4 May 2023 16:51:46 GMT",
"version": "v1"
},
{
"created": "Fri, 5 May 2023 20:20:44 GMT",
"version": "v2"
}
] | 2023-05-09 | [
[
"Hosseini",
"Hadi",
""
],
[
"Kavner",
"Joshua",
""
],
[
"Wąs",
"Tomasz",
""
],
[
"Xia",
"Lirong",
""
]
] | Fair distribution of indivisible tasks with non-positive valuations (aka chores) has given rise to a large body of work in recent years. A popular approximate fairness notion is envy-freeness up to one item (EF1), which requires that any pairwise envy can be eliminated by the removal of a single item. While an EF1 and ... |
2302.13840 | Kaijie He | Kaijie He, Canlong Zhang, Sheng Xie, Zhixin Li, Zhiwen Wang | Target-Aware Tracking with Long-term Context Attention | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Most deep trackers still follow the guidance of the siamese paradigms and use
a template that contains only the target without any contextual information,
which makes it difficult for the tracker to cope with large appearance changes,
rapid target movement, and attraction from similar objects. To alleviate the
above ... | [
{
"created": "Mon, 27 Feb 2023 14:40:58 GMT",
"version": "v1"
}
] | 2023-02-28 | [
[
"He",
"Kaijie",
""
],
[
"Zhang",
"Canlong",
""
],
[
"Xie",
"Sheng",
""
],
[
"Li",
"Zhixin",
""
],
[
"Wang",
"Zhiwen",
""
]
] | Most deep trackers still follow the guidance of the siamese paradigms and use a template that contains only the target without any contextual information, which makes it difficult for the tracker to cope with large appearance changes, rapid target movement, and attraction from similar objects. To alleviate the above pr... |
2309.01850 | Jamiu Idowu | Jamiu Idowu and Ahmed Almasoud | Uncertainty in AI: Evaluating Deep Neural Networks on
Out-of-Distribution Images | null | null | null | null | cs.CV | http://creativecommons.org/licenses/by/4.0/ | As AI models are increasingly deployed in critical applications, ensuring the
consistent performance of models when exposed to unusual situations such as
out-of-distribution (OOD) or perturbed data, is important. Therefore, this
paper investigates the uncertainty of various deep neural networks, including
ResNet-50, ... | [
{
"created": "Mon, 4 Sep 2023 22:46:59 GMT",
"version": "v1"
}
] | 2023-09-06 | [
[
"Idowu",
"Jamiu",
""
],
[
"Almasoud",
"Ahmed",
""
]
] | As AI models are increasingly deployed in critical applications, ensuring the consistent performance of models when exposed to unusual situations such as out-of-distribution (OOD) or perturbed data, is important. Therefore, this paper investigates the uncertainty of various deep neural networks, including ResNet-50, VG... |
2010.01003 | Awni Hannun | Awni Hannun, Vineel Pratap, Jacob Kahn, Wei-Ning Hsu | Differentiable Weighted Finite-State Transducers | null | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We introduce a framework for automatic differentiation with weighted
finite-state transducers (WFSTs) allowing them to be used dynamically at
training time. Through the separation of graphs from operations on graphs, this
framework enables the exploration of new structured loss functions which in
turn eases the encod... | [
{
"created": "Fri, 2 Oct 2020 13:52:24 GMT",
"version": "v1"
}
] | 2020-10-05 | [
[
"Hannun",
"Awni",
""
],
[
"Pratap",
"Vineel",
""
],
[
"Kahn",
"Jacob",
""
],
[
"Hsu",
"Wei-Ning",
""
]
] | We introduce a framework for automatic differentiation with weighted finite-state transducers (WFSTs) allowing them to be used dynamically at training time. Through the separation of graphs from operations on graphs, this framework enables the exploration of new structured loss functions which in turn eases the encodin... |
2309.16163 | Juhyeon Kim | Juhyeon Kim, Wojciech Jarosz, Ioannis Gkioulekas, Adithya Pediredla | Doppler Time-of-Flight Rendering | 18 pages, 28 Figures, SIGGRAPH Asia 2023 | null | 10.1145/3618335 | null | cs.GR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We introduce Doppler time-of-flight (D-ToF) rendering, an extension of ToF
rendering for dynamic scenes, with applications in simulating D-ToF cameras.
D-ToF cameras use high-frequency modulation of illumination and exposure, and
measure the Doppler frequency shift to compute the radial velocity of dynamic
objects. T... | [
{
"created": "Thu, 28 Sep 2023 04:30:51 GMT",
"version": "v1"
},
{
"created": "Fri, 29 Sep 2023 02:59:28 GMT",
"version": "v2"
},
{
"created": "Thu, 5 Oct 2023 16:13:34 GMT",
"version": "v3"
}
] | 2023-10-06 | [
[
"Kim",
"Juhyeon",
""
],
[
"Jarosz",
"Wojciech",
""
],
[
"Gkioulekas",
"Ioannis",
""
],
[
"Pediredla",
"Adithya",
""
]
] | We introduce Doppler time-of-flight (D-ToF) rendering, an extension of ToF rendering for dynamic scenes, with applications in simulating D-ToF cameras. D-ToF cameras use high-frequency modulation of illumination and exposure, and measure the Doppler frequency shift to compute the radial velocity of dynamic objects. The... |
0912.4117 | Stefan G\"oller | Stefan G\"oller, Markus Lohrey | Branching-time model checking of one-counter processes | null | null | null | STACS 2010 | cs.LO cs.CC | http://creativecommons.org/licenses/by/3.0/ | One-counter processes (OCPs) are pushdown processes which operate only on a
unary stack alphabet. We study the computational complexity of model checking
computation tree logic (CTL) over OCPs. A PSPACE upper bound is inherited from
the modal mu-calculus for this problem. First, we analyze the periodic
behaviour of C... | [
{
"created": "Mon, 21 Dec 2009 09:45:23 GMT",
"version": "v1"
},
{
"created": "Wed, 3 Feb 2010 11:38:53 GMT",
"version": "v2"
}
] | 2010-02-03 | [
[
"Göller",
"Stefan",
""
],
[
"Lohrey",
"Markus",
""
]
] | One-counter processes (OCPs) are pushdown processes which operate only on a unary stack alphabet. We study the computational complexity of model checking computation tree logic (CTL) over OCPs. A PSPACE upper bound is inherited from the modal mu-calculus for this problem. First, we analyze the periodic behaviour of CTL... |
2407.07995 | Jaeyeul Kim | Jaeyeul Kim, Jungwan Woo, Ukcheol Shin, Jean Oh, Sunghoon Im | Flow4D: Leveraging 4D Voxel Network for LiDAR Scene Flow Estimation | 8 pages, 4 figures | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Understanding the motion states of the surrounding environment is critical
for safe autonomous driving. These motion states can be accurately derived from
scene flow, which captures the three-dimensional motion field of points.
Existing LiDAR scene flow methods extract spatial features from each point
cloud and then ... | [
{
"created": "Wed, 10 Jul 2024 18:55:43 GMT",
"version": "v1"
}
] | 2024-07-12 | [
[
"Kim",
"Jaeyeul",
""
],
[
"Woo",
"Jungwan",
""
],
[
"Shin",
"Ukcheol",
""
],
[
"Oh",
"Jean",
""
],
[
"Im",
"Sunghoon",
""
]
] | Understanding the motion states of the surrounding environment is critical for safe autonomous driving. These motion states can be accurately derived from scene flow, which captures the three-dimensional motion field of points. Existing LiDAR scene flow methods extract spatial features from each point cloud and then fu... |
2403.19517 | Guangyu Wang | Guangyu Wang, Jinzhi Zhang, Fan Wang, Ruqi Huang, Lu Fang | XScale-NVS: Cross-Scale Novel View Synthesis with Hash Featurized
Manifold | Accepted to CVPR 2024. Project page: xscalenvs.github.io/ | null | null | null | cs.CV | http://creativecommons.org/licenses/by-nc-nd/4.0/ | We propose XScale-NVS for high-fidelity cross-scale novel view synthesis of
real-world large-scale scenes. Existing representations based on explicit
surface suffer from discretization resolution or UV distortion, while implicit
volumetric representations lack scalability for large scenes due to the
dispersed weight ... | [
{
"created": "Thu, 28 Mar 2024 15:48:16 GMT",
"version": "v1"
}
] | 2024-03-29 | [
[
"Wang",
"Guangyu",
""
],
[
"Zhang",
"Jinzhi",
""
],
[
"Wang",
"Fan",
""
],
[
"Huang",
"Ruqi",
""
],
[
"Fang",
"Lu",
""
]
] | We propose XScale-NVS for high-fidelity cross-scale novel view synthesis of real-world large-scale scenes. Existing representations based on explicit surface suffer from discretization resolution or UV distortion, while implicit volumetric representations lack scalability for large scenes due to the dispersed weight di... |
1811.09885 | Linan Zhang | Linan Zhang and Hayden Schaeffer | Forward Stability of ResNet and Its Variants | 35 pages, 8 figures, 5 tables | null | null | null | cs.CV math.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The residual neural network (ResNet) is a popular deep network architecture
which has the ability to obtain high-accuracy results on several image
processing problems. In order to analyze the behavior and structure of ResNet,
recent work has been on establishing connections between ResNets and
continuous-time optimal... | [
{
"created": "Sat, 24 Nov 2018 19:43:22 GMT",
"version": "v1"
}
] | 2018-11-27 | [
[
"Zhang",
"Linan",
""
],
[
"Schaeffer",
"Hayden",
""
]
] | The residual neural network (ResNet) is a popular deep network architecture which has the ability to obtain high-accuracy results on several image processing problems. In order to analyze the behavior and structure of ResNet, recent work has been on establishing connections between ResNets and continuous-time optimal c... |
1811.10400 | Eric Rothstein-Morris | Eric Rothstein-Morris and Sun Jun | Quantifying Attacker Capability Via Model Checking Multiple Properties
(Extended Version) | null | null | null | null | cs.LO cs.FL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This work aims to solve a practical problem, i.e., how to quantify the risk
brought upon a system by different attackers. The answer is useful for
optimising resource allocation for system defence. Given a set of safety
requirements, we quantify the attacker capability in terms of the set of safety
requirements an at... | [
{
"created": "Fri, 16 Nov 2018 15:19:09 GMT",
"version": "v1"
}
] | 2018-11-27 | [
[
"Rothstein-Morris",
"Eric",
""
],
[
"Jun",
"Sun",
""
]
] | This work aims to solve a practical problem, i.e., how to quantify the risk brought upon a system by different attackers. The answer is useful for optimising resource allocation for system defence. Given a set of safety requirements, we quantify the attacker capability in terms of the set of safety requirements an atta... |
2407.07086 | Logan Cross | Logan Cross, Violet Xiang, Agam Bhatia, Daniel LK Yamins, Nick Haber | Hypothetical Minds: Scaffolding Theory of Mind for Multi-Agent Tasks
with Large Language Models | null | null | null | null | cs.AI | http://creativecommons.org/licenses/by/4.0/ | Multi-agent reinforcement learning (MARL) methods struggle with the
non-stationarity of multi-agent systems and fail to adaptively learn online
when tested with novel agents. Here, we leverage large language models (LLMs)
to create an autonomous agent that can handle these challenges. Our agent,
Hypothetical Minds, c... | [
{
"created": "Tue, 9 Jul 2024 17:57:15 GMT",
"version": "v1"
}
] | 2024-07-10 | [
[
"Cross",
"Logan",
""
],
[
"Xiang",
"Violet",
""
],
[
"Bhatia",
"Agam",
""
],
[
"Yamins",
"Daniel LK",
""
],
[
"Haber",
"Nick",
""
]
] | Multi-agent reinforcement learning (MARL) methods struggle with the non-stationarity of multi-agent systems and fail to adaptively learn online when tested with novel agents. Here, we leverage large language models (LLMs) to create an autonomous agent that can handle these challenges. Our agent, Hypothetical Minds, con... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.