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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1604.00693 | Edmond Awad | Edmond Awad, Martin Caminada, Gabriella Pigozzi, Miko{\l}aj
Podlaszewski and Iyad Rahwan | Pareto Optimality and Strategy Proofness in Group Argument Evaluation
(Extended Version) | null | null | 10.1093/logcom/exx017 | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | An inconsistent knowledge base can be abstracted as a set of arguments and a
defeat relation among them. There can be more than one consistent way to
evaluate such an argumentation graph. Collective argument evaluation is the
problem of aggregating the opinions of multiple agents on how a given set of
arguments shoul... | [
{
"created": "Sun, 3 Apr 2016 21:48:37 GMT",
"version": "v1"
},
{
"created": "Fri, 7 Apr 2017 20:02:55 GMT",
"version": "v2"
}
] | 2017-06-20 | [
[
"Awad",
"Edmond",
""
],
[
"Caminada",
"Martin",
""
],
[
"Pigozzi",
"Gabriella",
""
],
[
"Podlaszewski",
"Mikołaj",
""
],
[
"Rahwan",
"Iyad",
""
]
] | An inconsistent knowledge base can be abstracted as a set of arguments and a defeat relation among them. There can be more than one consistent way to evaluate such an argumentation graph. Collective argument evaluation is the problem of aggregating the opinions of multiple agents on how a given set of arguments should ... |
1901.04518 | Markus Fr\"ohle | Markus Fr\"ohle, Karl Granstr\"om, Henk Wymeersch | Decentralized Poisson Multi-Bernoulli Filtering for Vehicle Tracking | 14 pages, 5 figures | null | null | null | cs.MA cs.SY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A decentralized Poisson multi-Bernoulli filter is proposed to track multiple
vehicles using multiple high-resolution sensors. Independent filters estimate
the vehicles' presence, state, and shape using a Gaussian process extent model;
a decentralized filter is realized through fusion of the filters posterior
densitie... | [
{
"created": "Mon, 14 Jan 2019 19:03:41 GMT",
"version": "v1"
},
{
"created": "Thu, 5 Mar 2020 13:58:10 GMT",
"version": "v2"
}
] | 2020-03-06 | [
[
"Fröhle",
"Markus",
""
],
[
"Granström",
"Karl",
""
],
[
"Wymeersch",
"Henk",
""
]
] | A decentralized Poisson multi-Bernoulli filter is proposed to track multiple vehicles using multiple high-resolution sensors. Independent filters estimate the vehicles' presence, state, and shape using a Gaussian process extent model; a decentralized filter is realized through fusion of the filters posterior densities.... |
1704.05952 | Raydonal Ospina | Luis Gomez, Raydonal Ospina and Alejandro C. Frery | Unassisted Quantitative Evaluation Of Despeckling Filters | Accepted for publication in Remote Sensing - Open Access Journal | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | SAR (Synthetic Aperture Radar) imaging plays a central role in Remote Sensing
due to, among other important features, its ability to provide high-resolution,
day-and-night and almost weather-independent images. SAR images are affected
from a granular contamination, speckle, that can be described by a
multiplicative m... | [
{
"created": "Wed, 19 Apr 2017 23:01:30 GMT",
"version": "v1"
}
] | 2017-04-21 | [
[
"Gomez",
"Luis",
""
],
[
"Ospina",
"Raydonal",
""
],
[
"Frery",
"Alejandro C.",
""
]
] | SAR (Synthetic Aperture Radar) imaging plays a central role in Remote Sensing due to, among other important features, its ability to provide high-resolution, day-and-night and almost weather-independent images. SAR images are affected from a granular contamination, speckle, that can be described by a multiplicative mod... |
1910.02059 | Georgios Birmpas | Georgios Birmpas, Elias Koutsoupias, Philip Lazos, Francisco J.
Marmolejo-Coss\'io | Fairness and Efficiency in DAG-based Cryptocurrencies | null | null | null | null | cs.CR cs.GT cs.MA | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Bitcoin is a decentralised digital currency that serves as an alternative to
existing transaction systems based on an external central authority for
security. Although Bitcoin has many desirable properties, one of its
fundamental shortcomings is its inability to process transactions at high
rates. To address this cha... | [
{
"created": "Fri, 4 Oct 2019 17:35:46 GMT",
"version": "v1"
}
] | 2019-10-07 | [
[
"Birmpas",
"Georgios",
""
],
[
"Koutsoupias",
"Elias",
""
],
[
"Lazos",
"Philip",
""
],
[
"Marmolejo-Cossío",
"Francisco J.",
""
]
] | Bitcoin is a decentralised digital currency that serves as an alternative to existing transaction systems based on an external central authority for security. Although Bitcoin has many desirable properties, one of its fundamental shortcomings is its inability to process transactions at high rates. To address this chall... |
2108.13591 | Jingfei Chang | Jingfei Chang, Yang Lu, Ping Xue, Yiqun Xu and Zhen Wei | AIP: Adversarial Iterative Pruning Based on Knowledge Transfer for
Convolutional Neural Networks | 15 pages, 7 figures | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | With the increase of structure complexity, convolutional neural networks
(CNNs) take a fair amount of computation cost. Meanwhile, existing research
reveals the salient parameter redundancy in CNNs. The current pruning methods
can compress CNNs with little performance drop, but when the pruning ratio
increases, the a... | [
{
"created": "Tue, 31 Aug 2021 02:38:36 GMT",
"version": "v1"
}
] | 2021-09-01 | [
[
"Chang",
"Jingfei",
""
],
[
"Lu",
"Yang",
""
],
[
"Xue",
"Ping",
""
],
[
"Xu",
"Yiqun",
""
],
[
"Wei",
"Zhen",
""
]
] | With the increase of structure complexity, convolutional neural networks (CNNs) take a fair amount of computation cost. Meanwhile, existing research reveals the salient parameter redundancy in CNNs. The current pruning methods can compress CNNs with little performance drop, but when the pruning ratio increases, the acc... |
1510.06788 | Ravi Chugh | Ravi Chugh | Prodirect Manipulation: Bidirectional Programming for the Masses | ICSE 2016 Companion Proceedings (Visions of 2025 Track), May 14-22,
2016, Austin, TX, USA | null | 10.1145/2889160.2889210 | null | cs.SE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Software interfaces today generally fall at either end of a spectrum. On one
end are programmable systems, which allow expert users (i.e. programmers) to
write software artifacts that describe complex abstractions, but programs are
disconnected from their eventual output. On the other end are domain-specific
graphica... | [
{
"created": "Thu, 22 Oct 2015 23:44:36 GMT",
"version": "v1"
},
{
"created": "Wed, 24 Feb 2016 15:28:44 GMT",
"version": "v2"
}
] | 2016-02-25 | [
[
"Chugh",
"Ravi",
""
]
] | Software interfaces today generally fall at either end of a spectrum. On one end are programmable systems, which allow expert users (i.e. programmers) to write software artifacts that describe complex abstractions, but programs are disconnected from their eventual output. On the other end are domain-specific graphical ... |
1509.03807 | Nguyen H. Nam | Le Xuan Quang, Le Huy Hoang, Vu Dinh Chuan, Nguyen Hoai Nam, Nguyen
Thi Tu Anh and Vu Thi Hong Nhung | Integrated Science, Technology, Engineering and Mathematics (STEM)
Education through Active Experience of Designing Technical Toys in Vietnamese
Schools | 12 pages, 7 figures, 2 tables, British Journal of Education, Society
& Behavioural Science, 2015 | null | 10.9734/BJESBS/2015/19429 | null | cs.CY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | STEM has attracted great consideration. The purpose of research is: (1) study
STEM education, (2) explore STEM education with the creative and experiential
activity, (3) suggest applying STEM education by designing technical toys for
the middle school student. This study used a qualitative approach to carry out
teach... | [
{
"created": "Sun, 13 Sep 2015 04:22:03 GMT",
"version": "v1"
}
] | 2015-09-15 | [
[
"Quang",
"Le Xuan",
""
],
[
"Hoang",
"Le Huy",
""
],
[
"Chuan",
"Vu Dinh",
""
],
[
"Nam",
"Nguyen Hoai",
""
],
[
"Anh",
"Nguyen Thi Tu",
""
],
[
"Nhung",
"Vu Thi Hong",
""
]
] | STEM has attracted great consideration. The purpose of research is: (1) study STEM education, (2) explore STEM education with the creative and experiential activity, (3) suggest applying STEM education by designing technical toys for the middle school student. This study used a qualitative approach to carry out teachin... |
1902.11184 | Samia El Haddouti | Samia El Haddouti and Mohamed Dafir Ech-Cherif El Kettani | Towards an Interoperable Identity Management Framework: a Comparative
Study | null | null | null | null | cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The development of services and the growing demand for resources sharing
among users from different organizations with some level of affinity have
motivated the creation of Identity Management Systems. Identity Management has
gained significant attention in recent years in the form of several projects
producing many ... | [
{
"created": "Thu, 28 Feb 2019 16:06:14 GMT",
"version": "v1"
}
] | 2019-03-01 | [
[
"Haddouti",
"Samia El",
""
],
[
"Kettani",
"Mohamed Dafir Ech-Cherif El",
""
]
] | The development of services and the growing demand for resources sharing among users from different organizations with some level of affinity have motivated the creation of Identity Management Systems. Identity Management has gained significant attention in recent years in the form of several projects producing many st... |
2302.12190 | Ciprian-Octavian Truic\u{a} | Ciprian-Octavian Truic\u{a} and Elena-Simona Apostol and
Radu-C\u{a}t\u{a}lin Nicolescu and Panagiotis Karras | MCWDST: a Minimum-Cost Weighted Directed Spanning Tree Algorithm for
Real-Time Fake News Mitigation in Social Media | null | IEEE Access, 11:125861-125873, 2023 | 10.1109/ACCESS.2023.3331220 | null | cs.SI cs.AI cs.CL cs.NE | http://creativecommons.org/licenses/by-nc-nd/4.0/ | The widespread availability of internet access and handheld devices confers
to social media a power similar to the one newspapers used to have. People seek
affordable information on social media and can reach it within seconds. Yet
this convenience comes with dangers; any user may freely post whatever they
please and... | [
{
"created": "Thu, 23 Feb 2023 17:31:40 GMT",
"version": "v1"
},
{
"created": "Fri, 19 Jan 2024 16:30:14 GMT",
"version": "v2"
}
] | 2024-01-22 | [
[
"Truică",
"Ciprian-Octavian",
""
],
[
"Apostol",
"Elena-Simona",
""
],
[
"Nicolescu",
"Radu-Cătălin",
""
],
[
"Karras",
"Panagiotis",
""
]
] | The widespread availability of internet access and handheld devices confers to social media a power similar to the one newspapers used to have. People seek affordable information on social media and can reach it within seconds. Yet this convenience comes with dangers; any user may freely post whatever they please and t... |
1503.02997 | No'am Newman | No'am Newman | Spreadsheets in an ERP environment: not what the doctor ordered | In Proceedings of the 2nd Workshop on Software Engineering Methods in
Spreadsheets (http://spreadsheetlab.org/sems15/) | null | null | null | cs.SE | http://creativecommons.org/licenses/by/3.0/ | Modern ERP systems contain flexible report generators but the tendency exists
for users to export data to spreadsheets for manipulation, reporting and
decision making. A purported reason for this is that some users are more
familiar with personal reporting tools (spreadsheets) as opposed to enterprise
reporting tools... | [
{
"created": "Tue, 10 Mar 2015 17:31:47 GMT",
"version": "v1"
}
] | 2015-03-11 | [
[
"Newman",
"No'am",
""
]
] | Modern ERP systems contain flexible report generators but the tendency exists for users to export data to spreadsheets for manipulation, reporting and decision making. A purported reason for this is that some users are more familiar with personal reporting tools (spreadsheets) as opposed to enterprise reporting tools. ... |
2406.04995 | Julian Minder | Julian Minder, Laurence Brandenberger, Luis Salamanca, Frank
Schweitzer | Data2Neo - A Tool for Complex Neo4j Data Integration | null | null | null | null | cs.DB | http://creativecommons.org/licenses/by/4.0/ | This paper introduces Data2Neo, an open-source Python library for converting
relational data into knowledge graphs stored in Neo4j databases. With extensive
customization options and support for continuous online data integration from
various data sources, Data2Neo is designed to be user-friendly, efficient, and
scal... | [
{
"created": "Fri, 7 Jun 2024 15:06:36 GMT",
"version": "v1"
},
{
"created": "Mon, 10 Jun 2024 08:28:04 GMT",
"version": "v2"
},
{
"created": "Tue, 11 Jun 2024 11:12:49 GMT",
"version": "v3"
},
{
"created": "Wed, 12 Jun 2024 12:16:11 GMT",
"version": "v4"
}
] | 2024-06-13 | [
[
"Minder",
"Julian",
""
],
[
"Brandenberger",
"Laurence",
""
],
[
"Salamanca",
"Luis",
""
],
[
"Schweitzer",
"Frank",
""
]
] | This paper introduces Data2Neo, an open-source Python library for converting relational data into knowledge graphs stored in Neo4j databases. With extensive customization options and support for continuous online data integration from various data sources, Data2Neo is designed to be user-friendly, efficient, and scalab... |
2008.07720 | Hung Pham Thuc | Pham Thuc Hung, Kenji Yamanishi | Word2vec Skip-gram Dimensionality Selection via Sequential Normalized
Maximum Likelihood | null | null | null | null | cs.LG cs.CL stat.ML | http://creativecommons.org/licenses/by/4.0/ | In this paper, we propose a novel information criteria-based approach to
select the dimensionality of the word2vec Skip-gram (SG). From the perspective
of the probability theory, SG is considered as an implicit probability
distribution estimation under the assumption that there exists a true
contextual distribution a... | [
{
"created": "Tue, 18 Aug 2020 03:24:21 GMT",
"version": "v1"
},
{
"created": "Mon, 24 Aug 2020 04:55:56 GMT",
"version": "v2"
},
{
"created": "Tue, 25 Aug 2020 01:08:24 GMT",
"version": "v3"
}
] | 2020-08-26 | [
[
"Hung",
"Pham Thuc",
""
],
[
"Yamanishi",
"Kenji",
""
]
] | In this paper, we propose a novel information criteria-based approach to select the dimensionality of the word2vec Skip-gram (SG). From the perspective of the probability theory, SG is considered as an implicit probability distribution estimation under the assumption that there exists a true contextual distribution amo... |
2206.10071 | Kay Liu | Kay Liu, Yingtong Dou, Yue Zhao, Xueying Ding, Xiyang Hu, Ruitong
Zhang, Kaize Ding, Canyu Chen, Hao Peng, Kai Shu, Lichao Sun, Jundong Li,
George H. Chen, Zhihao Jia, Philip S. Yu | BOND: Benchmarking Unsupervised Outlier Node Detection on Static
Attributed Graphs | NeurIPS 2022. Benchmark available at
https://github.com/pygod-team/pygod/tree/main/benchmark | null | null | null | cs.LG cs.SI | http://creativecommons.org/licenses/by/4.0/ | Detecting which nodes in graphs are outliers is a relatively new machine
learning task with numerous applications. Despite the proliferation of
algorithms developed in recent years for this task, there has been no standard
comprehensive setting for performance evaluation. Consequently, it has been
difficult to unders... | [
{
"created": "Tue, 21 Jun 2022 01:46:38 GMT",
"version": "v1"
},
{
"created": "Sun, 16 Oct 2022 01:18:45 GMT",
"version": "v2"
}
] | 2022-10-18 | [
[
"Liu",
"Kay",
""
],
[
"Dou",
"Yingtong",
""
],
[
"Zhao",
"Yue",
""
],
[
"Ding",
"Xueying",
""
],
[
"Hu",
"Xiyang",
""
],
[
"Zhang",
"Ruitong",
""
],
[
"Ding",
"Kaize",
""
],
[
"Chen",
"Canyu",
... | Detecting which nodes in graphs are outliers is a relatively new machine learning task with numerous applications. Despite the proliferation of algorithms developed in recent years for this task, there has been no standard comprehensive setting for performance evaluation. Consequently, it has been difficult to understa... |
2302.10096 | Christian Anti\'c | Christian Anti\'c | Similarity | null | null | null | null | cs.AI cs.LO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Detecting and exploiting similarities between seemingly distant objects is
without doubt an important human ability. This paper develops \textit{from the
ground up} an abstract algebraic and qualitative justification-based notion of
similarity based on the observation that sets of generalizations encode
important pro... | [
{
"created": "Mon, 13 Feb 2023 14:48:59 GMT",
"version": "v1"
},
{
"created": "Mon, 27 Feb 2023 20:55:04 GMT",
"version": "v2"
},
{
"created": "Wed, 11 Oct 2023 14:49:59 GMT",
"version": "v3"
},
{
"created": "Tue, 12 Dec 2023 15:08:49 GMT",
"version": "v4"
},
{
"c... | 2024-04-04 | [
[
"Antić",
"Christian",
""
]
] | Detecting and exploiting similarities between seemingly distant objects is without doubt an important human ability. This paper develops \textit{from the ground up} an abstract algebraic and qualitative justification-based notion of similarity based on the observation that sets of generalizations encode important prope... |
2002.02460 | Ezequiel Alvarez | Ezequiel Alvarez (ICAS), Federico Lamagna (CAB), Cesar Miquel
(Easytech) and Manuel Szewc (ICAS) | Intelligent Arxiv: Sort daily papers by learning users topics preference | We are open to new ideas and to scientists and institutions wishing
to collaborate and/or partner in further improvements for this service. With
this tool the time a paper is sent is irrelevant for its order of appearance | null | null | ICAS 047/20 | cs.LG astro-ph.HE gr-qc hep-ph hep-th stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Current daily paper releases are becoming increasingly large and areas of
research are growing in diversity. This makes it harder for scientists to keep
up to date with current state of the art and identify relevant work within
their lines of interest. The goal of this article is to address this problem
using Machine... | [
{
"created": "Thu, 6 Feb 2020 19:00:02 GMT",
"version": "v1"
}
] | 2020-02-10 | [
[
"Alvarez",
"Ezequiel",
"",
"ICAS"
],
[
"Lamagna",
"Federico",
"",
"CAB"
],
[
"Miquel",
"Cesar",
"",
"Easytech"
],
[
"Szewc",
"Manuel",
"",
"ICAS"
]
] | Current daily paper releases are becoming increasingly large and areas of research are growing in diversity. This makes it harder for scientists to keep up to date with current state of the art and identify relevant work within their lines of interest. The goal of this article is to address this problem using Machine L... |
1501.06678 | Zhiwen Zeng | Zhiwen Zeng, Xiangke Wang, Zhiqiang Zheng | Edge Agreement of Multi-agent System with Quantized Measurements via the
Directed Edge Laplacian | 16 pages, 10 figures; Round2, revised to IET Control Theory &
Applications, 2016 | null | null | null | cs.SY cs.MA | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This work explores the edge agreement problem of second-order nonlinear
multi-agent system under quantized measurements. Under the edge agreement
framework, we introduce an important concept about the \emph{essential edge
Laplacian} and also obtain a reduced model of the edge agreement dynamics based
on the spanning ... | [
{
"created": "Tue, 27 Jan 2015 08:00:21 GMT",
"version": "v1"
},
{
"created": "Fri, 29 Jan 2016 01:54:34 GMT",
"version": "v2"
}
] | 2016-02-01 | [
[
"Zeng",
"Zhiwen",
""
],
[
"Wang",
"Xiangke",
""
],
[
"Zheng",
"Zhiqiang",
""
]
] | This work explores the edge agreement problem of second-order nonlinear multi-agent system under quantized measurements. Under the edge agreement framework, we introduce an important concept about the \emph{essential edge Laplacian} and also obtain a reduced model of the edge agreement dynamics based on the spanning tr... |
2301.00014 | Tommaso Barbariol | Tommaso Barbariol, Davide Masiero, Enrico Feltresi, Gian Antonio Susto | Time series Forecasting to detect anomalous behaviours in Multiphase
Flow Meters | null | null | null | null | cs.LG cs.AI | http://creativecommons.org/licenses/by/4.0/ | An Anomaly Detection (AD) System for Self-diagnosis has been developed for
Multiphase Flow Meter (MPFM). The system relies on machine learning algorithms
for time series forecasting, historical data have been used to train a model
and to predict the behavior of a sensor and, thus, to detect anomalies.
| [
{
"created": "Fri, 30 Dec 2022 14:41:53 GMT",
"version": "v1"
}
] | 2023-01-03 | [
[
"Barbariol",
"Tommaso",
""
],
[
"Masiero",
"Davide",
""
],
[
"Feltresi",
"Enrico",
""
],
[
"Susto",
"Gian Antonio",
""
]
] | An Anomaly Detection (AD) System for Self-diagnosis has been developed for Multiphase Flow Meter (MPFM). The system relies on machine learning algorithms for time series forecasting, historical data have been used to train a model and to predict the behavior of a sensor and, thus, to detect anomalies. |
2307.11049 | Abhishek Gupta | Marcel Torne, Max Balsells, Zihan Wang, Samedh Desai, Tao Chen, Pulkit
Agrawal, Abhishek Gupta | Breadcrumbs to the Goal: Goal-Conditioned Exploration from
Human-in-the-Loop Feedback | null | null | null | null | cs.LG cs.AI cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Exploration and reward specification are fundamental and intertwined
challenges for reinforcement learning. Solving sequential decision-making tasks
requiring expansive exploration requires either careful design of reward
functions or the use of novelty-seeking exploration bonuses. Human supervisors
can provide effec... | [
{
"created": "Thu, 20 Jul 2023 17:30:37 GMT",
"version": "v1"
}
] | 2023-07-21 | [
[
"Torne",
"Marcel",
""
],
[
"Balsells",
"Max",
""
],
[
"Wang",
"Zihan",
""
],
[
"Desai",
"Samedh",
""
],
[
"Chen",
"Tao",
""
],
[
"Agrawal",
"Pulkit",
""
],
[
"Gupta",
"Abhishek",
""
]
] | Exploration and reward specification are fundamental and intertwined challenges for reinforcement learning. Solving sequential decision-making tasks requiring expansive exploration requires either careful design of reward functions or the use of novelty-seeking exploration bonuses. Human supervisors can provide effecti... |
2406.12311 | Dongwon Jo | Dongwon Jo, Taesu Kim, Yulhwa Kim, Jae-Joon Kim | Mixture of Scales: Memory-Efficient Token-Adaptive Binarization for
Large Language Models | null | null | null | null | cs.LG | http://creativecommons.org/licenses/by-nc-sa/4.0/ | Binarization, which converts weight parameters to binary values, has emerged
as an effective strategy to reduce the size of large language models (LLMs).
However, typical binarization techniques significantly diminish linguistic
effectiveness of LLMs. To address this issue, we introduce a novel binarization
technique... | [
{
"created": "Tue, 18 Jun 2024 06:32:23 GMT",
"version": "v1"
}
] | 2024-06-19 | [
[
"Jo",
"Dongwon",
""
],
[
"Kim",
"Taesu",
""
],
[
"Kim",
"Yulhwa",
""
],
[
"Kim",
"Jae-Joon",
""
]
] | Binarization, which converts weight parameters to binary values, has emerged as an effective strategy to reduce the size of large language models (LLMs). However, typical binarization techniques significantly diminish linguistic effectiveness of LLMs. To address this issue, we introduce a novel binarization technique c... |
2402.04470 | Zhicheng Lin | Zhicheng Lin | Large language models as probes into latent psychology | 8 pages, 1 table | null | null | null | cs.CY | http://creativecommons.org/licenses/by-sa/4.0/ | Advances in AI invite the misuse of language models as stand-ins for human
minds or participants, which fundamentally mischaracterizes these statistical
algorithms. We argue that language models should be embraced as flexible
simulation tools, able to mimic a wide range of behaviors, perspectives, and
psychological a... | [
{
"created": "Tue, 6 Feb 2024 23:28:23 GMT",
"version": "v1"
},
{
"created": "Tue, 27 Feb 2024 03:21:04 GMT",
"version": "v2"
}
] | 2024-02-28 | [
[
"Lin",
"Zhicheng",
""
]
] | Advances in AI invite the misuse of language models as stand-ins for human minds or participants, which fundamentally mischaracterizes these statistical algorithms. We argue that language models should be embraced as flexible simulation tools, able to mimic a wide range of behaviors, perspectives, and psychological att... |
2310.12680 | Puneesh Deora | Puneesh Deora, Rouzbeh Ghaderi, Hossein Taheri, Christos Thrampoulidis | On the Optimization and Generalization of Multi-head Attention | 48 page; presented in the Workshop on High-dimensional Learning
Dynamics, ICML 2023 | null | null | null | cs.LG math.OC stat.ML | http://creativecommons.org/licenses/by/4.0/ | The training and generalization dynamics of the Transformer's core mechanism,
namely the Attention mechanism, remain under-explored. Besides, existing
analyses primarily focus on single-head attention. Inspired by the demonstrated
benefits of overparameterization when training fully-connected networks, we
investigate... | [
{
"created": "Thu, 19 Oct 2023 12:18:24 GMT",
"version": "v1"
}
] | 2023-10-20 | [
[
"Deora",
"Puneesh",
""
],
[
"Ghaderi",
"Rouzbeh",
""
],
[
"Taheri",
"Hossein",
""
],
[
"Thrampoulidis",
"Christos",
""
]
] | The training and generalization dynamics of the Transformer's core mechanism, namely the Attention mechanism, remain under-explored. Besides, existing analyses primarily focus on single-head attention. Inspired by the demonstrated benefits of overparameterization when training fully-connected networks, we investigate t... |
2104.05237 | Zifan Shi | Hao Ouyang, Zifan Shi, Chenyang Lei, Ka Lung Law and Qifeng Chen | Neural Camera Simulators | Accepted to CVPR2021 | null | null | null | cs.CV eess.IV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We present a controllable camera simulator based on deep neural networks to
synthesize raw image data under different camera settings, including exposure
time, ISO, and aperture. The proposed simulator includes an exposure module
that utilizes the principle of modern lens designs for correcting the luminance
level. I... | [
{
"created": "Mon, 12 Apr 2021 07:06:27 GMT",
"version": "v1"
},
{
"created": "Mon, 9 Aug 2021 09:42:52 GMT",
"version": "v2"
}
] | 2021-08-10 | [
[
"Ouyang",
"Hao",
""
],
[
"Shi",
"Zifan",
""
],
[
"Lei",
"Chenyang",
""
],
[
"Law",
"Ka Lung",
""
],
[
"Chen",
"Qifeng",
""
]
] | We present a controllable camera simulator based on deep neural networks to synthesize raw image data under different camera settings, including exposure time, ISO, and aperture. The proposed simulator includes an exposure module that utilizes the principle of modern lens designs for correcting the luminance level. It ... |
1410.0245 | Jeremy Kun | Benjamin Fish and Jeremy Kun and \'Ad\'am D\'aniel Lelkes and Lev
Reyzin and Gy\"orgy Tur\'an | On the Computational Complexity of MapReduce | null | null | null | null | cs.CC cs.DC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper we study MapReduce computations from a complexity-theoretic
perspective. First, we formulate a uniform version of the MRC model of Karloff
et al. (2010). We then show that the class of regular languages, and moreover
all of sublogarithmic space, lies in constant round MRC. This result also
applies to th... | [
{
"created": "Wed, 1 Oct 2014 14:44:01 GMT",
"version": "v1"
},
{
"created": "Tue, 6 Oct 2015 18:43:00 GMT",
"version": "v2"
}
] | 2015-10-07 | [
[
"Fish",
"Benjamin",
""
],
[
"Kun",
"Jeremy",
""
],
[
"Lelkes",
"Ádám Dániel",
""
],
[
"Reyzin",
"Lev",
""
],
[
"Turán",
"György",
""
]
] | In this paper we study MapReduce computations from a complexity-theoretic perspective. First, we formulate a uniform version of the MRC model of Karloff et al. (2010). We then show that the class of regular languages, and moreover all of sublogarithmic space, lies in constant round MRC. This result also applies to the ... |
2404.13861 | Jessica Dai | Jessica Dai | Beyond Personhood: Agency, Accountability, and the Limits of
Anthropomorphic Ethical Analysis | null | null | null | null | cs.CY | http://creativecommons.org/licenses/by/4.0/ | What is agency, and why does it matter? In this work, we draw from the
political science and philosophy literature and give two competing visions of
what it means to be an (ethical) agent. The first view, which we term
mechanistic, is commonly--and implicitly--assumed in AI research, yet it is a
fundamentally limited... | [
{
"created": "Mon, 22 Apr 2024 04:19:24 GMT",
"version": "v1"
}
] | 2024-04-23 | [
[
"Dai",
"Jessica",
""
]
] | What is agency, and why does it matter? In this work, we draw from the political science and philosophy literature and give two competing visions of what it means to be an (ethical) agent. The first view, which we term mechanistic, is commonly--and implicitly--assumed in AI research, yet it is a fundamentally limited m... |
1301.7482 | Austin Jones M.S. | Austin Jones and Mac Schwager and Calin Belta | Technical Report: A Receding Horizon Algorithm for Informative Path
Planning with Temporal Logic Constraints | Extended version of paper accepted to 2013 IEEE International
Conference on Robotics and Automation (ICRA) | null | null | null | cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This technical report is an extended version of the paper 'A Receding Horizon
Algorithm for Informative Path Planning with Temporal Logic Constraints'
accepted to the 2013 IEEE International Conference on Robotics and Automation
(ICRA). This paper considers the problem of finding the most informative path
for a sensi... | [
{
"created": "Thu, 31 Jan 2013 00:33:24 GMT",
"version": "v1"
}
] | 2013-02-01 | [
[
"Jones",
"Austin",
""
],
[
"Schwager",
"Mac",
""
],
[
"Belta",
"Calin",
""
]
] | This technical report is an extended version of the paper 'A Receding Horizon Algorithm for Informative Path Planning with Temporal Logic Constraints' accepted to the 2013 IEEE International Conference on Robotics and Automation (ICRA). This paper considers the problem of finding the most informative path for a sensing... |
1712.03297 | Ke Chen | Ke Chen and Adrian Dumitrescu | On the Longest Spanning Tree with Neighborhoods | 12 pages, 4 figures. Section 2 is split into three subsections; more
technical details are provided in section 3 | null | null | null | cs.CG math.MG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We study a maximization problem for geometric network design. Given a set of
$n$ compact neighborhoods in $\mathbb{R}^d$, select a point in each
neighborhood, so that the longest spanning tree on these points (as vertices)
has maximum length. Here we give an approximation algorithm with ratio $0.511$,
which represent... | [
{
"created": "Fri, 8 Dec 2017 22:24:22 GMT",
"version": "v1"
},
{
"created": "Wed, 29 Apr 2020 02:38:40 GMT",
"version": "v2"
}
] | 2020-04-30 | [
[
"Chen",
"Ke",
""
],
[
"Dumitrescu",
"Adrian",
""
]
] | We study a maximization problem for geometric network design. Given a set of $n$ compact neighborhoods in $\mathbb{R}^d$, select a point in each neighborhood, so that the longest spanning tree on these points (as vertices) has maximum length. Here we give an approximation algorithm with ratio $0.511$, which represents ... |
2112.15253 | Sergey A. Slavnov | Sergey Slavnov | First order linear logic and tensor type calculus for categorial
grammars | null | null | null | null | cs.CL | http://creativecommons.org/licenses/by/4.0/ | We study relationship between first order multiplicative linear logic (MLL1),
which has been known to provide representations to different categorial
grammars, and the recently introduced extended tensor type calculus (ETTC). We
identify a fragment of MLL1, which seems sufficient for many grammar
representations, and... | [
{
"created": "Fri, 31 Dec 2021 00:35:48 GMT",
"version": "v1"
}
] | 2022-01-03 | [
[
"Slavnov",
"Sergey",
""
]
] | We study relationship between first order multiplicative linear logic (MLL1), which has been known to provide representations to different categorial grammars, and the recently introduced extended tensor type calculus (ETTC). We identify a fragment of MLL1, which seems sufficient for many grammar representations, and e... |
2110.10570 | Samuel Bell | Samuel J. Bell and Neil D. Lawrence | Behavioral Experiments for Understanding Catastrophic Forgetting | null | Presented at the AI Evaluation Beyond Metrics (EBeM) Workshop at
IJCAI, Vienna 2022 | null | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper we explore whether the fundamental tool of experimental
psychology, the behavioral experiment, has the power to generate insight not
only into humans and animals, but artificial systems too. We apply the
techniques of experimental psychology to investigating catastrophic forgetting
in neural networks. W... | [
{
"created": "Wed, 20 Oct 2021 14:00:02 GMT",
"version": "v1"
},
{
"created": "Fri, 22 Oct 2021 11:22:11 GMT",
"version": "v2"
},
{
"created": "Tue, 13 Dec 2022 15:32:46 GMT",
"version": "v3"
}
] | 2022-12-14 | [
[
"Bell",
"Samuel J.",
""
],
[
"Lawrence",
"Neil D.",
""
]
] | In this paper we explore whether the fundamental tool of experimental psychology, the behavioral experiment, has the power to generate insight not only into humans and animals, but artificial systems too. We apply the techniques of experimental psychology to investigating catastrophic forgetting in neural networks. We ... |
2402.12252 | James Davis | William P. Maxam III and James C. Davis | An Interview Study on Third-Party Cyber Threat Hunting Processes in the
U.S. Department of Homeland Security | Technical report accompanying a paper at USENIX Security 2024 | null | null | null | cs.CR cs.SE | http://creativecommons.org/licenses/by/4.0/ | Cybersecurity is a major challenge for large organizations. Traditional
cybersecurity defense is reactive. Cybersecurity operations centers keep out
adversaries and incident response teams clean up after break-ins. Recently a
proactive stage has been introduced: Cyber Threat Hunting (TH) looks for
potential compromis... | [
{
"created": "Mon, 19 Feb 2024 16:08:36 GMT",
"version": "v1"
}
] | 2024-02-20 | [
[
"Maxam",
"William P.",
"III"
],
[
"Davis",
"James C.",
""
]
] | Cybersecurity is a major challenge for large organizations. Traditional cybersecurity defense is reactive. Cybersecurity operations centers keep out adversaries and incident response teams clean up after break-ins. Recently a proactive stage has been introduced: Cyber Threat Hunting (TH) looks for potential compromises... |
2110.11712 | Simon Meierhans | Rasmus Kyng, Simon Meierhans, Maximilian Probst Gutenberg | Incremental SSSP for Sparse Digraphs Beyond the Hopset Barrier | Accepted at SODA'22 | null | null | null | cs.DS | http://creativecommons.org/licenses/by/4.0/ | Given a directed, weighted graph $G=(V,E)$ undergoing edge insertions, the
incremental single-source shortest paths (SSSP) problem asks for the
maintenance of approximate distances from a dedicated source $s$ while
optimizing the total time required to process the insertion sequence of $m$
edges.
Recently, Gutenber... | [
{
"created": "Fri, 22 Oct 2021 11:19:14 GMT",
"version": "v1"
}
] | 2021-10-25 | [
[
"Kyng",
"Rasmus",
""
],
[
"Meierhans",
"Simon",
""
],
[
"Gutenberg",
"Maximilian Probst",
""
]
] | Given a directed, weighted graph $G=(V,E)$ undergoing edge insertions, the incremental single-source shortest paths (SSSP) problem asks for the maintenance of approximate distances from a dedicated source $s$ while optimizing the total time required to process the insertion sequence of $m$ edges. Recently, Gutenberg, W... |
2010.04683 | Jovita Lukasik | Jovita Lukasik and David Friede and Arber Zela and Frank Hutter and
Margret Keuper | Smooth Variational Graph Embeddings for Efficient Neural Architecture
Search | 8 pages, 3 figures, 5 tables. Camera-Ready Version for IJCNN 2021 | null | null | null | cs.LG cs.AI cs.CV stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Neural architecture search (NAS) has recently been addressed from various
directions, including discrete, sampling-based methods and efficient
differentiable approaches. While the former are notoriously expensive, the
latter suffer from imposing strong constraints on the search space.
Architecture optimization from a... | [
{
"created": "Fri, 9 Oct 2020 17:05:41 GMT",
"version": "v1"
},
{
"created": "Tue, 8 Dec 2020 14:50:56 GMT",
"version": "v2"
},
{
"created": "Wed, 12 May 2021 12:44:54 GMT",
"version": "v3"
}
] | 2021-05-13 | [
[
"Lukasik",
"Jovita",
""
],
[
"Friede",
"David",
""
],
[
"Zela",
"Arber",
""
],
[
"Hutter",
"Frank",
""
],
[
"Keuper",
"Margret",
""
]
] | Neural architecture search (NAS) has recently been addressed from various directions, including discrete, sampling-based methods and efficient differentiable approaches. While the former are notoriously expensive, the latter suffer from imposing strong constraints on the search space. Architecture optimization from a l... |
1505.00887 | Chu Luo | Jiyou Li, Chu Luo, Zeying Xu | The Minimal and Maximal Sensitivity of the Simplified Weighted Sum
Function | 6 pages | null | null | null | cs.DM | http://creativecommons.org/licenses/by-nc-sa/4.0/ | Sensitivity is an important complexity measure of Boolean functions. In this
paper we present properties of the minimal and maximal sensitivity of the
simplified weighted sum function. A simple close formula of the minimal
sensitivity of the simplified weighted sum function is obtained. A phenomenon
is exhibited that... | [
{
"created": "Tue, 5 May 2015 06:16:29 GMT",
"version": "v1"
},
{
"created": "Wed, 27 Jan 2016 16:51:55 GMT",
"version": "v2"
}
] | 2016-01-28 | [
[
"Li",
"Jiyou",
""
],
[
"Luo",
"Chu",
""
],
[
"Xu",
"Zeying",
""
]
] | Sensitivity is an important complexity measure of Boolean functions. In this paper we present properties of the minimal and maximal sensitivity of the simplified weighted sum function. A simple close formula of the minimal sensitivity of the simplified weighted sum function is obtained. A phenomenon is exhibited that t... |
1908.05557 | Anh Truong | Anh Truong, Austin Walters, Jeremy Goodsitt, Keegan Hines, C. Bayan
Bruss, Reza Farivar | Towards Automated Machine Learning: Evaluation and Comparison of AutoML
Approaches and Tools | null | null | 10.1109/ICTAI.2019.00209 | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | There has been considerable growth and interest in industrial applications of
machine learning (ML) in recent years. ML engineers, as a consequence, are in
high demand across the industry, yet improving the efficiency of ML engineers
remains a fundamental challenge. Automated machine learning (AutoML) has
emerged as ... | [
{
"created": "Thu, 15 Aug 2019 14:16:09 GMT",
"version": "v1"
},
{
"created": "Tue, 3 Sep 2019 19:31:52 GMT",
"version": "v2"
}
] | 2020-05-05 | [
[
"Truong",
"Anh",
""
],
[
"Walters",
"Austin",
""
],
[
"Goodsitt",
"Jeremy",
""
],
[
"Hines",
"Keegan",
""
],
[
"Bruss",
"C. Bayan",
""
],
[
"Farivar",
"Reza",
""
]
] | There has been considerable growth and interest in industrial applications of machine learning (ML) in recent years. ML engineers, as a consequence, are in high demand across the industry, yet improving the efficiency of ML engineers remains a fundamental challenge. Automated machine learning (AutoML) has emerged as a ... |
2206.13176 | Yifan Hou | Yifan Hou, Hongzhi Chen, Changji Li, James Cheng, Ming-Chang Yang | A Representation Learning Framework for Property Graphs | This paper is published in KDD 2019. Code can be found here:
https://github.com/yifan-h/PGE | null | null | null | cs.LG cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Representation learning on graphs, also called graph embedding, has
demonstrated its significant impact on a series of machine learning
applications such as classification, prediction and recommendation. However,
existing work has largely ignored the rich information contained in the
properties (or attributes) of bot... | [
{
"created": "Mon, 27 Jun 2022 10:36:57 GMT",
"version": "v1"
}
] | 2022-06-28 | [
[
"Hou",
"Yifan",
""
],
[
"Chen",
"Hongzhi",
""
],
[
"Li",
"Changji",
""
],
[
"Cheng",
"James",
""
],
[
"Yang",
"Ming-Chang",
""
]
] | Representation learning on graphs, also called graph embedding, has demonstrated its significant impact on a series of machine learning applications such as classification, prediction and recommendation. However, existing work has largely ignored the rich information contained in the properties (or attributes) of both ... |
1801.08737 | Khoa Nguyen | San Ling and Khoa Nguyen and Huaxiong Wang and Yanhong Xu | Lattice-Based Group Signatures: Achieving Full Dynamicity (and
Deniability) with Ease | null | null | null | null | cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this work, we provide the first lattice-based group signature that offers
full dynamicity (i.e., users have the flexibility in joining and leaving the
group), and thus, resolve a prominent open problem posed by previous works.
Moreover, we achieve this non-trivial feat in a relatively simple manner.
Starting with ... | [
{
"created": "Fri, 26 Jan 2018 10:09:03 GMT",
"version": "v1"
}
] | 2018-01-29 | [
[
"Ling",
"San",
""
],
[
"Nguyen",
"Khoa",
""
],
[
"Wang",
"Huaxiong",
""
],
[
"Xu",
"Yanhong",
""
]
] | In this work, we provide the first lattice-based group signature that offers full dynamicity (i.e., users have the flexibility in joining and leaving the group), and thus, resolve a prominent open problem posed by previous works. Moreover, we achieve this non-trivial feat in a relatively simple manner. Starting with Li... |
2011.05158 | Pablo Samuel Castro | Pablo Samuel Castro | GANterpretations | In 4th Workshop on Machine Learning for Creativity and Design at
NeurIPS 2020, Vancouver, Canada | null | null | null | cs.SD cs.AI cs.LG eess.AS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Since the introduction of Generative Adversarial Networks (GANs) [Goodfellow
et al., 2014] there has been a regular stream of both technical advances (e.g.,
Arjovsky et al. [2017]) and creative uses of these generative models (e.g.,
[Karras et al., 2019, Zhu et al., 2017, Jin et al., 2017]). In this work we
propose a... | [
{
"created": "Fri, 6 Nov 2020 19:08:40 GMT",
"version": "v1"
}
] | 2020-11-11 | [
[
"Castro",
"Pablo Samuel",
""
]
] | Since the introduction of Generative Adversarial Networks (GANs) [Goodfellow et al., 2014] there has been a regular stream of both technical advances (e.g., Arjovsky et al. [2017]) and creative uses of these generative models (e.g., [Karras et al., 2019, Zhu et al., 2017, Jin et al., 2017]). In this work we propose an ... |
1409.2485 | Bernhard Rumpe | Shahar Maoz, Jan Oliver Ringert, Bernhard Rumpe | A Manifesto for Semantic Model Differencing | 10 pages, 7 figures. arXiv admin note: text overlap with
arXiv:1409.2355, arXiv:1409.2352 | Proceedings Int. Workshop on Models and Evolution (ME'10),
co-located with MoDELS'10. J. Dingel and A. Solberg (Eds.): MoDELS Workshops,
LNCS 6627, pp. 194 - 203, 2010 | null | null | cs.SE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Models are heavily used in software engineering and together with their
systems they evolve over time. Thus, managing their changes is an important
challenge for system maintainability. Existing approaches to model differencing
concentrate on heuristics matching between model elements and on finding and
presenting di... | [
{
"created": "Mon, 8 Sep 2014 14:34:13 GMT",
"version": "v1"
}
] | 2014-09-10 | [
[
"Maoz",
"Shahar",
""
],
[
"Ringert",
"Jan Oliver",
""
],
[
"Rumpe",
"Bernhard",
""
]
] | Models are heavily used in software engineering and together with their systems they evolve over time. Thus, managing their changes is an important challenge for system maintainability. Existing approaches to model differencing concentrate on heuristics matching between model elements and on finding and presenting diff... |
1509.01624 | Andrew Knyazev | Dong Tian, Hassan Mansour, Andrew Knyazev, Anthony Vetro | Chebyshev and Conjugate Gradient Filters for Graph Image Denoising | 6 pages, 6 figures, accepted to 2014 IEEE International Conference on
Multimedia and Expo Workshops (ICMEW) | Multimedia and Expo Workshops (ICMEW), 2014 IEEE International
Conference on, vol., no., pp.1-6, 14-18 July 2014 | 10.1109/ICMEW.2014.6890711 | MERL TR2014-062 | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In 3D image/video acquisition, different views are often captured with
varying noise levels across the views. In this paper, we propose a graph-based
image enhancement technique that uses a higher quality view to enhance a
degraded view. A depth map is utilized as auxiliary information to match the
perspectives of th... | [
{
"created": "Fri, 4 Sep 2015 22:22:25 GMT",
"version": "v1"
}
] | 2015-09-08 | [
[
"Tian",
"Dong",
""
],
[
"Mansour",
"Hassan",
""
],
[
"Knyazev",
"Andrew",
""
],
[
"Vetro",
"Anthony",
""
]
] | In 3D image/video acquisition, different views are often captured with varying noise levels across the views. In this paper, we propose a graph-based image enhancement technique that uses a higher quality view to enhance a degraded view. A depth map is utilized as auxiliary information to match the perspectives of the ... |
2111.14666 | Assem Sadek | Assem Sadek, Guillaume Bono, Boris Chidlovskii, Christian Wolf | An in-depth experimental study of sensor usage and visual reasoning of
robots navigating in real environments | null | null | null | null | cs.AI cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Visual navigation by mobile robots is classically tackled through SLAM plus
optimal planning, and more recently through end-to-end training of policies
implemented as deep networks. While the former are often limited to waypoint
planning, but have proven their efficiency even on real physical environments,
the latter... | [
{
"created": "Mon, 29 Nov 2021 16:27:29 GMT",
"version": "v1"
}
] | 2021-11-30 | [
[
"Sadek",
"Assem",
""
],
[
"Bono",
"Guillaume",
""
],
[
"Chidlovskii",
"Boris",
""
],
[
"Wolf",
"Christian",
""
]
] | Visual navigation by mobile robots is classically tackled through SLAM plus optimal planning, and more recently through end-to-end training of policies implemented as deep networks. While the former are often limited to waypoint planning, but have proven their efficiency even on real physical environments, the latter s... |
2307.00758 | Wenting Tang | Wenting Tang, Xingxing Wei, Bo Li (Beijing Key Laboratory of Digital
Media, School of Computer Science and Engineering, Beihang University,
Beijing, China) | Structured Network Pruning by Measuring Filter-wise Interactions | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Structured network pruning is a practical approach to reduce computation cost
directly while retaining the CNNs' generalization performance in real
applications. However, identifying redundant filters is a core problem in
structured network pruning, and current redundancy criteria only focus on
individual filters' at... | [
{
"created": "Mon, 3 Jul 2023 05:26:05 GMT",
"version": "v1"
}
] | 2023-07-04 | [
[
"Tang",
"Wenting",
"",
"Beijing Key Laboratory of Digital\n Media, School of Computer Science and Engineering, Beihang University,\n Beijing, China"
],
[
"Wei",
"Xingxing",
"",
"Beijing Key Laboratory of Digital\n Media, School of Computer Science and Engineering, Beihang Un... | Structured network pruning is a practical approach to reduce computation cost directly while retaining the CNNs' generalization performance in real applications. However, identifying redundant filters is a core problem in structured network pruning, and current redundancy criteria only focus on individual filters' attr... |
2211.02682 | Jacob Wahlgren | Jacob Wahlgren, Maya Gokhale, Ivy B. Peng | Evaluating Emerging CXL-enabled Memory Pooling for HPC Systems | 10 pages, 13 figures. Accepted for publication in Workshop on Memory
Centric High Performance Computing (MCHPC'22) at SC22 | null | 10.1109/MCHPC56545.2022.00007 | null | cs.DC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Current HPC systems provide memory resources that are statically configured
and tightly coupled with compute nodes. However, workloads on HPC systems are
evolving. Diverse workloads lead to a need for configurable memory resources to
achieve high performance and utilization. In this study, we evaluate a memory
subsys... | [
{
"created": "Fri, 4 Nov 2022 18:03:11 GMT",
"version": "v1"
}
] | 2023-03-23 | [
[
"Wahlgren",
"Jacob",
""
],
[
"Gokhale",
"Maya",
""
],
[
"Peng",
"Ivy B.",
""
]
] | Current HPC systems provide memory resources that are statically configured and tightly coupled with compute nodes. However, workloads on HPC systems are evolving. Diverse workloads lead to a need for configurable memory resources to achieve high performance and utilization. In this study, we evaluate a memory subsyste... |
cs/0611036 | Annie Bouyer | Anne Durand (CRAI), Pierre Drap (CRAI), Elise Meyer (CRAI), Pierre
Grussenmeyer (CRAI), Jean-Pierre Perrin (CRAI) | Intra-site Level Cultural Heritage Documentation: Combination of Survey,
Modeling and Imagery Data in a Web Information System | null | null | null | null | cs.DL | null | Cultural heritage documentation induces the use of computerized techniques to
manage and preserve the information produced. Geographical information systems
have proved their potentialities in this scope, but they are not always adapted
for the management of features at the scale of a particular archaeological
site. ... | [
{
"created": "Wed, 8 Nov 2006 17:35:52 GMT",
"version": "v1"
}
] | 2007-05-23 | [
[
"Durand",
"Anne",
"",
"CRAI"
],
[
"Drap",
"Pierre",
"",
"CRAI"
],
[
"Meyer",
"Elise",
"",
"CRAI"
],
[
"Grussenmeyer",
"Pierre",
"",
"CRAI"
],
[
"Perrin",
"Jean-Pierre",
"",
"CRAI"
]
] | Cultural heritage documentation induces the use of computerized techniques to manage and preserve the information produced. Geographical information systems have proved their potentialities in this scope, but they are not always adapted for the management of features at the scale of a particular archaeological site. Mo... |
1501.04587 | Naiyan Wang | Naiyan Wang, Siyi Li, Abhinav Gupta, Dit-Yan Yeung | Transferring Rich Feature Hierarchies for Robust Visual Tracking | null | null | null | null | cs.CV cs.NE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Convolutional neural network (CNN) models have demonstrated great success in
various computer vision tasks including image classification and object
detection. However, some equally important tasks such as visual tracking remain
relatively unexplored. We believe that a major hurdle that hinders the
application of CNN... | [
{
"created": "Mon, 19 Jan 2015 18:54:34 GMT",
"version": "v1"
},
{
"created": "Thu, 23 Apr 2015 06:18:09 GMT",
"version": "v2"
}
] | 2015-04-24 | [
[
"Wang",
"Naiyan",
""
],
[
"Li",
"Siyi",
""
],
[
"Gupta",
"Abhinav",
""
],
[
"Yeung",
"Dit-Yan",
""
]
] | Convolutional neural network (CNN) models have demonstrated great success in various computer vision tasks including image classification and object detection. However, some equally important tasks such as visual tracking remain relatively unexplored. We believe that a major hurdle that hinders the application of CNN t... |
1805.02276 | Nikolaos Polatidis Dr | Elias Pimenidis, Nikolaos Polatidis, Haralambos Mouratidis | Mobile recommender systems: Identifying the major concepts | null | null | null | null | cs.IR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper identifies the factors that have an impact on mobile recommender
systems. Recommender systems have become a technology that has been widely used
by various online applications in situations where there is an information
overload problem. Numerous applications such as e-Commerce, video platforms and
social ... | [
{
"created": "Sun, 6 May 2018 20:46:55 GMT",
"version": "v1"
}
] | 2018-05-08 | [
[
"Pimenidis",
"Elias",
""
],
[
"Polatidis",
"Nikolaos",
""
],
[
"Mouratidis",
"Haralambos",
""
]
] | This paper identifies the factors that have an impact on mobile recommender systems. Recommender systems have become a technology that has been widely used by various online applications in situations where there is an information overload problem. Numerous applications such as e-Commerce, video platforms and social ne... |
1609.02368 | William Smith | Alassane Seck, William A. P. Smith, Arnaud Dessein, Bernard Tiddeman,
Hannah Dee and Abhishek Dutta | Ear-to-ear Capture of Facial Intrinsics | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We present a practical approach to capturing ear-to-ear face models
comprising both 3D meshes and intrinsic textures (i.e. diffuse and specular
albedo). Our approach is a hybrid of geometric and photometric methods and
requires no geometric calibration. Photometric measurements made in a
lightstage are used to estima... | [
{
"created": "Thu, 8 Sep 2016 10:24:44 GMT",
"version": "v1"
}
] | 2016-09-09 | [
[
"Seck",
"Alassane",
""
],
[
"Smith",
"William A. P.",
""
],
[
"Dessein",
"Arnaud",
""
],
[
"Tiddeman",
"Bernard",
""
],
[
"Dee",
"Hannah",
""
],
[
"Dutta",
"Abhishek",
""
]
] | We present a practical approach to capturing ear-to-ear face models comprising both 3D meshes and intrinsic textures (i.e. diffuse and specular albedo). Our approach is a hybrid of geometric and photometric methods and requires no geometric calibration. Photometric measurements made in a lightstage are used to estimate... |
2106.02831 | Amir Jalaly Bidgoly | Fahimeh Soltaninejad, Amir Jalaly Bidgoly | A novel method for recommendation systems using invasive weed
optimization | null | null | null | null | cs.IR | http://creativecommons.org/licenses/by/4.0/ | One of the popular approaches in recommendation systems is Collaborative
Filtering (CF). The most significant step in CF is choosing the appropriate set
of users. For this purpose, similarity measures are usually used for computing
the similarity between a specific user and the other users. This paper proposes
a new ... | [
{
"created": "Sat, 5 Jun 2021 08:12:41 GMT",
"version": "v1"
}
] | 2021-06-08 | [
[
"Soltaninejad",
"Fahimeh",
""
],
[
"Bidgoly",
"Amir Jalaly",
""
]
] | One of the popular approaches in recommendation systems is Collaborative Filtering (CF). The most significant step in CF is choosing the appropriate set of users. For this purpose, similarity measures are usually used for computing the similarity between a specific user and the other users. This paper proposes a new in... |
1106.4213 | Erlin Yao | Erlin Yao, Mingyu Chen, Rui Wang, Wenli Zhang, Guangming Tan | A New and Efficient Algorithm-Based Fault Tolerance Scheme for A Million
Way Parallelism | 11 pages, 8 figures, 1 table, submitted to conference SC 2011 | null | null | null | cs.DC | http://creativecommons.org/licenses/by-nc-sa/3.0/ | Fault tolerance overhead of high performance computing (HPC) applications is
becoming critical to the efficient utilization of HPC systems at large scale.
HPC applications typically tolerate fail-stop failures by checkpointing.
Another promising method is in the algorithm level, called algorithmic
recovery. These two... | [
{
"created": "Tue, 21 Jun 2011 14:24:43 GMT",
"version": "v1"
}
] | 2011-06-22 | [
[
"Yao",
"Erlin",
""
],
[
"Chen",
"Mingyu",
""
],
[
"Wang",
"Rui",
""
],
[
"Zhang",
"Wenli",
""
],
[
"Tan",
"Guangming",
""
]
] | Fault tolerance overhead of high performance computing (HPC) applications is becoming critical to the efficient utilization of HPC systems at large scale. HPC applications typically tolerate fail-stop failures by checkpointing. Another promising method is in the algorithm level, called algorithmic recovery. These two m... |
2406.11505 | Gustavo Escobedo | Gustavo Escobedo, Marta Moscati, Peter Muellner, Simone Kopeinik,
Dominik Kowald, Elisabeth Lex and Markus Schedl | Making Alice Appear Like Bob: A Probabilistic Preference Obfuscation
Method For Implicit Feedback Recommendation Models | null | null | null | null | cs.IR | http://creativecommons.org/licenses/by/4.0/ | Users' interaction or preference data used in recommender systems carry the
risk of unintentionally revealing users' private attributes (e.g., gender or
race). This risk becomes particularly concerning when the training data
contains user preferences that can be used to infer these attributes,
especially if they alig... | [
{
"created": "Mon, 17 Jun 2024 13:05:36 GMT",
"version": "v1"
}
] | 2024-06-18 | [
[
"Escobedo",
"Gustavo",
""
],
[
"Moscati",
"Marta",
""
],
[
"Muellner",
"Peter",
""
],
[
"Kopeinik",
"Simone",
""
],
[
"Kowald",
"Dominik",
""
],
[
"Lex",
"Elisabeth",
""
],
[
"Schedl",
"Markus",
""
]
] | Users' interaction or preference data used in recommender systems carry the risk of unintentionally revealing users' private attributes (e.g., gender or race). This risk becomes particularly concerning when the training data contains user preferences that can be used to infer these attributes, especially if they align ... |
2210.17111 | Tongyue He | Tongyue He, Yiming Chen, Junxin Chen, Wei Wang, Yicong Zhou | SEVGGNet-LSTM: a fused deep learning model for ECG classification | null | null | null | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper presents a fused deep learning algorithm for ECG classification.
It takes advantages of the combined convolutional and recurrent neural network
for ECG classification, and the weight allocation capability of attention
mechanism. The input ECG signals are firstly segmented and normalized, and then
fed into ... | [
{
"created": "Mon, 31 Oct 2022 07:36:48 GMT",
"version": "v1"
}
] | 2022-11-01 | [
[
"He",
"Tongyue",
""
],
[
"Chen",
"Yiming",
""
],
[
"Chen",
"Junxin",
""
],
[
"Wang",
"Wei",
""
],
[
"Zhou",
"Yicong",
""
]
] | This paper presents a fused deep learning algorithm for ECG classification. It takes advantages of the combined convolutional and recurrent neural network for ECG classification, and the weight allocation capability of attention mechanism. The input ECG signals are firstly segmented and normalized, and then fed into th... |
2104.13114 | Chaosheng Dong | Chaosheng Dong, Xiaojie Jin, Weihao Gao, Yijia Wang, Hongyi Zhang,
Xiang Wu, Jianchao Yang, Xiaobing Liu | One Backward from Ten Forward, Subsampling for Large-Scale Deep Learning | 13 pages | null | null | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Deep learning models in large-scale machine learning systems are often
continuously trained with enormous data from production environments. The sheer
volume of streaming training data poses a significant challenge to real-time
training subsystems and ad-hoc sampling is the standard practice. Our key
insight is that ... | [
{
"created": "Tue, 27 Apr 2021 11:29:02 GMT",
"version": "v1"
}
] | 2021-04-28 | [
[
"Dong",
"Chaosheng",
""
],
[
"Jin",
"Xiaojie",
""
],
[
"Gao",
"Weihao",
""
],
[
"Wang",
"Yijia",
""
],
[
"Zhang",
"Hongyi",
""
],
[
"Wu",
"Xiang",
""
],
[
"Yang",
"Jianchao",
""
],
[
"Liu",
"Xia... | Deep learning models in large-scale machine learning systems are often continuously trained with enormous data from production environments. The sheer volume of streaming training data poses a significant challenge to real-time training subsystems and ad-hoc sampling is the standard practice. Our key insight is that th... |
2302.06541 | Maximilian Mozes | Maximilian Mozes, Jessica Hoffmann, Katrin Tomanek, Muhamed Kouate,
Nithum Thain, Ann Yuan, Tolga Bolukbasi, Lucas Dixon | Towards Agile Text Classifiers for Everyone | Findings of EMNLP 2023 | null | null | null | cs.CL | http://creativecommons.org/licenses/by/4.0/ | Text-based safety classifiers are widely used for content moderation and
increasingly to tune generative language model behavior - a topic of growing
concern for the safety of digital assistants and chatbots. However, different
policies require different classifiers, and safety policies themselves improve
from iterat... | [
{
"created": "Mon, 13 Feb 2023 17:34:13 GMT",
"version": "v1"
},
{
"created": "Sat, 21 Oct 2023 11:49:09 GMT",
"version": "v2"
}
] | 2023-10-24 | [
[
"Mozes",
"Maximilian",
""
],
[
"Hoffmann",
"Jessica",
""
],
[
"Tomanek",
"Katrin",
""
],
[
"Kouate",
"Muhamed",
""
],
[
"Thain",
"Nithum",
""
],
[
"Yuan",
"Ann",
""
],
[
"Bolukbasi",
"Tolga",
""
],
[
... | Text-based safety classifiers are widely used for content moderation and increasingly to tune generative language model behavior - a topic of growing concern for the safety of digital assistants and chatbots. However, different policies require different classifiers, and safety policies themselves improve from iteratio... |
2107.04953 | Jonathan Stray | Jonathan Stray | Designing Recommender Systems to Depolarize | to appear in First Monday, September 2021 | null | null | null | cs.IR cs.CY cs.SI | http://creativecommons.org/licenses/by-nc-nd/4.0/ | Polarization is implicated in the erosion of democracy and the progression to
violence, which makes the polarization properties of large algorithmic content
selection systems (recommender systems) a matter of concern for peace and
security. While algorithm-driven social media does not seem to be a primary
driver of p... | [
{
"created": "Sun, 11 Jul 2021 03:23:42 GMT",
"version": "v1"
}
] | 2021-07-13 | [
[
"Stray",
"Jonathan",
""
]
] | Polarization is implicated in the erosion of democracy and the progression to violence, which makes the polarization properties of large algorithmic content selection systems (recommender systems) a matter of concern for peace and security. While algorithm-driven social media does not seem to be a primary driver of pol... |
1904.02228 | Peter Potash | Peter Potash | The Effect of Downstream Classification Tasks for Evaluating Sentence
Embeddings | 5 pages | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | One popular method for quantitatively evaluating the utility of sentence
embeddings involves using them in downstream language processing tasks that
require sentence representations as input. One simple such task is
classification, where the sentence representations are used to train and test
models on several classi... | [
{
"created": "Wed, 3 Apr 2019 20:12:10 GMT",
"version": "v1"
},
{
"created": "Mon, 27 May 2019 14:10:45 GMT",
"version": "v2"
}
] | 2019-05-28 | [
[
"Potash",
"Peter",
""
]
] | One popular method for quantitatively evaluating the utility of sentence embeddings involves using them in downstream language processing tasks that require sentence representations as input. One simple such task is classification, where the sentence representations are used to train and test models on several classifi... |
1209.1738 | Lukasz Kaiser | Diana Fischer (RWTH Aachen), Lukasz Kaiser (CNRS and LIAFA, Universite
Paris Diderot) | Model Checking the Quantitative mu-Calculus on Linear Hybrid Systems | LMCS submission | Logical Methods in Computer Science, Volume 8, Issue 3 (September
20, 2012) lmcs:760 | 10.2168/LMCS-8(3:21)2012 | null | cs.LO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We study the model-checking problem for a quantitative extension of the modal
mu-calculus on a class of hybrid systems. Qualitative model checking has been
proved decidable and implemented for several classes of systems, but this is
not the case for quantitative questions that arise naturally in this context.
Recentl... | [
{
"created": "Sat, 8 Sep 2012 18:22:30 GMT",
"version": "v1"
},
{
"created": "Wed, 19 Sep 2012 09:08:44 GMT",
"version": "v2"
}
] | 2015-07-01 | [
[
"Fischer",
"Diana",
"",
"RWTH Aachen"
],
[
"Kaiser",
"Lukasz",
"",
"CNRS and LIAFA, Universite\n Paris Diderot"
]
] | We study the model-checking problem for a quantitative extension of the modal mu-calculus on a class of hybrid systems. Qualitative model checking has been proved decidable and implemented for several classes of systems, but this is not the case for quantitative questions that arise naturally in this context. Recently,... |
2307.14541 | Cristina Gena | Davide D'Adamo, Emiliano Robert, Cristina Gena, Silvestro Roatta | Novel BCI paradigm for ALS patients based on EEG and Pupillary
Accommodative Response | null | null | null | null | cs.HC | http://creativecommons.org/licenses/by/4.0/ | Brain-computer interfaces (BCIs) are one of the few alternatives to enable
locked-in syndrome (LIS) patients to communicate with the external world, while
they are the only solution for complete locked-in syndrome (CLIS) patients, who
lost the ability to control eye movements. However, successful usage of
endogenous ... | [
{
"created": "Wed, 26 Jul 2023 23:15:50 GMT",
"version": "v1"
}
] | 2023-07-28 | [
[
"D'Adamo",
"Davide",
""
],
[
"Robert",
"Emiliano",
""
],
[
"Gena",
"Cristina",
""
],
[
"Roatta",
"Silvestro",
""
]
] | Brain-computer interfaces (BCIs) are one of the few alternatives to enable locked-in syndrome (LIS) patients to communicate with the external world, while they are the only solution for complete locked-in syndrome (CLIS) patients, who lost the ability to control eye movements. However, successful usage of endogenous el... |
2312.13462 | Gunnar Kudrjavets | Gunnar Kudrjavets (University of Groningen), Aditya Kumar (Google),
Jeff Thomas (Meta Platforms, Inc.), Ayushi Rastogi (University of Groningen) | What Do You Mean by Memory? When Engineers Are Lost in the Maze of
Complexity | 3 pages. To be published in the 46th International Conference on
Software Engineering (ICSE 2024), April 14 - April 20 2024, Lisbon, Portugal | null | 10.1145/3639477.3639735 | null | cs.SE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | An accepted practice to decrease applications' memory usage is to reduce the
amount and frequency of memory allocations. Factors such as (a) the prevalence
of out-of-memory (OOM) killers, (b) memory allocations in modern programming
languages done implicitly, (c) overcommitting being a default strategy in the
Linux k... | [
{
"created": "Wed, 20 Dec 2023 22:26:15 GMT",
"version": "v1"
}
] | 2024-01-09 | [
[
"Kudrjavets",
"Gunnar",
"",
"University of Groningen"
],
[
"Kumar",
"Aditya",
"",
"Google"
],
[
"Thomas",
"Jeff",
"",
"Meta Platforms, Inc."
],
[
"Rastogi",
"Ayushi",
"",
"University of Groningen"
]
] | An accepted practice to decrease applications' memory usage is to reduce the amount and frequency of memory allocations. Factors such as (a) the prevalence of out-of-memory (OOM) killers, (b) memory allocations in modern programming languages done implicitly, (c) overcommitting being a default strategy in the Linux ker... |
2310.00981 | Xixi Lu | Bart J. Verhoef and Xixi Lu | Using Reinforcement Learning to Optimize Responses in Care Processes: A
Case Study on Aggression Incidents | null | null | null | null | cs.AI cs.LG | http://creativecommons.org/licenses/by/4.0/ | Previous studies have used prescriptive process monitoring to find actionable
policies in business processes and conducted case studies in similar domains,
such as the loan application process and the traffic fine process. However,
care processes tend to be more dynamic and complex. For example, at any stage
of a car... | [
{
"created": "Mon, 2 Oct 2023 08:43:29 GMT",
"version": "v1"
}
] | 2023-10-03 | [
[
"Verhoef",
"Bart J.",
""
],
[
"Lu",
"Xixi",
""
]
] | Previous studies have used prescriptive process monitoring to find actionable policies in business processes and conducted case studies in similar domains, such as the loan application process and the traffic fine process. However, care processes tend to be more dynamic and complex. For example, at any stage of a care ... |
1512.00524 | Marc Juarez | Marc Juarez, Mohsen Imani, Mike Perry, Claudia Diaz, Matthew Wright | Toward an Efficient Website Fingerprinting Defense | To appear In the proceedings of the European Symposium on Research in
Computer Security (ESORICS), pp. 20, Springer, 2016 | null | null | null | cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Website Fingerprinting attacks enable a passive eavesdropper to recover the
user's otherwise anonymized web browsing activity by matching the observed
traffic with prerecorded web traffic templates. The defenses that have been
proposed to counter these attacks are impractical for deployment in real-world
systems due ... | [
{
"created": "Wed, 2 Dec 2015 00:14:16 GMT",
"version": "v1"
},
{
"created": "Mon, 28 Mar 2016 19:25:56 GMT",
"version": "v2"
},
{
"created": "Tue, 19 Jul 2016 10:18:51 GMT",
"version": "v3"
}
] | 2016-07-20 | [
[
"Juarez",
"Marc",
""
],
[
"Imani",
"Mohsen",
""
],
[
"Perry",
"Mike",
""
],
[
"Diaz",
"Claudia",
""
],
[
"Wright",
"Matthew",
""
]
] | Website Fingerprinting attacks enable a passive eavesdropper to recover the user's otherwise anonymized web browsing activity by matching the observed traffic with prerecorded web traffic templates. The defenses that have been proposed to counter these attacks are impractical for deployment in real-world systems due to... |
1601.05900 | Jarrod Moore | Margareta Ackerman and Jarrod Moore | When is Clustering Perturbation Robust? | null | null | null | null | cs.LG cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Clustering is a fundamental data mining tool that aims to divide data into
groups of similar items. Generally, intuition about clustering reflects the
ideal case -- exact data sets endowed with flawless dissimilarity between
individual instances.
In practice however, these cases are in the minority, and clustering
... | [
{
"created": "Fri, 22 Jan 2016 08:01:58 GMT",
"version": "v1"
}
] | 2016-01-25 | [
[
"Ackerman",
"Margareta",
""
],
[
"Moore",
"Jarrod",
""
]
] | Clustering is a fundamental data mining tool that aims to divide data into groups of similar items. Generally, intuition about clustering reflects the ideal case -- exact data sets endowed with flawless dissimilarity between individual instances. In practice however, these cases are in the minority, and clustering appl... |
2202.13990 | Maxime Bombar | Maxime Bombar and Alain Couvreur and Thomas Debris-Alazard | On Codes and Learning With Errors over Function Fields | null | null | null | null | cs.CR math.NT | http://creativecommons.org/licenses/by/4.0/ | It is a long standing open problem to find search to decision reductions for
structured versions of the decoding problem of linear codes. Such results in
the lattice-based setting have been carried out using number fields:
Polynomial-LWE, Ring-LWE, Module-LWE and so on. We propose a function field
version of the LWE ... | [
{
"created": "Mon, 28 Feb 2022 17:43:59 GMT",
"version": "v1"
}
] | 2022-03-01 | [
[
"Bombar",
"Maxime",
""
],
[
"Couvreur",
"Alain",
""
],
[
"Debris-Alazard",
"Thomas",
""
]
] | It is a long standing open problem to find search to decision reductions for structured versions of the decoding problem of linear codes. Such results in the lattice-based setting have been carried out using number fields: Polynomial-LWE, Ring-LWE, Module-LWE and so on. We propose a function field version of the LWE pr... |
2403.08161 | Zhonglin Sun | Zhonglin Sun, Chen Feng, Ioannis Patras, Georgios Tzimiropoulos | LAFS: Landmark-based Facial Self-supervised Learning for Face
Recognition | accepted to CVPR 2024 | null | null | null | cs.CV cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this work we focus on learning facial representations that can be adapted
to train effective face recognition models, particularly in the absence of
labels. Firstly, compared with existing labelled face datasets, a vastly larger
magnitude of unlabeled faces exists in the real world. We explore the learning
strateg... | [
{
"created": "Wed, 13 Mar 2024 01:07:55 GMT",
"version": "v1"
}
] | 2024-03-14 | [
[
"Sun",
"Zhonglin",
""
],
[
"Feng",
"Chen",
""
],
[
"Patras",
"Ioannis",
""
],
[
"Tzimiropoulos",
"Georgios",
""
]
] | In this work we focus on learning facial representations that can be adapted to train effective face recognition models, particularly in the absence of labels. Firstly, compared with existing labelled face datasets, a vastly larger magnitude of unlabeled faces exists in the real world. We explore the learning strategy ... |
2210.01266 | Benjamin Th\'erien | Benjamin Th\'erien and Krzysztof Czarnecki | Interpretable Deep Tracking | null | null | null | null | cs.CV cs.AI cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Imagine experiencing a crash as the passenger of an autonomous vehicle.
Wouldn't you want to know why it happened? Current end-to-end optimizable deep
neural networks (DNNs) in 3D detection, multi-object tracking, and motion
forecasting provide little to no explanations about how they make their
decisions. To help br... | [
{
"created": "Mon, 3 Oct 2022 23:15:13 GMT",
"version": "v1"
}
] | 2022-10-05 | [
[
"Thérien",
"Benjamin",
""
],
[
"Czarnecki",
"Krzysztof",
""
]
] | Imagine experiencing a crash as the passenger of an autonomous vehicle. Wouldn't you want to know why it happened? Current end-to-end optimizable deep neural networks (DNNs) in 3D detection, multi-object tracking, and motion forecasting provide little to no explanations about how they make their decisions. To help brid... |
2310.02550 | Wanli Ni | Jianyang Ren, Wanli Ni, Hui Tian, Gaofeng Nie | Convergence Analysis and Latency Minimization for Semi-Federated
Learning in Massive IoT Networks | This paper has been accepted by IEEE Transactions on Green
Communications and Networking | null | 10.1109/TGCN.2023.3309657 | null | cs.IT eess.SP math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | As the number of sensors becomes massive in Internet of Things (IoT)
networks, the amount of data is humongous. To process data in real-time while
protecting user privacy, federated learning (FL) has been regarded as an
enabling technique to push edge intelligence into IoT networks with massive
devices. However, FL l... | [
{
"created": "Wed, 4 Oct 2023 03:18:29 GMT",
"version": "v1"
}
] | 2023-10-05 | [
[
"Ren",
"Jianyang",
""
],
[
"Ni",
"Wanli",
""
],
[
"Tian",
"Hui",
""
],
[
"Nie",
"Gaofeng",
""
]
] | As the number of sensors becomes massive in Internet of Things (IoT) networks, the amount of data is humongous. To process data in real-time while protecting user privacy, federated learning (FL) has been regarded as an enabling technique to push edge intelligence into IoT networks with massive devices. However, FL lat... |
1004.3258 | Vishal Goyal | A. Mosavi | Multiple Criteria Decision-Making Preprocessing Using Data Mining Tools | International Journal of Computer Science Issues at
http://ijcsi.org/articles/Multiple-Criteria-Decision-Making-Preprocessing-Using-Data-Mining-Tools.php | IJCSI, Volume 7, Issue 2, March 2010 | null | null | cs.SE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Real-life engineering optimization problems need Multiobjective Optimization
(MOO) tools. These problems are highly nonlinear. As the process of Multiple
Criteria Decision-Making (MCDM) is much expanded most MOO problems in different
disciplines can be classified on the basis of it. Thus MCDM methods have gained
wide... | [
{
"created": "Mon, 19 Apr 2010 17:53:38 GMT",
"version": "v1"
}
] | 2010-04-20 | [
[
"Mosavi",
"A.",
""
]
] | Real-life engineering optimization problems need Multiobjective Optimization (MOO) tools. These problems are highly nonlinear. As the process of Multiple Criteria Decision-Making (MCDM) is much expanded most MOO problems in different disciplines can be classified on the basis of it. Thus MCDM methods have gained wide p... |
2011.00718 | Song Fang | Song Fang and Quanyan Zhu | Fundamental Limits of Obfuscation for Linear Gaussian Dynamical Systems:
An Information-Theoretic Approach | arXiv admin note: text overlap with arXiv:2008.04893 | null | null | null | cs.IT cs.CR cs.LG cs.SY eess.SP eess.SY math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we study the fundamental limits of obfuscation in terms of
privacy-distortion tradeoffs for linear Gaussian dynamical systems via an
information-theoretic approach. Particularly, we obtain analytical formulas
that capture the fundamental privacy-distortion tradeoffs when privacy masks
are to be added t... | [
{
"created": "Thu, 29 Oct 2020 20:05:50 GMT",
"version": "v1"
}
] | 2020-11-03 | [
[
"Fang",
"Song",
""
],
[
"Zhu",
"Quanyan",
""
]
] | In this paper, we study the fundamental limits of obfuscation in terms of privacy-distortion tradeoffs for linear Gaussian dynamical systems via an information-theoretic approach. Particularly, we obtain analytical formulas that capture the fundamental privacy-distortion tradeoffs when privacy masks are to be added to ... |
2112.10065 | Seo Jin Park | Seo Jin Park, Joshua Fried, Sunghyun Kim, Mohammad Alizadeh, Adam
Belay | Efficient Strong Scaling Through Burst Parallel Training | MLSys'22 | null | null | null | cs.DC cs.CV cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | As emerging deep neural network (DNN) models continue to grow in size, using
large GPU clusters to train DNNs is becoming an essential requirement to
achieving acceptable training times. In this paper, we consider the case where
future increases in cluster size will cause the global batch size that can be
used to tra... | [
{
"created": "Sun, 19 Dec 2021 05:18:39 GMT",
"version": "v1"
},
{
"created": "Sat, 19 Mar 2022 01:54:37 GMT",
"version": "v2"
},
{
"created": "Mon, 23 May 2022 20:51:22 GMT",
"version": "v3"
}
] | 2022-05-25 | [
[
"Park",
"Seo Jin",
""
],
[
"Fried",
"Joshua",
""
],
[
"Kim",
"Sunghyun",
""
],
[
"Alizadeh",
"Mohammad",
""
],
[
"Belay",
"Adam",
""
]
] | As emerging deep neural network (DNN) models continue to grow in size, using large GPU clusters to train DNNs is becoming an essential requirement to achieving acceptable training times. In this paper, we consider the case where future increases in cluster size will cause the global batch size that can be used to train... |
2302.06433 | Emadeldeen Eldele | Emadeldeen Eldele, Mohamed Ragab, Zhenghua Chen, Min Wu, Chee-Keong
Kwoh, Xiaoli Li | Label-efficient Time Series Representation Learning: A Review | Accepted in the IEEE Transactions on Artificial Intelligence (TAI)
https://ieeexplore.ieee.org/document/10601520 | null | 10.1109/TAI.2024.3430236 | null | cs.LG | http://creativecommons.org/licenses/by/4.0/ | Label-efficient time series representation learning, which aims to learn
effective representations with limited labeled data, is crucial for deploying
deep learning models in real-world applications. To address the scarcity of
labeled time series data, various strategies, e.g., transfer learning,
self-supervised lear... | [
{
"created": "Mon, 13 Feb 2023 15:12:15 GMT",
"version": "v1"
},
{
"created": "Tue, 15 Aug 2023 05:09:29 GMT",
"version": "v2"
},
{
"created": "Mon, 26 Feb 2024 03:27:46 GMT",
"version": "v3"
},
{
"created": "Wed, 24 Jul 2024 03:43:32 GMT",
"version": "v4"
}
] | 2024-07-25 | [
[
"Eldele",
"Emadeldeen",
""
],
[
"Ragab",
"Mohamed",
""
],
[
"Chen",
"Zhenghua",
""
],
[
"Wu",
"Min",
""
],
[
"Kwoh",
"Chee-Keong",
""
],
[
"Li",
"Xiaoli",
""
]
] | Label-efficient time series representation learning, which aims to learn effective representations with limited labeled data, is crucial for deploying deep learning models in real-world applications. To address the scarcity of labeled time series data, various strategies, e.g., transfer learning, self-supervised learni... |
1808.09406 | Dominik Peters | Vittorio Bil\`o, Ioannis Caragiannis, Michele Flammini, Ayumi
Igarashi, Gianpiero Monaco, Dominik Peters, Cosimo Vinci, William S. Zwicker | Almost Envy-Free Allocations with Connected Bundles | Accepted journal version | Games and Economic Behavior, 131:197-221, 2022 | 10.1016/j.geb.2021.11.006 | null | cs.GT econ.TH | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We study the existence of allocations of indivisible goods that are envy-free
up to one good (EF1), under the additional constraint that each bundle needs to
be connected in an underlying item graph. If the graph is a path and the
utility functions are monotonic over bundles, we show the existence of EF1
allocations ... | [
{
"created": "Tue, 28 Aug 2018 16:57:17 GMT",
"version": "v1"
},
{
"created": "Fri, 20 May 2022 16:09:32 GMT",
"version": "v2"
}
] | 2022-05-23 | [
[
"Bilò",
"Vittorio",
""
],
[
"Caragiannis",
"Ioannis",
""
],
[
"Flammini",
"Michele",
""
],
[
"Igarashi",
"Ayumi",
""
],
[
"Monaco",
"Gianpiero",
""
],
[
"Peters",
"Dominik",
""
],
[
"Vinci",
"Cosimo",
""
... | We study the existence of allocations of indivisible goods that are envy-free up to one good (EF1), under the additional constraint that each bundle needs to be connected in an underlying item graph. If the graph is a path and the utility functions are monotonic over bundles, we show the existence of EF1 allocations fo... |
1410.5010 | Georg Hager | Holger Stengel, Jan Treibig, Georg Hager, Gerhard Wellein | Quantifying performance bottlenecks of stencil computations using the
Execution-Cache-Memory model | 10 pages, 8 figures. Added Roofline comparison and other minor
improvements | null | 10.1145/2751205.2751240 | null | cs.PF cs.DC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Stencil algorithms on regular lattices appear in many fields of computational
science, and much effort has been put into optimized implementations. Such
activities are usually not guided by performance models that provide estimates
of expected speedup. Understanding the performance properties and bottlenecks
by perfo... | [
{
"created": "Sat, 18 Oct 2014 21:49:45 GMT",
"version": "v1"
},
{
"created": "Sat, 17 Jan 2015 14:07:26 GMT",
"version": "v2"
}
] | 2016-01-28 | [
[
"Stengel",
"Holger",
""
],
[
"Treibig",
"Jan",
""
],
[
"Hager",
"Georg",
""
],
[
"Wellein",
"Gerhard",
""
]
] | Stencil algorithms on regular lattices appear in many fields of computational science, and much effort has been put into optimized implementations. Such activities are usually not guided by performance models that provide estimates of expected speedup. Understanding the performance properties and bottlenecks by perform... |
2209.10948 | Robin Zbinden | Robin Zbinden | Implementing and Experimenting with Diffusion Models for Text-to-Image
Generation | Master's Thesis | null | null | null | cs.CV cs.LG | http://creativecommons.org/licenses/by/4.0/ | Taking advantage of the many recent advances in deep learning, text-to-image
generative models currently have the merit of attracting the general public
attention. Two of these models, DALL-E 2 and Imagen, have demonstrated that
highly photorealistic images could be generated from a simple textual
description of an i... | [
{
"created": "Thu, 22 Sep 2022 12:03:33 GMT",
"version": "v1"
}
] | 2022-09-23 | [
[
"Zbinden",
"Robin",
""
]
] | Taking advantage of the many recent advances in deep learning, text-to-image generative models currently have the merit of attracting the general public attention. Two of these models, DALL-E 2 and Imagen, have demonstrated that highly photorealistic images could be generated from a simple textual description of an ima... |
1506.07077 | Carmelo Cascone | Carmelo Cascone, Luca Pollini, Davide Sanvito, Antonio Capone | Traffic Management Applications for Stateful SDN Data Plane | 6 pages, 9 figures | null | null | null | cs.NI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The successful OpenFlow approach to Software Defined Networking (SDN) allows
network programmability through a central controller able to orchestrate a set
of dumb switches. However, the simple match/action abstraction of OpenFlow
switches constrains the evolution of the forwarding rules to be fully managed
by the co... | [
{
"created": "Tue, 23 Jun 2015 16:22:48 GMT",
"version": "v1"
},
{
"created": "Mon, 31 Aug 2015 16:38:42 GMT",
"version": "v2"
}
] | 2015-09-01 | [
[
"Cascone",
"Carmelo",
""
],
[
"Pollini",
"Luca",
""
],
[
"Sanvito",
"Davide",
""
],
[
"Capone",
"Antonio",
""
]
] | The successful OpenFlow approach to Software Defined Networking (SDN) allows network programmability through a central controller able to orchestrate a set of dumb switches. However, the simple match/action abstraction of OpenFlow switches constrains the evolution of the forwarding rules to be fully managed by the cont... |
1903.02938 | Farhad Farzbod | Farhad Farzbod, Onome E. Scott-Emuakpor | Force Analysis for Interactions beyond the Closest Neighbor in a
Periodic Structure | null | null | null | null | cs.CE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Periodic structures are a type of metamaterials in which their physical
properties not only depend on the unit cell materials but also the way unit
cells are arranged and interact with each other. Periodic structure have
Interesting wave propagation properties making them suitable materials for
acoustic filters and w... | [
{
"created": "Tue, 5 Mar 2019 04:10:11 GMT",
"version": "v1"
}
] | 2019-03-08 | [
[
"Farzbod",
"Farhad",
""
],
[
"Scott-Emuakpor",
"Onome E.",
""
]
] | Periodic structures are a type of metamaterials in which their physical properties not only depend on the unit cell materials but also the way unit cells are arranged and interact with each other. Periodic structure have Interesting wave propagation properties making them suitable materials for acoustic filters and wav... |
2109.12703 | Bailian Chen | Bailian Chen, Dylan R. Harp, Yingqi Zhang, Curtis M. Oldenburg, Rajesh
J. Pawar | Dynamic Risk Assessment for Geologic CO2 Sequestration | 28 pages, 9 figures | null | null | null | cs.IT cs.NA math.IT math.NA | http://creativecommons.org/licenses/by/4.0/ | At a geologic CO2 sequestration (GCS) site, geologic uncertainty usually
leads to large uncertainty in the predictions of properties that influence
metrics for leakage risk assessment, such as CO2 saturations and pressures in
potentially leaky wellbores, CO2/brine leakage rates, and leakage consequences
such as chang... | [
{
"created": "Sun, 26 Sep 2021 20:52:20 GMT",
"version": "v1"
}
] | 2021-09-28 | [
[
"Chen",
"Bailian",
""
],
[
"Harp",
"Dylan R.",
""
],
[
"Zhang",
"Yingqi",
""
],
[
"Oldenburg",
"Curtis M.",
""
],
[
"Pawar",
"Rajesh J.",
""
]
] | At a geologic CO2 sequestration (GCS) site, geologic uncertainty usually leads to large uncertainty in the predictions of properties that influence metrics for leakage risk assessment, such as CO2 saturations and pressures in potentially leaky wellbores, CO2/brine leakage rates, and leakage consequences such as changes... |
1212.6375 | \'Oscar C. V\'asquez | Oscar C. V\'asquez | Energy in computing systems with speed scaling: optimization and
mechanisms design | null | null | null | null | cs.GT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We study a simple scheduling game for the speed scaling model. Players want
their job to complete early, which however generates a big energy consumption.
We address the game from the mechanism design side, and by charging the energy
usage to the players we seek for a good compromize between quality of service
and en... | [
{
"created": "Thu, 27 Dec 2012 14:11:28 GMT",
"version": "v1"
}
] | 2013-01-01 | [
[
"Vásquez",
"Oscar C.",
""
]
] | We study a simple scheduling game for the speed scaling model. Players want their job to complete early, which however generates a big energy consumption. We address the game from the mechanism design side, and by charging the energy usage to the players we seek for a good compromize between quality of service and ener... |
2408.01272 | Xinhuan Shu | Xinhuan Shu, Alexis Pister, Junxiu Tang, Fanny Chevalier, Benjamin
Bach | Does This Have a Particular Meaning? Interactive Pattern Explanation for
Network Visualizations | to be published in IEEE VIS 2024 | null | null | null | cs.HC | http://creativecommons.org/licenses/by/4.0/ | This paper presents an interactive technique to explain visual patterns in
network visualizations to analysts who do not understand these visualizations
and who are learning to read them. Learning a visualization requires mastering
its visual grammar and decoding information presented through visual marks,
graphical ... | [
{
"created": "Fri, 2 Aug 2024 13:50:15 GMT",
"version": "v1"
}
] | 2024-08-05 | [
[
"Shu",
"Xinhuan",
""
],
[
"Pister",
"Alexis",
""
],
[
"Tang",
"Junxiu",
""
],
[
"Chevalier",
"Fanny",
""
],
[
"Bach",
"Benjamin",
""
]
] | This paper presents an interactive technique to explain visual patterns in network visualizations to analysts who do not understand these visualizations and who are learning to read them. Learning a visualization requires mastering its visual grammar and decoding information presented through visual marks, graphical en... |
1609.09544 | Shuchin Aeron | Josh Girson and Shuchin Aeron | Algorithms for item categorization based on ordinal ranking data | To appear in IEEE Allerton conference on computing, communications
and control, 2016 | null | null | null | cs.LG cs.SI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We present a new method for identifying the latent categorization of items
based on their rankings. Complimenting a recent work that uses a Dirichlet
prior on preference vectors and variational inference, we show that this
problem can be effectively dealt with using existing community detection
algorithms, with the c... | [
{
"created": "Thu, 29 Sep 2016 22:59:45 GMT",
"version": "v1"
}
] | 2016-10-03 | [
[
"Girson",
"Josh",
""
],
[
"Aeron",
"Shuchin",
""
]
] | We present a new method for identifying the latent categorization of items based on their rankings. Complimenting a recent work that uses a Dirichlet prior on preference vectors and variational inference, we show that this problem can be effectively dealt with using existing community detection algorithms, with the com... |
1609.00483 | Sheng Zhou | Weisi Guo, Sheng Zhou, Yunfei Chen, Siyi Wang, Xiaoli Chu, Zhisheng
Niu | Simultaneous Information and Energy Flow for IoT Relay Systems with
Crowd Harvesting | to appear in IEEE Communications Magazine | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | It is expected that the number of wireless devices will grow rapidly over the
next few years due to the growing proliferation of Internet-of-Things (IoT). In
order to improve the energy efficiency of information transfer between small
devices, we review state-of-the-art research in simultaneous wireless energy
and in... | [
{
"created": "Fri, 2 Sep 2016 07:10:32 GMT",
"version": "v1"
}
] | 2016-09-05 | [
[
"Guo",
"Weisi",
""
],
[
"Zhou",
"Sheng",
""
],
[
"Chen",
"Yunfei",
""
],
[
"Wang",
"Siyi",
""
],
[
"Chu",
"Xiaoli",
""
],
[
"Niu",
"Zhisheng",
""
]
] | It is expected that the number of wireless devices will grow rapidly over the next few years due to the growing proliferation of Internet-of-Things (IoT). In order to improve the energy efficiency of information transfer between small devices, we review state-of-the-art research in simultaneous wireless energy and info... |
2209.08649 | Himarsha R Jayanetti | Himarsha R. Jayanetti, Shawn M. Jones, Martin Klein, Alex Osbourne,
Paul Koerbin, Michael L. Nelson, Michele C. Weigle | Creating Structure in Web Archives With Collections: Different Concepts
From Web Archivists | 5 figures, 16 pages, accepted for publication at TPDL 2022 | null | null | null | cs.DL | http://creativecommons.org/licenses/by-nc-sa/4.0/ | As web archives' holdings grow, archivists subdivide them into collections so
they are easier to understand and manage. In this work, we review the
collection structures of eight web archive platforms: : Archive-It, Conifer,
the Croatian Web Archive (HAW), the Internet Archive's user account web
archives, Library of ... | [
{
"created": "Sun, 18 Sep 2022 20:31:25 GMT",
"version": "v1"
}
] | 2022-09-20 | [
[
"Jayanetti",
"Himarsha R.",
""
],
[
"Jones",
"Shawn M.",
""
],
[
"Klein",
"Martin",
""
],
[
"Osbourne",
"Alex",
""
],
[
"Koerbin",
"Paul",
""
],
[
"Nelson",
"Michael L.",
""
],
[
"Weigle",
"Michele C.",
""
... | As web archives' holdings grow, archivists subdivide them into collections so they are easier to understand and manage. In this work, we review the collection structures of eight web archive platforms: : Archive-It, Conifer, the Croatian Web Archive (HAW), the Internet Archive's user account web archives, Library of Co... |
1912.12421 | Ying Cui | Wei Xu, Ying Cui, Zhi Liu and Haoran Li | Optimal Multi-View Video Transmission in OFDMA Systems | to be appear in IEEE Communications Letters | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this letter, we study the transmission of a multi-view video (MVV) to
multiple users in an Orthogonal Frequency Division Multiple Access (OFDMA)
system. To maximally improve transmission efficiency, we exploit both natural
multicast opportunities and view synthesis-enabled multicast opportunities.
First, we establ... | [
{
"created": "Sat, 28 Dec 2019 07:46:21 GMT",
"version": "v1"
}
] | 2020-01-01 | [
[
"Xu",
"Wei",
""
],
[
"Cui",
"Ying",
""
],
[
"Liu",
"Zhi",
""
],
[
"Li",
"Haoran",
""
]
] | In this letter, we study the transmission of a multi-view video (MVV) to multiple users in an Orthogonal Frequency Division Multiple Access (OFDMA) system. To maximally improve transmission efficiency, we exploit both natural multicast opportunities and view synthesis-enabled multicast opportunities. First, we establis... |
1906.04859 | Yunhao Tang | Yunhao Tang, Shipra Agrawal, Yuri Faenza | Reinforcement Learning for Integer Programming: Learning to Cut | Accepted at International Conference on Machine Learning (ICML) 2020 | null | null | null | cs.LG math.OC stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Integer programming (IP) is a general optimization framework widely
applicable to a variety of unstructured and structured problems arising in,
e.g., scheduling, production planning, and graph optimization. As IP models
many provably hard to solve problems, modern IP solvers rely on many
heuristics. These heuristics ... | [
{
"created": "Tue, 11 Jun 2019 23:14:46 GMT",
"version": "v1"
},
{
"created": "Sun, 19 Jul 2020 20:34:20 GMT",
"version": "v2"
},
{
"created": "Tue, 21 Jul 2020 12:57:19 GMT",
"version": "v3"
}
] | 2020-07-22 | [
[
"Tang",
"Yunhao",
""
],
[
"Agrawal",
"Shipra",
""
],
[
"Faenza",
"Yuri",
""
]
] | Integer programming (IP) is a general optimization framework widely applicable to a variety of unstructured and structured problems arising in, e.g., scheduling, production planning, and graph optimization. As IP models many provably hard to solve problems, modern IP solvers rely on many heuristics. These heuristics ar... |
2311.09141 | Bruno Ziliotto | Andr\'es Cristi and Bruno Ziliotto | Prophet Inequalities Require Only a Constant Number of Samples | null | null | null | null | cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In a prophet inequality problem, $n$ independent random variables are
presented to a gambler one by one. The gambler decides when to stop the
sequence and obtains the most recent value as reward. We evaluate a stopping
rule by the worst-case ratio between its expected reward and the expectation of
the maximum variabl... | [
{
"created": "Wed, 15 Nov 2023 17:35:04 GMT",
"version": "v1"
}
] | 2023-11-16 | [
[
"Cristi",
"Andrés",
""
],
[
"Ziliotto",
"Bruno",
""
]
] | In a prophet inequality problem, $n$ independent random variables are presented to a gambler one by one. The gambler decides when to stop the sequence and obtains the most recent value as reward. We evaluate a stopping rule by the worst-case ratio between its expected reward and the expectation of the maximum variable.... |
2010.06631 | Jialu Zhang | Jialu Zhang, Yitan Wang, Mark Santolucito and Ruzica Piskac | Succinct Explanations With Cascading Decision Trees | null | null | null | null | cs.LG cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The decision tree is one of the most popular and classical machine learning
models from the 1980s. However, in many practical applications, decision trees
tend to generate decision paths with excessive depth. Long decision paths often
cause overfitting problems, and make models difficult to interpret. With longer
dec... | [
{
"created": "Tue, 13 Oct 2020 18:48:39 GMT",
"version": "v1"
},
{
"created": "Tue, 29 Nov 2022 17:29:50 GMT",
"version": "v2"
}
] | 2022-11-30 | [
[
"Zhang",
"Jialu",
""
],
[
"Wang",
"Yitan",
""
],
[
"Santolucito",
"Mark",
""
],
[
"Piskac",
"Ruzica",
""
]
] | The decision tree is one of the most popular and classical machine learning models from the 1980s. However, in many practical applications, decision trees tend to generate decision paths with excessive depth. Long decision paths often cause overfitting problems, and make models difficult to interpret. With longer decis... |
2403.09415 | Rishabh Haria | Rishabh Vallabh Varsha Haria, Amin El Abed, Sebastian Maneth | User Identification via Free Roaming Eye Tracking Data | null | null | null | null | cs.LG cs.HC | http://creativecommons.org/licenses/by/4.0/ | We present a new dataset of "free roaming" (FR) and "targeted roaming" (TR):
a pool of 41 participants is asked to walk around a university campus (FR) or
is asked to find a particular room within a library (TR). Eye movements are
recorded using a commodity wearable eye tracker (Pupil Labs Neon at 200Hz). On
this dat... | [
{
"created": "Thu, 14 Mar 2024 14:04:37 GMT",
"version": "v1"
}
] | 2024-03-15 | [
[
"Haria",
"Rishabh Vallabh Varsha",
""
],
[
"Abed",
"Amin El",
""
],
[
"Maneth",
"Sebastian",
""
]
] | We present a new dataset of "free roaming" (FR) and "targeted roaming" (TR): a pool of 41 participants is asked to walk around a university campus (FR) or is asked to find a particular room within a library (TR). Eye movements are recorded using a commodity wearable eye tracker (Pupil Labs Neon at 200Hz). On this datas... |
2212.05895 | Juhua Liu | Haibin He, Xinyuan Chen, Chaoyue Wang, Juhua Liu, Bo Du, Dacheng Tao,
Yu Qiao | Diff-Font: Diffusion Model for Robust One-Shot Font Generation | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Font generation is a difficult and time-consuming task, especially in those
languages using ideograms that have complicated structures with a large number
of characters, such as Chinese. To solve this problem, few-shot font generation
and even one-shot font generation have attracted a lot of attention. However,
most ... | [
{
"created": "Mon, 12 Dec 2022 13:51:50 GMT",
"version": "v1"
},
{
"created": "Thu, 6 Apr 2023 15:28:18 GMT",
"version": "v2"
},
{
"created": "Sun, 7 May 2023 15:37:56 GMT",
"version": "v3"
}
] | 2023-05-09 | [
[
"He",
"Haibin",
""
],
[
"Chen",
"Xinyuan",
""
],
[
"Wang",
"Chaoyue",
""
],
[
"Liu",
"Juhua",
""
],
[
"Du",
"Bo",
""
],
[
"Tao",
"Dacheng",
""
],
[
"Qiao",
"Yu",
""
]
] | Font generation is a difficult and time-consuming task, especially in those languages using ideograms that have complicated structures with a large number of characters, such as Chinese. To solve this problem, few-shot font generation and even one-shot font generation have attracted a lot of attention. However, most ex... |
0801.0523 | Florent De Dinechin | Florent De Dinechin (LIP), Christoph Quirin Lauter (LIP), Guillaume
Melquiond (LIP) | Certifying floating-point implementations using Gappa | null | null | null | null | cs.NA cs.MS | null | High confidence in floating-point programs requires proving numerical
properties of final and intermediate values. One may need to guarantee that a
value stays within some range, or that the error relative to some ideal value
is well bounded. Such work may require several lines of proof for each line of
code, and wil... | [
{
"created": "Thu, 3 Jan 2008 13:34:03 GMT",
"version": "v1"
}
] | 2008-01-04 | [
[
"De Dinechin",
"Florent",
"",
"LIP"
],
[
"Lauter",
"Christoph Quirin",
"",
"LIP"
],
[
"Melquiond",
"Guillaume",
"",
"LIP"
]
] | High confidence in floating-point programs requires proving numerical properties of final and intermediate values. One may need to guarantee that a value stays within some range, or that the error relative to some ideal value is well bounded. Such work may require several lines of proof for each line of code, and will ... |
2212.08661 | Feng Qiu | Feng Qiu, Chengyang Xie, Yu Ding, Wanzeng Kong | EffMulti: Efficiently Modeling Complex Multimodal Interactions for
Emotion Analysis | 6 pages,1 figure | null | null | null | cs.LG cs.AI cs.CL | http://creativecommons.org/licenses/by/4.0/ | Humans are skilled in reading the interlocutor's emotion from multimodal
signals, including spoken words, simultaneous speech, and facial expressions.
It is still a challenge to effectively decode emotions from the complex
interactions of multimodal signals. In this paper, we design three kinds of
multimodal latent r... | [
{
"created": "Fri, 16 Dec 2022 03:05:55 GMT",
"version": "v1"
}
] | 2022-12-20 | [
[
"Qiu",
"Feng",
""
],
[
"Xie",
"Chengyang",
""
],
[
"Ding",
"Yu",
""
],
[
"Kong",
"Wanzeng",
""
]
] | Humans are skilled in reading the interlocutor's emotion from multimodal signals, including spoken words, simultaneous speech, and facial expressions. It is still a challenge to effectively decode emotions from the complex interactions of multimodal signals. In this paper, we design three kinds of multimodal latent rep... |
2106.14642 | Li Meng | Li Meng, Anis Yazidi, Morten Goodwin, Paal Engelstad | Expert Q-learning: Deep Reinforcement Learning with Coarse State Values
from Offline Expert Examples | Camera-ready version | Septentrio Academic, Tromso, Norway, 2022 | 10.7557/18.6237 | null | cs.LG cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this article, we propose a novel algorithm for deep reinforcement learning
named Expert Q-learning. Expert Q-learning is inspired by Dueling Q-learning
and aims at incorporating semi-supervised learning into reinforcement learning
through splitting Q-values into state values and action advantages. We require
that ... | [
{
"created": "Mon, 28 Jun 2021 12:41:45 GMT",
"version": "v1"
},
{
"created": "Tue, 29 Jun 2021 13:37:31 GMT",
"version": "v2"
},
{
"created": "Wed, 2 Mar 2022 09:46:07 GMT",
"version": "v3"
},
{
"created": "Mon, 24 Jun 2024 14:51:14 GMT",
"version": "v4"
},
{
"cr... | 2024-06-26 | [
[
"Meng",
"Li",
""
],
[
"Yazidi",
"Anis",
""
],
[
"Goodwin",
"Morten",
""
],
[
"Engelstad",
"Paal",
""
]
] | In this article, we propose a novel algorithm for deep reinforcement learning named Expert Q-learning. Expert Q-learning is inspired by Dueling Q-learning and aims at incorporating semi-supervised learning into reinforcement learning through splitting Q-values into state values and action advantages. We require that an... |
2004.13106 | Beyza Ermis Ms | Beyza Ermis, Patrick Ernst, Yannik Stein, Giovanni Zappella | Learning to Rank in the Position Based Model with Bandit Feedback | null | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Personalization is a crucial aspect of many online experiences. In
particular, content ranking is often a key component in delivering
sophisticated personalization results. Commonly, supervised learning-to-rank
methods are applied, which suffer from bias introduced during data collection
by production systems in char... | [
{
"created": "Mon, 27 Apr 2020 19:12:20 GMT",
"version": "v1"
}
] | 2020-04-29 | [
[
"Ermis",
"Beyza",
""
],
[
"Ernst",
"Patrick",
""
],
[
"Stein",
"Yannik",
""
],
[
"Zappella",
"Giovanni",
""
]
] | Personalization is a crucial aspect of many online experiences. In particular, content ranking is often a key component in delivering sophisticated personalization results. Commonly, supervised learning-to-rank methods are applied, which suffer from bias introduced during data collection by production systems in charge... |
1503.01566 | Harsh Tataria Mr. | Harsh Tataria, Mansoor Shafi, Peter J. Smith, Pawel A. Dmochowski | Coordinated Two-Tier Heterogeneous Cellular Networks with Leakage Based
Beamforming | 7 pages, 8 figures, submitted to IEEE International Conference on
Communications (ICC) 4th International Workshop on Small Cells and 5G
(SmallNets), London, UK, June 2015 | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper we demonstrate the rate gains achieved by two-tier
heterogeneous cellular networks (HetNets) with varying degrees of coordination
between macrocell and microcell base stations (BSs). We show that without the
presence of coordination, network densification does not provide any gain in
the sum rate and ra... | [
{
"created": "Thu, 5 Mar 2015 07:50:06 GMT",
"version": "v1"
}
] | 2015-03-06 | [
[
"Tataria",
"Harsh",
""
],
[
"Shafi",
"Mansoor",
""
],
[
"Smith",
"Peter J.",
""
],
[
"Dmochowski",
"Pawel A.",
""
]
] | In this paper we demonstrate the rate gains achieved by two-tier heterogeneous cellular networks (HetNets) with varying degrees of coordination between macrocell and microcell base stations (BSs). We show that without the presence of coordination, network densification does not provide any gain in the sum rate and rapi... |
2210.17222 | Davide Salvi | Luigi Attorresi, Davide Salvi, Clara Borrelli, Paolo Bestagini,
Stefano Tubaro | Combining Automatic Speaker Verification and Prosody Analysis for
Synthetic Speech Detection | null | null | null | null | cs.SD cs.CV cs.MM eess.AS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The rapid spread of media content synthesis technology and the potentially
damaging impact of audio and video deepfakes on people's lives have raised the
need to implement systems able to detect these forgeries automatically. In this
work we present a novel approach for synthetic speech detection, exploiting the
comb... | [
{
"created": "Mon, 31 Oct 2022 11:03:03 GMT",
"version": "v1"
}
] | 2022-11-01 | [
[
"Attorresi",
"Luigi",
""
],
[
"Salvi",
"Davide",
""
],
[
"Borrelli",
"Clara",
""
],
[
"Bestagini",
"Paolo",
""
],
[
"Tubaro",
"Stefano",
""
]
] | The rapid spread of media content synthesis technology and the potentially damaging impact of audio and video deepfakes on people's lives have raised the need to implement systems able to detect these forgeries automatically. In this work we present a novel approach for synthetic speech detection, exploiting the combin... |
2306.14237 | Nikolaos Koursioumpas | Lina Magoula, Nikolaos Koursioumpas, Alexandros-Ioannis Thanopoulos,
Theodora Panagea, Nikolaos Petropouleas, M. A. Gutierrez-Estevez, Ramin
Khalili | A Safe Genetic Algorithm Approach for Energy Efficient Federated
Learning in Wireless Communication Networks | 6 pages, 6 figures, Accepted in IEEE PIMRC 2023 Conference, Latest
revision with small corrections (typos etc.) | null | 10.1109/PIMRC56721.2023.10293863 | null | cs.NE cs.NI eess.SP | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Federated Learning (FL) has emerged as a decentralized technique, where
contrary to traditional centralized approaches, devices perform a model
training in a collaborative manner, while preserving data privacy. Despite the
existing efforts made in FL, its environmental impact is still under
investigation, since sever... | [
{
"created": "Sun, 25 Jun 2023 13:10:38 GMT",
"version": "v1"
},
{
"created": "Wed, 5 Jul 2023 10:14:52 GMT",
"version": "v2"
}
] | 2023-11-07 | [
[
"Magoula",
"Lina",
""
],
[
"Koursioumpas",
"Nikolaos",
""
],
[
"Thanopoulos",
"Alexandros-Ioannis",
""
],
[
"Panagea",
"Theodora",
""
],
[
"Petropouleas",
"Nikolaos",
""
],
[
"Gutierrez-Estevez",
"M. A.",
""
],
[
"... | Federated Learning (FL) has emerged as a decentralized technique, where contrary to traditional centralized approaches, devices perform a model training in a collaborative manner, while preserving data privacy. Despite the existing efforts made in FL, its environmental impact is still under investigation, since several... |
0806.4468 | Rui Zhang | Rui Zhang, Shuguang Cui, and Ying-Chang Liang | On Ergodic Sum Capacity of Fading Cognitive Multiple-Access and
Broadcast Channels | To appear in IEEE Transactions on Information Theory | null | 10.1109/TIT.2009.2030449 | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper studies the information-theoretic limits of a secondary or
cognitive radio (CR) network under spectrum sharing with an existing primary
radio network. In particular, the fading cognitive multiple-access channel
(C-MAC) is first studied, where multiple secondary users transmit to the
secondary base station ... | [
{
"created": "Fri, 27 Jun 2008 09:32:01 GMT",
"version": "v1"
},
{
"created": "Mon, 3 Aug 2009 05:59:45 GMT",
"version": "v2"
}
] | 2016-11-18 | [
[
"Zhang",
"Rui",
""
],
[
"Cui",
"Shuguang",
""
],
[
"Liang",
"Ying-Chang",
""
]
] | This paper studies the information-theoretic limits of a secondary or cognitive radio (CR) network under spectrum sharing with an existing primary radio network. In particular, the fading cognitive multiple-access channel (C-MAC) is first studied, where multiple secondary users transmit to the secondary base station (B... |
2309.14054 | Piyush Tiwary | Piyush Tiwary, Atri Guha, Subhodip Panda, Prathosh A.P | Adapt then Unlearn: Exploiting Parameter Space Semantics for Unlearning
in Generative Adversarial Networks | 15 pages, 12 figures | null | null | null | cs.LG cs.AI cs.CV | http://creativecommons.org/licenses/by/4.0/ | The increased attention to regulating the outputs of deep generative models,
driven by growing concerns about privacy and regulatory compliance, has
highlighted the need for effective control over these models. This necessity
arises from instances where generative models produce outputs containing
undesirable, offens... | [
{
"created": "Mon, 25 Sep 2023 11:36:20 GMT",
"version": "v1"
}
] | 2023-09-26 | [
[
"Tiwary",
"Piyush",
""
],
[
"Guha",
"Atri",
""
],
[
"Panda",
"Subhodip",
""
],
[
"P",
"Prathosh A.",
""
]
] | The increased attention to regulating the outputs of deep generative models, driven by growing concerns about privacy and regulatory compliance, has highlighted the need for effective control over these models. This necessity arises from instances where generative models produce outputs containing undesirable, offensiv... |
2204.03831 | Wooyoung Kim | Wooyoung Kim, Chaerin Jo, Minjung Kim and Wooju Kim | Marvelous Agglutinative Language Effect on Cross Lingual Transfer
Learning | ICEC2022 Oral | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | As for multilingual language models, it is important to select languages for
training because of the curse of multilinguality. It is known that using
languages with similar language structures is effective for cross lingual
transfer learning. However, we demonstrate that using agglutinative languages
such as Korean i... | [
{
"created": "Fri, 8 Apr 2022 04:04:45 GMT",
"version": "v1"
},
{
"created": "Thu, 23 May 2024 07:10:43 GMT",
"version": "v2"
},
{
"created": "Fri, 24 May 2024 07:13:18 GMT",
"version": "v3"
}
] | 2024-05-27 | [
[
"Kim",
"Wooyoung",
""
],
[
"Jo",
"Chaerin",
""
],
[
"Kim",
"Minjung",
""
],
[
"Kim",
"Wooju",
""
]
] | As for multilingual language models, it is important to select languages for training because of the curse of multilinguality. It is known that using languages with similar language structures is effective for cross lingual transfer learning. However, we demonstrate that using agglutinative languages such as Korean is ... |
2305.16440 | Navjot Singh | Navjot Singh, Suhas Diggavi | Representation Transfer Learning via Multiple Pre-trained models for
Linear Regression | 20 pages | null | null | null | cs.LG stat.ML | http://creativecommons.org/licenses/by/4.0/ | In this paper, we consider the problem of learning a linear regression model
on a data domain of interest (target) given few samples. To aid learning, we
are provided with a set of pre-trained regression models that are trained on
potentially different data domains (sources). Assuming a representation
structure for t... | [
{
"created": "Thu, 25 May 2023 19:35:24 GMT",
"version": "v1"
},
{
"created": "Sun, 25 Jun 2023 01:16:32 GMT",
"version": "v2"
}
] | 2023-06-27 | [
[
"Singh",
"Navjot",
""
],
[
"Diggavi",
"Suhas",
""
]
] | In this paper, we consider the problem of learning a linear regression model on a data domain of interest (target) given few samples. To aid learning, we are provided with a set of pre-trained regression models that are trained on potentially different data domains (sources). Assuming a representation structure for the... |
1810.05561 | Prathamesh Mayekar | Prathamesh Mayekar, Parimal Parag, and Himanshu Tyagi | Optimal Source Codes for Timely Updates | Added a missing reference, in IEEE Transactions on Information
Theory, 2020 | IEEE Transactions on Information Theory, vol. 66, no. 6, pp.
3714--3731, June 2020 | 10.1109/TIT.2020.2983151 | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A transmitter observing a sequence of independent and identically distributed
random variables seeks to keep a receiver updated about its latest
observations. The receiver need not be apprised about each symbol seen by the
transmitter, but needs to output a symbol at each time instant $t$. If at time
$t$ the receiver... | [
{
"created": "Fri, 12 Oct 2018 14:59:13 GMT",
"version": "v1"
},
{
"created": "Mon, 7 Jan 2019 09:45:45 GMT",
"version": "v2"
},
{
"created": "Fri, 27 Mar 2020 05:32:01 GMT",
"version": "v3"
}
] | 2021-03-26 | [
[
"Mayekar",
"Prathamesh",
""
],
[
"Parag",
"Parimal",
""
],
[
"Tyagi",
"Himanshu",
""
]
] | A transmitter observing a sequence of independent and identically distributed random variables seeks to keep a receiver updated about its latest observations. The receiver need not be apprised about each symbol seen by the transmitter, but needs to output a symbol at each time instant $t$. If at time $t$ the receiver o... |
1202.3470 | Markus Jalsenius | Raphael Clifford, Markus Jalsenius, Ely Porat, Benjamin Sach | Pattern Matching in Multiple Streams | 13 pages, 1 figure | null | null | null | cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We investigate the problem of deterministic pattern matching in multiple
streams. In this model, one symbol arrives at a time and is associated with one
of s streaming texts. The task at each time step is to report if there is a new
match between a fixed pattern of length m and a newly updated stream. As is
usual in ... | [
{
"created": "Wed, 15 Feb 2012 23:11:48 GMT",
"version": "v1"
},
{
"created": "Wed, 25 Apr 2012 13:54:14 GMT",
"version": "v2"
}
] | 2012-04-26 | [
[
"Clifford",
"Raphael",
""
],
[
"Jalsenius",
"Markus",
""
],
[
"Porat",
"Ely",
""
],
[
"Sach",
"Benjamin",
""
]
] | We investigate the problem of deterministic pattern matching in multiple streams. In this model, one symbol arrives at a time and is associated with one of s streaming texts. The task at each time step is to report if there is a new match between a fixed pattern of length m and a newly updated stream. As is usual in th... |
2208.09814 | Hideaki Iiduka | Hideaki Iiduka | Critical Bach Size Minimizes Stochastic First-Order Oracle Complexity of
Deep Learning Optimizer using Hyperparameters Close to One | arXiv admin note: text overlap with arXiv:2112.07163 | null | null | null | cs.LG math.OC | http://creativecommons.org/licenses/by/4.0/ | Practical results have shown that deep learning optimizers using small
constant learning rates, hyperparameters close to one, and large batch sizes
can find the model parameters of deep neural networks that minimize the loss
functions. We first show theoretical evidence that the momentum method
(Momentum) and adaptiv... | [
{
"created": "Sun, 21 Aug 2022 06:11:23 GMT",
"version": "v1"
}
] | 2022-08-23 | [
[
"Iiduka",
"Hideaki",
""
]
] | Practical results have shown that deep learning optimizers using small constant learning rates, hyperparameters close to one, and large batch sizes can find the model parameters of deep neural networks that minimize the loss functions. We first show theoretical evidence that the momentum method (Momentum) and adaptive ... |
2010.02787 | Maximilian Katzmann | Thomas Bl\"asius, Tobias Friedrich, Maximilian Katzmann | Efficiently Approximating Vertex Cover on Scale-Free Networks with
Underlying Hyperbolic Geometry | null | null | 10.1007/s00453-023-01143-x | null | cs.DS | http://creativecommons.org/licenses/by/4.0/ | Finding a minimum vertex cover in a network is a fundamental NP-complete
graph problem. One way to deal with its computational hardness, is to trade the
qualitative performance of an algorithm (allowing non-optimal outputs) for an
improved running time. For the vertex cover problem, there is a gap between
theory and ... | [
{
"created": "Tue, 6 Oct 2020 14:56:48 GMT",
"version": "v1"
},
{
"created": "Fri, 25 Jun 2021 11:04:42 GMT",
"version": "v2"
},
{
"created": "Wed, 8 Dec 2021 14:56:02 GMT",
"version": "v3"
},
{
"created": "Wed, 13 Dec 2023 09:02:07 GMT",
"version": "v4"
}
] | 2023-12-14 | [
[
"Bläsius",
"Thomas",
""
],
[
"Friedrich",
"Tobias",
""
],
[
"Katzmann",
"Maximilian",
""
]
] | Finding a minimum vertex cover in a network is a fundamental NP-complete graph problem. One way to deal with its computational hardness, is to trade the qualitative performance of an algorithm (allowing non-optimal outputs) for an improved running time. For the vertex cover problem, there is a gap between theory and pr... |
1709.00643 | Qifeng Chen | Qifeng Chen, Jia Xu, Vladlen Koltun | Fast Image Processing with Fully-Convolutional Networks | Published at the International Conference on Computer Vision (ICCV
2017) | null | null | null | cs.CV cs.GR cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We present an approach to accelerating a wide variety of image processing
operators. Our approach uses a fully-convolutional network that is trained on
input-output pairs that demonstrate the operator's action. After training, the
original operator need not be run at all. The trained network operates at full
resoluti... | [
{
"created": "Sat, 2 Sep 2017 22:38:13 GMT",
"version": "v1"
}
] | 2017-09-05 | [
[
"Chen",
"Qifeng",
""
],
[
"Xu",
"Jia",
""
],
[
"Koltun",
"Vladlen",
""
]
] | We present an approach to accelerating a wide variety of image processing operators. Our approach uses a fully-convolutional network that is trained on input-output pairs that demonstrate the operator's action. After training, the original operator need not be run at all. The trained network operates at full resolution... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.