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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1412.6575 | Bishan Yang | Bishan Yang, Wen-tau Yih, Xiaodong He, Jianfeng Gao, Li Deng | Embedding Entities and Relations for Learning and Inference in Knowledge
Bases | 12 pages, 4 figures | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We consider learning representations of entities and relations in KBs using
the neural-embedding approach. We show that most existing models, including NTN
(Socher et al., 2013) and TransE (Bordes et al., 2013b), can be generalized
under a unified learning framework, where entities are low-dimensional vectors
learned... | [
{
"created": "Sat, 20 Dec 2014 01:37:16 GMT",
"version": "v1"
},
{
"created": "Sat, 27 Dec 2014 00:18:17 GMT",
"version": "v2"
},
{
"created": "Fri, 10 Apr 2015 15:24:59 GMT",
"version": "v3"
},
{
"created": "Sat, 29 Aug 2015 15:08:45 GMT",
"version": "v4"
}
] | 2015-09-01 | [
[
"Yang",
"Bishan",
""
],
[
"Yih",
"Wen-tau",
""
],
[
"He",
"Xiaodong",
""
],
[
"Gao",
"Jianfeng",
""
],
[
"Deng",
"Li",
""
]
] | We consider learning representations of entities and relations in KBs using the neural-embedding approach. We show that most existing models, including NTN (Socher et al., 2013) and TransE (Bordes et al., 2013b), can be generalized under a unified learning framework, where entities are low-dimensional vectors learned f... |
2309.05295 | Karlis Freivalds | Karlis Freivalds, Emils Ozolins, Guntis Barzdins | Discrete Denoising Diffusion Approach to Integer Factorization | International Conference on Artificial Neural Networks ICANN 2023 | null | null | null | cs.LG cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Integer factorization is a famous computational problem unknown whether being
solvable in the polynomial time. With the rise of deep neural networks, it is
interesting whether they can facilitate faster factorization. We present an
approach to factorization utilizing deep neural networks and discrete denoising
diffus... | [
{
"created": "Mon, 11 Sep 2023 08:26:08 GMT",
"version": "v1"
}
] | 2023-09-12 | [
[
"Freivalds",
"Karlis",
""
],
[
"Ozolins",
"Emils",
""
],
[
"Barzdins",
"Guntis",
""
]
] | Integer factorization is a famous computational problem unknown whether being solvable in the polynomial time. With the rise of deep neural networks, it is interesting whether they can facilitate faster factorization. We present an approach to factorization utilizing deep neural networks and discrete denoising diffusio... |
1404.4997 | Eric Price | Moritz Hardt and Eric Price | Tight bounds for learning a mixture of two gaussians | STOC 2015 | null | null | null | cs.LG cs.DS stat.ML | http://creativecommons.org/licenses/by-nc-sa/3.0/ | We consider the problem of identifying the parameters of an unknown mixture
of two arbitrary $d$-dimensional gaussians from a sequence of independent
random samples. Our main results are upper and lower bounds giving a
computationally efficient moment-based estimator with an optimal convergence
rate, thus resolving a... | [
{
"created": "Sat, 19 Apr 2014 23:59:35 GMT",
"version": "v1"
},
{
"created": "Mon, 8 Dec 2014 22:15:35 GMT",
"version": "v2"
},
{
"created": "Sun, 17 May 2015 04:47:58 GMT",
"version": "v3"
}
] | 2015-05-19 | [
[
"Hardt",
"Moritz",
""
],
[
"Price",
"Eric",
""
]
] | We consider the problem of identifying the parameters of an unknown mixture of two arbitrary $d$-dimensional gaussians from a sequence of independent random samples. Our main results are upper and lower bounds giving a computationally efficient moment-based estimator with an optimal convergence rate, thus resolving a p... |
2009.08936 | Majdi Radaideh | Majdi I. Radaideh, Koroush Shirvan | Improving Intelligence of Evolutionary Algorithms Using Experience Share
and Replay | 10 pages, 4 figures, 2 tables | null | null | null | cs.NE cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We propose PESA, a novel approach combining Particle Swarm Optimisation
(PSO), Evolution Strategy (ES), and Simulated Annealing (SA) in a hybrid
Algorithm, inspired from reinforcement learning. PESA hybridizes the three
algorithms by storing their solutions in a shared replay memory. Next, PESA
applies prioritized re... | [
{
"created": "Mon, 10 Aug 2020 17:27:30 GMT",
"version": "v1"
}
] | 2020-09-21 | [
[
"Radaideh",
"Majdi I.",
""
],
[
"Shirvan",
"Koroush",
""
]
] | We propose PESA, a novel approach combining Particle Swarm Optimisation (PSO), Evolution Strategy (ES), and Simulated Annealing (SA) in a hybrid Algorithm, inspired from reinforcement learning. PESA hybridizes the three algorithms by storing their solutions in a shared replay memory. Next, PESA applies prioritized repl... |
1210.4081 | Bogdan Savchynskyy | Bogdan Savchynskyy and Stefan Schmidt | Getting Feasible Variable Estimates From Infeasible Ones: MRF Local
Polytope Study | 20 page, 4 figures | null | null | null | cs.NA cs.CV cs.DS cs.LG math.OC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper proposes a method for construction of approximate feasible primal
solutions from dual ones for large-scale optimization problems possessing
certain separability properties. Whereas infeasible primal estimates can
typically be produced from (sub-)gradients of the dual function, it is often
not easy to proje... | [
{
"created": "Mon, 15 Oct 2012 15:55:34 GMT",
"version": "v1"
}
] | 2012-10-16 | [
[
"Savchynskyy",
"Bogdan",
""
],
[
"Schmidt",
"Stefan",
""
]
] | This paper proposes a method for construction of approximate feasible primal solutions from dual ones for large-scale optimization problems possessing certain separability properties. Whereas infeasible primal estimates can typically be produced from (sub-)gradients of the dual function, it is often not easy to project... |
1804.03082 | Hadi Kazemi | Hadi Kazemi, Sobhan Soleymani, Ali Dabouei, Mehdi Iranmanesh, Nasser
M. Nasrabadi | Attribute-Centered Loss for Soft-Biometrics Guided Face Sketch-Photo
Recognition | Accepted as a conference paper on CVPRW 2018 | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Face sketches are able to capture the spatial topology of a face while
lacking some facial attributes such as race, skin, or hair color. Existing
sketch-photo recognition approaches have mostly ignored the importance of
facial attributes. In this paper, we propose a new loss function, called
attribute-centered loss, ... | [
{
"created": "Mon, 9 Apr 2018 16:15:50 GMT",
"version": "v1"
}
] | 2018-04-10 | [
[
"Kazemi",
"Hadi",
""
],
[
"Soleymani",
"Sobhan",
""
],
[
"Dabouei",
"Ali",
""
],
[
"Iranmanesh",
"Mehdi",
""
],
[
"Nasrabadi",
"Nasser M.",
""
]
] | Face sketches are able to capture the spatial topology of a face while lacking some facial attributes such as race, skin, or hair color. Existing sketch-photo recognition approaches have mostly ignored the importance of facial attributes. In this paper, we propose a new loss function, called attribute-centered loss, to... |
1706.10076 | Pavel Kucherbaev | Pavel Kucherbaev, Achilleas Psyllidis, Alessandro Bozzon | Chatbots as Conversational Recommender Systems in Urban Contexts | 2 pages, 1 figure, 1 table | null | null | null | cs.SI cs.CY cs.IR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we outline the vision of chatbots that facilitate the
interaction between citizens and policy-makers at the city scale. We report the
results of a co-design session attended by more than 60 participants. We give
an outlook of how some challenges associated with such chatbot systems could be
addressed i... | [
{
"created": "Fri, 30 Jun 2017 09:24:39 GMT",
"version": "v1"
},
{
"created": "Wed, 9 Aug 2017 09:03:49 GMT",
"version": "v2"
}
] | 2017-08-10 | [
[
"Kucherbaev",
"Pavel",
""
],
[
"Psyllidis",
"Achilleas",
""
],
[
"Bozzon",
"Alessandro",
""
]
] | In this paper, we outline the vision of chatbots that facilitate the interaction between citizens and policy-makers at the city scale. We report the results of a co-design session attended by more than 60 participants. We give an outlook of how some challenges associated with such chatbot systems could be addressed in ... |
1907.05609 | Qianwen Wang | Qianwen Wang, Zhen Li, Siwei Fu, Weiwei Cui, Huamin Qu | Narvis: Authoring Narrative Slideshows for Introducing Data
Visualization Designs | 9 pages, published at IEEE InfoVis 2018, | IEEE Transactions on Visualization and Computer Graphics, vol. 25,
no. 1, pp. 779-788, Jan. 2019 | 10.1109/TVCG.2018.2865232 | null | cs.HC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Visual designs can be complex in modern data visualization systems, which
poses special challenges for explaining them to the non-experts. However, few
if any presentation tools are tailored for this purpose. In this study, we
present Narvis, a slideshow authoring tool designed for introducing data
visualizations to ... | [
{
"created": "Fri, 12 Jul 2019 08:14:18 GMT",
"version": "v1"
}
] | 2019-08-21 | [
[
"Wang",
"Qianwen",
""
],
[
"Li",
"Zhen",
""
],
[
"Fu",
"Siwei",
""
],
[
"Cui",
"Weiwei",
""
],
[
"Qu",
"Huamin",
""
]
] | Visual designs can be complex in modern data visualization systems, which poses special challenges for explaining them to the non-experts. However, few if any presentation tools are tailored for this purpose. In this study, we present Narvis, a slideshow authoring tool designed for introducing data visualizations to no... |
1705.08218 | Xiaojian Wu | Xiaojian Wu, Yexiang Xue, Bart Selman, Carla P. Gomes | XOR-Sampling for Network Design with Correlated Stochastic Events | In Proceedings of the Twenty-sixth International Joint Conference on
Artificial Intelligence (IJCAI-17). The first two authors contribute equally | null | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Many network optimization problems can be formulated as stochastic network
design problems in which edges are present or absent stochastically.
Furthermore, protective actions can guarantee that edges will remain present.
We consider the problem of finding the optimal protection strategy under a
budget limit in order... | [
{
"created": "Tue, 23 May 2017 12:50:36 GMT",
"version": "v1"
},
{
"created": "Wed, 24 May 2017 01:38:57 GMT",
"version": "v2"
}
] | 2017-05-25 | [
[
"Wu",
"Xiaojian",
""
],
[
"Xue",
"Yexiang",
""
],
[
"Selman",
"Bart",
""
],
[
"Gomes",
"Carla P.",
""
]
] | Many network optimization problems can be formulated as stochastic network design problems in which edges are present or absent stochastically. Furthermore, protective actions can guarantee that edges will remain present. We consider the problem of finding the optimal protection strategy under a budget limit in order t... |
2402.17104 | Robert Bassett | Robert L. Bassett, Austin Van Dellen, Anthony P. Austin | Adversarial Perturbations of Physical Signals | null | null | null | null | cs.LG cs.CR eess.SP math.OC stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We investigate the vulnerability of computer-vision-based signal classifiers
to adversarial perturbations of their inputs, where the signals and
perturbations are subject to physical constraints. We consider a scenario in
which a source and interferer emit signals that propagate as waves to a
detector, which attempts... | [
{
"created": "Tue, 27 Feb 2024 00:41:00 GMT",
"version": "v1"
}
] | 2024-02-28 | [
[
"Bassett",
"Robert L.",
""
],
[
"Van Dellen",
"Austin",
""
],
[
"Austin",
"Anthony P.",
""
]
] | We investigate the vulnerability of computer-vision-based signal classifiers to adversarial perturbations of their inputs, where the signals and perturbations are subject to physical constraints. We consider a scenario in which a source and interferer emit signals that propagate as waves to a detector, which attempts t... |
1007.3353 | Laurent Hubert | Laurent Hubert (INRIA - IRISA), Nicolas Barr\'e (INRIA - IRISA),
Fr\'ed\'eric Besson (INRIA - IRISA), Delphine Demange (INRIA - IRISA), Thomas
Jensen (INRIA - IRISA), Vincent Monfort (INRIA - IRISA), David Pichardie
(INRIA - IRISA), Tiphaine Turpin (INRIA - IRISA) | Sawja: Static Analysis Workshop for Java | null | The International Conference on Formal Verification of
Object-Oriented Software 2010.13 (2010) 253--267 | 10.1007/978-3-642-18070-5_7 | null | cs.PL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Static analysis is a powerful technique for automatic verification of
programs but raises major engineering challenges when developing a full-fledged
analyzer for a realistic language such as Java. This paper describes the Sawja
library: a static analysis framework fully compliant with Java 6 which provides
OCaml mod... | [
{
"created": "Tue, 20 Jul 2010 07:03:59 GMT",
"version": "v1"
}
] | 2015-05-19 | [
[
"Hubert",
"Laurent",
"",
"INRIA - IRISA"
],
[
"Barré",
"Nicolas",
"",
"INRIA - IRISA"
],
[
"Besson",
"Frédéric",
"",
"INRIA - IRISA"
],
[
"Demange",
"Delphine",
"",
"INRIA - IRISA"
],
[
"Jensen",
"Thomas",
"",
"INRIA -... | Static analysis is a powerful technique for automatic verification of programs but raises major engineering challenges when developing a full-fledged analyzer for a realistic language such as Java. This paper describes the Sawja library: a static analysis framework fully compliant with Java 6 which provides OCaml modul... |
1804.06926 | Leyuan Wang | Leyuan Wang, Yangzihao Wang, Carl Yang and John D. Owens | A Comparative Study on Exact Triangle Counting Algorithms on the GPU | 7 pages, 6 figures and 2 tables | null | 10.1145/2915516.2915521 | null | cs.DC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We implement exact triangle counting in graphs on the GPU using three
different methodologies: subgraph matching to a triangle pattern; programmable
graph analytics, with a set-intersection approach; and a matrix formulation
based on sparse matrix-matrix multiplies. All three deliver best-of-class
performance over CP... | [
{
"created": "Wed, 18 Apr 2018 21:51:59 GMT",
"version": "v1"
}
] | 2018-04-20 | [
[
"Wang",
"Leyuan",
""
],
[
"Wang",
"Yangzihao",
""
],
[
"Yang",
"Carl",
""
],
[
"Owens",
"John D.",
""
]
] | We implement exact triangle counting in graphs on the GPU using three different methodologies: subgraph matching to a triangle pattern; programmable graph analytics, with a set-intersection approach; and a matrix formulation based on sparse matrix-matrix multiplies. All three deliver best-of-class performance over CPU ... |
1611.03841 | Jie Xu | Jie Xu, Lixing Chen, Kun Liu, Cong Shen | Designing Security-Aware Incentives for Computation Offloading via
Device-to-Device Communication | null | null | null | null | cs.GT cs.NI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Computation offloading via device-to-device (D2D) communication, or D2D
offloading, has recently been proposed to enhance mobile computing performance
by exploiting spare computing resources of nearby user devices. The success of
D2D offloading relies on user participation in collaborative service
provisioning, which... | [
{
"created": "Fri, 11 Nov 2016 20:22:25 GMT",
"version": "v1"
},
{
"created": "Fri, 22 Sep 2017 02:40:12 GMT",
"version": "v2"
}
] | 2017-09-25 | [
[
"Xu",
"Jie",
""
],
[
"Chen",
"Lixing",
""
],
[
"Liu",
"Kun",
""
],
[
"Shen",
"Cong",
""
]
] | Computation offloading via device-to-device (D2D) communication, or D2D offloading, has recently been proposed to enhance mobile computing performance by exploiting spare computing resources of nearby user devices. The success of D2D offloading relies on user participation in collaborative service provisioning, which i... |
2403.09070 | Yuxuan Zhao | Yuxuan Zhao, Peiyu Liao, Siting Liu, Jiaxi Jiang, Yibo Lin, Bei Yu | Analytical Heterogeneous Die-to-Die 3D Placement with Macros | null | null | null | null | cs.AR | http://creativecommons.org/licenses/by-nc-nd/4.0/ | This paper presents an innovative approach to 3D mixed-size placement in
heterogeneous face-to-face (F2F) bonded 3D ICs. We propose an analytical
framework that utilizes a dedicated density model and a bistratal wirelength
model, effectively handling macros and standard cells in a 3D solution space. A
novel 3D precon... | [
{
"created": "Thu, 14 Mar 2024 03:26:08 GMT",
"version": "v1"
},
{
"created": "Tue, 13 Aug 2024 13:00:42 GMT",
"version": "v2"
}
] | 2024-08-14 | [
[
"Zhao",
"Yuxuan",
""
],
[
"Liao",
"Peiyu",
""
],
[
"Liu",
"Siting",
""
],
[
"Jiang",
"Jiaxi",
""
],
[
"Lin",
"Yibo",
""
],
[
"Yu",
"Bei",
""
]
] | This paper presents an innovative approach to 3D mixed-size placement in heterogeneous face-to-face (F2F) bonded 3D ICs. We propose an analytical framework that utilizes a dedicated density model and a bistratal wirelength model, effectively handling macros and standard cells in a 3D solution space. A novel 3D precondi... |
2407.02856 | Adrian Pekar | Adrian Pekar and Richard Jozsa | Early-Stage Anomaly Detection: A Study of Model Performance on Complete
vs. Partial Flows | 9 pages, 5 tables, 2 figures | null | null | null | cs.LG cs.CR | http://creativecommons.org/licenses/by/4.0/ | This study investigates the efficacy of machine learning models, specifically
Random Forest, in anomaly detection systems when trained on complete flow
records and tested on partial flow data. We explore the performance disparity
that arises when models are applied to incomplete data typical in real-world,
real-time ... | [
{
"created": "Wed, 3 Jul 2024 07:14:25 GMT",
"version": "v1"
}
] | 2024-07-04 | [
[
"Pekar",
"Adrian",
""
],
[
"Jozsa",
"Richard",
""
]
] | This study investigates the efficacy of machine learning models, specifically Random Forest, in anomaly detection systems when trained on complete flow records and tested on partial flow data. We explore the performance disparity that arises when models are applied to incomplete data typical in real-world, real-time ne... |
1106.1803 | H. Blockeel | H. Blockeel, L. Dehaspe, B. Demoen, G. Janssens, J. Ramon, H.
Vandecasteele | Improving the Efficiency of Inductive Logic Programming Through the Use
of Query Packs | null | Journal Of Artificial Intelligence Research, Volume 16, pages
135-166, 2002 | 10.1613/jair.924 | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Inductive logic programming, or relational learning, is a powerful paradigm
for machine learning or data mining. However, in order for ILP to become
practically useful, the efficiency of ILP systems must improve substantially.
To this end, the notion of a query pack is introduced: it structures sets of
similar querie... | [
{
"created": "Thu, 9 Jun 2011 13:19:53 GMT",
"version": "v1"
}
] | 2011-06-10 | [
[
"Blockeel",
"H.",
""
],
[
"Dehaspe",
"L.",
""
],
[
"Demoen",
"B.",
""
],
[
"Janssens",
"G.",
""
],
[
"Ramon",
"J.",
""
],
[
"Vandecasteele",
"H.",
""
]
] | Inductive logic programming, or relational learning, is a powerful paradigm for machine learning or data mining. However, in order for ILP to become practically useful, the efficiency of ILP systems must improve substantially. To this end, the notion of a query pack is introduced: it structures sets of similar queries.... |
1609.03938 | Erel Segal-Halevi | Erel Segal-Halevi, Shmuel Nitzan, Avinatan Hassidim, Yonatan Aumann | Envy-Free Division of Land | A preliminary version named 'Envy-free cake-cutting in two
dimensions' appeared in the proceedings of AAAI 2015
(https://www.aaai.org/ocs/index.php/AAAI/AAAI15/paper/viewPaper/9656). The
main additions here are: (a) handling multi-dimensional resources of
arbitrary shape rather than just rectangles, (b) handlin... | null | 10.1287/moor.2019.1016 | null | cs.GT cs.CG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Classic cake-cutting algorithms enable people with different preferences to
divide among them a heterogeneous resource (``cake''), such that the resulting
division is fair according to each agent's individual preferences. However,
these algorithms either ignore the geometry of the resource altogether, or
assume it is... | [
{
"created": "Tue, 13 Sep 2016 17:07:32 GMT",
"version": "v1"
},
{
"created": "Sat, 9 Mar 2019 19:22:15 GMT",
"version": "v2"
}
] | 2021-08-06 | [
[
"Segal-Halevi",
"Erel",
""
],
[
"Nitzan",
"Shmuel",
""
],
[
"Hassidim",
"Avinatan",
""
],
[
"Aumann",
"Yonatan",
""
]
] | Classic cake-cutting algorithms enable people with different preferences to divide among them a heterogeneous resource (``cake''), such that the resulting division is fair according to each agent's individual preferences. However, these algorithms either ignore the geometry of the resource altogether, or assume it is o... |
2404.17428 | Manuel Dubinsky | Manuel Dubinsky, Kun-Mao Chao, C\'esar Massri, Gabriel Taubin | Lower Bounds for the Minimum Spanning Tree Cycle Intersection Problem | arXiv admin note: substantial text overlap with arXiv:2301.07643 | null | null | null | cs.DM | http://creativecommons.org/licenses/by/4.0/ | Minimum spanning trees are important tools in the analysis and design of
networks. Many practical applications require their computation, ranging from
biology and linguistics to economy and telecommunications. The set of cycles of
a network has a vector space structure. Given a spanning tree, the set of
non-tree edge... | [
{
"created": "Fri, 26 Apr 2024 14:08:36 GMT",
"version": "v1"
}
] | 2024-04-29 | [
[
"Dubinsky",
"Manuel",
""
],
[
"Chao",
"Kun-Mao",
""
],
[
"Massri",
"César",
""
],
[
"Taubin",
"Gabriel",
""
]
] | Minimum spanning trees are important tools in the analysis and design of networks. Many practical applications require their computation, ranging from biology and linguistics to economy and telecommunications. The set of cycles of a network has a vector space structure. Given a spanning tree, the set of non-tree edges ... |
2303.10590 | Minh Tran | Yufeng Yin, Minh Tran, Di Chang, Xinrui Wang, Mohammad Soleymani | Multi-modal Facial Action Unit Detection with Large Pre-trained Models
for the 5th Competition on Affective Behavior Analysis in-the-wild | 8 pages, 7 figures, 5 tables | null | null | null | cs.CV | http://creativecommons.org/licenses/by/4.0/ | Facial action unit detection has emerged as an important task within facial
expression analysis, aimed at detecting specific pre-defined, objective facial
expressions, such as lip tightening and cheek raising. This paper presents our
submission to the Affective Behavior Analysis in-the-wild (ABAW) 2023
Competition fo... | [
{
"created": "Sun, 19 Mar 2023 07:18:14 GMT",
"version": "v1"
},
{
"created": "Thu, 23 Mar 2023 00:35:40 GMT",
"version": "v2"
},
{
"created": "Mon, 17 Apr 2023 20:17:55 GMT",
"version": "v3"
}
] | 2023-04-19 | [
[
"Yin",
"Yufeng",
""
],
[
"Tran",
"Minh",
""
],
[
"Chang",
"Di",
""
],
[
"Wang",
"Xinrui",
""
],
[
"Soleymani",
"Mohammad",
""
]
] | Facial action unit detection has emerged as an important task within facial expression analysis, aimed at detecting specific pre-defined, objective facial expressions, such as lip tightening and cheek raising. This paper presents our submission to the Affective Behavior Analysis in-the-wild (ABAW) 2023 Competition for ... |
2310.02807 | Zijie Geng | Zijie Geng, Xijun Li, Jie Wang, Xiao Li, Yongdong Zhang, Feng Wu | A Deep Instance Generative Framework for MILP Solvers Under Limited Data
Availability | null | null | null | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In the past few years, there has been an explosive surge in the use of
machine learning (ML) techniques to address combinatorial optimization (CO)
problems, especially mixed-integer linear programs (MILPs). Despite the
achievements, the limited availability of real-world instances often leads to
sub-optimal decisions... | [
{
"created": "Wed, 4 Oct 2023 13:34:34 GMT",
"version": "v1"
},
{
"created": "Sat, 28 Oct 2023 12:10:46 GMT",
"version": "v2"
},
{
"created": "Mon, 11 Mar 2024 10:51:14 GMT",
"version": "v3"
}
] | 2024-03-12 | [
[
"Geng",
"Zijie",
""
],
[
"Li",
"Xijun",
""
],
[
"Wang",
"Jie",
""
],
[
"Li",
"Xiao",
""
],
[
"Zhang",
"Yongdong",
""
],
[
"Wu",
"Feng",
""
]
] | In the past few years, there has been an explosive surge in the use of machine learning (ML) techniques to address combinatorial optimization (CO) problems, especially mixed-integer linear programs (MILPs). Despite the achievements, the limited availability of real-world instances often leads to sub-optimal decisions a... |
2102.00287 | Eva Vanmassenhove | Eva Vanmassenhove, Dimitar Shterionov, Matthew Gwilliam | Machine Translationese: Effects of Algorithmic Bias on Linguistic
Complexity in Machine Translation | null | null | null | null | cs.CL cs.AI cs.CY | http://creativecommons.org/licenses/by/4.0/ | Recent studies in the field of Machine Translation (MT) and Natural Language
Processing (NLP) have shown that existing models amplify biases observed in the
training data. The amplification of biases in language technology has mainly
been examined with respect to specific phenomena, such as gender bias. In this
work,... | [
{
"created": "Sat, 30 Jan 2021 18:49:11 GMT",
"version": "v1"
}
] | 2021-02-02 | [
[
"Vanmassenhove",
"Eva",
""
],
[
"Shterionov",
"Dimitar",
""
],
[
"Gwilliam",
"Matthew",
""
]
] | Recent studies in the field of Machine Translation (MT) and Natural Language Processing (NLP) have shown that existing models amplify biases observed in the training data. The amplification of biases in language technology has mainly been examined with respect to specific phenomena, such as gender bias. In this work, w... |
0805.0873 | EDA Publishing Association | Hela Boussetta (TIMA), S. Basrour (TIMA), M. Marzencki (TIMA) | Top-Down Behavioral Modeling Methodology of a Piezoelectric
Microgenerator For Integrated Power Harvesting Systems | Submitted on behalf of EDA Publishing Association
(http://irevues.inist.fr/handle/2042/16838) | Dans Symposium on Design, Test, Integration and Packaging of
MEMS/MOEMS - DTIP 2008, Nice : France (2008) | null | null | cs.OH | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this study, we developed a top/down methodology for behavioral and
structural modeling of multi-domain microsystems. Then, we validated this
methodology through a study case : a piezoelectric microgenerator. We also
proved the effectiveness of VHDL-AMS language not only for modeling in
behavioral and structural le... | [
{
"created": "Wed, 7 May 2008 09:00:16 GMT",
"version": "v1"
}
] | 2008-12-18 | [
[
"Boussetta",
"Hela",
"",
"TIMA"
],
[
"Basrour",
"S.",
"",
"TIMA"
],
[
"Marzencki",
"M.",
"",
"TIMA"
]
] | In this study, we developed a top/down methodology for behavioral and structural modeling of multi-domain microsystems. Then, we validated this methodology through a study case : a piezoelectric microgenerator. We also proved the effectiveness of VHDL-AMS language not only for modeling in behavioral and structural leve... |
2405.00885 | Huai-An Su | Huai-an Su, Jiaxiang Geng, Liang Li, Xiaoqi Qin, Yanzhao Hou, Xin Fu
and Miao Pan | WHALE-FL: Wireless and Heterogeneity Aware Latency Efficient Federated
Learning over Mobile Devices via Adaptive Subnetwork Scheduling | null | null | null | null | cs.LG cs.NI eess.IV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | As a popular distributed learning paradigm, federated learning (FL) over
mobile devices fosters numerous applications, while their practical deployment
is hindered by participating devices' computing and communication
heterogeneity. Some pioneering research efforts proposed to extract subnetworks
from the global mode... | [
{
"created": "Wed, 1 May 2024 22:01:40 GMT",
"version": "v1"
}
] | 2024-05-03 | [
[
"Su",
"Huai-an",
""
],
[
"Geng",
"Jiaxiang",
""
],
[
"Li",
"Liang",
""
],
[
"Qin",
"Xiaoqi",
""
],
[
"Hou",
"Yanzhao",
""
],
[
"Fu",
"Xin",
""
],
[
"Pan",
"Miao",
""
]
] | As a popular distributed learning paradigm, federated learning (FL) over mobile devices fosters numerous applications, while their practical deployment is hindered by participating devices' computing and communication heterogeneity. Some pioneering research efforts proposed to extract subnetworks from the global model,... |
2402.15145 | Hongxun Wu | Xin Lyu, Hongxun Wu, Junzhao Yang | The Cost of Parallelizing Boosting | appeared in SODA 2024 | null | null | null | cs.LG cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We study the cost of parallelizing weak-to-strong boosting algorithms for
learning, following the recent work of Karbasi and Larsen. Our main results are
two-fold:
- First, we prove a tight lower bound, showing that even "slight"
parallelization of boosting requires an exponential blow-up in the complexity
of train... | [
{
"created": "Fri, 23 Feb 2024 07:03:52 GMT",
"version": "v1"
}
] | 2024-02-26 | [
[
"Lyu",
"Xin",
""
],
[
"Wu",
"Hongxun",
""
],
[
"Yang",
"Junzhao",
""
]
] | We study the cost of parallelizing weak-to-strong boosting algorithms for learning, following the recent work of Karbasi and Larsen. Our main results are two-fold: - First, we prove a tight lower bound, showing that even "slight" parallelization of boosting requires an exponential blow-up in the complexity of training.... |
2404.00728 | Luis Morales-Navarro | Luis Morales-Navarro and Yasmin B. Kafai | Investigating Youths' Everyday Understanding of Machine Learning
Applications: a Knowledge-in-Pieces Perspective | accepted for publication at Proceedings of the International
Conference of the Learning Sciences 2024 | null | null | null | cs.CY | http://creativecommons.org/licenses/by-nc-nd/4.0/ | Despite recent calls for including artificial intelligence (AI) literacy in
K-12 education, not enough attention has been paid to studying youths' everyday
knowledge about machine learning (ML). Most research has examined how youths
attribute intelligence to AI/ML systems. Other studies have centered on youths'
theor... | [
{
"created": "Sun, 31 Mar 2024 16:11:33 GMT",
"version": "v1"
}
] | 2024-04-02 | [
[
"Morales-Navarro",
"Luis",
""
],
[
"Kafai",
"Yasmin B.",
""
]
] | Despite recent calls for including artificial intelligence (AI) literacy in K-12 education, not enough attention has been paid to studying youths' everyday knowledge about machine learning (ML). Most research has examined how youths attribute intelligence to AI/ML systems. Other studies have centered on youths' theorie... |
2103.00497 | Aryan Asadian | Aryan Asadian, Amirali Salehi-Abari | Distilling Knowledge via Intermediate Classifiers | 8 pages, 2 figures | null | null | null | cs.LG cs.AI cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The crux of knowledge distillation is to effectively train a resource-limited
student model with the guide of a pre-trained larger teacher model. However,
when there is a large difference between the model complexities of teacher and
student (i.e., capacity gap), knowledge distillation loses its strength in
transferr... | [
{
"created": "Sun, 28 Feb 2021 12:52:52 GMT",
"version": "v1"
},
{
"created": "Mon, 31 May 2021 13:20:57 GMT",
"version": "v2"
}
] | 2021-06-01 | [
[
"Asadian",
"Aryan",
""
],
[
"Salehi-Abari",
"Amirali",
""
]
] | The crux of knowledge distillation is to effectively train a resource-limited student model with the guide of a pre-trained larger teacher model. However, when there is a large difference between the model complexities of teacher and student (i.e., capacity gap), knowledge distillation loses its strength in transferrin... |
1708.06805 | Jordi Levy | Carlos Ans\'otegui, Maria Luisa Bonet, Jordi Levy | Scale-Free Random SAT Instances | null | Algorithms 15(6): 219 (2022) | 10.3390/a15060219 | null | cs.CC math.CO math.PR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We focus on the random generation of SAT instances that have properties
similar to real-world instances. It is known that many industrial instances,
even with a great number of variables, can be solved by a clever solver in a
reasonable amount of time. This is not possible, in general, with classical
randomly generat... | [
{
"created": "Wed, 12 Jul 2017 19:21:19 GMT",
"version": "v1"
},
{
"created": "Tue, 9 Apr 2019 16:49:29 GMT",
"version": "v2"
},
{
"created": "Wed, 17 Jul 2019 21:49:35 GMT",
"version": "v3"
}
] | 2023-03-14 | [
[
"Ansótegui",
"Carlos",
""
],
[
"Bonet",
"Maria Luisa",
""
],
[
"Levy",
"Jordi",
""
]
] | We focus on the random generation of SAT instances that have properties similar to real-world instances. It is known that many industrial instances, even with a great number of variables, can be solved by a clever solver in a reasonable amount of time. This is not possible, in general, with classical randomly generated... |
1510.00921 | Chunhua Shen | Lingqiao Liu, Chunhua Shen, Anton van den Hengel | Cross-convolutional-layer Pooling for Image Recognition | Fixed typos. Journal extension of arXiv:1411.7466. Accepted to IEEE
Transactions on Pattern Analysis and Machine Intelligence | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Recent studies have shown that a Deep Convolutional Neural Network (DCNN)
pretrained on a large image dataset can be used as a universal image
descriptor, and that doing so leads to impressive performance for a variety of
image classification tasks. Most of these studies adopt activations from a
single DCNN layer, us... | [
{
"created": "Sun, 4 Oct 2015 10:27:36 GMT",
"version": "v1"
},
{
"created": "Thu, 9 Jun 2016 07:37:09 GMT",
"version": "v2"
},
{
"created": "Sun, 23 Oct 2016 05:48:16 GMT",
"version": "v3"
},
{
"created": "Wed, 7 Dec 2016 00:00:42 GMT",
"version": "v4"
},
{
"crea... | 2016-12-23 | [
[
"Liu",
"Lingqiao",
""
],
[
"Shen",
"Chunhua",
""
],
[
"Hengel",
"Anton van den",
""
]
] | Recent studies have shown that a Deep Convolutional Neural Network (DCNN) pretrained on a large image dataset can be used as a universal image descriptor, and that doing so leads to impressive performance for a variety of image classification tasks. Most of these studies adopt activations from a single DCNN layer, usua... |
2403.15122 | Sacha-\'Elie Ayoun | Sacha-\'Elie Ayoun, Xavier Denis, Petar Maksimovi\'c, Philippa Gardner | A hybrid approach to semi-automated Rust verification | 22 pages, 8 figures, preprint | null | null | null | cs.PL | http://creativecommons.org/licenses/by/4.0/ | While recent years have been witness to a large body of work on efficient and
automated verification of safe Rust code, enabled by the rich guarantees of the
Rust type system, much less progress has been made on reasoning about unsafe
code due to its unique complexities. We propose a hybrid approach to end-to-end
Rus... | [
{
"created": "Fri, 22 Mar 2024 11:24:31 GMT",
"version": "v1"
}
] | 2024-03-25 | [
[
"Ayoun",
"Sacha-Élie",
""
],
[
"Denis",
"Xavier",
""
],
[
"Maksimović",
"Petar",
""
],
[
"Gardner",
"Philippa",
""
]
] | While recent years have been witness to a large body of work on efficient and automated verification of safe Rust code, enabled by the rich guarantees of the Rust type system, much less progress has been made on reasoning about unsafe code due to its unique complexities. We propose a hybrid approach to end-to-end Rust ... |
0909.3648 | Joel Ratsaby | Joel Ratsaby | Random scattering of bits by prediction | null | null | null | null | cs.AI cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We investigate a population of binary mistake sequences that result from
learning with parametric models of different order. We obtain estimates of
their error, algorithmic complexity and divergence from a purely random
Bernoulli sequence. We study the relationship of these variables to the
learner's information dens... | [
{
"created": "Sun, 20 Sep 2009 18:10:55 GMT",
"version": "v1"
},
{
"created": "Wed, 13 Oct 2010 19:03:58 GMT",
"version": "v2"
}
] | 2010-10-14 | [
[
"Ratsaby",
"Joel",
""
]
] | We investigate a population of binary mistake sequences that result from learning with parametric models of different order. We obtain estimates of their error, algorithmic complexity and divergence from a purely random Bernoulli sequence. We study the relationship of these variables to the learner's information densit... |
cs/0611048 | Richard Mayr | Parosh Abdulla, Pritha Mahata, Richard Mayr | Dense-Timed Petri Nets: Checking Zenoness, Token liveness and
Boundedness | 61 pages, 18 figures | Logical Methods in Computer Science, Volume 3, Issue 1 (February
7, 2007) lmcs:2223 | 10.2168/LMCS-3(1:1)2007 | null | cs.LO | null | We consider Dense-Timed Petri Nets (TPN), an extension of Petri nets in which
each token is equipped with a real-valued clock and where the semantics is lazy
(i.e., enabled transitions need not fire; time can pass and disable
transitions). We consider the following verification problems for TPNs. (i)
Zenoness: whethe... | [
{
"created": "Sat, 11 Nov 2006 00:08:46 GMT",
"version": "v1"
},
{
"created": "Tue, 23 Jan 2007 13:33:21 GMT",
"version": "v2"
}
] | 2017-01-11 | [
[
"Abdulla",
"Parosh",
""
],
[
"Mahata",
"Pritha",
""
],
[
"Mayr",
"Richard",
""
]
] | We consider Dense-Timed Petri Nets (TPN), an extension of Petri nets in which each token is equipped with a real-valued clock and where the semantics is lazy (i.e., enabled transitions need not fire; time can pass and disable transitions). We consider the following verification problems for TPNs. (i) Zenoness: whether ... |
1202.0533 | Mark Wilde | Saikat Guha and Mark M. Wilde | Polar coding to achieve the Holevo capacity of a pure-loss optical
channel | 5 pages, submission to the 2012 International Symposium on
Information Theory (ISIT 2012), Boston, MA, USA; v2 accepted to ISIT 2012 | Proceedings of the 2012 IEEE International Symposium on
Information Theory (ISIT 2012), pages 546-550, Cambridge, MA, USA | 10.1109/ISIT.2012.6284250 | null | cs.IT math.IT quant-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In the low-energy high-energy-efficiency regime of classical optical
communications---relevant to deep-space optical channels---there is a big gap
between reliable communication rates achievable via conventional optical
receivers and the ultimate (Holevo) capacity. Achieving the Holevo capacity
requires not only opti... | [
{
"created": "Thu, 2 Feb 2012 20:01:30 GMT",
"version": "v1"
},
{
"created": "Tue, 22 May 2012 12:22:05 GMT",
"version": "v2"
}
] | 2012-09-04 | [
[
"Guha",
"Saikat",
""
],
[
"Wilde",
"Mark M.",
""
]
] | In the low-energy high-energy-efficiency regime of classical optical communications---relevant to deep-space optical channels---there is a big gap between reliable communication rates achievable via conventional optical receivers and the ultimate (Holevo) capacity. Achieving the Holevo capacity requires not only optima... |
1910.10307 | Vahdat Abdelzad | Vahdat Abdelzad, Krzysztof Czarnecki, Rick Salay, Taylor Denounden,
Sachin Vernekar, Buu Phan | Detecting Out-of-Distribution Inputs in Deep Neural Networks Using an
Early-Layer Output | 15 pages, 8 figures | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Deep neural networks achieve superior performance in challenging tasks such
as image classification. However, deep classifiers tend to incorrectly classify
out-of-distribution (OOD) inputs, which are inputs that do not belong to the
classifier training distribution. Several approaches have been proposed to
detect OOD... | [
{
"created": "Wed, 23 Oct 2019 01:27:48 GMT",
"version": "v1"
}
] | 2019-10-24 | [
[
"Abdelzad",
"Vahdat",
""
],
[
"Czarnecki",
"Krzysztof",
""
],
[
"Salay",
"Rick",
""
],
[
"Denounden",
"Taylor",
""
],
[
"Vernekar",
"Sachin",
""
],
[
"Phan",
"Buu",
""
]
] | Deep neural networks achieve superior performance in challenging tasks such as image classification. However, deep classifiers tend to incorrectly classify out-of-distribution (OOD) inputs, which are inputs that do not belong to the classifier training distribution. Several approaches have been proposed to detect OOD i... |
cs/0703072 | Paul Fodor | Paul Fodor | Domain Directed Dialogs for Decision Processes | null | null | null | null | cs.OH | null | The search for a standardized optimum way to communicate using natural
language dialog has involved a lot of research. However, due to the diversity
of communication domains, we think that this is extremely difficult to achieve
and different dialogue management techniques should be applied for different
situations. O... | [
{
"created": "Thu, 15 Mar 2007 00:08:50 GMT",
"version": "v1"
},
{
"created": "Thu, 22 Mar 2007 14:54:41 GMT",
"version": "v2"
},
{
"created": "Tue, 27 Mar 2007 15:41:54 GMT",
"version": "v3"
}
] | 2007-05-23 | [
[
"Fodor",
"Paul",
""
]
] | The search for a standardized optimum way to communicate using natural language dialog has involved a lot of research. However, due to the diversity of communication domains, we think that this is extremely difficult to achieve and different dialogue management techniques should be applied for different situations. Our... |
1410.0265 | Chao Li | Chao Li, Michael Hay, Gerome Miklau, Yue Wang | A Data- and Workload-Aware Algorithm for Range Queries Under
Differential Privacy | VLDB 2014 | null | null | null | cs.DB | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We describe a new algorithm for answering a given set of range queries under
$\epsilon$-differential privacy which often achieves substantially lower error
than competing methods. Our algorithm satisfies differential privacy by adding
noise that is adapted to the input data and to the given query set. We first
privat... | [
{
"created": "Wed, 1 Oct 2014 15:56:42 GMT",
"version": "v1"
}
] | 2014-10-02 | [
[
"Li",
"Chao",
""
],
[
"Hay",
"Michael",
""
],
[
"Miklau",
"Gerome",
""
],
[
"Wang",
"Yue",
""
]
] | We describe a new algorithm for answering a given set of range queries under $\epsilon$-differential privacy which often achieves substantially lower error than competing methods. Our algorithm satisfies differential privacy by adding noise that is adapted to the input data and to the given query set. We first privatel... |
1806.06084 | Ramik Sadana | Ramik Sadana, Meeshu Agnihotri, John Stasko | Touching Data: A Discoverability-based Evaluation of a Visualization
Interface for Tablet Computers | 10 pages, 3 figures, 7 tabels | null | null | null | cs.HC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | While a number of touch-based visualization systems have appeared in recent
years, relatively little work has been done to evaluate these systems. The
prevailing methods compare these systems to desktop-class applications or
utilize traditional training-based usability studies. We argue that existing
studies, while u... | [
{
"created": "Fri, 15 Jun 2018 18:17:34 GMT",
"version": "v1"
}
] | 2018-06-19 | [
[
"Sadana",
"Ramik",
""
],
[
"Agnihotri",
"Meeshu",
""
],
[
"Stasko",
"John",
""
]
] | While a number of touch-based visualization systems have appeared in recent years, relatively little work has been done to evaluate these systems. The prevailing methods compare these systems to desktop-class applications or utilize traditional training-based usability studies. We argue that existing studies, while use... |
1611.07804 | Nikita Astrakhantsev | N. Astrakhantsev | ATR4S: Toolkit with State-of-the-art Automatic Terms Recognition Methods
in Scala | null | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Automatically recognized terminology is widely used for various
domain-specific texts processing tasks, such as machine translation,
information retrieval or sentiment analysis. However, there is still no
agreement on which methods are best suited for particular settings and,
moreover, there is no reliable comparison... | [
{
"created": "Wed, 23 Nov 2016 14:14:52 GMT",
"version": "v1"
}
] | 2016-11-24 | [
[
"Astrakhantsev",
"N.",
""
]
] | Automatically recognized terminology is widely used for various domain-specific texts processing tasks, such as machine translation, information retrieval or sentiment analysis. However, there is still no agreement on which methods are best suited for particular settings and, moreover, there is no reliable comparison o... |
2203.08037 | Yang Yang | Yang Yang, Xibai Lou, Changhyun Choi | Interactive Robotic Grasping with Attribute-Guided Disambiguation | Accepted to the IEEE International Conference on Robotics and
Automation (ICRA 2022). Project page:
https://sites.google.com/umn.edu/attr-disam | null | null | null | cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Interactive robotic grasping using natural language is one of the most
fundamental tasks in human-robot interaction. However, language can be a source
of ambiguity, particularly when there are ambiguous visual or linguistic
contents. This paper investigates the use of object attributes in
disambiguation and develops ... | [
{
"created": "Tue, 15 Mar 2022 16:17:36 GMT",
"version": "v1"
}
] | 2022-03-16 | [
[
"Yang",
"Yang",
""
],
[
"Lou",
"Xibai",
""
],
[
"Choi",
"Changhyun",
""
]
] | Interactive robotic grasping using natural language is one of the most fundamental tasks in human-robot interaction. However, language can be a source of ambiguity, particularly when there are ambiguous visual or linguistic contents. This paper investigates the use of object attributes in disambiguation and develops an... |
2402.15392 | Filippo Lazzati | Filippo Lazzati, Mirco Mutti, Alberto Maria Metelli | Offline Inverse RL: New Solution Concepts and Provably Efficient
Algorithms | International Conference on Machine Learning 41 (ICML 2024) | null | null | null | cs.LG | http://creativecommons.org/licenses/by/4.0/ | Inverse reinforcement learning (IRL) aims to recover the reward function of
an expert agent from demonstrations of behavior. It is well-known that the IRL
problem is fundamentally ill-posed, i.e., many reward functions can explain the
demonstrations. For this reason, IRL has been recently reframed in terms of
estimat... | [
{
"created": "Fri, 23 Feb 2024 15:49:46 GMT",
"version": "v1"
},
{
"created": "Thu, 6 Jun 2024 06:49:52 GMT",
"version": "v2"
}
] | 2024-06-07 | [
[
"Lazzati",
"Filippo",
""
],
[
"Mutti",
"Mirco",
""
],
[
"Metelli",
"Alberto Maria",
""
]
] | Inverse reinforcement learning (IRL) aims to recover the reward function of an expert agent from demonstrations of behavior. It is well-known that the IRL problem is fundamentally ill-posed, i.e., many reward functions can explain the demonstrations. For this reason, IRL has been recently reframed in terms of estimatin... |
2401.00781 | Shuang Li | Shuang Li, Ziyuan Pu, Zhiyong Cui, Seunghyeon Lee, Xiucheng Guo, Dong
Ngoduy | Inferring Heterogeneous Treatment Effects of Crashes on Highway Traffic:
A Doubly Robust Causal Machine Learning Approach | 38 pages, 13 figures, 8 tables | null | null | null | cs.LG stat.ML | http://creativecommons.org/licenses/by/4.0/ | Highway traffic crashes exert a considerable impact on both transportation
systems and the economy. In this context, accurate and dependable emergency
responses are crucial for effective traffic management. However, the influence
of crashes on traffic status varies across diverse factors and may be biased
due to sele... | [
{
"created": "Mon, 1 Jan 2024 15:03:14 GMT",
"version": "v1"
}
] | 2024-01-02 | [
[
"Li",
"Shuang",
""
],
[
"Pu",
"Ziyuan",
""
],
[
"Cui",
"Zhiyong",
""
],
[
"Lee",
"Seunghyeon",
""
],
[
"Guo",
"Xiucheng",
""
],
[
"Ngoduy",
"Dong",
""
]
] | Highway traffic crashes exert a considerable impact on both transportation systems and the economy. In this context, accurate and dependable emergency responses are crucial for effective traffic management. However, the influence of crashes on traffic status varies across diverse factors and may be biased due to select... |
2211.13853 | Sutanay Choudhury | Hatem Helal, Jesun Firoz, Jenna Bilbrey, Mario Michael Krell, Tom
Murray, Ang Li, Sotiris Xantheas, Sutanay Choudhury | Extreme Acceleration of Graph Neural Network-based Prediction Models for
Quantum Chemistry | null | null | null | null | cs.LG cs.AR physics.chem-ph | http://creativecommons.org/licenses/by/4.0/ | Molecular property calculations are the bedrock of chemical physics.
High-fidelity \textit{ab initio} modeling techniques for computing the
molecular properties can be prohibitively expensive, and motivate the
development of machine-learning models that make the same predictions more
efficiently. Training graph neura... | [
{
"created": "Fri, 25 Nov 2022 01:30:18 GMT",
"version": "v1"
}
] | 2022-11-28 | [
[
"Helal",
"Hatem",
""
],
[
"Firoz",
"Jesun",
""
],
[
"Bilbrey",
"Jenna",
""
],
[
"Krell",
"Mario Michael",
""
],
[
"Murray",
"Tom",
""
],
[
"Li",
"Ang",
""
],
[
"Xantheas",
"Sotiris",
""
],
[
"Choudh... | Molecular property calculations are the bedrock of chemical physics. High-fidelity \textit{ab initio} modeling techniques for computing the molecular properties can be prohibitively expensive, and motivate the development of machine-learning models that make the same predictions more efficiently. Training graph neural ... |
2312.07106 | Michael Unterkalmsteiner | Eriks Klotins, Michael Unterkalmsteiner, Panagiota Chatzipetrou, Tony
Gorschek, Rafael Prikladnicki, Nirnaya Tripathi, Leandro Bento Pompermaier | A Progression Model of Software Engineering Goals, Challenges, and
Practices in Start-Ups | null | IEEE Trans. Software Eng. 47(3): 498-521 (2021) | 10.1109/TSE.2019.2900213 | null | cs.SE | http://creativecommons.org/licenses/by-nc-sa/4.0/ | Context: Software start-ups are emerging as suppliers of innovation and
software-intensive products. However, traditional software engineering
practices are not evaluated in the context, nor adopted to goals and challenges
of start-ups. As a result, there is insufficient support for software
engineering in the start-... | [
{
"created": "Tue, 12 Dec 2023 09:36:43 GMT",
"version": "v1"
}
] | 2023-12-13 | [
[
"Klotins",
"Eriks",
""
],
[
"Unterkalmsteiner",
"Michael",
""
],
[
"Chatzipetrou",
"Panagiota",
""
],
[
"Gorschek",
"Tony",
""
],
[
"Prikladnicki",
"Rafael",
""
],
[
"Tripathi",
"Nirnaya",
""
],
[
"Pompermaier",
... | Context: Software start-ups are emerging as suppliers of innovation and software-intensive products. However, traditional software engineering practices are not evaluated in the context, nor adopted to goals and challenges of start-ups. As a result, there is insufficient support for software engineering in the start-up... |
1811.06992 | Chris Ying | Chris Ying, Sameer Kumar, Dehao Chen, Tao Wang, Youlong Cheng | Image Classification at Supercomputer Scale | Presented as part of Systems for ML Workshop @ NIPS 2018 | null | null | null | cs.LG cs.DC stat.ML | http://creativecommons.org/licenses/by-nc-sa/4.0/ | Deep learning is extremely computationally intensive, and hardware vendors
have responded by building faster accelerators in large clusters. Training deep
learning models at petaFLOPS scale requires overcoming both algorithmic and
systems software challenges. In this paper, we discuss three systems-related
optimizati... | [
{
"created": "Fri, 16 Nov 2018 19:01:40 GMT",
"version": "v1"
},
{
"created": "Sun, 2 Dec 2018 01:30:42 GMT",
"version": "v2"
}
] | 2018-12-04 | [
[
"Ying",
"Chris",
""
],
[
"Kumar",
"Sameer",
""
],
[
"Chen",
"Dehao",
""
],
[
"Wang",
"Tao",
""
],
[
"Cheng",
"Youlong",
""
]
] | Deep learning is extremely computationally intensive, and hardware vendors have responded by building faster accelerators in large clusters. Training deep learning models at petaFLOPS scale requires overcoming both algorithmic and systems software challenges. In this paper, we discuss three systems-related optimization... |
2303.05919 | Yuxin Su | Zhilu Lian, Yangzi Li, Zhixiang Chen, Shiwen Shan, Baoxin Han, Yuxin
Su | eBPF-based Working Set Size Estimation in Memory Management | 8 pages, 6 figures | null | 10.1109/ICSS55994.2022.00036 | null | cs.PF cs.AR cs.LG | http://creativecommons.org/licenses/by/4.0/ | Working set size estimation (WSS) is of great significance to improve the
efficiency of program executing and memory arrangement in modern operating
systems. Previous work proposed several methods to estimate WSS, including
self-balloning, Zballoning and so on. However, these methods which are based on
virtual machin... | [
{
"created": "Tue, 17 Jan 2023 03:12:35 GMT",
"version": "v1"
}
] | 2023-03-13 | [
[
"Lian",
"Zhilu",
""
],
[
"Li",
"Yangzi",
""
],
[
"Chen",
"Zhixiang",
""
],
[
"Shan",
"Shiwen",
""
],
[
"Han",
"Baoxin",
""
],
[
"Su",
"Yuxin",
""
]
] | Working set size estimation (WSS) is of great significance to improve the efficiency of program executing and memory arrangement in modern operating systems. Previous work proposed several methods to estimate WSS, including self-balloning, Zballoning and so on. However, these methods which are based on virtual machine ... |
1208.4632 | EPTCS | Minas Charalambides (University of Illinois at Urbana-Champaign),
Peter Dinges (University of Illinois at Urbana-Champaign), Gul Agha
(University of Illinois at Urbana-Champaign) | Parameterized Concurrent Multi-Party Session Types | In Proceedings FOCLASA 2012, arXiv:1208.4327 | EPTCS 91, 2012, pp. 16-30 | 10.4204/EPTCS.91.2 | null | cs.PL cs.DC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Session types have been proposed as a means of statically verifying
implementations of communication protocols. Although prior work has been
successful in verifying some classes of protocols, it does not cope well with
parameterized, multi-actor scenarios with inherent asynchrony. For example, the
sliding window prot... | [
{
"created": "Wed, 22 Aug 2012 21:58:46 GMT",
"version": "v1"
}
] | 2012-08-24 | [
[
"Charalambides",
"Minas",
"",
"University of Illinois at Urbana-Champaign"
],
[
"Dinges",
"Peter",
"",
"University of Illinois at Urbana-Champaign"
],
[
"Agha",
"Gul",
"",
"University of Illinois at Urbana-Champaign"
]
] | Session types have been proposed as a means of statically verifying implementations of communication protocols. Although prior work has been successful in verifying some classes of protocols, it does not cope well with parameterized, multi-actor scenarios with inherent asynchrony. For example, the sliding window protoc... |
0801.2588 | K. Raj Kumar | K. Raj Kumar and Giuseppe Caire | Coding and Decoding for the Dynamic Decode and Forward Relay Protocol | Submitted to the IEEE Transactions on Information Theory | null | null | null | cs.IT math.IT | null | We study the Dynamic Decode and Forward (DDF) protocol for a single
half-duplex relay, single-antenna channel with quasi-static fading. The DDF
protocol is well-known and has been analyzed in terms of the
Diversity-Multiplexing Tradeoff (DMT) in the infinite block length limit. We
characterize the finite block length... | [
{
"created": "Wed, 16 Jan 2008 23:05:12 GMT",
"version": "v1"
}
] | 2008-01-18 | [
[
"Kumar",
"K. Raj",
""
],
[
"Caire",
"Giuseppe",
""
]
] | We study the Dynamic Decode and Forward (DDF) protocol for a single half-duplex relay, single-antenna channel with quasi-static fading. The DDF protocol is well-known and has been analyzed in terms of the Diversity-Multiplexing Tradeoff (DMT) in the infinite block length limit. We characterize the finite block length D... |
2204.04717 | Kheeran K. Naidu | Cezar-Mihail Alexandru, Pavel Dvo\v{r}\'ak, Christian Konrad, Kheeran
K. Naidu | Improved Weighted Matching in the Sliding Window Model | null | null | null | null | cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We consider the Maximum-weight Matching (MWM) problem in the streaming
sliding window model of computation. In this model, the input consists of a
sequence of weighted edges on a given vertex set $V$ of size $n$. The objective
is to maintain an approximation of a maximum-weight matching in the graph
spanned by the $L... | [
{
"created": "Sun, 10 Apr 2022 16:26:11 GMT",
"version": "v1"
},
{
"created": "Tue, 10 Jan 2023 15:22:03 GMT",
"version": "v2"
}
] | 2023-01-11 | [
[
"Alexandru",
"Cezar-Mihail",
""
],
[
"Dvořák",
"Pavel",
""
],
[
"Konrad",
"Christian",
""
],
[
"Naidu",
"Kheeran K.",
""
]
] | We consider the Maximum-weight Matching (MWM) problem in the streaming sliding window model of computation. In this model, the input consists of a sequence of weighted edges on a given vertex set $V$ of size $n$. The objective is to maintain an approximation of a maximum-weight matching in the graph spanned by the $L$ ... |
2405.02047 | Martin Kumm | Andreas B\"ottcher, Martin Kumm | Small Logic-based Multipliers with Incomplete Sub-Multipliers for FPGAs | Preprint, to appear at ARITH 2024 (http://arith24.arithsymposium.org)
and IEEEXplore | null | null | null | cs.AR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | There is a recent trend in artificial intelligence (AI) inference towards
lower precision data formats down to 8 bits and less. As multiplication is the
most complex operation in typical inference tasks, there is a large demand for
efficient small multipliers. The large DSP blocks have limitations implementing
many s... | [
{
"created": "Fri, 3 May 2024 12:29:07 GMT",
"version": "v1"
}
] | 2024-05-06 | [
[
"Böttcher",
"Andreas",
""
],
[
"Kumm",
"Martin",
""
]
] | There is a recent trend in artificial intelligence (AI) inference towards lower precision data formats down to 8 bits and less. As multiplication is the most complex operation in typical inference tasks, there is a large demand for efficient small multipliers. The large DSP blocks have limitations implementing many sma... |
1905.10464 | Mamoru Komachi | Tosho Hirasawa and Mamoru Komachi | Debiasing Word Embeddings Improves Multimodal Machine Translation | 11 pages; MT Summit 2019 (camera ready) | null | null | null | cs.CL | http://creativecommons.org/licenses/by/4.0/ | In recent years, pretrained word embeddings have proved useful for multimodal
neural machine translation (NMT) models to address the shortage of available
datasets. However, the integration of pretrained word embeddings has not yet
been explored extensively. Further, pretrained word embeddings in high
dimensional spa... | [
{
"created": "Fri, 24 May 2019 22:11:57 GMT",
"version": "v1"
},
{
"created": "Tue, 28 May 2019 22:46:58 GMT",
"version": "v2"
},
{
"created": "Sat, 22 Jun 2019 07:50:03 GMT",
"version": "v3"
}
] | 2019-06-25 | [
[
"Hirasawa",
"Tosho",
""
],
[
"Komachi",
"Mamoru",
""
]
] | In recent years, pretrained word embeddings have proved useful for multimodal neural machine translation (NMT) models to address the shortage of available datasets. However, the integration of pretrained word embeddings has not yet been explored extensively. Further, pretrained word embeddings in high dimensional space... |
2311.14762 | Benjamin Kiefer | Benjamin Kiefer, Lojze \v{Z}ust, Matej Kristan, Janez Per\v{s}, Matija
Ter\v{s}ek, Arnold Wiliem, Martin Messmer, Cheng-Yen Yang, Hsiang-Wei Huang,
Zhongyu Jiang, Heng-Cheng Kuo, Jie Mei, Jenq-Neng Hwang, Daniel Stadler, Lars
Sommer, Kaer Huang, Aiguo Zheng, Weitu Chong, Kanokphan Lertniphonphan, Jun
Xie, Feng ... | The 2nd Workshop on Maritime Computer Vision (MaCVi) 2024 | Part of 2nd Workshop on Maritime Computer Vision (MaCVi) 2024 IEEE
Xplore submission as part of WACV 2024 | null | null | null | cs.CV cs.AI | http://creativecommons.org/licenses/by/4.0/ | The 2nd Workshop on Maritime Computer Vision (MaCVi) 2024 addresses maritime
computer vision for Unmanned Aerial Vehicles (UAV) and Unmanned Surface
Vehicles (USV). Three challenges categories are considered: (i) UAV-based
Maritime Object Tracking with Re-identification, (ii) USV-based Maritime
Obstacle Segmentation ... | [
{
"created": "Thu, 23 Nov 2023 21:01:14 GMT",
"version": "v1"
}
] | 2023-11-28 | [
[
"Kiefer",
"Benjamin",
""
],
[
"Žust",
"Lojze",
""
],
[
"Kristan",
"Matej",
""
],
[
"Perš",
"Janez",
""
],
[
"Teršek",
"Matija",
""
],
[
"Wiliem",
"Arnold",
""
],
[
"Messmer",
"Martin",
""
],
[
"Yang... | The 2nd Workshop on Maritime Computer Vision (MaCVi) 2024 addresses maritime computer vision for Unmanned Aerial Vehicles (UAV) and Unmanned Surface Vehicles (USV). Three challenges categories are considered: (i) UAV-based Maritime Object Tracking with Re-identification, (ii) USV-based Maritime Obstacle Segmentation an... |
2107.14388 | Yongxiang Gu | Yongxiang Gu, Qianlei Wang, Xiaolin Qin | Real-time Streaming Perception System for Autonomous Driving | 6 pages,6 figures | null | null | null | cs.CV | http://creativecommons.org/licenses/by/4.0/ | Nowadays, plenty of deep learning technologies are being applied to all
aspects of autonomous driving with promising results. Among them, object
detection is the key to improve the ability of an autonomous agent to perceive
its environment so that it can (re)act. However, previous vision-based object
detectors cannot... | [
{
"created": "Fri, 30 Jul 2021 01:32:44 GMT",
"version": "v1"
}
] | 2021-08-02 | [
[
"Gu",
"Yongxiang",
""
],
[
"Wang",
"Qianlei",
""
],
[
"Qin",
"Xiaolin",
""
]
] | Nowadays, plenty of deep learning technologies are being applied to all aspects of autonomous driving with promising results. Among them, object detection is the key to improve the ability of an autonomous agent to perceive its environment so that it can (re)act. However, previous vision-based object detectors cannot a... |
1701.02009 | Alexander Zhdanov | Alexander Zhdanov | IRA codes derived from Gruenbaum graph | null | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we consider coding of short data frames (192 bits) by IRA
codes. A new interleaver for the IRA codes based on a Gruenbaum graph is
proposed. The difference of the proposed algorithm from known methods consists
in the following: permutation is performed by using a match smaller interleaver
which is deri... | [
{
"created": "Sun, 8 Jan 2017 19:59:35 GMT",
"version": "v1"
}
] | 2017-01-10 | [
[
"Zhdanov",
"Alexander",
""
]
] | In this paper, we consider coding of short data frames (192 bits) by IRA codes. A new interleaver for the IRA codes based on a Gruenbaum graph is proposed. The difference of the proposed algorithm from known methods consists in the following: permutation is performed by using a match smaller interleaver which is derive... |
2312.06875 | Ryan Beckett | Siva Kesava Reddy Kakarla, Ryan Beckett | Oracle-based Protocol Testing with Eywa | null | null | null | null | cs.NI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We present oracle-based testing a new technique for automatic black-box
testing of network protocol implementations. Oracle-based testing leverages
recent advances in LLMs to build rich models of intended protocol behavior from
knowledge embedded in RFCs, blogs, forums, and other natural language sources.
From these ... | [
{
"created": "Mon, 11 Dec 2023 22:51:15 GMT",
"version": "v1"
}
] | 2023-12-13 | [
[
"Kakarla",
"Siva Kesava Reddy",
""
],
[
"Beckett",
"Ryan",
""
]
] | We present oracle-based testing a new technique for automatic black-box testing of network protocol implementations. Oracle-based testing leverages recent advances in LLMs to build rich models of intended protocol behavior from knowledge embedded in RFCs, blogs, forums, and other natural language sources. From these mo... |
cs/0410004 | Andras Lorincz | I. Szita and A. Lorincz | Applying Policy Iteration for Training Recurrent Neural Networks | Supplementary material. 17 papes, 1 figure | null | null | null | cs.AI cs.LG cs.NE | null | Recurrent neural networks are often used for learning time-series data. Based
on a few assumptions we model this learning task as a minimization problem of a
nonlinear least-squares cost function. The special structure of the cost
function allows us to build a connection to reinforcement learning. We exploit
this con... | [
{
"created": "Sat, 2 Oct 2004 07:19:49 GMT",
"version": "v1"
}
] | 2007-05-23 | [
[
"Szita",
"I.",
""
],
[
"Lorincz",
"A.",
""
]
] | Recurrent neural networks are often used for learning time-series data. Based on a few assumptions we model this learning task as a minimization problem of a nonlinear least-squares cost function. The special structure of the cost function allows us to build a connection to reinforcement learning. We exploit this conne... |
2405.16487 | Tyler Han | Tyler Han, Sidharth Talia, Rohan Panicker, Preet Shah, Neel Jawale,
Byron Boots | Dynamics Models in the Aggressive Off-Road Driving Regime | Accepted to ICRA 2024 Workshop on Resilient Off-road Autonomy | null | null | null | cs.RO | http://creativecommons.org/licenses/by/4.0/ | Current developments in autonomous off-road driving are steadily increasing
performance through higher speeds and more challenging, unstructured
environments. However, this operating regime subjects the vehicle to larger
inertial effects, where consideration of higher-order states is necessary to
avoid failures such ... | [
{
"created": "Sun, 26 May 2024 08:52:16 GMT",
"version": "v1"
}
] | 2024-05-28 | [
[
"Han",
"Tyler",
""
],
[
"Talia",
"Sidharth",
""
],
[
"Panicker",
"Rohan",
""
],
[
"Shah",
"Preet",
""
],
[
"Jawale",
"Neel",
""
],
[
"Boots",
"Byron",
""
]
] | Current developments in autonomous off-road driving are steadily increasing performance through higher speeds and more challenging, unstructured environments. However, this operating regime subjects the vehicle to larger inertial effects, where consideration of higher-order states is necessary to avoid failures such as... |
2008.04109 | Abdul Mueed Hafiz Dr. | Abdul Mueed Hafiz and Ghulam Mohiuddin Bhat | Deep Q-Network Based Multi-agent Reinforcement Learning with Binary
Action Agents | null | null | null | null | cs.LG cs.AI cs.MA cs.SY eess.SY stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Deep Q-Network (DQN) based multi-agent systems (MAS) for reinforcement
learning (RL) use various schemes where in the agents have to learn and
communicate. The learning is however specific to each agent and communication
may be satisfactorily designed for the agents. As more complex Deep QNetworks
come to the fore, t... | [
{
"created": "Thu, 6 Aug 2020 15:16:05 GMT",
"version": "v1"
}
] | 2020-08-11 | [
[
"Hafiz",
"Abdul Mueed",
""
],
[
"Bhat",
"Ghulam Mohiuddin",
""
]
] | Deep Q-Network (DQN) based multi-agent systems (MAS) for reinforcement learning (RL) use various schemes where in the agents have to learn and communicate. The learning is however specific to each agent and communication may be satisfactorily designed for the agents. As more complex Deep QNetworks come to the fore, the... |
2202.13057 | Vsevolod Nikulin | Vsevolod Nikulin and Jun Tani | Initialization of Latent Space Coordinates via Random Linear Projections
for Learning Robotic Sensory-Motor Sequences | 18 pages, 9 figures | null | null | null | cs.LG cs.RO | http://creativecommons.org/licenses/by/4.0/ | Robot kinematics data, despite being a high dimensional process, is highly
correlated, especially when considering motions grouped in certain primitives.
These almost linear correlations within primitives allow us to interpret the
motions as points drawn close to a union of low-dimensional linear subspaces in
the spa... | [
{
"created": "Sat, 26 Feb 2022 04:32:16 GMT",
"version": "v1"
}
] | 2022-03-01 | [
[
"Nikulin",
"Vsevolod",
""
],
[
"Tani",
"Jun",
""
]
] | Robot kinematics data, despite being a high dimensional process, is highly correlated, especially when considering motions grouped in certain primitives. These almost linear correlations within primitives allow us to interpret the motions as points drawn close to a union of low-dimensional linear subspaces in the space... |
2405.15092 | Evelyn Yee | Evelyn Yee and Alice Li and Chenyu Tang and Yeon Ho Jung and Ramamohan
Paturi and Leon Bergen | Dissociation of Faithful and Unfaithful Reasoning in LLMs | code published at
https://github.com/CoTErrorRecovery/CoTErrorRecovery | null | null | null | cs.AI cs.CL | http://creativecommons.org/licenses/by/4.0/ | Large language models (LLMs) improve their performance in downstream tasks
when they generate Chain of Thought reasoning text before producing an answer.
Our research investigates how LLMs recover from errors in Chain of Thought,
reaching the correct final answer despite mistakes in the reasoning text.
Through analys... | [
{
"created": "Thu, 23 May 2024 22:38:58 GMT",
"version": "v1"
}
] | 2024-05-27 | [
[
"Yee",
"Evelyn",
""
],
[
"Li",
"Alice",
""
],
[
"Tang",
"Chenyu",
""
],
[
"Jung",
"Yeon Ho",
""
],
[
"Paturi",
"Ramamohan",
""
],
[
"Bergen",
"Leon",
""
]
] | Large language models (LLMs) improve their performance in downstream tasks when they generate Chain of Thought reasoning text before producing an answer. Our research investigates how LLMs recover from errors in Chain of Thought, reaching the correct final answer despite mistakes in the reasoning text. Through analysis... |
1706.05893 | Simon Wacker | Simon Wacker | Signal Machine And Cellular Automaton Time-Optimal Quasi-Solutions Of
The Firing Squad/Mob Synchronisation Problem On Connected Graphs | null | null | null | null | cs.FL cs.DC cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We construct a time-optimal quasi-solution of the firing mob synchronisation
problem over finite, connected, and undirected multigraphs whose maximum
degrees are uniformly bounded by a constant. It is only a quasi-solution
because its number of states depends on the graph or, from another perspective,
does not depend... | [
{
"created": "Mon, 19 Jun 2017 11:47:45 GMT",
"version": "v1"
}
] | 2017-06-20 | [
[
"Wacker",
"Simon",
""
]
] | We construct a time-optimal quasi-solution of the firing mob synchronisation problem over finite, connected, and undirected multigraphs whose maximum degrees are uniformly bounded by a constant. It is only a quasi-solution because its number of states depends on the graph or, from another perspective, does not depend o... |
2403.00553 | Chantal Shaib | Chantal Shaib, Joe Barrow, Jiuding Sun, Alexa F. Siu, Byron C.
Wallace, Ani Nenkova | Standardizing the Measurement of Text Diversity: A Tool and a
Comparative Analysis of Scores | Preprint | null | null | null | cs.CL | http://creativecommons.org/licenses/by/4.0/ | The diversity across outputs generated by large language models shapes the
perception of their quality and utility. Prompt leaks, templated answer
structure, and canned responses across different interactions are readily
noticed by people, but there is no standard score to measure this aspect of
model behavior. In th... | [
{
"created": "Fri, 1 Mar 2024 14:23:12 GMT",
"version": "v1"
}
] | 2024-03-04 | [
[
"Shaib",
"Chantal",
""
],
[
"Barrow",
"Joe",
""
],
[
"Sun",
"Jiuding",
""
],
[
"Siu",
"Alexa F.",
""
],
[
"Wallace",
"Byron C.",
""
],
[
"Nenkova",
"Ani",
""
]
] | The diversity across outputs generated by large language models shapes the perception of their quality and utility. Prompt leaks, templated answer structure, and canned responses across different interactions are readily noticed by people, but there is no standard score to measure this aspect of model behavior. In this... |
2401.02861 | Marta Gomez-Barrero | Marta Gomez-Barrero, Javier Galbally | Reversing the Irreversible: A Survey on Inverse Biometrics | 18 pages, journal, survey | Elsevier Computers & Security, Volume 90, March 2020, 101700 | 10.1016/j.cose.2019.101700 | null | cs.CV | http://creativecommons.org/licenses/by/4.0/ | With the widespread use of biometric recognition, several issues related to
the privacy and security provided by this technology have been recently raised
and analysed. As a result, the early common belief among the biometrics
community of templates irreversibility has been proven wrong. It is now an
accepted fact th... | [
{
"created": "Fri, 5 Jan 2024 15:32:40 GMT",
"version": "v1"
}
] | 2024-01-08 | [
[
"Gomez-Barrero",
"Marta",
""
],
[
"Galbally",
"Javier",
""
]
] | With the widespread use of biometric recognition, several issues related to the privacy and security provided by this technology have been recently raised and analysed. As a result, the early common belief among the biometrics community of templates irreversibility has been proven wrong. It is now an accepted fact that... |
2105.01031 | Catherine Stinson | Catherine Stinson | Algorithms are not neutral: Bias in collaborative filtering | null | null | null | null | cs.CY cs.LG | http://creativecommons.org/licenses/by-nc-sa/4.0/ | Discussions of algorithmic bias tend to focus on examples where either the
data or the people building the algorithms are biased. This gives the
impression that clean data and good intentions could eliminate bias. The
neutrality of the algorithms themselves is defended by prominent Artificial
Intelligence researchers... | [
{
"created": "Mon, 3 May 2021 17:28:43 GMT",
"version": "v1"
}
] | 2021-05-04 | [
[
"Stinson",
"Catherine",
""
]
] | Discussions of algorithmic bias tend to focus on examples where either the data or the people building the algorithms are biased. This gives the impression that clean data and good intentions could eliminate bias. The neutrality of the algorithms themselves is defended by prominent Artificial Intelligence researchers. ... |
2107.10443 | Eugene Bagdasaryan | Eugene Bagdasaryan and Vitaly Shmatikov | Spinning Sequence-to-Sequence Models with Meta-Backdoors | Outdated. Superseded by arXiv:2112.05224 and published at IEEE S&P'22
with title: "Spinning Language Models: Risks of Propaganda-As-A-Service and
Countermeasures" | null | null | null | cs.CR cs.CL cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We investigate a new threat to neural sequence-to-sequence (seq2seq) models:
training-time attacks that cause models to "spin" their output and support a
certain sentiment when the input contains adversary-chosen trigger words. For
example, a summarization model will output positive summaries of any text that
mention... | [
{
"created": "Thu, 22 Jul 2021 03:41:52 GMT",
"version": "v1"
},
{
"created": "Mon, 10 Oct 2022 23:02:33 GMT",
"version": "v2"
}
] | 2022-10-12 | [
[
"Bagdasaryan",
"Eugene",
""
],
[
"Shmatikov",
"Vitaly",
""
]
] | We investigate a new threat to neural sequence-to-sequence (seq2seq) models: training-time attacks that cause models to "spin" their output and support a certain sentiment when the input contains adversary-chosen trigger words. For example, a summarization model will output positive summaries of any text that mentions ... |
2306.04004 | Vignesh Kothapalli | Vignesh Kothapalli | Randomized Schur Complement Views for Graph Contrastive Learning | ICML 2023 | null | null | null | cs.LG cs.SI | http://creativecommons.org/licenses/by/4.0/ | We introduce a randomized topological augmentor based on Schur complements
for Graph Contrastive Learning (GCL). Given a graph laplacian matrix, the
technique generates unbiased approximations of its Schur complements and treats
the corresponding graphs as augmented views. We discuss the benefits of our
approach, pro... | [
{
"created": "Tue, 6 Jun 2023 20:35:20 GMT",
"version": "v1"
}
] | 2023-06-08 | [
[
"Kothapalli",
"Vignesh",
""
]
] | We introduce a randomized topological augmentor based on Schur complements for Graph Contrastive Learning (GCL). Given a graph laplacian matrix, the technique generates unbiased approximations of its Schur complements and treats the corresponding graphs as augmented views. We discuss the benefits of our approach, provi... |
2403.02474 | Krishnapriya Vishnubhotla | Krishnapriya Vishnubhotla, Adam Hammond, Graeme Hirst, Saif M.
Mohammad | The Emotion Dynamics of Literary Novels | 8 pages plus appendices | null | null | null | cs.CL | http://creativecommons.org/licenses/by-sa/4.0/ | Stories are rich in the emotions they exhibit in their narratives and evoke
in the readers. The emotional journeys of the various characters within a story
are central to their appeal. Computational analysis of the emotions of novels,
however, has rarely examined the variation in the emotional trajectories of the
dif... | [
{
"created": "Mon, 4 Mar 2024 20:39:21 GMT",
"version": "v1"
}
] | 2024-03-06 | [
[
"Vishnubhotla",
"Krishnapriya",
""
],
[
"Hammond",
"Adam",
""
],
[
"Hirst",
"Graeme",
""
],
[
"Mohammad",
"Saif M.",
""
]
] | Stories are rich in the emotions they exhibit in their narratives and evoke in the readers. The emotional journeys of the various characters within a story are central to their appeal. Computational analysis of the emotions of novels, however, has rarely examined the variation in the emotional trajectories of the diffe... |
1112.0221 | John Fearnley | John Fearnley (University of Liverpool), Sven Schewe (University of
Liverpool) | Time and Parallelizability Results for Parity Games with Bounded Tree
and DAG Width | null | Logical Methods in Computer Science, Volume 9, Issue 2 (June 18,
2013) lmcs:791 | 10.2168/LMCS-9(2:6)2013 | null | cs.GT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Parity games are a much researched class of games in NP intersect CoNP that
are not known to be in P. Consequently, researchers have considered specialised
algorithms for the case where certain graph parameters are small. In this
paper, we study parity games on graphs with bounded treewidth, and graphs with
bounded D... | [
{
"created": "Thu, 1 Dec 2011 16:05:26 GMT",
"version": "v1"
},
{
"created": "Thu, 9 Feb 2012 15:42:30 GMT",
"version": "v2"
},
{
"created": "Mon, 10 Sep 2012 15:43:53 GMT",
"version": "v3"
},
{
"created": "Tue, 16 Apr 2013 15:52:27 GMT",
"version": "v4"
},
{
"cre... | 2015-07-01 | [
[
"Fearnley",
"John",
"",
"University of Liverpool"
],
[
"Schewe",
"Sven",
"",
"University of\n Liverpool"
]
] | Parity games are a much researched class of games in NP intersect CoNP that are not known to be in P. Consequently, researchers have considered specialised algorithms for the case where certain graph parameters are small. In this paper, we study parity games on graphs with bounded treewidth, and graphs with bounded DAG... |
1912.08954 | Guanbin Li | Jihan Yang, Ruijia Xu, Ruiyu Li, Xiaojuan Qi, Xiaoyong Shen, Guanbin
Li, Liang Lin | An Adversarial Perturbation Oriented Domain Adaptation Approach for
Semantic Segmentation | To Appear in AAAI2020 | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We focus on Unsupervised Domain Adaptation (UDA) for the task of semantic
segmentation. Recently, adversarial alignment has been widely adopted to match
the marginal distribution of feature representations across two domains
globally. However, this strategy fails in adapting the representations of the
tail classes or... | [
{
"created": "Wed, 18 Dec 2019 23:59:24 GMT",
"version": "v1"
}
] | 2019-12-20 | [
[
"Yang",
"Jihan",
""
],
[
"Xu",
"Ruijia",
""
],
[
"Li",
"Ruiyu",
""
],
[
"Qi",
"Xiaojuan",
""
],
[
"Shen",
"Xiaoyong",
""
],
[
"Li",
"Guanbin",
""
],
[
"Lin",
"Liang",
""
]
] | We focus on Unsupervised Domain Adaptation (UDA) for the task of semantic segmentation. Recently, adversarial alignment has been widely adopted to match the marginal distribution of feature representations across two domains globally. However, this strategy fails in adapting the representations of the tail classes or s... |
1609.09773 | Qingqing Wu | Qingqing Wu, Geoffrey Ye Li, Wen Chen, Derrick Wing Kwan Ng, and
Robert Schober | An Overview of Sustainable Green 5G Networks | Submitted for possible publication | null | null | null | cs.IT cs.NI math.IT math.OC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The stringent requirements of a 1,000 times increase in data traffic and one
millisecond round trip latency have made limiting the potentially tremendous
ensuing energy consumption one of the most challenging problems for the design
of the upcoming fifth-generation (5G) networks. To enable sustainable 5G
networks, ne... | [
{
"created": "Fri, 30 Sep 2016 15:26:03 GMT",
"version": "v1"
},
{
"created": "Wed, 5 Oct 2016 03:40:26 GMT",
"version": "v2"
}
] | 2017-04-12 | [
[
"Wu",
"Qingqing",
""
],
[
"Li",
"Geoffrey Ye",
""
],
[
"Chen",
"Wen",
""
],
[
"Ng",
"Derrick Wing Kwan",
""
],
[
"Schober",
"Robert",
""
]
] | The stringent requirements of a 1,000 times increase in data traffic and one millisecond round trip latency have made limiting the potentially tremendous ensuing energy consumption one of the most challenging problems for the design of the upcoming fifth-generation (5G) networks. To enable sustainable 5G networks, new ... |
2112.07344 | Adeyemi Damilare Adeoye | Adeyemi D. Adeoye, Alberto Bemporad | SCORE: Approximating Curvature Information under Self-Concordant
Regularization | published in Computational Optimization and Applications 2023 | null | 10.1007/s10589-023-00502-2 | null | cs.LG math.OC | http://creativecommons.org/licenses/by/4.0/ | Optimization problems that include regularization functions in their
objectives are regularly solved in many applications. When one seeks
second-order methods for such problems, it may be desirable to exploit specific
properties of some of these regularization functions when accounting for
curvature information in th... | [
{
"created": "Tue, 14 Dec 2021 13:03:04 GMT",
"version": "v1"
},
{
"created": "Thu, 16 Jun 2022 10:30:59 GMT",
"version": "v2"
},
{
"created": "Mon, 10 Jul 2023 14:13:17 GMT",
"version": "v3"
}
] | 2023-07-11 | [
[
"Adeoye",
"Adeyemi D.",
""
],
[
"Bemporad",
"Alberto",
""
]
] | Optimization problems that include regularization functions in their objectives are regularly solved in many applications. When one seeks second-order methods for such problems, it may be desirable to exploit specific properties of some of these regularization functions when accounting for curvature information in the ... |
1607.08592 | Erkki Luuk | Erkki Luuk | Modeling selectional restrictions in a relational type system | null | null | null | null | cs.CL cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Selectional restrictions are semantic constraints on forming certain complex
types in natural language. The paper gives an overview of modeling selectional
restrictions in a relational type system with morphological and syntactic
types. We discuss some foundations of the system and ways of formalizing
selectional res... | [
{
"created": "Thu, 28 Jul 2016 19:47:25 GMT",
"version": "v1"
}
] | 2016-07-29 | [
[
"Luuk",
"Erkki",
""
]
] | Selectional restrictions are semantic constraints on forming certain complex types in natural language. The paper gives an overview of modeling selectional restrictions in a relational type system with morphological and syntactic types. We discuss some foundations of the system and ways of formalizing selectional restr... |
2012.11113 | Yang Yifei | Yifei Yang, Shibing Xiang, Ruixiang Zhang | Improving unsupervised anomaly localization by applying multi-scale
memories to autoencoders | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Autoencoder and its variants have been widely applicated in anomaly
detection.The previous work memory-augmented deep autoencoder proposed
memorizing normality to detect anomaly, however it neglects the feature
discrepancy between different resolution scales, therefore we introduce
multi-scale memories to record scal... | [
{
"created": "Mon, 21 Dec 2020 04:44:40 GMT",
"version": "v1"
}
] | 2020-12-22 | [
[
"Yang",
"Yifei",
""
],
[
"Xiang",
"Shibing",
""
],
[
"Zhang",
"Ruixiang",
""
]
] | Autoencoder and its variants have been widely applicated in anomaly detection.The previous work memory-augmented deep autoencoder proposed memorizing normality to detect anomaly, however it neglects the feature discrepancy between different resolution scales, therefore we introduce multi-scale memories to record scale-... |
2301.02125 | Alexander Gheorghiu | Alexander V. Gheorghiu and David J. Pym | Defining Logical Systems via Algebraic Constraints on Proofs | null | Journal of Logic and Computation 2023 | null | null | cs.LO math.LO | http://creativecommons.org/licenses/by/4.0/ | We present a comprehensive programme analysing the decomposition of proof
systems for non-classical logics into proof systems for other logics,
especially classical logic, using an algebra of constraints. That is, one
recovers a proof system for a target logic by enriching a proof system for
another, typically simple... | [
{
"created": "Thu, 5 Jan 2023 16:06:09 GMT",
"version": "v1"
},
{
"created": "Mon, 27 Mar 2023 10:06:04 GMT",
"version": "v2"
},
{
"created": "Thu, 19 Oct 2023 11:21:15 GMT",
"version": "v3"
}
] | 2023-10-20 | [
[
"Gheorghiu",
"Alexander V.",
""
],
[
"Pym",
"David J.",
""
]
] | We present a comprehensive programme analysing the decomposition of proof systems for non-classical logics into proof systems for other logics, especially classical logic, using an algebra of constraints. That is, one recovers a proof system for a target logic by enriching a proof system for another, typically simpler,... |
1906.00452 | Micha{\l} Koziarski | Micha{\l} Koziarski | Radial-Based Undersampling for Imbalanced Data Classification | null | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Data imbalance remains one of the most widespread problems affecting
contemporary machine learning. The negative effect data imbalance can have on
the traditional learning algorithms is most severe in combination with other
dataset difficulty factors, such as small disjuncts, presence of outliers and
insufficient num... | [
{
"created": "Sun, 2 Jun 2019 17:06:28 GMT",
"version": "v1"
},
{
"created": "Sat, 17 Apr 2021 13:51:23 GMT",
"version": "v2"
}
] | 2021-04-20 | [
[
"Koziarski",
"Michał",
""
]
] | Data imbalance remains one of the most widespread problems affecting contemporary machine learning. The negative effect data imbalance can have on the traditional learning algorithms is most severe in combination with other dataset difficulty factors, such as small disjuncts, presence of outliers and insufficient numbe... |
2203.07102 | Youqian Zhang | Youqian Zhang, Kasper Rasmussen | Detection of Electromagnetic Signal Injection Attacks on Actuator
Systems | null | null | null | null | cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | An actuator is a device that converts electricity into another form of
energy, typically physical movement. They are absolutely essential for any
system that needs to impact or modify the physical world, and are used in
millions of systems of all sizes, all over the world, from cars and spacecraft
to factory control ... | [
{
"created": "Mon, 14 Mar 2022 13:47:03 GMT",
"version": "v1"
}
] | 2022-03-15 | [
[
"Zhang",
"Youqian",
""
],
[
"Rasmussen",
"Kasper",
""
]
] | An actuator is a device that converts electricity into another form of energy, typically physical movement. They are absolutely essential for any system that needs to impact or modify the physical world, and are used in millions of systems of all sizes, all over the world, from cars and spacecraft to factory control sy... |
2305.17127 | Tyler A. Chang | Tyler A. Chang, Kishaloy Halder, Neha Anna John, Yogarshi Vyas,
Yassine Benajiba, Miguel Ballesteros, Dan Roth | Characterizing and Measuring Linguistic Dataset Drift | Accepted to ACL 2023 | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | NLP models often degrade in performance when real world data distributions
differ markedly from training data. However, existing dataset drift metrics in
NLP have generally not considered specific dimensions of linguistic drift that
affect model performance, and they have not been validated in their ability to
predic... | [
{
"created": "Fri, 26 May 2023 17:50:51 GMT",
"version": "v1"
}
] | 2023-05-29 | [
[
"Chang",
"Tyler A.",
""
],
[
"Halder",
"Kishaloy",
""
],
[
"John",
"Neha Anna",
""
],
[
"Vyas",
"Yogarshi",
""
],
[
"Benajiba",
"Yassine",
""
],
[
"Ballesteros",
"Miguel",
""
],
[
"Roth",
"Dan",
""
]
] | NLP models often degrade in performance when real world data distributions differ markedly from training data. However, existing dataset drift metrics in NLP have generally not considered specific dimensions of linguistic drift that affect model performance, and they have not been validated in their ability to predict ... |
2403.07314 | Megan Witherow | Megan A. Witherow, Crystal Butler, Winston J. Shields, Furkan Ilgin,
Norou Diawara, Janice Keener, John W. Harrington, and Khan M. Iftekharuddin | Customizable Avatars with Dynamic Facial Action Coded Expressions
(CADyFACE) for Improved User Engagement | 12 pages, 8 figures | null | null | null | cs.HC cs.CV cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Customizable 3D avatar-based facial expression stimuli may improve user
engagement in behavioral biomarker discovery and therapeutic intervention for
autism, Alzheimer's disease, facial palsy, and more. However, there is a lack
of customizable avatar-based stimuli with Facial Action Coding System (FACS)
action unit (... | [
{
"created": "Tue, 12 Mar 2024 05:00:38 GMT",
"version": "v1"
}
] | 2024-03-13 | [
[
"Witherow",
"Megan A.",
""
],
[
"Butler",
"Crystal",
""
],
[
"Shields",
"Winston J.",
""
],
[
"Ilgin",
"Furkan",
""
],
[
"Diawara",
"Norou",
""
],
[
"Keener",
"Janice",
""
],
[
"Harrington",
"John W.",
""
... | Customizable 3D avatar-based facial expression stimuli may improve user engagement in behavioral biomarker discovery and therapeutic intervention for autism, Alzheimer's disease, facial palsy, and more. However, there is a lack of customizable avatar-based stimuli with Facial Action Coding System (FACS) action unit (AU... |
1603.07786 | Hans Raj Tiwary | Hans Raj Tiwary | Extension Complexity of Formal Languages | Final version for TOCS | null | null | null | cs.CC cs.FL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this article we undertake a study of extension complexity from the
perspective of formal languages. We define a natural way to associate a family
of polytopes with binary languages. This allows us to define the notion of
extension complexity of formal languages. We prove several closure properties
of languages adm... | [
{
"created": "Fri, 25 Mar 2016 00:11:56 GMT",
"version": "v1"
},
{
"created": "Wed, 27 Apr 2016 16:22:08 GMT",
"version": "v2"
},
{
"created": "Thu, 28 Apr 2016 10:29:07 GMT",
"version": "v3"
},
{
"created": "Tue, 19 Jul 2016 16:21:35 GMT",
"version": "v4"
},
{
"c... | 2019-08-29 | [
[
"Tiwary",
"Hans Raj",
""
]
] | In this article we undertake a study of extension complexity from the perspective of formal languages. We define a natural way to associate a family of polytopes with binary languages. This allows us to define the notion of extension complexity of formal languages. We prove several closure properties of languages admit... |
2305.06386 | Mazda Moayeri | Mazda Moayeri, Keivan Rezaei, Maziar Sanjabi, Soheil Feizi | Text-To-Concept (and Back) via Cross-Model Alignment | Accepted to ICML 2023 and CVPR4XAI workshop 2023 | null | null | null | cs.CV cs.AI cs.HC cs.LG | http://creativecommons.org/licenses/by/4.0/ | We observe that the mapping between an image's representation in one model to
its representation in another can be learned surprisingly well with just a
linear layer, even across diverse models. Building on this observation, we
propose $\textit{text-to-concept}$, where features from a fixed pretrained
model are align... | [
{
"created": "Wed, 10 May 2023 18:01:06 GMT",
"version": "v1"
}
] | 2023-05-12 | [
[
"Moayeri",
"Mazda",
""
],
[
"Rezaei",
"Keivan",
""
],
[
"Sanjabi",
"Maziar",
""
],
[
"Feizi",
"Soheil",
""
]
] | We observe that the mapping between an image's representation in one model to its representation in another can be learned surprisingly well with just a linear layer, even across diverse models. Building on this observation, we propose $\textit{text-to-concept}$, where features from a fixed pretrained model are aligned... |
2402.17310 | Mizuki Fukasawa | Mizuki Fukasawa (1), Tomokazu Fukuda (1), Takuya Akashi (1) ((1) Iwate
University) | Method of Tracking and Analysis of Fluorescent-Labeled Cells Using
Automatic Thresholding and Labeling | 5 pages, 7 figures | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | High-throughput screening using cell images is an efficient method for
screening new candidates for pharmaceutical drugs. To complete the screening
process, it is essential to have an efficient process for analyzing cell
images. This paper presents a new method for efficiently tracking cells and
quantitatively detect... | [
{
"created": "Tue, 27 Feb 2024 08:33:03 GMT",
"version": "v1"
}
] | 2024-02-28 | [
[
"Fukasawa",
"Mizuki",
""
],
[
"Fukuda",
"Tomokazu",
""
],
[
"Akashi",
"Takuya",
""
]
] | High-throughput screening using cell images is an efficient method for screening new candidates for pharmaceutical drugs. To complete the screening process, it is essential to have an efficient process for analyzing cell images. This paper presents a new method for efficiently tracking cells and quantitatively detectin... |
1504.08200 | Bugra Tekin | Bugra Tekin, Xiaolu Sun, Xinchao Wang, Vincent Lepetit, Pascal Fua | Predicting People's 3D Poses from Short Sequences | superseded by arXiv:1511.06692 | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We propose an efficient approach to exploiting motion information from
consecutive frames of a video sequence to recover the 3D pose of people.
Instead of computing candidate poses in individual frames and then linking
them, as is often done, we regress directly from a spatio-temporal block of
frames to a 3D pose in ... | [
{
"created": "Thu, 30 Apr 2015 12:54:39 GMT",
"version": "v1"
},
{
"created": "Fri, 1 May 2015 11:59:56 GMT",
"version": "v2"
},
{
"created": "Mon, 4 May 2015 11:24:56 GMT",
"version": "v3"
},
{
"created": "Mon, 23 Nov 2015 21:48:15 GMT",
"version": "v4"
}
] | 2015-11-25 | [
[
"Tekin",
"Bugra",
""
],
[
"Sun",
"Xiaolu",
""
],
[
"Wang",
"Xinchao",
""
],
[
"Lepetit",
"Vincent",
""
],
[
"Fua",
"Pascal",
""
]
] | We propose an efficient approach to exploiting motion information from consecutive frames of a video sequence to recover the 3D pose of people. Instead of computing candidate poses in individual frames and then linking them, as is often done, we regress directly from a spatio-temporal block of frames to a 3D pose in th... |
2101.08102 | Severin Kacianka | Severin Kacianka and Alexander Pretschner | Designing Accountable Systems | accepted for publication at the ACM Conference on Fairness,
Accountability, and Transparency (ACM FAccT) 2021 | null | 10.1145/3442188.3445905 | null | cs.SE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Accountability is an often called for property of technical systems. It is a
requirement for algorithmic decision systems, autonomous cyber-physical
systems, and for software systems in general. As a concept, accountability goes
back to the early history of Liberalism and is suggested as a tool to limit the
use of po... | [
{
"created": "Wed, 20 Jan 2021 12:59:03 GMT",
"version": "v1"
}
] | 2021-04-30 | [
[
"Kacianka",
"Severin",
""
],
[
"Pretschner",
"Alexander",
""
]
] | Accountability is an often called for property of technical systems. It is a requirement for algorithmic decision systems, autonomous cyber-physical systems, and for software systems in general. As a concept, accountability goes back to the early history of Liberalism and is suggested as a tool to limit the use of powe... |
2008.08480 | Will Rosenbaum | Christine T. Cheng and Will Rosenbaum | Stable Matchings with Restricted Preferences: Structure and Complexity | Various updates and improvements in response to reviewer comments | null | null | null | cs.DM cs.CC cs.GT math.CO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | It is well known that every stable matching instance $I$ has a rotation poset
$R(I)$ that can be computed efficiently and the downsets of $R(I)$ are in
one-to-one correspondence with the stable matchings of $I$. Furthermore, for
every poset $P$, an instance $I(P)$ can be constructed efficiently so that the
rotation p... | [
{
"created": "Wed, 19 Aug 2020 14:39:02 GMT",
"version": "v1"
},
{
"created": "Thu, 28 Jan 2021 15:11:47 GMT",
"version": "v2"
}
] | 2021-01-29 | [
[
"Cheng",
"Christine T.",
""
],
[
"Rosenbaum",
"Will",
""
]
] | It is well known that every stable matching instance $I$ has a rotation poset $R(I)$ that can be computed efficiently and the downsets of $R(I)$ are in one-to-one correspondence with the stable matchings of $I$. Furthermore, for every poset $P$, an instance $I(P)$ can be constructed efficiently so that the rotation pos... |
2406.05873 | Justin Kilb | Justin Kilb, Caroline Ellis | Conserving Human Creativity with Evolutionary Generative Algorithms: A
Case Study in Music Generation | 7 pages, 3 figures | null | null | null | cs.NE cs.AI math.OC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This study explores the application of evolutionary generative algorithms in
music production to preserve and enhance human creativity. By integrating human
feedback into Differential Evolution algorithms, we produced six songs that
were submitted to international record labels, all of which received contract
offers.... | [
{
"created": "Sun, 9 Jun 2024 18:11:05 GMT",
"version": "v1"
}
] | 2024-06-11 | [
[
"Kilb",
"Justin",
""
],
[
"Ellis",
"Caroline",
""
]
] | This study explores the application of evolutionary generative algorithms in music production to preserve and enhance human creativity. By integrating human feedback into Differential Evolution algorithms, we produced six songs that were submitted to international record labels, all of which received contract offers. I... |
2201.01422 | Chongjun Ouyang | Chongjun Ouyang, Yuanwei Liu, and Hongwen Yang | On the Performance of Uplink ISAC Systems | 5 pages | null | null | null | cs.IT eess.SP math.IT | http://creativecommons.org/publicdomain/zero/1.0/ | This letter analyzes the performance of uplink integrated sensing and
communications (ISAC) systems where communication users (CUs) and radar targets
(RTs) share the same frequency band. A non-orthogonal multiple access (NOMA)
protocol is adopted in the communication procedure of the ISAC system. Novel
expressions ar... | [
{
"created": "Wed, 5 Jan 2022 02:56:34 GMT",
"version": "v1"
},
{
"created": "Fri, 27 May 2022 03:54:35 GMT",
"version": "v2"
}
] | 2022-05-30 | [
[
"Ouyang",
"Chongjun",
""
],
[
"Liu",
"Yuanwei",
""
],
[
"Yang",
"Hongwen",
""
]
] | This letter analyzes the performance of uplink integrated sensing and communications (ISAC) systems where communication users (CUs) and radar targets (RTs) share the same frequency band. A non-orthogonal multiple access (NOMA) protocol is adopted in the communication procedure of the ISAC system. Novel expressions are ... |
2105.12524 | Caglar Demir | Caglar Demir and Axel-Cyrille Ngonga Ngomo | Out-of-Vocabulary Entities in Link Prediction | null | null | null | null | cs.LG cs.SI | http://creativecommons.org/licenses/by-nc-nd/4.0/ | Knowledge graph embedding techniques are key to making knowledge graphs
amenable to the plethora of machine learning approaches based on vector
representations. Link prediction is often used as a proxy to evaluate the
quality of these embeddings. Given that the creation of benchmarks for link
prediction is a time-con... | [
{
"created": "Wed, 26 May 2021 12:58:18 GMT",
"version": "v1"
}
] | 2021-05-27 | [
[
"Demir",
"Caglar",
""
],
[
"Ngomo",
"Axel-Cyrille Ngonga",
""
]
] | Knowledge graph embedding techniques are key to making knowledge graphs amenable to the plethora of machine learning approaches based on vector representations. Link prediction is often used as a proxy to evaluate the quality of these embeddings. Given that the creation of benchmarks for link prediction is a time-consu... |
1403.1362 | Shireesha Chintalapati | Shireesha Chintalapati and M. V. Raghunadh | Illumination,Expression and Occlusion Invariant Pose-Adaptive Face
Recognition System for Real-Time Applications | 7 pages,8 figures, Published with International Journal of
Engineering Trends and Technology (IJETT) | International Journal of Engineering Trends and Technology(IJETT),
V8(6),292-298 February 2014. Published by seventh sense research group | 10.14445/22315381/IJETT-V8P254 | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Face recognition in real-time scenarios is mainly affected by illumination,
expression and pose variations and also by occlusion. This paper presents the
framework for pose adaptive component-based face recognition system. The
framework proposed deals with all the above mentioned issues. The steps
involved in the pre... | [
{
"created": "Thu, 6 Mar 2014 07:19:24 GMT",
"version": "v1"
}
] | 2014-03-07 | [
[
"Chintalapati",
"Shireesha",
""
],
[
"Raghunadh",
"M. V.",
""
]
] | Face recognition in real-time scenarios is mainly affected by illumination, expression and pose variations and also by occlusion. This paper presents the framework for pose adaptive component-based face recognition system. The framework proposed deals with all the above mentioned issues. The steps involved in the prese... |
2311.18488 | Sana Javed | Sana Javed, Francisco Garcia-Herrero, Bane Vasic, Mark F. Flanagan | Low-Complexity Linear Programming Based Decoding of Quantum LDPC codes | Accepted for publication at the IEEE International Conference on
Communications (ICC) 2024 | null | null | null | cs.IT math.IT | http://creativecommons.org/licenses/by/4.0/ | This paper proposes two approaches for reducing the impact of the error floor
phenomenon when decoding quantum low-density parity-check codes with belief
propagation based algorithms. First, a low-complexity syndrome-based linear
programming (SB-LP) decoding algorithm is proposed, and second, the proposed
SB-LP is ap... | [
{
"created": "Thu, 30 Nov 2023 12:01:04 GMT",
"version": "v1"
},
{
"created": "Fri, 19 Jan 2024 15:53:11 GMT",
"version": "v2"
}
] | 2024-01-22 | [
[
"Javed",
"Sana",
""
],
[
"Garcia-Herrero",
"Francisco",
""
],
[
"Vasic",
"Bane",
""
],
[
"Flanagan",
"Mark F.",
""
]
] | This paper proposes two approaches for reducing the impact of the error floor phenomenon when decoding quantum low-density parity-check codes with belief propagation based algorithms. First, a low-complexity syndrome-based linear programming (SB-LP) decoding algorithm is proposed, and second, the proposed SB-LP is appl... |
1511.07792 | Elena Dubrova | Elena Dubrova and Mats N\"aslund and Gunnar Carlsson and John Fornehed
and Ben Smeets | Two Countermeasures Against Hardware Trojans Exploiting Non-Zero
Aliasing Probability of BIST | 16 pages, 5 figures | null | null | null | cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The threat of hardware Trojans has been widely recognized by academia,
industry, and government agencies. A Trojan can compromise security of a system
in spite of cryptographic protection. The damage caused by a Trojan may not be
limited to a business or reputation, but could have a severe impact on public
safety, na... | [
{
"created": "Tue, 24 Nov 2015 16:40:08 GMT",
"version": "v1"
}
] | 2015-11-25 | [
[
"Dubrova",
"Elena",
""
],
[
"Näslund",
"Mats",
""
],
[
"Carlsson",
"Gunnar",
""
],
[
"Fornehed",
"John",
""
],
[
"Smeets",
"Ben",
""
]
] | The threat of hardware Trojans has been widely recognized by academia, industry, and government agencies. A Trojan can compromise security of a system in spite of cryptographic protection. The damage caused by a Trojan may not be limited to a business or reputation, but could have a severe impact on public safety, nati... |
2006.13833 | Luis Lastras | Luis A. Lastras | Lattice Representation Learning | null | null | null | null | cs.LG cs.IT math.IT stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this article we introduce theory and algorithms for learning discrete
representations that take on a lattice that is embedded in an Euclidean space.
Lattice representations possess an interesting combination of properties: a)
they can be computed explicitly using lattice quantization, yet they can be
learned effic... | [
{
"created": "Wed, 24 Jun 2020 16:05:11 GMT",
"version": "v1"
}
] | 2020-06-25 | [
[
"Lastras",
"Luis A.",
""
]
] | In this article we introduce theory and algorithms for learning discrete representations that take on a lattice that is embedded in an Euclidean space. Lattice representations possess an interesting combination of properties: a) they can be computed explicitly using lattice quantization, yet they can be learned efficie... |
2111.04671 | David Pujol | David Pujol, Ashwin Machanavajjhala | Equity and Privacy: More Than Just a Tradeoff | 3 pages, 1 figure. Published in IEEE Security & Privacy ( Volume: 19,
Issue: 6, Nov.-Dec. 2021) | null | 10.1109/MSEC.2021.3105773 | null | cs.CY cs.CR | http://creativecommons.org/licenses/by/4.0/ | While the entire field of privacy preserving data analytics is focused on the
privacy-utility tradeoff, recent work has shown that privacy preserving data
publishing can introduce different levels of utility across different
population groups. It is important to understand this new tradeoff between
privacy and equity... | [
{
"created": "Mon, 8 Nov 2021 17:39:32 GMT",
"version": "v1"
}
] | 2021-11-09 | [
[
"Pujol",
"David",
""
],
[
"Machanavajjhala",
"Ashwin",
""
]
] | While the entire field of privacy preserving data analytics is focused on the privacy-utility tradeoff, recent work has shown that privacy preserving data publishing can introduce different levels of utility across different population groups. It is important to understand this new tradeoff between privacy and equity a... |
2103.03443 | Riccardo Paccagnella | Riccardo Paccagnella and Licheng Luo and Christopher W. Fletcher | Lord of the Ring(s): Side Channel Attacks on the CPU On-Chip Ring
Interconnect Are Practical | This is the extended version of a paper that appears in USENIX
Security 2021 | null | null | null | cs.CR cs.AR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We introduce the first microarchitectural side channel attacks that leverage
contention on the CPU ring interconnect. There are two challenges that make it
uniquely difficult to exploit this channel. First, little is known about the
ring interconnect's functioning and architecture. Second, information that can
be lea... | [
{
"created": "Fri, 5 Mar 2021 02:44:20 GMT",
"version": "v1"
}
] | 2021-03-08 | [
[
"Paccagnella",
"Riccardo",
""
],
[
"Luo",
"Licheng",
""
],
[
"Fletcher",
"Christopher W.",
""
]
] | We introduce the first microarchitectural side channel attacks that leverage contention on the CPU ring interconnect. There are two challenges that make it uniquely difficult to exploit this channel. First, little is known about the ring interconnect's functioning and architecture. Second, information that can be learn... |
1609.09267 | Andrea Romanoni | Gheorghii Postica and Andrea Romanoni and Matteo Matteucci | Robust Moving Objects Detection in Lidar Data Exploiting Visual Cues | 6 pages, to appear in IROS 2016 | null | null | null | cs.RO cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Detecting moving objects in dynamic scenes from sequences of lidar scans is
an important task in object tracking, mapping, localization, and navigation.
Many works focus on changes detection in previously observed scenes, while a
very limited amount of literature addresses moving objects detection. The
state-of-the-a... | [
{
"created": "Thu, 29 Sep 2016 09:29:46 GMT",
"version": "v1"
}
] | 2016-09-30 | [
[
"Postica",
"Gheorghii",
""
],
[
"Romanoni",
"Andrea",
""
],
[
"Matteucci",
"Matteo",
""
]
] | Detecting moving objects in dynamic scenes from sequences of lidar scans is an important task in object tracking, mapping, localization, and navigation. Many works focus on changes detection in previously observed scenes, while a very limited amount of literature addresses moving objects detection. The state-of-the-art... |
2210.17087 | Youpeng Zhao | Yudong Lu, Jian Zhao, Youpeng Zhao, Wengang Zhou, Houqiang Li | DanZero: Mastering GuanDan Game with Reinforcement Learning | null | null | null | null | cs.AI cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Card game AI has always been a hot topic in the research of artificial
intelligence. In recent years, complex card games such as Mahjong, DouDizhu and
Texas Hold'em have been solved and the corresponding AI programs have reached
the level of human experts. In this paper, we are devoted to developing an AI
program for... | [
{
"created": "Mon, 31 Oct 2022 06:29:08 GMT",
"version": "v1"
}
] | 2022-11-01 | [
[
"Lu",
"Yudong",
""
],
[
"Zhao",
"Jian",
""
],
[
"Zhao",
"Youpeng",
""
],
[
"Zhou",
"Wengang",
""
],
[
"Li",
"Houqiang",
""
]
] | Card game AI has always been a hot topic in the research of artificial intelligence. In recent years, complex card games such as Mahjong, DouDizhu and Texas Hold'em have been solved and the corresponding AI programs have reached the level of human experts. In this paper, we are devoted to developing an AI program for a... |
2406.12896 | Wei Zhang | Jiajun Cui, Hong Qian, Bo Jiang, Wei Zhang | Leveraging Pedagogical Theories to Understand Student Learning Process
with Graph-based Reasonable Knowledge Tracing | Preprint, accepted to appear in SIGKDD 2024, 12 pages. The source
code is available at https://github.com/JJCui96/GRKT. Keywords: interpretable
knowledge tracing, student behavior modeling, intelligence education | null | null | null | cs.AI cs.CY cs.LG | http://creativecommons.org/licenses/by-nc-sa/4.0/ | Knowledge tracing (KT) is a crucial task in intelligent education, focusing
on predicting students' performance on given questions to trace their evolving
knowledge. The advancement of deep learning in this field has led to
deep-learning knowledge tracing (DLKT) models that prioritize high predictive
accuracy. Howeve... | [
{
"created": "Fri, 7 Jun 2024 10:14:30 GMT",
"version": "v1"
}
] | 2024-06-21 | [
[
"Cui",
"Jiajun",
""
],
[
"Qian",
"Hong",
""
],
[
"Jiang",
"Bo",
""
],
[
"Zhang",
"Wei",
""
]
] | Knowledge tracing (KT) is a crucial task in intelligent education, focusing on predicting students' performance on given questions to trace their evolving knowledge. The advancement of deep learning in this field has led to deep-learning knowledge tracing (DLKT) models that prioritize high predictive accuracy. However,... |
1507.03851 | Enric Rodriguez Carbonell | Marc Brockschmidt, Daniel Larraz, Albert Oliveras, Enric
Rodriguez-Carbonell, Albert Rubio | Compositional Safety Verification with Max-SMT | Extended technical report version of the conference paper at FMCAD'15 | null | null | null | cs.LO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We present an automated compositional program verification technique for
safety properties based on conditional inductive invariants. For a given
program part (e.g., a single loop) and a postcondition $\varphi$, we show how
to, using a Max-SMT solver, an inductive invariant together with a precondition
can be synthes... | [
{
"created": "Tue, 14 Jul 2015 14:01:56 GMT",
"version": "v1"
},
{
"created": "Wed, 15 Jul 2015 05:41:20 GMT",
"version": "v2"
},
{
"created": "Mon, 3 Aug 2015 21:41:23 GMT",
"version": "v3"
}
] | 2015-08-05 | [
[
"Brockschmidt",
"Marc",
""
],
[
"Larraz",
"Daniel",
""
],
[
"Oliveras",
"Albert",
""
],
[
"Rodriguez-Carbonell",
"Enric",
""
],
[
"Rubio",
"Albert",
""
]
] | We present an automated compositional program verification technique for safety properties based on conditional inductive invariants. For a given program part (e.g., a single loop) and a postcondition $\varphi$, we show how to, using a Max-SMT solver, an inductive invariant together with a precondition can be synthesiz... |
1910.09787 | Congcong Miao | Congcong Miao and Jilong Wang and Shuying Zhuang and Changqing An | A Coordinated View of Cyberspace | null | null | null | null | cs.NI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Cyberspace is an online world created by growing network of computing and
communication technologies. It is a virtual space of the Internet, paralleled
to geographic space we are living on. As becoming a recognized component of our
society, cyberspace gradually draws more attention in academic research. Many
prior ef... | [
{
"created": "Tue, 22 Oct 2019 06:50:02 GMT",
"version": "v1"
}
] | 2019-10-23 | [
[
"Miao",
"Congcong",
""
],
[
"Wang",
"Jilong",
""
],
[
"Zhuang",
"Shuying",
""
],
[
"An",
"Changqing",
""
]
] | Cyberspace is an online world created by growing network of computing and communication technologies. It is a virtual space of the Internet, paralleled to geographic space we are living on. As becoming a recognized component of our society, cyberspace gradually draws more attention in academic research. Many prior effo... |
2210.14505 | Xiujing Zheng | Xiujing Zheng and Liqi Wang and Shixin Zhu | Constructions of entanglement-assisted quantum MDS codes from
generalized Reed-Solomon codes | 21 pages. 5 table | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | By generalizing the stabilizer quantum error-correcting codes,
entanglement-assisted quantum error-correcting (EAQEC) codes were introduced,
which could be derived from any classical linear codes via the relaxation of
self-orthogonality conditions with the aid of pre-shared entanglement between
the sender and the rec... | [
{
"created": "Wed, 26 Oct 2022 06:30:15 GMT",
"version": "v1"
},
{
"created": "Sat, 16 Mar 2024 07:26:52 GMT",
"version": "v2"
}
] | 2024-03-19 | [
[
"Zheng",
"Xiujing",
""
],
[
"Wang",
"Liqi",
""
],
[
"Zhu",
"Shixin",
""
]
] | By generalizing the stabilizer quantum error-correcting codes, entanglement-assisted quantum error-correcting (EAQEC) codes were introduced, which could be derived from any classical linear codes via the relaxation of self-orthogonality conditions with the aid of pre-shared entanglement between the sender and the recei... |
1610.04591 | Peter LeFanu Lumsdaine | Andrej Bauer, Jason Gross, Peter LeFanu Lumsdaine, Mike Shulman,
Matthieu Sozeau, and Bas Spitters | The HoTT Library: A formalization of homotopy type theory in Coq | null | null | null | null | cs.LO math.LO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We report on the development of the HoTT library, a formalization of homotopy
type theory in the Coq proof assistant. It formalizes most of basic homotopy
type theory, including univalence, higher inductive types, and significant
amounts of synthetic homotopy theory, as well as category theory and
modalities. The lib... | [
{
"created": "Fri, 14 Oct 2016 19:23:50 GMT",
"version": "v1"
},
{
"created": "Fri, 9 Dec 2016 16:31:04 GMT",
"version": "v2"
}
] | 2017-05-02 | [
[
"Bauer",
"Andrej",
""
],
[
"Gross",
"Jason",
""
],
[
"Lumsdaine",
"Peter LeFanu",
""
],
[
"Shulman",
"Mike",
""
],
[
"Sozeau",
"Matthieu",
""
],
[
"Spitters",
"Bas",
""
]
] | We report on the development of the HoTT library, a formalization of homotopy type theory in the Coq proof assistant. It formalizes most of basic homotopy type theory, including univalence, higher inductive types, and significant amounts of synthetic homotopy theory, as well as category theory and modalities. The libra... |
1805.11462 | Vincent Nguyen | Guillaume Klein, Yoon Kim, Yuntian Deng, Vincent Nguyen, Jean
Senellart, Alexander M. Rush | OpenNMT: Neural Machine Translation Toolkit | Presentation to AMTA 2018 - Boston. arXiv admin note: substantial
text overlap with arXiv:1701.02810 | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | OpenNMT is an open-source toolkit for neural machine translation (NMT). The
system prioritizes efficiency, modularity, and extensibility with the goal of
supporting NMT research into model architectures, feature representations, and
source modalities, while maintaining competitive performance and reasonable
training ... | [
{
"created": "Mon, 28 May 2018 07:58:46 GMT",
"version": "v1"
}
] | 2018-05-30 | [
[
"Klein",
"Guillaume",
""
],
[
"Kim",
"Yoon",
""
],
[
"Deng",
"Yuntian",
""
],
[
"Nguyen",
"Vincent",
""
],
[
"Senellart",
"Jean",
""
],
[
"Rush",
"Alexander M.",
""
]
] | OpenNMT is an open-source toolkit for neural machine translation (NMT). The system prioritizes efficiency, modularity, and extensibility with the goal of supporting NMT research into model architectures, feature representations, and source modalities, while maintaining competitive performance and reasonable training re... |
1702.07492 | Ahmed Qureshi | Ahmed Hussain Qureshi, Yutaka Nakamura, Yuichiro Yoshikawa and Hiroshi
Ishiguro | Robot gains Social Intelligence through Multimodal Deep Reinforcement
Learning | The paper is published in IEEE-RAS International Conference on
Humanoid Robots (Humanoids) 2016 | null | null | null | cs.RO cs.AI cs.CV stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | For robots to coexist with humans in a social world like ours, it is crucial
that they possess human-like social interaction skills. Programming a robot to
possess such skills is a challenging task. In this paper, we propose a
Multimodal Deep Q-Network (MDQN) to enable a robot to learn human-like
interaction skills t... | [
{
"created": "Fri, 24 Feb 2017 08:30:43 GMT",
"version": "v1"
}
] | 2017-02-27 | [
[
"Qureshi",
"Ahmed Hussain",
""
],
[
"Nakamura",
"Yutaka",
""
],
[
"Yoshikawa",
"Yuichiro",
""
],
[
"Ishiguro",
"Hiroshi",
""
]
] | For robots to coexist with humans in a social world like ours, it is crucial that they possess human-like social interaction skills. Programming a robot to possess such skills is a challenging task. In this paper, we propose a Multimodal Deep Q-Network (MDQN) to enable a robot to learn human-like interaction skills thr... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.