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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1702.08360 | Emilio Parisotto | Emilio Parisotto and Ruslan Salakhutdinov | Neural Map: Structured Memory for Deep Reinforcement Learning | null | null | null | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A critical component to enabling intelligent reasoning in partially
observable environments is memory. Despite this importance, Deep Reinforcement
Learning (DRL) agents have so far used relatively simple memory architectures,
with the main methods to overcome partial observability being either a temporal
convolution ... | [
{
"created": "Mon, 27 Feb 2017 16:32:27 GMT",
"version": "v1"
}
] | 2017-02-28 | [
[
"Parisotto",
"Emilio",
""
],
[
"Salakhutdinov",
"Ruslan",
""
]
] | A critical component to enabling intelligent reasoning in partially observable environments is memory. Despite this importance, Deep Reinforcement Learning (DRL) agents have so far used relatively simple memory architectures, with the main methods to overcome partial observability being either a temporal convolution ov... |
1906.07492 | Simon Obute O | Simon O. Obute, Mehmet R. Dogar and Jordan H. Boyle | Chemotaxis Based Virtual Fence for Swarm Robots in Unbounded
Environments | Paper accepted for living machines 2019 conference | null | null | null | cs.RO cs.MA | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper presents a novel swarm robotics application of chemotaxis
behaviour observed in microorganisms. This approach was used to cause
exploration robots to return to a work area around the swarm's nest within a
boundless environment. We investigate the performance of our algorithm through
extensive simulation st... | [
{
"created": "Tue, 18 Jun 2019 10:57:38 GMT",
"version": "v1"
}
] | 2019-06-19 | [
[
"Obute",
"Simon O.",
""
],
[
"Dogar",
"Mehmet R.",
""
],
[
"Boyle",
"Jordan H.",
""
]
] | This paper presents a novel swarm robotics application of chemotaxis behaviour observed in microorganisms. This approach was used to cause exploration robots to return to a work area around the swarm's nest within a boundless environment. We investigate the performance of our algorithm through extensive simulation stud... |
1807.02299 | Weinan Zhang | Shihao Zou, Guanyu Tao, Jun Wang, Weinan Zhang, Dell Zhang | On the Equilibrium of Query Reformulation and Document Retrieval | Accepted in ICTIR 2018 | null | null | null | cs.IR cs.GT | http://creativecommons.org/licenses/by/4.0/ | In this paper, we study jointly query reformulation and document relevance
estimation, the two essential aspects of information retrieval (IR). Their
interactions are modelled as a two-player strategic game: one player, a query
formulator, taking actions to produce the optimal query, is expected to
maximize its own u... | [
{
"created": "Fri, 6 Jul 2018 08:06:22 GMT",
"version": "v1"
},
{
"created": "Fri, 20 Jul 2018 11:17:04 GMT",
"version": "v2"
}
] | 2018-07-23 | [
[
"Zou",
"Shihao",
""
],
[
"Tao",
"Guanyu",
""
],
[
"Wang",
"Jun",
""
],
[
"Zhang",
"Weinan",
""
],
[
"Zhang",
"Dell",
""
]
] | In this paper, we study jointly query reformulation and document relevance estimation, the two essential aspects of information retrieval (IR). Their interactions are modelled as a two-player strategic game: one player, a query formulator, taking actions to produce the optimal query, is expected to maximize its own uti... |
1107.1076 | Antoine Thomas | Antoine Thomas, A\"ida Ouangraoua, Jean-St\'ephane Varr\'e | Genome Halving by Block Interchange | null | null | null | null | cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We address the problem of finding the minimal number of block interchanges
(exchange of two intervals) required to transform a duplicated linear genome
into a tandem duplicated linear genome. We provide a formula for the distance
as well as a polynomial time algorithm for the sorting problem.
| [
{
"created": "Wed, 6 Jul 2011 09:47:25 GMT",
"version": "v1"
}
] | 2011-07-07 | [
[
"Thomas",
"Antoine",
""
],
[
"Ouangraoua",
"Aïda",
""
],
[
"Varré",
"Jean-Stéphane",
""
]
] | We address the problem of finding the minimal number of block interchanges (exchange of two intervals) required to transform a duplicated linear genome into a tandem duplicated linear genome. We provide a formula for the distance as well as a polynomial time algorithm for the sorting problem. |
1309.0873 | EPTCS | Qin Shu (Department of Aerospace and Mechanical Engineering,
University of Arizona, USA), Diana Catalina Ardila (Department of Aerospace
and Mechanical Engineering, University of Arizona, USA), Ricardo G. Sanfelice
(Department of Aerospace and Mechanical Engineering, University of Arizona,
USA), Jonathan P. Van... | A Hybrid Model of a Genetic Regulatory Network in Mammalian Sclera | In Proceedings HSB 2013, arXiv:1308.5724 | EPTCS 125, 2013, pp. 99-105 | 10.4204/EPTCS.125.8 | null | cs.SY q-bio.MN | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Myopia in human and animals is caused by the axial elongation of the eye and
is closely linked to the thinning of the sclera which supports the eye tissue.
This thinning has been correlated with the overproduction of matrix
metalloproteinase (MMP-2), an enzyme that degrades the collagen structure of
the sclera. In th... | [
{
"created": "Tue, 3 Sep 2013 23:41:56 GMT",
"version": "v1"
}
] | 2013-09-05 | [
[
"Shu",
"Qin",
"",
"Department of Aerospace and Mechanical Engineering,\n University of Arizona, USA"
],
[
"Ardila",
"Diana Catalina",
"",
"Department of Aerospace\n and Mechanical Engineering, University of Arizona, USA"
],
[
"Sanfelice",
"Ricardo G.",
"",
... | Myopia in human and animals is caused by the axial elongation of the eye and is closely linked to the thinning of the sclera which supports the eye tissue. This thinning has been correlated with the overproduction of matrix metalloproteinase (MMP-2), an enzyme that degrades the collagen structure of the sclera. In this... |
1511.03483 | Jun He | Jun He | An Analytic Expression of Relative Approximation Error for a Class of
Evolutionary Algorithms | null | null | 10.1109/CEC.2016.7744345 | null | cs.NE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | An important question in evolutionary computation is how good solutions
evolutionary algorithms can produce. This paper aims to provide an analytic
analysis of solution quality in terms of the relative approximation error,
which is defined by the error between 1 and the approximation ratio of the
solution found by an... | [
{
"created": "Wed, 11 Nov 2015 13:02:36 GMT",
"version": "v1"
},
{
"created": "Tue, 16 Feb 2016 16:02:39 GMT",
"version": "v2"
},
{
"created": "Thu, 24 Nov 2016 12:10:25 GMT",
"version": "v3"
}
] | 2016-11-28 | [
[
"He",
"Jun",
""
]
] | An important question in evolutionary computation is how good solutions evolutionary algorithms can produce. This paper aims to provide an analytic analysis of solution quality in terms of the relative approximation error, which is defined by the error between 1 and the approximation ratio of the solution found by an e... |
2405.19769 | Zhiwen Yang | Zhiwen Yang, Haowei Chen, Ziniu Qian, Yang Yi, Hui Zhang, Dan Zhao,
Bingzheng Wei, Yan Xu | All-In-One Medical Image Restoration via Task-Adaptive Routing | This article has been early accepted by MICCAI 2024 | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Although single-task medical image restoration (MedIR) has witnessed
remarkable success, the limited generalizability of these methods poses a
substantial obstacle to wider application. In this paper, we focus on the task
of all-in-one medical image restoration, aiming to address multiple distinct
MedIR tasks with a ... | [
{
"created": "Thu, 30 May 2024 07:34:05 GMT",
"version": "v1"
},
{
"created": "Fri, 28 Jun 2024 05:25:19 GMT",
"version": "v2"
}
] | 2024-07-01 | [
[
"Yang",
"Zhiwen",
""
],
[
"Chen",
"Haowei",
""
],
[
"Qian",
"Ziniu",
""
],
[
"Yi",
"Yang",
""
],
[
"Zhang",
"Hui",
""
],
[
"Zhao",
"Dan",
""
],
[
"Wei",
"Bingzheng",
""
],
[
"Xu",
"Yan",
""
... | Although single-task medical image restoration (MedIR) has witnessed remarkable success, the limited generalizability of these methods poses a substantial obstacle to wider application. In this paper, we focus on the task of all-in-one medical image restoration, aiming to address multiple distinct MedIR tasks with a si... |
2402.02442 | Qingsong Wang | Qingsong Wang, Chunfeng Cui, Deren Han | A Momentum Accelerated Algorithm for ReLU-based Nonlinear Matrix
Decomposition | 5 pages, 7 figures | null | null | null | cs.LG eess.IV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Recently, there has been a growing interest in the exploration of Nonlinear
Matrix Decomposition (NMD) due to its close ties with neural networks. NMD aims
to find a low-rank matrix from a sparse nonnegative matrix with a per-element
nonlinear function. A typical choice is the Rectified Linear Unit (ReLU)
activation ... | [
{
"created": "Sun, 4 Feb 2024 10:43:35 GMT",
"version": "v1"
}
] | 2024-02-06 | [
[
"Wang",
"Qingsong",
""
],
[
"Cui",
"Chunfeng",
""
],
[
"Han",
"Deren",
""
]
] | Recently, there has been a growing interest in the exploration of Nonlinear Matrix Decomposition (NMD) due to its close ties with neural networks. NMD aims to find a low-rank matrix from a sparse nonnegative matrix with a per-element nonlinear function. A typical choice is the Rectified Linear Unit (ReLU) activation fu... |
2310.04172 | Alexander Mock | Marc Eisoldt, Alexander Mock, Mario Porrmann, Thomas Wiemann | Towards 6D MCL for LiDARs in 3D TSDF Maps on Embedded Systems with GPUs | null | null | null | null | cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Monte Carlo Localization is a widely used approach in the field of mobile
robotics. While this problem has been well studied in the 2D case, global
localization in 3D maps with six degrees of freedom has so far been too
computationally demanding. Hence, no mobile robot system has yet been presented
in literature that... | [
{
"created": "Fri, 6 Oct 2023 11:42:07 GMT",
"version": "v1"
}
] | 2023-10-09 | [
[
"Eisoldt",
"Marc",
""
],
[
"Mock",
"Alexander",
""
],
[
"Porrmann",
"Mario",
""
],
[
"Wiemann",
"Thomas",
""
]
] | Monte Carlo Localization is a widely used approach in the field of mobile robotics. While this problem has been well studied in the 2D case, global localization in 3D maps with six degrees of freedom has so far been too computationally demanding. Hence, no mobile robot system has yet been presented in literature that i... |
2309.05030 | Kush Varshney | Kush R. Varshney | Decolonial AI Alignment: Openness, Vi\'{s}e\d{s}a-Dharma, and Including
Excluded Knowledges | null | null | null | null | cs.CY cs.AI stat.ML | http://creativecommons.org/licenses/by/4.0/ | Prior work has explicated the coloniality of artificial intelligence (AI)
development and deployment through mechanisms such as extractivism, automation,
sociological essentialism, surveillance, and containment. However, that work
has not engaged much with alignment: teaching behaviors to a large language
model (LLM)... | [
{
"created": "Sun, 10 Sep 2023 14:04:21 GMT",
"version": "v1"
},
{
"created": "Mon, 22 Jan 2024 18:22:37 GMT",
"version": "v2"
},
{
"created": "Thu, 2 May 2024 21:19:21 GMT",
"version": "v3"
}
] | 2024-05-06 | [
[
"Varshney",
"Kush R.",
""
]
] | Prior work has explicated the coloniality of artificial intelligence (AI) development and deployment through mechanisms such as extractivism, automation, sociological essentialism, surveillance, and containment. However, that work has not engaged much with alignment: teaching behaviors to a large language model (LLM) i... |
2211.15225 | Klemen Grm | Klemen Grm, Berk Kemal \"Ozata, Vitomir \v{S}truc, Haz{\i}m Kemal
Ekenel | Meet-in-the-middle: Multi-scale upsampling and matching for
cross-resolution face recognition | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we aim to address the large domain gap between high-resolution
face images, e.g., from professional portrait photography, and low-quality
surveillance images, e.g., from security cameras. Establishing an identity
match between disparate sources like this is a classical surveillance face
identification ... | [
{
"created": "Mon, 28 Nov 2022 11:23:32 GMT",
"version": "v1"
},
{
"created": "Tue, 29 Nov 2022 09:28:14 GMT",
"version": "v2"
}
] | 2022-11-30 | [
[
"Grm",
"Klemen",
""
],
[
"Özata",
"Berk Kemal",
""
],
[
"Štruc",
"Vitomir",
""
],
[
"Ekenel",
"Hazım Kemal",
""
]
] | In this paper, we aim to address the large domain gap between high-resolution face images, e.g., from professional portrait photography, and low-quality surveillance images, e.g., from security cameras. Establishing an identity match between disparate sources like this is a classical surveillance face identification sc... |
2311.14255 | Zeyang Zhang | Zeyang Zhang, Xin Wang, Ziwei Zhang, Haoyang Li, Wenwu Zhu | Out-of-Distribution Generalized Dynamic Graph Neural Network with
Disentangled Intervention and Invariance Promotion | null | null | null | null | cs.LG | http://creativecommons.org/licenses/by-nc-nd/4.0/ | Dynamic graph neural networks (DyGNNs) have demonstrated powerful predictive
abilities by exploiting graph structural and temporal dynamics. However, the
existing DyGNNs fail to handle distribution shifts, which naturally exist in
dynamic graphs, mainly because the patterns exploited by DyGNNs may be variant
with res... | [
{
"created": "Fri, 24 Nov 2023 02:42:42 GMT",
"version": "v1"
},
{
"created": "Fri, 8 Mar 2024 06:25:50 GMT",
"version": "v2"
}
] | 2024-03-11 | [
[
"Zhang",
"Zeyang",
""
],
[
"Wang",
"Xin",
""
],
[
"Zhang",
"Ziwei",
""
],
[
"Li",
"Haoyang",
""
],
[
"Zhu",
"Wenwu",
""
]
] | Dynamic graph neural networks (DyGNNs) have demonstrated powerful predictive abilities by exploiting graph structural and temporal dynamics. However, the existing DyGNNs fail to handle distribution shifts, which naturally exist in dynamic graphs, mainly because the patterns exploited by DyGNNs may be variant with respe... |
2304.12895 | Karolis Martinkus | Mihai Babiac, Karolis Martinkus and Roger Wattenhofer | Discovering Graph Generation Algorithms | null | null | null | null | cs.LG cs.NE | http://creativecommons.org/licenses/by/4.0/ | We provide a novel approach to construct generative models for graphs.
Instead of using the traditional probabilistic models or deep generative
models, we propose to instead find an algorithm that generates the data. We
achieve this using evolutionary search and a powerful fitness function,
implemented by a randomly ... | [
{
"created": "Tue, 25 Apr 2023 15:06:22 GMT",
"version": "v1"
}
] | 2023-04-26 | [
[
"Babiac",
"Mihai",
""
],
[
"Martinkus",
"Karolis",
""
],
[
"Wattenhofer",
"Roger",
""
]
] | We provide a novel approach to construct generative models for graphs. Instead of using the traditional probabilistic models or deep generative models, we propose to instead find an algorithm that generates the data. We achieve this using evolutionary search and a powerful fitness function, implemented by a randomly in... |
2002.04077 | Joshua Lawrence Benjamin | Joshua L. Benjamin, Thomas Gerard, Domani\c{c} Lavery, Polina Bayvel
and Georgios Zervas | PULSE: Optical circuit switched Data Center architecture operating at
nanosecond timescales | 16 pages, 12 figures | null | 10.1109/JLT.2020.2997664 | null | cs.NI cs.DC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We introduce PULSE, a sub-microsecond optical circuit-switched data centre
network architecture controlled by distributed hardware schedulers. PULSE is a
flat architecture that uses parallel passive coupler-based broadcast and select
networks. We employ a novel transceiver architecture, for dynamic
wavelength-timeslo... | [
{
"created": "Mon, 10 Feb 2020 20:34:20 GMT",
"version": "v1"
},
{
"created": "Mon, 25 May 2020 09:32:08 GMT",
"version": "v2"
}
] | 2023-07-19 | [
[
"Benjamin",
"Joshua L.",
""
],
[
"Gerard",
"Thomas",
""
],
[
"Lavery",
"Domaniç",
""
],
[
"Bayvel",
"Polina",
""
],
[
"Zervas",
"Georgios",
""
]
] | We introduce PULSE, a sub-microsecond optical circuit-switched data centre network architecture controlled by distributed hardware schedulers. PULSE is a flat architecture that uses parallel passive coupler-based broadcast and select networks. We employ a novel transceiver architecture, for dynamic wavelength-timeslot ... |
1811.11259 | Francesco Fraternali | Francesco Fraternali, Bharathan Balaji, Rajesh Gupta | Scaling Configuration of Energy Harvesting Sensors with Reinforcement
Learning | 7 pages, 5 figures | ENSsys '18: International Workshop on Energy Harvesting &
Energy-Neutral Sensing Systems}{November 4, 2018}{Shenzhen, China | 10.1145/3279755.3279760 | null | cs.LG cs.AI cs.DS cs.SY stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | With the advent of the Internet of Things (IoT), an increasing number of
energy harvesting methods are being used to supplement or supplant battery
based sensors. Energy harvesting sensors need to be configured according to the
application, hardware, and environmental conditions to maximize their
usefulness. As of to... | [
{
"created": "Tue, 27 Nov 2018 21:05:43 GMT",
"version": "v1"
}
] | 2018-11-29 | [
[
"Fraternali",
"Francesco",
""
],
[
"Balaji",
"Bharathan",
""
],
[
"Gupta",
"Rajesh",
""
]
] | With the advent of the Internet of Things (IoT), an increasing number of energy harvesting methods are being used to supplement or supplant battery based sensors. Energy harvesting sensors need to be configured according to the application, hardware, and environmental conditions to maximize their usefulness. As of toda... |
2203.06970 | Pierre-Jean Spaenlehauer | Antoine Leudi\`ere, Pierre-Jean Spaenlehauer | Computing a Group Action from the Class Field Theory of Imaginary
Hyperelliptic Function Fields | This paper is a rewrite of arXiv:2203.06970v2. It takes into account
the recent attack of Wesolowski on the cryptographic applications
(https://eprint.iacr.org/2022/438). We removed cryptographic applications,
and the introduction and experimental results have been widely rewritten.
Complexity results have been... | null | null | null | cs.SC cs.CR math.NT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We explore algorithmic aspects of a simply transitive commutative group
action coming from the class field theory of imaginary hyperelliptic function
fields. Namely, the Jacobian of an imaginary hyperelliptic curve defined over
$\mathbb F_q$ acts on a subset of isomorphism classes of Drinfeld modules. We
describe an ... | [
{
"created": "Mon, 14 Mar 2022 10:11:35 GMT",
"version": "v1"
},
{
"created": "Thu, 7 Apr 2022 11:37:53 GMT",
"version": "v2"
},
{
"created": "Tue, 5 Jul 2022 13:01:31 GMT",
"version": "v3"
},
{
"created": "Wed, 10 May 2023 20:47:08 GMT",
"version": "v4"
},
{
"cre... | 2024-03-13 | [
[
"Leudière",
"Antoine",
""
],
[
"Spaenlehauer",
"Pierre-Jean",
""
]
] | We explore algorithmic aspects of a simply transitive commutative group action coming from the class field theory of imaginary hyperelliptic function fields. Namely, the Jacobian of an imaginary hyperelliptic curve defined over $\mathbb F_q$ acts on a subset of isomorphism classes of Drinfeld modules. We describe an al... |
2403.17603 | Yongqiang Han | Yongqiang Han, Hao Wang, Kefan Wang, Likang Wu, Zhi Li, Wei Guo, Yong
Liu, Defu Lian, Enhong Chen | END4Rec: Efficient Noise-Decoupling for Multi-Behavior Sequential
Recommendation | null | null | null | null | cs.IR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In recommendation systems, users frequently engage in multiple types of
behaviors, such as clicking, adding to a cart, and purchasing. However, with
diversified behavior data, user behavior sequences will become very long in the
short term, which brings challenges to the efficiency of the sequence
recommendation mode... | [
{
"created": "Tue, 26 Mar 2024 11:28:31 GMT",
"version": "v1"
}
] | 2024-03-27 | [
[
"Han",
"Yongqiang",
""
],
[
"Wang",
"Hao",
""
],
[
"Wang",
"Kefan",
""
],
[
"Wu",
"Likang",
""
],
[
"Li",
"Zhi",
""
],
[
"Guo",
"Wei",
""
],
[
"Liu",
"Yong",
""
],
[
"Lian",
"Defu",
""
],
... | In recommendation systems, users frequently engage in multiple types of behaviors, such as clicking, adding to a cart, and purchasing. However, with diversified behavior data, user behavior sequences will become very long in the short term, which brings challenges to the efficiency of the sequence recommendation model.... |
2401.12683 | Iqbal Madakkatel | Iqbal Madakkatel and Elina Hypp\"onen | LLpowershap: Logistic Loss-based Automated Shapley Values Feature
Selection Method | null | null | null | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Shapley values have been used extensively in machine learning, not only to
explain black box machine learning models, but among other tasks, also to
conduct model debugging, sensitivity and fairness analyses and to select
important features for robust modelling and for further follow-up analyses.
Shapley values satis... | [
{
"created": "Tue, 23 Jan 2024 11:46:52 GMT",
"version": "v1"
}
] | 2024-01-24 | [
[
"Madakkatel",
"Iqbal",
""
],
[
"Hyppönen",
"Elina",
""
]
] | Shapley values have been used extensively in machine learning, not only to explain black box machine learning models, but among other tasks, also to conduct model debugging, sensitivity and fairness analyses and to select important features for robust modelling and for further follow-up analyses. Shapley values satisfy... |
1905.08618 | Longwei Wang | Longwei Wang, Peijie Chen | Neurons Activation Visualization and Information Theoretic Analysis | the paper is not so well written and need to be revised | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Understanding the inner working mechanism of deep neural networks (DNNs) is
essential and important for researchers to design and improve the performance
of DNNs. In this work, the entropy analysis is leveraged to study the neurons
activation behavior of the fully connected layers of DNNs. The entropy of the
activati... | [
{
"created": "Tue, 14 May 2019 15:33:15 GMT",
"version": "v1"
},
{
"created": "Sat, 2 Nov 2019 14:52:59 GMT",
"version": "v2"
},
{
"created": "Tue, 5 Nov 2019 16:01:46 GMT",
"version": "v3"
}
] | 2019-11-06 | [
[
"Wang",
"Longwei",
""
],
[
"Chen",
"Peijie",
""
]
] | Understanding the inner working mechanism of deep neural networks (DNNs) is essential and important for researchers to design and improve the performance of DNNs. In this work, the entropy analysis is leveraged to study the neurons activation behavior of the fully connected layers of DNNs. The entropy of the activation... |
2107.08982 | Xing Wei | Dahu Shi, Xing Wei, Xiaodong Yu, Wenming Tan, Ye Ren, Shiliang Pu | InsPose: Instance-Aware Networks for Single-Stage Multi-Person Pose
Estimation | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Multi-person pose estimation is an attractive and challenging task. Existing
methods are mostly based on two-stage frameworks, which include top-down and
bottom-up methods. Two-stage methods either suffer from high computational
redundancy for additional person detectors or they need to group keypoints
heuristically ... | [
{
"created": "Mon, 19 Jul 2021 15:56:09 GMT",
"version": "v1"
},
{
"created": "Tue, 20 Jul 2021 01:34:59 GMT",
"version": "v2"
},
{
"created": "Fri, 22 Apr 2022 07:20:30 GMT",
"version": "v3"
}
] | 2022-04-25 | [
[
"Shi",
"Dahu",
""
],
[
"Wei",
"Xing",
""
],
[
"Yu",
"Xiaodong",
""
],
[
"Tan",
"Wenming",
""
],
[
"Ren",
"Ye",
""
],
[
"Pu",
"Shiliang",
""
]
] | Multi-person pose estimation is an attractive and challenging task. Existing methods are mostly based on two-stage frameworks, which include top-down and bottom-up methods. Two-stage methods either suffer from high computational redundancy for additional person detectors or they need to group keypoints heuristically af... |
1908.03692 | Guanghao Yin | Guanghao Yin, Shouqian Sun, Hui Zhang, Dian Yu, Chao Li, Kejun Zhang,
Ning Zou | User independent Emotion Recognition with Residual Signal-Image Network | null | ICIP2019 | 10.1109/ICIP.2019.8803627 | null | cs.CV cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | User independent emotion recognition with large scale physiological signals
is a tough problem. There exist many advanced methods but they are conducted
under relatively small datasets with dozens of subjects. Here, we propose
Res-SIN, a novel end-to-end framework using Electrodermal Activity(EDA) signal
images to cl... | [
{
"created": "Sat, 10 Aug 2019 05:18:21 GMT",
"version": "v1"
},
{
"created": "Mon, 3 Aug 2020 01:28:18 GMT",
"version": "v2"
}
] | 2020-08-04 | [
[
"Yin",
"Guanghao",
""
],
[
"Sun",
"Shouqian",
""
],
[
"Zhang",
"Hui",
""
],
[
"Yu",
"Dian",
""
],
[
"Li",
"Chao",
""
],
[
"Zhang",
"Kejun",
""
],
[
"Zou",
"Ning",
""
]
] | User independent emotion recognition with large scale physiological signals is a tough problem. There exist many advanced methods but they are conducted under relatively small datasets with dozens of subjects. Here, we propose Res-SIN, a novel end-to-end framework using Electrodermal Activity(EDA) signal images to clas... |
2305.19087 | Michael Scholkemper | Michael Scholkemper and Michael T. Schaub | An Optimization-based Approach To Node Role Discovery in Networks:
Approximating Equitable Partitions | null | null | null | null | cs.SI | http://creativecommons.org/licenses/by/4.0/ | Similar to community detection, partitioning the nodes of a network according
to their structural roles aims to identify fundamental building blocks of a
network. The found partitions can be used, e.g., to simplify descriptions of
the network connectivity, to derive reduced order models for dynamical
processes unfold... | [
{
"created": "Tue, 30 May 2023 14:49:43 GMT",
"version": "v1"
}
] | 2023-05-31 | [
[
"Scholkemper",
"Michael",
""
],
[
"Schaub",
"Michael T.",
""
]
] | Similar to community detection, partitioning the nodes of a network according to their structural roles aims to identify fundamental building blocks of a network. The found partitions can be used, e.g., to simplify descriptions of the network connectivity, to derive reduced order models for dynamical processes unfoldin... |
cs/0703023 | Otfried Cheong | Otfried Cheong, Herman Haverkort, Mira Lee | Computing a Minimum-Dilation Spanning Tree is NP-hard | null | null | null | null | cs.CG | null | In a geometric network G = (S, E), the graph distance between two vertices u,
v in S is the length of the shortest path in G connecting u to v. The dilation
of G is the maximum factor by which the graph distance of a pair of vertices
differs from their Euclidean distance. We show that given a set S of n points
with i... | [
{
"created": "Tue, 6 Mar 2007 01:53:36 GMT",
"version": "v1"
}
] | 2007-05-23 | [
[
"Cheong",
"Otfried",
""
],
[
"Haverkort",
"Herman",
""
],
[
"Lee",
"Mira",
""
]
] | In a geometric network G = (S, E), the graph distance between two vertices u, v in S is the length of the shortest path in G connecting u to v. The dilation of G is the maximum factor by which the graph distance of a pair of vertices differs from their Euclidean distance. We show that given a set S of n points with int... |
cs/0605139 | Na Li | Na Li and Wen-Feng Qi | Construction and Count of Boolean Functions of an Odd Number of
Variables with Maximum Algebraic Immunity | This paper has been submitted on March 9, 2006 | null | null | null | cs.CR | null | Algebraic immunity has been proposed as an important property of Boolean
functions. To resist algebraic attack, a Boolean function should possess high
algebraic immunity. It is well known now that the algebraic immunity of an
$n$-variable Boolean function is upper bounded by $\left\lceil {\frac{n}{2}}
\right\rceil $.... | [
{
"created": "Tue, 30 May 2006 16:54:22 GMT",
"version": "v1"
}
] | 2007-05-23 | [
[
"Li",
"Na",
""
],
[
"Qi",
"Wen-Feng",
""
]
] | Algebraic immunity has been proposed as an important property of Boolean functions. To resist algebraic attack, a Boolean function should possess high algebraic immunity. It is well known now that the algebraic immunity of an $n$-variable Boolean function is upper bounded by $\left\lceil {\frac{n}{2}} \right\rceil $. I... |
1608.01172 | Jo\~ao Strapasson E. | Jo\~ao Eloir Strapasson | A note on sub-orthogonal lattices | 14 pages, no figures | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | It is shown that, given any $k$-dimensional lattice $\Lambda$, there is a
lattice sequence $\Lambda_w$, $w\in \mathbb Z$, with sub-orthogonal lattice
$\Lambda_o \subset \Lambda$, converging to $\Lambda$ (unless equivalence), also
we discuss the conditions for faster convergence.
| [
{
"created": "Wed, 3 Aug 2016 12:53:48 GMT",
"version": "v1"
},
{
"created": "Tue, 8 Aug 2017 18:13:18 GMT",
"version": "v2"
}
] | 2017-08-10 | [
[
"Strapasson",
"João Eloir",
""
]
] | It is shown that, given any $k$-dimensional lattice $\Lambda$, there is a lattice sequence $\Lambda_w$, $w\in \mathbb Z$, with sub-orthogonal lattice $\Lambda_o \subset \Lambda$, converging to $\Lambda$ (unless equivalence), also we discuss the conditions for faster convergence. |
1905.11169 | Miguel Jaques | Miguel Jaques, Michael Burke, Timothy Hospedales | Physics-as-Inverse-Graphics: Unsupervised Physical Parameter Estimation
from Video | 11 pages | null | null | null | cs.CV cs.AI cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We propose a model that is able to perform unsupervised physical parameter
estimation of systems from video, where the differential equations governing
the scene dynamics are known, but labeled states or objects are not available.
Existing physical scene understanding methods require either object state
supervision, ... | [
{
"created": "Mon, 27 May 2019 12:37:14 GMT",
"version": "v1"
},
{
"created": "Tue, 21 Apr 2020 12:14:26 GMT",
"version": "v2"
}
] | 2020-04-22 | [
[
"Jaques",
"Miguel",
""
],
[
"Burke",
"Michael",
""
],
[
"Hospedales",
"Timothy",
""
]
] | We propose a model that is able to perform unsupervised physical parameter estimation of systems from video, where the differential equations governing the scene dynamics are known, but labeled states or objects are not available. Existing physical scene understanding methods require either object state supervision, or... |
2403.14390 | Qingwen Lin | Qingwen Lin, Boyan Xu, Zhengting Huang, Ruichu Cai | From Large to Tiny: Distilling and Refining Mathematical Expertise for
Math Word Problems with Weakly Supervision | null | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Addressing the challenge of high annotation costs in solving Math Word
Problems (MWPs) through full supervision with intermediate equations, recent
works have proposed weakly supervised task settings that rely solely on the
final answer as a supervised signal. Existing leading approaches typically
employ various sear... | [
{
"created": "Thu, 21 Mar 2024 13:29:54 GMT",
"version": "v1"
}
] | 2024-05-13 | [
[
"Lin",
"Qingwen",
""
],
[
"Xu",
"Boyan",
""
],
[
"Huang",
"Zhengting",
""
],
[
"Cai",
"Ruichu",
""
]
] | Addressing the challenge of high annotation costs in solving Math Word Problems (MWPs) through full supervision with intermediate equations, recent works have proposed weakly supervised task settings that rely solely on the final answer as a supervised signal. Existing leading approaches typically employ various search... |
1610.03346 | J\"urgen Koslowski | Nicolai Kraus, Mart\'in Escard\'o, Thierry Coquand, Thorsten
Altenkirch | Notions of Anonymous Existence in Martin-L\"of Type Theory | 36 pages, to appear in the special issue of TLCA'13 (LMCS) | Logical Methods in Computer Science, Volume 13, Issue 1 (March 24,
2017) lmcs:3217 | 10.23638/LMCS-13(1:15)2017 | null | cs.LO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | As the groupoid model of Hofmann and Streicher proves, identity proofs in
intensional Martin-L\"of type theory cannot generally be shown to be unique.
Inspired by a theorem by Hedberg, we give some simple characterizations of
types that do have unique identity proofs. A key ingredient in these
constructions are weakl... | [
{
"created": "Tue, 11 Oct 2016 14:06:24 GMT",
"version": "v1"
},
{
"created": "Thu, 23 Mar 2017 12:48:22 GMT",
"version": "v2"
}
] | 2019-03-14 | [
[
"Kraus",
"Nicolai",
""
],
[
"Escardó",
"Martín",
""
],
[
"Coquand",
"Thierry",
""
],
[
"Altenkirch",
"Thorsten",
""
]
] | As the groupoid model of Hofmann and Streicher proves, identity proofs in intensional Martin-L\"of type theory cannot generally be shown to be unique. Inspired by a theorem by Hedberg, we give some simple characterizations of types that do have unique identity proofs. A key ingredient in these constructions are weakly ... |
2112.04492 | Matteo Fasiolo | Yvenn Amara-Ouali and Matteo Fasiolo and Yannig Goude and Hui Yan | Daily peak electrical load forecasting with a multi-resolution approach | null | null | null | null | cs.LG stat.ME | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In the context of smart grids and load balancing, daily peak load forecasting
has become a critical activity for stakeholders of the energy industry. An
understanding of peak magnitude and timing is paramount for the implementation
of smart grid strategies such as peak shaving. The modelling approach proposed
in this... | [
{
"created": "Wed, 8 Dec 2021 13:14:38 GMT",
"version": "v1"
}
] | 2021-12-10 | [
[
"Amara-Ouali",
"Yvenn",
""
],
[
"Fasiolo",
"Matteo",
""
],
[
"Goude",
"Yannig",
""
],
[
"Yan",
"Hui",
""
]
] | In the context of smart grids and load balancing, daily peak load forecasting has become a critical activity for stakeholders of the energy industry. An understanding of peak magnitude and timing is paramount for the implementation of smart grid strategies such as peak shaving. The modelling approach proposed in this p... |
2102.05150 | Yizhou Wang | Yizhou Wang, Zhongyu Jiang, Yudong Li, Jenq-Neng Hwang, Guanbin Xing,
Hui Liu | RODNet: A Real-Time Radar Object Detection Network Cross-Supervised by
Camera-Radar Fused Object 3D Localization | IEEE Journal of Selected Topics in Signal Processing Special Issue on
Recent Advances in Automotive Radar Signal Processing. arXiv admin note: text
overlap with arXiv:2003.01816 | null | 10.1109/JSTSP.2021.3058895 | null | cs.CV eess.SP | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Various autonomous or assisted driving strategies have been facilitated
through the accurate and reliable perception of the environment around a
vehicle. Among the commonly used sensors, radar has usually been considered as
a robust and cost-effective solution even in adverse driving scenarios, e.g.,
weak/strong ligh... | [
{
"created": "Tue, 9 Feb 2021 22:01:55 GMT",
"version": "v1"
}
] | 2021-07-07 | [
[
"Wang",
"Yizhou",
""
],
[
"Jiang",
"Zhongyu",
""
],
[
"Li",
"Yudong",
""
],
[
"Hwang",
"Jenq-Neng",
""
],
[
"Xing",
"Guanbin",
""
],
[
"Liu",
"Hui",
""
]
] | Various autonomous or assisted driving strategies have been facilitated through the accurate and reliable perception of the environment around a vehicle. Among the commonly used sensors, radar has usually been considered as a robust and cost-effective solution even in adverse driving scenarios, e.g., weak/strong lighti... |
1208.3398 | Guodong Shi | Guodong Shi, Mikael Johansson and Karl Henrik Johansson | How Agreement and Disagreement Evolve over Random Dynamic Networks | null | null | null | null | cs.SI cs.MA cs.SY math.OC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The dynamics of an agreement protocol interacting with a disagreement process
over a common random network is considered. The model can represent the
spreading of true and false information over a communication network, the
propagation of faults in a large-scale control system, or the development of
trust and mistrus... | [
{
"created": "Thu, 16 Aug 2012 15:22:01 GMT",
"version": "v1"
}
] | 2012-08-17 | [
[
"Shi",
"Guodong",
""
],
[
"Johansson",
"Mikael",
""
],
[
"Johansson",
"Karl Henrik",
""
]
] | The dynamics of an agreement protocol interacting with a disagreement process over a common random network is considered. The model can represent the spreading of true and false information over a communication network, the propagation of faults in a large-scale control system, or the development of trust and mistrust ... |
1912.11300 | Lakshmi B Narayana V S Ch | V S Ch Lakshmi Narayana, Sharayu Moharir, Nikhil Karamchandani | RetroRenting: An Online Policy for Service Caching at the Edge | null | null | null | null | cs.NI cs.SY eess.SY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The rapid proliferation of shared edge computing platforms has enabled
application service providers to deploy a wide variety of services with
stringent latency and high bandwidth requirements. A key advantage of these
platforms is that they provide pay-as-you-go flexibility by charging clients in
proportion to their... | [
{
"created": "Tue, 24 Dec 2019 11:41:57 GMT",
"version": "v1"
},
{
"created": "Wed, 10 Feb 2021 08:17:50 GMT",
"version": "v10"
},
{
"created": "Mon, 17 May 2021 05:56:22 GMT",
"version": "v11"
},
{
"created": "Mon, 30 Dec 2019 09:08:16 GMT",
"version": "v2"
},
{
... | 2021-05-18 | [
[
"Narayana",
"V S Ch Lakshmi",
""
],
[
"Moharir",
"Sharayu",
""
],
[
"Karamchandani",
"Nikhil",
""
]
] | The rapid proliferation of shared edge computing platforms has enabled application service providers to deploy a wide variety of services with stringent latency and high bandwidth requirements. A key advantage of these platforms is that they provide pay-as-you-go flexibility by charging clients in proportion to their r... |
2209.10444 | Audrey Huang | Audrey Huang, Liu Leqi, Zachary Chase Lipton, Kamyar Azizzadenesheli | Off-Policy Risk Assessment in Markov Decision Processes | null | null | null | null | cs.LG cs.AI stat.ML | http://creativecommons.org/licenses/by/4.0/ | Addressing such diverse ends as safety alignment with human preferences, and
the efficiency of learning, a growing line of reinforcement learning research
focuses on risk functionals that depend on the entire distribution of returns.
Recent work on \emph{off-policy risk assessment} (OPRA) for contextual bandits
intro... | [
{
"created": "Wed, 21 Sep 2022 15:40:59 GMT",
"version": "v1"
}
] | 2022-09-22 | [
[
"Huang",
"Audrey",
""
],
[
"Leqi",
"Liu",
""
],
[
"Lipton",
"Zachary Chase",
""
],
[
"Azizzadenesheli",
"Kamyar",
""
]
] | Addressing such diverse ends as safety alignment with human preferences, and the efficiency of learning, a growing line of reinforcement learning research focuses on risk functionals that depend on the entire distribution of returns. Recent work on \emph{off-policy risk assessment} (OPRA) for contextual bandits introdu... |
1303.5402 | Francesco Fulvio Monai | Francesco Fulvio Monai, Thomas Chehire | Possibilistic Assumption based Truth Maintenance System, Validation in a
Data Fusion Application | Appears in Proceedings of the Eighth Conference on Uncertainty in
Artificial Intelligence (UAI1992) | null | null | UAI-P-1992-PG-83-91 | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Data fusion allows the elaboration and the evaluation of a situation
synthesized from low level informations provided by different kinds of sensors.
The fusion of the collected data will result in fewer and higher level
informations more easily assessed by a human operator and that will assist him
effectively in his ... | [
{
"created": "Wed, 13 Mar 2013 12:52:32 GMT",
"version": "v1"
}
] | 2013-03-25 | [
[
"Monai",
"Francesco Fulvio",
""
],
[
"Chehire",
"Thomas",
""
]
] | Data fusion allows the elaboration and the evaluation of a situation synthesized from low level informations provided by different kinds of sensors. The fusion of the collected data will result in fewer and higher level informations more easily assessed by a human operator and that will assist him effectively in his de... |
2212.07069 | Mercedeh Harirchian | Mercedeh Harirchian, Fereshteh Amin, Saeed Rouhani, Aref Aligholipour,
Vahid Amiri Lord | AI-enabled exploration of Instagram profiles predicts soft skills and
personality traits to empower hiring decisions | null | null | null | null | cs.LG cs.CY cs.SI | http://creativecommons.org/licenses/by-nc-sa/4.0/ | It does not matter whether it is a job interview with Tech Giants, Wall
Street firms, or a small startup; all candidates want to demonstrate their best
selves or even present themselves better than they really are. Meanwhile,
recruiters want to know the candidates' authentic selves and detect soft skills
that prove a... | [
{
"created": "Wed, 14 Dec 2022 07:35:11 GMT",
"version": "v1"
},
{
"created": "Sat, 24 Dec 2022 07:09:53 GMT",
"version": "v2"
}
] | 2022-12-27 | [
[
"Harirchian",
"Mercedeh",
""
],
[
"Amin",
"Fereshteh",
""
],
[
"Rouhani",
"Saeed",
""
],
[
"Aligholipour",
"Aref",
""
],
[
"Lord",
"Vahid Amiri",
""
]
] | It does not matter whether it is a job interview with Tech Giants, Wall Street firms, or a small startup; all candidates want to demonstrate their best selves or even present themselves better than they really are. Meanwhile, recruiters want to know the candidates' authentic selves and detect soft skills that prove an ... |
2102.07680 | Max Horn | Max Horn, Kumar Shridhar, Elrich Groenewald, Philipp F. M. Baumann | Translational Equivariance in Kernelizable Attention | null | null | null | null | cs.LG cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | While Transformer architectures have show remarkable success, they are bound
to the computation of all pairwise interactions of input element and thus
suffer from limited scalability. Recent work has been successful by avoiding
the computation of the complete attention matrix, yet leads to problems down
the line. The... | [
{
"created": "Mon, 15 Feb 2021 17:14:15 GMT",
"version": "v1"
}
] | 2021-02-16 | [
[
"Horn",
"Max",
""
],
[
"Shridhar",
"Kumar",
""
],
[
"Groenewald",
"Elrich",
""
],
[
"Baumann",
"Philipp F. M.",
""
]
] | While Transformer architectures have show remarkable success, they are bound to the computation of all pairwise interactions of input element and thus suffer from limited scalability. Recent work has been successful by avoiding the computation of the complete attention matrix, yet leads to problems down the line. The a... |
2303.08268 | Xufeng Zhao | Xufeng Zhao, Mengdi Li, Cornelius Weber, Muhammad Burhan Hafez, and
Stefan Wermter | Chat with the Environment: Interactive Multimodal Perception Using Large
Language Models | IROS2023, Detroit. See the project website at
https://matcha-agent.github.io | null | null | null | cs.RO cs.AI cs.CL cs.LG cs.SD eess.AS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Programming robot behavior in a complex world faces challenges on multiple
levels, from dextrous low-level skills to high-level planning and reasoning.
Recent pre-trained Large Language Models (LLMs) have shown remarkable reasoning
ability in few-shot robotic planning. However, it remains challenging to ground
LLMs i... | [
{
"created": "Tue, 14 Mar 2023 23:01:27 GMT",
"version": "v1"
},
{
"created": "Tue, 1 Aug 2023 10:22:21 GMT",
"version": "v2"
},
{
"created": "Wed, 11 Oct 2023 16:17:20 GMT",
"version": "v3"
}
] | 2023-10-12 | [
[
"Zhao",
"Xufeng",
""
],
[
"Li",
"Mengdi",
""
],
[
"Weber",
"Cornelius",
""
],
[
"Hafez",
"Muhammad Burhan",
""
],
[
"Wermter",
"Stefan",
""
]
] | Programming robot behavior in a complex world faces challenges on multiple levels, from dextrous low-level skills to high-level planning and reasoning. Recent pre-trained Large Language Models (LLMs) have shown remarkable reasoning ability in few-shot robotic planning. However, it remains challenging to ground LLMs in ... |
2310.17772 | Nathan Justin | Nathan Justin, Sina Aghaei, Andr\'es G\'omez, Phebe Vayanos | Learning Optimal Classification Trees Robust to Distribution Shifts | 47 pages, 11 figures | null | null | null | cs.LG math.OC stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We consider the problem of learning classification trees that are robust to
distribution shifts between training and testing/deployment data. This problem
arises frequently in high stakes settings such as public health and social work
where data is often collected using self-reported surveys which are highly
sensitiv... | [
{
"created": "Thu, 26 Oct 2023 20:37:29 GMT",
"version": "v1"
}
] | 2023-10-30 | [
[
"Justin",
"Nathan",
""
],
[
"Aghaei",
"Sina",
""
],
[
"Gómez",
"Andrés",
""
],
[
"Vayanos",
"Phebe",
""
]
] | We consider the problem of learning classification trees that are robust to distribution shifts between training and testing/deployment data. This problem arises frequently in high stakes settings such as public health and social work where data is often collected using self-reported surveys which are highly sensitive ... |
2112.11209 | Sein Minn | Sein Minn, Jill-Jenn Vie, Koh Takeuchi, Hisashi Kashima, Feida Zhu | Interpretable Knowledge Tracing: Simple and Efficient Student Modeling
with Causal Relations | AAAI Symposium on Educational Advances in Artificial Intelligence
EAAI-22. arXiv admin note: text overlap with arXiv:2012.12218 | null | null | null | cs.CY cs.AI cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Intelligent Tutoring Systems have become critically important in future
learning environments. Knowledge Tracing (KT) is a crucial part of that system.
It is about inferring the skill mastery of students and predicting their
performance to adjust the curriculum accordingly. Deep Learning-based KT models
have shown si... | [
{
"created": "Wed, 15 Dec 2021 19:05:48 GMT",
"version": "v1"
}
] | 2021-12-22 | [
[
"Minn",
"Sein",
""
],
[
"Vie",
"Jill-Jenn",
""
],
[
"Takeuchi",
"Koh",
""
],
[
"Kashima",
"Hisashi",
""
],
[
"Zhu",
"Feida",
""
]
] | Intelligent Tutoring Systems have become critically important in future learning environments. Knowledge Tracing (KT) is a crucial part of that system. It is about inferring the skill mastery of students and predicting their performance to adjust the curriculum accordingly. Deep Learning-based KT models have shown sign... |
2212.09586 | Sagar Parekh | Sagar Parekh, Dylan P. Losey | Learning Latent Representations to Co-Adapt to Humans | null | null | 10.1007/s10514-023-10109-5 | null | cs.RO cs.AI cs.LG | http://creativecommons.org/licenses/by/4.0/ | When robots interact with humans in homes, roads, or factories the human's
behavior often changes in response to the robot. Non-stationary humans are
challenging for robot learners: actions the robot has learned to coordinate
with the original human may fail after the human adapts to the robot. In this
paper we intro... | [
{
"created": "Mon, 19 Dec 2022 16:19:24 GMT",
"version": "v1"
},
{
"created": "Thu, 22 Dec 2022 19:36:39 GMT",
"version": "v2"
},
{
"created": "Sat, 19 Aug 2023 23:47:28 GMT",
"version": "v3"
}
] | 2023-08-22 | [
[
"Parekh",
"Sagar",
""
],
[
"Losey",
"Dylan P.",
""
]
] | When robots interact with humans in homes, roads, or factories the human's behavior often changes in response to the robot. Non-stationary humans are challenging for robot learners: actions the robot has learned to coordinate with the original human may fail after the human adapts to the robot. In this paper we introdu... |
2201.00286 | Arun Raman | Arun Raman, Keerthan Shagrithaya and Shalabh Bhatnagar | Reinforcement Learning for Task Specifications with Action-Constraints | null | null | null | null | cs.LG cs.AI cs.SY eess.SY | http://creativecommons.org/licenses/by/4.0/ | In this paper, we use concepts from supervisory control theory of discrete
event systems to propose a method to learn optimal control policies for a
finite-state Markov Decision Process (MDP) in which (only) certain sequences of
actions are deemed unsafe (respectively safe). We assume that the set of action
sequences... | [
{
"created": "Sun, 2 Jan 2022 04:22:01 GMT",
"version": "v1"
}
] | 2022-01-04 | [
[
"Raman",
"Arun",
""
],
[
"Shagrithaya",
"Keerthan",
""
],
[
"Bhatnagar",
"Shalabh",
""
]
] | In this paper, we use concepts from supervisory control theory of discrete event systems to propose a method to learn optimal control policies for a finite-state Markov Decision Process (MDP) in which (only) certain sequences of actions are deemed unsafe (respectively safe). We assume that the set of action sequences t... |
0802.3102 | EDA Publishing Association | M. Narducci, E. Figueras, I. Gracia, L. Fonseca, J. Santander, C.
Can\'e | Modeling of T-Shaped Microcantilever Resonators | Submitted on behalf of EDA Publishing Association
(http://irevues.inist.fr/EDA-Publishing) | Dans Symposium on Design, Test, Integration and Packaging of
MEMS/MOEMS - DTIP 2007, Stresa, lago Maggiore : Italie (2007) | null | null | cs.OH | null | The extensive research and development of micromechanical resonators is
trying to allow the use of these devices for highly sensitive applications.
Microcantilevers are some of the simplest MEMS structure and had been proved to
be a good platform due to its excellent mechanical properties. A cantilever
working in dyn... | [
{
"created": "Thu, 21 Feb 2008 13:45:15 GMT",
"version": "v1"
}
] | 2008-02-22 | [
[
"Narducci",
"M.",
""
],
[
"Figueras",
"E.",
""
],
[
"Gracia",
"I.",
""
],
[
"Fonseca",
"L.",
""
],
[
"Santander",
"J.",
""
],
[
"Cané",
"C.",
""
]
] | The extensive research and development of micromechanical resonators is trying to allow the use of these devices for highly sensitive applications. Microcantilevers are some of the simplest MEMS structure and had been proved to be a good platform due to its excellent mechanical properties. A cantilever working in dynam... |
1704.04760 | David Patterson David Patterson | Norman P. Jouppi, Cliff Young, Nishant Patil, David Patterson, Gaurav
Agrawal, Raminder Bajwa, Sarah Bates, Suresh Bhatia, Nan Boden, Al Borchers,
Rick Boyle, Pierre-luc Cantin, Clifford Chao, Chris Clark, Jeremy Coriell,
Mike Daley, Matt Dau, Jeffrey Dean, Ben Gelb, Tara Vazir Ghaemmaghami,
Rajendra Gottipati,... | In-Datacenter Performance Analysis of a Tensor Processing Unit | 17 pages, 11 figures, 8 tables. To appear at the 44th International
Symposium on Computer Architecture (ISCA), Toronto, Canada, June 24-28, 2017 | null | null | null | cs.AR cs.LG cs.NE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Many architects believe that major improvements in cost-energy-performance
must now come from domain-specific hardware. This paper evaluates a custom
ASIC---called a Tensor Processing Unit (TPU)---deployed in datacenters since
2015 that accelerates the inference phase of neural networks (NN). The heart of
the TPU is ... | [
{
"created": "Sun, 16 Apr 2017 12:07:54 GMT",
"version": "v1"
}
] | 2017-04-18 | [
[
"Jouppi",
"Norman P.",
""
],
[
"Young",
"Cliff",
""
],
[
"Patil",
"Nishant",
""
],
[
"Patterson",
"David",
""
],
[
"Agrawal",
"Gaurav",
""
],
[
"Bajwa",
"Raminder",
""
],
[
"Bates",
"Sarah",
""
],
[
... | Many architects believe that major improvements in cost-energy-performance must now come from domain-specific hardware. This paper evaluates a custom ASIC---called a Tensor Processing Unit (TPU)---deployed in datacenters since 2015 that accelerates the inference phase of neural networks (NN). The heart of the TPU is a ... |
2110.03924 | Daisuke Iwai | Masatoki Sugimoto, Daisuke Iwai, Koki Ishida, Parinya Punpongsanon,
Kosuke Sato | Directionally Decomposing Structured Light for Projector Calibration | null | null | 10.1109/TVCG.2021.3106511 | null | cs.CV cs.GR eess.IV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Intrinsic projector calibration is essential in projection mapping (PM)
applications, especially in dynamic PM. However, due to the shallow
depth-of-field (DOF) of a projector, more work is needed to ensure accurate
calibration. We aim to estimate the intrinsic parameters of a projector while
avoiding the limitation ... | [
{
"created": "Fri, 8 Oct 2021 06:44:01 GMT",
"version": "v1"
}
] | 2021-10-11 | [
[
"Sugimoto",
"Masatoki",
""
],
[
"Iwai",
"Daisuke",
""
],
[
"Ishida",
"Koki",
""
],
[
"Punpongsanon",
"Parinya",
""
],
[
"Sato",
"Kosuke",
""
]
] | Intrinsic projector calibration is essential in projection mapping (PM) applications, especially in dynamic PM. However, due to the shallow depth-of-field (DOF) of a projector, more work is needed to ensure accurate calibration. We aim to estimate the intrinsic parameters of a projector while avoiding the limitation of... |
2306.09377 | Can Demircan | Can Demircan, Tankred Saanum, Leonardo Pettini, Marcel Binz, Blazej M
Baczkowski, Paula Kaanders, Christian F Doeller, Mona M Garvert, Eric Schulz | Language Aligned Visual Representations Predict Human Behavior in
Naturalistic Learning Tasks | null | null | null | null | cs.LG cs.AI cs.CV | http://creativecommons.org/licenses/by/4.0/ | Humans possess the ability to identify and generalize relevant features of
natural objects, which aids them in various situations. To investigate this
phenomenon and determine the most effective representations for predicting
human behavior, we conducted two experiments involving category learning and
reward learning... | [
{
"created": "Thu, 15 Jun 2023 08:18:29 GMT",
"version": "v1"
}
] | 2023-06-19 | [
[
"Demircan",
"Can",
""
],
[
"Saanum",
"Tankred",
""
],
[
"Pettini",
"Leonardo",
""
],
[
"Binz",
"Marcel",
""
],
[
"Baczkowski",
"Blazej M",
""
],
[
"Kaanders",
"Paula",
""
],
[
"Doeller",
"Christian F",
""
... | Humans possess the ability to identify and generalize relevant features of natural objects, which aids them in various situations. To investigate this phenomenon and determine the most effective representations for predicting human behavior, we conducted two experiments involving category learning and reward learning. ... |
1903.08408 | Casper Hansen | Christian Hansen, Casper Hansen, Stephen Alstrup, Jakob Grue Simonsen,
Christina Lioma | Modelling Sequential Music Track Skips using a Multi-RNN Approach | 4 pages | 12th ACM International Conference on Web Search and Data Mining
(WSDM) 2019, WSDM Cup | null | null | cs.IR cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Modelling sequential music skips provides streaming companies the ability to
better understand the needs of the user base, resulting in a better user
experience by reducing the need to manually skip certain music tracks. This
paper describes the solution of the University of Copenhagen DIKU-IR team in
the 'Spotify Se... | [
{
"created": "Wed, 20 Mar 2019 09:47:22 GMT",
"version": "v1"
}
] | 2019-03-21 | [
[
"Hansen",
"Christian",
""
],
[
"Hansen",
"Casper",
""
],
[
"Alstrup",
"Stephen",
""
],
[
"Simonsen",
"Jakob Grue",
""
],
[
"Lioma",
"Christina",
""
]
] | Modelling sequential music skips provides streaming companies the ability to better understand the needs of the user base, resulting in a better user experience by reducing the need to manually skip certain music tracks. This paper describes the solution of the University of Copenhagen DIKU-IR team in the 'Spotify Sequ... |
1905.08685 | Jen-Yen Chang | Jen-Yen Chang, Antonio Tejero-de-Pablos, Tatsuya Harada | Improved Optical Flow for Gesture-based Human-robot Interaction | Accepted by ICRA 2019 on Jan 31 2019 | null | 10.1109/ICRA.2019.8793825 | null | cs.HC cs.CV cs.RO | http://creativecommons.org/licenses/by-nc-sa/4.0/ | Gesture interaction is a natural way of communicating with a robot as an
alternative to speech. Gesture recognition methods leverage optical flow in
order to understand human motion. However, while accurate optical flow
estimation (i.e., traditional) methods are costly in terms of runtime, fast
estimation (i.e., deep... | [
{
"created": "Tue, 21 May 2019 15:03:31 GMT",
"version": "v1"
}
] | 2019-10-01 | [
[
"Chang",
"Jen-Yen",
""
],
[
"Tejero-de-Pablos",
"Antonio",
""
],
[
"Harada",
"Tatsuya",
""
]
] | Gesture interaction is a natural way of communicating with a robot as an alternative to speech. Gesture recognition methods leverage optical flow in order to understand human motion. However, while accurate optical flow estimation (i.e., traditional) methods are costly in terms of runtime, fast estimation (i.e., deep l... |
2208.00789 | Leon Zheng | L\'eon Zheng (DANTE), Gilles Puy, Elisa Riccietti (DANTE), Patrick
P\'erez, R\'emi Gribonval (DANTE) | Self-supervised learning with rotation-invariant kernels | null | The Eleventh International Conference on Learning Representations,
May 2023, Kigali, Rwanda | null | null | cs.CV cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We introduce a regularization loss based on kernel mean embeddings with
rotation-invariant kernels on the hypersphere (also known as dot-product
kernels) for self-supervised learning of image representations. Besides being
fully competitive with the state of the art, our method significantly reduces
time and memory c... | [
{
"created": "Thu, 28 Jul 2022 08:06:24 GMT",
"version": "v1"
},
{
"created": "Wed, 5 Oct 2022 14:17:13 GMT",
"version": "v2"
},
{
"created": "Wed, 12 Oct 2022 07:48:37 GMT",
"version": "v3"
},
{
"created": "Wed, 8 Mar 2023 13:34:28 GMT",
"version": "v4"
}
] | 2023-03-09 | [
[
"Zheng",
"Léon",
"",
"DANTE"
],
[
"Puy",
"Gilles",
"",
"DANTE"
],
[
"Riccietti",
"Elisa",
"",
"DANTE"
],
[
"Pérez",
"Patrick",
"",
"DANTE"
],
[
"Gribonval",
"Rémi",
"",
"DANTE"
]
] | We introduce a regularization loss based on kernel mean embeddings with rotation-invariant kernels on the hypersphere (also known as dot-product kernels) for self-supervised learning of image representations. Besides being fully competitive with the state of the art, our method significantly reduces time and memory com... |
2112.14938 | Ting Hua | Changsheng Zhao and Ting Hua and Yilin Shen and Qian Lou and Hongxia
Jin | Automatic Mixed-Precision Quantization Search of BERT | null | Proceedings of the Thirtieth International Joint Conference on
Artificial Intelligence, IJCAI, 2021 | 10.24963/ijcai.2021/472 | null | cs.CL cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Pre-trained language models such as BERT have shown remarkable effectiveness
in various natural language processing tasks. However, these models usually
contain millions of parameters, which prevents them from practical deployment
on resource-constrained devices. Knowledge distillation, Weight pruning, and
Quantizati... | [
{
"created": "Thu, 30 Dec 2021 06:32:47 GMT",
"version": "v1"
}
] | 2022-01-03 | [
[
"Zhao",
"Changsheng",
""
],
[
"Hua",
"Ting",
""
],
[
"Shen",
"Yilin",
""
],
[
"Lou",
"Qian",
""
],
[
"Jin",
"Hongxia",
""
]
] | Pre-trained language models such as BERT have shown remarkable effectiveness in various natural language processing tasks. However, these models usually contain millions of parameters, which prevents them from practical deployment on resource-constrained devices. Knowledge distillation, Weight pruning, and Quantization... |
2312.12404 | Christof Tinnes | Christof Tinnes, Thomas Fuch{\ss}, Uwe Hohenstein, Sven Apel | Towards Automatic Support of Software Model Evolution with Large
Language~Models | null | null | null | null | cs.SE cs.AI | http://creativecommons.org/licenses/by-sa/4.0/ | Modeling structure and behavior of software systems plays a crucial role, in
various areas of software engineering. As with other software engineering
artifacts, software models are subject to evolution. Supporting modelers in
evolving models by model completion facilities and providing high-level edit
operations suc... | [
{
"created": "Tue, 19 Dec 2023 18:38:01 GMT",
"version": "v1"
}
] | 2023-12-20 | [
[
"Tinnes",
"Christof",
""
],
[
"Fuchß",
"Thomas",
""
],
[
"Hohenstein",
"Uwe",
""
],
[
"Apel",
"Sven",
""
]
] | Modeling structure and behavior of software systems plays a crucial role, in various areas of software engineering. As with other software engineering artifacts, software models are subject to evolution. Supporting modelers in evolving models by model completion facilities and providing high-level edit operations such ... |
2406.11793 | Beining Han | Beining Han, Meenal Parakh, Derek Geng, Jack A Defay, Luyang Gan, Jia
Deng | FetchBench: A Simulation Benchmark for Robot Fetching | null | null | null | null | cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Fetching, which includes approaching, grasping, and retrieving, is a critical
challenge for robot manipulation tasks. Existing methods primarily focus on
table-top scenarios, which do not adequately capture the complexities of
environments where both grasping and planning are essential. To address this
gap, we propos... | [
{
"created": "Mon, 17 Jun 2024 17:41:42 GMT",
"version": "v1"
}
] | 2024-06-18 | [
[
"Han",
"Beining",
""
],
[
"Parakh",
"Meenal",
""
],
[
"Geng",
"Derek",
""
],
[
"Defay",
"Jack A",
""
],
[
"Gan",
"Luyang",
""
],
[
"Deng",
"Jia",
""
]
] | Fetching, which includes approaching, grasping, and retrieving, is a critical challenge for robot manipulation tasks. Existing methods primarily focus on table-top scenarios, which do not adequately capture the complexities of environments where both grasping and planning are essential. To address this gap, we propose ... |
2002.12415 | Gideon Billings | Gideon Billings, Matthew Johnson-Roberson | SilhoNet-Fisheye: Adaptation of A ROI Based Object Pose Estimation
Network to Monocular Fisheye Images | Submitted to IEEE RAL/IROS 2020 | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | There has been much recent interest in deep learning methods for monocular
image based object pose estimation. While object pose estimation is an
important problem for autonomous robot interaction with the physical world, and
the application space for monocular-based methods is expansive, there has been
little work o... | [
{
"created": "Thu, 27 Feb 2020 19:57:33 GMT",
"version": "v1"
}
] | 2020-03-02 | [
[
"Billings",
"Gideon",
""
],
[
"Johnson-Roberson",
"Matthew",
""
]
] | There has been much recent interest in deep learning methods for monocular image based object pose estimation. While object pose estimation is an important problem for autonomous robot interaction with the physical world, and the application space for monocular-based methods is expansive, there has been little work on ... |
2309.05946 | Jie Zhou | Jie Zhou, Zhongjin Luo, Qian Yu, Xiaoguang Han, and Hongbo Fu | GA-Sketching: Shape Modeling from Multi-View Sketching with
Geometry-Aligned Deep Implicit Functions | null | null | null | null | cs.GR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Sketch-based shape modeling aims to bridge the gap between 2D drawing and 3D
modeling by providing an intuitive and accessible approach to create 3D shapes
from 2D sketches. However, existing methods still suffer from limitations in
reconstruction quality and multi-view interaction friendliness, hindering their
pract... | [
{
"created": "Tue, 12 Sep 2023 03:51:02 GMT",
"version": "v1"
}
] | 2023-09-13 | [
[
"Zhou",
"Jie",
""
],
[
"Luo",
"Zhongjin",
""
],
[
"Yu",
"Qian",
""
],
[
"Han",
"Xiaoguang",
""
],
[
"Fu",
"Hongbo",
""
]
] | Sketch-based shape modeling aims to bridge the gap between 2D drawing and 3D modeling by providing an intuitive and accessible approach to create 3D shapes from 2D sketches. However, existing methods still suffer from limitations in reconstruction quality and multi-view interaction friendliness, hindering their practic... |
1203.5414 | Stasys Jukna | S. Jukna | Clique problem, cutting plane proofs and communication complexity | 10 pages. Theorem 1 in the previous version holds only for bipartite
graphs, the non-bipartite case remains open. I now separate the bipartite and
non-bipartite cases (by switching from independent sets to cliques, hence a
new title). Some new open problems as well as references are added | Information Processing Letters 112(20) (2012) 772-777 | 10.1016/j.ipl.2012.07.003 | null | cs.CC cs.DM | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Motivated by its relation to the length of cutting plane proofs for the
Maximum Biclique problem, we consider the following communication game on a
given graph G, known to both players. Let K be the maximal number of vertices
in a complete bipartite subgraph of G, which is not necessarily an induced
subgraph if G is ... | [
{
"created": "Sat, 24 Mar 2012 13:51:15 GMT",
"version": "v1"
},
{
"created": "Sun, 15 Apr 2012 15:20:40 GMT",
"version": "v2"
}
] | 2018-05-30 | [
[
"Jukna",
"S.",
""
]
] | Motivated by its relation to the length of cutting plane proofs for the Maximum Biclique problem, we consider the following communication game on a given graph G, known to both players. Let K be the maximal number of vertices in a complete bipartite subgraph of G, which is not necessarily an induced subgraph if G is no... |
1910.13157 | Eran Treister | Jonathan Ephrath, Moshe Eliasof, Lars Ruthotto, Eldad Haber and Eran
Treister | LeanConvNets: Low-cost Yet Effective Convolutional Neural Networks | null | null | 10.1109/JSTSP.2020.2972775 | null | cs.LG cs.CV stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Convolutional Neural Networks (CNNs) have become indispensable for solving
machine learning tasks in speech recognition, computer vision, and other areas
that involve high-dimensional data. A CNN filters the input feature using a
network containing spatial convolution operators with compactly supported
stencils. In p... | [
{
"created": "Tue, 29 Oct 2019 09:51:10 GMT",
"version": "v1"
},
{
"created": "Wed, 12 Feb 2020 10:50:12 GMT",
"version": "v2"
}
] | 2020-02-13 | [
[
"Ephrath",
"Jonathan",
""
],
[
"Eliasof",
"Moshe",
""
],
[
"Ruthotto",
"Lars",
""
],
[
"Haber",
"Eldad",
""
],
[
"Treister",
"Eran",
""
]
] | Convolutional Neural Networks (CNNs) have become indispensable for solving machine learning tasks in speech recognition, computer vision, and other areas that involve high-dimensional data. A CNN filters the input feature using a network containing spatial convolution operators with compactly supported stencils. In pra... |
1701.01810 | Jiao Ma | Jiao Ma, Changle Li, Weiwei Dong, Zhe Liu, Tom H. Luan, Lina Zhu, and
Lei Xiong | Urban Rail Transit System Operation Optimization A Game Theoretical
Methodology | 7 pages, 4 figures, conference | null | null | null | cs.GT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The Urban Rail Transit (URT) has been one of the major trip modes in cities
worldwide. As the passengers arrive at variable rates in different time slots,
e.g., rush and non-rush hours, the departure frequency at a site directly
relates to perceived service quality of passengers; the high departure
frequency, however... | [
{
"created": "Sat, 7 Jan 2017 09:48:28 GMT",
"version": "v1"
}
] | 2017-01-10 | [
[
"Ma",
"Jiao",
""
],
[
"Li",
"Changle",
""
],
[
"Dong",
"Weiwei",
""
],
[
"Liu",
"Zhe",
""
],
[
"Luan",
"Tom H.",
""
],
[
"Zhu",
"Lina",
""
],
[
"Xiong",
"Lei",
""
]
] | The Urban Rail Transit (URT) has been one of the major trip modes in cities worldwide. As the passengers arrive at variable rates in different time slots, e.g., rush and non-rush hours, the departure frequency at a site directly relates to perceived service quality of passengers; the high departure frequency, however, ... |
2212.05181 | Jia-Rui Lin | Jia-Rui Lin, Ming-Hui Wu | Exploiting the Power of Human-Robot Collaboration: Coupling and Scale
Effects in Bricklaying | null | null | null | null | cs.RO cs.MA | http://creativecommons.org/licenses/by-nc-sa/4.0/ | As an important contributor to GDP growth, the construction industry is
suffering from labor shortage due to population ageing, COVID-19 pandemic, and
harsh environments. Considering the complexity and dynamics of construction
environment, it is still challenging to develop fully automated robots. For a
long time in ... | [
{
"created": "Sat, 10 Dec 2022 02:12:02 GMT",
"version": "v1"
}
] | 2022-12-13 | [
[
"Lin",
"Jia-Rui",
""
],
[
"Wu",
"Ming-Hui",
""
]
] | As an important contributor to GDP growth, the construction industry is suffering from labor shortage due to population ageing, COVID-19 pandemic, and harsh environments. Considering the complexity and dynamics of construction environment, it is still challenging to develop fully automated robots. For a long time in th... |
2210.06884 | Alexandra Butoi | Alexandra Butoi, Brian DuSell, Tim Vieira, Ryan Cotterell, David
Chiang | Algorithms for Weighted Pushdown Automata | 12 pages, 7 figures. Accepted at EMNLP 2022 | null | null | null | cs.CL | http://creativecommons.org/licenses/by/4.0/ | Weighted pushdown automata (WPDAs) are at the core of many natural language
processing tasks, like syntax-based statistical machine translation and
transition-based dependency parsing. As most existing dynamic programming
algorithms are designed for context-free grammars (CFGs), algorithms for PDAs
often resort to a ... | [
{
"created": "Thu, 13 Oct 2022 10:21:31 GMT",
"version": "v1"
},
{
"created": "Wed, 19 Oct 2022 09:51:44 GMT",
"version": "v2"
},
{
"created": "Fri, 18 Nov 2022 09:33:05 GMT",
"version": "v3"
}
] | 2022-11-21 | [
[
"Butoi",
"Alexandra",
""
],
[
"DuSell",
"Brian",
""
],
[
"Vieira",
"Tim",
""
],
[
"Cotterell",
"Ryan",
""
],
[
"Chiang",
"David",
""
]
] | Weighted pushdown automata (WPDAs) are at the core of many natural language processing tasks, like syntax-based statistical machine translation and transition-based dependency parsing. As most existing dynamic programming algorithms are designed for context-free grammars (CFGs), algorithms for PDAs often resort to a PD... |
2406.00284 | Ehsan Shareghi | Long Hei Matthew Lam, Ramya Keerthy Thatikonda, Ehsan Shareghi | A Closer Look at Logical Reasoning with LLMs: The Choice of Tool Matters | Code and data are publicly available at:
https://github.com/Mattylam/Logic_Symbolic_Solvers_Experiment | null | null | null | cs.CL | http://creativecommons.org/licenses/by/4.0/ | The emergence of Large Language Models (LLMs) has demonstrated promising
progress in solving logical reasoning tasks effectively. Several recent
approaches have proposed to change the role of the LLM from the reasoner into a
translator between natural language statements and symbolic representations
which are then se... | [
{
"created": "Sat, 1 Jun 2024 03:29:56 GMT",
"version": "v1"
},
{
"created": "Thu, 11 Jul 2024 05:06:25 GMT",
"version": "v2"
}
] | 2024-07-12 | [
[
"Lam",
"Long Hei Matthew",
""
],
[
"Thatikonda",
"Ramya Keerthy",
""
],
[
"Shareghi",
"Ehsan",
""
]
] | The emergence of Large Language Models (LLMs) has demonstrated promising progress in solving logical reasoning tasks effectively. Several recent approaches have proposed to change the role of the LLM from the reasoner into a translator between natural language statements and symbolic representations which are then sent... |
2012.08072 | Qicheng Lao | Qicheng Lao, Xiang Jiang, Mohammad Havaei | Hypothesis Disparity Regularized Mutual Information Maximization | Accepted to AAAI 2021 | null | null | null | cs.LG cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We propose a hypothesis disparity regularized mutual information
maximization~(HDMI) approach to tackle unsupervised hypothesis transfer -- as
an effort towards unifying hypothesis transfer learning (HTL) and unsupervised
domain adaptation (UDA) -- where the knowledge from a source domain is
transferred solely throug... | [
{
"created": "Tue, 15 Dec 2020 03:39:16 GMT",
"version": "v1"
}
] | 2020-12-16 | [
[
"Lao",
"Qicheng",
""
],
[
"Jiang",
"Xiang",
""
],
[
"Havaei",
"Mohammad",
""
]
] | We propose a hypothesis disparity regularized mutual information maximization~(HDMI) approach to tackle unsupervised hypothesis transfer -- as an effort towards unifying hypothesis transfer learning (HTL) and unsupervised domain adaptation (UDA) -- where the knowledge from a source domain is transferred solely through ... |
1710.09995 | Anthony Chronopoulos | Yong-Xian Wang, Li-Lun Zhang, Wei Liu, Xing-Hua Cheng, Yu Zhuang,
Anthony T. Chronopoulos | Performance optimizations for scalable CFD applications on hybrid
CPU+MIC heterogeneous computing system with millions of cores | 12pages, 12 figures | null | 10.1016/j.compfluid.2018.03.005 | null | cs.PF | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | For computational fluid dynamics (CFD) applications with a large number of
grid points/cells, parallel computing is a common efficient strategy to reduce
the computational time. How to achieve the best performance in the modern
supercomputer system, especially with heterogeneous computing resources such as
hybrid CPU... | [
{
"created": "Fri, 27 Oct 2017 06:06:47 GMT",
"version": "v1"
}
] | 2018-03-12 | [
[
"Wang",
"Yong-Xian",
""
],
[
"Zhang",
"Li-Lun",
""
],
[
"Liu",
"Wei",
""
],
[
"Cheng",
"Xing-Hua",
""
],
[
"Zhuang",
"Yu",
""
],
[
"Chronopoulos",
"Anthony T.",
""
]
] | For computational fluid dynamics (CFD) applications with a large number of grid points/cells, parallel computing is a common efficient strategy to reduce the computational time. How to achieve the best performance in the modern supercomputer system, especially with heterogeneous computing resources such as hybrid CPU+G... |
1006.3394 | Soumya Banerjee | Soumya Banerjee and Melanie Moses | Modular RADAR: An Immune System Inspired Search and Response Strategy
for Distributed Systems | 14 pages, 3 figures, scale invariant detection and response,
distributed systems, scale invariant response, scale invariant detection,
immune system scaling, modular search, modular architecture, sub-modular
architecture, peer-to-peer systems, artificial immune systems, immune system
modelling, intrusion detect... | The 9th International Conference on Artificial Immune Systems
(ICARIS) 2010 | null | null | cs.DC q-bio.PE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The Natural Immune System (NIS) is a distributed system that solves
challenging search and response problems while operating under constraints
imposed by physical space and resource availability. Remarkably, NIS search and
response times do not scale appreciably with the physical size of the animal in
which its searc... | [
{
"created": "Thu, 17 Jun 2010 07:58:01 GMT",
"version": "v1"
}
] | 2010-06-18 | [
[
"Banerjee",
"Soumya",
""
],
[
"Moses",
"Melanie",
""
]
] | The Natural Immune System (NIS) is a distributed system that solves challenging search and response problems while operating under constraints imposed by physical space and resource availability. Remarkably, NIS search and response times do not scale appreciably with the physical size of the animal in which its search ... |
1507.04928 | Kieran Greer Dr | Kieran Greer | A Brain-like Cognitive Process with Shared Methods | null | Int. J. Advanced Intelligence Paradigms, Vol. 18, No. 4, 2021,
pp.481-501, Inderscience | 10.1504/IJAIP.2018.10033335 | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper describes a new entropy-style of equation that may be useful in a
general sense, but can be applied to a cognitive model with related processes.
The model is based on the human brain, with automatic and distributed pattern
activity. Methods for carrying out the different processes are suggested. The
main p... | [
{
"created": "Fri, 17 Jul 2015 11:24:07 GMT",
"version": "v1"
},
{
"created": "Tue, 5 Apr 2016 10:06:58 GMT",
"version": "v2"
},
{
"created": "Sat, 23 Jul 2016 16:00:42 GMT",
"version": "v3"
},
{
"created": "Wed, 23 Nov 2016 14:44:04 GMT",
"version": "v4"
},
{
"cr... | 2021-04-23 | [
[
"Greer",
"Kieran",
""
]
] | This paper describes a new entropy-style of equation that may be useful in a general sense, but can be applied to a cognitive model with related processes. The model is based on the human brain, with automatic and distributed pattern activity. Methods for carrying out the different processes are suggested. The main pur... |
2307.05445 | Evangelos Ntavelis | Evangelos Ntavelis, Aliaksandr Siarohin, Kyle Olszewski, Chaoyang
Wang, Luc Van Gool, Sergey Tulyakov | AutoDecoding Latent 3D Diffusion Models | Project page: https://snap-research.github.io/3DVADER/ | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We present a novel approach to the generation of static and articulated 3D
assets that has a 3D autodecoder at its core. The 3D autodecoder framework
embeds properties learned from the target dataset in the latent space, which
can then be decoded into a volumetric representation for rendering
view-consistent appearan... | [
{
"created": "Fri, 7 Jul 2023 17:59:14 GMT",
"version": "v1"
}
] | 2023-07-12 | [
[
"Ntavelis",
"Evangelos",
""
],
[
"Siarohin",
"Aliaksandr",
""
],
[
"Olszewski",
"Kyle",
""
],
[
"Wang",
"Chaoyang",
""
],
[
"Van Gool",
"Luc",
""
],
[
"Tulyakov",
"Sergey",
""
]
] | We present a novel approach to the generation of static and articulated 3D assets that has a 3D autodecoder at its core. The 3D autodecoder framework embeds properties learned from the target dataset in the latent space, which can then be decoded into a volumetric representation for rendering view-consistent appearance... |
1701.00740 | Javier Parra-Arnau | Javier Parra-Arnau | Optimized, Direct Sale of Privacy in Personal-Data Marketplaces | 15 pages, 11 figures | null | null | null | cs.CR cs.CY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Very recently, we are witnessing the emergence of a number of start-ups that
enables individuals to sell their private data directly to brokers and
businesses. While this new paradigm may shift the balance of power between
individuals and companies that harvest data, it raises some practical,
fundamental questions fo... | [
{
"created": "Tue, 3 Jan 2017 16:33:27 GMT",
"version": "v1"
}
] | 2017-01-04 | [
[
"Parra-Arnau",
"Javier",
""
]
] | Very recently, we are witnessing the emergence of a number of start-ups that enables individuals to sell their private data directly to brokers and businesses. While this new paradigm may shift the balance of power between individuals and companies that harvest data, it raises some practical, fundamental questions for ... |
1108.3683 | Philip Bille | Philip Bille and Inge Li Goertz | Substring Range Reporting | null | null | null | null | cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We revisit various string indexing problems with range reporting features,
namely, position-restricted substring searching, indexing substrings with gaps,
and indexing substrings with intervals. We obtain the following main results.
{itemize} We give efficient reductions for each of the above problems to a new
proble... | [
{
"created": "Thu, 18 Aug 2011 08:31:11 GMT",
"version": "v1"
}
] | 2011-08-19 | [
[
"Bille",
"Philip",
""
],
[
"Goertz",
"Inge Li",
""
]
] | We revisit various string indexing problems with range reporting features, namely, position-restricted substring searching, indexing substrings with gaps, and indexing substrings with intervals. We obtain the following main results. {itemize} We give efficient reductions for each of the above problems to a new problem,... |
2308.03175 | Rongguang Wang | Rongguang Wang, Guray Erus, Pratik Chaudhari, Christos Davatzikos | Adapting Machine Learning Diagnostic Models to New Populations Using a
Small Amount of Data: Results from Clinical Neuroscience | null | null | null | null | cs.LG eess.IV q-bio.QM | http://creativecommons.org/licenses/by/4.0/ | Machine learning (ML) has shown great promise for revolutionizing a number of
areas, including healthcare. However, it is also facing a reproducibility
crisis, especially in medicine. ML models that are carefully constructed from
and evaluated on a training set might not generalize well on data from
different patient... | [
{
"created": "Sun, 6 Aug 2023 18:05:39 GMT",
"version": "v1"
}
] | 2023-08-08 | [
[
"Wang",
"Rongguang",
""
],
[
"Erus",
"Guray",
""
],
[
"Chaudhari",
"Pratik",
""
],
[
"Davatzikos",
"Christos",
""
]
] | Machine learning (ML) has shown great promise for revolutionizing a number of areas, including healthcare. However, it is also facing a reproducibility crisis, especially in medicine. ML models that are carefully constructed from and evaluated on a training set might not generalize well on data from different patient p... |
1208.2760 | EPTCS | Kenichi Morita (Hiroshima University, Japan) | Universality of One-Dimensional Reversible and Number-Conserving
Cellular Automata | In Proceedings AUTOMATA&JAC 2012, arXiv:1208.2498 | EPTCS 90, 2012, pp. 142-150 | 10.4204/EPTCS.90.12 | null | cs.FL cs.CC cs.DM nlin.CG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We study one-dimensional reversible and number-conserving cellular automata
(RNCCA) that have both properties of reversibility and number-conservation. In
the case of 2-neighbor RNCCA, Garc\'ia-Ramos proved that every RNCCA shows
trivial behavior in the sense that all the signals in the RNCCA do not interact
each oth... | [
{
"created": "Tue, 14 Aug 2012 01:55:17 GMT",
"version": "v1"
}
] | 2012-08-15 | [
[
"Morita",
"Kenichi",
"",
"Hiroshima University, Japan"
]
] | We study one-dimensional reversible and number-conserving cellular automata (RNCCA) that have both properties of reversibility and number-conservation. In the case of 2-neighbor RNCCA, Garc\'ia-Ramos proved that every RNCCA shows trivial behavior in the sense that all the signals in the RNCCA do not interact each other... |
1611.08499 | Nhien Pham Hoang Bao | Nhien Pham Hoang Bao, Hiroyuki Iida | An Analysis of Tournament Structure | 10 pages | null | null | null | cs.AI | http://creativecommons.org/licenses/by/4.0/ | This paper explores a novel way for analyzing the tournament structures to
find a best suitable one for the tournament under consideration. It concerns
about three aspects such as tournament conducting cost, competitiveness
development and ranking precision. It then proposes a new method using progress
tree to detect... | [
{
"created": "Wed, 16 Nov 2016 07:09:16 GMT",
"version": "v1"
}
] | 2016-11-28 | [
[
"Bao",
"Nhien Pham Hoang",
""
],
[
"Iida",
"Hiroyuki",
""
]
] | This paper explores a novel way for analyzing the tournament structures to find a best suitable one for the tournament under consideration. It concerns about three aspects such as tournament conducting cost, competitiveness development and ranking precision. It then proposes a new method using progress tree to detect p... |
1605.06252 | Alexandre Mauroy | Aivar Sootla, Alexandre Mauroy and Jorge Goncalves | Shaping Pulses to Control Bistable Monotone Systems Using Koopman
Operator | 7 pages | null | null | null | cs.SY math.DS math.OC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we further develop a recently proposed control method to
switch a bistable system between its steady states using temporal pulses. The
motivation for using pulses comes from biomedical and biological applications
(e.g. synthetic biology), where it is generally difficult to build feedback
control system... | [
{
"created": "Fri, 20 May 2016 09:08:50 GMT",
"version": "v1"
}
] | 2016-05-26 | [
[
"Sootla",
"Aivar",
""
],
[
"Mauroy",
"Alexandre",
""
],
[
"Goncalves",
"Jorge",
""
]
] | In this paper, we further develop a recently proposed control method to switch a bistable system between its steady states using temporal pulses. The motivation for using pulses comes from biomedical and biological applications (e.g. synthetic biology), where it is generally difficult to build feedback control systems ... |
2406.07562 | Karwan Mustafa Kareem | Karwan Mustafa Kareem | Cyber Threat Landscape Analysis for Starlink Assessing Risks and
Mitigation Strategies in the Global Satellite Internet Infrastructure | 25 Pages | null | null | null | cs.CR cs.NI | http://creativecommons.org/licenses/by-nc-sa/4.0/ | Satellite internet networks have emerged as indispensable components of the
modern digital landscape, promising to extend connectivity to even the most
remote corners of the globe. Among these networks, Starlink, pioneered by
SpaceX, has garnered significant attention for its ambitious mission to provide
high-speed i... | [
{
"created": "Sat, 11 May 2024 23:03:31 GMT",
"version": "v1"
}
] | 2024-06-13 | [
[
"Kareem",
"Karwan Mustafa",
""
]
] | Satellite internet networks have emerged as indispensable components of the modern digital landscape, promising to extend connectivity to even the most remote corners of the globe. Among these networks, Starlink, pioneered by SpaceX, has garnered significant attention for its ambitious mission to provide high-speed int... |
2403.07589 | Honghao Chen | Honghao Chen, Xiangxiang Chu, Yongjian Ren, Xin Zhao, Kaiqi Huang | PeLK: Parameter-efficient Large Kernel ConvNets with Peripheral
Convolution | CVPR 2024; Modification for Fig.1(b); Add Acknowledgements | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Recently, some large kernel convnets strike back with appealing performance
and efficiency. However, given the square complexity of convolution, scaling up
kernels can bring about an enormous amount of parameters and the proliferated
parameters can induce severe optimization problem. Due to these issues, current
CNNs... | [
{
"created": "Tue, 12 Mar 2024 12:19:05 GMT",
"version": "v1"
},
{
"created": "Sat, 16 Mar 2024 02:55:14 GMT",
"version": "v2"
}
] | 2024-03-19 | [
[
"Chen",
"Honghao",
""
],
[
"Chu",
"Xiangxiang",
""
],
[
"Ren",
"Yongjian",
""
],
[
"Zhao",
"Xin",
""
],
[
"Huang",
"Kaiqi",
""
]
] | Recently, some large kernel convnets strike back with appealing performance and efficiency. However, given the square complexity of convolution, scaling up kernels can bring about an enormous amount of parameters and the proliferated parameters can induce severe optimization problem. Due to these issues, current CNNs c... |
2405.00205 | Nicolas Troquard | Pierre Nunn, Marco S\"alzer, Fran\c{c}ois Schwarzentruber, Nicolas
Troquard | A Logic for Reasoning About Aggregate-Combine Graph Neural Networks | arXiv admin note: text overlap with arXiv:2307.05150 | null | null | null | cs.AI cs.LG cs.LO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We propose a modal logic in which counting modalities appear in linear
inequalities. We show that each formula can be transformed into an equivalent
graph neural network (GNN). We also show that a broad class of GNNs can be
transformed efficiently into a formula, thus significantly improving upon the
literature about... | [
{
"created": "Tue, 30 Apr 2024 21:16:38 GMT",
"version": "v1"
}
] | 2024-05-02 | [
[
"Nunn",
"Pierre",
""
],
[
"Sälzer",
"Marco",
""
],
[
"Schwarzentruber",
"François",
""
],
[
"Troquard",
"Nicolas",
""
]
] | We propose a modal logic in which counting modalities appear in linear inequalities. We show that each formula can be transformed into an equivalent graph neural network (GNN). We also show that a broad class of GNNs can be transformed efficiently into a formula, thus significantly improving upon the literature about t... |
2403.03997 | Yixuan Li | Yixuan Li, Julian Parsert, Elizabeth Polgreen | Guiding Enumerative Program Synthesis with Large Language Models | Accepted at CAV 2024 | null | null | null | cs.AI | http://creativecommons.org/licenses/by-nc-nd/4.0/ | Pre-trained Large Language Models (LLMs) are beginning to dominate the
discourse around automatic code generation with natural language
specifications. In contrast, the best-performing synthesizers in the domain of
formal synthesis with precise logical specifications are still based on
enumerative algorithms. In this... | [
{
"created": "Wed, 6 Mar 2024 19:13:53 GMT",
"version": "v1"
},
{
"created": "Mon, 27 May 2024 12:18:40 GMT",
"version": "v2"
}
] | 2024-05-28 | [
[
"Li",
"Yixuan",
""
],
[
"Parsert",
"Julian",
""
],
[
"Polgreen",
"Elizabeth",
""
]
] | Pre-trained Large Language Models (LLMs) are beginning to dominate the discourse around automatic code generation with natural language specifications. In contrast, the best-performing synthesizers in the domain of formal synthesis with precise logical specifications are still based on enumerative algorithms. In this p... |
2305.07584 | Biqian Feng | Biqian Feng, Chenyuan Feng, Daquan Feng, Yongpeng Wu, Xiang-Gen Xia | Proactive Content Caching Scheme in Urban Vehicular Networks | Accepted by IEEE Transactions on Communications | null | null | null | cs.IT eess.SP math.IT | http://creativecommons.org/licenses/by/4.0/ | Stream media content caching is a key enabling technology to promote the
value chain of future urban vehicular networks. Nevertheless, the high mobility
of vehicles, intermittency of information transmissions, high dynamics of user
requests, limited caching capacities and extreme complexity of business
scenarios pose... | [
{
"created": "Fri, 12 May 2023 16:27:30 GMT",
"version": "v1"
}
] | 2023-05-15 | [
[
"Feng",
"Biqian",
""
],
[
"Feng",
"Chenyuan",
""
],
[
"Feng",
"Daquan",
""
],
[
"Wu",
"Yongpeng",
""
],
[
"Xia",
"Xiang-Gen",
""
]
] | Stream media content caching is a key enabling technology to promote the value chain of future urban vehicular networks. Nevertheless, the high mobility of vehicles, intermittency of information transmissions, high dynamics of user requests, limited caching capacities and extreme complexity of business scenarios pose a... |
1712.08768 | Minghui Min | Minghui Min, Dongjin Xu, Liang Xiao, Yuliang Tang, Di Wu | Learning-Based Computation Offloading for IoT Devices with Energy
Harvesting | null | null | null | null | cs.NI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Internet of Things (IoT) devices can apply mobile-edge computing (MEC) and
energy harvesting (EH) to provide the satisfactory quality of experiences for
computation intensive applications and prolong the battery lifetime. In this
article, we investigate the computation offloading for IoT devices with energy
harvestin... | [
{
"created": "Sat, 23 Dec 2017 12:34:40 GMT",
"version": "v1"
}
] | 2017-12-27 | [
[
"Min",
"Minghui",
""
],
[
"Xu",
"Dongjin",
""
],
[
"Xiao",
"Liang",
""
],
[
"Tang",
"Yuliang",
""
],
[
"Wu",
"Di",
""
]
] | Internet of Things (IoT) devices can apply mobile-edge computing (MEC) and energy harvesting (EH) to provide the satisfactory quality of experiences for computation intensive applications and prolong the battery lifetime. In this article, we investigate the computation offloading for IoT devices with energy harvesting ... |
2210.05396 | Wenyan Ma | Wenyan Ma, Lipeng Zhu, Rui Zhang | MIMO Capacity Characterization for Movable Antenna Systems | null | null | null | null | cs.IT math.IT | http://creativecommons.org/licenses/by/4.0/ | In this paper, we propose a new multiple-input multiple-output (MIMO)
communication system with movable antennas (MAs) to exploit the antenna
position optimization for enhancing the capacity. Different from conventional
MIMO systems with fixed-position antennas (FPAs), the proposed system can
flexibly change the posi... | [
{
"created": "Tue, 11 Oct 2022 12:15:11 GMT",
"version": "v1"
}
] | 2022-10-12 | [
[
"Ma",
"Wenyan",
""
],
[
"Zhu",
"Lipeng",
""
],
[
"Zhang",
"Rui",
""
]
] | In this paper, we propose a new multiple-input multiple-output (MIMO) communication system with movable antennas (MAs) to exploit the antenna position optimization for enhancing the capacity. Different from conventional MIMO systems with fixed-position antennas (FPAs), the proposed system can flexibly change the positi... |
2202.10831 | Johannes Obenaus | Oswin Aichholzer, Kristin Knorr, Wolfgang Mulzer, Johannes Obenaus,
Rosna Paul, Birgit Vogtenhuber | Flipping Plane Spanning Paths | null | null | null | null | cs.CG | http://creativecommons.org/licenses/by/4.0/ | Let $S$ be a planar point set in general position, and let $\mathcal{P}(S)$
be the set of all plane straight-line paths with vertex set $S$. A flip on a
path $P \in \mathcal{P}(S)$ is the operation of replacing an edge $e$ of $P$
with another edge $f$ on $S$ to obtain a new valid path from $\mathcal{P}(S)$.
It is a l... | [
{
"created": "Tue, 22 Feb 2022 11:45:15 GMT",
"version": "v1"
},
{
"created": "Tue, 27 Sep 2022 21:21:10 GMT",
"version": "v2"
}
] | 2022-09-29 | [
[
"Aichholzer",
"Oswin",
""
],
[
"Knorr",
"Kristin",
""
],
[
"Mulzer",
"Wolfgang",
""
],
[
"Obenaus",
"Johannes",
""
],
[
"Paul",
"Rosna",
""
],
[
"Vogtenhuber",
"Birgit",
""
]
] | Let $S$ be a planar point set in general position, and let $\mathcal{P}(S)$ be the set of all plane straight-line paths with vertex set $S$. A flip on a path $P \in \mathcal{P}(S)$ is the operation of replacing an edge $e$ of $P$ with another edge $f$ on $S$ to obtain a new valid path from $\mathcal{P}(S)$. It is a lon... |
2110.03423 | {\L}ukasz Struski | {\L}ukasz Struski, Pawe{\l} Morkisz, Przemys{\l}aw Spurek, Samuel
Rodriguez Bernabeu, Tomasz Trzci\'nski | Efficient GPU implementation of randomized SVD and its applications | null | Expert Systems with Applications, Volume 248, 15 August 2024 | 10.1016/j.eswa.2024.123462 | null | cs.LG cs.PF | http://creativecommons.org/licenses/by/4.0/ | Matrix decompositions are ubiquitous in machine learning, including
applications in dimensionality reduction, data compression and deep learning
algorithms. Typical solutions for matrix decompositions have polynomial
complexity which significantly increases their computational cost and time. In
this work, we leverage... | [
{
"created": "Tue, 5 Oct 2021 07:42:41 GMT",
"version": "v1"
},
{
"created": "Tue, 12 Mar 2024 12:12:29 GMT",
"version": "v2"
}
] | 2024-03-13 | [
[
"Struski",
"Łukasz",
""
],
[
"Morkisz",
"Paweł",
""
],
[
"Spurek",
"Przemysław",
""
],
[
"Bernabeu",
"Samuel Rodriguez",
""
],
[
"Trzciński",
"Tomasz",
""
]
] | Matrix decompositions are ubiquitous in machine learning, including applications in dimensionality reduction, data compression and deep learning algorithms. Typical solutions for matrix decompositions have polynomial complexity which significantly increases their computational cost and time. In this work, we leverage e... |
1809.00808 | Yiran Wang | Yiran Wang, Adam Noel and Nan Yang | A Novel A Priori Simulation Algorithm for Absorbing Receivers in
Diffusion-Based Molecular Communication Systems | 11 pages, 14 figures, submitted to IEEE Transactions on
NanoBioscience. arXiv admin note: text overlap with arXiv:1803.04638 | null | null | null | cs.ET | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A novel a priori Monte Carlo (APMC) algorithm is proposed to accurately
simulate the molecules absorbed at spherical receiver(s) with low computational
complexity in diffusion-based molecular communication (MC) systems. It is
demonstrated that the APMC algorithm achieves high simulation efficiency since
by using this... | [
{
"created": "Tue, 4 Sep 2018 06:51:32 GMT",
"version": "v1"
},
{
"created": "Sun, 16 Dec 2018 00:52:10 GMT",
"version": "v2"
}
] | 2018-12-18 | [
[
"Wang",
"Yiran",
""
],
[
"Noel",
"Adam",
""
],
[
"Yang",
"Nan",
""
]
] | A novel a priori Monte Carlo (APMC) algorithm is proposed to accurately simulate the molecules absorbed at spherical receiver(s) with low computational complexity in diffusion-based molecular communication (MC) systems. It is demonstrated that the APMC algorithm achieves high simulation efficiency since by using this a... |
1809.03406 | Erik Peterson | Erik J Peterson, Necati Alp M\"uyesser, Timothy Verstynen, Kyle
Dunovan | Combining imagination and heuristics to learn strategies that generalize | null | null | null | null | cs.AI | http://creativecommons.org/licenses/by-nc-sa/4.0/ | Deep reinforcement learning can match or exceed human performance in stable
contexts, but with minor changes to the environment artificial networks, unlike
humans, often cannot adapt. Humans rely on a combination of heuristics to
simplify computational load and imagination to extend experiential learning to
new and m... | [
{
"created": "Mon, 10 Sep 2018 15:43:57 GMT",
"version": "v1"
},
{
"created": "Thu, 11 Jun 2020 20:40:35 GMT",
"version": "v2"
}
] | 2020-06-15 | [
[
"Peterson",
"Erik J",
""
],
[
"Müyesser",
"Necati Alp",
""
],
[
"Verstynen",
"Timothy",
""
],
[
"Dunovan",
"Kyle",
""
]
] | Deep reinforcement learning can match or exceed human performance in stable contexts, but with minor changes to the environment artificial networks, unlike humans, often cannot adapt. Humans rely on a combination of heuristics to simplify computational load and imagination to extend experiential learning to new and mor... |
1612.03480 | Cengiz Pehlevan | Yuansi Chen, Cengiz Pehlevan, Dmitri B. Chklovskii | Self-calibrating Neural Networks for Dimensionality Reduction | 2016 Asilomar Conference on Signals, Systems and Computers | null | 10.1109/ACSSC.2016.7869625 | null | cs.LG cs.NE q-bio.NC stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Recently, a novel family of biologically plausible online algorithms for
reducing the dimensionality of streaming data has been derived from the
similarity matching principle. In these algorithms, the number of output
dimensions can be determined adaptively by thresholding the singular values of
the input data matrix... | [
{
"created": "Sun, 11 Dec 2016 21:15:05 GMT",
"version": "v1"
}
] | 2017-03-21 | [
[
"Chen",
"Yuansi",
""
],
[
"Pehlevan",
"Cengiz",
""
],
[
"Chklovskii",
"Dmitri B.",
""
]
] | Recently, a novel family of biologically plausible online algorithms for reducing the dimensionality of streaming data has been derived from the similarity matching principle. In these algorithms, the number of output dimensions can be determined adaptively by thresholding the singular values of the input data matrix. ... |
1706.04159 | Peter O'Connor | Peter O'Connor, Efstratios Gavves, Max Welling | Temporally Efficient Deep Learning with Spikes | 8 pages + references and appendix | null | null | null | cs.NE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The vast majority of natural sensory data is temporally redundant. Video
frames or audio samples which are sampled at nearby points in time tend to have
similar values. Typically, deep learning algorithms take no advantage of this
redundancy to reduce computation. This can be an obscene waste of energy. We
present a ... | [
{
"created": "Tue, 13 Jun 2017 16:56:27 GMT",
"version": "v1"
}
] | 2017-06-14 | [
[
"O'Connor",
"Peter",
""
],
[
"Gavves",
"Efstratios",
""
],
[
"Welling",
"Max",
""
]
] | The vast majority of natural sensory data is temporally redundant. Video frames or audio samples which are sampled at nearby points in time tend to have similar values. Typically, deep learning algorithms take no advantage of this redundancy to reduce computation. This can be an obscene waste of energy. We present a va... |
2012.04731 | Sena Kiciroglu | Sena Kiciroglu, Wei Wang, Mathieu Salzmann, Pascal Fua | Long Term Motion Prediction Using Keyposes | Presented at 3DV 2022. Project website:
https://senakicir.github.io/projects/keyposes | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Long term human motion prediction is essential in safety-critical
applications such as human-robot interaction and autonomous driving. In this
paper we show that to achieve long term forecasting, predicting human pose at
every time instant is unnecessary. Instead, it is more effective to predict a
few keyposes and ap... | [
{
"created": "Tue, 8 Dec 2020 20:45:51 GMT",
"version": "v1"
},
{
"created": "Wed, 2 Jun 2021 14:35:08 GMT",
"version": "v2"
},
{
"created": "Wed, 1 Dec 2021 16:16:12 GMT",
"version": "v3"
},
{
"created": "Fri, 2 Sep 2022 14:15:05 GMT",
"version": "v4"
}
] | 2022-09-05 | [
[
"Kiciroglu",
"Sena",
""
],
[
"Wang",
"Wei",
""
],
[
"Salzmann",
"Mathieu",
""
],
[
"Fua",
"Pascal",
""
]
] | Long term human motion prediction is essential in safety-critical applications such as human-robot interaction and autonomous driving. In this paper we show that to achieve long term forecasting, predicting human pose at every time instant is unnecessary. Instead, it is more effective to predict a few keyposes and appr... |
2309.06112 | Sharath Srivatsa | Sharath Srivatsa, Srinath Srinivasa | Characterizing Latent Perspectives of Media Houses Towards Public
Figures | null | null | null | null | cs.CL cs.IR | http://creativecommons.org/licenses/by/4.0/ | Media houses reporting on public figures, often come with their own biases
stemming from their respective worldviews. A characterization of these
underlying patterns helps us in better understanding and interpreting news
stories. For this, we need diverse or subjective summarizations, which may not
be amenable for cl... | [
{
"created": "Tue, 12 Sep 2023 10:27:39 GMT",
"version": "v1"
}
] | 2023-09-13 | [
[
"Srivatsa",
"Sharath",
""
],
[
"Srinivasa",
"Srinath",
""
]
] | Media houses reporting on public figures, often come with their own biases stemming from their respective worldviews. A characterization of these underlying patterns helps us in better understanding and interpreting news stories. For this, we need diverse or subjective summarizations, which may not be amenable for clas... |
1910.13911 | Angel Martinez | Angel Mart\'inez-Gonz\'alez, Michael Villamizar, Olivier Can\'evet and
Jean-Marc Odobez | Real-time Convolutional Networks for Depth-based Human Pose Estimation | Published in IROS 2018 | 2018 IEEE International Conference on Intelligent Robots and
Systems, Madrid, Spain, | 10.1109/IROS.2018.8593383 | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We propose to combine recent Convolutional Neural Networks (CNN) models with
depth imaging to obtain a reliable and fast multi-person pose estimation
algorithm applicable to Human Robot Interaction (HRI) scenarios. Our hypothesis
is that depth images contain less structures and are easier to process than RGB
images w... | [
{
"created": "Wed, 30 Oct 2019 14:52:46 GMT",
"version": "v1"
}
] | 2019-10-31 | [
[
"Martínez-González",
"Angel",
""
],
[
"Villamizar",
"Michael",
""
],
[
"Canévet",
"Olivier",
""
],
[
"Odobez",
"Jean-Marc",
""
]
] | We propose to combine recent Convolutional Neural Networks (CNN) models with depth imaging to obtain a reliable and fast multi-person pose estimation algorithm applicable to Human Robot Interaction (HRI) scenarios. Our hypothesis is that depth images contain less structures and are easier to process than RGB images whi... |
1912.03771 | Anton Osokin | Irina Saparina and Anton Osokin | Cost-Sensitive Training for Autoregressive Models | null | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Training autoregressive models to better predict under the test metric,
instead of maximizing the likelihood, has been reported to be beneficial in
several use cases but brings additional complications, which prevent wider
adoption. In this paper, we follow the learning-to-search approach (Daum\'e III
et al., 2009; L... | [
{
"created": "Sun, 8 Dec 2019 21:57:56 GMT",
"version": "v1"
}
] | 2019-12-10 | [
[
"Saparina",
"Irina",
""
],
[
"Osokin",
"Anton",
""
]
] | Training autoregressive models to better predict under the test metric, instead of maximizing the likelihood, has been reported to be beneficial in several use cases but brings additional complications, which prevent wider adoption. In this paper, we follow the learning-to-search approach (Daum\'e III et al., 2009; Leb... |
2010.01845 | Francisco Ruiz | Francisco J. R. Ruiz, Michalis K. Titsias, Taylan Cemgil, Arnaud
Doucet | Unbiased Gradient Estimation for Variational Auto-Encoders using Coupled
Markov Chains | null | Conference on Uncertainty in Artificial Intelligence (UAI, 2021) | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The variational auto-encoder (VAE) is a deep latent variable model that has
two neural networks in an autoencoder-like architecture; one of them
parameterizes the model's likelihood. Fitting its parameters via maximum
likelihood (ML) is challenging since the computation of the marginal likelihood
involves an intracta... | [
{
"created": "Mon, 5 Oct 2020 08:11:55 GMT",
"version": "v1"
},
{
"created": "Wed, 2 Jun 2021 15:37:29 GMT",
"version": "v2"
}
] | 2021-06-03 | [
[
"Ruiz",
"Francisco J. R.",
""
],
[
"Titsias",
"Michalis K.",
""
],
[
"Cemgil",
"Taylan",
""
],
[
"Doucet",
"Arnaud",
""
]
] | The variational auto-encoder (VAE) is a deep latent variable model that has two neural networks in an autoencoder-like architecture; one of them parameterizes the model's likelihood. Fitting its parameters via maximum likelihood (ML) is challenging since the computation of the marginal likelihood involves an intractabl... |
2202.12660 | Birgitta Dresp-Langley | Birgitta Dresp-Langley | From Biological Synapses to Intelligent Robots | null | Electronics, 2022, 11(5), 707 | 10.3390/electronics11050707 | null | cs.RO cs.NE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This review explores biologically inspired learning as a model for
intelligent robot control and sensing technology on the basis of specific
examples. Hebbian synaptic learning is discussed as a functionally relevant
model for machine learning and intelligence, as explained on the basis of
examples from the highly pl... | [
{
"created": "Fri, 25 Feb 2022 12:39:22 GMT",
"version": "v1"
}
] | 2022-02-28 | [
[
"Dresp-Langley",
"Birgitta",
""
]
] | This review explores biologically inspired learning as a model for intelligent robot control and sensing technology on the basis of specific examples. Hebbian synaptic learning is discussed as a functionally relevant model for machine learning and intelligence, as explained on the basis of examples from the highly plas... |
2406.02974 | Xinying Qiu | Jingshen Zhang, Xinglu Chen, Xinying Qiu, Zhimin Wang, Wenhe Feng | Readability-guided Idiom-aware Sentence Simplification (RISS) for
Chinese | Accepted to the 23rd China National Conference on Computational
Linguistics (CCL 2024) | null | null | null | cs.CL | http://creativecommons.org/licenses/by-nc-sa/4.0/ | Chinese sentence simplification faces challenges due to the lack of
large-scale labeled parallel corpora and the prevalence of idioms. To address
these challenges, we propose Readability-guided Idiom-aware Sentence
Simplification (RISS), a novel framework that combines data augmentation
techniques with lexcial simpli... | [
{
"created": "Wed, 5 Jun 2024 06:15:48 GMT",
"version": "v1"
}
] | 2024-06-06 | [
[
"Zhang",
"Jingshen",
""
],
[
"Chen",
"Xinglu",
""
],
[
"Qiu",
"Xinying",
""
],
[
"Wang",
"Zhimin",
""
],
[
"Feng",
"Wenhe",
""
]
] | Chinese sentence simplification faces challenges due to the lack of large-scale labeled parallel corpora and the prevalence of idioms. To address these challenges, we propose Readability-guided Idiom-aware Sentence Simplification (RISS), a novel framework that combines data augmentation techniques with lexcial simplifi... |
2110.00908 | Li Yang | Li Yang, Sen Lin, Junshan Zhang, Deliang Fan | GROWN: GRow Only When Necessary for Continual Learning | 8 pages. arXiv admin note: text overlap with arXiv:2007.07617 by
other authors | null | null | null | cs.LG cs.CV | http://creativecommons.org/licenses/by/4.0/ | Catastrophic forgetting is a notorious issue in deep learning, referring to
the fact that Deep Neural Networks (DNN) could forget the knowledge about
earlier tasks when learning new tasks. To address this issue, continual
learning has been developed to learn new tasks sequentially and perform
knowledge transfer from ... | [
{
"created": "Sun, 3 Oct 2021 02:31:04 GMT",
"version": "v1"
}
] | 2021-10-05 | [
[
"Yang",
"Li",
""
],
[
"Lin",
"Sen",
""
],
[
"Zhang",
"Junshan",
""
],
[
"Fan",
"Deliang",
""
]
] | Catastrophic forgetting is a notorious issue in deep learning, referring to the fact that Deep Neural Networks (DNN) could forget the knowledge about earlier tasks when learning new tasks. To address this issue, continual learning has been developed to learn new tasks sequentially and perform knowledge transfer from th... |
1911.12125 | Zhenyu Weng | Zhenyu Weng, Yuesheng Zhu | Online Hashing with Efficient Updating of Binary Codes | 9 pages, accepted by AAAI2020 | null | null | null | cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Online hashing methods are efficient in learning the hash functions from the
streaming data. However, when the hash functions change, the binary codes for
the database have to be recomputed to guarantee the retrieval accuracy.
Recomputing the binary codes by accumulating the whole database brings a
timeliness challen... | [
{
"created": "Mon, 25 Nov 2019 03:03:48 GMT",
"version": "v1"
},
{
"created": "Wed, 4 Dec 2019 03:49:31 GMT",
"version": "v2"
}
] | 2019-12-05 | [
[
"Weng",
"Zhenyu",
""
],
[
"Zhu",
"Yuesheng",
""
]
] | Online hashing methods are efficient in learning the hash functions from the streaming data. However, when the hash functions change, the binary codes for the database have to be recomputed to guarantee the retrieval accuracy. Recomputing the binary codes by accumulating the whole database brings a timeliness challenge... |
2407.08447 | Jon\'a\v{s} Kulh\'anek | Jonas Kulhanek, Songyou Peng, Zuzana Kukelova, Marc Pollefeys, Torsten
Sattler | WildGaussians: 3D Gaussian Splatting in the Wild | https://wild-gaussians.github.io/ | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | While the field of 3D scene reconstruction is dominated by NeRFs due to their
photorealistic quality, 3D Gaussian Splatting (3DGS) has recently emerged,
offering similar quality with real-time rendering speeds. However, both methods
primarily excel with well-controlled 3D scenes, while in-the-wild data -
characterize... | [
{
"created": "Thu, 11 Jul 2024 12:41:32 GMT",
"version": "v1"
}
] | 2024-07-12 | [
[
"Kulhanek",
"Jonas",
""
],
[
"Peng",
"Songyou",
""
],
[
"Kukelova",
"Zuzana",
""
],
[
"Pollefeys",
"Marc",
""
],
[
"Sattler",
"Torsten",
""
]
] | While the field of 3D scene reconstruction is dominated by NeRFs due to their photorealistic quality, 3D Gaussian Splatting (3DGS) has recently emerged, offering similar quality with real-time rendering speeds. However, both methods primarily excel with well-controlled 3D scenes, while in-the-wild data - characterized ... |
1710.01409 | Dario Paccagnan | Vinod Ramaswamy, Dario Paccagnan, Jason R. Marden | Multiagent Maximum Coverage Problems: The Trade-off Between Anarchy and
Stability | 14 pages, 4 figures | null | null | null | cs.GT cs.MA cs.SY math.CO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The price of anarchy and price of stability are three well-studied
performance metrics that seek to characterize the inefficiency of equilibria in
distributed systems. The distinction between these two performance metrics
centers on the equilibria that they focus on: the price of anarchy
characterizes the quality of ... | [
{
"created": "Tue, 3 Oct 2017 22:38:51 GMT",
"version": "v1"
},
{
"created": "Thu, 26 Jul 2018 14:48:21 GMT",
"version": "v2"
},
{
"created": "Sat, 14 Mar 2020 18:57:29 GMT",
"version": "v3"
}
] | 2020-03-17 | [
[
"Ramaswamy",
"Vinod",
""
],
[
"Paccagnan",
"Dario",
""
],
[
"Marden",
"Jason R.",
""
]
] | The price of anarchy and price of stability are three well-studied performance metrics that seek to characterize the inefficiency of equilibria in distributed systems. The distinction between these two performance metrics centers on the equilibria that they focus on: the price of anarchy characterizes the quality of th... |
2306.06935 | Xin-Cheng Wen | Xin-Cheng Wen, Cuiyun Gao, Feng Luo, Haoyu Wang, Ge Li, and Qing Liao | LIVABLE: Exploring Long-Tailed Classification of Software Vulnerability
Types | null | null | null | null | cs.SE cs.AI | http://creativecommons.org/licenses/by/4.0/ | Prior studies generally focus on software vulnerability detection and have
demonstrated the effectiveness of Graph Neural Network (GNN)-based approaches
for the task. Considering the various types of software vulnerabilities and the
associated different degrees of severity, it is also beneficial to determine
the type... | [
{
"created": "Mon, 12 Jun 2023 08:14:16 GMT",
"version": "v1"
}
] | 2023-06-13 | [
[
"Wen",
"Xin-Cheng",
""
],
[
"Gao",
"Cuiyun",
""
],
[
"Luo",
"Feng",
""
],
[
"Wang",
"Haoyu",
""
],
[
"Li",
"Ge",
""
],
[
"Liao",
"Qing",
""
]
] | Prior studies generally focus on software vulnerability detection and have demonstrated the effectiveness of Graph Neural Network (GNN)-based approaches for the task. Considering the various types of software vulnerabilities and the associated different degrees of severity, it is also beneficial to determine the type o... |
1904.04940 | Maria Bampa | Maria Bampa | Handling temporality of clinical events with application to Adverse Drug
Event detection in Electronic Health Records: A scoping review | 4 pages, 1 figure | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The increased adoption of Electronic Health Records(EHRs) has brought changes
to the way the patient care is carried out. The rich heterogeneous and temporal
data space stored in EHRs can be leveraged by machine learning models to
capture the underlying information and make clinically relevant predictions.
This can b... | [
{
"created": "Tue, 9 Apr 2019 22:46:20 GMT",
"version": "v1"
}
] | 2019-04-11 | [
[
"Bampa",
"Maria",
""
]
] | The increased adoption of Electronic Health Records(EHRs) has brought changes to the way the patient care is carried out. The rich heterogeneous and temporal data space stored in EHRs can be leveraged by machine learning models to capture the underlying information and make clinically relevant predictions. This can be ... |
1605.03203 | Chaitanya Swamy | Andre Linhares and Chaitanya Swamy | Approximating Min-Cost Chain-Constrained Spanning Trees: A Reduction
from Weighted to Unweighted Problems | null | null | null | null | cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We study the {\em min-cost chain-constrained spanning-tree} (abbreviated
\mcst) problem: find a min-cost spanning tree in a graph subject to degree
constraints on a nested family of node sets. We devise the {\em first} polytime
algorithm that finds a spanning tree that (i) violates the degree constraints
by at most a... | [
{
"created": "Tue, 10 May 2016 20:30:50 GMT",
"version": "v1"
}
] | 2016-05-12 | [
[
"Linhares",
"Andre",
""
],
[
"Swamy",
"Chaitanya",
""
]
] | We study the {\em min-cost chain-constrained spanning-tree} (abbreviated \mcst) problem: find a min-cost spanning tree in a graph subject to degree constraints on a nested family of node sets. We devise the {\em first} polytime algorithm that finds a spanning tree that (i) violates the degree constraints by at most a c... |
1912.11838 | Ming-Min Zhao | Ming-Min Zhao, Qingjiang Shi, and Min-Jian Zhao | Efficiency Maximization for UAV-Enabled Mobile Relaying Systems with
Laser Charging | 33 pages, 8 figures, accepted for publication in IEEE Transactions on
Wireless Communications | IEEE Transactions on Wireless Communications, vol. 19, no. 5, pp.
3257-3272, May 2020 | 10.1109/TWC.2020.2971987 | null | cs.IT eess.SP math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This work studies the joint problem of power and trajectory optimization in
an unmanned aerial vehicle (UAV)-enabled mobile relaying system. In the
considered system, in order to provide convenient and sustainable energy supply
to the UAV relay, we consider the deployment of a power beacon (PB) which can
wirelessly c... | [
{
"created": "Thu, 26 Dec 2019 11:13:27 GMT",
"version": "v1"
},
{
"created": "Tue, 11 Feb 2020 03:12:06 GMT",
"version": "v2"
}
] | 2022-10-17 | [
[
"Zhao",
"Ming-Min",
""
],
[
"Shi",
"Qingjiang",
""
],
[
"Zhao",
"Min-Jian",
""
]
] | This work studies the joint problem of power and trajectory optimization in an unmanned aerial vehicle (UAV)-enabled mobile relaying system. In the considered system, in order to provide convenient and sustainable energy supply to the UAV relay, we consider the deployment of a power beacon (PB) which can wirelessly cha... |
2309.16588 | Timoth\'ee Darcet | Timoth\'ee Darcet, Maxime Oquab, Julien Mairal and Piotr Bojanowski | Vision Transformers Need Registers | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Transformers have recently emerged as a powerful tool for learning visual
representations. In this paper, we identify and characterize artifacts in
feature maps of both supervised and self-supervised ViT networks. The artifacts
correspond to high-norm tokens appearing during inference primarily in
low-informative bac... | [
{
"created": "Thu, 28 Sep 2023 16:45:46 GMT",
"version": "v1"
},
{
"created": "Fri, 12 Apr 2024 09:38:33 GMT",
"version": "v2"
}
] | 2024-04-15 | [
[
"Darcet",
"Timothée",
""
],
[
"Oquab",
"Maxime",
""
],
[
"Mairal",
"Julien",
""
],
[
"Bojanowski",
"Piotr",
""
]
] | Transformers have recently emerged as a powerful tool for learning visual representations. In this paper, we identify and characterize artifacts in feature maps of both supervised and self-supervised ViT networks. The artifacts correspond to high-norm tokens appearing during inference primarily in low-informative backg... |
2103.00991 | Pratik Mazumder | Pratik Mazumder, Pravendra Singh, Piyush Rai | Few-Shot Lifelong Learning | Accepted in AAAI2021 | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Many real-world classification problems often have classes with very few
labeled training samples. Moreover, all possible classes may not be initially
available for training, and may be given incrementally. Deep learning models
need to deal with this two-fold problem in order to perform well in real-life
situations. ... | [
{
"created": "Mon, 1 Mar 2021 13:26:57 GMT",
"version": "v1"
}
] | 2021-03-02 | [
[
"Mazumder",
"Pratik",
""
],
[
"Singh",
"Pravendra",
""
],
[
"Rai",
"Piyush",
""
]
] | Many real-world classification problems often have classes with very few labeled training samples. Moreover, all possible classes may not be initially available for training, and may be given incrementally. Deep learning models need to deal with this two-fold problem in order to perform well in real-life situations. In... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.