Search Results for author:
Found 67 papers, 9 papers with code
Naive Markowitz Policies
We study a continuous-time Markowitz mean-variance portfolio selection model in which a naive agent, unaware of the underlying time-inconsistency, continuously reoptimizes over time.
FedRule: Federated Rule Recommendation System with Graph Neural Networks
Much of the value that IoT (Internet-of-Things) devices bring to ``smart'' homes lies in their ability to automatically trigger other devices' actions: for example, a smart camera triggering a smart lock to unlock a door.
Sequential Attention for Feature Selection
Feature selection is the problem of selecting a subset of features for a machine learning model that maximizes model quality subject to a resource budget constraint.
Audit and Improve Robustness of Private Neural Networks on Encrypted Data
(ii) How to design a robust PNet given the encrypted input without decryption?
GATraj: A Graph- and Attention-based Multi-Agent Trajectory Prediction Model
Our model achieves performance on par with the state-of-the-art models at a much higher prediction speed tested on multiple open datasets.
Deliberated Domain Bridging for Domain Adaptive Semantic Segmentation
In this work, we resort to data mixing to establish a deliberated domain bridging (DDB) for DASS, through which the joint distributions of source and target domains are aligned and interacted with each in the intermediate space.
Ranked #1 on
Domain Adaptation
on GTAV to Cityscapes+Mapillary
Wideband Channel Estimation for mmWave MIMO Systems with Beam Squint
With the scale of antenna arrays and the bandwidth increasing, many existing narrowband channel estimation methods ignoring the effect of beam squint may face severe performance degradation in wideband millimeter-wave (mmWave) communication systems.
Collaboration in Participant-Centric Federated Learning: A Game-Theoretical Perspective
To coordinate the selfish and heterogeneous participants, we propose a novel analytic framework for incentivizing effective and efficient collaborations for participant-centric FL.
Package Theft Detection from Smart Home Security Cameras
Package theft detection has been a challenging task mainly due to lack of training data and a wide variety of package theft cases in reality.
Learning 3D Semantics from Pose-Noisy 2D Images with Hierarchical Full Attention Network
This motivates us to conduct a "task transfer" paradigm so that 3D semantic segmentation benefits from aggregating 2D semantic cues, albeit pose noises are contained in 2D image observations.
Reusing the Task-specific Classifier as a Discriminator: Discriminator-free Adversarial Domain Adaptation
Such NWD can be coupled with the classifier to serve as a discriminator satisfying the K-Lipschitz constraint without the requirements of additional weight clipping or gradient penalty strategy.
Ranked #1 on
Domain Adaptation
on ImageCLEF-DA
Youling: an AI-Assisted Lyrics Creation System
In the lyrics generation process, \textit{Youling} supports traditional one pass full-text generation mode as well as an interactive generation mode, which allows users to select the satisfactory sentences from generated candidates conditioned on preceding context.
Community detection and portfolio optimization
Community detection methods can be used to explore the structure of complex systems.
Portfolio optimization with idiosyncratic and systemic risks for financial networks
The two risks are measured by the idiosyncratic variance and the network clustering coefficient derived from the asset correlation networks, respectively.
Adaptive Distillation: Aggregating Knowledge from Multiple Paths for Efficient Distillation
Despite this advancement in different techniques for distilling the knowledge, the aggregation of different paths for distillation has not been studied comprehensively.
Ranked #17 on
Knowledge Distillation
on ImageNet
Spectral Multiplicity Entails Sample-wise Multiple Descent
Moreover, we theoretically show that the ridge estimator with optimal regularization can result in a monotone generalization risk curve and thereby eliminate multiple descent under some assumptions.
Feature Cross Search via Submodular Optimization
First, we show that it is not possible to provide an $n^{1/\log\log n}$-approximation algorithm for this problem unless the exponential time hypothesis fails.
When Few-Shot Learning Meets Video Object Detection
We employ a transfer-learning framework to effectively train the video object detector on a large number of base-class objects and a few video clips of novel-class objects.
Infinite-Horizon Offline Reinforcement Learning with Linear Function Approximation: Curse of Dimensionality and Algorithm
In this regime, for any $q\in[\gamma^{2}, 1]$, we can construct a hard instance such that the smallest eigenvalue of its feature covariance matrix is $q/d$ and it requires $\Omega\left(\frac{d}{\gamma^{2}\left(q-\gamma^{2}\right)\varepsilon^{2}}\exp\left(\Theta\left(d\gamma^{2}\right)\right)\right)$ samples to approximate the value function up to an additive error $\varepsilon$.
Measuring Discrimination to Boost Comparative Testing for Multiple Deep Learning Models
To tackle this problem, we propose Sample Discrimination based Selection (SDS) to select efficient samples that could discriminate multiple models, i. e., the prediction behaviors (right/wrong) of these samples would be helpful to indicate the trend of model performance.
Bending the Bruhat-Tits Tree I:Tensor Network and Emergent Einstein Equations
In fact we demonstrate that a unique (up to normalizations) emergent graph Einstein equation is satisfied by the geometric data encoded in the tensor network, and the graph Einstein tensor automatically recovers the known proposal in the mathematics literature, at least perturbatively order by order in the deformation away from the pure Bruhat-Tits Tree geometry dual to pure CFTs.
High Energy Physics - Theory Strongly Correlated Electrons General Relativity and Quantum Cosmology Mathematical Physics Mathematical Physics Quantum Physics
Emergent Einstein Equation in p-adic CFT Tensor Networks
We take the tensor network describing explicit p-adic CFT partition functions proposed in [1], and considered boundary conditions of the network describing a deformed Bruhat-Tits (BT) tree geometry.
Tensor Networks
High Energy Physics - Theory
Strongly Correlated Electrons
General Relativity and Quantum Cosmology
Mathematical Physics
Mathematical Physics
Quantum Physics
Bending the Bruhat-Tits Tree II: the p-adic BTZ Black hole and Local Diffeomorphism on the Bruhat-Tits Tree
In this sequel to [1], we take up a second approach in bending the Bruhat-Tits tree.
High Energy Physics - Theory Strongly Correlated Electrons General Relativity and Quantum Cosmology Mathematical Physics Mathematical Physics Quantum Physics
Genuine entanglement, distillability and quantum information masking under noise
Genuineness and distillability of entanglement play a key role in quantum information tasks, and they are easily disturbed by the noise.
Quantum Physics
EDSC: An Event-Driven Smart Contract Platform
This paper presents EDSC, a novel smart contract platform design based on the event-driven execution model as opposed to the traditionally employed transaction-driven execution model.
Distributed, Parallel, and Cluster Computing
DAIL: Dataset-Aware and Invariant Learning for Face Recognition
To solve the first issue of identity overlapping, we propose a dataset-aware loss for multi-dataset training by reducing the penalty when the same person appears in multiple datasets.
Sequential Resource Access: Theory and Algorithm
We formulate and analyze a generic sequential resource access problem arising in a variety of engineering fields, where a user disposes a number of heterogeneous computing, communication, or storage resources, each characterized by the probability of successfully executing the user's task and the related access delay and cost, and seeks an optimal access strategy to maximize her utility within a given time horizon, defined as the expected reward minus the access cost.
Networking and Internet Architecture
Deep Neural Tangent Kernel and Laplace Kernel Have the Same RKHS
We prove that the reproducing kernel Hilbert spaces (RKHS) of a deep neural tangent kernel and the Laplace kernel include the same set of functions, when both kernels are restricted to the sphere $\mathbb{S}^{d-1}$.
Region Comparison Network for Interpretable Few-shot Image Classification
For that, in this work, we propose a metric learning based method named Region Comparison Network (RCN), which is able to reveal how few-shot learning works as in a neural network as well as to find out specific regions that are related to each other in images coming from the query and support sets.
Ranked #32 on
Few-Shot Image Classification
on CIFAR-FS 5-way (5-shot)
Multiple Descent: Design Your Own Generalization Curve
This paper explores the generalization loss of linear regression in variably parameterized families of models, both under-parameterized and over-parameterized.
Joint Multi-User DNN Partitioning and Computational Resource Allocation for Collaborative Edge Intelligence
With the assistance of edge servers, user equipments (UEs) are able to run deep neural network (DNN) based AI applications, which are generally resource-hungry and compute-intensive, such that an individual UE can hardly afford by itself in real time.
Towards Cross-Granularity Few-Shot Learning: Coarse-to-Fine Pseudo-Labeling with Visual-Semantic Meta-Embedding
Few-shot learning aims at rapidly adapting to novel categories with only a handful of samples at test time, which has been predominantly tackled with the idea of meta-learning.
Meta Learning in the Continuous Time Limit
In this paper, we establish the ordinary differential equation (ODE) that underlies the training dynamics of Model-Agnostic Meta-Learning (MAML).
Hybrid Cryptocurrency Pump and Dump Detection
In this paper, we propose a novel hybrid pump and dump detection method based on distance and density metrics.
The Curious Case of Adversarially Robust Models: More Data Can Help, Double Descend, or Hurt Generalization
In the medium adversary regime, with more training data, the generalization loss exhibits a double descent curve, which implies the existence of an intermediate stage where more training data hurts the generalization.
Deep Fusion of Local and Non-Local Features for Precision Landslide Recognition
The second uses a scale attention mechanism to guide the up-sampling of features from the coarse level by a learned weight map.
More Data Can Expand the Generalization Gap Between Adversarially Robust and Standard Models
Despite remarkable success in practice, modern machine learning models have been found to be susceptible to adversarial attacks that make human-imperceptible perturbations to the data, but result in serious and potentially dangerous prediction errors.
An Adaptive and Fast Convergent Approach to Differentially Private Deep Learning
ADADP significantly reduces the privacy cost by improving the convergence speed with an adaptive learning rate and mitigates the negative effect of differential privacy upon the model accuracy by introducing adaptive noise.
TransMatch: A Transfer-Learning Scheme for Semi-Supervised Few-Shot Learning
Under the proposed framework, we develop a novel method for semi-supervised few-shot learning called TransMatch by instantiating the three components with Imprinting and MixMatch.
Open-Ended Visual Question Answering by Multi-Modal Domain Adaptation
A straightforward solution is to fine-tune a pre-trained source model by using those limited labeled target data, but it usually cannot work well due to the considerable difference between the data distributions of the source and target domains.
Online Continuous Submodular Maximization: From Full-Information to Bandit Feedback
In this paper, we propose three online algorithms for submodular maximisation.
Locality-Sensitive Hashing for f-Divergences: Mutual Information Loss and Beyond
In this paper, we aim to develop LSH schemes for distance functions that measure the distance between two probability distributions, particularly for f-divergences as well as a generalization to capture mutual information loss.
Minimax Regret of Switching-Constrained Online Convex Optimization: No Phase Transition
To establish the dimension-independent upper bound, we next show that a mini-batching algorithm provides an $ O(\frac{T}{\sqrt{K}}) $ upper bound, and therefore conclude that the minimax regret of switching-constrained OCO is $ \Theta(\frac{T}{\sqrt{K}}) $ for any $K$.
Generative Imaging and Image Processing via Generative Encoder
This paper introduces a novel generative encoder (GE) model for generative imaging and image processing with applications in compressed sensing and imaging, image compression, denoising, inpainting, deblurring, and super-resolution.
Known-class Aware Self-ensemble for Open Set Domain Adaptation
Particularly, in open set domain adaptation, we allow the classes from the source and target domains to be partially overlapped.
Categorical Feature Compression via Submodular Optimization
To achieve this, we introduce a novel re-parametrization of the mutual information objective, which we prove is submodular, and design a data structure to query the submodular function in amortized $O(\log n )$ time (where $n$ is the input vocabulary size).
WIDER Face and Pedestrian Challenge 2018: Methods and Results
This paper presents a review of the 2018 WIDER Challenge on Face and Pedestrian.
Quantized Frank-Wolfe: Faster Optimization, Lower Communication, and Projection Free
How can we efficiently mitigate the overhead of gradient communications in distributed optimization?
Black Box Submodular Maximization: Discrete and Continuous Settings
In this paper, we consider the problem of black box continuous submodular maximization where we only have access to the function values and no information about the derivatives is provided.
Unconstrained Submodular Maximization with Constant Adaptive Complexity
In this paper, we consider the unconstrained submodular maximization problem.
Election with Bribed Voter Uncertainty: Hardness and Approximation Algorithm
In this paper, we introduce a novel variant of the bribery problem, "Election with Bribed Voter Uncertainty" or BVU for short, accommodating the uncertainty that the vote of a bribed voter may or may not be counted.
Projection-Free Bandit Convex Optimization
In this paper, we propose the first computationally efficient projection-free algorithm for bandit convex optimization (BCO).
Projection-Free Online Optimization with Stochastic Gradient: From Convexity to Submodularity
We also propose One-Shot Frank-Wolfe, a simpler algorithm which requires only a single stochastic gradient estimate in each round and achieves an $O(T^{2/3})$ stochastic regret bound for convex and continuous submodular optimization.
Comparison Based Learning from Weak Oracles
More specifically, we aim at devising efficient algorithms to locate a target object in a database equipped with a dissimilarity metric via invocation of the weak comparison oracle.
Online Continuous Submodular Maximization
For such settings, we then propose an online stochastic gradient ascent algorithm that also achieves a regret bound of $O(\sqrt{T})$ regret, albeit against a weaker $1/2$-approximation to the best feasible solution in hindsight.
Interactive Submodular Bandit
We then receive a noisy feedback about the utility of the action (e. g., ratings) which we model as a submodular function over the context-action space.
Weakly Submodular Maximization Beyond Cardinality Constraints: Does Randomization Help Greedy?
In this paper, we prove that a randomized version of the greedy algorithm (previously used by Buchbinder et al. (2014) for a different problem) achieves an approximation ratio of $(1 + 1/\gamma)^{-2}$ for the maximization of a weakly submodular function subject to a general matroid constraint, where $\gamma$ is a parameter measuring the distance of the function from submodularity.
Estimating the Size of a Large Network and its Communities from a Random Sample
In this paper we consider a population random graph G = (V;E) from the stochastic block model (SBM) with K communities/blocks.
Submodular Variational Inference for Network Reconstruction
In real-world and online social networks, individuals receive and transmit information in real time.
Near-Optimal Active Learning of Halfspaces via Query Synthesis in the Noisy Setting
This problem has recently gained a lot of interest in automated science and adversarial reverse engineering for which only heuristic algorithms are known.
Seeing the Unseen Network: Inferring Hidden Social Ties from Respondent-Driven Sampling
Learning about the social structure of hidden and hard-to-reach populations --- such as drug users and sex workers --- is a major goal of epidemiological and public health research on risk behaviors and disease prevention.
Recognizing RGB Images by Learning from RGB-D Data
In this work, we propose a new framework for recognizing RGB images captured by the conventional cameras by leveraging a set of labeled RGB-D data, in which the depth features can be additionally extracted from the depth images.
Predicting Multiple Attributes via Relative Multi-task Learning
Relative attributes learning aims to learn ranking functions describing the relative strength of attributes.
Event Recognition in Videos by Learning from Heterogeneous Web Sources
In this work, we propose to leverage a large number of loosely labeled web videos (e. g., from YouTube) and web images (e. g., from Google/Bing image search) for visual event recognition in consumer videos without requiring any labeled consumer videos.
