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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
2112.11016 | Amit Chakrabarti | Amit Chakrabarti and Themistoklis Haris | Counting Simplices in Hypergraph Streams | null | null | null | null | cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We consider the problem of space-efficiently estimating the number of
simplices in a hypergraph stream. This is the most natural hypergraph
generalization of the highly-studied problem of estimating the number of
triangles in a graph stream. Our input is a $k$-uniform hypergraph $H$ with $n$
vertices and $m$ hyperedg... | [
{
"created": "Tue, 21 Dec 2021 07:17:37 GMT",
"version": "v1"
}
] | 2021-12-22 | [
[
"Chakrabarti",
"Amit",
""
],
[
"Haris",
"Themistoklis",
""
]
] | We consider the problem of space-efficiently estimating the number of simplices in a hypergraph stream. This is the most natural hypergraph generalization of the highly-studied problem of estimating the number of triangles in a graph stream. Our input is a $k$-uniform hypergraph $H$ with $n$ vertices and $m$ hyperedges... |
2305.13016 | Jiaxi Yang | Jiaxi Yang, Binyuan Hui, Min Yang, Bailin Wang, Bowen Li, Binhua Li,
Fei Huang, Yongbin Li | Iterative Forward Tuning Boosts In-Context Learning in Language Models | 14 pages, 6 figures, ACL 2024 | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Despite the advancements in in-context learning (ICL) for large language
models (LLMs), current research centers on specific prompt engineering, such as
demonstration selection, with the expectation that a single iteration of
demonstrations processing can generalize effectively to a given test sample.
However, this p... | [
{
"created": "Mon, 22 May 2023 13:18:17 GMT",
"version": "v1"
},
{
"created": "Tue, 30 May 2023 05:47:19 GMT",
"version": "v2"
},
{
"created": "Tue, 4 Jun 2024 05:49:01 GMT",
"version": "v3"
}
] | 2024-06-05 | [
[
"Yang",
"Jiaxi",
""
],
[
"Hui",
"Binyuan",
""
],
[
"Yang",
"Min",
""
],
[
"Wang",
"Bailin",
""
],
[
"Li",
"Bowen",
""
],
[
"Li",
"Binhua",
""
],
[
"Huang",
"Fei",
""
],
[
"Li",
"Yongbin",
""... | Despite the advancements in in-context learning (ICL) for large language models (LLMs), current research centers on specific prompt engineering, such as demonstration selection, with the expectation that a single iteration of demonstrations processing can generalize effectively to a given test sample. However, this per... |
1910.10754 | Heejin Jeong | Heejin Jeong, Brent Schlotfeldt, Hamed Hassani, Manfred Morari, Daniel
D. Lee, George J. Pappas | Learning Q-network for Active Information Acquisition | IROS 2019, Video https://youtu.be/0ZFyOWJ2ulo | IEEE/RSJ International Conference on Intelligent Robots and
Systems (IROS), 2019 | null | null | cs.LG cs.RO stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we propose a novel Reinforcement Learning approach for solving
the Active Information Acquisition problem, which requires an agent to choose a
sequence of actions in order to acquire information about a process of interest
using on-board sensors. The classic challenges in the information acquisition
pr... | [
{
"created": "Wed, 23 Oct 2019 18:21:16 GMT",
"version": "v1"
}
] | 2019-10-25 | [
[
"Jeong",
"Heejin",
""
],
[
"Schlotfeldt",
"Brent",
""
],
[
"Hassani",
"Hamed",
""
],
[
"Morari",
"Manfred",
""
],
[
"Lee",
"Daniel D.",
""
],
[
"Pappas",
"George J.",
""
]
] | In this paper, we propose a novel Reinforcement Learning approach for solving the Active Information Acquisition problem, which requires an agent to choose a sequence of actions in order to acquire information about a process of interest using on-board sensors. The classic challenges in the information acquisition prob... |
2307.11166 | Debajyoti Chakraborty | Vaddadi Sai Rahul, Debajyoti Chakraborty | Exploring reinforcement learning techniques for discrete and continuous
control tasks in the MuJoCo environment | Released @ Dec 2021. For associated project files, see
https://github.com/chakrabortyde/mujoco-control-tasks | null | null | null | cs.LG cs.AI | http://creativecommons.org/publicdomain/zero/1.0/ | We leverage the fast physics simulator, MuJoCo to run tasks in a continuous
control environment and reveal details like the observation space, action
space, rewards, etc. for each task. We benchmark value-based methods for
continuous control by comparing Q-learning and SARSA through a discretization
approach, and usi... | [
{
"created": "Thu, 20 Jul 2023 18:01:48 GMT",
"version": "v1"
}
] | 2023-07-24 | [
[
"Rahul",
"Vaddadi Sai",
""
],
[
"Chakraborty",
"Debajyoti",
""
]
] | We leverage the fast physics simulator, MuJoCo to run tasks in a continuous control environment and reveal details like the observation space, action space, rewards, etc. for each task. We benchmark value-based methods for continuous control by comparing Q-learning and SARSA through a discretization approach, and using... |
2406.14670 | Atula Tejaswi Neerkaje | Atula Tejaswi, Nilesh Gupta, Eunsol Choi | Exploring Design Choices for Building Language-Specific LLMs | 15 pages, 6 figures, 11 tables | null | null | null | cs.CL cs.AI cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Despite rapid progress in large language models (LLMs), their performance on
a vast majority of languages remain unsatisfactory. In this paper, we study
building language-specific LLMs by adapting monolingual and multilingual LLMs.
We conduct systematic experiments on how design choices (base model selection,
vocabul... | [
{
"created": "Thu, 20 Jun 2024 18:47:43 GMT",
"version": "v1"
}
] | 2024-06-24 | [
[
"Tejaswi",
"Atula",
""
],
[
"Gupta",
"Nilesh",
""
],
[
"Choi",
"Eunsol",
""
]
] | Despite rapid progress in large language models (LLMs), their performance on a vast majority of languages remain unsatisfactory. In this paper, we study building language-specific LLMs by adapting monolingual and multilingual LLMs. We conduct systematic experiments on how design choices (base model selection, vocabular... |
2003.13479 | Zi Jian Yew | Zi Jian Yew and Gim Hee Lee | RPM-Net: Robust Point Matching using Learned Features | 10 pages, 4 figures. To appear in CVPR2020 | null | 10.1109/CVPR42600.2020.01184 | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Iterative Closest Point (ICP) solves the rigid point cloud registration
problem iteratively in two steps: (1) make hard assignments of spatially
closest point correspondences, and then (2) find the least-squares rigid
transformation. The hard assignments of closest point correspondences based on
spatial distances are... | [
{
"created": "Mon, 30 Mar 2020 13:45:27 GMT",
"version": "v1"
}
] | 2021-03-29 | [
[
"Yew",
"Zi Jian",
""
],
[
"Lee",
"Gim Hee",
""
]
] | Iterative Closest Point (ICP) solves the rigid point cloud registration problem iteratively in two steps: (1) make hard assignments of spatially closest point correspondences, and then (2) find the least-squares rigid transformation. The hard assignments of closest point correspondences based on spatial distances are s... |
2203.10033 | Matthias Mayr | Matthias Mayr, Faseeh Ahmad, Konstantinos Chatzilygeroudis, Luigi
Nardi, Volker Krueger | Skill-based Multi-objective Reinforcement Learning of Industrial Robot
Tasks with Planning and Knowledge Integration | 8 pages, 6 figures, submitted to 2022 IEEE/RSJ International
Conference on Intelligent Robots and Systems (IROS) | null | null | null | cs.RO cs.LG | http://creativecommons.org/licenses/by-sa/4.0/ | In modern industrial settings with small batch sizes it should be easy to set
up a robot system for a new task. Strategies exist, e.g. the use of skills, but
when it comes to handling forces and torques, these systems often fall short.
We introduce an approach that provides a combination of task-level planning
with t... | [
{
"created": "Fri, 18 Mar 2022 16:03:27 GMT",
"version": "v1"
}
] | 2022-03-21 | [
[
"Mayr",
"Matthias",
""
],
[
"Ahmad",
"Faseeh",
""
],
[
"Chatzilygeroudis",
"Konstantinos",
""
],
[
"Nardi",
"Luigi",
""
],
[
"Krueger",
"Volker",
""
]
] | In modern industrial settings with small batch sizes it should be easy to set up a robot system for a new task. Strategies exist, e.g. the use of skills, but when it comes to handling forces and torques, these systems often fall short. We introduce an approach that provides a combination of task-level planning with tar... |
2302.04269 | Yuhui Zhang | Yuhui Zhang, Jeff Z. HaoChen, Shih-Cheng Huang, Kuan-Chieh Wang, James
Zou, Serena Yeung | Diagnosing and Rectifying Vision Models using Language | Published at ICLR 2023 | null | null | null | cs.LG cs.AI cs.CL cs.CV | http://creativecommons.org/licenses/by/4.0/ | Recent multi-modal contrastive learning models have demonstrated the ability
to learn an embedding space suitable for building strong vision classifiers, by
leveraging the rich information in large-scale image-caption datasets. Our work
highlights a distinct advantage of this multi-modal embedding space: the
ability ... | [
{
"created": "Wed, 8 Feb 2023 18:59:42 GMT",
"version": "v1"
}
] | 2023-02-09 | [
[
"Zhang",
"Yuhui",
""
],
[
"HaoChen",
"Jeff Z.",
""
],
[
"Huang",
"Shih-Cheng",
""
],
[
"Wang",
"Kuan-Chieh",
""
],
[
"Zou",
"James",
""
],
[
"Yeung",
"Serena",
""
]
] | Recent multi-modal contrastive learning models have demonstrated the ability to learn an embedding space suitable for building strong vision classifiers, by leveraging the rich information in large-scale image-caption datasets. Our work highlights a distinct advantage of this multi-modal embedding space: the ability to... |
1807.11459 | Parijat Dube | Parijat Dube, Bishwaranjan Bhattacharjee, Elisabeth Petit-Bois,
Matthew Hill | Improving Transferability of Deep Neural Networks | 15 pages, 11 figures, 2 tables, Workshop on Domain Adaptation for
Visual Understanding (Joint IJCAI/ECAI/AAMAS/ICML 2018 Workshop) Keywords:
deep learning, transfer learning, finetuning, deep neural network,
experimental | null | null | null | cs.CV cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Learning from small amounts of labeled data is a challenge in the area of
deep learning. This is currently addressed by Transfer Learning where one
learns the small data set as a transfer task from a larger source dataset.
Transfer Learning can deliver higher accuracy if the hyperparameters and source
dataset are cho... | [
{
"created": "Mon, 30 Jul 2018 17:34:24 GMT",
"version": "v1"
}
] | 2018-07-31 | [
[
"Dube",
"Parijat",
""
],
[
"Bhattacharjee",
"Bishwaranjan",
""
],
[
"Petit-Bois",
"Elisabeth",
""
],
[
"Hill",
"Matthew",
""
]
] | Learning from small amounts of labeled data is a challenge in the area of deep learning. This is currently addressed by Transfer Learning where one learns the small data set as a transfer task from a larger source dataset. Transfer Learning can deliver higher accuracy if the hyperparameters and source dataset are chose... |
2010.08440 | Shweta Shinde | Zhijingcheng Yu and Shweta Shinde and Trevor E. Carlson and Prateek
Saxena | Elasticlave: An Efficient Memory Model for Enclaves | null | null | null | null | cs.CR cs.AR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Trusted-execution environments (TEE), like Intel SGX, isolate user-space
applications into secure enclaves without trusting the OS. Thus, TEEs reduce
the trusted computing base, but add one to two orders of magnitude slow-down.
The performance cost stems from a strict memory model, which we call the
spatial isolation... | [
{
"created": "Fri, 16 Oct 2020 15:12:49 GMT",
"version": "v1"
}
] | 2020-10-19 | [
[
"Yu",
"Zhijingcheng",
""
],
[
"Shinde",
"Shweta",
""
],
[
"Carlson",
"Trevor E.",
""
],
[
"Saxena",
"Prateek",
""
]
] | Trusted-execution environments (TEE), like Intel SGX, isolate user-space applications into secure enclaves without trusting the OS. Thus, TEEs reduce the trusted computing base, but add one to two orders of magnitude slow-down. The performance cost stems from a strict memory model, which we call the spatial isolation m... |
2403.11623 | Arvid F\"alldin | Arvid F\"alldin, Erik Wallin, Tommy L\"ofstedt, and Martin Servin | Synthesizing multi-log grasp poses | null | null | null | null | cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Multi-object grasping is a challenging task. It is important for energy and
cost-efficient operation of industrial crane manipulators, such as those used
to collect tree logs off the forest floor and onto forest machines. In this
work, we used synthetic data from physics simulations to explore how
data-driven modelin... | [
{
"created": "Mon, 18 Mar 2024 09:55:22 GMT",
"version": "v1"
}
] | 2024-03-19 | [
[
"Fälldin",
"Arvid",
""
],
[
"Wallin",
"Erik",
""
],
[
"Löfstedt",
"Tommy",
""
],
[
"Servin",
"Martin",
""
]
] | Multi-object grasping is a challenging task. It is important for energy and cost-efficient operation of industrial crane manipulators, such as those used to collect tree logs off the forest floor and onto forest machines. In this work, we used synthetic data from physics simulations to explore how data-driven modeling ... |
2209.05480 | Edward Chen | Edward Chen, Han Bao, Tate Shorthill, Hongbin Zhang, Nam Dinh | Systems-theoretic Hazard Analysis of Digital Human-System Interface
Relevant to Reactor Trip | 16 pages, 6 figures, 3 tables, presented at the American Nuclear
Society 12th Nuclear Plant Instrumentation, Control, and Human-Machine
Interface Technologies Conference 2021 | null | null | null | cs.HC | http://creativecommons.org/licenses/by/4.0/ | Human-system interface is one of the key advanced design features applied to
modern digital instrumentation and control systems of nuclear power plants. The
conventional design is based on a compact workstation-based system within the
control room. The compact workstation provides both a strategic operating
environme... | [
{
"created": "Sun, 11 Sep 2022 22:05:31 GMT",
"version": "v1"
}
] | 2022-09-14 | [
[
"Chen",
"Edward",
""
],
[
"Bao",
"Han",
""
],
[
"Shorthill",
"Tate",
""
],
[
"Zhang",
"Hongbin",
""
],
[
"Dinh",
"Nam",
""
]
] | Human-system interface is one of the key advanced design features applied to modern digital instrumentation and control systems of nuclear power plants. The conventional design is based on a compact workstation-based system within the control room. The compact workstation provides both a strategic operating environment... |
1808.03417 | Tony Tung | Zorah Laehner, Daniel Cremers, Tony Tung | DeepWrinkles: Accurate and Realistic Clothing Modeling | 18 pages, 12 figures, 15th European Conference on Computer Vision
(ECCV) 2018, Oral Presentation | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We present a novel method to generate accurate and realistic clothing
deformation from real data capture. Previous methods for realistic cloth
modeling mainly rely on intensive computation of physics-based simulation (with
numerous heuristic parameters), while models reconstructed from visual
observations typically s... | [
{
"created": "Fri, 10 Aug 2018 05:45:36 GMT",
"version": "v1"
}
] | 2018-08-13 | [
[
"Laehner",
"Zorah",
""
],
[
"Cremers",
"Daniel",
""
],
[
"Tung",
"Tony",
""
]
] | We present a novel method to generate accurate and realistic clothing deformation from real data capture. Previous methods for realistic cloth modeling mainly rely on intensive computation of physics-based simulation (with numerous heuristic parameters), while models reconstructed from visual observations typically suf... |
2307.08693 | Vic De Ridder | Vic De Ridder, Bappaditya Dey, Sandip Halder, Bartel Van Waeyenberge | SEMI-DiffusionInst: A Diffusion Model Based Approach for Semiconductor
Defect Classification and Segmentation | 6 pages, 5 figures, To be published by IEEE in the proceedings of the
2023 ELMAR conference | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | With continuous progression of Moore's Law, integrated circuit (IC) device
complexity is also increasing. Scanning Electron Microscope (SEM) image based
extensive defect inspection and accurate metrology extraction are two main
challenges in advanced node (2 nm and beyond) technology. Deep learning (DL)
algorithm bas... | [
{
"created": "Mon, 17 Jul 2023 17:53:36 GMT",
"version": "v1"
},
{
"created": "Wed, 16 Aug 2023 12:12:45 GMT",
"version": "v2"
}
] | 2023-08-17 | [
[
"De Ridder",
"Vic",
""
],
[
"Dey",
"Bappaditya",
""
],
[
"Halder",
"Sandip",
""
],
[
"Van Waeyenberge",
"Bartel",
""
]
] | With continuous progression of Moore's Law, integrated circuit (IC) device complexity is also increasing. Scanning Electron Microscope (SEM) image based extensive defect inspection and accurate metrology extraction are two main challenges in advanced node (2 nm and beyond) technology. Deep learning (DL) algorithm based... |
1909.07617 | Anika Schwind | Anika Schwind, Florian Wamser, Stefan Wunderer, Christian Gassner,
Tobias Ho{\ss}feld | Mobile Internet Experience: Urban vs. Rural -- Saturation vs. Starving? | null | null | null | null | cs.NI | http://creativecommons.org/licenses/by-sa/4.0/ | Mobile Internet experience has been of increasing interest. Services accessed
via smartphone applications shall provide satisfying Quality of Experience
(QoE), irrespective of end user location, time of the day, and other
circumstances. Unfortunately, current LTE networks often don't provide constant
user throughput,... | [
{
"created": "Tue, 17 Sep 2019 07:12:24 GMT",
"version": "v1"
}
] | 2019-09-18 | [
[
"Schwind",
"Anika",
""
],
[
"Wamser",
"Florian",
""
],
[
"Wunderer",
"Stefan",
""
],
[
"Gassner",
"Christian",
""
],
[
"Hoßfeld",
"Tobias",
""
]
] | Mobile Internet experience has been of increasing interest. Services accessed via smartphone applications shall provide satisfying Quality of Experience (QoE), irrespective of end user location, time of the day, and other circumstances. Unfortunately, current LTE networks often don't provide constant user throughput, o... |
2004.01970 | Siddhant Garg | Siddhant Garg, Goutham Ramakrishnan | BAE: BERT-based Adversarial Examples for Text Classification | Accepted at EMNLP 2020 Main Conference | null | 10.18653/v1/2020.emnlp-main.498 | null | cs.CL | http://creativecommons.org/licenses/by/4.0/ | Modern text classification models are susceptible to adversarial examples,
perturbed versions of the original text indiscernible by humans which get
misclassified by the model. Recent works in NLP use rule-based synonym
replacement strategies to generate adversarial examples. These strategies can
lead to out-of-conte... | [
{
"created": "Sat, 4 Apr 2020 16:25:48 GMT",
"version": "v1"
},
{
"created": "Mon, 5 Oct 2020 16:44:29 GMT",
"version": "v2"
},
{
"created": "Thu, 8 Oct 2020 00:41:43 GMT",
"version": "v3"
}
] | 2022-06-22 | [
[
"Garg",
"Siddhant",
""
],
[
"Ramakrishnan",
"Goutham",
""
]
] | Modern text classification models are susceptible to adversarial examples, perturbed versions of the original text indiscernible by humans which get misclassified by the model. Recent works in NLP use rule-based synonym replacement strategies to generate adversarial examples. These strategies can lead to out-of-context... |
0801.0390 | Richard Nock | Richard Nock, Nicolas Sanz, Fred Celimene, Frank Nielsen | Staring at Economic Aggregators through Information Lenses | 18 pages, 2 tables, 3 figures | null | null | null | cs.IT cs.LG math.IT math.OC | null | It is hard to exaggerate the role of economic aggregators -- functions that
summarize numerous and / or heterogeneous data -- in economic models since the
early XX$^{th}$ century. In many cases, as witnessed by the pioneering works of
Cobb and Douglas, these functions were information quantities tailored to
economic ... | [
{
"created": "Wed, 2 Jan 2008 13:23:04 GMT",
"version": "v1"
}
] | 2008-01-03 | [
[
"Nock",
"Richard",
""
],
[
"Sanz",
"Nicolas",
""
],
[
"Celimene",
"Fred",
""
],
[
"Nielsen",
"Frank",
""
]
] | It is hard to exaggerate the role of economic aggregators -- functions that summarize numerous and / or heterogeneous data -- in economic models since the early XX$^{th}$ century. In many cases, as witnessed by the pioneering works of Cobb and Douglas, these functions were information quantities tailored to economic th... |
2003.09520 | Elisa Gugliotta | Elisa Gugliotta, Marco Dinarelli | TArC: Incrementally and Semi-Automatically Collecting a Tunisian Arabish
Corpus | Paper accepted at the Language Resources and Evaluation Conference
(LREC) 2020 | Proceedings of the 12th Language Resources and Evaluation
Conference, 2020, (6279-6286) | null | null | cs.CL cs.LG | http://creativecommons.org/licenses/by-sa/4.0/ | This article describes the constitution process of the first
morpho-syntactically annotated Tunisian Arabish Corpus (TArC). Arabish, also
known as Arabizi, is a spontaneous coding of Arabic dialects in Latin
characters and arithmographs (numbers used as letters). This code-system was
developed by Arabic-speaking user... | [
{
"created": "Fri, 20 Mar 2020 22:29:42 GMT",
"version": "v1"
},
{
"created": "Tue, 24 Mar 2020 12:00:28 GMT",
"version": "v2"
}
] | 2020-11-11 | [
[
"Gugliotta",
"Elisa",
""
],
[
"Dinarelli",
"Marco",
""
]
] | This article describes the constitution process of the first morpho-syntactically annotated Tunisian Arabish Corpus (TArC). Arabish, also known as Arabizi, is a spontaneous coding of Arabic dialects in Latin characters and arithmographs (numbers used as letters). This code-system was developed by Arabic-speaking users ... |
2207.13685 | Alan C. Calder | Alan C. Calder, Catherine Feldman, Eva Siegmann, John Dey, Anthony
Curtis, Smeet Chheda, Robert J. Harrison | On Using Linux Kernel Huge Pages with FLASH, an Astrophysical Simulation
Code | 6 pages, 1 figure, accepted to Embracing Arm for HPC, An IEEE Cluster
2022 Workshop | null | null | null | cs.DC astro-ph.HE astro-ph.IM | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We present efforts at improving the performance of FLASH, a multi-scale,
multi-physics simulation code principally for astrophysical applications, by
using huge pages on Ookami, an HPE Apollo 80 A64FX platform. FLASH is written
principally in modern Fortran and makes use of the PARAMESH library to manage a
block-stru... | [
{
"created": "Wed, 27 Jul 2022 17:55:01 GMT",
"version": "v1"
}
] | 2022-07-28 | [
[
"Calder",
"Alan C.",
""
],
[
"Feldman",
"Catherine",
""
],
[
"Siegmann",
"Eva",
""
],
[
"Dey",
"John",
""
],
[
"Curtis",
"Anthony",
""
],
[
"Chheda",
"Smeet",
""
],
[
"Harrison",
"Robert J.",
""
]
] | We present efforts at improving the performance of FLASH, a multi-scale, multi-physics simulation code principally for astrophysical applications, by using huge pages on Ookami, an HPE Apollo 80 A64FX platform. FLASH is written principally in modern Fortran and makes use of the PARAMESH library to manage a block-struct... |
2009.06796 | Nghia Doan Mr. | Nghia Doan, Seyyed Ali Hashemi and Warren Gross | Decoding Polar Codes with Reinforcement Learning | Accepted for presentation at IEEE GLOBECOM 2020 | null | null | null | cs.IT cs.LG eess.SP math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper we address the problem of selecting factor-graph permutations
of polar codes under belief propagation (BP) decoding to significantly improve
the error-correction performance of the code. In particular, we formalize the
factor-graph permutation selection as the multi-armed bandit problem in
reinforcement... | [
{
"created": "Tue, 15 Sep 2020 00:05:38 GMT",
"version": "v1"
}
] | 2020-09-16 | [
[
"Doan",
"Nghia",
""
],
[
"Hashemi",
"Seyyed Ali",
""
],
[
"Gross",
"Warren",
""
]
] | In this paper we address the problem of selecting factor-graph permutations of polar codes under belief propagation (BP) decoding to significantly improve the error-correction performance of the code. In particular, we formalize the factor-graph permutation selection as the multi-armed bandit problem in reinforcement l... |
1803.09676 | Lorenzo Fagiano | Hafsa Farooqi, Lorenzo Fagiano, Patrizio Colaneri | On shrinking horizon move-blocking predictive control | Part of this material is currently submitted to a journal for
possible publication | null | null | null | cs.SY math.OC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This manuscript contains technical details of recent results developed by the
authors on shrinking horizon predictive control with a move-blocking strategy.
| [
{
"created": "Mon, 26 Mar 2018 15:44:42 GMT",
"version": "v1"
}
] | 2018-03-28 | [
[
"Farooqi",
"Hafsa",
""
],
[
"Fagiano",
"Lorenzo",
""
],
[
"Colaneri",
"Patrizio",
""
]
] | This manuscript contains technical details of recent results developed by the authors on shrinking horizon predictive control with a move-blocking strategy. |
2101.12509 | David Lindner | David Lindner and Kyle Matoba and Alexander Meulemans | Challenges for Using Impact Regularizers to Avoid Negative Side Effects | Presented at the SafeAI workshop at AAAI 2021 | null | null | null | cs.LG cs.AI | http://creativecommons.org/licenses/by-sa/4.0/ | Designing reward functions for reinforcement learning is difficult: besides
specifying which behavior is rewarded for a task, the reward also has to
discourage undesired outcomes. Misspecified reward functions can lead to
unintended negative side effects, and overall unsafe behavior. To overcome this
problem, recent ... | [
{
"created": "Fri, 29 Jan 2021 10:32:51 GMT",
"version": "v1"
},
{
"created": "Tue, 23 Feb 2021 13:49:47 GMT",
"version": "v2"
}
] | 2021-02-24 | [
[
"Lindner",
"David",
""
],
[
"Matoba",
"Kyle",
""
],
[
"Meulemans",
"Alexander",
""
]
] | Designing reward functions for reinforcement learning is difficult: besides specifying which behavior is rewarded for a task, the reward also has to discourage undesired outcomes. Misspecified reward functions can lead to unintended negative side effects, and overall unsafe behavior. To overcome this problem, recent wo... |
2403.09297 | Will Simmons | Will Simmons and Aleks Kissinger | A complete logic for causal consistency | null | null | null | null | cs.LO quant-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The $\mathrm{Caus}[-]$ construction takes a base category of ``raw
materials'' and builds a category of higher order causal processes, that is a
category whose types encode causal (a.k.a. signalling) constraints between
collections of systems. Notable examples are categories of higher-order
stochastic maps and higher... | [
{
"created": "Thu, 14 Mar 2024 11:36:53 GMT",
"version": "v1"
}
] | 2024-03-15 | [
[
"Simmons",
"Will",
""
],
[
"Kissinger",
"Aleks",
""
]
] | The $\mathrm{Caus}[-]$ construction takes a base category of ``raw materials'' and builds a category of higher order causal processes, that is a category whose types encode causal (a.k.a. signalling) constraints between collections of systems. Notable examples are categories of higher-order stochastic maps and higher-o... |
2005.11878 | Yuanhan Hu | Mert Gurbuzbalaban, Yuanhan Hu | Fractional moment-preserving initialization schemes for training deep
neural networks | null | null | null | null | cs.LG math.OC math.ST stat.ML stat.TH | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A traditional approach to initialization in deep neural networks (DNNs) is to
sample the network weights randomly for preserving the variance of
pre-activations. On the other hand, several studies show that during the
training process, the distribution of stochastic gradients can be heavy-tailed
especially for small ... | [
{
"created": "Mon, 25 May 2020 01:10:01 GMT",
"version": "v1"
},
{
"created": "Mon, 1 Jun 2020 02:39:19 GMT",
"version": "v2"
},
{
"created": "Tue, 2 Jun 2020 17:25:23 GMT",
"version": "v3"
},
{
"created": "Mon, 8 Jun 2020 20:00:48 GMT",
"version": "v4"
},
{
"crea... | 2021-02-16 | [
[
"Gurbuzbalaban",
"Mert",
""
],
[
"Hu",
"Yuanhan",
""
]
] | A traditional approach to initialization in deep neural networks (DNNs) is to sample the network weights randomly for preserving the variance of pre-activations. On the other hand, several studies show that during the training process, the distribution of stochastic gradients can be heavy-tailed especially for small ba... |
2007.13635 | Anton Razzhigaev | Anton Razzhigaev, Klim Kireev, Edgar Kaziakhmedov, Nurislam Tursynbek,
and Aleksandr Petiushko | Black-Box Face Recovery from Identity Features | null | ECCV Workshops (5) 2020: 462-475 | 10.1007/978-3-030-68238-5_34 | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this work, we present a novel algorithm based on an it-erative sampling of
random Gaussian blobs for black-box face recovery, given only an output feature
vector of deep face recognition systems. We attack the state-of-the-art face
recognition system (ArcFace) to test our algorithm. Another network with
different ... | [
{
"created": "Mon, 27 Jul 2020 15:25:38 GMT",
"version": "v1"
},
{
"created": "Tue, 28 Jul 2020 09:32:17 GMT",
"version": "v2"
},
{
"created": "Thu, 30 Jul 2020 13:24:39 GMT",
"version": "v3"
}
] | 2021-02-10 | [
[
"Razzhigaev",
"Anton",
""
],
[
"Kireev",
"Klim",
""
],
[
"Kaziakhmedov",
"Edgar",
""
],
[
"Tursynbek",
"Nurislam",
""
],
[
"Petiushko",
"Aleksandr",
""
]
] | In this work, we present a novel algorithm based on an it-erative sampling of random Gaussian blobs for black-box face recovery, given only an output feature vector of deep face recognition systems. We attack the state-of-the-art face recognition system (ArcFace) to test our algorithm. Another network with different ar... |
1908.07119 | Mohammad Ghadir Khoshkholgh Dashtaki | Mohammad G. Khoshkholgh, Victor C. M. Leung, Kang G. Shin, Keivan
Navaie | Provisioning Energy-Efficiency and QoS for Multi-Carrier CoMP with
Limited Feedback | prepared 2015 | null | null | null | cs.IT math.IT | http://creativecommons.org/licenses/by-nc-sa/4.0/ | We consider resource allocation (RA) in multi-carrier coordinated multi-point
(CoMP) systems with limited feedback, in which a cluster of base stations
(BSs), each equipped with multiple antennas, are connect to each other and/or a
central processor via backhauls/fronthauls. The main objective of coordinated
RA is to... | [
{
"created": "Tue, 20 Aug 2019 01:01:31 GMT",
"version": "v1"
}
] | 2019-08-21 | [
[
"Khoshkholgh",
"Mohammad G.",
""
],
[
"Leung",
"Victor C. M.",
""
],
[
"Shin",
"Kang G.",
""
],
[
"Navaie",
"Keivan",
""
]
] | We consider resource allocation (RA) in multi-carrier coordinated multi-point (CoMP) systems with limited feedback, in which a cluster of base stations (BSs), each equipped with multiple antennas, are connect to each other and/or a central processor via backhauls/fronthauls. The main objective of coordinated RA is to s... |
2207.03592 | Akhil Arora | Vuk Vukovi\'c, Akhil Arora, Huan-Cheng Chang, Andreas Spitz, and
Robert West | Quote Erat Demonstrandum: A Web Interface for Exploring the Quotebank
Corpus | SIGIR 2022 (Demo), 5 pages, 2 figures | null | 10.1145/3477495.3531696 | null | cs.IR cs.CL cs.DB | http://creativecommons.org/licenses/by/4.0/ | The use of attributed quotes is the most direct and least filtered pathway of
information propagation in news. Consequently, quotes play a central role in
the conception, reception, and analysis of news stories. Since quotes provide a
more direct window into a speaker's mind than regular reporting, they are a
valuabl... | [
{
"created": "Thu, 7 Jul 2022 21:41:03 GMT",
"version": "v1"
}
] | 2022-07-11 | [
[
"Vuković",
"Vuk",
""
],
[
"Arora",
"Akhil",
""
],
[
"Chang",
"Huan-Cheng",
""
],
[
"Spitz",
"Andreas",
""
],
[
"West",
"Robert",
""
]
] | The use of attributed quotes is the most direct and least filtered pathway of information propagation in news. Consequently, quotes play a central role in the conception, reception, and analysis of news stories. Since quotes provide a more direct window into a speaker's mind than regular reporting, they are a valuable ... |
2302.12953 | Hengzhao Ma | Hengzhao Ma, Jianzhong Li | The Hardness of Optimization Problems on the Weighted Massively Parallel
Computation Model | null | null | null | null | cs.CC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The topology-aware Massively Parallel Computation (MPC) model is proposed and
studied recently, which enhances the classical MPC model by the awareness of
network topology. The work of Hu et al. on topology-aware MPC model considers
only the tree topology. In this paper a more general case is considered, where
the un... | [
{
"created": "Sat, 25 Feb 2023 01:43:08 GMT",
"version": "v1"
},
{
"created": "Sat, 17 Jun 2023 02:29:06 GMT",
"version": "v2"
}
] | 2023-06-21 | [
[
"Ma",
"Hengzhao",
""
],
[
"Li",
"Jianzhong",
""
]
] | The topology-aware Massively Parallel Computation (MPC) model is proposed and studied recently, which enhances the classical MPC model by the awareness of network topology. The work of Hu et al. on topology-aware MPC model considers only the tree topology. In this paper a more general case is considered, where the unde... |
1802.07839 | Kevin Tian | Kevin Tian, Teng Zhang, James Zou | CoVeR: Learning Covariate-Specific Vector Representations with Tensor
Decompositions | 12 pages. Appears in ICML 2018 | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Word embedding is a useful approach to capture co-occurrence structures in
large text corpora. However, in addition to the text data itself, we often have
additional covariates associated with individual corpus documents---e.g. the
demographic of the author, time and venue of publication---and we would like
the embed... | [
{
"created": "Wed, 21 Feb 2018 22:52:35 GMT",
"version": "v1"
},
{
"created": "Sat, 7 Jul 2018 07:19:41 GMT",
"version": "v2"
}
] | 2018-07-10 | [
[
"Tian",
"Kevin",
""
],
[
"Zhang",
"Teng",
""
],
[
"Zou",
"James",
""
]
] | Word embedding is a useful approach to capture co-occurrence structures in large text corpora. However, in addition to the text data itself, we often have additional covariates associated with individual corpus documents---e.g. the demographic of the author, time and venue of publication---and we would like the embeddi... |
1801.05857 | EPTCS | Nathan Cassee (Eindhoven University of Technology, Eindhoven, The
Netherlands), Thomas Neele (Eindhoven University of Technology, Eindhoven,
The Netherlands), Anton Wijs (Eindhoven University of Technology, Eindhoven,
The Netherlands) | On the Scalability of the GPUexplore Explicit-State Model Checker | In Proceedings GaM 2017, arXiv:1712.08345 | EPTCS 263, 2017, pp. 38-52 | 10.4204/EPTCS.263.4 | null | cs.DC cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The use of graphics processors (GPUs) is a promising approach to speed up
model checking to such an extent that it becomes feasible to instantly verify
software systems during development. GPUexplore is an explicit-state model
checker that runs all its computations on the GPU. Over the years it has been
extended with... | [
{
"created": "Wed, 27 Dec 2017 05:16:04 GMT",
"version": "v1"
}
] | 2018-01-19 | [
[
"Cassee",
"Nathan",
"",
"Eindhoven University of Technology, Eindhoven, The\n Netherlands"
],
[
"Neele",
"Thomas",
"",
"Eindhoven University of Technology, Eindhoven,\n The Netherlands"
],
[
"Wijs",
"Anton",
"",
"Eindhoven University of Technology, Eindhov... | The use of graphics processors (GPUs) is a promising approach to speed up model checking to such an extent that it becomes feasible to instantly verify software systems during development. GPUexplore is an explicit-state model checker that runs all its computations on the GPU. Over the years it has been extended with v... |
2211.13024 | Lennart Jahn | Lennart Jahn, Florentin W\"org\"otter, and Tomas Kulvicius | Comparison of Motion Encoding Frameworks on Human Manipulation Actions | null | null | null | null | cs.RO | http://creativecommons.org/licenses/by/4.0/ | Movement generation, and especially generalisation to unseen situations,
plays an important role in robotics. Different types of movement generation
methods exist such as spline based methods, dynamical system based methods, and
methods based on Gaussian mixture models (GMMs). Using a large, new dataset on
human mani... | [
{
"created": "Wed, 23 Nov 2022 15:27:31 GMT",
"version": "v1"
},
{
"created": "Wed, 4 Oct 2023 13:47:03 GMT",
"version": "v2"
},
{
"created": "Mon, 18 Mar 2024 15:39:47 GMT",
"version": "v3"
}
] | 2024-03-19 | [
[
"Jahn",
"Lennart",
""
],
[
"Wörgötter",
"Florentin",
""
],
[
"Kulvicius",
"Tomas",
""
]
] | Movement generation, and especially generalisation to unseen situations, plays an important role in robotics. Different types of movement generation methods exist such as spline based methods, dynamical system based methods, and methods based on Gaussian mixture models (GMMs). Using a large, new dataset on human manipu... |
1807.05948 | Dennis George Wilson | Dennis G Wilson, Kyle Harrington, Sylvain Cussat-Blanc, Herv\'e Luga | Evolving Differentiable Gene Regulatory Networks | null | null | null | null | cs.NE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Over the past twenty years, artificial Gene Regulatory Networks (GRNs) have
shown their capacity to solve real-world problems in various domains such as
agent control, signal processing and artificial life experiments. They have
also benefited from new evolutionary approaches and improvements to dynamic
which have in... | [
{
"created": "Mon, 16 Jul 2018 16:16:11 GMT",
"version": "v1"
}
] | 2018-07-17 | [
[
"Wilson",
"Dennis G",
""
],
[
"Harrington",
"Kyle",
""
],
[
"Cussat-Blanc",
"Sylvain",
""
],
[
"Luga",
"Hervé",
""
]
] | Over the past twenty years, artificial Gene Regulatory Networks (GRNs) have shown their capacity to solve real-world problems in various domains such as agent control, signal processing and artificial life experiments. They have also benefited from new evolutionary approaches and improvements to dynamic which have incr... |
2210.15849 | Shulin He | Shulin He, Huaiwen Zhang, Wei Rao, Kanghao Zhang, Yukai Ju, Yang Yang,
Xueliang Zhang | Hierarchical speaker representation for target speaker extraction | Accepted to ICASSP 2024 | null | null | null | cs.SD eess.AS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Target speaker extraction aims to isolate a specific speaker's voice from a
composite of multiple sound sources, guided by an enrollment utterance or
called anchor. Current methods predominantly derive speaker embeddings from the
anchor and integrate them into the separation network to separate the voice of
the targe... | [
{
"created": "Fri, 28 Oct 2022 02:46:47 GMT",
"version": "v1"
},
{
"created": "Mon, 18 Dec 2023 07:02:28 GMT",
"version": "v2"
},
{
"created": "Fri, 5 Jan 2024 03:06:46 GMT",
"version": "v3"
}
] | 2024-01-08 | [
[
"He",
"Shulin",
""
],
[
"Zhang",
"Huaiwen",
""
],
[
"Rao",
"Wei",
""
],
[
"Zhang",
"Kanghao",
""
],
[
"Ju",
"Yukai",
""
],
[
"Yang",
"Yang",
""
],
[
"Zhang",
"Xueliang",
""
]
] | Target speaker extraction aims to isolate a specific speaker's voice from a composite of multiple sound sources, guided by an enrollment utterance or called anchor. Current methods predominantly derive speaker embeddings from the anchor and integrate them into the separation network to separate the voice of the target ... |
2407.04293 | Sigurd Schacht | Roman Aperdannier, Sigurd Schacht, Alexander Piazza | Systematic Evaluation of Online Speaker Diarization Systems Regarding
their Latency | 6 pages | null | null | null | cs.CL cs.SD eess.AS | http://creativecommons.org/licenses/by-sa/4.0/ | In this paper, different online speaker diarization systems are evaluated on
the same hardware with the same test data with regard to their latency. The
latency is the time span from audio input to the output of the corresponding
speaker label. As part of the evaluation, various model combinations within the
DIART fr... | [
{
"created": "Fri, 5 Jul 2024 06:54:27 GMT",
"version": "v1"
}
] | 2024-07-08 | [
[
"Aperdannier",
"Roman",
""
],
[
"Schacht",
"Sigurd",
""
],
[
"Piazza",
"Alexander",
""
]
] | In this paper, different online speaker diarization systems are evaluated on the same hardware with the same test data with regard to their latency. The latency is the time span from audio input to the output of the corresponding speaker label. As part of the evaluation, various model combinations within the DIART fram... |
2404.10758 | Truman Hickok | Truman Hickok, Dhireesha Kudithipudi | Watch Your Step: Optimal Retrieval for Continual Learning at Scale | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In continual learning, a model learns incrementally over time while
minimizing interference between old and new tasks. One of the most widely used
approaches in continual learning is referred to as replay. Replay methods
support interleaved learning by storing past experiences in a replay buffer.
Although there are m... | [
{
"created": "Tue, 16 Apr 2024 17:35:35 GMT",
"version": "v1"
},
{
"created": "Thu, 9 May 2024 21:03:58 GMT",
"version": "v2"
}
] | 2024-05-13 | [
[
"Hickok",
"Truman",
""
],
[
"Kudithipudi",
"Dhireesha",
""
]
] | In continual learning, a model learns incrementally over time while minimizing interference between old and new tasks. One of the most widely used approaches in continual learning is referred to as replay. Replay methods support interleaved learning by storing past experiences in a replay buffer. Although there are met... |
2402.14905 | Zechun Liu | Zechun Liu, Changsheng Zhao, Forrest Iandola, Chen Lai, Yuandong Tian,
Igor Fedorov, Yunyang Xiong, Ernie Chang, Yangyang Shi, Raghuraman
Krishnamoorthi, Liangzhen Lai, Vikas Chandra | MobileLLM: Optimizing Sub-billion Parameter Language Models for
On-Device Use Cases | ICML 2024. Code is available at
https://github.com/facebookresearch/MobileLLM | null | null | null | cs.LG cs.AI cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper addresses the growing need for efficient large language models
(LLMs) on mobile devices, driven by increasing cloud costs and latency
concerns. We focus on designing top-quality LLMs with fewer than a billion
parameters, a practical choice for mobile deployment. Contrary to prevailing
belief emphasizing th... | [
{
"created": "Thu, 22 Feb 2024 18:58:55 GMT",
"version": "v1"
},
{
"created": "Thu, 27 Jun 2024 03:53:46 GMT",
"version": "v2"
}
] | 2024-06-28 | [
[
"Liu",
"Zechun",
""
],
[
"Zhao",
"Changsheng",
""
],
[
"Iandola",
"Forrest",
""
],
[
"Lai",
"Chen",
""
],
[
"Tian",
"Yuandong",
""
],
[
"Fedorov",
"Igor",
""
],
[
"Xiong",
"Yunyang",
""
],
[
"Chang"... | This paper addresses the growing need for efficient large language models (LLMs) on mobile devices, driven by increasing cloud costs and latency concerns. We focus on designing top-quality LLMs with fewer than a billion parameters, a practical choice for mobile deployment. Contrary to prevailing belief emphasizing the ... |
1810.02274 | Nikolay Savinov | Nikolay Savinov, Anton Raichuk, Rapha\"el Marinier, Damien Vincent,
Marc Pollefeys, Timothy Lillicrap, Sylvain Gelly | Episodic Curiosity through Reachability | Accepted to ICLR 2019. Code at
https://github.com/google-research/episodic-curiosity/. Videos at
https://sites.google.com/view/episodic-curiosity/ | null | null | null | cs.LG cs.AI cs.CV cs.RO stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Rewards are sparse in the real world and most of today's reinforcement
learning algorithms struggle with such sparsity. One solution to this problem
is to allow the agent to create rewards for itself - thus making rewards dense
and more suitable for learning. In particular, inspired by curious behaviour in
animals, o... | [
{
"created": "Thu, 4 Oct 2018 15:24:06 GMT",
"version": "v1"
},
{
"created": "Sat, 1 Dec 2018 17:39:39 GMT",
"version": "v2"
},
{
"created": "Fri, 22 Feb 2019 17:02:58 GMT",
"version": "v3"
},
{
"created": "Thu, 9 May 2019 13:10:33 GMT",
"version": "v4"
},
{
"crea... | 2019-08-07 | [
[
"Savinov",
"Nikolay",
""
],
[
"Raichuk",
"Anton",
""
],
[
"Marinier",
"Raphaël",
""
],
[
"Vincent",
"Damien",
""
],
[
"Pollefeys",
"Marc",
""
],
[
"Lillicrap",
"Timothy",
""
],
[
"Gelly",
"Sylvain",
""
]
... | Rewards are sparse in the real world and most of today's reinforcement learning algorithms struggle with such sparsity. One solution to this problem is to allow the agent to create rewards for itself - thus making rewards dense and more suitable for learning. In particular, inspired by curious behaviour in animals, obs... |
2305.03048 | Renrui Zhang | Renrui Zhang, Zhengkai Jiang, Ziyu Guo, Shilin Yan, Junting Pan,
Xianzheng Ma, Hao Dong, Peng Gao, Hongsheng Li | Personalize Segment Anything Model with One Shot | Code is available at https://github.com/ZrrSkywalker/Personalize-SAM | null | null | null | cs.CV cs.AI cs.CL cs.LG cs.MM | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Driven by large-data pre-training, Segment Anything Model (SAM) has been
demonstrated as a powerful and promptable framework, revolutionizing the
segmentation models. Despite the generality, customizing SAM for specific
visual concepts without man-powered prompting is under explored, e.g.,
automatically segmenting yo... | [
{
"created": "Thu, 4 May 2023 17:59:36 GMT",
"version": "v1"
},
{
"created": "Wed, 4 Oct 2023 01:15:21 GMT",
"version": "v2"
}
] | 2023-10-05 | [
[
"Zhang",
"Renrui",
""
],
[
"Jiang",
"Zhengkai",
""
],
[
"Guo",
"Ziyu",
""
],
[
"Yan",
"Shilin",
""
],
[
"Pan",
"Junting",
""
],
[
"Ma",
"Xianzheng",
""
],
[
"Dong",
"Hao",
""
],
[
"Gao",
"Peng",... | Driven by large-data pre-training, Segment Anything Model (SAM) has been demonstrated as a powerful and promptable framework, revolutionizing the segmentation models. Despite the generality, customizing SAM for specific visual concepts without man-powered prompting is under explored, e.g., automatically segmenting your... |
1409.7853 | Fatiha Merazka FM | Aziz Mouzali, Fatiha Merazka | Quantum correction with three codes | 24 pages | null | null | null | cs.IT math.IT quant-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we provise an implementation of five, seven and nine-qubits
error correcting codes on a classical computer using the quantum simulator
Feynman program. We also compare the three codes by computing the fidelity when
double errors occurs in a depolarizing channel. As triple errors and more are
considered... | [
{
"created": "Sat, 27 Sep 2014 22:46:57 GMT",
"version": "v1"
}
] | 2014-09-30 | [
[
"Mouzali",
"Aziz",
""
],
[
"Merazka",
"Fatiha",
""
]
] | In this paper, we provise an implementation of five, seven and nine-qubits error correcting codes on a classical computer using the quantum simulator Feynman program. We also compare the three codes by computing the fidelity when double errors occurs in a depolarizing channel. As triple errors and more are considered v... |
2111.09515 | Yantao Lu | Yantao Lu, Xuetao Hao, Yilan Li, Weiheng Chai, Shiqi Sun, Senem
Velipasalar | Range-Aware Attention Network for LiDAR-based 3D Object Detection with
Auxiliary Point Density Level Estimation | null | null | null | null | cs.CV | http://creativecommons.org/licenses/by-nc-nd/4.0/ | 3D object detection from LiDAR data for autonomous driving has been making
remarkable strides in recent years. Among the state-of-the-art methodologies,
encoding point clouds into a bird's eye view (BEV) has been demonstrated to be
both effective and efficient. Different from perspective views, BEV preserves
rich spa... | [
{
"created": "Thu, 18 Nov 2021 04:20:13 GMT",
"version": "v1"
},
{
"created": "Tue, 15 Mar 2022 16:49:31 GMT",
"version": "v2"
},
{
"created": "Tue, 14 Jun 2022 06:30:07 GMT",
"version": "v3"
},
{
"created": "Mon, 8 Aug 2022 05:57:55 GMT",
"version": "v4"
}
] | 2022-08-09 | [
[
"Lu",
"Yantao",
""
],
[
"Hao",
"Xuetao",
""
],
[
"Li",
"Yilan",
""
],
[
"Chai",
"Weiheng",
""
],
[
"Sun",
"Shiqi",
""
],
[
"Velipasalar",
"Senem",
""
]
] | 3D object detection from LiDAR data for autonomous driving has been making remarkable strides in recent years. Among the state-of-the-art methodologies, encoding point clouds into a bird's eye view (BEV) has been demonstrated to be both effective and efficient. Different from perspective views, BEV preserves rich spati... |
1904.00954 | Francesco Dolce | Francesco Dolce, Antonio Restivo, Christophe Reutenauer | Some variations on Lyndon words | arXiv admin note: text overlap with arXiv:1812.04515 | null | null | null | cs.DM math.CO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper we compare two finite words $u$ and $v$ by the lexicographical
order of the infinite words $u^\omega$ and $v^\omega$. Informally, we say that
we compare $u$ and $v$ by the infinite order. We show several properties of
Lyndon words expressed using this infinite order. The innovative aspect of this
approa... | [
{
"created": "Mon, 1 Apr 2019 16:46:07 GMT",
"version": "v1"
}
] | 2019-04-02 | [
[
"Dolce",
"Francesco",
""
],
[
"Restivo",
"Antonio",
""
],
[
"Reutenauer",
"Christophe",
""
]
] | In this paper we compare two finite words $u$ and $v$ by the lexicographical order of the infinite words $u^\omega$ and $v^\omega$. Informally, we say that we compare $u$ and $v$ by the infinite order. We show several properties of Lyndon words expressed using this infinite order. The innovative aspect of this approach... |
1604.05923 | Federico Nanni | Federico Nanni | Reconstructing a website's lost past: Methodological issues concerning
the history of www.unibo.it | null | null | null | null | cs.DL cs.CY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper describes how born digital primary sources could be used to
reconstruct the recent history of scientific institutions. The case study is an
analysis of the first 25 years online of the University of Bologna. The focus
of this work is primarily methodological: several different issues are
presented, startin... | [
{
"created": "Wed, 20 Apr 2016 12:45:51 GMT",
"version": "v1"
}
] | 2016-04-21 | [
[
"Nanni",
"Federico",
""
]
] | This paper describes how born digital primary sources could be used to reconstruct the recent history of scientific institutions. The case study is an analysis of the first 25 years online of the University of Bologna. The focus of this work is primarily methodological: several different issues are presented, starting ... |
2306.03030 | Junling Liu | Junling Liu, Peilin Zhou, Yining Hua, Dading Chong, Zhongyu Tian,
Andrew Liu, Helin Wang, Chenyu You, Zhenhua Guo, Lei Zhu, Michael Lingzhi Li | Benchmarking Large Language Models on CMExam -- A Comprehensive Chinese
Medical Exam Dataset | Accepted by NeurIPS 2023 Datasets and Benchmarks Track | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Recent advancements in large language models (LLMs) have transformed the
field of question answering (QA). However, evaluating LLMs in the medical field
is challenging due to the lack of standardized and comprehensive datasets. To
address this gap, we introduce CMExam, sourced from the Chinese National
Medical Licens... | [
{
"created": "Mon, 5 Jun 2023 16:48:41 GMT",
"version": "v1"
},
{
"created": "Thu, 8 Jun 2023 06:13:36 GMT",
"version": "v2"
},
{
"created": "Mon, 23 Oct 2023 02:55:08 GMT",
"version": "v3"
}
] | 2023-10-24 | [
[
"Liu",
"Junling",
""
],
[
"Zhou",
"Peilin",
""
],
[
"Hua",
"Yining",
""
],
[
"Chong",
"Dading",
""
],
[
"Tian",
"Zhongyu",
""
],
[
"Liu",
"Andrew",
""
],
[
"Wang",
"Helin",
""
],
[
"You",
"Cheny... | Recent advancements in large language models (LLMs) have transformed the field of question answering (QA). However, evaluating LLMs in the medical field is challenging due to the lack of standardized and comprehensive datasets. To address this gap, we introduce CMExam, sourced from the Chinese National Medical Licensin... |
2304.03691 | Vrizlynn L. L. Thing | Zihao Wang, Vrizlynn L. L. Thing | Feature Mining for Encrypted Malicious Traffic Detection with Deep
Learning and Other Machine Learning Algorithms | Computers & Security, Volume 128, No. 103143, 2023 | Computers & Security, Volume 128, No. 103143, 2023 | 10.1016/j.cose.2023.103143 | null | cs.CR cs.AI cs.LG | http://creativecommons.org/licenses/by-nc-nd/4.0/ | The popularity of encryption mechanisms poses a great challenge to malicious
traffic detection. The reason is traditional detection techniques cannot work
without the decryption of encrypted traffic. Currently, research on encrypted
malicious traffic detection without decryption has focused on feature
extraction and ... | [
{
"created": "Fri, 7 Apr 2023 15:25:36 GMT",
"version": "v1"
}
] | 2023-04-10 | [
[
"Wang",
"Zihao",
""
],
[
"Thing",
"Vrizlynn L. L.",
""
]
] | The popularity of encryption mechanisms poses a great challenge to malicious traffic detection. The reason is traditional detection techniques cannot work without the decryption of encrypted traffic. Currently, research on encrypted malicious traffic detection without decryption has focused on feature extraction and th... |
2304.12183 | Zuhaib Akhtar | Zuhaib Akhtar, Mohammad Omar Khursheed, Dongsu Du, Yuzong Liu | Small-footprint slimmable networks for keyword spotting | null | null | null | null | cs.SD cs.LG eess.AS | http://creativecommons.org/licenses/by/4.0/ | In this work, we present Slimmable Neural Networks applied to the problem of
small-footprint keyword spotting. We show that slimmable neural networks allow
us to create super-nets from Convolutioanl Neural Networks and Transformers,
from which sub-networks of different sizes can be extracted. We demonstrate the
usefu... | [
{
"created": "Fri, 21 Apr 2023 12:59:37 GMT",
"version": "v1"
}
] | 2023-04-25 | [
[
"Akhtar",
"Zuhaib",
""
],
[
"Khursheed",
"Mohammad Omar",
""
],
[
"Du",
"Dongsu",
""
],
[
"Liu",
"Yuzong",
""
]
] | In this work, we present Slimmable Neural Networks applied to the problem of small-footprint keyword spotting. We show that slimmable neural networks allow us to create super-nets from Convolutioanl Neural Networks and Transformers, from which sub-networks of different sizes can be extracted. We demonstrate the usefuln... |
2001.04147 | Przemys{\l}aw Spurek | Andrzej Bedychaj, Przemys{\l}aw Spurek, Aleksandra Nowak, Jacek Tabor | WICA: nonlinear weighted ICA | null | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Independent Component Analysis (ICA) aims to find a coordinate system in
which the components of the data are independent. In this paper we construct a
new nonlinear ICA model, called WICA, which obtains better and more stable
results than other algorithms. A crucial tool is given by a new efficient
method of verifyi... | [
{
"created": "Mon, 13 Jan 2020 10:38:03 GMT",
"version": "v1"
},
{
"created": "Wed, 9 Dec 2020 21:37:54 GMT",
"version": "v2"
}
] | 2020-12-11 | [
[
"Bedychaj",
"Andrzej",
""
],
[
"Spurek",
"Przemysław",
""
],
[
"Nowak",
"Aleksandra",
""
],
[
"Tabor",
"Jacek",
""
]
] | Independent Component Analysis (ICA) aims to find a coordinate system in which the components of the data are independent. In this paper we construct a new nonlinear ICA model, called WICA, which obtains better and more stable results than other algorithms. A crucial tool is given by a new efficient method of verifying... |
1801.02300 | Hamed Rezaei | Hamed Rezaei, Nima Ghazanfari motlagha, Yaghoub Farjamib, Mohammad
Hossein Yektae | A Novel Framework for DDoS Detectionin Huge Scale Networks, Thanksto QoS
Features | null | null | null | null | cs.NI cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | It is not been a long time since the advent of cloud-based technology.
However, in this short period of timeseveral advantages and disadvantages have
been emerged. This is a problem solving technology with some threats as well.
These threats and potential damages are not only limited to the cloud-based
technologies, ... | [
{
"created": "Mon, 8 Jan 2018 03:20:20 GMT",
"version": "v1"
}
] | 2018-01-09 | [
[
"Rezaei",
"Hamed",
""
],
[
"motlagha",
"Nima Ghazanfari",
""
],
[
"Farjamib",
"Yaghoub",
""
],
[
"Yektae",
"Mohammad Hossein",
""
]
] | It is not been a long time since the advent of cloud-based technology. However, in this short period of timeseveral advantages and disadvantages have been emerged. This is a problem solving technology with some threats as well. These threats and potential damages are not only limited to the cloud-based technologies, bu... |
2303.00694 | Anirudh Vemula | Anirudh Vemula, Yuda Song, Aarti Singh, J. Andrew Bagnell, Sanjiban
Choudhury | The Virtues of Laziness in Model-based RL: A Unified Objective and
Algorithms | null | null | null | null | cs.LG cs.RO cs.SY eess.SY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We propose a novel approach to addressing two fundamental challenges in
Model-based Reinforcement Learning (MBRL): the computational expense of
repeatedly finding a good policy in the learned model, and the objective
mismatch between model fitting and policy computation. Our "lazy" method
leverages a novel unified ob... | [
{
"created": "Wed, 1 Mar 2023 17:42:26 GMT",
"version": "v1"
}
] | 2023-03-02 | [
[
"Vemula",
"Anirudh",
""
],
[
"Song",
"Yuda",
""
],
[
"Singh",
"Aarti",
""
],
[
"Bagnell",
"J. Andrew",
""
],
[
"Choudhury",
"Sanjiban",
""
]
] | We propose a novel approach to addressing two fundamental challenges in Model-based Reinforcement Learning (MBRL): the computational expense of repeatedly finding a good policy in the learned model, and the objective mismatch between model fitting and policy computation. Our "lazy" method leverages a novel unified obje... |
1311.0366 | Ishay Haviv | Ishay Haviv and Oded Regev | On the Lattice Isomorphism Problem | 23 pages, SODA 2014 | null | null | null | cs.DS cs.CC cs.DM math.CO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We study the Lattice Isomorphism Problem (LIP), in which given two lattices
L_1 and L_2 the goal is to decide whether there exists an orthogonal linear
transformation mapping L_1 to L_2. Our main result is an algorithm for this
problem running in time n^{O(n)} times a polynomial in the input size, where n
is the rank... | [
{
"created": "Sat, 2 Nov 2013 10:38:44 GMT",
"version": "v1"
}
] | 2013-11-05 | [
[
"Haviv",
"Ishay",
""
],
[
"Regev",
"Oded",
""
]
] | We study the Lattice Isomorphism Problem (LIP), in which given two lattices L_1 and L_2 the goal is to decide whether there exists an orthogonal linear transformation mapping L_1 to L_2. Our main result is an algorithm for this problem running in time n^{O(n)} times a polynomial in the input size, where n is the rank o... |
2007.13531 | Ioana Bica | Ioana Bica, Daniel Jarrett, Alihan H\"uy\"uk, Mihaela van der Schaar | Learning "What-if" Explanations for Sequential Decision-Making | In Proc. 9th International Conference on Learning Representations
(ICLR 2021) | null | null | null | cs.LG cs.AI stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Building interpretable parameterizations of real-world decision-making on the
basis of demonstrated behavior -- i.e. trajectories of observations and actions
made by an expert maximizing some unknown reward function -- is essential for
introspecting and auditing policies in different institutions. In this paper,
we p... | [
{
"created": "Thu, 2 Jul 2020 14:24:17 GMT",
"version": "v1"
},
{
"created": "Thu, 18 Feb 2021 13:14:44 GMT",
"version": "v2"
},
{
"created": "Tue, 30 Mar 2021 17:32:17 GMT",
"version": "v3"
}
] | 2021-03-31 | [
[
"Bica",
"Ioana",
""
],
[
"Jarrett",
"Daniel",
""
],
[
"Hüyük",
"Alihan",
""
],
[
"van der Schaar",
"Mihaela",
""
]
] | Building interpretable parameterizations of real-world decision-making on the basis of demonstrated behavior -- i.e. trajectories of observations and actions made by an expert maximizing some unknown reward function -- is essential for introspecting and auditing policies in different institutions. In this paper, we pro... |
1911.12753 | Jose Camacho-Collados | Zied Bouraoui, Jose Camacho-Collados and Steven Schockaert | Inducing Relational Knowledge from BERT | Accepted to AAAI 2020 | null | null | null | cs.CL cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | One of the most remarkable properties of word embeddings is the fact that
they capture certain types of semantic and syntactic relationships. Recently,
pre-trained language models such as BERT have achieved groundbreaking results
across a wide range of Natural Language Processing tasks. However, it is
unclear to what... | [
{
"created": "Thu, 28 Nov 2019 15:38:53 GMT",
"version": "v1"
}
] | 2019-12-02 | [
[
"Bouraoui",
"Zied",
""
],
[
"Camacho-Collados",
"Jose",
""
],
[
"Schockaert",
"Steven",
""
]
] | One of the most remarkable properties of word embeddings is the fact that they capture certain types of semantic and syntactic relationships. Recently, pre-trained language models such as BERT have achieved groundbreaking results across a wide range of Natural Language Processing tasks. However, it is unclear to what e... |
2405.03917 | Tianyi Zhang | Tianyi Zhang, Jonah Yi, Zhaozhuo Xu, Anshumali Shrivastava | KV Cache is 1 Bit Per Channel: Efficient Large Language Model Inference
with Coupled Quantization | null | null | null | null | cs.LG | http://creativecommons.org/licenses/by/4.0/ | Efficient deployment of Large Language Models (LLMs) requires batching
multiple requests together to improve throughput. As the batch size, context
length, or model size increases, the size of the key and value (KV) cache can
quickly become the main contributor to GPU memory usage and the bottleneck of
inference late... | [
{
"created": "Tue, 7 May 2024 00:25:20 GMT",
"version": "v1"
}
] | 2024-05-08 | [
[
"Zhang",
"Tianyi",
""
],
[
"Yi",
"Jonah",
""
],
[
"Xu",
"Zhaozhuo",
""
],
[
"Shrivastava",
"Anshumali",
""
]
] | Efficient deployment of Large Language Models (LLMs) requires batching multiple requests together to improve throughput. As the batch size, context length, or model size increases, the size of the key and value (KV) cache can quickly become the main contributor to GPU memory usage and the bottleneck of inference latenc... |
1602.07291 | Omid Sadjadi | Seyed Omid Sadjadi, Sriram Ganapathy, Jason W. Pelecanos | The IBM 2016 Speaker Recognition System | Submitted to Odyssey 2016 | null | null | null | cs.SD cs.CL stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper we describe the recent advancements made in the IBM i-vector
speaker recognition system for conversational speech. In particular, we
identify key techniques that contribute to significant improvements in
performance of our system, and quantify their contributions. The techniques
include: 1) a nearest-ne... | [
{
"created": "Tue, 23 Feb 2016 20:39:40 GMT",
"version": "v1"
}
] | 2016-02-24 | [
[
"Sadjadi",
"Seyed Omid",
""
],
[
"Ganapathy",
"Sriram",
""
],
[
"Pelecanos",
"Jason W.",
""
]
] | In this paper we describe the recent advancements made in the IBM i-vector speaker recognition system for conversational speech. In particular, we identify key techniques that contribute to significant improvements in performance of our system, and quantify their contributions. The techniques include: 1) a nearest-neig... |
1809.02306 | Takashi Wada | Takashi Wada, Tomoharu Iwata | Unsupervised Cross-lingual Word Embedding by Multilingual Neural
Language Models | 8 pages | null | null | null | cs.CL cs.AI cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We propose an unsupervised method to obtain cross-lingual embeddings without
any parallel data or pre-trained word embeddings. The proposed model, which we
call multilingual neural language models, takes sentences of multiple languages
as an input. The proposed model contains bidirectional LSTMs that perform as
forwa... | [
{
"created": "Fri, 7 Sep 2018 04:17:40 GMT",
"version": "v1"
}
] | 2018-09-10 | [
[
"Wada",
"Takashi",
""
],
[
"Iwata",
"Tomoharu",
""
]
] | We propose an unsupervised method to obtain cross-lingual embeddings without any parallel data or pre-trained word embeddings. The proposed model, which we call multilingual neural language models, takes sentences of multiple languages as an input. The proposed model contains bidirectional LSTMs that perform as forward... |
1910.09322 | Nino Vieillard | Nino Vieillard, Bruno Scherrer, Olivier Pietquin, Matthieu Geist | Momentum in Reinforcement Learning | AISTATS 2020 | null | null | null | cs.LG stat.ML | http://creativecommons.org/licenses/by-nc-sa/4.0/ | We adapt the optimization's concept of momentum to reinforcement learning.
Seeing the state-action value functions as an analog to the gradients in
optimization, we interpret momentum as an average of consecutive $q$-functions.
We derive Momentum Value Iteration (MoVI), a variation of Value Iteration that
incorporate... | [
{
"created": "Mon, 21 Oct 2019 12:51:38 GMT",
"version": "v1"
},
{
"created": "Tue, 31 Mar 2020 10:25:46 GMT",
"version": "v2"
}
] | 2020-04-01 | [
[
"Vieillard",
"Nino",
""
],
[
"Scherrer",
"Bruno",
""
],
[
"Pietquin",
"Olivier",
""
],
[
"Geist",
"Matthieu",
""
]
] | We adapt the optimization's concept of momentum to reinforcement learning. Seeing the state-action value functions as an analog to the gradients in optimization, we interpret momentum as an average of consecutive $q$-functions. We derive Momentum Value Iteration (MoVI), a variation of Value Iteration that incorporates ... |
1710.07266 | Yao Ma | Yao Ma (1), Suhang Wang (2), ZhaoChun Ren (3), Dawei Yin (3), Jiliang
Tang (1) ((1) Michigan State University, (2) Arizona State University, (3)
JD.com) | Preserving Local and Global Information for Network Embedding | null | null | null | null | cs.SI physics.soc-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Networks such as social networks, airplane networks, and citation networks
are ubiquitous. The adjacency matrix is often adopted to represent a network,
which is usually high dimensional and sparse. However, to apply advanced
machine learning algorithms to network data, low-dimensional and continuous
representations ... | [
{
"created": "Thu, 19 Oct 2017 17:48:52 GMT",
"version": "v1"
}
] | 2018-08-21 | [
[
"Ma",
"Yao",
""
],
[
"Wang",
"Suhang",
""
],
[
"Ren",
"ZhaoChun",
""
],
[
"Yin",
"Dawei",
""
],
[
"Tang",
"Jiliang",
""
]
] | Networks such as social networks, airplane networks, and citation networks are ubiquitous. The adjacency matrix is often adopted to represent a network, which is usually high dimensional and sparse. However, to apply advanced machine learning algorithms to network data, low-dimensional and continuous representations ar... |
2205.10714 | Yu Cao | Hanhao Qu, Yu Cao, Jun Gao, Liang Ding, Ruifeng Xu | Interpretable Proof Generation via Iterative Backward Reasoning | NAACL-HLT 2022 (Long), 14 pages (2 page references + 3 page appendix) | null | null | null | cs.CL cs.AI | http://creativecommons.org/licenses/by/4.0/ | We present IBR, an Iterative Backward Reasoning model to solve the proof
generation tasks on rule-based Question Answering (QA), where models are
required to reason over a series of textual rules and facts to find out the
related proof path and derive the final answer. We handle the limitations of
existed works in tw... | [
{
"created": "Sun, 22 May 2022 02:44:14 GMT",
"version": "v1"
},
{
"created": "Tue, 24 May 2022 08:58:36 GMT",
"version": "v2"
}
] | 2022-05-25 | [
[
"Qu",
"Hanhao",
""
],
[
"Cao",
"Yu",
""
],
[
"Gao",
"Jun",
""
],
[
"Ding",
"Liang",
""
],
[
"Xu",
"Ruifeng",
""
]
] | We present IBR, an Iterative Backward Reasoning model to solve the proof generation tasks on rule-based Question Answering (QA), where models are required to reason over a series of textual rules and facts to find out the related proof path and derive the final answer. We handle the limitations of existed works in two ... |
2311.13355 | Zhen Cheng | Zhen Cheng, Xu-Yao Zhang, Cheng-Lin Liu | Unified Classification and Rejection: A One-versus-All Framework | Published in Machine Intelligence Research
(https://link.springer.com/article/10.1007/s11633-024-1514-4) | null | 10.1007/s11633-024-1514-4 | null | cs.CV cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Classifying patterns of known classes and rejecting ambiguous and novel (also
called as out-of-distribution (OOD)) inputs are involved in open world pattern
recognition. Deep neural network models usually excel in closed-set
classification while performs poorly in rejecting OOD inputs. To tackle this
problem, numerou... | [
{
"created": "Wed, 22 Nov 2023 12:47:12 GMT",
"version": "v1"
},
{
"created": "Sun, 4 Aug 2024 10:31:41 GMT",
"version": "v2"
}
] | 2024-08-06 | [
[
"Cheng",
"Zhen",
""
],
[
"Zhang",
"Xu-Yao",
""
],
[
"Liu",
"Cheng-Lin",
""
]
] | Classifying patterns of known classes and rejecting ambiguous and novel (also called as out-of-distribution (OOD)) inputs are involved in open world pattern recognition. Deep neural network models usually excel in closed-set classification while performs poorly in rejecting OOD inputs. To tackle this problem, numerous ... |
2212.03088 | Yu Li | Yu Li, Muxi Chen, Yannan Liu, Daojing He, and Qiang Xu | An Empirical Study on the Efficacy of Deep Active Learning for Image
Classification | null | null | null | null | cs.CV cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Deep Active Learning (DAL) has been advocated as a promising method to reduce
labeling costs in supervised learning. However, existing evaluations of DAL
methods are based on different settings, and their results are controversial.
To tackle this issue, this paper comprehensively evaluates 19 existing DAL
methods in ... | [
{
"created": "Wed, 30 Nov 2022 17:44:59 GMT",
"version": "v1"
}
] | 2022-12-07 | [
[
"Li",
"Yu",
""
],
[
"Chen",
"Muxi",
""
],
[
"Liu",
"Yannan",
""
],
[
"He",
"Daojing",
""
],
[
"Xu",
"Qiang",
""
]
] | Deep Active Learning (DAL) has been advocated as a promising method to reduce labeling costs in supervised learning. However, existing evaluations of DAL methods are based on different settings, and their results are controversial. To tackle this issue, this paper comprehensively evaluates 19 existing DAL methods in a ... |
2110.12511 | Kartik Lakhotia | Kartik Lakhotia, Rajgopal Kannan, Viktor Prasanna | Parallel Peeling of Bipartite Networks for Hierarchical Dense Subgraph
Discovery | 31 pages, 11 figures, 4 tables. Source code available at
https://github.com/kartiklakhotia/RECEIPT | null | null | null | cs.DC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Wing and Tip decomposition construct a hierarchy of butterfly-dense edge and
vertex induced bipartite subgraphs, respectively. They have applications in
several domains including e-commerce, recommendation systems and document
analysis. Existing decomposition algorithms use a bottom-up approach that
constructs the hi... | [
{
"created": "Sun, 24 Oct 2021 19:27:20 GMT",
"version": "v1"
}
] | 2021-10-26 | [
[
"Lakhotia",
"Kartik",
""
],
[
"Kannan",
"Rajgopal",
""
],
[
"Prasanna",
"Viktor",
""
]
] | Wing and Tip decomposition construct a hierarchy of butterfly-dense edge and vertex induced bipartite subgraphs, respectively. They have applications in several domains including e-commerce, recommendation systems and document analysis. Existing decomposition algorithms use a bottom-up approach that constructs the hier... |
2306.04487 | Gangyi Zhang | Gangyi Zhang, Chongming Gao, Wenqiang Lei, Xiaojie Guo, Shijun Li,
Hongshen Chen, Zhuozhi Ding, Sulong Xu and Lingfei Wu | Adaptive Vague Preference Policy Learning for Multi-round Conversational
Recommendation | null | null | null | null | cs.IR | http://creativecommons.org/licenses/by/4.0/ | Conversational recommendation systems (CRS) aim to elicit user preferences
and provide satisfying recommendations through natural language interactions.
Existing CRS methods often assume that users have clear and consistent
preferences, which may not reflect the reality of user decision-making
processes. In this pape... | [
{
"created": "Wed, 7 Jun 2023 14:57:21 GMT",
"version": "v1"
},
{
"created": "Thu, 17 Aug 2023 08:37:48 GMT",
"version": "v2"
},
{
"created": "Wed, 27 Dec 2023 15:39:10 GMT",
"version": "v3"
}
] | 2023-12-29 | [
[
"Zhang",
"Gangyi",
""
],
[
"Gao",
"Chongming",
""
],
[
"Lei",
"Wenqiang",
""
],
[
"Guo",
"Xiaojie",
""
],
[
"Li",
"Shijun",
""
],
[
"Chen",
"Hongshen",
""
],
[
"Ding",
"Zhuozhi",
""
],
[
"Xu",
"... | Conversational recommendation systems (CRS) aim to elicit user preferences and provide satisfying recommendations through natural language interactions. Existing CRS methods often assume that users have clear and consistent preferences, which may not reflect the reality of user decision-making processes. In this paper,... |
1406.4211 | Thierry Poibeau | Pierre Bourreau and Thierry Poibeau | Mapping the Economic Crisis: Some Preliminary Investigations | Technical paper describing the Lattice submission to the 2014
PoliInformatics Unshared task | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper we describe our contribution to the PoliInformatics 2014
Challenge on the 2007-2008 financial crisis. We propose a state of the art
technique to extract information from texts and provide different
representations, giving first a static overview of the domain and then a
dynamic representation of its mai... | [
{
"created": "Tue, 17 Jun 2014 01:34:22 GMT",
"version": "v1"
}
] | 2014-06-18 | [
[
"Bourreau",
"Pierre",
""
],
[
"Poibeau",
"Thierry",
""
]
] | In this paper we describe our contribution to the PoliInformatics 2014 Challenge on the 2007-2008 financial crisis. We propose a state of the art technique to extract information from texts and provide different representations, giving first a static overview of the domain and then a dynamic representation of its main ... |
1802.08802 | Evan Liu | Evan Zheran Liu, Kelvin Guu, Panupong Pasupat, Tianlin Shi, Percy
Liang | Reinforcement Learning on Web Interfaces Using Workflow-Guided
Exploration | International Conference on Learning Representations (ICLR), 2018 | null | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Reinforcement learning (RL) agents improve through trial-and-error, but when
reward is sparse and the agent cannot discover successful action sequences,
learning stagnates. This has been a notable problem in training deep RL agents
to perform web-based tasks, such as booking flights or replying to emails,
where a sin... | [
{
"created": "Sat, 24 Feb 2018 05:32:47 GMT",
"version": "v1"
}
] | 2018-02-27 | [
[
"Liu",
"Evan Zheran",
""
],
[
"Guu",
"Kelvin",
""
],
[
"Pasupat",
"Panupong",
""
],
[
"Shi",
"Tianlin",
""
],
[
"Liang",
"Percy",
""
]
] | Reinforcement learning (RL) agents improve through trial-and-error, but when reward is sparse and the agent cannot discover successful action sequences, learning stagnates. This has been a notable problem in training deep RL agents to perform web-based tasks, such as booking flights or replying to emails, where a singl... |
1706.09077 | Khizar Hayat | Khizar Hayat | Super-Resolution via Deep Learning | null | null | 10.1016/j.dsp.2018.07.005 | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The recent phenomenal interest in convolutional neural networks (CNNs) must
have made it inevitable for the super-resolution (SR) community to explore its
potential. The response has been immense and in the last three years, since the
advent of the pioneering work, there appeared too many works not to warrant a
compr... | [
{
"created": "Wed, 28 Jun 2017 00:02:18 GMT",
"version": "v1"
}
] | 2018-08-14 | [
[
"Hayat",
"Khizar",
""
]
] | The recent phenomenal interest in convolutional neural networks (CNNs) must have made it inevitable for the super-resolution (SR) community to explore its potential. The response has been immense and in the last three years, since the advent of the pioneering work, there appeared too many works not to warrant a compreh... |
2108.09249 | Calvin Deutschbein | Calvin Deutschbein | Mining Secure Behavior of Hardware Designs | Final accepted version of Ph.D. Thesis. 121 Pages, 18 figures, 24
tables. Chapter 5 based on work in arXiv:2106.07449. Advised by Cynthia
Sturton, approved by Fabian Monrose, Peng Huang, Donald Porter, Michael
Reiter. Based on work with Cynthia Sturton, Andres Meza, Francesco Restuccia,
Ryan Kastner. Completed ... | null | null | null | cs.CR cs.AR | http://creativecommons.org/licenses/by/4.0/ | Specification mining offers a solution by automating security specification
for hardware. Specification miners use a form of machine learning to specify
behaviors of a system by studying a system in execution. However, specification
mining was first developed for use with software. Complex hardware designs
offer uniq... | [
{
"created": "Fri, 20 Aug 2021 16:30:31 GMT",
"version": "v1"
}
] | 2021-08-23 | [
[
"Deutschbein",
"Calvin",
""
]
] | Specification mining offers a solution by automating security specification for hardware. Specification miners use a form of machine learning to specify behaviors of a system by studying a system in execution. However, specification mining was first developed for use with software. Complex hardware designs offer unique... |
2112.06453 | \'Angel Longueira-Romero | \'Angel Longueira-Romero, Rosa Iglesias, Jose Luis Flores and I\~naki
Garitano | A Novel Model for Vulnerability Analysis through Enhanced Directed
Graphs and Quantitative Metrics | 26 pages, 5 figures, 12 tables | Sensors 2022, 22(6), 2126 | 10.3390/s22062126 | null | cs.CR | http://creativecommons.org/licenses/by/4.0/ | Industrial components are of high importance because they control critical
infrastructures that form the lifeline of modern societies. However, the rapid
evolution of industrial components, together with the new paradigm of Industry
4.0, and the new connectivity features that will be introduced by the 5G
technology, ... | [
{
"created": "Mon, 13 Dec 2021 07:16:55 GMT",
"version": "v1"
}
] | 2022-03-16 | [
[
"Longueira-Romero",
"Ángel",
""
],
[
"Iglesias",
"Rosa",
""
],
[
"Flores",
"Jose Luis",
""
],
[
"Garitano",
"Iñaki",
""
]
] | Industrial components are of high importance because they control critical infrastructures that form the lifeline of modern societies. However, the rapid evolution of industrial components, together with the new paradigm of Industry 4.0, and the new connectivity features that will be introduced by the 5G technology, al... |
1302.0320 | Xingqin Lin | Xingqin Lin and Harish Viswanathan | Dynamic Spectrum Refarming with Overlay for Legacy Devices | 12 pages, 14 figures, submitted to IEEE Transactions on Wireless
Communications | null | null | null | cs.NI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The explosive growth in data traffic is resulting in a spectrum crunch
forcing many wireless network operators to look towards refarming their 2G
spectrum and deploy more spectrally efficient Long Term Evolution (LTE)
technology. However, mobile network operators face a challenge when it comes to
spectrum refarming b... | [
{
"created": "Sat, 2 Feb 2013 00:16:17 GMT",
"version": "v1"
},
{
"created": "Sat, 22 Jun 2013 04:14:01 GMT",
"version": "v2"
}
] | 2013-06-25 | [
[
"Lin",
"Xingqin",
""
],
[
"Viswanathan",
"Harish",
""
]
] | The explosive growth in data traffic is resulting in a spectrum crunch forcing many wireless network operators to look towards refarming their 2G spectrum and deploy more spectrally efficient Long Term Evolution (LTE) technology. However, mobile network operators face a challenge when it comes to spectrum refarming bec... |
1710.07628 | Shu Wang | Shu Wang, Chi Li, William Sentosa, Henry Hoffmann, Shan Lu | Understanding and Auto-Adjusting Performance-Related Configurations | null | null | null | null | cs.DC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Modern software systems are often equipped with hundreds to thousands of
configuration options, many of which greatly affect performance. Unfortunately,
properly setting these configurations is challenging for developers due to the
complex and dynamic nature of system workload and environment. In this paper,
we first... | [
{
"created": "Fri, 20 Oct 2017 17:56:46 GMT",
"version": "v1"
}
] | 2017-10-23 | [
[
"Wang",
"Shu",
""
],
[
"Li",
"Chi",
""
],
[
"Sentosa",
"William",
""
],
[
"Hoffmann",
"Henry",
""
],
[
"Lu",
"Shan",
""
]
] | Modern software systems are often equipped with hundreds to thousands of configuration options, many of which greatly affect performance. Unfortunately, properly setting these configurations is challenging for developers due to the complex and dynamic nature of system workload and environment. In this paper, we first c... |
1804.03830 | Takayasu Moriya | Takayasu Moriya, Holger R. Roth, Shota Nakamura, Hirohisa Oda, Kai
Nagara, Masahiro Oda, Kensaku Mori | Unsupervised Segmentation of 3D Medical Images Based on Clustering and
Deep Representation Learning | This paper was presented at SPIE Medical Imaging 2018, Houston, TX,
USA | Proc. SPIE 10578, Medical Imaging 2018: Biomedical Applications in
Molecular, Structural, and Functional Imaging, 1057820 (12 March 2018) | 10.1117/12.2293414 | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper presents a novel unsupervised segmentation method for 3D medical
images. Convolutional neural networks (CNNs) have brought significant advances
in image segmentation. However, most of the recent methods rely on supervised
learning, which requires large amounts of manually annotated data. Thus, it is
challe... | [
{
"created": "Wed, 11 Apr 2018 06:30:30 GMT",
"version": "v1"
}
] | 2018-04-13 | [
[
"Moriya",
"Takayasu",
""
],
[
"Roth",
"Holger R.",
""
],
[
"Nakamura",
"Shota",
""
],
[
"Oda",
"Hirohisa",
""
],
[
"Nagara",
"Kai",
""
],
[
"Oda",
"Masahiro",
""
],
[
"Mori",
"Kensaku",
""
]
] | This paper presents a novel unsupervised segmentation method for 3D medical images. Convolutional neural networks (CNNs) have brought significant advances in image segmentation. However, most of the recent methods rely on supervised learning, which requires large amounts of manually annotated data. Thus, it is challeng... |
1811.01345 | Bita Shams | Bita Shams and Saman Haratizadeh | IteRank: An iterative network-oriented approach to neighbor-based
collaborative ranking | null | Knowledge-Based Systems 128 (2017): 102-114 | null | null | cs.IR cs.SI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Neighbor-based collaborative ranking (NCR) techniques follow three
consecutive steps to recommend items to each target user: first they calculate
the similarities among users, then they estimate concordance of pairwise
preferences to the target user based on the calculated similarities. Finally,
they use estimated pa... | [
{
"created": "Sun, 4 Nov 2018 10:08:08 GMT",
"version": "v1"
}
] | 2018-11-06 | [
[
"Shams",
"Bita",
""
],
[
"Haratizadeh",
"Saman",
""
]
] | Neighbor-based collaborative ranking (NCR) techniques follow three consecutive steps to recommend items to each target user: first they calculate the similarities among users, then they estimate concordance of pairwise preferences to the target user based on the calculated similarities. Finally, they use estimated pair... |
2301.12141 | Pu Cao | Pu Cao, Lu Yang, Dongxv Liu, Xiaoya Yang, Tianrui Huang, Qing Song | What Decreases Editing Capability? Domain-Specific Hybrid Refinement for
Improved GAN Inversion | Accepted by WACV 2024 | null | null | null | cs.CV cs.AI | http://creativecommons.org/licenses/by/4.0/ | Recently, inversion methods have focused on additional high-rate information
in the generator (e.g., weights or intermediate features) to refine inversion
and editing results from embedded latent codes. Although these techniques gain
reasonable improvement in reconstruction, they decrease editing capability,
especial... | [
{
"created": "Sat, 28 Jan 2023 09:31:20 GMT",
"version": "v1"
},
{
"created": "Thu, 16 Mar 2023 10:58:20 GMT",
"version": "v2"
},
{
"created": "Wed, 1 Nov 2023 06:46:40 GMT",
"version": "v3"
}
] | 2023-11-02 | [
[
"Cao",
"Pu",
""
],
[
"Yang",
"Lu",
""
],
[
"Liu",
"Dongxv",
""
],
[
"Yang",
"Xiaoya",
""
],
[
"Huang",
"Tianrui",
""
],
[
"Song",
"Qing",
""
]
] | Recently, inversion methods have focused on additional high-rate information in the generator (e.g., weights or intermediate features) to refine inversion and editing results from embedded latent codes. Although these techniques gain reasonable improvement in reconstruction, they decrease editing capability, especially... |
2106.06524 | S\'eri\'e Emmanuel | Emmanuel S\'eri\'e | WAX-ML: A Python library for machine learning and feedback loops on
streaming data | 12 pages, 7 figures | null | null | null | cs.LG cs.CL | http://creativecommons.org/licenses/by-sa/4.0/ | Wax is what you put on a surfboard to avoid slipping. It is an essential tool
to go surfing... We introduce WAX-ML a research-oriented Python library
providing tools to design powerful machine learning algorithms and feedback
loops working on streaming data. It strives to complement JAX with tools
dedicated to time s... | [
{
"created": "Fri, 11 Jun 2021 17:42:02 GMT",
"version": "v1"
}
] | 2021-06-14 | [
[
"Sérié",
"Emmanuel",
""
]
] | Wax is what you put on a surfboard to avoid slipping. It is an essential tool to go surfing... We introduce WAX-ML a research-oriented Python library providing tools to design powerful machine learning algorithms and feedback loops working on streaming data. It strives to complement JAX with tools dedicated to time ser... |
2104.12456 | Thomas Bird | Thomas Bird, Johannes Ball\'e, Saurabh Singh, Philip A. Chou | 3D Scene Compression through Entropy Penalized Neural Representation
Functions | accepted (in an abridged format) as a contribution to the
Learning-based Image Coding special session of the Picture Coding Symposium
2021 | null | null | null | cs.CV eess.IV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Some forms of novel visual media enable the viewer to explore a 3D scene from
arbitrary viewpoints, by interpolating between a discrete set of original
views. Compared to 2D imagery, these types of applications require much larger
amounts of storage space, which we seek to reduce. Existing approaches for
compressing ... | [
{
"created": "Mon, 26 Apr 2021 10:36:47 GMT",
"version": "v1"
}
] | 2021-04-27 | [
[
"Bird",
"Thomas",
""
],
[
"Ballé",
"Johannes",
""
],
[
"Singh",
"Saurabh",
""
],
[
"Chou",
"Philip A.",
""
]
] | Some forms of novel visual media enable the viewer to explore a 3D scene from arbitrary viewpoints, by interpolating between a discrete set of original views. Compared to 2D imagery, these types of applications require much larger amounts of storage space, which we seek to reduce. Existing approaches for compressing 3D... |
1405.3883 | Bishoksan Kafle | John P. Gallagher and Bishoksan Kafle | Analysis and Transformation Tools for Constrained Horn Clause
Verification | To appear in Theory and Practice of Logic Programming (TPLP) | null | null | null | cs.PL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Several techniques and tools have been developed for verification of
properties expressed as Horn clauses with constraints over a background theory
(CHC). Current CHC verification tools implement intricate algorithms and are
often limited to certain subclasses of CHC problems. Our aim in this work is to
investigate t... | [
{
"created": "Thu, 15 May 2014 15:39:46 GMT",
"version": "v1"
}
] | 2014-05-16 | [
[
"Gallagher",
"John P.",
""
],
[
"Kafle",
"Bishoksan",
""
]
] | Several techniques and tools have been developed for verification of properties expressed as Horn clauses with constraints over a background theory (CHC). Current CHC verification tools implement intricate algorithms and are often limited to certain subclasses of CHC problems. Our aim in this work is to investigate the... |
2205.04126 | Yueying Kao | Yueying Kao and Bowen Pan and Miao Xu and Jiangjing Lyu and Xiangyu
Zhu and Yuanzhang Chang and Xiaobo Li and Zhen Lei | Towards 3D Face Reconstruction in Perspective Projection: Estimating
6DoF Face Pose from Monocular Image | Accepted by TIP | null | 10.1109/TIP.2023.3275535 | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In 3D face reconstruction, orthogonal projection has been widely employed to
substitute perspective projection to simplify the fitting process. This
approximation performs well when the distance between camera and face is far
enough. However, in some scenarios that the face is very close to camera or
moving along the... | [
{
"created": "Mon, 9 May 2022 08:49:41 GMT",
"version": "v1"
},
{
"created": "Wed, 17 May 2023 11:35:41 GMT",
"version": "v2"
}
] | 2023-07-05 | [
[
"Kao",
"Yueying",
""
],
[
"Pan",
"Bowen",
""
],
[
"Xu",
"Miao",
""
],
[
"Lyu",
"Jiangjing",
""
],
[
"Zhu",
"Xiangyu",
""
],
[
"Chang",
"Yuanzhang",
""
],
[
"Li",
"Xiaobo",
""
],
[
"Lei",
"Zhen",... | In 3D face reconstruction, orthogonal projection has been widely employed to substitute perspective projection to simplify the fitting process. This approximation performs well when the distance between camera and face is far enough. However, in some scenarios that the face is very close to camera or moving along the c... |
2006.16984 | Guillaume Baudart | Guillaume Baudart, Peter D. Kirchner, Martin Hirzel, Kiran Kate | Mining Documentation to Extract Hyperparameter Schemas | null | null | null | null | cs.LG cs.DB stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | AI automation tools need machine-readable hyperparameter schemas to define
their search spaces. At the same time, AI libraries often come with good
human-readable documentation. While such documentation contains most of the
necessary information, it is unfortunately not ready to consume by tools. This
paper describes... | [
{
"created": "Tue, 30 Jun 2020 17:32:47 GMT",
"version": "v1"
},
{
"created": "Thu, 2 Jul 2020 21:04:16 GMT",
"version": "v2"
}
] | 2020-07-06 | [
[
"Baudart",
"Guillaume",
""
],
[
"Kirchner",
"Peter D.",
""
],
[
"Hirzel",
"Martin",
""
],
[
"Kate",
"Kiran",
""
]
] | AI automation tools need machine-readable hyperparameter schemas to define their search spaces. At the same time, AI libraries often come with good human-readable documentation. While such documentation contains most of the necessary information, it is unfortunately not ready to consume by tools. This paper describes h... |
1812.04513 | Yiru Shen | Yiru Shen, Eric Muth, Adam Hoover | The Impact of Quantity of Training Data on Recognition of Eating
Gestures | null | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper considers the problem of recognizing eating gestures by tracking
wrist motion. Eating gestures can have large variability in motion depending on
the subject, utensil, and type of food or beverage being consumed. Previous
works have shown viable proofs-of-concept of recognizing eating gestures in
laboratory... | [
{
"created": "Tue, 11 Dec 2018 16:09:07 GMT",
"version": "v1"
}
] | 2018-12-12 | [
[
"Shen",
"Yiru",
""
],
[
"Muth",
"Eric",
""
],
[
"Hoover",
"Adam",
""
]
] | This paper considers the problem of recognizing eating gestures by tracking wrist motion. Eating gestures can have large variability in motion depending on the subject, utensil, and type of food or beverage being consumed. Previous works have shown viable proofs-of-concept of recognizing eating gestures in laboratory s... |
2312.16737 | Enes Duran | Enes Duran, Muhammed Kocabas, Vasileios Choutas, Zicong Fan and
Michael J. Black | HMP: Hand Motion Priors for Pose and Shape Estimation from Video | null | WACV 2024 | null | null | cs.CV | http://creativecommons.org/licenses/by/4.0/ | Understanding how humans interact with the world necessitates accurate 3D
hand pose estimation, a task complicated by the hand's high degree of
articulation, frequent occlusions, self-occlusions, and rapid motions. While
most existing methods rely on single-image inputs, videos have useful cues to
address aforementio... | [
{
"created": "Wed, 27 Dec 2023 22:35:33 GMT",
"version": "v1"
}
] | 2023-12-29 | [
[
"Duran",
"Enes",
""
],
[
"Kocabas",
"Muhammed",
""
],
[
"Choutas",
"Vasileios",
""
],
[
"Fan",
"Zicong",
""
],
[
"Black",
"Michael J.",
""
]
] | Understanding how humans interact with the world necessitates accurate 3D hand pose estimation, a task complicated by the hand's high degree of articulation, frequent occlusions, self-occlusions, and rapid motions. While most existing methods rely on single-image inputs, videos have useful cues to address aforementione... |
2211.14799 | Jen-I Pan | Jen-I Pan, Jheng-Wei Su, Kai-Wen Hsiao, Ting-Yu Yen, Hung-Kuo Chu | Sampling Neural Radiance Fields for Refractive Objects | SIGGRAPH Asia 2022 Technical Communications. 4 pages, 4 figures, 1
table. Project: https://alexkeroro86.github.io/SampleNeRFRO/ Code:
https://github.com/alexkeroro86/SampleNeRFRO | null | 10.1145/3550340.3564234 | null | cs.CV cs.GR cs.LG | http://creativecommons.org/licenses/by/4.0/ | Recently, differentiable volume rendering in neural radiance fields (NeRF)
has gained a lot of popularity, and its variants have attained many impressive
results. However, existing methods usually assume the scene is a homogeneous
volume so that a ray is cast along the straight path. In this work, the scene
is instea... | [
{
"created": "Sun, 27 Nov 2022 11:43:21 GMT",
"version": "v1"
}
] | 2022-11-29 | [
[
"Pan",
"Jen-I",
""
],
[
"Su",
"Jheng-Wei",
""
],
[
"Hsiao",
"Kai-Wen",
""
],
[
"Yen",
"Ting-Yu",
""
],
[
"Chu",
"Hung-Kuo",
""
]
] | Recently, differentiable volume rendering in neural radiance fields (NeRF) has gained a lot of popularity, and its variants have attained many impressive results. However, existing methods usually assume the scene is a homogeneous volume so that a ray is cast along the straight path. In this work, the scene is instead ... |
1803.09104 | Francesco Alessandro Massucci | Francesco Alessandro Massucci and Domingo Docampo | Measuring the academic reputation through citation networks via PageRank | 20 pages; 7 figures | Journal of Informetrics 13, 1, February 2019, Pages 185-201 | 10.1016/j.joi.2018.12.001 | null | cs.DL cs.SI physics.soc-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The objective assessment of the prestige of an academic institution is a
difficult and hotly debated task. In the last few years, different types of
University Rankings have been proposed to quantify the excellence of different
research institutions in the world. Albeit met with criticism in some cases,
the relevance... | [
{
"created": "Sat, 24 Mar 2018 13:11:20 GMT",
"version": "v1"
},
{
"created": "Fri, 4 Jan 2019 11:50:35 GMT",
"version": "v2"
}
] | 2019-01-07 | [
[
"Massucci",
"Francesco Alessandro",
""
],
[
"Docampo",
"Domingo",
""
]
] | The objective assessment of the prestige of an academic institution is a difficult and hotly debated task. In the last few years, different types of University Rankings have been proposed to quantify the excellence of different research institutions in the world. Albeit met with criticism in some cases, the relevance o... |
2310.18598 | Toan Nguyen | Toan Nguyen, Kien Do, Bao Duong, Thin Nguyen | Domain Generalisation via Risk Distribution Matching | Accepted at 2024 IEEE/CVF Winter Conference on Applications of
Computer Vision (WACV 2024) | null | null | null | cs.LG cs.CV | http://creativecommons.org/licenses/by/4.0/ | We propose a novel approach for domain generalisation (DG) leveraging risk
distributions to characterise domains, thereby achieving domain invariance. In
our findings, risk distributions effectively highlight differences between
training domains and reveal their inherent complexities. In testing, we may
observe simil... | [
{
"created": "Sat, 28 Oct 2023 05:23:55 GMT",
"version": "v1"
}
] | 2023-10-31 | [
[
"Nguyen",
"Toan",
""
],
[
"Do",
"Kien",
""
],
[
"Duong",
"Bao",
""
],
[
"Nguyen",
"Thin",
""
]
] | We propose a novel approach for domain generalisation (DG) leveraging risk distributions to characterise domains, thereby achieving domain invariance. In our findings, risk distributions effectively highlight differences between training domains and reveal their inherent complexities. In testing, we may observe similar... |
1105.1720 | Wajeb Gharibi | Wajeb Gharibi, Abdulrahman Mirza | Software Vulnerabilities, Banking Threats, Botnets and Malware
Self-Protection Technologies | 5 pages | IJCSI International Journal of Computer Science Issues, Vol. 8,
Issue 1, January 2011, 236-241 | null | null | cs.NI cs.CR cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Information security is the protection of information from a wide range of
threats in order to ensure success business continuity by minimizing risks and
maximizing the return of investments and business opportunities. In this paper,
we study and discuss the software vulnerabilities, banking threats, botnets and
prop... | [
{
"created": "Mon, 9 May 2011 16:36:51 GMT",
"version": "v1"
}
] | 2011-05-10 | [
[
"Gharibi",
"Wajeb",
""
],
[
"Mirza",
"Abdulrahman",
""
]
] | Information security is the protection of information from a wide range of threats in order to ensure success business continuity by minimizing risks and maximizing the return of investments and business opportunities. In this paper, we study and discuss the software vulnerabilities, banking threats, botnets and propos... |
2209.08664 | Junheng Li | Junheng Li and Quan Nguyen | Dynamic Walking of Bipedal Robots on Uneven Stepping Stones via
Adaptive-frequency MPC | 6 pages, 7 figures, 1 table | null | null | null | cs.RO cs.SY eess.SY | http://creativecommons.org/licenses/by/4.0/ | This paper presents a novel Adaptive-frequency MPC framework for bipedal
locomotion over terrain with uneven stepping stones. In detail, we intend to
achieve adaptive foot placement and gait period for bipedal periodic walking
gait with this MPC, in order to traverse terrain with discontinuities without
slowing down.... | [
{
"created": "Sun, 18 Sep 2022 22:00:22 GMT",
"version": "v1"
}
] | 2022-09-20 | [
[
"Li",
"Junheng",
""
],
[
"Nguyen",
"Quan",
""
]
] | This paper presents a novel Adaptive-frequency MPC framework for bipedal locomotion over terrain with uneven stepping stones. In detail, we intend to achieve adaptive foot placement and gait period for bipedal periodic walking gait with this MPC, in order to traverse terrain with discontinuities without slowing down. W... |
2404.00626 | Minyoung Oh | Minyoung Oh, Duhyun Kim, and Jae-Young Sim | Domain Generalizable Person Search Using Unreal Dataset | AAAI2024 accepted | null | null | null | cs.CV | http://creativecommons.org/licenses/by-nc-sa/4.0/ | Collecting and labeling real datasets to train the person search networks not
only requires a lot of time and effort, but also accompanies privacy issues.
The weakly-supervised and unsupervised domain adaptation methods have been
proposed to alleviate the labeling burden for target datasets, however, their
generaliza... | [
{
"created": "Sun, 31 Mar 2024 09:32:31 GMT",
"version": "v1"
}
] | 2024-04-02 | [
[
"Oh",
"Minyoung",
""
],
[
"Kim",
"Duhyun",
""
],
[
"Sim",
"Jae-Young",
""
]
] | Collecting and labeling real datasets to train the person search networks not only requires a lot of time and effort, but also accompanies privacy issues. The weakly-supervised and unsupervised domain adaptation methods have been proposed to alleviate the labeling burden for target datasets, however, their generalizati... |
2005.09218 | Jia-Fong Yeh | Jia-Fong Yeh and Hsin-Ying Lee and Bing-Chen Tsai and Yi-Rong Chen and
Ping-Chia Huang and Winston H. Hsu | Large Margin Mechanism and Pseudo Query Set on Cross-Domain Few-Shot
Learning | Full version of the CDFSL competition report (in CVPRW'20), archived | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In recent years, few-shot learning problems have received a lot of attention.
While methods in most previous works were trained and tested on datasets in one
single domain, cross-domain few-shot learning is a brand-new branch of few-shot
learning problems, where models handle datasets in different domains between
tra... | [
{
"created": "Tue, 19 May 2020 05:28:35 GMT",
"version": "v1"
},
{
"created": "Tue, 6 Feb 2024 09:21:28 GMT",
"version": "v2"
}
] | 2024-02-07 | [
[
"Yeh",
"Jia-Fong",
""
],
[
"Lee",
"Hsin-Ying",
""
],
[
"Tsai",
"Bing-Chen",
""
],
[
"Chen",
"Yi-Rong",
""
],
[
"Huang",
"Ping-Chia",
""
],
[
"Hsu",
"Winston H.",
""
]
] | In recent years, few-shot learning problems have received a lot of attention. While methods in most previous works were trained and tested on datasets in one single domain, cross-domain few-shot learning is a brand-new branch of few-shot learning problems, where models handle datasets in different domains between train... |
1806.03498 | Elad Michael Schiller (PhD) | Shlomi Dolev, Thomas Petig and Elad Michael Schiller | Self-Stabilizing and Private Distributed Shared Atomic Memory in
Seldomly Fair Message Passing Networks | null | null | null | null | cs.DC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We study the problem of privately emulating shared memory in message-passing
networks. The system includes clients that store and retrieve replicated
information on N servers, out of which e are malicious. When a client access a
malicious server, the data field of that server response might be different
than the valu... | [
{
"created": "Sat, 9 Jun 2018 16:08:54 GMT",
"version": "v1"
}
] | 2018-06-12 | [
[
"Dolev",
"Shlomi",
""
],
[
"Petig",
"Thomas",
""
],
[
"Schiller",
"Elad Michael",
""
]
] | We study the problem of privately emulating shared memory in message-passing networks. The system includes clients that store and retrieve replicated information on N servers, out of which e are malicious. When a client access a malicious server, the data field of that server response might be different than the value ... |
2012.12373 | Riccardo Pinciroli | Riccardo Pinciroli, Lishan Yang, Jacob Alter, Evgenia Smirni | The Life and Death of SSDs and HDDs: Similarities, Differences, and
Prediction Models | null | null | null | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Data center downtime typically centers around IT equipment failure. Storage
devices are the most frequently failing components in data centers. We present
a comparative study of hard disk drives (HDDs) and solid state drives (SSDs)
that constitute the typical storage in data centers. Using a six-year field
data of 10... | [
{
"created": "Tue, 22 Dec 2020 21:50:32 GMT",
"version": "v1"
}
] | 2020-12-24 | [
[
"Pinciroli",
"Riccardo",
""
],
[
"Yang",
"Lishan",
""
],
[
"Alter",
"Jacob",
""
],
[
"Smirni",
"Evgenia",
""
]
] | Data center downtime typically centers around IT equipment failure. Storage devices are the most frequently failing components in data centers. We present a comparative study of hard disk drives (HDDs) and solid state drives (SSDs) that constitute the typical storage in data centers. Using a six-year field data of 100,... |
1807.09671 | Wencan Luo | Wencan Luo, Fei Liu, Zitao Liu, and Diane Litman | A Novel ILP Framework for Summarizing Content with High Lexical Variety | Accepted for publication in the journal of Natural Language
Engineering, 2018 | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Summarizing content contributed by individuals can be challenging, because
people make different lexical choices even when describing the same events.
However, there remains a significant need to summarize such content. Examples
include the student responses to post-class reflective questions, product
reviews, and ne... | [
{
"created": "Wed, 25 Jul 2018 15:42:01 GMT",
"version": "v1"
}
] | 2018-07-26 | [
[
"Luo",
"Wencan",
""
],
[
"Liu",
"Fei",
""
],
[
"Liu",
"Zitao",
""
],
[
"Litman",
"Diane",
""
]
] | Summarizing content contributed by individuals can be challenging, because people make different lexical choices even when describing the same events. However, there remains a significant need to summarize such content. Examples include the student responses to post-class reflective questions, product reviews, and news... |
2202.11319 | Rui Gao | Rui Gao, Fan Wan, Daniel Organisciak, Jiyao Pu, Junyan Wang, Haoran
Duan, Peng Zhang, Xingsong Hou, Yang Long | Absolute Zero-Shot Learning | null | null | null | null | cs.CV cs.CR cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Considering the increasing concerns about data copyright and privacy issues,
we present a novel Absolute Zero-Shot Learning (AZSL) paradigm, i.e., training
a classifier with zero real data. The key innovation is to involve a teacher
model as the data safeguard to guide the AZSL model training without data
leaking. Th... | [
{
"created": "Wed, 23 Feb 2022 05:33:21 GMT",
"version": "v1"
}
] | 2022-02-24 | [
[
"Gao",
"Rui",
""
],
[
"Wan",
"Fan",
""
],
[
"Organisciak",
"Daniel",
""
],
[
"Pu",
"Jiyao",
""
],
[
"Wang",
"Junyan",
""
],
[
"Duan",
"Haoran",
""
],
[
"Zhang",
"Peng",
""
],
[
"Hou",
"Xingsong"... | Considering the increasing concerns about data copyright and privacy issues, we present a novel Absolute Zero-Shot Learning (AZSL) paradigm, i.e., training a classifier with zero real data. The key innovation is to involve a teacher model as the data safeguard to guide the AZSL model training without data leaking. The ... |
1503.02678 | Kamran Karimi | Kamran Karimi, Diwakar Krishnamurthy, Parissa Mirjafari | When In-Memory Computing is Slower than Heavy Disk Usage | This paper has been withdrawn by the authors for personal reasons. No
further revisions | null | null | null | cs.OH | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Disk access latency and transfer times are often considered to have a major
and detrimental impact on the running time of software. Developers are often
advised to favour in-memory operations and minimise disk access. Furthermore,
diskless computer architectures are being studied and designed to remove this
bottlenec... | [
{
"created": "Tue, 10 Mar 2015 05:29:01 GMT",
"version": "v1"
},
{
"created": "Fri, 27 Mar 2015 18:05:24 GMT",
"version": "v2"
}
] | 2015-03-31 | [
[
"Karimi",
"Kamran",
""
],
[
"Krishnamurthy",
"Diwakar",
""
],
[
"Mirjafari",
"Parissa",
""
]
] | Disk access latency and transfer times are often considered to have a major and detrimental impact on the running time of software. Developers are often advised to favour in-memory operations and minimise disk access. Furthermore, diskless computer architectures are being studied and designed to remove this bottleneck ... |
2302.09212 | Ge Gao | Ge Gao, Song Ju, Markel Sanz Ausin, Min Chi | HOPE: Human-Centric Off-Policy Evaluation for E-Learning and Healthcare | Accepted to AAMAS23 | null | null | null | cs.LG cs.MA | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Reinforcement learning (RL) has been extensively researched for enhancing
human-environment interactions in various human-centric tasks, including
e-learning and healthcare. Since deploying and evaluating policies online are
high-stakes in such tasks, off-policy evaluation (OPE) is crucial for inducing
effective poli... | [
{
"created": "Sat, 18 Feb 2023 02:33:30 GMT",
"version": "v1"
}
] | 2023-02-21 | [
[
"Gao",
"Ge",
""
],
[
"Ju",
"Song",
""
],
[
"Ausin",
"Markel Sanz",
""
],
[
"Chi",
"Min",
""
]
] | Reinforcement learning (RL) has been extensively researched for enhancing human-environment interactions in various human-centric tasks, including e-learning and healthcare. Since deploying and evaluating policies online are high-stakes in such tasks, off-policy evaluation (OPE) is crucial for inducing effective polici... |
2204.09310 | Yawen Wang | Yawen Wang, Junjie Wang, Hongyu Zhang, Xuran Ming, Lin Shi, Qing Wang | Where is Your App Frustrating Users? | null | null | 10.1145/3510003.3510189 | null | cs.SE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | User reviews of mobile apps provide a communication channel for developers to
perceive user satisfaction. Many app features that users have problems with are
usually expressed by key phrases such as "upload pictures", which could be
buried in the review texts. The lack of fine-grained view about problematic
features ... | [
{
"created": "Wed, 20 Apr 2022 08:49:02 GMT",
"version": "v1"
}
] | 2022-04-21 | [
[
"Wang",
"Yawen",
""
],
[
"Wang",
"Junjie",
""
],
[
"Zhang",
"Hongyu",
""
],
[
"Ming",
"Xuran",
""
],
[
"Shi",
"Lin",
""
],
[
"Wang",
"Qing",
""
]
] | User reviews of mobile apps provide a communication channel for developers to perceive user satisfaction. Many app features that users have problems with are usually expressed by key phrases such as "upload pictures", which could be buried in the review texts. The lack of fine-grained view about problematic features co... |
2008.02916 | Bart Iver van Blokland | Bart Iver van Blokland and Theoharis Theoharis | An Indexing Scheme and Descriptor for 3D Object Retrieval Based on Local
Shape Querying | 13 pages, 13 figures, to be published in a Special Issue in Computers
& Graphics | Computers & Graphics Volume 92, November 2020, Pages 55-66 | 10.1016/j.cag.2020.09.001 | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A binary descriptor indexing scheme based on Hamming distance called the
Hamming tree for local shape queries is presented. A new binary clutter
resistant descriptor named Quick Intersection Count Change Image (QUICCI) is
also introduced. This local shape descriptor is extremely small and fast to
compare. Additionall... | [
{
"created": "Fri, 7 Aug 2020 00:46:58 GMT",
"version": "v1"
}
] | 2021-07-09 | [
[
"van Blokland",
"Bart Iver",
""
],
[
"Theoharis",
"Theoharis",
""
]
] | A binary descriptor indexing scheme based on Hamming distance called the Hamming tree for local shape queries is presented. A new binary clutter resistant descriptor named Quick Intersection Count Change Image (QUICCI) is also introduced. This local shape descriptor is extremely small and fast to compare. Additionally,... |
1402.5843 | Gabriele Fici | Julien Cassaigne, Gabriele Fici, Marinella Sciortino, Luca Q. Zamboni | Cyclic Complexity of Words | To appear in Journal of Combinatorial Theory, Series A | null | null | null | cs.FL cs.DM math.CO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We introduce and study a complexity function on words $c_x(n),$ called
\emph{cyclic complexity}, which counts the number of conjugacy classes of
factors of length $n$ of an infinite word $x.$ We extend the well-known
Morse-Hedlund theorem to the setting of cyclic complexity by showing that a
word is ultimately period... | [
{
"created": "Mon, 24 Feb 2014 14:49:22 GMT",
"version": "v1"
},
{
"created": "Mon, 28 Apr 2014 15:37:23 GMT",
"version": "v2"
},
{
"created": "Mon, 23 Jun 2014 13:18:54 GMT",
"version": "v3"
},
{
"created": "Tue, 26 May 2015 13:58:28 GMT",
"version": "v4"
},
{
"c... | 2016-06-29 | [
[
"Cassaigne",
"Julien",
""
],
[
"Fici",
"Gabriele",
""
],
[
"Sciortino",
"Marinella",
""
],
[
"Zamboni",
"Luca Q.",
""
]
] | We introduce and study a complexity function on words $c_x(n),$ called \emph{cyclic complexity}, which counts the number of conjugacy classes of factors of length $n$ of an infinite word $x.$ We extend the well-known Morse-Hedlund theorem to the setting of cyclic complexity by showing that a word is ultimately periodic... |
1304.5168 | Jialu Liu | Jialu Liu | Image Retrieval based on Bag-of-Words model | null | null | null | null | cs.IR cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This article gives a survey for bag-of-words (BoW) or bag-of-features model
in image retrieval system. In recent years, large-scale image retrieval shows
significant potential in both industry applications and research problems. As
local descriptors like SIFT demonstrate great discriminative power in solving
vision p... | [
{
"created": "Thu, 18 Apr 2013 15:57:34 GMT",
"version": "v1"
}
] | 2013-04-19 | [
[
"Liu",
"Jialu",
""
]
] | This article gives a survey for bag-of-words (BoW) or bag-of-features model in image retrieval system. In recent years, large-scale image retrieval shows significant potential in both industry applications and research problems. As local descriptors like SIFT demonstrate great discriminative power in solving vision pro... |
1702.04834 | Michele Wigger | Chien-Yi Wang, Shirin Saeedi Bidokhti, and Michele Wigger | Improved Converses and Gap Results for Coded Caching | null | IEEE Transactions on Information Theory, vol. 64, no. 11, Nov.
2018, pp. 7051-7062 | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Improved lower bounds on the average and the worst-case rate-memory tradeoffs
for the Maddah-Ali&Niesen coded caching scenario are presented. For any number
of users and files and for arbitrary cache sizes, the multiplicative gap
between the exact rate-memory tradeoff and the new lower bound is less than
2.315 in the... | [
{
"created": "Thu, 16 Feb 2017 01:29:52 GMT",
"version": "v1"
},
{
"created": "Tue, 21 Jan 2020 21:39:39 GMT",
"version": "v2"
}
] | 2020-01-23 | [
[
"Wang",
"Chien-Yi",
""
],
[
"Bidokhti",
"Shirin Saeedi",
""
],
[
"Wigger",
"Michele",
""
]
] | Improved lower bounds on the average and the worst-case rate-memory tradeoffs for the Maddah-Ali&Niesen coded caching scenario are presented. For any number of users and files and for arbitrary cache sizes, the multiplicative gap between the exact rate-memory tradeoff and the new lower bound is less than 2.315 in the w... |
1808.00121 | Xiaodong Wu | Xiaodong Wu, Lyn Bartram | Social Robots for People with Developmental Disabilities: A User Study
on Design Features of a Graphical User Interface | Conference Submission | null | null | null | cs.RO cs.HC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Social robots, also known as service or assistant robots, have been developed
to improve the quality of human life in recent years. The design of socially
capable and intelligent robots can vary, depending on the target user groups.
In this work, we assess the effect of social robots' roles, functions, and
communicat... | [
{
"created": "Wed, 1 Aug 2018 00:45:38 GMT",
"version": "v1"
}
] | 2018-08-02 | [
[
"Wu",
"Xiaodong",
""
],
[
"Bartram",
"Lyn",
""
]
] | Social robots, also known as service or assistant robots, have been developed to improve the quality of human life in recent years. The design of socially capable and intelligent robots can vary, depending on the target user groups. In this work, we assess the effect of social robots' roles, functions, and communicatio... |
2101.05972 | Hyunjae Kim | Buru Chang, Inggeol Lee, Hyunjae Kim, Jaewoo Kang | "Killing Me" Is Not a Spoiler: Spoiler Detection Model using Graph
Neural Networks with Dependency Relation-Aware Attention Mechanism | EACL 2021 | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Several machine learning-based spoiler detection models have been proposed
recently to protect users from spoilers on review websites. Although dependency
relations between context words are important for detecting spoilers, current
attention-based spoiler detection models are insufficient for utilizing
dependency re... | [
{
"created": "Fri, 15 Jan 2021 05:34:17 GMT",
"version": "v1"
}
] | 2021-01-18 | [
[
"Chang",
"Buru",
""
],
[
"Lee",
"Inggeol",
""
],
[
"Kim",
"Hyunjae",
""
],
[
"Kang",
"Jaewoo",
""
]
] | Several machine learning-based spoiler detection models have been proposed recently to protect users from spoilers on review websites. Although dependency relations between context words are important for detecting spoilers, current attention-based spoiler detection models are insufficient for utilizing dependency rela... |
2309.08573 | Andrew Bean | Khyati Khandelwal, Manuel Tonneau, Andrew M. Bean, Hannah Rose Kirk,
Scott A. Hale | Indian-BhED: A Dataset for Measuring India-Centric Biases in Large
Language Models | To be published in GoodIT '24, doi:10.1145/3677525.3678666. 14 pages | null | 10.1145/3677525.3678666 | null | cs.CL cs.CY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Large Language Models (LLMs), now used daily by millions, can encode societal
biases, exposing their users to representational harms. A large body of
scholarship on LLM bias exists but it predominantly adopts a Western-centric
frame and attends comparatively less to bias levels and potential harms in the
Global South... | [
{
"created": "Fri, 15 Sep 2023 17:38:41 GMT",
"version": "v1"
},
{
"created": "Fri, 9 Aug 2024 09:36:00 GMT",
"version": "v2"
}
] | 2024-08-12 | [
[
"Khandelwal",
"Khyati",
""
],
[
"Tonneau",
"Manuel",
""
],
[
"Bean",
"Andrew M.",
""
],
[
"Kirk",
"Hannah Rose",
""
],
[
"Hale",
"Scott A.",
""
]
] | Large Language Models (LLMs), now used daily by millions, can encode societal biases, exposing their users to representational harms. A large body of scholarship on LLM bias exists but it predominantly adopts a Western-centric frame and attends comparatively less to bias levels and potential harms in the Global South. ... |
2312.04351 | Chulong Zhong | Chulong Zhong and Xiang Yan and Yuyi Wang and Shuangping Huang and Jin
Zhong | Nash Equilibria of Two-round Auctions | null | null | 10.1145/3627676.3627682 | null | cs.GT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In a two-round auction, a subset of bidders is selected (probabilistically),
according to their bids in the first round, for the second round, where they
can increase their bids. We formalize the two-round auction model, restricting
the second round to a dominant strategy incentive compatible (DSIC) auction for
the s... | [
{
"created": "Thu, 7 Dec 2023 15:17:08 GMT",
"version": "v1"
}
] | 2023-12-08 | [
[
"Zhong",
"Chulong",
""
],
[
"Yan",
"Xiang",
""
],
[
"Wang",
"Yuyi",
""
],
[
"Huang",
"Shuangping",
""
],
[
"Zhong",
"Jin",
""
]
] | In a two-round auction, a subset of bidders is selected (probabilistically), according to their bids in the first round, for the second round, where they can increase their bids. We formalize the two-round auction model, restricting the second round to a dominant strategy incentive compatible (DSIC) auction for the sel... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.